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

  /src/sys/external/bsd/acpica/dist/compiler/
dtsubtable.c 291 UINT8 Step;
315 Step = 5;
320 Step = 9;
325 Step = 10;
330 Step = 1;
334 for (i = 0; i < Step; i++)
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerTracePC.h 203 const size_t Step = sizeof(LargeType) / sizeof(uint8_t);
204 const size_t StepMask = Step - 1;
211 // Iterate by Step bytes at a time.
212 for (; P < End; P += Step)
214 for (size_t I = 0; I < Step; I++, Bundle >>= 8)
290 // Step function, grows similar to 8 * Log_2(A).
  /src/sys/arch/m68k/060sp/dist/
fplsp.s 5481 #--case, reduce argument by one remainder step to make subsequent reduction
5912 #--case, reduce argument by one remainder step to make subsequent reduction
6063 # Step 1. If |X| >= 16 or |X| < 1/16, go to Step 5. #
6065 # Step 2. Let X = sgn * 2**k * 1.xxxxxxxx...x. #
6071 # Step 3. Approximate arctan(u) by a polynomial poly. #
6073 # Step 4. Return arctan(F) + poly, arctan(F) is fetched from a #
6076 # Step 5. If |X| >= 16, go to Step 7. #
6078 # Step 6. Approximate arctan(X) by an odd polynomial in X. Exit.
    [all...]
fpsp.s 5587 #--case, reduce argument by one remainder step to make subsequent reduction
6018 #--case, reduce argument by one remainder step to make subsequent reduction
6169 # Step 1. If |X| >= 16 or |X| < 1/16, go to Step 5. #
6171 # Step 2. Let X = sgn * 2**k * 1.xxxxxxxx...x. #
6177 # Step 3. Approximate arctan(u) by a polynomial poly. #
6179 # Step 4. Return arctan(F) + poly, arctan(F) is fetched from a #
6182 # Step 5. If |X| >= 16, go to Step 7. #
6184 # Step 6. Approximate arctan(X) by an odd polynomial in X. Exit.
    [all...]
  /src/sys/arch/mac68k/obio/
iwm.s 531 moveq #stepOutCmd,%d0 | Step out
540 moveq #doStepCmd,%d0 | otherwise step
592 moveq #stepInCmd,%d0 | Set step IN
597 moveq #stepOutCmd,%d0 | Set step OUT
604 bsr driveCmd | Step one!

Completed in 37 milliseconds