/external/guice/extensions/servlet/test/com/google/inject/servlet/ |
DummyFilterImpl.java | 34 int num; field in class:DummyFilterImpl 39 public DummyFilterImpl(int num) { 40 this.num = num;
|
/external/llvm/test/MC/AsmParser/ |
macro_parsing.s | 3 .macro DEF num 4 int $0x\num
|
/external/python/cpython2/Demo/comparisons/ |
sortingtest.py | 34 var, num = match.groups() 35 return int(num), var 41 for num, var in items: 42 print "%s=%s" % (var, num),
|
/external/webrtc/tools/network_emulator/ |
config.py | 16 def __init__(self, num, name, receive_bw_kbps, send_bw_kbps, delay_ms, 18 self.num = num 35 self.num, left_aligned_name, self.receive_bw_kbps, self.send_bw_kbps,
|
/external/ltp/testcases/kernel/syscalls/move_pages/ |
move_pages_support.c | 35 * @num: no. of pages in the array 37 void free_pages(void **pages, unsigned int num) 43 for (i = 0; i < num; i++) { 54 * @num: no. of pages to allocate 63 int alloc_pages_on_nodes(void **pages, unsigned int num, int *nodes) 70 for (i = 0; i < num; i++) { 74 for (i = 0; i < num; i++) { 91 if (i == num) 94 free_pages(pages, num); 102 * @num: no. of pages to allocat [all...] |
/external/v8/src/arm64/ |
utils-arm64.h | 88 inline bool IsSignallingNaN(double num) { 89 uint64_t raw = double_to_rawbits(num); 90 if (std::isnan(num) && ((raw & kDQuietNanMask) == 0)) { 97 inline bool IsSignallingNaN(float num) { 98 uint32_t raw = float_to_rawbits(num); 99 if (std::isnan(num) && ((raw & kSQuietNanMask) == 0)) { 107 inline bool IsQuietNaN(T num) { 108 return std::isnan(num) && !IsSignallingNaN(num); 112 // Convert the NaN in 'num' to a quiet NaN [all...] |
/bionic/libc/kernel/uapi/linux/hsi/ |
cs-protocol.h | 67 #define CS_IOW(num,dtype) _IOW(CS_IO_MAGIC, num, dtype) 68 #define CS_IOR(num,dtype) _IOR(CS_IO_MAGIC, num, dtype) 69 #define CS_IOWR(num,dtype) _IOWR(CS_IO_MAGIC, num, dtype) 70 #define CS_IO(num) _IO(CS_IO_MAGIC, num)
|
/device/google/contexthub/firmware/os/cpu/x86/ |
atomicBitset.c | 37 bool atomicBitsetGetBit(const struct AtomicBitset *set, uint32_t num) 39 if (num >= set->numBits) /* any value is as good as the next */ 42 return !!((set->words[num / 32]) & (1UL << (num & 31))); 45 void atomicBitsetClearBit(struct AtomicBitset *set, uint32_t num) 47 uint32_t idx = num / 32, mask = 1UL << (num & 31); 51 if (num >= set->numBits)
|
/device/linaro/bootloader/arm-trusted-firmware/include/common/ |
interrupt_props.h | 13 #define INTR_PROP_DESC(num, pri, grp, cfg) \ 15 .intr_num = num, \
|
/external/boringssl/src/include/openssl/ |
rand.h | 79 OPENSSL_EXPORT void RAND_seed(const void *buf, int num); 82 OPENSSL_EXPORT int RAND_load_file(const char *path, long num); 85 OPENSSL_EXPORT const char *RAND_file_name(char *buf, size_t num); 88 OPENSSL_EXPORT void RAND_add(const void *buf, int num, double entropy); 103 void (*seed) (const void *buf, int num); 104 int (*bytes) (uint8_t *buf, size_t num); 106 void (*add) (const void *buf, int num, double entropy); 107 int (*pseudorand) (uint8_t *buf, size_t num);
|
/external/e2fsprogs/lib/uuid/ |
uuidd.h | 51 extern void uuid__generate_time(uuid_t out, int *num); 52 extern void uuid__generate_random(uuid_t out, int *num);
|
/external/kernel-headers/original/uapi/linux/hsi/ |
cs-protocol.h | 110 #define CS_IOW(num, dtype) _IOW(CS_IO_MAGIC, num, dtype) 111 #define CS_IOR(num, dtype) _IOR(CS_IO_MAGIC, num, dtype) 112 #define CS_IOWR(num, dtype) _IOWR(CS_IO_MAGIC, num, dtype) 113 #define CS_IO(num) _IO(CS_IO_MAGIC, num)
|
/external/ltp/android/include/sys/ |
io.h | 12 static inline int ioperm(unsigned long from, unsigned long num, int turn_on) 14 return syscall(__NR_ioperm, from, num, turn_on);
|
/external/ltp/testcases/network/stress/dns/ |
dns-stress-lib.sh | 37 [ $num -eq $connect_quantity ] && return 38 tst_brkm TFAIL "some requests failed: $num/$connect_quantity"
|
/external/pdfium/core/fpdfdoc/ |
cpdf_numbertree.cpp | 14 CPDF_Object* SearchNumberNode(const CPDF_Dictionary* pNode, int num) { 17 (num < pLimits->GetIntegerAt(0) || num > pLimits->GetIntegerAt(1))) { 24 if (num == index) 26 if (index > num) 41 CPDF_Object* pFound = SearchNumberNode(pKid, num); 54 CPDF_Object* CPDF_NumberTree::LookupValue(int num) const { 55 return SearchNumberNode(m_pRoot.Get(), num);
|
/external/perfetto/src/ipc/test/ |
deferred_unittest_messages.proto | 23 optional int32 num = 1;
|
/external/valgrind/none/tests/s390x/ |
cvd.c | 17 static unsigned long hex_to_dec(signed int num) 23 : "=m" (addr) : "a" (&addr) , "d" (num) : "memory");
|
/prebuilts/go/darwin-x86/src/syscall/ |
mksysnum_darwin.pl | 24 my $num = $2; 26 print " SYS_$name = $num;"
|
/prebuilts/go/linux-x86/src/syscall/ |
mksysnum_darwin.pl | 24 my $num = $2; 26 print " SYS_$name = $num;"
|
/external/curl/lib/ |
rand.c | 105 * Curl_rand() stores 'num' number of random unsigned integers in the buffer 120 CURLcode Curl_rand(struct Curl_easy *data, unsigned char *rnd, size_t num) 124 DEBUGASSERT(num > 0); 126 while(num) { 128 size_t left = num < sizeof(unsigned int) ? num : sizeof(unsigned int); 137 --num; 146 * Curl_rand_hex() fills the 'rnd' buffer with a given 'num' size with random 152 size_t num) 158 DEBUGASSERT(num > 1) [all...] |
/device/google/contexthub/firmware/os/cpu/cortexm4/ |
cpuMath.c | 50 return num; \ 52 ret = cpuMathUint64TimesUint64Lsr64(num, denomRecip); \ 54 if (try <= num && try >= ret * denom) \ 59 uint64_t cpuMathRecipAssistedUdiv64by64(uint64_t num, uint64_t denom, uint64_t denomRecip) 64 uint64_t cpuMathRecipAssistedUdiv64by32(uint64_t num, uint32_t denom, uint64_t denomRecip)
|
/external/boringssl/src/decrepit/cfb/ |
cfb.c | 45 int num = ctx->num; local 46 AES_cfb128_encrypt(in, out, len, &cfb_ctx->ks, ctx->iv, &num, 48 ctx->num = num;
|
/frameworks/native/opengl/libs/tools/ |
glapigen | 54 for (my $num = 0; $num < $len; $num++) { 55 if ($args[$num] ne "void") { 64 if ($args[$num] =~ /(\S+\s)+\**\s*([\w]+)/) {
|
/external/elfutils/libasm/ |
asm_addint8.c | 54 FCT(SIZE) (AsmScn_t *asmscn, TYPE(SIZE) num) 59 if (asmscn->type == SHT_NOBITS && unlikely (num != 0)) 69 fprintf (asmscn->ctx->out.file, "\t.byte\t%" PRId8 "\n", (int8_t) num); 72 (int16_t) num); 75 (int32_t) num); 85 ? num % 0x100000000ll : num / 0x100000000ll), 87 ? num / 0x100000000ll : num % 0x100000000ll)); 96 TYPE(SIZE) var = num; [all...] |
/external/fio/lib/ |
num2str.c | 12 * @num: quantity (e.g., number of blocks, bytes or bits) 14 * @base: multiplier for num (e.g., if num represents Ki, use 1024) 19 char *num2str(uint64_t num, int maxlen, int base, int pow2, int units) 54 num *= 8; 61 num *= 8; 66 * Divide by K/Ki until string length of num <= maxlen. 70 sprintf(tmp, "%llu", (unsigned long long) num); 74 modulo = num % thousand[!!pow2]; 75 num /= thousand[!!pow2] [all...] |