HomeSort by: relevance | last modified time | path
    Searched refs:DONE (Results 1 - 20 of 20) sorted by relevancy

  /src/common/dist/zlib/contrib/infback9/
inflate9.h 17 DONE, /* finished check, done -- remain here until reset */
27 TYPE -> STORED or TABLE or LEN or DONE
infback9.c 269 mode = DONE;
571 case DONE:
  /src/tests/bin/sh/
t_redir.sh 43 cat <<- 'DONE' |
44 DONE
47 cat <<- 'DONE' |
48 DONE
52 cat <<- 'DONE' |
54 DONE
57 cat <<- 'DONE' |
59 DONE
63 cat <<- 'DONE' |
66 DONE
    [all...]
t_syntax.sh 116 cat <<-'DONE' |
122 break # done loop terminate $( echo bar; exit 1 )
123 done #####################################################
126 DONE
139 cat <<- 'DONE' | atf_check -s exit:0 -o ignore -e empty ${TEST_SH} -e ||
142 DONE
145 cat <<- 'DONE' | atf_check -s exit:7 -o empty -e empty ${TEST_SH} ||
150 DONE
154 cat <<- 'DONE' | atf_check -s not-exit:0 -o empty -e not-empty \
160 DONE
    [all...]
  /src/common/dist/zlib/
inflate.h 49 DONE, /* finished check, done -- remain here until reset */
77 CHECK -> LENGTH -> DONE
infback.c 285 state->mode = DONE;
596 case DONE:
inflate.c 376 /* if it hasn't been done already, allocate space for the window */
539 gives the low n bits in the accumulator. When done, DROPBITS(n) drops
648 state->head->done = -1;
813 state->head->done = 1;
1229 state->mode = DONE;
1231 case DONE:
1349 head->done = 0;
  /src/tests/net/route/
t_change.sh 135 flags: 0x843<UP,GATEWAY,DONE,STATIC>
154 flags: 0x843<UP,GATEWAY,DONE,STATIC>
202 flags: 0x843<UP,GATEWAY,DONE,STATIC>
221 flags: 0x843<UP,GATEWAY,DONE,STATIC>
269 flags: 0x843<UP,GATEWAY,DONE,STATIC>
288 flags: 0x843<UP,GATEWAY,DONE,STATIC>
t_route.sh 237 flags: 0x40045<UP,HOST,DONE,LOCAL>
253 flags: 0x141<UP,DONE,CONNECTED>
269 flags: 0x843<UP,GATEWAY,DONE,STATIC>
287 flags: 0x141<UP,DONE,CONNECTED>
312 flags: 0x40045<UP,HOST,DONE,LOCAL>
327 flags: 0x141<UP,DONE,CONNECTED>
343 flags: 0x843<UP,GATEWAY,DONE,STATIC>
361 flags: 0x141<UP,DONE,CONNECTED>
  /src/bin/ksh/
lex.h 94 #define DONE 272
syn.c 432 /* A {...} can be used instead of do...done for for/select loops
438 c = DONE;
666 { "done", DONE, true },
806 * splitting, file globbing, or (normal) tilde expansion done.
  /src/lib/libm/arch/vax/
n_sqrt.S 119 rsb # DONE!
  /src/sys/arch/sparc/sparc/
bsd_fdintr.s 251 ! xfer done: update fdc->sc_buf & fdc->sc_tc, mark istate DONE
290 be 3f ! done
305 ! got status, update sc_nstat and mark istate DONE
  /src/doc/
TODO.compat-module 3 DONE
  /src/sys/dev/pci/
if_vioif.c 283 FREE, INUSE, DONE
1827 goto done;
1849 done:
1933 goto done;
1936 goto done;
1944 done:
1964 goto done;
1970 done:
2091 goto done;
2112 done
    [all...]
  /src/usr.sbin/sysinst/
msg.mi.fr 1265 message DONE {TERMINER}
msg.mi.de 1257 message DONE {ERLEDIGT}
  /src/sys/net/
zlib.c 495 * when input comes from standard input. (This can also be done for
679 finish_done /* finish done, accept no more input or output */
1136 * empty block here, this will be done at next call. This also
1600 * and lookahead == 1 (input done one byte at time)
3383 DONE, /* finished check, done */
3595 z->state->mode = DONE;
3627 z->state->mode = DONE;
3629 case DONE:
3886 DONEB, /* finished last block, done */
    [all...]
  /src/sys/arch/m68k/060sp/dist/
fplsp.s 5055 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5266 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5785 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
6851 # inputs will be done away with.) #
8012 # Step 2: Let 1+X = 2**k * Y, where 1 <= Y < 2. Define F as done #
9715 # algorithm just got done playing with fp0 and expected no exceptions
fpsp.s 603 # _fpsp_done() - "callout" for 060FPSP exit (all work done!) #
843 # _fpsp_done() - "callout" for 060FPSP exit (all work done!) #
1120 # _fpsp_done() - "callout" for exit; work all done #
2392 # _fpsp_done() - "callout" for exit; work all done #
3947 # _fpsp_done() - "callout" for exit; work all done #
5161 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5372 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5891 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
6957 # inputs will be done away with.) #
8118 # Step 2: Let 1+X = 2**k * Y, where 1 <= Y < 2. Define F as done #
    [all...]

Completed in 54 milliseconds