HomeSort by: relevance | last modified time | path
    Searched defs:son (Results 1 - 25 of 27) sorted by relevancy

1 2

  /src/external/gpl3/gcc/dist/gcc/
et-forest.h 63 struct et_node *son; /* The first of the sons of the node. */ member in struct:et_node
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
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...]
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...]
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);
predict.cc 3299 basic_block son;
3347 for (son = first_dom_son (CDI_POST_DOMINATORS, cur);
3348 son;
3349 son = next_dom_son (CDI_POST_DOMINATORS, son))
3350 predict_paths_for_bb (son, bb, pred, taken, visited, in_loop);
3296 basic_block son; local
tree-into-ssa.cc 2809 basic_block son; local
2817 for (son = first_dom_son (CDI_DOMINATORS, bb);
2818 son;
2819 son = next_dom_son (CDI_DOMINATORS, son))
2820 worklist[sp++] = son;
trans-mem.cc 4553 basic_block son;
4554 for (son = first_dom_son (CDI_DOMINATORS, bb);
4555 son;
4556 son = next_dom_son (CDI_DOMINATORS, son))
4560 if ((!old_irr || !bitmap_bit_p (old_irr, son->index))
4561 && bitmap_bit_p (all_region_blocks, son->index))
4562 bitmap_set_bit (new_irr, son->index);
4542 basic_block son; local
tree-cfg.cc 7035 basic_block son; local
7037 for (son = first_dom_son (CDI_DOMINATORS, entry);
7038 son;
7039 son = next_dom_son (CDI_DOMINATORS, son))
7041 bbs_p->safe_push (son);
7042 if (son != exit)
7043 gather_blocks_in_sese_region (son, exit, bbs_p);
tree-ssa-reassoc.cc 6351 basic_block son; local
6383 for (son = first_dom_son (CDI_DOMINATORS, bb);
6384 son;
6385 son = next_dom_son (CDI_DOMINATORS, son))
6386 break_up_subtract_bb (son);
7005 basic_block son; local
7268 for (son = first_dom_son (CDI_POST_DOMINATORS, bb);
7269 son;
7270 son = next_dom_son (CDI_POST_DOMINATORS, son)
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
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);
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
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...]
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);
tree-into-ssa.cc 2728 basic_block son; local
2736 for (son = first_dom_son (CDI_DOMINATORS, bb);
2737 son;
2738 son = next_dom_son (CDI_DOMINATORS, son))
2739 worklist[sp++] = son;
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);
predict.cc 3200 basic_block son;
3248 for (son = first_dom_son (CDI_POST_DOMINATORS, cur);
3249 son;
3250 son = next_dom_son (CDI_POST_DOMINATORS, son))
3251 predict_paths_for_bb (son, bb, pred, taken, visited, in_loop);
3197 basic_block son; local
tree-ssa-pre.cc 3878 basic_block block, son; local
3914 for (son = first_dom_son (CDI_DOMINATORS, ENTRY_BLOCK_PTR_FOR_FN (fun));
3915 son;
3916 son = next_dom_son (CDI_DOMINATORS, son))
3917 worklist[sp++] = son;
4268 for (son = first_dom_son (CDI_DOMINATORS, block);
4269 son;
4270 son = next_dom_son (CDI_DOMINATORS, son))
    [all...]
trans-mem.cc 4538 basic_block son;
4539 for (son = first_dom_son (CDI_DOMINATORS, bb);
4540 son;
4541 son = next_dom_son (CDI_DOMINATORS, son))
4545 if ((!old_irr || !bitmap_bit_p (old_irr, son->index))
4546 && bitmap_bit_p (all_region_blocks, son->index))
4547 bitmap_set_bit (new_irr, son->index);
4527 basic_block son; local
  /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/public-domain/xz/dist/src/liblzma/lz/
lz_encoder.h 107 uint32_t *son; member in struct:lzma_mf_s
131 /// 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/external/bsd/openldap/dist/servers/slapd/overlays/
syncprov.c 182 slap_overinst *son; member in struct:opcookie
1219 syncprov_info_t *si = opc->son->on_bi.bi_private;
1319 slap_overinst *on = opc->son;
1528 slap_overinst *on = opc->son;
1666 slap_overinst *on = opc->son;
2470 slap_overinst *on = opc->son;
2706 opc->son = on;
3176 opc.son = on;

Completed in 66 milliseconds

1 2