| /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/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
143 if (hole != &sa_manager->olist)
151 struct list_head *hole = sa_manager->hole; local
[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/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
188 if (hole != &sa_manager->olist)
196 struct list_head *hole = sa_manager->hole; local
[all...] |
| /src/sys/netinet/ |
| tcp_sack.c | 171 struct sackhole *hole; local
177 hole = pool_get(&sackhole_pool, PR_NOWAIT);
178 if (hole == NULL) {
184 return hole;
191 struct sackhole *hole; local
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/i915/selftests/ |
| i915_gem_evict.c | 411 struct drm_mm_node hole; local
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/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
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
878 struct drm_mm_node *hole; local
1009 struct drm_mm_node *hole; local
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/i915/gem/selftests/ |
| i915_gem_mman.c | 617 struct drm_mm_node *hole, *next; local
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/external/gpl3/gdb/dist/gdb/ |
| typeprint.c | 96 a hole before the first field, which is not accurate. */
100 bitpos, it means there's a hole in the struct, so we report
102 unsigned int hole = bitpos - end_bitpos;
103 unsigned int hole_byte = hole / TARGET_CHAR_BIT;
104 unsigned int hole_bit = hole % TARGET_CHAR_BIT;
150 maybe_print_hole (stream, bitpos, "hole");
101 unsigned int hole = bitpos - end_bitpos; local
|
| /src/external/gpl3/gdb.old/dist/gdb/ |
| typeprint.c | 96 a hole before the first field, which is not accurate. */
100 bitpos, it means there's a hole in the struct, so we report
102 unsigned int hole = bitpos - end_bitpos;
103 unsigned int hole_byte = hole / TARGET_CHAR_BIT;
104 unsigned int hole_bit = hole % TARGET_CHAR_BIT;
150 maybe_print_hole (stream, bitpos, "hole");
101 unsigned int hole = bitpos - end_bitpos; local
|
| /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
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
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
[all...] |
| /src/crypto/external/bsd/openssl/dist/ssl/statem/ |
| statem_lib.c | 1731 * (creating a hole between TLSv1.3 and TLSv1.1) can still
2012 * @real_max: The highest version below the lowest compile time version hole
2013 * where that hole lies above at least one run-time enabled
2033 int hole; local
2068 * (protocol version client is disabled at compile-time) is also a "hole".
2070 * Our initial state is hole == 1, version == 0. That is, versions above
2071 * the first version in the method table are disabled (a "hole" above
2074 * Whenever "hole == 1", and we hit an enabled method, its version becomes
2076 * method. We're no longer in a hole, so "hole" becomes 0
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/ssl/statem/ |
| statem_lib.c | 1727 * (creating a hole between TLSv1.3 and TLSv1.1) can still
2017 * @real_max: The highest version below the lowest compile time version hole
2018 * where that hole lies above at least one run-time enabled
2038 int hole; local
2073 * (protocol version client is disabled at compile-time) is also a "hole".
2075 * Our initial state is hole == 1, version == 0. That is, versions above
2076 * the first version in the method table are disabled (a "hole" above
2079 * Whenever "hole == 1", and we hit an enabled method, its version becomes
2081 * method. We're no longer in a hole, so "hole" becomes 0
[all...] |
| /src/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| dnode.c | 1686 * Set i to the blockid of the next non-hole
1835 * Scans a block at the indicated "level" looking for a hole or data,
1861 boolean_t hole; local
1867 hole = ((flags & DNODE_FIND_HOLE) != 0);
1869 ASSERT(txg == 0 || !hole);
1881 if (hole)
1916 if ((dnp[i].dn_type == DMU_OT_NONE) == hole)
1929 if (hole)
1939 (hole || bp[i].blk_birth > txg))
1963 * Find the next hole, data, or sparse region at or after *offset
[all...] |
| zvol.c | 3555 boolean_t hole; local
3557 hole = (cmd == FIOSEEKHOLE);
3559 error = dmu_offset_next(zv->zv_objset, ZVOL_OBJ, hole, &noff);
|
| zfs_vnops.c | 270 boolean_t hole; local
278 hole = B_TRUE;
280 hole = B_FALSE;
282 error = dmu_offset_next(zp->z_zfsvfs->z_os, zp->z_id, hole, &noff);
288 * We could find a hole that begins after the logical end-of-file,
290 * EOF falls mid-block, then indicate that the "virtual hole"
295 ASSERT(hole);
|
| /src/crypto/external/apache2/openssl/dist/ssl/statem/ |
| statem_lib.c | 2139 * (creating a hole between TLSv1.3 and TLSv1.1) can still
2436 * @real_max: The highest version below the lowest compile time version hole
2437 * where that hole lies above at least one run-time enabled
2457 int hole; local
2492 * (protocol version client is disabled at compile-time) is also a "hole".
2494 * Our initial state is hole == 1, version == 0. That is, versions above
2495 * the first version in the method table are disabled (a "hole" above
2498 * Whenever "hole == 1", and we hit an enabled method, its version becomes
2499 * the selected version. We're no longer in a hole, so "hole" becomes 0
[all...] |
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_read_support_format_tar.c | 116 int hole; member in struct:sparse_block
577 if (!sb->hole)
667 if (!tar->sparse_list->hole)
669 /* Current is hole data and skip this. */
3328 * data and hole pairs. The way recording sparse information by Solaris'
3330 * consist of both data and hole.
3338 int hole = 1; local
3367 tar->sparse_last->hole = hole;
3378 hole = hole == 0
[all...] |
| archive_read_support_format_iso9660.c | 2372 int hole, parent; local
2416 * Start with hole at end, walk it up tree to find insertion point.
2418 hole = heap->cnt++;
2419 while (hole > 0) {
2420 parent = (hole - 1)/2;
2423 heap->reqs[hole].offset = offset;
2424 heap->reqs[hole].file = file;
2427 /* Move parent into hole <==> move hole up tree. */
2428 heap->reqs[hole] = heap->reqs[parent]
3129 int hole, parent; local
[all...] |
| archive_read_support_format_xar.c | 1236 int hole, parent; local
1272 * Start with hole at end, walk it up tree to find insertion point.
1274 hole = heap->used++;
1275 while (hole > 0) {
1276 parent = (hole - 1)/2;
1279 heap->files[hole] = file;
1282 /* Move parent into hole <==> move hole up tree. */
1283 heap->files[hole] = heap->files[parent];
1284 hole = parent
[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
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...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-sra.cc | 2841 bool hole = false, sth_created = false; local
2868 hole |= covered_to < child->offset;
2878 hole = true;
2924 hole = false;
2946 hole = true;
2951 if (!hole || totally)
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-sra.cc | 2540 bool hole = false, sth_created = false; local
2567 hole |= covered_to < child->offset;
2576 hole = true;
2618 hole = false;
2640 hole = true;
2645 if (!hole || totally)
|
