| /third_party/mesa3d/src/panfrost/bifrost/ |
| H A D | nodearray.h | 24 /* A nodearray is an array type that is either sparse or dense, depending on
30 * In sparse mode, the array has elements with a 24-bit node index and a value.
37 * up a lot, especially when NEON is available, by making the sparse mode store
53 * elements and included into sparse elements.
59 /* Type storing sparse nodearray elements, consisting of a nodearray_value at
66 nodearray_sparse *sparse; member
77 for (nodearray_sparse *elem = (buf)->sparse; \
78 elem < (buf)->sparse + (buf)->size; elem++)
103 free(a->sparse); in nodearray_reset()
132 nodearray_sparse *data = a->sparse; in nodearray_sparse_search()
[all...] |
| /third_party/mesa3d/src/gallium/drivers/zink/ |
| H A D | zink_bo.c | 52 * sparse buffer.
337 list_for_each_entry(struct zink_sparse_backing, backing, &bo->u.sparse.backing, list) { in sparse_backing_alloc()
367 assert(bo->u.sparse.num_backing_pages < DIV_ROUND_UP(bo->base.size, ZINK_SPARSE_BUFFER_PAGE_SIZE)); in sparse_backing_alloc()
371 bo->base.size - (uint64_t)bo->u.sparse.num_backing_pages * ZINK_SPARSE_BUFFER_PAGE_SIZE); in sparse_backing_alloc()
390 list_add(&best_backing->list, &bo->u.sparse.backing); in sparse_backing_alloc()
391 bo->u.sparse.num_backing_pages += pages; in sparse_backing_alloc()
414 bo->u.sparse.num_backing_pages -= backing->bo->base.size / ZINK_SPARSE_BUFFER_PAGE_SIZE; in sparse_free_backing_buffer()
494 while (!list_is_empty(&bo->u.sparse.backing)) { in bo_sparse_destroy()
496 container_of(bo->u.sparse.backing.next, in bo_sparse_destroy()
500 FREE(bo->u.sparse in bo_sparse_destroy()
729 VkBindSparseInfo sparse = {0}; buffer_commit_single() local
878 VkBindSparseInfo sparse = {0}; texture_commit_single() local
903 VkBindSparseInfo sparse = {0}; texture_commit_miptail() local
[all...] |
| /third_party/rust/crates/aho-corasick/src/ |
| H A D | nfa.rs | 369 /// Transitions have either a sparse representation, which is slower for
371 /// for lookups but uses more memory. In the sparse representation, the absence
387 Transitions::Sparse(ref sparse) => { in heap_bytes()
388 sparse.len() * size_of::<(u8, S)>() in heap_bytes()
396 Transitions::Sparse(ref sparse) => { in next_state()
397 for &(b, id) in sparse { in next_state()
410 Transitions::Sparse(ref mut sparse) => { in set_next_state()
411 match sparse.binary_search_by_key(&input, |&(b, _)| b) { in set_next_state()
412 Ok(i) => sparse[i] = (input, next), in set_next_state()
413 Err(i) => sparse in set_next_state()
[all...] |
| /third_party/rust/crates/regex/src/ |
| H A D | sparse.rs | 5 /// A sparse set used for representing ordered NFA states.
11 /// The data structure is based on: https://research.swtch.com/sparse
23 /// sparse[ip] < dense.len() && ip == dense[sparse[ip]].
24 sparse: Box<[usize]>,
31 sparse: vec![0; size].into_boxed_slice(), in new()
51 self.sparse[value] = i; in insert()
55 let i = self.sparse[value]; in contains()
|
| /third_party/toybox/toys/posix/ |
| H A D | tar.c | 20 USE_TAR(NEWTOY(tar, "&(restrict)(full-time)(no-recursion)(numeric-owner)(no-same-permissions)(overwrite)(exclude)*(mode):(mtime):(group):(owner):(to-command):o(no-same-owner)p(same-permissions)k(keep-old)c(create)|h(dereference)x(extract)|t(list)|v(verbose)J(xz)j(bzip2)z(gzip)S(sparse)O(to-stdout)m(touch)X(exclude-from)*T(files-from)*C(directory):f(file):a[!txc][!jzJa]", TOYFLAG_USR|TOYFLAG_BIN))
40 --sparse Record sparse files
59 long long *sparse;
311 TT.sparse = xrealloc(TT.sparse, (TT.sparselen+514)*sizeof(long long)); in add_to_tar()
313 TT.sparse[TT.sparselen++] = ld; in add_to_tar()
314 len += TT.sparse[TT.sparselen++] = lo-ld; in add_to_tar()
321 TT.sparse[TT.sparselen++] = st->st_size; in add_to_tar()
322 TT.sparse[T in add_to_tar()
611 char sparse[512]; unpack_tar() local
[all...] |
| /third_party/rust/crates/regex/src/literal/ |
| H A D | imp.rs | 278 sparse: Vec<bool>,
287 sparse: vec![false; 256], in new()
299 if !sset.sparse[b as usize] { in prefixes()
304 sset.sparse[b as usize] = true; in prefixes()
316 if !sset.sparse[b as usize] { in suffixes()
321 sset.sparse[b as usize] = true; in suffixes()
343 if self.sparse[b as usize] { in _find()
352 + (self.sparse.len() * mem::size_of::<bool>()) in approximate_size()
|
| /third_party/ltp/tools/sparse/ |
| H A D | Makefile | 9 SPARSE_SRC ?= sparse-src
12 ifeq ($(SPARSE_SRC),sparse-src)
21 HOST_MAKE_TARGETS := sparse-ltp
|
| /third_party/ltp/include/mk/ |
| H A D | env_post.mk | 96 CHECK ?= $(abs_top_srcdir)/tools/sparse/sparse-ltp
101 ifeq ($(CHECK),$(abs_top_srcdir)/tools/sparse/sparse-ltp)
|
| H A D | sparse.mk | 1 # Rules to make sparse tool(s) for inclusion in lib and testcases Makefiles
3 SPARSE_DIR:= $(abs_top_builddir)/tools/sparse
5 $(SPARSE_DIR)/sparse-ltp: $(SPARSE_DIR)
|
| /third_party/mesa3d/src/gallium/winsys/amdgpu/drm/ |
| H A D | amdgpu_bo.c | 43 /* Set to 1 for verbose output showing committed sparse buffer ranges. */
841 __func__, bo, bo->base.size, bo->u.sparse.num_va_pages, func); in sparse_dump()
852 if (va_page < bo->u.sparse.num_va_pages) { in sparse_dump()
853 backing = bo->u.sparse.commitments[va_page].backing; in sparse_dump()
854 backing_page = bo->u.sparse.commitments[va_page].page; in sparse_dump()
868 if (va_page >= bo->u.sparse.num_va_pages) in sparse_dump()
882 list_for_each_entry(struct amdgpu_sparse_backing, backing, &bo->u.sparse.backing, list) { in sparse_dump()
908 list_for_each_entry(struct amdgpu_sparse_backing, backing, &bo->u.sparse.backing, list) { in sparse_backing_alloc()
938 assert(bo->u.sparse.num_backing_pages < DIV_ROUND_UP(bo->base.size, RADEON_SPARSE_PAGE_SIZE)); in sparse_backing_alloc()
942 bo->base.size - (uint64_t)bo->u.sparse in sparse_backing_alloc()
[all...] |
| /third_party/ltp/tools/sparse/sparse-src/ |
| H A D | Makefile | 100 PROGRAMS += sparse
108 INST_PROGRAMS=sparse cgcc
109 INST_MAN1=sparse.1 cgcc.1
195 # Can we use LLVM (needed for ... sparse-llvm)?
207 LLVM_PROGS := sparse-llvm
215 INST_PROGRAMS += sparse-llvm sparsec
216 sparse-llvm-cflags := $(LLVM_CFLAGS)
217 sparse-llvm-ldflags := $(LLVM_LDFLAGS)
218 sparse-llvm-ldlibs := $(LLVM_LIBS)
223 $(warning sparse
[all...] |
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/sparse_resources/ |
| H A D | vktSparseResourcesQueueBindSparseTests.cpp | 21 * \brief Queue bind sparse tests
46 namespace sparse namespace
59 bool emptySubmission; //! will make an empty bind sparse submission
68 VkBindSparseInfo sparse; member
129 submission.info.sparse = bindInfo; in makeSubmissionSparse()
170 // We probably have picked the sparse queue again, so filter it out in iterate()
200 // Prepare submissions: signal semaphores for the sparse bind operation in iterate()
207 if (numQueues == 1u) // sparse queue is assigned last in iterate()
209 // sparse queue can handle regular submissions as well in iterate()
225 // Prepare submission: bind sparse in iterate()
[all...] |
| H A D | vktSparseResourcesBufferMemoryAliasing.hpp | 31 namespace sparse namespace
36 } // sparse
|
| H A D | vktSparseResourcesBufferSparseBinding.hpp | 31 namespace sparse namespace
36 } // sparse
|
| H A D | vktSparseResourcesBufferSparseResidency.hpp | 31 namespace sparse namespace
36 } // sparse
|
| H A D | vktSparseResourcesBufferTests.hpp | 31 namespace sparse namespace
36 } // sparse
|
| H A D | vktSparseResourcesImageAlignedMipSize.hpp | 32 namespace sparse namespace
37 } // sparse
|
| H A D | vktSparseResourcesImageBlockShapes.hpp | 32 namespace sparse namespace
37 } // sparse
|
| H A D | vktSparseResourcesQueueBindSparseTests.hpp | 23 * \brief Queue bind sparse tests
31 namespace sparse namespace
36 } // sparse
|
| H A D | vktSparseResourcesShaderIntrinsics.hpp | 31 namespace sparse namespace
36 } // sparse
|
| /third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/sparse_resources/ |
| H A D | vktSparseResourcesQueueBindSparseTests.cpp | 21 * \brief Queue bind sparse tests
46 namespace sparse namespace
59 bool emptySubmission; //! will make an empty bind sparse submission
68 VkBindSparseInfo sparse; member
129 submission.info.sparse = bindInfo; in makeSubmissionSparse()
170 // We probably have picked the sparse queue again, so filter it out in iterate()
200 // Prepare submissions: signal semaphores for the sparse bind operation in iterate()
207 if (numQueues == 1u) // sparse queue is assigned last in iterate()
209 // sparse queue can handle regular submissions as well in iterate()
225 // Prepare submission: bind sparse in iterate()
[all...] |
| H A D | vktSparseResourcesBufferMemoryAliasing.hpp | 31 namespace sparse namespace
36 } // sparse
|
| H A D | vktSparseResourcesBufferSparseBinding.hpp | 31 namespace sparse namespace
36 } // sparse
|
| /third_party/lz4/tests/ |
| H A D | Makefile | 206 .PHONY: test-lz4-sparse
214 test-lz4-sparse: FPREFIX = tmp-tls
215 test-lz4-sparse: lz4 datagen
216 @echo "\n ---- test sparse file support ----"
218 $(LZ4) -B4D $(FPREFIX)dg5M -c | $(LZ4) -dv --sparse > $(FPREFIX)cB4
220 $(LZ4) -B5D $(FPREFIX)dg5M -c | $(LZ4) -dv --sparse > $(FPREFIX)cB5
222 $(LZ4) -B6D $(FPREFIX)dg5M -c | $(LZ4) -dv --sparse > $(FPREFIX)cB6
224 $(LZ4) -B7D $(FPREFIX)dg5M -c | $(LZ4) -dv --sparse > $(FPREFIX)cB7
226 $(LZ4) $(FPREFIX)dg5M -c | $(LZ4) -dv --no-sparse > $(FPREFIX)nosparse
229 $(DATAGEN) -s1 -g1200007 -P100 | $(LZ4) | $(LZ4) -dv --sparse >
[all...] |
| /third_party/python/Lib/ |
| H A D | tarfile.py | 101 GNUTYPE_SPARSE = b"S" # GNU tar sparse file
712 tarinfo.size, tarinfo.sparse)
869 sparse = 'Sparse member information.', variable in TarInfo
896 self.sparse = None # sparse member information
1256 # The old GNU sparse format occupies some of the unused
1257 # space in the buffer for up to 4 sparse structures.
1367 """Process a GNU sparse header plus extra headers.
1369 # We already collected some sparse structures in frombuf().
1373 # Collect sparse structure
[all...] |