| /external/chromium_org/third_party/openssl/openssl/crypto/rsa/ |
| rsa_test.c | 221 int num; local
248 num = RSA_public_encrypt(plen, ptext_ex, ctext, key,
250 if (num != clen)
257 num = RSA_private_decrypt(num, ctext, ptext, key,
259 if (num != plen || memcmp(ptext, ptext_ex, num) != 0)
269 num = RSA_public_encrypt(plen, ptext_ex, ctext, key,
271 if (num == -1 && pad_unknown())
276 if (num != clen
[all...] |
| /external/chromium_org/third_party/opus/src/silk/float/ |
| burg_modified_FLP.c | 49 double C0, invGain, num, nrg_f, nrg_b, rc, Atmp, tmp1, tmp2; local
104 num = CAb[ n + 1 ];
109 num += CAb[ n - k ] * Atmp;
117 rc = -2.0 * num / ( nrg_f + nrg_b );
125 if( num > 0 ) {
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| DataTypes.cpp | 32 Float_t(float num = 0.0f) : f(num) {}
82 bool num = false; local
84 if (num && str[idx] == 'e') {
93 num = str[idx] >= '0' && str[idx] <= '9';
|
| QuarticRoot.cpp | 95 int num = cubicRootsReal(t4, t3, t2, t1, roots); local
96 for (int i = 0; i < num; ++i) {
98 return num;
101 roots[num++] = 0;
102 return num;
106 int num = cubicRootsReal(t4, t4 + t3, -(t1 + t0), -t0, roots); // note that -C==A+B+D+E local
107 for (int i = 0; i < num; ++i) {
109 return num;
112 roots[num++] = 1;
113 return num;
133 int num; local
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkQuarticRoot.cpp | 64 int num = SkDCubic::RootsReal(t4, t3, t2, t1, roots); local
65 for (int i = 0; i < num; ++i) {
67 return num;
70 roots[num++] = 0;
71 return num;
78 int num = SkDCubic::RootsReal(t4, t4 + t3, -(t1 + t0), -t0, roots); local
79 for (int i = 0; i < num; ++i) {
81 return num;
84 roots[num++] = 1;
85 return num;
105 int num; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| common.cc | 84 int num = static_cast<int>(64.0 * 1024.0 / size); local
85 if (num < 2) num = 2;
97 if (num > 32) num = 32;
99 return num;
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| common.cc | 80 int num = static_cast<int>(64.0 * 1024.0 / size); local
81 if (num < 2) num = 2;
93 if (num > 32) num = 32;
95 return num;
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/ |
| bitvect_test.c | 121 int i, num = sizeof(oct_small_vals)/sizeof(Val); local
123 for (i=0; i<num; i++) {
134 int i, num = sizeof(oct_large_vals)/sizeof(Val); local
136 for (i=0; i<num; i++) {
|
| /external/elfutils/0.153/libcpu/ |
| i386_parse.h | 74 unsigned long int num; member in union:YYSTYPE
|
| /external/freetype/src/psaux/ |
| psconv.c | 90 FT_Long num = 0; local
132 if ( num > num_limit || ( num == num_limit && c > c_limit ) )
135 num = num * base + c;
142 num = 0x7FFFFFFFL;
147 num = -num;
149 return num;
165 FT_Long num; local
[all...] |
| /external/icu/icu4c/source/tools/genrb/ |
| rle.c | 92 #define APPEND( buffer, bufLimit, value, num, status){ \
98 num++; \
107 int32_t num=0; local
112 APPEND(buffer,bufLimit,ESCAPE, num, status);
115 APPEND(buffer,bufLimit,value,num, status);
121 APPEND(buffer,bufLimit,ESCAPE,num,status);
124 APPEND(buffer,bufLimit,value,num,status);
127 APPEND(buffer,bufLimit,ESCAPE,num,status);
128 APPEND(buffer,bufLimit,(uint16_t) length, num,status);
129 APPEND(buffer,bufLimit,(uint16_t)value, num, status); /* Don't need to escape this value *
[all...] |
| /external/icu/icu4c/source/tools/toolutil/ |
| denseranges.cpp | 135 int32_t num; local
136 for(i=0, num=2;; ++i, ++num) {
143 if(length>num*2 && length>=(density*maxLength)/0x100) {
147 // Use the num ranges with the num-1 largest gaps.
148 gaps.truncate(num-1);
150 for(i=0; i<=num-2; ++i) {
156 ranges[num-1][1]=maxValue;
157 return num;
[all...] |
| /external/iproute2/misc/ |
| lnstat.h | 18 unsigned int num; /* field number in line */ member in struct:lnstat_field
|
| /external/iproute2/tc/ |
| f_rsvp.c | 219 int num; local
221 num = inet_proto_a2n(*argv);
222 if (num < 0) {
226 pinfo.protocol = num;
|
| /external/ipsec-tools/src/libipsec/ |
| policy_parse.h | 85 u_int num; member in union:YYSTYPE
|
| /external/javassist/src/main/javassist/bytecode/ |
| LineNumberAttribute.java | 160 int num = src.length; local
161 byte[] dest = new byte[num];
162 for (int i = 0; i < num; ++i)
|
| /external/javassist/src/main/javassist/bytecode/annotation/ |
| ArrayMemberValue.java | 132 int num = values.length; local
133 writer.arrayValue(num);
134 for (int i = 0; i < num; ++i)
|
| /external/kernel-headers/original/uapi/xen/ |
| privcmd.h | 52 int num; member in struct:privcmd_mmap
58 int num; /* number of pages to populate */ member in struct:privcmd_mmapbatch
69 unsigned int num; /* number of pages to populate */ member in struct:privcmd_mmapbatch_v2
|
| /external/libnfc-nci/src/nfc/nci/ |
| nci_hmsgs.c | 144 UINT8 num = 0, ulen, len, *pt; local
163 num++;
177 UINT8_TO_STREAM (pp, num);
336 UINT8 nci_snd_discover_cmd (UINT8 num, tNCI_DISCOVER_PARAMS *p_param)
343 size = num * sizeof (tNCI_DISCOVER_PARAMS) + 1;
357 UINT8_TO_STREAM (pp, num);
358 for (xx=0; xx<num; xx++)
450 UINT8 nci_snd_discover_map_cmd (UINT8 num, tNCI_DISCOVER_MAPS *p_maps)
457 size = num * sizeof (tNCI_DISCOVER_MAPS) + 1;
472 UINT8_TO_STREAM (pp, num);
533 UINT8 num = 0, ulen, len, *pt; local
[all...] |
| /external/libopus/silk/float/ |
| burg_modified_FLP.c | 49 double C0, invGain, num, nrg_f, nrg_b, rc, Atmp, tmp1, tmp2; local
104 num = CAb[ n + 1 ];
109 num += CAb[ n - k ] * Atmp;
117 rc = -2.0 * num / ( nrg_f + nrg_b );
125 if( num > 0 ) {
|
| /external/libvpx/libvpx/ |
| args.c | 178 int num; /**< fraction numerator */ member in struct:vpx_rational
191 rat.num = rawval;
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/ |
| bitops.h | 65 int num = 0; local
69 num += 32;
74 num += 16;
78 num += 8;
82 num += 4;
86 num += 2;
90 num += 1;
91 return num;
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| parse-events-bison.h | 70 u64 num; member in union:YYSTYPE
|
| parse-events.h | 58 u64 num; member in union:parse_events_term::__anon28968
77 int type_term, char *config, u64 num);
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.cpp | 51 uint32_t num = std::distance(uniques.begin(), p); local
54 if (num > 1024)
55 Header.bucket_count = num / 4;
56 if (num > 16)
57 Header.bucket_count = num / 2;
59 Header.bucket_count = num > 0 ? num : 1;
61 Header.hashes_count = num;
188 Asm->OutStreamer.AddComment("Num DIEs");
|
