Home
last modified time | relevance | path

Searched refs:bb (Results 1 – 25 of 138) sorted by relevance

123456

/illumos-gate/usr/src/tools/smatch/src/
H A Dflow.c28 static int rewrite_branch(struct basic_block *bb, in rewrite_branch() argument
33 if (*ptr != old || new == old || !bb->ep) in rewrite_branch()
40 replace_bb_in_list(&bb->children, old, new, 1); in rewrite_branch()
41 remove_bb_from_list(&old->parents, bb, 1); in rewrite_branch()
42 add_bb(&new->parents, bb); in rewrite_branch()
95 if (!insn->bb) in bb_depends_on_phi()
116 static int try_to_simplify_bb(struct basic_block *bb, struct instruction *first, struct instruction… in try_to_simplify_bb() argument
127 bogus = bb_list_size(bb->parents) != pseudo_list_size(first->phi_list); in try_to_simplify_bb()
138 source = def->bb; in try_to_simplify_bb()
151 if (bb_depends_on(target, bb)) in try_to_simplify_bb()
[all …]
H A Dliveness.c25 if (!def || !def->bb) in phi_defines()
27 defines(def->bb, target); in phi_defines()
31 static void asm_liveness(struct basic_block *bb, struct instruction *insn, in asm_liveness() argument
38 use(bb, entry->pseudo); in asm_liveness()
42 def(bb, entry->pseudo); in asm_liveness()
46 static void track_instruction_usage(struct basic_block *bb, struct instruction *insn, in track_instruction_usage() argument
52 #define USES(x) use(bb, insn->x) in track_instruction_usage()
53 #define DEFINES(x) def(bb, insn->x) in track_instruction_usage()
116 use(bb, pseudo); in track_instruction_usage()
125 asm_liveness(bb, insn, def, use); in track_instruction_usage()
[all …]
H A Dflowgraph.c23 static void label_postorder(struct basic_block *bb, struct cfg_info *info) in label_postorder() argument
27 if (bb->generation == info->gen) in label_postorder()
30 bb->generation = info->gen; in label_postorder()
31 FOR_EACH_PTR_REVERSE(bb->children, child) { in label_postorder()
35 bb->postorder_nr = info->nr++; in label_postorder()
36 add_bb(&info->list, bb); in label_postorder()
41 struct basic_block *bb; in reverse_bbs() local
42 FOR_EACH_PTR_REVERSE(src, bb) { in reverse_bbs()
43 add_bb(dst, bb); in reverse_bbs()
44 } END_FOR_EACH_PTR_REVERSE(bb); in reverse_bbs()
[all …]
H A Dssa.c76 struct basic_block *bb = a->bb; in insn_before() local
79 assert(b->bb == bb); in insn_before()
80 FOR_EACH_PTR(bb->insns, insn) { in insn_before()
93 insn->bb = NULL; in kill_store()
96 static void rewrite_local_var(struct basic_block *bb, pseudo_t addr, int nbr_stores, int nbr_uses) in rewrite_local_var() argument
101 if (!bb) in rewrite_local_var()
104 FOR_EACH_PTR(bb->insns, insn) { in rewrite_local_var()
106 if (!insn->bb || insn->src != addr) 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()
[all …]
H A Dstorage.c24 static inline unsigned int storage_hash(struct basic_block *bb, pseudo_t pseudo, enum inout_enum in… in storage_hash() argument
26 unsigned hash = hashval(bb) + hashval(pseudo) + hashval(inout); in storage_hash()
45 struct storage_hash_list *gather_storage(struct basic_block *bb, enum inout_enum inout) in gather_storage() argument
54 if (hash->bb == bb && hash->inout == inout) in gather_storage()
88 struct storage *lookup_storage(struct basic_block *bb, pseudo_t pseudo, enum inout_enum inout) in lookup_storage() argument
90 struct storage_hash_list *list = storage_hash_table[storage_hash(bb,pseudo,inout)]; in lookup_storage()
94 if (hash->bb == bb && hash->pseudo == pseudo && hash->inout == inout) in lookup_storage()
100 void add_storage(struct storage *storage, struct basic_block *bb, pseudo_t pseudo, enum inout_enum … in add_storage() argument
102 struct storage_hash_list **listp = storage_hash_table + storage_hash(bb,pseudo,inout); in add_storage()
105 hash->bb = bb; in add_storage()
[all …]
H A Dgraph.c46 struct basic_block *bb; in graph_ep() local
52 sname = stream_name(ep->entry->bb->pos.stream); in graph_ep()
63 ep, sname, fname, sname, fname, ep->entry->bb); in graph_ep()
65 FOR_EACH_PTR(ep->bbs, bb) { in graph_ep()
72 bb, bb->pos.line, bb->pos.line, bb->pos.pos); in graph_ep()
76 FOR_EACH_PTR(bb->insns, insn) { in graph_ep()
77 if (!insn->bb) in graph_ep()
107 FOR_EACH_PTR(bb->children, child) { in graph_ep()
108 printf(" bb%p -> bb%p [op=br, %s];\n", bb, child, in graph_ep()
109 (bb->pos.line > child->pos.line) ? "weight=5" : "weight=10"); in graph_ep()
[all …]
H A Ddominate.c41 static void bank_put(struct piggy *bank, struct basic_block *bb) in bank_put() argument
43 unsigned int level = bb->dom_level; in bank_put()
45 add_bb(&bank->lists[level], bb); in bank_put()
57 struct basic_block *bb = pop_bb(&bank->lists[level]); in bank_get() local
58 if (bb) in bank_get()
59 return bb; in bank_get()
103 struct basic_block *bb; in idf_compute() local
111 FOR_EACH_PTR(ep->bbs, bb) { in idf_compute()
114 bb->generation = generation; in idf_compute()
115 } END_FOR_EACH_PTR(bb); in idf_compute()
[all …]
H A Dsparse.c43 static int context_increase(struct basic_block *bb, int entry) in context_increase() argument
48 FOR_EACH_PTR(bb->insns, insn) { in context_increase()
50 if (!insn->bb) in context_increase()
70 static int imbalance(struct entrypoint *ep, struct basic_block *bb, int entry, int exit, const char… in imbalance() argument
74 warning(bb->pos, "context imbalance in '%s' - %s", show_ident(sym->ident), why); in imbalance()
79 static int check_bb_context(struct entrypoint *ep, struct basic_block *bb, int entry, int exit);
81 static int check_children(struct entrypoint *ep, struct basic_block *bb, int entry, int exit) in check_children() argument
86 insn = last_instruction(bb->insns); in check_children()
90 return entry != exit ? imbalance(ep, bb, entry, exit, "wrong count at exit") : 0; in check_children()
92 FOR_EACH_PTR(bb->children, child) { in check_children()
[all …]
H A Dmemops.c20 struct basic_block *bb, unsigned long generation, struct pseudo_list **dominators, in find_dominating_parents() argument
25 FOR_EACH_PTR(bb->parents, parent) { in find_dominating_parents()
32 if (!one->bb) in find_dominating_parents()
70 if (insn->bb && (insn->opcode != OP_LOAD && insn->opcode != OP_STORE)) in address_taken()
85 static void simplify_loads(struct basic_block *bb) in simplify_loads() argument
89 FOR_EACH_PTR_REVERSE(bb->insns, insn) { in simplify_loads()
90 if (!insn->bb) in simplify_loads()
107 if (!dom->bb) in simplify_loads()
125 bb->generation = generation; in simplify_loads()
127 if (find_dominating_parents(pseudo, insn, bb, generation, &dominators, local)) { in simplify_loads()
[all …]
H A Dunssa.c49 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 Dir.c35 if (bb_list_size(insn->bb->parents) != nbr_phi_operands(insn)) { in check_phi_node()
38 info(insn->pos, "parents: %d", bb_list_size(insn->bb->parents)); in check_phi_node()
43 PREPARE_PTR_LIST(insn->bb->parents, par); in check_phi_node()
50 if (src->bb != par) { in check_phi_node()
53 info(src->pos, " got: %s", show_label(src->bb)); 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()
88 static int check_branch(struct entrypoint *ep, struct instruction *insn, struct basic_block *bb) in check_branch() argument
90 if (bb->ep && lookup_bb(ep->bbs, bb)) in check_branch()
[all …]
H A Dtest-unssa.c10 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 Dlinearize.h88 struct basic_block *bb; member
186 static inline void add_bb(struct basic_block_list **list, struct basic_block *bb) in add_bb() argument
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()
231 static inline int lookup_bb(struct basic_block_list *list, struct basic_block *bb) in lookup_bb() argument
233 return lookup_ptr_list_entry((struct ptr_list *)list, bb); in lookup_bb()
[all …]
H A Dlinearize.c74 struct basic_block *bb = __alloc_basic_block(0); in alloc_basic_block() local
75 bb->pos = pos; in alloc_basic_block()
76 bb->ep = ep; in alloc_basic_block()
77 bb->nr = nr++; in alloc_basic_block()
78 return bb; in alloc_basic_block()
90 const char *show_label(struct basic_block *bb) in show_label() argument
96 if (!bb) in show_label()
98 snprintf(buf, 64, ".L%u", bb->nr); in show_label()
315 if (!insn->bb) in show_instruction()
504 void show_bb(struct basic_block *bb) in show_bb() argument
[all …]
H A Doptimize.c32 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 Dcse.c32 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 Drtwphy.c90 rtw_bbp_init(struct rtw_regs *regs, struct rtw_bbpset *bb, int antdiv, in rtw_bbp_init() argument
96 sys2 = bb->bb_sys2; in rtw_bbp_init()
99 sys3 = bb->bb_sys3 | in rtw_bbp_init()
106 RTW_BBP_WRITE_OR_RETURN(RTW_BBP_SYS1, bb->bb_sys1); in rtw_bbp_init()
107 RTW_BBP_WRITE_OR_RETURN(RTW_BBP_TXAGC, bb->bb_txagc); in rtw_bbp_init()
108 RTW_BBP_WRITE_OR_RETURN(RTW_BBP_LNADET, bb->bb_lnadet); in rtw_bbp_init()
109 RTW_BBP_WRITE_OR_RETURN(RTW_BBP_IFAGCINI, bb->bb_ifagcini); in rtw_bbp_init()
110 RTW_BBP_WRITE_OR_RETURN(RTW_BBP_IFAGCLIMIT, bb->bb_ifagclimit); in rtw_bbp_init()
111 RTW_BBP_WRITE_OR_RETURN(RTW_BBP_IFAGCDET, bb->bb_ifagcdet); in rtw_bbp_init()
113 if ((rc = rtw_bbp_preinit(regs, bb->bb_antatten, dflantb, freq)) != 0) in rtw_bbp_init()
[all …]
/illumos-gate/usr/src/uts/common/os/
H A Dunix_bb.c70 __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 Dcmpdi2.c46 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 Ducmpdi2.c45 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 Dtst.general.d.out171 in |{ "top": { "mid" : { "legs": "feet" }, "number": 9, "array":[0,1,{"a":true,"bb":[1,2,false,{"x…
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|
[all …]
/illumos-gate/usr/src/lib/libsqlite/test/
H A Dselect2.test123 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 Dx86pi_bboard.c62 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/contrib/ast/src/cmd/ksh93/tests/
H A Dglob.sh108 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>' ??
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Ddist.c195 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()

123456