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

  /src/usr.sbin/mtree/
crc.c 112 * Compute a POSIX 1003.2 checksum. This routine has been broken out so that
128 #define COMPUTE(var, ch) (var) = (var) << 8 ^ crctab[(var) >> 24 ^ (ch)]
136 COMPUTE(thecrc, *p);
137 COMPUTE(crctot, *p);
141 COMPUTE(thecrc, *p);
151 COMPUTE(thecrc, len & 0xff);
152 COMPUTE(crctot, len & 0xff);
156 COMPUTE(thecrc, len & 0xff);
  /src/usr.bin/cksum/
crc.c 111 * Compute a POSIX 1003.2 checksum. This routine has been broken out so that
144 #define COMPUTE(var, ch) (var) = (var) << 8 ^ crctab[(var) >> 24 ^ (ch)]
156 COMPUTE(crc, 0);
169 /* Compute the tables once. */
198 COMPUTE(thecrc, *p);
206 COMPUTE(thecrc, byte_val & 0xff);
  /src/sys/arch/m68k/060sp/dist/
fplsp.s 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
6325 #--U IN FP0, WE ARE NOW READY TO COMPUTE ATAN(U) AS
6368 #--COMPUTE POLYNOMIAL
6808 # Step 5. Compute 2^(J/64)*exp(R) = 2^(J/64)*(1+p) by #
6936 # Step 5. Compute 2^(J/64)*p by #
7160 #--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
7162 #--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
7323 #--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
7325 #--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*
    [all...]
fpsp.s 5688 #--Then, we need to compute A := R-P and a := r-p
6119 #--Then, we need to compute A := R-P and a := r-p
6431 #--U IN FP0, WE ARE NOW READY TO COMPUTE ATAN(U) AS
6474 #--COMPUTE POLYNOMIAL
6914 # Step 5. Compute 2^(J/64)*exp(R) = 2^(J/64)*(1+p) by #
7042 # Step 5. Compute 2^(J/64)*p by #
7266 #--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
7268 #--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*R
7429 #--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
7431 #--TO FULLY USE THE PIPELINE, WE COMPUTE S = R*
    [all...]

Completed in 21 milliseconds