| /src/external/bsd/kyua-cli/dist/bootstrap/ |
| atf_helpers.cpp | 43 ATF_TEST_CASE_WITHOUT_HEAD(passes); variable
44 ATF_TEST_CASE_BODY(passes)
62 enabled = "fails passes skips";
68 if (enabled.find("passes") != std::string::npos)
69 ATF_ADD_TEST_CASE(tcs, passes);
|
| /src/external/gpl3/binutils/dist/gprofng/src/ |
| FilterExp.h | 39 passes () function in class:FilterExp
41 return expr ? expr->passes (ctx) : true;
|
| Expression.h | 138 passes (Context *ctx) function in class:Expression
|
| /src/external/gpl3/binutils.old/dist/gprofng/src/ |
| FilterExp.h | 39 passes () function in class:FilterExp
41 return expr ? expr->passes (ctx) : true;
|
| Expression.h | 138 passes (Context *ctx) function in class:Expression
|
| /src/usr.sbin/timed/timed/ |
| correct.c | 119 static int passes = 0; local
162 if (passes > 1
165 passes = 0;
|
| /src/external/apache2/argon2/dist/phc-winner-argon2/src/ |
| core.h | 66 * Argon2 instance: memory pointer, number of passes, amount of memory, type,
74 uint32_t passes; /* Number of passes */ member in struct:Argon2_instance_t
|
| /src/external/gpl3/gcc/dist/gcc/ |
| statistics.cc | 261 gcc::pass_manager *passes = g->get_passes (); local
270 && passes->get_pass_for_id (i) != NULL)
273 (passes->get_pass_for_id (i));
|
| optinfo-emit-json.cc | 75 json::array *passes = new json::array (); local
76 m_root_tuple->append (passes);
81 add_pass_list (passes, g->get_passes ()->LIST);
425 child passes (adding their descriptions within a "children" array). */
|
| cgraphunit.cc | 62 This passes control to the back-end. Optimizations are performed and
75 a) early optimizations. These are local passes executed in
83 b) early small interprocedural passes.
85 Those are interprocedural passes executed only at compilation
89 c) IP analysis stage. All interprocedural passes do their
92 Interprocedural passes differ from small interprocedural
93 passes by their ability to operate across whole program
106 e) IP propagation stage. All IP passes execute their
121 IP passes can produce copies of existing functions (such
128 All IP passes transform function bodies based on earlie
528 gcc::pass_manager *passes = g->get_passes (); local
2203 gcc::pass_manager *passes = g->get_passes (); local
[all...] |
| lto-cgraph.cc | 1282 gcc::pass_manager *passes = g->get_passes (); local
1308 of ipa passes is done. Alays forcingly create a fresh node. */
1330 gcc_assert (pid < passes->passes_by_id_size);
1331 pass = passes->passes_by_id[pid];
1408 of ipa passes is done. Alays forcingly create a fresh node. */
|
| profile.cc | 440 int passes;
496 This takes an average of slightly more than 3 passes. */
499 passes = 0;
502 passes++;
594 total_num_passes += passes;
596 fprintf (dump_file, "Graph solving took %d passes.\n\n", passes);
1762 fprintf (dump_file, "Total number of graph solution passes: %d\n",
1765 fprintf (dump_file, "Average number of graph solution passes: %d\n",
439 int passes; local
|
| regcprop.cc | 1407 /* We need accurate notes. Earlier passes such as if-conversion may
1418 within this pass where we can update this passes internal
1437 /* Repeat pass up to PASSES times, but only processing basic blocks
1442 unsigned int passes = optimize > 1 ? 3 : 2;
1443 for (unsigned int pass = 2; pass <= passes && !curr->is_empty (); pass++)
1441 unsigned int passes = optimize > 1 ? 3 : 2; local
|
| passes.cc | 21 It parses command args, opens files, invokes the various passes
74 /* Most passes are single-instance (within their context) and thus don't
75 need to implement cloning, but passes that support multiple instances
153 /* Global variables used to communicate with passes. */
379 /* Once this pass (and its sub-passes) are complete, all functions
381 a tad early, since the sub-passes have not yet run, but since
382 none of the sub-passes are IPA passes and do not create new
384 of IPA passes that follow. */
735 /* Pre-SLP scalar cleanup, it has several cleanup passes like FRE, DSE. *
1863 pass_manager *passes = g->get_passes (); local
1882 pass_manager *passes = g->get_passes (); local
2374 gcc::pass_manager *passes = g->get_passes (); local
2834 pass_manager *passes = g->get_passes (); local
2967 pass_manager *passes = g->get_passes (); local
3028 pass_manager *passes = g->get_passes (); local
3082 pass_manager *passes = g->get_passes (); local
3160 pass_manager *passes = g->get_passes (); local
[all...] |
| gcse.cc | 167 Two passes of copy/constant propagation are done around PRE or hoisting
188 We used to support multiple passes but there are diminishing returns in
191 Experiments show any further passes don't make enough changes to justify
194 A study of spec92 using an unlimited number of passes:
204 were added. Probably, multiple passes is even less efficient now than
842 This function is typically used by code motion passes, to verify
2477 the expression into the result of the SET. It is left to later passes
2757 int changed, passes;
2763 passes = 0;
2791 passes++
2743 int changed, passes; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| statistics.cc | 237 gcc::pass_manager *passes = g->get_passes (); local
246 && passes->get_pass_for_id (i) != NULL)
249 (passes->get_pass_for_id (i));
|
| optinfo-emit-json.cc | 75 json::array *passes = new json::array (); local
76 m_root_tuple->append (passes);
81 add_pass_list (passes, g->get_passes ()->LIST);
426 child passes (adding their descriptions within a "children" array). */
|
| cgraphunit.cc | 62 This passes control to the back-end. Optimizations are performed and
75 a) early optimizations. These are local passes executed in
83 b) early small interprocedural passes.
85 Those are interprocedural passes executed only at compilation
89 c) IP analysis stage. All interprocedural passes do their
92 Interprocedural passes differ from small interprocedural
93 passes by their ability to operate across whole program
106 e) IP propagation stage. All IP passes execute their
121 IP passes can produce copies of existing functions (such
128 All IP passes transform function bodies based on earlie
517 gcc::pass_manager *passes = g->get_passes (); local
2151 gcc::pass_manager *passes = g->get_passes (); local
[all...] |
| lto-cgraph.cc | 1237 gcc::pass_manager *passes = g->get_passes (); local
1263 of ipa passes is done. Alays forcingly create a fresh node. */
1285 gcc_assert (pid < passes->passes_by_id_size);
1286 pass = passes->passes_by_id[pid];
1363 of ipa passes is done. Alays forcingly create a fresh node. */
|
| profile.cc | 428 int passes;
484 This takes an average of slightly more than 3 passes. */
487 passes = 0;
490 passes++;
582 total_num_passes += passes;
584 fprintf (dump_file, "Graph solving took %d passes.\n\n", passes);
1695 fprintf (dump_file, "Total number of graph solution passes: %d\n",
1698 fprintf (dump_file, "Average number of graph solution passes: %d\n",
427 int passes; local
|
| passes.cc | 21 It parses command args, opens files, invokes the various passes
74 /* Most passes are single-instance (within their context) and thus don't
75 need to implement cloning, but passes that support multiple instances
153 /* Global variables used to communicate with passes. */
385 /* Once this pass (and its sub-passes) are complete, all functions
387 a tad early, since the sub-passes have not yet run, but since
388 none of the sub-passes are IPA passes and do not create new
390 of IPA passes that follow. */
735 /* Pre-SLP scalar cleanup, it has several cleanup passes like FRE, DSE. *
1856 pass_manager *passes = g->get_passes (); local
1875 pass_manager *passes = g->get_passes (); local
2370 gcc::pass_manager *passes = g->get_passes (); local
2816 pass_manager *passes = g->get_passes (); local
2949 pass_manager *passes = g->get_passes (); local
3010 pass_manager *passes = g->get_passes (); local
3064 pass_manager *passes = g->get_passes (); local
3142 pass_manager *passes = g->get_passes (); local
[all...] |
| /src/sys/external/isc/libsodium/dist/src/libsodium/crypto_pwhash/argon2/ |
| argon2-core.h | 90 * Argon2 instance: memory pointer, number of passes, amount of memory, type,
98 uint32_t passes; /* Number of passes */ member in struct:Argon2_instance_t
|
| /src/external/apache2/llvm/dist/llvm/lib/LTO/ |
| LTOBackend.cpp | 31 #include "llvm/Passes/PassBuilder.h"
32 #include "llvm/Passes/PassPlugin.h"
33 #include "llvm/Passes/StandardInstrumentations.h"
66 "Embed after all optimization passes"),
171 errs() << "Failed to load passes from '" << PluginFN
312 legacy::PassManager passes; local
313 passes.add(createTargetTransformInfoWrapperPass(TM->getTargetIRAnalysis()));
336 PMB.populateThinLTOPassManager(passes);
338 PMB.populateLTOPassManager(passes);
339 passes.run(Mod)
[all...] |
| /src/external/gpl2/lvm2/dist/lib/commands/ |
| toolcontext.c | 318 int *passes)
323 *passes = 1;
329 *passes = 0;
339 *passes = 1;
357 int passes; local
382 passes = 0;
383 if (!_check_host_filters(cmd, cn->child, &passes))
385 if (!passes)
|
| /src/crypto/external/apache2/openssl/dist/providers/implementations/kdfs/ |
| argon2.c | 174 uint32_t passes; member in struct:__anon546
485 input_block.v[4] = ctx->passes;
568 for (r = 0; r < ctx->passes; ++r) {
629 for (r = 0; r < ctx->passes; ++r)
1100 ctx->passes = ctx->t_cost;
|
