HomeSort by relevance Sort by last modified time
    Searched refs:num (Results 176 - 200 of 3657) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/ltp/testcases/kernel/fs/mongo/
mongo_slinks.c 27 int num; local
69 num = readlink(new_path, buffer, size);
70 if (num < 1 || num > size) {
76 if (buffer[num] != 0) {
83 if (num < size)
  /external/mesa3d/src/gallium/auxiliary/util/
u_fifo.h 35 size_t num; member in struct:util_fifo
47 fifo->num = 0;
57 if (fifo->num >= fifo->size)
65 ++fifo->num;
75 if (!fifo->num)
83 ++fifo->num;
  /external/strace/tests/
setreugid.c 44 print_int(const unsigned int num)
46 if (num == -1U)
49 printf("%u", num);
53 num_matches_id(const unsigned int num, const unsigned int ugid)
55 return num == ugid || num == -1U;
  /external/strace/tests-m32/
setreugid.c 44 print_int(const unsigned int num)
46 if (num == -1U)
49 printf("%u", num);
53 num_matches_id(const unsigned int num, const unsigned int ugid)
55 return num == ugid || num == -1U;
  /external/strace/tests-mx32/
setreugid.c 44 print_int(const unsigned int num)
46 if (num == -1U)
49 printf("%u", num);
53 num_matches_id(const unsigned int num, const unsigned int ugid)
55 return num == ugid || num == -1U;
  /external/webrtc/webrtc/base/
sec_buffer.h 127 SecBuffer &operator[] (size_t num) {
128 ASSERT(num < num_buffers); // "Buffer index out of bounds"
129 return buffers_[num];
133 const SecBuffer &operator[] (size_t num) const {
134 ASSERT(num < num_buffers); // "Buffer index out of bounds"
135 return buffers_[num];
  /packages/apps/Settings/src/com/android/settings/enterprise/
AdminGrantedPermissionsPreferenceControllerBase.java 49 (num) -> {
50 if (num == 0) {
55 num, num));
78 false /* async */, (num) -> haveAppsWithAdminGrantedPermissions[0] = num > 0);
EnterpriseInstalledPackagesPreferenceController.java 43 (num) -> {
45 if (num == 0) {
50 R.plurals.enterprise_privacy_number_packages_lower_bound, num,
51 num));
72 (num) -> haveEnterpriseInstalledPackages[0] = num > 0);
EnterpriseSetDefaultAppsPreferenceController.java 45 final int num = getNumberOfEnterpriseSetDefaultApps(); local
47 R.plurals.enterprise_privacy_number_packages, num, num));
61 int num = 0; local
64 num += mApplicationFeatureProvider
69 return num;
  /external/icu/icu4c/source/test/perf/DateFmtPerf/
DateFmtPerf.h 56 int num; member in class:BreakItFunction
61 BreakItFunction(){num = -1;}
62 BreakItFunction(int a, bool b){num = a; wordIteration = b;}
70 for(int i = 0; i < num; i++)
87 for(int i = 0; i < num; i++)
107 if(wordIteration) return 125*num;
108 else return 355*num;
149 int num; member in class:DateFmtFunction
155 num = -1;
160 num = a
243 int num; member in class:DateFmtCreateFunction
277 int num; member in class:DateFmtCopyFunction
324 int num; member in class:DIFCreateFunction
379 int num; member in class:TimeZoneCreateFunction
423 int num; member in class:DTPatternGeneratorCreateFunction
468 int num; member in class:DTPatternGeneratorCopyFunction
515 int num; member in class:DTPatternGeneratorBestValueFunction
563 int num; member in class:NumFmtFunction
692 int num; member in class:StdioNumFmtFunction
751 int num; member in class:CollationFunction
    [all...]
  /external/e2fsprogs/lib/ext2fs/
