| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/arm/neon/ |
| vp8_memcpy_neon.asm | 24 ;pld [r1] ;preload pred data
50 ;pld [r1] ;preload pred data -- need to adjust for real device
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.min.max/ |
| max_element_comp.pass.cpp | 61 template <class Iter, class Pred>
62 void test_eq0(Iter first, Iter last, Pred p)
|
| min_element_comp.pass.cpp | 61 template <class Iter, class Pred>
62 void test_eq0(Iter first, Iter last, Pred p)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-dynload/ |
| future_builtins.so | |
| /external/webp/src/dsp/ |
| lossless_sse2.c | 117 const uint32_t pred = Average3(left, top[0], top[1]); local
118 return pred;
121 const uint32_t pred = Average2(left, top[-1]); local
122 return pred;
125 const uint32_t pred = Average2(left, top[0]); local
126 return pred;
129 const uint32_t pred = Average2(top[-1], top[0]); local
131 return pred;
134 const uint32_t pred = Average2(top[0], top[1]); local
136 return pred;
139 const uint32_t pred = Average4(left, top[-1], top[0], top[1]); local
143 const uint32_t pred = Select(top[0], left, top[-1]); local
147 const uint32_t pred = ClampedAddSubtractFull(left, top[0], top[-1]); local
151 const uint32_t pred = ClampedAddSubtractHalf(left, top[0], top[-1]); local
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_reconintra.c | 59 static intra_pred_fn pred[INTRA_MODES][TX_SIZES]; variable
77 INIT_ALL_SIZES(pred[V_PRED], v);
78 INIT_ALL_SIZES(pred[H_PRED], h);
79 INIT_ALL_SIZES(pred[D207_PRED], d207);
80 INIT_ALL_SIZES(pred[D45_PRED], d45);
81 INIT_ALL_SIZES(pred[D63_PRED], d63);
82 INIT_ALL_SIZES(pred[D117_PRED], d117);
83 INIT_ALL_SIZES(pred[D135_PRED], d135);
84 INIT_ALL_SIZES(pred[D153_PRED], d153);
85 INIT_ALL_SIZES(pred[TM_PRED], tm)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| FlattenCFG.cpp | 138 BasicBlock *Pred = *PI;
139 BranchInst *PBI = dyn_cast<BranchInst>(Pred->getTerminator());
145 BasicBlock *PP = Pred->getSinglePredecessor();
148 // Case 1: Pred (BB3) is an unconditional block, it should
154 Pred->hasAddressTaken())
157 UnCondBlock = Pred;
173 if (Pred->hasAddressTaken())
178 for (BasicBlock::iterator BI = Pred->begin(), BE = PBI->getIterator();
189 FirstCondBlock = Pred;
208 LastCondBlock = Pred;
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/ |
| vp9_reconintra.c | 286 static intra_pred_fn pred[INTRA_MODES][4]; variable
296 intra_pred_allsizes(pred[V_PRED], v);
297 intra_pred_allsizes(pred[H_PRED], h);
298 intra_pred_allsizes(pred[D207_PRED], d207);
299 intra_pred_allsizes(pred[D45_PRED], d45);
300 intra_pred_allsizes(pred[D63_PRED], d63);
301 intra_pred_allsizes(pred[D117_PRED], d117);
302 intra_pred_allsizes(pred[D135_PRED], d135);
303 intra_pred_allsizes(pred[D153_PRED], d153);
304 intra_pred_allsizes(pred[TM_PRED], tm)
[all...] |
| /external/libcxx/include/ext/ |
| hash_map | 21 template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
30 typedef Pred key_equal;
96 template <class Key, class T, class Hash, class Pred, class Alloc>
97 void swap(hash_map<Key, T, Hash, Pred, Alloc>& x,
98 hash_map<Key, T, Hash, Pred, Alloc>& y);
100 template <class Key, class T, class Hash, class Pred, class Alloc>
102 operator==(const hash_map<Key, T, Hash, Pred, Alloc>& x,
103 const hash_map<Key, T, Hash, Pred, Alloc>& y);
105 template <class Key, class T, class Hash, class Pred, class Alloc>
107 operator!=(const hash_map<Key, T, Hash, Pred, Alloc>& x
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ext/ |
| hash_map | 21 template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
30 typedef Pred key_equal;
96 template <class Key, class T, class Hash, class Pred, class Alloc>
97 void swap(hash_map<Key, T, Hash, Pred, Alloc>& x,
98 hash_map<Key, T, Hash, Pred, Alloc>& y);
100 template <class Key, class T, class Hash, class Pred, class Alloc>
102 operator==(const hash_map<Key, T, Hash, Pred, Alloc>& x,
103 const hash_map<Key, T, Hash, Pred, Alloc>& y);
105 template <class Key, class T, class Hash, class Pred, class Alloc>
107 operator!=(const hash_map<Key, T, Hash, Pred, Alloc>& x
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/libcxx/include/ext/ |
| hash_map | 21 template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
30 typedef Pred key_equal;
96 template <class Key, class T, class Hash, class Pred, class Alloc>
97 void swap(hash_map<Key, T, Hash, Pred, Alloc>& x,
98 hash_map<Key, T, Hash, Pred, Alloc>& y);
100 template <class Key, class T, class Hash, class Pred, class Alloc>
102 operator==(const hash_map<Key, T, Hash, Pred, Alloc>& x,
103 const hash_map<Key, T, Hash, Pred, Alloc>& y);
105 template <class Key, class T, class Hash, class Pred, class Alloc>
107 operator!=(const hash_map<Key, T, Hash, Pred, Alloc>& x
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMInstrThumb.td | 285 def : tHintAlias<"nop$p", (tHINT 0, pred:$p)>; // A8.6.110
286 def : tHintAlias<"yield$p", (tHINT 1, pred:$p)>; // A8.6.410
287 def : tHintAlias<"wfe$p", (tHINT 2, pred:$p)>; // A8.6.408
288 def : tHintAlias<"wfi$p", (tHINT 3, pred:$p)>; // A8.6.409
289 def : tHintAlias<"sev$p", (tHINT 4, pred:$p)>; // A8.6.157
290 def : tInstAlias<"sevl$p", (tHINT 5, pred:$p)> {
394 (tSUBspi SP, t_imm0_508s4_neg:$imm, pred:$p)>;
396 (tSUBspi SP, t_imm0_508s4_neg:$imm, pred:$p)>;
400 (tADDspi SP, t_imm0_508s4:$imm, pred:$p)>;
402 (tSUBspi SP, t_imm0_508s4:$imm, pred:$p)>
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineSelect.cpp | 65 CmpInst::Predicate Pred = getCmpPredicateForMinMax(SPF);
66 assert(CmpInst::isIntPredicate(Pred));
67 return Builder->CreateSelect(Builder->CreateICmp(Pred, A, B), A, B);
339 ICmpInst::Predicate Pred = IC->getPredicate();
340 if ((Pred == ICmpInst::ICMP_NE && OrOnFalseVal) ||
341 (Pred == ICmpInst::ICMP_EQ && OrOnTrueVal))
361 ICmpInst::Predicate Pred = ICI->getPredicate();
371 if (Pred == ICmpInst::ICMP_NE)
407 ICmpInst::Predicate Pred = ICI->getPredicate();
418 switch (Pred) {
[all...] |
| /external/llvm/include/llvm/IR/ |
| PatternMatch.h | 705 CmpClass_match(PredicateTy &Pred, const LHS_t &LHS, const RHS_t &RHS)
706 : Predicate(Pred), L(LHS), R(RHS) {}
720 m_Cmp(CmpInst::Predicate &Pred, const LHS &L, const RHS &R) {
721 return CmpClass_match<LHS, RHS, CmpInst, CmpInst::Predicate>(Pred, L, R);
726 m_ICmp(ICmpInst::Predicate &Pred, const LHS &L, const RHS &R) {
727 return CmpClass_match<LHS, RHS, ICmpInst, ICmpInst::Predicate>(Pred, L, R);
732 m_FCmp(FCmpInst::Predicate &Pred, const LHS &L, const RHS &R) {
733 return CmpClass_match<LHS, RHS, FCmpInst, FCmpInst::Predicate>(Pred, L, R);
958 // Look for "(x pred y) ? x : y" or "(x pred y) ? y : x"
[all...] |
| /art/runtime/base/ |
| allocator.h | 170 class Pred = std::equal_to<Key>>
172 Key, T, Hash, Pred, TrackingAllocator<std::pair<const Key, T>, kTag>>;
179 class Pred = std::equal_to<Key>>
181 Key, T, EmptyFn, Hash, Pred, TrackingAllocator<std::pair<Key, T>, kTag>>;
|
| arena_containers.h | 66 typename Pred = std::equal_to<T>>
67 using ArenaHashSet = HashSet<T, EmptyFn, HashFn, Pred, ArenaAllocatorAdapter<T>>;
73 typename Pred = std::equal_to<Key>>
78 Pred,
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| ST.stg | 110 <if(alt.pred)>
111 if <alt.pred>:
123 <if(alt.pred)>if <alt.pred>:
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| partition.pass.cpp | 12 // template<BidirectionalIterator Iter, Predicate<auto, Iter::value_type> Pred>
14 // && CopyConstructible<Pred>
16 // partition(Iter first, Iter last, Pred pred);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy_pred.pass.cpp | 13 // EquivalenceRelation<auto, InIter::value_type> Pred>
17 // && CopyConstructible<Pred>
19 // unique_copy(InIter first, InIter last, OutIter result, Pred pred);
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end_pred.pass.cpp | 13 // Predicate<auto, Iter1::value_type, Iter2::value_type> Pred>
14 // requires CopyConstructible<Pred>
16 // find_end(Iter1 first1, Iter1 last1, Iter2 first2, Iter2 last2, Pred pred);
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| max_size.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| max_size.pass.cpp | 12 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
| /external/libvpx/config/mips32-dspr2/ |
| vp8_rtcd.h | 59 void vp8_dc_only_idct_add_c(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
60 void vp8_dc_only_idct_add_dspr2(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
139 void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
140 void vp8_short_idct4x4llm_dspr2(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
|
| /external/libvpx/libvpx/vp8/encoder/ |
| encodemb.h | 27 unsigned char *pred, int pred_stride);
|
| /external/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 60 SUnit &Pred = *I->getSUnit();
61 if (!Pred.isScheduled) {
64 if (OnlyAvailablePred && OnlyAvailablePred != &Pred)
66 OnlyAvailablePred = &Pred;
|
