Age | Commit message (Collapse) | Author | |
---|---|---|---|
2002-07-02 | inital -> initial | Nathan Binkert | |
2002-06-14 | spelling; from Brian Poole <raj@cerias.purdue.edu> | Todd T. Fries | |
2002-06-11 | Allow MD code to define __HAVE_VM_PAGE_MD to add own members into struct ↵ | Artur Grabowski | |
vm_page. From NetBSD. | |||
2002-06-11 | Remove a stupid assert that grows the kernel by 40kB. | Artur Grabowski | |
2002-06-09 | fix the use of "cuz" in the tree; these are all in comments | Jason Peel | |
noticed by aaron@, recommended by deraadt@ | |||
2002-06-05 | DIAGNOSTIC check for duplicate entry into the tree. | Artur Grabowski | |
niels@ ok. | |||
2002-05-30 | spelling errors; moritz@jodeit.org | Theo de Raadt | |
2002-05-24 | Make sure that b_iodone handlers are called at splbio (and ↵ | Artur Grabowski | |
splassert(IPL_BIO) in all known callers, just to make sure). | |||
2002-05-24 | Protect biodone with splbio. | Artur Grabowski | |
2002-05-22 | splassert(IPL_BIO) in the b_iodone handlers. | Artur Grabowski | |
2002-05-09 | from netbsd; okay art@ | Niels Provos | |
revision 1.43 date: 2002/03/28 06:06:29; author: nathanw; state: Exp; lines: +13 -3 In amap_pp_adjref(), avoid incorrectly merging the first two chunks in a ppref array when the range being adjusted includes the beginning of the array. | |||
2002-04-29 | wierd -> weird | Peter Valchev | |
2002-04-25 | do not map memory for malloc w/ execute perms. | Michael Shalayeff | |
this prevents i-cache preload on some archs, but does not hurt on others anyway. art looked all over all the pmaps, miod and mickey tested it on all possible archs, deraadt made a lesson out of it for the rest of the folks. | |||
2002-04-22 | Uncommit. Since this came out of the blue, without anyone else having | Theo de Raadt | |
known of it; and since the commit message does not give the rest of us any feeling that this was tested by anyone, this is being removed. This is not an area where one commits because just art agrees. And that is what the commit message says. | |||
2002-04-22 | do not map malloced memory executable (do avoid possible i-cache prefetch); ↵ | Michael Shalayeff | |
art@ ok | |||
2002-03-18 | These are macro inlines on vax, so check if they're defined before | Hugh Graham | |
trying to prototype them. millert@ ok. | |||
2002-03-18 | $OpenBSD$ | Hugh Graham | |
2002-03-17 | Don't set LK_RETRY to vn_lock with LK_RECURSEFAIL. | Artur Grabowski | |
2002-03-15 | Cosmetic changes only, primarily making comments line up nicely after the | Todd C. Miller | |
__P removal. | |||
2002-03-14 | Prototype pmap_unwire() only if it's not already defined. ok drahn@. | Daniel Hartmeier | |
2002-03-14 | do not proto pmap(de)activate if one was defined | Michael Shalayeff | |
2002-03-14 | Final __P removal plus some cosmetic fixups | Todd C. Miller | |
2002-03-14 | First round of __P removal in sys | Todd C. Miller | |
2002-03-14 | Don't prototype pmap_copy() if it is a macro | Todd C. Miller | |
2002-03-08 | semicolon is not always what it seems, replace w/ a \n in asm labels | Michael Shalayeff | |
2002-03-07 | use an augmented red-black tree to keep track of free space in the vm_map. | Niels Provos | |
uvm_tree_sanity is left as debugging help but needs to be enabled manually. okay art@ | |||
2002-03-06 | Some architectures don't allocate any memory out of the kernel_map space | Artur Grabowski | |
before uvm_km_init (alpha). Don't uvm_map 0 space, it gives very strange breakage on alpha. | |||
2002-02-28 | use red-black tree for lookup_entry. the red-black tree case for | Niels Provos | |
map_findspace is still broken on alpha. this will make debugging easier. okay millert@ | |||
2002-02-28 | setting prevlcv to 0 doesnt require additional checks. from chs@ | Niels Provos | |
2002-02-25 | back out red-black tree. they are very fast but alpha UVM is broken and | Niels Provos | |
the tree triggers the bug, PMAP_PREFER case was broken also. | |||
2002-02-25 | use a red-black tree to find entries in the vm_map. augment the red-black | Niels Provos | |
tree to find free space between entries. speeds up memory allocation, etc... | |||
2002-02-20 | merging ppref could cause negative back reference, fix from niklas@ | Niels Provos | |
2002-02-19 | amap_pp_adjref could fragment ppref array; fix by merging adjacent chunks; | Niels Provos | |
from Chuck Silvers; okay art@ | |||
2002-02-18 | From the UBC branch and NetBSD. | Artur Grabowski | |
We allocate map entries for the non-intrsafe kernel map (most notably kernel_map and exec_map) from a pool that's backed by kmem_map (to avoid deadlocking). This should get rid of MAX_KMAPENT panics. | |||
2002-02-16 | Don't prototype functions if they are really just macros. | Todd C. Miller | |
2002-02-14 | Correctly FREF/FRELE in mmap(2). | Artur Grabowski | |
2002-02-12 | amap_extend is very expensive, allocate more memory to avoid bcopy the next | Niels Provos | |
time around; my fix was very similiar to netbsd, take netbsd fix; okay art@ | |||
2002-02-10 | spelling | Theo de Raadt | |
2002-01-28 | allocate vm pages with uvm_km_alloc (this code is ifdefed out anyway). | Artur Grabowski | |
2002-01-28 | PR_MALLOCOK is not necessary. | Artur Grabowski | |
2002-01-23 | Pool deals fairly well with physical memory shortage, but it doesn't deal | Artur Grabowski | |
well (not at all) with shortages of the vm_map where the pages are mapped (usually kmem_map). Try to deal with it: - group all information the backend allocator for a pool in a separate struct. The pool will only have a pointer to that struct. - change the pool_init API to reflect that. - link all pools allocating from the same allocator on a linked list. - Since an allocator is responsible to wait for physical memory it will only fail (waitok) when it runs out of its backing vm_map, carefully drain pools using the same allocator so that va space is freed. (see comments in code for caveats and details). - change pool_reclaim to return if it actually succeeded to free some memory, use that information to make draining easier and more efficient. - get rid of PR_URGENT, noone uses it. | |||
2002-01-15 | A fix to amap_wiperange from Chuck Cranor that has been in my tree for | Artur Grabowski | |
a while. With his words: " here is a fix for a bug in amap_wiperange (was posted on netbsd's tech-kern list). i screwed up the loop control :(" | |||
2002-01-02 | Back out a few more uvm changes, especially wrt swap usage. | Miod Vallat | |
This unbreaks m68k m88k sparc and perhaps others, which eventually froze when hitting swap. Tested by various people on various platforms. ok art@ | |||
2002-01-02 | Add more vocabulary (commands) to ddb, from NetBSD. | Miod Vallat | |
ok art@ (manual page update coming soon) | |||
2001-12-19 | UBC was a disaster. It worked very good when it worked, but on some | Artur Grabowski | |
machines or some configurations or in some phase of the moon (we actually don't know when or why) files disappeared. Since we've not been able to track down the problem in two weeks intense debugging and we need -current to be stable, back out everything to a state it had before UBC. We apologise for the inconvenience. | |||
2001-12-10 | Merge in struct uvm_vnode into struct vnode. | Artur Grabowski | |
2001-12-06 | remove unnecessary newline | Niklas Hallqvist | |
2001-12-06 | Keep track of how many pages a vnode hold with vhold and vholdrele | Artur Grabowski | |
so that we can get back the old behavior where a vnode with cached data is less likely to be recycled than a vnode without cached data. XXX - This is a brute-force solution - we do it where uvmexp.vnodepages are changed, I am not really sure it is correct but people have been very happy with the diff so far and want this in the tree. | |||
2001-12-04 | Yet another sync to NetBSD uvm. | Artur Grabowski | |
Today we add a pmap argument to pmap_update() and allocate map entries for kernel_map from kmem_map instead of using the static entries. This should get rid of MAX_KMAPENT panics. Also some uvm_loan problems are fixed. | |||
2001-12-02 | VOP_GETPAGES expects the vnode locked. Make it so. | Artur Grabowski | |
Note that VOP_PUTPAGES has the same problems, but the fix will be more complicated. |