Searched refs:labels (Results 1 – 6 of 6) sorted by relevance
| /tools/testing/selftests/bpf/ |
| A D | jit_disasm_helpers.c | 52 if (labels->print_phase) { in lookup_symbol()
55 return labels->names[i]; in lookup_symbol()
57 if (labels->cnt < MAX_LOCAL_LABELS && ref_value < labels->prog_len) in lookup_symbol()
58 labels->pcs[labels->cnt++] = ref_value; in lookup_symbol()
95 struct local_labels labels = {}; in disasm_one_func() local
114 labels.prog_len = len; in disasm_one_func()
124 qsort(labels.pcs, labels.cnt, sizeof(*labels.pcs), cmp_u32); in disasm_one_func()
133 snprintf(labels.names[i], sizeof(labels.names[i]), "L%d", i % MAX_LOCAL_LABELS); in disasm_one_func()
136 labels.print_phase = true; in disasm_one_func()
144 label_pc = bsearch(&pc, labels.pcs, labels.cnt, sizeof(*labels.pcs), cmp_u32); in disasm_one_func()
[all …]
|
| /tools/bpf/ |
| A D | bpf_exp.y | 469 static char **labels, **labels_jt, **labels_jf, **labels_k; variable
493 labels[curr_instr] = label; in bpf_set_curr_label()
517 if (labels[i] && !strcmp(label, labels[i])) { in bpf_find_insns_offset()
615 labels = calloc(BPF_MAXINSNS, sizeof(*labels)); in bpf_init()
616 assert(labels); in bpf_init()
633 free(labels[i]); in bpf_destroy_labels()
643 free(labels); in bpf_destroy()
|
| /tools/verification/rvgen/rvgen/ |
| A D | ltl2k.py | 25 if not node.labels:
31 for label in sorted(node.labels):
147 required_values |= o.labels
184 required_values |= node.labels
|
| A D | ltl2ba.py | 75 self.labels = set()
564 node.labels.add(str(o))
|
| /tools/memory-model/Documentation/ |
| A D | explanation.txt | 1753 time with statement labels added:
1921 given the situation outlined earlier (with statement labels added):
2318 pattern (with fences and statement labels, but without the conditional
|
| /tools/perf/Documentation/ |
| A D | perf-intel-pt.txt | 1321 …Guest kernel self-modifying code (e.g. jump labels or JIT-compiled eBPF) will result in decoding e…
|
Completed in 13 milliseconds