badblocks.c 33 static errcode_t make_u32_list(int size, int num, __u32 *list,
45 bb->num = num;
84 retval = make_u32_list(src->size, src->num, src->list, dest);
116 if (bb->num >= bb->size) {
130 i = bb->num-1;
131 if ((bb->num != 0) && (bb->list[i] == blk))
133 if ((bb->num == 0) || (bb->list[i] < blk)) {
134 bb->list[bb->num++] = blk;
138 j = bb->num;
    [all...]
  /external/ipsec-tools/src/racoon/
cftoken.l 160 <S_PTH>include { YYD; yylval.num = LC_PATHTYPE_INCLUDE;
162 <S_PTH>pre_shared_key { YYD; yylval.num = LC_PATHTYPE_PSK;
164 <S_PTH>certificate { YYD; yylval.num = LC_PATHTYPE_CERT;
166 <S_PTH>script { YYD; yylval.num = LC_PATHTYPE_SCRIPT;
168 <S_PTH>backupsa { YYD; yylval.num = LC_PATHTYPE_BACKUPSA;
170 <S_PTH>pidfile { YYD; yylval.num = LC_PATHTYPE_PIDFILE;
186 <S_LOG>error { YYD; yylval.num = LLV_ERROR; return(LOGLEV); }
187 <S_LOG>warning { YYD; yylval.num = LLV_WARNING; return(LOGLEV); }
188 <S_LOG>notify { YYD; yylval.num = LLV_NOTIFY; return(LOGLEV); }
189 <S_LOG>info { YYD; yylval.num = LLV_INFO; return(LOGLEV);
    [all...]
  /external/e2fsprogs/resize/
sim_progress.c 53 int old_level, level, num, i; local
59 num = level - old_level;
60 if (num == 0)
63 if (num > 0) {
64 for (i=0; i < num; i++)
67 num = -num;
68 for (i=0; i < num; i++)
70 for (i=0; i < num; i++)
72 for (i=0; i < num; i++
    [all...]
  /external/elfutils/libasm/
libasm.h 111 /* Add 8-bit signed integer NUM to (sub)section ASMSCN. */
112 extern int asm_addint8 (AsmScn_t *asmscn, int8_t num);
114 /* Add 8-bit unsigned integer NUM to (sub)section ASMSCN. */
115 extern int asm_adduint8 (AsmScn_t *asmscn, uint8_t num);
117 /* Add 16-bit signed integer NUM to (sub)section ASMSCN. */
118 extern int asm_addint16 (AsmScn_t *asmscn, int16_t num);
120 /* Add 16-bit unsigned integer NUM to (sub)section ASMSCN. */
121 extern int asm_adduint16 (AsmScn_t *asmscn, uint16_t num);
123 /* Add 32-bit signed integer NUM to (sub)section ASMSCN. */
124 extern int asm_addint32 (AsmScn_t *asmscn, int32_t num);
    [all...]
  /external/libcxx/test/std/utilities/ratio/ratio.arithmetic/
ratio_add.pass.cpp 20 static_assert(R::num == 2 && R::den == 1, "");
26 static_assert(R::num == 3 && R::den == 2, "");
32 static_assert(R::num == 1 && R::den == 2, "");
38 static_assert(R::num == 1 && R::den == 2, "");
44 static_assert(R::num == -1 && R::den == 2, "");
50 static_assert(R::num == -1 && R::den == 2, "");
56 static_assert(R::num == 127970191639601LL && R::den == 5177331081415LL, "");
62 static_assert(R::num == 0 && R::den == 1, "");
68 static_assert(R::num == 1 && R::den == 1, "");
74 static_assert(R::num == 1 && R::den == 1, "")
    [all...]
ratio_subtract.pass.cpp 20 static_assert(R::num == 0 && R::den == 1, "");
26 static_assert(R::num == -1 && R::den == 2, "");
32 static_assert(R::num == -3 && R::den == 2, "");
38 static_assert(R::num == -3 && R::den == 2, "");
44 static_assert(R::num == 3 && R::den == 2, "");
50 static_assert(R::num == 3 && R::den == 2, "");
56 static_assert(R::num == -126708206685271LL && R::den == 5177331081415LL, "");
62 static_assert(R::num == 0 && R::den == 1, "");
68 static_assert(R::num == 1 && R::den == 1, "");
74 static_assert(R::num == -1 && R::den == 1, "")
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/utilities/ratio/ratio.arithmetic/
ratio_add.pass.cpp 20 static_assert(R::num == 2 && R::den == 1, "");
26 static_assert(R::num == 3 && R::den == 2, "");
32 static_assert(R::num == 1 && R::den == 2, "");
38 static_assert(R::num == 1 && R::den == 2, "");
44 static_assert(R::num == -1 && R::den == 2, "");
50 static_assert(R::num == -1 && R::den == 2, "");
56 static_assert(R::num == 127970191639601LL && R::den == 5177331081415LL, "");
62 static_assert(R::num == 0 && R::den == 1, "");
68 static_assert(R::num == 1 && R::den == 1, "");
74 static_assert(R::num == 1 && R::den == 1, "")
    [all...]
ratio_subtract.pass.cpp 20 static_assert(R::num == 0 && R::den == 1, "");
26 static_assert(R::num == -1 && R::den == 2, "");
32 static_assert(R::num == -3 && R::den == 2, "");
38 static_assert(R::num == -3 && R::den == 2, "");
44 static_assert(R::num == 3 && R::den == 2, "");
50 static_assert(R::num == 3 && R::den == 2, "");
56 static_assert(R::num == -126708206685271LL && R::den == 5177331081415LL, "");
62 static_assert(R::num == 0 && R::den == 1, "");
68 static_assert(R::num == 1 && R::den == 1, "");
74 static_assert(R::num == -1 && R::den == 1, "")
    [all...]
  /art/compiler/debug/dwarf/
debug_frame_opcode_writer.h 92 RelOffset(Reg(reg_base.num() + i), offset);
106 Restore(Reg(reg_base.num() + i));
122 if (0 <= reg.num() && reg.num() <= 0x3F) {
123 this->PushUint8(DW_CFA_offset | reg.num());
127 this->PushUleb128(reg.num());
133 this->PushUleb128(reg.num());
142 if (0 <= reg.num() && reg.num() <= 0x3F) {
143 this->PushUint8(DW_CFA_restore | reg.num());
    [all...]
  /external/boringssl/src/crypto/bio/
fd.c 142 // num is used to store the file descriptor.
143 bio->num = -1;
154 BORINGSSL_CLOSE(bio->num);
164 ret = BORINGSSL_READ(b->num, out, outl);
176 int ret = BORINGSSL_WRITE(b->num, in, inl);
187 static long fd_ctrl(BIO *b, int cmd, long num, void *ptr) {
193 num = 0;
198 ret = (long)BORINGSSL_LSEEK(b->num, num, SEEK_SET);
205 ret = (long)BORINGSSL_LSEEK(b->num, 0, SEEK_CUR)
    [all...]
  /external/curl/tests/libtest/
lib540.c 49 static int init(int num, CURLM *cm, const char *url, const char *userpwd,
54 res_easy_init(eh[num]);
58 res_easy_setopt(eh[num], CURLOPT_URL, url);
62 res_easy_setopt(eh[num], CURLOPT_PROXY, PROXY);
66 res_easy_setopt(eh[num], CURLOPT_PROXYUSERPWD, userpwd);
70 res_easy_setopt(eh[num], CURLOPT_PROXYAUTH, (long)CURLAUTH_ANY);
74 res_easy_setopt(eh[num], CURLOPT_VERBOSE, 1L);
78 res_easy_setopt(eh[num], CURLOPT_HEADER, 1L);
82 res_easy_setopt(eh[num], CURLOPT_HTTPHEADER, headers); /* custom Host: */
86 res_multi_add_handle(cm, eh[num]);
    [all...]
  /external/toybox/lib/
llist.c 103 // Find num in cache
104 struct num_cache *get_num_cache(struct num_cache *cache, long long num)
107 if (num==cache->num) return cache;
114 // Uniquely add num+data to cache. Updates *cache, returns pointer to existing
116 struct num_cache *add_num_cache(struct num_cache **cache, long long num,
119 struct num_cache *old = get_num_cache(*cache, num);
125 old->num = num;
  /external/boringssl/src/crypto/fipsmodule/bn/asm/
bn-586.pl 157 &and("ecx",0xfffffff8); # num / 8
187 &mov("ecx",&wparam(2)); # get num
266 $num="ebp";
271 &mov($num,&wparam(2)); #
274 &and($num,0xfffffff8); # num / 8
296 &sub($num,8);
301 &mov($num,&wparam(2)); # get num
302 &and($num,7)
    [all...]
  /external/boringssl/src/crypto/fipsmodule/modes/
cfb.c 60 const void *key, uint8_t ivec[16], unsigned *num,
64 assert(in && out && key && ivec && num);
66 unsigned n = *num;
85 *num = n;
108 *num = n;
131 *num = n;
155 *num = n;
166 int n, rem, num; local
178 num = (nbits + 7) / 8;
181 for (n = 0; n < num; ++n)
    [all...]
  /external/eigen/unsupported/test/
cxx11_tensor_intdiv.cpp 99 for (int32_t num = start_num; num < end_num; num++) {
102 int32_t result = num/div;
103 int32_t result_op = divider.divide(num);
118 for (int64_t num = start_num; num < end_num; num++) {
120 int64_t result = num/div;
121 int64_t result_op = divider.divide(num);
131 int64_t num = 3238002688ll; local
    [all...]

Completed in 547 milliseconds

1 2 3 4 5 6 78 91011>>