| /openbsd/src/gnu/gcc/gcc/ |
| D | lambda-code.c | 135 int invariants; member
142 #define LATTICE_INVARIANTS(T) ((T)->invariants)
203 int depth, int invariants) in lle_equal() argument
216 for (i = 0; i < invariants; i++) in lle_equal()
227 lambda_linear_expression_new (int dim, int invariants) in lambda_linear_expression_new() argument
235 LLE_INVARIANT_COEFFICIENTS (ret) = lambda_vector_new (invariants); in lambda_linear_expression_new()
281 int depth, int invariants, char start) in print_lambda_linear_expression() argument
288 invariants, 'A'); in print_lambda_linear_expression()
299 int invariants, char start) in print_lambda_loop() argument
313 print_lambda_linear_expression (outfile, expr, depth, invariants, in print_lambda_loop()
[all …]
|
| D | loop-invariant.c | 153 static VEC(invariant_p,heap) *invariants; in VEC()
469 dep = VEC_index (invariant_p, invariants, depno); in find_identical_invariants()
493 htab_t eq = htab_create (VEC_length (invariant_p, invariants), in merge_identical_invariants()
496 for (i = 0; VEC_iterate (invariant_p, invariants, i, inv); i++) in merge_identical_invariants()
652 inv->invno = VEC_length (invariant_p, invariants); in create_new_invariant()
656 VEC_safe_push (invariant_p, heap, invariants, inv); in create_new_invariant()
923 inv = VEC_index (invariant_p, invariants, inv->eqto); in get_inv_cost()
963 dep = VEC_index (invariant_p, invariants, depno); in get_inv_cost()
1022 for (invno = 0; VEC_iterate (invariant_p, invariants, invno, inv); invno++) in best_gain_for_invariant()
1049 struct invariant *inv = VEC_index (invariant_p, invariants, invno); in set_move_mark()
[all …]
|
| D | tree-loop-linear.c | 247 VEC(tree,heap) *invariants = NULL; in linear_transform_loops()
276 VEC_truncate (tree, invariants, 0); in linear_transform_loops()
323 &invariants); in linear_transform_loops()
342 lambda_loopnest_to_gcc_loopnest (loop_nest, oldivs, invariants, in linear_transform_loops()
355 VEC_free (tree, heap, invariants); in linear_transform_loops()
|
| D | lambda.h | 134 int invariants; member
139 #define LN_INVARIANTS(T) ((T)->invariants)
|
| D | common.opt | 619 fmove-loop-invariants
|
| /openbsd/src/gnu/llvm/clang/include/clang/Tooling/Syntax/ |
| D | Syntax.td | 75 // The role sequence and role/type match are enforced invariants of the class.
78 // are permitted (for Leaf nodes). These invariants are not enforced.
|
| /openbsd/src/gnu/llvm/lldb/docs/resources/ |
| D | contributing.rst | 56 assertion should be placed to assert invariants that the developer
|
| /openbsd/src/gnu/llvm/llvm/docs/GlobalISel/ |
| D | Pipeline.rst | 98 The pass approach lets us use the ``MachineVerifier`` to enforce invariants
|
| /openbsd/src/gnu/llvm/clang/docs/analyzer/developer-docs/ |
| D | IPA.rst | 105 fairly poor job of modeling certain data structure invariants of container-like
|
| /openbsd/src/gnu/gcc/gcc/doc/ |
| D | passes.texi | 406 Loop invariant motion. This pass moves only invariants that
702 invariants out of loops---that is left to the loop optimization pass.
|
| D | rtl.texi | 2980 This means that the above invariants are not necessarily true for insns
3169 invariants.
|
| D | invoke.texi | 110 @option{-fmove-loop-invariants}, @option{-Wformat} and so on. Most of
320 -fno-default-inline -fno-defer-pop -fmove-loop-invariants @gol
5224 Perform loop invariant motion on trees. This pass moves only invariants that
5878 @item -fmove-loop-invariants
5879 @opindex fmove-loop-invariants
|
| /openbsd/src/gnu/llvm/lldb/docs/status/ |
| D | projects.rst | 143 express invariants for data structures, or other more advanced uses of types
|
| /openbsd/src/gnu/usr.bin/gcc/gcc/doc/ |
| D | passes.texi | 339 invariants out of loops---that is left to the loop optimization pass.
|
| D | rtl.texi | 2751 This means that the above invariants are not necessarily true for insns
2947 invariants.
|
| /openbsd/src/gnu/llvm/clang/docs/ |
| D | AutomaticReferenceCounting.rst | 1018 programmer cooperation to establish its initialization invariants
1690 except as guaranteed by ``__strong`` object invariants or +1 transfer
1940 since the subclass may well rely on other invariants that were broken during
|
| D | InternalsManual.rst | 1946 have into CallExpr forces us to weaken its invariants, e.g. arg count may be
1949 we use a distinct recovery node type with extremely weak invariants instead.
|
| D | LanguageExtensions.rst | 3858 invariants and rules for static analysis tools, such as the `Clang Static
|
| /openbsd/src/gnu/llvm/llvm/docs/ |
| D | ProgrammersManual.rst | 413 Programmatic errors are violations of program invariants or API contracts, and
414 represent bugs within the program itself. Our aim is to document invariants, and
416 invariants are broken at runtime.
427 that should never be entered if the program invariants hold:
|
| /openbsd/src/gnu/llvm/libcxx/include/ |
| D | __tree | 378 _LIBCPP_DEBUG_ASSERT(__tree_invariant(__root), "The tree invariants should hold");
|
| /openbsd/src/gnu/usr.bin/perl/pod/ |
| D | perlebcdic.pod | 246 (If you care, the EBCDIC invariants are those characters
|
| /openbsd/src/gnu/usr.bin/gcc/gcc/ |
| D | ChangeLog.1 | 10873 * loop.c (scan_loop): Be more selective about what invariants are
15813 (simplify_giv_expr) [PLUS]: Always combine invariants. Use sge_plus.
15814 [MULT]: Use rtx_equal_p instead of ==. Combine simple invariants.
|
| /openbsd/src/gnu/lib/libstdc++/libstdc++/ |
| D | ChangeLog-2000 | 7181 * testsuite/21_strings/invariants.cc: Update.
7464 * testsuite/21_strings/invariants.cc: New file.
|
| /openbsd/src/gnu/usr.bin/gcc/gcc/config/c4x/ |
| D | c4x.md | 3126 ; reload) so that it can hoist invariants out of loops.
|
| /openbsd/src/gnu/gcc/gcc/config/c4x/ |
| D | c4x.md | 3119 ; reload) so that it can hoist invariants out of loops.
|