Home
last modified time | relevance | path

Searched refs:flow (Results 1 – 25 of 372) sorted by relevance

12345678910>>...15

/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_flow.c2104 if (!flow) in isl_union_flow_free()
2116 if (!flow) in isl_union_flow_dump()
2134 if (!flow) in isl_union_flow_get_full_must_dependence()
2145 if (!flow) in isl_union_flow_get_full_may_dependence()
2158 if (!flow) in isl_union_flow_get_must_dependence()
2172 if (!flow) in isl_union_flow_get_may_dependence()
2247 if (!flow->must_dep || !flow->may_dep || in isl_union_flow_alloc()
2248 !flow->must_no_source || !flow->may_no_source) in isl_union_flow_alloc()
2322 if (!flow->must_dep || !flow->may_dep || in isl_union_flow_drop_schedule()
2323 !flow->must_no_source || !flow->may_no_source) in isl_union_flow_drop_schedule()
[all …]
H A Dflow.c24 isl_union_flow *flow; in main() local
32 flow = isl_union_access_info_compute_flow(access); in main()
36 p = isl_printer_print_union_flow(p, flow); in main()
39 isl_union_flow_free(flow); in main()
H A Dflow_test.sh.in8 for i in $srcdir/test_inputs/flow/*.ai; do
11 test=test-$base.flow
13 ref=$dir/$base.flow
/llvm-project-15.0.7/polly/lib/External/ppcg/
H A Dppcg.c395 isl_union_flow *flow; in compute_live_out() local
406 isl_union_flow_free(flow); in compute_live_out()
433 isl_union_flow *flow; in compute_tagged_flow_dep_only() local
458 isl_union_flow_free(flow); in compute_tagged_flow_dep_only()
531 isl_union_flow *flow; in compute_order_dependences() local
547 isl_union_flow_free(flow); in compute_order_dependences()
596 isl_union_flow *flow; in compute_forced_dependences() local
607 isl_union_flow_free(flow); in compute_forced_dependences()
618 isl_union_flow_free(flow); in compute_forced_dependences()
690 isl_union_flow *flow; in compute_flow_dep() local
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/include/isl/
H A Dflow.h117 isl_ctx *isl_union_flow_get_ctx(__isl_keep isl_union_flow *flow);
119 __isl_keep isl_union_flow *flow);
122 __isl_keep isl_union_flow *flow);
125 __isl_keep isl_union_flow *flow);
128 __isl_keep isl_union_flow *flow);
131 __isl_keep isl_union_flow *flow);
134 __isl_keep isl_union_flow *flow);
137 __isl_keep isl_union_flow *flow);
138 __isl_null isl_union_flow *isl_union_flow_free(__isl_take isl_union_flow *flow);
141 __isl_take isl_printer *p, __isl_keep isl_union_flow *flow);
[all …]
/llvm-project-15.0.7/mlir/include/mlir/Dialect/Transform/Transforms/
H A DPasses.td23 The pass is capable of handling branching control flow and reports all
25 reported if at least one of the control flow paths between the definition of
28 flow analysis to prove that some branches are not taken, however, SCCP and
29 other control flow simplifications can be performed on the transform IR
31 control flow interfaces.
/llvm-project-15.0.7/llvm/docs/
H A DCFIVerify.rst14 indirect control flow operations are protected by CFI, and should output these
33 indirect control flow instructions are identified.
44 Unprotected indirect control flow instructions will be flagged for manual
64 The tool would operate by searching for indirect control flow instructions in
65 the disassembly. A control flow graph would be generated from a small buffer of
66 the instructions surrounding the 'target' control flow instruction. If the
70 conditional jump target should be the CFI trap. If an indirect control flow
87 present in these sections has already violated the control flow integrity.
90 control flow operations across DSO boundaries. Currently, these CFI features are
/llvm-project-15.0.7/clang/docs/
H A DDataFlowAnalysisIntro.md1 # Data flow analysis: an informal introduction
5 This document introduces data flow analysis in an informal way. The goal is to
9 Data flow analysis is a well-established technique; it is described in many
31 ## Data flow analysis
33 ### The purpose of data flow analysis
39 control flow graph (CFG) until a fixpoint is reached.
205 Formally, control flow is represented by a CFG (control flow graph):
349 tracking a flow condition. A flow condition is a predicate written in terms of
524 ### Using data flow results to identify output parameters
849 if (b1 && b2) { // `b1` is implied by the flow condition.
[all …]
H A DDataFlowSanitizer.rst16 DataFlowSanitizer is a generalised dynamic data flow analysis.
20 dynamic data flow analysis framework to be used by clients to help
31 libc++ and the libc++ ABI with data flow sanitizer instrumentation.
56 the propagation of tags through the program according to its data flow.
193 * ``-dfsan-track-select-control-flow`` -- Controls whether to track the control
194 flow of select instructions. Its default value is true. For example:
218 callbacks for control flow conditional expressions.
229 expression for control flow (such as an if's condition).
336 dfsan_print_origin_trace(&j, "A flow from i to j");
342 Taint value 0x1 (at 0x7ffd42bf415c) origin tracking (A flow from i to j)
H A DSanitizerStats.rst20 flow integrity check in the program fires.
39 this case, the type of control flow integrity check). The fourth column is
/llvm-project-15.0.7/mlir/include/mlir/Interfaces/
H A DControlFlowInterfaces.td10 // about control flow operations, e.g. branches.
28 This interface is meant to model well-defined cases of control-flow of
29 value propagation, where what occurs along control-flow edges is assumed to
32 `areTypesCompatible` can be implemented to compare types along control-flow
94 This method is called to compare types along control-flow edges. By
122 expressing control flow information for region holding operations.
124 This interface is meant to model well-defined cases of control-flow of
125 value propagation, where what occurs along control-flow edges is assumed to
152 are the regions that may be selected during the flow of control. If
193 This method is called to compare types along control-flow edges. By
[all …]
/llvm-project-15.0.7/llvm/test/YAMLParser/
H A Dspec-09-12.test3 # Outside flow collection:
7 # Inside flow collection:
H A Dspec-08-14.test3 - "flow in block"
/llvm-project-15.0.7/mlir/include/mlir/Transforms/
H A DPasses.td40 def ControlFlowSink : Pass<"control-flow-sink"> {
43 This pass implements control-flow sink on operations that implement
51 control-flow sink uses a simple and conversative cost model: operations are
243 - Uses (data flow) as edges;
244 - Control flow as dashed edges;
247 By default, only data flow edges are printed.
257 Option<"printControlFlowEdges", "print-control-flow-edges", "bool",
258 /*default=*/"false", "Print control flow edges">,
259 Option<"printDataFlowEdges", "print-data-flow-edges", "bool",
260 /*default=*/"true", "Print data flow edges">,
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dtransform-block-with-return-to-epilog.ll104 ; GCN: bb.3.flow.preheader:
109 ; GCN: bb.4.flow:
140 br i1 %cmp0, label %kill0, label %flow
146 flow: ; preds = %entry
148 br i1 %cmp1, label %flow, label %end
150 kill1: ; preds = %flow
154 end: ; preds = %kill0, %kill1, %flow
H A Dloop_exit_with_xor.ll5 ; control flow annotation), then lower control flow must insert an S_AND_B64
36 ; obviously already masked by exec (a V_CMP), then lower control flow can omit
/llvm-project-15.0.7/mlir/include/mlir/IR/
H A DRegionKindInterface.td25 control flow semantics. RegionKind::SSACFG represents an
26 [SSA-style control flow](../LangRef.md/#modeling-control-flow) region
/llvm-project-15.0.7/llvm/test/Analysis/DependenceAnalysis/
H A DBanerjee.ll20 ; CHECK: da analyze - flow [<= <>]!
28 ; DELIN: da analyze - flow [<= <>]!
80 ; CHECK: da analyze - flow [* <>]!
88 ; DELIN: da analyze - flow [* <>]!
214 ; CHECK: da analyze - flow [> >]!
222 ; DELIN: da analyze - flow [> >]!
332 ; CHECK: da analyze - flow [< <]!
340 ; DELIN: da analyze - flow [< <]!
450 ; CHECK: da analyze - flow [> <=]!
458 ; DELIN: da analyze - flow [> <=]!
[all …]
H A DExactSIV.ll18 ; CHECK: da analyze - flow [<=|<]!
132 ; CHECK: da analyze - flow [>]!
169 ; CHECK: da analyze - flow [>]!
206 ; CHECK: da analyze - flow [=>|<]!
243 ; CHECK: da analyze - flow [=>|<]!
280 ; CHECK: da analyze - flow [*|<]!
354 ; CHECK: da analyze - flow [>]!
391 ; CHECK: da analyze - flow [>]!
428 ; CHECK: da analyze - flow [=>|<]!
465 ; CHECK: da analyze - flow [=>|<]!
[all …]
/llvm-project-15.0.7/clang-tools-extra/docs/clang-tidy/checks/readability/
H A Dredundant-control-flow.rst1 .. title:: clang-tidy - readability-redundant-control-flow
3 readability-redundant-control-flow
/llvm-project-15.0.7/mlir/docs/
H A DLangRef.md232 [SSA control flow semantics](#control-flow-and-ssacfg-regions) is constrained
364 [SSACFG regions](#control-flow-and-ssacfg-regions), each block represents a
367 implement control flow branches between basic blocks.
382 [control flow](#control-flow-and-ssacfg-regions), MLIR leverages this structure
433 regions: [SSACFG regions](#control-flow-and-ssacfg-regions), which describe
496 In MLIR, control flow semantics of a region is indicated by
504 next instruction to execute is the 'passing of control flow'.
507 when control flow enters or exits the regions contained in that operation.
510 represent control flow by explicitly specifying the successor blocks of the
561 operation may pass control flow to any region in the same operation. An
[all …]
/llvm-project-15.0.7/llvm/tools/llvm-exegesis/lib/
H A DBenchmarkResult.cpp191 static const bool flow = false; member
210 static const bool flow = true; member
215 static const bool flow = false; member
230 static const bool flow = true; member
247 static const bool flow = false; member
281 static const bool flow = true; member
/llvm-project-15.0.7/mlir/test/Transforms/
H A Dcontrol-flow-sink-test.mlir1 // Invoke the test control-flow sink pass to test the utilities.
2 // RUN: mlir-opt -test-control-flow-sink %s | FileCheck %s
/llvm-project-15.0.7/llvm/test/Transforms/GVN/PRE/
H A Dlocal-pre.ll32 ; Don't PRE across implicit control flow.
60 ; Don't PRE across implicit control flow.
121 ; It is OK to PRE across implicit control flow if we don't insert new
/llvm-project-15.0.7/mlir/docs/Dialects/
H A DTOSA.md32 elementwise transformations, comparison and control flow.
66 Several neural networks express conditional control flow at the tensor level.
70 including control flow, it implements these constructs.
73 flow forms and should be lowerable to corresponding ops in the scf dialect.

12345678910>>...15