1*57718be8SEnji Cooper /* $NetBSD: alloc.c,v 1.1 2010/06/14 21:06:09 pooka Exp $ */ 2*57718be8SEnji Cooper 3*57718be8SEnji Cooper /*- 4*57718be8SEnji Cooper * Copyright (c) 2010 The NetBSD Foundation, Inc. 5*57718be8SEnji Cooper * All rights reserved. 6*57718be8SEnji Cooper * 7*57718be8SEnji Cooper * Redistribution and use in source and binary forms, with or without 8*57718be8SEnji Cooper * modification, are permitted provided that the following conditions 9*57718be8SEnji Cooper * are met: 10*57718be8SEnji Cooper * 1. Redistributions of source code must retain the above copyright 11*57718be8SEnji Cooper * notice, this list of conditions and the following disclaimer. 12*57718be8SEnji Cooper * 2. Redistributions in binary form must reproduce the above copyright 13*57718be8SEnji Cooper * notice, this list of conditions and the following disclaimer in the 14*57718be8SEnji Cooper * documentation and/or other materials provided with the distribution. 15*57718be8SEnji Cooper * 16*57718be8SEnji Cooper * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND 17*57718be8SEnji Cooper * CONTRIBUTORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, 18*57718be8SEnji Cooper * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 19*57718be8SEnji Cooper * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 20*57718be8SEnji Cooper * IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY 21*57718be8SEnji Cooper * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22*57718be8SEnji Cooper * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE 23*57718be8SEnji Cooper * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 24*57718be8SEnji Cooper * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER 25*57718be8SEnji Cooper * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 26*57718be8SEnji Cooper * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN 27*57718be8SEnji Cooper * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28*57718be8SEnji Cooper */ 29*57718be8SEnji Cooper 30*57718be8SEnji Cooper #include <sys/cdefs.h> 31*57718be8SEnji Cooper #if !defined(lint) 32*57718be8SEnji Cooper __RCSID("$NetBSD: alloc.c,v 1.1 2010/06/14 21:06:09 pooka Exp $"); 33*57718be8SEnji Cooper #endif /* !lint */ 34*57718be8SEnji Cooper 35*57718be8SEnji Cooper #include <sys/param.h> 36*57718be8SEnji Cooper #include <sys/condvar.h> 37*57718be8SEnji Cooper #include <sys/kmem.h> 38*57718be8SEnji Cooper #include <sys/kthread.h> 39*57718be8SEnji Cooper #include <sys/mutex.h> 40*57718be8SEnji Cooper #include <sys/pool.h> 41*57718be8SEnji Cooper #include <sys/proc.h> 42*57718be8SEnji Cooper 43*57718be8SEnji Cooper #include <uvm/uvm.h> 44*57718be8SEnji Cooper 45*57718be8SEnji Cooper #include <rump/rumpuser.h> 46*57718be8SEnji Cooper #include "kernspace.h" 47*57718be8SEnji Cooper 48*57718be8SEnji Cooper static void *store[32]; 49*57718be8SEnji Cooper static struct pool pp1, pp2; 50*57718be8SEnji Cooper 51*57718be8SEnji Cooper static kmutex_t mtx; 52*57718be8SEnji Cooper static kcondvar_t kcv; 53*57718be8SEnji Cooper static int curstat; 54*57718be8SEnji Cooper 55*57718be8SEnji Cooper static void 56*57718be8SEnji Cooper hthr(void *arg) 57*57718be8SEnji Cooper { 58*57718be8SEnji Cooper int i; 59*57718be8SEnji Cooper 60*57718be8SEnji Cooper mutex_enter(&mtx); 61*57718be8SEnji Cooper curstat++; 62*57718be8SEnji Cooper cv_signal(&kcv); 63*57718be8SEnji Cooper 64*57718be8SEnji Cooper while (curstat < 2) 65*57718be8SEnji Cooper cv_wait(&kcv, &mtx); 66*57718be8SEnji Cooper mutex_exit(&mtx); 67*57718be8SEnji Cooper 68*57718be8SEnji Cooper /* try to guarantee that the sleep is triggered in PR_WAITOK */ 69*57718be8SEnji Cooper while ((kernel_map->flags & VM_MAP_WANTVA) == 0) 70*57718be8SEnji Cooper kpause("take5", false, 1, NULL); 71*57718be8SEnji Cooper 72*57718be8SEnji Cooper for (i = 0; i < __arraycount(store); i++) { 73*57718be8SEnji Cooper pool_put(&pp1, store[i]); 74*57718be8SEnji Cooper } 75*57718be8SEnji Cooper 76*57718be8SEnji Cooper kthread_exit(0); 77*57718be8SEnji Cooper } 78*57718be8SEnji Cooper 79*57718be8SEnji Cooper void 80*57718be8SEnji Cooper rumptest_alloc(size_t thelimit) 81*57718be8SEnji Cooper { 82*57718be8SEnji Cooper char *c; 83*57718be8SEnji Cooper int succ, i; 84*57718be8SEnji Cooper 85*57718be8SEnji Cooper mutex_init(&mtx, MUTEX_DEFAULT, IPL_NONE); 86*57718be8SEnji Cooper cv_init(&kcv, "venailu"); 87*57718be8SEnji Cooper 88*57718be8SEnji Cooper kthread_create(PRI_NONE, KTHREAD_MPSAFE, NULL, hthr, NULL, NULL, "h"); 89*57718be8SEnji Cooper 90*57718be8SEnji Cooper pool_init(&pp1, 1024, 0, 0, 0, "vara-allas", 91*57718be8SEnji Cooper &pool_allocator_nointr, IPL_NONE); 92*57718be8SEnji Cooper pool_init(&pp2, 1024, 0, 0, 0, "allas", 93*57718be8SEnji Cooper &pool_allocator_nointr, IPL_NONE); 94*57718be8SEnji Cooper 95*57718be8SEnji Cooper for (i = 0; i < __arraycount(store); i++) { 96*57718be8SEnji Cooper store[i] = pool_get(&pp1, PR_NOWAIT); 97*57718be8SEnji Cooper if (store[i] == NULL) { 98*57718be8SEnji Cooper panic("pool_get store failed"); 99*57718be8SEnji Cooper } 100*57718be8SEnji Cooper } 101*57718be8SEnji Cooper 102*57718be8SEnji Cooper /* wait until other thread runs */ 103*57718be8SEnji Cooper mutex_enter(&mtx); 104*57718be8SEnji Cooper while (curstat == 0) 105*57718be8SEnji Cooper cv_wait(&kcv, &mtx); 106*57718be8SEnji Cooper mutex_exit(&mtx); 107*57718be8SEnji Cooper 108*57718be8SEnji Cooper for (succ = 0;; succ++) { 109*57718be8SEnji Cooper if (succ * 1024 > thelimit) 110*57718be8SEnji Cooper panic("managed to allocate over limit"); 111*57718be8SEnji Cooper if ((c = pool_get(&pp2, PR_NOWAIT)) == NULL) { 112*57718be8SEnji Cooper mutex_enter(&mtx); 113*57718be8SEnji Cooper curstat++; 114*57718be8SEnji Cooper cv_signal(&kcv); 115*57718be8SEnji Cooper mutex_exit(&mtx); 116*57718be8SEnji Cooper if (pool_get(&pp2, PR_WAITOK) == NULL) 117*57718be8SEnji Cooper panic("pool get PR_WAITOK failed"); 118*57718be8SEnji Cooper break; 119*57718be8SEnji Cooper } 120*57718be8SEnji Cooper *c = 'a'; 121*57718be8SEnji Cooper } 122*57718be8SEnji Cooper } 123