Searched defs:size (Results 101 - 125 of 3991) sorted by relevance

1234567891011>>

/external/chromium/webkit/glue/
H A Dwebthemeengine_impl_mac.cc32 WebThemeEngine::Size size,
37 trackInfo.kind = size == WebThemeEngine::SizeRegular ?
29 paintScrollbarThumb( WebCanvas* canvas, WebThemeEngine::State state, WebThemeEngine::Size size, const WebRect& rect, const WebThemeEngine::ScrollbarInfo& scrollbarInfo) argument
/external/clang/test/Analysis/
H A Dpr_4164.c11 // The basic issue is that the VarRegion for 'size' is casted to (char*),
21 int size; local
22 socklen_t size_len = sizeof(size);
23 if (getsockopt(s, 0xffff, 0x1001, (char *)&size, &size_len) < 0)
26 return size; // no-warning
36 int size; local
37 if (takes_charptr((char*)&size))
39 return size; // no-warning
/external/clang/test/CodeGenCXX/
H A Dpredefined-expr-sizeof.cpp3 // CHECK: store i32 59, i32* %size
4 // CHECK: store i32 65, i32* %size
9 int size = sizeof(__PRETTY_FUNCTION__); local
13 // CHECK: store i32 35, i32* %size
14 // CHECK: store i32 38, i32* %size
17 int size = sizeof(__PRETTY_FUNCTION__); local
/external/clang/test/Sema/
H A Dattr-noreturn.c34 f5 (unsigned long size) argument
/external/compiler-rt/lib/asan/
H A Dasan_interface_internal.h34 uptr size; // The original size of the global. member in struct:__asan_global
35 uptr size_with_redzone; // The size with the redzone.
57 // use-after-return mode. __asan_stack_malloc allocates size bytes of
60 uptr __asan_stack_malloc(uptr size, uptr real_stack)
62 void __asan_stack_free(uptr ptr, uptr size, uptr real_stack)
69 void __asan_poison_stack_memory(uptr addr, uptr size)
71 void __asan_unpoison_stack_memory(uptr addr, uptr size)
78 void __asan_poison_memory_region(void const volatile *addr, uptr size)
80 void __asan_unpoison_memory_region(void const volatile *addr, uptr size)
[all...]
/external/compiler-rt/lib/asan/lit_tests/Linux/
H A Dmalloc-in-qsort.cc23 void MyQsort(char *a, size_t size) { argument
25 qsort(a, size, sizeof(char), QsortCallback);
H A Doverflow-in-qsort.cc24 void MyQsort(char *a, size_t size) { argument
26 qsort(a, size, sizeof(char), QsortCallback);
/external/dropbear/
H A Dcircbuffer.h29 unsigned int size; member in struct:circbuf
38 circbuffer * cbuf_new(unsigned int size);
H A Dgenrsa.c37 mp_int* rsa_e, unsigned int size);
40 rsa_key * gen_rsa_priv_key(unsigned int size) { argument
67 getrsaprime(key->p, &pminus, key->e, size/2);
69 getrsaprime(key->q, &qminus, key->e, size/2);
97 mp_int* rsa_e, unsigned int size) {
102 buf = (unsigned char*)m_malloc(size+1);
108 genrandom(buf, size+1);
111 bytes_to_mp(prime, buf, size+1);
133 m_burn(buf, size+1);
96 getrsaprime(mp_int* prime, mp_int *primeminus, mp_int* rsa_e, unsigned int size) argument
/external/dropbear/libtomcrypt/src/pk/asn1/der/choice/
H A Dder_decode_choice.c23 @param inlen [in/out] The size of the input and resulting size of read type
31 unsigned long size, x, z; local
38 /* get blk size */
50 size = list[x].size;
66 if (der_length_short_integer(size, &z) == CRYPT_OK) {
75 if (der_decode_bit_string(in, *inlen, data, &size) == CRYPT_OK) {
76 if (der_length_bit_string(size, &z) == CRYPT_OK) {
78 list[x].size
[all...]
/external/dropbear/libtomcrypt/src/pk/asn1/der/sequence/
H A Dder_decode_sequence_multi.c26 @remark <...> is of the form <type, size, data> (int, unsigned long, void*)
32 unsigned long size, x; local
39 /* get size of output that will be required */
44 size = va_arg(args, unsigned long);
92 size = va_arg(args, unsigned long);
116 list[x].size = size;
H A Dder_encode_sequence_multi.c26 @remark <...> is of the form <type, size, data> (int, unsigned long, void*)
32 unsigned long size, x; local
40 /* get size of output that will be required */
45 size = va_arg(args, unsigned long);
92 size = va_arg(args, unsigned long);
115 list[x].size = size;
/external/dropbear/libtomcrypt/src/pk/katja/
H A Dkatja_make_key.c24 @param size The size of the modulus (key size) desired (octets)
28 int katja_make_key(prng_state *prng, int wprng, int size, katja_key *key) argument
36 if ((size < (MIN_KAT_SIZE/8)) || (size > (MAX_KAT_SIZE/8))) {
48 /* divide size by three */
49 size = (((size << 3) / 3) + 7) >> 3;
51 /* make prime "q" (we negate size t
[all...]
/external/dropbear/libtommath/
H A Dbn_mp_radix_size.c18 /* returns size of ASCII reprensentation */
19 int mp_radix_size (mp_int * a, int radix, int *size) argument
25 *size = 0;
29 *size = mp_count_bits (a) + (a->sign == MP_NEG ? 1 : 0) + 1;
39 *size = 2;
70 *size = digs + 1;
/external/e2fsprogs/lib/ss/
H A Dinvocation.c18 #define size sizeof(ss_data *) macro
39 table = (ss_data **) malloc(2 * size);
47 ((unsigned)sci_idx+2)*size);
H A Drequest_tbl.c29 register int i, size; local
33 for (size=0; info->rqt_tables[size] != (ssrt *)NULL; size++)
35 /* size == C subscript of NULL == #elements */
36 size += 2; /* new element, and NULL */
37 t = (ssrt **)realloc(info->rqt_tables, (unsigned)size*sizeof(ssrt));
43 if (position > size - 2)
44 position = size - 2;
46 if (size >
[all...]
/external/e2fsprogs/misc/
H A Dpartinfo.c23 #define BLKGETSIZE _IO(0x12,96) /* return device size */
30 unsigned long size; local
62 if (ioctl(fd, BLKGETSIZE, &size) < 0) {
63 fprintf(stderr, _("Cannot get size of %s: %s"),
69 printf(_("%s: h=%3d s=%3d c=%4d start=%8d size=%8lu end=%8d\n"),
72 (int)loc.start, size, (int) loc.start + size -1); local
/external/eigen/bench/btl/generic_bench/init/
H A Dinit_matrix.hh28 BTL_DONT_INLINE void init_row(Vector & X, int size, int row){ argument
30 X.resize(size);
32 for (int j=0;j<X.size();j++){
43 BTL_DONT_INLINE void init_matrix(Vector & A, int size){ argument
44 A.resize(size);
45 for (int row=0; row<A.size() ; row++){
46 init_row<init_function>(A[row],size,row);
51 BTL_DONT_INLINE void init_matrix_symm(Matrix& A, int size){ argument
52 A.resize(size);
53 for (int row=0; row<A.size() ; ro
[all...]
/external/eigen/bench/btl/generic_bench/timers/
H A Dmixed_perf_analyzer.hh46 inline double eval_mflops(int size) argument
51 result=_ppa.eval_mflops(size);
55 result=_x86pa.eval_mflops(size);
/external/eigen/test/
H A Dconservative_resize.cpp79 const int size = internal::random<int>(1,50); local
81 m.conservativeResize(size);
82 VERIFY_IS_APPROX(m, n.segment(0,size));
88 const int size = internal::random<int>(50,100); local
90 m.conservativeResizeLike(MatrixType::Zero(size));
92 VERIFY( size<=50 || m.segment(50,size-50).sum() == Scalar(0) );
H A Ddeterminant.cpp20 Index size = m.rows(); local
22 MatrixType m1(size, size), m2(size, size);
27 VERIFY_IS_APPROX(MatrixType::Identity(size, size).determinant(), Scalar(1));
29 if(size==1) return;
30 Index i = internal::random<Index>(0, size-1);
33 j = internal::random<Index>(0, size
[all...]
H A Dproduct_mmtr.cpp20 template<typename Scalar> void mmtr(int size) argument
29 MatrixColMaj matc(size, size);
30 MatrixRowMaj matr(size, size);
31 MatrixColMaj ref1(size, size), ref2(size, size);
33 MatrixColMaj soc(size,othersiz
[all...]
H A Dproduct_trsolve.cpp30 template<typename Scalar,int Size, int Cols> void trsolve(int size=Size,int cols=Cols) argument
34 Matrix<Scalar,Size,Size,ColMajor> cmLhs(size,size);
35 Matrix<Scalar,Size,Size,RowMajor> rmLhs(size,size);
39 Matrix<Scalar,Size,Cols,colmajor> cmRhs(size,cols);
40 Matrix<Scalar,Size,Cols,rowmajor> rmRhs(size,cols);
41 Matrix<Scalar,Dynamic,Dynamic,colmajor> ref(size,cols);
/external/eigen/test/eigen2/
H A Deigen2_determinant.cpp19 int size = m.rows(); local
21 MatrixType m1(size, size), m2(size, size);
26 VERIFY_IS_APPROX(MatrixType::Identity(size, size).determinant(), Scalar(1));
28 if(size==1) return;
29 int i = ei_random<int>(0, size-1);
32 j = ei_random<int>(0, size
[all...]
/external/elfutils/libelf/
H A Delf_update.c64 write_file (Elf *elf, off_t size, int change_bo, size_t shnum) argument
76 /* Adjust the size in any case. We do this even if we use `write'.
83 || (size_t) size > elf->maximum_size)
84 && unlikely (ftruncate (elf->fildes, size) != 0))
96 elf->map_address = mmap (NULL, size, PROT_READ | PROT_WRITE,
110 size = -1;
119 size = -1;
122 if (size != -1
125 && (size_t) size < elf->maximum_size
126 && unlikely (ftruncate (elf->fildes, size) !
157 off_t size; local
[all...]

Completed in 5340 milliseconds

1234567891011>>