Searched refs:father (Results 1 - 10 of 10) sorted by relevance
/haiku-buildtools/gcc/gcc/ |
H A D | et-forest.h | 62 struct et_node *father; /* Father of the node. */ member in struct:et_node
|
H A D | graphite-poly.h | 813 loop does not have a loop father and it is just a container, as 855 /* Returns the predecessor of LST in the sequence of its loop father. 862 lst_p father; 871 father = LST_LOOP_FATHER (lst); 872 return LST_SEQ (father)[dewey - 1]; 875 /* Returns the successor of LST in the sequence of its loop father. 882 lst_p father; 888 father = LST_LOOP_FATHER (lst); 890 if (LST_SEQ (father).length () == (unsigned) dewey + 1) 893 return LST_SEQ (father)[dewe 1183 lst_p father; local [all...] |
H A D | et-forest.c | 482 nw->father = NULL; 501 if (t->father) 528 /* Sets father of et tree T to FATHER. */ 531 et_set_father (struct et_node *t, struct et_node *father) argument 537 new_f_occ = et_new_occ (father); 539 rmost = father->rightmost_occ; 565 t->father = father; 566 right = father->son; 577 father 590 struct et_node *father = t->father; local [all...] |
H A D | graphite-interchange.c | 636 lst_p father; local 641 father = LST_LOOP_FATHER (loop); 642 if (father) 644 while (lst_interchange_select_inner (scop, father, outer, loop)) 647 loop = LST_SEQ (father)[outer];
|
H A D | cfgloop.c | 291 establish_preds (struct loop *loop, struct loop *father) 294 unsigned depth = loop_depth (father) + 1; 299 FOR_EACH_VEC_SAFE_ELT (father->superloops, i, ploop) 301 loop->superloops->quick_push (father); 307 /* Add LOOP to the loop hierarchy tree where FATHER is father of the 312 flow_loop_tree_node_add (struct loop *father, struct loop *loop) 314 loop->next = father->inner; 315 father->inner = loop; 317 establish_preds (loop, father); 325 struct loop *prev, *father; 290 establish_preds(struct loop *loop, struct loop *father) argument 311 flow_loop_tree_node_add(struct loop *father, struct loop *loop) argument 324 struct loop *prev, *father; local [all...] |
H A D | cfgloopmanip.c | 147 struct loop *father = current_loops->tree_root, *act; local 153 if (flow_loop_nested_p (father, act)) 154 father = act; 157 if (father != loop_outer (loop)) 159 for (act = loop_outer (loop); act != father; act = loop_outer (act)) 162 flow_loop_tree_node_add (father, loop);
|
H A D | dominance.c | 639 if (!bb->dom[dir_index]->father) 729 if (!node->father) 732 return (basic_block) node->father->data; 746 if (node->father) 748 if (node->father->data == dominated_by) 1472 return (basic_block) (next->father->son == next ? NULL : next->data);
|
H A D | tree-ssa-reassoc.c | 308 struct loop *father = bb->loop_father; local 315 if (!father->latch) 319 if (bb != father->header 320 || father->inner) 331 || gimple_bb (use_stmt)->loop_father != father) 342 if (gimple_bb (def_stmt)->loop_father == father) 343 return bb_rank[father->latch->index] + PHI_LOOP_BIAS;
|
/haiku-buildtools/legacy/binutils/binutils/ |
H A D | ieee.c | 1912 bfd_vma attr, frame_type, push_mask, nargs, level, father; local 1987 || ! ieee_read_optional_number (info, pp, &father, &present))
|
/haiku-buildtools/binutils/binutils/ |
H A D | ieee.c | 1922 bfd_vma attr, frame_type, push_mask, nargs, level, father; local 1997 || ! ieee_read_optional_number (info, pp, &father, &present))
|
Completed in 278 milliseconds