/illumos-gate/usr/src/tools/smatch/src/ |
H A D | flow.c | 95 if (!insn->bb) in bb_depends_on_phi() 138 source = def->bb; in try_to_simplify_bb() 167 if (!insn->bb) in bb_has_side_effects() 204 if (def->bb != bb || def->opcode != OP_PHI) in simplify_phi_branch() 218 if (target == bb) in simplify_branch_branch() 438 if (!insn->bb) in kill_dead_stores_bb() 558 if (!insn->bb) in kill_bb() 590 kill_bb(bb); in kill_unreachable_bbs() 591 bb->ep = NULL; in kill_unreachable_bbs() 655 if (bb) { in vrfy_bb_in_list() [all …]
|
H A D | liveness.c | 25 if (!def || !def->bb) in phi_defines() 27 defines(def->bb, target); in phi_defines() 38 use(bb, entry->pseudo); in asm_liveness() 42 def(bb, entry->pseudo); in asm_liveness() 116 use(bb, pseudo); in track_instruction_usage() 159 if (pseudo->type != PSEUDO_REG || def->bb != bb || def->opcode == OP_PHI) in insn_uses() 190 struct basic_block *bb; in clear_liveness() local 210 if (!insn->bb) in track_pseudo_liveness() 212 assert(insn->bb == bb); in track_pseudo_liveness() 299 if (!insn->bb) in track_pseudo_death_bb() [all …]
|
H A D | flowgraph.c | 36 add_bb(&info->list, bb); in label_postorder() 41 struct basic_block *bb; in reverse_bbs() local 43 add_bb(dst, bb); in reverse_bbs() 49 struct basic_block *bb; in debug_postorder() local 53 printf("\t.L%u: %u\n", bb->nr, bb->postorder_nr); in debug_postorder() 54 } END_FOR_EACH_PTR(bb); in debug_postorder() 107 struct basic_block *bb = ep->entry->bb; in debug_domtree() local 111 if (bb == ep->entry->bb) in debug_domtree() 113 printf("\t%s <- %s\n", show_label(bb), show_label(bb->idom)); in debug_domtree() 173 if (bb == entry) in domtree_build() [all …]
|
H A D | ssa.c | 76 struct basic_block *bb = a->bb; in insn_before() local 79 assert(b->bb == bb); in insn_before() 93 insn->bb = NULL; in kill_store() 101 if (!bb) in rewrite_local_var() 139 if (insn->bb == store->bb) { in rewrite_single_store() 144 } else if (!domtree_dominates(store->bb, insn->bb)) { in rewrite_single_store() 204 struct basic_block *bb = insn->bb; in ssa_convert_one_var() local 216 samebb = bb; in ssa_convert_one_var() 263 } while ((bb = bb->idom)); in lookup_var() 314 if (!insn->bb) in ssa_rename_insns() [all …]
|
H A D | storage.c | 54 if (hash->bb == bb && hash->inout == inout) in gather_storage() 94 if (hash->bb == bb && hash->pseudo == pseudo && hash->inout == inout) in lookup_storage() 105 hash->bb = bb; in add_storage() 120 if (a->bb != b->bb) in storage_hash_cmp() 121 return a->bb < b->bb ? -1 : 1; in storage_hash_cmp() 124 if (aa->type != bb->type) in storage_hash_cmp() 143 if (last->bb == entry->bb in vrfy_storage() 150 last->bb, in vrfy_storage() 295 struct basic_block *bb; in set_up_storage() local 302 set_up_bb_storage(bb); in set_up_storage() [all …]
|
H A D | graph.c | 46 struct basic_block *bb; in graph_ep() local 65 FOR_EACH_PTR(ep->bbs, bb) { in graph_ep() 72 bb, bb->pos.line, bb->pos.line, bb->pos.pos); in graph_ep() 77 if (!insn->bb) in graph_ep() 111 } END_FOR_EACH_PTR(bb); in graph_ep() 122 struct basic_block *bb; in graph_calls() local 129 if (!bb) in graph_calls() 131 if (!bb->parents && !bb->children && !bb->insns && verbose < 2) in graph_calls() 135 if (!insn->bb) in graph_calls() 152 bb, sym->ep->entry->bb, in graph_calls() [all …]
|
H A D | dominate.c | 58 if (bb) in bank_get() 59 return bb; in bank_get() 103 struct basic_block *bb; in idf_compute() local 115 } END_FOR_EACH_PTR(bb); in idf_compute() 117 FOR_EACH_PTR(alpha, bb) { in idf_compute() 119 bank_put(bank, bb); in idf_compute() 120 } END_FOR_EACH_PTR(bb); in idf_compute() 123 visit(bank, idf, bb, bb->dom_level); in idf_compute() 131 struct basic_block *bb; in idf_dump() local 141 add_bb(&alpha, bb); in idf_dump() [all …]
|
H A D | sparse.c | 50 if (!insn->bb) in context_increase() 101 if (!bb) in check_bb_context() 103 if (bb->context == entry) in check_bb_context() 107 if (bb->context >= 0) in check_bb_context() 110 bb->context = entry; in check_bb_context() 239 if (!insn->bb) in check_bb_instructions() 247 struct basic_block *bb; in check_instructions() local 248 FOR_EACH_PTR(ep->bbs, bb) { in check_instructions() 249 bb->context = -1; in check_instructions() 250 check_bb_instructions(bb); in check_instructions() [all …]
|
H A D | memops.c | 25 FOR_EACH_PTR(bb->parents, parent) { in find_dominating_parents() 32 if (!one->bb) in find_dominating_parents() 90 if (!insn->bb) in simplify_loads() 107 if (!dom->bb) in simplify_loads() 125 bb->generation = generation; in simplify_loads() 154 if (!insn->bb) in kill_dominated_stores() 169 if (!dom->bb) in kill_dominated_stores() 192 struct basic_block *bb; in simplify_memops() local 196 simplify_loads(bb); in simplify_memops() 197 } END_FOR_EACH_PTR_REVERSE(bb); in simplify_memops() [all …]
|
H A D | unssa.c | 49 if (def->bb == phi->bb) in simplify_phi_node() 59 phi->bb = NULL; in simplify_phi_node() 102 def->bb = NULL; in replace_phi_node() 106 if (!phi->bb) in replace_phi_node() 117 static void rewrite_phi_bb(struct basic_block *bb) in rewrite_phi_bb() argument 124 FOR_EACH_PTR(bb->insns, insn) { in rewrite_phi_bb() 125 if (!insn->bb) in rewrite_phi_bb() 135 struct basic_block *bb; in unssa() local 137 FOR_EACH_PTR(ep->bbs, bb) { in unssa() 138 rewrite_phi_bb(bb); in unssa() [all …]
|
H A D | ir.c | 43 PREPARE_PTR_LIST(insn->bb->parents, par); in check_phi_node() 50 if (src->bb != par) { in check_phi_node() 67 show_entry(insn->bb->ep); in check_user() 75 if (def && def->bb) in check_user() 77 show_entry(insn->bb->ep); in check_user() 90 if (bb->ep && lookup_bb(ep->bbs, bb)) in check_branch() 188 struct basic_block *bb; in ir_validate() local 194 FOR_EACH_PTR(ep->bbs, bb) { in ir_validate() 196 FOR_EACH_PTR(bb->insns, insn) { in ir_validate() 197 if (!insn->bb) in ir_validate() [all …]
|
H A D | test-unssa.c | 10 static void output_bb(struct basic_block *bb, unsigned long generation) in output_bb() argument 14 bb->generation = generation; in output_bb() 15 printf("%s\n", show_label(bb)); in output_bb() 17 FOR_EACH_PTR(bb->insns, insn) { in output_bb() 18 if (!insn->bb) in output_bb() 29 struct basic_block *bb; in output_fn() local 41 FOR_EACH_PTR(ep->bbs, bb) { in output_fn() 42 if (bb->generation == generation) in output_fn() 44 output_bb(bb, generation); in output_fn() 46 END_FOR_EACH_PTR(bb); in output_fn()
|
H A D | linearize.h | 88 struct basic_block *bb; member 188 add_ptr_list(list, bb); in add_bb() 216 static inline int bb_terminated(struct basic_block *bb) in bb_terminated() argument 219 if (!bb) in bb_terminated() 221 insn = last_instruction(bb->insns); in bb_terminated() 226 static inline int bb_reachable(struct basic_block *bb) in bb_reachable() argument 228 return bb != NULL; in bb_reachable() 233 return lookup_ptr_list_entry((struct ptr_list *)list, bb); in lookup_bb() 314 void add_phi_node(struct basic_block *bb, struct instruction *phi_node); 325 void show_bb(struct basic_block *bb); [all …]
|
H A D | linearize.c | 78 return bb; in alloc_basic_block() 96 if (!bb) in show_label() 599 if (!bb->parents && !bb->children && !bb->insns && verbose < 2) in show_entry() 652 insn->bb = bb; in add_one_insn() 686 br->bb = bb; in insert_branch() 711 select->bb = bb; in insert_select() 743 if (!bb_reachable(bb) || !bb_empty(bb)) { in add_label() 880 phi_node->bb = bb; in alloc_phi_node() 993 if (!bb) in add_store() 1995 phi_node->bb = bb; in add_return() [all …]
|
H A D | optimize.c | 32 struct basic_block *bb; in clean_up_insns() local 34 FOR_EACH_PTR(ep->bbs, bb) { in clean_up_insns() 36 FOR_EACH_PTR(bb->insns, insn) { in clean_up_insns() 38 if (!insn->bb) in clean_up_insns() 40 assert(insn->bb == bb); in clean_up_insns() 43 } END_FOR_EACH_PTR(bb); in clean_up_insns()
|
H A D | cse.c | 32 if (def1->bb != def2->bb) in phi_compare() 33 return def1->bb < def2->bb ? -1 : 1; in phi_compare() 112 hash += hashval(def->bb); in cse_collect() 292 static void add_instruction_to_end(struct instruction *insn, struct basic_block *bb) in add_instruction_to_end() argument 294 struct instruction *br = delete_last_instruction(&bb->insns); in add_instruction_to_end() 295 insn->bb = bb; in add_instruction_to_end() 296 add_instruction(&bb->insns, insn); in add_instruction_to_end() 297 add_instruction(&bb->insns, br); in add_instruction_to_end() 308 b1 = i1->bb; in try_to_cse() 309 b2 = i2->bb; in try_to_cse() [all …]
|
/illumos-gate/usr/src/uts/common/io/rtw/ |
H A D | rtwphy.c | 96 sys2 = bb->bb_sys2; in rtw_bbp_init() 99 sys3 = bb->bb_sys3 | in rtw_bbp_init() 463 bb = &rf->rf_bbpset; in rtw_sa2400_create() 475 bb->bb_sys1 = 0x98; in rtw_sa2400_create() 476 bb->bb_sys2 = 0x47; in rtw_sa2400_create() 478 bb->bb_trl = 0x88; in rtw_sa2400_create() 623 bb->bb_sys1 = 136; in rtw_max2820_create() 624 bb->bb_sys2 = 71; in rtw_max2820_create() 625 bb->bb_sys3 = 155; in rtw_max2820_create() 626 bb->bb_trl = 136; in rtw_max2820_create() [all …]
|
/illumos-gate/usr/src/uts/common/os/ |
H A D | unix_bb.c | 70 __bb_init_func(struct bb_info *bb) argument 120 bb_last_where = bb->bb_filename; 128 if (bb->bb_next == 0) { 131 if (bb->bb_initflag == 0) { 132 bb->bb_initflag = 1; 134 bb->bb_next = unix_bb_list; 135 unix_bb_list = bb;
|
/illumos-gate/usr/src/lib/libc/port/fp/ |
H A D | cmpdi2.c | 46 union uu aa, bb; in ___cmpdi2() local 49 bb.q = b; in ___cmpdi2() 50 return (aa.sl[H] < bb.sl[H] ? 0 : aa.sl[H] > bb.sl[H] ? 2 : in ___cmpdi2() 51 aa.ul[L] < bb.ul[L] ? 0 : aa.ul[L] > bb.ul[L] ? 2 : 1); in ___cmpdi2()
|
H A D | ucmpdi2.c | 45 union uu aa, bb; in ___ucmpdi2() local 48 bb.uq = b; in ___ucmpdi2() 49 return (aa.ul[H] < bb.ul[H] ? 0 : aa.ul[H] > bb.ul[H] ? 2 : in ___ucmpdi2() 50 aa.ul[L] < bb.ul[L] ? 0 : aa.ul[L] > bb.ul[L] ? 2 : 1); in ___ucmpdi2()
|
/illumos-gate/usr/src/cmd/dtrace/test/tst/common/json/ |
H A D | tst.general.d.out | 173 out |{ "mid" : { "legs": "feet" }, "number": 9, "array":[0,1,{"a":true,"bb":[1,2,false,{"x":"yz"}]… 189 out |[0,1,{"a":true,"bb":[1,2,false,{"x":"yz"}]}]| 195 out |{"a":true,"bb":[1,2,false,{"x":"yz"}]}| 200 sel |top.array[2].bb| 202 sel |top.array[2].bb[0]| 204 sel |top.array[2].bb[1]| 206 sel |top.array[2].bb[2]| 208 sel |top.array[2].bb[3]| 210 sel |top.array[2].bb[3].x| 212 sel |top.array[2].bb[3].x.nofurther| [all …]
|
/illumos-gate/usr/src/lib/libsqlite/test/ |
H A D | select2.test | 123 CREATE TABLE bb(b); 126 INSERT INTO bb VALUES(2); 127 INSERT INTO bb VALUES(4); 128 SELECT * FROM aa, bb WHERE max(a,b)>2; 133 INSERT INTO bb VALUES(0); 134 SELECT * FROM aa, bb WHERE b; 139 SELECT * FROM aa, bb WHERE NOT b; 144 SELECT * FROM aa, bb WHERE min(a,b); 149 SELECT * FROM aa, bb WHERE NOT min(a,b); 154 SELECT * FROM aa, bb WHERE CASE WHEN a=b-1 THEN 1 END; [all …]
|
/illumos-gate/usr/src/lib/fm/topo/modules/i86pc/x86pi/ |
H A D | x86pi_bboard.c | 62 smbios_bboard_t bb; in x86pi_gen_bboard() local 84 rv = smbios_info_bboard(shp, smb_id, &bb); in x86pi_gen_bboard() 91 bb.smbb_chassis != psmb_id) { in x86pi_gen_bboard() 120 if (bbnp->type == bb.smbb_type) { in x86pi_gen_bboard() 306 smbios_bboard_t bb; in x86pi_bb_chassis() local 314 rv = smbios_info_bboard(shp, bb_smbid, &bb); in x86pi_bb_chassis() 318 return (bb.smbb_chassis); in x86pi_bb_chassis() 327 smbios_bboard_t bb; in x86pi_bb_contains() local 341 rv = smbios_info_bboard(shp, smb_id, &bb); in x86pi_bb_contains() 356 cont_cnt = bb.smbb_contn; in x86pi_bb_contains()
|
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/ |
H A D | dist.c | 195 int bb = distarray[i]; /* bucket begin */ in dist_print_bucket() local 209 for (b = bb; b <= be; b++) in dist_print_bucket() 218 if (bb == be) in dist_print_bucket() 219 (void) mdb_snprintf(range, sizeof (range), "%d", bb); in dist_print_bucket() 221 (void) mdb_snprintf(range, sizeof (range), "%d-%d", bb, be); in dist_print_bucket()
|
/illumos-gate/usr/src/contrib/ast/src/cmd/ksh93/tests/ |
H A D | glob.sh | 108 touch a b c d abc abd abe bb bcd ca cb dd de Beware 237 test_glob ++Beware '<b> <bb> <bcd> <bdir>' b* 238 test_glob '<Beware> <b> <bb> <bcd> <bdir>' [bB]* 244 test_glob '<Beware> <b> <bb> <bcd> <bdir>' b* 245 test_glob '<Beware> <b> <bb> <bcd> <bdir>' [b]* 246 test_glob '<Beware> <b> <bb> <bcd> <bdir>' [bB]* 273 test_glob '<a-b> <aXb> <abd> <bb> <bcd> <bdir> <ca> <cb> <dd> <man>' * 282 test_glob '<bb> <ca> <cb> <dd> <de>' ??
|