Lines Matching full:back
325 // Trace the sub-value needed by the return value as far back up the graph as
328 // that we end up back at the tail call instruction itself.
376 /// represented is SubTypes.back()->getTypeAtIndex(Path.back() - 1).
383 /// false. SubTypes.back()->getTypeAtIndex(Path.back()) is either an empty
388 // First march back up the tree until we can successfully increment one of the
390 while (!Path.empty() && !indexReallyValid(SubTypes.back(), Path.back() + 1)) {
399 // We know there's *some* valid leaf now, so march back down the tree picking
401 ++Path.back();
402 Type *DeeperType = SubTypes.back()->getTypeAtIndex(Path.back());
447 while (SubTypes.back()->getTypeAtIndex(Path.back())->isAggregateType()) {
464 } while (SubTypes.back()->getTypeAtIndex(Path.back())->isAggregateType());
560 Type *SlotType = RetSubTypes.back()->getTypeAtIndex(RetPath.back());
