Home
last modified time | relevance | path

Searched refs:predecessor (Results 1 – 25 of 39) sorted by relevance

12

/openbsd/usr.sbin/rpki-client/
H A Dtak.c59 TAKey *predecessor; member
72 ASN1_EXP_OPT(TAK, predecessor, TAKey, 0),
182 if (tak_asn1->predecessor != NULL) { in tak_parse_econtent()
183 tak->predecessor = parse_takey(fn, tak_asn1->predecessor); in tak_parse_econtent()
184 if (tak->predecessor == NULL) in tak_parse_econtent()
307 takey_free(t->predecessor); in tak_free()
H A Dprint.c846 if (p->predecessor != NULL) in tak_print()
847 takey_print("predecessor", p->predecessor); in tak_print()
H A Dextern.h333 struct takey *predecessor; member
/openbsd/gnu/gcc/gcc/config/mt/
H A Dmt.c1671 basic_block predecessor; member
1745 loop->predecessor = EDGE_PRED (loop->head, 0)->src; in mt_loop_nesting()
1746 if (loop->predecessor == loop->tail) in mt_loop_nesting()
1748 loop->predecessor = EDGE_PRED (loop->head, 1)->src; in mt_loop_nesting()
1752 if (EDGE_COUNT (loop->predecessor->succs) != 1 in mt_loop_nesting()
1754 loop->predecessor = NULL; in mt_loop_nesting()
1759 if (loop->predecessor) in mt_loop_nesting()
1783 && loop->predecessor in mt_loop_nesting()
1916 loop->predecessor = NULL; in mt_reorg_loops()
2037 for (insn = BB_END (loop->predecessor); in mt_reorg_loops()
[all …]
/openbsd/usr.bin/make/
H A Dparse.c129 static GNode *predecessor; variable
456 if (predecessor != NULL) { in ParseDoSrc()
457 Lst_AtEnd(&predecessor->successors, gn); in ParseDoSrc()
458 Lst_AtEnd(&gn->predecessors, predecessor); in ParseDoSrc()
460 predecessor = gn; in ParseDoSrc()
759 predecessor = NULL; in handle_special_targets()
/openbsd/gnu/llvm/lldb/source/Plugins/TraceExporter/docs/
H A Dhtr.rst43 - For each block, compute the number of distinct predecessor and successor blocks.
48 …uper block will continue until the next block with more than one distinct predecessor or successor.
/openbsd/gnu/llvm/llvm/docs/
H A DBlockFrequencyTerminology.rst26 Weights are relative to the other edges of a given predecessor block. The
28 the sum of the weights on the predecessor's outgoing edges.
H A DLoopTerminology.rst44 * An **entering block** (or **loop predecessor**) is a non-loop node
295 has a predecessor that is outside the loop. This implies
357 corresponding predecessor block to the current block". Now, an
363 the current block or in the respective predecessor. For LCSSA's purpose,
468 to be in the respective predecessor is a convention across the whole LLVM.
H A DHowToUpdateDebugInfo.rst31 into a predecessor that branches unconditionally. The APIs to use are
46 ``B2``, *and* is its unique predecessor, instructions from ``B2`` can be
119 a predecessor block (see ``BranchFolder::HoistCommonCodeInSuccs``). In this
H A DPasses.rst672 from the predecessor to the successor by duplicating the contents of this
1034 * Merges a basic block into its predecessor if there is only one and the
1035 predecessor only has one successor.
1036 * Eliminates PHI nodes for basic blocks with a single predecessor.
1180 #. PHI nodes must have an entry for each predecessor, with no extras.
H A DMemorySSA.rst283 the last one in a dominating predecessor if the current block doesn't have any
H A DSourceLevelDebugging.rst882 predecessor locations disagree, the location becomes undefined.
/openbsd/gnu/usr.bin/texinfo/info/
H A DREADME21 predecessor. It appears almost identical to the GNU Emacs version, but has
/openbsd/gnu/gcc/gcc/config/bfin/
H A Dbfin.c2763 basic_block predecessor; member
3200 emit_insn_after (seq, BB_END (loop->predecessor)); in bfin_optimize_loop()
3253 loop->predecessor = NULL; in bfin_discover_loop()
3321 loop->predecessor = EDGE_PRED (loop->head, 0)->src; in bfin_discover_loop()
3322 if (loop->predecessor == loop->tail) in bfin_discover_loop()
3324 loop->predecessor = EDGE_PRED (loop->head, 1)->src; in bfin_discover_loop()
3328 if (EDGE_COUNT (loop->predecessor->succs) != 1 in bfin_discover_loop()
3329 || !(EDGE_SUCC (loop->predecessor, 0)->flags & EDGE_FALLTHRU) in bfin_discover_loop()
3332 || bfin_bb_in_loop (loop, loop->predecessor)) in bfin_discover_loop()
3333 loop->predecessor = NULL; in bfin_discover_loop()
[all …]
/openbsd/usr.bin/calendar/calendars/
H A Dcalendar.computer61 07/08 Bell Telephone Co. formed (predecessor of AT&T), 1877
/openbsd/gnu/gcc/gcc/doc/
H A Dcfg.texi144 a predecessor of B, and B is a successor of A@. Edges are represented
147 points to the predecessor basic block of the @code{dest} basic block.
197 the edges in a sequence of predecessor or successor edges. It must
538 its predecessor.
/openbsd/gnu/llvm/libcxx/docs/DesignDocs/
H A DVisibilityMacros.rst50 Historical predecessor of ``_LIBCPP_HIDE_FROM_ABI`` -- please use
/openbsd/gnu/llvm/llvm/docs/Proposals/
H A DVectorizationPlan.rst120 directly, rather than through a Terminator branch or through predecessor
/openbsd/gnu/llvm/llvm/lib/Target/ARM/
H A DREADME.txt271 If BB4 is the only predecessor of BB3, then we can emit BB3 after BB4. We can
/openbsd/gnu/llvm/llvm/docs/tutorial/MyFirstLanguageFrontend/
H A DLangImpl05.rst368 Importantly, the Phi node expects to have an entry for each predecessor
/openbsd/gnu/usr.bin/perl/cpan/Encode/lib/Encode/
H A DSupported.pod673 As a historical predecessor, Microsoft's variant
/openbsd/gnu/llvm/clang/docs/
H A DDataFlowAnalysisIntro.md278 In terms of the CFG, we join the information from all predecessor basic blocks.
H A DInternalsManual.rst2619 *predecessor* blocks (blocks that have outgoing control-flow to the given
2623 entry block (block B5), the number of predecessor blocks is 0, while for the
/openbsd/gnu/usr.bin/gcc/gcc/
H A Drtl.def1152 containing the block number of the predecessor through which control
/openbsd/gnu/gcc/libmudflap/
H A DChangeLog488 (__mf_find_objects2): Flip successor/predecessor search sequence.

12