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

1 2 3

  /toolchain/binutils/binutils-2.25/bfd/
cpu-v850.c 26 #define N(number, print, default, next) \
28 bfd_default_compatible, bfd_default_scan, bfd_arch_default_fill, next }
30 #define NEXT NULL
42 #undef NEXT
43 #define NEXT & arch_info_struct[0]
46 N (bfd_mach_v850, "v850", TRUE, NEXT);
cpu-m32r.c 25 #define N(number, print, default, next) \
27 bfd_default_compatible, bfd_default_scan, bfd_arch_default_fill, next }
30 #define NEXT & arch_info_struct [0]
39 N (bfd_mach_m32r, "m32r", TRUE, NEXT);
cpu-nds32.c 27 #define N(number, print, default, next) \
29 bfd_default_compatible, bfd_default_scan, bfd_arch_default_fill, next }
31 #define NEXT &arch_info_struct[0]
45 N (bfd_mach_n1, "n1h", TRUE, NEXT);
  /external/elfutils/lib/
dynamicsizehash.h 46 # define NEXT(name) struct name##_ent *next;
49 # define NEXT(name)
67 NEXT (name) \
108 /* Get next element in table. */ \
126 # undef NEXT
  /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);
  /bionic/libc/upstream-netbsd/lib/libc/include/isc/
list.h 28 #define LINK(type) struct { type *prev, *next; }
32 (elt)->link.next = (type *)(-1); \
37 (void *)((elt)->link.next) != (void *)(-1))
51 (elt)->link.next = (list).head; \
59 (list).tail->link.next = (elt); \
63 (elt)->link.next = NULL; \
70 if ((elt)->link.next != NULL) \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
77 (elt)->link.prev->link.next = (elt)->link.next; \
    [all...]
  /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/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/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/
ImageFactory.java 37 NEXT = getImage("next24.png");
75 public ImageIcon 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/minijail/
bpf.h 101 #define NEXT 0
  /external/zlib/src/examples/
gun.c 93 unsigned char *next; local
96 next = me->inbuf;
97 *buf = next;
103 ret = (int)read(me->infile, next, ret);
108 next += ret;
154 /* next input byte macro for use inside lunpipe() and gunpipe() */
155 #define NEXT() (have ? 0 : (have = in(indp, &next)), \
156 last = have ? (have--, (int)(*next++)) : -1)
178 if (NEXT() == -1)
387 z_const unsigned char *next = NULL; local
    [all...]
  /hardware/bsp/intel/peripheral/libupm/src/wt5001/
wt5001.h 84 NEXT = 0xa5,
204 * Moves to the next track
208 bool next();
225 * Queues a track to play next, when the current song is finished
  /prebuilts/tools/common/m2/repository/com/android/tools/external/liblzf/1.0/
liblzf-1.0.jar 
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/epiphany/
regression.s 70 B NEXT ; //jump over fail
84 NEXT: STRB R4,[R0,#0x0] ;//Store Byte
236 LONGJUMP: B RETURN; //jump back to next
  /external/libxml2/
xzlib.c 60 unsigned char *next; /* next output data to deliver or write */ member in struct:__anon17570
61 unsigned int have; /* amount of output data unused at next */
354 /* Get next byte from input, or -1 if end or error. */
355 #define NEXT() ((strm->avail_in == 0 && xz_avail(state) == -1) ? -1 : \
465 if (NEXT() != 8) { /* compression method */
470 flags = NEXT();
476 NEXT(); /* modification time */
477 NEXT();
478 NEXT();
    [all...]
uri.c 123 * Skip to next pointer char, handle escaped sequences
126 #define NEXT(p) ((*p == '%')? p += 3 : p++)
256 NEXT(cur);
292 NEXT(cur);
363 NEXT(cur);
476 NEXT(cur);
560 NEXT(cur);
    [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...]
xpointer.c 140 for (i = 0;cur != NULL;cur = cur->next) {
185 for (i = 0;i <= no;cur = cur->next) {
890 * NXT(n) returns the n'th next xmlChar. Same as CUR is should be used only
896 * NEXT Skip to the next character, this does the proper decoding
907 while (IS_BLANK_CH(*(ctxt->cur))) NEXT
910 #define NEXT ((*ctxt->cur) ? ctxt->cur++: ctxt->cur)
991 NEXT;
1007 NEXT;
1014 NEXT;
    [all...]
  /frameworks/compile/mclinker/include/mcld/Script/
Operator.h 78 NEXT = 45,
155 Operator& Operator::create<Operator::NEXT>();
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentLinkedQueue.java 95 * - There is exactly one (last) Node with a null next reference,
154 volatile Node<E> next; field in class:ConcurrentLinkedQueue.Node
172 U.putOrderedObject(node, NEXT, val);
176 return U.compareAndSwapObject(node, NEXT, cmp, val);
185 * - (tmp = head).next != tmp || tmp != head
195 * node with node.next == null) can be reached in O(1) time.
203 * - tail.next may or may not be self-pointing to tail.
265 * Returns the successor of p, or the head node if p.next has been
270 Node<E> next = p.next; local
448 Node<E> next, pred = null; local
702 public E next() { method in class:ConcurrentLinkedQueue.Itr
    [all...]
  /bionic/libc/upstream-netbsd/lib/libc/regex/
regcomp.c 109 const char *next; /* next character in RE */ local
182 #define PEEK() (*p->next)
183 #define PEEK2() (*(p->next+1))
184 #define MORE() (p->next < p->end)
185 #define MORE2() (p->next+1 < p->end)
188 #define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
190 #define NEXT() (p->next++)
191 #define NEXT2() (p->next += 2
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/text/
RelativeDateTimeFormatter.java 33 * <li>relative dates without a quantity e.g "next Tuesday"</li>
51 * fmt.format(1, Direction.NEXT, RelativeUnit.DAYS); // "in 1 day"
52 * fmt.format(3, Direction.NEXT, RelativeUnit.DAYS); // "in 3 days"
57 * fmt.format(Direction.NEXT, AbsoluteUnit.SUNDAY); // "next Sunday"
62 * fmt.format(Direction.NEXT, AbsoluteUnit.DAY); // "tomorrow"
222 * Represents a direction for an absolute unit e.g "Next Tuesday"
242 * Next
244 NEXT,
349 * @param direction NEXT means a future relative date; LAST means a pas
    [all...]
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
RelativeDateTimeFormatter.java 32 * <li>relative dates without a quantity e.g "next Tuesday"</li>
50 * fmt.format(1, Direction.NEXT, RelativeUnit.DAYS); // "in 1 day"
51 * fmt.format(3, Direction.NEXT, RelativeUnit.DAYS); // "in 3 days"
56 * fmt.format(Direction.NEXT, AbsoluteUnit.SUNDAY); // "next Sunday"
61 * fmt.format(Direction.NEXT, AbsoluteUnit.DAY); // "tomorrow"
248 * Represents a direction for an absolute unit e.g "Next Tuesday"
272 * Next
275 NEXT,
388 * @param direction NEXT means a future relative date; LAST means a pas
    [all...]
  /external/llvm/lib/Support/
regcomp.c 65 char *next; /* next character in RE */ member in struct:parse
122 #define PEEK() (*p->next)
123 #define PEEK2() (*(p->next+1))
124 #define MORE() (p->next < p->end)
125 #define MORE2() (p->next+1 < p->end)
128 #define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
130 #define NEXT() (p->next++)
131 #define NEXT2() (p->next += 2
    [all...]

Completed in 1162 milliseconds

1 2 3