| /openbsd/src/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| D | ScalarizeMaskedMemIntrin.cpp | 107 unsigned Idx) { in adjustForEndian() argument 108 return DL.isBigEndian() ? VectorWidth - 1 - Idx : Idx; in adjustForEndian() 183 for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { in scalarizeMaskedLoad() local 184 if (cast<Constant>(Mask)->getAggregateElement(Idx)->isNullValue()) in scalarizeMaskedLoad() 186 Value *Gep = Builder.CreateConstInBoundsGEP1_32(EltTy, FirstEltPtr, Idx); in scalarizeMaskedLoad() 188 VResult = Builder.CreateInsertElement(VResult, Load, Idx); in scalarizeMaskedLoad() 203 for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) { in scalarizeMaskedLoad() local 214 VectorWidth, adjustForEndian(DL, VectorWidth, Idx))); in scalarizeMaskedLoad() 218 Predicate = Builder.CreateExtractElement(Mask, Idx); in scalarizeMaskedLoad() 235 Value *Gep = Builder.CreateConstInBoundsGEP1_32(EltTy, FirstEltPtr, Idx); in scalarizeMaskedLoad() [all …]
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/ADT/ |
| D | SparseMultiSet.h | 166 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() 231 unsigned Idx; variable [all …]
|
| D | PackedVector.h | 31 static T getValue(const BitVectorTy &Bits, unsigned Idx) { in getValue() argument 34 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i)); in getValue() 38 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) { in setValue() argument 41 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i); in setValue() 48 static T getValue(const BitVectorTy &Bits, unsigned Idx) { in getValue() argument 51 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i)); in getValue() 52 if (Bits[(Idx << (BitNum-1)) + BitNum-1]) in getValue() 57 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) { in setValue() argument 60 Bits.set((Idx << (BitNum-1)) + BitNum-1); in setValue() 64 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i); in setValue() [all …]
|
| D | SparseBitVector.h | 63 explicit SparseBitVectorElement(unsigned Idx) { in SparseBitVectorElement() 64 ElementIndex = Idx; in SparseBitVectorElement() 83 BitWord word(unsigned Idx) const { in word() 84 assert(Idx < BITWORDS_PER_ELEMENT); in word() 85 return Bits[Idx]; in word() 99 void set(unsigned Idx) { in set() 100 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); in set() 103 bool test_and_set(unsigned Idx) { in test_and_set() 104 bool old = test(Idx); in test_and_set() 106 set(Idx); in test_and_set() [all …]
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/Hexagon/ |
| D | HexagonBlockRanges.h | 57 IndexType(unsigned Idx) : Index(Idx) {} in IndexType() 63 bool operator== (IndexType Idx) const; 65 bool operator!= (IndexType Idx) const; 67 bool operator< (unsigned Idx) const; 68 bool operator< (IndexType Idx) const; 69 bool operator<= (IndexType Idx) const; 72 bool operator> (IndexType Idx) const; 73 bool operator>= (IndexType Idx) const; 129 MachineInstr *getInstr(IndexType Idx) const; 132 IndexType getPrevIndex(IndexType Idx) const; [all …]
|
| D | HexagonBlockRanges.cpp | 159 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 == IndexType::Entry) in getPrevIndex() [all …]
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/AArch64/ |
| D | AArch64ExpandImm.cpp | 50 for (unsigned Idx = 0; Idx < 4; ++Idx) in tryToreplicateChunks() local 51 ++Counts[getChunk(UImm, Idx)]; in tryToreplicateChunks() 124 static uint64_t updateImm(uint64_t Imm, unsigned Idx, bool Clear) { in updateImm() argument 129 Imm &= ~(Mask << (Idx * 16)); in updateImm() 132 Imm |= Mask << (Idx * 16); in updateImm() 158 for (int Idx = 0; Idx < 4; ++Idx) { in trySequenceOfOnes() local 159 int64_t Chunk = getChunk(UImm, Idx); in trySequenceOfOnes() 164 StartIdx = Idx; in trySequenceOfOnes() 166 EndIdx = Idx; in trySequenceOfOnes() 192 for (int Idx = 0; Idx < 4; ++Idx) { in trySequenceOfOnes() local [all …]
|
| /openbsd/src/gnu/llvm/llvm/tools/llvm-c-test/ |
| D | attributes.c | 28 int Idx, ParamCount; in llvm_test_function_attributes() local 29 for (Idx = LLVMAttributeFunctionIndex, ParamCount = LLVMCountParams(F); in llvm_test_function_attributes() 30 Idx <= ParamCount; ++Idx) { in llvm_test_function_attributes() 31 int AttrCount = LLVMGetAttributeCountAtIndex(F, Idx); in llvm_test_function_attributes() 38 LLVMGetAttributesAtIndex(F, Idx, Attrs); in llvm_test_function_attributes() 62 int Idx, ParamCount; in llvm_test_callsite_attributes() local 63 for (Idx = LLVMAttributeFunctionIndex, in llvm_test_callsite_attributes() 65 Idx <= ParamCount; ++Idx) { in llvm_test_callsite_attributes() 66 int AttrCount = LLVMGetCallSiteAttributeCount(I, Idx); in llvm_test_callsite_attributes() 73 LLVMGetCallSiteAttributes(I, Idx, Attrs); in llvm_test_callsite_attributes()
|
| /openbsd/src/gnu/llvm/llvm/lib/Bitcode/Reader/ |
| D | ValueList.cpp | 26 Error BitcodeReaderValueList::assignValue(unsigned Idx, Value *V, in assignValue() argument 28 if (Idx == size()) { in assignValue() 33 if (Idx >= size()) in assignValue() 34 resize(Idx + 1); in assignValue() 36 auto &Old = ValuePtrs[Idx]; in assignValue() 55 Value *BitcodeReaderValueList::getValueFwdRef(unsigned Idx, Type *Ty, in getValueFwdRef() argument 59 if (Idx >= RefsUpperBound) in getValueFwdRef() 62 if (Idx >= size()) in getValueFwdRef() 63 resize(Idx + 1); in getValueFwdRef() 65 if (Value *V = ValuePtrs[Idx].first) { in getValueFwdRef() [all …]
|
| /openbsd/src/gnu/llvm/clang/include/clang/AST/ |
| D | Attr.h | 244 unsigned Idx : 30; variable 262 ParamIdx() : Idx(0), HasThis(false), IsValid(false) {} in ParamIdx() 270 ParamIdx(unsigned Idx, const Decl *D) in ParamIdx() argument 271 : Idx(Idx), HasThis(false), IsValid(true) { in ParamIdx() 272 assert(Idx >= 1 && "Idx must be one-origin"); in ParamIdx() 295 assert((!P.IsValid || P.Idx >= 1) && "valid Idx must be one-origin"); in deserialize() 310 return Idx; in getSourceIndex() 321 assert(Idx >= 1 + HasThis && in getASTIndex() 323 return Idx - 1 - HasThis; in getASTIndex() 332 assert(Idx >= 1 && "stored index must be base-1"); in getLLVMIndex() [all …]
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/Transforms/IPO/ |
| D | DeadArgumentElimination.h | 46 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); 59 return F == O.F && Idx == O.Idx && IsArg == O.IsArg; 63 return (Twine(IsArg ? "Argument #" : "Return value #") + Twine(Idx) + in getDescription() 81 RetOrArg createRet(const Function *F, unsigned Idx) { in createRet() argument 82 return RetOrArg(F, Idx, false); in createRet() 86 RetOrArg createArg(const Function *F, unsigned Idx) { in createArg() argument 87 return RetOrArg(F, Idx, true); in createArg()
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/AMDGPU/ |
| D | AMDGPUGenRegisterBankInfo.def | 192 unsigned Idx; 198 Idx = BankID == AMDGPU::SGPRRegBankID ? PM_SGPR1 : PM_VGPR1; 203 Idx = PM_VGPR96; 206 Idx = PM_SGPR96; 209 Idx = PM_AGPR96; 217 Idx = PM_VGPR288; 220 Idx = PM_SGPR288; 223 Idx = PM_AGPR288; 231 Idx = PM_VGPR320; 234 Idx = PM_SGPR320; [all …]
|
| /openbsd/src/gnu/llvm/compiler-rt/lib/fuzzer/ |
| D | FuzzerCorpus.h | 51 bool DeleteFeatureFreq(uint32_t Idx) { in DeleteFeatureFreq() 57 std::pair<uint32_t, uint16_t>(Idx, 0)); in DeleteFeatureFreq() 59 if (Lower != FeatureFreqs.end() && Lower->first == Idx) { in DeleteFeatureFreq() 123 void UpdateFeatureFrequency(uint32_t Idx) { in UpdateFeatureFrequency() 130 FeatureFreqs.push_back(std::pair<uint32_t, uint16_t>(Idx, 1)); in UpdateFeatureFrequency() 136 std::pair<uint32_t, uint16_t>(Idx, 0)); in UpdateFeatureFrequency() 140 if (Lower != FeatureFreqs.end() && Lower->first == Idx) { in UpdateFeatureFrequency() 143 FeatureFreqs.insert(Lower, std::pair<uint32_t, uint16_t>(Idx, 1)); in UpdateFeatureFrequency() 208 const Unit &operator[] (size_t Idx) const { return Inputs[Idx]->U; } 320 size_t Idx = static_cast<size_t>(CorpusDistribution(Rand)); in ChooseUnitIdxToMutate() local [all …]
|
| /openbsd/src/gnu/llvm/clang/include/clang/Serialization/ |
| D | ASTRecordReader.h | 38 unsigned Idx = 0; variable 61 unsigned getIdx() const { return Idx; } in getIdx() 74 uint64_t readInt() { return Record[Idx++]; } in readInt() 77 auto Array = llvm::ArrayRef(Record).slice(Idx, Len); in readIntArray() 78 Idx += Len; in readIntArray() 83 uint64_t peekInt() { return Record[Idx]; } in peekInt() 86 void skipInts(unsigned N) { Idx += N; } in skipInts() 178 return Reader->readType(*F, Record, Idx); in readType() 188 return Reader->ReadDeclID(*F, Record, Idx); in readDeclID() 194 return Reader->ReadDecl(*F, Record, Idx); in readDecl() [all …]
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/Support/ |
| D | ArrayRecycler.h | 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() 56 void push(unsigned Idx, T *Ptr) { in push() argument 59 if (Idx >= Bucket.size()) in push() 60 Bucket.resize(size_t(Idx) + 1); in push() 61 Entry->Next = Bucket[Idx]; in push() [all …]
|
| /openbsd/src/gnu/llvm/llvm/lib/CodeGen/ |
| D | MachinePassManager.cpp | 57 unsigned Idx = 0; in run() local 61 for (; MachineModulePasses.count(Idx) && Idx != Size; ++Idx) { in run() 62 if (auto Err = MachineModulePasses.at(Idx)(M, MFAM)) in run() 67 if (Idx == Size) in run() 73 unsigned Begin = Idx; in run() 74 for (; !MachineModulePasses.count(Idx) && Idx != Size; ++Idx) in run() 86 for (unsigned I = Begin, E = Idx; I != E; ++I) { in run()
|
| D | RegisterBankInfo.cpp | 59 for (unsigned Idx = 0, End = getNumRegBanks(); Idx != End; ++Idx) { in RegisterBankInfo() local 60 assert(RegBanks[Idx] != nullptr && "Invalid RegisterBank"); in RegisterBankInfo() 61 assert(RegBanks[Idx]->isValid() && "RegisterBank should be valid"); in RegisterBankInfo() 68 for (unsigned Idx = 0, End = getNumRegBanks(); Idx != End; ++Idx) { in verify() local 69 const RegisterBank &RegBank = getRegBank(Idx); in verify() 70 assert(Idx == RegBank.getID() && in verify() 305 for (unsigned Idx = 0; Idx != NumBreakDowns; ++Idx) in hashValueMapping() local 306 Hashes.push_back(hash_value(BreakDown[Idx])); in hashValueMapping() 348 unsigned Idx = 0; in getOperandsMapping() local 349 for (Iterator It = Begin; It != End; ++It, ++Idx) { in getOperandsMapping() [all …]
|
| D | SplitKit.cpp | 324 bool SplitAnalysis::isOriginalEndpoint(SlotIndex Idx) const { in isOriginalEndpoint() 328 LiveInterval::const_iterator I = Orig.find(Idx); in isOriginalEndpoint() 331 if (I != Orig.end() && I->start <= Idx) in isOriginalEndpoint() 332 return I->start == Idx; in isOriginalEndpoint() 335 return I != Orig.begin() && (--I)->end == Idx; in isOriginalEndpoint() 463 SlotIndex Idx, in defValue() argument 466 assert(Idx.isValid() && "Invalid SlotIndex"); in defValue() 467 assert(Edit->getParent().getVNInfoAt(Idx) == ParentVNI && "Bad Parent VNI"); in defValue() 471 VNInfo *VNI = LI->getNextValue(Idx, LIS.getVNInfoAllocator()); in defValue() 646 void SplitEditor::selectIntv(unsigned Idx) { in selectIntv() argument [all …]
|
| D | StackFrameLayoutAnalysisPass.cpp | 66 SlotData(const MachineFrameInfo &MFI, const int ValOffset, const int Idx) in SlotData() 67 : Slot(Idx), Size(MFI.getObjectSize(Idx)), in SlotData() 68 Align(MFI.getObjectAlign(Idx).value()), in SlotData() 69 Offset(MFI.getObjectOffset(Idx) - ValOffset), SlotTy(Invalid) { in SlotData() 70 if (MFI.isSpillSlotObjectIndex(Idx)) in SlotData() 72 else if (Idx == MFI.getStackProtectorIndex()) in SlotData() 187 for (int Idx = MFI.getObjectIndexBegin(), EndIdx = MFI.getObjectIndexEnd(); in emitStackFrameLayoutRemarks() local 188 Idx != EndIdx; ++Idx) { in emitStackFrameLayoutRemarks() 189 if (MFI.isDeadObjectIndex(Idx)) in emitStackFrameLayoutRemarks() 191 SlotInfo.emplace_back(MFI, ValOffset, Idx); in emitStackFrameLayoutRemarks()
|
| /openbsd/src/gnu/llvm/llvm/lib/MC/ |
| D | MCRegisterInfo.cpp | 32 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 { in getSubRegIdxSize() 57 assert(Idx && Idx < getNumSubRegIndices() && in getSubRegIdxSize() 59 return SubRegIdxRanges[Idx].Size; in getSubRegIdxSize() 62 unsigned MCRegisterInfo::getSubRegIdxOffset(unsigned Idx) const { in getSubRegIdxOffset() 63 assert(Idx && Idx < getNumSubRegIndices() && in getSubRegIdxOffset() 65 return SubRegIdxRanges[Idx].Offset; in getSubRegIdxOffset()
|
| /openbsd/src/gnu/llvm/llvm/utils/TableGen/ |
| D | CodeGenSchedule.h | 57 CodeGenSchedRW(unsigned Idx, Record *Def) in CodeGenSchedRW() 58 : Index(Idx), TheDef(Def), IsAlias(false), IsVariadic(false) { in CodeGenSchedRW() 71 CodeGenSchedRW(unsigned Idx, bool Read, ArrayRef<unsigned> Seq, in CodeGenSchedRW() 73 : Index(Idx), Name(Name), TheDef(nullptr), IsRead(Read), IsAlias(false), in CodeGenSchedRW() 251 CodeGenProcModel(unsigned Idx, std::string Name, Record *MDef, in CodeGenProcModel() 253 Index(Idx), ModelName(std::move(Name)), ModelDef(MDef), ItinsDef(IDef), in CodeGenProcModel() 505 const CodeGenSchedRW &getSchedWrite(unsigned Idx) const { in getSchedWrite() argument 506 assert(Idx < SchedWrites.size() && "bad SchedWrite index"); in getSchedWrite() 507 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite"); in getSchedWrite() 508 return SchedWrites[Idx]; in getSchedWrite() [all …]
|
| /openbsd/src/gnu/llvm/llvm/lib/DebugInfo/CodeView/ |
| D | TypeStreamMerger.cpp | 24 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() 109 void addMapping(TypeIndex Idx); 111 inline bool remapTypeIndex(TypeIndex &Idx) { in remapTypeIndex() argument 118 return remapIndex(Idx, TypeLookup); in remapTypeIndex() 121 return remapIndex(Idx, IndexMap); in remapTypeIndex() 123 inline bool remapItemIndex(TypeIndex &Idx) { in remapItemIndex() argument 125 return remapIndex(Idx, IndexMap); in remapItemIndex() 139 inline bool remapIndex(TypeIndex &Idx, ArrayRef<TypeIndex> Map) { in remapIndex() argument [all …]
|
| /openbsd/src/gnu/llvm/llvm/lib/DebugInfo/PDB/Native/ |
| D | HashTable.cpp | 36 for (unsigned Idx = 0; Idx < 32; ++Idx) in readSparseBitVector() local 37 if (Word & (1U << Idx)) in readSparseBitVector() 38 V.set((I * 32) + Idx); in readSparseBitVector() 55 uint32_t Idx = 0; in writeSparseBitVector() local 58 for (uint32_t WordIdx = 0; WordIdx < 32; ++WordIdx, ++Idx) { in writeSparseBitVector() 59 if (Vec.test(Idx)) in writeSparseBitVector()
|
| /openbsd/src/gnu/llvm/llvm/lib/Target/AArch64/GISel/ |
| D | AArch64RegisterBankInfo.cpp | 100 #define CHECK_PARTIALMAP(Idx, ValStartIdx, ValLength, RB) \ in AArch64RegisterBankInfo() argument 103 checkPartialMap(PartialMappingIdx::Idx, ValStartIdx, ValLength, RB) && \ in AArch64RegisterBankInfo() 104 #Idx " is incorrectly initialized"); \ in AArch64RegisterBankInfo() 467 for (unsigned Idx = 1; Idx != NumOperands; ++Idx) { in getSameKindOfOperandsMapping() local 468 LLT OpTy = MRI.getType(MI.getOperand(Idx).getReg()); in getSameKindOfOperandsMapping() 678 for (unsigned Idx = 0; Idx < NumOperands; ++Idx) { in getInstrMapping() local 679 auto &MO = MI.getOperand(Idx); in getInstrMapping() 686 OpSize[Idx] = Ty.getSizeInBits(); in getInstrMapping() 692 OpRegBankIdx[Idx] = PMI_FirstFPR; in getInstrMapping() 694 OpRegBankIdx[Idx] = PMI_FirstGPR; in getInstrMapping() [all …]
|
| /openbsd/src/gnu/llvm/llvm/include/llvm/IR/ |
| D | CFG.h | 149 int Idx; variable 152 inline bool index_is_valid(int Idx) { in index_is_valid() argument 155 return Idx >= 0 && (Idx == 0 || Idx <= (int)Inst->getNumSuccessors()); in index_is_valid() 173 It.Inst->setSuccessor(It.Idx, RHS); 182 explicit inline SuccIterator(InstructionT *Inst) : Inst(Inst), Idx(0) {} in SuccIterator() 186 Idx = Inst->getNumSuccessors(); in SuccIterator() 194 Idx = 0; in SuccIterator() 199 int getSuccessorIndex() const { return Idx; } in getSuccessorIndex() 201 inline bool operator==(const Self &x) const { return Idx == x.Idx; } 203 inline BlockT *operator*() const { return Inst->getSuccessor(Idx); } [all …]
|