Home
last modified time | relevance | path

Searched refs:start (Results 1 – 25 of 26) sorted by relevance

12

/lib/
Dbsearch.c36 size_t start = 0, end = num; in bsearch() local
39 while (start < end) { in bsearch()
40 size_t mid = start + (end - start) / 2; in bsearch()
46 start = mid + 1; in bsearch()
Dpci_iomap.c28 resource_size_t start = pci_resource_start(dev, bar); in pci_iomap() local
32 if (!len || !start) in pci_iomap()
37 return __pci_ioport_map(dev, start, len); in pci_iomap()
40 return ioremap(start, len); in pci_iomap()
41 return ioremap_nocache(start, len); in pci_iomap()
Dgenalloc.c86 static int bitmap_set_ll(unsigned long *map, int start, int nr) in bitmap_set_ll() argument
88 unsigned long *p = map + BIT_WORD(start); in bitmap_set_ll()
89 const int size = start + nr; in bitmap_set_ll()
90 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG); in bitmap_set_ll()
91 unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start); in bitmap_set_ll()
121 static int bitmap_clear_ll(unsigned long *map, int start, int nr) in bitmap_clear_ll() argument
123 unsigned long *p = map + BIT_WORD(start); in bitmap_clear_ll()
124 const int size = start + nr; in bitmap_clear_ll()
125 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG); in bitmap_clear_ll()
126 unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start); in bitmap_clear_ll()
[all …]
Dcrc32.c866 u32 start; /* random 6 bit offset in buf */ member
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 +
[all …]
Diommu-helper.c20 unsigned long start, unsigned int nr, in iommu_area_alloc() argument
29 index = bitmap_find_next_zero_area(map, size, start, nr, align_mask); in iommu_area_alloc()
33 start = index + 1; in iommu_area_alloc()
Dextable.c36 void sort_extable(struct exception_table_entry *start, in sort_extable() argument
39 sort(start, finish - start, sizeof(struct exception_table_entry), in sort_extable()
Dstring.c879 static void *check_bytes8(const u8 *start, u8 value, unsigned int bytes) in check_bytes8() argument
882 if (*start != value) in check_bytes8()
883 return (void *)start; in check_bytes8()
884 start++; in check_bytes8()
899 void *memchr_inv(const void *start, int c, size_t bytes) in memchr_inv() argument
906 return check_bytes8(start, value, bytes); in memchr_inv()
920 prefix = (unsigned long)start % 8; in memchr_inv()
925 r = check_bytes8(start, value, prefix); in memchr_inv()
928 start += prefix; in memchr_inv()
935 if (*(u64 *)start != value64) in memchr_inv()
[all …]
Dioremap.c74 unsigned long start; in ioremap_page_range() local
80 start = addr; in ioremap_page_range()
90 flush_cache_vmap(start, end); in ioremap_page_range()
Dnlattr.c368 void *start; in __nla_reserve_nohdr() local
370 start = skb_put(skb, NLA_ALIGN(attrlen)); in __nla_reserve_nohdr()
371 memset(start, 0, NLA_ALIGN(attrlen)); in __nla_reserve_nohdr()
373 return start; in __nla_reserve_nohdr()
448 void *start; in __nla_put_nohdr() local
450 start = __nla_reserve_nohdr(skb, attrlen); in __nla_put_nohdr()
451 memcpy(start, data, attrlen); in __nla_put_nohdr()
Dbitmap.c287 void bitmap_set(unsigned long *map, unsigned int start, int len) in bitmap_set() argument
289 unsigned long *p = map + BIT_WORD(start); in bitmap_set()
290 const unsigned int size = start + len; in bitmap_set()
291 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG); in bitmap_set()
292 unsigned long mask_to_set = BITMAP_FIRST_WORD_MASK(start); in bitmap_set()
308 void bitmap_clear(unsigned long *map, unsigned int start, int len) in bitmap_clear() argument
310 unsigned long *p = map + BIT_WORD(start); in bitmap_clear()
311 const unsigned int size = start + len; in bitmap_clear()
312 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG); in bitmap_clear()
313 unsigned long mask_to_clear = BITMAP_FIRST_WORD_MASK(start); in bitmap_clear()
[all …]
Dflex_array.c268 int flex_array_prealloc(struct flex_array *fa, unsigned int start, in flex_array_prealloc() argument
277 if (!start && !nr_elements) in flex_array_prealloc()
279 if (start >= fa->total_nr_elements) in flex_array_prealloc()
284 end = start + nr_elements - 1; in flex_array_prealloc()
292 start_part = fa_element_to_part_nr(fa, start); in flex_array_prealloc()
Didr.c451 int idr_alloc(struct idr *idr, void *ptr, int start, int end, gfp_t gfp_mask) in idr_alloc() argument
460 if (WARN_ON_ONCE(start < 0)) in idr_alloc()
462 if (unlikely(max < start)) in idr_alloc()
466 id = idr_get_empty_slot(idr, start, pa, gfp_mask, NULL); in idr_alloc()
489 int idr_alloc_cyclic(struct idr *idr, void *ptr, int start, int end, in idr_alloc_cyclic() argument
494 id = idr_alloc(idr, ptr, max(start, idr->cur), end, gfp_mask); in idr_alloc_cyclic()
496 id = idr_alloc(idr, ptr, start, end, gfp_mask); in idr_alloc_cyclic()
1079 int ida_simple_get(struct ida *ida, unsigned int start, unsigned int end, in ida_simple_get() argument
1086 BUG_ON((int)start < 0); in ida_simple_get()
1092 BUG_ON(end < start); in ida_simple_get()
[all …]
Ddevres.c123 if (!devm_request_mem_region(dev, res->start, size, name)) { in devm_ioremap_resource()
129 dest_ptr = devm_ioremap(dev, res->start, size); in devm_ioremap_resource()
131 dest_ptr = devm_ioremap_nocache(dev, res->start, size); in devm_ioremap_resource()
135 devm_release_mem_region(dev, res->start, size); in devm_ioremap_resource()
Dinterval_tree_test.c36 nodes[i].start = a; in init()
39 nodes[i].start = b; in init()
Dinterval_tree.c6 #define START(node) ((node)->start)
Dvsprintf.c726 p = number(p, pend, res->start, *specp); in resource_string()
727 if (res->start != res->end) { in resource_string()
1496 const char *start = fmt; in format_decode() local
1526 if (fmt != start || !*fmt) in format_decode()
1527 return fmt - start; in format_decode()
1558 return ++fmt - start; in format_decode()
1573 return ++fmt - start; in format_decode()
1599 return ++fmt - start; in format_decode()
1603 return ++fmt - start; in format_decode()
1607 return fmt - start; in format_decode()
[all …]
Dbtree.c375 static int getfill(struct btree_geo *geo, unsigned long *node, int start) in getfill() argument
379 for (i = start; i < geo->no_pairs; i++) in getfill()
Ddma-debug.c1156 static inline bool overlap(void *addr, unsigned long len, void *start, void *end) in overlap() argument
1160 unsigned long a2 = (unsigned long)start; in overlap()
Dtest_bpf.c1896 u64 start, finish; in __run_one() local
1899 start = ktime_to_us(ktime_get()); in __run_one()
1906 *duration = (finish - start) * 1000ULL; in __run_one()
Ddynamic_debug.c811 .start = ddebug_proc_start,
DKconfig340 Simple, embeddable, interval-tree. Can find the start of an
/lib/zlib_inflate/
Dinffast.h11 void inflate_fast (z_streamp strm, unsigned start);
Dinffast.c88 void inflate_fast(z_streamp strm, unsigned start) in inflate_fast() argument
121 beg = out - (start - strm->avail_out); in inflate_fast()
/lib/zlib_deflate/
Ddeflate.c80 static void check_match (deflate_state *s, IPos start, IPos match,
699 IPos start, in check_match() argument
706 (char *)s->window + start, length) != EQUAL) { in check_match()
708 start, match, length); in check_match()
710 fprintf(stderr, "%c%c", s->window[match++], s->window[start++]); in check_match()
715 fprintf(stderr,"\\[%d,%d]", start-match, length); in check_match()
716 do { putc(s->window[start++], stderr); } while (--length != 0); in check_match()
720 # define check_match(s, start, match, length) argument
/lib/xz/
Dxz_dec_lzma2.c49 size_t start; member
293 dict->start = 0; in dict_reset()
404 dict->start = dict->pos; in dict_uncompressed()
418 size_t copy_size = dict->pos - dict->start; in dict_flush()
424 memcpy(b->out + b->out_pos, dict->buf + dict->start, in dict_flush()
428 dict->start = dict->pos; in dict_flush()

12