Searched refs:blocks (Results 26 - 50 of 76) sorted by relevance

1234

/haiku-fatelf/src/add-ons/kernel/file_systems/userlandfs/server/beos/
H A Dfs_cache.h46 extern _IMPEXP_KERNEL int beos_set_blocks_info(int dev, off_t *blocks,
H A Dbeos_kernel_emu.cpp305 set_blocks_info(int dev, off_t *blocks, int nblocks, argument
308 return beos_set_blocks_info(dev, blocks, nblocks, func, arg);
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/
H A Dcache.h39 extern int set_blocks_info(int dev, off_t *blocks, int nblocks,
H A DBlockAllocator.cpp26 // - find a range of blocks of a certain size nearby a specific position
27 // - allocating an unsharp range of blocks for pre-allocation
28 // - free blocks
37 // group can span several blocks in the block bitmap, the AllocationBlock
78 void AddFreeRange(int32 start, int32 blocks);
101 // 8 blocks per byte
116 // the block bitmap is accessed in 32-bit blocks
128 FATAL(("Allocation::Allocate(): tried to allocate too many blocks: %u (numBlocks = %lu)!\n", numBlocks, fNumBits));
129 DIE(("Allocation::Allocate(): tried to allocate too many blocks"));
140 // check for already set blocks
[all...]
/haiku-fatelf/src/system/kernel/cache/
H A DBlockMap.cpp9 * by the file cache to keep track about which blocks of the file are already in memory.
159 int32 blocks = max - index; local
177 count -= blocks;
/haiku-fatelf/src/libs/ncurses/tack/
H A Dcontrol.c73 static int blocks; /* number of result blocks available */ variable
125 if (blocks <= 0) {
132 blocks = RESULT_BLOCK;
134 blocks--;
/haiku-fatelf/src/libs/pdflib/bind/pdflib/php/
H A Dbusinesscard.php58 /* Fill all text blocks with dynamic data */
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/fs_shell/
H A Dcache.h61 cache_ent_list normal, /* list of "normal" blocks (clean & dirty) */
62 locked; /* list of clean and locked blocks */
90 extern int set_blocks_info(int dev, fs_off_t *blocks, int nblocks,
/haiku-fatelf/src/system/kernel/device_manager/
H A DFileDevice.cpp259 off_t blocks = fFileSize / kBlockSize; local
260 uint32 heads = (blocks + 0xfffffffe) / 0xffffffff;
267 geometry.cylinder_count = blocks / heads;
/haiku-fatelf/src/tests/kits/storage/virtualdrive/
H A Dmkvirtualdrive.cpp121 off_t blocks = size / blockSize; local
122 uint32 heads = (blocks + ULONG_MAX - 1) / ULONG_MAX;
127 info.geometry.cylinder_count = blocks / heads;
H A Dvirtualdrive.cpp225 off_t blocks = fileSize / blockSize; local
226 uint32 heads = (blocks + ULONG_MAX - 1) / ULONG_MAX;
231 info.geometry.cylinder_count = blocks / heads;
252 // no way to remove the blocks in the cache, so changes made to the
/haiku-fatelf/src/bin/network/tcpdump/libpcap/
H A Doptimize.c147 struct block **blocks; variable in typeref:struct:block
1660 blocks[i]->in_edges = 0;
1830 blocks[i]->link = 0;
1835 if (!isMarked(blocks[i]))
1838 if (!isMarked(blocks[j]))
1840 if (eq_blk(blocks[i], blocks[j])) {
1841 blocks[i]->link = blocks[j]->link ?
1842 blocks[
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Ddevice.c82 #define BLKGETSIZE _IO(0x12,96) /* Get device size in 512-byte blocks. */
301 * @count: number of blocks to read
306 * blocks of size @bksize bytes each from device @dev at position @pos into the
309 * On success, return the number of successfully read blocks. If this number is
321 * is possible that we return count blocks as being read but that any number
322 * (between zero and count!) of these blocks is actually subject to a multi
349 /* Finally, return the number of complete blocks read. */
357 * @count: number of blocks to write
362 * @count blocks of size @bksize bytes each from data buffer @b to the device
365 * On success, return the number of successfully written blocks
582 uint64_t blocks; local
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/partitioning_systems/
H A DPartitioningSystemsTest.cpp63 off_t blocks = stat.st_size / blockSize; local
64 uint32 heads = (blocks + ULONG_MAX - 1) / ULONG_MAX;
69 device->geometry.cylinder_count = blocks / heads;
/haiku-fatelf/src/tools/fs_shell/
H A Dunistd.cpp174 off_t blocks = size / blockSize; local
175 uint32_t heads = (blocks + ULONG_MAX - 1)
181 geometry->cylinder_count = blocks / heads;
/haiku-fatelf/headers/private/userlandfs/legacy/
H A Dcache.h74 cache_ent_list normal, /* list of "normal" blocks (clean & dirty) */
75 locked; /* list of clean and locked blocks */
110 extern _IMPEXP_KERNEL int set_blocks_info(int dev, off_t *blocks, int nblocks,
/haiku-fatelf/src/add-ons/kernel/debugger/qrencode/
H A Dqrencode.c57 int blocks; member in struct:__anon1461
72 static int RSblock_init(RSblock *blocks, int spec[5], unsigned char *data, unsigned char *ecc) argument
85 block = blocks;
139 raw->blocks = QRspec_rsBlockNum(spec);
140 raw->rsblock = (RSblock *)calloc(sizeof(RSblock), raw->blocks);
168 row = raw->count % raw->blocks;
169 col = raw->count / raw->blocks;
175 row = (raw->count - raw->dataLength) % raw->blocks;
176 col = (raw->count - raw->dataLength) / raw->blocks;
/haiku-fatelf/src/bin/
H A Dmountvolume.cpp98 double blocks = size; local
108 blocks /= 1024.0;
110 } while (blocks >= 1024 && units[i + 1]);
112 snprintf(string, sizeof(string), "%.1f%s", blocks, units[i]);
/haiku-fatelf/src/bin/sharutils/lib/
H A Dmd5.c1 /* md5.c - Functions to compute MD5 message digest of files or memory blocks
102 /* We read the file in blocks of BLOCKSIZE bytes. One call of the
172 size_t blocks = len & ~63; local
179 md5_process_block (buffer, blocks, &ctx);
182 rest = len - blocks;
184 memcpy (restbuf, &buffer[blocks], rest);
/haiku-fatelf/src/kits/network/libbind/isc/
H A Dmemcluster.c89 u_long blocks; member in struct:stats
242 * If there are no blocks in the free list for this size, get a chunk
243 * of memory and then break it up into "new_size"-sized blocks, adding
290 stats[new_size].blocks++;
292 /* Set up a linked-list of blocks of size "new_size". */
516 if (s->blocks != 0U)
518 s->blocks, s->freefrags);
555 * restrictions, both of which are needed to make lists of blocks.
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/dos/r5/
H A Dcache.h68 cache_ent_list normal, /* list of "normal" blocks (clean & dirty) */
69 locked; /* list of clean and locked blocks */
100 extern _IMPEXP_KERNEL int set_blocks_info(int dev, off_t *blocks, int nblocks,
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/udf/r5/
H A Dcache.h68 cache_ent_list normal, /* list of "normal" blocks (clean & dirty) */
69 locked; /* list of clean and locked blocks */
100 extern _IMPEXP_KERNEL int set_blocks_info(int dev, off_t *blocks, int nblocks,
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/headers/public/
H A Dcache.h74 cache_ent_list normal, /* list of "normal" blocks (clean & dirty) */
75 locked; /* list of clean and locked blocks */
110 extern _IMPEXP_KERNEL int set_blocks_info(int dev, off_t *blocks, int nblocks,
/haiku-fatelf/src/apps/bootmanager/
H A DLegacyBootMenu.cpp108 // The number of blocks required to store the
623 const size_t blocks = size / kBlockSize; local
625 for (size_t i = 0; i < blocks; i ++, block += kBlockSize) {
641 const size_t blocks = size / kBlockSize; local
643 for (size_t i = 0; i < blocks; i ++, block += kBlockSize) {
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DBlockAllocator.cpp21 // - find a range of blocks of a certain size nearby a specific position
22 // - allocating an unsharp range of blocks for pre-allocation
23 // - free blocks
32 // group can span several blocks in the block bitmap, the AllocationBlock
229 void AddFreeRange(int32 start, int32 blocks);
263 // 8 blocks per byte
280 // 8 blocks per byte
300 // the block bitmap is accessed in 32-bit blocks
328 // check for already set blocks
330 FATAL(("AllocationBlock::Allocate(): some blocks ar
[all...]

Completed in 256 milliseconds

1234