Home
last modified time | relevance | path

Searched refs:complexity (Results 1 – 25 of 282) sorted by relevance

12345678910>>...12

/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dcomplexity.cc68 complexity::complexity (const region *reg) in complexity() function in ana::complexity
77 complexity::complexity (const svalue *sval) in complexity() function in ana::complexity
86 complexity
87 complexity::from_pair (const complexity &c1, const complexity &c2) in from_pair()
89 return complexity (c1.m_num_nodes + c2.m_num_nodes + 1, in from_pair()
95 complexity
96 complexity::from_vec_svalue (const vec<const svalue *> &vec) in from_vec_svalue()
102 const complexity &iter_c = iter_sval->get_complexity (); in from_vec_svalue()
106 return complexity (num_nodes + 1, max_depth + 1); in from_vec_svalue()
H A Dcomplexity.h30 struct complexity struct
32 complexity (unsigned num_nodes, unsigned max_depth) in complexity() function
36 complexity (const region *reg);
37 complexity (const svalue *sval);
38 static complexity from_pair (const complexity &c1, const complexity &c);
39 static complexity from_vec_svalue (const vec<const svalue *> &vec);
H A Dregion.h205 const complexity &get_complexity () const { return m_complexity; } in get_complexity()
210 region (complexity c, unsigned id, const region *parent, tree type);
215 complexity m_complexity;
242 : region (complexity (parent), id, parent, NULL_TREE) in space_region()
420 : region (complexity (parent), id, parent, TREE_TYPE (fndecl)),
457 : region (complexity (parent), id, parent, NULL_TREE), m_label (label)
643 : region (complexity (parent), id, parent, TREE_TYPE (decl)), m_decl (decl),
725 : region (complexity (parent), id, parent, TREE_TYPE (field)),
806 : region (complexity::from_pair (parent, index), id, parent, element_type),
891 : region (complexity::from_pair (parent, byte_offset), id, parent, type),
[all …]
H A Dsvalue.h147 const complexity &get_complexity () const { return m_complexity; } in get_complexity()
181 svalue (complexity c, tree type) in svalue()
186 complexity m_complexity;
226 : svalue (complexity (reg), type), in region_svalue()
275 : svalue (complexity (1, 1), TREE_TYPE (cst_expr)), m_cst_expr (cst_expr)
327 : svalue (complexity (1, 1), type)
396 : svalue (complexity (1, 1), type), m_kind (kind) {}
504 : svalue (complexity (1, 1), type), m_setjmp_record (setjmp_record)
552 : svalue (complexity (reg), type), m_reg (reg)
626 : svalue (complexity (arg), type), m_op (op), m_arg (arg)
[all …]
H A Dsvalue.cc1249 : svalue (complexity::from_pair (parent_svalue->get_complexity (), in sub_svalue()
1307 : svalue (complexity::from_pair (outer_size, inner_svalue), type), in repeated_svalue()
1434 : svalue (complexity (inner_svalue), type), in bits_within_svalue()
1791 complexity
1799 const complexity &sval_c = (*iter).second->get_complexity (); in calc_complexity()
1803 return complexity (num_child_nodes + 1, max_child_depth + 1); in calc_complexity()
/netbsd-src/external/apache2/llvm/dist/llvm/utils/benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
29 switch (complexity) { in FittingCurve()
47 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
48 switch (complexity) { in GetBigOString()
94 result.complexity = oLambda; in MinimalLeastSq()
121 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
125 CHECK_NE(complexity, oNone); in MinimalLeastSq()
129 if (complexity == oAuto) { in MinimalLeastSq()
134 best_fit.complexity = o1; in MinimalLeastSq()
141 best_fit.complexity = fit; in MinimalLeastSq()
[all …]
H A Dcomplexity.h43 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {} in LeastSq()
47 BigO complexity; member
51 std::string GetBigOString(BigO complexity);
H A Dbenchmark_register.cc167 instance.complexity = family->complexity_; in FindBenchmarks()
390 Benchmark* Benchmark::Complexity(BigO complexity) { in Complexity() argument
391 complexity_ = complexity; in Complexity()
395 Benchmark* Benchmark::Complexity(BigOFunc* complexity) { in Complexity() argument
396 complexity_lambda_ = complexity; in Complexity()
H A Dbenchmark.cc150 report.complexity = b.complexity; in CreateRunReport()
251 if (!report.error_occurred && b.complexity != oNone) in RunBenchmark()
278 if ((b.complexity != oNone) && b.last_benchmark_instance) { in RunBenchmark()
H A Dbenchmark_api_internal.h25 BigO complexity; member
/netbsd-src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/src/
H A Dcomplexity.cc28 BigOFunc* FittingCurve(BigO complexity) { in FittingCurve() argument
30 switch (complexity) { in FittingCurve()
50 std::string GetBigOString(BigO complexity) { in GetBigOString() argument
51 switch (complexity) { in GetBigOString()
97 result.complexity = oLambda; in MinimalLeastSq()
124 const std::vector<double>& time, const BigO complexity) { in MinimalLeastSq() argument
128 CHECK_NE(complexity, oNone); in MinimalLeastSq()
132 if (complexity == oAuto) { in MinimalLeastSq()
137 best_fit.complexity = o1; in MinimalLeastSq()
144 best_fit.complexity = fit; in MinimalLeastSq()
[all …]
H A Dcomplexity.h43 LeastSq() : coef(0.0), rms(0.0), complexity(oNone) {} in LeastSq()
47 BigO complexity; member
51 std::string GetBigOString(BigO complexity);
H A Dbenchmark_register.cc167 instance.complexity = family->complexity_; in FindBenchmarks()
411 Benchmark* Benchmark::Complexity(BigO complexity) { in Complexity() argument
412 complexity_ = complexity; in Complexity()
416 Benchmark* Benchmark::Complexity(BigOFunc* complexity) { in Complexity() argument
417 complexity_lambda_ = complexity; in Complexity()
H A Dbenchmark_runner.cc87 report.complexity = b.complexity; in CreateRunReport()
161 if ((b.complexity != oNone) && b.last_benchmark_instance) { in BenchmarkRunner()
332 if (!report.error_occurred && b.complexity != oNone) in DoOneRepetition()
H A Dbenchmark_api_internal.h27 BigO complexity; member
/netbsd-src/external/apache2/llvm/dist/llvm/utils/gn/secondary/llvm/utils/benchmark/
H A DBUILD.gn7 "src/complexity.cc",
/netbsd-src/external/gpl3/binutils/dist/gprofng/src/machinemodels/
H A Dm5.ermm49 # comment out *CacheTag definitions since we don't have use cases to justify their complexity
50 # comment out other *Cache* definitions since we don't have use cases to justify their complexity
H A Dt5.ermm49 # comment out *CacheTag definitions since we don't have use cases to justify their complexity
50 # comment out other *Cache* definitions since we don't have use cases to justify their complexity
H A Dm6.ermm49 # comment out *CacheTag definitions since we don't have use cases to justify their complexity
50 # comment out other *Cache* definitions since we don't have use cases to justify their complexity
H A Dt4.ermm51 # comment out *CacheTag definitions since we don't have use cases to justify their complexity
52 # comment out other *Cache* definitions since we don't have use cases to justify their complexity
/netbsd-src/external/gpl3/binutils.old/dist/gprofng/src/machinemodels/
H A Dm6.ermm49 # comment out *CacheTag definitions since we don't have use cases to justify their complexity
50 # comment out other *Cache* definitions since we don't have use cases to justify their complexity
H A Dm5.ermm49 # comment out *CacheTag definitions since we don't have use cases to justify their complexity
50 # comment out other *Cache* definitions since we don't have use cases to justify their complexity
H A Dt5.ermm49 # comment out *CacheTag definitions since we don't have use cases to justify their complexity
50 # comment out other *Cache* definitions since we don't have use cases to justify their complexity
H A Dt4.ermm51 # comment out *CacheTag definitions since we don't have use cases to justify their complexity
52 # comment out other *Cache* definitions since we don't have use cases to justify their complexity
/netbsd-src/crypto/external/bsd/openssl.old/dist/Configurations/
H A Dcommon0.tmpl4 # The reason for the complexity is that the build.info files provide

12345678910>>...12