| /freebsd-11-stable/sbin/hastd/ |
| H A D | token.l | 79 hole { DP; return HOLE; }
|
| /freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/ |
| H A D | dmu.c | 1142 * Find the next L1 indirect that is not a hole.
1953 * A block of zeros may compress to a hole, but the
2005 * it's an old style hole.
2447 dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole, uint64_t *off) argument
2466 err = dnode_next_offset(dn, (hole ? DNODE_FIND_HOLE : 0), off, 1, 1, 0);
|
| H A D | dmu_object.c | 182 * Return (in *objectp) the next object which is allocated (or a hole)
187 dmu_object_next(objset_t *os, uint64_t *objectp, boolean_t hole, uint64_t txg) argument
193 (hole ? DNODE_FIND_HOLE : 0), &offset, 0, DNODES_PER_BLOCK, txg);
|
| H A D | dnode.c | 1733 * Set i to the blockid of the next non-hole
1862 * Scans a block at the indicated "level" looking for a hole or data,
1888 boolean_t hole; local
1894 hole = ((flags & DNODE_FIND_HOLE) != 0);
1896 ASSERT(txg == 0 || !hole);
1908 if (hole)
1943 if ((dnp[i].dn_type == DMU_OT_NONE) == hole)
1956 if (hole)
1966 (hole || bp[i].blk_birth > txg))
1990 * Find the next hole, dat
[all...] |
| H A D | zfs_vnops.c | 257 boolean_t hole; local
265 hole = B_TRUE;
267 hole = B_FALSE;
269 error = dmu_offset_next(zp->z_zfsvfs->z_os, zp->z_id, hole, &noff);
275 * We could find a hole that begins after the logical end-of-file,
277 * EOF falls mid-block, then indicate that the "virtual hole"
282 ASSERT(hole);
|
| H A D | zvol.c | 3238 boolean_t hole; local
3240 hole = (cmd == FIOSEEKHOLE);
3242 error = dmu_offset_next(zv->zv_objset, ZVOL_OBJ, hole, &noff);
|
| /freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/sys/ |
| H A D | dmu.h | 397 boolean_t hole, uint64_t txg);
963 * Find the next hole or data block in file starting at *off
966 int dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole,
|
| /freebsd-11-stable/sys/dev/drm2/radeon/ |
| H A D | radeon.h | 389 * Assumption is that there won't be hole (all object on same
396 struct list_head *hole; member in struct:radeon_sa_manager
|
| H A D | radeon_sa.c | 32 * We store the last allocated bo in "hole", we always try to allocate
65 sa_manager->hole = &sa_manager->olist;
87 sa_manager->hole = &sa_manager->olist,
151 if (sa_manager->hole == &sa_bo->olist) {
152 sa_manager->hole = sa_bo->olist.prev;
164 if (sa_manager->hole->next == &sa_manager->olist)
167 sa_bo = list_entry(sa_manager->hole->next, struct radeon_sa_bo, olist);
178 struct list_head *hole = sa_manager->hole; local
180 if (hole !
188 struct list_head *hole = sa_manager->hole; local
[all...] |
| /freebsd-11-stable/sys/i386/ibcs2/ |
| H A D | imgact_coff.c | 306 vm_offset_t hole; local
468 hole = trunc_page((vm_offset_t)vmspace->vm_daddr +
472 __FILE__, __LINE__, (uintmax_t)hole));
476 (vm_offset_t *)&hole, PAGE_SIZE, 0, VMFS_NO_SPACE,
|
| /freebsd-11-stable/sys/netgraph/ |
| H A D | ng_hole.c | 45 * This node is a 'black hole' that simply discards everything it receives
115 NETGRAPH_INIT(hole, &typestruct);
|
| /freebsd-11-stable/usr.bin/mkimg/ |
| H A D | image.c | 392 off_t cur, data, end, hole, pos; local
422 hole = lseek(fd, cur, SEEK_HOLE);
423 if (hole == -1)
424 hole = end;
433 if (hole == end && data == end)
436 if (cur == hole && data > hole) {
437 hole = pos;
440 blk += (pos - hole) / secsz;
443 bytesize += pos - hole;
[all...] |
| /freebsd-11-stable/contrib/libarchive/libarchive/ |
| H A D | archive_read_support_format_iso9660.c | 2280 int hole, parent; local
2324 * Start with hole at end, walk it up tree to find insertion point.
2326 hole = heap->cnt++;
2327 while (hole > 0) {
2328 parent = (hole - 1)/2;
2331 heap->reqs[hole].offset = offset;
2332 heap->reqs[hole].file = file;
2335 /* Move parent into hole <==> move hole up tree. */
2336 heap->reqs[hole]
3015 int hole, parent; local
[all...] |
| H A D | archive_read_support_format_tar.c | 117 int hole; member in struct:sparse_block
560 if (!sb->hole)
644 if (!tar->sparse_list->hole)
646 /* Current is hole data and skip this. */
660 /* Do not consume the hole of a sparse file. */
663 if (!p->hole) {
2545 * data and hole pairs. The way recording sparse information by Solaris'
2547 * consist of both data and hole.
2555 int hole = 1; local
2579 tar->sparse_last->hole
[all...] |
| H A D | archive_read_support_format_xar.c | 1224 int hole, parent; local
1260 * Start with hole at end, walk it up tree to find insertion point.
1262 hole = heap->used++;
1263 while (hole > 0) {
1264 parent = (hole - 1)/2;
1267 heap->files[hole] = file;
1270 /* Move parent into hole <==> move hole up tree. */
1271 heap->files[hole] = heap->files[parent];
1272 hole
[all...] |
| /freebsd-11-stable/stand/ |
| H A D | defs.mk | 68 # our text + data + BTX have to fit into 640k below the ISA hole.
|
| /freebsd-11-stable/sys/modules/netgraph/ |
| H A D | Makefile | 25 hole \
|
| /freebsd-11-stable/sys/netinet/ |
| H A D | tcp_sack.c | 450 struct sackhole *hole; local
458 hole = (struct sackhole *)uma_zalloc(V_sack_hole_zone, M_NOWAIT);
459 if (hole == NULL)
462 hole->start = start;
463 hole->end = end;
464 hole->rxmit = start;
469 return hole;
476 tcp_sackhole_free(struct tcpcb *tp, struct sackhole *hole) argument
479 uma_zfree(V_sack_hole_zone, hole);
489 * Insert new SACK hole int
495 struct sackhole *hole; local
519 tcp_sackhole_remove(struct tcpcb *tp, struct sackhole *hole) argument
837 struct sackhole *hole = NULL; local
[all...] |