| /netbsd-current/external/bsd/openldap/dist/servers/slapd/back-ndb/ |
| H A D | tools.cpp | 37 static dn_id hbuf[HOLE_SIZE], *holes = hbuf; variable
94 holes[i].id, holes[i].dn.bv_val);
359 if ( holes == hbuf ) {
360 holes = (dn_id *)ch_malloc( nhmax * sizeof(dn_id) * 2 );
361 AC_MEMCPY( holes, hbuf, sizeof(hbuf) );
363 holes = (dn_id *)ch_realloc( holes, nhmax * sizeof(dn_id) * 2 );
367 ber_dupbv( &holes[nholes].dn, &ndn );
368 holes[nhole
[all...] |
| /netbsd-current/sys/arch/powerpc/oea/ |
| H A D | ofwoea_machdep.c | 563 rangemap_t region, holes[32], list[32]; local
651 holes[nrofholes].type = iomem;
652 holes[nrofholes].addr = region.size + region.addr;
653 holes[nrofholes].size = list[range].addr -
654 holes[nrofholes].addr - 1;
667 DPRINTF("addr=0x%x size=0x%x type=%d\n", holes[i].addr,
668 holes[i].size, holes[i].type);
695 if (holes[i].type == RANGE_IO) {
697 holes[
[all...] |
| /netbsd-current/external/bsd/openldap/dist/servers/slapd/back-wt/ |
| H A D | tools.c | 40 static dn_id hbuf[HOLE_SIZE], *holes = hbuf; variable
100 holes[i].id, holes[i].dn.bv_val);
280 if ( holes[i].id == e->e_id ) {
281 free(holes[i].dn.bv_val);
282 for (j=i;j<nholes;j++) holes[j] = holes[j+1];
283 holes[j].id = 0;
286 } else if ( holes[i].id > e->e_id ) {
|
| /netbsd-current/usr.bin/nbperf/ |
| H A D | nbperf-bdz.c | 86 uint32_t t, r, holes; local
119 holes = 0;
122 state->holes64k[i >> 16] = holes;
125 state->holes64[i >> 6] = holes - state->holes64k[i >> 16];
129 state->result_map[j] = i - holes;
133 ++holes;
|
| /netbsd-current/external/gpl3/gcc/dist/gcc/ |
| H A D | btfout.cc | 94 static vec<ctf_id_t> holes; variable
363 return holes.contains (id);
366 /* Adjust the given type ID to account for holes and duplicate definitions of
383 for (n = 0; n < holes.length (); n++)
385 if (holes[n] < id)
387 else if (holes[n] == id)
411 holes.safe_push (ctftype->dtd_type);
417 holes.safe_push (ctftype->dtd_type);
1046 holes.create (0);
1114 holes
[all...] |
| H A D | tree-ssa-reassoc.cc | 1907 continuous, they can cover the whole VECTOR perfectly without any holes.
2041 1) sorted offsets are adjacent, no holes.
2054 sbitmap holes = sbitmap_alloc (num_elems); local
2055 bitmap_ones (holes);
2060 if (!bitmap_bit_p (holes, curr->first))
2066 bitmap_clear_bit (holes, curr->first);
2068 if (valid && bitmap_empty_p (holes))
2070 sbitmap_free (holes);
|
| /netbsd-current/games/trek/ |
| H A D | nova.c | 80 Quad[Ship.quadx][Ship.quady].holes += 1;
|
| H A D | setup.c | 236 q->holes = ranf(3);
238 q->holes = q->holes > s5 ? q->holes - s5 : 0;
|
| H A D | initquad.c | 78 nholes = q->holes;
122 /* initialize black holes */
|
| H A D | trek.h | 59 char holes; /* number of black holes in this quadrant */ member in struct:quad
|
| /netbsd-current/games/bcd/ |
| H A D | bcd.c | 59 * holes. (A 1 bit is a hole.) These may be wrong, but they match the old
87 static const u_short holes[256] = { variable
185 if (holes[(unsigned char)*p])
195 * 12 rows of potential holes; output a ']', which looks kind of
196 * like a hole, if the appropriate bit is set in the holes[] table.
203 if (bit(holes[(unsigned char)*p], 11 - row))
|
| /netbsd-current/external/bsd/openldap/dist/servers/slapd/back-mdb/ |
| H A D | tools.c | 72 static dn_id hbuf[HOLE_SIZE], *holes = hbuf; variable
242 holes[i].id, holes[i].dn.bv_val);
528 if ( holes == hbuf ) {
529 holes = ch_malloc( nhmax * sizeof(dn_id) * 2 );
530 AC_MEMCPY( holes, hbuf, sizeof(hbuf) );
532 holes = ch_realloc( holes, nhmax * sizeof(dn_id) * 2 );
536 ber_dupbv( &holes[nholes].dn, &ndn );
537 holes[nhole
[all...] |
| /netbsd-current/sys/external/bsd/drm2/dist/drm/i915/selftests/ |
| H A D | i915_buddy.c | 543 LIST_HEAD(holes);
587 list_add_tail(&block->link, &holes);
599 i915_buddy_free_list(&mm, &holes);
614 list_splice_tail(&holes, &blocks);
|
| H A D | intel_memory_region.c | 141 LIST_HEAD(holes);
215 list = &holes;
227 close_objects(mem, &holes);
262 list_splice_tail(&holes, &objects);
|
| /netbsd-current/external/cddl/osnet/dist/lib/libzfs/common/ |
| H A D | libzfs_import.c | 425 vdev_is_hole(uint64_t *hole_array, uint_t holes, uint_t id) argument
427 for (int c = 0; c < holes; c++) {
458 uint_t holes; local
514 holes = 0;
528 &holes) == 0) {
531 hole_array, holes) == 0);
649 * The vdev namespace may contain holes as a result of
653 if (holes > 0) {
660 !vdev_is_hole(hole_array, holes, c))
|
| /netbsd-current/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| H A D | spa.c | 4143 uint64_t *holes; local
4169 holes = NULL;
4171 &holes, &nholes);
4183 for (i = 0; holes != NULL && i < nholes; i++) {
4186 if (tops[holes[i]] != NULL)
4188 nvlist_alloc(&tops[holes[i]], NV_UNIQUE_NAME, KM_SLEEP);
4189 VERIFY(nvlist_add_string(tops[holes[i]], ZPOOL_CONFIG_TYPE,
4191 VERIFY(nvlist_add_uint64(tops[holes[i]], ZPOOL_CONFIG_ID,
4192 holes[i]) == 0);
4193 VERIFY(nvlist_add_uint64(tops[holes[
[all...] |
| /netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
| H A D | tree-ssa-reassoc.c | 1838 continuous, they can cover the whole VECTOR perfectly without any holes.
1972 1) sorted offsets are adjacent, no holes.
1985 sbitmap holes = sbitmap_alloc (num_elems); local
1986 bitmap_ones (holes);
1991 if (!bitmap_bit_p (holes, curr->first))
1997 bitmap_clear_bit (holes, curr->first);
1999 if (valid && bitmap_empty_p (holes))
2001 sbitmap_free (holes);
|
| /netbsd-current/sys/arch/x86/x86/ |
| H A D | pmap.c | 1467 * Randomize the location of an area. We count the holes in the VM space. We
1478 } holes[SLSPACE_NAREAS+1]; local
1497 /* Get the holes. */
1524 holes[nholes].start = curslot;
1525 holes[nholes].end = minsslot;
1543 startsl = holes[hole].start;
1544 endsl = holes[hole].end;
|
| /netbsd-current/sys/external/bsd/drm2/dist/drm/amd/include/ |
| H A D | atombios.h | 9218 UCHAR ucholesNo; // number of holes that follow
9219 ATOM_HOLE_INFO holes[1]; // array of hole descriptions member in struct:_ATOM_SERVICE_INFO
|