Complexity (reference) in projects: external

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched refs:Complexity (Results 1 – 25 of 360) sorted by relevance

12 3 4 5 6 7 8 9 10 >>...15

/external/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/RISCV/
D	RISCVGenDAGISel.inc	79 …:[i32] } GPR:{ :[i32] }:$rs2, 4294967295:{ :[i32] })), 4294967295:{ :[i32] }) - Complexity = 27 85 …:[i32] } GPR:{ :[i32] }:$rs2, 4294967295:{ :[i32] })), 4294967295:{ :[i32] }) - Complexity = 27 92 …:[i64] } GPR:{ :[i64] }:$rs2, 4294967295:{ :[i64] })), 4294967295:{ :[i64] }) - Complexity = 27 106 …2] } GPR:{ :[i32] }:$rs2)<<P:Predicate_assertzexti32>>), 4294967295:{ :[i32] }) - Complexity = 23 112 …2] } GPR:{ :[i32] }:$rs2)<<P:Predicate_assertzexti32>>), 4294967295:{ :[i32] }) - Complexity = 23 119 …4] } GPR:{ :[i64] }:$rs2)<<P:Predicate_assertzexti32>>), 4294967295:{ :[i64] }) - Complexity = 23 139 …:[i32] } GPR:{ :[i32] }:$rs2, 4294967295:{ :[i32] })), 4294967295:{ :[i32] }) - Complexity = 23 145 …:[i32] } GPR:{ :[i32] }:$rs2, 4294967295:{ :[i32] })), 4294967295:{ :[i32] }) - Complexity = 23 152 …:[i64] } GPR:{ :[i64] }:$rs2, 4294967295:{ :[i64] })), 4294967295:{ :[i64] }) - Complexity = 23 166 …2] } GPR:{ :[i32] }:$rs2)<<P:Predicate_assertzexti32>>), 4294967295:{ :[i32] }) - Complexity = 19 [all …]
/external/libcxx/utils/google-benchmark/test/
D	complexity_test.cc	63 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(benchmark::o1); 64 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity(); 65 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->Complexity([](int64_t) { in __anon788c62540202() 116 ->Complexity(benchmark::oN); 120 ->Complexity([](int64_t n) -> double { return static_cast<double>(n); }); in __anon788c62540302() 124 ->Complexity(); 155 ->Complexity(benchmark::oNLogN); 159 ->Complexity([](int64_t n) { return kLog2E * n * log(static_cast<double>(n)); }); in __anon788c62540402() 163 ->Complexity();
/external/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/Mips/
D	MipsGenDAGISel.inc	74 …v, addrRegImm:{ :[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 54 82 …v, addrRegImm:{ :[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53 90 …v, addrRegImm:{ :[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53 98 …v, addrRegImm:{ :[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53 114 …se, iPTR:{ :[iPTR] }:$index))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 27 121 …se, iPTR:{ :[iPTR] }:$index))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 27 137 …v, addrRegImm:{ :[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53 145 …v, addrRegImm:{ :[iPTR] }:$a)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 53 161 …se, iPTR:{ :[iPTR] }:$index))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 27 168 …se, iPTR:{ :[iPTR] }:$index))<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 27 [all …]
/external/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/ARM/
D	ARMGenDAGISel.inc	87 …:[i32] } (srl:{ :[i32] } GPR:{ :[i32] }:$Rm, 8:{ :[i32] }), 255:{ :[i32] })) - Complexity = 35 95 …:[i32] } (srl:{ :[i32] } rGPR:{ :[i32] }:$Rm, 8:{ :[i32] }), 255:{ :[i32] })) - Complexity = 35 125 …:[i32] } (shl:{ :[i32] } GPR:{ :[i32] }:$Rm, 24:{ :[i32] }), 16:{ :[i32] })) - Complexity = 35 133 …:[i32] } (shl:{ :[i32] } rGPR:{ :[i32] }:$Rm, 24:{ :[i32] }), 16:{ :[i32] })) - Complexity = 35 160 …:$Rm, (imm:{ :[i32] })<<P:Predicate_pkh_lsl_amt>>:$sh), 4294901760:{ :[i32] })) - Complexity = 26 186 …32] }:$Rm, (imm:{ :[i32] })<<P:Predicate_pkh_asr_amt>>:$sh), 65535:{ :[i32] })) - Complexity = 26 205 …[i32] }:$src2, (imm:{ :[i32] })<<P:Predicate_imm1_15>>:$sh), 65535:{ :[i32] })) - Complexity = 26 232 …:$Rm, (imm:{ :[i32] })<<P:Predicate_pkh_lsl_amt>>:$sh), 4294901760:{ :[i32] })) - Complexity = 26 259 …32] }:$Rm, (imm:{ :[i32] })<<P:Predicate_pkh_asr_amt>>:$sh), 65535:{ :[i32] })) - Complexity = 26 278 …[i32] }:$src2, (imm:{ :[i32] })<<P:Predicate_imm1_15>>:$sh), 65535:{ :[i32] })) - Complexity = 26 [all …]
/external/cronet/stable/third_party/google_benchmark/src/test/
D	complexity_test.cc	90 ->Complexity(benchmark::o1); 91 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->UseManualTime()->Complexity(); 95 ->Complexity([](benchmark::IterationCount) { return 1.0; }); in __anonb0f94da10202() 140 ->Complexity(benchmark::oN); 145 ->Complexity(); 150 ->Complexity([](benchmark::IterationCount n) -> double { in __anonb0f94da10302() 198 ->Complexity(benchmark::oNLogN); 203 ->Complexity(); 208 ->Complexity([](benchmark::IterationCount n) { in __anonb0f94da10402() 256 ->Complexity(benchmark::oN)
/external/cronet/tot/third_party/google_benchmark/src/test/
D	complexity_test.cc	90 ->Complexity(benchmark::o1); 91 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->UseManualTime()->Complexity(); 95 ->Complexity([](benchmark::IterationCount) { return 1.0; }); in __anon1af13a3d0202() 140 ->Complexity(benchmark::oN); 145 ->Complexity(); 150 ->Complexity([](benchmark::IterationCount n) -> double { in __anon1af13a3d0302() 198 ->Complexity(benchmark::oNLogN); 203 ->Complexity(); 208 ->Complexity([](benchmark::IterationCount n) { in __anon1af13a3d0402() 256 ->Complexity(benchmark::oN)
/external/google-benchmark/test/
D	complexity_test.cc	90 ->Complexity(benchmark::o1); 91 BENCHMARK(BM_Complexity_O1)->Range(1, 1 << 18)->UseManualTime()->Complexity(); 95 ->Complexity([](benchmark::IterationCount) { return 1.0; }); in __anonafa4c47b0202() 140 ->Complexity(benchmark::oN); 145 ->Complexity(); 150 ->Complexity([](benchmark::IterationCount n) -> double { in __anonafa4c47b0302() 198 ->Complexity(benchmark::oNLogN); 203 ->Complexity(); 208 ->Complexity([](benchmark::IterationCount n) { in __anonafa4c47b0402() 256 ->Complexity(benchmark::oN)
/external/swiftshader/third_party/llvm-10.0/configs/common/lib/Target/PowerPC/
D	PPCGenDAGISel.inc	82 …Predicate_unindexedstore>><<P:Predicate_truncstore>><<P:Predicate_truncstorei8>> - Complexity = 421 99 …Predicate_unindexedstore>><<P:Predicate_truncstore>><<P:Predicate_truncstorei8>> - Complexity = 421 120 …redicate_unindexedstore>><<P:Predicate_truncstore>><<P:Predicate_truncstorei16>> - Complexity = 421 137 …redicate_unindexedstore>><<P:Predicate_truncstore>><<P:Predicate_truncstorei16>> - Complexity = 421 157 …), iaddrX4:{ :[iPTR] }:$src)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 421 167 …), xaddrX4:{ :[iPTR] }:$src)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 421 179 …}), xoaddr:{ :[iPTR] }:$src)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 421 194 …), iaddrX4:{ :[iPTR] }:$src)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 421 207 …), xaddrX4:{ :[iPTR] }:$src)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 421 222 …}), xoaddr:{ :[iPTR] }:$src)<<P:Predicate_unindexedstore>><<P:Predicate_store>> - Complexity = 421 [all …]
/external/libopus/silk/
D	control_codec.c	55 opus_int Complexity /* I / 309 opus_int Complexity / I */ in silk_setup_complexity() argument 315 celt_assert( Complexity >= 0 && Complexity <= 10 ); in silk_setup_complexity() 316 if( Complexity < 1 ) { in silk_setup_complexity() 326 } else if( Complexity < 2 ) { in silk_setup_complexity() 336 } else if( Complexity < 3 ) { in silk_setup_complexity() 346 } else if( Complexity < 4 ) { in silk_setup_complexity() 356 } else if( Complexity < 6 ) { in silk_setup_complexity() 366 } else if( Complexity < 8 ) { in silk_setup_complexity() 391 psEncC->Complexity = Complexity; in silk_setup_complexity()
/external/cronet/tot/third_party/libc++/src/test/benchmarks/
D	filesystem.bench.cpp	`35 …M_PathConstructString, large_string, getRandomStringInputs)->Range(8, TestNumInputs)->Complexity(); 81 ->Complexity(); 84 ->Complexity(); 104 ->Complexity(); 123 …M_PathIterateOnce, iterate_elements, getRandomStringInputs)->Range(8, TestNumInputs)->Complexity(); 168 ->Complexity(); 172 ->Complexity();`
/external/cronet/stable/third_party/libc++/src/test/benchmarks/
D	filesystem.bench.cpp	`35 …M_PathConstructString, large_string, getRandomStringInputs)->Range(8, TestNumInputs)->Complexity(); 81 ->Complexity(); 84 ->Complexity(); 104 ->Complexity(); 123 …M_PathIterateOnce, iterate_elements, getRandomStringInputs)->Range(8, TestNumInputs)->Complexity(); 168 ->Complexity(); 172 ->Complexity();`
/external/libcxx/benchmarks/
D	filesystem.bench.cpp	`24 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity(); 72 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity(); 74 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity(); 94 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity(); 115 getRandomStringInputs)->Range(8, TestNumInputs)->Complexity(); 159 getRandomPaths, /PathLen/5)->RangeMultiplier(2)->Range(2, 256)->Complexity(); 161 getRandomPaths, /PathLen/32)->RangeMultiplier(2)->Range(2, 256)->Complexity();`
/external/icu/android_icu4j/src/main/java/android/icu/impl/units/
D	MeasureUnitImpl.java	30 private MeasureUnit.Complexity complexity = MeasureUnit.Complexity.SINGLE; 133 if (this.getComplexity() == MeasureUnit.Complexity.MIXED) { in extractIndividualUnitsWithIndices() 195 if (this.singleUnits.size() > 1 && this.complexity == MeasureUnit.Complexity.SINGLE) { in appendSingleUnit() 196 this.setComplexity(MeasureUnit.Complexity.COMPOUND); in appendSingleUnit() 233 public MeasureUnit.Complexity getComplexity() { in getComplexity() 237 public void setComplexity(MeasureUnit.Complexity complexity) { in setComplexity() 252 if (this.complexity == MeasureUnit.Complexity.COMPOUND) { in serialize() 269 if (this.getComplexity() == MeasureUnit.Complexity.MIXED) { in serialize() 548 MeasureUnit.Complexity complexity = in parse() 549 … fSawAnd ? MeasureUnit.Complexity.MIXED : MeasureUnit.Complexity.COMPOUND; in parse() [all …]
/external/icu/icu4j/main/core/src/main/java/com/ibm/icu/impl/units/
D	MeasureUnitImpl.java	26 private MeasureUnit.Complexity complexity = MeasureUnit.Complexity.SINGLE; 129 if (this.getComplexity() == MeasureUnit.Complexity.MIXED) { in extractIndividualUnitsWithIndices() 191 if (this.singleUnits.size() > 1 && this.complexity == MeasureUnit.Complexity.SINGLE) { in appendSingleUnit() 192 this.setComplexity(MeasureUnit.Complexity.COMPOUND); in appendSingleUnit() 229 public MeasureUnit.Complexity getComplexity() { in getComplexity() 233 public void setComplexity(MeasureUnit.Complexity complexity) { in setComplexity() 248 if (this.complexity == MeasureUnit.Complexity.COMPOUND) { in serialize() 265 if (this.getComplexity() == MeasureUnit.Complexity.MIXED) { in serialize() 529 MeasureUnit.Complexity complexity = in parse() 530 … fSawAnd ? MeasureUnit.Complexity.MIXED : MeasureUnit.Complexity.COMPOUND; in parse() [all …]
/external/sdv/vsomeip/third_party/boost/fusion/doc/
D	algorithm.qbk	`87 [heading Complexity] 126 [heading Complexity] 172 [heading Complexity] 208 [heading Complexity] 295 [heading Complexity] 367 [heading Complexity] 430 [heading Complexity] 489 [heading Complexity] 539 [heading Complexity] 588 [heading Complexity] [all …]`
/external/sdv/vsomeip/third_party/boost/icl/doc/
D	implementation.qbk	77 [section Complexity] 79 [h4 Complexity of element containers] 86 [h4 Complexity of interval containers] 104 [h5 Time Complexity of Addition] 117 [table Time Complexity of Addition: 169 [endsect][/ Complexity] 205 [h5 Time Complexity of infix `operators o`]
D	functions_insertion.qbk	68 [table Time Complexity for member function insert on icl containers 86 [table Time Complexity for inplace insertion on element containers 95 [table Time Complexity for inplace insertion on interval containers 132 [table Time Complexity for member function `set`
D	functions_symmetric_difference.qbk	`73 [table Time Complexity for member functions flip on icl containers 99 Complexity characteristics for inplace operators 107 [table Time Complexity for inplace symmetric difference on element containers 113 [table Time Complexity for inplace symmetric difference on interval containers`
D	functions_subtraction.qbk	`69 [table Time Complexity for function subtract on icl containers 120 Complexity characteristics for inplace subtraction operations are 127 [table Time Complexity for inplace Subtraction on element containers 134 [table Time Complexity for inplace Subtraction on interval containers`
D	functions_erasure.qbk	`53 [table Time Complexity for erasure of elements and segments on icl containers 100 Complexity characteristics for inplace erasure operations are 107 [table Time Complexity for inplace erasure on element containers 114 [table Time Complexity for inplace erasure on interval containers`
D	functions_containedness.qbk	`83 [#complexities_contains] Complexity characteristics for function 91 [table Time Complexity for function contains on element containers 99 [table Time Complexity for functions contains and within on interval containers`
/external/sdv/vsomeip/third_party/boost/spirit/doc/
D	outline.txt	`80 Expression \| Semantics \| Return type \| Complexity 94 Expression \| Semantics \| Return type \| Complexity`
/external/sdv/vsomeip/third_party/boost/mpl/doc/src/refmanual/
D	c_str.rst	`84 Complexity chapter 88 \| Sequence archetype \| Complexity \|`
D	at_c.rst	`74 Complexity chapter 78 \| Sequence archetype \| Complexity \|`
/external/sdv/vsomeip/third_party/boost/spirit/doc/qi/
D	operator.qbk	`104 [heading Complexity] 169 [heading Complexity] 232 [heading Complexity] 337 [heading Complexity] 401 [heading Complexity] 469 [heading Complexity] 530 [heading Complexity] 587 [heading Complexity] 663 [heading Complexity] 727 [heading Complexity] [all …]`

12 3 4 5 6 7 8 9 10 >>...15

art
bionic
bootable
build
cts
dalvik
developers
development
device
external
frameworks
hardware
kernel
libcore
libnativehelper
packages
pdk
platform_testing
prebuilts
sdk
system
test
toolchain
tools
trusty