Home
last modified time | relevance | path

Searched full:indexes (Results 1 – 25 of 603) sorted by relevance

12345678910>>...25

/freebsd/sys/contrib/device-tree/include/dt-bindings/power/
H A Dqcom-rpmpd.h7 /* SA8775P Power Domain Indexes */
26 /* SDM670 Power Domain Indexes */
36 /* SDM845 Power Domain Indexes */
47 /* SDX55 Power Domain Indexes */
52 /* SDX65 Power Domain Indexes */
60 /* SM6350 Power Domain Indexes */
68 /* SM6350 Power Domain Indexes */
80 /* SM8150 Power Domain Indexes */
102 /* SM8250 Power Domain Indexes */
114 /* SM8350 Power Domain Indexes */
[all …]
/freebsd/contrib/llvm-project/lldb/source/Symbol/
H A DSymtab.cpp171 void Symtab::Dump(Stream *s, Target *target, std::vector<uint32_t> &indexes, in Dump() argument
178 s->Printf("Symtab %" PRIu64 " symbol indexes (%" PRIu64 " symbols total):\n", in Dump()
179 (uint64_t)indexes.size(), (uint64_t)m_symbols.size()); in Dump()
182 if (!indexes.empty()) { in Dump()
184 std::vector<uint32_t>::const_iterator end = indexes.end(); in Dump()
186 for (pos = indexes.begin(); pos != end; ++pos) { in Dump()
471 void Symtab::AppendSymbolNamesToMap(const IndexCollection &indexes, in AppendSymbolNamesToMap() argument
479 const size_t num_indexes = indexes.size(); in AppendSymbolNamesToMap()
481 uint32_t value = indexes[i]; in AppendSymbolNamesToMap()
500 std::vector<uint32_t> &indexes, in AppendSymbolIndexesWithType() argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DLiveIntervalCalc.cpp32 static void createDeadDef(SlotIndexes &Indexes, VNInfo::Allocator &Alloc,
36 Indexes.getInstructionIndex(MI).getRegSlot(MO.isEarlyClobber()); in createDeadDef()
44 SlotIndexes *Indexes = getIndexes(); in calculate()
47 assert(MRI && Indexes && "call reset() first"); in calculate()
71 [&MO, Indexes, Alloc](LiveInterval::SubRange &SR) { in calculate()
73 createDeadDef(*Indexes, *Alloc, SR, MO); in calculate()
75 *Indexes, TRI); in calculate()
81 createDeadDef(*Indexes, *Alloc, LI, MO); in calculate()
95 SubLIC.reset(MF, Indexes, DomTree, Alloc); in calculate()
125 SlotIndexes *Indexes in createDeadDefs()
33 createDeadDef(SlotIndexes & Indexes,VNInfo::Allocator & Alloc,LiveRange & LR,const MachineOperand & MO) createDeadDef() argument
45 SlotIndexes *Indexes = getIndexes(); calculate() local
126 SlotIndexes *Indexes = getIndexes(); createDeadDefs() local
139 SlotIndexes *Indexes = getIndexes(); extendToUses() local
[all...]
H A DLiveRangeCalc.cpp55 Indexes = SI; in reset()
70 std::tie(Start, End) = Indexes->getMBBRange(MBB); in updateFromLiveIns()
90 assert(Indexes && "Missing SlotIndexes"); in extend()
93 MachineBasicBlock *UseMBB = Indexes->getMBBFromIndex(Use.getPrevSlot()); in extend()
97 auto EP = LR.extendInBlock(Undefs, Indexes->getMBBStartIdx(UseMBB), Use); in extend()
116 assert(Indexes && "Missing SlotIndexes"); in calculateValues()
154 std::tie(Begin, End) = Indexes->getMBBRange(&B); in isDefOnEntry()
214 const MachineInstr *MI = Indexes->getInstructionFromIndex(Use); in findReachingDefs()
248 std::tie(Start, End) = Indexes->getMBBRange(Pred); in findReachingDefs()
289 std::tie(Start, End) = Indexes in findReachingDefs()
434 isJointlyDominated(const MachineBasicBlock * MBB,ArrayRef<SlotIndex> Defs,const SlotIndexes & Indexes) isJointlyDominated() argument
[all...]
H A DSlotIndexes.cpp1 //===-- SlotIndexes.cpp - Slot Indexes Pass ------------------------------===//
32 OS << "Slot indexes in machine function: " << MF.getName() << '\n'; in run()
70 // iterator in lock-step (though skipping it over indexes which have in analyze()
137 assert(MIEntry.getInstr() == &MI && "Instruction indexes broken."); in removeMachineInstrFromMaps()
139 // FIXME: Eventually we want to actually delete these indexes. in removeMachineInstrFromMaps()
150 assert(MIEntry.getInstr() == &MI && "Instruction indexes broken."); in removeSingleMachineInstrFromMaps()
165 // FIXME: Eventually we want to actually delete these indexes. in removeSingleMachineInstrFromMaps()
170 // Renumber indexes locally after curItr was inserted, but failed to get a new
173 // Number indexes with half the default spacing so we can catch up quickly. in renumberIndexes()
190 // Repair indexes after adding and removing instructions.
H A DRegAllocPriorityAdvisor.h35 SlotIndexes *const Indexes);
44 SlotIndexes *const Indexes; variable
52 SlotIndexes *const Indexes) in DefaultPriorityAdvisor() argument
53 : RegAllocPriorityAdvisor(MF, RA, Indexes) {} in DefaultPriorityAdvisor()
H A DInterferenceCache.h59 /// Indexes - Mapping block numbers to SlotIndex ranges.
60 SlotIndexes *Indexes = nullptr; variable
103 void clear(MachineFunction *mf, SlotIndexes *indexes, LiveIntervals *lis) { in clear() argument
107 Indexes = indexes; in clear()
169 SlotIndexes *indexes, LiveIntervals *lis,
H A DLiveIntervals.cpp87 LIS.Indexes = &getAnalysis<SlotIndexesWrapperPass>().getSI(); in INITIALIZE_PASS_DEPENDENCY()
194 MF->print(OS, Indexes); in printInstrs()
245 RegMaskSlots.push_back(Indexes->getMBBStartIdx(&MBB)); in computeRegMasks()
254 RegMaskSlots.push_back(Indexes->getMBBStartIdx(&MBB)); in computeRegMasks()
262 RegMaskSlots.push_back(Indexes->getInstructionIndex(MI).getRegSlot()); in computeRegMasks()
273 Indexes->getInstructionIndex(MBB.back()).getRegSlot()); in computeRegMasks()
354 SlotIndex Begin = Indexes->getMBBStartIdx(&MBB); in computeLiveInRegUnits()
417 const MachineBasicBlock *MBB = Indexes->getMBBFromIndex(Idx.getPrevSlot()); in extendSegmentsToUses()
418 SlotIndex BlockStart = Indexes->getMBBStartIdx(MBB); in extendSegmentsToUses()
432 SlotIndex Stop = Indexes->getMBBEndIdx(Pred); in extendSegmentsToUses()
[all …]
H A DVirtRegMap.cpp188 SlotIndexes *Indexes = nullptr; member in __anonbe45f4950111::VirtRegRewriter
261 Indexes = &getAnalysis<SlotIndexesWrapperPass>().getSI(); in runOnMachineFunction()
315 for (SlotIndexes::MBBIndexIterator MBBI = Indexes->getMBBLowerBound(First); in addLiveInsForSubRanges()
316 MBBI != Indexes->MBBIndexEnd() && MBBI->first <= Last; ++MBBI) { in addLiveInsForSubRanges()
363 // sorted by slot indexes. in addMBBLiveIns()
364 SlotIndexes::MBBIndexIterator I = Indexes->MBBIndexBegin(); in addMBBLiveIns()
366 I = Indexes->getMBBLowerBound(I, Seg.start); in addMBBLiveIns()
367 for (; I != Indexes->MBBIndexEnd() && I->first < Seg.end; ++I) { in addMBBLiveIns()
434 if (Indexes) in handleIdentityCopy()
435 Indexes->removeSingleMachineInstrFromMaps(MI); in handleIdentityCopy()
[all …]
H A DMachineBasicBlock.cpp343 void MachineBasicBlock::print(raw_ostream &OS, const SlotIndexes *Indexes, in print() argument
355 print(OS, MST, Indexes, IsStandalone); in print()
359 const SlotIndexes *Indexes, in print() argument
368 if (Indexes && PrintSlotIndexes) in print()
369 OS << Indexes->getMBBStartIdx(this) << '\t'; in print()
381 if (Indexes) OS << '\t'; in print()
392 if (Indexes) OS << '\t'; in print()
423 if (Indexes) OS << '\t'; in print()
440 if (Indexes && PrintSlotIndexes) { in print()
441 if (Indexes->hasIndex(MI)) in print()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVSupport.cpp75 LexicalIndexes Indexes; in getAllLexicalIndexes() local
79 LexicalEntry Entry = Indexes.back(); in getAllLexicalIndexes()
105 Indexes.push_back(LexicalEntry(Current, Index - 2)); in getAllLexicalIndexes()
115 Indexes.push_back(LexicalEntry(Current, Length - 1)); in getAllLexicalIndexes()
117 return Indexes; in getAllLexicalIndexes()
124 LexicalIndexes Indexes = getAllLexicalIndexes(Name); in getInnerComponent() local
125 if (Indexes.size() == 1) in getInnerComponent()
128 LexicalEntry BeginEntry = Indexes.front(); in getInnerComponent()
129 LexicalEntry EndEntry = Indexes[Indexes.size() - 2]; in getInnerComponent()
133 LexicalEntry LastEntry = Indexes.back(); in getInnerComponent()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Index/
H A DIndexingAction.h35 /// Creates an ASTConsumer that indexes all symbols (macros and AST decls).
48 /// Creates a frontend action that indexes all symbols (macros and AST decls).
53 /// Recursively indexes all decls in the AST.
57 /// Recursively indexes \p Decls.
62 /// Creates a PPCallbacks that indexes macros and feeds macros to \p Consumer.
67 /// Recursively indexes all top-level decls in the module.
/freebsd/contrib/llvm-project/lldb/include/lldb/Symbol/
H A DSymtab.h47 void Dump(Stream *s, Target *target, std::vector<uint32_t> &indexes,
65 std::vector<uint32_t> &indexes,
70 std::vector<uint32_t> &indexes, uint32_t start_idx = 0,
94 std::vector<uint32_t> &indexes,
99 std::vector<uint32_t> &indexes,
126 void SortSymbolIndexesByValue(std::vector<uint32_t> &indexes,
133 void AppendSymbolNamesToMap(const IndexCollection &indexes,
328 /// names lazily, rather than adding them to the normal symbol indexes. This
329 /// function does the job of first consulting the name indexes, and if that
335 /// @param[out] indexes The vector if symbol indexes to update with results.
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonTfrCleanup.cpp76 bool rewriteIfImm(MachineInstr *MI, ImmediateMap &IMap, SlotIndexes *Indexes);
77 bool eraseIfRedundant(MachineInstr *MI, SlotIndexes *Indexes);
191 SlotIndexes *Indexes) { in rewriteIfImm() argument
234 if (Indexes) in rewriteIfImm()
235 Indexes->replaceMachineInstrInMaps(*MI, *NewMI); in rewriteIfImm()
242 SlotIndexes *Indexes) { in eraseIfRedundant() argument
274 if (Indexes) in eraseIfRedundant()
275 Indexes->removeMachineInstrFromMaps(*MI); in eraseIfRedundant()
286 SlotIndexes *Indexes = SIWrapper ? &SIWrapper->getSI() : nullptr; in runOnMachineFunction() local
299 bool E = eraseIfRedundant(MI, Indexes); in runOnMachineFunction()
[all …]
/freebsd/crypto/openssl/crypto/bn/
H A Dbn_ctx.c48 /* Array of indexes into the bignum stack */
49 unsigned int *indexes; member
100 while (bnidx++ < stack->indexes[fpidx]) in ctxdbg()
252 st->indexes = NULL; in BN_STACK_init()
258 OPENSSL_free(st->indexes); in BN_STACK_finish()
259 st->indexes = NULL; in BN_STACK_finish()
276 memcpy(newitems, st->indexes, sizeof(*newitems) * st->depth); in BN_STACK_push()
277 OPENSSL_free(st->indexes); in BN_STACK_push()
278 st->indexes = newitems; in BN_STACK_push()
281 st->indexes[(st->depth)++] = idx; in BN_STACK_push()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLiveIntervals.h62 SlotIndexes *Indexes = nullptr; variable
79 /// MI = Indexes->getInstructionFromIndex(RegMaskSlot[N]);
103 : Indexes(&SI), DomTree(&DT) { in LiveIntervals()
228 SlotIndexes *getSlotIndexes() const { return Indexes; } in getSlotIndexes()
233 return !Indexes->hasIndex(Instr); in isNotInMIMap()
238 return Indexes->getInstructionIndex(Instr); in getInstructionIndex()
243 return Indexes->getInstructionFromIndex(index); in getInstructionFromIndex()
248 return Indexes->getMBBStartIdx(mbb); in getMBBStartIdx()
253 return Indexes->getMBBEndIdx(mbb); in getMBBEndIdx()
265 return Indexes->getMBBFromIndex(index); in getMBBFromIndex()
[all …]
/freebsd/contrib/llvm-project/lldb/bindings/interface/
H A DSBValueDocstrings.i57 Classes reserve the first indexes for base classes that have
66 negative indexes. If the pointer points to an aggregate type
68 transparently skipped and any children are going to be the indexes
81 index and will returns invalid child values for indexes that are
83 case the array can create 'synthetic' child values for indexes
85 indexes.
97 for pointers and arrays for indexes that normally wouldn't
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSILowerSGPRSpills.cpp40 SlotIndexes *Indexes = nullptr; member in __anoneec5f4eb0111::SILowerSGPRSpills
87 ArrayRef<CalleeSavedInfo> CSI, SlotIndexes *Indexes, in insertCSRSaves() argument
116 if (Indexes) { in insertCSRSaves()
119 Indexes->insertMachineInstrInMaps(Inst); in insertCSRSaves()
131 SlotIndexes *Indexes, LiveIntervals *LIS) { in insertCSRRestores() argument
156 if (Indexes) { in insertCSRRestores()
158 Indexes->insertMachineInstrInMaps(Inst); in insertCSRRestores()
247 insertCSRSaves(*SaveBlock, CSI, Indexes, LIS); in spillCalleeSavedRegs()
254 insertCSRRestores(*RestoreBlock, CSI, Indexes, LIS); in spillCalleeSavedRegs()
317 Indexes = SIWrapper ? &SIWrapper->getSI() : nullptr; in runOnMachineFunction()
[all …]
H A DSILowerWWMCopies.cpp55 SlotIndexes *Indexes; member in __anon72eb24b60111::SILowerWWMCopies
108 Indexes = SIWrapper ? &SIWrapper->getSI() : nullptr; in runOnMachineFunction()
131 isSCCLiveAtMI(MI), Indexes); in runOnMachineFunction()
132 TII->restoreExec(MF, MBB, ++InsertPt, DL, RegForExecCopy, Indexes); in runOnMachineFunction()
/freebsd/sys/contrib/zstd/lib/dictBuilder/
H A Ddivsufsort.h54 * @param num_indexes The length of secondary indexes array. (can be NULL)
55 * @param indexes The secondary indexes array. (can be NULL)
60 … char *T, unsigned char *U, int *A, int n, unsigned char * num_indexes, int * indexes, int openMP);
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DCloneDetection.cpp147 // Erasing a list of indexes from the vector should be done with decreasing in constrain()
148 // indexes. As IndexesToRemove is constructed with increasing values, we just in constrain()
480 // Contains all indexes in HashGroup that were already added to a in splitCloneGroups()
482 std::vector<char> Indexes; in splitCloneGroups() local
483 Indexes.resize(HashGroup.size()); in splitCloneGroups()
486 // Skip indexes that are already part of a CloneGroup. in splitCloneGroups()
487 if (Indexes[i]) in splitCloneGroups()
493 // We don't add i to Indexes because we never iterate back. in splitCloneGroups()
496 ++Indexes[i]; in splitCloneGroups()
500 // Skip indexes that are already part of a CloneGroup. in splitCloneGroups()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/GSYM/
H A DGsymReader.h143 /// Used to convert any file indexes in the FunctionInfo data back into in getFile()
163 /// This function will convert any string table indexes and file indexes
173 /// This function will convert any string table indexes and file indexes
184 /// This function will convert any string table indexes and file indexes
197 /// This function will convert any string table indexes into human readable in getNumAddresses()
/freebsd/contrib/llvm-project/llvm/lib/ProfileData/
H A DMemProf.cpp441 // Indexes caches the indexes of the previous call stack's frames within
456 assert(CommonLen <= Indexes.size()); in encodeCallStack()
457 Indexes.resize(CommonLen); in encodeCallStack()
462 uint32_t ParentIndex = Indexes.back(); in encodeCallStack()
473 Indexes.push_back(RadixArray.size()); in encodeCallStack()
476 assert(CallStack->size() == Indexes.size()); in encodeCallStack()
558 // Indexes will grow as long as the longest call stack. in build()
559 Indexes.clear(); in build()
560 Indexes.reserve(512); in build()
610 // "Reverse" the indexes stored in CallStackPos. in build()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DLegalizerInfo.h271 /// True iff the given types for the given pair of type indexes is one of the
276 /// True iff the given types for the given pair of type indexes is one of the
499 /// Use the given action when type indexes 0 and 1 is any type pair in the
507 /// Use the given action when type indexes 0 and 1 is any type pair in the
534 /// Use the given action when type indexes 0 and 1 are both in the given list.
543 /// Use the given action when type indexes 0 and 1 are both in their
555 /// Use the given action when type indexes 0, 1, and 2 are all in their
602 /// The instruction is legal when type indexes 0 and 1 is any type pair in the
620 /// The instruction is legal when type indexes 0 and 1 along with the memory
629 /// The instruction is legal when type indexes 0 and 1 are both in the given
[all …]
/freebsd/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/
H A DSymbolFileDWARFProperties.td4 def IgnoreIndexes: Property<"ignore-file-indexes", "Boolean">,
7 Desc<"Ignore indexes present in the object files and always index DWARF manually.">;

12345678910>>...25