/freebsd-12-stable/contrib/llvm-project/lldb/source/API/ |
H A D | SBBlock.cpp | 18 #include "lldb/Symbol/Block.h" 32 SBBlock::SBBlock(lldb_private::Block *lldb_object_ptr) 169 lldb_private::Block *SBBlock::GetPtr() { return m_opaque_ptr; } 171 void SBBlock::SetPtr(lldb_private::Block *block) { m_opaque_ptr = block; } 181 strm.Printf("Block: {id: %" PRIu64 "} ", id); 254 Block *block = GetPtr(); 309 Block *block = GetPtr();
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
H A D | EHFrameSupport.cpp | 38 DenseMap<Block *, LinkGraph::SplitBlockCache> Caches; 65 Error EHFrameSplitter::processBlock(LinkGraph &G, Block &B, 78 LLVM_DEBUG(dbgs() << " Block is empty. Skipping.\n"); 153 std::vector<Block *> EHFrameBlocks; 156 llvm::sort(EHFrameBlocks, [](const Block *LHS, const Block *RHS) { 168 Error EHFrameEdgeFixer::processBlock(ParseContext &PC, Block &B) { 181 LLVM_DEBUG(dbgs() << " Block is empty. Skipping.\n"); 257 Error EHFrameEdgeFixer::processCIE(ParseContext &PC, Block &B, 383 Error EHFrameEdgeFixer::processFDE(ParseContext &PC, Block [all...] |
H A D | BasicGOTAndStubsBuilder.h | 28 std::vector<Block *> Blocks(G.blocks().begin(), G.blocks().end());
|
H A D | JITLinkGeneric.cpp | 153 auto CompareBlocks = [](const Block *LHS, const Block *RHS) { 318 DenseSet<Block *> VisitedBlocks; 362 std::vector<Block *> BlocksToRemove;
|
H A D | JITLinkGeneric.h | 44 using BlocksList = std::vector<Block *>; 84 static JITTargetAddress alignToBlock(JITTargetAddress Addr, Block &B) { 90 static char *alignToBlock(char *P, Block &B) { 200 // Copy Block data and apply fixups.
|
/freebsd-12-stable/contrib/llvm-project/lldb/source/Symbol/ |
H A D | SymbolContext.cpp | 15 #include "lldb/Symbol/Block.h" 34 Block *b, LineEntry *le, Symbol *s) 42 CompileUnit *cu, Function *f, Block *b, 117 Block *inlined_block = block->GetContainingInlinedBlock(); 215 std::vector<Block *> blocks; 217 Block *parent_block = block->GetParent(); 223 std::vector<Block *>::reverse_iterator pos; 224 std::vector<Block *>::reverse_iterator begin = blocks.rbegin(); 225 std::vector<Block *>::reverse_iterator end = blocks.rend(); 338 *s << "Block [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ImplicitNullChecks.cpp | 118 ArrayRef<MachineInstr *> Block); 248 ArrayRef<MachineInstr *> Block) { 249 assert(llvm::all_of(Block, canHandle) && "Check this first!"); 250 assert(!is_contained(Block, MI) && "Block must be exclusive of MI!"); 254 for (auto I = Block.begin(), E = Block.end(); I != E; ++I) { 247 computeDependence(const MachineInstr *MI, ArrayRef<MachineInstr *> Block) argument
|
H A D | MachineTraceMetrics.cpp | 1336 const MachineTraceMetrics::TraceBlockInfo *Block = &TBI; 1338 while (Block->hasValidDepth() && Block->Pred) { 1339 unsigned Num = Block->Pred->getNumber(); 1340 OS << " <- " << printMBBReference(*Block->Pred); 1341 Block = &TE.BlockInfo[Num]; 1344 Block = &TBI; 1346 while (Block->hasValidHeight() && Block->Succ) { 1347 unsigned Num = Block [all...] |
/freebsd-12-stable/contrib/llvm-project/lldb/include/lldb/Core/ |
H A D | Address.h | 21 class Block; 474 Block *CalculateSymbolContextBlock() const;
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/ |
H A D | DebugLinesSubsection.cpp | 82 Block &B = Blocks.back(); 93 Block &B = Blocks.back();
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/AST/Interp/ |
H A D | InterpState.h | 81 void deallocate(Block *B);
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/ |
H A D | SectionMemoryManager.h | 81 /// \p Block describes the memory block to be protected. 90 virtual std::error_code protectMappedMemory(const sys::MemoryBlock &Block, 96 /// \p Block describes the memory to be released.
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DivergenceAnalysis.cpp | 199 for (auto *Block : TaintStack) { 200 Visited.insert(Block); 253 void DivergenceAnalysis::pushPHINodes(const BasicBlock &Block) { argument 254 for (const auto &Phi : Block.phis()) {
|
/freebsd-12-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGObjCRuntime.cpp | 121 llvm::BasicBlock *Block; member in struct:__anon2892::CatchHandler 173 Handler.Block = CGF.createBasicBlock("catch"); 190 Catch->setHandler(I, { Handlers[I].TypeInfo, Handlers[I].Flags }, Handlers[I].Block); 229 CGF.EmitBlock(Handler.Block); 233 if ((CPI = dyn_cast_or_null<llvm::CatchPadInst>(Handler.Block->getFirstNonPHI()))) {
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | ADCE.cpp | 82 struct BlockInfoType *Block = nullptr; member in struct:__anon5618::InstInfoType 237 InstInfo[&I].Block = &BBInfo.second; 392 auto &BBInfo = *Info.Block; 644 for (BasicBlock *Block : inverse_post_order_ext(&BB,Visited)) 645 BlockInfo[Block].PostOrder = PostOrder++;
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | CodeExtractor.cpp | 287 auto hasNonCommonExitSucc = [&](BasicBlock *Block) { 288 for (auto *Succ : successors(Block)) { 745 for (BasicBlock *Block : Blocks) 746 if (ReturnInst *RI = dyn_cast<ReturnInst>(Block->getTerminator())) { 748 Block->splitBasicBlock(RI->getIterator(), Block->getName() + ".ret"); 752 DomTreeNode *OldNode = DT->getNode(Block); 756 DomTreeNode *NewNode = DT->addNewBlock(New, Block); 1191 for (BasicBlock *Block : Blocks) { 1192 Instruction *TI = Block [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/tools/llvm-pdbutil/ |
H A D | LinePrinter.cpp | 132 explicit Run(uint32_t Block) : Block(Block) {} argument 133 uint32_t Block = 0; member in struct:__anon5846::Run 230 uint64_t Base = FoundRun.Block * File.getBlockSize() + RunOffset; 254 OS << formatv("Block {0} (\n", uint32_t(Blocks.front()));
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VPlan.h | 456 /// An Enclosing Block of a block B is any block containing B, including B 537 assert(Predecessors.empty() && "Block predecessors already set."); 1405 VPBlockBase *setEntry(VPBlockBase *Block) { return Entry = Block; } 1488 /// Print a given \p Block of the Plan. 1489 void dumpBlock(const VPBlockBase *Block); 1492 /// \p Block, followed by printing the successor blocks themselves. 1493 void dumpEdges(const VPBlockBase *Block); 1502 unsigned getOrCreateBID(const VPBlockBase *Block) { 1503 return BlockID.count(Block) [all...] |
/freebsd-12-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | CoreEngine.h | 194 void enqueue(ExplodedNodeSet &Set, const CFGBlock *Block, unsigned Idx); 201 void enqueueStmtNode(ExplodedNode *N, const CFGBlock *Block, unsigned Idx); 209 const CFGBlock *Block; member in struct:clang::ento::NodeBuilderContext 213 : Eng(E), Block(B), LC(N->getLocationContext()) { assert(B); } 216 const CFGBlock *getBlock() const { return Block; } 223 Block->getBlockID());
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/ |
H A D | SpeculateAnalyses.cpp | 140 for (auto &Block : F.getBasicBlockList()) 141 if (llvm::is_contained(BBList, &Block)) 142 RearrangedBBSet.push_back(&Block); 178 // Since we are checking for predecessor's backedges, this Block 219 // Since we are checking for successor's backedges, this Block 231 // Get Block frequencies for blocks and take most frquently executed block,
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionExpander.h | 104 AssertingVH<BasicBlock> Block; member in class:llvm::SCEVExpander::SCEVInsertPointGuard 114 : Builder(B), Block(B.GetInsertBlock()), Point(B.GetInsertPoint()), 125 Builder.restoreIP(IRBuilderBase::InsertPoint(Block, Point));
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
H A D | CoroFrame.cpp | 88 SmallVector<BlockData, SmallVectorThreshold> Block; member in struct:__anon5512::SuspendCrossingInfo 91 BasicBlock *BB = Mapping.indexToBlock(&BD - &Block[0]); 96 return Block[Mapping.blockToIndex(BB)]; 108 assert(Block[UseIndex].Consumes[DefIndex] && "use must consume def"); 109 bool const Result = Block[UseIndex].Kills[DefIndex]; 168 for (size_t I = 0, N = Block.size(); I < N; ++I) { 171 dump(" Consumes", Block[I].Consumes); 172 dump(" Kills", Block[I].Kills); 181 Block.resize(N); 185 auto &B = Block[ [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Bitstream/ |
H A D | BitstreamWriter.h | 47 struct Block { struct in class:llvm::BitstreamWriter 51 Block(unsigned PCS, size_t SSW) : PrevCodeSize(PCS), StartSizeWord(SSW) {} function in struct:llvm::BitstreamWriter::Block 55 std::vector<Block> BlockScope; 89 assert(BlockScope.empty() && CurAbbrevs.empty() && "Block imbalance"); 182 // Block Manipulation 200 // Block header: 229 assert(!BlockScope.empty() && "Block scope imbalance!"); 230 const Block &B = BlockScope.back(); 232 // Block tail: 498 // BlockInfo Block Emissio [all...] |
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | primary32.h | 44 // Regions should be large enough to hold the largest Block. 154 for (uptr Block = From; Block < To; Block += BlockSize) 155 Callback(Block);
|
H A D | primary64.h | 154 for (uptr Block = From; Block < To; Block += BlockSize) 155 Callback(Block);
|