Home
last modified time | relevance | path

Searched refs:index (Results 1 – 25 of 436) sorted by relevance

12345678910>>...18

/original-bsd/sys/deprecated/bbnnet/
H A Drdp_subr.c112 register int index; local
117 if (index < 0 || index >= rdpcb->r_sendq.rq_maxqlen)
204 register int index; local
208 if (index < 0 || index >= rdpcb->r_sendq.rq_maxqlen)
211 index = (index + rdpcb->r_sendq.rq_front) % rdpcb->r_sendq.rq_maxqlen;
261 int index; local
274 index = (index +1) % msgq->rq_maxqlen;
289 register int index; local
293 index = msgq->rq_front;
321 if ((index < 0) || (index >= msgq->rq_maxqlen))
[all …]
/original-bsd/sys/tahoe/stand/vdformat/
H A Dverify.c43 register int index; in load_verify_patterns() local
47 for(index=0; index<MAXTRKSIZ; index++) { in load_verify_patterns()
48 pattern_0[index] = fp->fp_pat[0]; in load_verify_patterns()
49 pattern_1[index] = fp->fp_pat[1]; in load_verify_patterns()
50 pattern_2[index] = fp->fp_pat[2]; in load_verify_patterns()
51 pattern_3[index] = fp->fp_pat[3]; in load_verify_patterns()
52 pattern_4[index] = fp->fp_pat[4]; in load_verify_patterns()
53 pattern_5[index] = fp->fp_pat[5]; in load_verify_patterns()
138 register int index, i; local
150 for (index = 0; index < pattern_count; index++) {
[all …]
/original-bsd/usr.bin/struct/struct/
H A D1.hash.c155 int index; local
156 index = hash(x);
170 chain[index] = ptr;
178 index = hash(x);
199 temp0 = index;
200 index = value[index];
209 index = hash(x);
239 int index; local
240 index = hash(x);
241 value[index] = -2;
[all …]
/original-bsd/games/chess/Xchess/
H A DscrollText.c240 for (index = 0; index < INITLINES; index++) {
300 for (index = 1; index < MAXFONTS; index++) {
315 for (index = 0; index < newWin->exposeAlloc; index++)
351 for (index = 0; index < MAXFONTS; index++)
356 for (index = 0; index < textInfo->numLines; index++) {
361 for (index = 0; index < textInfo->exposeSize; index++) {
396 for (index = 0; index < textInfo->numLines; index++) {
412 for (index = 0; index < textInfo->bufSpot; index++) {
659 for (index = 0; index < textInfo->numLines; index++) {
749 for (index = 0; index < lastItem; index++) {
[all …]
/original-bsd/lib/libc/db/btree/
H A Dbt_put.c51 indx_t index, nxtindex; local
125 index = t->bt_bcursor.index;
137 index = e->index;
158 t->bt_bcursor.index == index) {
189 memmove(h->linp + index + 1, h->linp + index,
201 t->bt_last.index = index;
205 if (index == 0) {
217 t->bt_bcursor.index = e->index;
252 t->bt_cur.index = t->bt_last.index;
269 t->bt_last.index = cmp ? ++t->bt_cur.index : t->bt_cur.index;
[all …]
H A Dbt_delete.c136 cindex = t->bt_bcursor.index;
147 ++e->index;
168 if (e->index < NEXTINDEX(h))
181 e->index = 0;
204 if (e->index)
205 --e->index;
206 for (h = e->page; e->index; --e->index) {
253 __bt_dleaf(t, h, index) in __bt_dleaf() argument
256 indx_t index;
274 to = bl = GETBLEAF(h, index);
[all …]
H A Dbt_seq.c99 t->bt_bcursor.index = e.index;
181 e->index = 0;
212 ep->index = 0;
267 indx_t index; local
282 index = c->index;
294 index = 0;
298 if (index-- == 0) {
307 index = NEXTINDEX(h) - 1;
313 e->index = index;
323 if (c->pgno == delc.pgno && c->index > delc.index)
[all …]
H A Dbt_get.c76 e->index == t->bt_bcursor.index) {
131 cindex = t->bt_bcursor.index;
148 if (cpgno != h->pgno || cindex != e->index) {
153 save.index = e->index;
161 while (e->index == 0) {
172 e->index = NEXTINDEX(h);
174 --e->index;
191 if (++save.index == NEXTINDEX(h)) {
201 } while ((save.index = NEXTINDEX(h)) == 0);
H A Dbt_search.c45 indx_t base, index, lim; local
57 t->bt_cur.index = index = base + (lim >> 1);
66 base = index + 1;
80 t->bt_cur.index = base;
100 index = base ? base - 1 : base;
102 next: if (__bt_push(t, h->pgno, index) == RET_ERROR)
104 pg = GETBINTERNAL(h, index)->pgno;
149 e.index = NEXTINDEX(tp) - 1;
200 e.index = NEXTINDEX(tp) - 1;
H A Dupdutils.c50 _bt_fixscan(t, index, newd, op) in _bt_fixscan() argument
52 index_t index;
62 if (index < c->c_index)
64 else if (index == c->c_index) {
81 if (index <= c->c_index) {
87 d = (DATUM *) GETDATUM(t->bt_curpage, index);
105 } else if (index <= c->c_index)
/original-bsd/lib/libc/db/recno/
H A Drec_search.c43 register indx_t index; local
58 t->bt_cur.index = recno - total;
61 for (index = 0, top = NEXTINDEX(h);;) {
62 r = GETRINTERNAL(h, index);
63 if (++index == top || total + r->nrecs > recno)
68 if (__bt_push(t, pg, index - 1) == RET_ERROR)
74 --GETRINTERNAL(h, (index - 1))->nrecs;
78 ++GETRINTERNAL(h, (index - 1))->nrecs;
94 --GETRINTERNAL(h, parent->index)->nrecs;
96 ++GETRINTERNAL(h, parent->index)->nrecs;
/original-bsd/usr.bin/f77/libU77/
H A Dmkindx.c32 FILE *fopen(), *index; variable
40 if (index = fopen ("index", "w"))
42 fprintf (index, "\n\n\n\n\n\n\n\n\n");
46 fprintf (index, "\n");
47 fclose (index);
67 while (pad-- > 0) fputc(' ', index);
68 fprintf (index, "%s\n", string);
/original-bsd/usr.bin/f77/libF77/
H A Dmkindx.c32 FILE *fopen(), *index; variable
40 if (index = fopen ("index", "w"))
42 fprintf (index, "\n\n\n\n\n\n\n\n\n");
46 fprintf (index, "\n");
47 fclose (index);
67 while (pad-- > 0) fputc(' ', index);
68 fprintf (index, "%s\n", string);
/original-bsd/usr.bin/f77/libI77/
H A Dmkindx.c32 FILE *fopen(), *index; variable
40 if (index = fopen ("index", "w"))
42 fprintf (index, "\n\n\n\n\n\n\n\n\n");
46 fprintf (index, "\n");
47 fclose (index);
67 while (pad-- > 0) fputc(' ', index);
68 fprintf (index, "%s\n", string);
/original-bsd/usr.bin/gprof/
H A Dprintgprof.c19 int index, timecmp(); in printprof() local
31 for ( index = 0 ; index < nname ; index += 1 ) { in printprof()
32 sortednlp[ index ] = &nl[ index ]; in printprof()
35 for ( index = 0 ; index < nname ; index += 1 ) { in printprof()
36 np = sortednlp[ index ]; in printprof()
167 int index; local
174 for ( index = 0 ; index < nname + ncycle ; index ++ ) {
662 for ( index = 0 , nnames = 0 ; index < nname ; index++ ) { in printindex()
663 if ( zflag == 0 && nl[index].ncall == 0 && nl[index].time == 0 ) in printindex()
668 for ( index = 1 , todo = nnames ; index <= ncycle ; index++ ) { in printindex()
[all …]
H A Darcs.c177 for ( index = 0 ; index < nname ; index += 1 ) { in doarcs()
178 topsortnlp[ index ] = &nl[ index ]; in doarcs()
184 for ( index = 0 ; index < nname ; index += 1 ) { in doarcs()
214 for ( index = 0 ; index < nname ; index++ ) { in doarcs()
215 timesortnlp[index] = &nl[index]; in doarcs()
217 for ( index = 1 ; index <= ncycle ; index++ ) { in doarcs()
218 timesortnlp[nname+index-1] = &cyclenl[index]; in doarcs()
221 for ( index = 0 ; index < nname + ncycle ; index++ ) { in doarcs()
222 timesortnlp[ index ] -> index = index + 1; in doarcs()
232 for ( index = 0 ; index < nname ; index += 1 ) { in dotime()
[all …]
/original-bsd/usr.bin/diction/style3/
H A Doutp.c23 int index, lverbc; in outp() local
81 if(f)index=0; in outp()
97 if(f)index=1; in outp()
121 if(f)index=2; in outp()
126 if(f)index=3; in outp()
139 if(f)index=4; in outp()
147 if(f)index=5; in outp()
156 if(f)index=6; in outp()
164 index=7; in outp()
210 index=13; in outp()
[all …]
/original-bsd/local/ditroff/ditroff.old.okeeffe/gremlin.aed/gremlin/
H A Dlong1.c224 for (index=0; ; index++)
244 while ((*bot)[index] != str[index])
252 while ((*top)[index] != str[index])
305 int *index;
321 ++(*index);
344 index = 1;
351 ++index;
578 index = 0;
612 index = 0;
656 index = 0;
[all …]
/original-bsd/games/sail/
H A Dpl_3.c19 int index, rakehim, sternrake; in acceptcombat() local
106 index = guns; in acceptcombat()
108 index += car; in acceptcombat()
109 index = (index - 1)/3; in acceptcombat()
110 index = index > 8 ? 8 : index; in acceptcombat()
112 hit = HDT[index][target-1]; in acceptcombat()
117 hit += QUAL[index][mc->qual-1]; in acceptcombat()
120 if (index <= 5) in acceptcombat()
125 if (index <= 3) in acceptcombat()
130 if (index <= 1) in acceptcombat()
[all …]
H A Ddr_1.c137 if (index > 8)
138 index = 8;
142 if (index > 8)
143 index = 8;
310 index = guns; in compcombat()
312 index += car; in compcombat()
313 index = (index - 1) / 3; in compcombat()
314 index = index > 8 ? 8 : index; in compcombat()
324 if (index <= 5) in compcombat()
333 if (index <= 3) in compcombat()
[all …]
/original-bsd/local/ditroff/ditroff.old.okeeffe/sunsrc/gremlin/
H A Dstartup.c319 for (index=0; ; index++) {
332 while ((*bot)[index] != str[index]) {
341 while ((*top)[index] != str[index]) {
357 register index; local
591 int index = 0; local
610 int index = 0; local
630 int index = 0; local
650 int index = 0; local
722 int index = 0; local
820 register index; local
[all …]
H A Dmenu.c647 register index; local
661 MNReverse(index);
723 MNReverse(index);
758 MNReverse(index);
1015 MNHighLt(index) in MNHighLt() argument
1016 int index; in MNHighLt()
1018 pw_write(menu_pw, menu[index].menu_x-2, menu[index].menu_y-2,
1027 MNUnHighLt(index) in MNUnHighLt() argument
1028 int index; in MNUnHighLt()
1039 MNReverse(index) in MNReverse() argument
[all …]
/original-bsd/contrib/bib/src/
H A Dlocate.c33 static FILE *index = NULL; local
60 { if (index) fclose(index);
69 index= fopen(oldname,"r");
70 if (index==NULL) {
76 fseek(index,0L,2); /* seeks last newline */
77 i_size= ftell(index);
96 alpha_seek(index, key, i_size, 0);
100 fscanf(index,"%s ", str);
120 alpha_seek(index, key, i_size, 0);
123 fscanf(index,"%s ", str);
[all …]
/original-bsd/old/lisp/PSD.doc/
H A DMakefile183 echo ".Ib" > index
184 sort +3 -o index index `${Append} .x ${RootGenSrc}`
185 sed -f indexsed index > indexx
188 index.t:
190 echo ".Ib" > index
191 sort +3 -o index index `${Append} .x ${RootGenSrc}`
192 sed -f indexsed index > indexx
193 ${TROFF} -me -x -t ${MacroSrc} indexx > index.t
197 echo ".Ib" > index
198 sort +3 -o index index `${Append} .x ${RootGenSrc}`
[all …]
/original-bsd/local/toolchest/ksh/shlib/
H A Dgrowaray.c115 void setdot (node, index) in setdot() argument
117 int index;
122 if ((index > ap->maxi) || (index < 0))
125 ap->adot = index;
126 if (ap->val[index] == NULL)
131 ap->val[index] = nv;

12345678910>>...18