| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/x86/ |
| temporal_filter_apply_sse2.asm | 96 punpcklbw xmm2, xmm7 ; pred[ 0- 7]
97 punpckhbw xmm3, xmm7 ; pred[ 8-15]
100 psubw xmm0, xmm2 ; src - pred[ 0- 7]
101 psubw xmm1, xmm3 ; src - pred[ 8-15]
144 lea rdx, [rdx + 16*1] ; pred += 16*(sizeof(char))
146 punpcklbw xmm0, xmm7 ; pred[ 0- 7]
147 punpckhbw xmm1, xmm7 ; pred[ 8-15]
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/x86/ |
| vp9_temporal_filter_apply_sse2.asm | 96 punpcklbw xmm2, xmm7 ; pred[ 0- 7]
97 punpckhbw xmm3, xmm7 ; pred[ 8-15]
100 psubw xmm0, xmm2 ; src - pred[ 0- 7]
101 psubw xmm1, xmm3 ; src - pred[ 8-15]
144 lea rdx, [rdx + 16*1] ; pred += 16*(sizeof(char))
146 punpcklbw xmm0, xmm7 ; pred[ 0- 7]
147 punpckhbw xmm1, xmm7 ; pred[ 8-15]
|
| /external/libavc/encoder/ |
| ih264e_mc.c | 89 * to pred buffer. In this case the function returns pointer and stride of the
90 * ref. buffer and this info is used in place of pred buffer else where.
91 * In other cases, the pred buffer is populated via copy / filtering + copy
101 * pseudo pred buffer stride
124 /* pred buffer ptr */
130 /* pred buffer stride */
234 /* update pred buff ptr */
246 /* to pred buffer. We might as well send the reference frame buffer */
247 /* pointer as pred buffer (ofc with updated stride) to fwd transform*/
303 /* pred buffer ptr *
[all...] |
| /external/libcxx/test/std/containers/sequences/list/list.ops/ |
| remove_if.pass.cpp | 12 // template <class Pred> void remove_if(Pred pred);
|
| /external/llvm/test/CodeGen/Hexagon/ |
| ifcvt-edge-weight.ll | 22 %cmp0 = call i1 @pred()
37 %cmp2 = call i1 @pred()
61 declare i1 @pred()
|
| /external/v8/src/compiler/ |
| frame-elider.cc | 97 for (auto pred : block->predecessors()) {
98 if (InstructionBlockAt(pred)->needs_frame() &&
99 (!InstructionBlockAt(pred)->IsDeferred() || block->IsDeferred())) {
|
| /frameworks/base/tools/aapt2/link/ |
| PrivateAttributeMover.cpp | 27 Predicate pred) {
29 auto newEnd = std::find_if(inputContainer.begin(), inputContainer.end(), pred);
40 if (bool(pred(*first))) {
|
| /art/compiler/optimizing/ |
| constant_folding_test.cc | 117 "BasicBlock 1, pred: 0, succ: 2\n"
120 "BasicBlock 2, pred: 1\n"
178 "BasicBlock 1, pred: 0, succ: 2\n"
181 "BasicBlock 2, pred: 1\n"
238 "BasicBlock 1, pred: 0, succ: 2\n"
241 "BasicBlock 2, pred: 1\n"
309 "BasicBlock 1, pred: 0, succ: 2\n"
314 "BasicBlock 2, pred: 1\n"
388 "BasicBlock 1, pred: 0, succ: 2\n"
391 "BasicBlock 2, pred: 1\n
[all...] |
| /external/webp/src/dsp/ |
| lossless.c | 138 const uint32_t pred = Average3(left, top[0], top[1]); local
139 return pred;
142 const uint32_t pred = Average2(left, top[-1]); local
143 return pred;
146 const uint32_t pred = Average2(left, top[0]); local
147 return pred;
150 const uint32_t pred = Average2(top[-1], top[0]); local
152 return pred;
155 const uint32_t pred = Average2(top[0], top[1]); local
157 return pred;
160 const uint32_t pred = Average4(left, top[-1], top[0], top[1]); local
164 const uint32_t pred = Select(top[0], left, top[-1]); local
168 const uint32_t pred = ClampedAddSubtractFull(left, top[0], top[-1]); local
172 const uint32_t pred = ClampedAddSubtractHalf(left, top[0], top[-1]); local
215 const uint32_t pred = pred_func(data[x - 1], data + x - width); local
223 const uint32_t pred = pred_func(data[x - 1], data + x - width); local
294 const uint32_t* pred = pred_row; local
[all...] |
| filters_mips_dsp_r2.c | 116 #define DO_PREDICT_LINE_VERTICAL(SRC, PRED, DST, LENGTH, INVERSE) do { \
118 const uint8_t* ppred = (uint8_t*)(PRED); \
130 "ulw %[temp2], 0(%[pred]) \n\t" \
132 "ulw %[temp4], 4(%[pred]) \n\t" \
141 "addiu %[pred], %[pred], 8 \n\t" \
152 "lbu %[temp2], 0(%[pred]) \n\t" \
154 "addiu %[pred], %[pred], 1 \n\t" \
168 [temp6]"=&r"(temp6), [temp7]"=&r"(temp7), [pred]"+&r"(ppred),
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| remove_copy_if.pass.cpp | 13 // Predicate<auto, InIter::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // remove_copy_if(InIter first, InIter last, OutIter result, Pred pred);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ |
| replace_copy_if.pass.cpp | 13 // Predicate<auto, InIter::value_type> Pred, class T>
16 // && CopyConstructible<Pred>
18 // replace_copy_if(InIter first, InIter last, OutIter result, Pred pred, const T& new_value);
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| equal_pred.pass.cpp | 13 // Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // equal(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred);
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| mismatch_pred.pass.cpp | 13 // Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // mismatch(Iter1 first1, Iter1 last1, Iter2 first2, Pred pred);
|
| /external/libcxx/test/std/thread/thread.condition/thread.condition.condvar/ |
| wait_for_pred.pass.cpp | 20 // Predicate pred);
28 class Pred
32 explicit Pred(int& i) : i_(i) {}
54 bool r = cv.wait_for(lk, milliseconds(250), Pred(test2));
|
| wait_until_pred.pass.cpp | 20 // Predicate pred);
45 class Pred
49 explicit Pred(int& i) : i_(i) {}
70 bool r = cv.wait_until(lk, t, Pred(test2));
|
| /external/libcxx/test/std/thread/thread.condition/thread.condition.condvarany/ |
| wait_for_pred.pass.cpp | 19 // Predicate pred);
27 class Pred
31 explicit Pred(int& i) : i_(i) {}
57 bool r = cv.wait_for(lk, milliseconds(250), Pred(test2));
|
| wait_until_pred.pass.cpp | 20 // Predicate pred);
45 class Pred
49 explicit Pred(int& i) : i_(i) {}
74 bool r = cv.wait_until(lk, t, Pred(test2));
|
| /external/libhevc/decoder/ |
| ihevcd_intra_pred_mode_prediction.h | 24 * Contains functions for intra pred mode prediction
|
| /external/llvm/include/llvm/Analysis/ |
| LazyValueInfo.h | 53 /// Pred is a CmpInst predicate.
54 Tristate getPredicateOnEdge(unsigned Pred, Value *V, Constant *C,
60 /// (from an assume intrinsic). Pred is a CmpInst predicate.
61 Tristate getPredicateAt(unsigned Pred, Value *V, Constant *C,
|
| /external/llvm/test/CodeGen/AMDGPU/ |
| predicates.ll | 7 ; CHECK: PRED_SET{{[EGN][ET]*}}_INT * Pred,
25 ; CHECK: PRED_SET{{[EGN][ET]*}}_INT * Pred,
52 ; CHECK: PRED_SET{{[EGN][ET]*}}_INT * Pred,
79 ; CHECK: PRED_SET{{[EGN][ET]*}}_INT * Pred,
|
| /external/llvm/test/CodeGen/ARM/ |
| 2014-01-09-pseudo_expand_implicit_reg.ll | 7 ; CHECK: VST1d64Q %R{{[0-9]+}}<kill>, 8, %D{{[0-9]+}}, pred:14, pred:%noreg, %Q{{[0-9]+}}_Q{{[0-9]+}}<imp-use,kill>
40 ; CHECK: VTBX4 {{.*}}, pred:14, pred:%noreg, %Q{{[0-9]+}}_Q{{[0-9]+}}<imp-use>
|
| subreg-remat.ll | 8 ; %vreg6:ssub_0<def> = VLDRS <cp#0>, 0, pred:14, pred:%noreg; mem:LD4[ConstantPool] DPR_VFP2:%vreg6
34 ; %vreg2:ssub_0<def> = VLDRS <cp#0>, 0, pred:14, pred:%noreg, %vreg2<imp-def>; mem:LD4[ConstantPool]
|
| /external/llvm/test/CodeGen/Thumb2/ |
| 2010-06-14-NEONCoalescer.ll | 8 ; 140 %reg1038:dsub_0<def> = VMOVD %reg1047:dsub_0, pred:14, pred:%reg0
9 ; 148 %reg1038:dsub_1<def> = VMOVD %reg1047:dsub_0, pred:14, pred:%reg0
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
| remove_copy_if.pass.cpp | 13 // Predicate<auto, InIter::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // remove_copy_if(InIter first, InIter last, OutIter result, Pred pred);
|
