| /external/perfetto/src/trace_processor/ |
| D | query_constraints_unittest.cc | 33 QueryConstraints qc; in TEST() local
34 qc.AddConstraint(12, 0); in TEST()
36 QueryConstraints::SqliteString only_constraint = qc.ToNewSqlite3String(); in TEST()
41 ASSERT_EQ(qc, qc_constraint); in TEST()
43 qc.AddOrderBy(1, false); in TEST()
44 qc.AddOrderBy(21, true); in TEST()
46 QueryConstraints::SqliteString result = qc.ToNewSqlite3String(); in TEST()
50 ASSERT_EQ(qc, qc_result); in TEST()
54 QueryConstraints qc; in TEST() local
56 QueryConstraints::SqliteString string_result = qc.ToNewSqlite3String(); in TEST()
[all …]
|
| D | slice_table.cc | 51 int SliceTable::BestIndex(const QueryConstraints& qc, BestIndexInfo* info) { in BestIndex() argument
52 info->estimated_cost = EstimateCost(qc); in BestIndex()
59 for (size_t i = 0; i < qc.constraints().size(); i++) { in BestIndex()
60 auto col = static_cast<size_t>(qc.constraints()[i].iColumn); in BestIndex()
67 uint32_t SliceTable::EstimateCost(const QueryConstraints& qc) { in EstimateCost() argument
69 if (HasEqConstraint(qc, "slice_id")) in EstimateCost()
72 auto eq_ts = HasEqConstraint(qc, "ts"); in EstimateCost()
73 auto eq_ref = HasEqConstraint(qc, "ref"); in EstimateCost()
74 auto eq_ref_type = HasEqConstraint(qc, "ref_type"); in EstimateCost()
75 auto eq_depth = HasEqConstraint(qc, "depth"); in EstimateCost()
[all …]
|
| D | counter_definitions_table.cc | 49 int CounterDefinitionsTable::BestIndex(const QueryConstraints& qc, in BestIndex() argument
51 info->estimated_cost = EstimateCost(qc); in BestIndex()
57 for (size_t i = 0; i < qc.constraints().size(); i++) { in BestIndex()
58 auto col = static_cast<size_t>(qc.constraints()[i].iColumn); in BestIndex()
65 uint32_t CounterDefinitionsTable::EstimateCost(const QueryConstraints& qc) { in EstimateCost() argument
68 if (HasEqConstraint(qc, "counter_id")) in EstimateCost()
71 auto eq_name = HasEqConstraint(qc, "name"); in EstimateCost()
72 auto eq_ref = HasEqConstraint(qc, "ref"); in EstimateCost()
73 auto eq_ref_type = HasEqConstraint(qc, "ref_type"); in EstimateCost()
|
| D | window_operator_table.cc | 60 int WindowOperatorTable::BestIndex(const QueryConstraints& qc, in BestIndex() argument
64 if (qc.order_by().size() == 1 && qc.order_by()[0].iColumn == Column::kTs && in BestIndex()
65 !qc.order_by()[0].desc) { in BestIndex()
98 int WindowOperatorTable::Cursor::Filter(const QueryConstraints& qc, in Filter() argument
109 bool return_first = qc.constraints().size() == 1 && in Filter()
110 qc.constraints()[0].iColumn == Column::kRowId && in Filter()
111 IsOpEq(qc.constraints()[0].op) && in Filter()
|
| D | counter_values_table.cc | 46 int CounterValuesTable::BestIndex(const QueryConstraints& qc, in BestIndex() argument
48 info->estimated_cost = EstimateCost(qc); in BestIndex()
51 for (size_t i = 0; i < qc.constraints().size(); i++) { in BestIndex()
58 uint32_t CounterValuesTable::EstimateCost(const QueryConstraints& qc) { in EstimateCost() argument
59 if (HasEqConstraint(qc, "counter_id")) in EstimateCost()
|
| D | thread_table.cc | 55 int ThreadTable::BestIndex(const QueryConstraints& qc, BestIndexInfo* info) { in BestIndex() argument
60 const auto& constraints = qc.constraints(); in BestIndex()
61 for (const auto& cs : qc.constraints()) { in BestIndex()
72 int ThreadTable::Cursor::Filter(const QueryConstraints& qc, in Filter() argument
80 for (size_t j = 0; j < qc.constraints().size(); j++) { in Filter()
81 const auto& cs = qc.constraints()[j]; in Filter()
98 for (const auto& ob : qc.order_by()) { in Filter()
|
| D | process_table.cc | 54 int ProcessTable::BestIndex(const QueryConstraints& qc, BestIndexInfo* info) { in BestIndex() argument
59 const auto& constraints = qc.constraints(); in BestIndex()
70 int ProcessTable::Cursor::Filter(const QueryConstraints& qc, in Filter() argument
77 for (size_t j = 0; j < qc.constraints().size(); j++) { in Filter()
78 const auto& cs = qc.constraints()[j]; in Filter()
94 for (const auto& ob : qc.order_by()) { in Filter()
|
| D | storage_table.cc | 35 const QueryConstraints& qc, in CreateBestRowIterator() argument
37 const auto& cs = qc.constraints(); in CreateBestRowIterator()
38 auto obs = RemoveRedundantOrderBy(cs, qc.order_by()); in CreateBestRowIterator()
158 bool StorageTable::HasEqConstraint(const QueryConstraints& qc, in HasEqConstraint() argument
164 const auto& cs = qc.constraints(); in HasEqConstraint()
171 int StorageTable::Cursor::Filter(const QueryConstraints& qc, in Filter() argument
173 iterator_ = table_->CreateBestRowIterator(qc, argv); in Filter()
|
| D | android_logs_table.cc | 47 int AndroidLogsTable::BestIndex(const QueryConstraints& qc, in BestIndex() argument
56 for (size_t i = 0; i < qc.constraints().size(); i++) { in BestIndex()
58 qc.constraints()[i].iColumn != static_cast<int>(tag_index) && in BestIndex()
59 qc.constraints()[i].iColumn != static_cast<int>(msg_index); in BestIndex()
|
| D | instants_table.cc | 50 int InstantsTable::BestIndex(const QueryConstraints& qc, BestIndexInfo* info) { in BestIndex() argument
58 for (size_t i = 0; i < qc.constraints().size(); i++) { in BestIndex()
60 qc.constraints()[i].iColumn != static_cast<int>(name_index) && in BestIndex()
61 qc.constraints()[i].iColumn != static_cast<int>(ref_type_index); in BestIndex()
|
| D | query_constraints.cc | 106 QueryConstraints qc; in FromString() local
119 qc.AddConstraint(col, op); in FromString()
131 qc.AddOrderBy(col, desc); in FromString()
135 return qc; in FromString()
|
| D | sched_slice_table.cc | 48 int SchedSliceTable::BestIndex(const QueryConstraints& qc, in BestIndex() argument
50 info->estimated_cost = EstimateQueryCost(qc); in BestIndex()
60 uint32_t SchedSliceTable::EstimateQueryCost(const QueryConstraints& qc) { in EstimateQueryCost() argument
61 const auto& cs = qc.constraints(); in EstimateQueryCost()
|
| D | span_join_operator_table.h | 157 int Initialize(const QueryConstraints& qc, sqlite3_value** argv);
227 int Filter(const QueryConstraints& qc, sqlite3_value** argv) override;
256 int BestIndex(const QueryConstraints& qc, BestIndexInfo* info) override;
279 const QueryConstraints& qc,
|
| D | span_join_operator_table.cc | 175 const QueryConstraints& qc, in ComputeSqlConstraintsForDefinition() argument
178 for (size_t i = 0; i < qc.constraints().size(); i++) { in ComputeSqlConstraintsForDefinition()
179 const auto& cs = qc.constraints()[i]; in ComputeSqlConstraintsForDefinition()
263 int SpanJoinOperatorTable::Cursor::Filter(const QueryConstraints& qc, in Filter() argument
265 int err = t1_.Initialize(qc, argv); in Filter()
269 err = t2_.Initialize(qc, argv); in Filter()
456 int SpanJoinOperatorTable::Query::Initialize(const QueryConstraints& qc, in Initialize() argument
460 table_->ComputeSqlConstraintsForDefinition(*defn_, qc, argv)); in Initialize()
|
| D | table.h | 86 virtual int Filter(const QueryConstraints& qc, sqlite3_value**) = 0;
225 const auto& qc = variable
227 return static_cast<TCursor*>(c)->Filter(qc, v);
279 virtual int BestIndex(const QueryConstraints& qc, BestIndexInfo* info) = 0;
|
| D | args_table.cc | 47 int ArgsTable::BestIndex(const QueryConstraints& qc, BestIndexInfo* info) { in BestIndex() argument
49 if (qc.constraints().size() == 1) { in BestIndex()
51 const auto& cs = qc.constraints().back(); in BestIndex()
|
| D | storage_table.h | 40 int Filter(const QueryConstraints& qc, sqlite3_value** argv) override;
70 std::unique_ptr<RowIterator> CreateBestRowIterator(const QueryConstraints& qc,
|
| /external/vogar/test/vogar/ |
| D | ScriptBuilderEscapingTest.java | 42 private final String qc; field in ScriptBuilderEscapingTest.SingleCharacterEscapeTest
46 this.qc = "\\" + c; in SingleCharacterEscapeTest()
47 setName("Escape '" + uc + "' as '" + qc + "'"); in SingleCharacterEscapeTest()
52 assertEquals(qc, ScriptBuilder.escape(uc)); in runTest()
53 assertEquals("a" + qc, ScriptBuilder.escape("a" + uc)); in runTest()
54 assertEquals(qc + "b", ScriptBuilder.escape(uc + "b")); in runTest()
55 assertEquals("a" + qc + "b", ScriptBuilder.escape("a" + uc + "b")); in runTest()
56 assertEquals(qc + "a" + qc + qc + qc + "b" + qc, in runTest()
|
| /external/libaom/libaom/av1/encoder/ |
| D | encodetxb.c | 103 static INLINE tran_low_t get_lower_coeff(tran_low_t qc) { in get_lower_coeff() argument
104 if (qc == 0) { in get_lower_coeff()
107 return qc > 0 ? qc - 1 : qc + 1; in get_lower_coeff()
110 static INLINE tran_low_t qcoeff_to_dqcoeff(tran_low_t qc, int coeff_idx, in qcoeff_to_dqcoeff() argument
113 int sign = qc < 0 ? -1 : 1; in qcoeff_to_dqcoeff()
117 return sign * ((abs(qc) * dqv) >> shift); in qcoeff_to_dqcoeff()
268 static INLINE int get_sign_bit_cost(tran_low_t qc, int coeff_idx, argument
272 const int sign = (qc < 0) ? 1 : 0;
324 static int get_coeff_cost(const tran_low_t qc, const int scan_idx, argument
329 const int is_nz = (qc != 0);
[all …]
|
| /external/ImageMagick/coders/ |
| D | flif.c | 405 *magick_restrict qc; in WriteFLIFImage() local
500 qc=pixels; in WriteFLIFImage()
503 *qc++=ScaleQuantumToChar(GetPixelRed(image,p)); in WriteFLIFImage()
504 *qc++=ScaleQuantumToChar(GetPixelGreen(image,p)); in WriteFLIFImage()
505 *qc++=ScaleQuantumToChar(GetPixelBlue(image,p)); in WriteFLIFImage()
507 *qc++=ScaleQuantumToChar(GetPixelAlpha(image,p)); in WriteFLIFImage()
509 *qc++=0xFF; in WriteFLIFImage()
|
| /external/syzkaller/vendor/golang.org/x/text/unicode/norm/ |
| D | maketables.go | 922 qc uint8
935 func f(qc uint8, cf bool, dec string) [2]formData {
936 return [2]formData{{qc, cf, dec}, {qc, cf, dec}}
939 func g(qc, qck uint8, cf, cfk bool, d, dk string) [2]formData {
940 return [2]formData{{qc, cf, d}, {qck, cfk, dk}}
959 qc, cf, d := f.quickCheck[MComposed], f.combinesForward, string(f.expandedDecomp)
963 if d == dk && qc == qck && cf == cfk {
964 s = fmt.Sprintf("f(%s, %v, %q)", qc, cf, d)
966 s = fmt.Sprintf("g(%s, %s, %v, %v, %q, %q)", qc, qck, cf, cfk, d, dk)
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/NewGVN/ |
| D | non-local-offset.ll | 55 %qc = bitcast i32* %q to i64*
57 store i64 %t64, i64* %qc
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/GVN/ |
| D | non-local-offset.ll | 55 %qc = bitcast i32* %q to i64*
57 store i64 %t64, i64* %qc
|
| /external/swiftshader/third_party/LLVM/test/Transforms/GVN/ |
| D | non-local-offset.ll | 55 %qc = bitcast i32* %q to i64*
57 store i64 %t64, i64* %qc
|
| /external/llvm/test/Transforms/GVN/ |
| D | non-local-offset.ll | 55 %qc = bitcast i32* %q to i64*
57 store i64 %t64, i64* %qc
|