HomeSort by relevance Sort by last modified time
    Searched refs:num (Results 1 - 25 of 2652) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/test/CodeGen/
2004-02-20-Builtins.c 3 void zsqrtxxx(float num) {
4 num = sqrt(num);
  /external/libjpeg-turbo/java/org/libjpegturbo/turbojpeg/
TJScalingFactor.java 40 * @param num numerator
44 public TJScalingFactor(int num, int denom) {
45 if (num < 1 || denom < 1)
47 this.num = num;
57 return num;
79 return (dimension * num + denom - 1) / denom;
92 return this.num == other.num && this.denom == other.denom;
103 return num == 1 && denom == 1
109 private int num = 1; field in class:TJScalingFactor
    [all...]
  /art/libelffile/dwarf/
register.h 27 int num() const { return num_; } function in class:art::dwarf::Reg
38 static Reg ArmCore(int num) { return Reg(num); } // R0-R15.
39 static Reg ArmFp(int num) { return Reg(64 + num); } // S0?S31.
40 static Reg ArmDp(int num) { return Reg(256 + num); } // D0?D31.
41 static Reg Arm64Core(int num) { return Reg(num); } // X0-X31.
42 static Reg Arm64Fp(int num) { return Reg(64 + num); } // V0-V31
    [all...]
  /external/u-boot/cmd/
mfsl.c 20 unsigned int num; local
37 case 0: NGET (num, 0);
39 case 1: NCGET (num, 0);
41 case 2: GET (num, 0);
43 case 3: CGET (num, 0);
53 case 0: NGET (num, 1);
55 case 1: NCGET (num, 1);
57 case 2: GET (num, 1);
59 case 3: CGET (num, 1);
69 case 0: NGET (num, 2)
175 unsigned int num; local
    [all...]
  /external/libjpeg-turbo/doc/html/search/
all_6e.js 3 ['num',['num',['../structtjscalingfactor.html#a9b011e57f981ee23083e2c1aa5e640ec',1,'tjscalingfactor']]]
variables_6e.js 3 ['num',['num',['../structtjscalingfactor.html#a9b011e57f981ee23083e2c1aa5e640ec',1,'tjscalingfactor']]]
  /external/mesa3d/src/gallium/drivers/swr/rasterizer/codegen/templates/
gen_header_init.hpp 34 %for num in range(numFiles):
35 void Init${tableName}${num}();
40 %for num in range(numFiles):
41 Init${tableName}${num}();
  /external/ltp/testcases/kernel/syscalls/move_pages/
move_pages_support.h 34 void free_pages(void **pages, unsigned int num);
36 int alloc_pages_on_nodes(void **pages, unsigned int num, int *nodes);
37 int alloc_pages_linear(void **pages, unsigned int num);
38 int alloc_pages_on_node(void **pages, unsigned int num, int node);
41 unsigned int num, int *nodes);
42 void verify_pages_linear(void **pages, int *status, unsigned int num);
44 unsigned int num, int node);
46 int alloc_shared_pages_on_node(void **pages, unsigned int num, int node);
47 void free_shared_pages(void **pages, unsigned int num);
49 sem_t *alloc_sem(int num);
    [all...]
  /external/ltp/testcases/open_posix_testsuite/functional/threads/tools/
watchdogtimer.sh 5 num=0
10 while [ $num -lt $PINUM ]
15 num=`expr $num + 1`
  /external/u-boot/include/asm-generic/bitops/
__ffs.h 14 int num = 0; local
18 num += 32;
23 num += 16;
27 num += 8;
31 num += 4;
35 num += 2;
39 num += 1;
40 return num;
__fls.h 14 int num = BITS_PER_LONG - 1; local
18 num -= 32;
23 num -= 16;
27 num -= 8;
31 num -= 4;
35 num -= 2;
39 num -= 1;
40 return num;
  /external/ltp/testcases/kernel/fs/doio/
bytes_by_prefix.c 77 float num; local
80 nconv = sscanf(s, "%f%c%c", &num, &mult, &junk);
85 result = num;
91 result = (int)(num * (float)B_MULT);
94 result = (int)(num * (float)K_MULT);
97 result = (int)((num * (float)K_MULT) * sizeof(long));
100 result = (int)(num * (float)M_MULT);
103 result = (int)((num * (float)M_MULT) * sizeof(long));
106 result = (int)(num * (float)G_MULT);
109 result = (int)((num * (float)G_MULT) * sizeof(long))
125 float num; local
177 double num; local
    [all...]
  /external/e2fsprogs/lib/e2p/
