2 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
3 * Copyright (c) 2013 Red Hat, Inc.
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
8 * published by the Free Software Foundation.
10 * This program is distributed in the hope that it would be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
21 #include "xfs_types.h"
24 #include "xfs_trans.h"
27 #include "xfs_mount.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_bmap_btree.h"
30 #include "xfs_dinode.h"
31 #include "xfs_inode.h"
33 #include "xfs_dir2_format.h"
34 #include "xfs_dir2_priv.h"
35 #include "xfs_error.h"
36 #include "xfs_trace.h"
37 #include "xfs_buf_item.h"
38 #include "xfs_cksum.h"
41 * Local function declarations.
43 static int xfs_dir2_leaf_lookup_int(xfs_da_args_t *args, struct xfs_buf **lbpp,
44 int *indexp, struct xfs_buf **dbpp);
45 static void xfs_dir3_leaf_log_bests(struct xfs_trans *tp, struct xfs_buf *bp,
47 static void xfs_dir3_leaf_log_tail(struct xfs_trans *tp, struct xfs_buf *bp);
50 * Check the internal consistency of a leaf1 block.
51 * Pop an assert if something is wrong.
54 #define xfs_dir3_leaf_check(mp, bp) \
56 if (!xfs_dir3_leaf1_check((mp), (bp))) \
65 struct xfs_dir2_leaf *leaf = bp->b_addr;
66 struct xfs_dir3_icleaf_hdr leafhdr;
68 xfs_dir3_leaf_hdr_from_disk(&leafhdr, leaf);
70 if (leafhdr.magic == XFS_DIR3_LEAF1_MAGIC) {
71 struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr;
72 if (be64_to_cpu(leaf3->info.blkno) != bp->b_bn)
74 } else if (leafhdr.magic != XFS_DIR2_LEAF1_MAGIC)
77 return xfs_dir3_leaf_check_int(mp, &leafhdr, leaf);
80 #define xfs_dir3_leaf_check(mp, bp)
84 xfs_dir3_leaf_hdr_from_disk(
85 struct xfs_dir3_icleaf_hdr *to,
86 struct xfs_dir2_leaf *from)
88 if (from->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) ||
89 from->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC)) {
90 to->forw = be32_to_cpu(from->hdr.info.forw);
91 to->back = be32_to_cpu(from->hdr.info.back);
92 to->magic = be16_to_cpu(from->hdr.info.magic);
93 to->count = be16_to_cpu(from->hdr.count);
94 to->stale = be16_to_cpu(from->hdr.stale);
96 struct xfs_dir3_leaf_hdr *hdr3 = (struct xfs_dir3_leaf_hdr *)from;
98 to->forw = be32_to_cpu(hdr3->info.hdr.forw);
99 to->back = be32_to_cpu(hdr3->info.hdr.back);
100 to->magic = be16_to_cpu(hdr3->info.hdr.magic);
101 to->count = be16_to_cpu(hdr3->count);
102 to->stale = be16_to_cpu(hdr3->stale);
105 ASSERT(to->magic == XFS_DIR2_LEAF1_MAGIC ||
106 to->magic == XFS_DIR3_LEAF1_MAGIC ||
107 to->magic == XFS_DIR2_LEAFN_MAGIC ||
108 to->magic == XFS_DIR3_LEAFN_MAGIC);
112 xfs_dir3_leaf_hdr_to_disk(
113 struct xfs_dir2_leaf *to,
114 struct xfs_dir3_icleaf_hdr *from)
116 ASSERT(from->magic == XFS_DIR2_LEAF1_MAGIC ||
117 from->magic == XFS_DIR3_LEAF1_MAGIC ||
118 from->magic == XFS_DIR2_LEAFN_MAGIC ||
119 from->magic == XFS_DIR3_LEAFN_MAGIC);
121 if (from->magic == XFS_DIR2_LEAF1_MAGIC ||
122 from->magic == XFS_DIR2_LEAFN_MAGIC) {
123 to->hdr.info.forw = cpu_to_be32(from->forw);
124 to->hdr.info.back = cpu_to_be32(from->back);
125 to->hdr.info.magic = cpu_to_be16(from->magic);
126 to->hdr.count = cpu_to_be16(from->count);
127 to->hdr.stale = cpu_to_be16(from->stale);
129 struct xfs_dir3_leaf_hdr *hdr3 = (struct xfs_dir3_leaf_hdr *)to;
131 hdr3->info.hdr.forw = cpu_to_be32(from->forw);
132 hdr3->info.hdr.back = cpu_to_be32(from->back);
133 hdr3->info.hdr.magic = cpu_to_be16(from->magic);
134 hdr3->count = cpu_to_be16(from->count);
135 hdr3->stale = cpu_to_be16(from->stale);
140 xfs_dir3_leaf_check_int(
141 struct xfs_mount *mp,
142 struct xfs_dir3_icleaf_hdr *hdr,
143 struct xfs_dir2_leaf *leaf)
145 struct xfs_dir2_leaf_entry *ents;
146 xfs_dir2_leaf_tail_t *ltp;
150 ents = xfs_dir3_leaf_ents_p(leaf);
151 ltp = xfs_dir2_leaf_tail_p(mp, leaf);
154 * XXX (dgc): This value is not restrictive enough.
155 * Should factor in the size of the bests table as well.
156 * We can deduce a value for that from di_size.
158 if (hdr->count > xfs_dir3_max_leaf_ents(mp, leaf))
161 /* Leaves and bests don't overlap in leaf format. */
162 if ((hdr->magic == XFS_DIR2_LEAF1_MAGIC ||
163 hdr->magic == XFS_DIR3_LEAF1_MAGIC) &&
164 (char *)&ents[hdr->count] > (char *)xfs_dir2_leaf_bests_p(ltp))
167 /* Check hash value order, count stale entries. */
168 for (i = stale = 0; i < hdr->count; i++) {
169 if (i + 1 < hdr->count) {
170 if (be32_to_cpu(ents[i].hashval) >
171 be32_to_cpu(ents[i + 1].hashval))
174 if (ents[i].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR))
177 if (hdr->stale != stale)
183 xfs_dir3_leaf_verify(
187 struct xfs_mount *mp = bp->b_target->bt_mount;
188 struct xfs_dir2_leaf *leaf = bp->b_addr;
189 struct xfs_dir3_icleaf_hdr leafhdr;
191 ASSERT(magic == XFS_DIR2_LEAF1_MAGIC || magic == XFS_DIR2_LEAFN_MAGIC);
193 xfs_dir3_leaf_hdr_from_disk(&leafhdr, leaf);
194 if (xfs_sb_version_hascrc(&mp->m_sb)) {
195 struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr;
197 if ((magic == XFS_DIR2_LEAF1_MAGIC &&
198 leafhdr.magic != XFS_DIR3_LEAF1_MAGIC) ||
199 (magic == XFS_DIR2_LEAFN_MAGIC &&
200 leafhdr.magic != XFS_DIR3_LEAFN_MAGIC))
203 if (!uuid_equal(&leaf3->info.uuid, &mp->m_sb.sb_uuid))
205 if (be64_to_cpu(leaf3->info.blkno) != bp->b_bn)
208 if (leafhdr.magic != magic)
211 return xfs_dir3_leaf_check_int(mp, &leafhdr, leaf);
219 struct xfs_mount *mp = bp->b_target->bt_mount;
221 if ((xfs_sb_version_hascrc(&mp->m_sb) &&
222 !xfs_verify_cksum(bp->b_addr, BBTOB(bp->b_length),
223 XFS_DIR3_LEAF_CRC_OFF)) ||
224 !xfs_dir3_leaf_verify(bp, magic)) {
225 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp, bp->b_addr);
226 xfs_buf_ioerror(bp, EFSCORRUPTED);
235 struct xfs_mount *mp = bp->b_target->bt_mount;
236 struct xfs_buf_log_item *bip = bp->b_fspriv;
237 struct xfs_dir3_leaf_hdr *hdr3 = bp->b_addr;
239 if (!xfs_dir3_leaf_verify(bp, magic)) {
240 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp, bp->b_addr);
241 xfs_buf_ioerror(bp, EFSCORRUPTED);
245 if (!xfs_sb_version_hascrc(&mp->m_sb))
249 hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn);
251 xfs_update_cksum(bp->b_addr, BBTOB(bp->b_length), XFS_DIR3_LEAF_CRC_OFF);
255 xfs_dir3_leaf1_read_verify(
258 __read_verify(bp, XFS_DIR2_LEAF1_MAGIC);
262 xfs_dir3_leaf1_write_verify(
265 __write_verify(bp, XFS_DIR2_LEAF1_MAGIC);
269 xfs_dir3_leafn_read_verify(
272 __read_verify(bp, XFS_DIR2_LEAFN_MAGIC);
276 xfs_dir3_leafn_write_verify(
279 __write_verify(bp, XFS_DIR2_LEAFN_MAGIC);
282 const struct xfs_buf_ops xfs_dir3_leaf1_buf_ops = {
283 .verify_read = xfs_dir3_leaf1_read_verify,
284 .verify_write = xfs_dir3_leaf1_write_verify,
287 const struct xfs_buf_ops xfs_dir3_leafn_buf_ops = {
288 .verify_read = xfs_dir3_leafn_read_verify,
289 .verify_write = xfs_dir3_leafn_write_verify,
294 struct xfs_trans *tp,
295 struct xfs_inode *dp,
297 xfs_daddr_t mappedbno,
298 struct xfs_buf **bpp)
302 err = xfs_da_read_buf(tp, dp, fbno, mappedbno, bpp,
303 XFS_DATA_FORK, &xfs_dir3_leaf1_buf_ops);
305 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_LEAF1_BUF);
311 struct xfs_trans *tp,
312 struct xfs_inode *dp,
314 xfs_daddr_t mappedbno,
315 struct xfs_buf **bpp)
319 err = xfs_da_read_buf(tp, dp, fbno, mappedbno, bpp,
320 XFS_DATA_FORK, &xfs_dir3_leafn_buf_ops);
322 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_DIR_LEAFN_BUF);
327 * Initialize a new leaf block, leaf1 or leafn magic accepted.
331 struct xfs_mount *mp,
332 struct xfs_trans *tp,
337 struct xfs_dir2_leaf *leaf = bp->b_addr;
339 ASSERT(type == XFS_DIR2_LEAF1_MAGIC || type == XFS_DIR2_LEAFN_MAGIC);
341 if (xfs_sb_version_hascrc(&mp->m_sb)) {
342 struct xfs_dir3_leaf_hdr *leaf3 = bp->b_addr;
344 memset(leaf3, 0, sizeof(*leaf3));
346 leaf3->info.hdr.magic = (type == XFS_DIR2_LEAF1_MAGIC)
347 ? cpu_to_be16(XFS_DIR3_LEAF1_MAGIC)
348 : cpu_to_be16(XFS_DIR3_LEAFN_MAGIC);
349 leaf3->info.blkno = cpu_to_be64(bp->b_bn);
350 leaf3->info.owner = cpu_to_be64(owner);
351 uuid_copy(&leaf3->info.uuid, &mp->m_sb.sb_uuid);
353 memset(leaf, 0, sizeof(*leaf));
354 leaf->hdr.info.magic = cpu_to_be16(type);
358 * If it's a leaf-format directory initialize the tail.
359 * Caller is responsible for initialising the bests table.
361 if (type == XFS_DIR2_LEAF1_MAGIC) {
362 struct xfs_dir2_leaf_tail *ltp;
364 ltp = xfs_dir2_leaf_tail_p(mp, leaf);
366 bp->b_ops = &xfs_dir3_leaf1_buf_ops;
367 xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_LEAF1_BUF);
369 bp->b_ops = &xfs_dir3_leafn_buf_ops;
370 xfs_trans_buf_set_type(tp, bp, XFS_BLFT_DIR_LEAFN_BUF);
375 xfs_dir3_leaf_get_buf(
378 struct xfs_buf **bpp,
381 struct xfs_inode *dp = args->dp;
382 struct xfs_trans *tp = args->trans;
383 struct xfs_mount *mp = dp->i_mount;
387 ASSERT(magic == XFS_DIR2_LEAF1_MAGIC || magic == XFS_DIR2_LEAFN_MAGIC);
388 ASSERT(bno >= XFS_DIR2_LEAF_FIRSTDB(mp) &&
389 bno < XFS_DIR2_FREE_FIRSTDB(mp));
391 error = xfs_da_get_buf(tp, dp, xfs_dir2_db_to_da(mp, bno), -1, &bp,
396 xfs_dir3_leaf_init(mp, tp, bp, dp->i_ino, magic);
397 xfs_dir3_leaf_log_header(tp, bp);
398 if (magic == XFS_DIR2_LEAF1_MAGIC)
399 xfs_dir3_leaf_log_tail(tp, bp);
405 * Convert a block form directory to a leaf form directory.
408 xfs_dir2_block_to_leaf(
409 xfs_da_args_t *args, /* operation arguments */
410 struct xfs_buf *dbp) /* input block's buffer */
412 __be16 *bestsp; /* leaf's bestsp entries */
413 xfs_dablk_t blkno; /* leaf block's bno */
414 xfs_dir2_data_hdr_t *hdr; /* block header */
415 xfs_dir2_leaf_entry_t *blp; /* block's leaf entries */
416 xfs_dir2_block_tail_t *btp; /* block's tail */
417 xfs_inode_t *dp; /* incore directory inode */
418 int error; /* error return code */
419 struct xfs_buf *lbp; /* leaf block's buffer */
420 xfs_dir2_db_t ldb; /* leaf block's bno */
421 xfs_dir2_leaf_t *leaf; /* leaf structure */
422 xfs_dir2_leaf_tail_t *ltp; /* leaf's tail */
423 xfs_mount_t *mp; /* filesystem mount point */
424 int needlog; /* need to log block header */
425 int needscan; /* need to rescan bestfree */
426 xfs_trans_t *tp; /* transaction pointer */
427 struct xfs_dir2_data_free *bf;
428 struct xfs_dir2_leaf_entry *ents;
429 struct xfs_dir3_icleaf_hdr leafhdr;
431 trace_xfs_dir2_block_to_leaf(args);
437 * Add the leaf block to the inode.
438 * This interface will only put blocks in the leaf/node range.
439 * Since that's empty now, we'll get the root (block 0 in range).
441 if ((error = xfs_da_grow_inode(args, &blkno))) {
444 ldb = xfs_dir2_da_to_db(mp, blkno);
445 ASSERT(ldb == XFS_DIR2_LEAF_FIRSTDB(mp));
447 * Initialize the leaf block, get a buffer for it.
449 error = xfs_dir3_leaf_get_buf(args, ldb, &lbp, XFS_DIR2_LEAF1_MAGIC);
455 xfs_dir3_data_check(dp, dbp);
456 btp = xfs_dir2_block_tail_p(mp, hdr);
457 blp = xfs_dir2_block_leaf_p(btp);
458 bf = xfs_dir3_data_bestfree_p(hdr);
459 ents = xfs_dir3_leaf_ents_p(leaf);
462 * Set the counts in the leaf header.
464 xfs_dir3_leaf_hdr_from_disk(&leafhdr, leaf);
465 leafhdr.count = be32_to_cpu(btp->count);
466 leafhdr.stale = be32_to_cpu(btp->stale);
467 xfs_dir3_leaf_hdr_to_disk(leaf, &leafhdr);
468 xfs_dir3_leaf_log_header(tp, lbp);
471 * Could compact these but I think we always do the conversion
472 * after squeezing out stale entries.
474 memcpy(ents, blp, be32_to_cpu(btp->count) * sizeof(xfs_dir2_leaf_entry_t));
475 xfs_dir3_leaf_log_ents(tp, lbp, 0, leafhdr.count - 1);
479 * Make the space formerly occupied by the leaf entries and block
482 xfs_dir2_data_make_free(tp, dbp,
483 (xfs_dir2_data_aoff_t)((char *)blp - (char *)hdr),
484 (xfs_dir2_data_aoff_t)((char *)hdr + mp->m_dirblksize -
486 &needlog, &needscan);
488 * Fix up the block header, make it a data block.
490 dbp->b_ops = &xfs_dir3_data_buf_ops;
491 xfs_trans_buf_set_type(tp, dbp, XFS_BLFT_DIR_DATA_BUF);
492 if (hdr->magic == cpu_to_be32(XFS_DIR2_BLOCK_MAGIC))
493 hdr->magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC);
495 hdr->magic = cpu_to_be32(XFS_DIR3_DATA_MAGIC);
498 xfs_dir2_data_freescan(mp, hdr, &needlog);
500 * Set up leaf tail and bests table.
502 ltp = xfs_dir2_leaf_tail_p(mp, leaf);
503 ltp->bestcount = cpu_to_be32(1);
504 bestsp = xfs_dir2_leaf_bests_p(ltp);
505 bestsp[0] = bf[0].length;
507 * Log the data header and leaf bests table.
510 xfs_dir2_data_log_header(tp, dbp);
511 xfs_dir3_leaf_check(mp, lbp);
512 xfs_dir3_data_check(dp, dbp);
513 xfs_dir3_leaf_log_bests(tp, lbp, 0, 0);
518 xfs_dir3_leaf_find_stale(
519 struct xfs_dir3_icleaf_hdr *leafhdr,
520 struct xfs_dir2_leaf_entry *ents,
526 * Find the first stale entry before our index, if any.
528 for (*lowstale = index - 1; *lowstale >= 0; --*lowstale) {
529 if (ents[*lowstale].address ==
530 cpu_to_be32(XFS_DIR2_NULL_DATAPTR))
535 * Find the first stale entry at or after our index, if any.
536 * Stop if the result would require moving more entries than using
539 for (*highstale = index; *highstale < leafhdr->count; ++*highstale) {
540 if (ents[*highstale].address ==
541 cpu_to_be32(XFS_DIR2_NULL_DATAPTR))
543 if (*lowstale >= 0 && index - *lowstale <= *highstale - index)
548 struct xfs_dir2_leaf_entry *
549 xfs_dir3_leaf_find_entry(
550 struct xfs_dir3_icleaf_hdr *leafhdr,
551 struct xfs_dir2_leaf_entry *ents,
552 int index, /* leaf table position */
553 int compact, /* need to compact leaves */
554 int lowstale, /* index of prev stale leaf */
555 int highstale, /* index of next stale leaf */
556 int *lfloglow, /* low leaf logging index */
557 int *lfloghigh) /* high leaf logging index */
559 if (!leafhdr->stale) {
560 xfs_dir2_leaf_entry_t *lep; /* leaf entry table pointer */
563 * Now we need to make room to insert the leaf entry.
565 * If there are no stale entries, just insert a hole at index.
568 if (index < leafhdr->count)
569 memmove(lep + 1, lep,
570 (leafhdr->count - index) * sizeof(*lep));
573 * Record low and high logging indices for the leaf.
576 *lfloghigh = leafhdr->count++;
581 * There are stale entries.
583 * We will use one of them for the new entry. It's probably not at
584 * the right location, so we'll have to shift some up or down first.
586 * If we didn't compact before, we need to find the nearest stale
587 * entries before and after our insertion point.
590 xfs_dir3_leaf_find_stale(leafhdr, ents, index,
591 &lowstale, &highstale);
594 * If the low one is better, use it.
597 (highstale == leafhdr->count ||
598 index - lowstale - 1 < highstale - index)) {
599 ASSERT(index - lowstale - 1 >= 0);
600 ASSERT(ents[lowstale].address ==
601 cpu_to_be32(XFS_DIR2_NULL_DATAPTR));
604 * Copy entries up to cover the stale entry and make room
607 if (index - lowstale - 1 > 0) {
608 memmove(&ents[lowstale], &ents[lowstale + 1],
609 (index - lowstale - 1) *
610 sizeof(xfs_dir2_leaf_entry_t));
612 *lfloglow = MIN(lowstale, *lfloglow);
613 *lfloghigh = MAX(index - 1, *lfloghigh);
615 return &ents[index - 1];
619 * The high one is better, so use that one.
621 ASSERT(highstale - index >= 0);
622 ASSERT(ents[highstale].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR));
625 * Copy entries down to cover the stale entry and make room for the
628 if (highstale - index > 0) {
629 memmove(&ents[index + 1], &ents[index],
630 (highstale - index) * sizeof(xfs_dir2_leaf_entry_t));
632 *lfloglow = MIN(index, *lfloglow);
633 *lfloghigh = MAX(highstale, *lfloghigh);
639 * Add an entry to a leaf form directory.
642 xfs_dir2_leaf_addname(
643 xfs_da_args_t *args) /* operation arguments */
645 __be16 *bestsp; /* freespace table in leaf */
646 int compact; /* need to compact leaves */
647 xfs_dir2_data_hdr_t *hdr; /* data block header */
648 struct xfs_buf *dbp; /* data block buffer */
649 xfs_dir2_data_entry_t *dep; /* data block entry */
650 xfs_inode_t *dp; /* incore directory inode */
651 xfs_dir2_data_unused_t *dup; /* data unused entry */
652 int error; /* error return value */
653 int grown; /* allocated new data block */
654 int highstale; /* index of next stale leaf */
655 int i; /* temporary, index */
656 int index; /* leaf table position */
657 struct xfs_buf *lbp; /* leaf's buffer */
658 xfs_dir2_leaf_t *leaf; /* leaf structure */
659 int length; /* length of new entry */
660 xfs_dir2_leaf_entry_t *lep; /* leaf entry table pointer */
661 int lfloglow; /* low leaf logging index */
662 int lfloghigh; /* high leaf logging index */
663 int lowstale; /* index of prev stale leaf */
664 xfs_dir2_leaf_tail_t *ltp; /* leaf tail pointer */
665 xfs_mount_t *mp; /* filesystem mount point */
666 int needbytes; /* leaf block bytes needed */
667 int needlog; /* need to log data header */
668 int needscan; /* need to rescan data free */
669 __be16 *tagp; /* end of data entry */
670 xfs_trans_t *tp; /* transaction pointer */
671 xfs_dir2_db_t use_block; /* data block number */
672 struct xfs_dir2_data_free *bf; /* bestfree table */
673 struct xfs_dir2_leaf_entry *ents;
674 struct xfs_dir3_icleaf_hdr leafhdr;
676 trace_xfs_dir2_leaf_addname(args);
682 error = xfs_dir3_leaf_read(tp, dp, mp->m_dirleafblk, -1, &lbp);
687 * Look up the entry by hash value and name.
688 * We know it's not there, our caller has already done a lookup.
689 * So the index is of the entry to insert in front of.
690 * But if there are dup hash values the index is of the first of those.
692 index = xfs_dir2_leaf_search_hash(args, lbp);
694 ltp = xfs_dir2_leaf_tail_p(mp, leaf);
695 ents = xfs_dir3_leaf_ents_p(leaf);
696 xfs_dir3_leaf_hdr_from_disk(&leafhdr, leaf);
697 bestsp = xfs_dir2_leaf_bests_p(ltp);
698 length = xfs_dir2_data_entsize(args->namelen);
701 * See if there are any entries with the same hash value
702 * and space in their block for the new entry.
703 * This is good because it puts multiple same-hash value entries
704 * in a data block, improving the lookup of those entries.
706 for (use_block = -1, lep = &ents[index];
707 index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval;
709 if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR)
711 i = xfs_dir2_dataptr_to_db(mp, be32_to_cpu(lep->address));
712 ASSERT(i < be32_to_cpu(ltp->bestcount));
713 ASSERT(bestsp[i] != cpu_to_be16(NULLDATAOFF));
714 if (be16_to_cpu(bestsp[i]) >= length) {
720 * Didn't find a block yet, linear search all the data blocks.
722 if (use_block == -1) {
723 for (i = 0; i < be32_to_cpu(ltp->bestcount); i++) {
725 * Remember a block we see that's missing.
727 if (bestsp[i] == cpu_to_be16(NULLDATAOFF) &&
730 else if (be16_to_cpu(bestsp[i]) >= length) {
737 * How many bytes do we need in the leaf block?
741 needbytes += sizeof(xfs_dir2_leaf_entry_t);
743 needbytes += sizeof(xfs_dir2_data_off_t);
746 * Now kill use_block if it refers to a missing block, so we
747 * can use it as an indication of allocation needed.
749 if (use_block != -1 && bestsp[use_block] == cpu_to_be16(NULLDATAOFF))
752 * If we don't have enough free bytes but we can make enough
753 * by compacting out stale entries, we'll do that.
755 if ((char *)bestsp - (char *)&ents[leafhdr.count] < needbytes &&
760 * Otherwise if we don't have enough free bytes we need to
761 * convert to node form.
763 else if ((char *)bestsp - (char *)&ents[leafhdr.count] < needbytes) {
765 * Just checking or no space reservation, give up.
767 if ((args->op_flags & XFS_DA_OP_JUSTCHECK) ||
769 xfs_trans_brelse(tp, lbp);
770 return XFS_ERROR(ENOSPC);
773 * Convert to node form.
775 error = xfs_dir2_leaf_to_node(args, lbp);
779 * Then add the new entry.
781 return xfs_dir2_node_addname(args);
784 * Otherwise it will fit without compaction.
789 * If just checking, then it will fit unless we needed to allocate
792 if (args->op_flags & XFS_DA_OP_JUSTCHECK) {
793 xfs_trans_brelse(tp, lbp);
794 return use_block == -1 ? XFS_ERROR(ENOSPC) : 0;
797 * If no allocations are allowed, return now before we've
800 if (args->total == 0 && use_block == -1) {
801 xfs_trans_brelse(tp, lbp);
802 return XFS_ERROR(ENOSPC);
805 * Need to compact the leaf entries, removing stale ones.
806 * Leave one stale entry behind - the one closest to our
807 * insertion index - and we'll shift that one to our insertion
811 xfs_dir3_leaf_compact_x1(&leafhdr, ents, &index, &lowstale,
812 &highstale, &lfloglow, &lfloghigh);
815 * There are stale entries, so we'll need log-low and log-high
816 * impossibly bad values later.
818 else if (leafhdr.stale) {
819 lfloglow = leafhdr.count;
823 * If there was no data block space found, we need to allocate
826 if (use_block == -1) {
828 * Add the new data block.
830 if ((error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE,
832 xfs_trans_brelse(tp, lbp);
836 * Initialize the block.
838 if ((error = xfs_dir3_data_init(args, use_block, &dbp))) {
839 xfs_trans_brelse(tp, lbp);
843 * If we're adding a new data block on the end we need to
844 * extend the bests table. Copy it up one entry.
846 if (use_block >= be32_to_cpu(ltp->bestcount)) {
848 memmove(&bestsp[0], &bestsp[1],
849 be32_to_cpu(ltp->bestcount) * sizeof(bestsp[0]));
850 be32_add_cpu(<p->bestcount, 1);
851 xfs_dir3_leaf_log_tail(tp, lbp);
852 xfs_dir3_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1);
855 * If we're filling in a previously empty block just log it.
858 xfs_dir3_leaf_log_bests(tp, lbp, use_block, use_block);
860 bf = xfs_dir3_data_bestfree_p(hdr);
861 bestsp[use_block] = bf[0].length;
865 * Already had space in some data block.
866 * Just read that one in.
868 error = xfs_dir3_data_read(tp, dp,
869 xfs_dir2_db_to_da(mp, use_block),
872 xfs_trans_brelse(tp, lbp);
876 bf = xfs_dir3_data_bestfree_p(hdr);
880 * Point to the biggest freespace in our data block.
882 dup = (xfs_dir2_data_unused_t *)
883 ((char *)hdr + be16_to_cpu(bf[0].offset));
884 ASSERT(be16_to_cpu(dup->length) >= length);
885 needscan = needlog = 0;
887 * Mark the initial part of our freespace in use for the new entry.
889 xfs_dir2_data_use_free(tp, dbp, dup,
890 (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), length,
891 &needlog, &needscan);
893 * Initialize our new entry (at last).
895 dep = (xfs_dir2_data_entry_t *)dup;
896 dep->inumber = cpu_to_be64(args->inumber);
897 dep->namelen = args->namelen;
898 memcpy(dep->name, args->name, dep->namelen);
899 tagp = xfs_dir2_data_entry_tag_p(dep);
900 *tagp = cpu_to_be16((char *)dep - (char *)hdr);
902 * Need to scan fix up the bestfree table.
905 xfs_dir2_data_freescan(mp, hdr, &needlog);
907 * Need to log the data block's header.
910 xfs_dir2_data_log_header(tp, dbp);
911 xfs_dir2_data_log_entry(tp, dbp, dep);
913 * If the bests table needs to be changed, do it.
914 * Log the change unless we've already done that.
916 if (be16_to_cpu(bestsp[use_block]) != be16_to_cpu(bf[0].length)) {
917 bestsp[use_block] = bf[0].length;
919 xfs_dir3_leaf_log_bests(tp, lbp, use_block, use_block);
922 lep = xfs_dir3_leaf_find_entry(&leafhdr, ents, index, compact, lowstale,
923 highstale, &lfloglow, &lfloghigh);
926 * Fill in the new leaf entry.
928 lep->hashval = cpu_to_be32(args->hashval);
929 lep->address = cpu_to_be32(xfs_dir2_db_off_to_dataptr(mp, use_block,
930 be16_to_cpu(*tagp)));
932 * Log the leaf fields and give up the buffers.
934 xfs_dir3_leaf_hdr_to_disk(leaf, &leafhdr);
935 xfs_dir3_leaf_log_header(tp, lbp);
936 xfs_dir3_leaf_log_ents(tp, lbp, lfloglow, lfloghigh);
937 xfs_dir3_leaf_check(mp, lbp);
938 xfs_dir3_data_check(dp, dbp);
943 * Compact out any stale entries in the leaf.
944 * Log the header and changed leaf entries, if any.
947 xfs_dir3_leaf_compact(
948 xfs_da_args_t *args, /* operation arguments */
949 struct xfs_dir3_icleaf_hdr *leafhdr,
950 struct xfs_buf *bp) /* leaf buffer */
952 int from; /* source leaf index */
953 xfs_dir2_leaf_t *leaf; /* leaf structure */
954 int loglow; /* first leaf entry to log */
955 int to; /* target leaf index */
956 struct xfs_dir2_leaf_entry *ents;
963 * Compress out the stale entries in place.
965 ents = xfs_dir3_leaf_ents_p(leaf);
966 for (from = to = 0, loglow = -1; from < leafhdr->count; from++) {
967 if (ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR))
970 * Only actually copy the entries that are different.
975 ents[to] = ents[from];
980 * Update and log the header, log the leaf entries.
982 ASSERT(leafhdr->stale == from - to);
983 leafhdr->count -= leafhdr->stale;
986 xfs_dir3_leaf_hdr_to_disk(leaf, leafhdr);
987 xfs_dir3_leaf_log_header(args->trans, bp);
989 xfs_dir3_leaf_log_ents(args->trans, bp, loglow, to - 1);
993 * Compact the leaf entries, removing stale ones.
994 * Leave one stale entry behind - the one closest to our
995 * insertion index - and the caller will shift that one to our insertion
997 * Return new insertion index, where the remaining stale entry is,
998 * and leaf logging indices.
1001 xfs_dir3_leaf_compact_x1(
1002 struct xfs_dir3_icleaf_hdr *leafhdr,
1003 struct xfs_dir2_leaf_entry *ents,
1004 int *indexp, /* insertion index */
1005 int *lowstalep, /* out: stale entry before us */
1006 int *highstalep, /* out: stale entry after us */
1007 int *lowlogp, /* out: low log index */
1008 int *highlogp) /* out: high log index */
1010 int from; /* source copy index */
1011 int highstale; /* stale entry at/after index */
1012 int index; /* insertion index */
1013 int keepstale; /* source index of kept stale */
1014 int lowstale; /* stale entry before index */
1015 int newindex=0; /* new insertion index */
1016 int to; /* destination copy index */
1018 ASSERT(leafhdr->stale > 1);
1021 xfs_dir3_leaf_find_stale(leafhdr, ents, index, &lowstale, &highstale);
1024 * Pick the better of lowstale and highstale.
1026 if (lowstale >= 0 &&
1027 (highstale == leafhdr->count ||
1028 index - lowstale <= highstale - index))
1029 keepstale = lowstale;
1031 keepstale = highstale;
1033 * Copy the entries in place, removing all the stale entries
1036 for (from = to = 0; from < leafhdr->count; from++) {
1038 * Notice the new value of index.
1042 if (from != keepstale &&
1043 ents[from].address == cpu_to_be32(XFS_DIR2_NULL_DATAPTR)) {
1049 * Record the new keepstale value for the insertion.
1051 if (from == keepstale)
1052 lowstale = highstale = to;
1054 * Copy only the entries that have moved.
1057 ents[to] = ents[from];
1062 * If the insertion point was past the last entry,
1063 * set the new insertion point accordingly.
1069 * Adjust the leaf header values.
1071 leafhdr->count -= from - to;
1074 * Remember the low/high stale value only in the "right"
1077 if (lowstale >= newindex)
1080 highstale = leafhdr->count;
1081 *highlogp = leafhdr->count - 1;
1082 *lowstalep = lowstale;
1083 *highstalep = highstale;
1086 struct xfs_dir2_leaf_map_info {
1087 xfs_extlen_t map_blocks; /* number of fsbs in map */
1088 xfs_dablk_t map_off; /* last mapped file offset */
1089 int map_size; /* total entries in *map */
1090 int map_valid; /* valid entries in *map */
1091 int nmap; /* mappings to ask xfs_bmapi */
1092 xfs_dir2_db_t curdb; /* db for current block */
1093 int ra_current; /* number of read-ahead blks */
1094 int ra_index; /* *map index for read-ahead */
1095 int ra_offset; /* map entry offset for ra */
1096 int ra_want; /* readahead count wanted */
1097 struct xfs_bmbt_irec map[]; /* map vector for blocks */
1101 xfs_dir2_leaf_readbuf(
1102 struct xfs_inode *dp,
1104 struct xfs_dir2_leaf_map_info *mip,
1105 xfs_dir2_off_t *curoff,
1106 struct xfs_buf **bpp)
1108 struct xfs_mount *mp = dp->i_mount;
1109 struct xfs_buf *bp = *bpp;
1110 struct xfs_bmbt_irec *map = mip->map;
1111 struct blk_plug plug;
1118 * If we have a buffer, we need to release it and
1119 * take it out of the mapping.
1123 xfs_trans_brelse(NULL, bp);
1125 mip->map_blocks -= mp->m_dirblkfsbs;
1127 * Loop to get rid of the extents for the
1130 for (i = mp->m_dirblkfsbs; i > 0; ) {
1131 j = min_t(int, map->br_blockcount, i);
1132 map->br_blockcount -= j;
1133 map->br_startblock += j;
1134 map->br_startoff += j;
1136 * If mapping is done, pitch it from
1139 if (!map->br_blockcount && --mip->map_valid)
1140 memmove(&map[0], &map[1],
1141 sizeof(map[0]) * mip->map_valid);
1147 * Recalculate the readahead blocks wanted.
1149 mip->ra_want = howmany(bufsize + mp->m_dirblksize,
1150 mp->m_sb.sb_blocksize) - 1;
1151 ASSERT(mip->ra_want >= 0);
1154 * If we don't have as many as we want, and we haven't
1155 * run out of data blocks, get some more mappings.
1157 if (1 + mip->ra_want > mip->map_blocks &&
1158 mip->map_off < xfs_dir2_byte_to_da(mp, XFS_DIR2_LEAF_OFFSET)) {
1160 * Get more bmaps, fill in after the ones
1161 * we already have in the table.
1163 mip->nmap = mip->map_size - mip->map_valid;
1164 error = xfs_bmapi_read(dp, mip->map_off,
1165 xfs_dir2_byte_to_da(mp, XFS_DIR2_LEAF_OFFSET) -
1167 &map[mip->map_valid], &mip->nmap, 0);
1170 * Don't know if we should ignore this or try to return an
1171 * error. The trouble with returning errors is that readdir
1172 * will just stop without actually passing the error through.
1178 * If we got all the mappings we asked for, set the final map
1179 * offset based on the last bmap value received. Otherwise,
1180 * we've reached the end.
1182 if (mip->nmap == mip->map_size - mip->map_valid) {
1183 i = mip->map_valid + mip->nmap - 1;
1184 mip->map_off = map[i].br_startoff + map[i].br_blockcount;
1186 mip->map_off = xfs_dir2_byte_to_da(mp,
1187 XFS_DIR2_LEAF_OFFSET);
1190 * Look for holes in the mapping, and eliminate them. Count up
1193 for (i = mip->map_valid; i < mip->map_valid + mip->nmap; ) {
1194 if (map[i].br_startblock == HOLESTARTBLOCK) {
1196 length = mip->map_valid + mip->nmap - i;
1198 memmove(&map[i], &map[i + 1],
1199 sizeof(map[i]) * length);
1201 mip->map_blocks += map[i].br_blockcount;
1205 mip->map_valid += mip->nmap;
1209 * No valid mappings, so no more data blocks.
1211 if (!mip->map_valid) {
1212 *curoff = xfs_dir2_da_to_byte(mp, mip->map_off);
1217 * Read the directory block starting at the first mapping.
1219 mip->curdb = xfs_dir2_da_to_db(mp, map->br_startoff);
1220 error = xfs_dir3_data_read(NULL, dp, map->br_startoff,
1221 map->br_blockcount >= mp->m_dirblkfsbs ?
1222 XFS_FSB_TO_DADDR(mp, map->br_startblock) : -1, &bp);
1225 * Should just skip over the data block instead of giving up.
1231 * Adjust the current amount of read-ahead: we just read a block that
1232 * was previously ra.
1234 if (mip->ra_current)
1235 mip->ra_current -= mp->m_dirblkfsbs;
1238 * Do we need more readahead?
1240 blk_start_plug(&plug);
1241 for (mip->ra_index = mip->ra_offset = i = 0;
1242 mip->ra_want > mip->ra_current && i < mip->map_blocks;
1243 i += mp->m_dirblkfsbs) {
1244 ASSERT(mip->ra_index < mip->map_valid);
1246 * Read-ahead a contiguous directory block.
1248 if (i > mip->ra_current &&
1249 map[mip->ra_index].br_blockcount >= mp->m_dirblkfsbs) {
1250 xfs_dir3_data_readahead(NULL, dp,
1251 map[mip->ra_index].br_startoff + mip->ra_offset,
1252 XFS_FSB_TO_DADDR(mp,
1253 map[mip->ra_index].br_startblock +
1255 mip->ra_current = i;
1259 * Read-ahead a non-contiguous directory block. This doesn't
1260 * use our mapping, but this is a very rare case.
1262 else if (i > mip->ra_current) {
1263 xfs_dir3_data_readahead(NULL, dp,
1264 map[mip->ra_index].br_startoff +
1265 mip->ra_offset, -1);
1266 mip->ra_current = i;
1270 * Advance offset through the mapping table.
1272 for (j = 0; j < mp->m_dirblkfsbs; j++) {
1274 * The rest of this extent but not more than a dir
1277 length = min_t(int, mp->m_dirblkfsbs,
1278 map[mip->ra_index].br_blockcount -
1281 mip->ra_offset += length;
1284 * Advance to the next mapping if this one is used up.
1286 if (mip->ra_offset == map[mip->ra_index].br_blockcount) {
1292 blk_finish_plug(&plug);
1300 * Getdents (readdir) for leaf and node directories.
1301 * This reads the data blocks only, so is the same for both forms.
1304 xfs_dir2_leaf_getdents(
1305 xfs_inode_t *dp, /* incore directory inode */
1311 struct xfs_buf *bp = NULL; /* data block buffer */
1312 xfs_dir2_data_hdr_t *hdr; /* data block header */
1313 xfs_dir2_data_entry_t *dep; /* data entry */
1314 xfs_dir2_data_unused_t *dup; /* unused entry */
1315 int error = 0; /* error return value */
1316 int length; /* temporary length value */
1317 xfs_mount_t *mp; /* filesystem mount point */
1318 int byteoff; /* offset in current block */
1319 xfs_dir2_off_t curoff; /* current overall offset */
1320 xfs_dir2_off_t newoff; /* new curoff after new blk */
1321 char *ptr = NULL; /* pointer to current data */
1322 struct xfs_dir2_leaf_map_info *map_info;
1325 * If the offset is at or past the largest allowed value,
1326 * give up right away.
1328 if (*offset >= XFS_DIR2_MAX_DATAPTR)
1334 * Set up to bmap a number of blocks based on the caller's
1335 * buffer size, the directory block size, and the filesystem
1338 length = howmany(bufsize + mp->m_dirblksize,
1339 mp->m_sb.sb_blocksize);
1340 map_info = kmem_zalloc(offsetof(struct xfs_dir2_leaf_map_info, map) +
1341 (length * sizeof(struct xfs_bmbt_irec)),
1342 KM_SLEEP | KM_NOFS);
1343 map_info->map_size = length;
1346 * Inside the loop we keep the main offset value as a byte offset
1347 * in the directory file.
1349 curoff = xfs_dir2_dataptr_to_byte(mp, *offset);
1352 * Force this conversion through db so we truncate the offset
1353 * down to get the start of the data block.
1355 map_info->map_off = xfs_dir2_db_to_da(mp,
1356 xfs_dir2_byte_to_db(mp, curoff));
1359 * Loop over directory entries until we reach the end offset.
1360 * Get more blocks and readahead as necessary.
1362 while (curoff < XFS_DIR2_LEAF_OFFSET) {
1364 * If we have no buffer, or we're off the end of the
1365 * current buffer, need to get another one.
1367 if (!bp || ptr >= (char *)bp->b_addr + mp->m_dirblksize) {
1369 error = xfs_dir2_leaf_readbuf(dp, bufsize, map_info,
1371 if (error || !map_info->map_valid)
1375 * Having done a read, we need to set a new offset.
1377 newoff = xfs_dir2_db_off_to_byte(mp, map_info->curdb, 0);
1379 * Start of the current block.
1381 if (curoff < newoff)
1384 * Make sure we're in the right block.
1386 else if (curoff > newoff)
1387 ASSERT(xfs_dir2_byte_to_db(mp, curoff) ==
1390 xfs_dir3_data_check(dp, bp);
1392 * Find our position in the block.
1394 ptr = (char *)xfs_dir3_data_entry_p(hdr);
1395 byteoff = xfs_dir2_byte_to_off(mp, curoff);
1397 * Skip past the header.
1400 curoff += xfs_dir3_data_entry_offset(hdr);
1402 * Skip past entries until we reach our offset.
1405 while ((char *)ptr - (char *)hdr < byteoff) {
1406 dup = (xfs_dir2_data_unused_t *)ptr;
1408 if (be16_to_cpu(dup->freetag)
1409 == XFS_DIR2_DATA_FREE_TAG) {
1411 length = be16_to_cpu(dup->length);
1415 dep = (xfs_dir2_data_entry_t *)ptr;
1417 xfs_dir2_data_entsize(dep->namelen);
1421 * Now set our real offset.
1424 xfs_dir2_db_off_to_byte(mp,
1425 xfs_dir2_byte_to_db(mp, curoff),
1426 (char *)ptr - (char *)hdr);
1427 if (ptr >= (char *)hdr + mp->m_dirblksize) {
1433 * We have a pointer to an entry.
1436 dup = (xfs_dir2_data_unused_t *)ptr;
1438 * No, it's unused, skip over it.
1440 if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
1441 length = be16_to_cpu(dup->length);
1447 dep = (xfs_dir2_data_entry_t *)ptr;
1448 length = xfs_dir2_data_entsize(dep->namelen);
1450 if (filldir(dirent, (char *)dep->name, dep->namelen,
1451 xfs_dir2_byte_to_dataptr(mp, curoff) & 0x7fffffff,
1452 be64_to_cpu(dep->inumber), DT_UNKNOWN))
1456 * Advance to next entry in the block.
1460 /* bufsize may have just been a guess; don't go negative */
1461 bufsize = bufsize > length ? bufsize - length : 0;
1465 * All done. Set output offset value to current offset.
1467 if (curoff > xfs_dir2_dataptr_to_byte(mp, XFS_DIR2_MAX_DATAPTR))
1468 *offset = XFS_DIR2_MAX_DATAPTR & 0x7fffffff;
1470 *offset = xfs_dir2_byte_to_dataptr(mp, curoff) & 0x7fffffff;
1471 kmem_free(map_info);
1473 xfs_trans_brelse(NULL, bp);
1479 * Log the bests entries indicated from a leaf1 block.
1482 xfs_dir3_leaf_log_bests(
1483 xfs_trans_t *tp, /* transaction pointer */
1484 struct xfs_buf *bp, /* leaf buffer */
1485 int first, /* first entry to log */
1486 int last) /* last entry to log */
1488 __be16 *firstb; /* pointer to first entry */
1489 __be16 *lastb; /* pointer to last entry */
1490 struct xfs_dir2_leaf *leaf = bp->b_addr;
1491 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */
1493 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) ||
1494 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC));
1496 ltp = xfs_dir2_leaf_tail_p(tp->t_mountp, leaf);
1497 firstb = xfs_dir2_leaf_bests_p(ltp) + first;
1498 lastb = xfs_dir2_leaf_bests_p(ltp) + last;
1499 xfs_trans_log_buf(tp, bp, (uint)((char *)firstb - (char *)leaf),
1500 (uint)((char *)lastb - (char *)leaf + sizeof(*lastb) - 1));
1504 * Log the leaf entries indicated from a leaf1 or leafn block.
1507 xfs_dir3_leaf_log_ents(
1508 xfs_trans_t *tp, /* transaction pointer */
1509 struct xfs_buf *bp, /* leaf buffer */
1510 int first, /* first entry to log */
1511 int last) /* last entry to log */
1513 xfs_dir2_leaf_entry_t *firstlep; /* pointer to first entry */
1514 xfs_dir2_leaf_entry_t *lastlep; /* pointer to last entry */
1515 struct xfs_dir2_leaf *leaf = bp->b_addr;
1516 struct xfs_dir2_leaf_entry *ents;
1518 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) ||
1519 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) ||
1520 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) ||
1521 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC));
1523 ents = xfs_dir3_leaf_ents_p(leaf);
1524 firstlep = &ents[first];
1525 lastlep = &ents[last];
1526 xfs_trans_log_buf(tp, bp, (uint)((char *)firstlep - (char *)leaf),
1527 (uint)((char *)lastlep - (char *)leaf + sizeof(*lastlep) - 1));
1531 * Log the header of the leaf1 or leafn block.
1534 xfs_dir3_leaf_log_header(
1535 struct xfs_trans *tp,
1538 struct xfs_dir2_leaf *leaf = bp->b_addr;
1540 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) ||
1541 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) ||
1542 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) ||
1543 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC));
1545 xfs_trans_log_buf(tp, bp, (uint)((char *)&leaf->hdr - (char *)leaf),
1546 xfs_dir3_leaf_hdr_size(leaf) - 1);
1550 * Log the tail of the leaf1 block.
1553 xfs_dir3_leaf_log_tail(
1554 struct xfs_trans *tp,
1557 struct xfs_dir2_leaf *leaf = bp->b_addr;
1558 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */
1559 struct xfs_mount *mp = tp->t_mountp;
1561 ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAF1_MAGIC) ||
1562 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAF1_MAGIC) ||
1563 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR2_LEAFN_MAGIC) ||
1564 leaf->hdr.info.magic == cpu_to_be16(XFS_DIR3_LEAFN_MAGIC));
1566 ltp = xfs_dir2_leaf_tail_p(mp, leaf);
1567 xfs_trans_log_buf(tp, bp, (uint)((char *)ltp - (char *)leaf),
1568 (uint)(mp->m_dirblksize - 1));
1572 * Look up the entry referred to by args in the leaf format directory.
1573 * Most of the work is done by the xfs_dir2_leaf_lookup_int routine which
1574 * is also used by the node-format code.
1577 xfs_dir2_leaf_lookup(
1578 xfs_da_args_t *args) /* operation arguments */
1580 struct xfs_buf *dbp; /* data block buffer */
1581 xfs_dir2_data_entry_t *dep; /* data block entry */
1582 xfs_inode_t *dp; /* incore directory inode */
1583 int error; /* error return code */
1584 int index; /* found entry index */
1585 struct xfs_buf *lbp; /* leaf buffer */
1586 xfs_dir2_leaf_t *leaf; /* leaf structure */
1587 xfs_dir2_leaf_entry_t *lep; /* leaf entry */
1588 xfs_trans_t *tp; /* transaction pointer */
1589 struct xfs_dir2_leaf_entry *ents;
1591 trace_xfs_dir2_leaf_lookup(args);
1594 * Look up name in the leaf block, returning both buffers and index.
1596 if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) {
1601 xfs_dir3_leaf_check(dp->i_mount, lbp);
1603 ents = xfs_dir3_leaf_ents_p(leaf);
1605 * Get to the leaf entry and contained data entry address.
1610 * Point to the data entry.
1612 dep = (xfs_dir2_data_entry_t *)
1613 ((char *)dbp->b_addr +
1614 xfs_dir2_dataptr_to_off(dp->i_mount, be32_to_cpu(lep->address)));
1616 * Return the found inode number & CI name if appropriate
1618 args->inumber = be64_to_cpu(dep->inumber);
1619 error = xfs_dir_cilookup_result(args, dep->name, dep->namelen);
1620 xfs_trans_brelse(tp, dbp);
1621 xfs_trans_brelse(tp, lbp);
1622 return XFS_ERROR(error);
1626 * Look up name/hash in the leaf block.
1627 * Fill in indexp with the found index, and dbpp with the data buffer.
1628 * If not found dbpp will be NULL, and ENOENT comes back.
1629 * lbpp will always be filled in with the leaf buffer unless there's an error.
1631 static int /* error */
1632 xfs_dir2_leaf_lookup_int(
1633 xfs_da_args_t *args, /* operation arguments */
1634 struct xfs_buf **lbpp, /* out: leaf buffer */
1635 int *indexp, /* out: index in leaf block */
1636 struct xfs_buf **dbpp) /* out: data buffer */
1638 xfs_dir2_db_t curdb = -1; /* current data block number */
1639 struct xfs_buf *dbp = NULL; /* data buffer */
1640 xfs_dir2_data_entry_t *dep; /* data entry */
1641 xfs_inode_t *dp; /* incore directory inode */
1642 int error; /* error return code */
1643 int index; /* index in leaf block */
1644 struct xfs_buf *lbp; /* leaf buffer */
1645 xfs_dir2_leaf_entry_t *lep; /* leaf entry */
1646 xfs_dir2_leaf_t *leaf; /* leaf structure */
1647 xfs_mount_t *mp; /* filesystem mount point */
1648 xfs_dir2_db_t newdb; /* new data block number */
1649 xfs_trans_t *tp; /* transaction pointer */
1650 xfs_dir2_db_t cidb = -1; /* case match data block no. */
1651 enum xfs_dacmp cmp; /* name compare result */
1652 struct xfs_dir2_leaf_entry *ents;
1653 struct xfs_dir3_icleaf_hdr leafhdr;
1659 error = xfs_dir3_leaf_read(tp, dp, mp->m_dirleafblk, -1, &lbp);
1665 xfs_dir3_leaf_check(mp, lbp);
1666 ents = xfs_dir3_leaf_ents_p(leaf);
1667 xfs_dir3_leaf_hdr_from_disk(&leafhdr, leaf);
1670 * Look for the first leaf entry with our hash value.
1672 index = xfs_dir2_leaf_search_hash(args, lbp);
1674 * Loop over all the entries with the right hash value
1675 * looking to match the name.
1677 for (lep = &ents[index];
1678 index < leafhdr.count && be32_to_cpu(lep->hashval) == args->hashval;
1681 * Skip over stale leaf entries.
1683 if (be32_to_cpu(lep->address) == XFS_DIR2_NULL_DATAPTR)
1686 * Get the new data block number.
1688 newdb = xfs_dir2_dataptr_to_db(mp, be32_to_cpu(lep->address));
1690 * If it's not the same as the old data block number,
1691 * need to pitch the old one and read the new one.
1693 if (newdb != curdb) {
1695 xfs_trans_brelse(tp, dbp);
1696 error = xfs_dir3_data_read(tp, dp,
1697 xfs_dir2_db_to_da(mp, newdb),
1700 xfs_trans_brelse(tp, lbp);
1706 * Point to the data entry.
1708 dep = (xfs_dir2_data_entry_t *)((char *)dbp->b_addr +
1709 xfs_dir2_dataptr_to_off(mp, be32_to_cpu(lep->address)));
1711 * Compare name and if it's an exact match, return the index
1712 * and buffer. If it's the first case-insensitive match, store
1713 * the index and buffer and continue looking for an exact match.
1715 cmp = mp->m_dirnameops->compname(args, dep->name, dep->namelen);
1716 if (cmp != XFS_CMP_DIFFERENT && cmp != args->cmpresult) {
1717 args->cmpresult = cmp;
1719 /* case exact match: return the current buffer. */
1720 if (cmp == XFS_CMP_EXACT) {
1727 ASSERT(args->op_flags & XFS_DA_OP_OKNOENT);
1729 * Here, we can only be doing a lookup (not a rename or remove).
1730 * If a case-insensitive match was found earlier, re-read the
1731 * appropriate data block if required and return it.
1733 if (args->cmpresult == XFS_CMP_CASE) {
1735 if (cidb != curdb) {
1736 xfs_trans_brelse(tp, dbp);
1737 error = xfs_dir3_data_read(tp, dp,
1738 xfs_dir2_db_to_da(mp, cidb),
1741 xfs_trans_brelse(tp, lbp);
1749 * No match found, return ENOENT.
1753 xfs_trans_brelse(tp, dbp);
1754 xfs_trans_brelse(tp, lbp);
1755 return XFS_ERROR(ENOENT);
1759 * Remove an entry from a leaf format directory.
1762 xfs_dir2_leaf_removename(
1763 xfs_da_args_t *args) /* operation arguments */
1765 __be16 *bestsp; /* leaf block best freespace */
1766 xfs_dir2_data_hdr_t *hdr; /* data block header */
1767 xfs_dir2_db_t db; /* data block number */
1768 struct xfs_buf *dbp; /* data block buffer */
1769 xfs_dir2_data_entry_t *dep; /* data entry structure */
1770 xfs_inode_t *dp; /* incore directory inode */
1771 int error; /* error return code */
1772 xfs_dir2_db_t i; /* temporary data block # */
1773 int index; /* index into leaf entries */
1774 struct xfs_buf *lbp; /* leaf buffer */
1775 xfs_dir2_leaf_t *leaf; /* leaf structure */
1776 xfs_dir2_leaf_entry_t *lep; /* leaf entry */
1777 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */
1778 xfs_mount_t *mp; /* filesystem mount point */
1779 int needlog; /* need to log data header */
1780 int needscan; /* need to rescan data frees */
1781 xfs_dir2_data_off_t oldbest; /* old value of best free */
1782 xfs_trans_t *tp; /* transaction pointer */
1783 struct xfs_dir2_data_free *bf; /* bestfree table */
1784 struct xfs_dir2_leaf_entry *ents;
1785 struct xfs_dir3_icleaf_hdr leafhdr;
1787 trace_xfs_dir2_leaf_removename(args);
1790 * Lookup the leaf entry, get the leaf and data blocks read in.
1792 if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) {
1800 xfs_dir3_data_check(dp, dbp);
1801 bf = xfs_dir3_data_bestfree_p(hdr);
1802 xfs_dir3_leaf_hdr_from_disk(&leafhdr, leaf);
1803 ents = xfs_dir3_leaf_ents_p(leaf);
1805 * Point to the leaf entry, use that to point to the data entry.
1808 db = xfs_dir2_dataptr_to_db(mp, be32_to_cpu(lep->address));
1809 dep = (xfs_dir2_data_entry_t *)
1810 ((char *)hdr + xfs_dir2_dataptr_to_off(mp, be32_to_cpu(lep->address)));
1811 needscan = needlog = 0;
1812 oldbest = be16_to_cpu(bf[0].length);
1813 ltp = xfs_dir2_leaf_tail_p(mp, leaf);
1814 bestsp = xfs_dir2_leaf_bests_p(ltp);
1815 ASSERT(be16_to_cpu(bestsp[db]) == oldbest);
1817 * Mark the former data entry unused.
1819 xfs_dir2_data_make_free(tp, dbp,
1820 (xfs_dir2_data_aoff_t)((char *)dep - (char *)hdr),
1821 xfs_dir2_data_entsize(dep->namelen), &needlog, &needscan);
1823 * We just mark the leaf entry stale by putting a null in it.
1826 xfs_dir3_leaf_hdr_to_disk(leaf, &leafhdr);
1827 xfs_dir3_leaf_log_header(tp, lbp);
1829 lep->address = cpu_to_be32(XFS_DIR2_NULL_DATAPTR);
1830 xfs_dir3_leaf_log_ents(tp, lbp, index, index);
1833 * Scan the freespace in the data block again if necessary,
1834 * log the data block header if necessary.
1837 xfs_dir2_data_freescan(mp, hdr, &needlog);
1839 xfs_dir2_data_log_header(tp, dbp);
1841 * If the longest freespace in the data block has changed,
1842 * put the new value in the bests table and log that.
1844 if (be16_to_cpu(bf[0].length) != oldbest) {
1845 bestsp[db] = bf[0].length;
1846 xfs_dir3_leaf_log_bests(tp, lbp, db, db);
1848 xfs_dir3_data_check(dp, dbp);
1850 * If the data block is now empty then get rid of the data block.
1852 if (be16_to_cpu(bf[0].length) ==
1853 mp->m_dirblksize - xfs_dir3_data_entry_offset(hdr)) {
1854 ASSERT(db != mp->m_dirdatablk);
1855 if ((error = xfs_dir2_shrink_inode(args, db, dbp))) {
1857 * Nope, can't get rid of it because it caused
1858 * allocation of a bmap btree block to do so.
1859 * Just go on, returning success, leaving the
1860 * empty block in place.
1862 if (error == ENOSPC && args->total == 0)
1864 xfs_dir3_leaf_check(mp, lbp);
1869 * If this is the last data block then compact the
1870 * bests table by getting rid of entries.
1872 if (db == be32_to_cpu(ltp->bestcount) - 1) {
1874 * Look for the last active entry (i).
1876 for (i = db - 1; i > 0; i--) {
1877 if (bestsp[i] != cpu_to_be16(NULLDATAOFF))
1881 * Copy the table down so inactive entries at the
1884 memmove(&bestsp[db - i], bestsp,
1885 (be32_to_cpu(ltp->bestcount) - (db - i)) * sizeof(*bestsp));
1886 be32_add_cpu(<p->bestcount, -(db - i));
1887 xfs_dir3_leaf_log_tail(tp, lbp);
1888 xfs_dir3_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1);
1890 bestsp[db] = cpu_to_be16(NULLDATAOFF);
1893 * If the data block was not the first one, drop it.
1895 else if (db != mp->m_dirdatablk)
1898 xfs_dir3_leaf_check(mp, lbp);
1900 * See if we can convert to block form.
1902 return xfs_dir2_leaf_to_block(args, lbp, dbp);
1906 * Replace the inode number in a leaf format directory entry.
1909 xfs_dir2_leaf_replace(
1910 xfs_da_args_t *args) /* operation arguments */
1912 struct xfs_buf *dbp; /* data block buffer */
1913 xfs_dir2_data_entry_t *dep; /* data block entry */
1914 xfs_inode_t *dp; /* incore directory inode */
1915 int error; /* error return code */
1916 int index; /* index of leaf entry */
1917 struct xfs_buf *lbp; /* leaf buffer */
1918 xfs_dir2_leaf_t *leaf; /* leaf structure */
1919 xfs_dir2_leaf_entry_t *lep; /* leaf entry */
1920 xfs_trans_t *tp; /* transaction pointer */
1921 struct xfs_dir2_leaf_entry *ents;
1923 trace_xfs_dir2_leaf_replace(args);
1926 * Look up the entry.
1928 if ((error = xfs_dir2_leaf_lookup_int(args, &lbp, &index, &dbp))) {
1933 ents = xfs_dir3_leaf_ents_p(leaf);
1935 * Point to the leaf entry, get data address from it.
1939 * Point to the data entry.
1941 dep = (xfs_dir2_data_entry_t *)
1942 ((char *)dbp->b_addr +
1943 xfs_dir2_dataptr_to_off(dp->i_mount, be32_to_cpu(lep->address)));
1944 ASSERT(args->inumber != be64_to_cpu(dep->inumber));
1946 * Put the new inode number in, log it.
1948 dep->inumber = cpu_to_be64(args->inumber);
1950 xfs_dir2_data_log_entry(tp, dbp, dep);
1951 xfs_dir3_leaf_check(dp->i_mount, lbp);
1952 xfs_trans_brelse(tp, lbp);
1957 * Return index in the leaf block (lbp) which is either the first
1958 * one with this hash value, or if there are none, the insert point
1959 * for that hash value.
1961 int /* index value */
1962 xfs_dir2_leaf_search_hash(
1963 xfs_da_args_t *args, /* operation arguments */
1964 struct xfs_buf *lbp) /* leaf buffer */
1966 xfs_dahash_t hash=0; /* hash from this entry */
1967 xfs_dahash_t hashwant; /* hash value looking for */
1968 int high; /* high leaf index */
1969 int low; /* low leaf index */
1970 xfs_dir2_leaf_t *leaf; /* leaf structure */
1971 xfs_dir2_leaf_entry_t *lep; /* leaf entry */
1972 int mid=0; /* current leaf index */
1973 struct xfs_dir2_leaf_entry *ents;
1974 struct xfs_dir3_icleaf_hdr leafhdr;
1977 ents = xfs_dir3_leaf_ents_p(leaf);
1978 xfs_dir3_leaf_hdr_from_disk(&leafhdr, leaf);
1985 * Note, the table cannot be empty, so we have to go through the loop.
1986 * Binary search the leaf entries looking for our hash value.
1988 for (lep = ents, low = 0, high = leafhdr.count - 1,
1989 hashwant = args->hashval;
1991 mid = (low + high) >> 1;
1992 if ((hash = be32_to_cpu(lep[mid].hashval)) == hashwant)
1994 if (hash < hashwant)
2000 * Found one, back up through all the equal hash values.
2002 if (hash == hashwant) {
2003 while (mid > 0 && be32_to_cpu(lep[mid - 1].hashval) == hashwant) {
2008 * Need to point to an entry higher than ours.
2010 else if (hash < hashwant)
2016 * Trim off a trailing data block. We know it's empty since the leaf
2017 * freespace table says so.
2020 xfs_dir2_leaf_trim_data(
2021 xfs_da_args_t *args, /* operation arguments */
2022 struct xfs_buf *lbp, /* leaf buffer */
2023 xfs_dir2_db_t db) /* data block number */
2025 __be16 *bestsp; /* leaf bests table */
2026 struct xfs_buf *dbp; /* data block buffer */
2027 xfs_inode_t *dp; /* incore directory inode */
2028 int error; /* error return value */
2029 xfs_dir2_leaf_t *leaf; /* leaf structure */
2030 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */
2031 xfs_mount_t *mp; /* filesystem mount point */
2032 xfs_trans_t *tp; /* transaction pointer */
2038 * Read the offending data block. We need its buffer.
2040 error = xfs_dir3_data_read(tp, dp, xfs_dir2_db_to_da(mp, db), -1, &dbp);
2045 ltp = xfs_dir2_leaf_tail_p(mp, leaf);
2049 struct xfs_dir2_data_hdr *hdr = dbp->b_addr;
2050 struct xfs_dir2_data_free *bf = xfs_dir3_data_bestfree_p(hdr);
2052 ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC) ||
2053 hdr->magic == cpu_to_be32(XFS_DIR3_DATA_MAGIC));
2054 ASSERT(be16_to_cpu(bf[0].length) ==
2055 mp->m_dirblksize - xfs_dir3_data_entry_offset(hdr));
2056 ASSERT(db == be32_to_cpu(ltp->bestcount) - 1);
2061 * Get rid of the data block.
2063 if ((error = xfs_dir2_shrink_inode(args, db, dbp))) {
2064 ASSERT(error != ENOSPC);
2065 xfs_trans_brelse(tp, dbp);
2069 * Eliminate the last bests entry from the table.
2071 bestsp = xfs_dir2_leaf_bests_p(ltp);
2072 be32_add_cpu(<p->bestcount, -1);
2073 memmove(&bestsp[1], &bestsp[0], be32_to_cpu(ltp->bestcount) * sizeof(*bestsp));
2074 xfs_dir3_leaf_log_tail(tp, lbp);
2075 xfs_dir3_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1);
2079 static inline size_t
2081 struct xfs_dir3_icleaf_hdr *hdr,
2087 entries = hdr->count - hdr->stale;
2088 if (hdr->magic == XFS_DIR2_LEAF1_MAGIC ||
2089 hdr->magic == XFS_DIR2_LEAFN_MAGIC)
2090 hdrsize = sizeof(struct xfs_dir2_leaf_hdr);
2092 hdrsize = sizeof(struct xfs_dir3_leaf_hdr);
2094 return hdrsize + entries * sizeof(xfs_dir2_leaf_entry_t)
2095 + counts * sizeof(xfs_dir2_data_off_t)
2096 + sizeof(xfs_dir2_leaf_tail_t);
2100 * Convert node form directory to leaf form directory.
2101 * The root of the node form dir needs to already be a LEAFN block.
2102 * Just return if we can't do anything.
2105 xfs_dir2_node_to_leaf(
2106 xfs_da_state_t *state) /* directory operation state */
2108 xfs_da_args_t *args; /* operation arguments */
2109 xfs_inode_t *dp; /* incore directory inode */
2110 int error; /* error return code */
2111 struct xfs_buf *fbp; /* buffer for freespace block */
2112 xfs_fileoff_t fo; /* freespace file offset */
2113 xfs_dir2_free_t *free; /* freespace structure */
2114 struct xfs_buf *lbp; /* buffer for leaf block */
2115 xfs_dir2_leaf_tail_t *ltp; /* tail of leaf structure */
2116 xfs_dir2_leaf_t *leaf; /* leaf structure */
2117 xfs_mount_t *mp; /* filesystem mount point */
2118 int rval; /* successful free trim? */
2119 xfs_trans_t *tp; /* transaction pointer */
2120 struct xfs_dir3_icleaf_hdr leafhdr;
2121 struct xfs_dir3_icfree_hdr freehdr;
2124 * There's more than a leaf level in the btree, so there must
2125 * be multiple leafn blocks. Give up.
2127 if (state->path.active > 1)
2131 trace_xfs_dir2_node_to_leaf(args);
2137 * Get the last offset in the file.
2139 if ((error = xfs_bmap_last_offset(tp, dp, &fo, XFS_DATA_FORK))) {
2142 fo -= mp->m_dirblkfsbs;
2144 * If there are freespace blocks other than the first one,
2145 * take this opportunity to remove trailing empty freespace blocks
2146 * that may have been left behind during no-space-reservation
2149 while (fo > mp->m_dirfreeblk) {
2150 if ((error = xfs_dir2_node_trim_free(args, fo, &rval))) {
2154 fo -= mp->m_dirblkfsbs;
2159 * Now find the block just before the freespace block.
2161 if ((error = xfs_bmap_last_before(tp, dp, &fo, XFS_DATA_FORK))) {
2165 * If it's not the single leaf block, give up.
2167 if (XFS_FSB_TO_B(mp, fo) > XFS_DIR2_LEAF_OFFSET + mp->m_dirblksize)
2169 lbp = state->path.blk[0].bp;
2171 xfs_dir3_leaf_hdr_from_disk(&leafhdr, leaf);
2173 ASSERT(leafhdr.magic == XFS_DIR2_LEAFN_MAGIC ||
2174 leafhdr.magic == XFS_DIR3_LEAFN_MAGIC);
2177 * Read the freespace block.
2179 error = xfs_dir2_free_read(tp, dp, mp->m_dirfreeblk, &fbp);
2183 xfs_dir3_free_hdr_from_disk(&freehdr, free);
2185 ASSERT(!freehdr.firstdb);
2188 * Now see if the leafn and free data will fit in a leaf1.
2189 * If not, release the buffer and give up.
2191 if (xfs_dir3_leaf_size(&leafhdr, freehdr.nvalid) > mp->m_dirblksize) {
2192 xfs_trans_brelse(tp, fbp);
2197 * If the leaf has any stale entries in it, compress them out.
2200 xfs_dir3_leaf_compact(args, &leafhdr, lbp);
2202 lbp->b_ops = &xfs_dir3_leaf1_buf_ops;
2203 xfs_trans_buf_set_type(tp, lbp, XFS_BLFT_DIR_LEAF1_BUF);
2204 leafhdr.magic = (leafhdr.magic == XFS_DIR2_LEAFN_MAGIC)
2205 ? XFS_DIR2_LEAF1_MAGIC
2206 : XFS_DIR3_LEAF1_MAGIC;
2209 * Set up the leaf tail from the freespace block.
2211 ltp = xfs_dir2_leaf_tail_p(mp, leaf);
2212 ltp->bestcount = cpu_to_be32(freehdr.nvalid);
2215 * Set up the leaf bests table.
2217 memcpy(xfs_dir2_leaf_bests_p(ltp), xfs_dir3_free_bests_p(mp, free),
2218 freehdr.nvalid * sizeof(xfs_dir2_data_off_t));
2220 xfs_dir3_leaf_hdr_to_disk(leaf, &leafhdr);
2221 xfs_dir3_leaf_log_header(tp, lbp);
2222 xfs_dir3_leaf_log_bests(tp, lbp, 0, be32_to_cpu(ltp->bestcount) - 1);
2223 xfs_dir3_leaf_log_tail(tp, lbp);
2224 xfs_dir3_leaf_check(mp, lbp);
2227 * Get rid of the freespace block.
2229 error = xfs_dir2_shrink_inode(args, XFS_DIR2_FREE_FIRSTDB(mp), fbp);
2232 * This can't fail here because it can only happen when
2233 * punching out the middle of an extent, and this is an
2236 ASSERT(error != ENOSPC);
2241 * Now see if we can convert the single-leaf directory
2242 * down to a block form directory.
2243 * This routine always kills the dabuf for the leaf, so
2244 * eliminate it from the path.
2246 error = xfs_dir2_leaf_to_block(args, lbp, NULL);
2247 state->path.blk[0].bp = NULL;