/lib/xz/ |
D | xz_dec_stream.c | 36 uint32_t pos; member 126 size_t pos; member 160 b->in_size - b->in_pos, s->temp.size - s->temp.pos); in fill_temp() 162 memcpy(s->temp.buf + s->temp.pos, b->in + b->in_pos, copy_size); in fill_temp() 164 s->temp.pos += copy_size; in fill_temp() 166 if (s->temp.pos == s->temp.size) { in fill_temp() 167 s->temp.pos = 0; in fill_temp() 180 if (s->pos == 0) in dec_vli() 187 s->vli |= (vli_type)(byte & 0x7F) << s->pos; in dec_vli() 191 if (byte == 0 && s->pos != 0) in dec_vli() [all …]
|
D | xz_dec_lzma2.c | 52 size_t pos; member 294 dict->pos = 0; in dict_reset() 302 if (dict->end - dict->pos <= out_max) in dict_limit() 305 dict->limit = dict->pos + out_max; in dict_limit() 311 return dict->pos < dict->limit; in dict_has_space() 322 size_t offset = dict->pos - dist - 1; in dict_get() 324 if (dist >= dict->pos) in dict_get() 335 dict->buf[dict->pos++] = byte; in dict_put() 337 if (dict->full < dict->pos) in dict_put() 338 dict->full = dict->pos; in dict_put() [all …]
|
D | xz_dec_bcj.c | 45 uint32_t pos; member 132 dest = src - (s->pos + (uint32_t)i + 5); in bcj_x86() 169 instr -= s->pos + (uint32_t)i; in bcj_powerpc() 242 addr -= s->pos + (uint32_t)i; in bcj_ia64() 275 addr -= s->pos + (uint32_t)i + 8; in bcj_arm() 301 addr -= s->pos + (uint32_t)i + 4; in bcj_armthumb() 325 instr -= s->pos + (uint32_t)i; in bcj_sparc() 346 uint8_t *buf, size_t *pos, size_t size) in bcj_apply() argument 350 buf += *pos; in bcj_apply() 351 size -= *pos; in bcj_apply() [all …]
|
D | xz_dec_test.c | 103 size_t size, loff_t *pos) in xz_dec_test_write() argument
|
/lib/ |
D | decompress_inflate.c | 41 long *pos, in __gunzip() argument 93 if (pos) in __gunzip() 94 *pos = 0; in __gunzip() 167 if (pos) in __gunzip() 169 *pos = strm->next_in - zbuf+8; in __gunzip() 190 long *pos, in gunzip() argument 193 return __gunzip(buf, len, fill, flush, out_buf, 0, pos, error); in gunzip() 200 long *pos, in __decompress() argument 203 return __gunzip(buf, len, fill, flush, out_buf, out_len, pos, error); in __decompress()
|
D | bitmap.c | 639 static int bitmap_pos_to_ord(const unsigned long *buf, unsigned int pos, unsigned int nbits) in bitmap_pos_to_ord() argument 641 if (pos >= nbits || !test_bit(pos, buf)) in bitmap_pos_to_ord() 644 return __bitmap_weight(buf, pos); in bitmap_pos_to_ord() 667 unsigned int pos; in bitmap_ord_to_pos() local 669 for (pos = find_first_bit(buf, nbits); in bitmap_ord_to_pos() 670 pos < nbits && ord; in bitmap_ord_to_pos() 671 pos = find_next_bit(buf, nbits, pos + 1)) in bitmap_ord_to_pos() 674 return pos; in bitmap_ord_to_pos() 947 static int __reg_op(unsigned long *bitmap, unsigned int pos, int order, int reg_op) in __reg_op() argument 963 index = pos / BITS_PER_LONG; in __reg_op() [all …]
|
D | dynamic_debug.c | 514 int pos = 0; in dynamic_emit_prefix() local 520 pos += snprintf(buf + pos, remaining(pos), "<intr> "); in dynamic_emit_prefix() 522 pos += snprintf(buf + pos, remaining(pos), "[%d] ", in dynamic_emit_prefix() 525 pos_after_tid = pos; in dynamic_emit_prefix() 527 pos += snprintf(buf + pos, remaining(pos), "%s:", in dynamic_emit_prefix() 530 pos += snprintf(buf + pos, remaining(pos), "%s:", in dynamic_emit_prefix() 533 pos += snprintf(buf + pos, remaining(pos), "%d:", in dynamic_emit_prefix() 535 if (pos - pos_after_tid) in dynamic_emit_prefix() 536 pos += snprintf(buf + pos, remaining(pos), " "); in dynamic_emit_prefix() 537 if (pos >= PREFIX_SIZE) in dynamic_emit_prefix() [all …]
|
D | decompress_bunzip2.c | 525 int pos, xcurrent, previous, gotcount; in read_bunzip() local 533 pos = bd->writePos; in read_bunzip() 548 bd->writePos = pos; in read_bunzip() 570 pos = dbuf[pos]; in read_bunzip() 571 xcurrent = pos&0xff; in read_bunzip() 572 pos >>= 8; in read_bunzip() 615 pos = bd->writePos; in read_bunzip() 682 long *pos, in bunzip2() argument 733 if (pos) in bunzip2() 734 *pos = bd->inbufPos; in bunzip2() [all …]
|
D | btree.c | 224 static int keycmp(struct btree_geo *geo, unsigned long *node, int pos, in keycmp() argument 227 return longcmp(bkey(geo, node, pos), key, geo->keylen); in keycmp() 453 int i, pos, fill, err; in btree_insert_level() local 464 pos = getpos(geo, node, key); in btree_insert_level() 465 fill = getfill(geo, node, pos); in btree_insert_level() 467 BUG_ON(pos < fill && keycmp(geo, node, pos, key) == 0); in btree_insert_level() 500 for (i = fill; i > pos; i--) { in btree_insert_level() 504 setkey(geo, node, pos, key); in btree_insert_level() 505 setval(geo, node, pos, val); in btree_insert_level() 595 int i, pos, fill; in btree_remove_level() local [all …]
|
D | klist.c | 147 void klist_add_behind(struct klist_node *n, struct klist_node *pos) in klist_add_behind() argument 149 struct klist *k = knode_klist(pos); in klist_add_behind() 153 list_add(&n->n_node, &pos->n_node); in klist_add_behind() 163 void klist_add_before(struct klist_node *n, struct klist_node *pos) in klist_add_before() argument 165 struct klist *k = knode_klist(pos); in klist_add_before() 169 list_add_tail(&n->n_node, &pos->n_node); in klist_add_before()
|
D | decompress_unlzma.c | 222 uint8_t pos; member 302 int32_t pos; in peek_old_byte() local 305 pos = wr->buffer_pos - offs; in peek_old_byte() 306 return wr->buffer[pos]; in peek_old_byte() 308 uint32_t pos = wr->buffer_pos - offs; in peek_old_byte() local 309 while (pos >= wr->header->dict_size) in peek_old_byte() 310 pos += wr->header->dict_size; in peek_old_byte() 311 return wr->buffer[pos]; in peek_old_byte() 586 if (header.pos >= (9 * 5 * 5)) { in unlzma() 592 lc = header.pos; in unlzma()
|
D | test_rhashtable.c | 118 struct rhash_head *pos; in test_bucket_stats() local 132 while ((pos = rhashtable_walk_next(&hti))) { in test_bucket_stats() 133 if (PTR_ERR(pos) == -EAGAIN) { in test_bucket_stats() 137 } else if (IS_ERR(pos)) { in test_bucket_stats() 139 PTR_ERR(pos)); in test_bucket_stats()
|
D | rhashtable.c | 845 struct rhash_head *pos, *next; in rhashtable_free_and_destroy() local 848 for (pos = rht_dereference(tbl->buckets[i], ht), in rhashtable_free_and_destroy() 849 next = !rht_is_a_nulls(pos) ? in rhashtable_free_and_destroy() 850 rht_dereference(pos->next, ht) : NULL; in rhashtable_free_and_destroy() 851 !rht_is_a_nulls(pos); in rhashtable_free_and_destroy() 852 pos = next, in rhashtable_free_and_destroy() 853 next = !rht_is_a_nulls(pos) ? in rhashtable_free_and_destroy() 854 rht_dereference(pos->next, ht) : NULL) in rhashtable_free_and_destroy() 855 free_fn(rht_obj(ht, pos), arg); in rhashtable_free_and_destroy()
|
D | decompress_unlzo.c | 296 long *pos, in __decompress() argument 299 return unlzo(buf, len, fill, flush, out_buf, pos, error); in __decompress()
|
D | decompress_unxz.c | 402 long *pos, in __decompress() argument 405 return unxz(buf, len, fill, flush, out_buf, pos, error); in __decompress()
|
/lib/842/ |
D | 842_compress.c | 434 u64 pos = p->in - p->instart; in update_hashtables() local 435 u64 n8 = (pos >> 3) % (1 << I8_BITS); in update_hashtables() 436 u64 n4 = (pos >> 2) % (1 << I4_BITS); in update_hashtables() 437 u64 n2 = (pos >> 1) % (1 << I2_BITS); in update_hashtables()
|
D | 842_decompress.c | 188 u64 pos = total - section; in __do_index() local 193 if (offset >= pos) in __do_index()
|