Searched refs:hole (Results 1 - 20 of 20) sorted by relevance

/freebsd-12-stable/sys/dev/drm2/radeon/
H A Dradeon_sa.c32 * 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...]
H A Dradeon.h389 * Assumption is that there won't be hole (all object on same
396 struct list_head *hole; member in struct:radeon_sa_manager
/freebsd-12-stable/sys/netinet/
H A Dtcp_sack.c449 struct sackhole *hole; local
457 hole = (struct sackhole *)uma_zalloc(V_sack_hole_zone, M_NOWAIT);
458 if (hole == NULL)
461 hole->start = start;
462 hole->end = end;
463 hole->rxmit = start;
468 return hole;
475 tcp_sackhole_free(struct tcpcb *tp, struct sackhole *hole) argument
478 uma_zfree(V_sack_hole_zone, hole);
488 * Insert new SACK hole int
494 struct sackhole *hole; local
518 tcp_sackhole_remove(struct tcpcb *tp, struct sackhole *hole) argument
852 struct sackhole *hole = NULL; local
[all...]
/freebsd-12-stable/sys/modules/netgraph/
H A DMakefile25 hole \
/freebsd-12-stable/usr.bin/mkimg/
H A Dimage.c401 off_t cur, data, end, hole, pos, iof; local
432 hole = lseek(fd, cur, SEEK_HOLE);
433 if (hole == -1)
434 hole = end;
443 if (hole == end && data == end)
446 if (cur == hole && data > hole) {
447 hole = pos;
450 blk += (pos - hole) / secsz;
453 bytesize += pos - hole;
[all...]
/freebsd-12-stable/sbin/hastd/
H A Dtoken.l79 hole { DP; return HOLE; }
/freebsd-12-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Ddmu_object.c326 * Return (in *objectp) the next object which is allocated (or a hole)
331 dmu_object_next(objset_t *os, uint64_t *objectp, boolean_t hole, uint64_t txg) argument
354 if (hole) {
363 if (hole) {
382 (hole ? DNODE_FIND_HOLE : 0), &offset, 0, DNODES_PER_BLOCK, txg);
H A Ddnode.c1246 * to ensure the hole at the specified object offset is large enough to
1259 * ENOSPC - hole too small to fulfill "slots" request (DNODE_MUST_BE_FREE)
2078 * Set i to the blockid of the next non-hole
2207 * Scans a block at the indicated "level" looking for a hole or data,
2233 boolean_t hole; local
2239 hole = ((flags & DNODE_FIND_HOLE) != 0);
2241 ASSERT(txg == 0 || !hole);
2253 if (hole)
2289 if ((dnp[i].dn_type == DMU_OT_NONE) == hole)
2305 if (hole)
[all...]
H A Dzfs_vnops.c258 boolean_t hole; local
266 hole = B_TRUE;
268 hole = B_FALSE;
270 error = dmu_offset_next(zp->z_zfsvfs->z_os, zp->z_id, hole, &noff);
276 * We could find a hole that begins after the logical end-of-file,
278 * EOF falls mid-block, then indicate that the "virtual hole"
283 ASSERT(hole);
H A Ddmu.c1183 * Find the next L1 indirect that is not a hole.
2002 * A block of zeros may compress to a hole, but the
2063 * it's an old style hole.
2516 dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole, uint64_t *off) argument
2535 err = dnode_next_offset(dn, (hole ? DNODE_FIND_HOLE : 0), off, 1, 1, 0);
H A Dzvol.c3356 boolean_t hole; local
3358 hole = (cmd == FIOSEEKHOLE);
3360 error = dmu_offset_next(zv->zv_objset, ZVOL_OBJ, hole, &noff);
/freebsd-12-stable/sys/i386/ibcs2/
H A Dimgact_coff.c308 vm_offset_t hole; local
470 hole = trunc_page((vm_offset_t)vmspace->vm_daddr +
474 __FILE__, __LINE__, (uintmax_t)hole));
478 (vm_offset_t *)&hole, PAGE_SIZE, 0, VMFS_NO_SPACE,
/freebsd-12-stable/sys/netgraph/
H A Dng_hole.c45 * This node is a 'black hole' that simply discards everything it receives
115 NETGRAPH_INIT(hole, &typestruct);
/freebsd-12-stable/contrib/libarchive/libarchive/
H A Darchive_read_support_format_iso9660.c2280 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 Darchive_read_support_format_tar.c117 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 Darchive_read_support_format_xar.c1224 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-12-stable/crypto/openssl/ssl/statem/
H A Dstatem_lib.c1727 * (creating a hole between TLSv1.3 and TLSv1.1) can still
2017 * @real_max: The highest version below the lowest compile time version hole
2018 * where that hole lies above at least one run-time enabled
2038 int hole; local
2073 * (protocol version client is disabled at compile-time) is also a "hole".
2075 * Our initial state is hole == 1, version == 0. That is, versions above
2076 * the first version in the method table are disabled (a "hole" above
2079 * Whenever "hole == 1", and we hit an enabled method, its version becomes
2081 * method. We're no longer in a hole, so "hole" become
[all...]
/freebsd-12-stable/tests/sys/fs/fusefs/
H A Dwrite.cc1172 char hole[holesize]; local
1190 EXPECT_EQ(rbufsize, r) << "read should've synthesized a hole";
1192 bzero(hole, holesize);
1193 EXPECT_EQ(0, memcmp(hole, readbuf + old_filesize, holesize));
/freebsd-12-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/sys/
H A Ddmu.h419 boolean_t hole, uint64_t txg);
990 * Find the next hole or data block in file starting at *off
993 int dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole,
/freebsd-12-stable/stand/
H A Ddefs.mk69 # our text + data + BTX have to fit into 640k below the ISA hole.

Completed in 277 milliseconds