Searched refs:start (Results 1 - 24 of 24) sorted by relevance

/lib/zlib_inflate/
H A Dinffast.h11 void inflate_fast (z_streamp strm, unsigned start);
H A Dinffast.c64 start >= strm->avail_out
86 - @start: inflate()'s starting value for strm->avail_out
88 void inflate_fast(z_streamp strm, unsigned start) argument
121 beg = out - (start - strm->avail_out);
228 if (write < len) { /* some from start of window */
/lib/
H A Dbsearch.c36 size_t start = 0, end = num; local
39 while (start < end) {
40 size_t mid = start + (end - start) / 2;
46 start = mid + 1;
H A Dpci_iomap.c28 resource_size_t start = pci_resource_start(dev, bar); local
32 if (!len || !start)
37 return __pci_ioport_map(dev, start, len);
40 return ioremap(start, len);
41 return ioremap_nocache(start, len);
H A Diommu-helper.c20 unsigned long start, unsigned int nr,
29 index = bitmap_find_next_zero_area(map, size, start, nr, align_mask);
33 start = index + 1;
19 iommu_area_alloc(unsigned long *map, unsigned long size, unsigned long start, unsigned int nr, unsigned long shift, unsigned long boundary_size, unsigned long align_mask) argument
H A Dinterval_tree.c6 #define START(node) ((node)->start)
H A Dextable.c36 void sort_extable(struct exception_table_entry *start, argument
39 sort(start, finish - start, sizeof(struct exception_table_entry),
H A Dgenalloc.c78 * @start: a bit position in @map
81 * Set @nr bits start from @start in @map lock-lessly. Several users
86 static int bitmap_set_ll(unsigned long *map, int start, int nr) argument
88 unsigned long *p = map + BIT_WORD(start);
89 const int size = start + nr;
90 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG);
91 unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start);
113 * @start: a bit position in @map
116 * Clear @nr bits start fro
121 bitmap_clear_ll(unsigned long *map, int start, int nr) argument
414 addr_in_gen_pool(struct gen_pool *pool, unsigned long start, size_t size) argument
505 gen_pool_first_fit(unsigned long *map, unsigned long size, unsigned long start, unsigned int nr, void *data) argument
522 gen_pool_first_fit_order_align(unsigned long *map, unsigned long size, unsigned long start, unsigned int nr, void *data) argument
544 gen_pool_best_fit(unsigned long *map, unsigned long size, unsigned long start, unsigned int nr, void *data) argument
[all...]
H A Dstring.c584 * @s: Pointer to the start of the area.
604 * @s: Pointer to the start of the area.
790 static void *check_bytes8(const u8 *start, u8 value, unsigned int bytes) argument
793 if (*start != value)
794 return (void *)start;
795 start++;
803 * @start: The memory area
810 void *memchr_inv(const void *start, int c, size_t bytes) argument
817 return check_bytes8(start, value, bytes);
831 prefix = (unsigned long)start
[all...]
H A Dioremap.c74 unsigned long start; local
80 start = addr;
90 flush_cache_vmap(start, end);
H A Dnlattr.c368 void *start; local
370 start = skb_put(skb, NLA_ALIGN(attrlen));
371 memset(start, 0, NLA_ALIGN(attrlen));
373 return start;
448 void *start; local
450 start = __nla_reserve_nohdr(skb, attrlen);
451 memcpy(start, data, attrlen);
H A Dbitmap.c287 void bitmap_set(unsigned long *map, unsigned int start, int len) argument
289 unsigned long *p = map + BIT_WORD(start);
290 const unsigned int size = start + len;
291 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG);
292 unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start);
308 void bitmap_clear(unsigned long *map, unsigned int start, int len) argument
310 unsigned long *p = map + BIT_WORD(start);
311 const unsigned int size = start + len;
312 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG);
313 unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start);
341 bitmap_find_next_zero_area(unsigned long *map, unsigned long size, unsigned long start, unsigned int nr, unsigned long align_mask) argument
[all...]
H A Dflex_array.c257 * @start: index of first array element for which space is allocated
268 int flex_array_prealloc(struct flex_array *fa, unsigned int start, argument
277 if (!start && !nr_elements)
279 if (start >= fa->total_nr_elements)
284 end = start + nr_elements - 1;
292 start_part = fa_element_to_part_nr(fa, start);
H A Dinterval_tree_test.c36 nodes[i].start = a;
39 nodes[i].start = b;
H A Ddevres.c123 if (!devm_request_mem_region(dev, res->start, size, name)) {
129 dest_ptr = devm_ioremap(dev, res->start, size);
131 dest_ptr = devm_ioremap_nocache(dev, res->start, size);
135 devm_release_mem_region(dev, res->start, size);
H A Didr.c208 * @starting_id: id to start search at
389 * id = idr_alloc(idr, ptr, start, end, GFP_NOWAIT);
435 * @start: the minimum id (inclusive)
439 * Allocate an id in [start, end) and associate it with @ptr. If no ID is
444 * using @start + N as @end as long as N is inside integer range.
451 int idr_alloc(struct idr *idr, void *ptr, int start, int end, gfp_t gfp_mask) argument
460 if (WARN_ON_ONCE(start < 0))
462 if (unlikely(max < start))
466 id = idr_get_empty_slot(idr, start, pa, gfp_mask, NULL);
481 * @start
489 idr_alloc_cyclic(struct idr *idr, void *ptr, int start, int end, gfp_t gfp_mask) argument
1079 ida_simple_get(struct ida *ida, unsigned int start, unsigned int end, gfp_t gfp_mask) argument
[all...]
H A Dvsprintf.c41 * @cp: The start of the string
66 * @cp: The start of the string
80 * @cp: The start of the string
97 * @cp: The start of the string
726 p = number(p, pend, res->start, *specp);
727 if (res->start != res->end) {
1496 const char *start = fmt; local
1526 if (fmt != start || !*fmt)
1527 return fmt - start;
1558 return ++fmt - start;
[all...]
H A Dcrc32.c866 u32 start; /* random 6 bit offset in buf */ member in struct:crc_test
982 struct timespec start, stop; local
995 test[i].start, test[i].length);
1002 getnstimeofday(&start);
1005 test[i].start, test[i].length))
1013 nsec = stop.tv_nsec - start.tv_nsec +
1014 1000000000 * (stop.tv_sec - start.tv_sec);
1036 crc_full = __crc32c_le(test[i].crc, test_buf + test[i].start,
1043 test[i].start, len1);
1044 crc2 = __crc32c_le(0, test_buf + test[i].start
1068 struct timespec start, stop; local
[all...]
H A Ddynamic_debug.c242 /* `buf' is start of word, `end' is one past its end */
395 pr_err("bad flag-op %c, at start of %s\n", *str, str);
721 * Seq_ops start method. Called at the start of every
807 .start = ddebug_proc_start,
H A Dbtree.c375 static int getfill(struct btree_geo *geo, unsigned long *node, int start) argument
379 for (i = start; i < geo->no_pairs; i++)
H A Ddma-debug.c61 * @pfn: page frame of the start address
1156 static inline bool overlap(void *addr, unsigned long len, void *start, void *end) argument
1160 unsigned long a2 = (unsigned long)start;
H A Dtest_bpf.c1896 u64 start, finish; local
1899 start = ktime_to_us(ktime_get());
1906 *duration = (finish - start) * 1000ULL;
/lib/zlib_deflate/
H A Ddeflate.c80 static void check_match (deflate_state *s, IPos start, IPos match,
699 IPos start,
706 (char *)s->window + start, length) != EQUAL) {
707 fprintf(stderr, " start %u, match %u, length %d\n",
708 start, match, length);
710 fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);
715 fprintf(stderr,"\\[%d,%d]", start-match, length);
716 do { putc(s->window[start++], stderr); } while (--length != 0);
720 # define check_match(s, start, match, length)
947 * of the string with itself at the start o
697 check_match( deflate_state *s, IPos start, IPos match, int length ) argument
[all...]
/lib/xz/
H A Dxz_dec_lzma2.c32 * start <= pos <= full <= end
49 size_t start; member in struct:dictionary
293 dict->start = 0;
404 dict->start = dict->pos;
418 size_t copy_size = dict->pos - dict->start;
424 memcpy(b->out + b->out_pos, dict->buf + dict->start,
428 dict->start = dict->pos;

Completed in 469 milliseconds