Home
last modified time | relevance | path

Searched refs:Idx (Results 1 - 25 of 417) sorted by relevance

12345678910>>...17

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DScalarizeMaskedMemIntrin.cpp165 for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { in scalarizeMaskedLoad()
166 if (cast<Constant>(Mask)->getAggregateElement(Idx)->isNullValue()) in scalarizeMaskedLoad()
168 Value *Gep = Builder.CreateConstInBoundsGEP1_32(EltTy, FirstEltPtr, Idx); in scalarizeMaskedLoad()
170 VResult = Builder.CreateInsertElement(VResult, Load, Idx); in scalarizeMaskedLoad()
185 for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { in scalarizeMaskedLoad()
189 // %mask_1 = and i16 %scalar_mask, i32 1 << Idx in scalarizeMaskedLoad()
[all...]
H A DSplitKit.cpp340 bool SplitAnalysis::isOriginalEndpoint(SlotIndex Idx) const { in isOriginalEndpoint()
344 LiveInterval::const_iterator I = Orig.find(Idx); in isOriginalEndpoint()
346 // Range containing Idx should begin at Idx. in isOriginalEndpoint()
347 if (I != Orig.end() && I->start <= Idx) in isOriginalEndpoint()
348 return I->start == Idx; in isOriginalEndpoint()
350 // Range does not contain Idx, previous must end at Idx. in isOriginalEndpoint()
351 return I != Orig.begin() && (--I)->end == Idx; in isOriginalEndpoint()
458 SlotIndex Idx, in defValue()
456 defValue(unsigned RegIdx, const VNInfo *ParentVNI, SlotIndex Idx, bool Original) defValue() argument
685 selectIntv(unsigned Idx) selectIntv() argument
688 LLVM_DEBUG(dbgs() << " selectIntv " << OpenIdx << " -> " << Idx << '\\n'); selectIntv() local
692 enterIntvBefore(SlotIndex Idx) enterIntvBefore() argument
709 enterIntvAfter(SlotIndex Idx) enterIntvAfter() argument
758 leaveIntvAfter(SlotIndex Idx) leaveIntvAfter() argument
789 leaveIntvBefore(SlotIndex Idx) leaveIntvBefore() argument
1330 SlotIndex Idx = LIS.getInstructionIndex(*MI); rewriteAssigned() local
1626 SlotIndex Idx = leaveIntvAtTop(*MBB); splitLiveThroughBlock() local
1640 SlotIndex Idx = enterIntvAtEnd(*MBB); splitLiveThroughBlock() local
1670 SlotIndex Idx; splitLiveThroughBlock() local
1693 SlotIndex Idx = enterIntvAfter(EnterAfter); splitLiveThroughBlock() local
1746 SlotIndex Idx = leaveIntvAfter(BI.LastInstr); splitRegInBlock() local
1752 SlotIndex Idx = leaveIntvBefore(LSP); splitRegInBlock() local
1833 SlotIndex Idx = enterIntvBefore(std::min(LSP, BI.FirstInstr)); splitRegOutBlock() local
1849 SlotIndex Idx = enterIntvAfter(EnterAfter); splitRegOutBlock() local
[all...]
H A DLiveDebugVariables.cpp175 /// Insert a DBG_VALUE into MBB at Idx for LocNo.
288 void addDef(SlotIndex Idx, const MachineOperand &LocMO, bool IsIndirect) { in addDef() argument
290 // Add a singular (Idx,Idx) -> Loc mapping. in addDef()
291 LocMap::iterator I = locInts.find(Idx); in addDef()
292 if (!I.valid() || I.start() != Idx) in addDef()
293 I.insert(Idx, Idx.getNextSlot(), Loc); in addDef()
307 /// \param Idx Starting point for the definition.
313 void extendDef(SlotIndex Idx, DbgValueLocatio
376 UserLabel(const DILabel *label, DebugLoc L, SlotIndex Idx) UserLabel() argument
615 handleDebugValue(MachineInstr &MI, SlotIndex Idx) handleDebugValue() argument
675 handleDebugLabel(MachineInstr &MI, SlotIndex Idx) handleDebugLabel() argument
713 SlotIndex Idx = collectDebugValues() local
733 extendDef(SlotIndex Idx, DbgValueLocation Loc, LiveRange *LR, const VNInfo *VNI, SmallVectorImpl<SlotIndex> *Kills, LiveIntervals &LIS) extendDef() argument
806 SlotIndex Idx = LIS.getInstructionIndex(*MI); addDefsFromCopies() local
827 SlotIndex Idx = Kills[i]; addDefsFromCopies() local
862 SlotIndex Idx = Defs[i].first; computeIntervals() local
1258 findInsertLocation(MachineBasicBlock *MBB, SlotIndex Idx, LiveIntervals &LIS) findInsertLocation() argument
1355 insertDebugLabel(MachineBasicBlock *MBB, SlotIndex Idx, LiveIntervals &LIS, const TargetInstrInfo &TII) insertDebugLabel() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonBlockRanges.h54 IndexType(unsigned Idx) : Index(Idx) {} in IndexType() argument
60 bool operator== (IndexType Idx) const;
62 bool operator!= (IndexType Idx) const;
64 bool operator< (unsigned Idx) const;
65 bool operator< (IndexType Idx) const;
66 bool operator<= (IndexType Idx) const;
69 bool operator> (IndexType Idx) const;
70 bool operator>= (IndexType Idx) const;
126 MachineInstr *getInstr(IndexType Idx) cons
[all...]
H A DHexagonBlockRanges.cpp159 IndexType Idx = IndexType::First; in InstrIndexMap() local
160 First = Idx; in InstrIndexMap()
165 Map.insert(std::make_pair(Idx, &In)); in InstrIndexMap()
166 ++Idx; in InstrIndexMap()
168 Last = B.empty() ? IndexType::None : unsigned(Idx)-1; in InstrIndexMap()
171 MachineInstr *HexagonBlockRanges::InstrIndexMap::getInstr(IndexType Idx) const { in getInstr()
172 auto F = Map.find(Idx); in getInstr()
185 IndexType Idx) const { in getPrevIndex()
186 assert (Idx != IndexType::None); in getPrevIndex()
187 if (Idx in getPrevIndex()
493 operator <<(raw_ostream &OS, HexagonBlockRanges::IndexType Idx) operator <<() argument
523 HexagonBlockRanges::IndexType Idx = M.getIndex(&In); operator <<() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Bitcode/Reader/
H A DValueList.cpp68 void BitcodeReaderValueList::assignValue(Value *V, unsigned Idx, Type *FullTy) { in assignValue() argument
69 if (Idx == size()) { in assignValue()
74 if (Idx >= size()) in assignValue()
75 resize(Idx + 1); in assignValue()
77 assert(FullTypes[Idx] == nullptr || FullTypes[Idx] == FullTy); in assignValue()
78 FullTypes[Idx] = FullTy; in assignValue()
80 WeakTrackingVH &OldV = ValuePtrs[Idx]; in assignValue()
89 ResolveConstants.push_back(std::make_pair(PHC, Idx)); in assignValue()
99 Constant *BitcodeReaderValueList::getConstantFwdRef(unsigned Idx, Typ argument
119 getValueFwdRef(unsigned Idx, Type *Ty, Type **FullTy) getValueFwdRef() argument
[all...]
/third_party/json/tests/thirdparty/Fuzzer/
H A DFuzzerCorpus.h63 const Unit &operator[] (size_t Idx) const { return Inputs[Idx]->U; } in operator []()
93 size_t Idx = static_cast<size_t>(CorpusDistribution(Rand.Get_mt19937())); in ChooseUnitIdxToMutate() local
94 assert(Idx < Inputs.size()); in ChooseUnitIdxToMutate()
95 return Idx; in ChooseUnitIdxToMutate()
119 void DeleteInput(size_t Idx) {
120 InputInfo &II = *Inputs[Idx];
125 Printf("EVICTED %zd\n", Idx);
128 bool AddFeature(size_t Idx, uint32_t NewSize, bool Shrink) {
130 Idx
[all...]
H A DFuzzerTracePC.h34 void Insert(size_t Idx, T Arg1, T Arg2) { in Insert()
35 Idx = Idx % kSize; in Insert()
36 Table[Idx].A = Arg1; in Insert()
37 Table[Idx].B = Arg2; in Insert()
89 uintptr_t GetPC(size_t Idx) { in GetPC() argument
90 assert(Idx < GetNumPCs()); in GetPC()
91 return PCs[Idx]; in GetPC()
126 for (size_t Idx = 0; Idx <
[all...]
H A DFuzzerMutate.cpp80 size_t Idx = Rand(Corpus->size()); in Mutate_CustomCrossOver()
81 const Unit &Other = (*Corpus)[Idx]; in Mutate_CustomCrossOver()
114 size_t Idx = Rand(Size - N + 1); in Mutate_EraseBytes()
115 // Erase Data[Idx:Idx+N]. in Mutate_EraseBytes()
116 memmove(Data + Idx, Data + Idx + N, Size - Idx - N); in Mutate_EraseBytes()
117 // Printf("Erase: %zd %zd => %zd; Idx %zd\n", N, Size, Size - N, Idx); in Mutate_EraseBytes()
139 size_t Idx = Rand(Size + 1); Mutate_InsertRepeatedBytes() local
185 size_t Idx = UsePositionHint ? DE.GetPositionHint() : Rand(Size + 1); ApplyDictionaryEntry() local
[all...]
H A DFuzzerTracePC.cpp32 uint32_t Idx = *Guard; in HandleTrace() local
33 if (!Idx) return; in HandleTrace()
34 PCs[Idx % kNumPCs] = PC; in HandleTrace()
35 Counters[Idx % kNumCounters]++; in HandleTrace()
66 uintptr_t Idx = (Caller & kMask) | ((Callee & kMask) << kBits);
67 HandleValueProfile(Idx);
218 size_t Idx = I;
220 // Idx += __builtin_popcountl((A1[I] ^ A2[I])) - 1;
221 TPC.HandleValueProfile((PC & 4095) | (Idx << 12));
236 size_t Idx
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DSparseMultiSet.h166 unsigned Idx = FreelistIdx; in addValue() local
167 unsigned NextFree = Dense[Idx].Next; in addValue()
168 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); in addValue()
170 Dense[Idx] = SMSNode(V, Prev, Next); in addValue()
173 return Idx; in addValue()
177 void makeTombstone(unsigned Idx) { in makeTombstone() argument
178 Dense[Idx].Prev = SMSNode::INVALID; in makeTombstone()
179 Dense[Idx].Next = FreelistIdx; in makeTombstone()
180 FreelistIdx = Idx; in makeTombstone()
225 unsigned Idx; member in llvm::SparseMultiSet::iterator_base
354 findIndex(unsigned Idx) findIndex() argument
[all...]
H A DPackedVector.h30 static T getValue(const BitVectorTy &Bits, unsigned Idx) { in getValue() argument
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i)); in getValue()
37 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) { in setValue() argument
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i); in setValue()
47 static T getValue(const BitVectorTy &Bits, unsigned Idx) { in getValue() argument
50 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i)); in getValue()
51 if (Bits[(Idx << (BitNum-1)) + BitNum-1]) in getValue()
56 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) { in setValue() argument
59 Bits.set((Idx << (BitNum-1)) + BitNum-1); in setValue()
63 Bits[(Idx << (BitNu in setValue()
84 const unsigned Idx; global() member in llvm::PackedVector::reference
123 operator [](unsigned Idx) operator []() argument
[all...]
H A DSparseBitVector.h62 explicit SparseBitVectorElement(unsigned Idx) { in SparseBitVectorElement()
63 ElementIndex = Idx; in SparseBitVectorElement()
81 // Return the bits that make up word Idx in our element.
82 BitWord word(unsigned Idx) const { in word()
83 assert(Idx < BITWORDS_PER_ELEMENT); in word()
84 return Bits[Idx]; in word()
98 void set(unsigned Idx) {
99 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE);
102 bool test_and_set(unsigned Idx) {
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/
H A DAArch64ExpandImm.cpp51 for (unsigned Idx = 0; Idx < 4; ++Idx) in tryToreplicateChunks()
52 ++Counts[getChunk(UImm, Idx)]; in tryToreplicateChunks()
126 static uint64_t updateImm(uint64_t Imm, unsigned Idx, bool Clear) { in updateImm() argument
131 Imm &= ~(Mask << (Idx * 16)); in updateImm()
134 Imm |= Mask << (Idx * 16); in updateImm()
160 for (int Idx = 0; Idx < 4; ++Idx) { in trySequenceOfOnes()
[all...]
H A DAArch64RegisterBankInfo.cpp85 // First, the Idx. in AArch64RegisterBankInfo()
95 #define CHECK_PARTIALMAP(Idx, ValStartIdx, ValLength, RB) \ in AArch64RegisterBankInfo()
98 checkPartialMap(PartialMappingIdx::Idx, ValStartIdx, ValLength, RB) && \ in AArch64RegisterBankInfo()
99 #Idx " is incorrectly initialized"); \ in AArch64RegisterBankInfo()
444 for (unsigned Idx = 1; Idx != NumOperands; ++Idx) { in getSameKindOfOperandsMapping()
445 LLT OpTy = MRI.getType(MI.getOperand(Idx).getReg()); in getSameKindOfOperandsMapping()
618 for (unsigned Idx = 0; Idx < NumOperand in getInstrMapping()
[all...]
H A DAArch64A57FPLoadBalancing.cpp142 void scanInstruction(MachineInstr *MI, unsigned Idx,
145 void maybeKillChain(MachineOperand &MO, unsigned Idx,
203 Chain(MachineInstr *MI, unsigned Idx, Color C) in Chain() argument
205 StartInstIdx(Idx), LastInstIdx(Idx), KillInstIdx(0), in Chain()
212 void add(MachineInstr *MI, unsigned Idx, Color C) { in add() argument
214 LastInstIdx = Idx; in add()
233 void setKill(MachineInstr *MI, unsigned Idx, bool Immutable) { in setKill() argument
235 KillInstIdx = Idx; in setKill()
342 unsigned Idx in runOnBasicBlock() local
600 scanInstruction( MachineInstr *MI, unsigned Idx, std::map<unsigned, Chain *> &ActiveChains, std::vector<std::unique_ptr<Chain>> &AllChains) scanInstruction() argument
681 maybeKillChain(MachineOperand &MO, unsigned Idx, std::map<unsigned, Chain*> &ActiveChains) maybeKillChain() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/IPO/
H A DDeadArgumentElimination.h46 unsigned Idx; member
49 RetOrArg(const Function *F, unsigned Idx, bool IsArg) in RetOrArg()
50 : F(F), Idx(Idx), IsArg(IsArg) {} in RetOrArg()
54 return std::tie(F, Idx, IsArg) < std::tie(O.F, O.Idx, O.IsArg); in operator <()
59 return F == O.F && Idx == O.Idx && IsArg == O.IsArg; in operator ==()
63 return (Twine(IsArg ? "Argument #" : "Return value #") + Twine(Idx) + in getDescription()
82 RetOrArg CreateRet(const Function *F, unsigned Idx) { in CreateRet() argument
87 CreateArg(const Function *F, unsigned Idx) CreateArg() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MC/
H A DMCRegisterInfo.cpp32 MCRegister MCRegisterInfo::getSubReg(MCRegister Reg, unsigned Idx) const { in getSubReg()
33 assert(Idx && Idx < getNumSubRegIndices() && in getSubReg()
39 if (*SRI == Idx) in getSubReg()
56 unsigned MCRegisterInfo::getSubRegIdxSize(unsigned Idx) const {
57 assert(Idx && Idx < getNumSubRegIndices() &&
59 return SubRegIdxRanges[Idx].Size;
62 unsigned MCRegisterInfo::getSubRegIdxOffset(unsigned Idx) const {
63 assert(Idx
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DArrayRecycler.h41 // Remove an entry from the free list in Bucket[Idx] and return it.
43 T *pop(unsigned Idx) { in pop() argument
44 if (Idx >= Bucket.size()) in pop()
46 FreeList *Entry = Bucket[Idx]; in pop()
49 __asan_unpoison_memory_region(Entry, Capacity::get(Idx).getSize()); in pop()
50 Bucket[Idx] = Entry->Next; in pop()
51 __msan_allocated_memory(Entry, Capacity::get(Idx).getSize()); in pop()
55 // Add an entry to the free list at Bucket[Idx].
56 void push(unsigned Idx, T *Ptr) { in push() argument
59 if (Idx > in push()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DLiveInterval.h399 const Segment *getSegmentContaining(SlotIndex Idx) const {
400 const_iterator I = FindSegmentContaining(Idx);
406 Segment *getSegmentContaining(SlotIndex Idx) {
407 iterator I = FindSegmentContaining(Idx);
411 /// getVNInfoAt - Return the VNInfo that is live at Idx, or NULL.
412 VNInfo *getVNInfoAt(SlotIndex Idx) const {
413 const_iterator I = FindSegmentContaining(Idx);
418 /// necessarilly including Idx, or NULL. Use this to find the reaching def
420 VNInfo *getVNInfoBefore(SlotIndex Idx) const {
421 const_iterator I = FindSegmentContaining(Idx
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/CodeView/
H A DTypeStreamMerger.cpp24 static inline size_t slotForIndex(TypeIndex Idx) { in slotForIndex() argument
25 assert(!Idx.isSimple() && "simple type indices have no slots"); in slotForIndex()
26 return Idx.getIndex() - TypeIndex::FirstNonSimpleIndex; in slotForIndex()
108 void addMapping(TypeIndex Idx);
110 inline bool remapTypeIndex(TypeIndex &Idx) { in remapTypeIndex() argument
117 return remapIndex(Idx, TypeLookup); in remapTypeIndex()
120 return remapIndex(Idx, IndexMap); in remapTypeIndex()
122 inline bool remapItemIndex(TypeIndex &Idx) { in remapItemIndex() argument
124 return remapIndex(Idx, IndexMap); in remapItemIndex()
138 inline bool remapIndex(TypeIndex &Idx, ArrayRe argument
145 remapIndexSimple(TypeIndex &Idx, ArrayRef<TypeIndex> Map) const remapIndexSimple() argument
206 addMapping(TypeIndex Idx) addMapping() argument
217 remapIndexFallback(TypeIndex &Idx, ArrayRef<TypeIndex> Map) remapIndexFallback() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/GlobalISel/
H A DRegisterBankInfo.cpp62 for (unsigned Idx = 0, End = getNumRegBanks(); Idx != End; ++Idx) { in RegisterBankInfo()
63 assert(RegBanks[Idx] != nullptr && "Invalid RegisterBank"); in RegisterBankInfo()
64 assert(RegBanks[Idx]->isValid() && "RegisterBank should be valid"); in RegisterBankInfo()
71 for (unsigned Idx = 0, End = getNumRegBanks(); Idx != End; ++Idx) { in verify()
72 const RegisterBank &RegBank = getRegBank(Idx); in verify()
73 assert(Idx in verify()
351 unsigned Idx = 0; getOperandsMapping() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/PDB/Native/
H A DHashTable.cpp39 for (unsigned Idx = 0; Idx < 32; ++Idx) in readSparseBitVector()
40 if (Word & (1U << Idx)) in readSparseBitVector()
41 V.set((I * 32) + Idx); in readSparseBitVector()
58 uint32_t Idx = 0; in writeSparseBitVector()
61 for (uint32_t WordIdx = 0; WordIdx < 32; ++WordIdx, ++Idx) { in writeSparseBitVector()
62 if (Vec.test(Idx)) in writeSparseBitVector()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/OProfileJIT/
H A DOProfileWrapper.cpp142 ssize_t Idx = 0; in checkForOProfileProcEntry() local
149 while (Idx < NumRead-1 && ExeName[Idx] != 0) { in checkForOProfileProcEntry()
150 Idx++; in checkForOProfileProcEntry()
154 Idx--; in checkForOProfileProcEntry()
157 while (Idx > 0) { in checkForOProfileProcEntry()
158 if (ExeName[Idx] == '/') { in checkForOProfileProcEntry()
159 BaseName = ExeName + Idx + 1; in checkForOProfileProcEntry()
162 Idx--; in checkForOProfileProcEntry()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DStraightLineStrengthReduce.cpp111 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate()
113 : CandidateKind(CT), Base(B), Index(Idx), Stride(S), Ins(I) {} in Candidate()
203 // A helper function that scales Idx with ElementSize before invoking
205 void allocateCandidatesAndFindBasisForGEP(const SCEV *B, ConstantInt *Idx,
209 // Adds the given form <CT, B, Idx, S> to Candidates, and finds its immediate
212 ConstantInt *Idx, Value *S,
337 Candidate::Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in allocateCandidatesAndFindBasis()
339 Candidate C(CT, B, Idx, S, I); in allocateCandidatesAndFindBasis()
403 ConstantInt *Idx = nullptr; in allocateCandidatesAndFindBasisForAdd() local
404 if (match(RHS, m_Mul(m_Value(S), m_ConstantInt(Idx)))) { in allocateCandidatesAndFindBasisForAdd()
336 allocateCandidatesAndFindBasis( Candidate::Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, Instruction *I) allocateCandidatesAndFindBasis() argument
435 ConstantInt *Idx = nullptr; allocateCandidatesAndFindBasisForMul() local
470 allocateCandidatesAndFindBasisForGEP( const SCEV *B, ConstantInt *Idx, Value *S, uint64_t ElementSize, Instruction *I) allocateCandidatesAndFindBasisForGEP() argument
576 APInt Idx = C.Index->getValue(), BasisIdx = Basis.Index->getValue(); emitBump() local
[all...]

Completed in 17 milliseconds

12345678910>>...17