| /prebuilts/ndk/9/platforms/android-21/arch-x86_64/usr/include/linux/ |
| virtio_ring.h | 57 unsigned int num; member in struct:vring
64 #define vring_used_event(vr) ((vr)->avail->ring[(vr)->num])
65 #define vring_avail_event(vr) (*(__u16 *)&(vr)->used->ring[(vr)->num])
|
| /system/core/include/utils/ |
| VectorImpl.h | 102 virtual void do_construct(void* storage, size_t num) const = 0;
103 virtual void do_destroy(void* storage, size_t num) const = 0;
104 virtual void do_copy(void* dest, const void* from, size_t num) const = 0;
105 virtual void do_splat(void* dest, const void* item, size_t num) const = 0;
106 virtual void do_move_forward(void* dest, const void* from, size_t num) const = 0;
107 virtual void do_move_backward(void* dest, const void* from, size_t num) const = 0;
113 inline void _do_construct(void* storage, size_t num) const;
114 inline void _do_destroy(void* storage, size_t num) const;
115 inline void _do_copy(void* dest, const void* from, size_t num) const;
116 inline void _do_splat(void* dest, const void* item, size_t num) const
[all...] |
| /system/core/libpixelflinger/codeflinger/tinyutils/ |
| VectorImpl.h | 95 virtual void do_construct(void* storage, size_t num) const = 0;
96 virtual void do_destroy(void* storage, size_t num) const = 0;
97 virtual void do_copy(void* dest, const void* from, size_t num) const = 0;
98 virtual void do_splat(void* dest, const void* item, size_t num) const = 0;
99 virtual void do_move_forward(void* dest, const void* from, size_t num) const = 0;
100 virtual void do_move_backward(void* dest, const void* from, size_t num) const = 0;
116 inline void _do_construct(void* storage, size_t num) const;
117 inline void _do_destroy(void* storage, size_t num) const;
118 inline void _do_copy(void* dest, const void* from, size_t num) const;
119 inline void _do_splat(void* dest, const void* item, size_t num) const
[all...] |
| /cts/tests/sample/src/android/sample/cts/ |
| SampleDeviceResultTest.java | 82 * @param num The number to compute the factorial of.
84 private static long factorialRecursive(int num) {
85 if (num <= 0) {
88 return num * factorialRecursive(num - 1);
94 * @param num The number to compute the factorial of.
96 private static long factorialIterative(int num) {
98 for (int i = 2; i <= num; i++) {
|
| /external/chromium_org/third_party/boringssl/src/crypto/aes/ |
| mode_wrappers.c | 58 uint8_t ecount_buf[AES_BLOCK_SIZE], unsigned int *num) {
59 CRYPTO_ctr128_encrypt(in, out, len, key, ivec, ecount_buf, num,
98 const AES_KEY *key, uint8_t *ivec, int *num) {
99 CRYPTO_ofb128_encrypt(in, out, length, key, ivec, num,
104 const AES_KEY *key, uint8_t *ivec, int *num,
106 CRYPTO_cfb128_encrypt(in, out, length, key, ivec, num, enc,
|
| /external/chromium_org/third_party/boringssl/src/crypto/bn/asm/ |
| x86-mont.pl | 47 $num="ebx";
60 &mov ("edi",&wparam(5)); # int num
69 &lea ("esp",&DWP(-$frame,"esp","edi",4)); # alloca($frame+4*(num+2))
94 #&mov ("edi",&DWP(5*4,"esi"));# int num
102 &lea ($num,&DWP(-3,"edi")); # num=num-1 to assist modulo-scheduling
103 #&mov ($_num,$num); # redundant as $num is not reused
168 &cmp ($j,$num);
[all...] |
| co-586.pl | 107 local($name,$num)=@_;
124 $tot=$num+$num-1;
163 $na=$as+($i < ($num-1));
164 $nb=$bs+($i >= ($num-1));
178 $as++ if ($i < ($num-1));
179 $ae++ if ($i >= ($num-1));
181 $bs++ if ($i >= ($num-1));
182 $be++ if ($i < ($num-1));
198 local($name,$num)=@_
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/db/ |
| version_edit.h | 39 void SetLogNumber(uint64_t num) {
41 log_number_ = num;
43 void SetPrevLogNumber(uint64_t num) {
45 prev_log_number_ = num;
47 void SetNextFile(uint64_t num) {
49 next_file_number_ = num;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/ |
| sp_state_sampler.c | 70 * Bind a range [start, start+num-1] of samplers for a shader stage.
76 unsigned num,
83 assert(start + num <= Elements(softpipe->samplers[shader]));
86 if (start + num <= softpipe->num_samplers[shader] &&
88 num * sizeof(void *))) {
95 for (i = 0; i < num; i++) {
101 unsigned j = MAX2(softpipe->num_samplers[shader], start + num);
121 unsigned num, void **samplers)
123 softpipe_bind_sampler_states(pipe, PIPE_SHADER_FRAGMENT, 0, num, samplers);
129 unsigned num,
[all...] |
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| sp_state_sampler.c | 70 * Bind a range [start, start+num-1] of samplers for a shader stage.
76 unsigned num,
83 assert(start + num <= Elements(softpipe->samplers[shader]));
86 if (start + num <= softpipe->num_samplers[shader] &&
88 num * sizeof(void *))) {
95 for (i = 0; i < num; i++) {
101 unsigned j = MAX2(softpipe->num_samplers[shader], start + num);
121 unsigned num, void **samplers)
123 softpipe_bind_sampler_states(pipe, PIPE_SHADER_FRAGMENT, 0, num, samplers);
129 unsigned num,
[all...] |
| /development/perftests/panorama/feature_mos/src/mosaic/ |
| CSite.h | 58 inline void setNumNeighbors(int num) { numNeighbors = num; }
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| XNumber.java | 55 * @param num Value of the object
57 public XNumber(Number num)
62 m_val = num.doubleValue();
63 setObject(num);
92 public double num() method in class:XNumber
104 public double num(XPathContext xctxt) method in class:XNumber
214 // BigDecimal num = new BigDecimal(s);
215 // int newScale = num.scale() - (sigDig - PRECISION);
218 // s = num.setScale(newScale, BigDecimal.ROUND_HALF_UP).toString();
292 double num = m_val local
[all...] |
| /external/bison/src/ |
| state.h | 65 num rules. lookahead_tokens is an array of bitsets, one per rule.
113 int num; member in struct:__anon5010
119 TRANSITIONS->states[Num]? Can be a token (amongst which the error
122 #define TRANSITION_SYMBOL(Transitions, Num) \
123 (Transitions->states[Num]->accessing_symbol)
125 /* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */
127 #define TRANSITION_IS_SHIFT(Transitions, Num) \
128 (ISTOKEN (TRANSITION_SYMBOL (Transitions, Num)))
130 /* Is the TRANSITIONS->states[Num] a goto?. */
132 #define TRANSITION_IS_GOTO(Transitions, Num) \
171 int num; member in struct:__anon5011
184 int num; member in struct:__anon5012
[all...] |
| /external/chromium_org/third_party/icu/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/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| memory_pool.h | 52 * and reserved counters to accomodate up to num new element.
66 #define memory_pool_array_reserve(pool, type, array, size, reserved, num) do { \
67 unsigned int _num = (num); \
|
| /external/chromium_org/third_party/webrtc/modules/video_processing/main/source/ |
| video_decimator.cc | 125 int32_t num = 0; local
127 for (num = 1; num < (kFrameCountHistory_size - 1); num++) {
129 if (incoming_frame_times_[num] <= 0 ||
130 now - incoming_frame_times_[num] > kFrameHistoryWindowMs) {
136 if (num > 1) {
137 int64_t diff = now - incoming_frame_times_[num-1];
|
| /external/cmockery/cmockery_0_1_2/src/example/ |
| allocate_module.c | 25 #define calloc(num, size) _test_calloc(num, size, __FILE__, __LINE__)
|
| /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/libcxx/test/localization/locale.categories/category.numeric/locale.nm.put/facet.num.put.virtuals/ |
| Android.mk | 17 test_makefile := external/libcxx/test/localization/locale.categories/category.numeric/locale.nm.put/facet.num.put.virtuals/Android.mk
19 test_name := localization/locale.categories/category.numeric/locale.nm.put/facet.num.put.virtuals/tested_elsewhere
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
| help.h | 13 static inline void mput_char(char c, unsigned int num)
15 while(num--)
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| memory_pool.h | 52 * and reserved counters to accomodate up to num new element.
66 #define memory_pool_array_reserve(pool, type, array, size, reserved, num) do { \
67 unsigned int _num = (num); \
|
| /external/openssl/crypto/bn/asm/ |
| co-586.pl | 107 local($name,$num)=@_;
124 $tot=$num+$num-1;
163 $na=$as+($i < ($num-1));
164 $nb=$bs+($i >= ($num-1));
178 $as++ if ($i < ($num-1));
179 $ae++ if ($i >= ($num-1));
181 $bs++ if ($i >= ($num-1));
182 $be++ if ($i < ($num-1));
198 local($name,$num)=@_
[all...] |
| /external/openssl/crypto/bn/asm/x86/ |
| comba.pl | 95 local($name,$num)=@_;
112 $tot=$num+$num-1;
151 $na=$as+($i < ($num-1));
152 $nb=$bs+($i >= ($num-1));
166 $as++ if ($i < ($num-1));
167 $ae++ if ($i >= ($num-1));
169 $bs++ if ($i >= ($num-1));
170 $be++ if ($i < ($num-1));
186 local($name,$num)=@_
[all...] |
| /external/openssl/crypto/lhash/ |
| lh_stats.c | 102 unsigned int i,num; local
106 for (n=lh->b[i],num=0; n != NULL; n=n->next)
107 num++;
108 fprintf(out,"node %6u -> %3u\n",i,num);
115 unsigned long num; local
121 for (n=lh->b[i],num=0; n != NULL; n=n->next)
122 num++;
123 if (num != 0)
126 total+=num;
211 unsigned int i,num; local
224 unsigned long num; local
[all...] |
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/res/ |
| PluralResourceLoader.java | 63 if (p.num == quantity) return p;
66 if (p.num == -1) return p;
78 final int num; field in class:PluralResourceLoader.Plural
84 num = 0;
86 num = 1;
88 num = 2;
90 num = -1;
92 num = -1;
|
