hsize
if (sizenow != hsize) {
if (sizenow > hsize) {
bytes = sizenow - hsize;
new = base + hsize;
hsize = sizenow;
hsize = lseek(histfd, 0L, SEEK_END);
static int hsize;
hsize = 0;
hsize = lseek(histfd, 0L, SEEK_END);
if (hsize == 0) {
else if (hsize > 0) {
base = (unsigned char *)mmap(0, hsize, PROT_READ, MAP_FLAGS, histfd, 0);
munmap((caddr_t)base, hsize);
if (hsize > 2) {
lines = hist_count_lines(base+2, hsize-2);
if (hist_shrink(base, hsize))
munmap((caddr_t)base, hsize);
histload(hist_source, base+2, hsize-2);
munmap((caddr_t)base, hsize);
hsize = lseek(histfd, 0L, SEEK_END);
insert_to_hash(uint32_t *htable, uint32_t hsize, const char *str, uint32_t ref)
step = calc_collision_step(hashval, hsize);
idx = hashval % hsize;
idx = calc_next_index(idx, hsize, step);
domsg(pam_handle_t *pamh, time_t t, const char *host, size_t hsize,
(int)hsize, host);
unsigned int hsize;
hsize = h->report_size; /* bit length of data */
if (hsize == 0)
end = (hpos + hsize + 7) / 8 - offs;
if (hsize < 32) {
data &= (1 << hsize) - 1;
if (h->logical_minimum < 0 && (data & (1<<(hsize-1)))) {
data |= 0xffffffff & ~((1<<hsize)-1);
unsigned int hsize;
hsize = h->report_size; /* bit length of data */
if (hsize != 32) {
mask = (1 << hsize) - 1;
end = (hpos + hsize) / 8 - offs;
uint32_t pvr, vers, hsize = HEAP_SIZE;
if (vers >= IBM970 && vers <= IBM970GX) hsize = 0x800000;
heapspace = OF_claim(0, hsize, NBPG);
int hsize = BEBOX_HEADER_SIZE;
lseek(bebox_fd, ldrOffset + hsize, SEEK_SET);
lseek(bebox_fd, dataOffset + hsize, SEEK_SET);
int i, ch, tmp, kgzlen, err, hsize = BEBOX_HEADER_SIZE;
lseek(bebox_fd, hsize, SEEK_SET);
lseek(bebox_fd, hsize, SEEK_SET);
lseek(bebox_fd, toff + hsize, SEEK_SET);
u_int hsize = loc->size;
if (hsize == 0)
if (data < (1UL << (hsize - 1)) || hsize == sizeof(data) * NBBY)
return data - (1UL << hsize);
u_int hsize = loc->size;
if (hsize == 0)
num = (hpos + hsize + 7) / 8 - off;
if (hsize < sizeof(data) * NBBY)
data &= (1UL << hsize) - 1;
DPRINTFN(10,("hid_get_udata: loc %d/%d = %lu\n", hpos, hsize, data));
uint32_t hsize, hfree;
if (utoppy_get_32(sc, &hsize) || utoppy_get_32(sc, &hfree))
us->us_hdd_size = hsize;
int hsize;
hsize = (int)edid->edid_max_hsize * 10;
hsize = 0;
return hsize;
const int hsize = genfb_calc_hsize(sc);
if (hsize != 0) {
return MAX(RASOPS_DEFAULT_WIDTH, hsize / GENFB_CHAR_WIDTH_MM);
if (hval >= db->hsize)
hval -= db->hsize;
u_int newlen, hsize, hshift, maxmaxcode;
hsize = 5003;
hsize = 9001;
hsize = 18013;
hsize = 35023;
newlen = sizeof(*db) + (hsize-1) * (sizeof(db->dict[0]));
db->hsize = hsize;
i = db->hsize;
if (hval >= db->hsize)
hval -= db->hsize;
if (hval >= db->hsize)
hval -= db->hsize;
u_int hsize; /* size of the hash table */
lltable_allocate_htbl(uint32_t hsize)
llt->llt_hsize = hsize;
llt->lle_head = malloc(sizeof(struct llentries) * hsize,
struct lltable *lltable_allocate_htbl(uint32_t hsize);
in_lltable_hash_dst(const struct in_addr dst, uint32_t hsize)
return (IN_LLTBL_HASH(dst.s_addr, hsize));
in_lltable_hash(const struct llentry *lle, uint32_t hsize)
return (in_lltable_hash_dst(lle->r_l3addr.addr4, hsize));
in6_lltable_hash_dst(const struct in6_addr *dst, uint32_t hsize)
return IN6_LLTBL_HASH(dst->s6_addr32[3], hsize);
in6_lltable_hash(const struct llentry *lle, uint32_t hsize)
return in6_lltable_hash_dst(&lle->r_l3addr.addr6, hsize);
#define off2qindex(hsize, off) (((off) - (hsize)) / sizeof(struct quota2_entry))
#define qindex2off(hsize, idx) \
((daddr_t)(idx) * sizeof(struct quota2_entry) + (hsize))
#define off2qindex(hsize, off) (((off) - (hsize)) / sizeof(struct quota2_entry))
#define qindex2off(hsize, idx) \
((daddr_t)(idx) * sizeof(struct quota2_entry) + (hsize))
for (fcode = (long)hsize; fcode < 65536L; fcode *= 2L)
hsize_reg = hsize;
memset(htab, 0xff, hsize * sizeof(count_int));
hsize = HSIZE; /* For dynamic table sizing. */