uvm_vnode.c revision 1.66 1 1.66 thorpej /* $NetBSD: uvm_vnode.c,v 1.66 2005/06/27 02:29:32 thorpej Exp $ */
2 1.1 mrg
3 1.1 mrg /*
4 1.1 mrg * Copyright (c) 1997 Charles D. Cranor and Washington University.
5 1.1 mrg * Copyright (c) 1991, 1993
6 1.49 chs * The Regents of the University of California.
7 1.1 mrg * Copyright (c) 1990 University of Utah.
8 1.1 mrg *
9 1.1 mrg * All rights reserved.
10 1.1 mrg *
11 1.1 mrg * This code is derived from software contributed to Berkeley by
12 1.1 mrg * the Systems Programming Group of the University of Utah Computer
13 1.1 mrg * Science Department.
14 1.1 mrg *
15 1.1 mrg * Redistribution and use in source and binary forms, with or without
16 1.1 mrg * modification, are permitted provided that the following conditions
17 1.1 mrg * are met:
18 1.1 mrg * 1. Redistributions of source code must retain the above copyright
19 1.1 mrg * notice, this list of conditions and the following disclaimer.
20 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
21 1.1 mrg * notice, this list of conditions and the following disclaimer in the
22 1.1 mrg * documentation and/or other materials provided with the distribution.
23 1.1 mrg * 3. All advertising materials mentioning features or use of this software
24 1.1 mrg * must display the following acknowledgement:
25 1.1 mrg * This product includes software developed by Charles D. Cranor,
26 1.49 chs * Washington University, the University of California, Berkeley and
27 1.1 mrg * its contributors.
28 1.1 mrg * 4. Neither the name of the University nor the names of its contributors
29 1.1 mrg * may be used to endorse or promote products derived from this software
30 1.1 mrg * without specific prior written permission.
31 1.1 mrg *
32 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
33 1.1 mrg * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
34 1.1 mrg * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
35 1.1 mrg * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
36 1.1 mrg * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
37 1.1 mrg * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
38 1.1 mrg * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
39 1.1 mrg * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
40 1.1 mrg * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
41 1.1 mrg * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42 1.1 mrg * SUCH DAMAGE.
43 1.1 mrg *
44 1.1 mrg * @(#)vnode_pager.c 8.8 (Berkeley) 2/13/94
45 1.3 mrg * from: Id: uvm_vnode.c,v 1.1.2.26 1998/02/02 20:38:07 chuck Exp
46 1.1 mrg */
47 1.1 mrg
48 1.55 lukem /*
49 1.55 lukem * uvm_vnode.c: the vnode pager.
50 1.55 lukem */
51 1.55 lukem
52 1.55 lukem #include <sys/cdefs.h>
53 1.66 thorpej __KERNEL_RCSID(0, "$NetBSD: uvm_vnode.c,v 1.66 2005/06/27 02:29:32 thorpej Exp $");
54 1.55 lukem
55 1.6 thorpej #include "fs_nfs.h"
56 1.4 mrg #include "opt_uvmhist.h"
57 1.37 chs #include "opt_ddb.h"
58 1.1 mrg
59 1.1 mrg #include <sys/param.h>
60 1.1 mrg #include <sys/systm.h>
61 1.37 chs #include <sys/kernel.h>
62 1.1 mrg #include <sys/proc.h>
63 1.1 mrg #include <sys/malloc.h>
64 1.1 mrg #include <sys/vnode.h>
65 1.13 thorpej #include <sys/disklabel.h>
66 1.13 thorpej #include <sys/ioctl.h>
67 1.13 thorpej #include <sys/fcntl.h>
68 1.13 thorpej #include <sys/conf.h>
69 1.37 chs #include <sys/pool.h>
70 1.37 chs #include <sys/mount.h>
71 1.13 thorpej
72 1.13 thorpej #include <miscfs/specfs/specdev.h>
73 1.1 mrg
74 1.1 mrg #include <uvm/uvm.h>
75 1.1 mrg
76 1.1 mrg /*
77 1.1 mrg * functions
78 1.1 mrg */
79 1.1 mrg
80 1.66 thorpej static void uvn_detach(struct uvm_object *);
81 1.66 thorpej static int uvn_get(struct uvm_object *, voff_t, struct vm_page **, int *,
82 1.66 thorpej int, vm_prot_t, int, int);
83 1.66 thorpej static int uvn_put(struct uvm_object *, voff_t, voff_t, int);
84 1.66 thorpej static void uvn_reference(struct uvm_object *);
85 1.52 chs
86 1.66 thorpej static int uvn_findpage(struct uvm_object *, voff_t, struct vm_page **,
87 1.66 thorpej int);
88 1.1 mrg
89 1.1 mrg /*
90 1.1 mrg * master pager structure
91 1.1 mrg */
92 1.1 mrg
93 1.1 mrg struct uvm_pagerops uvm_vnodeops = {
94 1.37 chs NULL,
95 1.8 mrg uvn_reference,
96 1.8 mrg uvn_detach,
97 1.37 chs NULL,
98 1.8 mrg uvn_get,
99 1.8 mrg uvn_put,
100 1.1 mrg };
101 1.1 mrg
102 1.1 mrg /*
103 1.1 mrg * the ops!
104 1.1 mrg */
105 1.1 mrg
106 1.1 mrg /*
107 1.1 mrg * uvn_attach
108 1.1 mrg *
109 1.1 mrg * attach a vnode structure to a VM object. if the vnode is already
110 1.1 mrg * attached, then just bump the reference count by one and return the
111 1.1 mrg * VM object. if not already attached, attach and return the new VM obj.
112 1.1 mrg * the "accessprot" tells the max access the attaching thread wants to
113 1.1 mrg * our pages.
114 1.1 mrg *
115 1.1 mrg * => caller must _not_ already be holding the lock on the uvm_object.
116 1.1 mrg * => in fact, nothing should be locked so that we can sleep here.
117 1.1 mrg * => note that uvm_object is first thing in vnode structure, so their
118 1.1 mrg * pointers are equiv.
119 1.1 mrg */
120 1.1 mrg
121 1.8 mrg struct uvm_object *
122 1.65 thorpej uvn_attach(void *arg, vm_prot_t accessprot)
123 1.8 mrg {
124 1.8 mrg struct vnode *vp = arg;
125 1.52 chs struct uvm_object *uobj = &vp->v_uobj;
126 1.8 mrg struct vattr vattr;
127 1.59 gehenna const struct bdevsw *bdev;
128 1.37 chs int result;
129 1.13 thorpej struct partinfo pi;
130 1.37 chs voff_t used_vnode_size;
131 1.8 mrg UVMHIST_FUNC("uvn_attach"); UVMHIST_CALLED(maphist);
132 1.8 mrg
133 1.8 mrg UVMHIST_LOG(maphist, "(vn=0x%x)", arg,0,0,0);
134 1.37 chs used_vnode_size = (voff_t)0;
135 1.13 thorpej
136 1.8 mrg /*
137 1.52 chs * first get a lock on the uobj.
138 1.8 mrg */
139 1.52 chs
140 1.52 chs simple_lock(&uobj->vmobjlock);
141 1.52 chs while (vp->v_flag & VXLOCK) {
142 1.52 chs vp->v_flag |= VXWANT;
143 1.8 mrg UVMHIST_LOG(maphist, " SLEEPING on blocked vn",0,0,0,0);
144 1.52 chs UVM_UNLOCK_AND_WAIT(uobj, &uobj->vmobjlock, FALSE,
145 1.8 mrg "uvn_attach", 0);
146 1.52 chs simple_lock(&uobj->vmobjlock);
147 1.8 mrg UVMHIST_LOG(maphist," WOKE UP",0,0,0,0);
148 1.8 mrg }
149 1.1 mrg
150 1.8 mrg /*
151 1.18 bouyer * if we're mapping a BLK device, make sure it is a disk.
152 1.13 thorpej */
153 1.59 gehenna if (vp->v_type == VBLK) {
154 1.59 gehenna bdev = bdevsw_lookup(vp->v_rdev);
155 1.59 gehenna if (bdev == NULL || bdev->d_type != D_DISK) {
156 1.59 gehenna simple_unlock(&uobj->vmobjlock);
157 1.59 gehenna UVMHIST_LOG(maphist,"<- done (VBLK not D_DISK!)",
158 1.59 gehenna 0,0,0,0);
159 1.59 gehenna return(NULL);
160 1.59 gehenna }
161 1.13 thorpej }
162 1.51 chs KASSERT(vp->v_type == VREG || vp->v_type == VBLK);
163 1.37 chs
164 1.13 thorpej /*
165 1.37 chs * set up our idea of the size
166 1.37 chs * if this hasn't been done already.
167 1.8 mrg */
168 1.52 chs if (vp->v_size == VSIZENOTSET) {
169 1.8 mrg
170 1.52 chs
171 1.52 chs vp->v_flag |= VXLOCK;
172 1.52 chs simple_unlock(&uobj->vmobjlock); /* drop lock in case we sleep */
173 1.8 mrg /* XXX: curproc? */
174 1.13 thorpej if (vp->v_type == VBLK) {
175 1.13 thorpej /*
176 1.13 thorpej * We could implement this as a specfs getattr call, but:
177 1.13 thorpej *
178 1.13 thorpej * (1) VOP_GETATTR() would get the file system
179 1.13 thorpej * vnode operation, not the specfs operation.
180 1.13 thorpej *
181 1.13 thorpej * (2) All we want is the size, anyhow.
182 1.13 thorpej */
183 1.59 gehenna bdev = bdevsw_lookup(vp->v_rdev);
184 1.59 gehenna if (bdev != NULL) {
185 1.59 gehenna result = (*bdev->d_ioctl)(vp->v_rdev, DIOCGPART,
186 1.62 fvdl (caddr_t)&pi, FREAD, curproc);
187 1.59 gehenna } else {
188 1.59 gehenna result = ENXIO;
189 1.59 gehenna }
190 1.13 thorpej if (result == 0) {
191 1.13 thorpej /* XXX should remember blocksize */
192 1.37 chs used_vnode_size = (voff_t)pi.disklab->d_secsize *
193 1.37 chs (voff_t)pi.part->p_size;
194 1.13 thorpej }
195 1.13 thorpej } else {
196 1.62 fvdl result = VOP_GETATTR(vp, &vattr, curproc->p_ucred, curproc);
197 1.13 thorpej if (result == 0)
198 1.13 thorpej used_vnode_size = vattr.va_size;
199 1.8 mrg }
200 1.1 mrg
201 1.8 mrg /* relock object */
202 1.52 chs simple_lock(&uobj->vmobjlock);
203 1.37 chs
204 1.52 chs if (vp->v_flag & VXWANT) {
205 1.52 chs wakeup(vp);
206 1.52 chs }
207 1.52 chs vp->v_flag &= ~(VXLOCK|VXWANT);
208 1.1 mrg
209 1.8 mrg if (result != 0) {
210 1.52 chs simple_unlock(&uobj->vmobjlock);
211 1.8 mrg UVMHIST_LOG(maphist,"<- done (VOP_GETATTR FAILED!)", 0,0,0,0);
212 1.8 mrg return(NULL);
213 1.8 mrg }
214 1.52 chs vp->v_size = used_vnode_size;
215 1.8 mrg
216 1.8 mrg }
217 1.8 mrg
218 1.52 chs simple_unlock(&uobj->vmobjlock);
219 1.52 chs UVMHIST_LOG(maphist,"<- done, refcnt=%d", vp->v_usecount,
220 1.37 chs 0, 0, 0);
221 1.52 chs return uobj;
222 1.1 mrg }
223 1.1 mrg
224 1.1 mrg
225 1.1 mrg /*
226 1.1 mrg * uvn_reference
227 1.1 mrg *
228 1.1 mrg * duplicate a reference to a VM object. Note that the reference
229 1.49 chs * count must already be at least one (the passed in reference) so
230 1.1 mrg * there is no chance of the uvn being killed or locked out here.
231 1.1 mrg *
232 1.49 chs * => caller must call with object unlocked.
233 1.1 mrg * => caller must be using the same accessprot as was used at attach time
234 1.1 mrg */
235 1.1 mrg
236 1.66 thorpej static void
237 1.65 thorpej uvn_reference(struct uvm_object *uobj)
238 1.1 mrg {
239 1.37 chs VREF((struct vnode *)uobj);
240 1.1 mrg }
241 1.1 mrg
242 1.52 chs
243 1.1 mrg /*
244 1.1 mrg * uvn_detach
245 1.1 mrg *
246 1.1 mrg * remove a reference to a VM object.
247 1.1 mrg *
248 1.1 mrg * => caller must call with object unlocked and map locked.
249 1.1 mrg */
250 1.52 chs
251 1.66 thorpej static void
252 1.65 thorpej uvn_detach(struct uvm_object *uobj)
253 1.8 mrg {
254 1.37 chs vrele((struct vnode *)uobj);
255 1.1 mrg }
256 1.1 mrg
257 1.1 mrg /*
258 1.1 mrg * uvn_put: flush page data to backing store.
259 1.1 mrg *
260 1.53 sommerfe * => object must be locked on entry! VOP_PUTPAGES must unlock it.
261 1.1 mrg * => flags: PGO_SYNCIO -- use sync. I/O
262 1.1 mrg * => note: caller must set PG_CLEAN and pmap_clear_modify (if needed)
263 1.1 mrg */
264 1.1 mrg
265 1.66 thorpej static int
266 1.65 thorpej uvn_put(struct uvm_object *uobj, voff_t offlo, voff_t offhi, int flags)
267 1.1 mrg {
268 1.37 chs struct vnode *vp = (struct vnode *)uobj;
269 1.37 chs int error;
270 1.1 mrg
271 1.53 sommerfe LOCK_ASSERT(simple_lock_held(&vp->v_interlock));
272 1.54 chs error = VOP_PUTPAGES(vp, offlo, offhi, flags);
273 1.53 sommerfe LOCK_ASSERT(!simple_lock_held(&vp->v_interlock));
274 1.48 chs return error;
275 1.1 mrg }
276 1.1 mrg
277 1.1 mrg
278 1.1 mrg /*
279 1.1 mrg * uvn_get: get pages (synchronously) from backing store
280 1.1 mrg *
281 1.1 mrg * => prefer map unlocked (not required)
282 1.1 mrg * => object must be locked! we will _unlock_ it before starting any I/O.
283 1.1 mrg * => flags: PGO_ALLPAGES: get all of the pages
284 1.1 mrg * PGO_LOCKED: fault data structures are locked
285 1.1 mrg * => NOTE: offset is the offset of pps[0], _NOT_ pps[centeridx]
286 1.1 mrg * => NOTE: caller must check for released pages!!
287 1.1 mrg */
288 1.49 chs
289 1.66 thorpej static int
290 1.65 thorpej uvn_get(struct uvm_object *uobj, voff_t offset,
291 1.65 thorpej struct vm_page **pps /* IN/OUT */,
292 1.65 thorpej int *npagesp /* IN (OUT if PGO_LOCKED)*/,
293 1.65 thorpej int centeridx, vm_prot_t access_type, int advice, int flags)
294 1.8 mrg {
295 1.37 chs struct vnode *vp = (struct vnode *)uobj;
296 1.37 chs int error;
297 1.37 chs UVMHIST_FUNC("uvn_get"); UVMHIST_CALLED(ubchist);
298 1.37 chs
299 1.37 chs UVMHIST_LOG(ubchist, "vp %p off 0x%x", vp, (int)offset, 0,0);
300 1.37 chs error = VOP_GETPAGES(vp, offset, pps, npagesp, centeridx,
301 1.37 chs access_type, advice, flags);
302 1.48 chs return error;
303 1.37 chs }
304 1.8 mrg
305 1.8 mrg
306 1.37 chs /*
307 1.37 chs * uvn_findpages:
308 1.37 chs * return the page for the uobj and offset requested, allocating if needed.
309 1.37 chs * => uobj must be locked.
310 1.52 chs * => returned pages will be BUSY.
311 1.37 chs */
312 1.1 mrg
313 1.58 enami int
314 1.65 thorpej uvn_findpages(struct uvm_object *uobj, voff_t offset, int *npagesp,
315 1.65 thorpej struct vm_page **pgs, int flags)
316 1.37 chs {
317 1.58 enami int i, count, found, npages, rv;
318 1.8 mrg
319 1.58 enami count = found = 0;
320 1.37 chs npages = *npagesp;
321 1.52 chs if (flags & UFP_BACKWARD) {
322 1.52 chs for (i = npages - 1; i >= 0; i--, offset -= PAGE_SIZE) {
323 1.52 chs rv = uvn_findpage(uobj, offset, &pgs[i], flags);
324 1.58 enami if (rv == 0) {
325 1.58 enami if (flags & UFP_DIRTYONLY)
326 1.58 enami break;
327 1.58 enami } else
328 1.58 enami found++;
329 1.52 chs count++;
330 1.52 chs }
331 1.52 chs } else {
332 1.52 chs for (i = 0; i < npages; i++, offset += PAGE_SIZE) {
333 1.52 chs rv = uvn_findpage(uobj, offset, &pgs[i], flags);
334 1.58 enami if (rv == 0) {
335 1.58 enami if (flags & UFP_DIRTYONLY)
336 1.58 enami break;
337 1.58 enami } else
338 1.58 enami found++;
339 1.52 chs count++;
340 1.52 chs }
341 1.37 chs }
342 1.52 chs *npagesp = count;
343 1.58 enami return (found);
344 1.37 chs }
345 1.8 mrg
346 1.66 thorpej static int
347 1.65 thorpej uvn_findpage(struct uvm_object *uobj, voff_t offset, struct vm_page **pgp,
348 1.65 thorpej int flags)
349 1.37 chs {
350 1.37 chs struct vm_page *pg;
351 1.52 chs boolean_t dirty;
352 1.37 chs UVMHIST_FUNC("uvn_findpage"); UVMHIST_CALLED(ubchist);
353 1.37 chs UVMHIST_LOG(ubchist, "vp %p off 0x%lx", uobj, offset,0,0);
354 1.8 mrg
355 1.37 chs if (*pgp != NULL) {
356 1.37 chs UVMHIST_LOG(ubchist, "dontcare", 0,0,0,0);
357 1.37 chs return 0;
358 1.37 chs }
359 1.37 chs for (;;) {
360 1.37 chs /* look for an existing page */
361 1.37 chs pg = uvm_pagelookup(uobj, offset);
362 1.37 chs
363 1.52 chs /* nope? allocate one now */
364 1.37 chs if (pg == NULL) {
365 1.37 chs if (flags & UFP_NOALLOC) {
366 1.37 chs UVMHIST_LOG(ubchist, "noalloc", 0,0,0,0);
367 1.37 chs return 0;
368 1.37 chs }
369 1.47 chs pg = uvm_pagealloc(uobj, offset, NULL, 0);
370 1.37 chs if (pg == NULL) {
371 1.37 chs if (flags & UFP_NOWAIT) {
372 1.37 chs UVMHIST_LOG(ubchist, "nowait",0,0,0,0);
373 1.37 chs return 0;
374 1.8 mrg }
375 1.37 chs simple_unlock(&uobj->vmobjlock);
376 1.37 chs uvm_wait("uvn_fp1");
377 1.8 mrg simple_lock(&uobj->vmobjlock);
378 1.37 chs continue;
379 1.47 chs }
380 1.52 chs UVMHIST_LOG(ubchist, "alloced %p", pg,0,0,0);
381 1.37 chs break;
382 1.37 chs } else if (flags & UFP_NOCACHE) {
383 1.37 chs UVMHIST_LOG(ubchist, "nocache",0,0,0,0);
384 1.37 chs return 0;
385 1.8 mrg }
386 1.8 mrg
387 1.37 chs /* page is there, see if we need to wait on it */
388 1.52 chs if ((pg->flags & PG_BUSY) != 0) {
389 1.37 chs if (flags & UFP_NOWAIT) {
390 1.37 chs UVMHIST_LOG(ubchist, "nowait",0,0,0,0);
391 1.37 chs return 0;
392 1.37 chs }
393 1.37 chs pg->flags |= PG_WANTED;
394 1.58 enami UVMHIST_LOG(ubchist, "wait %p", pg,0,0,0);
395 1.37 chs UVM_UNLOCK_AND_WAIT(pg, &uobj->vmobjlock, 0,
396 1.37 chs "uvn_fp2", 0);
397 1.37 chs simple_lock(&uobj->vmobjlock);
398 1.37 chs continue;
399 1.8 mrg }
400 1.49 chs
401 1.37 chs /* skip PG_RDONLY pages if requested */
402 1.37 chs if ((flags & UFP_NORDONLY) && (pg->flags & PG_RDONLY)) {
403 1.37 chs UVMHIST_LOG(ubchist, "nordonly",0,0,0,0);
404 1.37 chs return 0;
405 1.8 mrg }
406 1.8 mrg
407 1.52 chs /* stop on clean pages if requested */
408 1.52 chs if (flags & UFP_DIRTYONLY) {
409 1.52 chs dirty = pmap_clear_modify(pg) ||
410 1.52 chs (pg->flags & PG_CLEAN) == 0;
411 1.52 chs pg->flags |= PG_CLEAN;
412 1.52 chs if (!dirty) {
413 1.58 enami UVMHIST_LOG(ubchist, "dirtonly", 0,0,0,0);
414 1.52 chs return 0;
415 1.52 chs }
416 1.52 chs }
417 1.52 chs
418 1.37 chs /* mark the page BUSY and we're done. */
419 1.37 chs pg->flags |= PG_BUSY;
420 1.37 chs UVM_PAGE_OWN(pg, "uvn_findpage");
421 1.52 chs UVMHIST_LOG(ubchist, "found %p", pg,0,0,0);
422 1.37 chs break;
423 1.8 mrg }
424 1.37 chs *pgp = pg;
425 1.37 chs return 1;
426 1.1 mrg }
427 1.1 mrg
428 1.1 mrg /*
429 1.52 chs * uvm_vnp_setsize: grow or shrink a vnode uobj
430 1.1 mrg *
431 1.1 mrg * grow => just update size value
432 1.1 mrg * shrink => toss un-needed pages
433 1.1 mrg *
434 1.49 chs * => we assume that the caller has a reference of some sort to the
435 1.1 mrg * vnode in question so that it will not be yanked out from under
436 1.1 mrg * us.
437 1.1 mrg */
438 1.1 mrg
439 1.8 mrg void
440 1.65 thorpej uvm_vnp_setsize(struct vnode *vp, voff_t newsize)
441 1.8 mrg {
442 1.52 chs struct uvm_object *uobj = &vp->v_uobj;
443 1.46 enami voff_t pgend = round_page(newsize);
444 1.37 chs UVMHIST_FUNC("uvm_vnp_setsize"); UVMHIST_CALLED(ubchist);
445 1.37 chs
446 1.52 chs simple_lock(&uobj->vmobjlock);
447 1.52 chs UVMHIST_LOG(ubchist, "vp %p old 0x%x new 0x%x",
448 1.52 chs vp, vp->v_size, newsize, 0);
449 1.1 mrg
450 1.8 mrg /*
451 1.37 chs * now check if the size has changed: if we shrink we had better
452 1.37 chs * toss some pages...
453 1.8 mrg */
454 1.1 mrg
455 1.52 chs if (vp->v_size > pgend && vp->v_size != VSIZENOTSET) {
456 1.57 chs (void) uvn_put(uobj, pgend, 0, PGO_FREE | PGO_SYNCIO);
457 1.52 chs } else {
458 1.52 chs simple_unlock(&uobj->vmobjlock);
459 1.8 mrg }
460 1.52 chs vp->v_size = newsize;
461 1.1 mrg }
462 1.1 mrg
463 1.1 mrg /*
464 1.37 chs * uvm_vnp_zerorange: set a range of bytes in a file to zero.
465 1.1 mrg */
466 1.1 mrg
467 1.8 mrg void
468 1.65 thorpej uvm_vnp_zerorange(struct vnode *vp, off_t off, size_t len)
469 1.8 mrg {
470 1.64 chs void *win;
471 1.64 chs int flags;
472 1.64 chs
473 1.64 chs /*
474 1.64 chs * XXXUBC invent kzero() and use it
475 1.64 chs */
476 1.8 mrg
477 1.64 chs while (len) {
478 1.64 chs vsize_t bytelen = len;
479 1.64 chs
480 1.64 chs win = ubc_alloc(&vp->v_uobj, off, &bytelen, UBC_WRITE);
481 1.64 chs memset(win, 0, bytelen);
482 1.64 chs flags = UBC_WANT_UNMAP(vp) ? UBC_UNMAP : 0;
483 1.64 chs ubc_release(win, flags);
484 1.64 chs
485 1.64 chs off += bytelen;
486 1.64 chs len -= bytelen;
487 1.64 chs }
488 1.1 mrg }
489