Home
last modified time | relevance | path

Searched refs:s (Results 1 – 25 of 97) sorted by relevance

1234

/lib/zlib_deflate/
A Ddeflate.c173 s->prev[(str) & s->w_mask] = match_head = s->head[s->ins_h], \
251 s->w_mask = s->w_size - 1; in zlib_deflateInit2()
812 n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more); in fill_window()
817 s->ins_h = s->window[s->strstart]; in fill_window()
818 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]); in fill_window()
962 check_match(s, s->strstart, s->match_start, s->match_length); in deflate_fast()
986 s->ins_h = s->window[s->strstart]; in deflate_fast()
987 UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]); in deflate_fast()
1045 s->prev_length = s->match_length, s->prev_match = s->match_start; in deflate_slow()
1076 check_match(s, s->strstart-1, s->prev_match, s->prev_length); in deflate_slow()
[all …]
A Ddeftree.c249 s->l_desc.dyn_tree = s->dyn_ltree; in zlib_tr_init()
252 s->d_desc.dyn_tree = s->dyn_dtree; in zlib_tr_init()
255 s->bl_desc.dyn_tree = s->bl_tree; in zlib_tr_init()
284 s->opt_len = s->static_len = 0L; in init_block()
285 s->last_lit = s->matches = 0; in init_block()
299 s->heap[SMALLEST] = s->heap[s->heap_len--]; \
328 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { in pqdownheap()
543 s->depth[node] = (uch) (max(s->depth[n], s->depth[m]) + 1); in build_tree()
557 s->heap[--(s->heap_max)] = s->heap[SMALLEST]; in build_tree()
677 scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code); in build_bl_tree()
[all …]
A Ddefutil.h260 #define put_byte(s, c) {s->pending_buf[s->pending++] = (c);} argument
317 put_short(s, s->bi_buf); in bi_flush()
321 put_byte(s, (Byte)s->bi_buf); in bi_flush()
333 put_short(s, s->bi_buf); in bi_windup()
335 put_byte(s, (Byte)s->bi_buf); in bi_windup()
340 s->bits_sent = (s->bits_sent+7) & ~7; in bi_windup()
379 put_short(s, s->bi_buf); in send_bits()
393 s->bi_buf |= (val << s->bi_valid);\
394 put_short(s, s->bi_buf);\
398 s->bi_buf |= (value) << s->bi_valid;\
[all …]
/lib/xz/
A Dxz_dec_stream.c165 if (s->temp.pos == s->temp.size) { in fill_temp()
284 s->crc32 = xz_crc32(b->in + s->in_start, in_used, s->crc32); in index_update()
308 s->index.count = s->vli; in dec_index()
322 s->index.hash.unpadded += s->vli; in dec_index()
437 if (s->temp.buf[8] != 0 || s->temp.buf[9] != s->check_type) in dec_stream_footer()
476 if (dec_vli(s, s->temp.buf, &s->temp.pos, s->temp.size) in dec_block_header()
487 if (dec_vli(s, s->temp.buf, &s->temp.pos, s->temp.size) in dec_block_header()
503 ret = xz_dec_bcj_reset(s->bcj, s->temp.buf[s->temp.pos++]); in dec_block_header()
517 if (s->temp.size - s->temp.pos < 2) in dec_block_header()
532 ret = xz_dec_lzma2_reset(s->lzma2, s->temp.buf[s->temp.pos++]); in dec_block_header()
[all …]
A Dxz_dec_lzma2.c723 if (!rc_bit(&s->rc, &s->lzma.is_rep0[s->lzma.state])) { in lzma_rep_match()
731 if (!rc_bit(&s->rc, &s->lzma.is_rep1[s->lzma.state])) { in lzma_rep_match()
734 if (!rc_bit(&s->rc, &s->lzma.is_rep2[s->lzma.state])) { in lzma_rep_match()
762 dict_repeat(&s->dict, &s->lzma.len, s->lzma.rep0); in lzma_main()
775 if (rc_bit(&s->rc, &s->lzma.is_rep[s->lzma.state])) in lzma_main()
906 s->rc.in = s->temp.buf; in lzma2_lzma()
909 if (!lzma_main(s) || s->rc.in_pos > s->temp.size + tmp) in lzma2_lzma()
916 memmove(s->temp.buf, s->temp.buf + s->rc.in_pos, in lzma2_lzma()
1303 s->s.dict.mode = mode; in xz_dec_microlzma_alloc()
1331 s->s.temp.size = 0; in xz_dec_microlzma_reset()
[all …]
A Dxz_dec_bcj.c567 memmove(s->temp.buf, s->temp.buf + copy_size, s->temp.size); in bcj_flush()
608 memcpy(b->out + b->out_pos, s->temp.buf, s->temp.size); in xz_dec_bcj_run()
613 && (s->ret != XZ_OK || s->single_call)) in xz_dec_bcj_run()
628 memcpy(s->temp.buf, b->out + b->out_pos, s->temp.size); in xz_dec_bcj_run()
663 if (s->ret != XZ_OK && s->ret != XZ_STREAM_END) in xz_dec_bcj_run()
666 bcj_apply(s, s->temp.buf, &s->temp.filtered, s->temp.size); in xz_dec_bcj_run()
674 s->temp.filtered = s->temp.size; in xz_dec_bcj_run()
686 struct xz_dec_bcj *s = kmalloc(sizeof(*s), GFP_KERNEL); in xz_dec_bcj_create() local
690 return s; in xz_dec_bcj_create()
727 s->type = id; in xz_dec_bcj_reset()
[all …]
/lib/tests/
A Dseq_buf_kunit.c14 struct seq_buf s; in seq_buf_init_test() local
28 DECLARE_SEQ_BUF(s, 24); in seq_buf_declare_test()
40 DECLARE_SEQ_BUF(s, 128); in seq_buf_clear_test()
47 seq_buf_clear(&s); in seq_buf_clear_test()
56 DECLARE_SEQ_BUF(s, 16); in seq_buf_puts_test()
77 seq_buf_puts(&s, "0"); in seq_buf_puts_overflow_test()
82 seq_buf_clear(&s); in seq_buf_puts_overflow_test()
90 DECLARE_SEQ_BUF(s, 4); in seq_buf_putc_test()
92 seq_buf_putc(&s, 'a'); in seq_buf_putc_test()
110 seq_buf_clear(&s); in seq_buf_putc_test()
[all …]
A Dslub_kunit.c27 return s; in test_kmem_cache_create()
39 validate_slab_cache(s); in test_clobber_zone()
43 kmem_cache_free(s, p); in test_clobber_zone()
44 kmem_cache_destroy(s); in test_clobber_zone()
56 kmem_cache_free(s, p); in test_next_pointer()
60 p[s->offset] = ~p[s->offset]; in test_next_pointer()
90 kmem_cache_destroy(s); in test_next_pointer()
99 kmem_cache_free(s, p); in test_first_word()
168 struct kmem_cache *s; in test_kfree_rcu() local
224 if (!s) in test_kfree_rcu_wq_destroy()
[all …]
/lib/crypto/arm64/
A Dchacha-neon-core.S46 add v0.4s, v0.4s, v1.4s
51 add v2.4s, v2.4s, v3.4s
57 add v0.4s, v0.4s, v1.4s
62 add v2.4s, v2.4s, v3.4s
75 add v0.4s, v0.4s, v1.4s
80 add v2.4s, v2.4s, v3.4s
86 add v0.4s, v0.4s, v1.4s
91 add v2.4s, v2.4s, v3.4s
127 add v0.4s, v0.4s, v8.4s
131 add v1.4s, v1.4s, v9.4s
[all …]
A Dsha256-ce.S32 add t1.4s, v\s0\().4s, \rc\().4s
37 add t0.4s, v\s0\().4s, \rc\().4s
45 sha256su0 v\s0\().4s, v\s1\().4s
47 sha256su1 v\s0\().4s, v\s2\().4s, v\s3\().4s
81 ld1 { v0.4s- v3.4s}, [x8], #64
82 ld1 { v4.4s- v7.4s}, [x8], #64
84 ld1 {v12.4s-v15.4s}, [x8]
87 ld1 {dgav.4s, dgbv.4s}, [x0]
98 add t0.4s, v16.4s, v0.4s
123 add dgav.4s, dgav.4s, dg0v.4s
[all …]
A Dsha1-ce-core.S36 add t1.4s, v\s0\().4s, \rc\().4s
39 sha1\op dg0q, \dg1, t0.4s
45 add t0.4s, v\s0\().4s, \rc\().4s
53 sha1su0 v\s0\().4s, v\s1\().4s, v\s2\().4s
55 sha1su1 v\s0\().4s, v\s3\().4s
76 ld1 {dgav.4s}, [x0]
80 0: ld1 {v8.4s-v11.4s}, [x1], #64
88 add t0.4s, v8.4s, k0.4s
116 add dgbv.2s, dgbv.2s, dg1v.2s
117 add dgav.4s, dgav.4s, dg0v.4s
[all …]
/lib/
A Dseq_buf.c40 return s->len + len <= s->size; in seq_buf_can_fit()
73 if (s->len < s->size) { in seq_buf_vprintf()
74 len = vsnprintf(s->buffer + s->len, s->size - s->len, fmt, args); in seq_buf_vprintf()
75 if (s->len + len < s->size) { in seq_buf_vprintf()
119 if (s->size == 0 || s->len == 0) in seq_buf_do_printk()
131 if (start < s->buffer + s->len) in seq_buf_do_printk()
161 if (s->len < s->size) { in seq_buf_bprintf()
163 if (s->len + ret < s->size) { in seq_buf_bprintf()
192 memcpy(s->buffer + s->len, str, len); in seq_buf_puts()
216 s->buffer[s->len++] = c; in seq_buf_putc()
[all …]
A Dwin_minmax.c42 m->s[0] = m->s[1]; in minmax_subwin_update()
43 m->s[1] = m->s[2]; in minmax_subwin_update()
44 m->s[2] = *val; in minmax_subwin_update()
46 m->s[0] = m->s[1]; in minmax_subwin_update()
47 m->s[1] = m->s[2]; in minmax_subwin_update()
50 } else if (unlikely(m->s[1].t == m->s[0].t) && dt > win/4) { in minmax_subwin_update()
55 m->s[2] = m->s[1] = *val; in minmax_subwin_update()
56 } else if (unlikely(m->s[2].t == m->s[1].t) && dt > win/2) { in minmax_subwin_update()
76 m->s[2] = m->s[1] = val; in minmax_running_max()
78 m->s[2] = val; in minmax_running_max()
[all …]
A Dkstrtox.c30 if (_tolower(s[1]) == 'x' && isxdigit(s[2])) in _parse_integer_fixup_radix()
37 if (*base == 16 && s[0] == '0' && _tolower(s[1]) == 'x') in _parse_integer_fixup_radix()
38 s += 2; in _parse_integer_fixup_radix()
39 return s; in _parse_integer_fixup_radix()
84 s++; in _parse_integer_limit()
101 s = _parse_integer_fixup_radix(s, &base); in _kstrtoull()
107 s += rv; in _kstrtoull()
109 s++; in _kstrtoull()
110 if (*s) in _kstrtoull()
135 s++; in kstrtoull()
[all …]
A Dparser.c51 s += meta - p; in match_one()
57 if (*s++ != '%') in match_one()
66 args[argc].from = s; in match_one()
96 s = args[argc].to; in match_one()
290 while (*s) { in match_wildcard()
293 s++; in match_wildcard()
298 str = s; in match_wildcard()
304 if (*s == *p) { in match_wildcard()
305 s++; in match_wildcard()
311 s = str; in match_wildcard()
[all …]
A Dstring.c331 for (; *s != (char)c; ++s) in strchr()
350 while (*s && *s != (char)c) in strchrnul()
351 s++; in strchrnul()
369 while (count-- && *s && *s != (char)c) in strnchrnul()
370 s++; in strnchrnul()
519 *s = end; in strsep()
540 return s; in memset()
562 return s; in memset16()
584 return s; in memset32()
606 return s; in memset64()
[all …]
A Dashrdi3.c22 w.s.high = in __ashrdi3()
23 uu.s.high >> 31; in __ashrdi3()
24 w.s.low = uu.s.high >> -bm; in __ashrdi3()
26 const unsigned int carries = (unsigned int) uu.s.high << bm; in __ashrdi3()
28 w.s.high = uu.s.high >> b; in __ashrdi3()
29 w.s.low = ((unsigned int) uu.s.low >> b) | carries; in __ashrdi3()
A Dcmpdi2.c18 if (au.s.high < bu.s.high) in __cmpdi2()
20 else if (au.s.high > bu.s.high) in __cmpdi2()
23 if ((unsigned int) au.s.low < (unsigned int) bu.s.low) in __cmpdi2()
25 else if ((unsigned int) au.s.low > (unsigned int) bu.s.low) in __cmpdi2()
A Ducmpdi2.c13 if ((unsigned int) au.s.high < (unsigned int) bu.s.high) in __ucmpdi2()
15 else if ((unsigned int) au.s.high > (unsigned int) bu.s.high) in __ucmpdi2()
17 if ((unsigned int) au.s.low < (unsigned int) bu.s.low) in __ucmpdi2()
19 else if ((unsigned int) au.s.low > (unsigned int) bu.s.low) in __ucmpdi2()
A Dlshrdi3.c21 w.s.high = 0; in __lshrdi3()
22 w.s.low = (unsigned int) uu.s.high >> -bm; in __lshrdi3()
24 const unsigned int carries = (unsigned int) uu.s.high << bm; in __lshrdi3()
26 w.s.high = (unsigned int) uu.s.high >> b; in __lshrdi3()
27 w.s.low = ((unsigned int) uu.s.low >> b) | carries; in __lshrdi3()
A Dashldi3.c21 w.s.low = 0; in __ashldi3()
22 w.s.high = (unsigned int) uu.s.low << -bm; in __ashldi3()
24 const unsigned int carries = (unsigned int) uu.s.low >> bm; in __ashldi3()
26 w.s.low = (unsigned int) uu.s.low << b; in __ashldi3()
27 w.s.high = ((unsigned int) uu.s.high << b) | carries; in __ashldi3()
/lib/zstd/compress/
A Dfse_compress.c126 for (s=0; s<maxSV1; ++s, sv += add) { in FSE_buildCTable_wksp()
145 for (s = 0; s < (size_t)tableSize; s += unroll) { in FSE_buildCTable_wksp()
179 for (s=0; s<=maxSymbolValue; s++) { in FSE_buildCTable_wksp()
391 for (s=0; s<=maxSymbolValue; s++) { in FSE_normalizeM2()
419 for (s=0; s<=maxSymbolValue; s++) { in FSE_normalizeM2()
434 for (s=0; s<=maxSymbolValue; s++) in FSE_normalizeM2()
435 if (count[s] > maxC) { maxV=s; maxC=count[s]; } in FSE_normalizeM2()
451 for (s=0; s<=maxSymbolValue; s++) { in FSE_normalizeM2()
487 for (s=0; s<=maxSymbolValue; s++) { in FSE_normalizeCount()
515 for (s=0; s<=maxSymbolValue; s++) in FSE_normalizeCount()
[all …]
A Dhist.c59 { U32 s; in HIST_count_simple() local
60 for (s=0; s<=maxSymbolValue; s++) in HIST_count_simple()
61 if (count[s] > largestCount) largestCount = count[s]; in HIST_count_simple()
131 { U32 s; in HIST_count_parallel_wksp() local
132 for (s=0; s<256; s++) { in HIST_count_parallel_wksp()
133 Counting1[s] += Counting2[s] + Counting3[s] + Counting4[s]; in HIST_count_parallel_wksp()
134 if (Counting1[s] > max) max = Counting1[s]; in HIST_count_parallel_wksp()
/lib/zstd/common/
A Dzstd_deps.h32 #define ZSTD_memcpy(d,s,n) __builtin_memcpy((d),(s),(n)) argument
33 #define ZSTD_memmove(d,s,n) __builtin_memmove((d),(s),(n)) argument
34 #define ZSTD_memset(d,s,n) __builtin_memset((d),(s),(n)) argument
50 #define ZSTD_malloc(s) ({ (void)(s); NULL; }) argument
52 #define ZSTD_calloc(n,s) ({ (void)(n); (void)(s); NULL; }) argument
A Dfse_decompress.c80 U32 s; in FSE_buildDTable_internal() local
81 for (s=0; s<maxSV1; s++) { in FSE_buildDTable_internal()
82 if (normalizedCounter[s]==-1) { in FSE_buildDTable_internal()
84 symbolNext[s] = 1; in FSE_buildDTable_internal()
87 symbolNext[s] = (U16)normalizedCounter[s]; in FSE_buildDTable_internal()
105 U32 s; in FSE_buildDTable_internal() local
106 for (s=0; s<maxSV1; ++s, sv += add) { in FSE_buildDTable_internal()
123 size_t s; in FSE_buildDTable_internal() local
126 for (s = 0; s < (size_t)tableSize; s += unroll) { in FSE_buildDTable_internal()
139 U32 s, position = 0; in FSE_buildDTable_internal() local
[all …]

Completed in 58 milliseconds

1234