HomeSort by relevance Sort by last modified time
    Searched refs:num (Results 101 - 125 of 1048) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/openssl/crypto/aes/
aes_ctr.c 104 * 128bit block we have used is contained in *num, and the
105 * encrypted counter is kept in ecount_buf. Both *num and
119 unsigned int *num) {
124 assert(in && out && key && counter && num);
125 assert(*num < AES_BLOCK_SIZE);
127 n = *num;
138 *num=n;
  /external/openssl/crypto/camellia/
camellia.h 110 unsigned char *ivec, int *num, const int enc);
113 unsigned char *ivec, int *num, const int enc);
116 unsigned char *ivec, int *num, const int enc);
122 unsigned char *ivec, int *num);
127 unsigned int *num);
cmll_ctr.c 104 * 128bit block we have used is contained in *num, and the
105 * encrypted counter is kept in ecount_buf. Both *num and
119 unsigned int *num)
125 assert(in && out && key && counter && num);
126 assert(*num < CAMELLIA_BLOCK_SIZE);
128 n = *num;
141 *num=n;
  /external/openssl/crypto/des/
ofb64ede.c 63 * 64bit block we have used is contained in *num;
69 int *num)
72 register int n= *num;
115 *num=n;
121 DES_key_schedule k2, DES_cblock (*ivec), int *num)
123 DES_ede3_ofb64_encrypt(in, out, length, k1,k2,k1, ivec, num);
  /external/openssl/crypto/bio/
bss_bio.c 99 static int bio_write(BIO *bio, const char *buf, int num);
100 static long bio_ctrl(BIO *bio, int cmd, long num, void *ptr);
283 ssize_t num; local
307 num = peer_b->len;
308 if (peer_b->size < peer_b->offset + num)
310 num = peer_b->size - peer_b->offset;
311 assert(num > 0);
315 return num;
321 ssize_t num, available; local
324 num = SSIZE_MAX
354 size_t num = num_; local
434 size_t num; local
482 ssize_t num, space; local
    [all...]
bss_sock.c 74 static int sock_write(BIO *h, const char *buf, int num);
114 bi->num=0;
127 SHUTDOWN2(a->num);
142 ret=readsocket(b->num,out,outl);
158 ret=writesocket(b->num,in,inl);
168 static long sock_ctrl(BIO *b, int cmd, long num, void *ptr)
176 num=0;
186 b->num= *((int *)ptr);
187 b->shutdown=(int)num;
194 if (ip != NULL) *ip=b->num;
    [all...]
bf_lbuf.c 65 static int linebuffer_write(BIO *h, const char *buf,int num);
150 int i,num=0,foundnl; local
189 num += p - in;
199 num += i;
216 if (i < 0) return((num > 0)?num:i);
217 if (i == 0) return(num);
242 if (i < 0) return((num > 0)?num:i);
243 if (i == 0) return(num);
    [all...]
