Lines Matching defs:to
16 * 2 along with this work; if not, write to the Free Software Foundation,
43 // Map dense integer indices to Blocks. Uses classic doubling-array trick.
44 // Abstractly provides an infinite array of Block*'s, initialized to NULL.
46 // allocation I do not need a destructor to reclaim storage.
49 uint _size; // allocated size, as opposed to formal limit
50 debug_only(uint _limit;) // limit to formal domain
53 void grow( uint i ); // Grow array node to fit
56 Arena *_arena; // Arena to allocate in
69 // Extend the mapping: index i maps to Block *n.
116 // every Node will get pinned to some block.
120 // input edges to Regions and Phis.
127 // Basic blocks have some number of Nodes which split control to all
133 // used to find loops, loop nesting depth, dominators, etc.
140 CFGLoop *_loop; // Loop to which this block belongs
146 void update_uncommon_branch(Block* un); // Lower branch prob to uncommon code
161 // The previous block will insert nops to get this alignment.
165 // BLOCK_FREQUENCY is a sentinel to mark uses of constant block frequencies.
166 // It is currently also used to scale such frequencies relative to
167 // FreqCountInvocations relative to the old value of 1500.
194 // Align a loop if loop's padding is less or equal to padding limit
276 // Add an instruction to an existing block. It must go after the head
284 // helper function that adds caller save registers to MachProjNode
297 // with suitable memory ops nearby. Use the memory op to do the NULL check.
329 // Examine block's code shape to predict if it is not commonly executed.
332 // Use frequency calculations and code shape to predict if the block
356 // Setup 'vertex' as DFS to vertex mapping.
357 // Setup 'semi' as vertex to DFS mapping.
358 // Set 'parent' to DFS parent.
361 // Helper function to insert a node into a block
384 Block_Array _bbs; // Map Nodes to owning Basic Block
408 // basic blocks; i.e. _bbs now maps _idx for all Nodes to some Block.
425 // block to place the node.
429 // to late. Helper for schedule_late.
445 // Check for NeverBranch at block end. This needs to become a GOTO to the
447 // goes the same direction for most of the optimizer and are used to give a
448 // fake exit path to infinite loops. At this late stage they need to turn
475 // Map Block indices to a block-index for a cfg-cover.
483 void reset( uint max ); // Reset to identity map for [0..max]
514 float _prob; // probability of edge to block
530 CFGLoop *_child; // first child, use child's sibling to visit all immediately nested loops
596 connected, // edge used to connect two traces together
597 interior // edge is interior to trace (could be backedge)
600 CFGEdge(Block *from, Block *to, float freq, int from_pct, int to_pct) :
601 _from(from), _to(to), _freq(freq),
608 Block* to () const { return _to; }
625 Block ** _next_list; // Array mapping index to next block
626 Block ** _prev_list; // Array mapping index to previous block
638 // We've discovered a loop in this trace. Reset last to be "b", and first as
690 // Append another trace to this one.
734 void union_traces(Trace* from, Trace* to);