Home
last modified time | relevance | path

Searched refs:Block (Results 1 – 25 of 471) sorted by relevance

12345678910>>...19

/src/contrib/llvm-project/lldb/source/Symbol/
H A DBlock.cpp24 Block::Block(lldb::user_id_t uid) in Block() function in Block
29 Block::~Block() = default;
31 void Block::GetDescription(Stream *s, Function *function, in GetDescription()
59 void Block::Dump(Stream *s, addr_t base_addr, int32_t depth, in Dump()
62 Block *parent = GetParent(); in Dump()
72 const Block *parent_block = GetParent(); in Dump()
112 Block *Block::FindBlockByID(user_id_t block_id) { in FindBlockByID()
116 Block *matching_block = nullptr; in FindBlockByID()
126 Block *Block::FindInnermostBlockByOffset(const lldb::addr_t offset) { in FindInnermostBlockByOffset()
130 if (Block *block = block_sp->FindInnermostBlockByOffset(offset)) in FindInnermostBlockByOffset()
[all …]
/src/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DAdornedCFG.cpp31 for (const CFGBlock *Block : Cfg) { in buildStmtToBasicBlockMap() local
32 if (Block == nullptr) in buildStmtToBasicBlockMap()
35 for (const CFGElement &Element : *Block) { in buildStmtToBasicBlockMap()
40 StmtToBlock[Stmt->getStmt()] = Block; in buildStmtToBasicBlockMap()
50 for (const CFGBlock *Block : Cfg) { in buildStmtToBasicBlockMap() local
51 if (Block != nullptr) in buildStmtToBasicBlockMap()
52 if (const Stmt *TerminatorCond = Block->getTerminatorCondition()) in buildStmtToBasicBlockMap()
53 StmtToBlock.insert({TerminatorCond, Block}); in buildStmtToBasicBlockMap()
67 for (const CFGBlock *Block : Cfg) { in buildStmtToBasicBlockMap() local
68 if (Block != nullptr) in buildStmtToBasicBlockMap()
[all …]
H A DTypeErasedDataflowAnalysis.cpp45 const CFGBlock &Block) { in blockIndexInPredecessor() argument
47 Pred.succs(), [&Block](const CFGBlock::AdjacentBlock &Succ) { in blockIndexInPredecessor()
48 return Succ && Succ->getBlockID() == Block.getBlockID(); in blockIndexInPredecessor()
219 computeBlockInputState(const CFGBlock &Block, AnalysisContext &AC) { in computeBlockInputState() argument
220 std::vector<const CFGBlock *> Preds(Block.pred_begin(), Block.pred_end()); in computeBlockInputState()
221 if (Block.getTerminator().isTemporaryDtorsBranch()) { in computeBlockInputState()
244 if (Block.succ_begin()->getReachableBlock() != nullptr && in computeBlockInputState()
245 Block.succ_begin()->getReachableBlock()->hasNoReturnElement()) { in computeBlockInputState()
247 auto StmtBlock = StmtToBlock.find(Block.getTerminatorStmt()); in computeBlockInputState()
288 bool BranchVal = blockIndexInPredecessor(*Pred, Block) == 0; in computeBlockInputState()
[all …]
/src/contrib/telnet/libtelnet/
H A Denc_des.c62 Block krbdes_key;
64 Block temp_feed;
70 Block str_output;
71 Block str_feed;
72 Block str_iv;
73 Block str_ikey;
109 void fb64_stream_iv(Block, struct stinfo *);
115 void fb64_stream_key(Block, struct stinfo *);
204 DES_random_key((Block *)fbp->temp_feed); in fb64_start()
205 DES_ecb_encrypt((Block *)fbp->temp_feed, (Block *)fbp->temp_feed, in fb64_start()
[all …]
/src/contrib/llvm-project/lldb/include/lldb/Symbol/
H A DBlock.h41 class Block : public UserID, public SymbolContextScope {
61 Block(lldb::user_id_t uid);
64 ~Block() override;
89 Block *CalculateSymbolContextBlock() override;
119 bool Contains(const Block *block) const;
156 Block *GetParent() const;
165 Block *GetContainingInlinedBlock();
172 Block *GetInlinedParent();
187 Block *
195 Block *GetSibling() const;
[all …]
/src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h52 for (BlockT *Block : blocks()) { in getExitBlocks()
53 llvm::append_range(TmpStorage, successors(Block)); in getExitBlocks()
74 for (BlockT *Block : blocks()) { in getExitingBlocks()
75 for (BlockT *Succ : successors(Block)) { in getExitingBlocks()
77 TmpStorage.push_back(Block); in getExitingBlocks()
162 auto GenericCycleInfo<ContextT>::getTopLevelParentCycle(BlockT *Block)
164 auto Cycle = BlockMapTopLevel.find(Block);
168 auto MapIt = BlockMap.find(Block);
175 BlockMapTopLevel.try_emplace(Block, C);
203 void GenericCycleInfo<ContextT>::addBlockToCycle(BlockT *Block, CycleT *Cycle) { in addBlockToCycle() argument
[all …]
H A DGenericCycleInfo.h85 void appendEntry(BlockT *Block) { Entries.push_back(Block); } in appendEntry() argument
86 void appendBlock(BlockT *Block) { Blocks.insert(Block); } in appendBlock() argument
106 bool isEntry(const BlockT *Block) const { in isEntry() argument
107 return is_contained(Entries, Block); in isEntry()
111 bool contains(const BlockT *Block) const { return Blocks.contains(Block); } in contains() argument
215 for (auto *Block : Blocks) { in print()
216 if (isEntry(Block)) in print()
219 Out << ' ' << Ctx.print(Block); in print()
259 void addBlockToCycle(BlockT *Block, CycleT *Cycle);
273 CycleT *getCycle(const BlockT *Block) const;
[all …]
/src/contrib/llvm-project/clang/lib/Analysis/
H A DCFG.cpp493 CFGBlock *Block = nullptr; member in __anoncb5603720411::CFGBuilder
722 return Block; in NYS()
762 void autoCreateBlock() { if (!Block) Block = createBlock(); } in autoCreateBlock()
1579 Block = nullptr; // the EXIT block is empty. Create all other blocks lazily. in buildCFG()
1612 Block = createBlock(); in buildCFG()
1624 addSuccessor(B, Block, true); in buildCFG()
1712 return Block; in addInitializer()
1731 appendInitializer(Block, I); in addInitializer()
1754 appendStmt(Block, Default); in addInitializer()
1757 Block = R; in addInitializer()
[all …]
H A DReachableCode.cpp416 bool isDeadCodeRoot(const CFGBlock *Block);
418 const Stmt *findDeadCode(const CFGBlock *Block);
434 bool DeadCodeScan::isDeadCodeRoot(const clang::CFGBlock *Block) { in isDeadCodeRoot() argument
437 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in isDeadCodeRoot()
438 E = Block->pred_end(); I != E; ++I) { in isDeadCodeRoot()
459 static bool isInCoroutineStmt(const Stmt *DeadStmt, const CFGBlock *Block) { in isInCoroutineStmt() argument
464 for (CFGBlock::const_iterator I = Block->begin(), E = Block->end(); I != E; in isInCoroutineStmt()
496 static bool isValidDeadStmt(const Stmt *S, const clang::CFGBlock *Block) { in isValidDeadStmt() argument
504 return !isInCoroutineStmt(S, Block); in isValidDeadStmt()
507 const Stmt *DeadCodeScan::findDeadCode(const clang::CFGBlock *Block) { in findDeadCode() argument
[all …]
H A DThreadSafetyTIL.cpp169 for (auto *Block : successors()) in topologicalSort() local
170 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
262 for (auto *Block : Blocks) in renumberInstrs() local
263 InstrID = Block->renumberInstrs(InstrID); in renumberInstrs()
305 for (auto *Block : Blocks) in computeNormalForm() local
306 Block->computeDominator(); in computeNormalForm()
318 for (auto *Block : Blocks.reverse()) { in computeNormalForm() local
319 Block->computePostDominator(); in computeNormalForm()
320 computeNodeSize(Block, &BasicBlock::DominatorNode); in computeNormalForm()
324 for (auto *Block : Blocks) { in computeNormalForm() local
[all …]
/src/contrib/llvm-project/clang/include/clang/Analysis/FlowSensitive/
H A DDataflowWorklist.h33 void enqueueBlock(const CFGBlock *Block) { in enqueueBlock() argument
34 if (Block && !EnqueuedBlocks[Block->getBlockID()]) { in enqueueBlock()
35 EnqueuedBlocks[Block->getBlockID()] = true; in enqueueBlock()
36 WorkList.push(Block); in enqueueBlock()
69 void enqueueSuccessors(const CFGBlock *Block) { in enqueueSuccessors()
70 for (auto B : Block->succs()) in enqueueSuccessors()
82 void enqueueSuccessors(const CFGBlock *Block) { in enqueueSuccessors()
83 for (auto B : Block->succs()) in enqueueSuccessors()
97 void enqueuePredecessors(const CFGBlock *Block) { in enqueuePredecessors()
98 for (auto B : Block->preds()) in enqueuePredecessors()
/src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h38 BlockPtrTy Block; variable
53 template <typename T1> static T1 deref(T1 Block, unsigned SuccIdx) { in deref() argument
54 if (auto *R = dyn_cast<VPRegionBlock>(Block)) { in deref()
60 return getBlockWithSuccs(Block)->getSuccessors()[SuccIdx]; in deref()
67 VPAllSuccessorsIterator(BlockPtrTy Block, size_t Idx = 0)
68 : Block(Block), SuccessorIdx(Idx) {} in Block() function
70 : Block(Other.Block), SuccessorIdx(Other.SuccessorIdx) {} in VPAllSuccessorsIterator()
73 Block = R.Block;
78 static VPAllSuccessorsIterator end(BlockPtrTy Block) { in end() argument
79 if (auto *R = dyn_cast<VPRegionBlock>(Block)) { in end()
[all …]
H A DVPlan.cpp156 const VPBlockBase *Block = this; in getEntryBasicBlock() local
157 while (const VPRegionBlock *Region = dyn_cast<VPRegionBlock>(Block)) in getEntryBasicBlock()
158 Block = Region->getEntry(); in getEntryBasicBlock()
159 return cast<VPBasicBlock>(Block); in getEntryBasicBlock()
163 VPBlockBase *Block = this; in getEntryBasicBlock() local
164 while (VPRegionBlock *Region = dyn_cast<VPRegionBlock>(Block)) in getEntryBasicBlock()
165 Block = Region->getEntry(); in getEntryBasicBlock()
166 return cast<VPBasicBlock>(Block); in getEntryBasicBlock()
178 const VPBlockBase *Block = this; in getExitingBasicBlock() local
179 while (const VPRegionBlock *Region = dyn_cast<VPRegionBlock>(Block)) in getExitingBasicBlock()
[all …]
/src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSampleProfileInference.cpp626 auto &Block = Func.Blocks[I]; in joinIsolatedComponents() local
627 if (Block.Flow > 0 && !Visited[I]) { in joinIsolatedComponents()
834 auto &Block = Func.Blocks[Queue.front()]; in findUnknownSubgraph() local
837 for (auto *Jump : Block.SuccJumps) { in findUnknownSubgraph()
874 for (auto *Block : UnknownBlocks) { in canRebalanceSubgraph() local
875 if (Block->SuccJumps.empty()) { in canRebalanceSubgraph()
882 for (auto *Jump : Block->SuccJumps) { in canRebalanceSubgraph()
888 if (NumIgnoredJumps == Block->SuccJumps.size()) in canRebalanceSubgraph()
927 auto fillInDegree = [&](const FlowBlock *Block) { in isAcyclicSubgraph() argument
928 for (auto *Jump : Block->SuccJumps) { in isAcyclicSubgraph()
[all …]
/src/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/Debugging/
H A DDebugInfoSupport.cpp34 DenseMap<Block *, Symbol *> Preserved; in preserveDWARFSection()
41 for (auto Block : Sec.blocks()) { in preserveDWARFSection() local
42 auto &PSym = Preserved[Block]; in preserveDWARFSection()
44 PSym = &G.addAnonymousSymbol(*Block, 0, 0, false, true); in preserveDWARFSection()
52 SmallVector<Block *, 8> SecBlocks(Sec.blocks().begin(), Sec.blocks().end()); in getSectionData()
53 std::sort(SecBlocks.begin(), SecBlocks.end(), [](Block *LHS, Block *RHS) { in getSectionData()
60 for (auto *Block : SecBlocks) { in getSectionData() local
61 if (Block->isZeroFill()) in getSectionData()
62 SecData.resize(SecData.size() + Block->getSize(), 0); in getSectionData()
64 SecData.append(Block->getContent().begin(), Block->getContent().end()); in getSectionData()
/src/contrib/llvm-project/clang/lib/AST/Interp/
H A DDynamicAllocator.cpp26 Block *B = reinterpret_cast<Block *>(Alloc.Memory.get()); in cleanup()
42 Block *DynamicAllocator::allocate(const Expr *Source, PrimType T, in allocate()
53 Block *DynamicAllocator::allocate(const Descriptor *ElementDesc, in allocate()
63 Block *DynamicAllocator::allocate(const Descriptor *D, unsigned EvalID) { in allocate()
68 std::make_unique<std::byte[]>(sizeof(Block) + D->getAllocSize()); in allocate()
69 auto *B = new (Memory.get()) Block(EvalID, D, /*isStatic=*/false); in allocate()
92 const Block *BlockToDelete, InterpState &S) { in deallocate()
102 const Block *B = reinterpret_cast<const Block *>(A.Memory.get()); in deallocate()
108 Block *B = reinterpret_cast<Block *>(AllocIt->Memory.get()); in deallocate()
H A DInterpBlock.h26 class Block; variable
49 class Block final {
52 Block(unsigned EvalID, const std::optional<unsigned> &DeclID,
59 Block(unsigned EvalID, const Descriptor *Desc, bool IsStatic = false,
103 return reinterpret_cast<std::byte *>(this) + sizeof(Block); in rawData()
106 return reinterpret_cast<const std::byte *>(this) + sizeof(Block); in rawData()
136 Block(unsigned EvalID, const Descriptor *Desc, bool IsExtern, bool IsStatic, in Block() function
183 DeadBlock(DeadBlock *&Root, Block *Blk);
190 friend class Block;
203 Block B;
/src/sbin/dump/
H A Dcache.c35 typedef struct Block { struct
36 struct Block *b_HNext; /* must be first field */ argument
39 } Block; typedef
45 static Block **BlockHash;
55 Block *base; in cinit()
65 base = calloc(sizeof(Block), NBlocks); in cinit()
66 BlockHash = calloc(sizeof(Block *), HSize); in cinit()
81 Block *blk; in cread()
82 Block **pblk; in cread()
83 Block **ppblk; in cread()
/src/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp1215 for (SIScheduleBlock *Block : CurrentBlocks) in createBlocksForVariant()
1216 Block->finalizeUnits(); in createBlocksForVariant()
1219 for (SIScheduleBlock *Block : CurrentBlocks) in createBlocksForVariant()
1220 Block->printDebug(true); in createBlocksForVariant()
1249 SIScheduleBlock *Block = CurrentBlocks[i]; in topologicalSort() local
1250 unsigned Degree = Block->getSuccs().size(); in topologicalSort()
1260 SIScheduleBlock *Block = CurrentBlocks[i]; in topologicalSort() local
1264 for (SIScheduleBlock* Pred : Block->getPreds()) { in topologicalSort()
1273 SIScheduleBlock *Block = CurrentBlocks[i]; in topologicalSort() local
1274 for (SIScheduleBlock* Pred : Block->getPreds()) { in topologicalSort()
[all …]
/src/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLink.h158 class Block : public Addressable {
163 Block(Section &Parent, orc::ExecutorAddrDiff Size, orc::ExecutorAddr Address, in Block() function
179 Block(Section &Parent, ArrayRef<char> Content, orc::ExecutorAddr Address, in Block() function
198 Block(Section &Parent, MutableArrayRef<char> Content, in Block() function
217 Block(const Block &) = delete;
218 Block &operator=(const Block &) = delete;
219 Block(Block &&) = delete;
220 Block &operator=(Block &&) = delete;
361 inline uint64_t alignToBlock(uint64_t Addr, const Block &B) { in alignToBlock()
367 inline orc::ExecutorAddr alignToBlock(orc::ExecutorAddr Addr, const Block &B) { in alignToBlock()
[all …]
/src/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZLongBranch.cpp150 void skipNonTerminators(BlockPosition &Position, MBBInfo &Block);
183 MBBInfo &Block) { in skipNonTerminators() argument
184 if (Log2(Block.Alignment) > Position.KnownBits) { in skipNonTerminators()
188 (Block.Alignment.value() - (uint64_t(1) << Position.KnownBits)); in skipNonTerminators()
189 Position.KnownBits = Log2(Block.Alignment); in skipNonTerminators()
193 Position.Address = alignTo(Position.Address, Block.Alignment); in skipNonTerminators()
196 Block.Address = Position.Address; in skipNonTerminators()
199 Position.Address += Block.Size; in skipNonTerminators()
297 MBBInfo &Block = MBBs[I]; in initMBBInfo() local
300 Block.Alignment = MBB->getAlignment(); in initMBBInfo()
[all …]
/src/contrib/llvm-project/clang/lib/CodeGen/
H A DCGOpenCLRuntime.cpp129 llvm::Value *Block, llvm::Type *BlockTy) { in recordBlockInfo() argument
132 assert(Block->getType()->isPointerTy() && "Invalid block literal type"); in recordBlockInfo()
134 EnqueuedBlockMap[E].BlockArg = Block; in recordBlockInfo()
149 const BlockExpr *Block = getBlockExpr(E); in emitOpenCLEnqueuedBlock() local
151 assert(EnqueuedBlockMap.contains(Block) && "Block expression not emitted"); in emitOpenCLEnqueuedBlock()
154 if (EnqueuedBlockMap[Block].KernelHandle) { in emitOpenCLEnqueuedBlock()
155 return EnqueuedBlockMap[Block]; in emitOpenCLEnqueuedBlock()
159 CGF, EnqueuedBlockMap[Block].InvokeFunc, EnqueuedBlockMap[Block].BlockTy); in emitOpenCLEnqueuedBlock()
162 EnqueuedBlockMap[Block].KernelHandle = F; in emitOpenCLEnqueuedBlock()
163 return EnqueuedBlockMap[Block]; in emitOpenCLEnqueuedBlock()
/src/contrib/llvm-project/llvm/lib/Target/AVR/
H A DAVRExpandPseudoInsts.cpp46 typedef MachineBasicBlock Block; typedef in __anon9e99e5fd0111::AVRExpandPseudo
47 typedef Block::iterator BlockIt;
52 bool expandMBB(Block &MBB);
53 bool expandMI(Block &MBB, BlockIt MBBI);
54 template <unsigned OP> bool expand(Block &MBB, BlockIt MBBI);
56 MachineInstrBuilder buildMI(Block &MBB, BlockIt MBBI, unsigned Opcode) { in buildMI()
60 MachineInstrBuilder buildMI(Block &MBB, BlockIt MBBI, unsigned Opcode, in buildMI()
65 MachineRegisterInfo &getRegInfo(Block &MBB) { in getRegInfo()
69 bool expandArith(unsigned OpLo, unsigned OpHi, Block &MBB, BlockIt MBBI);
70 bool expandLogic(unsigned Op, Block &MBB, BlockIt MBBI);
[all …]
/src/contrib/llvm-project/compiler-rt/lib/memprof/
H A Dmemprof_mibmap.cpp21 void InsertOrMerge(const uptr Id, const MemInfoBlock &Block, MIBMapTy &Map) { in InsertOrMerge() argument
28 lmib->mib = Block; in InsertOrMerge()
34 if (Block.AccessHistogramSize > lmib->mib.AccessHistogramSize) in InsertOrMerge()
37 ShorterHistogram = Block.AccessHistogram; in InsertOrMerge()
39 lmib->mib.Merge(Block); in InsertOrMerge()
43 if (Block.AccessHistogramSize > 0 || lmib->mib.AccessHistogramSize > 0) in InsertOrMerge()
/src/contrib/llvm-project/clang/include/clang/Analysis/
H A DAnalysisDeclContext.h217 enum ContextKind { StackFrame, Block }; enumerator
306 const CFGBlock *Block; variable
317 const Stmt *S, const CFGBlock *Block, unsigned BlockCount, in StackFrameContext() argument
320 Block(Block), BlockCount(BlockCount), Index(Index) {} in StackFrameContext()
327 const CFGBlock *getCallSiteBlock() const { return Block; } in getCallSiteBlock()
333 CFGElement getCallSiteCFGElement() const { return (*Block)[Index]; } in getCallSiteCFGElement()
339 const CFGBlock *Block, unsigned BlockCount, in Profile() argument
342 ID.AddPointer(Block); in Profile()
364 : LocationContext(Block, ADC, ParentLC, ID), BD(BD), Data(Data) {} in BlockInvocationContext()
378 ProfileCommon(ID, Block, ADC, ParentLC, BD); in Profile()
[all …]

12345678910>>...19