| /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/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/webkit/Source/WebCore/storage/ |
| IDBCursor.h | 50 NEXT = 0,
|
| /bionic/libc/private/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
32 (elt)->link.next = (type *)(-1); \
50 (elt)->link.next = (list).head; \
58 (list).tail->link.next = (elt); \
62 (elt)->link.next = NULL; \
69 if ((elt)->link.next != NULL) \
70 (elt)->link.next->link.prev = (elt)->link.prev; \
74 (elt)->link.prev->link.next = (elt)->link.next; \
76 (list).head = (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/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/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/libxml2/ |
| uri.c | 92 * Skip to next pointer char, handle escaped sequences
95 #define NEXT(p) ((*p == '%')? p += 3 : p++)
225 NEXT(cur);
261 NEXT(cur);
332 NEXT(cur);
445 NEXT(cur);
529 NEXT(cur);
[all...] |
| 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...] |
| 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;
1015 NEXT;
[all...] |
| catalog.c | 131 struct _xmlCatalogEntry *next; member in struct:_xmlCatalogEntry
281 ret->next = NULL;
362 xmlCatalogEntryPtr next; local
365 next = ret->next;
367 ret = next;
380 xmlCatalogEntryPtr children, next; local
387 next = children->next;
391 children = next;
[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...] |
| parser.c | 6938 xmlNodePtr nw = NULL, cur, next, last, local
10483 xmlChar cur, 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...] |
| xpath.c | 915 cur = cur->next;
11953 xmlXPathTraversalFunction next = NULL; local
[all...] |
| /bionic/libc/regex/ |
| regcomp.c | 56 char *next; /* next character in RE */ member in struct:parse
113 #define PEEK() (*p->next)
114 #define PEEK2() (*(p->next+1))
115 #define MORE() (p->next < p->end)
116 #define MORE2() (p->next+1 < p->end)
119 #define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
121 #define NEXT() (p->next++)
122 #define NEXT2() (p->next += 2
[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...] |
| xslt.c | 282 self->next = NULL;
341 tmp = iter->next;
365 for (result = style->decimalFormat->next;
367 result = result->next) {
436 template = template->next;
450 item = item->next;
464 item = item->next;
496 ret->next = cctxt->psData->nsMap;
516 ivar = ivar->next;
546 cur = cur->next;
845 xsltStylesheetPtr next; local
3499 xmlNsPtr ns = cur->nsDef, prev = NULL, next; local
4860 xmlNodePtr text = cur->children, next; local
[all...] |
| /external/llvm/lib/Support/ |
| regcomp.c | 57 char *next; /* next character in RE */ member in struct:parse
114 #define PEEK() (*p->next)
115 #define PEEK2() (*(p->next+1))
116 #define MORE() (p->next < p->end)
117 #define MORE2() (p->next+1 < p->end)
120 #define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
122 #define NEXT() (p->next++)
123 #define NEXT2() (p->next += 2
[all...] |
| /ndk/sources/host-tools/ndk-stack/regex/ |
| regcomp.c | 56 char *next; /* next character in RE */ member in struct:parse
113 #define PEEK() (*p->next)
114 #define PEEK2() (*(p->next+1))
115 #define MORE() (p->next < p->end)
116 #define MORE2() (p->next+1 < p->end)
119 #define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
121 #define NEXT() (p->next++)
122 #define NEXT2() (p->next += 2
[all...] |
| /packages/apps/Mms/src/com/android/mms/dom/smil/ |
| SmilPlayer.java | 62 NEXT,
291 return mAction == SmilPlayerAction.NEXT;
362 public synchronized void next() { method in class:SmilPlayer
364 mAction = SmilPlayerAction.NEXT;
|
| /external/opencv/cv/src/ |
| mycvHaarDetectObjects.cpp | 93 struct MyCvHidHaarStageClassifier* next; member in struct:MyCvHidHaarStageClassifier
277 hid_stage_classifier->next = (stage_classifier->next == -1)
278 ? NULL : out->stage_classifier + stage_classifier->next;
282 out->is_tree |= hid_stage_classifier->next != NULL;
456 #define NEXT(n, i) (((n) + (i)/(n)) >> 1)
460 unsigned int n1 = NEXT(n, number);
464 n1 = NEXT(n, number);
540 // while( ptr && ptr->next == NULL ) ptr = ptr->parent;
546 // ptr = ptr->next;
[all...] |
| /packages/apps/Music/src/com/android/music/ |
| MediaPlaybackService.java | 68 * the new list of files right away, next or once all the currently
72 public static final int NEXT = 2;
95 public static final String CMDNEXT = "next";
100 public static final String NEXT_ACTION = "com.android.music.musicservicecommand.next";
188 next(true);
202 next(false);
261 next(true);
527 // Make sure we don't auto-skip to the next song, since that
535 // the "current" file, goes to the next and: playback starts on its
631 next(true)
1255 public void next(boolean force) { method in class:MediaPlaybackService
1950 public void next() { method in class:MediaPlaybackService.ServiceStub
[all...] |
