Searched refs:hole (Results 26 - 35 of 35) sorted by relevance

12

/freebsd-current/sys/contrib/dev/iwlwifi/mvm/
H A Dsta.c3643 /* there's a hole at 2/3 in FW format depending on version */
3644 int hole = api_ver >= 3 ? 0 : 2; local
3651 rx_pn[2 + hole] = seq.tkip.iv32;
3652 rx_pn[3 + hole] = seq.tkip.iv32 >> 8;
3653 rx_pn[4 + hole] = seq.tkip.iv32 >> 16;
3654 rx_pn[5 + hole] = seq.tkip.iv32 >> 24;
3661 rx_pn[2 + hole] = seq.ccmp.pn[2];
3662 rx_pn[3 + hole] = seq.ccmp.pn[3];
3663 rx_pn[4 + hole] = seq.ccmp.pn[4];
3664 rx_pn[5 + hole]
[all...]
/freebsd-current/stand/
H A Ddefs.mk93 # our text + data + BTX have to fit into 640k below the ISA hole.
/freebsd-current/sys/contrib/openzfs/include/sys/
H A Ddmu.h463 boolean_t hole, uint64_t txg);
1080 * Find the next hole or data block in file starting at *off
1083 int dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole,
/freebsd-current/sys/contrib/openzfs/tests/test-runner/bin/
H A Dzts-report.py.in234 'fallocate/fallocate_punch-hole': ['SKIP', fspacectl_reason],
/freebsd-current/contrib/libarchive/libarchive/
H A Darchive_read_support_format_xar.c1227 int hole, parent; local
1263 * Start with hole at end, walk it up tree to find insertion point.
1265 hole = heap->used++;
1266 while (hole > 0) {
1267 parent = (hole - 1)/2;
1270 heap->files[hole] = file;
1273 /* Move parent into hole <==> move hole up tree. */
1274 heap->files[hole] = heap->files[parent];
1275 hole
[all...]
/freebsd-current/sys/contrib/openzfs/module/os/freebsd/zfs/
H A Dzvol_os.c1199 boolean_t hole; local
1201 hole = (cmd == FIOSEEKHOLE);
1205 error = dmu_offset_next(zv->zv_objset, ZVOL_OBJ, hole, &noff);
/freebsd-current/tests/sys/fs/fusefs/
H A Dwrite.cc1372 char hole[holesize]; local
1390 EXPECT_EQ(rbufsize, r) << "read should've synthesized a hole";
1392 bzero(hole, holesize);
1393 EXPECT_EQ(0, memcmp(hole, readbuf + old_filesize, holesize));
/freebsd-current/sys/contrib/openzfs/module/zfs/
H A Ddmu_send.c173 } hole; member in union:send_range::__anon25
1052 struct srh *srhp = &range->sru.hole;
1063 * Even if it has a birth time, it can never not be a hole, so
1166 * Even if it has a birth time, it can never not be a hole, so
1194 record->sru.hole.datablksz = datablksz;
1358 * compare last, objects compare before any data or hole inside that object and
1727 range->sru.hole.datablksz = datablksz;
1838 * visit the hole bp for it at some point.
1858 * This call finds the next non-hole block in
1861 * a large hole
[all...]
H A Ddmu.c80 * By default this is enabled to ensure accurate hole reporting, it can result
1569 * A block of zeros may compress to a hole, but the
1630 * it's an old style hole.
2165 * As a compromise, only provide hole data when the dnode is clean. When
2170 dmu_offset_next(objset_t *os, uint64_t object, boolean_t hole, uint64_t *off) argument
2185 * then hole reporting has been requested. Dirty dnodes
2208 (hole ? DNODE_FIND_HOLE : 0), off, 1, 1, 0);
2274 * It is effectively a hole, so report it as such.
/freebsd-current/sys/contrib/openzfs/tests/zfs-tests/tests/
H A DMakefile.am1469 functional/fallocate/fallocate_punch-hole.ksh \

Completed in 157 milliseconds

12