Lines Matching full:basic
133 // the same basic block.
138 // Remember the basic blocks which define new values for the alloca
184 /// This functionality is important because it avoids scanning large basic
266 /// The set of basic blocks the renamer has already visited.
270 /// Contains a stable numbering of basic blocks to avoid non-determinstic
431 /// Many allocas are only used within a single basic block. If this is the
433 /// PHI nodes by just performing a single linear pass over the basic block
565 // If the alloca is only read and written in one basic block, just perform a
626 // Set the incoming values for the basic block to be null values for all of
634 // Walks all basic blocks in the function performing the SSA rename algorithm
655 // unreachable basic blocks that were not processed by walking the dominator
711 // We want to do this once per basic block. As such, only process a block
728 // basic blocks. Start by sorting the incoming predecessors for efficient
929 /// \brief Queue a phi-node to be added to a basic-block for a specific Alloca.
934 // Look up the basic-block in question.
