| /freebsd-9.3-release/contrib/gcc/ |
| H A D | et-forest.h | 66 struct et_node *son; /* The first of the sons of the node. */ member in struct:et_node
|
| H A D | dominance.c | 571 struct et_node *son; local
575 if (node->son)
577 assign_dfs_numbers (node->son, num);
578 for (son = node->son->right; son != node->son; son = son->right)
579 assign_dfs_numbers (son, nu
717 struct et_node *node = bb->dom[dir], *son = node->son, *ason; local
769 struct et_node *bb_node = bb->dom[dir], *to_node = to->dom[dir], *son; local
1080 struct et_node *son = bb->dom[dir]->son; local
[all...] |
| H A D | tree-ssa-sink.c | 424 basic_block son; local
478 for (son = first_dom_son (CDI_POST_DOMINATORS, bb);
479 son;
480 son = next_dom_son (CDI_POST_DOMINATORS, son))
482 sink_code_in_bb (son);
|
| H A D | et-forest.c | 46 struct et_occ *prev; /* Left son in the splay-tree. */
47 struct et_occ *next; /* Right son in the splay-tree. */
479 nw->son = NULL;
492 while (t->son)
493 et_split (t->son);
560 right = father->son;
571 father->son = t;
614 if (father->son == t)
615 father->son = t->right;
616 if (father->son
[all...] |
| H A D | tree-ssa-reassoc.c | 1262 basic_block son; local
1292 for (son = first_dom_son (CDI_DOMINATORS, bb);
1293 son;
1294 son = next_dom_son (CDI_DOMINATORS, son))
1295 break_up_subtract_bb (son);
1305 basic_block son; local
1373 for (son = first_dom_son (CDI_POST_DOMINATORS, bb);
1374 son;
1375 son
[all...] |
| H A D | cfgloop.c | 821 basic_block son, postpone = NULL;
824 for (son = first_dom_son (CDI_DOMINATORS, bb);
825 son;
826 son = next_dom_son (CDI_DOMINATORS, son))
828 if (!flow_bb_inside_loop_p (loop, son))
831 if (dominated_by_p (CDI_DOMINATORS, loop->latch, son))
833 postpone = son;
836 fill_sons_in_loop (loop, son, tovisit, tv);
820 basic_block son, postpone = NULL; local
|
| H A D | tree-ssa-pre.c | 1679 basic_block son; local
1770 for (son = first_dom_son (CDI_POST_DOMINATORS, block);
1771 son;
1772 son = next_dom_son (CDI_POST_DOMINATORS, son))
1774 changed |= compute_antic_aux (son,
1775 TEST_BIT (has_abnormal_preds, son->index));
2650 basic_block son; local
2794 for (son = first_dom_son (CDI_DOMINATORS, block);
2795 son;
3385 basic_block block, son; local
[all...] |
| H A D | tree-into-ssa.c | 2223 basic_block son; local
2306 for (son = first_dom_son (CDI_DOMINATORS, bb);
2307 son;
2308 son = next_dom_son (CDI_DOMINATORS, son))
2309 prepare_block_for_update (son, insert_phi_p);
|
| H A D | tree-ssa-dom.c | 2396 basic_block son; local
2405 for (son = first_dom_son (CDI_DOMINATORS, bb);
2406 son;
2407 son = next_dom_son (CDI_DOMINATORS, son))
2408 eliminate_degenerate_phis_1 (son, interesting_names);
|
| H A D | tree-cfg.c | 4579 basic_block son; local
4581 for (son = first_dom_son (CDI_DOMINATORS, entry);
4582 son;
4583 son = next_dom_son (CDI_DOMINATORS, son))
4585 VEC_safe_push (basic_block, heap, *bbs_p, son);
4586 if (son != exit)
4587 gather_blocks_in_sese_region (son, exit, bbs_p);
|
| H A D | omp-low.c | 3475 basic_block son;
3515 for (son = first_dom_son (CDI_DOMINATORS, bb);
3516 son;
3517 son = next_dom_son (CDI_DOMINATORS, son))
3518 build_omp_regions_1 (son, parent);
3474 basic_block son; local
|
| H A D | tree-vrp.c | 3600 basic_block son; local
3710 for (son = first_dom_son (CDI_DOMINATORS, bb);
3711 son;
3712 son = next_dom_son (CDI_DOMINATORS, son))
3713 need_assert |= find_assert_locations (son);
|
| /freebsd-9.3-release/sys/netpfil/ipfw/ |
| H A D | dn_heap.c | 145 int son = h->elements; local
149 son = key1;
151 son = h->elements;
152 if (son == h->size) /* need resize... */
156 h->p[son].object = p;
157 h->p[son].key = key1;
160 /* make sure that son >= father along the path */
161 while (son > 0) {
162 int father = HEAP_FATHER(son);
165 if (DN_KEY_LT( h->p[father].key, h->p[son]
[all...] |
| /freebsd-9.3-release/contrib/xz/src/liblzma/lz/ |
| H A D | lz_encoder_mf.c | 128 // in mf->son. Since we go through both mf->hash and
129 // mf->son here in normalization, Valgrind may complain
222 mf->son, mf->cyclic_pos, mf->cyclic_size, \
242 /// \param son lzma_mf.son (contains the hash chain)
254 uint32_t *const son,
260 son[cyclic_pos] = cur_match;
268 cur_match = son[cyclic_pos - delta
297 mf->son[mf->cyclic_pos] = cur_match; \
459 uint32_t *const son,
248 hc_find_func( const uint32_t len_limit, const uint32_t pos, const uint8_t *const cur, uint32_t cur_match, uint32_t depth, uint32_t *const son, const uint32_t cyclic_pos, const uint32_t cyclic_size, lzma_match *matches, uint32_t len_best) argument
453 bt_find_func( const uint32_t len_limit, const uint32_t pos, const uint8_t *const cur, uint32_t cur_match, uint32_t depth, uint32_t *const son, const uint32_t cyclic_pos, const uint32_t cyclic_size, lzma_match *matches, uint32_t len_best) argument
521 bt_skip_func( const uint32_t len_limit, const uint32_t pos, const uint8_t *const cur, uint32_t cur_match, uint32_t depth, uint32_t *const son, const uint32_t cyclic_pos, const uint32_t cyclic_size) argument
[all...] |
| H A D | lz_encoder.h | 100 uint32_t *son; member in struct:lzma_mf_s
124 /// Number of elements in son[]
|
| H A D | lz_encoder.c | 285 // Calculate the sizes of mf->hash and mf->son and check that
401 mf->son = mf->hash + mf->hash_size_sum;
412 // We don't need to initialize mf->son, but not doing that will
420 //memzero(mf->son, (size_t)(mf->sons_count) * sizeof(uint32_t));
|
| /freebsd-9.3-release/contrib/ntp/sntp/ag-tpl/0-old/ |
| H A D | Mdoc.pm | 7 use Mdoc qw(ns pp soff son stoggle mapwords);
122 =item son
155 our @EXPORT_OK = qw(ns pp soff son stoggle hs mapwords gen_encloser nl);
160 son => ['spaceon'],
280 elsif ($arg eq 'on') { son, @_; }
|
| H A D | mdoc2man | 14 use Mdoc qw(hs ns pp mapwords son soff stoggle gen_encloser);
|
| /freebsd-9.3-release/contrib/ntp/sntp/ag-tpl/ |
| H A D | Mdoc.pm | 34 use Mdoc qw(ns pp soff son stoggle mapwords);
149 =item son
182 our @EXPORT_OK = qw(ns pp soff son stoggle hs mapwords gen_encloser nl);
187 son => ['spaceon'],
307 elsif ($arg eq 'on') { son, @_; }
|
| H A D | mdoc2man | 40 use Mdoc qw(hs ns pp mapwords son soff stoggle gen_encloser);
|
| /freebsd-9.3-release/usr.sbin/newsyslog/ |
| H A D | newsyslog.c | 251 static char *son(char *p);
1072 parse = son(line);
1085 parse = son(parse);
1098 parse = son(parse);
1140 parse = son(parse);
1174 parse = son(parse);
1189 parse = son(parse);
1199 parse = son(parse);
1217 parse = son(parse);
1259 parse = son(pars
2405 son(char *p) function
[all...] |
| /freebsd-9.3-release/usr.bin/calendar/calendars/fr_FR.ISO8859-1/ |
| H A D | calendar.proverbes | 87 Mars nous montre son venin.
146 Qu'il n'ait de neige � son chapeau.
310 11/11 Si l'hiver va droit son chemin,
336 Le soleil ne quitte pas son lit.
|
| /freebsd-9.3-release/usr.bin/calendar/calendars/ |
| H A D | calendar.history | 82 including adoptive son Marcus Junius Brutus Caepio, 44BC
|