HomeSort by relevance Sort by last modified time
    Searched full:half (Results 1 - 25 of 992) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/elfutils/libelf/
abstract.h 23 TYPE_NAME (ElfW2(Bits, Ext##Half), e_type) \
24 TYPE_NAME (ElfW2(Bits, Ext##Half), e_machine) \
30 TYPE_NAME (ElfW2(Bits, Ext##Half), e_ehsize) \
31 TYPE_NAME (ElfW2(Bits, Ext##Half), e_phentsize) \
32 TYPE_NAME (ElfW2(Bits, Ext##Half), e_phnum) \
33 TYPE_NAME (ElfW2(Bits, Ext##Half), e_shentsize) \
34 TYPE_NAME (ElfW2(Bits, Ext##Half), e_shnum) \
35 TYPE_NAME (ElfW2(Bits, Ext##Half), e_shstrndx) \
108 TYPE_NAME (ElfW2(32, Ext##Half), st_shndx) \
117 TYPE_NAME (ElfW2(64, Ext##Half), st_shndx)
    [all...]
gelf_xlate.h 22 FUNDAMENTAL (HALF, Half, LIBELFBITS);
  /bionic/libm/src/
e_coshf.c 23 static const float one = 1.0, half=0.5, huge = 1.0e30; variable
48 return half*t+half/t;
51 /* |x| in [9, log(maxfloat)] return half*exp(|x|) */
52 if (ix < 0x42b17217) return half*__ieee754_expf(fabsf(x));
56 w = __ieee754_expf(half*fabsf(x));
57 t = half*w;
e_cosh.c 42 static const double one = 1.0, half=0.5, huge = 1.0e300; variable
69 return half*t+half/t;
72 /* |x| in [22, log(maxdouble)] return half*exp(|x|) */
73 if (ix < 0x40862E42) return half*__ieee754_exp(fabs(x));
79 w = __ieee754_exp(half*fabs(x));
80 t = half*w;
  /packages/inputmethods/PinyinIME/jni/include/
lpicache.h 26 // Used to cache LmaPsbItem list for half spelling ids.
43 // list for half ids.
49 // Note: splid must be a half id, and lpi_items must be not NULL. The
53 // Get the cached list for the given half id.
55 // Note: splid must be a half id, and lpi_items must be not NULL. The
spellingtrie.h 48 // Map from half spelling id to single char.
49 // For half ids of Zh/Ch/Sh, map to z/c/s (low case) respectively.
74 // The Yunmu id list for the spelling ids (for half ids of Shengmu,
106 // The full spl_id range for specific half id.
107 // h2f means half to full.
108 // A half id can be a ShouZiMu id (id to represent the first char of a full
110 // [1..kFullSplIdStart-1] is the arrange of half id.
114 // Map from full id to half id.
177 // first given as a half id 1, but because 'A' is a one-char Yunmu and
181 // Test if the given id is a half id
    [all...]
splparser.h 46 // convert single-character Yunmus into half ids, while this function converts
64 // enabled in ShouZiMu mode, the returned spelling id will be a half id.
65 // When the returned spelling id is a half id, *is_pre returns whether it
73 // When the returned spelling id is a half id, *p_is_pre returns whether it
  /external/fdlibm/
e_cosh.c 38 static const double one = 1.0, half=0.5, huge = 1.0e300; variable
40 static double one = 1.0, half=0.5, huge = 1.0e300; variable
72 return half*t+half/t;
75 /* |x| in [22, ieee_log(maxdouble)] return half*ieee_exp(|x|) */
76 if (ix < 0x40862E42) return half*__ieee754_exp(ieee_fabs(x));
82 w = __ieee754_exp(half*ieee_fabs(x));
83 t = half*w;
  /external/speex/libspeex/
fftwrap.h 46 /** Forward (real to half-complex) transform */
49 /** Backward (half-complex to real) transform */
52 /** Forward (real to half-complex) transform of float data */
55 /** Backward (half-complex to real) transform of float data */
vq_sse.h 41 __m128 half; local
44 half = _mm_set_ps1(.5f);
50 __m128 d = _mm_mul_ps(E[i], half);
80 __m128 half; local
83 half = _mm_set_ps1(.5f);
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/
mii.h 61 #define BMSR_10HALF 0x0800 /* Can do 10mbps, half-duplex */
63 #define BMSR_100HALF 0x2000 /* Can do 100mbps, half-duplex */
70 #define ADVERTISE_10HALF 0x0020 /* Try for 10mbps half-duplex */
73 #define ADVERTISE_1000XHALF 0x0040 /* Try for 1000BASE-X half-duplex */
74 #define ADVERTISE_100HALF 0x0080 /* Try for 100mbps half-duplex */
93 #define LPA_10HALF 0x0020 /* Can do 10mbps half-duplex */
96 #define LPA_1000XHALF 0x0040 /* Can do 1000BASE-X half-duplex */
97 #define LPA_100HALF 0x0080 /* Can do 100mbps half-duplex */
121 #define ESTATUS_1000_THALF 0x1000 /* Can do 1000BT Half */
130 #define ADVERTISE_1000HALF 0x0100 /* Advertise 1000BASE-T half duplex *
    [all...]
  /device/samsung/crespo/
device.mk 25 # separated into two halves: this half here contains the parts that
26 # are available to everyone, while another half in the vendor/ hierarchy
30 # transparency. There are two variants of the half that deals with
44 # half of the device-specific product definition file takes care
  /external/qemu/audio/
mixeng_template.h 31 #define HALF (IN_MAX >> 1)
55 return (nv - HALF) * (1.f / (mixeng_real) IN_MAX);
61 return (nv - HALF) / (mixeng_real) IN_MAX;
78 return ENDIAN_CONVERT ((IN_T) ((v * IN_MAX) + HALF));
90 return ((int64_t) nv - HALF) << (32 - SHIFT);
106 return ENDIAN_CONVERT ((IN_T) ((v >> (32 - SHIFT)) + HALF));
176 #undef HALF
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/dvb/
osd.h 115 OSD_BITMAP1HR, /* 1 Bit bitmap half resolution */
116 OSD_BITMAP2HR, /* 2 bit bitmap half resolution */
117 OSD_BITMAP4HR, /* 4 bit bitmap half resolution */
118 OSD_BITMAP8HR, /* 8 bit bitmap half resolution */
121 OSD_YCRCB444HR, /* 4:4:4 YCRCB graphic half resolution */
123 OSD_VIDEOHSIZE, /* MPEG Video Display Half Resolution */
126 OSD_VIDEOTHSIZE, /* True Size MPEG Video Display Half Resolution */
  /frameworks/base/media/libmedia/
fixedfft.cpp 23 * half of the twiddle factors are stored. Although there are still ways to make
97 static inline int32_t half(int32_t a) function
124 int32_t x = half(v[i]);
125 int32_t y = half(v[i + p]);
135 int32_t x = half(v[i]);
151 v[m] = half(v[m]);
154 int32_t x = half(v[i]);
155 int32_t z = half(v[n - i]);
157 x = half(x + (z ^ 0xFFFF));
  /dalvik/docs/opcodes/
opcode-04-move-wide.html 65 Register vB must be the lower half of a register pair (which excludes the
84 If register v(A-1) is the lower half of a register pair, then v(A-1)'
88 If register v(A+2) is the upper half of a register pair, then v(A+2)'
  /cts/tools/vm-tests/src/dot/junit/opcodes/const_16/
Test_const_16.java 50 * @title When writing to a register that is one half of a register
51 * pair, but not touching the other half, the old register pair gets broken up, and the
  /cts/tools/vm-tests/src/dot/junit/opcodes/const_4/
Test_const_4.java 49 * @title When writing to a register that is one half of a register
50 * pair, but not touching the other half, the old register pair gets broken up, and the
  /cts/tools/vm-tests/src/dot/junit/opcodes/const_high16/
Test_const_high16.java 47 * @title When writing to a register that is one half of a register
48 * pair, but not touching the other half, the old register pair gets broken up, and the
  /cts/tools/vm-tests/src/dot/junit/opcodes/const_string/
Test_const_string.java 51 * @title When writing to a register that is one half of a register
52 * pair, but not touching the other half, the old register pair gets broken up, and the
  /cts/tools/vm-tests/src/dot/junit/opcodes/const_string_jumbo/
Test_const_string_jumbo.java 51 * @title When writing to a register that is one half of a register
52 * pair, but not touching the other half, the old register pair gets broken up, and the
  /cts/tools/vm-tests/src/dot/junit/opcodes/const_wide/
Test_const_wide.java 60 * @title When writing to a register that is one half of a register
61 * pair, but not touching the other half, the old register pair gets broken up, and the
  /cts/tools/vm-tests/src/dot/junit/opcodes/const_wide_16/
Test_const_wide_16.java 50 * @title When writing to a register that is one half of a register
51 * pair, but not touching the other half, the old register pair gets broken up, and the
  /cts/tools/vm-tests/src/dot/junit/opcodes/const_wide_32/
Test_const_wide_32.java 49 * @title When writing to a register that is one half of a register
50 * pair, but not touching the other half, the old register pair gets broken up, and the
  /cts/tools/vm-tests/src/dot/junit/opcodes/const_wide_high16/
Test_const_wide_high16.java 47 * @title When writing to a register that is one half of a register
48 * pair, but not touching the other half, the old register pair gets broken up, and the

Completed in 661 milliseconds

1 2 3 4 5 6 7 8 91011>>