Searched refs:CurrentIndex (Results 1 – 8 of 8) sorted by relevance
489 const NameIndex *CurrentIndex = nullptr;534 return A.CurrentIndex == B.CurrentIndex && A.DataOffset == B.DataOffset;544 const NameIndex *CurrentIndex; variable550 assert(CurrentName <= CurrentIndex->getNameCount()); in next()563 NameIterator(const NameIndex *CurrentIndex, uint32_t CurrentName) in NameIterator() argument564 : CurrentIndex(CurrentIndex), CurrentName(CurrentName) {} in NameIterator()567 return CurrentIndex->getNameTableEntry(CurrentName);580 return A.CurrentIndex == B.CurrentIndex && A.CurrentName == B.CurrentName;
953 SlotIndex CurrentIndex = LRPosInfo[0].Begin; in extractInstructionFeatures() local967 while (CurrentIndex <= LRPosInfo[CurrentSegmentIndex].End && in extractInstructionFeatures()969 int CurrentOpcode = GetOpcode(CurrentIndex); in extractInstructionFeatures()974 if (CurrentIndex >= LastIndex) { in extractInstructionFeatures()977 CurrentIndex = CurrentIndex.getNextIndex(); in extractInstructionFeatures()980 MachineBasicBlock *CurrentMBBReference = GetMBBReference(CurrentIndex); in extractInstructionFeatures()985 extractMBBFrequency(CurrentIndex, InstructionIndex, VisitedMBBs, in extractInstructionFeatures()989 assert(LRPosInfo[CurrentSegmentIndex].Begin <= CurrentIndex); in extractInstructionFeatures()1008 LRPosInfo[OverlapCheckCurrentSegment].Begin <= CurrentIndex) { in extractInstructionFeatures()1011 if (LRPosInfo[OverlapCheckCurrentSegment].End >= CurrentIndex) { in extractInstructionFeatures()[all …]
43 void extractMBBFrequency(const SlotIndex CurrentIndex,
3330 size_t CurrentIndex = 0; member in __anon88ab83af0c11::PhiNodeSetIterator3426 void SkipRemovedElements(size_t &CurrentIndex) { in SkipRemovedElements() argument3427 while (CurrentIndex < NodeList.size()) { in SkipRemovedElements()3428 auto it = NodeMap.find(NodeList[CurrentIndex]); in SkipRemovedElements()3431 if (it != NodeMap.end() && it->second == CurrentIndex) in SkipRemovedElements()3433 ++CurrentIndex; in SkipRemovedElements()3439 : Set(Set), CurrentIndex(Start) {} in PhiNodeSetIterator()3442 assert(CurrentIndex < Set->NodeList.size() && in operator *()3444 return Set->NodeList[CurrentIndex]; in operator *()3448 assert(CurrentIndex < Set->NodeList.size() && in operator ++()[all …]
799 const Header &Hdr = CurrentIndex->Hdr; in findEntryOffsetInCurrentIndex()802 for (const NameTableEntry &NTE : *CurrentIndex) { in findEntryOffsetInCurrentIndex()814 uint32_t Index = CurrentIndex->getBucketArrayEntry(Bucket); in findEntryOffsetInCurrentIndex()819 uint32_t Hash = CurrentIndex->getHashArrayEntry(Index); in findEntryOffsetInCurrentIndex()823 NameTableEntry NTE = CurrentIndex->getNameTableEntry(Index); in findEntryOffsetInCurrentIndex()831 auto EntryOr = CurrentIndex->getEntry(&DataOffset); in getEntryAtCurrentOffset()849 for (const NameIndex *End = CurrentIndex->Section.NameIndices.end(); in searchFromStartOfCurrentIndex()850 CurrentIndex != End; ++CurrentIndex) { in searchFromStartOfCurrentIndex()858 assert(CurrentIndex && "Incrementing an end() iterator?"); in next()865 if (IsLocal || CurrentIndex == &CurrentIndex->Section.NameIndices.back()) { in next()[all …]
317 auto CurrentIndex = getHighestParentAbove(I); in propagateAttrs() local318 if (!Visited.insert(CurrentIndex).second) in propagateAttrs()321 while (Links[CurrentIndex].hasBelow()) { in propagateAttrs()322 auto &CurrentBits = Links[CurrentIndex].Attrs; in propagateAttrs()323 auto NextIndex = Links[CurrentIndex].Below; in propagateAttrs()326 CurrentIndex = NextIndex; in propagateAttrs()
156 const u32 Index = atomic_fetch_add(&CurrentIndex, 1U, memory_order_relaxed); in initThread()204 atomic_u32 CurrentIndex = {}; member
440 unsigned CurrentIndex = BeginIndex; in populateBundleOperandInfos() local446 BOI.Begin = CurrentIndex; in populateBundleOperandInfos()447 BOI.End = CurrentIndex + BI->input_size(); in populateBundleOperandInfos()448 CurrentIndex = BOI.End; in populateBundleOperandInfos()