?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
[PATCH] nvidiafb: Add support for Geforce4 MX 4000
[linux-2.6/linux-mips.git] / fs / xfs / xfs_dir2_block.c
blob31bc99faa704db5eeae782d52d6ae23ff40b400f
1 /*
2 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
8 *
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
17 */
18 #include "xfs.h"
19 #include "xfs_fs.h"
20 #include "xfs_types.h"
21 #include "xfs_log.h"
22 #include "xfs_inum.h"
23 #include "xfs_trans.h"
24 #include "xfs_sb.h"
25 #include "xfs_dir.h"
26 #include "xfs_dir2.h"
27 #include "xfs_dmapi.h"
28 #include "xfs_mount.h"
29 #include "xfs_da_btree.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_dir_sf.h"
32 #include "xfs_dir2_sf.h"
33 #include "xfs_attr_sf.h"
34 #include "xfs_dinode.h"
35 #include "xfs_inode.h"
36 #include "xfs_inode_item.h"
37 #include "xfs_dir_leaf.h"
38 #include "xfs_dir2_data.h"
39 #include "xfs_dir2_leaf.h"
40 #include "xfs_dir2_block.h"
41 #include "xfs_dir2_trace.h"
42 #include "xfs_error.h"
43
44 /*
45 * Local function prototypes.
46 */
47 static void xfs_dir2_block_log_leaf(xfs_trans_t *tp, xfs_dabuf_t *bp, int first,
48 int last);
49 static void xfs_dir2_block_log_tail(xfs_trans_t *tp, xfs_dabuf_t *bp);
50 static int xfs_dir2_block_lookup_int(xfs_da_args_t *args, xfs_dabuf_t **bpp,
51 int *entno);
52 static int xfs_dir2_block_sort(const void *a, const void *b);
53
54 /*
55 * Add an entry to a block directory.
56 */
57 int /* error */
58 xfs_dir2_block_addname(
59 xfs_da_args_t *args) /* directory op arguments */
60 {
61 xfs_dir2_data_free_t *bf; /* bestfree table in block */
62 xfs_dir2_block_t *block; /* directory block structure */
63 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
64 xfs_dabuf_t *bp; /* buffer for block */
65 xfs_dir2_block_tail_t *btp; /* block tail */
66 int compact; /* need to compact leaf ents */
67 xfs_dir2_data_entry_t *dep; /* block data entry */
68 xfs_inode_t *dp; /* directory inode */
69 xfs_dir2_data_unused_t *dup; /* block unused entry */
70 int error; /* error return value */
71 xfs_dir2_data_unused_t *enddup=NULL; /* unused at end of data */
72 xfs_dahash_t hash; /* hash value of found entry */
73 int high; /* high index for binary srch */
74 int highstale; /* high stale index */
75 int lfloghigh=0; /* last final leaf to log */
76 int lfloglow=0; /* first final leaf to log */
77 int len; /* length of the new entry */
78 int low; /* low index for binary srch */
79 int lowstale; /* low stale index */
80 int mid=0; /* midpoint for binary srch */
81 xfs_mount_t *mp; /* filesystem mount point */
82 int needlog; /* need to log header */
83 int needscan; /* need to rescan freespace */
84 xfs_dir2_data_off_t *tagp; /* pointer to tag value */
85 xfs_trans_t *tp; /* transaction structure */
86
87 xfs_dir2_trace_args("block_addname", args);
88 dp = args->dp;
89 tp = args->trans;
90 mp = dp->i_mount;
91 /*
92 * Read the (one and only) directory block into dabuf bp.
93 */
94 if ((error =
95 xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &bp, XFS_DATA_FORK))) {
96 return error;
97 }
98 ASSERT(bp != NULL);
99 block = bp->data;
100 /*
101 * Check the magic number, corrupted if wrong.
102 */
103 if (unlikely(INT_GET(block->hdr.magic, ARCH_CONVERT)
104 != XFS_DIR2_BLOCK_MAGIC)) {
105 XFS_CORRUPTION_ERROR("xfs_dir2_block_addname",
106 XFS_ERRLEVEL_LOW, mp, block);
107 xfs_da_brelse(tp, bp);
108 return XFS_ERROR(EFSCORRUPTED);
109 }
110 len = XFS_DIR2_DATA_ENTSIZE(args->namelen);
111 /*
112 * Set up pointers to parts of the block.
113 */
114 bf = block->hdr.bestfree;
115 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
116 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
117 /*
118 * No stale entries? Need space for entry and new leaf.
119 */
120 if (!btp->stale) {
121 /*
122 * Tag just before the first leaf entry.
123 */
124 tagp = (xfs_dir2_data_off_t *)blp - 1;
125 /*
126 * Data object just before the first leaf entry.
127 */
128 enddup = (xfs_dir2_data_unused_t *)((char *)block + INT_GET(*tagp, ARCH_CONVERT));
129 /*
130 * If it's not free then can't do this add without cleaning up:
131 * the space before the first leaf entry needs to be free so it
132 * can be expanded to hold the pointer to the new entry.
133 */
134 if (INT_GET(enddup->freetag, ARCH_CONVERT) != XFS_DIR2_DATA_FREE_TAG)
135 dup = enddup = NULL;
136 /*
137 * Check out the biggest freespace and see if it's the same one.
138 */
139 else {
140 dup = (xfs_dir2_data_unused_t *)
141 ((char *)block + INT_GET(bf[0].offset, ARCH_CONVERT));
142 if (dup == enddup) {
143 /*
144 * It is the biggest freespace, is it too small
145 * to hold the new leaf too?
146 */
147 if (INT_GET(dup->length, ARCH_CONVERT) < len + (uint)sizeof(*blp)) {
148 /*
149 * Yes, we use the second-largest
150 * entry instead if it works.
151 */
152 if (INT_GET(bf[1].length, ARCH_CONVERT) >= len)
153 dup = (xfs_dir2_data_unused_t *)
154 ((char *)block +
155 INT_GET(bf[1].offset, ARCH_CONVERT));
156 else
157 dup = NULL;
158 }
159 } else {
160 /*
161 * Not the same free entry,
162 * just check its length.
163 */
164 if (INT_GET(dup->length, ARCH_CONVERT) < len) {
165 dup = NULL;
166 }
167 }
168 }
169 compact = 0;
170 }
171 /*
172 * If there are stale entries we'll use one for the leaf.
173 * Is the biggest entry enough to avoid compaction?
174 */
175 else if (INT_GET(bf[0].length, ARCH_CONVERT) >= len) {
176 dup = (xfs_dir2_data_unused_t *)
177 ((char *)block + INT_GET(bf[0].offset, ARCH_CONVERT));
178 compact = 0;
179 }
180 /*
181 * Will need to compact to make this work.
182 */
183 else {
184 /*
185 * Tag just before the first leaf entry.
186 */
187 tagp = (xfs_dir2_data_off_t *)blp - 1;
188 /*
189 * Data object just before the first leaf entry.
190 */
191 dup = (xfs_dir2_data_unused_t *)((char *)block + INT_GET(*tagp, ARCH_CONVERT));
192 /*
193 * If it's not free then the data will go where the
194 * leaf data starts now, if it works at all.
195 */
196 if (INT_GET(dup->freetag, ARCH_CONVERT) == XFS_DIR2_DATA_FREE_TAG) {
197 if (INT_GET(dup->length, ARCH_CONVERT) + (INT_GET(btp->stale, ARCH_CONVERT) - 1) *
198 (uint)sizeof(*blp) < len)
199 dup = NULL;
200 } else if ((INT_GET(btp->stale, ARCH_CONVERT) - 1) * (uint)sizeof(*blp) < len)
201 dup = NULL;
202 else
203 dup = (xfs_dir2_data_unused_t *)blp;
204 compact = 1;
205 }
206 /*
207 * If this isn't a real add, we're done with the buffer.
208 */
209 if (args->justcheck)
210 xfs_da_brelse(tp, bp);
211 /*
212 * If we don't have space for the new entry & leaf ...
213 */
214 if (!dup) {
215 /*
216 * Not trying to actually do anything, or don't have
217 * a space reservation: return no-space.
218 */
219 if (args->justcheck || args->total == 0)
220 return XFS_ERROR(ENOSPC);
221 /*
222 * Convert to the next larger format.
223 * Then add the new entry in that format.
224 */
225 error = xfs_dir2_block_to_leaf(args, bp);
226 xfs_da_buf_done(bp);
227 if (error)
228 return error;
229 return xfs_dir2_leaf_addname(args);
230 }
231 /*
232 * Just checking, and it would work, so say so.
233 */
234 if (args->justcheck)
235 return 0;
236 needlog = needscan = 0;
237 /*
238 * If need to compact the leaf entries, do it now.
239 * Leave the highest-numbered stale entry stale.
240 * XXX should be the one closest to mid but mid is not yet computed.
241 */
242 if (compact) {
243 int fromidx; /* source leaf index */
244 int toidx; /* target leaf index */
245
246 for (fromidx = toidx = INT_GET(btp->count, ARCH_CONVERT) - 1,
247 highstale = lfloghigh = -1;
248 fromidx >= 0;
249 fromidx--) {
250 if (INT_GET(blp[fromidx].address, ARCH_CONVERT) == XFS_DIR2_NULL_DATAPTR) {
251 if (highstale == -1)
252 highstale = toidx;
253 else {
254 if (lfloghigh == -1)
255 lfloghigh = toidx;
256 continue;
257 }
258 }
259 if (fromidx < toidx)
260 blp[toidx] = blp[fromidx];
261 toidx--;
262 }
263 lfloglow = toidx + 1 - (INT_GET(btp->stale, ARCH_CONVERT) - 1);
264 lfloghigh -= INT_GET(btp->stale, ARCH_CONVERT) - 1;
265 INT_MOD(btp->count, ARCH_CONVERT, -(INT_GET(btp->stale, ARCH_CONVERT) - 1));
266 xfs_dir2_data_make_free(tp, bp,
267 (xfs_dir2_data_aoff_t)((char *)blp - (char *)block),
268 (xfs_dir2_data_aoff_t)((INT_GET(btp->stale, ARCH_CONVERT) - 1) * sizeof(*blp)),
269 &needlog, &needscan);
270 blp += INT_GET(btp->stale, ARCH_CONVERT) - 1;
271 INT_SET(btp->stale, ARCH_CONVERT, 1);
272 /*
273 * If we now need to rebuild the bestfree map, do so.
274 * This needs to happen before the next call to use_free.
275 */
276 if (needscan) {
277 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block,
278 &needlog, NULL);
279 needscan = 0;
280 }
281 }
282 /*
283 * Set leaf logging boundaries to impossible state.
284 * For the no-stale case they're set explicitly.
285 */
286 else if (INT_GET(btp->stale, ARCH_CONVERT)) {
287 lfloglow = INT_GET(btp->count, ARCH_CONVERT);
288 lfloghigh = -1;
289 }
290 /*
291 * Find the slot that's first lower than our hash value, -1 if none.
292 */
293 for (low = 0, high = INT_GET(btp->count, ARCH_CONVERT) - 1; low <= high; ) {
294 mid = (low + high) >> 1;
295 if ((hash = INT_GET(blp[mid].hashval, ARCH_CONVERT)) == args->hashval)
296 break;
297 if (hash < args->hashval)
298 low = mid + 1;
299 else
300 high = mid - 1;
301 }
302 while (mid >= 0 && INT_GET(blp[mid].hashval, ARCH_CONVERT) >= args->hashval) {
303 mid--;
304 }
305 /*
306 * No stale entries, will use enddup space to hold new leaf.
307 */
308 if (!btp->stale) {
309 /*
310 * Mark the space needed for the new leaf entry, now in use.
311 */
312 xfs_dir2_data_use_free(tp, bp, enddup,
313 (xfs_dir2_data_aoff_t)
314 ((char *)enddup - (char *)block + INT_GET(enddup->length, ARCH_CONVERT) -
315 sizeof(*blp)),
316 (xfs_dir2_data_aoff_t)sizeof(*blp),
317 &needlog, &needscan);
318 /*
319 * Update the tail (entry count).
320 */
321 INT_MOD(btp->count, ARCH_CONVERT, +1);
322 /*
323 * If we now need to rebuild the bestfree map, do so.
324 * This needs to happen before the next call to use_free.
325 */
326 if (needscan) {
327 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block,
328 &needlog, NULL);
329 needscan = 0;
330 }
331 /*
332 * Adjust pointer to the first leaf entry, we're about to move
333 * the table up one to open up space for the new leaf entry.
334 * Then adjust our index to match.
335 */
336 blp--;
337 mid++;
338 if (mid)
339 memmove(blp, &blp[1], mid * sizeof(*blp));
340 lfloglow = 0;
341 lfloghigh = mid;
342 }
343 /*
344 * Use a stale leaf for our new entry.
345 */
346 else {
347 for (lowstale = mid;
348 lowstale >= 0 &&
349 INT_GET(blp[lowstale].address, ARCH_CONVERT) != XFS_DIR2_NULL_DATAPTR;
350 lowstale--)
351 continue;
352 for (highstale = mid + 1;
353 highstale < INT_GET(btp->count, ARCH_CONVERT) &&
354 INT_GET(blp[highstale].address, ARCH_CONVERT) != XFS_DIR2_NULL_DATAPTR &&
355 (lowstale < 0 || mid - lowstale > highstale - mid);
356 highstale++)
357 continue;
358 /*
359 * Move entries toward the low-numbered stale entry.
360 */
361 if (lowstale >= 0 &&
362 (highstale == INT_GET(btp->count, ARCH_CONVERT) ||
363 mid - lowstale <= highstale - mid)) {
364 if (mid - lowstale)
365 memmove(&blp[lowstale], &blp[lowstale + 1],
366 (mid - lowstale) * sizeof(*blp));
367 lfloglow = MIN(lowstale, lfloglow);
368 lfloghigh = MAX(mid, lfloghigh);
369 }
370 /*
371 * Move entries toward the high-numbered stale entry.
372 */
373 else {
374 ASSERT(highstale < INT_GET(btp->count, ARCH_CONVERT));
375 mid++;
376 if (highstale - mid)
377 memmove(&blp[mid + 1], &blp[mid],
378 (highstale - mid) * sizeof(*blp));
379 lfloglow = MIN(mid, lfloglow);
380 lfloghigh = MAX(highstale, lfloghigh);
381 }
382 INT_MOD(btp->stale, ARCH_CONVERT, -1);
383 }
384 /*
385 * Point to the new data entry.
386 */
387 dep = (xfs_dir2_data_entry_t *)dup;
388 /*
389 * Fill in the leaf entry.
390 */
391 INT_SET(blp[mid].hashval, ARCH_CONVERT, args->hashval);
392 INT_SET(blp[mid].address, ARCH_CONVERT, XFS_DIR2_BYTE_TO_DATAPTR(mp, (char *)dep - (char *)block));
393 xfs_dir2_block_log_leaf(tp, bp, lfloglow, lfloghigh);
394 /*
395 * Mark space for the data entry used.
396 */
397 xfs_dir2_data_use_free(tp, bp, dup,
398 (xfs_dir2_data_aoff_t)((char *)dup - (char *)block),
399 (xfs_dir2_data_aoff_t)len, &needlog, &needscan);
400 /*
401 * Create the new data entry.
402 */
403 INT_SET(dep->inumber, ARCH_CONVERT, args->inumber);
404 dep->namelen = args->namelen;
405 memcpy(dep->name, args->name, args->namelen);
406 tagp = XFS_DIR2_DATA_ENTRY_TAG_P(dep);
407 INT_SET(*tagp, ARCH_CONVERT, (xfs_dir2_data_off_t)((char *)dep - (char *)block));
408 /*
409 * Clean up the bestfree array and log the header, tail, and entry.
410 */
411 if (needscan)
412 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog,
413 NULL);
414 if (needlog)
415 xfs_dir2_data_log_header(tp, bp);
416 xfs_dir2_block_log_tail(tp, bp);
417 xfs_dir2_data_log_entry(tp, bp, dep);
418 xfs_dir2_data_check(dp, bp);
419 xfs_da_buf_done(bp);
420 return 0;
421 }
422
423 /*
424 * Readdir for block directories.
425 */
426 int /* error */
427 xfs_dir2_block_getdents(
428 xfs_trans_t *tp, /* transaction (NULL) */
429 xfs_inode_t *dp, /* incore inode */
430 uio_t *uio, /* caller's buffer control */
431 int *eofp, /* eof reached? (out) */
432 xfs_dirent_t *dbp, /* caller's buffer */
433 xfs_dir2_put_t put) /* abi's formatting function */
434 {
435 xfs_dir2_block_t *block; /* directory block structure */
436 xfs_dabuf_t *bp; /* buffer for block */
437 xfs_dir2_block_tail_t *btp; /* block tail */
438 xfs_dir2_data_entry_t *dep; /* block data entry */
439 xfs_dir2_data_unused_t *dup; /* block unused entry */
440 char *endptr; /* end of the data entries */
441 int error; /* error return value */
442 xfs_mount_t *mp; /* filesystem mount point */
443 xfs_dir2_put_args_t p; /* arg package for put rtn */
444 char *ptr; /* current data entry */
445 int wantoff; /* starting block offset */
446
447 mp = dp->i_mount;
448 /*
449 * If the block number in the offset is out of range, we're done.
450 */
451 if (XFS_DIR2_DATAPTR_TO_DB(mp, uio->uio_offset) > mp->m_dirdatablk) {
452 *eofp = 1;
453 return 0;
454 }
455 /*
456 * Can't read the block, give up, else get dabuf in bp.
457 */
458 if ((error =
459 xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &bp, XFS_DATA_FORK))) {
460 return error;
461 }
462 ASSERT(bp != NULL);
463 /*
464 * Extract the byte offset we start at from the seek pointer.
465 * We'll skip entries before this.
466 */
467 wantoff = XFS_DIR2_DATAPTR_TO_OFF(mp, uio->uio_offset);
468 block = bp->data;
469 xfs_dir2_data_check(dp, bp);
470 /*
471 * Set up values for the loop.
472 */
473 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
474 ptr = (char *)block->u;
475 endptr = (char *)XFS_DIR2_BLOCK_LEAF_P(btp);
476 p.dbp = dbp;
477 p.put = put;
478 p.uio = uio;
479 /*
480 * Loop over the data portion of the block.
481 * Each object is a real entry (dep) or an unused one (dup).
482 */
483 while (ptr < endptr) {
484 dup = (xfs_dir2_data_unused_t *)ptr;
485 /*
486 * Unused, skip it.
487 */
488 if (INT_GET(dup->freetag, ARCH_CONVERT) == XFS_DIR2_DATA_FREE_TAG) {
489 ptr += INT_GET(dup->length, ARCH_CONVERT);
490 continue;
491 }
492
493 dep = (xfs_dir2_data_entry_t *)ptr;
494
495 /*
496 * Bump pointer for the next iteration.
497 */
498 ptr += XFS_DIR2_DATA_ENTSIZE(dep->namelen);
499 /*
500 * The entry is before the desired starting point, skip it.
501 */
502 if ((char *)dep - (char *)block < wantoff)
503 continue;
504 /*
505 * Set up argument structure for put routine.
506 */
507 p.namelen = dep->namelen;
508
509 p.cook = XFS_DIR2_DB_OFF_TO_DATAPTR(mp, mp->m_dirdatablk,
510 ptr - (char *)block);
511 p.ino = INT_GET(dep->inumber, ARCH_CONVERT);
512 #if XFS_BIG_INUMS
513 p.ino += mp->m_inoadd;
514 #endif
515 p.name = (char *)dep->name;
516
517 /*
518 * Put the entry in the caller's buffer.
519 */
520 error = p.put(&p);
521
522 /*
523 * If it didn't fit, set the final offset to here & return.
524 */
525 if (!p.done) {
526 uio->uio_offset =
527 XFS_DIR2_DB_OFF_TO_DATAPTR(mp, mp->m_dirdatablk,
528 (char *)dep - (char *)block);
529 xfs_da_brelse(tp, bp);
530 return error;
531 }
532 }
533
534 /*
535 * Reached the end of the block.
536 * Set the offset to a nonexistent block 1 and return.
537 */
538 *eofp = 1;
539
540 uio->uio_offset =
541 XFS_DIR2_DB_OFF_TO_DATAPTR(mp, mp->m_dirdatablk + 1, 0);
542
543 xfs_da_brelse(tp, bp);
544
545 return 0;
546 }
547
548 /*
549 * Log leaf entries from the block.
550 */
551 static void
552 xfs_dir2_block_log_leaf(
553 xfs_trans_t *tp, /* transaction structure */
554 xfs_dabuf_t *bp, /* block buffer */
555 int first, /* index of first logged leaf */
556 int last) /* index of last logged leaf */
557 {
558 xfs_dir2_block_t *block; /* directory block structure */
559 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
560 xfs_dir2_block_tail_t *btp; /* block tail */
561 xfs_mount_t *mp; /* filesystem mount point */
562
563 mp = tp->t_mountp;
564 block = bp->data;
565 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
566 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
567 xfs_da_log_buf(tp, bp, (uint)((char *)&blp[first] - (char *)block),
568 (uint)((char *)&blp[last + 1] - (char *)block - 1));
569 }
570
571 /*
572 * Log the block tail.
573 */
574 static void
575 xfs_dir2_block_log_tail(
576 xfs_trans_t *tp, /* transaction structure */
577 xfs_dabuf_t *bp) /* block buffer */
578 {
579 xfs_dir2_block_t *block; /* directory block structure */
580 xfs_dir2_block_tail_t *btp; /* block tail */
581 xfs_mount_t *mp; /* filesystem mount point */
582
583 mp = tp->t_mountp;
584 block = bp->data;
585 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
586 xfs_da_log_buf(tp, bp, (uint)((char *)btp - (char *)block),
587 (uint)((char *)(btp + 1) - (char *)block - 1));
588 }
589
590 /*
591 * Look up an entry in the block. This is the external routine,
592 * xfs_dir2_block_lookup_int does the real work.
593 */
594 int /* error */
595 xfs_dir2_block_lookup(
596 xfs_da_args_t *args) /* dir lookup arguments */
597 {
598 xfs_dir2_block_t *block; /* block structure */
599 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
600 xfs_dabuf_t *bp; /* block buffer */
601 xfs_dir2_block_tail_t *btp; /* block tail */
602 xfs_dir2_data_entry_t *dep; /* block data entry */
603 xfs_inode_t *dp; /* incore inode */
604 int ent; /* entry index */
605 int error; /* error return value */
606 xfs_mount_t *mp; /* filesystem mount point */
607
608 xfs_dir2_trace_args("block_lookup", args);
609 /*
610 * Get the buffer, look up the entry.
611 * If not found (ENOENT) then return, have no buffer.
612 */
613 if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent)))
614 return error;
615 dp = args->dp;
616 mp = dp->i_mount;
617 block = bp->data;
618 xfs_dir2_data_check(dp, bp);
619 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
620 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
621 /*
622 * Get the offset from the leaf entry, to point to the data.
623 */
624 dep = (xfs_dir2_data_entry_t *)
625 ((char *)block + XFS_DIR2_DATAPTR_TO_OFF(mp, INT_GET(blp[ent].address, ARCH_CONVERT)));
626 /*
627 * Fill in inode number, release the block.
628 */
629 args->inumber = INT_GET(dep->inumber, ARCH_CONVERT);
630 xfs_da_brelse(args->trans, bp);
631 return XFS_ERROR(EEXIST);
632 }
633
634 /*
635 * Internal block lookup routine.
636 */
637 static int /* error */
638 xfs_dir2_block_lookup_int(
639 xfs_da_args_t *args, /* dir lookup arguments */
640 xfs_dabuf_t **bpp, /* returned block buffer */
641 int *entno) /* returned entry number */
642 {
643 xfs_dir2_dataptr_t addr; /* data entry address */
644 xfs_dir2_block_t *block; /* block structure */
645 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
646 xfs_dabuf_t *bp; /* block buffer */
647 xfs_dir2_block_tail_t *btp; /* block tail */
648 xfs_dir2_data_entry_t *dep; /* block data entry */
649 xfs_inode_t *dp; /* incore inode */
650 int error; /* error return value */
651 xfs_dahash_t hash; /* found hash value */
652 int high; /* binary search high index */
653 int low; /* binary search low index */
654 int mid; /* binary search current idx */
655 xfs_mount_t *mp; /* filesystem mount point */
656 xfs_trans_t *tp; /* transaction pointer */
657
658 dp = args->dp;
659 tp = args->trans;
660 mp = dp->i_mount;
661 /*
662 * Read the buffer, return error if we can't get it.
663 */
664 if ((error =
665 xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &bp, XFS_DATA_FORK))) {
666 return error;
667 }
668 ASSERT(bp != NULL);
669 block = bp->data;
670 xfs_dir2_data_check(dp, bp);
671 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
672 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
673 /*
674 * Loop doing a binary search for our hash value.
675 * Find our entry, ENOENT if it's not there.
676 */
677 for (low = 0, high = INT_GET(btp->count, ARCH_CONVERT) - 1; ; ) {
678 ASSERT(low <= high);
679 mid = (low + high) >> 1;
680 if ((hash = INT_GET(blp[mid].hashval, ARCH_CONVERT)) == args->hashval)
681 break;
682 if (hash < args->hashval)
683 low = mid + 1;
684 else
685 high = mid - 1;
686 if (low > high) {
687 ASSERT(args->oknoent);
688 xfs_da_brelse(tp, bp);
689 return XFS_ERROR(ENOENT);
690 }
691 }
692 /*
693 * Back up to the first one with the right hash value.
694 */
695 while (mid > 0 && INT_GET(blp[mid - 1].hashval, ARCH_CONVERT) == args->hashval) {
696 mid--;
697 }
698 /*
699 * Now loop forward through all the entries with the
700 * right hash value looking for our name.
701 */
702 do {
703 if ((addr = INT_GET(blp[mid].address, ARCH_CONVERT)) == XFS_DIR2_NULL_DATAPTR)
704 continue;
705 /*
706 * Get pointer to the entry from the leaf.
707 */
708 dep = (xfs_dir2_data_entry_t *)
709 ((char *)block + XFS_DIR2_DATAPTR_TO_OFF(mp, addr));
710 /*
711 * Compare, if it's right give back buffer & entry number.
712 */
713 if (dep->namelen == args->namelen &&
714 dep->name[0] == args->name[0] &&
715 memcmp(dep->name, args->name, args->namelen) == 0) {
716 *bpp = bp;
717 *entno = mid;
718 return 0;
719 }
720 } while (++mid < INT_GET(btp->count, ARCH_CONVERT) && INT_GET(blp[mid].hashval, ARCH_CONVERT) == hash);
721 /*
722 * No match, release the buffer and return ENOENT.
723 */
724 ASSERT(args->oknoent);
725 xfs_da_brelse(tp, bp);
726 return XFS_ERROR(ENOENT);
727 }
728
729 /*
730 * Remove an entry from a block format directory.
731 * If that makes the block small enough to fit in shortform, transform it.
732 */
733 int /* error */
734 xfs_dir2_block_removename(
735 xfs_da_args_t *args) /* directory operation args */
736 {
737 xfs_dir2_block_t *block; /* block structure */
738 xfs_dir2_leaf_entry_t *blp; /* block leaf pointer */
739 xfs_dabuf_t *bp; /* block buffer */
740 xfs_dir2_block_tail_t *btp; /* block tail */
741 xfs_dir2_data_entry_t *dep; /* block data entry */
742 xfs_inode_t *dp; /* incore inode */
743 int ent; /* block leaf entry index */
744 int error; /* error return value */
745 xfs_mount_t *mp; /* filesystem mount point */
746 int needlog; /* need to log block header */
747 int needscan; /* need to fixup bestfree */
748 xfs_dir2_sf_hdr_t sfh; /* shortform header */
749 int size; /* shortform size */
750 xfs_trans_t *tp; /* transaction pointer */
751
752 xfs_dir2_trace_args("block_removename", args);
753 /*
754 * Look up the entry in the block. Gets the buffer and entry index.
755 * It will always be there, the vnodeops level does a lookup first.
756 */
757 if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) {
758 return error;
759 }
760 dp = args->dp;
761 tp = args->trans;
762 mp = dp->i_mount;
763 block = bp->data;
764 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
765 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
766 /*
767 * Point to the data entry using the leaf entry.
768 */
769 dep = (xfs_dir2_data_entry_t *)
770 ((char *)block + XFS_DIR2_DATAPTR_TO_OFF(mp, INT_GET(blp[ent].address, ARCH_CONVERT)));
771 /*
772 * Mark the data entry's space free.
773 */
774 needlog = needscan = 0;
775 xfs_dir2_data_make_free(tp, bp,
776 (xfs_dir2_data_aoff_t)((char *)dep - (char *)block),
777 XFS_DIR2_DATA_ENTSIZE(dep->namelen), &needlog, &needscan);
778 /*
779 * Fix up the block tail.
780 */
781 INT_MOD(btp->stale, ARCH_CONVERT, +1);
782 xfs_dir2_block_log_tail(tp, bp);
783 /*
784 * Remove the leaf entry by marking it stale.
785 */
786 INT_SET(blp[ent].address, ARCH_CONVERT, XFS_DIR2_NULL_DATAPTR);
787 xfs_dir2_block_log_leaf(tp, bp, ent, ent);
788 /*
789 * Fix up bestfree, log the header if necessary.
790 */
791 if (needscan)
792 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog,
793 NULL);
794 if (needlog)
795 xfs_dir2_data_log_header(tp, bp);
796 xfs_dir2_data_check(dp, bp);
797 /*
798 * See if the size as a shortform is good enough.
799 */
800 if ((size = xfs_dir2_block_sfsize(dp, block, &sfh)) >
801 XFS_IFORK_DSIZE(dp)) {
802 xfs_da_buf_done(bp);
803 return 0;
804 }
805 /*
806 * If it works, do the conversion.
807 */
808 return xfs_dir2_block_to_sf(args, bp, size, &sfh);
809 }
810
811 /*
812 * Replace an entry in a V2 block directory.
813 * Change the inode number to the new value.
814 */
815 int /* error */
816 xfs_dir2_block_replace(
817 xfs_da_args_t *args) /* directory operation args */
818 {
819 xfs_dir2_block_t *block; /* block structure */
820 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
821 xfs_dabuf_t *bp; /* block buffer */
822 xfs_dir2_block_tail_t *btp; /* block tail */
823 xfs_dir2_data_entry_t *dep; /* block data entry */
824 xfs_inode_t *dp; /* incore inode */
825 int ent; /* leaf entry index */
826 int error; /* error return value */
827 xfs_mount_t *mp; /* filesystem mount point */
828
829 xfs_dir2_trace_args("block_replace", args);
830 /*
831 * Lookup the entry in the directory. Get buffer and entry index.
832 * This will always succeed since the caller has already done a lookup.
833 */
834 if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) {
835 return error;
836 }
837 dp = args->dp;
838 mp = dp->i_mount;
839 block = bp->data;
840 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
841 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
842 /*
843 * Point to the data entry we need to change.
844 */
845 dep = (xfs_dir2_data_entry_t *)
846 ((char *)block + XFS_DIR2_DATAPTR_TO_OFF(mp, INT_GET(blp[ent].address, ARCH_CONVERT)));
847 ASSERT(INT_GET(dep->inumber, ARCH_CONVERT) != args->inumber);
848 /*
849 * Change the inode number to the new value.
850 */
851 INT_SET(dep->inumber, ARCH_CONVERT, args->inumber);
852 xfs_dir2_data_log_entry(args->trans, bp, dep);
853 xfs_dir2_data_check(dp, bp);
854 xfs_da_buf_done(bp);
855 return 0;
856 }
857
858 /*
859 * Qsort comparison routine for the block leaf entries.
860 */
861 static int /* sort order */
862 xfs_dir2_block_sort(
863 const void *a, /* first leaf entry */
864 const void *b) /* second leaf entry */
865 {
866 const xfs_dir2_leaf_entry_t *la; /* first leaf entry */
867 const xfs_dir2_leaf_entry_t *lb; /* second leaf entry */
868
869 la = a;
870 lb = b;
871 return INT_GET(la->hashval, ARCH_CONVERT) < INT_GET(lb->hashval, ARCH_CONVERT) ? -1 :
872 (INT_GET(la->hashval, ARCH_CONVERT) > INT_GET(lb->hashval, ARCH_CONVERT) ? 1 : 0);
873 }
874
875 /*
876 * Convert a V2 leaf directory to a V2 block directory if possible.
877 */
878 int /* error */
879 xfs_dir2_leaf_to_block(
880 xfs_da_args_t *args, /* operation arguments */
881 xfs_dabuf_t *lbp, /* leaf buffer */
882 xfs_dabuf_t *dbp) /* data buffer */
883 {
884 xfs_dir2_data_off_t *bestsp; /* leaf bests table */
885 xfs_dir2_block_t *block; /* block structure */
886 xfs_dir2_block_tail_t *btp; /* block tail */
887 xfs_inode_t *dp; /* incore directory inode */
888 xfs_dir2_data_unused_t *dup; /* unused data entry */
889 int error; /* error return value */
890 int from; /* leaf from index */
891 xfs_dir2_leaf_t *leaf; /* leaf structure */
892 xfs_dir2_leaf_entry_t *lep; /* leaf entry */
893 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */
894 xfs_mount_t *mp; /* file system mount point */
895 int needlog; /* need to log data header */
896 int needscan; /* need to scan for bestfree */
897 xfs_dir2_sf_hdr_t sfh; /* shortform header */
898 int size; /* bytes used */
899 xfs_dir2_data_off_t *tagp; /* end of entry (tag) */
900 int to; /* block/leaf to index */
901 xfs_trans_t *tp; /* transaction pointer */
902
903 xfs_dir2_trace_args_bb("leaf_to_block", args, lbp, dbp);
904 dp = args->dp;
905 tp = args->trans;
906 mp = dp->i_mount;
907 leaf = lbp->data;
908 ASSERT(INT_GET(leaf->hdr.info.magic, ARCH_CONVERT) == XFS_DIR2_LEAF1_MAGIC);
909 ltp = XFS_DIR2_LEAF_TAIL_P(mp, leaf);
910 /*
911 * If there are data blocks other than the first one, take this
912 * opportunity to remove trailing empty data blocks that may have
913 * been left behind during no-space-reservation operations.
914 * These will show up in the leaf bests table.
915 */
916 while (dp->i_d.di_size > mp->m_dirblksize) {
917 bestsp = XFS_DIR2_LEAF_BESTS_P(ltp);
918 if (INT_GET(bestsp[INT_GET(ltp->bestcount, ARCH_CONVERT) - 1], ARCH_CONVERT) ==
919 mp->m_dirblksize - (uint)sizeof(block->hdr)) {
920 if ((error =
921 xfs_dir2_leaf_trim_data(args, lbp,
922 (xfs_dir2_db_t)(INT_GET(ltp->bestcount, ARCH_CONVERT) - 1))))
923 goto out;
924 } else {
925 error = 0;
926 goto out;
927 }
928 }
929 /*
930 * Read the data block if we don't already have it, give up if it fails.
931 */
932 if (dbp == NULL &&
933 (error = xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &dbp,
934 XFS_DATA_FORK))) {
935 goto out;
936 }
937 block = dbp->data;
938 ASSERT(INT_GET(block->hdr.magic, ARCH_CONVERT) == XFS_DIR2_DATA_MAGIC);
939 /*
940 * Size of the "leaf" area in the block.
941 */
942 size = (uint)sizeof(block->tail) +
943 (uint)sizeof(*lep) * (INT_GET(leaf->hdr.count, ARCH_CONVERT) - INT_GET(leaf->hdr.stale, ARCH_CONVERT));
944 /*
945 * Look at the last data entry.
946 */
947 tagp = (xfs_dir2_data_off_t *)((char *)block + mp->m_dirblksize) - 1;
948 dup = (xfs_dir2_data_unused_t *)((char *)block + INT_GET(*tagp, ARCH_CONVERT));
949 /*
950 * If it's not free or is too short we can't do it.
951 */
952 if (INT_GET(dup->freetag, ARCH_CONVERT) != XFS_DIR2_DATA_FREE_TAG || INT_GET(dup->length, ARCH_CONVERT) < size) {
953 error = 0;
954 goto out;
955 }
956 /*
957 * Start converting it to block form.
958 */
959 INT_SET(block->hdr.magic, ARCH_CONVERT, XFS_DIR2_BLOCK_MAGIC);
960 needlog = 1;
961 needscan = 0;
962 /*
963 * Use up the space at the end of the block (blp/btp).
964 */
965 xfs_dir2_data_use_free(tp, dbp, dup, mp->m_dirblksize - size, size,
966 &needlog, &needscan);
967 /*
968 * Initialize the block tail.
969 */
970 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
971 INT_SET(btp->count, ARCH_CONVERT, INT_GET(leaf->hdr.count, ARCH_CONVERT) - INT_GET(leaf->hdr.stale, ARCH_CONVERT));
972 btp->stale = 0;
973 xfs_dir2_block_log_tail(tp, dbp);
974 /*
975 * Initialize the block leaf area. We compact out stale entries.
976 */
977 lep = XFS_DIR2_BLOCK_LEAF_P(btp);
978 for (from = to = 0; from < INT_GET(leaf->hdr.count, ARCH_CONVERT); from++) {
979 if (INT_GET(leaf->ents[from].address, ARCH_CONVERT) == XFS_DIR2_NULL_DATAPTR)
980 continue;
981 lep[to++] = leaf->ents[from];
982 }
983 ASSERT(to == INT_GET(btp->count, ARCH_CONVERT));
984 xfs_dir2_block_log_leaf(tp, dbp, 0, INT_GET(btp->count, ARCH_CONVERT) - 1);
985 /*
986 * Scan the bestfree if we need it and log the data block header.
987 */
988 if (needscan)
989 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog,
990 NULL);
991 if (needlog)
992 xfs_dir2_data_log_header(tp, dbp);
993 /*
994 * Pitch the old leaf block.
995 */
996 error = xfs_da_shrink_inode(args, mp->m_dirleafblk, lbp);
997 lbp = NULL;
998 if (error) {
999 goto out;
1000 }
1001 /*
1002 * Now see if the resulting block can be shrunken to shortform.
1003 */
1004 if ((size = xfs_dir2_block_sfsize(dp, block, &sfh)) >
1005 XFS_IFORK_DSIZE(dp)) {
1006 error = 0;
1007 goto out;
1008 }
1009 return xfs_dir2_block_to_sf(args, dbp, size, &sfh);
1010 out:
1011 if (lbp)
1012 xfs_da_buf_done(lbp);
1013 if (dbp)
1014 xfs_da_buf_done(dbp);
1015 return error;
1016 }
1017
1018 /*
1019 * Convert the shortform directory to block form.
1020 */
1021 int /* error */
1022 xfs_dir2_sf_to_block(
1023 xfs_da_args_t *args) /* operation arguments */
1024 {
1025 xfs_dir2_db_t blkno; /* dir-relative block # (0) */
1026 xfs_dir2_block_t *block; /* block structure */
1027 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
1028 xfs_dabuf_t *bp; /* block buffer */
1029 xfs_dir2_block_tail_t *btp; /* block tail pointer */
1030 char *buf; /* sf buffer */
1031 int buf_len;
1032 xfs_dir2_data_entry_t *dep; /* data entry pointer */
1033 xfs_inode_t *dp; /* incore directory inode */
1034 int dummy; /* trash */
1035 xfs_dir2_data_unused_t *dup; /* unused entry pointer */
1036 int endoffset; /* end of data objects */
1037 int error; /* error return value */
1038 int i; /* index */
1039 xfs_mount_t *mp; /* filesystem mount point */
1040 int needlog; /* need to log block header */
1041 int needscan; /* need to scan block freespc */
1042 int newoffset; /* offset from current entry */
1043 int offset; /* target block offset */
1044 xfs_dir2_sf_entry_t *sfep; /* sf entry pointer */
1045 xfs_dir2_sf_t *sfp; /* shortform structure */
1046 xfs_dir2_data_off_t *tagp; /* end of data entry */
1047 xfs_trans_t *tp; /* transaction pointer */
1048
1049 xfs_dir2_trace_args("sf_to_block", args);
1050 dp = args->dp;
1051 tp = args->trans;
1052 mp = dp->i_mount;
1053 ASSERT(dp->i_df.if_flags & XFS_IFINLINE);
1054 /*
1055 * Bomb out if the shortform directory is way too short.
1056 */
1057 if (dp->i_d.di_size < offsetof(xfs_dir2_sf_hdr_t, parent)) {
1058 ASSERT(XFS_FORCED_SHUTDOWN(mp));
1059 return XFS_ERROR(EIO);
1060 }
1061 ASSERT(dp->i_df.if_bytes == dp->i_d.di_size);
1062 ASSERT(dp->i_df.if_u1.if_data != NULL);
1063 sfp = (xfs_dir2_sf_t *)dp->i_df.if_u1.if_data;
1064 ASSERT(dp->i_d.di_size >= XFS_DIR2_SF_HDR_SIZE(sfp->hdr.i8count));
1065 /*
1066 * Copy the directory into the stack buffer.
1067 * Then pitch the incore inode data so we can make extents.
1068 */
1069
1070 buf_len = dp->i_df.if_bytes;
1071 buf = kmem_alloc(dp->i_df.if_bytes, KM_SLEEP);
1072
1073 memcpy(buf, sfp, dp->i_df.if_bytes);
1074 xfs_idata_realloc(dp, -dp->i_df.if_bytes, XFS_DATA_FORK);
1075 dp->i_d.di_size = 0;
1076 xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE);
1077 /*
1078 * Reset pointer - old sfp is gone.
1079 */
1080 sfp = (xfs_dir2_sf_t *)buf;
1081 /*
1082 * Add block 0 to the inode.
1083 */
1084 error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE, &blkno);
1085 if (error) {
1086 kmem_free(buf, buf_len);
1087 return error;
1088 }
1089 /*
1090 * Initialize the data block.
1091 */
1092 error = xfs_dir2_data_init(args, blkno, &bp);
1093 if (error) {
1094 kmem_free(buf, buf_len);
1095 return error;
1096 }
1097 block = bp->data;
1098 INT_SET(block->hdr.magic, ARCH_CONVERT, XFS_DIR2_BLOCK_MAGIC);
1099 /*
1100 * Compute size of block "tail" area.
1101 */
1102 i = (uint)sizeof(*btp) +
1103 (INT_GET(sfp->hdr.count, ARCH_CONVERT) + 2) * (uint)sizeof(xfs_dir2_leaf_entry_t);
1104 /*
1105 * The whole thing is initialized to free by the init routine.
1106 * Say we're using the leaf and tail area.
1107 */
1108 dup = (xfs_dir2_data_unused_t *)block->u;
1109 needlog = needscan = 0;
1110 xfs_dir2_data_use_free(tp, bp, dup, mp->m_dirblksize - i, i, &needlog,
1111 &needscan);
1112 ASSERT(needscan == 0);
1113 /*
1114 * Fill in the tail.
1115 */
1116 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
1117 INT_SET(btp->count, ARCH_CONVERT, INT_GET(sfp->hdr.count, ARCH_CONVERT) + 2); /* ., .. */
1118 btp->stale = 0;
1119 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
1120 endoffset = (uint)((char *)blp - (char *)block);
1121 /*
1122 * Remove the freespace, we'll manage it.
1123 */
1124 xfs_dir2_data_use_free(tp, bp, dup,
1125 (xfs_dir2_data_aoff_t)((char *)dup - (char *)block),
1126 INT_GET(dup->length, ARCH_CONVERT), &needlog, &needscan);
1127 /*
1128 * Create entry for .
1129 */
1130 dep = (xfs_dir2_data_entry_t *)
1131 ((char *)block + XFS_DIR2_DATA_DOT_OFFSET);
1132 INT_SET(dep->inumber, ARCH_CONVERT, dp->i_ino);
1133 dep->namelen = 1;
1134 dep->name[0] = '.';
1135 tagp = XFS_DIR2_DATA_ENTRY_TAG_P(dep);
1136 INT_SET(*tagp, ARCH_CONVERT, (xfs_dir2_data_off_t)((char *)dep - (char *)block));
1137 xfs_dir2_data_log_entry(tp, bp, dep);
1138 INT_SET(blp[0].hashval, ARCH_CONVERT, xfs_dir_hash_dot);
1139 INT_SET(blp[0].address, ARCH_CONVERT, XFS_DIR2_BYTE_TO_DATAPTR(mp, (char *)dep - (char *)block));
1140 /*
1141 * Create entry for ..
1142 */
1143 dep = (xfs_dir2_data_entry_t *)
1144 ((char *)block + XFS_DIR2_DATA_DOTDOT_OFFSET);
1145 INT_SET(dep->inumber, ARCH_CONVERT, XFS_DIR2_SF_GET_INUMBER(sfp, &sfp->hdr.parent));
1146 dep->namelen = 2;
1147 dep->name[0] = dep->name[1] = '.';
1148 tagp = XFS_DIR2_DATA_ENTRY_TAG_P(dep);
1149 INT_SET(*tagp, ARCH_CONVERT, (xfs_dir2_data_off_t)((char *)dep - (char *)block));
1150 xfs_dir2_data_log_entry(tp, bp, dep);
1151 INT_SET(blp[1].hashval, ARCH_CONVERT, xfs_dir_hash_dotdot);
1152 INT_SET(blp[1].address, ARCH_CONVERT, XFS_DIR2_BYTE_TO_DATAPTR(mp, (char *)dep - (char *)block));
1153 offset = XFS_DIR2_DATA_FIRST_OFFSET;
1154 /*
1155 * Loop over existing entries, stuff them in.
1156 */
1157 if ((i = 0) == INT_GET(sfp->hdr.count, ARCH_CONVERT))
1158 sfep = NULL;
1159 else
1160 sfep = XFS_DIR2_SF_FIRSTENTRY(sfp);
1161 /*
1162 * Need to preserve the existing offset values in the sf directory.
1163 * Insert holes (unused entries) where necessary.
1164 */
1165 while (offset < endoffset) {
1166 /*
1167 * sfep is null when we reach the end of the list.
1168 */
1169 if (sfep == NULL)
1170 newoffset = endoffset;
1171 else
1172 newoffset = XFS_DIR2_SF_GET_OFFSET(sfep);
1173 /*
1174 * There should be a hole here, make one.
1175 */
1176 if (offset < newoffset) {
1177 dup = (xfs_dir2_data_unused_t *)
1178 ((char *)block + offset);
1179 INT_SET(dup->freetag, ARCH_CONVERT, XFS_DIR2_DATA_FREE_TAG);
1180 INT_SET(dup->length, ARCH_CONVERT, newoffset - offset);
1181 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(dup), ARCH_CONVERT,
1182 (xfs_dir2_data_off_t)
1183 ((char *)dup - (char *)block));
1184 xfs_dir2_data_log_unused(tp, bp, dup);
1185 (void)xfs_dir2_data_freeinsert((xfs_dir2_data_t *)block,
1186 dup, &dummy);
1187 offset += INT_GET(dup->length, ARCH_CONVERT);
1188 continue;
1189 }
1190 /*
1191 * Copy a real entry.
1192 */
1193 dep = (xfs_dir2_data_entry_t *)((char *)block + newoffset);
1194 INT_SET(dep->inumber, ARCH_CONVERT, XFS_DIR2_SF_GET_INUMBER(sfp,
1195 XFS_DIR2_SF_INUMBERP(sfep)));
1196 dep->namelen = sfep->namelen;
1197 memcpy(dep->name, sfep->name, dep->namelen);
1198 tagp = XFS_DIR2_DATA_ENTRY_TAG_P(dep);
1199 INT_SET(*tagp, ARCH_CONVERT, (xfs_dir2_data_off_t)((char *)dep - (char *)block));
1200 xfs_dir2_data_log_entry(tp, bp, dep);
1201 INT_SET(blp[2 + i].hashval, ARCH_CONVERT, xfs_da_hashname((char *)sfep->name, sfep->namelen));
1202 INT_SET(blp[2 + i].address, ARCH_CONVERT, XFS_DIR2_BYTE_TO_DATAPTR(mp,
1203 (char *)dep - (char *)block));
1204 offset = (int)((char *)(tagp + 1) - (char *)block);
1205 if (++i == INT_GET(sfp->hdr.count, ARCH_CONVERT))
1206 sfep = NULL;
1207 else
1208 sfep = XFS_DIR2_SF_NEXTENTRY(sfp, sfep);
1209 }
1210 /* Done with the temporary buffer */
1211 kmem_free(buf, buf_len);
1212 /*
1213 * Sort the leaf entries by hash value.
1214 */
1215 xfs_sort(blp, INT_GET(btp->count, ARCH_CONVERT), sizeof(*blp), xfs_dir2_block_sort);
1216 /*
1217 * Log the leaf entry area and tail.
1218 * Already logged the header in data_init, ignore needlog.
1219 */
1220 ASSERT(needscan == 0);
1221 xfs_dir2_block_log_leaf(tp, bp, 0, INT_GET(btp->count, ARCH_CONVERT) - 1);
1222 xfs_dir2_block_log_tail(tp, bp);
1223 xfs_dir2_data_check(dp, bp);
1224 xfs_da_buf_done(bp);
1225 return 0;
1226 }
Mirror of the linux-mips.org kernel tree