/freebsd-11.0-release/share/mk/ |
H A D | version_gen.awk | 33 # successors[] - array index by version name, contains successor 60 successors[symver] = ""; 82 successors[symver] = v; 212 if (successors[v] != "") 213 print_version(successors[v]); 231 if (successors[v] == "") 234 printf("} %s;\n", successors[v]);
|
/freebsd-11.0-release/contrib/gcc/ |
H A D | ddg.h | 43 /* The following two macros enables direct access to the successors and 46 #define NODE_SUCCESSORS(x) ((x)->successors) 72 sbitmap successors; member in struct:ddg_node
|
H A D | ddg.c | 423 if (! TEST_BIT (dest_node->successors, j)) 501 g->nodes[i].successors = sbitmap_alloc (num_nodes); 502 sbitmap_zero (g->nodes[i].successors); 540 sbitmap_free (g->nodes[i].successors); 652 gcc_assert (src->successors && dest->predecessors); 654 SET_BIT (src->successors, dest->cuid); 785 /* Given a set OPS of nodes in the DDG, find the set of their successors 990 /* Updates the counts of U_NODE's successors (that belong to NODES) to be
|
H A D | modulo-sched.c | 68 predecessors _or_ after all its successors. 1285 'PSS' previously scheduled successors. 1357 such cases we want to unschedule some of the predecessors/successors 1913 sbitmap successors = sbitmap_alloc (num_nodes); 1918 sbitmap_zero (successors); 1919 find_successors (successors, g, nodes_ordered); 1927 else if (sbitmap_a_and_b_cg (tmp, successors, scc)) 1960 /* Don't consider the already ordered successors again. */ 1988 sbitmap_zero (successors); 1989 find_successors (successors, 1909 sbitmap successors = sbitmap_alloc (num_nodes); local [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | IteratedDominanceFrontier.cpp | 65 for (auto Succ : successors(BB)) {
|
H A D | EHPersonalities.cpp | 102 for (BasicBlock *Succ : successors(Visiting))
|
H A D | DivergenceAnalysis.cpp | 201 // A helper function for computeInfluenceRegion that adds successors of "ThisBB" 207 for (BasicBlock *Succ : successors(ThisBB)) { 246 // Terminators with less than two successors won't introduce sync
|
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
H A D | ShrinkWrap.cpp | 301 // Look for a restore point that post-dominates all the successors. 303 Restore = FindIDom<>(*Restore, Restore->successors(), *MPDT); 370 IPdom = FindIDom<>(*IPdom, LoopExitBB->successors(), *MPDT); 410 for (const MachineBasicBlock *SuccBB : MBB->successors()) { 507 Restore = FindIDom<>(*Restore, Restore->successors(), *MPDT);
|
H A D | LivePhysRegs.cpp | 155 // The return block has no successors whose live-ins we could merge 162 // To get the live-outs we simply merge the live-ins of all successors. 163 for (const MachineBasicBlock *Succ : MBB->successors())
|
H A D | MachineBlockPlacement.cpp | 339 /// \brief Mark a chain's successors as having one fewer preds. 342 /// quickly walk the successors of each block in the chain and mark them as 343 /// having one fewer active predecessor. It also adds any successors of this 349 // Walk all the blocks in this chain, marking their successors as having 352 // Add any successors for which this is the only un-placed in-loop 356 for (MachineBasicBlock *Succ : MBB->successors()) { 374 /// This looks across all successors of a particular block and attempts to 376 /// successors which also pass the block filter. It will attempt to avoid 408 for (MachineBasicBlock *Succ : BB->successors()) { 441 // successors mus [all...] |
H A D | LiveDebugValues.cpp | 388 for (auto s : MBB->successors())
|
H A D | TailDuplication.cpp | 215 // Save the successors list. 229 // TailBB's immediate successors are now successors of those predecessors 460 /// After FromBB is tail duplicated into its predecessor blocks, the successors 610 // Check if any of the successors of TailBB has a PHI node in which the 619 for (auto SB : TailBB.successors()) { 659 for (MachineBasicBlock *BB : A.successors()) 858 "TailDuplicate called on block with multiple successors!"); 982 // Remove all successors.
|
H A D | Analysis.cpp | 671 // successors. 675 for (const MachineBasicBlock *SMBB : MBB->successors())
|
H A D | PHIElimination.cpp | 646 for (const MachineBasicBlock *SI : MBB->successors())
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | ThreadSafetyTIL.cpp | 171 for (auto *Block : successors()) 234 // of its successors have already computed their post-dominators. This is 239 for (auto *Succ : successors()) {
|
/freebsd-11.0-release/contrib/llvm/include/llvm/IR/ |
H A D | CFG.h | 135 inline succ_range successors(BasicBlock *BB) { function in namespace:llvm 138 inline succ_const_range successors(const BasicBlock *BB) { function in namespace:llvm
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | CFGMST.h | 106 if (int successors = TI->getNumSuccessors()) { 107 for (int i = 0; i != successors; ++i) {
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/ |
H A D | PartialInlining.cpp | 61 for (BasicBlock *BB : successors(entryBlock)) {
|
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyTIL.h | 1368 ArrayRef<BasicBlock*> successors(); 1370 ArrayRef<BasicBlock*> successors() const { function in class:clang::threadSafety::Terminator 1371 return const_cast<Terminator*>(this)->successors(); 1397 ArrayRef<BasicBlock*> successors() { function in class:clang::threadSafety::Goto 1447 ArrayRef<BasicBlock*> successors() { function in class:clang::threadSafety::Branch 1481 ArrayRef<BasicBlock*> successors() { function in class:clang::threadSafety::Return 1504 inline ArrayRef<BasicBlock*> Terminator::successors() { function in class:clang::threadSafety::Terminator 1506 case COP_Goto: return cast<Goto>(this)->successors(); 1507 case COP_Branch: return cast<Branch>(this)->successors(); 1508 case COP_Return: return cast<Return>(this)->successors(); 1582 ArrayRef<BasicBlock*> successors() { return TermInstr->successors(); } function in class:clang::threadSafety::BasicBlock 1583 ArrayRef<BasicBlock*> successors() const { return TermInstr->successors(); } function in class:clang::threadSafety::BasicBlock [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | MachineBasicBlock.h | 94 /// Keep track of the probabilities to the successors. This vector has the 333 inline iterator_range<succ_iterator> successors() { function in class:llvm::MachineBasicBlock 336 inline iterator_range<const_succ_iterator> successors() const { function in class:llvm::MachineBasicBlock 440 /// successors have unknown probabilities, 1 / N is returned as the 441 /// probability for each successor, where N is the number of successors. 456 /// Normalize probabilities of all successors so that the sum of them becomes 458 /// the sum of its successors' probabilities is not guaranteed to be one. The 465 /// Validate successors' probabilities and check if the sum of them is 469 /// Remove successor from the successors list of this MachineBasicBlock. The 471 /// If NormalizeSuccProbs is true, then normalize successors' probabilitie [all...] |
/freebsd-11.0-release/contrib/llvm/lib/IR/ |
H A D | BasicBlock.cpp | 240 if (SI == E) return nullptr; // no successors 243 return (SI == E) ? TheSucc : nullptr /* multiple successors */; 248 if (SI == E) return nullptr; // No successors 379 // Now we must loop through all of the successors of the New block (which 380 // _were_ the successors of the 'this' block), and update any PHI nodes in 381 // successors. If there were PHI nodes in the successors, then they need to 407 for (BasicBlock *Succ : TI->successors()) {
|
/freebsd-11.0-release/contrib/llvm/lib/Target/AArch64/ |
H A D | AArch64BranchRelaxation.cpp | 151 for (MachineBasicBlock *S : MBB->successors())
|
/freebsd-11.0-release/contrib/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyCFGStackify.cpp | 122 : MBB(MBB), Succs(MBB->successors()) { 124 // successors, the DFS has to pick which order to visit the successors in. 177 // successors are visited in (see above). Also, we can sort the blocks in the
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LoopRotation.cpp | 263 // successors by duplicating their incoming values for OrigHeader. 265 for (BasicBlock *SuccBB : TI->successors()) 318 // Right now OrigPreHeader has two successors, NewHeader and ExitBlock, and
|
H A D | PlaceSafepoints.cpp | 298 for (BasicBlock *Succ : successors(BB)) { 615 // Since this is a latch, at least one of the successors must dominate
|