summaryrefslogtreecommitdiff
path: root/ufs/sizes.c
blob: 5c3d12f088a7e7a7d28d765eaac1f29f6e89039a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
/* File growth and truncation
   Copyright (C) 1993, 1994, 1995, 1996, 1997 Free Software Foundation

This file is part of the GNU Hurd.

The GNU Hurd is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.

The GNU Hurd is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with the GNU Hurd; see the file COPYING.  If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.  */

/* Written by Michael I. Bushnell.  */

#include "ufs.h"
#include <string.h>

#ifdef DONT_CACHE_MEMORY_OBJECTS
#define MAY_CACHE 0
#else
#define MAY_CACHE 1
#endif

static int indir_release (struct node *np, daddr_t bno, int level);
static void poke_pages (memory_object_t, vm_offset_t, vm_offset_t);

/* Implement the diskfs_truncate callback; sse <hurd/diskfs.h> for the
   interface description. */
error_t
diskfs_truncate (struct node *np,
		 off_t length)
{
  int offset;
  struct dinode *di = dino (np->dn->number);
  volatile int blocksfreed = 0;
  error_t err;
  int i;
  struct iblock_spec indirs[NIADDR + 1];
  volatile daddr_t lbn;
  struct user_pager_info *upi;

  if (length >= np->dn_stat.st_size)
    return 0;

  diskfs_check_readonly ();
  assert (!diskfs_readonly);

  /* First check to see if this is a kludged symlink; if so
     this is special. */
  if (direct_symlink_extension && S_ISLNK (np->dn_stat.st_mode)
      && np->dn_stat.st_size < sblock->fs_maxsymlinklen)
    {
      error_t err;

      err = diskfs_catch_exception ();
      if (err)
	return err;
      bzero ((char *)di->di_shortlink + length, np->dn_stat.st_size - length);
      record_poke (di, sizeof (struct dinode));
      diskfs_end_catch_exception ();
      np->dn_stat.st_size = length;
      np->dn_set_ctime = np->dn_set_mtime = 1;
      diskfs_node_update (np, 1);
      return 0;
    }

  /* If the file is not being trucated to a block boundary,
     the zero the partial bit in the new last block. */
  offset = blkoff (sblock, length);
  if (offset)
    {
      int bsize;			/* size of new last block */
      int savesize = np->allocsize;

      np->allocsize = length;	/* temporary */
      bsize = blksize (sblock, np, lblkno (sblock, length));
      np->allocsize = savesize;
      diskfs_node_rdwr (np, zeroblock, length, bsize - offset, 1, 0, 0);
      diskfs_file_update (np, 1);
    }

  /* Now flush all the data past the new size from the kernel.
     Also force any delayed copies of this data to take place
     immediately.  (We are implicitly changing the data to zeros
     and doing it without the kernel's immediate knowledge;
     accordingl we must help out the kernel thusly.) */
  spin_lock (&node2pagelock);
  upi = np->dn->fileinfo;
  if (upi)
    ports_port_ref (upi->p);
  spin_unlock (&node2pagelock);

  if (upi)
    {
      mach_port_t obj;

      pager_change_attributes (upi->p, MAY_CACHE,
			       MEMORY_OBJECT_COPY_NONE, 1);
      obj = diskfs_get_filemap (np, VM_PROT_READ | VM_PROT_WRITE);
      if (obj != MACH_PORT_NULL)
	{
	  /* XXX should cope with errors from diskfs_get_filemap */
	  poke_pages (obj, round_page (length), round_page (np->allocsize));
	  mach_port_deallocate (mach_task_self (), obj);
	  pager_flush_some (upi->p, round_page (length),
			    np->allocsize - length, 1);
	}
      ports_port_deref (upi->p);
    }

  rwlock_writer_lock (&np->dn->allocptrlock);

  /* Update the size on disk; fsck will finish freeing blocks if necessary
     should we crash. */
  np->dn_stat.st_size = length;
  np->dn_set_mtime = 1;
  np->dn_set_ctime = 1;
  diskfs_node_update (np, 1);

  /* Find out the location information for the last block to
     be retained */
  lbn = lblkno (sblock, length - 1);
  err = fetch_indir_spec (np, lbn, indirs);
  /* err XXX */

  /* We don't support triple indirs */
  assert (indirs[3].offset == -2);

  err = diskfs_catch_exception ();
  /* err XXX */

  /* BSD carefully finds out how far to clear; it's vastly simpler
     to just clear everything after the new last block. */

  /* Free direct blocks */
  if (indirs[0].offset < 0)
    {
      /* ...mapped from the inode. */
      for (i = lbn + 1; i < NDADDR; i++)
	if (di->di_db[i])
	  {
	    long bsize = blksize (sblock, np, i);
	    ffs_blkfree (np, read_disk_entry (di->di_db[i]), bsize);
	    di->di_db[i] = 0;
	    blocksfreed += btodb (bsize);
	  }
    }
  else
    {
      /* ... or mapped from sindir */
      if (indirs[1].bno)
	{
	  daddr_t *sindir = indir_block (indirs[1].bno);
	  for (i = indirs[0].offset + 1; i < NINDIR (sblock); i++)
	    if (sindir[i])
	      {
		ffs_blkfree (np, read_disk_entry (sindir[i]), 
			     sblock->fs_bsize);
		sindir[i] = 0;
		blocksfreed += btodb (sblock->fs_bsize);
	      }
	  record_poke (sindir, sblock->fs_bsize);
	}
    }

  /* Free single indirect blocks */
  if (indirs[1].offset < 0)
    {
      /* ...mapped from the inode */
      if (di->di_ib[INDIR_SINGLE] && indirs[1].offset == -2)
	{
	  blocksfreed += indir_release (np, 
					read_disk_entry (di->di_ib
							 [INDIR_SINGLE]),
					INDIR_SINGLE);
	  di->di_ib[INDIR_SINGLE] = 0;
	}
    }
  else
    {
      /* ...or mapped from dindir */
      if (indirs[2].bno)
	{
	  daddr_t *dindir = indir_block (indirs[2].bno);
	  for (i = indirs[1].offset + 1; i < NINDIR (sblock); i++)
	    if (dindir[i])
	      {
		blocksfreed += indir_release (np, 
					      read_disk_entry (dindir[i]),
					      INDIR_SINGLE);
		dindir[i] = 0;
	      }
	  record_poke (dindir, sblock->fs_bsize);
	}
    }

  /* Free double indirect block */
  assert (indirs[2].offset < 0); /* which must be mapped from the inode */
  if (indirs[2].offset == -2)
    {
      if (di->di_ib[INDIR_DOUBLE])
	{
	  blocksfreed += indir_release (np, 
					read_disk_entry (di->di_ib
							 [INDIR_DOUBLE]),
					INDIR_DOUBLE);
	  di->di_ib[INDIR_DOUBLE] = 0;
	}
    }

  /* Finally, check to see if the new last direct block is
     changing size; if so release any frags necessary. */
  if (lbn >= 0 && lbn < NDADDR && di->di_db[lbn])
    {
      long oldspace, newspace;
      daddr_t bn;

      bn = read_disk_entry (di->di_db[lbn]);
      oldspace = blksize (sblock, np, lbn);
      np->allocsize = fragroundup (sblock, length);
      newspace = blksize (sblock, np, lbn);

      assert (newspace);

      if (oldspace - newspace)
	{
	  bn += numfrags (sblock, newspace);
	  ffs_blkfree (np, bn, oldspace - newspace);
	  blocksfreed += btodb (oldspace - newspace);
	}
    }
  else
    {
      if (lbn > NDADDR)
	np->allocsize = blkroundup (sblock, length);
      else
	np->allocsize = fragroundup (sblock, length);
    }

  record_poke (di, sizeof (struct dinode));

  np->dn_stat.st_blocks -= blocksfreed;
  np->dn_set_ctime = 1;
  diskfs_node_update (np, 1);

  rwlock_writer_unlock (&np->dn->allocptrlock);

  /* At this point the last block (as defined by np->allocsize)
     might not be allocated.  We need to allocate it to maintain
     the rule that the last block of a file is always allocated. */

  if (np->allocsize && indirs[0].bno == 0)
    {
      /* The strategy is to reduce LBN until we get one that's allocated;
	 then reduce allocsize accordingly, then call diskfs_grow. */

      do
	err = fetch_indir_spec (np, --lbn, indirs);
      /* err XXX */
      while (indirs[0].bno == 0 && lbn >= 0);

      assert ((lbn + 1) * sblock->fs_bsize < np->allocsize);
      np->allocsize = (lbn + 1) * sblock->fs_bsize;

      diskfs_grow (np, length, 0);
    }

  diskfs_end_catch_exception ();

  /* Now we can permit delayed copies again. */
  spin_lock (&node2pagelock);
  upi = np->dn->fileinfo;
  if (upi)
    ports_port_ref (upi->p);
  spin_unlock (&node2pagelock);
  if (upi)
    {
      pager_change_attributes (upi->p, MAY_CACHE,
			       MEMORY_OBJECT_COPY_DELAY, 0);
      ports_port_deref (upi->p);
    }

  return err;
}

