| /lib/xz/ |
| H A D | xz_dec_stream.c | 36 uint32_t pos; member in struct:xz_dec
126 size_t pos; member in struct:xz_dec::__anon26
153 * must have set s->temp.pos to indicate how much data we are supposed
154 * to copy into s->temp.buf. Return true once s->temp.pos has reached
160 b->in_size - b->in_pos, s->temp.size - s->temp.pos);
162 memcpy(s->temp.buf + s->temp.pos, b->in + b->in_pos, copy_size);
164 s->temp.pos += copy_size;
166 if (s->temp.pos == s->temp.size) {
167 s->temp.pos = 0;
180 if (s->pos
[all...] |
| H A D | xz_dec_lzma2.c | 32 * start <= pos <= full <= end
33 * pos <= limit <= end
52 size_t pos; member in struct:dictionary
294 dict->pos = 0;
302 if (dict->end - dict->pos <= out_max)
305 dict->limit = dict->pos + out_max;
311 return dict->pos < dict->limit;
322 size_t offset = dict->pos - dist - 1;
324 if (dist >= dict->pos)
335 dict->buf[dict->pos
[all...] |
| H A D | xz_dec_bcj.c | 45 uint32_t pos; member in struct:xz_dec_bcj
132 dest = src - (s->pos + (uint32_t)i + 5);
169 instr -= s->pos + (uint32_t)i;
242 addr -= s->pos + (uint32_t)i;
275 addr -= s->pos + (uint32_t)i + 8;
301 addr -= s->pos + (uint32_t)i + 4;
325 instr -= s->pos + (uint32_t)i;
338 * Apply the selected BCJ filter. Update *pos and s->pos to match the amount
346 uint8_t *buf, size_t *pos, size_
345 bcj_apply(struct xz_dec_bcj *s, uint8_t *buf, size_t *pos, size_t size) argument
[all...] |
| H A D | xz_dec_test.c | 103 size_t size, loff_t *pos)
102 xz_dec_test_write(struct file *file, const char __user *buf, size_t size, loff_t *pos) argument
|
| /lib/ |
| H A D | decompress_inflate.c | 40 long *pos,
92 if (pos)
93 *pos = 0;
131 /* TODO: handle case where both pos and fill are set */
166 if (pos)
168 *pos = strm->next_in - zbuf+8;
36 gunzip(unsigned char *buf, long len, long (*fill)(void*, unsigned long), long (*flush)(void*, unsigned long), unsigned char *out_buf, long *pos, void(*error)(char *x)) argument
|
| H A D | dynamic_debug.c | 511 int pos = 0; local
517 pos += snprintf(buf + pos, remaining(pos), "<intr> ");
519 pos += snprintf(buf + pos, remaining(pos), "[%d] ",
522 pos_after_tid = pos;
524 pos += snprintf(buf + pos, remainin
725 ddebug_proc_start(struct seq_file *m, loff_t *pos) argument
750 ddebug_proc_next(struct seq_file *m, void *p, loff_t *pos) argument
[all...] |
| H A D | bitmap.c | 716 * @pos: a bit position in @buf (0 <= @pos < @bits)
719 * Map the bit at position @pos in @buf (of length @bits) to the
720 * ordinal of which set bit it is. If it is not set or if @pos
723 * If for example, just bits 4 through 7 are set in @buf, then @pos
725 * and other @pos values will get mapped to -1. When @pos value 7
731 static int bitmap_pos_to_ord(const unsigned long *buf, int pos, int bits) argument
735 if (pos < 0 || pos >
769 int pos = 0; local
1055 __reg_op(unsigned long *bitmap, unsigned int pos, int order, int reg_op) argument
1123 unsigned int pos, end; /* scans bitmap by regions of size order */ local
1146 bitmap_release_region(unsigned long *bitmap, unsigned int pos, int order) argument
1163 bitmap_allocate_region(unsigned long *bitmap, unsigned int pos, int order) argument
[all...] |
| H A D | decompress_bunzip2.c | 525 int pos, xcurrent, previous, gotcount; local
533 pos = bd->writePos;
548 bd->writePos = pos;
570 pos = dbuf[pos];
571 xcurrent = pos&0xff;
572 pos >>= 8;
615 pos = bd->writePos;
682 long *pos,
733 if (pos)
678 bunzip2(unsigned char *buf, long len, long (*fill)(void*, unsigned long), long (*flush)(void*, unsigned long), unsigned char *outbuf, long *pos, void(*error)(char *x)) argument
746 decompress(unsigned char *buf, long len, long (*fill)(void*, unsigned long), long (*flush)(void*, unsigned long), unsigned char *outbuf, long *pos, void(*error)(char *x)) argument
[all...] |
| H A D | klist.c | 145 * @pos: node to put @n after
147 void klist_add_behind(struct klist_node *n, struct klist_node *pos) argument
149 struct klist *k = knode_klist(pos);
153 list_add(&n->n_node, &pos->n_node);
161 * @pos: node to put @n after
163 void klist_add_before(struct klist_node *n, struct klist_node *pos) argument
165 struct klist *k = knode_klist(pos);
169 list_add_tail(&n->n_node, &pos->n_node);
|
| H A D | btree.c | 224 static int keycmp(struct btree_geo *geo, unsigned long *node, int pos, argument
227 return longcmp(bkey(geo, node, pos), key, geo->keylen);
453 int i, pos, fill, err; local
464 pos = getpos(geo, node, key);
465 fill = getfill(geo, node, pos);
467 BUG_ON(pos < fill && keycmp(geo, node, pos, key) == 0);
500 for (i = fill; i > pos; i--) {
504 setkey(geo, node, pos, key);
505 setval(geo, node, pos, va
595 int i, pos, fill; local
[all...] |
| H A D | decompress_unlzma.c | 222 uint8_t pos; member in struct:lzma_header
302 int32_t pos; local
305 pos = wr->buffer_pos - offs;
306 return wr->buffer[pos];
308 uint32_t pos = wr->buffer_pos - offs; local
309 while (pos >= wr->header->dict_size)
310 pos += wr->header->dict_size;
311 return wr->buffer[pos];
586 if (header.pos >= (9 * 5 * 5)) {
592 lc = header.pos;
[all...] |