size 110 common/libc/printf/__printf.c } size;
size 159 common/libc/printf/__printf.c pf->size = INTSZ;
size 190 common/libc/printf/__printf.c if (pf->size==LONGSZ) {
size 192 common/libc/printf/__printf.c pf->size = LLONGSZ;
size 196 common/libc/printf/__printf.c pf->size = LONGSZ;
size 251 common/libc/printf/__printf.c switch (pf->size) {
size 281 common/libc/printf/__printf.c switch (pf->size) {
size 97 kern/arch/mips/vm/ram.c size_t size;
size 100 kern/arch/mips/vm/ram.c size = npages * PAGE_SIZE;
size 102 kern/arch/mips/vm/ram.c if (firstpaddr + size > lastpaddr) {
size 107 kern/arch/mips/vm/ram.c firstpaddr += size;
size 461 kern/fs/sfs/sfs_vnode.c off_t size = sv->sv_i.sfi_size;
size 464 kern/fs/sfs/sfs_vnode.c if (uio->uio_offset >= size) {
size 469 kern/fs/sfs/sfs_vnode.c if (endpos > size) {
size 470 kern/fs/sfs/sfs_vnode.c extraresid = endpos - size;
size 626 kern/fs/sfs/sfs_vnode.c off_t size;
size 630 kern/fs/sfs/sfs_vnode.c size = sv->sv_i.sfi_size;
size 631 kern/fs/sfs/sfs_vnode.c if (size % sizeof(struct sfs_dir) != 0) {
size 633 kern/fs/sfs/sfs_vnode.c sv->sv_ino, size);
size 636 kern/fs/sfs/sfs_vnode.c return size / sizeof(struct sfs_dir);
size 126 kern/include/lib.h void *kmalloc(size_t size);
size 28 kern/include/queue.h struct queue *q_create(int size);
size 29 kern/include/queue.h int q_preallocate(struct queue *, int size);
size 11 kern/lib/queue.c int size;
size 24 kern/lib/queue.c int osize = q->size;
size 31 kern/lib/queue.c nsize = q->size;
size 41 kern/lib/queue.c q->size = nsize;
size 54 kern/lib/queue.c q_create(int size)
size 60 kern/lib/queue.c q->size = size;
size 61 kern/lib/queue.c q->data = kmalloc(size * sizeof(void *));
size 71 kern/lib/queue.c q_preallocate(struct queue *q, int size)
size 75 kern/lib/queue.c KASSERT(q->size > 0);
size 77 kern/lib/queue.c if (size > q->size) {
size 78 kern/lib/queue.c result = q_grow(q, size);
size 95 kern/lib/queue.c KASSERT(q->size > 0);
size 97 kern/lib/queue.c nextnext = (q->nextwrite+1) % q->size;
size 99 kern/lib/queue.c result = q_grow(q, q->size+1);
size 103 kern/lib/queue.c nextnext = (q->nextwrite+1) % q->size;
size 115 kern/lib/queue.c KASSERT(q->size > 0);
size 119 kern/lib/queue.c q->nextread = (q->nextread+1)%q->size;
size 147 kern/lib/queue.c return q->size;
size 156 kern/lib/queue.c KASSERT(index>=0 && index<q->size);
size 166 kern/lib/queue.c KASSERT(q->size > 0);
size 182 kern/lib/queue.c tmp = (tmp+1) % theq->size;
size 45 kern/lib/uio.c size_t size;
size 61 kern/lib/uio.c size = iov->iov_len;
size 63 kern/lib/uio.c if (size > n) {
size 64 kern/lib/uio.c size = n;
size 67 kern/lib/uio.c if (size == 0) {
size 87 kern/lib/uio.c memmove(iov->iov_kbase, ptr, size);
size 90 kern/lib/uio.c memmove(ptr, iov->iov_kbase, size);
size 92 kern/lib/uio.c iov->iov_kbase = ((char *)iov->iov_kbase+size);
size 97 kern/lib/uio.c result = copyout(ptr, iov->iov_ubase,size);
size 100 kern/lib/uio.c result = copyin(iov->iov_ubase, ptr, size);
size 105 kern/lib/uio.c iov->iov_ubase += size;
size 112 kern/lib/uio.c iov->iov_len -= size;
size 113 kern/lib/uio.c uio->uio_resid -= size;
size 114 kern/lib/uio.c uio->uio_offset += size;
size 115 kern/lib/uio.c ptr = ((char *)ptr + size);
size 116 kern/lib/uio.c n -= size;
size 70 user/include/stdlib.h void *malloc(size_t size);
size 128 user/include/unistd.h int read(int filehandle, void *buf, size_t size);
size 129 user/include/unistd.h int write(int filehandle, const void *buf, size_t size);
size 141 user/include/unistd.h int ftruncate(int filehandle, off_t size);
size 263 user/lib/libc/stdlib/malloc.c __malloc_sbrk(size_t size)
size 267 user/lib/libc/stdlib/malloc.c x = sbrk(size);
size 278 user/lib/libc/stdlib/malloc.c __heaptop += size;
size 292 user/lib/libc/stdlib/malloc.c __malloc_split(struct mheader *mh, size_t size)
size 297 user/lib/libc/stdlib/malloc.c if (size % MBLOCKSIZE != 0) {
size 299 user/lib/libc/stdlib/malloc.c (unsigned long) size);
size 302 user/lib/libc/stdlib/malloc.c if (M_SIZE(mh) - size < 2*MBLOCKSIZE) {
size 310 user/lib/libc/stdlib/malloc.c mh->mh_nextblock = M_MKFIELD(size + MBLOCKSIZE);
size 317 user/lib/libc/stdlib/malloc.c mhnew->mh_prevblock = M_MKFIELD(size + MBLOCKSIZE);
size 320 user/lib/libc/stdlib/malloc.c mhnew->mh_nextblock = M_MKFIELD(oldsize - size);
size 333 user/lib/libc/stdlib/malloc.c malloc(size_t size)
size 350 user/lib/libc/stdlib/malloc.c (unsigned long) size, (unsigned long) size);
size 355 user/lib/libc/stdlib/malloc.c size = ((size + MBLOCKSIZE - 1) & ~(size_t)(MBLOCKSIZE-1));
size 385 user/lib/libc/stdlib/malloc.c if (M_SIZE(mh) < size) {
size 390 user/lib/libc/stdlib/malloc.c __malloc_split(mh, size);
size 411 user/lib/libc/stdlib/malloc.c mh = __malloc_sbrk(size + MBLOCKSIZE);
size 421 user/lib/libc/stdlib/malloc.c mh->mh_nextblock = M_MKFIELD(size + MBLOCKSIZE);
size 438 user/lib/libc/stdlib/malloc.c __malloc_deadbeef(void *ptr, size_t size)
size 441 user/lib/libc/stdlib/malloc.c size_t i, n = size/sizeof(uint32_t);
size 149 user/sbin/mksfs/mksfs.c uint32_t size, blocksize;
size 186 user/sbin/mksfs/mksfs.c size = diskblocks();
size 188 user/sbin/mksfs/mksfs.c writesuper(volname, size);
size 190 user/sbin/mksfs/mksfs.c writebitmap(size);
size 639 user/sbin/sfsck/sfsck.c uint32_t size, block, nblocks, badcount;
size 643 user/sbin/sfsck/sfsck.c size = SFS_ROUNDUP(sfi->sfi_size, SFS_BLOCKSIZE);
size 644 user/sbin/sfsck/sfsck.c nblocks = size/SFS_BLOCKSIZE;
size 878 user/sbin/sfsck/sfsck.c qsort(int *data, int num, size_t size, int (*f)(const void *, const void *))
size 881 user/sbin/sfsck/sfsck.c (void)size;
size 51 user/testbin/bigfile/bigfile.c int i, size;
size 60 user/testbin/bigfile/bigfile.c size = atoi(argv[2]);
size 62 user/testbin/bigfile/bigfile.c printf("Creating a file of size %d\n", size);
size 70 user/testbin/bigfile/bigfile.c while (i<size) {
size 123 user/testbin/f_test/f_test.c big_file(int size)
size 128 user/testbin/f_test/f_test.c printf("\tCreating a file of size: %d\n", size);
size 140 user/testbin/f_test/f_test.c for (i = 0; i < size; i += BUFFER_SIZE) {
size 156 user/testbin/f_test/f_test.c for (i = 0; i < size; i += BUFFER_SIZE) {
size 102 user/testbin/malloctest/malloctest.c markblock(volatile void *ptr, size_t size, unsigned bias, int doprint)
size 109 user/testbin/malloctest/malloctest.c n = size / sizeof(unsigned long);
size 128 user/testbin/malloctest/malloctest.c checkblock(volatile void *ptr, size_t size, unsigned bias, int doprint)
size 135 user/testbin/malloctest/malloctest.c n = size / sizeof(unsigned long);
size 233 user/testbin/malloctest/malloctest.c size_t size;
size 241 user/testbin/malloctest/malloctest.c for (size = HUGESIZE; (x = malloc(size))==NULL; size = size/2) {
size 242 user/testbin/malloctest/malloctest.c printf(" %9lu bytes: failed\n", (unsigned long) size);
size 244 user/testbin/malloctest/malloctest.c printf(" %9lu bytes: succeeded\n", (unsigned long) size);
size 249 user/testbin/malloctest/malloctest.c markblock(x, size, 0, 1);
size 252 user/testbin/malloctest/malloctest.c if (checkblock(x, size, 0, 1)) {
size 264 user/testbin/malloctest/malloctest.c x = malloc(size);
size 524 user/testbin/malloctest/malloctest.c int i, n, size, failed=0;
size 537 user/testbin/malloctest/malloctest.c size = sizes[random()%8];
size 538 user/testbin/malloctest/malloctest.c ptrs[n] = malloc(size);
size 539 user/testbin/malloctest/malloctest.c psizes[n] = size;
size 541 user/testbin/malloctest/malloctest.c printf("\nmalloc %u failed\n", size);
size 545 user/testbin/malloctest/malloctest.c markblock(ptrs[n], size, n, 0);
size 548 user/testbin/malloctest/malloctest.c size = psizes[n];
size 549 user/testbin/malloctest/malloctest.c if (checkblock(ptrs[n], size, n, 0)) {
size 59 user/testbin/sort/sort.c sort(int *arr, int size)
size 64 user/testbin/sort/sort.c if (size<2) {
size 68 user/testbin/sort/sort.c pivot = size/2;
size 70 user/testbin/sort/sort.c sort(&arr[pivot], size-pivot);
size 75 user/testbin/sort/sort.c while (i<pivot && j<size) {
size 86 user/testbin/sort/sort.c while (j<size) {
size 90 user/testbin/sort/sort.c memcpy(arr, tmp, size*sizeof(int));