/* Free indirect block BNO of level LEVEL; recursing if necessary
   to free other indirect blocks.  Return the number of disk
   blocks freed. */
static int
indir_release (struct node *np, daddr_t bno, int level)
{
  int count = 0;
  daddr_t *addrs;
  int i;
  struct dirty_indir *d, *prev, *next;

  assert (bno);

  addrs = indir_block (bno);
  for (i = 0; i < NINDIR (sblock); i++)
    if (addrs[i])
      {
	if (level == INDIR_SINGLE)
	  {
	    ffs_blkfree (np, read_disk_entry (addrs[i]), sblock->fs_bsize);
	    count += btodb (sblock->fs_bsize);
	  }
	else
	  count += indir_release (np, read_disk_entry (addrs[i]), level - 1);
      }

  /* Subtlety: this block is no longer necessary; the information
     the kernel has cached corresponding to ADDRS is now unimportant.
     Consider that if this block is allocated to a file, it will then
     be double cached and the kernel might decide to write out
     the disk_image version of the block.  So we have to flush
     the block from the kernel's memory, making sure we do it
     synchronously--and BEFORE we attach it to the free list
     with ffs_blkfree.  */
  pager_flush_some (diskfs_disk_pager, fsaddr (sblock, bno), sblock->fs_bsize, 1);

  /* We should also take this block off the inode's list of
     dirty indirect blocks if it's there. */
  prev = 0;
  d = np->dn->dirty;
  while (d)
    {
      next = d->next;
      if (d->bno == bno)
	{
	  if (prev)
	    prev->next = next;
	  else
	    np->dn->dirty = next;
	  free (d);
	}
      else
	{
	  prev = d;
	  next = d->next;
	}
      d = next;
    }

  /* Free designated block */
  ffs_blkfree (np, bno, sblock->fs_bsize);
  count += btodb (sblock->fs_bsize);

  return count;
}


