| /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/minijail/ |
| bpf.c | 20 NEXT);
29 set_bpf_jump(curr_block++, BPF_JMP + BPF_JEQ + BPF_K, nr, NEXT, SKIP);
38 set_bpf_jump(curr_block++, BPF_JMP + BPF_JEQ + BPF_K, nr, NEXT, SKIP);
85 curr_block += bpf_comp_jeq32(curr_block, hi, NEXT, SKIPN(2) + jf);
116 curr_block += bpf_comp_jset32(curr_block, mask_hi, SKIPN(2) + jt, NEXT);
176 unsigned char jt = flip ? NEXT : SKIP;
177 unsigned char jf = flip ? SKIP : NEXT;
|
| /external/llvm/test/MC/Sparc/ |
| sparc-little-endian.s | 16 ! CHECK-NEXT: ! fixup A - offset: 0, value: .BB0, kind: fixup_sparc_br22
|
| /external/libxml2/ |
| 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 */
6446 xmlExpNodePtr next;\/* the next node in the hash table or free list *\/ member in struct:_xmlExpNode
[all...] |
| /toolchain/binutils/binutils-2.25/bfd/ |
| ieee.c | 207 /* Length is next byte, allowing 0..255. */
212 /* Length is next two bytes, allowing 0..65535. */
521 /* The stack pointer always points to the next unused location. */
709 *pptr = &new_symbol->next;
877 for (s = abfd->sections; s != NULL; s = s->next)
1032 symp = symp->next)
1042 symp = symp->next)
[all...] |
| cpu-mips.c | 44 #define N(BITS_WORD, BITS_ADDR, NUMBER, PRINT, DEFAULT, NEXT) \
58 NEXT, \
|
| /device/linaro/bootloader/arm-trusted-firmware/bl1/ |
| bl1.ld.S | 126 . = NEXT(4096);
|
| /external/llvm/test/MC/ARM/Windows/ |
| mov32t-range.s | 36 @ CHECK-ENCODING-NEXT: 4: c0 f2 01 00
|
| /external/llvm/test/MC/ARM/ |
| thumb1-relax-bcc.s | 12 @ CHECK-ELF-NEXT: R_ARM_THM_JUMP19 _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: ^
|
| eh-directive-section.s | 54 @ CHECK-NEXT: Name: .TEST1
113 @ CHECK-NEXT: Name: TEST2
|
| /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/main/java/org/objenesis/instantiator/basic/ |
| ObjectInputStreamInstantiator.java | 50 private static final int[] NEXT = new int[] {1, 2, 2};
118 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:__anon13197
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&,
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| collections.py | 35 # Each link is stored as a list of length three: [PREV, NEXT, KEY].
53 def __setitem__(self, key, value, PREV=0, NEXT=1, dict_setitem=dict.__setitem__):
60 last[NEXT] = root[PREV] = self.__map[key] = [last, root, key]
63 def __delitem__(self, key, PREV=0, NEXT=1, dict_delitem=dict.__delitem__):
69 link_prev[NEXT] = link_next
75 NEXT, KEY = 1, 2
77 curr = root[NEXT]
80 curr = curr[NEXT]
163 key = next(reversed(self) if last else iter(self))
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| SynchronousQueue.java | 141 * except that nodes that appear to be the next ones to become
235 volatile SNode next; // next node in stack field in class:SynchronousQueue.TransferStack.SNode
249 return cmp == next &&
250 U.compareAndSwapObject(this, NEXT, cmp, val);
288 private static final long NEXT;
294 NEXT = U.objectFieldOffset
295 (SNode.class.getDeclaredField("next"));
317 static SNode snode(SNode s, Object e, SNode next, int mode) {
320 s.next = next
537 volatile QNode next; \/\/ next node in queue field in class:SynchronousQueue.TransferQueue.QNode
[all...] |
