Home
last modified time | relevance | path

Searched refs:nhash (Results 1 – 12 of 12) sorted by relevance

/original-bsd/old/refer/inv/
H A Dinv6.c12 whash(ft, fa, fb, nhash, iflong, ptotct, phused) in whash() argument
14 int nhash, *phused;
29 hpt = (long *) calloc (nhash+1, sizeof(*hpt));
31 hfreq = (int *) calloc (nhash, sizeof(*hfreq));
66 while (hash<nhash)
68 fwrite(&nhash, sizeof(nhash), 1, fa);
70 fwrite(hpt, sizeof(*hpt), nhash, fa);
71 fwrite (hfreq, sizeof(*hfreq), nhash, fa);
H A Dinv2.c13 newkeys (outf, inf, recf, nhash, fd, iflong) in newkeys() argument
64 fprintf(outf,"%04d %06ld\n",hash(keyv[i])%nhash, lp);
67 printf("key %s hash %d\n",keyv[i],hash(keyv[i])%nhash);
82 fprintf(outf, "%04d %06ld\n",hash(key)%nhash, lp);
H A Dinv1.c28 int nhash = 256; local
46 nhash = atoi (argv[1]+2);
120 nhash = recopy(ftb, fb, fopen(nma, "r"));
128 docs = newkeys(fta, stdin, fc, nhash, fd, &iflong);
157 whash(fta, fa, fb, nhash, iflong, &keys, &hashes);
H A Dinv5.c11 recopy (ft, fb, fa, nhash) in recopy() argument
38 if (n!= nhash)
/original-bsd/old/refer/refer/
H A Dglue1.c41 static int nhash = 0; local
139 fread (&nhash, sizeof(nhash), 1, fa);
141 if (nhash > maxhash)
149 maxhash=nhash;
155 hpt = (long *) zalloc(nhash, sizeof(*hpt));
160 err ("No space for hash list (%d)", nhash);
161 fread( hpt, sizeof(*hpt), nhash, fa);
163 hfreq=(int *)zalloc(nhash, sizeof(*hfreq));
165 err ("No space for hash frequencies (%d)", nhash);
166 frtbl = fread(hfreq, sizeof(*hfreq), nhash, fa);
[all …]
/original-bsd/old/refer/hunt/
H A Dhunt1.c45 int falseflg, nhash, nitem, nfound, frtbl, kk; local
150 fread (&nhash, sizeof(nhash), 1, fa);
154 hpt = (long *) calloc(nhash, sizeof(*hpt));
155 kk=fread( hpt, sizeof(*hpt), nhash, fa);
157 fprintf(stderr,"read %d hashes, iflong %d, nhash %d\n", kk, iflong, nhash);
159 _assert (kk==nhash);
160 hfreq = (int *) calloc(nhash, sizeof(*hfreq));
162 frtbl = fread(hfreq, sizeof(*hfreq), nhash, fa);
163 hfrflg = (frtbl == nhash);
178 nfound = doquery(hpt, nhash, fb, nitem, qitem, master);
H A Dhunt2.c16 doquery(hpt, nhash, fb, nitem, qitem, master) in doquery() argument
65 hh[i] = hash(qitem[i])%nhash;
71 fprintf(stderr, "past that loop nhash %d hpt is %lo\n", nhash, hpt);
/original-bsd/local/ditroff/ditroff.okeeffe/
H A Dn4.c22 struct numtab *nhash[128]; /* 128 == the 0177 on line above */ variable
196 nhash[i] = 0; in nrehash()
203 p->link = nhash[i]; in nrehash()
204 nhash[i] = p; in nrehash()
216 lp = &nhash[NHASH(rp->r)];
237 for (p = nhash[h]; p; p = p->link)
243 p->link = nhash[h];
244 nhash[h] = p;
261 for (p = nhash[NHASH(i)]; p; p = p->link)
/original-bsd/local/ditroff/ditroff.okeeffe/troff/
H A Dn4.c22 struct numtab *nhash[128]; /* 128 == the 0177 on line above */ variable
198 nhash[i] = 0; in nrehash()
205 p->link = nhash[i]; in nrehash()
206 nhash[i] = p; in nrehash()
218 lp = &nhash[NHASH(rp->r)];
239 for (p = nhash[h]; p; p = p->link)
245 p->link = nhash[h];
246 nhash[h] = p;
263 for (p = nhash[NHASH(i)]; p; p = p->link)
/original-bsd/local/ditroff/ditroff.van/
H A Dn4.c22 struct numtab *nhash[128]; /* 128 == the 0177 on line above */ variable
196 nhash[i] = 0; in nrehash()
203 p->link = nhash[i]; in nrehash()
204 nhash[i] = p; in nrehash()
216 lp = &nhash[NHASH(rp->r)];
237 for (p = nhash[h]; p; p = p->link)
243 p->link = nhash[h];
244 nhash[h] = p;
261 for (p = nhash[NHASH(i)]; p; p = p->link)
/original-bsd/sys/miscfs/union/
H A Dunion_subr.c89 int nhash = UNION_HASH(uppervp, lowervp); local
97 if (nhash < ohash) {
98 lhash = nhash;
102 uhash = nhash;
112 if (ohash != nhash || !docache) {
119 if (ohash != nhash)
146 if (docache && (ohash != nhash)) {
147 LIST_INSERT_HEAD(&unhead[nhash], un, un_cache);
151 union_list_unlock(nhash);
/original-bsd/old/pcc/lint/lpass1/
H A Dlint.c1175 int nspace, ndash, nplus, nhash; local
1178 nspace = ndash = nplus = nhash = 0;
1187 ++nhash;
1191 if (nspace > 1 || ndash > 1 || nplus > 1 || nhash > 1)