/* Offer data at BUF from START of LEN bytes of file NP. */
void
offer_data (struct node *np,
	    off_t start,
	    size_t len,
	    vm_address_t buf)
{
  vm_address_t addr;
  
  len = round_page (len);
  
  assert (start % vm_page_size == 0);
  
  assert (np->dn->fileinfo);
  for (addr = start; addr < start + len; addr += vm_page_size)
    pager_offer_page (np->dn->fileinfo->p, 1, 0, addr, buf + (addr - start));
}

/* Logical block LBN of node NP has been extended with ffs_realloccg.
   It used to be allocated at OLD_PBN and is now at NEW_PBN.  The old
   size was OLD_SIZE; it is now NEW_SIZE bytes long.  Arrange for the data
   on disk to be kept consistent, and free the old block if it has moved.
   Return one iff we've actually moved data around on disk.  */
int
block_extended (struct node *np, 
		daddr_t lbn,
		daddr_t old_pbn,
		daddr_t new_pbn,
		size_t old_size,
		size_t new_size)
{
  /* Make sure that any pages of this block which just became allocated
     don't get paged in from disk. */
  if (round_page (old_size) < round_page (new_size))
    offer_data (np, lbn * sblock->fs_bsize + round_page (old_size), 
		round_page (new_size) - round_page (old_size),
		(vm_address_t)zeroblock);

  if (old_pbn != new_pbn)
    {
      memory_object_t mapobj;
      error_t err;
      vm_address_t mapaddr;
      volatile int *pokeaddr;

      /* Map in this part of the file */
      mapobj = diskfs_get_filemap (np, VM_PROT_WRITE | VM_PROT_READ);

      /* XXX Should cope with errors from diskfs_get_filemap and back
         out the operation here. */
      assert (mapobj);

      err = vm_map (mach_task_self (), &mapaddr, round_page (old_size), 0, 1,
		    mapobj, lbn * sblock->fs_bsize, 0, 
		    VM_PROT_READ|VM_PROT_WRITE, VM_PROT_READ|VM_PROT_WRITE, 0);
      assert_perror (err);
      
      /* Allow these pageins to occur even though we're holding the lock */
      spin_lock (&unlocked_pagein_lock);
      np->dn->fileinfo->allow_unlocked_pagein = lbn * sblock->fs_bsize;
      np->dn->fileinfo->unlocked_pagein_length = round_page (old_size);
      spin_unlock (&unlocked_pagein_lock);

      /* Make sure all waiting pageins see this change. */
      mutex_lock (&np->dn->allocptrlock.master);
      condition_broadcast (&np->dn->allocptrlock.wakeup);
      mutex_unlock (&np->dn->allocptrlock.master);

      /* Force the pages in core and make sure they are dirty */
      for (pokeaddr = (int *)mapaddr; 
	   pokeaddr < (int *) (mapaddr + round_page (old_size));
	   pokeaddr += vm_page_size / sizeof (*pokeaddr))
	*pokeaddr = *pokeaddr;

      /* Turn off the special pagein permission */
      spin_lock (&unlocked_pagein_lock);
      np->dn->fileinfo->allow_unlocked_pagein = 0;
      np->dn->fileinfo->unlocked_pagein_length = 0;
      spin_unlock (&unlocked_pagein_lock);

      /* Undo mapping */
      mach_port_deallocate (mach_task_self (), mapobj);
      vm_deallocate (mach_task_self (), mapaddr, round_page (old_size));

      /* Now it's OK to free the old block */
      ffs_blkfree (np, old_pbn, old_size);

      /* Tell caller that we've moved data */
      return 1;
    }
  else
    return 0;
}


