| /src/external/gpl3/gcc/dist/gcc/ |
| dominance.cc | 646 if (n->son)
647 n = n->son;
650 while (!n->right || n->right == n->father->son)
900 struct et_node *node = bb->dom[dir_index], *son = node->son, *ason; local
905 if (!son)
908 bbs.safe_push ((basic_block) son->data);
909 for (ason = son->right; ason != son; ason = ason->right)
959 basic_block son; local
990 struct et_node *bb_node, *to_node, *son; local
1402 int *parent, *son, *brother; local
1593 struct et_node *son = bb->dom[dir_index]->son; local
1669 basic_block son; local
[all...] |
| et-forest.h | 63 struct et_node *son; /* The first of the sons of the node. */ member in struct:et_node
|
| graphds.cc | 408 /* Determines the dominance tree of G (stored in the PARENT, SON and BROTHER
413 int *parent, int *son, int *brother)
442 son[i] = -1;
480 brother[i] = son[parent[i]];
481 son[parent[i]] = i;
|
| et-forest.cc | 46 struct et_occ *prev; /* Left son in the splay-tree. */
47 struct et_occ *next; /* Right son in the splay-tree. */
471 nw->son = NULL;
484 while (t->son)
485 et_split (t->son);
552 right = father->son;
563 father->son = t;
606 if (father->son == t)
607 father->son = t->right;
608 if (father->son == t
[all...] |
| cfg.cc | 1215 basic_block son;
1223 for (son = first_dom_son (CDI_DOMINATORS, worklist.pop ());
1224 son;
1225 son = next_dom_son (CDI_DOMINATORS, son))
1227 son->count = son->count.apply_scale (num, den);
1228 worklist.safe_push (son);
1207 basic_block son; local
|
| sanopt.cc | 803 basic_block son; local
909 for (son = first_dom_son (CDI_DOMINATORS, bb);
910 son;
911 son = next_dom_son (CDI_DOMINATORS, son))
912 sanopt_optimize_walker (son, ctx);
|
| tree-vect-loop-manip.cc | 1950 for (auto son = first_dom_son (CDI_DOMINATORS, old_dom);
1951 son; son = next_dom_son (CDI_DOMINATORS, son))
1952 if (!flow_bb_inside_loop_p (loop, son))
1953 queue.safe_push (son);
1954 for (auto son : queue)
1956 son, get_bb_copy (old_dom));
3384 for (auto son = first_dom_son (CDI_DOMINATORS, old_dom);
3385 son; son = next_dom_son (CDI_DOMINATORS, son)
[all...] |
| cfgloop.cc | 915 basic_block son, postpone = NULL;
918 for (son = first_dom_son (CDI_DOMINATORS, bb);
919 son;
920 son = next_dom_son (CDI_DOMINATORS, son))
922 if (!flow_bb_inside_loop_p (loop, son))
925 if (dominated_by_p (CDI_DOMINATORS, loop->latch, son))
927 postpone = son;
930 fill_sons_in_loop (loop, son, tovisit, tv);
914 basic_block son, postpone = NULL; local
|
| cfgloopmanip.cc | 437 corresponding loop and add it to loops tree. Insert the LOOP as a son of
509 basic_block son; local
517 for (son = first_dom_son (CDI_DOMINATORS, worklist.pop ());
518 son;
519 son = next_dom_son (CDI_DOMINATORS, son))
521 if (!flow_bb_inside_loop_p (loop, son))
523 son->count = son->count.apply_scale (num, den);
524 worklist.safe_push (son);
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| dominance.cc | 646 if (n->son)
647 n = n->son;
650 while (!n->right || n->right == n->father->son)
897 struct et_node *node = bb->dom[dir_index], *son = node->son, *ason; local
902 if (!son)
905 bbs.safe_push ((basic_block) son->data);
906 for (ason = son->right; ason != son; ason = ason->right)
956 basic_block son; local
987 struct et_node *bb_node, *to_node, *son; local
1399 int *parent, *son, *brother; local
1590 struct et_node *son = bb->dom[dir_index]->son; local
1666 basic_block son; local
[all...] |
| et-forest.h | 63 struct et_node *son; /* The first of the sons of the node. */ member in struct:et_node
|
| tree-ssa-sink.cc | 670 basic_block son; local
763 for (son = first_dom_son (CDI_POST_DOMINATORS, bb);
764 son;
765 son = next_dom_son (CDI_POST_DOMINATORS, son))
767 todo |= sink_code_in_bb (son);
|
| graphds.cc | 401 /* Determines the dominance tree of G (stored in the PARENT, SON and BROTHER
406 int *parent, int *son, int *brother)
435 son[i] = -1;
473 brother[i] = son[parent[i]];
474 son[parent[i]] = i;
|
| et-forest.cc | 46 struct et_occ *prev; /* Left son in the splay-tree. */
47 struct et_occ *next; /* Right son in the splay-tree. */
471 nw->son = NULL;
484 while (t->son)
485 et_split (t->son);
552 right = father->son;
563 father->son = t;
606 if (father->son == t)
607 father->son = t->right;
608 if (father->son == t
[all...] |
| tree-ssa-loop-manip.cc | 1127 basic_block son; local
1132 for (son = first_dom_son (CDI_DOMINATORS, bb);
1133 son;
1134 son = next_dom_son (CDI_DOMINATORS, son))
1136 if (!flow_bb_inside_loop_p (loop, son))
1138 scale_bbs_frequencies_profile_count (&son, 1, num, den);
1139 scale_dominated_blocks_in_loop (loop, son, num, den);
|
| sanopt.cc | 779 basic_block son; local
885 for (son = first_dom_son (CDI_DOMINATORS, bb);
886 son;
887 son = next_dom_son (CDI_DOMINATORS, son))
888 sanopt_optimize_walker (son, ctx);
|
| cfgloop.cc | 922 basic_block son, postpone = NULL;
925 for (son = first_dom_son (CDI_DOMINATORS, bb);
926 son;
927 son = next_dom_son (CDI_DOMINATORS, son))
929 if (!flow_bb_inside_loop_p (loop, son))
932 if (dominated_by_p (CDI_DOMINATORS, loop->latch, son))
934 postpone = son;
937 fill_sons_in_loop (loop, son, tovisit, tv);
921 basic_block son, postpone = NULL; local
|
| /src/external/public-domain/xz/dist/src/liblzma/lz/ |
| lz_encoder_mf.c | 128 // Do the same for mf->son.
130 // NOTE: There may be uninitialized elements in mf->son.
135 if (mf->son[i] <= subvalue)
136 mf->son[i] = EMPTY_HASH_VALUE;
138 mf->son[i] -= subvalue;
224 mf->son, mf->cyclic_pos, mf->cyclic_size, \
244 /// \param son lzma_mf.son (contains the hash chain)
256 uint32_t *const son,
262 son[cyclic_pos] = cur_match
[all...] |
| lz_encoder.c | 296 // Calculate the sizes of mf->hash and mf->son and check that
353 lzma_free(mf->son, allocator);
354 mf->son = NULL;
412 // We don't need to initialize mf->son, but not doing that may
416 // actually compressed: most of the mf->son won't get actually
422 mf->son = lzma_alloc(mf->sons_count * sizeof(uint32_t),
425 if (mf->hash == NULL || mf->son == NULL) {
429 lzma_free(mf->son, allocator);
430 mf->son = NULL;
470 .son = NULL
[all...] |
| lz_encoder.h | 100 uint32_t *son; member in struct:lzma_mf_s
124 /// Number of elements in son[]
|
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_rb.c | 409 * Change the son's parentage to point to his grandpa.
428 * Have our son/standin adopt his brother as his new son.
441 * Adopt the far son.
453 * Move the only remaining son to our standin. If our standin is our
454 * son, this will be the only son needed to be moved.
483 struct archive_rb_node *son = self->rb_nodes[which];
489 RB_COPY_PROPERTIES(son, self);
490 father->rb_nodes[RB_POSITION(son)] = son
478 struct archive_rb_node *son = self->rb_nodes[which]; local
[all...] |
| /src/common/lib/libc/gen/ |
| rbtree.c | 613 * Change the son's parentage to point to his grandpa.
636 * Have our son/standin adopt his brother as his new son.
649 * Adopt the far son.
662 * Move the only remaining son to our standin. If our standin is our
663 * son, this will be the only son needed to be moved.
716 struct rb_node *son = self->rb_nodes[which]; local
722 KASSERT(RB_BLACK_P(self) && RB_RED_P(son));
723 KASSERT(!RB_TWOCHILDREN_P(son));
[all...] |
| /src/external/bsd/ntp/dist/sntp/ag-tpl/0-old/ |
| 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, @_; }
|
| /src/usr.sbin/sysinst/arch/i386/ |
| msg.md.es | 115 con un disco conocido por BIOS, los valores anteriores son probablemente
117 cabezales y sectores son probablemente 1023, 255 y 63 - esto es correcto).
|
| /src/usr.sbin/sysinst/ |
| msg.pm.es | 89 message raid_nomultidim {Matrices multidimensionales no son compatibles!}
|
