OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:EndIdx
(Results
1 - 11
of
11
) sorted by relevancy
/src/external/apache2/llvm/dist/llvm/include/llvm/Support/
Automaton.h
133
unsigned
EndIdx
= TransitionInfoIdx;
134
while (TransitionInfo[
EndIdx
].ToDfaState != 0)
135
++
EndIdx
;
137
EndIdx
- TransitionInfoIdx);
SuffixTree.h
54
/// Every leaf node must have its \p
EndIdx
incremented at the end of every
58
unsigned *
EndIdx
= nullptr;
102
assert(*
EndIdx
!= EmptyIdx && "
EndIdx
is undefined!");
106
return *
EndIdx
- StartIdx + 1;
109
SuffixTreeNode(unsigned StartIdx, unsigned *
EndIdx
, SuffixTreeNode *Link)
110
: StartIdx(StartIdx),
EndIdx
(
EndIdx
), Link(Link) {}
204
/// \param
EndIdx
The end index of this node's associated string.
209
unsigned
EndIdx
, unsigned Edge)
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/
AArch64ExpandImm.cpp
157
int
EndIdx
= NotSet;
167
EndIdx
= Idx;
171
if (StartIdx == NotSet ||
EndIdx
== NotSet)
182
if (StartIdx >
EndIdx
) {
183
std::swap(StartIdx,
EndIdx
);
198
if ((Idx < StartIdx ||
EndIdx
< Idx) && Chunk != Outside) {
209
} else if (Idx > StartIdx && Idx <
EndIdx
&& Chunk != Inside) {
/src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIOptimizeExecMaskingPreRA.cpp
283
SlotIndex
EndIdx
= LIS->getInstructionIndex(*AndExecMI);
286
if (RegUnit.find(StartIdx) != std::prev(RegUnit.find(
EndIdx
)))
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachineOutliner.cpp
525
unsigned
EndIdx
= StartIdx + StringLen - 1;
548
&
EndIdx
](const Candidate &C) {
549
return (
EndIdx
< C.getStartIdx() || StartIdx > C.getEndIdx());
556
MachineBasicBlock::iterator EndIt = Mapper.InstrList[
EndIdx
];
MIRPrinter.cpp
406
const int
EndIdx
= MFI.getObjectIndexEnd();
407
if (
EndIdx
> 0)
408
StackObjectsIdx.reserve(
EndIdx
);
410
for (int I = 0; I <
EndIdx
; ++I, ++ID) {
StackColoring.cpp
912
SlotIndex
EndIdx
= Indexes->getMBBEndIdx(&MBB);
914
Intervals[i]->addSegment(LiveInterval::Segment(Starts[i],
EndIdx
, VNI));
LiveIntervals.cpp
1564
const SlotIndex
EndIdx
, LiveRange &LR,
1567
LiveInterval::iterator LII = LR.find(
EndIdx
);
1574
if (LII != LR.end() && LII->start <
EndIdx
)
1668
SlotIndex
EndIdx
;
1670
EndIdx
= getMBBEndIdx(MBB).getPrevSlot();
1672
EndIdx
= getInstructionIndex(*End);
1701
repairOldRegInRange(Begin, End,
EndIdx
, S, Reg, S.LaneMask);
1703
repairOldRegInRange(Begin, End,
EndIdx
, LI, Reg);
/src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
IROutliner.cpp
1237
unsigned
EndIdx
= IRSC.getEndIdx();
1239
for (unsigned Idx = StartIdx; Idx <=
EndIdx
; Idx++)
1283
CurrentEndIdx =
EndIdx
;
1636
unsigned
EndIdx
= OS->Candidate->getEndIdx();
1637
for (unsigned Idx = StartIdx; Idx <=
EndIdx
; Idx++)
/src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineVectorOps.cpp
1740
unsigned
EndIdx
= Mask.back();
1741
if (BegIdx >
EndIdx
||
EndIdx
>= LHSElems ||
EndIdx
- BegIdx != MaskElems - 1)
/src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenRegisters.cpp
1840
for (unsigned SubIdx = 0,
EndIdx
= RegUnitSets.size();
1841
SubIdx !=
EndIdx
; ++SubIdx) {
1844
for (; SuperIdx !=
EndIdx
; ++SuperIdx) {
1865
if (SuperIdx ==
EndIdx
)
1931
for (unsigned Idx = 0,
EndIdx
= RegUnitSets.size(); Idx !=
EndIdx
; ++Idx) {
1939
SearchIdx !=
EndIdx
; ++SearchIdx) {
2113
for (unsigned Idx = 0,
EndIdx
= RegUnitSets.size(); Idx !=
EndIdx
; ++Idx)
2118
for (unsigned Idx = 0,
EndIdx
= RegUnitSets.size(); Idx != EndIdx; ++Idx
[
all
...]
Completed in 46 milliseconds
Indexes created Thu Sep 24 00:25:51 UTC 2026