/external/v8/test/mjsunit/regress/ |
H A D | regress-crbug-240032.js | 42 function cmp(o, f) { function 45 assertTrue(cmp(o, o.func)); 46 assertTrue(cmp(o, o.func)); 47 %OptimizeFunctionOnNextCall(cmp); 48 assertTrue(cmp(o, o.func));
|
/external/libnl/lib/route/cls/ematch/ |
H A D | cmp.c | 2 * lib/route/cls/ematch/cmp.c Simple packet data comparison ematch 36 static const char *align_txt(struct tcf_em_cmp *cmp) argument 38 switch (cmp->align) { 42 return (cmp->flags & TCF_EM_CMP_TRANS) ? "h16" : "u16"; 44 return (cmp->flags & TCF_EM_CMP_TRANS) ? "h32" : "u32"; 46 return (cmp->flags & TCF_EM_CMP_TRANS) ? "h?" : "u?"; 50 static const char *layer_txt(struct tcf_em_cmp *cmp) argument 52 switch (cmp->layer) { 64 static const char *relation_txt(struct tcf_em_cmp *cmp) argument 66 switch (cmp 87 struct tcf_em_cmp *cmp = rtnl_ematch_data(m); local [all...] |
/external/protobuf/src/google/protobuf/io/ |
H A D | gzip_stream_unittest.sh | 40 (./zcgzip < ${TESTFILE} | gunzip | cmp - ${TESTFILE}) && \ 41 (gzip < ${TESTFILE} | ./zcgunzip | cmp - ${TESTFILE})
|
/external/iproute2/tc/ |
H A D | em_cmp.c | 31 "Usage: cmp(ALIGN at OFFSET [ ATTRS ] { eq | lt | gt } VALUE)\n" \ 36 "Example: cmp(u16 at 3 layer 2 mask 0xff00 gt 20)\n", 47 struct tcf_em_cmp cmp; local 49 memset(&cmp, 0, sizeof(cmp)); 55 return PARSE_ERR(args, "cmp: missing arguments"); 64 return PARSE_ERR(args, "cmp: invalid alignment"); 69 return PARSE_ERR(a, "cmp: missing argument"); 74 return PARSE_ERR(a, "cmp: invalid offset, " \ 80 return PARSE_ERR(a, "cmp 147 struct tcf_em_cmp *cmp = data; local [all...] |
/external/vboot_reference/tests/futility/ |
H A D | test_dump_fmap.sh | 14 cmp "${SCRIPTDIR}/data_fmap_expect_f.txt" "$TMP" 17 cmp "${SCRIPTDIR}/data_fmap_expect_p.txt" "$TMP" 20 cmp "${SCRIPTDIR}/data_fmap_expect_h.txt" "$TMP" 32 cmp "${SCRIPTDIR}/data_fmap_expect_x.txt" "$TMP" 36 cmp "${SCRIPTDIR}/data_fmap_expect_x2.txt" "$TMP" 37 cmp SI_DESC FOO 41 cmp "${SCRIPTDIR}/data_fmap2_expect_h.txt" "$TMP" 44 cmp "${SCRIPTDIR}/data_fmap2_expect_hh.txt" "$TMP" 47 cmp "${SCRIPTDIR}/data_fmap2_expect_hhH.txt" "$TMP"
|
/external/llvm/test/MC/X86/ |
H A D | intel-syntax-encoding.s | 18 cmp ax, 12 20 cmp eax, 12 22 cmp rax, 12 49 cmp ax, -12 51 cmp eax, -12 53 cmp rax, -12
|
H A D | intel-syntax-directional-label.s | 9 cmp rdi, 1
|
/external/elfutils/src/tests/ |
H A D | run-bug1-test.sh | 24 cmp testfile28 testfile28.rdwr 32 cmp testfile29 testfile29.rdwr
|
H A D | run-ecp-test.sh | 26 cmp testfile10 testfile10.tmp
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_lfstack.h | 37 u64 cmp = atomic_load(&head_, memory_order_relaxed); local 39 u64 cnt = (cmp & kCounterMask) + kCounterInc; 41 p->next = (T*)(uptr)(cmp & kPtrMask); 42 if (atomic_compare_exchange_weak(&head_, &cmp, xch, 49 u64 cmp = atomic_load(&head_, memory_order_acquire); local 51 T *cur = (T*)(uptr)(cmp & kPtrMask); 55 u64 cnt = (cmp & kCounterMask); 57 if (atomic_compare_exchange_weak(&head_, &cmp, xch,
|
H A D | sanitizer_persistent_allocator.h | 37 uptr cmp = atomic_load(®ion_pos, memory_order_acquire); local 39 if (cmp == 0 || cmp + size > end) return 0; 40 if (atomic_compare_exchange_weak(®ion_pos, &cmp, cmp + size, 42 return (void *)cmp;
|
/external/llvm/test/MC/ARM/ |
H A D | cmp-immediate-fixup.s | 6 @ CHECK: cmp r2, #1 7 cmp r2, #(l2 - l1 + 4) >> 2
|
H A D | cmp-immediate-fixup2.s | 6 @ CHECK: cmp r2, #0 7 cmp r2, #(l2 - l1)
|
/external/webrtc/src/common_audio/signal_processing/ |
H A D | spl_sqrt_floor.s | 21 cmp r0, r2, ror #2 * 0 25 cmp r0, r2, ror #2 * 1 29 cmp r0, r2, ror #2 * 2 33 cmp r0, r2, ror #2 * 3 37 cmp r0, r2, ror #2 * 4 41 cmp r0, r2, ror #2 * 5 45 cmp r0, r2, ror #2 * 6 49 cmp r0, r2, ror #2 * 7 53 cmp r0, r2, ror #2 * 8 57 cmp r [all...] |
/external/compiler-rt/lib/builtins/arm/ |
H A D | clzdi2.S | 31 cmp r0, 0 37 cmp r1, 0 54 cmp r0, 0 57 cmp r1, 0
|
/external/llvm/test/MC/AArch64/ |
H A D | optional-hash.s | 6 // CHECK: cmp w0, #123 7 cmp w0, 123
|
/external/v8/tools/testrunner/network/ |
H A D | distro.py | 40 self.tests.sort(cmp=lambda x, y: cmp(x.duration, y.duration)) 63 shells.sort(cmp=lambda x, y: cmp(x.total_duration, y.total_duration)) 68 peers.sort(cmp=lambda x, y: cmp(x.needed_work, y.needed_work)) 79 peers.sort(cmp=lambda x, y: cmp(x.needed_work, y.needed_work))
|
/external/boringssl/win-x86_64/crypto/ |
H A D | cpu-x86_64-asm.asm | 30 cmp ebx,0x756e6547 33 cmp edx,0x49656e69 36 cmp ecx,0x6c65746e 41 cmp ebx,0x68747541 44 cmp edx,0x69746E65 47 cmp ecx,0x444D4163 59 cmp eax,0x80000001 69 cmp r10d,0x80000008 84 cmp bl,r10b 90 cmp r11 [all...] |
/external/clang/test/CodeGen/ |
H A D | ext-vector.c | 119 int4 cmp; 120 cmp = a < b; 121 cmp = a <= b; 122 cmp = a < b; 123 cmp = a >= b; 124 cmp = a == b; 125 cmp = a != b; 186 int4 cmp; local 187 cmp = a < b; 188 cmp 207 int4 cmp; local [all...] |
/external/fio/lib/ |
H A D | flist_sort.c | 14 int (*cmp)(void *priv, struct flist_head *a, 22 if ((*cmp)(priv, a, b) <= 0) { 43 int (*cmp)(void *priv, struct flist_head *a, 52 if ((*cmp)(priv, a, b) <= 0) { 69 * element comparison is needed, so the client's cmp() 72 (*cmp)(priv, tail->next, tail->next); 84 * @priv: private data, opaque to list_sort(), passed to @cmp 86 * @cmp: the elements comparison function 91 * The comparison function @cmp must return a negative value if @a 94 * ordering is to be preserved, @cmp mus [all...] |
/external/skia/src/opts/ |
H A D | SkMath_opts_SSE2.h | 38 __m128i cmp = _mm_cmplt_epi32(remHi, testDiv); local 39 __m128i remHi1 = _mm_and_si128(cmp, remHi); 40 __m128i root1 = _mm_and_si128(cmp, root); 41 __m128i remHi2 = _mm_andnot_si128(cmp, _mm_sub_epi32(remHi, testDiv)); 42 __m128i root2 = _mm_andnot_si128(cmp, _mm_add_epi32(root, one128));
|
/external/icu/icu4c/source/common/ |
H A D | uarrsort.c | 65 UComparator *cmp, const void *context) { 72 int32_t diff=cmp(context, item, array+i*itemSize); 96 int32_t diff=cmp(context, item, array+start*itemSize); 109 UComparator *cmp, const void *context, void *pv) { 114 int32_t insertionPoint=uprv_stableBinarySearch(array, j, item, itemSize, cmp, context); 131 UComparator *cmp, const void *context, UErrorCode *pErrorCode) { 146 doInsertionSort(array, length, itemSize, cmp, context, pv); 169 UComparator *cmp, const void *context, 176 doInsertionSort(array+start*itemSize, limit-start, itemSize, cmp, context, px); 188 cmp(contex 64 uprv_stableBinarySearch(char *array, int32_t limit, void *item, int32_t itemSize, UComparator *cmp, const void *context) argument 108 doInsertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, void *pv) argument 130 insertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 168 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, UComparator *cmp, const void *context, void *px, void *pw) argument 234 quickSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument 265 uprv_sortArray(void *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UBool sortStable, UErrorCode *pErrorCode) argument [all...] |
/external/dexmaker/src/dx/java/com/android/dx/rop/cst/ |
H A D | CstFieldRef.java | 68 int cmp = super.compareTo0(other); 70 if (cmp != 0) { 71 return cmp;
|
/external/valgrind/include/ |
H A D | pub_tool_hashtable.h | 88 Note that the cmp function is only called for elements that already 89 have keys that are equal. So, it is not needed for cmp to check for 92 HT_Cmp_t cmp ); 94 HT_Cmp_t cmp ); 97 cmp will be used to verify if 2 elements with the same key are equal. 98 Use NULL cmp if the hash table elements are only to be compared by key. */ 99 extern void VG_(HT_print_stats) ( const VgHashTable *table, HT_Cmp_t cmp );
|
/external/vboot_reference/tests/ |
H A D | run_preamble_tests.sh | 37 cmp="-ne" 40 cmp="-eq" 48 if [ "$?" "$cmp" 0 ]; then 65 cmp="-ne" 68 cmp="-eq" 75 if [ "$?" "$cmp" 0 ]; then
|