Lines Matching +full:actions +full:- +full:builder

1 <!--===- docs/ControlFlowGraph.md 
5    SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 -->
12 ---
14 ---
26 Many high-level Fortran features are implemented by rewriting portions
30 A _control flow graph_ is a collection of simple (_i.e.,_ "non-extended")
31 basic _blocks_ that comprise straight-line sequences of _actions_ with a
40 The sequence of actions that constitutes a basic block may
66 flow graph has a well-defined `START` node.
71 Specifically, non-executable statements like `DATA`, `NAMELIST`, and
83 ### Expressions and Statements (Operations and Actions)
88 Expression nodes are represented in the compiler in a type-safe manner.
92 Operands are storage-owning indirections to other instances
112 These are represented as a doubly-linked list so that insertion
120 graph as `SCOPE ENTRY` and `SCOPE EXIT` actions.
121 `SCOPE ENTRY` actions are unique for their corresponding scopes,
122 while `SCOPE EXIT` actions need not be so.
126 yet been deactivated; i.e., when modeled by a push-down stack that is
134 The `DEALLOCATE` actions and calls to `FINAL` procedures implied by scoped
135 lifetimes will be explicit in the sequence of actions in the control flow
143 subprogram arrives at the bridge to the LLVM IR builder.
144 Merge points are actions at the heads of basic blocks whose operands
145 are definition points; definition points are actions at the ends of