HomeSort by: relevance | last modified time | path
    Searched refs:ONE (Results 1 - 25 of 80) sorted by relevancy

1 2 3 4

  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
macro-source-path.c 21 return ONE + TWO;
info-macros.c 3 #ifdef ONE
40 #define ONE
60 #undef ONE
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
macro-source-path.c 21 return ONE + TWO;
info-macros.c 3 #ifdef ONE
40 #define ONE
60 #undef ONE
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/
index.cc 20 enum E { ONE, TWO };
21 E e_value = ONE;
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/
index.cc 20 enum E { ONE, TWO };
21 E e_value = ONE;
  /src/tests/usr.bin/xlint/lint1/
msg_206.c 9 ONE, TWO, THREE
16 case ONE:
23 case ONE:
34 case ONE:
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.guile/
scm-math.c 20 ONE = 1,
scm-value.c 34 ONE = 1,
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.guile/
scm-math.c 20 ONE = 1,
scm-value.c 34 ONE = 1,
  /src/lib/libc/quad/
fixunsdfdi.c 53 #define ONE (ONE_FOURTH * 4.0)
77 * limit is one ulp less than 18446744073709551615 tested for above.
82 tmp = x / ONE;
83 t.ul[L] = (unsigned int) (x - tmp * ONE);
fixunssfdi.c 53 #define ONE (ONE_FOURTH * 4.0)
85 toppart = (x - ONE_HALF) / ONE;
  /src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
RegisterValue.cpp 23 case PredefinedValues::ONE:
38 auto Output = getFloatValue(FltSemantics, PredefinedValues::ONE);
RegisterValue.h 35 ONE, // 1.0
39 ULP, // One Unit in the last place
  /src/crypto/external/apache2/openssl/dist/crypto/rc4/asm/
rc4-c64xplus.pl 21 # RC4 subroutine processes one byte in 7.0 cycles, which is 3x faster
23 # there is only one reference to memory in each cycle. This is done
30 ($KEYA,$XX,$TY,$xx,$ONE,$ret)=map("A$_",(5,7,8,9,1,2));
54 [B0] MVK 1,$ONE
59 ADD4 $ONE,$XX,$XX
69 || ADD4 $ONE,$XX,$XX
88 SUB4 $XX,$ONE,$XX
102 MVK 0x00000404,$ONE
104 MVKH 0x04040000,$ONE
107 MVK 0x00000404,$ONE
    [all...]
  /src/crypto/external/bsd/openssl/dist/crypto/rc4/asm/
rc4-c64xplus.pl 21 # RC4 subroutine processes one byte in 7.0 cycles, which is 3x faster
23 # there is only one reference to memory in each cycle. This is done
30 ($KEYA,$XX,$TY,$xx,$ONE,$ret)=map("A$_",(5,7,8,9,1,2));
54 [B0] MVK 1,$ONE
59 ADD4 $ONE,$XX,$XX
69 || ADD4 $ONE,$XX,$XX
88 SUB4 $XX,$ONE,$XX
102 MVK 0x00000404,$ONE
104 MVKH 0x04040000,$ONE
107 MVK 0x00000404,$ONE
    [all...]
  /src/crypto/external/bsd/openssl.old/dist/crypto/rc4/asm/
rc4-c64xplus.pl 21 # RC4 subroutine processes one byte in 7.0 cycles, which is 3x faster
23 # there is only one reference to memory in each cycle. This is done
30 ($KEYA,$XX,$TY,$xx,$ONE,$ret)=map("A$_",(5,7,8,9,1,2));
54 [B0] MVK 1,$ONE
59 ADD4 $ONE,$XX,$XX
69 || ADD4 $ONE,$XX,$XX
88 SUB4 $XX,$ONE,$XX
102 MVK 0x00000404,$ONE
104 MVKH 0x04040000,$ONE
107 MVK 0x00000404,$ONE
    [all...]
  /src/games/countmail/
countmail 93 *1) y=${y}ONE ;;
105 *1??) z=ONE ;;
130 ONE) p= ;;
  /src/external/gpl3/gcc/dist/libquadmath/math/
