2 * filter-visitor-generate-bytecode.c
4 * LTTng filter bytecode generation
6 * Copyright 2012 - Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
8 * This library is free software; you can redistribute it and/or modify it
9 * under the terms of the GNU Lesser General Public License, version 2.1 only,
10 * as published by the Free Software Foundation.
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
17 * You should have received a copy of the GNU Lesser General Public License
18 * along with this library; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
26 #include "filter-bytecode.h"
27 #include "filter-ir.h"
28 #include "filter-ast.h"
31 #define max_t(type, a, b) ((type) ((a) > (b) ? (a) : (b)))
34 //#define INIT_ALLOC_SIZE PAGE_SIZE
35 #define INIT_ALLOC_SIZE 4
38 int recursive_visit_gen_bytecode(struct filter_parser_ctx
*ctx
,
41 static inline int fls(unsigned int x
)
47 if (!(x
& 0xFFFF0000U
)) {
51 if (!(x
& 0xFF000000U
)) {
55 if (!(x
& 0xF0000000U
)) {
59 if (!(x
& 0xC0000000U
)) {
63 if (!(x
& 0x80000000U
)) {
70 static inline int get_count_order(unsigned int count
)
74 order
= fls(count
) - 1;
75 if (count
& (count
- 1))
81 int bytecode_init(struct lttng_filter_bytecode_alloc
**fb
)
83 *fb
= calloc(sizeof(struct lttng_filter_bytecode_alloc
) + INIT_ALLOC_SIZE
, 1);
87 (*fb
)->alloc_len
= INIT_ALLOC_SIZE
;
93 int32_t bytecode_reserve(struct lttng_filter_bytecode_alloc
**fb
, uint32_t align
, uint32_t len
)
96 uint32_t padding
= offset_align((*fb
)->b
.len
, align
);
98 if ((*fb
)->b
.len
+ padding
+ len
> LTTNG_FILTER_MAX_LEN
)
101 if ((*fb
)->b
.len
+ padding
+ len
> (*fb
)->alloc_len
) {
103 max_t(uint32_t, 1U << get_count_order((*fb
)->b
.len
+ padding
+ len
),
104 (*fb
)->alloc_len
<< 1);
105 uint32_t old_len
= (*fb
)->alloc_len
;
107 *fb
= realloc(*fb
, sizeof(struct lttng_filter_bytecode_alloc
) + new_len
);
110 memset(&(*fb
)->b
.data
[old_len
], 0, new_len
- old_len
);
111 (*fb
)->alloc_len
= new_len
;
113 (*fb
)->b
.len
+= padding
;
120 int bytecode_push(struct lttng_filter_bytecode_alloc
**fb
, const void *data
,
121 uint32_t align
, uint32_t len
)
125 offset
= bytecode_reserve(fb
, align
, len
);
128 memcpy(&(*fb
)->b
.data
[offset
], data
, len
);
133 int bytecode_push_logical(struct lttng_filter_bytecode_alloc
**fb
,
134 struct logical_op
*data
,
135 uint32_t align
, uint32_t len
,
136 uint16_t *skip_offset
)
140 offset
= bytecode_reserve(fb
, align
, len
);
143 memcpy(&(*fb
)->b
.data
[offset
], data
, len
);
145 (void *) &((struct logical_op
*) &(*fb
)->b
.data
[offset
])->skip_offset
146 - (void *) &(*fb
)->b
.data
[0];
151 int bytecode_patch(struct lttng_filter_bytecode_alloc
**fb
,
156 if (offset
>= (*fb
)->b
.len
) {
159 memcpy(&(*fb
)->b
.data
[offset
], data
, len
);
164 int visit_node_root(struct filter_parser_ctx
*ctx
, struct ir_op
*node
)
167 struct return_op insn
;
170 ret
= recursive_visit_gen_bytecode(ctx
, node
->u
.root
.child
);
174 /* Generate end of bytecode instruction */
175 insn
.op
= FILTER_OP_RETURN
;
176 return bytecode_push(&ctx
->bytecode
, &insn
, 1, sizeof(insn
));
180 int visit_node_load(struct filter_parser_ctx
*ctx
, struct ir_op
*node
)
184 switch (node
->data_type
) {
185 case IR_DATA_UNKNOWN
:
187 fprintf(stderr
, "[error] Unknown data type in %s\n",
193 struct load_op
*insn
;
194 uint32_t insn_len
= sizeof(struct load_op
)
195 + strlen(node
->u
.load
.u
.string
) + 1;
197 insn
= calloc(insn_len
, 1);
200 insn
->op
= FILTER_OP_LOAD_STRING
;
201 strcpy(insn
->data
, node
->u
.load
.u
.string
);
202 ret
= bytecode_push(&ctx
->bytecode
, insn
, 1, insn_len
);
206 case IR_DATA_NUMERIC
:
208 struct load_op
*insn
;
209 uint32_t insn_len
= sizeof(struct load_op
)
210 + sizeof(struct literal_numeric
);
212 insn
= calloc(insn_len
, 1);
215 insn
->op
= FILTER_OP_LOAD_S64
;
216 *(int64_t *) insn
->data
= node
->u
.load
.u
.num
;
217 ret
= bytecode_push(&ctx
->bytecode
, insn
, 1, insn_len
);
223 struct load_op
*insn
;
224 uint32_t insn_len
= sizeof(struct load_op
)
225 + sizeof(struct literal_double
);
227 insn
= calloc(insn_len
, 1);
230 insn
->op
= FILTER_OP_LOAD_DOUBLE
;
231 *(double *) insn
->data
= node
->u
.load
.u
.flt
;
232 ret
= bytecode_push(&ctx
->bytecode
, insn
, 1, insn_len
);
236 case IR_DATA_FIELD_REF
:
238 struct load_op
*insn
;
239 uint32_t insn_len
= sizeof(struct load_op
)
240 + sizeof(struct field_ref
);
241 struct field_ref ref_offset
;
242 uint16_t reloc_offset
;
244 insn
= calloc(insn_len
, 1);
247 insn
->op
= FILTER_OP_LOAD_FIELD_REF
;
248 ref_offset
.offset
= (uint16_t) -1U;
249 memcpy(insn
->data
, &ref_offset
, sizeof(ref_offset
));
250 /* reloc_offset points to struct load_op */
251 reloc_offset
= bytecode_get_len(&ctx
->bytecode
->b
);
252 ret
= bytecode_push(&ctx
->bytecode
, insn
, 1, insn_len
);
258 ret
= bytecode_push(&ctx
->bytecode_reloc
, &reloc_offset
,
259 1, sizeof(reloc_offset
));
264 ret
= bytecode_push(&ctx
->bytecode_reloc
, node
->u
.load
.u
.ref
,
265 1, strlen(node
->u
.load
.u
.ref
) + 1);
273 int visit_node_unary(struct filter_parser_ctx
*ctx
, struct ir_op
*node
)
276 struct unary_op insn
;
279 ret
= recursive_visit_gen_bytecode(ctx
, node
->u
.unary
.child
);
283 /* Generate end of bytecode instruction */
284 switch (node
->u
.unary
.type
) {
285 case AST_UNARY_UNKNOWN
:
287 fprintf(stderr
, "[error] Unknown unary node type in %s\n",
293 case AST_UNARY_MINUS
:
294 insn
.op
= FILTER_OP_UNARY_MINUS
;
295 return bytecode_push(&ctx
->bytecode
, &insn
, 1, sizeof(insn
));
297 insn
.op
= FILTER_OP_UNARY_NOT
;
298 return bytecode_push(&ctx
->bytecode
, &insn
, 1, sizeof(insn
));
303 * Binary comparator nesting is disallowed. This allows fitting into
307 int visit_node_binary(struct filter_parser_ctx
*ctx
, struct ir_op
*node
)
310 struct binary_op insn
;
313 ret
= recursive_visit_gen_bytecode(ctx
, node
->u
.binary
.left
);
316 ret
= recursive_visit_gen_bytecode(ctx
, node
->u
.binary
.right
);
320 switch (node
->u
.binary
.type
) {
323 fprintf(stderr
, "[error] Unknown unary node type in %s\n",
329 fprintf(stderr
, "[error] Unexpected logical node type in %s\n",
334 insn
.op
= FILTER_OP_MUL
;
337 insn
.op
= FILTER_OP_DIV
;
340 insn
.op
= FILTER_OP_MOD
;
343 insn
.op
= FILTER_OP_PLUS
;
346 insn
.op
= FILTER_OP_MINUS
;
349 insn
.op
= FILTER_OP_RSHIFT
;
352 insn
.op
= FILTER_OP_LSHIFT
;
355 insn
.op
= FILTER_OP_BIN_AND
;
358 insn
.op
= FILTER_OP_BIN_OR
;
361 insn
.op
= FILTER_OP_BIN_XOR
;
365 insn
.op
= FILTER_OP_EQ
;
368 insn
.op
= FILTER_OP_NE
;
371 insn
.op
= FILTER_OP_GT
;
374 insn
.op
= FILTER_OP_LT
;
377 insn
.op
= FILTER_OP_GE
;
380 insn
.op
= FILTER_OP_LE
;
383 return bytecode_push(&ctx
->bytecode
, &insn
, 1, sizeof(insn
));
387 * A logical op always return a s64 (1 or 0).
390 int visit_node_logical(struct filter_parser_ctx
*ctx
, struct ir_op
*node
)
393 struct logical_op insn
;
394 uint16_t skip_offset_loc
;
397 /* Visit left child */
398 ret
= recursive_visit_gen_bytecode(ctx
, node
->u
.binary
.left
);
401 /* Cast to s64 if float or field ref */
402 if (node
->u
.binary
.left
->data_type
== IR_DATA_FIELD_REF
403 || node
->u
.binary
.left
->data_type
== IR_DATA_FLOAT
) {
404 struct cast_op cast_insn
;
406 if (node
->u
.binary
.left
->data_type
== IR_DATA_FIELD_REF
) {
407 cast_insn
.op
= FILTER_OP_CAST_TO_S64
;
409 cast_insn
.op
= FILTER_OP_CAST_DOUBLE_TO_S64
;
411 ret
= bytecode_push(&ctx
->bytecode
, &cast_insn
,
412 1, sizeof(cast_insn
));
416 switch (node
->u
.logical
.type
) {
418 fprintf(stderr
, "[error] Unknown node type in %s\n",
423 insn
.op
= FILTER_OP_AND
;
426 insn
.op
= FILTER_OP_OR
;
429 insn
.skip_offset
= (uint16_t) -1UL; /* Temporary */
430 ret
= bytecode_push_logical(&ctx
->bytecode
, &insn
, 1, sizeof(insn
),
434 /* Visit right child */
435 ret
= recursive_visit_gen_bytecode(ctx
, node
->u
.binary
.right
);
438 /* Cast to s64 if float or field ref */
439 if (node
->u
.binary
.right
->data_type
== IR_DATA_FIELD_REF
440 || node
->u
.binary
.right
->data_type
== IR_DATA_FLOAT
) {
441 struct cast_op cast_insn
;
443 if (node
->u
.binary
.right
->data_type
== IR_DATA_FIELD_REF
) {
444 cast_insn
.op
= FILTER_OP_CAST_TO_S64
;
446 cast_insn
.op
= FILTER_OP_CAST_DOUBLE_TO_S64
;
448 ret
= bytecode_push(&ctx
->bytecode
, &cast_insn
,
449 1, sizeof(cast_insn
));
453 /* We now know where the logical op can skip. */
454 target_loc
= (uint16_t) bytecode_get_len(&ctx
->bytecode
->b
);
455 ret
= bytecode_patch(&ctx
->bytecode
,
456 &target_loc
, /* Offset to jump to */
457 skip_offset_loc
, /* Where to patch */
463 * Postorder traversal of the tree. We need the children result before
464 * we can evaluate the parent.
467 int recursive_visit_gen_bytecode(struct filter_parser_ctx
*ctx
,
473 fprintf(stderr
, "[error] Unknown node type in %s\n",
478 return visit_node_root(ctx
, node
);
480 return visit_node_load(ctx
, node
);
482 return visit_node_unary(ctx
, node
);
484 return visit_node_binary(ctx
, node
);
486 return visit_node_logical(ctx
, node
);
490 __attribute__((visibility("hidden")))
491 void filter_bytecode_free(struct filter_parser_ctx
*ctx
)
494 ctx
->bytecode
= NULL
;
495 free(ctx
->bytecode_reloc
);
496 ctx
->bytecode_reloc
= NULL
;
499 __attribute__((visibility("hidden")))
500 int filter_visitor_bytecode_generate(struct filter_parser_ctx
*ctx
)
504 ret
= bytecode_init(&ctx
->bytecode
);
507 ret
= bytecode_init(&ctx
->bytecode_reloc
);
510 ret
= recursive_visit_gen_bytecode(ctx
, ctx
->ir_root
);
514 /* Finally, append symbol table to bytecode */
515 ctx
->bytecode
->b
.reloc_table_offset
= bytecode_get_len(&ctx
->bytecode
->b
);
516 return bytecode_push(&ctx
->bytecode
, ctx
->bytecode_reloc
->b
.data
,
517 1, bytecode_get_len(&ctx
->bytecode_reloc
->b
));
520 filter_bytecode_free(ctx
);