Lines Matching full:incoming
633 // Set the incoming values for the basic block to be null values for all of
679 // rid of because they merge all of the same incoming values. This can
713 // have incoming values for all predecessors. Loop over all PHI nodes we have
714 // created, inserting undef values if they are missing any incoming values.
727 // Only do work here if there the PHI nodes are missing incoming values. We
729 // number of incoming values, so we can just check any of them.
737 // basic blocks. Start by sorting the incoming predecessors for efficient
983 // because it is missing incoming edges. All other PHI nodes being
984 // inserted by this pass of mem2reg will have the same number of incoming
996 // Add N incoming values to the PHI node.
