| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
| H A D | loop.h | 81 struct induction struct
147 struct induction *next_iv; /* For givs, links together all givs that are argument
151 struct induction *same; /* For givs, if the giv has been combined with argument
161 struct induction *same_insn; /* If there are multiple identical givs in argument
176 struct induction *biv; /* List of all insns that set this reg. */ argument
180 struct induction *giv; /* List of all insns that compute a giv
219 struct induction *info;
410 extern rtx express_from (struct induction *, struct induction *);
411 extern rtx extend_value_for_giv (struct induction *, rtx);
419 extern rtx final_giv_value (const struct loop *, struct induction *);
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
| H A D | loop.h | 81 struct induction
147 struct induction *next_iv; /* For givs, links together all givs that are
151 struct induction *same; /* For givs, if the giv has been combined with
161 struct induction *same_insn; /* If there are multiple identical givs in
176 struct induction *biv; /* List of all insns that set this reg. */
180 struct induction *giv; /* List of all insns that compute a giv
219 struct induction *info;
410 extern rtx express_from (struct induction *, struct induction *);
411 extern rtx extend_value_for_giv (struct induction *, rtx);
419 extern rtx final_giv_value (const struct loop *, struct induction *);
|
| /dports/math/abella/abella-2.0.7/examples/first-order/ |
| H A D | lists.thm | 9 induction on 1. intros. case H1.
16 induction on 1. intros. case H1.
24 induction on 1. intros. case H1.
30 induction on 1. intros. case H1.
37 induction on 1. intros. case H1.
43 induction on 2. intros. case H2.
50 induction on 1. intros. case H1.
61 induction on 1. intros. case H1.
67 induction on 1. intros. case H1.
|
| H A D | gcd.thm | 2 %% This requires strong induction which we can encode using regular
12 induction on 1. intros. case H1.
18 induction on 1. intros. case H1.
24 induction on 1. intros. case H1.
34 induction on 1. intros. case H1.
44 induction on 1. intros. case H1.
50 induction on 1. intros. case H1.
56 induction on 1. intros. case H1.
62 induction on 2. intros. case H2.
69 induction on 1. induction on 2. intros.
|
| H A D | even-odd.thm | 3 %% This is a simple example where induction is needed at a nested rather
24 induction on 1. intros. case H1.
33 %% An example of mutual induction
44 induction on 1. intros. case H1.
49 induction on 1. intros. case H1.
|
| H A D | add.thm | 10 induction on 1. intros. case H1. search.
14 induction on 1. intros. case H1.
19 induction on 2. intros. case H2.
27 induction on 1. intros. case H1.
36 induction on 1. intros. case H1.
|
| /dports/math/abella/abella-2.0.7/examples/programming-languages/ |
| H A D | poplmark-2a.thm | 11 induction on 1. intros. case H1.
18 induction on 1. intros. case H1.
25 induction on 1. intros. case H1.
32 induction on 1. intros. case H1.
41 induction on 1. intros. case H1.
53 induction on 1. intros. case H1.
59 induction on 1. intros. case H1.
67 induction on 1. intros. case H1.
77 induction on 1. intros. case H1.
96 induction on 1. intros. case H1.
[all …]
|
| /dports/math/abella/abella-2.0.7/examples/lambda-calculus/ |
| H A D | eval.thm | 15 induction on 1. intros. case H1.
21 induction on 1. intros. case H1.
31 induction on 1. intros. case H1.
45 induction on 1. intros. case H1.
51 induction on 1. intros. case H1.
57 induction on 1. intros. case H1.
63 induction on 1. intros. case H1.
74 induction on 1. intros. case H1.
81 induction on 1. intros. case H1.
90 induction on 1. intros. case H1.
[all …]
|
| H A D | sred.thm | 15 induction on 1. intros. case H1.
26 induction on 2. intros. case H2.
32 induction on 2. intros. case H2.
39 induction on 2. intros. case H2.
47 induction on 2. intros. case H2.
56 induction on 2. intros. case H2.
79 induction on 2. intros. case H2.
86 induction on 2. intros. case H2.
93 induction on 2. intros. case H2.
105 induction on 2. intros. case H2.
[all …]
|
| /dports/math/abella/abella-2.0.7/examples/misc/ |
| H A D | well-founded.thm | 1 %% Use well-founded induction to prove the totality of Euclid's GCD algorithm.
32 induction on 1. intros. case H1.
42 induction on 1. intros. case H1.
47 induction on 1. intros. case H1.
76 induction on 1. intros. case H1.
90 induction on 1. intros. case H1.
95 % Totality of mod N (s M) R, by strong induction on N
99 induction on 2. intros. case H2. apply sub_total to H1 _ with N2 = s M. case H5.
111 induction on 1. intros. case H1.
116 % Totality of gcd N M D, by strong induction on m
[all …]
|
| H A D | copy.thm | 7 induction on 1. intros. case H1.
21 induction on 1. intros.
28 induction on 1. intros.
42 induction on 2. intros. case H2.
51 induction on 1. intros. case H1.
60 induction on 2. intros. case H2.
77 induction on 1. intros. case H1.
86 induction on 2. intros. case H2.
|
| /dports/math/z3/z3-z3-4.8.13/src/smt/ |
| H A D | smt_induction.h.disabled | 10 Add induction lemmas to context.
32 * Collect literals that are potentially useful for induction lemmas.
51 * Synthesize induction lemmas from induction candidates
131 * Establish induction clauses.
134 class induction {
144 induction(context& ctx, ast_manager& m);
|
| /dports/math/abella/abella-2.0.7/examples/higher-order/ |
| H A D | debruijn_ho.thm | 10 induction on 1. intros. case H1.
27 induction on 1. intros. case H1.
33 induction on 1. intros. case H1.
39 induction on 1. intros. case H1.
56 induction on 2. intros. case H2.
65 induction on 1. intros. case H1.
83 induction on 1. intros. case H1.
92 induction on 1. intros. case H1.
103 induction on 2. intros. case H2.
116 induction on 2. intros. case H2.
[all …]
|
| /dports/math/abella/abella-2.0.7/examples/lambda-calculus/term-structure/ |
| H A D | debruijn.thm | 20 induction on 1. intros. case H1.
37 induction on 1. intros. case H1.
43 induction on 1. intros. case H1.
49 induction on 1. intros. case H1.
66 induction on 2. intros. case H2.
75 induction on 1. intros. case H1.
91 induction on 1. intros. case H1.
97 induction on 1. intros. case H1.
110 induction on 2. intros. case H2.
127 induction on 2. intros. case H2.
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/devel/llvm11/llvm-11.0.1.src/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/devel/llvm10/llvm-10.0.1.src/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/devel/llvm90/llvm-9.0.1.src/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/test/Transforms/LoopVectorize/ |
| H A D | vect-phiscev-sext-trunc.ll | 6 ; Given a loop with an induction variable which is being
17 ; Case1: Check the following induction pattern:
39 ; we vectorize or scalarize the induction.
40 ; In the case of widened induction, this means that the induction phi
85 ; Case2: Another variant of the above pattern is where the induction variable
87 ; the induction is not vectorized but rather only the step is widened.
89 ; This is the case in the following code, where the induction variable 'w_ix'
107 ; we widen or scalarize the induction.
108 ; In the case of widened induction, this means that the induction phi
152 ; Case3: Lastly, check also the following induction pattern:
[all …]
|