Searched refs:size (Results 176 - 200 of 1112) sorted by relevance

1234567891011>>

/barrelfish-master/usr/kaluga/
H A Ddevice_caps.h16 errval_t get_device_cap(lpaddr_t address, size_t size, struct capref* devframe);
/barrelfish-master/usr/slideshow/
H A Dbmp.h19 int bmp_load(void *data, size_t size);
H A Dbmp.c26 uint32_t size; member in struct:bmp_header
41 uint32_t size; member in struct:dib_header
51 int bmp_load(void *data, size_t size) argument
56 MUST(size > sizeof(struct bmp_header) + sizeof(struct dib_header));
58 MUST(dh->size == 40);
/barrelfish-master/usr/vmkitmon/
H A Dpci.h38 enum opsize size, uint32_t val);
42 enum opsize size, uint32_t *val);
54 size_t bytes; //size of the bar
78 int pci_handle_pio_write(struct pci *pci, uint16_t port, enum opsize size,
80 int pci_handle_pio_read(struct pci *pci, uint16_t port, enum opsize size,
H A Dpci_host.c38 enum opsize size, uint32_t val)
44 enum opsize size, uint32_t *val)
56 addr.d.doubleword, size, *val);
58 if(size == 1) {
36 confspace_write(struct pci_device *dev, union pci_config_address_word addr, enum opsize size, uint32_t val) argument
42 confspace_read(struct pci_device *dev, union pci_config_address_word addr, enum opsize size, uint32_t *val) argument
H A Dvmkitmon.c86 vfs_load_file_to_memory (const char *file, void **data, size_t *size) argument
89 assert(size != NULL);
103 *data = malloc(info.size);
106 err = vfs_read(vh, *data, info.size, size);
108 assert(*size == info.size);
/barrelfish-master/lib/lwip/src/core/
H A Dmem.c76 * to contain an element of 'size' and get an element from that pool.
78 * @param size the size in bytes of the memory needed
81 void *mem_malloc(mem_size_t size) argument
85 mem_size_t required_size = size + sizeof(struct memp_malloc_helper);
91 /* is this pool big enough to hold an element of the required size
153 * This does not have to be aligned since for getting its size,
178 u8_t *mem_barrelfish_alloc(uint8_t buf_index, uint32_t size);
179 u8_t *mem_barrelfish_register_buf(uint8_t binding_index, uint32_t size);
374 * @param newsize required size afte
383 mem_size_t size; local
507 mem_malloc(mem_size_t size) argument
652 mem_calloc(mem_size_t count, mem_size_t size) argument
[all...]
/barrelfish-master/lib/tommath/etc/
H A Dtune.c8 /* how many times todo each size mult. Depends on your computer. For slow computers
57 ulong64 time_mult(int size, int s) argument
67 mp_rand (&a, size);
68 mp_rand (&b, size);
71 KARATSUBA_MUL_CUTOFF = size;
87 ulong64 time_sqr(int size, int s) argument
96 mp_rand (&a, size);
99 KARATSUBA_SQR_CUTOFF = size;
/barrelfish-master/lib/libc/iconv/
H A Dcitrus_pivot_factory.c162 size_t size; local
170 size = _db_factory_calc_size(se->se_df);
171 ptr = malloc(size);
174 _region_init(&subr, ptr, size);
184 size = _db_factory_calc_size(df);
185 ptr = malloc(size);
188 _region_init(r, ptr, size);
205 size_t size; local
210 while ((line = fgetln(in, &size)) != NULL)
211 if ((ret = convert_line(&sh, line, size))) {
[all...]
/barrelfish-master/lib/libc/inet/
H A Dinet_ntop.c44 static const char *inet_ntop4(const u_char *src, char *dst, socklen_t size);
45 static const char *inet_ntop6(const u_char *src, char *dst, socklen_t size);
48 * inet_ntop(af, src, dst, size)
57 socklen_t size)
61 return (inet_ntop4(src, dst, size));
63 return (inet_ntop6(src, dst, size));
72 * inet_ntop4(src, dst, size)
83 inet_ntop4(const u_char *src, char *dst, socklen_t size) argument
90 if (l <= 0 || (socklen_t) l >= size) {
94 strlcpy(dst, tmp, size);
56 inet_ntop(int af, const void * __restrict src, char * __restrict dst, socklen_t size) argument
105 inet_ntop6(const u_char *src, char *dst, socklen_t size) argument
[all...]
H A Dinet_cidr_ntop.c46 inet_cidr_ntop_ipv4(const u_char *src, int bits, char *dst, size_t size);
48 inet_cidr_ntop_ipv6(const u_char *src, int bits, char *dst, size_t size);
52 * inet_cidr_ntop(af, src, bits, dst, size)
54 * "src"'s size is determined from its "af".
65 inet_cidr_ntop(int af, const void *src, int bits, char *dst, size_t size) { argument
68 return (inet_cidr_ntop_ipv4(src, bits, dst, size));
70 return (inet_cidr_ntop_ipv6(src, bits, dst, size));
78 decoct(const u_char *src, int bytes, char *dst, size_t size) { argument
84 if (size < sizeof "255.")
92 size
111 inet_cidr_ntop_ipv4(const u_char *src, int bits, char *dst, size_t size) argument
155 inet_cidr_ntop_ipv6(const u_char *src, int bits, char *dst, size_t size) argument
[all...]
/barrelfish-master/lib/posixcompat/
H A Dinet_ntop.c40 static const char *inet_ntop4(const u_char *src, char *dst, socklen_t size);
41 static const char *inet_ntop6(const u_char *src, char *dst, socklen_t size);
44 * inet_ntop(af, src, dst, size)
53 socklen_t size)
57 return (inet_ntop4(src, dst, size));
59 return (inet_ntop6(src, dst, size));
68 * inet_ntop4(src, dst, size)
79 inet_ntop4(const u_char *src, char *dst, socklen_t size) argument
86 if (l <= 0 || (socklen_t) l >= size) {
90 strlcpy(dst, tmp, size);
52 inet_ntop(int af, const void * __restrict src, char * __restrict dst, socklen_t size) argument
101 inet_ntop6(const u_char *src, char *dst, socklen_t size) argument
[all...]
/barrelfish-master/lib/barrelfish/vspace/
H A Dmemobj_one_frame_one_map.c57 err = pmap->f.unmap(pmap, vregion_base + vregion_off, memobj->size, NULL);
122 * \param size The size of frame cap
125 size_t size)
130 assert(size == memobj->size);
152 offset > state->offset + memobj->size) {
164 state->offset, memobj->size, flags, NULL, NULL);
176 * \param size The amount of space to free up
182 static errval_t pager_free(struct memobj *memobj, size_t size, argument
124 fill(struct memobj *memobj, genvaddr_t offset, struct capref frame, size_t size) argument
198 memobj_create_one_frame_one_map(struct memobj_one_frame_one_map *state, size_t size, memobj_flags_t flags) argument
[all...]
H A Dmemobj_numa.c43 assert(memobj->size >= (vregion->offset + vregion->size));
80 err = pmap->f.unmap(pmap, vreg_base + vreg_offset, vregion->size, NULL);
194 if (fid.bytes < memobj->size / mo_numa->node_count) {\
261 size_t size = memobj->size; local
280 while(size) {
281 if (size < map_size) {
282 map_size = size;
311 size
333 pager_free(struct memobj *memobj, size_t size, struct capref *frames, size_t num_frames) argument
353 memobj_create_numa(struct memobj_numa *mo_numa, size_t size, memobj_flags_t flags, size_t node_count, size_t stride) argument
[all...]
/barrelfish-master/lib/libc/tests/string/
H A Dwcsnlen_test.c61 size_t size, len, bufsize; local
64 size = wcslen(s) + 1;
66 for (bufsize = 0; bufsize <= size + 10; bufsize++) {
69 len = (size > bufsize) ? bufsize : size - 1;
/barrelfish-master/lib/lua/src/
H A Dlmem.h40 #define luaM_growvector(L,v,nelems,size,t,limit,e) \
41 if ((nelems)+1 > (size)) \
42 ((v)=cast(t *, luaM_growaux_(L,v,&(size),sizeof(t),limit,e)))
51 size_t size);
52 LUAI_FUNC void *luaM_growaux_ (lua_State *L, void *block, int *size,
/barrelfish-master/include/barrelfish/
H A Dvregion.h54 genvaddr_t size; ///< Size of the vregion member in struct:vregion
101 * \brief Get the size of the region
107 return vregion->size;
121 size_t offset, size_t size, vregion_flags_t flags);
123 struct memobj* memobj, size_t offset, size_t size,
126 size_t offset, size_t size, genvaddr_t addr,
/barrelfish-master/lib/libc/db/btree/
H A Dbt_put.c120 if (key->size + data->size > t->bt_ovflsize) {
121 if (key->size > t->bt_ovflsize) {
125 tkey.size = NOVFLSIZE;
127 tmp = key->size;
133 if (key->size + data->size > t->bt_ovflsize) {
137 tdata.size = NOVFLSIZE;
139 tmp = data->size;
145 if (key->size
[all...]
/barrelfish-master/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/
H A DAbstractViewletDataStore.java48 // used to store the size expanded *from* in between a startExpandDimension
68 * This is a list of Integers which lists the size of Elements recursively:
87 * Construct a ViewletArray given a list of integers (size), a fixity list
91 public AbstractViewletDataStore(List size, argument
96 int topLevelSize = ((Integer) size.get(0)).intValue();
97 this.wholeSize = new LinkedList(size);
188 List start = new ArrayList(wholeSize.size());
190 for(int i = 0; i < wholeSize.size(); i++) {
193 // createdElementIndices = allCombinations(size);
234 return(getSize().size());
[all...]
/barrelfish-master/usr/tests/octopus/
H A Dd2getset.c34 size_t size = 0; local
36 err = oct_get_names(&names, &size, "r'^object.*'");
38 assert(size == 4);
43 oct_free_names(names, size);
45 err = oct_get_names(&names, &size, "_ { weight: _ }");
47 assert(size == 2);
51 oct_free_names(names, size);
53 err = oct_get_names(&names, &size, "_ { attr: _, weight: %d }", 20);
55 assert(size == 1);
57 oct_free_names(names, size);
[all...]
/barrelfish-master/lib/tenaciousd/
H A Dlog.c60 // If this was less or equal to the min size, we're done
61 if(entry->size + sizeof(struct tenaciousd_log_entry)
68 entry->size + sizeof(struct tenaciousd_log_entry));
72 entry->size - LOG_MIN_ENTRY_SIZE(log) + sizeof(struct tenaciousd_log_entry),
79 if(entry->data[entry->size] != LOG_ENTRY_END_MARKER) {
121 if(logentry == NULL || logentry->size == 0) {
128 log->end += STORAGE_VSIC_ROUND(log->vsic, logentry->size);
191 STORAGE_VSIC_ROUND(vsic, entry->size + sizeof(struct tenaciousd_log_entry));
193 entry->data[entry->size] = LOG_ENTRY_END_MARKER;
197 entry->size
241 tenaciousd_log_entry_new(struct tenaciousd_log *log, size_t *size) argument
[all...]
/barrelfish-master/lib/debug_log/
H A Ddebug_log.c129 unsigned int i, size; local
141 size = 0;
142 int s = snprintf(buffer + size, max_size - size, "\nLog:%d %d:%d\n", log_size, i, j);
143 size += s;
146 s = snprintf(buffer + size, max_size - size, "\033[36;1m(%ld,%ld)\033[0m:\t%s\n",
148 size += s;
152 return size;
/barrelfish-master/kernel/arch/x86_64/
H A Dpaging.c93 * Maps the region of physical memory, based at base and sized size bytes
96 * in the page hierarchy rooted at pml4. base and size will be made
100 * \param size Size in bytes of memory region
105 static int paging_map_mem(lpaddr_t base, size_t size, uint64_t bitmap) argument
115 paging_align(&vbase, &base, &size, X86_64_MEM_PAGE_SIZE);
118 assert(base + size <= (lpaddr_t)PADDR_SPACE_LIMIT);
119 if(base + size > (lpaddr_t)PADDR_SPACE_LIMIT) {
124 for(vaddr = vbase, addr = base; vaddr < vbase + size;
147 lvaddr_t paging_x86_64_map_device(lpaddr_t base, size_t size) argument
149 if(paging_map_mem(base, size, DEVICE_PAGE_BITMA
156 paging_x86_64_map_memory(lpaddr_t base, size_t size) argument
[all...]
/barrelfish-master/include/vm/
H A Dvm_mmap.c196 vm_size_t size, pageoff; local
204 size = uap->len;
265 /* Adjust size for rounding (on both ends). */
266 size += pageoff; /* low end... */
267 size = (vm_size_t) round_page(size); /* hi end */
292 addr + size > vm_map_max(&vms->vm_map))
294 if (addr + size < addr)
297 if (flags & MAP_32BIT && addr + size > MAP_32BIT_MAX_ADDR)
305 if (addr + size > MAP_32BIT_MAX_ADD
472 vm_size_t size, pageoff; local
531 vm_size_t size, pageoff; local
603 vm_size_t size, pageoff; local
645 vm_size_t size, pageoff; local
1010 vm_size_t npages, size; local
1193 vm_size_t size; local
1406 vm_mmap(vm_map_t map, vm_offset_t *addr, vm_size_t size, vm_prot_t prot, vm_prot_t maxprot, int flags, objtype_t handle_type, void *handle, vm_ooffset_t foff) argument
1477 vm_mmap_object(vm_map_t map, vm_offset_t *addr, vm_size_t size, vm_prot_t prot, vm_prot_t maxprot, int flags, vm_object_t object, vm_ooffset_t foff, boolean_t writecounted, struct thread *td) argument
[all...]
/barrelfish-master/lib/compiler-rt/builtins/
H A Demutls.c38 uintptr_t size; // number of elements in the 'data' array member in struct:emutls_address_array
65 static __inline void *emutls_memalign_alloc(size_t align, size_t size) { argument
68 if (posix_memalign(&base, align, size) != 0)
73 if ((object = (char *)malloc(EXTRA_ALIGN_PTR_BYTES + size)) == NULL)
163 static __inline void *emutls_memalign_alloc(size_t align, size_t size) { argument
164 void *base = _aligned_malloc(size, align);
264 for (i = 0; i < array->size; ++i) {
278 // zeros. We can use variables of size_t to operate on size and
280 gcc_word size; // size o member in struct:__emutls_control
295 size_t size = control->size; local
329 emutls_check_array_set_size(emutls_address_array *array, uintptr_t size) argument
[all...]

Completed in 377 milliseconds

1234567891011>>