Lines Matching full:blocks
154 // Remember the basic blocks which define new values for the alloca
229 /// blocks multiple times when promoting many allocas in the same block.
311 /// The set of basic blocks the renamer has already visited.
315 /// Contains a stable numbering of basic blocks to avoid non-determinstic
446 // If the load and store are in different blocks, use BB dominance to
515 // The trickiest case to handle is when we have large blocks. Because of this,
516 // this code is optimized assuming that large blocks happen. This does not
684 // the standard SSA construction algorithm. Determine which blocks need PHI
703 // Walks all basic blocks in the function performing the SSA rename algorithm
724 // unreachable basic blocks that were not processed by walking the dominator
771 // code. Unfortunately, there may be unreachable blocks which the renamer
797 // basic blocks. Start by sorting the incoming predecessors for efficient
814 // At this point, the blocks left in the preds list must have dummy
831 /// \brief Determine which blocks the value is live in.
833 /// These are blocks which lead to uses. Knowing this allows us to avoid
834 /// inserting PHI nodes into blocks which don't lead to uses (thus, the
841 // To determine liveness, we must iterate through the predecessors of blocks
842 // where the def is live. Blocks are added to the worklist if we need to
843 // check their predecessors. Start with all the using blocks.
847 // If any of the using blocks is also a definition block, check to see if the
881 // Now that we have a set of blocks where the phi is live-in, recursively add
918 /// standard SSA construction algorithm. Determine which blocks need phi nodes
923 // Unique the set of defining blocks for efficient lookup.
927 // Determine which blocks the value is live in. These are blocks which lead
1084 // Don't revisit blocks.