/* Implement the diskfs_grow callback; see <hurd/diskfs.h> for the
   interface description. */
error_t
diskfs_grow (struct node *np,
	     off_t end,
	     struct protid *cred)
{
  daddr_t lbn, olbn;
  int size, osize;
  error_t err;
  struct dinode *di = dino (np->dn->number);
  mach_port_t pagerpt;
  int need_sync = 0;

  /* Zero an sblock->fs_bsize piece of disk starting at BNO,
     synchronously.  We do this on newly allocated indirect
     blocks before setting the pointer to them to ensure that an
     indirect block absolutely never points to garbage. */
  void zero_disk_block (int bno)
    {
      bzero (indir_block (bno), sblock->fs_bsize);
      sync_disk_blocks (bno, sblock->fs_bsize, 1);
    };

  /* Check to see if we don't actually have to do anything */
  if (end <= np->allocsize)
    return 0;

  diskfs_check_readonly ();
  assert (!diskfs_readonly);

  /* This reference will ensure that NP->dn->fileinfo stays allocated. */
  pagerpt = diskfs_get_filemap (np, VM_PROT_WRITE|VM_PROT_READ);

  if (pagerpt == MACH_PORT_NULL)
    return errno;

  /* The new last block of the file. */
  lbn = lblkno (sblock, end - 1);

