Searched refs:next (Results 1 - 25 of 5321) sorted by last modified time

1234567891011>>

/external/zxing/core/
H A Dcore.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ...
/external/yaffs2/yaffs2/
H A Ddevextras.h49 * sometimes we already know the next/prev entries and we can
57 struct list_head *next, *prev; member in struct:list_head
66 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
73 * the prev/next entries already!
77 struct list_head *next)
79 next->prev = new;
80 new->next = next;
82 prev->next = new;
95 __list_add(new, head, head->next);
75 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
119 __list_del(struct list_head *prev, struct list_head *next) argument
[all...]
H A Dyaffs_guts.c604 yaffs_Tnode *next; local
643 next = (yaffs_Tnode *) &mem[(i+1) * tnodeSize];
644 curr->internal[0] = next;
670 tnl->next = dev->allocatedTnodeList;
740 tmp = dev->allocatedTnodeList->next;
1318 newObjects[i].siblings.next =
1322 newObjects[nObjects - 1].siblings.next = (void *)dev->freeObjects;
1335 list->next = dev->allocatedObjectList;
1356 (yaffs_Object *) (dev->freeObjects->siblings.next);
1435 tn->siblings.next
[all...]
H A Dyaffs_guts.h356 struct yaffs_TnodeList_struct *next; member in struct:yaffs_TnodeList_struct
477 struct yaffs_ObjectList_struct *next; member in struct:yaffs_ObjectList_struct
670 int allocationBlockFinder; /* Used to search for next allocation block */
/external/yaffs2/yaffs2/direct/
H A Dyaffsfs.c1183 yaffs_Object *nextReturn; /* obj to be returned by next readddir */
1204 dsc->nextReturn = list_entry(dsc->dirObj->variant.directoryVariant.children.next,
1222 struct list_head *next = dsc->nextReturn->siblings.next; local
1224 if( next == &dsc->dirObj->variant.directoryVariant.children)
1227 dsc->nextReturn = list_entry(next,yaffs_Object,siblings);
1241 if(!search_contexts.next)
1246 * the next one to prevent a hanging ptr.
1281 if(!search_contexts.next)
/external/zlib/src/contrib/blast/
H A Dblast.c41 unsigned char *in; /* next input location */
52 unsigned next; /* index of next write location in out[] */ member in struct:state
133 int left; /* bits left in next or left to process */
134 short *next; /* next number of codes */ local
140 next = h->count + 1;
145 count = *next++;
151 index += count; /* else update for next length */
256 * next,
[all...]
/external/zlib/src/contrib/delphi/
H A DZLib.pas24 next_in: PChar; // next input byte
28 next_out: PChar; // next output byte should be put here
112 compressed data is exhausted and the next block is read from the input stream.
/external/zlib/src/contrib/infback9/
H A Dinfback9.c57 code *next, *lenfix, *distfix; local
67 next = fixed;
68 lenfix = next;
70 inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work);
75 distfix = next;
77 inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work);
128 have = in(in_desc, &next); \
130 next = Z_NULL; \
143 hold += (unsigned long)(*next++) << bits; \
225 z_const unsigned char FAR *next; /* nex local
[all...]
H A Dinflate9.h43 code FAR *next; /* next available space in codes[] */ member in struct:inflate_state
H A Dinftree9.c27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
145 filled is at next and has curr index bits. The code being used is huff
197 next = *table; /* current table to fill in */
231 next[(huff >> drop) + fill] = this;
245 /* go to next symbol, update count, len */
259 next += 1U << curr;
261 /* determine length of next table */
281 (*table)[low].val = (unsigned short)(next
[all...]
/external/zlib/src/contrib/pascal/
H A Dzlibpas.pas29 next_in: PChar; (* next input byte *)
33 next_out: PChar; (* next output byte should be put there *)
/external/zlib/src/contrib/puff/
H A Dpuff.c245 code |= bits(s, 1); /* get next bit */
249 index += count; /* else update for next length */
271 int left; /* bits left in next or left to process */
272 short *next; /* next number of codes */ local
278 next = h->count + 1;
283 count = *next++;
289 index += count; /* else update for next length */
/external/zlib/src/contrib/untgz/
H A Duntgz.c97 struct attr_item *next; member in struct:attr_item
263 item->next = *list;
279 item = item->next;
/external/zlib/src/
H A Ddeflate.c69 finish_started, /* finish started, need only more output at next deflate */
332 z_const unsigned char *next; local
360 next = strm->next_in;
385 strm->next_in = next;
877 * return OK instead of BUF_ERROR at next call of deflate:
912 s->last_flush = -1; /* avoid BUF_ERROR next call, see above */
915 /* If flush != Z_NO_FLUSH && avail_out == 0, the next call
918 * empty block here, this will be done at next call. This also
942 s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */
1199 /* Skip to next matc
[all...]
H A Dgzlib.c425 state->x.next += n;
H A Dgzread.c156 state->x.next = state->out;
158 memcpy(state->x.next, strm->next_in, strm->avail_in);
168 On return, state->x.have and state->x.next point to the just decompressed
170 the next gzip stream or raw data, once state->x.have is depleted. Returns 0
210 state->x.next = strm->next_out - state->x.have;
243 state->x.next = state->out;
269 state->x.next += n;
332 memcpy(buf, state->x.next, n);
333 state->x.next += n;
408 return *(state->x.next)
[all...]
H A Dgzwrite.c59 state->x.next = strm->next_out;
100 have = (unsigned)(strm->next_out - state->x.next);
101 if (have && ((got = write(state->fd, state->x.next, have)) < 0 ||
110 state->x.next = strm->next_out;
H A Dinfback.c93 static code *next; local
101 next = fixed;
102 lenfix = next;
104 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
109 distfix = next;
111 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
132 next = strm->next_in; \
143 strm->next_in = next; \
161 have = in(in_desc, &next); \
163 next
258 z_const unsigned char FAR *next; /* next input */ local
[all...]
H A Dinflate.c38 * - Use local copies of stream next and avail values, as well as local bit
122 state->lencode = state->distcode = state->next = state->codes;
272 static code *next; local
280 next = fixed;
281 lenfix = next;
283 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
288 distfix = next;
290 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
463 next = strm->next_in; \
474 strm->next_in = next; \
610 z_const unsigned char FAR *next; /* next input */ local
[all...]
H A Dinflate.h115 code FAR *next; /* next available space in codes[] */ member in struct:inflate_state
/external/zlib/src/examples/
H A Dgun.c93 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)
187 next += chunk; \
193 of buffered input at next
200 lunpipe(unsigned have, z_const unsigned char *next, struct ind *indp, int outfile, z_stream *strm) argument
387 z_const unsigned char *next = NULL; local
[all...]
H A Dgzappend.c159 to = from; /* next step in cycle */
173 unsigned left; /* bytes available at next */
175 z_const unsigned char *next; /* next byte in buffer */ member in struct:__anon34352
187 in->next = in->buf;
199 in->left--, *(in->next)++)
219 in->next += n;
294 strm->next_in = gz.next;
302 strm->next_in = gz.next;
305 /* set up output to next availabl
[all...]
H A Dgzjoin.c81 unsigned left; /* bytes remaining at next */
82 unsigned char *next; /* next byte to read */ member in struct:__anon34353
114 in->next = in->buf;
129 in->next = in->buf;
141 in->left ? (in->left--, *(in->next)++) : \
166 in->next += skip;
198 in->next += skip;
261 strm->next_in = in->next;
312 start = in->next;
[all...]
H A Dgzlog.c20 the next time an append operation is attempted.
33 foo.dict -- dictionary of the last 32K of data for next compression
146 - The operation in process. This is the next two bits in the last byte (the
185 provide a dictionary for the next invocation of this procedure.
189 only the previous compressed data and proceed to the step after the next
912 size_t len, next; local
937 next = 0;
938 while (next < len) {
942 if (next + block > len ||
943 read(log->fd, (char *)data + next, bloc
[all...]
H A Dzran.c95 struct point *next; local
113 next = realloc(index->list, sizeof(struct point) * index->size);
114 if (next == NULL) {
118 index->list = next;
122 next = index->list + index->have;
123 next->bits = bits;
124 next->in = in;
125 next->out = out;
127 memcpy(next->window, window + WINSIZE - left, left);
129 memcpy(next
[all...]

Completed in 1256 milliseconds

1234567891011>>