/lib/ |
H A D | iovec.c | 60 int offset, int len) 65 if (unlikely(offset >= iov->iov_len)) { 66 offset -= iov->iov_len; 69 copy = min_t(unsigned int, iov->iov_len - offset, len); 70 if (copy_to_user(iov->iov_base + offset, kdata, copy)) 72 offset = 0; 86 int offset, int len) 93 while (offset >= iov->iov_len) { 94 offset -= iov->iov_len; 99 u8 __user *base = iov->iov_base + offset; 59 memcpy_toiovecend(const struct iovec *iov, unsigned char *kdata, int offset, int len) argument 85 memcpy_fromiovecend(unsigned char *kdata, const struct iovec *iov, int offset, int len) argument [all...] |
H A D | find_next_bit.c | 24 unsigned long offset) 26 const unsigned long *p = addr + BITOP_WORD(offset); 27 unsigned long result = offset & ~(BITS_PER_LONG-1); 30 if (offset >= size) 33 offset %= BITS_PER_LONG; 34 if (offset) { 36 tmp &= (~0UL << offset); 70 unsigned long offset) 72 const unsigned long *p = addr + BITOP_WORD(offset); 73 unsigned long result = offset 23 find_next_bit(const unsigned long *addr, unsigned long size, unsigned long offset) argument 69 find_next_zero_bit(const unsigned long *addr, unsigned long size, unsigned long offset) argument 193 find_next_zero_bit_le(const void *addr, unsigned long size, unsigned long offset) argument 239 find_next_bit_le(const void *addr, unsigned long size, unsigned long offset) argument [all...] |
H A D | radix-tree.c | 88 int offset) 90 __set_bit(offset, node->tags[tag]); 94 int offset) 96 __clear_bit(offset, node->tags[tag]); 100 int offset) 102 return test_bit(offset, node->tags[tag]); 144 * @offset: The bitnumber to start searching at 148 * Returns next bit offset, or size if nothing found. 152 unsigned long size, unsigned long offset) 155 return find_next_bit(addr, size, offset); 87 tag_set(struct radix_tree_node *node, unsigned int tag, int offset) argument 93 tag_clear(struct radix_tree_node *node, unsigned int tag, int offset) argument 99 tag_get(struct radix_tree_node *node, unsigned int tag, int offset) argument 151 radix_tree_find_next_bit(const unsigned long *addr, unsigned long size, unsigned long offset) argument 389 unsigned int height, shift, offset; local 600 int offset; local 722 int offset; local 752 unsigned long index, offset, height; local 915 int offset; local 1332 unsigned int offset; local 1367 unsigned int offset; local [all...] |
H A D | proportions.c | 108 int offset; local 118 offset = pd->pg[pd->index].shift - shift; 119 if (!offset) 126 if (offset < 0) 127 events <<= -offset; 129 events >>= offset; local 172 int offset = *pl_shift - new_shift; local 174 if (!offset) 177 if (offset < 0) 178 *pl_period <<= -offset; 180 *pl_period >>= offset; local [all...] |
H A D | scatterlist.c | 350 * @offset: Offset from start of the first page to the start of a buffer 351 * @size: Number of valid bytes in the buffer (after offset) 357 * may provide an offset at a start and a size of valid data in a buffer 366 unsigned long offset, unsigned long size, 397 chunk_size = ((j - cur_page) << PAGE_SHIFT) - offset; 398 sg_set_page(s, pages[cur_page], min(size, chunk_size), offset); 400 offset = 0; 422 return PAGE_ALIGN(sg->offset + sg->length) >> PAGE_SHIFT; 479 miter->__offset = pgoffset ? 0 : sg->offset; 480 miter->__remaining = sg->offset 364 sg_alloc_table_from_pages(struct sg_table *sgt, struct page **pages, unsigned int n_pages, unsigned long offset, unsigned long size, gfp_t gfp_mask) argument 507 sg_miter_skip(struct sg_mapping_iter *miter, off_t offset) argument 625 unsigned int offset = 0; local [all...] |
H A D | test_firmware.c | 26 size_t size, loff_t *offset) 32 rc = simple_read_from_buffer(buf, size, offset, 25 test_fw_misc_read(struct file *f, char __user *buf, size_t size, loff_t *offset) argument
|
H A D | ts_kmp.c | 49 unsigned int i, q = 0, text_len, consumed = state->offset; 67 state->offset = consumed + i + 1; 68 return state->offset - kmp->pattern_len;
|
H A D | dma-debug.c | 62 * @offset: offset of mapping relative to pfn 75 size_t offset; member in struct:dma_debug_entry 392 return page_to_phys(pfn_to_page(entry->pfn)) + entry->offset; 458 (entry->offset >> L1_CACHE_SHIFT); 1198 "[sync offset+size=%llu]\n", 1240 void debug_dma_map_page(struct device *dev, struct page *page, size_t offset, argument 1259 entry->offset = offset, 1269 void *addr = page_address(page) + offset; 1511 debug_dma_sync_single_range_for_cpu(struct device *dev, dma_addr_t dma_handle, unsigned long offset, size_t size, int direction) argument 1532 debug_dma_sync_single_range_for_device(struct device *dev, dma_addr_t dma_handle, unsigned long offset, size_t size, int direction) argument [all...] |
H A D | devres.c | 20 * @offset: BUS offset to map 25 void __iomem *devm_ioremap(struct device *dev, resource_size_t offset, argument 34 addr = ioremap(offset, size); 48 * @offset: BUS offset to map 54 void __iomem *devm_ioremap_nocache(struct device *dev, resource_size_t offset, argument 63 addr = ioremap_nocache(offset, size);
|
H A D | decompress_unlzma.c | 394 int offset; local 460 offset = 0; 470 offset = 1 << LZMA_LEN_NUM_LOW_BITS; 475 offset = ((1 << LZMA_LEN_NUM_LOW_BITS) 482 len += offset;
|
H A D | idr.c | 939 int offset = starting_id % IDA_BITMAP_BITS; local 952 offset = 0; 973 t = find_next_zero_bit(bitmap->bitmap, IDA_BITMAP_BITS, offset); 975 /* no empty slot after offset, continue to the next chunk */ 977 offset = 0; 1016 int offset = id % IDA_BITMAP_BITS; local 1038 if (!bitmap || !test_bit(offset, bitmap->bitmap)) 1042 __clear_bit(offset, bitmap->bitmap);
|
H A D | swiotlb.c | 396 unsigned int offset = orig_addr & ~PAGE_MASK; local 402 sz = min_t(size_t, PAGE_SIZE - offset, size); 407 memcpy(vaddr, buffer + offset, sz); 409 memcpy(buffer + offset, vaddr, sz); 416 offset = 0; 731 unsigned long offset, size_t size, 735 phys_addr_t map, phys = page_to_phys(page) + offset; 730 swiotlb_map_page(struct device *dev, struct page *page, unsigned long offset, size_t size, enum dma_data_direction dir, struct dma_attrs *attrs) argument
|
H A D | bitmap.c | 338 * the bit offset of all zero areas this function finds is multiples of that 755 * Map the ordinal offset of bit @ord in @buf to its position in @buf. 1059 int offset; /* bit offset region in bitmap[index] */ local 1068 * or (offset == 0 && mask == ~0UL) (for larger multiword orders.) 1072 offset = pos - (index * BITS_PER_LONG); 1082 mask <<= offset; local 1118 * Return the bit offset in bitmap of the allocated region,
|
H A D | ts_bm.c | 65 unsigned int i, text_len, consumed = state->offset;
|
H A D | ts_fsm.c | 143 unsigned block_len = 0, strict, consumed = state->offset; 255 state->offset = consumed + block_idx;
|
/lib/lzo/ |
H A D | lzo1x_decompress_safe.c | 68 size_t offset; local 75 offset = ip - ip_last; 76 if (unlikely(offset > MAX_255_COUNT)) 79 offset = (offset << 8) - offset; 80 t += offset + 15 + *ip++; 136 size_t offset; local 143 offset = ip - ip_last; 144 if (unlikely(offset > MAX_255_COUN 161 size_t offset; local [all...] |
/lib/zlib_inflate/ |
H A D | inflate.h | 93 unsigned offset; /* distance back to copy string from */ member in struct:inflate_state
|
H A D | inflate.c | 625 state->offset = (unsigned)this.val; 631 state->offset += BITS(state->extra); 635 if (state->offset > state->dmax) { 641 if (state->offset > state->whave + out - left) { 650 if (state->offset > copy) { /* copy from window */ 651 copy = state->offset - copy; 661 from = put - state->offset;
|
/lib/xz/ |
H A D | xz_dec_lzma2.c | 322 size_t offset = dict->pos - dist - 1; local 325 offset += dict->end; 327 return dict->full > 0 ? dict->buf[offset] : 0; 587 uint32_t offset; local 597 offset = 0x100; 600 match_bit = match_byte & offset; 602 i = offset + match_bit + symbol; 606 offset &= match_bit; 609 offset &= ~match_bit;
|