Searched refs:size (Results 1 - 25 of 99) sorted by relevance

1234

/bionic/libc/kernel/common/asm-generic/bitops/
H A Dfind.h15 #define find_first_bit(addr, size) find_next_bit((addr), (size), 0)
16 #define find_first_zero_bit(addr, size) find_next_zero_bit((addr), (size), 0)
H A Dle.h33 #define generic_find_next_zero_le_bit(addr, size, offset) find_next_zero_bit(addr, size, offset)
51 #define generic_find_first_zero_le_bit(addr, size) generic_find_next_zero_le_bit((addr), (size), 0)
/bionic/libc/include/
H A Dalloca.h31 #define alloca(size) __builtin_alloca(size)
/bionic/libc/kernel/common/linux/
H A Dcirc_buf.h21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)
[all...]
H A Dxattr.h38 size_t size);
40 size_t size, int flags);
H A Dvmalloc.h32 unsigned long size; member in struct:vm_struct
/bionic/libc/unistd/
H A Dgetcwd.c30 extern int __getcwd(char * buf, size_t size);
32 char *getcwd(char *buf, size_t size) argument
34 return ( __getcwd(buf, size) < 0 ) ? NULL : buf;
H A Dmmap.c35 void* mmap( void* addr, size_t size, int prot, int flags, int fd, long offset ) argument
42 return __mmap2(addr, size, prot, flags, fd, (size_t)offset >> MMAP2_SHIFT);
/bionic/libstdc++/src/
H A Dnew.cpp6 void* operator new(std::size_t size) argument
8 void* p = malloc(size);
15 void* operator new[](std::size_t size) argument
17 void* p = malloc(size);
34 void* operator new(std::size_t size, const std::nothrow_t&) argument
36 return malloc(size);
39 void* operator new[](std::size_t size, const std::nothrow_t&) argument
41 return malloc(size);
/bionic/libc/kernel/common/asm-generic/
H A Dioctl.h34 #define _IOC(dir,type,nr,size) (((dir) << _IOC_DIRSHIFT) | ((type) << _IOC_TYPESHIFT) | ((nr) << _IOC_NRSHIFT) | ((size) << _IOC_SIZESHIFT))
40 #define _IOR(type,nr,size) _IOC(_IOC_READ,(type),(nr),(_IOC_TYPECHECK(size)))
41 #define _IOW(type,nr,size) _IOC(_IOC_WRITE,(type),(nr),(_IOC_TYPECHECK(size)))
42 #define _IOWR(type,nr,size) _IOC(_IOC_READ|_IOC_WRITE,(type),(nr),(_IOC_TYPECHECK(size)))
43 #define _IOR_BAD(type,nr,size) _IOC(_IOC_READ,(type),(nr),sizeof(size))
[all...]
/bionic/libc/netbsd/resolv/
H A Dres_debug.h25 # define DprintQ(cond, args, query, size) /*empty*/
30 # define DprintQ(cond, args, query, size) if (cond) {\
32 res_pquery(statp, query, size, stdout);\
/bionic/libc/stdio/
H A Dfwrite.c39 * Write `count' objects (each size `size') from memory to the given file.
43 fwrite(const void *buf, size_t size, size_t count, FILE *fp) argument
50 uio.uio_resid = iov.iov_len = n = count * size;
57 * generally slow and since this occurs whenever size==0.
61 return ((n - uio.uio_resid) / size);
H A Dsetvbuf.c43 setvbuf(FILE *fp, char *buf, int mode, size_t size) argument
50 * Verify arguments. The `int' limit on `size' is due to this
51 * particular implementation. Note, buf and size are ignored
55 if ((mode != _IOFBF && mode != _IOLBF) || (int)size < 0)
80 * Find optimal I/O size for seek optimization. This also returns
85 if (size == 0) {
87 size = iosize;
92 if ((buf = malloc(size)) == NULL) {
95 * failure, but try again with file system size.
98 if (size !
[all...]
H A Dsetbuffer.c37 setbuffer(FILE *fp, char *buf, int size) argument
40 (void)setvbuf(fp, buf, buf ? _IOFBF : _IONBF, size);
H A Dmakebuf.c46 * optimisation) right after the fstat() that finds the buffer size.
53 size_t size; local
61 flags = __swhatbuf(fp, &size, &couldbetty);
62 if ((p = malloc(size)) == NULL) {
71 fp->_bf._size = size;
/bionic/libc/stdlib/
H A Dbsearch.c49 bsearch(const void *key, const void *base0, size_t nmemb, size_t size, argument
57 p = base + (lim >> 1) * size;
60 base = (char *)p + size;
/bionic/libc/kernel/arch-sh/asm/
H A Duaccess_64.h15 #define __get_user_size(x,ptr,size,retval) do { retval = 0; switch (size) { case 1: retval = __get_user_asm_b(x, ptr); break; case 2: retval = __get_user_asm_w(x, ptr); break; case 4: retval = __get_user_asm_l(x, ptr); break; case 8: retval = __get_user_asm_q(x, ptr); break; default: __get_user_unknown(); break; } } while (0)
17 #define __put_user_size(x,ptr,size,retval) do { retval = 0; switch (size) { case 1: retval = __put_user_asm_b(x, ptr); break; case 2: retval = __put_user_asm_w(x, ptr); break; case 4: retval = __put_user_asm_l(x, ptr); break; case 8: retval = __put_user_asm_q(x, ptr); break; default: __put_user_unknown(); } } while (0)
H A Duaccess.h24 #define __access_ok(addr, size) (__addr_ok((addr) + (size)))
25 #define access_ok(type, addr, size) (__chk_user_ptr(addr), __access_ok((unsigned long __force)(addr), (size)))
36 #define __get_user_nocheck(x,ptr,size) ({ long __gu_err; unsigned long __gu_val; const __typeof__(*(ptr)) __user *__gu_addr = (ptr); __chk_user_ptr(ptr); __get_user_size(__gu_val, __gu_addr, (size), __gu_err); (x) = (__typeof__(*(ptr)))__gu_val; __gu_err; })
38 #define __get_user_check(x,ptr,size) ({ long __gu_err = -EFAULT; unsigned long __gu_val = 0; const __typeof__(*(ptr)) *__gu_addr = (ptr); if (likely(access_ok(VERIFY_READ, __gu_addr, (size)))) __get_user_size(__gu_val, __gu_addr, (size), __gu_err); (x) = (__typeof__(*(ptr)))__gu_val; __gu_err; })
40 #define __put_user_nocheck(x,ptr,size) ({ lon
[all...]
H A Dio_trapped.h32 #define __ioremap_trapped(offset, size) NULL
33 #define __ioport_map_trapped(offset, size) NULL
H A Duaccess_32.h15 #define __get_user_size(x,ptr,size,retval) do { retval = 0; switch (size) { case 1: __get_user_asm(x, ptr, retval, "b"); break; case 2: __get_user_asm(x, ptr, retval, "w"); break; case 4: __get_user_asm(x, ptr, retval, "l"); break; default: __get_user_unknown(); break; } } while (0)
19 #define __put_user_size(x,ptr,size,retval) do { retval = 0; switch (size) { case 1: __put_user_asm(x, ptr, retval, "b"); break; case 2: __put_user_asm(x, ptr, retval, "w"); break; case 4: __put_user_asm(x, ptr, retval, "l"); break; case 8: __put_user_u64(x, ptr, retval); break; default: __put_user_unknown(); } } while (0)
/bionic/libc/kernel/arch-x86/asm/
H A Dmmu.h20 int size; member in struct:__anon161
H A De820.h26 __u64 size; member in struct:e820entry
/bionic/libc/inet/
H A Dinet_ntop.c34 static const char *inet_ntop4(const u_char *src, char *dst, size_t size);
35 static const char *inet_ntop6(const u_char *src, char *dst, size_t size);
38 * inet_ntop(af, src, dst, size)
46 inet_ntop(int af, const void *src, char *dst, size_t size) argument
50 return (inet_ntop4(src, dst, size));
52 return (inet_ntop6(src, dst, size));
61 * inet_ntop4(src, dst, size)
72 inet_ntop4(const u_char *src, char *dst, size_t size) argument
78 l = snprintf(tmp, size, fmt, src[0], src[1], src[2], src[3]);
79 if (l <= 0 || (size_t)l >= size) {
94 inet_ntop6(const u_char *src, char *dst, size_t size) argument
[all...]
/bionic/linker/
H A Dba.h34 unsigned order:7; /* size of the region in ba space */
40 /* total size of the ba space */
41 unsigned long size; member in struct:ba
/bionic/libc/bionic/
H A Dmalloc_debug_leak.c111 intptr_t* backtrace, size_t numEntries, size_t size)
118 * See if the entry matches exactly. We compare the "size" field,
121 if (entry->size == size && entry->numEntries == numEntries &&
132 static HashEntry* record_backtrace(intptr_t* backtrace, size_t numEntries, size_t size) argument
137 if (size & SIZE_FLAG_MASK) {
138 debug_log("malloc_debug: allocation %zx exceeds bit width\n", size);
143 size |= SIZE_FLAG_ZYGOTE_CHILD;
145 HashEntry* entry = find_entry(&gHashTable, slot, backtrace, numEntries, size);
159 entry->size
110 find_entry(HashTable* table, int slot, intptr_t* backtrace, size_t numEntries, size_t size) argument
389 size_t size; local
402 size_t size; local
478 size_t size = (bytes < old_size)?(bytes):(old_size); local
567 size_t size; local
617 size_t size = (alignment-MALLOC_ALIGNMENT) + bytes; local
[all...]

Completed in 482 milliseconds

1234