Home
last modified time | relevance | path

Searched refs:add1 (Results 1 – 20 of 20) sorted by relevance

/aosp12/art/libartbase/base/
H A Dtransform_iterator_test.cc75 std::copy(MakeTransformIterator(input.begin(), add1), in TEST()
76 MakeTransformIterator(input.end(), add1), in TEST()
81 std::copy(MakeTransformIterator(input.cbegin(), add1), in TEST()
82 MakeTransformIterator(input.cend(), add1), in TEST()
87 std::copy(MakeTransformIterator(input.rbegin(), add1), in TEST()
88 MakeTransformIterator(input.rend(), add1), in TEST()
93 std::copy(MakeTransformIterator(input.crbegin(), add1), in TEST()
94 MakeTransformIterator(input.crend(), add1), in TEST()
131 ASSERT_EQ(MakeTransformIterator(input.end(), add1) - MakeTransformIterator(input.begin(), add1), in TEST()
135 auto it = MakeTransformIterator(input.begin(), add1); in TEST()
[all …]
H A Dtransform_array_ref_test.cc40 auto add1 = [](const ValueHolder& h) { return h.value + 1; }; in TEST() local
44 auto taref = MakeTransformArrayRef(input, add1); in TEST()
H A Dintrusive_forward_list_test.cc724 auto add1 = [](const ValueType& value) { return value.value + 1; }; in ModifyValue() local
725 std::transform(ref.begin(), ref.end(), ref.begin(), add1); in ModifyValue()
726 std::transform(ifl.begin(), ifl.end(), ifl.begin(), add1); in ModifyValue()
/aosp12/art/compiler/optimizing/
H A Dscheduler_test.cc101 HInstruction* add1 = new (GetAllocator()) HAdd(DataType::Type::kInt32, c1, c2); in TestBuildDependencyGraphAndSchedule() local
107 new (GetAllocator()) HArrayGet(array, add1, DataType::Type::kInt32, 0); in TestBuildDependencyGraphAndSchedule()
111 new (GetAllocator()) HArrayGet(array, add1, DataType::Type::kInt32, 0); in TestBuildDependencyGraphAndSchedule()
119 HInstruction* block_instructions[] = {add1, in TestBuildDependencyGraphAndSchedule()
150 ASSERT_FALSE(scheduling_graph.HasImmediateDataDependency(add1, c1)); in TestBuildDependencyGraphAndSchedule()
154 ASSERT_TRUE(scheduling_graph.HasImmediateDataDependency(add2, add1)); in TestBuildDependencyGraphAndSchedule()
155 ASSERT_FALSE(scheduling_graph.HasImmediateDataDependency(add1, add2)); in TestBuildDependencyGraphAndSchedule()
157 ASSERT_FALSE(scheduling_graph.HasImmediateDataDependency(div_check, add1)); in TestBuildDependencyGraphAndSchedule()
159 ASSERT_TRUE(scheduling_graph.HasImmediateDataDependency(array_set1, add1)); in TestBuildDependencyGraphAndSchedule()
237 new (GetAllocator()) HArraySet(arr, add1, c0, DataType::Type::kInt32, 0); in TestDependencyGraphOnAliasingArrayAccesses()
[all …]
H A Dinduction_var_analysis_test.cc410 HInstruction* add1 = InsertInstruction( in TEST_F() local
415 new (GetAllocator()) HAdd(DataType::Type::kInt32, add1, add2), 0); in TEST_F()
419 EXPECT_STREQ("(((1) + (1)) * i + (0)):Int32", GetInductionInfo(add1, 0).c_str()); in TEST_F()
510 HInstruction* add1 = InsertInstruction( in TEST_F() local
513 new (GetAllocator()) HAdd(DataType::Type::kInt32, add1, k_header), 0); in TEST_F()
523 GetInductionInfo(add1, 0).c_str()); in TEST_F()
565 HInstruction* add1 = InsertInstruction( in TEST_F() local
583 EXPECT_STREQ("geo((1) * 2 ^ i + (1)):Int32", GetInductionInfo(add1, 0).c_str()); in TEST_F()
H A Dload_store_analysis_test.cc242 HInstruction* add1 = new (GetAllocator()) HAdd(DataType::Type::kInt32, index, c1); in TEST_F() local
252 new (GetAllocator()) HArraySet(array, add1, c0, DataType::Type::kInt32, 0); in TEST_F()
265 entry->AddInstruction(add1); in TEST_F()
/aosp12/frameworks/av/media/codecs/amrwb/enc/src/
H A Dqpisf_2s.c251 isf_q[i] = add1(isf_q[i], dico21_isf[indice[2] * 3 + i]); in Dpisf_2s_46b()
252 isf_q[i + 3] = add1(isf_q[i + 3], dico22_isf[indice[3] * 3 + i]); in Dpisf_2s_46b()
253 isf_q[i + 6] = add1(isf_q[i + 6], dico23_isf[indice[4] * 3 + i]); in Dpisf_2s_46b()
254 isf_q[i + 9] = add1(isf_q[i + 9], dico24_isf[indice[5] * 3 + i]); in Dpisf_2s_46b()
259 isf_q[i + 12] = add1(isf_q[i + 12], dico25_isf[indice[6] * 4 + i]); in Dpisf_2s_46b()
265 isf_q[i] = add1(tmp, mean_isf[i]); in Dpisf_2s_46b()
266 isf_q[i] = add1(isf_q[i], vo_mult(MU, past_isfq[i])); in Dpisf_2s_46b()
344 isf_q[i] = add1(isf_q[i], dico21_isf_36b[indice[2] * 5 + i]); in Dpisf_2s_36b()
348 isf_q[i + 5] = add1(isf_q[i + 5], dico22_isf_36b[indice[3] * 4 + i]); in Dpisf_2s_36b()
358 isf_q[i] = add1(tmp, mean_isf[i]); in Dpisf_2s_36b()
[all …]
H A Dwb_vad.c68 res = add1(res, (ex2 << 6)); in ilog2()
69 res = vo_sub(add1(res, 127), (mant >> 8)); in ilog2()
90 temp1 = add1(data[0], vo_mult(COEFF5_1, temp0)); in filter5()
94 temp2 = add1(data[1], vo_mult(COEFF5_2, temp0)); in filter5()
118 temp2 = add1(*data, vo_mult(COEFF3, temp1)); in filter3()
304 stat_rat = add1(stat_rat, shr(temp, (8 - exp))); in update_cntrl()
435 st->bckr_est[i] = add1(bckr_add, add1(st->bckr_est[i],vo_mult_r(alpha_up, temp))); in noise_estimate_update()
509 temp = add1(vo_mult(NO_SLOPE, (ilog2_noise_level - NO_P1)), THR_HIGH); in vad_decision()
511 temp2 = add1(SP_CH_MIN, vo_mult(SP_SLOPE, (ilog2_speech_level - SP_P1))); in vad_decision()
546 hang_len = add1(vo_mult(HANG_SLOPE, (vad_thr - HANG_P1)), HANG_HIGH); in vad_decision()
[all …]
H A Dq_pulse.c69 index = L_deposit_l(add1((((Word16) (pos1 & mask)) << N), ((Word16) (pos2 & mask)))); in quant_2p_2N1()
73 index = L_deposit_l(add1((((Word16) (pos2 & mask)) << N), ((Word16) (pos1 & mask)))); in quant_2p_2N1()
86 index = L_deposit_l(add1((((Word16) (pos2 & mask)) << N), ((Word16) (pos1 & mask)))); in quant_2p_2N1()
95 index = L_deposit_l(add1((((Word16) (pos1 & mask)) << N), ((Word16) (pos2 & mask)))); in quant_2p_2N1()
223 tmp = add1((Word16)((vo_L_mult(3, n_1) >> 1)), 1); in quant_4p_4N()
283 … tmp = add1((N << 1), 1); /* index += quant_3p_3N1(posB[0], posB[1], posB[2], n_1) << ((2*N)+1);*/ in quant_5p_5N()
291 …tmp = add1((N << 1), 1); /* index += quant_3p_3N1(posB[0], posB[1], posB[2], n_1) <<((2*N)+1); … in quant_5p_5N()
299 …tmp = add1((N << 1), 1); /* index += quant_3p_3N1(posB[0], posB[1], posB[2], n_1) << ((2… in quant_5p_5N()
305 …tmp = add1((N << 1), 1); /* index = quant_3p_3N1(posA[0], posA[1], posA[2], n_1) << ((2*… in quant_5p_5N()
310 …tmp = add1((N << 1), 1); /* index = quant_3p_3N1(posA[0], posA[1], posA[2], n_1) << ((2*… in quant_5p_5N()
[all …]
H A Dc2t64fx.c82 s = L_shl(s, add1(exp, 5)); in ACELP_2t64_fx()
242 ps2 = add1(ps1, dn[i1]); in ACELP_2t64_fx()
243 alp2 = add1(alp1, add1(*p1++, *p2++)); in ACELP_2t64_fx()
291 *index = add1((i0 << 6), i1); in ACELP_2t64_fx()
294 y[i] = vo_shr_r(add1((*p0++), (*p1++)), 3); in ACELP_2t64_fx()
H A Dc4t64fx.c610 ps = add1(add1(add1(dn[ix], dn[iy]), dn[i]), dn[j]); in ACELP_4t64_fx()
636 vec[i] = add1(add1(add1(*p0++, *p1++), *p2++), *p3++); in ACELP_4t64_fx()
697 vec[i] += add1((*p0++), (*p1++)); in ACELP_4t64_fx()
698 vec[i+1] += add1((*p0++), (*p1++)); in ACELP_4t64_fx()
699 vec[i+2] += add1((*p0++), (*p1++)); in ACELP_4t64_fx()
700 vec[i+3] += add1((*p0++), (*p1++)); in ACELP_4t64_fx()
1024 ps2 = add1(ps1, dn[y]); in search_ixiy()
1052 *ps = add1(*ps, add1(dn[*ix], dn[*iy])); in search_ixiy()
H A Disp_isf.c54 isf[i] = add1(isf[i], (ind << 7)); in Isp_isf()
83 isp[i] = add1(table[ind], (Word16)((L_tmp >> 8))); in Isf_isp()
H A Dvoicefac.c77 ener1 = add1(add1(ener1, ener2), 1); in voice_factor()
H A Daz_isp.c95 f2[i] = add1(f2[i], f2[i - 2]); in Az_isp()
H A Dq_gain2.c266 j = add1(vo_sub(e_max, exp_max[i]), 2);/* /4 to avoid overflow */ in Q_gain2()
H A Dpitch_f4.c261 excf[i] = add1(vo_mult(tmp, h[i]), excf[i - 1]); in Norm_Corr()
H A DvoAMRWBEnc.c1481 tmp = add1(tmp, vo_mult(weight2, gain2)); in synthesis()
1539 …HP_corr_gain = add1(vo_mult(HP_calc_gain, st->gain_alpha), vo_mult((32767 - st->gain_alpha), HP_es… in synthesis()
/aosp12/frameworks/compile/libbcc/tests/libbcc/
H A Dtbaa.ll25 define i32 @add1(i32 %in) #0 {
47 !4 = !{!"add1"}
/aosp12/packages/apps/Launcher3/quickstep/src/com/android/launcher3/taskbar/
H A DTaskbarModelCallbacks.java81 boolean add1 = handleItemsAdded(addNotAnimated); in bindAppsAdded()
83 if (add1 || add2) { in bindAppsAdded()
/aosp12/frameworks/av/media/codecs/amrwb/enc/inc/
H A Dbasic_op.h46 #define add1(a,b) ((a) + (b)) macro