| /src/games/bcd/ |
| 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))
|
| /src/usr.bin/nbperf/ |
| 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;
|
| /src/sys/arch/powerpc/oea/ |
| 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;
665 DPRINTF("HOLES FOUND\n");
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)
[all...] |
| /src/external/bsd/openldap/dist/servers/slapd/back-wt/ |
| tools.c | 40 static dn_id hbuf[HOLE_SIZE], *holes = hbuf; variable
97 holes[i].id, holes[i].dn.bv_val);
284 if ( holes[i].id == e->e_id ) {
285 free(holes[i].dn.bv_val);
286 for (j=i;j<nholes;j++) holes[j] = holes[j+1];
287 holes[j].id = 0;
290 } else if ( holes[i].id > e->e_id ) {
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| btfout.cc | 92 /* Holes occur for types which are present in the CTF container, but are either
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)
[all...] |
| tree-ssa-reassoc.cc | 1908 continuous, they can cover the whole VECTOR perfectly without any holes.
2042 1) sorted offsets are adjacent, no holes.
2055 sbitmap holes = sbitmap_alloc (num_elems); local
2056 bitmap_ones (holes);
2061 if (!bitmap_bit_p (holes, curr->first))
2067 bitmap_clear_bit (holes, curr->first);
2069 if (valid && bitmap_empty_p (holes))
2071 sbitmap_free (holes);
|
| /src/external/bsd/openldap/dist/servers/slapd/back-mdb/ |
| tools.c | 74 static dn_id hbuf[HOLE_SIZE], *holes = hbuf; variable
264 holes[i].id, holes[i].dn.bv_val);
552 if ( holes == hbuf ) {
553 holes = ch_malloc( nhmax * sizeof(dn_id) * 2 );
554 AC_MEMCPY( holes, hbuf, sizeof(hbuf) );
556 holes = ch_realloc( holes, nhmax * sizeof(dn_id) * 2 );
560 ber_dupbv( &holes[nholes].dn, &ndn );
561 holes[nholes++].id = e->e_id
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| btfout.cc | 94 /* Holes occur for types which are present in the CTF container, but are either
96 static vec<ctf_id_t> holes; variable
553 return holes.contains (id);
556 /* Adjust the given type ID to account for holes and duplicate definitions of
573 for (n = 0; n < holes.length (); n++)
575 if (holes[n] < id)
577 else if (holes[n] == id)
601 holes.safe_push (ctftype->dtd_type);
607 holes.safe_push (ctftype->dtd_type);
1370 holes.create (0)
[all...] |
| tree-ssa-reassoc.cc | 1912 continuous, they can cover the whole VECTOR perfectly without any holes.
2046 1) sorted offsets are adjacent, no holes.
2059 sbitmap holes = sbitmap_alloc (num_elems); local
2060 bitmap_ones (holes);
2065 if (!bitmap_bit_p (holes, curr->first))
2071 bitmap_clear_bit (holes, curr->first);
2073 if (valid && bitmap_empty_p (holes))
2075 sbitmap_free (holes);
|
| /src/games/trek/ |
| trek.h | 59 char holes; /* number of black holes in this quadrant */ member in struct:quad
|
| /src/external/cddl/osnet/dist/lib/libzfs/common/ |
| libzfs_import.c | 426 vdev_is_hole(uint64_t *hole_array, uint_t holes, uint_t id)
428 for (int c = 0; c < holes; c++) {
459 uint_t holes; local
515 holes = 0;
529 &holes) == 0) {
532 hole_array, holes) == 0);
650 * The vdev namespace may contain holes as a result of
654 if (holes > 0) {
661 !vdev_is_hole(hole_array, holes, c))
669 * Holes in the namespace are treated a
[all...] |
| /src/sys/arch/x86/x86/ |
| 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;
|
| /src/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| 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[i]], ZPOOL_CONFIG_GUID
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/include/ |
| atombios.h | 9205 UCHAR ucRevision; // Holes set revision
9218 UCHAR ucholesNo; // number of holes that follow
9219 ATOM_HOLE_INFO holes[1]; // array of hole descriptions member in struct:_ATOM_SERVICE_INFO
|
