HomeSort by relevance Sort by last modified time
    Searched defs:CHECK (Results 1 - 25 of 107) sorted by null

1 2 3 4 5

  /external/llvm/test/MC/AArch64/
cyclone-crc.s 7 CHECK: error: instruction requires: crc
8 CHECK: crc32b w0, w1, w5
9 CHECK: error: instruction requires: crc
10 CHECK: crc32h w3, w5, w6
11 CHECK: error: instruction requires: crc
12 CHECK: crc32w w19, wzr, w20
13 CHECK: error: instruction requires: crc
14 CHECK: crc32x w3, w5, x20
20 CHECK: error: instruction requires: crc
21 CHECK: crc32cb w5, w10, w1
    [all...]
  /bionic/tests/libs/
libs_utils.h 24 #define CHECK(e) \
  /external/sfntly/cpp/src/sfntly/port/
logging.h 25 #define CHECK(expr) \
27 printf("CHECK failed\n"); \
  /external/clang/test/Analysis/
bitwise-ops.c 4 #define CHECK(expr) if (!(expr)) return; clang_analyzer_eval(expr)
7 // Sanity check
8 CHECK(x); // expected-warning{{TRUE}}
9 CHECK(x & 1); // expected-warning{{TRUE}}
12 CHECK(1 - x); // expected-warning{{UNKNOWN}}
13 CHECK(x & y); // expected-warning{{UNKNOWN}}
traversal-path-unification.c 9 #define CHECK(x) ((x) & 1)
11 #define CHECK(x) (x)
14 // CHECK: --BEGIN FUNCTION--
17 if (CHECK(i))
28 // CHECK: --END FUNCTION--
29 // CHECK-NOT: --END FUNCTION--
  /external/pdfium/third_party/base/
logging.h 18 #define CHECK(condition) \
  /bionic/linker/
linker_phdr.cpp 150 CHECK(!did_read_);
151 CHECK(!did_load_);
169 CHECK(did_read_);
170 CHECK(!did_load_);
181 CHECK(strtab_ != nullptr);
182 CHECK(index < strtab_size_);
282 // check DYNSYM and DYNAMIC sections and phdr/shdr - none of them can be
    [all...]
  /external/dtc/tests/
add_subnode_with_nops.c 34 #define CHECK(code) \
58 CHECK(fdt_create(fdt, SPACE));
60 CHECK(fdt_finish_reservemap(fdt));
61 CHECK(fdt_begin_node(fdt, ""));
62 CHECK(fdt_property_cell(fdt, "prop1", TEST_VALUE_1));
63 CHECK(fdt_property_cell(fdt, "prop2", TEST_VALUE_2));
64 CHECK(fdt_end_node(fdt));
65 CHECK(fdt_finish(fdt));
70 CHECK(fdt_open_into(fdt, fdt, SPACE));
75 CHECK(fdt_nop_property(fdt, 0, "prop1"))
    [all...]
appendprop1.c 34 #define CHECK(code) \
51 CHECK(fdt_create(fdt, SPACE));
52 CHECK(fdt_finish_reservemap(fdt));
53 CHECK(fdt_begin_node(fdt, ""));
54 CHECK(fdt_end_node(fdt));
55 CHECK(fdt_finish(fdt));
58 CHECK(fdt_open_into(fdt, fdt, SPACE));
60 CHECK(fdt_appendprop(fdt, 0, "prop-bytes", bytes, sizeof(bytes)));
61 CHECK(fdt_appendprop_cell(fdt, 0, "prop-int", TEST_VALUE_1));
62 CHECK(fdt_appendprop_u64(fdt, 0, "prop-int64", TEST_VALUE64_1))
    [all...]
