Home
last modified time | relevance | path

Searched refs:first_free (Results 1 - 25 of 44) sorted by relevance

12

/kernel/linux/linux-5.10/arch/sparc/lib/
H A Dbitext.c55 offset = t->first_free; in bit_map_string_get()
85 if (offset == t->first_free) in bit_map_string_get()
86 t->first_free = find_next_zero_bit in bit_map_string_get()
88 t->first_free + len); in bit_map_string_get()
115 if (offset < t->first_free) in bit_map_clear()
116 t->first_free = offset; in bit_map_clear()
/kernel/linux/linux-6.6/arch/sparc/lib/
H A Dbitext.c55 offset = t->first_free; in bit_map_string_get()
85 if (offset == t->first_free) in bit_map_string_get()
86 t->first_free = find_next_zero_bit in bit_map_string_get()
88 t->first_free + len); in bit_map_string_get()
115 if (offset < t->first_free) in bit_map_clear()
116 t->first_free = offset; in bit_map_clear()
/kernel/linux/linux-5.10/fs/hpfs/
H A Ddnode.c159 le32_add_cpu(&d->first_free, 4); in set_last_pointer()
160 if (le32_to_cpu(d->first_free) > 2048) { in set_last_pointer()
162 le32_add_cpu(&d->first_free, -4); in set_last_pointer()
198 le32_add_cpu(&d->first_free, d_size); in hpfs_add_de()
211 d->first_free = cpu_to_le32(le32_to_cpu(d->first_free) - le16_to_cpu(de->length)); in hpfs_delete_de()
212 memmove(de, de_next_de(de), le32_to_cpu(d->first_free) + (char *)d - (char *)de); in hpfs_delete_de()
276 if (le32_to_cpu(d->first_free) + de_size(namelen, down_ptr) <= 2048) { in hpfs_add_to_dnode()
300 memcpy(nd, d, le32_to_cpu(d->first_free)); in hpfs_add_to_dnode()
327 memmove((char *)nd + 20, de, le32_to_cpu(nd->first_free) in hpfs_add_to_dnode()
[all...]
H A Danode.c135 anode->btree.first_free = btree->first_free; in hpfs_add_sector_to_btree()
141 btree->first_free = cpu_to_le16((char *)&(btree->u.internal[1]) - (char *)btree); in hpfs_add_sector_to_btree()
157 le16_add_cpu(&btree->first_free, 12); in hpfs_add_sector_to_btree()
178 le16_add_cpu(&btree->first_free, 8); in hpfs_add_sector_to_btree()
208 anode->btree.first_free = cpu_to_le16(16); in hpfs_add_sector_to_btree()
241 memcpy(&ranode->btree, btree, le16_to_cpu(btree->first_free)); in hpfs_add_sector_to_btree()
257 btree->first_free = cpu_to_le16((char *)&btree->u.internal[2] - (char *)btree); in hpfs_add_sector_to_btree()
420 btree->first_free = cpu_to_le16(8); in hpfs_truncate_btree()
439 btree->first_free in hpfs_truncate_btree()
[all...]
H A Dmap.c187 if (le16_to_cpu(fnode->btree.first_free) != in hpfs_map_fnode()
190 "bad first_free pointer in fnode %08lx", in hpfs_map_fnode()
240 if (le16_to_cpu(anode->btree.first_free) != in hpfs_map_anode()
242 hpfs_error(s, "bad first_free pointer in anode %08x", ano); in hpfs_map_anode()
280 if (le32_to_cpu(dnode->first_free) > 2048) { in hpfs_map_dnode()
281 hpfs_error(s, "dnode %08x has first_free == %08x", secno, le32_to_cpu(dnode->first_free)); in hpfs_map_dnode()
284 for (p = 20; p < le32_to_cpu(dnode->first_free); p += d[p] + (d[p+1] << 8)) { in hpfs_map_dnode()
304 if (p != le32_to_cpu(dnode->first_free)) { in hpfs_map_dnode()
305 hpfs_error(s, "size on last dirent does not match first_free; dnod in hpfs_map_dnode()
[all...]
H A Dhpfs_fn.h123 CHKCOND(le32_to_cpu(dnode->first_free)>=0x14 && le32_to_cpu(dnode->first_free)<=0xa00,("HPFS: dnode_end_de: dnode->first_free = %x\n",(unsigned)le32_to_cpu(dnode->first_free))); in dnode_end_de()
124 return (void *) dnode + le32_to_cpu(dnode->first_free); in dnode_end_de()
H A Dhpfs.h283 __le32 first_free; /* offset from start of dnode to member
408 __le16 first_free; /* offset from start of header to member
/kernel/linux/linux-6.6/fs/hpfs/
H A Ddnode.c159 le32_add_cpu(&d->first_free, 4); in set_last_pointer()
160 if (le32_to_cpu(d->first_free) > 2048) { in set_last_pointer()
162 le32_add_cpu(&d->first_free, -4); in set_last_pointer()
198 le32_add_cpu(&d->first_free, d_size); in hpfs_add_de()
211 d->first_free = cpu_to_le32(le32_to_cpu(d->first_free) - le16_to_cpu(de->length)); in hpfs_delete_de()
212 memmove(de, de_next_de(de), le32_to_cpu(d->first_free) + (char *)d - (char *)de); in hpfs_delete_de()
276 if (le32_to_cpu(d->first_free) + de_size(namelen, down_ptr) <= 2048) { in hpfs_add_to_dnode()
300 memcpy(nd, d, le32_to_cpu(d->first_free)); in hpfs_add_to_dnode()
327 memmove((char *)nd + 20, de, le32_to_cpu(nd->first_free) in hpfs_add_to_dnode()
[all...]
H A Danode.c135 anode->btree.first_free = btree->first_free; in hpfs_add_sector_to_btree()
141 btree->first_free = cpu_to_le16((char *)&(btree->u.internal[1]) - (char *)btree); in hpfs_add_sector_to_btree()
157 le16_add_cpu(&btree->first_free, 12); in hpfs_add_sector_to_btree()
178 le16_add_cpu(&btree->first_free, 8); in hpfs_add_sector_to_btree()
208 anode->btree.first_free = cpu_to_le16(16); in hpfs_add_sector_to_btree()
241 memcpy(&ranode->btree, btree, le16_to_cpu(btree->first_free)); in hpfs_add_sector_to_btree()
257 btree->first_free = cpu_to_le16((char *)&btree->u.internal[2] - (char *)btree); in hpfs_add_sector_to_btree()
420 btree->first_free = cpu_to_le16(8); in hpfs_truncate_btree()
439 btree->first_free in hpfs_truncate_btree()
[all...]
H A Dmap.c187 if (le16_to_cpu(fnode->btree.first_free) != in hpfs_map_fnode()
190 "bad first_free pointer in fnode %08lx", in hpfs_map_fnode()
240 if (le16_to_cpu(anode->btree.first_free) != in hpfs_map_anode()
242 hpfs_error(s, "bad first_free pointer in anode %08x", ano); in hpfs_map_anode()
280 if (le32_to_cpu(dnode->first_free) > 2048) { in hpfs_map_dnode()
281 hpfs_error(s, "dnode %08x has first_free == %08x", secno, le32_to_cpu(dnode->first_free)); in hpfs_map_dnode()
284 for (p = 20; p < le32_to_cpu(dnode->first_free); p += d[p] + (d[p+1] << 8)) { in hpfs_map_dnode()
304 if (p != le32_to_cpu(dnode->first_free)) { in hpfs_map_dnode()
305 hpfs_error(s, "size on last dirent does not match first_free; dnod in hpfs_map_dnode()
[all...]
H A Dhpfs_fn.h123 CHKCOND(le32_to_cpu(dnode->first_free)>=0x14 && le32_to_cpu(dnode->first_free)<=0xa00,("HPFS: dnode_end_de: dnode->first_free = %x\n",(unsigned)le32_to_cpu(dnode->first_free))); in dnode_end_de()
124 return (void *) dnode + le32_to_cpu(dnode->first_free); in dnode_end_de()
H A Dhpfs.h283 __le32 first_free; /* offset from start of dnode to member
409 __le16 first_free; /* offset from start of header to member
/kernel/linux/linux-5.10/drivers/net/ethernet/chelsio/cxgb4/
H A Dsmt.c67 struct smt_entry *first_free = NULL; in find_or_alloc_smte() local
72 if (!first_free) in find_or_alloc_smte()
73 first_free = e; in find_or_alloc_smte()
85 if (first_free) { in find_or_alloc_smte()
86 e = first_free; in find_or_alloc_smte()
H A Dl2t.c302 struct l2t_entry *first_free = NULL; in find_or_alloc_l2e() local
306 if (!first_free) in find_or_alloc_l2e()
307 first_free = e; in find_or_alloc_l2e()
317 if (first_free) { in find_or_alloc_l2e()
318 e = first_free; in find_or_alloc_l2e()
/kernel/linux/linux-6.6/drivers/net/ethernet/chelsio/cxgb4/
H A Dsmt.c67 struct smt_entry *first_free = NULL; in find_or_alloc_smte() local
72 if (!first_free) in find_or_alloc_smte()
73 first_free = e; in find_or_alloc_smte()
85 if (first_free) { in find_or_alloc_smte()
86 e = first_free; in find_or_alloc_smte()
H A Dl2t.c302 struct l2t_entry *first_free = NULL; in find_or_alloc_l2e() local
306 if (!first_free) in find_or_alloc_l2e()
307 first_free = e; in find_or_alloc_l2e()
317 if (first_free) { in find_or_alloc_l2e()
318 e = first_free; in find_or_alloc_l2e()
/kernel/linux/linux-5.10/drivers/infiniband/hw/mthca/
H A Dmthca_srq.c294 srq->first_free = 0; in mthca_alloc_srq()
500 first_ind = srq->first_free; in mthca_tavor_post_srq_recv()
503 ind = srq->first_free; in mthca_tavor_post_srq_recv()
541 srq->first_free = next_ind; in mthca_tavor_post_srq_recv()
557 first_ind = srq->first_free; in mthca_tavor_post_srq_recv()
593 ind = srq->first_free; in mthca_arbel_post_srq_recv()
624 srq->first_free = next_ind; in mthca_arbel_post_srq_recv()
/kernel/linux/linux-6.6/drivers/infiniband/hw/mthca/
H A Dmthca_srq.c294 srq->first_free = 0; in mthca_alloc_srq()
500 first_ind = srq->first_free; in mthca_tavor_post_srq_recv()
503 ind = srq->first_free; in mthca_tavor_post_srq_recv()
541 srq->first_free = next_ind; in mthca_tavor_post_srq_recv()
557 first_ind = srq->first_free; in mthca_tavor_post_srq_recv()
593 ind = srq->first_free; in mthca_arbel_post_srq_recv()
624 srq->first_free = next_ind; in mthca_arbel_post_srq_recv()
/kernel/linux/linux-5.10/tools/testing/selftests/powerpc/nx-gzip/
H A Dgunz_test.c283 int first_free, last_free, first_used, last_used; in decompress_file() local
437 first_free = fifo_free_first_bytes(cur_in, used_in, fifo_in_len); in decompress_file()
445 read_sz = NX_MIN(free_space, first_free); in decompress_file()
618 first_free = fifo_free_first_bytes(cur_out, used_out, fifo_out_len); in decompress_file()
628 first_free = NX_MIN(target_max, first_free); in decompress_file()
629 if (first_free > 0) { in decompress_file()
631 nx_append_dde(ddl_out, fifo_out + first_offset, first_free); in decompress_file()
635 last_free = NX_MIN(target_max - first_free, last_free); in decompress_file()
/kernel/linux/linux-6.6/tools/testing/selftests/powerpc/nx-gzip/
H A Dgunz_test.c283 int first_free, last_free, first_used, last_used; in decompress_file() local
437 first_free = fifo_free_first_bytes(cur_in, used_in, fifo_in_len); in decompress_file()
445 read_sz = NX_MIN(free_space, first_free); in decompress_file()
618 first_free = fifo_free_first_bytes(cur_out, used_out, fifo_out_len); in decompress_file()
628 first_free = NX_MIN(target_max, first_free); in decompress_file()
629 if (first_free > 0) { in decompress_file()
631 nx_append_dde(ddl_out, fifo_out + first_offset, first_free); in decompress_file()
635 last_free = NX_MIN(target_max - first_free, last_free); in decompress_file()
/kernel/linux/linux-5.10/mm/
H A Dpercpu.c310 * This determines if we should scan based on the scan_hint or first_free.
311 * In general, we want to scan from first_free to fulfill allocations by
330 return block->first_free; in pcpu_next_hint()
395 * allocation. block->first_free is returned if the allocation request fits
590 block->first_free = min(block->first_free, start); in pcpu_block_update()
713 bit_off = chunk_md->first_free; in pcpu_chunk_refresh_hint()
727 * Scans over the block beginning at first_free and updates the block
743 start = block->first_free; in pcpu_block_refresh_hint()
790 * block->first_free mus in pcpu_block_update_hint_alloc()
[all...]
/kernel/linux/linux-5.10/arch/sparc/include/asm/
H A Dbitext.h20 int first_free; member
/kernel/linux/linux-6.6/arch/sparc/include/asm/
H A Dbitext.h20 int first_free; member
/kernel/linux/linux-6.6/mm/
H A Dpercpu.c331 * This determines if we should scan based on the scan_hint or first_free.
332 * In general, we want to scan from first_free to fulfill allocations by
351 return block->first_free; in pcpu_next_hint()
416 * allocation. block->first_free is returned if the allocation request fits
634 block->first_free = min(block->first_free, start); in pcpu_block_update()
757 bit_off = chunk_md->first_free; in pcpu_chunk_refresh_hint()
771 * Scans over the block beginning at first_free and updates the block
787 start = block->first_free; in pcpu_block_refresh_hint()
838 * block->first_free mus in pcpu_block_update_hint_alloc()
[all...]
/kernel/linux/linux-5.10/drivers/tty/vt/
H A Dkeyboard.c2006 char *first_free, *fj, *fnw; in vt_do_kdgkb_ioctl() local
2056 first_free = funcbufptr + (funcbufsize - funcbufleft); in vt_do_kdgkb_ioctl()
2062 fj = first_free; in vt_do_kdgkb_ioctl()
2069 memmove(fj + delta, fj, first_free - fj); in vt_do_kdgkb_ioctl()
2103 if (first_free > fj) { in vt_do_kdgkb_ioctl()
2104 memmove(fnw + (fj - funcbufptr) + delta, fj, first_free - fj); in vt_do_kdgkb_ioctl()

Completed in 24 milliseconds

12