Lines Matching defs:free
238 * following the current allocation were not free. The extra
251 (void) free(ip, bno + numfrags(fs, nsize),
375 * Check if we really got a free inode, if not then complain
409 "%s: free inode %d had size 0x%llx, run fsck(1M)%s",
459 * the current cg if it has more than 25% free inodes and more
460 * than 25% free blocks. Otherwise the cgs are searched from
468 * above the average number of free inodes, the one with the smallest
517 * average number of free blocks. An appropriate cylinder group is found
522 * of free blocks is found. If the allocation is for the first block in an
619 * free map. If a fragment is deallocated, a possible
623 free(struct inode *ip, daddr_t bno, off_t size, int flags)
648 "free: bad size, dev = 0x%lx, bsize = %d, size = %d, "
682 (void) ufs_fault(ITOV(ip), "free: freeing free block, "
714 "free: freeing free frag, "
768 * The specified inode is placed back in the free map.
810 (void) ufs_fault(ITOV(ip), "ufs_ifree: freeing free inode, "
841 * 3) brute force search for a free block.
989 * available (free blocks or free frags).
996 * If there are not enough free frags then return.
1397 * free block map for an appropriate bit pattern.
1814 * Only free the block if they are not same, and
1819 free(ip, ip->i_db[i], fs->fs_bsize, 0);
1832 free(ip, undo->blk, fs->fs_bsize, I_IBLK);
1850 * Don't forget to free the undo chain :)
1871 * of l_len == 0, meaning free to end of file.
1874 * maintain a contiguous free list much longer than FIFO.
1985 blksfree = cg_blksfree(cgp); /* free array */
1986 cgblks = fragstoblks(fs, fs->fs_fpg); /* blks in free array */
1989 /* find a free block */
2002 /* count the number of free blocks */