/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
H A D | ilist_base.h | 44 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument 46 node_base_type *Final = Last.getPrev(); in removeRangeImpl() 47 Last.setPrev(Prev); in removeRangeImpl() 48 Prev->setNext(&Last); in removeRangeImpl() 56 node_base_type &Last) { in transferBeforeImpl() 57 if (&Next == &Last || &First == &Last) in transferBeforeImpl() 65 node_base_type &Final = *Last.getPrev(); in transferBeforeImpl() 68 First.getPrev()->setNext(&Last); in transferBeforeImpl() 69 Last in transferBeforeImpl() 55 transferBeforeImpl(node_base_type &Next, node_base_type &First, node_base_type &Last) transferBeforeImpl() argument 84 removeRange(T &First, T &Last) removeRange() argument 88 transferBefore(T &Next, T &First, T &Last) transferBefore() argument [all...] |
H A D | simple_ilist.h | 162 void insert(iterator I, Iterator First, Iterator Last) { in insert() argument 163 for (; First != Last; ++First) in insert() 201 iterator erase(iterator First, iterator Last) { in erase() argument 202 list_base_type::removeRange(*First.getNodePtr(), *Last.getNodePtr()); in erase() 203 return Last; in erase() 217 iterator eraseAndDispose(iterator First, iterator Last, Disposer dispose) { in eraseAndDispose() argument 218 while (First != Last) in eraseAndDispose() 220 return Last; in eraseAndDispose() 244 void splice(iterator I, simple_ilist &, iterator First, iterator Last) { in splice() argument 246 *Last in splice() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
H A D | ilist_base.h | 41 static void removeRangeImpl(node_base_type &First, node_base_type &Last) { in removeRangeImpl() argument 43 node_base_type *Final = Last.getPrev(); in removeRangeImpl() 44 Last.setPrev(Prev); in removeRangeImpl() 45 Prev->setNext(&Last); in removeRangeImpl() 53 node_base_type &Last) { in transferBeforeImpl() 54 if (&Next == &Last || &First == &Last) in transferBeforeImpl() 62 node_base_type &Final = *Last.getPrev(); in transferBeforeImpl() 65 First.getPrev()->setNext(&Last); in transferBeforeImpl() 66 Last in transferBeforeImpl() 52 transferBeforeImpl(node_base_type &Next, node_base_type &First, node_base_type &Last) transferBeforeImpl() argument 81 removeRange(T &First, T &Last) removeRange() argument 85 transferBefore(T &Next, T &First, T &Last) transferBefore() argument [all...] |
H A D | simple_ilist.h | 166 void insert(iterator I, Iterator First, Iterator Last) { in insert() argument 167 for (; First != Last; ++First) in insert() 205 iterator erase(iterator First, iterator Last) { in erase() argument 206 list_base_type::removeRange(*First.getNodePtr(), *Last.getNodePtr()); in erase() 207 return Last; in erase() 221 iterator eraseAndDispose(iterator First, iterator Last, Disposer dispose) { in eraseAndDispose() argument 222 while (First != Last) in eraseAndDispose() 224 return Last; in eraseAndDispose() 248 void splice(iterator I, simple_ilist &, iterator First, iterator Last) { in splice() argument 250 *Last in splice() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
H A D | SwitchLoweringUtils.cpp | 21 unsigned First, unsigned Last) { in getJumpTableRange() 22 assert(Last >= First); in getJumpTableRange() 24 const APInt &HighCase = Clusters[Last].High->getValue(); in getJumpTableRange() 35 unsigned First, unsigned Last) { in getJumpTableNumCases() 36 assert(Last >= First); in getJumpTableNumCases() 37 assert(TotalCases[Last] >= TotalCases[First]); in getJumpTableNumCases() 39 TotalCases[Last] - (First == 0 ? 0 : TotalCases[First - 1]); in getJumpTableNumCases() 169 for (unsigned First = 0, Last; First < N; First = Last + 1) { in findJumpTables() 170 Last in findJumpTables() 20 getJumpTableRange(const CaseClusterVector &Clusters, unsigned First, unsigned Last) getJumpTableRange() argument 34 getJumpTableNumCases(const SmallVectorImpl<unsigned> &TotalCases, unsigned First, unsigned Last) getJumpTableNumCases() argument 187 buildJumpTable(const CaseClusterVector &Clusters, unsigned First, unsigned Last, const SwitchInst *SI, MachineBasicBlock *DefaultMBB, CaseCluster &JTCluster) buildJumpTable() argument 361 buildBitTests(CaseClusterVector &Clusters, unsigned First, unsigned Last, const SwitchInst *SI, CaseCluster &BTCluster) buildBitTests() argument [all...] |
H A D | ReachingDefAnalysis.cpp | 265 for (auto Last = MBB->rbegin(), End = MBB->rend(); Last != End; ++Last) { 266 LiveRegs.stepBackward(*Last); 268 return InstIds[&*Last] > InstIds[MI]; 280 MachineInstr *Last = &MBB->back(); 282 if (getReachingDef(Last, PhysReg) != Def) 286 for (auto &MO : Last->operands()) 300 MachineInstr *Last = &MBB->back(); 301 int Def = getReachingDef(Last, PhysRe [all...] |
H A D | InterferenceCache.cpp | 165 BI->First = BI->Last = SlotIndex(); in update() 228 if (!BI->Last.isValid() || StopI > BI->Last) in update() 229 BI->Last = StopI; in update() 245 if (!BI->Last.isValid() || StopI > BI->Last) in update() 246 BI->Last = StopI; in update() 252 SlotIndex Limit = BI->Last.isValid() ? BI->Last : Start; in update() 258 BI->Last in update() [all...] |
H A D | BranchRelaxation.cpp | 355 // Last MI in the BB is an unconditional branch. We can simply invert the in fixupConditionalBranch() 488 MachineBasicBlock::iterator Last = MBB.getLastNonDebugInstr(); in relaxBranchInstructions() local 489 if (Last == MBB.end()) in relaxBranchInstructions() 497 if (Last->isUnconditionalBranch()) { in relaxBranchInstructions() 500 if (MachineBasicBlock *DestBB = TII->getBranchDestBlock(*Last)) { in relaxBranchInstructions() 501 if (!isBlockInRange(*Last, *DestBB)) { in relaxBranchInstructions() 502 fixupUnconditionalBranch(*Last); in relaxBranchInstructions()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/ |
H A D | StringView.h | 25 const char *Last; member in StringView 31 StringView(const char (&Str)[N]) : First(Str), Last(Str + N - 1) {} in StringView() 33 : First(First_), Last(Last_) {} in StringView() 35 : First(First_), Last(First_ + Len) {} in StringView() 36 StringView(const char *Str) : First(Str), Last(Str + std::strlen(Str)) {} in StringView() 37 StringView() : First(nullptr), Last(nullptr) {} in StringView() 65 return StringView(First + N, Last); in dropFront() 71 return StringView(First, Last - N); in dropBack() 114 const char *end() const { return Last; } in end() 115 size_t size() const { return static_cast<size_t>(Last in end() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/ |
H A D | IceRangeSpec.cpp | 39 /// Helper function to parse "X" or "X:Y" into First and Last. 49 void getRange(const std::string &Token, uint32_t *First, uint32_t *Last) { in getRange() argument 54 *Last = *First + 1; in getRange() 57 *Last = Tokens[1].empty() ? RangeSpec::RangeMax : std::stoul(Tokens[1]); in getRange() 61 if (*First >= *Last) { in getRange() 80 uint32_t First = 0, Last = 0; in record() local 81 getRange(Token, &First, &Last); in record() 82 if (Last == RangeSpec::RangeMax) { in record() 85 if (Last >= D->Numbers.size()) in record() 86 D->Numbers.resize(Last in record() [all...] |
H A D | IceMangling.cpp | 52 size_t Last; in incrementSubstitutions() local 53 for (Last = OldPos + 1; Last < OldLen; ++Last) { in incrementSubstitutions() 54 char Ch = OldName[Last]; in incrementSubstitutions() 68 size_t Length = Last - OldPos; in incrementSubstitutions() 105 OldPos = Last; in incrementSubstitutions()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/Interpreter/ |
H A D | ExternalFunctions.cpp | 360 char Last = *FB++ = *FmtStr++; in lle_X_sprintf() local 362 while (Last != 'c' && Last != 'd' && Last != 'i' && Last != 'u' && in lle_X_sprintf() 363 Last != 'o' && Last != 'x' && Last != 'X' && Last != 'e' && in lle_X_sprintf() 364 Last ! in lle_X_sprintf() [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARC/ |
H A D | ARCFrameLowering.cpp | 79 unsigned Last = 0; in determineLastCalleeSave() local 83 if (Reg.getReg() > Last) in determineLastCalleeSave() 84 Last = Reg.getReg(); in determineLastCalleeSave() 86 return Last; in determineLastCalleeSave() 130 unsigned Last = determineLastCalleeSave(CSI); in emitPrologue() local 156 if (UseSaveRestoreFunclet && Last > ARC::R14) { in emitPrologue() 159 StackSlotsUsedByFunclet = Last - ARC::R12; in emitPrologue() 166 .addExternalSymbol(store_funclet_name[Last - ARC::R15]) in emitPrologue() 266 unsigned Last = determineLastCalleeSave(CSI); in emitEpilogue() local 269 if (UseSaveRestoreFunclet && Last > AR in emitEpilogue() 353 unsigned Last = determineLastCalleeSave(CSI); assignCalleeSavedSpillSlots() local 409 unsigned Last = determineLastCalleeSave(CSI); spillCalleeSavedRegisters() local 426 unsigned Last = determineLastCalleeSave(CSI); restoreCalleeSavedRegisters() local [all...] |
H A D | ARCOptAddrMode.cpp | 236 LLVM_DEBUG(MachineInstr *First = &Ldst; MachineInstr *Last = &Add; in tryToCombine() 237 if (MDT->dominates(Last, First)) std::swap(First, Last); in tryToCombine() 238 dbgs() << "[ABAW] Instructions " << *First << " and " << *Last in tryToCombine() 270 MachineInstr *Last = Ldst; in canJoinInstructions() local 272 std::swap(First, Last); in canJoinInstructions() 276 LLVM_DEBUG(dbgs() << "canJoinInstructions: " << *First << *Last); in canJoinInstructions() local 323 if (noUseOfAddBeforeLoadOrStore(First, Last)) { in canJoinInstructions() 324 Result = Last; in canJoinInstructions()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/ |
H A D | X86OptimizeLEAs.cpp | 264 int calcInstrDist(const MachineInstr &First, const MachineInstr &Last); 280 /// Returns true if the \p Last LEA instruction can be replaced by the 283 /// replacement of the \p Last LEA's uses with the \p First's def register. 284 bool isReplaceable(const MachineInstr &First, const MachineInstr &Last, 320 const MachineInstr &Last) { in calcInstrDist() 323 assert(Last.getParent() == First.getParent() && in calcInstrDist() 326 InstrPos.find(&Last) != InstrPos.end() && in calcInstrDist() 329 return InstrPos[&Last] - InstrPos[&First]; in calcInstrDist() 418 // Check that the Last LEA can be replaced by the First LEA. To be so, 422 // 3) All uses of the Last LE 319 calcInstrDist(const MachineInstr &First, const MachineInstr &Last) calcInstrDist() argument 424 isReplaceable(const MachineInstr &First, const MachineInstr &Last, int64_t &AddrDispShift) const isReplaceable() argument 610 MachineInstr &Last = **I2; removeRedundantLEAs() local [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ProfileData/Coverage/ |
H A D | CoverageMapping.cpp | 384 const auto &Last = Segments.back(); 385 if (Last.HasCount == HasCount && Last.Count == Region.ExecutionCount && 386 !Last.IsRegionEntry) 398 const auto &Last = Segments.back(); 399 dbgs() << "Segment at " << Last.Line << ":" << Last.Col 400 << " (count = " << Last.Count << ")" 401 << (Last.IsRegionEntry ? ", RegionEntry" : "") 402 << (!Last [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
H A D | DIE.h | 510 Node *Last = nullptr; 512 bool empty() const { return !Last; } in empty() 518 if (Last) { in push_back() 519 N.Next = Last->Next; in push_back() 520 Last->Next.setPointerAndInt(&N, false); in push_back() 522 Last = &N; in push_back() 529 if (Last) { in push_front() 530 N.Next.setPointerAndInt(Last->Next.getPointer(), false); in push_front() 531 Last->Next.setPointerAndInt(&N, true); in push_front() 533 Last in push_front() [all...] |
H A D | SwitchLoweringUtils.h | 177 APInt Last; member 185 : First(std::move(F)), Last(std::move(L)), SValue(SV), HeaderBB(H), in JumpTableHeader() 228 unsigned Last); 232 unsigned First, unsigned Last); 272 unsigned Last, const SwitchInst *SI, 278 /// Build a bit test cluster from Clusters[First..Last]. Returns false if it 280 bool buildBitTests(CaseClusterVector &Clusters, unsigned First, unsigned Last,
|
/third_party/rust/crates/clap/src/builder/ |
H A D | arg_settings.rs | 38 Last, 86 Last => Flags::LAST, 122 .setting(ArgSettings::Required | ArgSettings::Hidden | ArgSettings::Last); in setting_bitor() 134 .setting(ArgSettings::Last); in unset_setting_bitor() 140 let m = m.unset_setting(ArgSettings::Required | ArgSettings::Hidden | ArgSettings::Last); in unset_setting_bitor()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/ |
H A D | DebugLoc.cpp | 87 DILocation *Last = InlinedAt; in appendInlinedAt() local 94 Last = cast<DILocation>(Found); in appendInlinedAt() 108 Cache[MD] = Last = DILocation::getDistinct( in appendInlinedAt() 109 Ctx, MD->getLine(), MD->getColumn(), MD->getScope(), Last); in appendInlinedAt() 111 return Last; in appendInlinedAt()
|
/third_party/skia/src/core/ |
H A D | SkTBlockList.h | 121 int releaseIndex = Last(block); in pop_back() 160 count += (sizeof(T) + Last(b) - First(b)) / sizeof(T); in count() 191 return GetItem(fAllocator->currentBlock(), Last(fAllocator->currentBlock())); in back() 195 return GetItem(fAllocator->currentBlock(), Last(fAllocator->currentBlock())); in back() 212 int end = Last(b) + sizeof(T); // exclusive in item() 244 static int Last(const SkBlockAllocator::Block* b) { in Last() function in SkTBlockList 272 using Iter = BlockIndexIterator<T&, true, false, &First, &Last, &Increment, &GetItem>; 273 using CIter = BlockIndexIterator<const T&, true, true, &First, &Last, &Increment, &GetItem>; 274 using RIter = BlockIndexIterator<T&, false, false, &Last, &First, &Decrement, &GetItem>; 275 using CRIter = BlockIndexIterator<const T&, false, true, &Last, [all...] |
/third_party/typescript/tests/baselines/reference/ |
H A D | variadicTuples1.js | 215 type Last<T extends readonly unknown[]> = 244 type T20 = Last<[number, symbol, string]>; 245 type T21 = Last<[symbol, string]>; 246 type T22 = Last<[string]>; 247 type T23 = Last<[number, symbol, ...string[]]>; 248 type T24 = Last<[symbol, ...string[]]>; 249 type T25 = Last<[string?]>; 250 type T26 = Last<string[]>; 251 type T27 = Last<[]>; 252 type T28 = Last<an [all...] |
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
H A D | ScalarEvolutionAliasAnalysis.cpp | 107 const SCEV *Last = A->getOperand(A->getNumOperands() - 1); in GetBaseValue() local 108 if (Last->getType()->isPointerTy()) in GetBaseValue() 109 return GetBaseValue(Last); in GetBaseValue()
|
/third_party/mesa3d/src/gallium/auxiliary/tgsi/ |
H A D | tgsi_two_side.c | 75 unsigned range_end = decl->Range.Last + 1; in xform_decl() 115 decl.Range.First = decl.Range.Last = ts->num_inputs++; in emit_prolog() 128 decl.Range.Last = ts->num_temps + num_colors - 1; in emit_prolog() 140 decl.Range.First = decl.Range.Last = ts->num_inputs++; in emit_prolog()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
H A D | PPCTLSDynamicCall.cpp | 137 MachineBasicBlock::iterator Last = I; in processBlock() local 138 --Last; in processBlock() 145 LIS->repairIntervalsInRange(&MBB, First, Last, OrigRegs); in processBlock()
|