1*b30d1939SAndy Fiddaman /***********************************************************************
2*b30d1939SAndy Fiddaman *                                                                      *
3*b30d1939SAndy Fiddaman *               This software is part of the ast package               *
4*b30d1939SAndy Fiddaman *          Copyright (c) 1985-2011 AT&T Intellectual Property          *
5*b30d1939SAndy Fiddaman *                      and is licensed under the                       *
6*b30d1939SAndy Fiddaman *                 Eclipse Public License, Version 1.0                  *
7*b30d1939SAndy Fiddaman *                    by AT&T Intellectual Property                     *
8*b30d1939SAndy Fiddaman *                                                                      *
9*b30d1939SAndy Fiddaman *                A copy of the License is available at                 *
10*b30d1939SAndy Fiddaman *          http://www.eclipse.org/org/documents/epl-v10.html           *
11*b30d1939SAndy Fiddaman *         (with md5 checksum b35adb5213ca9657e911e9befb180842)         *
12*b30d1939SAndy Fiddaman *                                                                      *
13*b30d1939SAndy Fiddaman *              Information and Software Systems Research               *
14*b30d1939SAndy Fiddaman *                            AT&T Research                             *
15*b30d1939SAndy Fiddaman *                           Florham Park NJ                            *
16*b30d1939SAndy Fiddaman *                                                                      *
17*b30d1939SAndy Fiddaman *                 Glenn Fowler <gsf@research.att.com>                  *
18*b30d1939SAndy Fiddaman *                  David Korn <dgk@research.att.com>                   *
19*b30d1939SAndy Fiddaman *                   Phong Vo <kpv@research.att.com>                    *
20*b30d1939SAndy Fiddaman *                                                                      *
21*b30d1939SAndy Fiddaman ***********************************************************************/
22*b30d1939SAndy Fiddaman #pragma prototyped
23*b30d1939SAndy Fiddaman /*
24*b30d1939SAndy Fiddaman  * standalone mini vmalloc implementation
25*b30d1939SAndy Fiddaman  * no resize, no free, no disciplines, no methods
26*b30d1939SAndy Fiddaman  */
27*b30d1939SAndy Fiddaman 
28*b30d1939SAndy Fiddaman #include <ast.h>
29*b30d1939SAndy Fiddaman #include <vmalloc.h>
30*b30d1939SAndy Fiddaman 
31*b30d1939SAndy Fiddaman Vmalloc_t*	Vmregion;
32*b30d1939SAndy Fiddaman 
33*b30d1939SAndy Fiddaman Vmalloc_t*
_vm_open(void)34*b30d1939SAndy Fiddaman _vm_open(void)
35*b30d1939SAndy Fiddaman {
36*b30d1939SAndy Fiddaman 	Vmalloc_t*	vp;
37*b30d1939SAndy Fiddaman 
38*b30d1939SAndy Fiddaman 	if (vp = newof(0, Vmalloc_t, 1, 0))
39*b30d1939SAndy Fiddaman 	{
40*b30d1939SAndy Fiddaman 		vp->current = &vp->base;
41*b30d1939SAndy Fiddaman 		vp->data = vp->current->data;
42*b30d1939SAndy Fiddaman 		vp->size = sizeof(vp->current->data);
43*b30d1939SAndy Fiddaman 	}
44*b30d1939SAndy Fiddaman 	return vp;
45*b30d1939SAndy Fiddaman }
46*b30d1939SAndy Fiddaman 
47*b30d1939SAndy Fiddaman int
_vm_close(register Vmalloc_t * vp)48*b30d1939SAndy Fiddaman _vm_close(register Vmalloc_t* vp)
49*b30d1939SAndy Fiddaman {
50*b30d1939SAndy Fiddaman 	register Vmchunk_t*	cp;
51*b30d1939SAndy Fiddaman 	register Vmchunk_t*	np;
52*b30d1939SAndy Fiddaman 
53*b30d1939SAndy Fiddaman 	if (!vp)
54*b30d1939SAndy Fiddaman 		return -1;
55*b30d1939SAndy Fiddaman 	np = vp->base.next;
56*b30d1939SAndy Fiddaman 	while (cp = np)
57*b30d1939SAndy Fiddaman 	{
58*b30d1939SAndy Fiddaman 		np = cp->next;
59*b30d1939SAndy Fiddaman 		free(cp);
60*b30d1939SAndy Fiddaman 	}
61*b30d1939SAndy Fiddaman 	free(vp);
62*b30d1939SAndy Fiddaman 	return 0;
63*b30d1939SAndy Fiddaman }
64*b30d1939SAndy Fiddaman 
65*b30d1939SAndy Fiddaman void*
_vm_resize(register Vmalloc_t * vp,void * o,unsigned long size)66*b30d1939SAndy Fiddaman _vm_resize(register Vmalloc_t* vp, void* o, unsigned long size)
67*b30d1939SAndy Fiddaman {
68*b30d1939SAndy Fiddaman 	char*		p;
69*b30d1939SAndy Fiddaman 	unsigned long	n;
70*b30d1939SAndy Fiddaman 	unsigned long	z;
71*b30d1939SAndy Fiddaman 
72*b30d1939SAndy Fiddaman 	z = vp->last;
73*b30d1939SAndy Fiddaman 	vp->last = size;
74*b30d1939SAndy Fiddaman 	if (o && size < z)
75*b30d1939SAndy Fiddaman 		return o;
76*b30d1939SAndy Fiddaman 	if ((o ? (size - z) : size) > vp->size)
77*b30d1939SAndy Fiddaman 	{
78*b30d1939SAndy Fiddaman 		n = (size > sizeof(vp->current->data)) ? (size - sizeof(vp->current->data)) : 0;
79*b30d1939SAndy Fiddaman 		if (!(vp->current->next = newof(0, Vmchunk_t, 1, n)))
80*b30d1939SAndy Fiddaman 			return 0;
81*b30d1939SAndy Fiddaman 		vp->current = vp->current->next;
82*b30d1939SAndy Fiddaman 		vp->data = vp->current->data;
83*b30d1939SAndy Fiddaman 		vp->size = n ? 0 : sizeof(vp->current->data);
84*b30d1939SAndy Fiddaman 		if (o)
85*b30d1939SAndy Fiddaman 		{
86*b30d1939SAndy Fiddaman 			memcpy(vp->data, o, z);
87*b30d1939SAndy Fiddaman 			o = (void*)vp->data;
88*b30d1939SAndy Fiddaman 		}
89*b30d1939SAndy Fiddaman 	}
90*b30d1939SAndy Fiddaman 	else if (o)
91*b30d1939SAndy Fiddaman 		size -= z;
92*b30d1939SAndy Fiddaman 	p = vp->data;
93*b30d1939SAndy Fiddaman 	size = roundof(size, VM_ALIGN);
94*b30d1939SAndy Fiddaman 	if (size >= vp->size)
95*b30d1939SAndy Fiddaman 		vp->size = 0;
96*b30d1939SAndy Fiddaman 	else
97*b30d1939SAndy Fiddaman 	{
98*b30d1939SAndy Fiddaman 		vp->size -= size;
99*b30d1939SAndy Fiddaman 		vp->data += size;
100*b30d1939SAndy Fiddaman 	}
101*b30d1939SAndy Fiddaman 	return p;
102*b30d1939SAndy Fiddaman }
103