| /src/external/bsd/libarchive/dist/libarchive/test/ |
| test_sparse_basic.c | 52 /* The logic to compare sparse file data read from disk with the
63 struct sparse { struct
68 static void create_sparse_file(const char *, const struct sparse *);
71 * does support sparse files is certain to store a gap this big
84 * Create a sparse file on Windows.
117 create_sparse_file(const char *path, const struct sparse *s)
175 * FIEMAP, which can detect 'hole' of a sparse file, has
182 const struct sparse sparse_file[] = {
183 /* This hole size is too small to create a sparse
223 * FreeBSD and Solaris can detect 'hole' of a sparse fil
[all...] |
| test_write_disk_sparse.c | 34 verify_write_data(struct archive *a, int sparse)
41 const char *msg = sparse ? "sparse" : "non-sparse";
56 /* Use archive_write_data() to write three relatively sparse blocks. */
131 verify_write_data_block(struct archive *a, int sparse)
138 const char *msg = sparse ? "sparse" : "non-sparse";
154 relatively sparse blocks. *
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvif/ |
| vmm.h | 27 bool sparse:1; member in struct:nvif_vmm::__anon5167
38 int nvif_vmm_get(struct nvif_vmm *, enum nvif_vmm_get, bool sparse,
|
| if000c.h | 28 __u8 sparse; member in struct:nvif_vmm_page_v0
41 __u8 sparse; member in struct:nvif_vmm_get_v0
|
| /src/external/bsd/pam-u2f/dist/fuzz/ |
| coverage.sh | 9 llvm-profdata merge -sparse *.profraw -o default.profdata
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvif/ |
| nouveau_nvif_vmm.c | 82 nvif_vmm_get(struct nvif_vmm *vmm, enum nvif_vmm_get type, bool sparse,
89 args.sparse = sparse;
163 vmm->page[i].sparse = args.sparse;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| sparseset.h | 24 /* Implementation of the Briggs and Torczon sparse set representation.
25 The sparse set representation was first published in:
27 "An Efficient Representation for Sparse Sets",
30 The sparse set representation is suitable for integer sets with a
32 the set. If an element I is in the set, then sparse[I] is the
33 index of I in the dense vector, and dense[sparse[I]] == I. The dense
47 Additionally, the sparse set representation supports enumeration of
50 This makes it a competitive choice for iterating over relatively sparse
65 sparse sets will often be superior to alternatives such as simple
67 hash tables, linked lists, etc., if the set is sufficiently sparse
91 SPARSESET_ELT_TYPE *sparse; \/* Sparse array. *\/ member in struct:sparseset_def
[all...] |
| sparseset.cc | 36 read errors when accessing set->sparse[n] when "n" is not, and never has
42 set->sparse = &(set->elms[n_elms]);
67 SPARSESET_ELT_TYPE idx = s->sparse[e];
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| sparseset.h | 24 /* Implementation of the Briggs and Torczon sparse set representation.
25 The sparse set representation was first published in:
27 "An Efficient Representation for Sparse Sets",
30 The sparse set representation is suitable for integer sets with a
32 the set. If an element I is in the set, then sparse[I] is the
33 index of I in the dense vector, and dense[sparse[I]] == I. The dense
47 Additionally, the sparse set representation supports enumeration of
50 This makes it a competitive choice for iterating over relatively sparse
65 sparse sets will often be superior to alternatives such as simple
67 hash tables, linked lists, etc., if the set is sufficiently sparse
91 SPARSESET_ELT_TYPE *sparse; \/* Sparse array. *\/ member in struct:sparseset_def
[all...] |
| sparseset.cc | 36 read errors when accessing set->sparse[n] when "n" is not, and never has
42 set->sparse = &(set->elms[n_elms]);
67 SPARSESET_ELT_TYPE idx = s->sparse[e];
|
| /src/bin/dd/ |
| misc.c | 125 if (st.sparse) {
126 (void)snprintf(buf, sizeof(buf), "%llu sparse output %s\n",
127 (unsigned long long)st.sparse,
128 (st.sparse == 1) ? "block" : "blocks");
267 (unsigned long long)st.sparse);
282 if (st.sparse != 1) ADDS("s");
327 if (st.sparse) {
328 (void)dd_write_msg("%p sparse output %P\n", 1);
|
| dd.c | 81 static off_t pending = 0; /* pending seek if sparse */
503 /* If there are pending sparse blocks, make sure
504 * to write out the final block un-sparse
561 int sparse, i; local
562 sparse = 1; /* Is buffer sparse? */
565 sparse = 0;
568 if (sparse) {
578 err(EXIT_FAILURE, "%s: seek error creating sparse file",
594 st.sparse += pending/out.dbsz
[all...] |
| dd.h | 97 uint64_t sparse; /* # of sparse output blocks */ member in struct:__anon2
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/mmu/ |
| nouveau_nvkm_subdev_mmu_vmmgm200.c | 36 /* VALID_FALSE + VOL tells the MMU to treat the PTE as sparse. */
43 .sparse = gm200_vmm_pgt_sparse,
55 .sparse = gm200_vmm_pgt_sparse,
63 /* VALID_FALSE + VOL_BIG tells the MMU to treat the PDE as sparse. */
70 .sparse = gm200_vmm_pgd_sparse,
|
| nouveau_nvkm_subdev_mmu_vmm.c | 47 nvkm_vmm_pt_new(const struct nvkm_vmm_desc *desc, bool sparse,
66 pgt->sparse = sparse;
165 if (pgt->sparse) {
166 func->sparse(vmm, pgd->pt[0], pdei, 1);
251 pair->func->sparse(vmm, pgt->pt[0], pteb, ptes);
351 /* The entire LPTE is marked as sparse, we need
355 desc->func->sparse(vmm, pgt->pt[1], spti, sptc);
356 /* Sparse LPTEs prevent SPTEs from being accessed. */
425 const bool zero = !pgt->sparse && !desc->func->invalid
[all...] |
| nouveau_nvkm_subdev_mmu_uvmm.c | 283 bool getref, mapref, sparse; local
290 sparse = args->v0.sparse;
298 ret = nvkm_vmm_get_locked(vmm, getref, mapref, sparse,
327 args->v0.sparse = !!(type & NVKM_VMM_PAGE_SPARSE);
|
| nouveau_nvkm_subdev_mmu_vmmgp100.c | 176 /* VALID_FALSE + VOL tells the MMU to treat the PTE as sparse. */
183 .sparse = gp100_vmm_pgt_sparse,
206 .sparse = gp100_vmm_pgt_sparse,
269 /* VALID_FALSE + VOL_BIG tells the MMU to treat the PDE as sparse. */
283 .sparse = gp100_vmm_pd0_sparse,
306 .sparse = gp100_vmm_pgt_sparse,
|
| /src/sys/external/bsd/drm2/dist/drm/i915/gvt/ |
| kvmgt.c | 1313 struct vfio_region_info_cap_sparse_mmap *sparse = NULL; local
1356 sparse = kzalloc(struct_size(sparse, areas, nr_areas),
1358 if (!sparse)
1361 sparse->header.id = VFIO_REGION_INFO_CAP_SPARSE_MMAP;
1362 sparse->header.version = 1;
1363 sparse->nr_areas = nr_areas;
1365 sparse->areas[0].offset =
1367 sparse->areas[0].size = vgpu_aperture_sz(vgpu);
1418 if ((info.flags & VFIO_REGION_INFO_FLAG_CAPS) && sparse) {
[all...] |
| /src/external/bsd/unbound/dist/testdata/redis_reconnect_interval.tdir/ |
| redis.conf | 491 # HyperLogLog sparse representation bytes limit. The limit includes the
492 # 16 bytes header. When a HyperLogLog using the sparse representation crosses
500 # which is O(N) with the sparse encoding. The value can be raised to
503 hll-sparse-max-bytes 3000
|
| /src/external/bsd/unbound/dist/testdata/redis_replica.tdir/ |
| redis.conf | 491 # HyperLogLog sparse representation bytes limit. The limit includes the
492 # 16 bytes header. When a HyperLogLog using the sparse representation crosses
500 # which is O(N) with the sparse encoding. The value can be raised to
503 hll-sparse-max-bytes 3000
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/subdev/ |
| mmu.h | 14 bool sparse:1; /* Unmapped PDEs/PTEs will not trigger MMU faults. */ member in struct:nvkm_vma
|
| /src/usr.sbin/makefs/ |
| makefs.h | 177 int sparse; /* sparse image, don't fill it with zeros */ member in struct:makefs_fsinfo
|
| /src/external/bsd/zstd/dist/programs/ |
| fileio.h | 85 void FIO_setSparseWrite(FIO_prefs_t* const prefs, int sparse); /**< 0: no sparse; 1: disable on stdout; 2: always enabled */
|
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_read_support_format_tar.c | 100 struct gnu_sparse sparse[4]; member in struct:archive_entry_header_gnutar
121 /* For "GNU.sparse.name" and other similar path extensions. */
174 const struct gnu_sparse *sparse, int length);
245 static const size_t sparse_map_limit = 8 * 1048576; /* Longest sparse map: 8MiB */
566 * "non-sparse" files are really just sparse files with
619 /* Remove exhausted entries from sparse list. */
657 * current sparse block. */
691 /* Free the sparse list. */
950 /* Reconcile GNU sparse attributes *
3109 struct gnu_sparse sparse[21]; member in struct:extended
[all...] |
| /src/external/bsd/libarchive/dist/tar/ |
| write.c | 763 int64_t sparse = offset - progress; local
771 while (sparse > 0) {
772 if (sparse > (int64_t)bsdtar->buff_size)
775 ns = (size_t)sparse;
794 sparse -= bytes_written;
|