cosq_kernel.c 23 #define ONE c[0]
26 /* cos x ~ ONE + x^2 ( SCOS1 + SCOS2 * x^2 + ... + SCOS4 * x^6 + SCOS5 * x^8 )
39 /* cos x ~ ONE + x^2 ( COS1 + COS2 * x^2 + ... + COS7 * x^12 + COS8 * x^14 )
58 /* sin x ~ ONE * x + x^3 ( SSIN1 + SSIN2 * x^2 + ... + SSIN4 * x^6 + SSIN5 * x^8 )
92 if (!((int)x)) return ONE; /* generate inexact */
94 return ONE + (z*(COS1+z*(COS2+z*(COS3+z*(COS4+
123 sin_l = l*(ONE+z*(SSIN1+z*(SSIN2+z*(SSIN3+z*(SSIN4+z*SSIN5)))));
sincosq_kernel.c 23 #define ONE c[0]
26 /* cos x ~ ONE + x^2 ( SCOS1 + SCOS2 * x^2 + ... + SCOS4 * x^6 + SCOS5 * x^8 )
39 /* cos x ~ ONE + x^2 ( COS1 + COS2 * x^2 + ... + COS7 * x^12 + COS8 * x^14 )
58 /* sin x ~ ONE * x + x^3 ( SSIN1 + SSIN2 * x^2 + ... + SSIN4 * x^6 + SSIN5 * x^8 )
71 /* sin x ~ ONE * x + x^3 ( SIN1 + SIN2 * x^2 + ... + SIN7 * x^12 + SIN8 * x^14 )
116 *cosx = ONE;
123 *cosx = ONE + (z*(COS1+z*(COS2+z*(COS3+z*(COS4+
156 sin_l = l*(ONE+z*(SSIN1+z*(SSIN2+z*(SSIN3+z*(SSIN4+z*SSIN5)))));
sinq_kernel.c 23 #define ONE c[0]
26 /* cos x ~ ONE + x^2 ( SCOS1 + SCOS2 * x^2 + ... + SCOS4 * x^6 + SCOS5 * x^8 )
39 /* sin x ~ ONE * x + x^3 ( SIN1 + SIN2 * x^2 + ... + SIN7 * x^12 + SIN8 * x^14 )
58 /* sin x ~ ONE * x + x^3 ( SSIN1 + SSIN2 * x^2 + ... + SSIN4 * x^6 + SSIN5 * x^8 )
125 sin_l = l*(ONE+z*(SSIN1+z*(SSIN2+z*(SSIN3+z*(SSIN4+z*SSIN5)))));
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
cosq_kernel.c 23 #define ONE c[0]
26 /* cos x ~ ONE + x^2 ( SCOS1 + SCOS2 * x^2 + ... + SCOS4 * x^6 + SCOS5 * x^8 )
39 /* cos x ~ ONE + x^2 ( COS1 + COS2 * x^2 + ... + COS7 * x^12 + COS8 * x^14 )
58 /* sin x ~ ONE * x + x^3 ( SSIN1 + SSIN2 * x^2 + ... + SSIN4 * x^6 + SSIN5 * x^8 )
92 if (!((int)x)) return ONE; /* generate inexact */
94 return ONE + (z*(COS1+z*(COS2+z*(COS3+z*(COS4+
123 sin_l = l*(ONE+z*(SSIN1+z*(SSIN2+z*(SSIN3+z*(SSIN4+z*SSIN5)))));
sincosq_kernel.c 23 #define ONE c[0]
26 /* cos x ~ ONE + x^2 ( SCOS1 + SCOS2 * x^2 + ... + SCOS4 * x^6 + SCOS5 * x^8 )
39 /* cos x ~ ONE + x^2 ( COS1 + COS2 * x^2 + ... + COS7 * x^12 + COS8 * x^14 )
58 /* sin x ~ ONE * x + x^3 ( SSIN1 + SSIN2 * x^2 + ... + SSIN4 * x^6 + SSIN5 * x^8 )
71 /* sin x ~ ONE * x + x^3 ( SIN1 + SIN2 * x^2 + ... + SIN7 * x^12 + SIN8 * x^14 )
116 *cosx = ONE;
123 *cosx = ONE + (z*(COS1+z*(COS2+z*(COS3+z*(COS4+
156 sin_l = l*(ONE+z*(SSIN1+z*(SSIN2+z*(SSIN3+z*(SSIN4+z*SSIN5)))));
sinq_kernel.c 23 #define ONE c[0]
26 /* cos x ~ ONE + x^2 ( SCOS1 + SCOS2 * x^2 + ... + SCOS4 * x^6 + SCOS5 * x^8 )
39 /* sin x ~ ONE * x + x^3 ( SIN1 + SIN2 * x^2 + ... + SIN7 * x^12 + SIN8 * x^14 )
58 /* sin x ~ ONE * x + x^3 ( SSIN1 + SSIN2 * x^2 + ... + SSIN4 * x^6 + SSIN5 * x^8 )
125 sin_l = l*(ONE+z*(SSIN1+z*(SSIN2+z*(SSIN3+z*(SSIN4+z*SSIN5)))));

Completed in 30 milliseconds

1 2 3 4