Lines Matching refs:back
1236 // once and deciding on the best order right away with no back-tracking.
1470 /// Points back to the VectorizableTree.
1474 /// Thus we need a reference back to the container to translate the indices
1655 TreeEntry *Last = VectorizableTree.back().get();
2253 /// value must be signed-extended, rather than zero-extended, back to its
2647 VectorizableTree.back()->setOperand(0, Op0);
2670 VectorizableTree.back()->setOperand(0, Op0);
2721 PtrN = PointerOps.back();
2724 PtrN = PointerOps[CurrentOrder.back()];
2983 PtrN = PointerOps.back();
2986 PtrN = PointerOps[CurrentOrder.back()];
3400 // Add back the cost of s|zext which is subtracted separately.
3880 // extend the extracted value back to the original type. Here, we account
3981 // scheduled, and the last instruction is VL.back(). So we start with
3982 // VL.back() and iterate over schedule data until we reach the end of the
3986 BlocksSchedules[BB]->getScheduleData(E->isOneOf(E->Scalars.back()));
3995 // VL.back(). This can be the case if buildTree_rec aborts for various
4964 ScheduleData *pickedSD = ReadyInsts.back();
5011 return &(ScheduleDataChunks.back()[ChunkPos++]);
5136 ScheduleData *SD = WorkList.back();
5531 // True if the roots can be zero-extended back to their original type, rather
5569 // the existing sign bit so we can safely sign-extend the root back to the
5875 !VectorizedStores.count(Slice.back()) &&
6724 Instruction *TreeN = Stack.back().first;
6725 unsigned EdgeToVist = Stack.back().second++;
6771 markExtraArg(Stack.back(), I);
6781 markExtraArg(Stack.back(), I);
6789 markExtraArg(Stack.back(), I);
6797 markExtraArg(Stack.back(), I);
6807 markExtraArg(Stack.back(), NextV);
7061 ReductionData.getFlags(), ReductionOps.back());