appendprop2.c 34 #define CHECK(code) \
51 CHECK(fdt_open_into(fdt, buf, SPACE));
54 CHECK(fdt_appendprop(fdt, 0, "prop-bytes", bytes, sizeof(bytes)));
55 CHECK(fdt_appendprop_cell(fdt, 0, "prop-int", TEST_VALUE_2));
56 CHECK(fdt_appendprop_u64(fdt, 0, "prop-int64", TEST_VALUE64_1));
57 CHECK(fdt_appendprop_string(fdt, 0, "prop-str", TEST_STRING_2));
59 CHECK(fdt_pack(fdt));
check_path.c 27 #define CHECK(code) \
47 CHECK(fdt_open_into(dt, copy, FDT_COPY_SIZE));
overlay_bad_fixup.c 28 #define CHECK(code, expected) \
49 CHECK(fdt_open_into(dt, copy, FDT_COPY_SIZE), 0);
67 CHECK(fdt_overlay_apply(fdt_base, fdt_overlay), -FDT_ERR_BADOVERLAY);
rw_tree1.c 34 #define CHECK(code) \
59 CHECK(fdt_create_empty_tree(fdt, SPACE));
61 CHECK(fdt_add_mem_rsv(fdt, TEST_ADDR_1, TEST_SIZE_1));
62 CHECK(fdt_add_mem_rsv(fdt, TEST_ADDR_2, TEST_SIZE_2));
64 CHECK(fdt_setprop_string(fdt, 0, "compatible", "test_tree1"));
65 CHECK(fdt_setprop_u32(fdt, 0, "prop-int", TEST_VALUE_1));
66 CHECK(fdt_setprop_u64(fdt, 0, "prop-int64", TEST_VALUE64_1));
67 CHECK(fdt_setprop_string(fdt, 0, "prop-str", TEST_STRING_1));
71 CHECK(fdt_setprop_string(fdt, s1, "compatible", "subnode1"));
72 CHECK(fdt_setprop_cell(fdt, s1, "prop-int", TEST_VALUE_1))
    [all...]
sw_tree1.c 73 #define CHECK(code) \
114 CHECK(fdt_create(fdt, size));
118 CHECK(fdt_add_reservemap_entry(fdt, TEST_ADDR_1, TEST_SIZE_1));
120 CHECK(fdt_add_reservemap_entry(fdt, TEST_ADDR_2, TEST_SIZE_2));
121 CHECK(fdt_finish_reservemap(fdt));
123 CHECK(fdt_begin_node(fdt, ""));
124 CHECK(fdt_property_string(fdt, "compatible", "test_tree1"));
125 CHECK(fdt_property_u32(fdt, "prop-int", TEST_VALUE_1));
126 CHECK(fdt_property_u64(fdt, "prop-int64", TEST_VALUE64_1));
127 CHECK(fdt_property_string(fdt, "prop-str", TEST_STRING_1))
    [all...]
dtb_reverse.c 32 #define CHECK(code) \
50 CHECK(fdt_get_mem_rsv(in, n, &addr, &size));
51 CHECK(fdt_add_reservemap_entry(out, addr, size));
76 CHECK(fdt_property(out, name, data, len));
91 CHECK(fdt_get_path(in, nextoffset, path, sizeof(path)));
112 CHECK(fdt_get_path(in, nodeoffset, path, sizeof(path)));
116 CHECK(fdt_begin_node(out, name));
129 CHECK(fdt_end_node(out));
149 CHECK(fdt_create(out, bufsize));
154 CHECK(fdt_finish_reservemap(out))
    [all...]
  /external/libvncserver/test/
cargstest.c 16 #define CHECK(a,b) if(screen->a!=b) { fprintf(stderr,#a " is %d (should be " #b ")\n",screen->a); ret=1; }
17 CHECK(width,1024);
18 CHECK(height,768);
19 CHECK(alwaysShared,TRUE);
20 CHECK(httpPort,3002);
21 CHECK(dontDisconnect,TRUE);
  /external/libexif/test/
