Searched refs:predecessors (Results 1 - 4 of 4) sorted by relevance

/haiku-buildtools/gcc/gcc/
H A Dddg.h36 predecessors bitmaps held in each ddg_node. Do not make changes to
39 #define NODE_PREDECESSORS(x) ((x)->predecessors)
65 sbitmap predecessors; member in struct:ddg_node
H A Dddg.c581 && !bitmap_bit_p (dest_node->predecessors, j))
670 g->nodes[i].predecessors = sbitmap_alloc (num_nodes);
671 bitmap_clear (g->nodes[i].predecessors);
708 sbitmap_free (g->nodes[i].predecessors);
845 gcc_assert (src->successors && dest->predecessors);
848 bitmap_set_bit (dest->predecessors, src->cuid);
997 /* Given a set OPS of nodes in the DDG, find the set of their predecessors
H A Dmodulo-sched.c94 predecessors _or_ after all its successors.
1818 'PSP' previously scheduled predecessors.
1898 such cases we want to unschedule some of the predecessors/successors
2025 /* If there are at least as many successors as predecessors, schedule the
2058 MUST_PRECEDE/MUST_FOLLOW contains all predecessors/successors of
2789 sbitmap predecessors = sbitmap_alloc (num_nodes);
2792 bitmap_clear (predecessors);
2793 find_predecessors (predecessors, g, nodes_ordered);
2799 if (bitmap_and (tmp, predecessors, scc))
2844 bitmap_clear (predecessors);
2785 sbitmap predecessors = sbitmap_alloc (num_nodes); local
[all...]
H A Dreg-stack.c232 int predecessors; /* Number of predecessors that need
2945 /* No predecessors. Create an arbitrary input stack. */
3102 is only processed after all its predecessors. The number of predecessors
3119 insn inside the block. Since the number of predecessors of
3133 BLOCK_INFO (e->dest)->predecessors--;
3134 if (!BLOCK_INFO (e->dest)->predecessors)
3247 bi->predecessors++;
231 int predecessors; /* Number of predecessors that need member in struct:block_info_def

Completed in 125 milliseconds