Filter code relicensing to MIT license

[lttng-ust.git] / liblttng-ust / lttng-filter-validator.c

diff --git a/liblttng-ust/lttng-filter-validator.c b/liblttng-ust/lttng-filter-validator.c
index dc50774de5b6deb6c20efdcd9c7f3cc905b3bb07..75cd98a5d134fe05b00ec432d8e559785e0b892e 100644 (file)
--- a/liblttng-ust/lttng-filter-validator.c
+++ b/liblttng-ust/lttng-filter-validator.c
@@ -3,21 +3,25 @@
  *
  * LTTng UST filter bytecode validator.
  *
- * Copyright (C) 2010-2012 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
+ * Copyright (C) 2010-2016 Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
  *
- * This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; only
- * version 2.1 of the License.
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
  *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
  *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ * SOFTWARE.
  */
 
 #define _LGPL_SOURCE
@@ -87,7 +91,7 @@ int merge_point_add_check(struct cds_lfht *ht, unsigned long target_pc,
                const struct vstack *stack)
 {
        struct lfht_mp_node *node;
-       unsigned long hash = lttng_hash_mix((const void *) target_pc,
+       unsigned long hash = lttng_hash_mix((const char *) target_pc,
                                sizeof(target_pc),
                                lttng_hash_seed);
        struct cds_lfht_node *ret;
@@ -100,7 +104,7 @@ int merge_point_add_check(struct cds_lfht *ht, unsigned long target_pc,
        node->target_pc = target_pc;
        memcpy(&node->stack, stack, sizeof(node->stack));
        ret = cds_lfht_add_unique(ht, hash, lttng_hash_match,
-               (const void *) target_pc, &node->node);
+               (const char *) target_pc, &node->node);
        if (ret != &node->node) {
                struct lfht_mp_node *ret_mp =
                        caa_container_of(ret, struct lfht_mp_node, node);
@@ -189,7 +193,7 @@ error_type:
  */
 static
 int bytecode_validate_overflow(struct bytecode_runtime *bytecode,
-               void *start_pc, void *pc)
+               char *start_pc, char *pc)
 {
        int ret = 0;
 
@@ -409,8 +413,8 @@ unsigned long delete_all_nodes(struct cds_lfht *ht)
 static
 int validate_instruction_context(struct bytecode_runtime *bytecode,
                struct vstack *stack,
-               void *start_pc,
-               void *pc)
+               char *start_pc,
+               char *pc)
 {
        int ret = 0;
 
@@ -829,8 +833,8 @@ static
 int validate_instruction_all_contexts(struct bytecode_runtime *bytecode,
                struct cds_lfht *merge_points,
                struct vstack *stack,
-               void *start_pc,
-               void *pc)
+               char *start_pc,
+               char *pc)
 {
        int ret;
        unsigned long target_pc = pc - start_pc;
@@ -845,10 +849,10 @@ int validate_instruction_all_contexts(struct bytecode_runtime *bytecode,
                return ret;
 
        /* Validate merge points */
-       hash = lttng_hash_mix((const void *) target_pc, sizeof(target_pc),
+       hash = lttng_hash_mix((const char *) target_pc, sizeof(target_pc),
                        lttng_hash_seed);
        cds_lfht_lookup(merge_points, hash, lttng_hash_match,
-                       (const void *) target_pc, &iter);
+                       (const char *) target_pc, &iter);
        node = cds_lfht_iter_get_node(&iter);
        if (node) {
                mp_node = caa_container_of(node, struct lfht_mp_node, node);
@@ -879,11 +883,11 @@ static
 int exec_insn(struct bytecode_runtime *bytecode,
                struct cds_lfht *merge_points,
                struct vstack *stack,
-               void **_next_pc,
-               void *pc)
+               char **_next_pc,
+               char *pc)
 {
        int ret = 1;
-       void *next_pc = *_next_pc;
+       char *next_pc = *_next_pc;
 
        switch (*(filter_opcode_t *) pc) {
        case FILTER_OP_UNKNOWN:
@@ -1168,7 +1172,7 @@ end:
 int lttng_filter_validate_bytecode(struct bytecode_runtime *bytecode)
 {
        struct cds_lfht *merge_points;
-       void *pc, *next_pc, *start_pc;
+       char *pc, *next_pc, *start_pc;
        int ret = -EINVAL;
        struct vstack stack;