| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pairing_heap_/ |
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
62 node_pointer p_out = base_type::prune(pred);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 108 template<typename Pred>
111 prune(Pred pred)
119 if (pred(p_cur->m_value))
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/pairing_heap_/ |
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
62 node_pointer p_out = base_type::prune(pred);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 108 template<typename Pred>
111 prune(Pred pred)
119 if (pred(p_cur->m_value))
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/pairing_heap_/ |
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
62 node_pointer p_out = base_type::prune(pred);
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 108 template<typename Pred>
111 prune(Pred pred)
119 if (pred(p_cur->m_value))
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pairing_heap_/ |
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
60 node_pointer p_out = base_type::prune(pred);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 108 template<typename Pred>
111 prune(Pred pred)
119 if (pred(p_cur->m_value))
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/pairing_heap_/ |
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
62 node_pointer p_out = base_type::prune(pred);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 108 template<typename Pred>
111 prune(Pred pred)
119 if (pred(p_cur->m_value))
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/pairing_heap_/ |
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
60 node_pointer p_out = base_type::prune(pred);
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| erase_fn_imps.hpp | 108 template<typename Pred>
111 prune(Pred pred)
119 if (pred(p_cur->m_value))
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/pairing_heap_/ |
| split_join_fn_imps.hpp | 42 template<typename Pred>
45 split(Pred pred, PB_DS_CLASS_C_DEC& other)
60 node_pointer p_out = base_type::prune(pred);
|
| /external/chromium_org/third_party/libwebp/utils/ |
| filters.c | 33 static WEBP_INLINE void PredictLine(const uint8_t* src, const uint8_t* pred,
37 for (i = 0; i < length; ++i) dst[i] = src[i] + pred[i];
39 for (i = 0; i < length; ++i) dst[i] = src[i] - pred[i];
139 const int pred = GradientPredictor(preds[w - 1], local
142 out[w] = in[w] + (inverse ? pred : -pred);
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 82 inline const RootType& selectComplexRoot_withRespectToNorm( squaredNormBinaryPredicate& pred ) const
89 if( pred( currNorm2, norm2 ) ){
117 squaredRealPartBinaryPredicate& pred,
138 if( pred( currAbs2, abs2 ) )
157 RealPartBinaryPredicate& pred,
178 if( pred( curr, val ) )
|
| /external/webp/src/utils/ |
| filters.c | 33 static WEBP_INLINE void PredictLine(const uint8_t* src, const uint8_t* pred,
37 for (i = 0; i < length; ++i) dst[i] = src[i] + pred[i];
39 for (i = 0; i < length; ++i) dst[i] = src[i] - pred[i];
139 const int pred = GradientPredictor(preds[w - 1], local
142 out[w] = in[w] + (inverse ? pred : -pred);
|
| /libcore/luni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 357 Node pred = tail; local
358 if (pred != null) {
359 node.prev = pred;
360 if (compareAndSetTail(pred, node)) {
361 pred.next = node;
497 Node pred = node.prev; local
498 while (pred.waitStatus > 0)
499 node.prev = pred = pred.prev;
504 Node predNext = pred.next
[all...] |
| AbstractQueuedSynchronizer.java | 587 Node pred = tail; local
588 if (pred != null) {
589 node.prev = pred;
590 if (compareAndSetTail(pred, node)) {
591 pred.next = node;
727 Node pred = node.prev; local
728 while (pred.waitStatus > 0)
729 node.prev = pred = pred.prev;
734 Node predNext = pred.next
[all...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| idct.cpp | 345 int *blk, uint8 *pred, uint8 *dst, int width)
538 res = (*pred++ + block[0+(i<<3)]);
541 res = (*pred++ + block[1+(i<<3)]);
544 res = (*pred++ + block[2+(i<<3)]);
547 res = (*pred++ + block[3+(i<<3)]);
550 res = (*pred++ + block[4+(i<<3)]);
553 res = (*pred++ + block[5+(i<<3)]);
556 res = (*pred++ + block[6+(i<<3)]);
559 res = (*pred++ + block[7+(i<<3)]);
563 pred += 8
[all...] |
| /external/libvpx/libvpx/vp8/common/arm/armv6/ |
| idct_v6.asm | 17 ; void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch,
20 ; r1 unsigned char* pred
135 ldrb r0, [r1] ; pred p0
136 ldrb r11, [r1, #1] ; pred p1
137 ldrb r12, [r1, #2] ; pred p2
149 ldrb r11, [r1, #3] ; pred p3
165 ldrb r12, [r1, r2]! ; pred p4
167 ldrb r11, [r1, #1] ; pred p5
175 ldrb r7, [r1, #2] ; pred p6
176 ldrb r10, [r1, #3] ; pred p
[all...] |
| /external/libvpx/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]
|
| /external/libvpx/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]
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/ |
| fastidct.cpp | 340 pred_word = *((uint32*)(rec += lx)); /* read 4 bytes from pred */
354 pred_word = *((uint32*)(rec + 4)); /* read 4 bytes from pred */
399 pred_word = *((uint32*)(rec += lx)); /* read 4 bytes from pred */
413 pred_word = *((uint32*)(rec + 4)); /* read 4 bytes from pred */
468 pred_word = *((uint32*)(rec += lx)); /* read 4 bytes from pred */
482 pred_word = *((uint32*)(rec + 4)); /* read 4 bytes from pred */
544 pred_word = *((uint32*)(rec += lx)); /* read 4 bytes from pred */
558 pred_word = *((uint32*)(rec + 4)); /* read 4 bytes from pred */
602 pred_word = *((uint32*)(rec += lx)); /* read 4 bytes from pred */
616 pred_word = *((uint32*)(rec + 4)); /* read 4 bytes from pred */
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 101 const ExplodedNode *pred = *(node->pred_begin()); local
102 if (pred->succ_size() != 1)
125 ProgramStateRef pred_state = pred->getState();
127 progPoint.getLocationContext() != pred->getLocationContext())
165 ExplodedNode *pred = *(node->pred_begin()); local
167 pred->replaceSuccessor(succ);
168 succ->replacePredecessor(pred);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 457 Node<E> pred = null;
464 if (pred != null && next != null)
465 pred.casNext(p, next);
468 pred = p;
669 Node<E> pred, p; local
672 pred = null;
674 pred = nextNode;
692 if (pred != null && next != null)
693 pred.casNext(p, next);
|
