| /external/clang/test/Misc/ |
| warning-flags.c | 21 CHECK-NEXT: ext_anon_param_requires_type_specifier
22 CHECK-NEXT: ext_anonymous_struct_union_qualified
23 CHECK-NEXT: ext_array_init_copy
24 CHECK-NEXT: ext_binary_literal
25 CHECK-NEXT: ext_cast_fn_obj
26 CHECK-NEXT: ext_delete_void_ptr_operand
27 CHECK-NEXT: ext_designated_init
28 CHECK-NEXT: ext_designated_init_cxx
29 CHECK-NEXT: ext_duplicate_declspec
30 CHECK-NEXT: ext_ellipsis_exception_spe
[all...] |
| /external/llvm/test/MC/AsmParser/ |
| section.s | 49 # CHECK-NEXT: ('sh_type', 0x00000001)
50 # CHECK-NEXT: ('sh_flags', 0x00000000)
51 # CHECK-NEXT: ('sh_addr', 0x00000000)
52 # CHECK-NEXT: ('sh_offset', 0x00000034)
53 # CHECK-NEXT: ('sh_size', 0x00000007)
54 # CHECK-NEXT: ('sh_link', 0x00000000)
55 # CHECK-NEXT: ('sh_info', 0x00000000)
56 # CHECK-NEXT: ('sh_addralign', 0x00000001)
57 # CHECK-NEXT: ('sh_entsize', 0x00000000)
58 # CHECK-NEXT: ('_section_data', '01010101 010101'
[all...] |
| /external/llvm/test/MC/ARM/ |
| elf-movt.s | 15 @ ASM-NEXT: movt r0, :upper16:(GOT-(.LPC0_2+8))
19 @ OBJ-NEXT: 'sh_type', 0x00000001
20 @ OBJ-NEXT: 'sh_flags', 0x00000006
21 @ OBJ-NEXT: 'sh_addr', 0x00000000
22 @ OBJ-NEXT: 'sh_offset', 0x00000034
23 @ OBJ-NEXT: 'sh_size', 0x00000008
24 @ OBJ-NEXT: 'sh_link', 0x00000000
25 @ OBJ-NEXT: 'sh_info', 0x00000000
26 @ OBJ-NEXT: 'sh_addralign', 0x00000004
27 @ OBJ-NEXT: 'sh_entsize', 0x0000000
[all...] |
| elf-thumbfunc.s | 16 @CHECK-NEXT: 'st_name', 0x00000001
17 @CHECK-NEXT: 'st_value', 0x00000001
18 @CHECK-NEXT: 'st_size', 0x00000000
19 @CHECK-NEXT: 'st_bind', 0x1
20 @CHECK-NEXT: 'st_type', 0x2
|
| /external/zlib/examples/ |
| gun.c | 92 unsigned char *next; local
95 next = me->inbuf;
96 *buf = next;
102 ret = (int)read(me->infile, next, ret);
107 next += ret;
153 /* next input byte macro for use inside lunpipe() and gunpipe() */
154 #define NEXT() (have ? 0 : (have = in(indp, &next)), \
155 last = have ? (have--, (int)(*next++)) : -1)
177 if (NEXT() == -1)
386 unsigned char *next = NULL; local
[all...] |
| /external/openssl/crypto/md5/asm/ |
| md5-x86_64.pl | 17 # %r11d = z' (copy of z for the next step)
22 $code .= " mov 0*4(%rsi), %r10d /* (NEXT STEP) X[0] */\n" if ($pos == -1);
23 $code .= " mov %edx, %r11d /* (NEXT STEP) z' = %edx */\n" if ($pos == -1);
29 mov $k_next*4(%rsi),%r10d /* (NEXT STEP) X[$k_next] */
32 mov $y, %r11d /* (NEXT STEP) z' = $y */
40 # %r11d = z' (copy of z for the next step)
41 # %r12d = z' (copy of z for the next step)
46 $code .= " mov 1*4(%rsi), %r10d /* (NEXT STEP) X[1] */\n" if ($pos == -1);
47 $code .= " mov %edx, %r11d /* (NEXT STEP) z' = %edx */\n" if ($pos == -1);
48 $code .= " mov %edx, %r12d /* (NEXT STEP) z' = %edx */\n" if ($pos == -1)
[all...] |
| /external/elfutils/lib/ |
| dynamicsizehash.h | 30 # define NEXT(name) struct name##_ent *next;
33 # define NEXT(name)
47 NEXT (name) \
88 /* Get next element in table. */ \
106 # undef NEXT
|
| /external/zlib/ |
| gzread.c | 66 /* Get next byte from input, or -1 if end or error. */
67 #define NEXT() ((strm->avail_in == 0 && gz_avail(state) == -1) ? -1 : \
81 val = NEXT();
82 val += (unsigned)NEXT() << 8;
83 val += (unsigned long)NEXT() << 16;
84 ch = NEXT();
97 that the next available input data is the raw deflate stream. If direct
161 if (NEXT() != 8) { /* compression method */
165 flags = NEXT();
170 NEXT(); /* modification time *
[all...] |
| /external/webkit/Source/WebCore/storage/ |
| IDBCursor.idl | 31 const unsigned short NEXT = 0;
|
| IDBIndex.cpp | 42 static const unsigned short defaultDirection = IDBCursor::NEXT;
60 if (direction != IDBCursor::NEXT && direction != IDBCursor::NEXT_NO_DUPLICATE && direction != IDBCursor::PREV && direction != IDBCursor::PREV_NO_DUPLICATE) {
78 if (direction != IDBCursor::NEXT && direction != IDBCursor::NEXT_NO_DUPLICATE && direction != IDBCursor::PREV && direction != IDBCursor::PREV_NO_DUPLICATE) {
|
| IDBIndex.h | 58 PassRefPtr<IDBRequest> openCursor(ScriptExecutionContext* context, PassRefPtr<IDBKeyRange> keyRange, ExceptionCode& ec) { return openCursor(context, keyRange, IDBCursor::NEXT, ec); }
62 PassRefPtr<IDBRequest> openKeyCursor(ScriptExecutionContext* context, PassRefPtr<IDBKeyRange> keyRange, ExceptionCode& ec) { return openKeyCursor(context, keyRange, IDBCursor::NEXT, ec); }
|
| IDBCursor.h | 50 NEXT = 0,
|
| IDBObjectStore.h | 66 PassRefPtr<IDBRequest> openCursor(ScriptExecutionContext* context, PassRefPtr<IDBKeyRange> keyRange, ExceptionCode& ec) { return openCursor(context, keyRange, IDBCursor::NEXT, ec); }
|
| /external/liblzf/src/org/liblzf/ |
| CLZF.java | 134 static int NEXT(int v,byte[] Array,int ptr)
177 hval = NEXT (hval, in_data,iidx);
229 hval = NEXT (hval,in_data, iidx);
233 hval = NEXT (hval, in_data,iidx);
|
| /external/liblzf/ |
| lzf_c.c | 49 # define NEXT(v,p) (((v) << 8) | p[2])
63 * the next one is also quite good, albeit slow ;)
70 # define NEXT(v,p) ((v) << 5) ^ p[2]
144 hval = NEXT (hval, ip);
150 && ref < ip /* the next test will actually take care of this, but this is faster */
235 hval = NEXT (hval, ip);
240 hval = NEXT (hval, ip);
249 hval = NEXT (hval, ip);
|
| /external/libxml2/ |
| pattern.c | 106 struct _xmlStreamCtxt *next;/* link to next sub pattern if | */ member in struct:_xmlStreamCtxt
164 struct _xmlPattern *next; /* next pattern if | is used */ member in struct:_xmlPattern
234 if (comp->next != NULL)
235 xmlFreePattern(comp->next);
271 comp = comp->next;
272 cur->next = NULL;
558 lst = lst->next;
719 while (IS_BLANK_CH(CUR)) NEXT
1788 xmlStreamCtxtPtr next; local
[all...] |
| xmlregexp.c | 50 #define NEXT ctxt->cur++
290 int nextbranch; /* the next transition to explore in that state */
6357 xmlExpNodePtr next;\/* the next node in the hash table or free list *\/ member in struct:_xmlExpNode
[all...] |
| HTMLparser.c | 220 * NXT(n) returns the n'th next xmlChar. Same as CUR is should be used only
222 * UPP(n) returns the n'th next xmlChar converted to uppercase. Same as CUR
231 * NEXT Skip to the next character, this does the proper decoding
263 #define NEXT xmlNextChar(ctxt)
4618 xmlChar cur, next; local
[all...] |
| /external/libxslt/libxslt/ |
| pattern.c | 100 struct _xsltCompMatch *next; /* siblings in the name hash */ member in struct:_xsltCompMatch
214 comp = comp->next;
938 sibling = sibling->next;
986 siblings = siblings->next;
1048 sibling = sibling->next;
1083 siblings = siblings->next;
1214 comp = comp->next;
1231 while (IS_BLANK_CH(CUR)) NEXT
1234 #define NEXT ((*ctxt->cur) ? ctxt->cur++: ctxt->cur)
2027 xsltCompMatchPtr pat, list, next; local
[all...] |
| /external/opencv/cvaux/src/ |
| cvclique.cpp | 79 #define NEXT PEREBOR
341 finder->status = NEXT;//go to backtrackcycle
344 case NEXT:
464 //select next candidate
471 finder->status = NEXT;
588 status = NEXT;//go to backtrackcycle
591 case NEXT:
687 //select next candidate
694 status = NEXT;
|
| /external/bison/lib/ |
| bbitset.h | 268 *NEXT. Return with actual number of bits found and with *NEXT
270 #define BITSET_LIST_(BSET, LIST, NUM, NEXT) \
271 (BSET)->b.vtable->list (BSET, LIST, NUM, NEXT)
274 including NEXT. Return with actual number of bits found and with
275 *NEXT indicating where search stopped. */
276 #define BITSET_LIST_REVERSE_(BSET, LIST, NUM, NEXT) \
277 (BSET)->b.vtable->list_reverse (BSET, LIST, NUM, NEXT)
|
| bitset.h | 93 bitset_bindex next; member in struct:__anon1483
270 *NEXT. Return with actual number of bits found and with *NEXT
272 #define bitset_list(BSET, LIST, NUM, NEXT) \
273 BITSET_LIST_ (BSET, LIST, NUM, NEXT)
276 including NEXT. Return with actual number of bits found and with
277 *NEXT indicating where search stopped. */
278 #define bitset_list_reverse(BSET, LIST, NUM, NEXT) \
279 BITSET_LIST_REVERSE_ (BSET, LIST, NUM, NEXT)
284 /* Find next set bit from the given bit index. *
[all...] |
| /external/liblzf/cs/ |
| CLZF.cs | 134 UInt32 NEXT(UInt32 v,byte[] Array,UInt32 ptr)
177 hval = NEXT (hval, in_data,iidx);
229 hval = NEXT (hval,in_data, iidx);
233 hval = NEXT (hval, in_data,iidx);
|
| /external/netcat/ |
| generic.h | 358 #ifdef NEXT
|
| /ndk/sources/host-tools/nawk-20071023/ |
| maketab.c | 95 { NEXT, "jump", "next" },
|