bss_file.c 98 static int MS_CALLBACK file_write(BIO *h, const char *buf, int num);
165 bi->num=0;
230 static long MS_CALLBACK file_ctrl(BIO *b, int cmd, long num, void *ptr)
242 ret=(long)UP_fseek(b->ptr,num,0);
244 ret=(long)fseek(fp,num,0);
261 b->shutdown=(int)num&BIO_CLOSE;
277 UP_fsetmode(b->ptr,num&BIO_FP_TEXT?'t':'b');
283 if (num & BIO_FP_TEXT)
291 if (num & BIO_FP_TEXT)
298 if (num & BIO_FP_TEXT
    [all...]
  /external/openssl/crypto/bn/
bnspeed.c 187 long num; local
191 num=BASENUM;
192 if (i) num/=(i*3);
198 for (k=0; k<num; k++)
201 printf("mul %4d x %4d -> %8.3fms\n",sizes[i],sizes[j],tm*1000.0/num);
207 num=BASENUM;
208 if (i) num/=(i*3);
211 for (k=0; k<num; k++)
214 printf("sqr %4d x %4d -> %8.3fms\n",sizes[i],sizes[i],tm*1000.0/num);
219 num=BASENUM/10
    [all...]
  /frameworks/base/include/utils/
VectorImpl.h 99 virtual void do_construct(void* storage, size_t num) const = 0;
100 virtual void do_destroy(void* storage, size_t num) const = 0;
101 virtual void do_copy(void* dest, const void* from, size_t num) const = 0;
102 virtual void do_splat(void* dest, const void* item, size_t num) const = 0;
103 virtual void do_move_forward(void* dest, const void* from, size_t num) const = 0;
104 virtual void do_move_backward(void* dest, const void* from, size_t num) const = 0;
120 inline void _do_construct(void* storage, size_t num) const;
121 inline void _do_destroy(void* storage, size_t num) const;
122 inline void _do_copy(void* dest, const void* from, size_t num) const;
123 inline void _do_splat(void* dest, const void* item, size_t num) const
    [all...]
SortedVector.h 125 virtual void do_construct(void* storage, size_t num) const;
126 virtual void do_destroy(void* storage, size_t num) const;
127 virtual void do_copy(void* dest, const void* from, size_t num) const;
128 virtual void do_splat(void* dest, const void* item, size_t num) const;
129 virtual void do_move_forward(void* dest, const void* from, size_t num) const;
130 virtual void do_move_backward(void* dest, const void* from, size_t num) const;
242 void SortedVector<TYPE>::do_construct(void* storage, size_t num) const {
243 construct_type( reinterpret_cast<TYPE*>(storage), num );
247 void SortedVector<TYPE>::do_destroy(void* storage, size_t num) const {
248 destroy_type( reinterpret_cast<TYPE*>(storage), num );
    [all...]
  /system/core/libpixelflinger/tinyutils/
VectorImpl.h 86 virtual void do_construct(void* storage, size_t num) const = 0;
87 virtual void do_destroy(void* storage, size_t num) const = 0;
88 virtual void do_copy(void* dest, const void* from, size_t num) const = 0;
89 virtual void do_splat(void* dest, const void* item, size_t num) const = 0;
90 virtual void do_move_forward(void* dest, const void* from, size_t num) const = 0;
91 virtual void do_move_backward(void* dest, const void* from, size_t num) const = 0;
107 inline void _do_construct(void* storage, size_t num) const;
108 inline void _do_destroy(void* storage, size_t num) const;
109 inline void _do_copy(void* dest, const void* from, size_t num) const;
110 inline void _do_splat(void* dest, const void* item, size_t num) const
    [all...]
SortedVector.h 125 virtual void do_construct(void* storage, size_t num) const;
126 virtual void do_destroy(void* storage, size_t num) const;
127 virtual void do_copy(void* dest, const void* from, size_t num) const;
128 virtual void do_splat(void* dest, const void* item, size_t num) const;
129 virtual void do_move_forward(void* dest, const void* from, size_t num) const;
130 virtual void do_move_backward(void* dest, const void* from, size_t num) const;
243 void SortedVector<TYPE>::do_construct(void* storage, size_t num) const {
244 construct_type( reinterpret_cast<TYPE*>(storage), num );
248 void SortedVector<TYPE>::do_destroy(void* storage, size_t num) const {
249 destroy_type( reinterpret_cast<TYPE*>(storage), num );
    [all...]
  /external/bluetooth/hcidump/parser/
parser.c 195 fr->num = frm->num;
252 void ascii_dump(int level, struct frame *frm, int num)
257 if ((num < 0) || (num > frm->len))
258 num = frm->len;
260 for (i = 0, n = 1; i < num; i++, n++) {
273 void hex_dump(int level, struct frame *frm, int num)
278 if ((num < 0) || (num > frm->len)
    [all...]
  /external/quake/quake/src/QW/client/
pmovetst.c 93 int PM_HullPointContents (hull_t *hull, int num, vec3_t p)
99 while (num >= 0)
101 if (num < hull->firstclipnode || num > hull->lastclipnode)
104 node = hull->clipnodes + num;
112 num = node->children[1];
114 num = node->children[0];
117 return num;
132 int num; local
136 num = hull->firstclipnode;
    [all...]
  /dalvik/libcore/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 116 int num; member in struct:__anon836
122 TRANSITIONS->states[Num]? Can be a token (amongst which the error
125 #define TRANSITION_SYMBOL(Transitions, Num) \
126 (Transitions->states[Num]->accessing_symbol)
128 /* Is the TRANSITIONS->states[Num] a shift? (as opposed to gotos). */
130 #define TRANSITION_IS_SHIFT(Transitions, Num) \
131 (ISTOKEN (TRANSITION_SYMBOL (Transitions, Num)))
133 /* Is the TRANSITIONS->states[Num] a goto?. */
135 #define TRANSITION_IS_GOTO(Transitions, Num) \
136 (!TRANSITION_IS_SHIFT (Transitions, Num))
174 int num; member in struct:__anon837
187 int num; member in struct:__anon838
    [all...]
  /external/openssl/crypto/bn/asm/
co-586.pl 106 local($name,$num)=@_;
123 $tot=$num+$num-1;
162 $na=$as+($i < ($num-1));
163 $nb=$bs+($i >= ($num-1));
177 $as++ if ($i < ($num-1));
178 $ae++ if ($i >= ($num-1));
180 $bs++ if ($i >= ($num-1));
181 $be++ if ($i < ($num-1));
197 local($name,$num)=@_
    [all...]
mo-586.pl 59 $num="ebx";
72 &mov ("edi",&wparam(5)); # int num
81 &lea ("esp",&DWP(-$frame,"esp","edi",4)); # alloca($frame+4*(num+2))
106 #&mov ("edi",&DWP(5*4,"esi"));# int num
114 &lea ($num,&DWP(-3,"edi")); # num=num-1 to assist modulo-scheduling
115 #&mov ($_num,$num); # redundant as $num is not reused
180 &cmp ($j,$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/openssl/crypto/rand/
rand_lib.c 209 void RAND_seed(const void *buf, int num)
213 meth->seed(buf,num);
216 void RAND_add(const void *buf, int num, double entropy)
220 meth->add(buf,num,entropy);
223 int RAND_bytes(unsigned char *buf, int num)
227 return meth->bytes(buf,num);
231 int RAND_pseudo_bytes(unsigned char *buf, int num)
235 return meth->pseudorand(buf,num);
  /external/webkit/JavaScriptCore/tests/mozilla/ecma/TypeConversion/
9.7.js 61 function ToInt16( num ) {
62 num = Number( num );
63 if ( isNaN( num ) || num == 0 || num == Number.POSITIVE_INFINITY || num == Number.NEGATIVE_INFINITY ) {
67 var sign = ( num < 0 ) ? -1 : 1;
69 num = sign * Math.floor( Math.abs( num ) );
    [all...]
  /sdk/traceview/src/com/android/traceview/
ThreadData.java 91 Integer num = mStackMethods.get(md); local
92 if (num == null) {
93 num = 0;
94 } else if (num > 0) {
97 num += 1;
98 mStackMethods.put(md, num);
143 Integer num = mStackMethods.get(md); local
144 if (num != null) {
145 num -= 1;
146 if (num <= 0)
    [all...]
  /external/openssl/crypto/evp/
encode.c 127 ctx->num=0;
140 if ((ctx->num+inl) < ctx->length)
142 memcpy(&(ctx->enc_data[ctx->num]),in,inl);
143 ctx->num+=inl;
146 if (ctx->num != 0)
148 i=ctx->length-ctx->num;
149 memcpy(&(ctx->enc_data[ctx->num]),in,i);
153 ctx->num=0;
171 ctx->num=inl;
179 if (ctx->num != 0
419 int i,num=0,bad=0; local
    [all...]

Completed in 576 milliseconds

1 2 3 45 6 7 8 91011>>