/barrelfish-master/lib/libc/gen/ |
H A D | getdomainname.c | 45 size_t size; local 49 size = namelen; 50 if (sysctl(mib, 2, name, &size, NULL, 0) == -1)
|
H A D | getosreldate.c | 46 size_t size; local 57 size = sizeof value; 58 if (sysctl(mib, 2, &value, &size, NULL, 0) == -1)
|
/barrelfish-master/lib/libc/stdlib/ |
H A D | reallocf.c | 33 reallocf(void *ptr, size_t size) argument 37 nptr = realloc(ptr, size); 42 * So, to avoid double free, call free() only when size != 0. 45 if (!nptr && ptr && size != 0)
|
/barrelfish-master/lib/posixcompat/ |
H A D | getgroups.c | 15 int getgroups(int size, gid_t grouplist[]) argument 21 int setgroups(int size, const gid_t grouplist[]) argument 23 POSIXCOMPAT_DEBUG("Warning: setgroups(%d, ...) ignored\n", size);
|
/barrelfish-master/lib/storage/ |
H A D | vsa.c | 15 errval_t storage_vsa_alloc(struct storage_vsa *vsa, size_t size) argument 20 vsa->size = size;
|
/barrelfish-master/usr/gups/ |
H A D | bench.sh | 19 for size in 32G; do 23 echo "Running size $size" 30 sudo taskset --cpu-list 1 chrt 99 numactl -m 0 ./$p $size 2M 1 35 #sudo ./$p $size 2M 5
|
/barrelfish-master/lib/devif/backends/net/mlx4/include/linux/ |
H A D | slab.h | 42 #define kmalloc(size, flags) malloc((size), M_KMALLOC, (flags)) 43 #define kvmalloc(size) kmalloc((size), 0) 44 #define kzalloc(size, flags) kmalloc((size), (flags) | M_ZERO) 45 #define kzalloc_node(size, flags, node) kzalloc(size, flags) 47 #define krealloc(ptr, size, flags) realloc((ptr), (size), M_KMALLO 63 kmem_ctor(void *mem, int size, void *arg, int flags) argument 74 kmem_cache_create(char *name, size_t size, size_t align, u_long flags, void (*ctor)(void *)) argument [all...] |
H A D | mm.h | 36 /** align value \a l to \a size (ceil) */ 53 * needed for size bytes. 57 static inline int get_order(unsigned long size) { argument 60 size = (size - 1) >> PAGE_SHIFT; 62 while (size) { 64 size >>= 1; 80 unsigned long addr, unsigned long pfn, unsigned long size, 85 vma->vm_len = size;
|
H A D | bitops.h | 93 unsigned long size) { 97 for (bit = 0; size >= BITS_PER_LONG; size -= BITS_PER_LONG, bit += 103 if (size) { 104 mask = (*addr) & BIT_MASK(size); 108 bit += size; 114 unsigned long size) { 118 for (bit = 0; size >= BITS_PER_LONG; size -= BITS_PER_LONG, bit += 124 if (size) { 92 find_first_bit(unsigned long *addr, unsigned long size) argument 113 find_first_zero_bit(unsigned long *addr, unsigned long size) argument 160 find_next_bit(unsigned long *addr, unsigned long size, unsigned long offset) argument 198 find_next_zero_bit(unsigned long *addr, unsigned long size, unsigned long offset) argument 236 bitmap_zero(unsigned long *addr, int size) argument 243 bitmap_fill(unsigned long *addr, int size) argument 407 const int size = start + nr; local 426 const int size = start + nr; local [all...] |
H A D | io-mapping.h | 38 unsigned long size; member in struct:io_mapping 43 io_mapping_create_wc(resource_size_t base, unsigned long size) 46 return ioremap_wc(base, size);
|
/barrelfish-master/lib/bulk_transfer/backends/net/ |
H A D | stack_allocator.c | 16 void stack_alloc_init(struct stack_allocator *alloc, size_t size) argument 18 alloc->size = size; 20 alloc->stack = calloc(size, sizeof(void *)); 25 if (alloc->top >= alloc->size) {
|
/barrelfish-master/include/ahci/ |
H A D | ahci_dma_pool.h | 17 size_t size; member in struct:ahci_dma_region 22 errval_t ahci_dma_region_alloc(size_t size, struct ahci_dma_region **retregion); 23 errval_t ahci_dma_region_alloc_aligned(size_t size, size_t alignment_requirement, struct ahci_dma_region **retregion); 26 static inline void *ahci_dma_region_copy_in(struct ahci_dma_region *region, const void *buf, genvaddr_t offset, size_t size) { argument 28 return memcpy(dest, buf, size); 30 static inline void *ahci_dma_region_copy_out(struct ahci_dma_region *region, void *buf, genvaddr_t offset, size_t size) { argument 32 return memcpy(buf, src_, size);
|
/barrelfish-master/tools/fastmodels/ |
H A D | config.c | 24 skip_whitespace(const char *buf, size_t size, size_t start, int skip_newlines) { argument 25 assert(start < size); 29 i < size && ((isspace(buf[i]) && buf[i] != '\n') || 34 assert(i <= size); 35 assert(i == size || 42 find_eol(const char *buf, size_t size, size_t start) { argument 43 assert(start < size); 46 for(i= start; i < size && buf[i] != '\n'; i++); 49 assert(i <= size); 50 assert(i == size || bu 55 find_token(const char *buf, size_t size, size_t start, int skip_newlines) argument 79 get_token(const char *buf, size_t size, size_t start) argument 93 get_cmdline(const char *buf, size_t size, size_t *cursor, size_t *cstart, size_t *clen, size_t *astart, size_t *alen) argument 113 parse_config(char *buf, size_t size) argument [all...] |
/barrelfish-master/lib/cxx/cxxabi/demangle/ |
H A D | StringView.h | 40 return StringView(begin() + From, size() - From); 44 size_t FindBegin = std::min(From, size()); 46 if (FindBegin < size()) { 48 if (const void *P = ::memchr(First + FindBegin, C, size() - FindBegin)) 55 if (To >= size()) 56 To = size() - 1; 57 if (From >= size()) 58 From = size() - 1; 63 if (N >= size()) 64 N = size(); 115 size_t size() const { return static_cast<size_t>(Last - First); } function in class:StringView [all...] |
/barrelfish-master/lib/phoenix/ |
H A D | memory.c | 42 void *phoenix_mem_malloc (size_t size) argument 44 void *temp = malloc (size); 50 void *phoenix_mem_malloc_here (size_t size) argument 52 void *temp = malloc (size); 58 void *phoenix_mem_calloc (size_t num, size_t size) argument 60 void *temp = calloc (num, size); 66 void *phoenix_mem_realloc (void *ptr, size_t size) argument 68 void *temp = realloc (ptr, size); 74 void *mem_memcpy (void *dest, const void *src, size_t size) argument 76 return memcpy (dest, src, size); [all...] |
H A D | struct.h | 32 int size; member in struct:_val_t
|
/barrelfish-master/kernel/arch/armv8/ |
H A D | kernel_multiboot2.c | 22 const size_t size) 27 printf("%s: %p:%ld\n", __func__, first_tag, size); 28 while (processed < size) { 42 snprintf(description, sizeof(description), "EFI MMAP: size=%d version=%d", 59 printf("%p:%4ld: tag %d:%d %s\n", first_tag, processed, first_tag->type, first_tag->size, description); 62 processed += first_tag->size; 63 first_tag = (void *)first_tag + first_tag->size; 68 const size_t size, const multiboot_uint16_t type) 72 while (processed < size) { 79 processed += first_tag->size; 21 multiboot2_dump(struct multiboot_tag *first_tag, const size_t size) argument 67 multiboot2_find_tag(struct multiboot_tag *first_tag, const size_t size, const multiboot_uint16_t type) argument 86 multiboot2_find_cmdline( struct multiboot_tag *first_tag, const size_t size) argument 93 multiboot2_find_module_64( struct multiboot_tag *first_tag, const size_t size, const char *pathname) argument [all...] |
/barrelfish-master/lib/libc/stdio/ |
H A D | fwrite.c | 49 * Write `count' objects (each size `size') from memory to the given file. 53 fwrite(const void * __restrict buf, size_t size, size_t count, FILE * __restrict fp) argument 60 * ANSI and SUSv2 require a return value of 0 if size or count are 0. 62 if ((count == 0) || (size == 0)) 67 * at least one of {count, size} is at least 2^16, since if both 71 if (((count | size) > 0xFFFF) && 72 (count > SIZE_MAX / size)) { 78 n = count * size; 90 * generally slow and since this occurs whenever size [all...] |
/barrelfish-master/usr/eclipseclp/CPViz/viztool/src/components/ |
H A D | JToolbarSeparator.java | 44 Dimension size = getSize(); 45 int pos = size.width / 2; 47 g.drawLine(pos, 3, pos, size.height - 5); 50 g.drawLine(pos + 1, 3, pos + 1, size.height - 5); 51 g.drawLine(pos, size.height - 4, pos + 1, size.height - 4);
|
/barrelfish-master/lib/cxx/cxx/ |
H A D | valarray.cpp | 24 valarray<size_t> __indices(__size_.size()); 25 size_t __k = __size_.size() != 0; 26 for (size_t __i = 0; __i < __size_.size(); ++__i) 29 if (__1d_.size()) 35 size_t __i = __indices.size() - 1; 42 for (size_t __j = __i + 1; __j != __indices.size(); ++__j)
|
/barrelfish-master/usr/tests/filetests/ |
H A D | fread_test.c | 52 size_t size = fread(ptr, 10, 1, fh); local 53 if (size != 10) { 57 size = fread(ptr, AMOUNT - 10, 1, fh); 58 if (size != AMOUNT - 10) { 62 size = fread(ptr, AMOUNT, 1, fh); 63 if (size != 0) {
|
/barrelfish-master/lib/libc/resolv/ |
H A D | res_debug.h | 23 # define DprintQ(cond, args, query, size) /*empty*/ 28 # define DprintQ(cond, args, query, size) if (cond) {\ 30 res_pquery(statp, query, size, stdout);\
|
/barrelfish-master/lib/tommath/ |
H A D | bn_mp_prime_rabin_miller_trials.c | 32 /* returns # of RM trials required for a given bit size */ 33 int mp_prime_rabin_miller_trials(int size) argument 38 if (sizes[x].k == size) { 40 } else if (sizes[x].k > size) {
|
/barrelfish-master/include/lwip2/lwip/ |
H A D | mem.h | 73 void *mem_trim(void *mem, mem_size_t size); 74 void *mem_malloc(mem_size_t size); 75 void *mem_calloc(mem_size_t count, mem_size_t size);
|
/barrelfish-master/include/vm/ |
H A D | memguard.h | 48 #define memguard_fudge(size, xxx) (size) 50 #define memguard_alloc(size, flags) NULL 53 #define memguard_cmp_mtp(mtp, size) 0
|