  /* This is the size of that block if it is in the NDADDR array. */
  size = fragroundup (sblock, blkoff (sblock, end));
  if (size == 0)
    size = sblock->fs_bsize;

  rwlock_writer_lock (&np->dn->allocptrlock);

  /* The old last block of the file. */
  olbn = lblkno (sblock, np->allocsize - 1);

  /* This is the size of that block if it is in the NDADDR array. */
  osize = fragroundup (sblock, blkoff (sblock, np->allocsize));
  if (osize == 0)
    osize = sblock->fs_bsize;

  /* If this end point is a new block and the file currently
     has a fragment, then expand the fragment to a full block. */
  if (np->allocsize && olbn < NDADDR && olbn < lbn)
    {
      if (osize < sblock->fs_bsize)
	{
	  daddr_t old_pbn, bno;
	  err = ffs_realloccg (np, olbn,
				 ffs_blkpref (np, lbn, lbn, di->di_db),
				 osize, sblock->fs_bsize, &bno, cred);
	  if (err)
	    goto out;

	  old_pbn = read_disk_entry (di->di_db[olbn]);

	  need_sync = block_extended (np, olbn, old_pbn, bno,
				      osize, sblock->fs_bsize);

	  write_disk_entry (di->di_db[olbn], bno);
	  record_poke (di, sizeof (struct dinode));
	  np->dn_set_ctime = 1;
	}
    }