parse_num.c 20 unsigned long long num; local
22 num = strtoull(arg, &p, 0);
29 num <<= 10;
32 num <<= 10;
35 num <<= 10;
39 num <<= 10;
41 num >>= log_block_size;
45 num <<= 9;
47 num >>= (1+log_block_size);
54 return num;
68 unsigned long num; local
    [all...]
crypto_mode.c 23 int num; member in struct:mode
35 const char *e2p_encmode2string(int num)
41 if (num == p->num)
44 sprintf(buf, "ENC_MODE_%d", num);
55 int num; local
59 return p->num;
67 num = strtol(string+9, &eptr, 10);
68 if (num > 255 || num < 0
    [all...]
hashstr.c 22 int num; member in struct:hash
33 const char *e2p_hash2string(int num)
39 if (num == p->num)
42 sprintf(buf, "HASHALG_%d", num);
53 int num; local
57 return p->num;
65 num = strtol(string+8, &eptr, 10);
66 if (num > 255 || num < 0
    [all...]
  /external/xz-java/src/org/tukaani/xz/common/
Util.java 19 public static int getVLISize(long num) {
23 num >>= 7;
24 } while (num != 0);
  /external/epid-sdk/epid/member/tiny/stdlib/
tiny_stdlib.h 26 * Sets the first num bytes of the block of memory pointed by ptr
33 * \param num Number of bytes to be set to the value. size_t is
37 void* memset(void* ptr, int value, size_t num);
41 * Compares the first num bytes of the block of memory pointed by
42 * ptr1 to the first num bytes pointed by ptr2, returning zero if
51 * \param num Number of bytes to compare.
62 int memcmp(const void* ptr1, const void* ptr2, size_t num);
  /external/u-boot/board/freescale/common/
sgmii_riser.h 15 void fsl_sgmii_riser_init(struct tsec_info_struct *tsec_info, int num);
  /bionic/libc/upstream-openbsd/lib/libc/stdlib/
div.c 37 div(int num, int denom)
41 r.quot = num / denom;
42 r.rem = num % denom;
53 * sign of num; if both are negative and r.quot has been
55 * have the opposite sign of num). These are considered
58 * If both are num and denom are positive, r will always
62 * if num >= 0, but r.rem < 0, we got the wrong answer.
66 if (num >= 0 && r.rem < 0) {
imaxdiv.c 37 imaxdiv(intmax_t num, intmax_t denom)
43 r.quot = num / denom;
44 r.rem = num % denom;
45 if (num >= 0 && r.rem < 0) {
ldiv.c 37 ldiv(long num, long denom)
43 r.quot = num / denom;
44 r.rem = num % denom;
45 if (num >= 0 && r.rem < 0) {
lldiv.c 37 lldiv(long long num, long long denom)
43 r.quot = num / denom;
44 r.rem = num % denom;
45 if (num >= 0 && r.rem < 0) {
  /developers/build/prebuilts/gradle/RuntimePermissions/kotlinApp/app/src/main/java/com/example/android/system/runtimepermissions/extensions/
CollectionsExts.kt 18 fun IntArray.containsOnly(num: Int): Boolean = filter { it == num }.isNotEmpty(
  /developers/samples/android/system/RuntimePermissions/kotlinApp/app/src/main/java/com/example/android/system/runtimepermissions/extensions/
CollectionsExts.kt 18 fun IntArray.containsOnly(num: Int): Boolean = filter { it == num }.isNotEmpty(
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/json/tests/
test_float.py 7 for num in [1617161771.7650001, math.pi, math.pi**100,
9 self.assertEqual(float(self.dumps(num)), num)
10 self.assertEqual(self.loads(self.dumps(num)), num)
11 self.assertEqual(self.loads(unicode(self.dumps(num))), num)
14 for num in [1, 1L, 1<<32, 1<<64]:
15 self.assertEqual(self.dumps(num), str(num))
    [all...]

Completed in 1505 milliseconds

1 2 3 4 5 6 7 8 91011>>