]>
Commit | Line | Data |
---|---|---|
1da177e4 | 1 | /* |
7b718769 NS |
2 | * Copyright (c) 2000-2001,2005 Silicon Graphics, Inc. |
3 | * All Rights Reserved. | |
1da177e4 | 4 | * |
7b718769 NS |
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 | |
1da177e4 LT |
7 | * published by the Free Software Foundation. |
8 | * | |
7b718769 NS |
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. | |
1da177e4 | 13 | * |
7b718769 NS |
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 | |
1da177e4 | 17 | */ |
1da177e4 | 18 | #include "xfs.h" |
a844f451 | 19 | #include "xfs_fs.h" |
1da177e4 | 20 | #include "xfs_types.h" |
a844f451 | 21 | #include "xfs_bit.h" |
1da177e4 | 22 | #include "xfs_log.h" |
a844f451 | 23 | #include "xfs_inum.h" |
1da177e4 LT |
24 | #include "xfs_trans.h" |
25 | #include "xfs_sb.h" | |
26 | #include "xfs_ag.h" | |
1da177e4 LT |
27 | #include "xfs_dir2.h" |
28 | #include "xfs_dmapi.h" | |
29 | #include "xfs_mount.h" | |
a844f451 | 30 | #include "xfs_da_btree.h" |
1da177e4 | 31 | #include "xfs_bmap_btree.h" |
a844f451 | 32 | #include "xfs_alloc_btree.h" |
1da177e4 | 33 | #include "xfs_dir2_sf.h" |
a844f451 | 34 | #include "xfs_attr_sf.h" |
1da177e4 | 35 | #include "xfs_dinode.h" |
1da177e4 | 36 | #include "xfs_inode.h" |
a844f451 | 37 | #include "xfs_inode_item.h" |
1da177e4 | 38 | #include "xfs_bmap.h" |
1da177e4 LT |
39 | #include "xfs_dir2_data.h" |
40 | #include "xfs_dir2_leaf.h" | |
41 | #include "xfs_dir2_block.h" | |
42 | #include "xfs_dir2_node.h" | |
1da177e4 | 43 | #include "xfs_error.h" |
a8272ce0 | 44 | #include "xfs_vnodeops.h" |
0b1b213f | 45 | #include "xfs_trace.h" |
1da177e4 | 46 | |
556b8b16 | 47 | struct xfs_name xfs_name_dotdot = {"..", 2}; |
1da177e4 | 48 | |
189f4bf2 BN |
49 | /* |
50 | * ASCII case-insensitive (ie. A-Z) support for directories that was | |
51 | * used in IRIX. | |
52 | */ | |
53 | STATIC xfs_dahash_t | |
54 | xfs_ascii_ci_hashname( | |
55 | struct xfs_name *name) | |
56 | { | |
57 | xfs_dahash_t hash; | |
58 | int i; | |
59 | ||
60 | for (i = 0, hash = 0; i < name->len; i++) | |
61 | hash = tolower(name->name[i]) ^ rol32(hash, 7); | |
62 | ||
63 | return hash; | |
64 | } | |
65 | ||
66 | STATIC enum xfs_dacmp | |
67 | xfs_ascii_ci_compname( | |
68 | struct xfs_da_args *args, | |
2bc75421 DC |
69 | const unsigned char *name, |
70 | int len) | |
189f4bf2 BN |
71 | { |
72 | enum xfs_dacmp result; | |
73 | int i; | |
74 | ||
75 | if (args->namelen != len) | |
76 | return XFS_CMP_DIFFERENT; | |
77 | ||
78 | result = XFS_CMP_EXACT; | |
79 | for (i = 0; i < len; i++) { | |
80 | if (args->name[i] == name[i]) | |
81 | continue; | |
82 | if (tolower(args->name[i]) != tolower(name[i])) | |
83 | return XFS_CMP_DIFFERENT; | |
84 | result = XFS_CMP_CASE; | |
85 | } | |
86 | ||
87 | return result; | |
88 | } | |
89 | ||
90 | static struct xfs_nameops xfs_ascii_ci_nameops = { | |
91 | .hashname = xfs_ascii_ci_hashname, | |
92 | .compname = xfs_ascii_ci_compname, | |
93 | }; | |
94 | ||
f6c2d1fa NS |
95 | void |
96 | xfs_dir_mount( | |
97 | xfs_mount_t *mp) | |
1da177e4 | 98 | { |
62118709 | 99 | ASSERT(xfs_sb_version_hasdirv2(&mp->m_sb)); |
1da177e4 LT |
100 | ASSERT((1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog)) <= |
101 | XFS_MAX_BLOCKSIZE); | |
102 | mp->m_dirblksize = 1 << (mp->m_sb.sb_blocklog + mp->m_sb.sb_dirblklog); | |
103 | mp->m_dirblkfsbs = 1 << mp->m_sb.sb_dirblklog; | |
bbaaf538 CH |
104 | mp->m_dirdatablk = xfs_dir2_db_to_da(mp, XFS_DIR2_DATA_FIRSTDB(mp)); |
105 | mp->m_dirleafblk = xfs_dir2_db_to_da(mp, XFS_DIR2_LEAF_FIRSTDB(mp)); | |
106 | mp->m_dirfreeblk = xfs_dir2_db_to_da(mp, XFS_DIR2_FREE_FIRSTDB(mp)); | |
1da177e4 LT |
107 | mp->m_attr_node_ents = |
108 | (mp->m_sb.sb_blocksize - (uint)sizeof(xfs_da_node_hdr_t)) / | |
109 | (uint)sizeof(xfs_da_node_entry_t); | |
110 | mp->m_dir_node_ents = | |
111 | (mp->m_dirblksize - (uint)sizeof(xfs_da_node_hdr_t)) / | |
112 | (uint)sizeof(xfs_da_node_entry_t); | |
113 | mp->m_dir_magicpct = (mp->m_dirblksize * 37) / 100; | |
189f4bf2 BN |
114 | if (xfs_sb_version_hasasciici(&mp->m_sb)) |
115 | mp->m_dirnameops = &xfs_ascii_ci_nameops; | |
116 | else | |
117 | mp->m_dirnameops = &xfs_default_nameops; | |
1da177e4 LT |
118 | } |
119 | ||
120 | /* | |
121 | * Return 1 if directory contains only "." and "..". | |
122 | */ | |
f6c2d1fa NS |
123 | int |
124 | xfs_dir_isempty( | |
125 | xfs_inode_t *dp) | |
1da177e4 | 126 | { |
f6c2d1fa | 127 | xfs_dir2_sf_t *sfp; |
1da177e4 LT |
128 | |
129 | ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR); | |
f6c2d1fa | 130 | if (dp->i_d.di_size == 0) /* might happen during shutdown. */ |
1da177e4 | 131 | return 1; |
1da177e4 LT |
132 | if (dp->i_d.di_size > XFS_IFORK_DSIZE(dp)) |
133 | return 0; | |
134 | sfp = (xfs_dir2_sf_t *)dp->i_df.if_u1.if_data; | |
135 | return !sfp->hdr.count; | |
136 | } | |
137 | ||
f6c2d1fa NS |
138 | /* |
139 | * Validate a given inode number. | |
140 | */ | |
141 | int | |
142 | xfs_dir_ino_validate( | |
143 | xfs_mount_t *mp, | |
144 | xfs_ino_t ino) | |
145 | { | |
146 | xfs_agblock_t agblkno; | |
147 | xfs_agino_t agino; | |
148 | xfs_agnumber_t agno; | |
149 | int ino_ok; | |
150 | int ioff; | |
151 | ||
152 | agno = XFS_INO_TO_AGNO(mp, ino); | |
153 | agblkno = XFS_INO_TO_AGBNO(mp, ino); | |
154 | ioff = XFS_INO_TO_OFFSET(mp, ino); | |
155 | agino = XFS_OFFBNO_TO_AGINO(mp, agblkno, ioff); | |
156 | ino_ok = | |
157 | agno < mp->m_sb.sb_agcount && | |
158 | agblkno < mp->m_sb.sb_agblocks && | |
159 | agblkno != 0 && | |
160 | ioff < (1 << mp->m_sb.sb_inopblog) && | |
161 | XFS_AGINO_TO_INO(mp, agno, agino) == ino; | |
162 | if (unlikely(XFS_TEST_ERROR(!ino_ok, mp, XFS_ERRTAG_DIR_INO_VALIDATE, | |
163 | XFS_RANDOM_DIR_INO_VALIDATE))) { | |
164 | xfs_fs_cmn_err(CE_WARN, mp, "Invalid inode number 0x%Lx", | |
165 | (unsigned long long) ino); | |
166 | XFS_ERROR_REPORT("xfs_dir_ino_validate", XFS_ERRLEVEL_LOW, mp); | |
167 | return XFS_ERROR(EFSCORRUPTED); | |
168 | } | |
169 | return 0; | |
170 | } | |
171 | ||
1da177e4 LT |
172 | /* |
173 | * Initialize a directory with its "." and ".." entries. | |
174 | */ | |
f6c2d1fa NS |
175 | int |
176 | xfs_dir_init( | |
177 | xfs_trans_t *tp, | |
178 | xfs_inode_t *dp, | |
179 | xfs_inode_t *pdp) | |
1da177e4 | 180 | { |
f6c2d1fa NS |
181 | xfs_da_args_t args; |
182 | int error; | |
1da177e4 LT |
183 | |
184 | memset((char *)&args, 0, sizeof(args)); | |
185 | args.dp = dp; | |
186 | args.trans = tp; | |
187 | ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR); | |
f6c2d1fa | 188 | if ((error = xfs_dir_ino_validate(tp->t_mountp, pdp->i_ino))) |
1da177e4 | 189 | return error; |
1da177e4 LT |
190 | return xfs_dir2_sf_create(&args, pdp->i_ino); |
191 | } | |
192 | ||
193 | /* | |
194 | Enter a name in a directory. | |
195 | */ | |
f6c2d1fa NS |
196 | int |
197 | xfs_dir_createname( | |
198 | xfs_trans_t *tp, | |
199 | xfs_inode_t *dp, | |
556b8b16 | 200 | struct xfs_name *name, |
1da177e4 LT |
201 | xfs_ino_t inum, /* new entry inode number */ |
202 | xfs_fsblock_t *first, /* bmap's firstblock */ | |
203 | xfs_bmap_free_t *flist, /* bmap's freeblock list */ | |
204 | xfs_extlen_t total) /* bmap's total block count */ | |
205 | { | |
f6c2d1fa NS |
206 | xfs_da_args_t args; |
207 | int rval; | |
1da177e4 LT |
208 | int v; /* type-checking value */ |
209 | ||
210 | ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR); | |
f6c2d1fa | 211 | if ((rval = xfs_dir_ino_validate(tp->t_mountp, inum))) |
1da177e4 | 212 | return rval; |
1da177e4 | 213 | XFS_STATS_INC(xs_dir_create); |
f6c2d1fa | 214 | |
87affd08 | 215 | memset(&args, 0, sizeof(xfs_da_args_t)); |
556b8b16 BN |
216 | args.name = name->name; |
217 | args.namelen = name->len; | |
5163f95a | 218 | args.hashval = dp->i_mount->m_dirnameops->hashname(name); |
1da177e4 LT |
219 | args.inumber = inum; |
220 | args.dp = dp; | |
221 | args.firstblock = first; | |
222 | args.flist = flist; | |
223 | args.total = total; | |
224 | args.whichfork = XFS_DATA_FORK; | |
225 | args.trans = tp; | |
6a178100 | 226 | args.op_flags = XFS_DA_OP_ADDNAME | XFS_DA_OP_OKNOENT; |
f6c2d1fa | 227 | |
1da177e4 LT |
228 | if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) |
229 | rval = xfs_dir2_sf_addname(&args); | |
f6c2d1fa | 230 | else if ((rval = xfs_dir2_isblock(tp, dp, &v))) |
1da177e4 | 231 | return rval; |
f6c2d1fa | 232 | else if (v) |
1da177e4 | 233 | rval = xfs_dir2_block_addname(&args); |
f6c2d1fa | 234 | else if ((rval = xfs_dir2_isleaf(tp, dp, &v))) |
1da177e4 | 235 | return rval; |
f6c2d1fa | 236 | else if (v) |
1da177e4 LT |
237 | rval = xfs_dir2_leaf_addname(&args); |
238 | else | |
239 | rval = xfs_dir2_node_addname(&args); | |
240 | return rval; | |
241 | } | |
242 | ||
384f3ced BN |
243 | /* |
244 | * If doing a CI lookup and case-insensitive match, dup actual name into | |
245 | * args.value. Return EEXIST for success (ie. name found) or an error. | |
246 | */ | |
247 | int | |
248 | xfs_dir_cilookup_result( | |
249 | struct xfs_da_args *args, | |
a3380ae3 | 250 | const unsigned char *name, |
384f3ced BN |
251 | int len) |
252 | { | |
253 | if (args->cmpresult == XFS_CMP_DIFFERENT) | |
254 | return ENOENT; | |
255 | if (args->cmpresult != XFS_CMP_CASE || | |
256 | !(args->op_flags & XFS_DA_OP_CILOOKUP)) | |
257 | return EEXIST; | |
258 | ||
3f52c2f0 | 259 | args->value = kmem_alloc(len, KM_NOFS | KM_MAYFAIL); |
384f3ced BN |
260 | if (!args->value) |
261 | return ENOMEM; | |
262 | ||
263 | memcpy(args->value, name, len); | |
264 | args->valuelen = len; | |
265 | return EEXIST; | |
266 | } | |
267 | ||
1da177e4 LT |
268 | /* |
269 | * Lookup a name in a directory, give back the inode number. | |
384f3ced BN |
270 | * If ci_name is not NULL, returns the actual name in ci_name if it differs |
271 | * to name, or ci_name->name is set to NULL for an exact match. | |
1da177e4 | 272 | */ |
384f3ced | 273 | |
f6c2d1fa NS |
274 | int |
275 | xfs_dir_lookup( | |
276 | xfs_trans_t *tp, | |
277 | xfs_inode_t *dp, | |
556b8b16 | 278 | struct xfs_name *name, |
384f3ced BN |
279 | xfs_ino_t *inum, /* out: inode number */ |
280 | struct xfs_name *ci_name) /* out: actual name if CI match */ | |
1da177e4 | 281 | { |
f6c2d1fa NS |
282 | xfs_da_args_t args; |
283 | int rval; | |
1da177e4 LT |
284 | int v; /* type-checking value */ |
285 | ||
286 | ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR); | |
287 | XFS_STATS_INC(xs_dir_lookup); | |
288 | ||
87affd08 | 289 | memset(&args, 0, sizeof(xfs_da_args_t)); |
556b8b16 BN |
290 | args.name = name->name; |
291 | args.namelen = name->len; | |
5163f95a | 292 | args.hashval = dp->i_mount->m_dirnameops->hashname(name); |
1da177e4 | 293 | args.dp = dp; |
1da177e4 LT |
294 | args.whichfork = XFS_DATA_FORK; |
295 | args.trans = tp; | |
6a178100 | 296 | args.op_flags = XFS_DA_OP_OKNOENT; |
384f3ced BN |
297 | if (ci_name) |
298 | args.op_flags |= XFS_DA_OP_CILOOKUP; | |
f6c2d1fa | 299 | |
1da177e4 LT |
300 | if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) |
301 | rval = xfs_dir2_sf_lookup(&args); | |
f6c2d1fa | 302 | else if ((rval = xfs_dir2_isblock(tp, dp, &v))) |
1da177e4 | 303 | return rval; |
f6c2d1fa | 304 | else if (v) |
1da177e4 | 305 | rval = xfs_dir2_block_lookup(&args); |
f6c2d1fa | 306 | else if ((rval = xfs_dir2_isleaf(tp, dp, &v))) |
1da177e4 | 307 | return rval; |
f6c2d1fa | 308 | else if (v) |
1da177e4 LT |
309 | rval = xfs_dir2_leaf_lookup(&args); |
310 | else | |
311 | rval = xfs_dir2_node_lookup(&args); | |
312 | if (rval == EEXIST) | |
313 | rval = 0; | |
384f3ced | 314 | if (!rval) { |
1da177e4 | 315 | *inum = args.inumber; |
384f3ced BN |
316 | if (ci_name) { |
317 | ci_name->name = args.value; | |
318 | ci_name->len = args.valuelen; | |
319 | } | |
320 | } | |
1da177e4 LT |
321 | return rval; |
322 | } | |
323 | ||
324 | /* | |
325 | * Remove an entry from a directory. | |
326 | */ | |
f6c2d1fa NS |
327 | int |
328 | xfs_dir_removename( | |
329 | xfs_trans_t *tp, | |
330 | xfs_inode_t *dp, | |
556b8b16 | 331 | struct xfs_name *name, |
f6c2d1fa | 332 | xfs_ino_t ino, |
1da177e4 LT |
333 | xfs_fsblock_t *first, /* bmap's firstblock */ |
334 | xfs_bmap_free_t *flist, /* bmap's freeblock list */ | |
335 | xfs_extlen_t total) /* bmap's total block count */ | |
336 | { | |
f6c2d1fa NS |
337 | xfs_da_args_t args; |
338 | int rval; | |
1da177e4 LT |
339 | int v; /* type-checking value */ |
340 | ||
341 | ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR); | |
342 | XFS_STATS_INC(xs_dir_remove); | |
f6c2d1fa | 343 | |
87affd08 | 344 | memset(&args, 0, sizeof(xfs_da_args_t)); |
556b8b16 BN |
345 | args.name = name->name; |
346 | args.namelen = name->len; | |
5163f95a | 347 | args.hashval = dp->i_mount->m_dirnameops->hashname(name); |
1da177e4 LT |
348 | args.inumber = ino; |
349 | args.dp = dp; | |
350 | args.firstblock = first; | |
351 | args.flist = flist; | |
352 | args.total = total; | |
353 | args.whichfork = XFS_DATA_FORK; | |
354 | args.trans = tp; | |
f6c2d1fa | 355 | |
1da177e4 LT |
356 | if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) |
357 | rval = xfs_dir2_sf_removename(&args); | |
f6c2d1fa | 358 | else if ((rval = xfs_dir2_isblock(tp, dp, &v))) |
1da177e4 | 359 | return rval; |
f6c2d1fa | 360 | else if (v) |
1da177e4 | 361 | rval = xfs_dir2_block_removename(&args); |
f6c2d1fa | 362 | else if ((rval = xfs_dir2_isleaf(tp, dp, &v))) |
1da177e4 | 363 | return rval; |
f6c2d1fa | 364 | else if (v) |
1da177e4 LT |
365 | rval = xfs_dir2_leaf_removename(&args); |
366 | else | |
367 | rval = xfs_dir2_node_removename(&args); | |
368 | return rval; | |
369 | } | |
370 | ||
371 | /* | |
372 | * Read a directory. | |
373 | */ | |
f6c2d1fa | 374 | int |
051e7cd4 | 375 | xfs_readdir( |
993386c1 | 376 | xfs_inode_t *dp, |
051e7cd4 CH |
377 | void *dirent, |
378 | size_t bufsize, | |
379 | xfs_off_t *offset, | |
380 | filldir_t filldir) | |
1da177e4 | 381 | { |
1da177e4 LT |
382 | int rval; /* return value */ |
383 | int v; /* type-checking value */ | |
384 | ||
cf441eeb | 385 | xfs_itrace_entry(dp); |
051e7cd4 CH |
386 | |
387 | if (XFS_FORCED_SHUTDOWN(dp->i_mount)) | |
388 | return XFS_ERROR(EIO); | |
389 | ||
1da177e4 LT |
390 | ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR); |
391 | XFS_STATS_INC(xs_dir_getdents); | |
1da177e4 | 392 | |
1da177e4 | 393 | if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) |
051e7cd4 CH |
394 | rval = xfs_dir2_sf_getdents(dp, dirent, offset, filldir); |
395 | else if ((rval = xfs_dir2_isblock(NULL, dp, &v))) | |
1da177e4 | 396 | ; |
f6c2d1fa | 397 | else if (v) |
051e7cd4 | 398 | rval = xfs_dir2_block_getdents(dp, dirent, offset, filldir); |
1da177e4 | 399 | else |
051e7cd4 CH |
400 | rval = xfs_dir2_leaf_getdents(dp, dirent, bufsize, offset, |
401 | filldir); | |
1da177e4 LT |
402 | return rval; |
403 | } | |
404 | ||
405 | /* | |
406 | * Replace the inode number of a directory entry. | |
407 | */ | |
f6c2d1fa NS |
408 | int |
409 | xfs_dir_replace( | |
410 | xfs_trans_t *tp, | |
411 | xfs_inode_t *dp, | |
556b8b16 | 412 | struct xfs_name *name, /* name of entry to replace */ |
1da177e4 LT |
413 | xfs_ino_t inum, /* new inode number */ |
414 | xfs_fsblock_t *first, /* bmap's firstblock */ | |
415 | xfs_bmap_free_t *flist, /* bmap's freeblock list */ | |
416 | xfs_extlen_t total) /* bmap's total block count */ | |
417 | { | |
f6c2d1fa NS |
418 | xfs_da_args_t args; |
419 | int rval; | |
1da177e4 LT |
420 | int v; /* type-checking value */ |
421 | ||
422 | ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR); | |
423 | ||
f6c2d1fa | 424 | if ((rval = xfs_dir_ino_validate(tp->t_mountp, inum))) |
1da177e4 | 425 | return rval; |
f6c2d1fa | 426 | |
87affd08 | 427 | memset(&args, 0, sizeof(xfs_da_args_t)); |
556b8b16 BN |
428 | args.name = name->name; |
429 | args.namelen = name->len; | |
5163f95a | 430 | args.hashval = dp->i_mount->m_dirnameops->hashname(name); |
1da177e4 LT |
431 | args.inumber = inum; |
432 | args.dp = dp; | |
433 | args.firstblock = first; | |
434 | args.flist = flist; | |
435 | args.total = total; | |
436 | args.whichfork = XFS_DATA_FORK; | |
437 | args.trans = tp; | |
f6c2d1fa | 438 | |
1da177e4 LT |
439 | if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) |
440 | rval = xfs_dir2_sf_replace(&args); | |
f6c2d1fa | 441 | else if ((rval = xfs_dir2_isblock(tp, dp, &v))) |
1da177e4 | 442 | return rval; |
f6c2d1fa | 443 | else if (v) |
1da177e4 | 444 | rval = xfs_dir2_block_replace(&args); |
f6c2d1fa | 445 | else if ((rval = xfs_dir2_isleaf(tp, dp, &v))) |
1da177e4 | 446 | return rval; |
f6c2d1fa | 447 | else if (v) |
1da177e4 LT |
448 | rval = xfs_dir2_leaf_replace(&args); |
449 | else | |
450 | rval = xfs_dir2_node_replace(&args); | |
451 | return rval; | |
452 | } | |
453 | ||
454 | /* | |
455 | * See if this entry can be added to the directory without allocating space. | |
556b8b16 | 456 | * First checks that the caller couldn't reserve enough space (resblks = 0). |
1da177e4 | 457 | */ |
f6c2d1fa NS |
458 | int |
459 | xfs_dir_canenter( | |
460 | xfs_trans_t *tp, | |
461 | xfs_inode_t *dp, | |
556b8b16 BN |
462 | struct xfs_name *name, /* name of entry to add */ |
463 | uint resblks) | |
1da177e4 | 464 | { |
f6c2d1fa NS |
465 | xfs_da_args_t args; |
466 | int rval; | |
1da177e4 LT |
467 | int v; /* type-checking value */ |
468 | ||
556b8b16 BN |
469 | if (resblks) |
470 | return 0; | |
471 | ||
1da177e4 | 472 | ASSERT((dp->i_d.di_mode & S_IFMT) == S_IFDIR); |
f6c2d1fa | 473 | |
87affd08 | 474 | memset(&args, 0, sizeof(xfs_da_args_t)); |
556b8b16 BN |
475 | args.name = name->name; |
476 | args.namelen = name->len; | |
5163f95a | 477 | args.hashval = dp->i_mount->m_dirnameops->hashname(name); |
1da177e4 | 478 | args.dp = dp; |
1da177e4 LT |
479 | args.whichfork = XFS_DATA_FORK; |
480 | args.trans = tp; | |
6a178100 BN |
481 | args.op_flags = XFS_DA_OP_JUSTCHECK | XFS_DA_OP_ADDNAME | |
482 | XFS_DA_OP_OKNOENT; | |
f6c2d1fa | 483 | |
1da177e4 LT |
484 | if (dp->i_d.di_format == XFS_DINODE_FMT_LOCAL) |
485 | rval = xfs_dir2_sf_addname(&args); | |
f6c2d1fa | 486 | else if ((rval = xfs_dir2_isblock(tp, dp, &v))) |
1da177e4 | 487 | return rval; |
f6c2d1fa | 488 | else if (v) |
1da177e4 | 489 | rval = xfs_dir2_block_addname(&args); |
f6c2d1fa | 490 | else if ((rval = xfs_dir2_isleaf(tp, dp, &v))) |
1da177e4 | 491 | return rval; |
f6c2d1fa | 492 | else if (v) |
1da177e4 LT |
493 | rval = xfs_dir2_leaf_addname(&args); |
494 | else | |
495 | rval = xfs_dir2_node_addname(&args); | |
496 | return rval; | |
497 | } | |
498 | ||
1da177e4 LT |
499 | /* |
500 | * Utility routines. | |
501 | */ | |
502 | ||
503 | /* | |
504 | * Add a block to the directory. | |
505 | * This routine is for data and free blocks, not leaf/node blocks | |
506 | * which are handled by xfs_da_grow_inode. | |
507 | */ | |
f6c2d1fa | 508 | int |
1da177e4 | 509 | xfs_dir2_grow_inode( |
f6c2d1fa | 510 | xfs_da_args_t *args, |
1da177e4 LT |
511 | int space, /* v2 dir's space XFS_DIR2_xxx_SPACE */ |
512 | xfs_dir2_db_t *dbp) /* out: block number added */ | |
513 | { | |
514 | xfs_fileoff_t bno; /* directory offset of new block */ | |
515 | int count; /* count of filesystem blocks */ | |
516 | xfs_inode_t *dp; /* incore directory inode */ | |
f6c2d1fa | 517 | int error; |
1da177e4 | 518 | int got; /* blocks actually mapped */ |
f6c2d1fa | 519 | int i; |
1da177e4 LT |
520 | xfs_bmbt_irec_t map; /* single structure for bmap */ |
521 | int mapi; /* mapping index */ | |
522 | xfs_bmbt_irec_t *mapp; /* bmap mapping structure(s) */ | |
f6c2d1fa | 523 | xfs_mount_t *mp; |
1da177e4 | 524 | int nmap; /* number of bmap entries */ |
f6c2d1fa | 525 | xfs_trans_t *tp; |
a7444053 | 526 | xfs_drfsbno_t nblks; |
1da177e4 | 527 | |
0b1b213f CH |
528 | trace_xfs_dir2_grow_inode(args, space); |
529 | ||
1da177e4 LT |
530 | dp = args->dp; |
531 | tp = args->trans; | |
532 | mp = dp->i_mount; | |
a7444053 | 533 | nblks = dp->i_d.di_nblocks; |
1da177e4 LT |
534 | /* |
535 | * Set lowest possible block in the space requested. | |
536 | */ | |
537 | bno = XFS_B_TO_FSBT(mp, space * XFS_DIR2_SPACE_SIZE); | |
538 | count = mp->m_dirblkfsbs; | |
539 | /* | |
540 | * Find the first hole for our block. | |
541 | */ | |
f6c2d1fa | 542 | if ((error = xfs_bmap_first_unused(tp, dp, count, &bno, XFS_DATA_FORK))) |
1da177e4 | 543 | return error; |
1da177e4 LT |
544 | nmap = 1; |
545 | ASSERT(args->firstblock != NULL); | |
546 | /* | |
547 | * Try mapping the new block contiguously (one extent). | |
548 | */ | |
549 | if ((error = xfs_bmapi(tp, dp, bno, count, | |
550 | XFS_BMAPI_WRITE|XFS_BMAPI_METADATA|XFS_BMAPI_CONTIG, | |
551 | args->firstblock, args->total, &map, &nmap, | |
f6c2d1fa | 552 | args->flist, NULL))) |
1da177e4 | 553 | return error; |
1da177e4 | 554 | ASSERT(nmap <= 1); |
1da177e4 LT |
555 | if (nmap == 1) { |
556 | mapp = ↦ | |
557 | mapi = 1; | |
558 | } | |
559 | /* | |
560 | * Didn't work and this is a multiple-fsb directory block. | |
561 | * Try again with contiguous flag turned on. | |
562 | */ | |
563 | else if (nmap == 0 && count > 1) { | |
564 | xfs_fileoff_t b; /* current file offset */ | |
565 | ||
566 | /* | |
567 | * Space for maximum number of mappings. | |
568 | */ | |
569 | mapp = kmem_alloc(sizeof(*mapp) * count, KM_SLEEP); | |
570 | /* | |
571 | * Iterate until we get to the end of our block. | |
572 | */ | |
573 | for (b = bno, mapi = 0; b < bno + count; ) { | |
574 | int c; /* current fsb count */ | |
575 | ||
576 | /* | |
577 | * Can't map more than MAX_NMAP at once. | |
578 | */ | |
579 | nmap = MIN(XFS_BMAP_MAX_NMAP, count); | |
580 | c = (int)(bno + count - b); | |
581 | if ((error = xfs_bmapi(tp, dp, b, c, | |
582 | XFS_BMAPI_WRITE|XFS_BMAPI_METADATA, | |
583 | args->firstblock, args->total, | |
3e57ecf6 OW |
584 | &mapp[mapi], &nmap, args->flist, |
585 | NULL))) { | |
f0e2d93c | 586 | kmem_free(mapp); |
1da177e4 LT |
587 | return error; |
588 | } | |
589 | if (nmap < 1) | |
590 | break; | |
591 | /* | |
592 | * Add this bunch into our table, go to the next offset. | |
593 | */ | |
594 | mapi += nmap; | |
595 | b = mapp[mapi - 1].br_startoff + | |
596 | mapp[mapi - 1].br_blockcount; | |
597 | } | |
598 | } | |
599 | /* | |
600 | * Didn't work. | |
601 | */ | |
602 | else { | |
603 | mapi = 0; | |
604 | mapp = NULL; | |
605 | } | |
606 | /* | |
607 | * See how many fsb's we got. | |
608 | */ | |
609 | for (i = 0, got = 0; i < mapi; i++) | |
610 | got += mapp[i].br_blockcount; | |
611 | /* | |
612 | * Didn't get enough fsb's, or the first/last block's are wrong. | |
613 | */ | |
614 | if (got != count || mapp[0].br_startoff != bno || | |
615 | mapp[mapi - 1].br_startoff + mapp[mapi - 1].br_blockcount != | |
616 | bno + count) { | |
617 | if (mapp != &map) | |
f0e2d93c | 618 | kmem_free(mapp); |
1da177e4 LT |
619 | return XFS_ERROR(ENOSPC); |
620 | } | |
621 | /* | |
622 | * Done with the temporary mapping table. | |
623 | */ | |
624 | if (mapp != &map) | |
f0e2d93c | 625 | kmem_free(mapp); |
a7444053 DC |
626 | |
627 | /* account for newly allocated blocks in reserved blocks total */ | |
628 | args->total -= dp->i_d.di_nblocks - nblks; | |
bbaaf538 | 629 | *dbp = xfs_dir2_da_to_db(mp, (xfs_dablk_t)bno); |
a7444053 | 630 | |
1da177e4 LT |
631 | /* |
632 | * Update file's size if this is the data space and it grew. | |
633 | */ | |
634 | if (space == XFS_DIR2_DATA_SPACE) { | |
635 | xfs_fsize_t size; /* directory file (data) size */ | |
636 | ||
637 | size = XFS_FSB_TO_B(mp, bno + count); | |
638 | if (size > dp->i_d.di_size) { | |
639 | dp->i_d.di_size = size; | |
640 | xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE); | |
641 | } | |
642 | } | |
643 | return 0; | |
644 | } | |
645 | ||
646 | /* | |
647 | * See if the directory is a single-block form directory. | |
648 | */ | |
f6c2d1fa | 649 | int |
1da177e4 | 650 | xfs_dir2_isblock( |
f6c2d1fa NS |
651 | xfs_trans_t *tp, |
652 | xfs_inode_t *dp, | |
1da177e4 LT |
653 | int *vp) /* out: 1 is block, 0 is not block */ |
654 | { | |
655 | xfs_fileoff_t last; /* last file offset */ | |
f6c2d1fa NS |
656 | xfs_mount_t *mp; |
657 | int rval; | |
1da177e4 LT |
658 | |
659 | mp = dp->i_mount; | |
f6c2d1fa | 660 | if ((rval = xfs_bmap_last_offset(tp, dp, &last, XFS_DATA_FORK))) |
1da177e4 | 661 | return rval; |
1da177e4 LT |
662 | rval = XFS_FSB_TO_B(mp, last) == mp->m_dirblksize; |
663 | ASSERT(rval == 0 || dp->i_d.di_size == mp->m_dirblksize); | |
664 | *vp = rval; | |
665 | return 0; | |
666 | } | |
667 | ||
668 | /* | |
669 | * See if the directory is a single-leaf form directory. | |
670 | */ | |
f6c2d1fa | 671 | int |
1da177e4 | 672 | xfs_dir2_isleaf( |
f6c2d1fa NS |
673 | xfs_trans_t *tp, |
674 | xfs_inode_t *dp, | |
1da177e4 LT |
675 | int *vp) /* out: 1 is leaf, 0 is not leaf */ |
676 | { | |
677 | xfs_fileoff_t last; /* last file offset */ | |
f6c2d1fa NS |
678 | xfs_mount_t *mp; |
679 | int rval; | |
1da177e4 LT |
680 | |
681 | mp = dp->i_mount; | |
f6c2d1fa | 682 | if ((rval = xfs_bmap_last_offset(tp, dp, &last, XFS_DATA_FORK))) |
1da177e4 | 683 | return rval; |
1da177e4 LT |
684 | *vp = last == mp->m_dirleafblk + (1 << mp->m_sb.sb_dirblklog); |
685 | return 0; | |
686 | } | |
687 | ||
1da177e4 LT |
688 | /* |
689 | * Remove the given block from the directory. | |
690 | * This routine is used for data and free blocks, leaf/node are done | |
691 | * by xfs_da_shrink_inode. | |
692 | */ | |
693 | int | |
694 | xfs_dir2_shrink_inode( | |
f6c2d1fa NS |
695 | xfs_da_args_t *args, |
696 | xfs_dir2_db_t db, | |
697 | xfs_dabuf_t *bp) | |
1da177e4 LT |
698 | { |
699 | xfs_fileoff_t bno; /* directory file offset */ | |
700 | xfs_dablk_t da; /* directory file offset */ | |
701 | int done; /* bunmap is finished */ | |
f6c2d1fa NS |
702 | xfs_inode_t *dp; |
703 | int error; | |
704 | xfs_mount_t *mp; | |
705 | xfs_trans_t *tp; | |
1da177e4 | 706 | |
0b1b213f CH |
707 | trace_xfs_dir2_shrink_inode(args, db); |
708 | ||
1da177e4 LT |
709 | dp = args->dp; |
710 | mp = dp->i_mount; | |
711 | tp = args->trans; | |
bbaaf538 | 712 | da = xfs_dir2_db_to_da(mp, db); |
1da177e4 LT |
713 | /* |
714 | * Unmap the fsblock(s). | |
715 | */ | |
716 | if ((error = xfs_bunmapi(tp, dp, da, mp->m_dirblkfsbs, | |
717 | XFS_BMAPI_METADATA, 0, args->firstblock, args->flist, | |
3e57ecf6 | 718 | NULL, &done))) { |
1da177e4 LT |
719 | /* |
720 | * ENOSPC actually can happen if we're in a removename with | |
721 | * no space reservation, and the resulting block removal | |
722 | * would cause a bmap btree split or conversion from extents | |
723 | * to btree. This can only happen for un-fragmented | |
724 | * directory blocks, since you need to be punching out | |
725 | * the middle of an extent. | |
726 | * In this case we need to leave the block in the file, | |
727 | * and not binval it. | |
728 | * So the block has to be in a consistent empty state | |
729 | * and appropriately logged. | |
730 | * We don't free up the buffer, the caller can tell it | |
731 | * hasn't happened since it got an error back. | |
732 | */ | |
733 | return error; | |
734 | } | |
735 | ASSERT(done); | |
736 | /* | |
737 | * Invalidate the buffer from the transaction. | |
738 | */ | |
739 | xfs_da_binval(tp, bp); | |
740 | /* | |
741 | * If it's not a data block, we're done. | |
742 | */ | |
743 | if (db >= XFS_DIR2_LEAF_FIRSTDB(mp)) | |
744 | return 0; | |
745 | /* | |
746 | * If the block isn't the last one in the directory, we're done. | |
747 | */ | |
bbaaf538 | 748 | if (dp->i_d.di_size > xfs_dir2_db_off_to_byte(mp, db + 1, 0)) |
1da177e4 LT |
749 | return 0; |
750 | bno = da; | |
751 | if ((error = xfs_bmap_last_before(tp, dp, &bno, XFS_DATA_FORK))) { | |
752 | /* | |
753 | * This can't really happen unless there's kernel corruption. | |
754 | */ | |
755 | return error; | |
756 | } | |
757 | if (db == mp->m_dirdatablk) | |
758 | ASSERT(bno == 0); | |
759 | else | |
760 | ASSERT(bno > 0); | |
761 | /* | |
762 | * Set the size to the new last block. | |
763 | */ | |
764 | dp->i_d.di_size = XFS_FSB_TO_B(mp, bno); | |
765 | xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE); | |
766 | return 0; | |
767 | } |