| /src/tests/usr.bin/xlint/lint1/ |
| d_cast_typeof.c | 9 struct foo *hole; variable in typeref:struct:foo *
14 return hole ?
15 ((char *)&((typeof(hole))0)->list) :
16 ((char *)&((typeof(*hole) *)0)->list);
|
| /src/sys/external/bsd/drm2/dist/drm/radeon/ |
| radeon_sa.c | 34 * We store the last allocated bo in "hole", we always try to allocate
71 sa_manager->hole = &sa_manager->olist;
93 sa_manager->hole = &sa_manager->olist,
159 if (sa_manager->hole == &sa_bo->olist) {
160 sa_manager->hole = sa_bo->olist.prev;
172 if (sa_manager->hole->next == &sa_manager->olist)
175 sa_bo = list_entry(sa_manager->hole->next, struct radeon_sa_bo, olist);
186 struct list_head *hole = sa_manager->hole; local in function:radeon_sa_bo_hole_soffset
188 if (hole != &sa_manager->olist)
196 struct list_head *hole = sa_manager->hole; local in function:radeon_sa_bo_hole_eoffset
[all...] |
| radeon.h | 558 * Hole are not considered for allocation to keep things simple.
559 * Assumption is that there won't be hole (all object on same
570 struct list_head *hole; member in struct:radeon_sa_manager
|
| /src/sys/external/bsd/drm2/dist/drm/amd/amdgpu/ |
| amdgpu_sa.c | 34 * We store the last allocated bo in "hole", we always try to allocate
67 sa_manager->hole = &sa_manager->olist;
94 sa_manager->hole = &sa_manager->olist,
113 if (sa_manager->hole == &sa_bo->olist) {
114 sa_manager->hole = sa_bo->olist.prev;
126 if (sa_manager->hole->next == &sa_manager->olist)
129 sa_bo = list_entry(sa_manager->hole->next, struct amdgpu_sa_bo, olist);
141 struct list_head *hole = sa_manager->hole; local in function:amdgpu_sa_bo_hole_soffset
143 if (hole != &sa_manager->olist)
151 struct list_head *hole = sa_manager->hole; local in function:amdgpu_sa_bo_hole_eoffset
[all...] |
| amdgpu.h | 372 * Hole are not considered for allocation to keep things simple.
373 * Assumption is that there won't be hole (all object on same
383 struct list_head *hole; member in struct:amdgpu_sa_manager
|
| /src/sys/external/bsd/drm2/dist/drm/i915/selftests/ |
| i915_gem_evict.c | 411 struct drm_mm_node hole; local in function:igt_evict_contexts
432 memset(&hole, 0, sizeof(hole));
434 err = i915_gem_gtt_insert(&ggtt->vm, &hole,
467 drm_mm_remove_node(&hole);
540 if (drm_mm_node_allocated(&hole))
541 drm_mm_remove_node(&hole);
|
| /src/sys/netinet/ |
| tcp_sack.c | 171 struct sackhole *hole; local in function:sack_allochole
177 hole = pool_get(&sackhole_pool, PR_NOWAIT);
178 if (hole == NULL) {
184 return hole;
191 struct sackhole *hole; local in function:sack_inserthole
193 hole = sack_allochole(tp);
194 if (hole == NULL) {
197 hole->start = hole->rxmit = start;
198 hole->end = end
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_mm.c | 532 * 0 on success, -ENOSPC if there's no hole where @node is.
537 struct drm_mm_node *hole; local in function:drm_mm_reserve_node
545 /* Find the relevant hole to add our node to */
546 hole = find_hole(mm, node->start);
547 if (!hole)
550 adj_start = hole_start = __drm_mm_hole_node_start(hole);
551 adj_end = hole_end = hole_start + hole->hole_size;
554 mm->color_adjust(hole, node->color, &adj_start, &adj_end);
562 list_add(&node->node_list, &hole->node_list);
564 drm_mm_interval_tree_add_node(hole, node)
607 struct drm_mm_node *hole; local in function:drm_mm_insert_node_in_range
878 struct drm_mm_node *hole; local in function:drm_mm_scan_add_block
1009 struct drm_mm_node *hole; local in function:drm_mm_scan_color_evict
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/i915/gem/selftests/ |
| i915_gem_mman.c | 617 struct drm_mm_node *hole, *next; local in function:igt_mmap_offset_exhaustion
630 list_for_each_entry_safe(hole, next, &mm->hole_stack, hole_stack) {
639 resv->start = drm_mm_hole_node_start(hole) + loop;
640 resv->size = hole->hole_size - loop;
649 pr_debug("Reserving hole [%llx + %llx]\n",
664 pr_err("Unable to insert object into single page hole\n");
671 pr_err("Unexpectedly succeeded in inserting too large object into single page hole\n");
676 /* Fill the hole, further allocation attempts should then fail */
685 pr_err("Unable to insert object into reclaimed hole\n");
719 drm_mm_for_each_node_safe(hole, next, mm)
[all...] |
| /src/sys/arch/sandpoint/stand/altboot/ |
| pcn.c | 60 uint32_t hole; member in struct:desc
|
| sip.c | 58 uint32_t hole; member in struct:desc
|
| /src/sys/external/bsd/drm2/dist/drm/selftests/ |
| test-drm_mm.c | 60 struct drm_mm_node *hole; local in function:assert_no_holes
65 drm_mm_for_each_hole(hole, mm, hole_start, hole_end)
72 drm_mm_for_each_node(hole, mm) {
73 if (drm_mm_hole_follows(hole)) {
74 pr_err("Hole follows node, expected none!\n");
84 struct drm_mm_node *hole; local in function:assert_one_hole
93 drm_mm_for_each_hole(hole, mm, hole_start, hole_end) {
96 pr_err("empty mm has incorrect hole, found (%llx, %llx), expect (%llx, %llx)\n",
104 pr_err("Expected to find one hole, found %lu instead\n", count);
136 pr_err("node[%ld] is followed by a hole!\n", n)
1158 struct drm_mm_node *hole; local in function:show_holes
[all...] |
| /src/sys/arch/x86/x86/ |
| pmap.c | 1468 * randomly select one hole, and then randomly select an area within that hole.
1479 size_t i, nholes, hole; local in function:slotspace_rand
1503 * The area between the two is a hole.
1517 /* No hole anymore, stop here. */
1522 /* Register the hole. */
1529 /* Skip that hole, and iterate again. */
1537 /* Select a hole. */
1538 hole = randhole;
1540 hole = 0
[all...] |
