/toolchain/binutils/binutils-2.25/gas/testsuite/gas/ia64/ |
pred-rel.s | 1 // Make sure all forms of .pred.rel are accepted 3 .pred.rel "mutex", p1, p2 4 .pred.rel "imply", p2, p3 5 .pred.rel "clear", p1, p2, p3 7 .pred.rel "mutex" p1, p2 8 .pred.rel "imply" p2, p3 9 .pred.rel "clear" p1, p2, p3 11 .pred.rel.mutex p1, p2 12 .pred.rel.imply p2, p3 13 .pred.rel.clear p1, p2, p [all...] |
dv-safe.s | 7 .pred.safe_across_calls p1-p4 8 .pred.safe_across_calls p1,p2,p3,p4 9 .pred.safe_across_calls p1-p2,p3-p4 10 .pred.safe_across_calls p1-p3,p4
|
/toolchain/binutils/binutils-2.25/libiberty/ |
insque.c | 7 struct qelem *@var{pred}) 12 after @var{pred}. The @code{remque} routine removes @var{elem} from 37 insque (struct qelem *elem, struct qelem *pred) 39 elem -> q_forw = pred -> q_forw; 40 pred -> q_forw -> q_back = elem; 41 elem -> q_back = pred; 42 pred -> q_forw = elem;
|
/external/libvpx/libvpx/vp8/common/ |
reconintra4x4.c | 24 static intra_pred_fn pred[10]; variable 27 pred[B_DC_PRED] = vpx_dc_predictor_4x4; 28 pred[B_TM_PRED] = vpx_tm_predictor_4x4; 29 pred[B_VE_PRED] = vpx_ve_predictor_4x4; 30 pred[B_HE_PRED] = vpx_he_predictor_4x4; 31 pred[B_LD_PRED] = vpx_d45e_predictor_4x4; 32 pred[B_RD_PRED] = vpx_d135_predictor_4x4; 33 pred[B_VR_PRED] = vpx_d117_predictor_4x4; 34 pred[B_VL_PRED] = vpx_d63e_predictor_4x4; 35 pred[B_HD_PRED] = vpx_d153_predictor_4x4 [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
is_partitioned.pass.cpp | 14 // is_partitioned(InputIterator first, InputIterator last, Predicate pred); 31 unary_counting_predicate<is_odd, int> pred((is_odd())); 34 std::ref(pred))); 35 assert(static_cast<std::ptrdiff_t>(pred.count()) <= 40 unary_counting_predicate<is_odd, int> pred((is_odd())); 43 std::ref(pred))); 44 assert(static_cast<std::ptrdiff_t>(pred.count()) <= 49 unary_counting_predicate<is_odd, int> pred((is_odd())); 52 std::ref(pred))); 53 assert(static_cast<std::ptrdiff_t>(pred.count()) < [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
is_partitioned.pass.cpp | 14 // is_partitioned(InputIterator first, InputIterator last, Predicate pred); 31 unary_counting_predicate<is_odd, int> pred((is_odd())); 34 std::ref(pred))); 35 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia))); 39 unary_counting_predicate<is_odd, int> pred((is_odd())); 42 std::ref(pred))); 43 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia))); 47 unary_counting_predicate<is_odd, int> pred((is_odd())); 50 std::ref(pred))); 51 assert(pred.count() <= std::distance(std::begin(ia), std::end(ia))) [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
HasPositionalPredChecker.java | 92 * @param pred The predicate object. 95 public boolean visitPredicate(ExpressionOwner owner, Expression pred) 101 if((pred instanceof Variable) || 102 (pred instanceof XNumber) || 103 (pred instanceof Div) || 104 (pred instanceof Plus) || 105 (pred instanceof Minus) || 106 (pred instanceof Mod) || 107 (pred instanceof Quo) || 108 (pred instanceof Mult) | [all...] |
/external/google-breakpad/src/testing/gtest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/googletest/googletest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/libvpx/libvpx/third_party/googletest/src/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/llvm/utils/unittest/googletest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/mesa3d/src/gtest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/protobuf/gtest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 108 #define GTEST_PRED1_(pred, v1, on_failure)\ 109 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 111 pred, \ [all...] |
/external/swiftshader/third_party/LLVM/utils/unittest/googletest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/v8/testing/gtest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/vulkan-validation-layers/tests/gtest-1.7.0/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/prebuilts/ndk/r11/sources/third_party/googletest/googletest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/prebuilts/ndk/r13/sources/third_party/googletest/googletest/include/gtest/ |
gtest_pred_impl.h | 58 // ASSERT_PRED1(pred, v1) 59 // ASSERT_PRED2(pred, v1, v2) 62 // where pred is an n-ary function or functor that returns bool, 85 template <typename Pred, 89 Pred pred, 91 if (pred(v1)) return AssertionSuccess(); 106 #define GTEST_PRED1_(pred, v1, on_failure)\ 107 GTEST_ASSERT_(::testing::AssertPred1Helper(#pred, \ 109 pred, \ [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
make_heap_comp.pass.cpp | 48 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); 51 std::make_heap(ia, ia+N, std::ref(pred)); 52 assert(pred.count() <= 3u*N); 53 assert(std::is_heap(ia, ia+N, pred)); 58 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); 61 std::make_heap(ia, ia+N, std::ref(pred)); 62 assert(pred.count() <= 3u*N); 63 assert(std::is_heap(ia, ia+N, pred)); 68 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); 70 std::make_heap(ia, ia+N, std::ref(pred)); [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
make_heap_comp.pass.cpp | 48 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); 51 std::make_heap(ia, ia+N, std::ref(pred)); 52 assert(pred.count() <= 3*N); 53 assert(std::is_heap(ia, ia+N, pred)); 58 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); 61 std::make_heap(ia, ia+N, std::ref(pred)); 62 assert(pred.count() <= 3*N); 63 assert(std::is_heap(ia, ia+N, pred)); 68 binary_counting_predicate<std::greater<int>, int, int> pred ((std::greater<int>())); 70 std::make_heap(ia, ia+N, std::ref(pred)); [all...] |
/external/libvpx/libvpx/vpx_dsp/ |
subtract.c | 21 ptrdiff_t src_stride, const uint8_t *pred, 26 for (c = 0; c < cols; c++) diff[c] = src[c] - pred[c]; 29 pred += pred_stride; 41 uint16_t *pred = CONVERT_TO_SHORTPTR(pred8); local 46 diff[c] = src[c] - pred[c]; 50 pred += pred_stride;
|
/external/libvpx/libvpx/vpx_dsp/x86/ |
avg_pred_sse2.c | 17 void vpx_comp_avg_pred_sse2(uint8_t *comp, const uint8_t *pred, int width, 19 /* comp and pred must be 16 byte aligned. */ 21 assert(((intptr_t)pred & 0xf) == 0); 26 const __m128i p = _mm_load_si128((const __m128i *)(pred + x)); 32 pred += width; 37 // Process 16 elements at a time. comp and pred have width == stride and 41 const __m128i p = _mm_load_si128((const __m128i *)pred); 65 pred += 16;
|
/frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
get_pred_outside.cpp | 98 (comp[]) are calculed from the motion compensated prediction (pred[])values and 256 uint8 pred[256]; /* storage for padded pixel values, 16x16 */ local 275 ptr = pred + (8 << 4) + 8; 280 ptr = pred; 281 prev = pred + (8 << 4) + 8; 285 ptr = pred + 8; 286 prev = pred + (8 << 4) + 8; 290 ptr = pred + (8 << 4); 291 prev = pred + (8 << 4) + 8; 295 ptr = pred + (((ypos >> 1) + 8) << 4) + (xpos >> 1) + 8 [all...] |
/external/libvpx/libvpx/vpx_dsp/arm/ |
subtract_neon.c | 18 ptrdiff_t src_stride, const uint8_t *pred, 27 const uint8x16_t v_pred_00 = vld1q_u8(&pred[c + 0]); 28 const uint8x16_t v_pred_16 = vld1q_u8(&pred[c + 16]); 43 pred += pred_stride; 49 const uint8x16_t v_pred = vld1q_u8(&pred[0]); 57 pred += pred_stride; 63 const uint8x8_t v_pred = vld1_u8(&pred[0]); 67 pred += pred_stride; 72 for (c = 0; c < cols; ++c) diff[c] = src[c] - pred[c]; 75 pred += pred_stride [all...] |
/external/clang/test/Analysis/ |
unix-fns.c | 61 dispatch_once_t pred = 0; local 62 do { if (__builtin_expect(*(&pred), ~0l) != ~0l) dispatch_once((&pred), (^() {})); } while (0); // expected-warning{{Call to 'dispatch_once' uses the local variable 'pred' for the predicate value}} 65 static dispatch_once_t pred = 0; local 66 do { if (__builtin_expect(*(&pred), ~0l) != ~0l) dispatch_once((&pred), (^() {})); } while (0); // no-warning 72 pthread_once_t pred = {0x30B1BCBA, {0}}; local 73 pthread_once(&pred, test_pthread_once_aux); // expected-warning{{Call to 'pthread_once' uses the local variable 'pred' for the "control" value} 76 static pthread_once_t pred = {0x30B1BCBA, {0}}; local 183 dispatch_once_t pred = 0; local 199 static dispatch_once_t pred; local [all...] |