| /external/e2fsprogs/tests/r_move_itable/ |
| D | expect | 34 Blocks per group: 256
47 Group 0: (Blocks 1-256)
55 Group 1: (Blocks 257-512)
63 Group 2: (Blocks 513-768)
69 Group 3: (Blocks 769-1024)
77 Group 4: (Blocks 1025-1280)
83 Group 5: (Blocks 1281-1536)
91 Group 6: (Blocks 1537-1792)
97 Group 7: (Blocks 1793-2048)
105 Group 8: (Blocks 2049-2304)
[all …]
|
| /external/e2fsprogs/tests/m_meta_bg/ |
| D | expect.1 | 34 Blocks per group: 1024
47 Group 0: (Blocks 1-1024)
54 Group 1: (Blocks 1025-2048)
61 Group 2: (Blocks 2049-3072)
67 Group 3: (Blocks 3073-4096)
74 Group 4: (Blocks 4097-5120)
80 Group 5: (Blocks 5121-6144)
87 Group 6: (Blocks 6145-7168)
93 Group 7: (Blocks 7169-8192)
100 Group 8: (Blocks 8193-9216)
[all …]
|
| /external/e2fsprogs/tests/m_desc_size_128/ |
| D | expect.1 | 36 Blocks per group: 1024
49 Group 0: (Blocks 1-1024)
57 Group 1: (Blocks 1025-2048)
65 Group 2: (Blocks 2049-3072)
71 Group 3: (Blocks 3073-4096)
79 Group 4: (Blocks 4097-5120)
85 Group 5: (Blocks 5121-6144)
93 Group 6: (Blocks 6145-7168)
99 Group 7: (Blocks 7169-8192)
107 Group 8: (Blocks 8193-9216)
[all …]
|
| /external/e2fsprogs/tests/m_raid_opt/ |
| D | expect.1 | 35 Blocks per group: 1024
49 Group 0: (Blocks 1-1024)
57 Group 1: (Blocks 1025-2048)
65 Group 2: (Blocks 2049-3072)
71 Group 3: (Blocks 3073-4096)
79 Group 4: (Blocks 4097-5120)
85 Group 5: (Blocks 5121-6144)
93 Group 6: (Blocks 6145-7168)
99 Group 7: (Blocks 7169-8192)
107 Group 8: (Blocks 8193-9216)
[all …]
|
| /external/e2fsprogs/tests/r_resize_inode/ |
| D | expect | 32 Blocks per group: 1024
45 Group 0: (Blocks 1-1024)
53 Group 1: (Blocks 1025-2048)
61 Group 2: (Blocks 2049-3072)
67 Group 3: (Blocks 3073-4096)
75 Group 4: (Blocks 4097-5120)
81 Group 5: (Blocks 5121-6144)
89 Group 6: (Blocks 6145-7168)
95 Group 7: (Blocks 7169-8192)
103 Group 8: (Blocks 8193-9216)
[all …]
|
| /external/oss-fuzz/infra/base-images/base-runner/gocoverage/gocovmerge/ |
| D | gocovmerge.go | 23 for _, b := range merge.Blocks {
30 pi := p.Blocks[i+startIndex]
36 i = sort.Search(len(p.Blocks)-startIndex, sortFunc)
39 …if i < len(p.Blocks) && p.Blocks[i].StartLine == pb.StartLine && p.Blocks[i].StartCol == pb.StartC…
40 if p.Blocks[i].EndLine != pb.EndLine || p.Blocks[i].EndCol != pb.EndCol {
41 log.Fatalf("OVERLAP MERGE: %v %v %v", p.FileName, p.Blocks[i], pb)
45 p.Blocks[i].Count |= pb.Count
47 p.Blocks[i].Count += pb.Count
53 pa := p.Blocks[i-1]
58 if i < len(p.Blocks)-1 {
[all …]
|
| /external/e2fsprogs/tests/m_bigjournal/ |
| D | expect.1 | 27 Blocks per group: 32768
50 Group 0: (Blocks 0-32767)
58 Group 1: (Blocks 32768-65535) [INODE_UNINIT, BLOCK_UNINIT]
66 Group 2: (Blocks 65536-98303) [INODE_UNINIT, BLOCK_UNINIT]
72 Group 3: (Blocks 98304-131071) [INODE_UNINIT, BLOCK_UNINIT]
80 Group 4: (Blocks 131072-163839) [INODE_UNINIT, BLOCK_UNINIT]
86 Group 5: (Blocks 163840-196607) [INODE_UNINIT, BLOCK_UNINIT]
94 Group 6: (Blocks 196608-229375) [INODE_UNINIT, BLOCK_UNINIT]
100 Group 7: (Blocks 229376-262143) [INODE_UNINIT, BLOCK_UNINIT]
108 Group 8: (Blocks 262144-294911) [INODE_UNINIT, BLOCK_UNINIT]
[all …]
|
| /external/llvm-project/clang/lib/Analysis/ |
| D | ThreadSafetyTIL.cpp | 165 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort() argument
170 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
175 Blocks[BlockID] = this; in topologicalSort()
189 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort() argument
196 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
198 ID = Pred->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
199 assert(static_cast<size_t>(ID) < Blocks.size()); in topologicalFinalSort()
201 Blocks[BlockID] = this; in topologicalFinalSort()
262 for (auto *Block : Blocks) in renumberInstrs()
292 unsigned NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
[all …]
|
| /external/clang/lib/Analysis/ |
| D | ThreadSafetyTIL.cpp | 168 int BasicBlock::topologicalSort(SimpleArray<BasicBlock*>& Blocks, int ID) { in topologicalSort() argument
172 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
177 Blocks[BlockID] = this; in topologicalSort()
191 int BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock*>& Blocks, int ID) { in topologicalFinalSort() argument
197 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
199 ID = Pred->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
200 assert(static_cast<size_t>(ID) < Blocks.size()); in topologicalFinalSort()
202 Blocks[BlockID] = this; in topologicalFinalSort()
264 for (auto *Block : Blocks) in renumberInstrs()
296 int NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
[all …]
|
| /external/llvm-project/llvm/unittests/DebugInfo/MSF/ |
| D | MSFCommonTest.cpp | 107 EXPECT_EQ(1u, SL.Blocks.size()); in TEST()
108 EXPECT_EQ(SB.FreeBlockMapBlock, SL.Blocks.front()); in TEST()
112 EXPECT_EQ(1u, SL.Blocks.size()); in TEST()
113 EXPECT_EQ(3u - SB.FreeBlockMapBlock, SL.Blocks.front()); in TEST()
119 EXPECT_EQ(2u, SL.Blocks.size()); in TEST()
120 EXPECT_EQ(SB.FreeBlockMapBlock, SL.Blocks[0]); in TEST()
121 EXPECT_EQ(SB.FreeBlockMapBlock + SB.BlockSize, SL.Blocks[1]); in TEST()
125 EXPECT_EQ(2u, SL.Blocks.size()); in TEST()
126 EXPECT_EQ(3u - SB.FreeBlockMapBlock, SL.Blocks[0]); in TEST()
127 EXPECT_EQ(3u - SB.FreeBlockMapBlock + SB.BlockSize, SL.Blocks[1]); in TEST()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/XRay/ |
| D | Profile.h | 89 : Blocks(std::move(O.Blocks)), NodeStorage(std::move(O.NodeStorage)), in Profile()
94 Blocks = std::move(O.Blocks);
107 swap(L.Blocks, R.Blocks); in swap()
125 BlockList Blocks; variable
141 const_iterator begin() const { return Blocks.begin(); } in begin()
142 const_iterator end() const { return Blocks.end(); } in end()
143 bool empty() const { return Blocks.empty(); } in empty()
|
| /external/llvm-project/llvm/include/llvm/XRay/ |
| D | Profile.h | 89 : Blocks(std::move(O.Blocks)), NodeStorage(std::move(O.NodeStorage)), in Profile()
94 Blocks = std::move(O.Blocks);
107 swap(L.Blocks, R.Blocks); in swap()
125 BlockList Blocks; variable
141 const_iterator begin() const { return Blocks.begin(); } in begin()
142 const_iterator end() const { return Blocks.end(); } in end()
143 bool empty() const { return Blocks.empty(); } in empty()
|
| /external/llvm-project/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyFixIrreducibleControlFlow.cpp | 85 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks) in ReachabilityGraph() argument
86 : Entry(Entry), Blocks(Blocks) { in ReachabilityGraph()
89 for (auto *MBB : Blocks) { in ReachabilityGraph()
125 const BlockSet &Blocks; member in __anon5335f1d20111::ReachabilityGraph
130 bool inRegion(MachineBasicBlock *MBB) const { return Blocks.count(MBB); } in inRegion()
142 for (auto *MBB : Blocks) { in calculate()
167 for (auto *MBB : Blocks) { in calculate()
198 BlockSet &getBlocks() { return Blocks; } in getBlocks()
204 BlockSet Blocks; member in __anon5335f1d20111::LoopBlocks
211 Blocks.insert(Entry); in calculate()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyFixIrreducibleControlFlow.cpp | 74 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks) in ReachabilityGraph() argument
75 : Entry(Entry), Blocks(Blocks) { in ReachabilityGraph()
78 for (auto *MBB : Blocks) { in ReachabilityGraph()
114 const BlockSet &Blocks; member in __anon4d3b72c60111::ReachabilityGraph
119 bool inRegion(MachineBasicBlock *MBB) const { return Blocks.count(MBB); } in inRegion()
131 for (auto *MBB : Blocks) { in calculate()
156 for (auto *MBB : Blocks) { in calculate()
187 BlockSet &getBlocks() { return Blocks; } in getBlocks()
193 BlockSet Blocks; member in __anon4d3b72c60111::LoopBlocks
200 Blocks.insert(Entry); in calculate()
[all …]
|
| /external/e2fsprogs/tests/m_quota/ |
| D | expect.1 | 35 Blocks per group: 8192
53 Group 0: (Blocks 1-8192)
61 Group 1: (Blocks 8193-16384)
69 Group 2: (Blocks 16385-24576)
75 Group 3: (Blocks 24577-32768)
83 Group 4: (Blocks 32769-40960)
89 Group 5: (Blocks 40961-49152)
97 Group 6: (Blocks 49153-57344)
103 Group 7: (Blocks 57345-65536)
111 Group 8: (Blocks 65537-73728)
[all …]
|
| /external/llvm-project/llvm/test/tools/llvm-pdbutil/ |
| D | stripped.test | 25 ; CHECK-NEXT: Blocks: [4]
27 ; CHECK-NEXT: Blocks: [14]
29 ; CHECK-NEXT: Blocks: [13]
31 ; CHECK-NEXT: Blocks: [7]
33 ; CHECK-NEXT: Blocks: [6]
35 ; CHECK-NEXT: Blocks: []
37 ; CHECK-NEXT: Blocks: [8]
39 ; CHECK-NEXT: Blocks: [9]
41 ; CHECK-NEXT: Blocks: [11]
43 ; CHECK-NEXT: Blocks: [10]
[all …]
|
| /external/llvm-project/llvm/lib/Transforms/Utils/ |
| D | FixIrreducible.cpp | 118 SetVector<BasicBlock *> &Blocks, in INITIALIZE_PASS_DEPENDENCY()
127 return L == NewLoop || Blocks.count(L->getHeader()) == 0; in INITIALIZE_PASS_DEPENDENCY()
161 SetVector<BasicBlock *> &Blocks, in createNaturalLoopInternal() argument
166 assert(Blocks.count(H)); in createNaturalLoopInternal()
215 for (auto BB : Blocks) { in createNaturalLoopInternal()
228 reconnectChildLoops(LI, ParentLoop, NewLoop, Blocks, Headers); in createNaturalLoopInternal()
249 SetVector<BasicBlock *> &Blocks, in createNaturalLoop() argument
251 createNaturalLoopInternal(LI, DT, nullptr, Blocks, Headers); in createNaturalLoop()
255 SetVector<BasicBlock *> &Blocks, in createNaturalLoop() argument
257 createNaturalLoopInternal(LI, DT, &L, Blocks, Headers); in createNaturalLoop()
[all …]
|
| D | CodeExtractor.cpp | 254 Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), in CodeExtractor()
263 Blocks(buildExtractionBlockSet(L.getBlocks(), &DT, in CodeExtractor()
270 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInRegion() argument
272 if (Blocks.count(I->getParent())) in definedInRegion()
280 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInCaller() argument
283 if (!Blocks.count(I->getParent())) in definedInCaller()
288 static BasicBlock *getCommonExitBlock(const SetVector<BasicBlock *> &Blocks) { in getCommonExitBlock() argument
293 if (Blocks.count(Succ)) in getCommonExitBlock()
305 if (any_of(Blocks, hasNonCommonExitSucc)) in getCommonExitBlock()
377 Function *Func = (*Blocks.begin())->getParent(); in isLegalToShrinkwrapLifetimeMarkers()
[all …]
|
| /external/e2fsprogs/tests/m_uninit/ |
| D | expect.1 | 35 Blocks per group: 8192
48 Group 0: (Blocks 1-8192) [ITABLE_ZEROED]
56 Group 1: (Blocks 8193-16384) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
64 Group 2: (Blocks 16385-24576) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
70 Group 3: (Blocks 24577-32768) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
78 Group 4: (Blocks 32769-40960) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
84 Group 5: (Blocks 40961-49152) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
92 Group 6: (Blocks 49153-57344) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
98 Group 7: (Blocks 57345-65536) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
106 Group 8: (Blocks 65537-73728) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/ProfileData/ |
| D | GCOV.cpp | 167 Blocks.push_back(std::make_unique<GCOVBlock>(*this, i)); in readGCNO()
188 Edges.push_back(std::make_unique<GCOVEdge>(*Blocks[BlockNo], *Blocks[Dst])); in readGCNO()
190 Blocks[BlockNo]->addDstEdge(Edge); in readGCNO()
191 Blocks[Dst]->addSrcEdge(Edge); in readGCNO()
213 GCOVBlock &Block = *Blocks[BlockNo]; in readGCNO()
315 if (BlockNo >= Blocks.size()) { in readGCDA()
319 if (BlockNo == Blocks.size() - 1) in readGCDA()
321 GCOVBlock &Block = *Blocks[BlockNo]; in readGCDA()
342 return Blocks.front()->getCount(); in getEntryCount()
348 return Blocks.back()->getCount(); in getExitCount()
[all …]
|
| /external/e2fsprogs/tests/m_resize_inode_meta_bg/ |
| D | expect.1 | 36 Blocks per group: 256
59 Group 0: (Blocks 0-255) [ITABLE_ZEROED]
67 Group 1: (Blocks 256-511) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
75 Group 2: (Blocks 512-767) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
82 Group 3: (Blocks 768-1023) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
90 Group 4: (Blocks 1024-1279) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
97 Group 5: (Blocks 1280-1535) [INODE_UNINIT, BLOCK_UNINIT, ITABLE_ZEROED]
105 Group 6: (Blocks 1536-1791) [INODE_UNINIT, ITABLE_ZEROED]
112 Group 7: (Blocks 1792-2047) [INODE_UNINIT, ITABLE_ZEROED]
120 Group 8: (Blocks 2048-2303) [INODE_UNINIT, ITABLE_ZEROED]
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/ |
| D | CodeExtractor.cpp | 251 Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), in CodeExtractor()
260 Blocks(buildExtractionBlockSet(L.getBlocks(), &DT, in CodeExtractor()
267 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInRegion() argument
269 if (Blocks.count(I->getParent())) in definedInRegion()
277 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInCaller() argument
280 if (!Blocks.count(I->getParent())) in definedInCaller()
285 static BasicBlock *getCommonExitBlock(const SetVector<BasicBlock *> &Blocks) { in getCommonExitBlock() argument
290 if (Blocks.count(Succ)) in getCommonExitBlock()
302 if (any_of(Blocks, hasNonCommonExitSucc)) in getCommonExitBlock()
374 Function *Func = (*Blocks.begin())->getParent(); in isLegalToShrinkwrapLifetimeMarkers()
[all …]
|
| /external/llvm-project/llvm/tools/llvm-pdbutil/ |
| D | LinePrinter.cpp | 144 ArrayRef<support::ulittle32_t> Blocks = Layout.Blocks; in computeBlockRuns() local
145 assert(!Blocks.empty()); in computeBlockRuns()
147 uint32_t CurrentBlock = Blocks[0]; in computeBlockRuns()
149 while (!Blocks.empty()) { in computeBlockRuns()
151 uint32_t NextBlock = Blocks.front(); in computeBlockRuns()
160 Blocks = Blocks.drop_front(); in computeBlockRuns()
248 auto Blocks = makeArrayRef(StreamLayout.Blocks); in formatMsfStreamBlocks() local
253 assert(!Blocks.empty()); in formatMsfStreamBlocks()
254 OS << formatv("Block {0} (\n", uint32_t(Blocks.front())); in formatMsfStreamBlocks()
257 cantFail(File.getBlockData(Blocks.front(), File.getBlockSize())); in formatMsfStreamBlocks()
[all …]
|
| /external/llvm/lib/Transforms/Utils/ |
| D | CodeExtractor.cpp | 124 Blocks(buildExtractionBlockSet(BB)), NumExitBlocks(~0U) {} in CodeExtractor()
129 Blocks(buildExtractionBlockSet(BBs)), NumExitBlocks(~0U) {} in CodeExtractor()
133 Blocks(buildExtractionBlockSet(L.getBlocks())), NumExitBlocks(~0U) {} in CodeExtractor()
138 Blocks(buildExtractionBlockSet(RN)), NumExitBlocks(~0U) {} in CodeExtractor()
142 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInRegion() argument
144 if (Blocks.count(I->getParent())) in definedInRegion()
152 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInCaller() argument
155 if (!Blocks.count(I->getParent())) in definedInCaller()
162 for (BasicBlock *BB : Blocks) { in findInputsOutputs()
168 if (definedInCaller(Blocks, *OI)) in findInputsOutputs()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | GVNSink.cpp | 120 ArrayRef<BasicBlock *> Blocks; member in __anon52d731fe0111::LockstepReverseIterator
126 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) { in LockstepReverseIterator() argument
133 for (BasicBlock *BB : Blocks) in reset()
136 for (BasicBlock *BB : Blocks) { in reset()
159 void restrictToBlocks(SmallSetVector<BasicBlock *, 4> &Blocks) { in restrictToBlocks() argument
161 if (std::find(Blocks.begin(), Blocks.end(), (*II)->getParent()) == in restrictToBlocks()
162 Blocks.end()) { in restrictToBlocks()
201 SmallVector<BasicBlock *, 4> Blocks; member
232 SmallVector<BasicBlock *, 4> Blocks; member in __anon52d731fe0111::ModelledPHI
244 Blocks.push_back(P.first); in ModelledPHI()
[all …]
|