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

  /src/bin/ksh/
lex.h 83 #define THEN 261
syn.c 304 /* Leave KEYWORD in syniocf (allow if (( 1 )) then ...) */
317 /* Leave KEYWORD in syniocf (allow if [[ -n 1 ]] then ...) */
453 musthave(THEN, KEYWORD|ALIAS);
653 { "then", THEN, true },
  /src/common/dist/zlib/
make_vms.com 26 $ on error then goto err_exit
63 $!!! if axp .or. ia64 then set proc/parse=extended
73 $ then
74 $ If F$Search ("Sys$System:MMS.EXE") .nes. "" Then Make = "MMS"
75 $ If F$Type (MMK) .eqs. "STRING" Then Make = "MMK"
94 $ then
97 $ then
99 $ then
111 $ then
117 $ then
    [all...]
  /src/usr.bin/m4/TEST/
test.m4 57 string(THEN, "then")
132 "Nothing much" and then I change the subject.
192 they think that cause was a dragon, then they must find and slay it.
  /src/sys/arch/m68k/060sp/dist/
fplsp.s 5084 #--THEN WE RETURN SGN*SIN(R). SGN*SIN(R) IS COMPUTED BY
5137 #--THEN WE RETURN SGN*COS(R). SGN*COS(R) IS COMPUTED BY
5582 #--Then, we need to compute A := R-P and a := r-p
6013 #--Then, we need to compute A := R-P and a := r-p
7566 # then load the exponent with +/1 $3fff.
8330 # if the input is exactly equal to one, then exit through ld_pzero.
8474 #--IF 1+Z > 3/2 OR 1+Z < 1/2, THEN X, WHICH IS ROUNDING 1+Z,
8498 #--CASE 1: 1+Z < 1, THEN K = -1 AND Y-F = (2-F) + 2Z
8499 #--CASE 2: 1+Z > 1, THEN K = 0 AND Y-F = (1-F) + Z
8848 # 4. Overwrite r := r * log2. Then #
    [all...]
fpsp.s 626 # then stored in either the FP regfile, data regfile, or memory. #
629 # If the exception is enabled, then this handler must create the #
866 # then stored in either the FP regfile, data regfile, or memory. #
869 # If the exception is enabled, then this handler must create the #
972 # (0x00000000_80000000_00000000), then the machine will take an
1005 # (0x00000000_80000000_00000000), then the machine will take an
1033 # (0x00000000_80000000_00000000), then the machine will take an
1036 # then we have to branch to real_inex.
1156 # from the FP register file. The instruction is then emulated by #
1159 # saved, then we check to see if any enabled exceptions resulted from
    [all...]

Completed in 40 milliseconds