  if (lbn < NDADDR)
    {
      daddr_t bno, old_pbn = read_disk_entry (di->di_db[lbn]);

      if (old_pbn != 0)
	{
	  /* The last block is already allocated.  Therefore we
	     must be expanding the fragment.  Make sure that's really
	     what we're up to. */
	  assert (size > osize);
	  assert (lbn == olbn);

	  err = ffs_realloccg (np, lbn,
			       ffs_blkpref (np, lbn, lbn, di->di_db),
			       osize, size, &bno, cred);
	  if (err)
	    goto out;

	  need_sync = block_extended (np, lbn, old_pbn, bno, osize, size);

	  write_disk_entry (di->di_db[lbn], bno);
	  record_poke (di, sizeof (struct dinode));
	  np->dn_set_ctime = 1;
	}
      else
	{
	  /* Allocate a new last block. */
	  err = ffs_alloc (np, lbn,
			   ffs_blkpref (np, lbn, lbn, di->di_db),
			   size, &bno, cred);
	  if (err)
	    goto out;

	  
	  offer_data (np, lbn * sblock->fs_bsize, size,
		      (vm_address_t)zeroblock);
	  write_disk_entry (di->di_db[lbn], bno);
	  record_poke (di, sizeof (struct dinode));
	  np->dn_set_ctime = 1;
	}
    }
  else
    {
      struct iblock_spec indirs[NIADDR + 1];
      daddr_t *siblock;
      daddr_t bno;

      /* Count the number of levels of indirection. */
      err = fetch_indir_spec (np, lbn, indirs);
      if (err)
	goto out;

      /* Make sure we didn't miss the NDADDR case
	 above somehow. */
      assert (indirs[0].offset != -1);

      /* See if we need a triple indirect block; fail if so. */
      assert (indirs[1].offset == -1 || indirs[2].offset == -1);

      /* Check to see if this block is allocated.  If it is
	 that's an error. */
      assert (indirs[0].bno == 0);

      /* We need to set SIBLOCK to the single indirect block
	 array; see if the single indirect block is allocated. */
      if (indirs[1].bno == 0)
	{
	  /* Allocate it. */
	  if (indirs[1].offset == -1)
	    {
	      err = ffs_alloc (np, lbn,
			       ffs_blkpref (np, lbn, INDIR_SINGLE, di->di_ib),
			       sblock->fs_bsize, &bno, 0);
	      if (err)
		goto out;
	      zero_disk_block (bno);
	      indirs[1].bno = bno;
	      write_disk_entry (di->di_ib[INDIR_SINGLE], bno);
	      record_poke (di, sizeof (struct dinode));
	    }
	  else
	    {
	      daddr_t *diblock;

	      /* We need to set diblock to the double indirect block
		 array; see if the double indirect block is allocated. */
	      if (indirs[2].bno == 0)
		{
		  /* This assert because triple indirection is not
		     supported. */
		  assert (indirs[2].offset == -1);
		  err = ffs_alloc (np, lbn,
				   ffs_blkpref (np, lbn,
						INDIR_DOUBLE, di->di_ib),
				   sblock->fs_bsize, &bno, 0);
		  if (err)
		    goto out;
		  zero_disk_block (bno);
		  indirs[2].bno = bno;
		  write_disk_entry (di->di_ib[INDIR_DOUBLE], bno);
		  record_poke (di, sizeof (struct dinode));
		}

	      diblock = indir_block (indirs[2].bno);
	      mark_indir_dirty (np, indirs[2].bno);

	      /* Now we can allocate the single indirect block */
	      err = ffs_alloc (np, lbn,
			       ffs_blkpref (np, lbn,
					    indirs[1].offset, diblock),
			       sblock->fs_bsize, &bno, 0);
	      if (err)
		goto out;
	      zero_disk_block (bno);
	      indirs[1].bno = bno;
	      write_disk_entry (diblock[indirs[1].offset], bno);
	      record_poke (diblock, sblock->fs_bsize);
	    }
	}

      siblock = indir_block (indirs[1].bno);
      mark_indir_dirty (np, indirs[1].bno);

      /* Now we can allocate the data block. */
      err = ffs_alloc (np, lbn,
		       ffs_blkpref (np, lbn, indirs[0].offset, siblock),
		       sblock->fs_bsize, &bno, 0);
      if (err)
	goto out;
      offer_data (np, lbn * sblock->fs_bsize, sblock->fs_bsize,
		  (vm_address_t)zeroblock);
      indirs[0].bno = bno;
      write_disk_entry (siblock[indirs[0].offset], bno);
      record_poke (siblock, sblock->fs_bsize);
    }

 out:
  mach_port_deallocate (mach_task_self (), pagerpt);
  if (!err)
    {
      int newallocsize;
      if (lbn < NDADDR)
	newallocsize = lbn * sblock->fs_bsize + size;
      else
	newallocsize = (lbn + 1) * sblock->fs_bsize;
      assert (newallocsize > np->allocsize);
      np->allocsize = newallocsize;
    }

  rwlock_writer_unlock (&np->dn->allocptrlock);

  if (need_sync)
    diskfs_file_update (np, 1);

  return err;
}

/* Write something to each page from START to END inclusive of memory
   object OBJ, but make sure the data doesns't actually change. */
static void
poke_pages (memory_object_t obj,
	    vm_offset_t start,
	    vm_offset_t end)
{
  vm_address_t addr, poke;
  vm_size_t len;
  error_t err;

  while (start < end)
    {
      len = 8 * vm_page_size;
      if (len > end - start)
	len = end - start;
      addr = 0;
      err = vm_map (mach_task_self (), &addr, len, 0, 1, obj, start, 0,
		    VM_PROT_WRITE|VM_PROT_READ, VM_PROT_READ|VM_PROT_WRITE, 0);
      if (!err)
	{
	  for (poke = addr; poke < addr + len; poke += vm_page_size)
	    *(volatile int *)poke = *(volatile int *)poke;
	  vm_deallocate (mach_task_self (), addr, len);
	}
      start += len;
    }
}