Home
last modified time | relevance | path

Searched refs:pos (Results 1 – 22 of 22) sorted by relevance

/lib/xz/
Dxz_dec_stream.c36 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 …]
Dxz_dec_lzma2.c52 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 …]
Dxz_dec_bcj.c45 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 …]
Dxz_dec_test.c103 size_t size, loff_t *pos) in xz_dec_test_write() argument
/lib/
Ddecompress_inflate.c42 long *pos, in __gunzip() argument
94 if (pos) in __gunzip()
95 *pos = 0; in __gunzip()
168 if (pos) in __gunzip()
170 *pos = strm->next_in - zbuf+8; in __gunzip()
191 long *pos, in gunzip() argument
194 return __gunzip(buf, len, fill, flush, out_buf, 0, pos, error); in gunzip()
201 long *pos, in __decompress() argument
204 return __gunzip(buf, len, fill, flush, out_buf, out_len, pos, error); in __decompress()
Ddynamic_debug.c522 int pos = 0; in dynamic_emit_prefix() local
528 pos += snprintf(buf + pos, remaining(pos), "<intr> "); in dynamic_emit_prefix()
530 pos += snprintf(buf + pos, remaining(pos), "[%d] ", in dynamic_emit_prefix()
533 pos_after_tid = pos; in dynamic_emit_prefix()
535 pos += snprintf(buf + pos, remaining(pos), "%s:", in dynamic_emit_prefix()
538 pos += snprintf(buf + pos, remaining(pos), "%s:", in dynamic_emit_prefix()
541 pos += snprintf(buf + pos, remaining(pos), "%d:", in dynamic_emit_prefix()
543 if (pos - pos_after_tid) in dynamic_emit_prefix()
544 pos += snprintf(buf + pos, remaining(pos), " "); in dynamic_emit_prefix()
545 if (pos >= PREFIX_SIZE) in dynamic_emit_prefix()
[all …]
Dbitmap.c677 static int bitmap_pos_to_ord(const unsigned long *buf, unsigned int pos, unsigned int nbits) in bitmap_pos_to_ord() argument
679 if (pos >= nbits || !test_bit(pos, buf)) in bitmap_pos_to_ord()
682 return __bitmap_weight(buf, pos); in bitmap_pos_to_ord()
705 unsigned int pos; in bitmap_ord_to_pos() local
707 for (pos = find_first_bit(buf, nbits); in bitmap_ord_to_pos()
708 pos < nbits && ord; in bitmap_ord_to_pos()
709 pos = find_next_bit(buf, nbits, pos + 1)) in bitmap_ord_to_pos()
712 return pos; in bitmap_ord_to_pos()
991 static int __reg_op(unsigned long *bitmap, unsigned int pos, int order, int reg_op) in __reg_op() argument
1007 index = pos / BITS_PER_LONG; in __reg_op()
[all …]
Ddecompress_bunzip2.c525 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 …]
Dbtree.c224 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 …]
Dklist.c147 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()
Ddecompress_unlzma.c222 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()
Dparman.c312 struct list_head *pos; in parman_prio_init() local
318 list_for_each(pos, &parman->prio_list) { in parman_prio_init()
319 prio2 = list_entry(pos, typeof(*prio2), list); in parman_prio_init()
323 list_add_tail(&prio->list, pos); in parman_prio_init()
Dtest_rhashtable.c151 struct rhash_head *pos; in test_bucket_stats() local
165 while ((pos = rhashtable_walk_next(&hti))) { in test_bucket_stats()
166 if (PTR_ERR(pos) == -EAGAIN) { in test_bucket_stats()
170 } else if (IS_ERR(pos)) { in test_bucket_stats()
172 PTR_ERR(pos)); in test_bucket_stats()
Drhashtable.c1079 struct rhash_head *pos, *next; in rhashtable_free_and_destroy() local
1082 for (pos = rht_dereference(*rht_bucket(tbl, i), ht), in rhashtable_free_and_destroy()
1083 next = !rht_is_a_nulls(pos) ? in rhashtable_free_and_destroy()
1084 rht_dereference(pos->next, ht) : NULL; in rhashtable_free_and_destroy()
1085 !rht_is_a_nulls(pos); in rhashtable_free_and_destroy()
1086 pos = next, in rhashtable_free_and_destroy()
1087 next = !rht_is_a_nulls(pos) ? in rhashtable_free_and_destroy()
1088 rht_dereference(pos->next, ht) : NULL) in rhashtable_free_and_destroy()
1089 rhashtable_free_one(ht, pos, free_fn, arg); in rhashtable_free_and_destroy()
Ddecompress_unlzo.c296 long *pos, in __decompress() argument
299 return unlzo(buf, len, fill, flush, out_buf, pos, error); in __decompress()
Ddecompress_unxz.c402 long *pos, in __decompress() argument
405 return unxz(buf, len, fill, flush, out_buf, pos, error); in __decompress()
/lib/zstd/
Dhuf_compress.c317 int pos; in HUF_setMaxHeight() local
323 for (pos = n; pos >= 0; pos--) { in HUF_setMaxHeight()
324 if (huffNode[pos].nbBits >= currNbBits) in HUF_setMaxHeight()
326 currNbBits = huffNode[pos].nbBits; /* < maxNbBits */ in HUF_setMaxHeight()
327 rankLast[maxNbBits - currNbBits] = pos; in HUF_setMaxHeight()
406 U32 pos = rank[r].curr++; in HUF_sort() local
407 while ((pos > rank[r].base) && (c > huffNode[pos - 1].count)) in HUF_sort()
408 huffNode[pos] = huffNode[pos - 1], pos--; in HUF_sort()
409 huffNode[pos].count = c; in HUF_sort()
410 huffNode[pos].byte = (BYTE)n; in HUF_sort()
Ddecompress.c234 size_t pos = 5; in ZSTD_getFrameParams() local
246 BYTE const wlByte = ip[pos++]; in ZSTD_getFrameParams()
258 dictID = ip[pos]; in ZSTD_getFrameParams()
259 pos++; in ZSTD_getFrameParams()
262 dictID = ZSTD_readLE16(ip + pos); in ZSTD_getFrameParams()
263 pos += 2; in ZSTD_getFrameParams()
266 dictID = ZSTD_readLE32(ip + pos); in ZSTD_getFrameParams()
267 pos += 4; in ZSTD_getFrameParams()
274 frameContentSize = ip[pos]; in ZSTD_getFrameParams()
276 case 1: frameContentSize = ZSTD_readLE16(ip + pos) + 256; break; in ZSTD_getFrameParams()
[all …]
Dcompress.c2442 size_t pos; in ZSTD_writeFrameHeader() local
2449 pos = 5; in ZSTD_writeFrameHeader()
2451 op[pos++] = windowLogByte; in ZSTD_writeFrameHeader()
2456 op[pos] = (BYTE)(dictID); in ZSTD_writeFrameHeader()
2457 pos++; in ZSTD_writeFrameHeader()
2460 ZSTD_writeLE16(op + pos, (U16)dictID); in ZSTD_writeFrameHeader()
2461 pos += 2; in ZSTD_writeFrameHeader()
2464 ZSTD_writeLE32(op + pos, dictID); in ZSTD_writeFrameHeader()
2465 pos += 4; in ZSTD_writeFrameHeader()
2472 op[pos++] = (BYTE)(pledgedSrcSize); in ZSTD_writeFrameHeader()
[all …]
Dzstd_opt.h200 #define SET_PRICE(pos, mlen_, offset_, litlen_, price_) \ argument
202 while (last_pos < pos) { \
206 opt[pos].mlen = mlen_; \
207 opt[pos].off = offset_; \
208 opt[pos].litlen = litlen_; \
209 opt[pos].price = price_; \
/lib/842/
D842_compress.c434 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()
D842_decompress.c188 u64 pos = total - section; in __do_index() local
193 if (offset >= pos) in __do_index()