/prebuilts/tools/common/m2/repository/com/android/tools/external/liblzf/1.0/ |
liblzf-1.0.jar | |
/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/libxml2/ |
xzlib.c | 58 unsigned char *next; /* next output data to deliver or write */ member in struct:__anon14104 59 unsigned int have; /* amount of output data unused at next */ 352 /* Get next byte from input, or -1 if end or error. */ 353 #define NEXT() ((strm->avail_in == 0 && xz_avail(state) == -1) ? -1 : \ 463 if (NEXT() != 8) { /* compression method */ 468 flags = NEXT(); 474 NEXT(); /* modification time */ 475 NEXT(); 476 NEXT(); [all...] |
pattern.c | 109 struct _xmlStreamCtxt *next;/* link to next sub pattern if | */ member in struct:_xmlStreamCtxt 167 struct _xmlPattern *next; /* next pattern if | is used */ member in struct:_xmlPattern 237 if (comp->next != NULL) 238 xmlFreePattern(comp->next); 274 comp = comp->next; 275 cur->next = NULL; 562 lst = lst->next; 723 while (IS_BLANK_CH(CUR)) NEXT 1792 xmlStreamCtxtPtr next; local [all...] |
xmlregexp.c | 53 #define NEXT ctxt->cur++ 298 int nextbranch; /* the next transition to explore in that state */ 6440 xmlExpNodePtr next;\/* the next node in the hash table or free list *\/ member in struct:_xmlExpNode [all...] |
/external/llvm/test/MC/ARM/ |
directive-arch_extension-crc.s | 12 @ CHECK-V7-NEXT: .arch_extension crc 13 @ CHECK-V7-NEXT: ^ 33 @ CHECK-V7-NEXT: .arch_extension nocrc 34 @ CHECK-V7-NEXT: ^
|
directive-arch_extension-mp.s | 18 @ CHECK-V6-NEXT: .arch_extension mp 19 @ CHECK-V6-NEXT: ^ 29 @ CHECK-V6-NEXT: .arch_extension nomp 30 @ CHECK-V6-NEXT: ^
|
vfp4.s | 10 @ THUMB_V7EM-ERRORS-NEXT: vfma.f64 d16, d18, d17 21 @ THUMB_V7EM-ERRORS-NEXT: vfma.f32 d16, d18, d17 27 @ THUMB_V7EM-ERRORS-NEXT: vfma.f32 q2, q4, q0 33 @ THUMB_V7EM-ERRORS-NEXT: vfnma.f64 d16, d18, d17 44 @ THUMB_V7EM-ERRORS-NEXT: vfms.f64 d16, d18, d17 55 @ THUMB_V7EM-ERRORS-NEXT: vfms.f32 d16, d18, d17 61 @ THUMB_V7EM-ERRORS-NEXT: vfms.f32 q2, q4, q0 67 @ THUMB_V7EM-ERRORS-NEXT: vfnms.f64 d16, d18, d17
|
thumb1-relax-bcc.s | 12 @ CHECK-ELF-NEXT: R_ARM_THM_JUMP24 _func2
|
directive-arch_extension-crypto.s | 14 @ CHECK-V7-NEXT: .arch_extension crypto 15 @ CHECK-V7-NEXT: ^ 55 @ CHECK-V7-NEXT: .arch_extension nocrypto 56 @ CHECK-V7-NEXT: ^
|
/external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/ |
ImageFactory.java | 37 NEXT = getImage("next24.png"); 75 public ImageIcon NEXT;
|
/external/boringssl/src/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/llvm/test/MC/COFF/ |
comm-align.s | 47 # CHECK-NEXT:Value: 1 48 # CHECK-NEXT:Section: IMAGE_SYM_UNDEFINED (0)
|
/external/llvm/test/MC/ELF/ |
discriminator.s | 56 # CHECK-NEXT: 0x2D R_386_32 .text 0x0 57 # CHECK-NEXT: }
|
/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/llvm/test/MC/ARM/Windows/ |
mov32t-range.s | 36 @ CHECK-ENCODING-NEXT: 4: c0 f2 01 00
|
/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/objenesis/main/src/org/objenesis/instantiator/basic/ |
ObjectInputStreamInstantiator.java | 47 private static final int[] NEXT = new int[] {1, 2, 2}; 115 sequence = NEXT[sequence];
|
/external/bison/lib/ |
bbitset.h | 270 *NEXT. Return with actual number of bits found and with *NEXT 272 #define BITSET_LIST_(BSET, LIST, NUM, NEXT) \ 273 (BSET)->b.vtable->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 (BSET)->b.vtable->list_reverse (BSET, LIST, NUM, NEXT)
|
bitset.h | 94 bitset_bindex next; member in struct:__anon4667 271 *NEXT. Return with actual number of bits found and with *NEXT 273 #define bitset_list(BSET, LIST, NUM, NEXT) \ 274 BITSET_LIST_ (BSET, LIST, NUM, NEXT) 277 including NEXT. Return with actual number of bits found and with 278 *NEXT indicating where search stopped. */ 279 #define bitset_list_reverse(BSET, LIST, NUM, NEXT) \ 280 BITSET_LIST_REVERSE_ (BSET, LIST, NUM, NEXT) 285 /* 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/llvm/test/MC/X86/AlignedBundling/ |
pad-align-to-bundle-end.s | 20 # CHECK-NEXT: b: callq 28 # Here we have to pad until the end of the *next* boundary because 34 # CHECK-NEXT: 26: callq 35 # CHECK-NEXT: 2b: callq
|
single-inst-bundling.s | 24 # CHECK-NEXT: 10: imull 38 # CHECK-OPT-NEXT:20: addl
|
/frameworks/compile/mclinker/include/mcld/Script/ |
UnaryOp.h | 80 IntOperand* UnaryOp<Operator::NEXT>::eval(const Module&,
|
/ndk/sources/host-tools/nawk-20071023/ |
maketab.c | 95 { NEXT, "jump", "next" },
|