Home
last modified time | relevance | path

Searched refs:StartIdx (Results 1 – 25 of 672) sorted by relevance

12345678910>>...27

/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/unittests/Support/
H A DSuffixTreeTest.cpp32 EXPECT_EQ(SimpleRepetitionData[StartIdx], 1u); in TEST()
33 EXPECT_EQ(SimpleRepetitionData[StartIdx + 1], 2u); in TEST()
59 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
60 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
67 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
68 IsExpectedIndex = (StartIdx == 1u || StartIdx == 4u); in TEST()
94 std::advance(RRDIt, StartIdx); in TEST()
130 for (unsigned StartIdx : RS.StartIndices) { in TEST() local
131 IsExpectedIndex = (StartIdx == 0u || StartIdx == 3u); in TEST()
134 std::advance(RRDIt, StartIdx); in TEST()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/lib/compiler-rt/lib/esan/
H A Desan_circular_buffer.h41 StartIdx = 0; in initialize()
50 uptr ArrayIdx = (StartIdx + Idx) % Capacity;
55 uptr ArrayIdx = (StartIdx + Idx) % Capacity;
60 uptr ArrayIdx = (StartIdx + Count) % Capacity; in push_back()
65 StartIdx = (StartIdx + 1) % Capacity; in push_back()
69 uptr ArrayIdx = (StartIdx + Count - 1) % Capacity; in back()
80 StartIdx = 0; in clear()
92 uptr StartIdx; variable
/dports/devel/intel-graphics-compiler/intel-graphics-compiler-igc-1.0.9636/IGC/VectorCompiler/lib/GenXCodeGen/
H A DGenXLegalization.cpp847 for (unsigned StartIdx = 0; StartIdx != WholeWidth;) { in processBale() local
869 StartIdx += Width; in processBale()
966 for (unsigned StartIdx = 0; StartIdx != WholeSize;) { in processAllAny() local
969 Pred, StartIdx, PP.Size, Pred->getName() + ".split" + Twine(StartIdx), in processAllAny()
998 StartIdx += PP.Size; in processAllAny()
1330 RdPredStart + StartIdx); in determineWidth()
1739 if (!StartIdx) { in joinBaleResult()
1917 StartIdx <<= Doubling; in splitInst()
2434 for (unsigned StartIdx = 0; StartIdx != WholeSize;) { in fixIllegalPredicates() local
2458 if (!StartIdx) in fixIllegalPredicates()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/devel/llvm11/llvm-11.0.1.src/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/lib/Support/
H A DSuffixTree.cpp42 unsigned StartIdx, unsigned Edge) { in insertLeaf() argument
44 assert(StartIdx <= LeafEndIdx && "String can't start after it ends!"); in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
54 unsigned StartIdx, in insertInternalNode() argument
57 assert(StartIdx <= EndIdx && "String can't start after it ends!"); in insertInternalNode()
58 assert(!(!Parent && StartIdx != EmptyIdx) && in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
147 if (Str[NextNode->StartIdx + Active.Len] == LastChar) { in extend()
175 insertInternalNode(Active.Node, NextNode->StartIdx, in extend()
184 NextNode->StartIdx += Active.Len; in extend()
[all …]
/dports/devel/llvm80/llvm-8.0.1.src/lib/CodeGen/GlobalISel/
H A DRegisterBankInfo.cpp618 int StartIdx = OpToNewVRegIdx[OpIdx]; in getVRegsMem() local
620 if (StartIdx == OperandsMapper::DontKnowIdx) { in getVRegsMem()
624 StartIdx = NewVRegs.size(); in getVRegsMem()
625 OpToNewVRegIdx[OpIdx] = StartIdx; in getVRegsMem()
630 getNewVRegsEnd(StartIdx, NumPartialVal); in getVRegsMem()
632 return make_range(&NewVRegs[StartIdx], End); in getVRegsMem()
643 assert((NewVRegs.size() == StartIdx + NumVal || in getNewVRegsEnd()
689 int StartIdx = OpToNewVRegIdx[OpIdx]; in getVRegs() local
691 if (StartIdx == OperandsMapper::DontKnowIdx) in getVRegs()
697 getNewVRegsEnd(StartIdx, PartMapSize); in getVRegs()
[all …]

12345678910>>...27