Home
last modified time | relevance | path

Searched refs:holes (Results 1 - 10 of 10) sorted by relevance

/third_party/rust/crates/regex/src/
H A Dcompile.rs488 let mut holes = vec![]; in c_class_bytes() variables
495 holes.push(self.push_hole(InstHole::Bytes { in c_class_bytes()
504 holes.push( in c_class_bytes()
508 Ok(Some(Patch { hole: Hole::Many(holes), entry: first_split_entry })) in c_class_bytes()
549 // Save up all of the holes from each alternate. They will all get in c_alternate()
551 let mut holes = vec![]; in c_alternate() variables
565 holes.push(hole); in c_alternate()
569 holes.push(split1); in c_alternate()
574 holes.push(hole); in c_alternate()
582 // empty branches both pushing prev_hole.0 into holes, s in c_alternate()
725 let mut holes = vec![]; c_repeat_range() variables
985 let mut holes = vec![]; compile() variables
[all...]
/third_party/mesa3d/src/util/
H A Dvma.c37 list_for_each_entry(struct util_vma_hole, _hole, &(_heap)->holes, link)
40 list_for_each_entry_safe(struct util_vma_hole, _hole, &(_heap)->holes, link)
43 list_for_each_entry_safe_rev(struct util_vma_hole, _hole, &(_heap)->holes, link)
49 list_inithead(&heap->holes); in util_vma_heap_init()
72 if (&hole->link == heap->holes.next) { in util_vma_heap_validate()
82 * holes during a util_vma_heap_free. in util_vma_heap_validate()
124 * holes, one high and one low. in util_vma_hole_alloc()
260 /* Find immediately higher and lower holes if they exist. */ in util_vma_heap_free()
281 /* Merge the two holes */ in util_vma_heap_free()
303 list_add(&hole->link, &heap->holes); in util_vma_heap_free()
[all...]
H A Dvma.h37 struct list_head holes; member
/third_party/mesa3d/src/gallium/winsys/radeon/drm/
H A Dradeon_drm_winsys.h52 struct list_head holes; member
H A Dradeon_drm_bo.c205 /* All VM address space holes will implicitly start aligned to the in radeon_bomgr_find_va()
212 LIST_FOR_EACH_ENTRY_SAFE(hole, n, &heap->holes, list) { in radeon_bomgr_find_va()
259 list_add(&n->list, &heap->holes); in radeon_bomgr_find_va()
295 if (!list_is_empty(&heap->holes)) { in radeon_bomgr_free_va()
296 hole = container_of(heap->holes.next, struct radeon_bo_va_hole, list); in radeon_bomgr_free_va()
306 hole = container_of(&heap->holes, struct radeon_bo_va_hole, list); in radeon_bomgr_free_va()
307 LIST_FOR_EACH_ENTRY(next, &heap->holes, list) { in radeon_bomgr_free_va()
313 if (&hole->list != &heap->holes) { in radeon_bomgr_free_va()
319 if (next != hole && &next->list != &heap->holes && in radeon_bomgr_free_va()
330 if (next != hole && &next->list != &heap->holes in radeon_bomgr_free_va()
[all...]
H A Dradeon_drm_winsys.c877 list_inithead(&ws->vm32.holes); in radeon_drm_winsys_create()
878 list_inithead(&ws->vm64.holes); in radeon_drm_winsys_create()
/third_party/ntfs-3g/libntfs-3g/
H A Dattrib.c1826 hole_type holes);
5301 hole_type holes)
5339 if ((newsize < vol->mft_record_size) && (holes != HOLES_NONRES)) {
5384 if (holes == HOLES_NONRES) {
5395 return ntfs_attr_truncate_i(na, newsize, holes);
5451 return ntfs_resident_attr_resize_i(na, newsize, holes);
5475 return ntfs_resident_attr_resize_i(na, newsize, holes);
5514 return ntfs_resident_attr_resize_i(na, newsize, holes);
5535 return ntfs_resident_attr_resize_i(na, newsize, holes);
5773 hole_type holes, ntfs_attr_search_ct
5300 ntfs_resident_attr_resize_i(ntfs_attr *na, const s64 newsize, hole_type holes) global() argument
5772 ntfs_attr_update_meta(ATTR_RECORD *a, ntfs_attr *na, MFT_RECORD *m, hole_type holes, ntfs_attr_search_ctx *ctx) global() argument
5900 ntfs_attr_update_mapping_pairs_i(ntfs_attr *na, VCN from_vcn, hole_type holes) global() argument
6499 ntfs_non_resident_attr_expand_i(ntfs_attr *na, const s64 newsize, hole_type holes) global() argument
6735 ntfs_non_resident_attr_expand(ntfs_attr *na, const s64 newsize, hole_type holes) global() argument
6767 ntfs_attr_truncate_i(ntfs_attr *na, const s64 newsize, hole_type holes) global() argument
[all...]
H A Dcompress.c1188 err = "Adjacent holes"; in valid_compressed_run()
1270 int holes = 0; in ntfs_compress_overwr_free() local
1283 holes++; in ntfs_compress_overwr_free()
1300 holes++; in ntfs_compress_overwr_free()
1315 switch (holes) { in ntfs_compress_overwr_free()
1375 /* there were several holes, must merge them */ in ntfs_compress_overwr_free()
1379 if (freerl[holes].lcn == LCN_HOLE) { in ntfs_compress_overwr_free()
1380 freerl->length += freerl[holes].length; in ntfs_compress_overwr_free()
1381 holes++; in ntfs_compress_overwr_free()
1386 *erl = erl[holes in ntfs_compress_overwr_free()
[all...]
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/pipeline/
H A DvktPipelineMiscTests.cpp1370 bool holes; member
1376 * Descriptor sets with index holes updated/bound/used
1451 if (!m_config.holes) { in initPrograms()
1469 if (!m_config.holes) { in initPrograms()
1632 if (m_config.holes && ((i == 1) || (i == 2))) { in iterate()
/third_party/node/deps/v8/src/diagnostics/
H A Dobjects-debug.cc1999 int holes = 0; in IncrementSpillStatistics() local
2003 if (e.get(i).IsTheHole(isolate)) holes++; in IncrementSpillStatistics()
2005 info->number_of_fast_used_elements_ += len - holes; in IncrementSpillStatistics()
2006 info->number_of_fast_unused_elements_ += holes; in IncrementSpillStatistics()

Completed in 19 milliseconds