test-integers.c 2 * \brief Check assumptions about integer types (sizes, ranges).
39 # define CHECK(condition) \
41 fprintf(stderr, "%s:%d: check failed: %s\n", \
46 # define CHECK(condition) \
58 CHECK(sizeof(unsigned int) >= sizeof(uint32_t));
61 CHECK(sizeof(enum_t) <= sizeof(int));
  /external/pcre/pcrecpp/
pcre_stringpiece_unittest.cc 15 // CHECK dies with a fatal error if condition is not true. It is *not*
16 // controlled by NDEBUG, so the check will be executed regardless of
18 // CHECK(fp->Write(x) == 4)
19 #define CHECK(condition) do { \
21 fprintf(stderr, "%s:%d: Check failed: %s\n", \
45 CHECK(map.size() == 3);
48 CHECK(iter->second == 1);
50 CHECK(iter->second == 2);
52 CHECK(iter->second == 0);
54 CHECK(iter == map.end())
    [all...]
  /external/webrtc/webrtc/voice_engine/test/auto_test/
voe_cpu_test.cc 29 #define CHECK(expr) \
64 CHECK(base->Init());
70 CHECK(voice_socket_transport->SetSendDestination("127.0.0.1", 5566));
71 CHECK(voice_socket_transport->SetLocalReceiver(5566));
73 CHECK(codec->SetRecPayloadType(channel, isac));
74 CHECK(codec->SetSendCodec(channel, isac));
76 CHECK(base->StartReceive(channel));
77 CHECK(base->StartPlayout(channel));
78 CHECK(base->StartSend(channel));
79 CHECK(file->StartPlayingFileAsMicrophone(channel, _mgr.AudioFilename()
    [all...]
  /build/kati/
log.h 75 #define CHECK(c) if (!(c)) ERROR("%s:%d: %s", __FILE__, __LINE__, #c)
  /external/clang/test/CodeGenCXX/
bitfield-layout.cpp 1 // RUN: %clang_cc1 %s -triple=x86_64-apple-darwin10 -emit-llvm -o - -O3 | FileCheck -check-prefix CHECK-LP64 %s
2 // RUN: %clang_cc1 %s -triple=i386-apple-darwin10 -emit-llvm -o - -O3 | FileCheck -check-prefix CHECK-LP32 %s
4 // CHECK-LP64: %union.Test1 = type { i32, [4 x i8] }
10 // CHECK-LP64: %union.Test2 = type { i8 }
15 // CHECK-LP64: %union.Test3 = type { i16 }
21 #define CHECK(x) if (!(x)) return __LINE__
36 CHECK(c.a == 0);
37 CHECK(c.b == (unsigned long long)-1)
    [all...]
  /frameworks/wilhelm/tests/sandbox/
nativewindow.cpp 31 #define CHECK assert
32 #define CHECK_EQ(a,b) CHECK((a)==(b))
60 CHECK(control != NULL);
61 CHECK(control->isValid());
69 CHECK(surface != NULL);
  /packages/apps/Music/src/com/android/music/
ScanningProgress.java 31 private final static int CHECK = 0;
35 if (msg.what == CHECK) {
53 Message next = obtainMessage(CHECK);
74 Message msg = mHandler.obtainMessage(CHECK);
80 mHandler.removeMessages(CHECK);
  /bionic/libc/private/
libc_logging.h 95 #define CHECK(predicate) \
98 __libc_fatal("%s:%d: %s CHECK '" #predicate "' failed", \
  /external/google-benchmark/src/
check.h 25 // CheckHandler is the class constructed by failing CHECK macros. CheckHandler
29 CheckHandler(const char* check, const char* file, const char* func, int line)
31 log_ << file << ":" << line << ": " << func << ": Check `" << check local
53 // The CHECK macro returns a std::ostream object that can have extra information
56 #define CHECK(b) \
61 #define CHECK(b) ::benchmark::internal::GetNullLogInstance()
64 #define CHECK_EQ(a, b) CHECK((a) == (b))
65 #define CHECK_NE(a, b) CHECK((a) != (b))
66 #define CHECK_GE(a, b) CHECK((a) >= (b)
    [all...]

Completed in 2065 milliseconds

1 2 3 4 5