Home
last modified time | relevance | path

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

12345678910>>...21

/freebsd/contrib/llvm-project/libc/src/__support/
H A Dblock.h94 class Block {
102 Block(const Block &other) = delete;
103 Block &operator=(const Block &other) = delete;
108 static optional<Block *> init(ByteSpan region);
117 LIBC_INLINE static Block *from_usable_space(void *usable_space) { in from_usable_space()
119 return reinterpret_cast<Block *>(bytes - sizeof(Block)); in from_usable_space()
121 LIBC_INLINE static const Block *from_usable_space(const void *usable_space) { in from_usable_space()
123 return reinterpret_cast<const Block *>(bytes - sizeof(Block)); in from_usable_space()
131 return inner_size - sizeof(prev_) + sizeof(Block); in outer_size()
159 return outer_size - sizeof(Block); in inner_size_free()
[all …]
H A Dfreestore.h32 void insert(Block *block);
36 void remove(Block *block);
40 Block *remove_best_fit(size_t size);
44 align_up(sizeof(Block) + sizeof(FreeList::Node), alignof(max_align_t));
46 align_up(sizeof(Block) + sizeof(FreeTrie::Node), alignof(max_align_t));
50 LIBC_INLINE static bool too_small(Block *block) { in too_small()
53 LIBC_INLINE static bool is_small(Block *block) { in is_small()
57 FreeList &small_list(Block *block);
64 LIBC_INLINE void FreeStore::insert(Block *block) { in insert()
73 LIBC_INLINE void FreeStore::remove(Block *block) { in remove()
[all …]
H A Dfreelist_heap.h56 span<cpp::byte> block_to_span(Block *block) { in block_to_span()
78 auto result = Block::init(region()); in init()
79 Block *block = *result; in init()
92 size_t request_size = Block::min_size_for_allocation(alignment, size); in allocate_impl()
96 Block *block = free_store.remove_best_fit(request_size); in allocate_impl()
100 auto block_info = Block::allocate(block, alignment, size); in allocate_impl()
135 Block *block = Block::from_usable_space(bytes); in free()
141 Block *prev_free = block->prev_free(); in free()
142 Block *next = block->next(); in free()
175 Block *block = Block::from_usable_space(bytes); in realloc()
/freebsd/contrib/llvm-project/lldb/source/Symbol/
H A DBlock.cpp24 Block::Block(Function &function, user_id_t function_uid) in Block() function in Block
25 : Block(function_uid, function) {} in Block()
27 Block::Block(lldb::user_id_t uid, SymbolContextScope &parent_scope) in Block() function in Block
31 Block::~Block() = default;
33 void Block::GetDescription(Stream *s, Function *function, in GetDescription()
60 void Block::Dump(Stream *s, addr_t base_addr, int32_t depth, in Dump()
63 Block *parent = GetParent(); in Dump()
73 const Block *parent_block = GetParent(); in Dump()
113 Block *Block::FindBlockByID(user_id_t block_id) { in FindBlockByID()
117 Block *matching_block = nullptr; in FindBlockByID()
[all …]
/freebsd/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.cpp59 const CFGBlock &Block) { in blockIndexInPredecessor() argument
61 Pred.succs(), [&Block](const CFGBlock::AdjacentBlock &Succ) { in blockIndexInPredecessor()
62 return Succ && Succ->getBlockID() == Block.getBlockID(); in blockIndexInPredecessor()
233 computeBlockInputState(const CFGBlock &Block, AnalysisContext &AC) { in computeBlockInputState() argument
234 std::vector<const CFGBlock *> Preds(Block.pred_begin(), Block.pred_end()); in computeBlockInputState()
235 if (Block.getTerminator().isTemporaryDtorsBranch()) { in computeBlockInputState()
258 if (Block.succ_begin()->getReachableBlock() != nullptr && in computeBlockInputState()
259 Block.succ_begin()->getReachableBlock()->hasNoReturnElement()) { in computeBlockInputState()
261 if (const Stmt *Terminator = Block.getTerminatorStmt()) in computeBlockInputState()
303 bool BranchVal = blockIndexInPredecessor(*Pred, Block) == 0; in computeBlockInputState()
[all …]
/freebsd/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 …]
/freebsd/contrib/llvm-project/lldb/include/lldb/Symbol/
H A DBlock.h41 class Block : public UserID, public SymbolContextScope {
48 Block(Function &function, lldb::user_id_t function_uid);
50 ~Block() override;
79 Block *CalculateSymbolContextBlock() override;
111 bool Contains(const Block *block) const;
148 Block *GetParent() const;
157 Block *GetContainingInlinedBlock();
164 Block *GetInlinedParent();
179 Block *
187 Block *GetSibling() const;
[all …]
/freebsd/contrib/llvm-project/clang/lib/CIR/Dialect/Transforms/
H A DFlattenCFG.cpp32 void lowerTerminator(mlir::Operation *op, mlir::Block *dest, in lowerTerminator()
68 mlir::Block *currentBlock = rewriter.getInsertionBlock(); in matchAndRewrite()
69 mlir::Block *remainingOpsBlock = in matchAndRewrite()
71 mlir::Block *continueBlock; in matchAndRewrite()
78 mlir::Block *thenBeforeBody = &ifOp.getThenRegion().front(); in matchAndRewrite()
79 mlir::Block *thenAfterBody = &ifOp.getThenRegion().back(); in matchAndRewrite()
92 mlir::Block *elseBeforeBody = nullptr; in matchAndRewrite()
93 mlir::Block *elseAfterBody = nullptr; in matchAndRewrite()
143 mlir::Block *currentBlock = rewriter.getInsertionBlock(); in matchAndRewrite()
144 mlir::Block *continueBlock = in matchAndRewrite()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h58 for (BlockT *Block : blocks()) { in getExitBlocks()
59 llvm::append_range(TmpStorage, successors(Block)); in getExitBlocks()
81 for (BlockT *Block : blocks()) { in getExitingBlocks()
82 for (BlockT *Succ : successors(Block)) { in getExitingBlocks()
84 TmpStorage.push_back(Block); in getExitingBlocks()
269 auto GenericCycleInfo<ContextT>::getTopLevelParentCycle(BlockT *Block)
271 auto Cycle = BlockMapTopLevel.find(Block);
275 auto MapIt = BlockMap.find(Block);
282 BlockMapTopLevel.try_emplace(Block, C);
312 void GenericCycleInfo<ContextT>::addBlockToCycle(BlockT *Block, CycleT *Cycle) { in addBlockToCycle() argument
[all …]
H A DGenericCycleInfo.h89 void appendEntry(BlockT *Block) { in appendEntry() argument
90 Entries.push_back(Block); in appendEntry()
94 void appendBlock(BlockT *Block) { in appendBlock() argument
95 Blocks.insert(Block); in appendBlock()
122 bool isEntry(const BlockT *Block) const { in isEntry() argument
123 return is_contained(Entries, Block); in isEntry()
127 void setSingleEntry(BlockT *Block) { in setSingleEntry() argument
128 assert(contains(Block)); in setSingleEntry()
130 Entries.push_back(Block); in setSingleEntry()
135 bool contains(const BlockT *Block) const { return Blocks.contains(Block); } in contains() argument
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DCFG.cpp515 CFGBlock *Block = nullptr; member in __anonef2f84bd0411::CFGBuilder
744 return Block; in NYS()
784 void autoCreateBlock() { if (!Block) Block = createBlock(); } in autoCreateBlock()
847 Block = createNoReturnBlock(); in appendConstructor()
853 Block->appendConstructor(CE, CC, cfg->getBumpVectorContext()); in appendConstructor()
858 Block->appendStmt(CE, cfg->getBumpVectorContext()); in appendConstructor()
1667 Block = nullptr; // the EXIT block is empty. Create all other blocks lazily. in buildCFG()
1700 Block = createBlock(); in buildCFG()
1712 addSuccessor(B, Block, true); in buildCFG()
1799 return Block; in addInitializer()
[all …]
H A DReachableCode.cpp415 bool isDeadCodeRoot(const CFGBlock *Block);
417 const Stmt *findDeadCode(const CFGBlock *Block);
433 bool DeadCodeScan::isDeadCodeRoot(const clang::CFGBlock *Block) { in isDeadCodeRoot() argument
436 for (CFGBlock::const_pred_iterator I = Block->pred_begin(), in isDeadCodeRoot()
437 E = Block->pred_end(); I != E; ++I) { in isDeadCodeRoot()
458 static bool isInCoroutineStmt(const Stmt *DeadStmt, const CFGBlock *Block) { in isInCoroutineStmt() argument
463 for (const CFGElement &Elem : *Block) 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.cpp168 for (auto *Block : successors()) in topologicalSort() local
169 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
261 for (auto *Block : Blocks) in renumberInstrs() local
262 InstrID = Block->renumberInstrs(InstrID); in renumberInstrs()
304 for (auto *Block : Blocks) in computeNormalForm() local
305 Block->computeDominator(); in computeNormalForm()
317 for (auto *Block : Blocks.reverse()) { in computeNormalForm() local
318 Block->computePostDominator(); in computeNormalForm()
319 computeNodeSize(Block, &BasicBlock::DominatorNode); in computeNormalForm()
323 for (auto *Block : Blocks) { in computeNormalForm() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h40 BlockPtrTy Block; variable
55 template <typename T1> static T1 deref(T1 Block, unsigned SuccIdx) { in deref() argument
56 if (auto *R = dyn_cast<VPRegionBlock>(Block)) { in deref()
62 return getBlockWithSuccs(Block)->getSuccessors()[SuccIdx]; in deref()
69 VPAllSuccessorsIterator(BlockPtrTy Block, size_t Idx = 0)
70 : Block(Block), SuccessorIdx(Idx) {} in Block() function
72 : Block(Other.Block), SuccessorIdx(Other.SuccessorIdx) {} in VPAllSuccessorsIterator()
75 Block = R.Block;
80 static VPAllSuccessorsIterator end(BlockPtrTy Block) { in end() argument
81 if (auto *R = dyn_cast<VPRegionBlock>(Block)) { in end()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/Debugging/
H A DDebugInfoSupport.cpp34 DenseMap<Block *, Symbol *> Preserved; in preserveDWARFSection()
40 for (auto Block : Sec.blocks()) { in preserveDWARFSection() local
41 auto &PSym = Preserved[Block]; in preserveDWARFSection()
43 PSym = &G.addAnonymousSymbol(*Block, 0, 0, false, true); in preserveDWARFSection()
51 SmallVector<Block *, 8> SecBlocks(Sec.blocks().begin(), Sec.blocks().end()); in getSectionData()
52 std::sort(SecBlocks.begin(), SecBlocks.end(), [](Block *LHS, Block *RHS) { in getSectionData()
59 for (auto *Block : SecBlocks) { in getSectionData() local
60 if (Block->isZeroFill()) in getSectionData()
61 SecData.resize(SecData.size() + Block->getSize(), 0); in getSectionData()
63 SecData.append(Block->getContent().begin(), Block->getContent().end()); in getSectionData()
/freebsd/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 …]
/freebsd/contrib/llvm-project/clang/lib/AST/ByteCode/
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()
54 Block *DynamicAllocator::allocate(const Descriptor *ElementDesc, in allocate()
68 Block *DynamicAllocator::allocate(const Descriptor *D, unsigned EvalID, in allocate()
74 std::make_unique<std::byte[]>(sizeof(Block) + D->getAllocSize()); in allocate()
75 auto *B = new (Memory.get()) Block(EvalID, D, /*isStatic=*/false); in allocate()
106 const Block *BlockToDelete, InterpState &S) { in deallocate()
116 const Block *B = reinterpret_cast<const Block *>(A.Memory.get()); in deallocate()
122 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,
60 Block(unsigned EvalID, const Descriptor *Desc, bool IsStatic = false,
105 return reinterpret_cast<std::byte *>(this) + sizeof(Block); in rawData()
108 return reinterpret_cast<const std::byte *>(this) + sizeof(Block); in rawData()
140 Block(unsigned EvalID, const Descriptor *Desc, bool IsExtern, bool IsStatic, in Block() function
188 DeadBlock(DeadBlock *&Root, Block *Blk);
195 friend class Block;
208 Block B;
/freebsd/sbin/dump/
H A Dcache.c35 typedef struct Block { struct
36 struct Block *b_HNext; /* must be first field */ argument
39 } Block; argument
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()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp1205 for (SIScheduleBlock *Block : CurrentBlocks) in createBlocksForVariant()
1206 Block->finalizeUnits(); in createBlocksForVariant()
1209 for (SIScheduleBlock *Block : CurrentBlocks) in createBlocksForVariant()
1210 Block->printDebug(true); in createBlocksForVariant()
1239 SIScheduleBlock *Block = CurrentBlocks[i]; in topologicalSort() local
1240 unsigned Degree = Block->getSuccs().size(); in topologicalSort()
1250 SIScheduleBlock *Block = CurrentBlocks[i]; in topologicalSort() local
1254 for (SIScheduleBlock* Pred : Block->getPreds()) { in topologicalSort()
1263 SIScheduleBlock *Block = CurrentBlocks[i]; in topologicalSort() local
1264 for (SIScheduleBlock* Pred : Block->getPreds()) { in topologicalSort()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZLongBranch.cpp147 void skipNonTerminators(BlockPosition &Position, MBBInfo &Block);
180 MBBInfo &Block) { in skipNonTerminators() argument
181 if (Log2(Block.Alignment) > Position.KnownBits) { in skipNonTerminators()
185 (Block.Alignment.value() - (uint64_t(1) << Position.KnownBits)); in skipNonTerminators()
186 Position.KnownBits = Log2(Block.Alignment); in skipNonTerminators()
190 Position.Address = alignTo(Position.Address, Block.Alignment); in skipNonTerminators()
193 Block.Address = Position.Address; in skipNonTerminators()
196 Position.Address += Block.Size; in skipNonTerminators()
298 MBBInfo &Block = MBBs[I]; in initMBBInfo() local
301 Block.Alignment = MBB->getAlignment(); in initMBBInfo()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLink.h159 class Block : public Addressable {
164 Block(Section &Parent, orc::ExecutorAddrDiff Size, orc::ExecutorAddr Address, in Block() function
180 Block(Section &Parent, ArrayRef<char> Content, orc::ExecutorAddr Address, in Block() function
199 Block(Section &Parent, MutableArrayRef<char> Content, in Block() function
218 Block(const Block &) = delete;
219 Block &operator=(const Block &) = delete;
220 Block(Block &&) = delete;
221 Block &operator=(Block &&) = delete;
380 inline uint64_t alignToBlock(uint64_t Addr, const Block &B) { in alignToBlock()
386 inline orc::ExecutorAddr alignToBlock(orc::ExecutorAddr Addr, const Block &B) { in alignToBlock()
[all …]
/freebsd/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()
/freebsd/contrib/llvm-project/llvm/lib/Target/AVR/
H A DAVRExpandPseudoInsts.cpp44 typedef MachineBasicBlock Block; typedef in __anon0c359c080111::AVRExpandPseudo
45 typedef Block::iterator BlockIt;
50 bool expandMBB(Block &MBB);
51 bool expandMI(Block &MBB, BlockIt MBBI);
52 template <unsigned OP> bool expand(Block &MBB, BlockIt MBBI);
54 MachineInstrBuilder buildMI(Block &MBB, BlockIt MBBI, unsigned Opcode) { in buildMI()
58 MachineInstrBuilder buildMI(Block &MBB, BlockIt MBBI, unsigned Opcode, in buildMI()
63 MachineRegisterInfo &getRegInfo(Block &MBB) { in getRegInfo()
67 bool expandArith(unsigned OpLo, unsigned OpHi, Block &MBB, BlockIt MBBI);
68 bool expandLogic(unsigned Op, Block &MBB, BlockIt MBBI);
[all …]

12345678910>>...21