Lines Matching refs:size_t
66 size_t nentries;
67 size_t nhashentries;
69 size_t keystrlen;
73 static size_t ndatabases;
74 static size_t nhashentries_total;
75 static size_t valstrlen;
78 static size_t extrastrlen;
421 size_t linelen; in process_input()
423 size_t linenr; in process_input()
472 size_t keylen = cp - key; in process_input()
478 size_t datalen = (&line[n] - cp) + 1; in process_input()
591 is_prime (size_t candidate) in is_prime()
593 size_t divn = 3; in is_prime()
594 size_t sq = divn * divn; in is_prime()
609 static size_t
610 next_prime (size_t seed) in next_prime()
621 static size_t max_chainlength;
623 static size_t nhashentries;
643 size_t hidx = dbe->hashval % nhashentries; in add_key()
644 size_t hval2 = 1 + dbe->hashval % (nhashentries - 2); in add_key()
645 size_t chainlength = 0; in add_key()
679 size_t nhashentries_min = next_prime (db->nentries < TEST_RANGE in compute_tables()
682 size_t nhashentries_max = MAX (nhashentries_min, db->nentries * 4); in compute_tables()
683 size_t nhashentries_best = nhashentries_min; in compute_tables()
684 size_t chainlength_best = db->nentries; in compute_tables()
693 for (size_t cnt = 0; cnt < TEST_RANGE; ++cnt) in compute_tables()
748 size_t filled_dbs = 0; in write_output()
749 size_t iov_nelts = 2 + ndatabases * 3; in write_output()
758 size_t keydataoffset = file_offset + nhashentries_total * sizeof (stridx_t); in write_output()