Loading...
1/*
2 * linux/fs/minix/dir.c
3 *
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 *
6 * minix directory handling functions
7 *
8 * Updated to filesystem version 3 by Daniel Aragones
9 */
10
11#include "minix.h"
12#include <linux/buffer_head.h>
13#include <linux/highmem.h>
14#include <linux/swap.h>
15
16typedef struct minix_dir_entry minix_dirent;
17typedef struct minix3_dir_entry minix3_dirent;
18
19static int minix_readdir(struct file *, struct dir_context *);
20
21const struct file_operations minix_dir_operations = {
22 .llseek = generic_file_llseek,
23 .read = generic_read_dir,
24 .iterate = minix_readdir,
25 .fsync = generic_file_fsync,
26};
27
28static inline void dir_put_page(struct page *page)
29{
30 kunmap(page);
31 put_page(page);
32}
33
34/*
35 * Return the offset into page `page_nr' of the last valid
36 * byte in that page, plus one.
37 */
38static unsigned
39minix_last_byte(struct inode *inode, unsigned long page_nr)
40{
41 unsigned last_byte = PAGE_SIZE;
42
43 if (page_nr == (inode->i_size >> PAGE_SHIFT))
44 last_byte = inode->i_size & (PAGE_SIZE - 1);
45 return last_byte;
46}
47
48static int dir_commit_chunk(struct page *page, loff_t pos, unsigned len)
49{
50 struct address_space *mapping = page->mapping;
51 struct inode *dir = mapping->host;
52 int err = 0;
53 block_write_end(NULL, mapping, pos, len, len, page, NULL);
54
55 if (pos+len > dir->i_size) {
56 i_size_write(dir, pos+len);
57 mark_inode_dirty(dir);
58 }
59 if (IS_DIRSYNC(dir))
60 err = write_one_page(page, 1);
61 else
62 unlock_page(page);
63 return err;
64}
65
66static struct page * dir_get_page(struct inode *dir, unsigned long n)
67{
68 struct address_space *mapping = dir->i_mapping;
69 struct page *page = read_mapping_page(mapping, n, NULL);
70 if (!IS_ERR(page))
71 kmap(page);
72 return page;
73}
74
75static inline void *minix_next_entry(void *de, struct minix_sb_info *sbi)
76{
77 return (void*)((char*)de + sbi->s_dirsize);
78}
79
80static int minix_readdir(struct file *file, struct dir_context *ctx)
81{
82 struct inode *inode = file_inode(file);
83 struct super_block *sb = inode->i_sb;
84 struct minix_sb_info *sbi = minix_sb(sb);
85 unsigned chunk_size = sbi->s_dirsize;
86 unsigned long npages = dir_pages(inode);
87 unsigned long pos = ctx->pos;
88 unsigned offset;
89 unsigned long n;
90
91 ctx->pos = pos = ALIGN(pos, chunk_size);
92 if (pos >= inode->i_size)
93 return 0;
94
95 offset = pos & ~PAGE_MASK;
96 n = pos >> PAGE_SHIFT;
97
98 for ( ; n < npages; n++, offset = 0) {
99 char *p, *kaddr, *limit;
100 struct page *page = dir_get_page(inode, n);
101
102 if (IS_ERR(page))
103 continue;
104 kaddr = (char *)page_address(page);
105 p = kaddr+offset;
106 limit = kaddr + minix_last_byte(inode, n) - chunk_size;
107 for ( ; p <= limit; p = minix_next_entry(p, sbi)) {
108 const char *name;
109 __u32 inumber;
110 if (sbi->s_version == MINIX_V3) {
111 minix3_dirent *de3 = (minix3_dirent *)p;
112 name = de3->name;
113 inumber = de3->inode;
114 } else {
115 minix_dirent *de = (minix_dirent *)p;
116 name = de->name;
117 inumber = de->inode;
118 }
119 if (inumber) {
120 unsigned l = strnlen(name, sbi->s_namelen);
121 if (!dir_emit(ctx, name, l,
122 inumber, DT_UNKNOWN)) {
123 dir_put_page(page);
124 return 0;
125 }
126 }
127 ctx->pos += chunk_size;
128 }
129 dir_put_page(page);
130 }
131 return 0;
132}
133
134static inline int namecompare(int len, int maxlen,
135 const char * name, const char * buffer)
136{
137 if (len < maxlen && buffer[len])
138 return 0;
139 return !memcmp(name, buffer, len);
140}
141
142/*
143 * minix_find_entry()
144 *
145 * finds an entry in the specified directory with the wanted name. It
146 * returns the cache buffer in which the entry was found, and the entry
147 * itself (as a parameter - res_dir). It does NOT read the inode of the
148 * entry - you'll have to do that yourself if you want to.
149 */
150minix_dirent *minix_find_entry(struct dentry *dentry, struct page **res_page)
151{
152 const char * name = dentry->d_name.name;
153 int namelen = dentry->d_name.len;
154 struct inode * dir = d_inode(dentry->d_parent);
155 struct super_block * sb = dir->i_sb;
156 struct minix_sb_info * sbi = minix_sb(sb);
157 unsigned long n;
158 unsigned long npages = dir_pages(dir);
159 struct page *page = NULL;
160 char *p;
161
162 char *namx;
163 __u32 inumber;
164 *res_page = NULL;
165
166 for (n = 0; n < npages; n++) {
167 char *kaddr, *limit;
168
169 page = dir_get_page(dir, n);
170 if (IS_ERR(page))
171 continue;
172
173 kaddr = (char*)page_address(page);
174 limit = kaddr + minix_last_byte(dir, n) - sbi->s_dirsize;
175 for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
176 if (sbi->s_version == MINIX_V3) {
177 minix3_dirent *de3 = (minix3_dirent *)p;
178 namx = de3->name;
179 inumber = de3->inode;
180 } else {
181 minix_dirent *de = (minix_dirent *)p;
182 namx = de->name;
183 inumber = de->inode;
184 }
185 if (!inumber)
186 continue;
187 if (namecompare(namelen, sbi->s_namelen, name, namx))
188 goto found;
189 }
190 dir_put_page(page);
191 }
192 return NULL;
193
194found:
195 *res_page = page;
196 return (minix_dirent *)p;
197}
198
199int minix_add_link(struct dentry *dentry, struct inode *inode)
200{
201 struct inode *dir = d_inode(dentry->d_parent);
202 const char * name = dentry->d_name.name;
203 int namelen = dentry->d_name.len;
204 struct super_block * sb = dir->i_sb;
205 struct minix_sb_info * sbi = minix_sb(sb);
206 struct page *page = NULL;
207 unsigned long npages = dir_pages(dir);
208 unsigned long n;
209 char *kaddr, *p;
210 minix_dirent *de;
211 minix3_dirent *de3;
212 loff_t pos;
213 int err;
214 char *namx = NULL;
215 __u32 inumber;
216
217 /*
218 * We take care of directory expansion in the same loop
219 * This code plays outside i_size, so it locks the page
220 * to protect that region.
221 */
222 for (n = 0; n <= npages; n++) {
223 char *limit, *dir_end;
224
225 page = dir_get_page(dir, n);
226 err = PTR_ERR(page);
227 if (IS_ERR(page))
228 goto out;
229 lock_page(page);
230 kaddr = (char*)page_address(page);
231 dir_end = kaddr + minix_last_byte(dir, n);
232 limit = kaddr + PAGE_SIZE - sbi->s_dirsize;
233 for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
234 de = (minix_dirent *)p;
235 de3 = (minix3_dirent *)p;
236 if (sbi->s_version == MINIX_V3) {
237 namx = de3->name;
238 inumber = de3->inode;
239 } else {
240 namx = de->name;
241 inumber = de->inode;
242 }
243 if (p == dir_end) {
244 /* We hit i_size */
245 if (sbi->s_version == MINIX_V3)
246 de3->inode = 0;
247 else
248 de->inode = 0;
249 goto got_it;
250 }
251 if (!inumber)
252 goto got_it;
253 err = -EEXIST;
254 if (namecompare(namelen, sbi->s_namelen, name, namx))
255 goto out_unlock;
256 }
257 unlock_page(page);
258 dir_put_page(page);
259 }
260 BUG();
261 return -EINVAL;
262
263got_it:
264 pos = page_offset(page) + p - (char *)page_address(page);
265 err = minix_prepare_chunk(page, pos, sbi->s_dirsize);
266 if (err)
267 goto out_unlock;
268 memcpy (namx, name, namelen);
269 if (sbi->s_version == MINIX_V3) {
270 memset (namx + namelen, 0, sbi->s_dirsize - namelen - 4);
271 de3->inode = inode->i_ino;
272 } else {
273 memset (namx + namelen, 0, sbi->s_dirsize - namelen - 2);
274 de->inode = inode->i_ino;
275 }
276 err = dir_commit_chunk(page, pos, sbi->s_dirsize);
277 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
278 mark_inode_dirty(dir);
279out_put:
280 dir_put_page(page);
281out:
282 return err;
283out_unlock:
284 unlock_page(page);
285 goto out_put;
286}
287
288int minix_delete_entry(struct minix_dir_entry *de, struct page *page)
289{
290 struct inode *inode = page->mapping->host;
291 char *kaddr = page_address(page);
292 loff_t pos = page_offset(page) + (char*)de - kaddr;
293 struct minix_sb_info *sbi = minix_sb(inode->i_sb);
294 unsigned len = sbi->s_dirsize;
295 int err;
296
297 lock_page(page);
298 err = minix_prepare_chunk(page, pos, len);
299 if (err == 0) {
300 if (sbi->s_version == MINIX_V3)
301 ((minix3_dirent *) de)->inode = 0;
302 else
303 de->inode = 0;
304 err = dir_commit_chunk(page, pos, len);
305 } else {
306 unlock_page(page);
307 }
308 dir_put_page(page);
309 inode->i_ctime = inode->i_mtime = CURRENT_TIME_SEC;
310 mark_inode_dirty(inode);
311 return err;
312}
313
314int minix_make_empty(struct inode *inode, struct inode *dir)
315{
316 struct page *page = grab_cache_page(inode->i_mapping, 0);
317 struct minix_sb_info *sbi = minix_sb(inode->i_sb);
318 char *kaddr;
319 int err;
320
321 if (!page)
322 return -ENOMEM;
323 err = minix_prepare_chunk(page, 0, 2 * sbi->s_dirsize);
324 if (err) {
325 unlock_page(page);
326 goto fail;
327 }
328
329 kaddr = kmap_atomic(page);
330 memset(kaddr, 0, PAGE_SIZE);
331
332 if (sbi->s_version == MINIX_V3) {
333 minix3_dirent *de3 = (minix3_dirent *)kaddr;
334
335 de3->inode = inode->i_ino;
336 strcpy(de3->name, ".");
337 de3 = minix_next_entry(de3, sbi);
338 de3->inode = dir->i_ino;
339 strcpy(de3->name, "..");
340 } else {
341 minix_dirent *de = (minix_dirent *)kaddr;
342
343 de->inode = inode->i_ino;
344 strcpy(de->name, ".");
345 de = minix_next_entry(de, sbi);
346 de->inode = dir->i_ino;
347 strcpy(de->name, "..");
348 }
349 kunmap_atomic(kaddr);
350
351 err = dir_commit_chunk(page, 0, 2 * sbi->s_dirsize);
352fail:
353 put_page(page);
354 return err;
355}
356
357/*
358 * routine to check that the specified directory is empty (for rmdir)
359 */
360int minix_empty_dir(struct inode * inode)
361{
362 struct page *page = NULL;
363 unsigned long i, npages = dir_pages(inode);
364 struct minix_sb_info *sbi = minix_sb(inode->i_sb);
365 char *name;
366 __u32 inumber;
367
368 for (i = 0; i < npages; i++) {
369 char *p, *kaddr, *limit;
370
371 page = dir_get_page(inode, i);
372 if (IS_ERR(page))
373 continue;
374
375 kaddr = (char *)page_address(page);
376 limit = kaddr + minix_last_byte(inode, i) - sbi->s_dirsize;
377 for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
378 if (sbi->s_version == MINIX_V3) {
379 minix3_dirent *de3 = (minix3_dirent *)p;
380 name = de3->name;
381 inumber = de3->inode;
382 } else {
383 minix_dirent *de = (minix_dirent *)p;
384 name = de->name;
385 inumber = de->inode;
386 }
387
388 if (inumber != 0) {
389 /* check for . and .. */
390 if (name[0] != '.')
391 goto not_empty;
392 if (!name[1]) {
393 if (inumber != inode->i_ino)
394 goto not_empty;
395 } else if (name[1] != '.')
396 goto not_empty;
397 else if (name[2])
398 goto not_empty;
399 }
400 }
401 dir_put_page(page);
402 }
403 return 1;
404
405not_empty:
406 dir_put_page(page);
407 return 0;
408}
409
410/* Releases the page */
411void minix_set_link(struct minix_dir_entry *de, struct page *page,
412 struct inode *inode)
413{
414 struct inode *dir = page->mapping->host;
415 struct minix_sb_info *sbi = minix_sb(dir->i_sb);
416 loff_t pos = page_offset(page) +
417 (char *)de-(char*)page_address(page);
418 int err;
419
420 lock_page(page);
421
422 err = minix_prepare_chunk(page, pos, sbi->s_dirsize);
423 if (err == 0) {
424 if (sbi->s_version == MINIX_V3)
425 ((minix3_dirent *) de)->inode = inode->i_ino;
426 else
427 de->inode = inode->i_ino;
428 err = dir_commit_chunk(page, pos, sbi->s_dirsize);
429 } else {
430 unlock_page(page);
431 }
432 dir_put_page(page);
433 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
434 mark_inode_dirty(dir);
435}
436
437struct minix_dir_entry * minix_dotdot (struct inode *dir, struct page **p)
438{
439 struct page *page = dir_get_page(dir, 0);
440 struct minix_sb_info *sbi = minix_sb(dir->i_sb);
441 struct minix_dir_entry *de = NULL;
442
443 if (!IS_ERR(page)) {
444 de = minix_next_entry(page_address(page), sbi);
445 *p = page;
446 }
447 return de;
448}
449
450ino_t minix_inode_by_name(struct dentry *dentry)
451{
452 struct page *page;
453 struct minix_dir_entry *de = minix_find_entry(dentry, &page);
454 ino_t res = 0;
455
456 if (de) {
457 struct address_space *mapping = page->mapping;
458 struct inode *inode = mapping->host;
459 struct minix_sb_info *sbi = minix_sb(inode->i_sb);
460
461 if (sbi->s_version == MINIX_V3)
462 res = ((minix3_dirent *) de)->inode;
463 else
464 res = de->inode;
465 dir_put_page(page);
466 }
467 return res;
468}
1/*
2 * linux/fs/minix/dir.c
3 *
4 * Copyright (C) 1991, 1992 Linus Torvalds
5 *
6 * minix directory handling functions
7 *
8 * Updated to filesystem version 3 by Daniel Aragones
9 */
10
11#include "minix.h"
12#include <linux/buffer_head.h>
13#include <linux/highmem.h>
14#include <linux/swap.h>
15
16typedef struct minix_dir_entry minix_dirent;
17typedef struct minix3_dir_entry minix3_dirent;
18
19static int minix_readdir(struct file *, void *, filldir_t);
20
21const struct file_operations minix_dir_operations = {
22 .llseek = generic_file_llseek,
23 .read = generic_read_dir,
24 .readdir = minix_readdir,
25 .fsync = generic_file_fsync,
26};
27
28static inline void dir_put_page(struct page *page)
29{
30 kunmap(page);
31 page_cache_release(page);
32}
33
34/*
35 * Return the offset into page `page_nr' of the last valid
36 * byte in that page, plus one.
37 */
38static unsigned
39minix_last_byte(struct inode *inode, unsigned long page_nr)
40{
41 unsigned last_byte = PAGE_CACHE_SIZE;
42
43 if (page_nr == (inode->i_size >> PAGE_CACHE_SHIFT))
44 last_byte = inode->i_size & (PAGE_CACHE_SIZE - 1);
45 return last_byte;
46}
47
48static inline unsigned long dir_pages(struct inode *inode)
49{
50 return (inode->i_size+PAGE_CACHE_SIZE-1)>>PAGE_CACHE_SHIFT;
51}
52
53static int dir_commit_chunk(struct page *page, loff_t pos, unsigned len)
54{
55 struct address_space *mapping = page->mapping;
56 struct inode *dir = mapping->host;
57 int err = 0;
58 block_write_end(NULL, mapping, pos, len, len, page, NULL);
59
60 if (pos+len > dir->i_size) {
61 i_size_write(dir, pos+len);
62 mark_inode_dirty(dir);
63 }
64 if (IS_DIRSYNC(dir))
65 err = write_one_page(page, 1);
66 else
67 unlock_page(page);
68 return err;
69}
70
71static struct page * dir_get_page(struct inode *dir, unsigned long n)
72{
73 struct address_space *mapping = dir->i_mapping;
74 struct page *page = read_mapping_page(mapping, n, NULL);
75 if (!IS_ERR(page))
76 kmap(page);
77 return page;
78}
79
80static inline void *minix_next_entry(void *de, struct minix_sb_info *sbi)
81{
82 return (void*)((char*)de + sbi->s_dirsize);
83}
84
85static int minix_readdir(struct file * filp, void * dirent, filldir_t filldir)
86{
87 unsigned long pos = filp->f_pos;
88 struct inode *inode = filp->f_path.dentry->d_inode;
89 struct super_block *sb = inode->i_sb;
90 unsigned offset = pos & ~PAGE_CACHE_MASK;
91 unsigned long n = pos >> PAGE_CACHE_SHIFT;
92 unsigned long npages = dir_pages(inode);
93 struct minix_sb_info *sbi = minix_sb(sb);
94 unsigned chunk_size = sbi->s_dirsize;
95 char *name;
96 __u32 inumber;
97
98 pos = (pos + chunk_size-1) & ~(chunk_size-1);
99 if (pos >= inode->i_size)
100 goto done;
101
102 for ( ; n < npages; n++, offset = 0) {
103 char *p, *kaddr, *limit;
104 struct page *page = dir_get_page(inode, n);
105
106 if (IS_ERR(page))
107 continue;
108 kaddr = (char *)page_address(page);
109 p = kaddr+offset;
110 limit = kaddr + minix_last_byte(inode, n) - chunk_size;
111 for ( ; p <= limit; p = minix_next_entry(p, sbi)) {
112 if (sbi->s_version == MINIX_V3) {
113 minix3_dirent *de3 = (minix3_dirent *)p;
114 name = de3->name;
115 inumber = de3->inode;
116 } else {
117 minix_dirent *de = (minix_dirent *)p;
118 name = de->name;
119 inumber = de->inode;
120 }
121 if (inumber) {
122 int over;
123
124 unsigned l = strnlen(name, sbi->s_namelen);
125 offset = p - kaddr;
126 over = filldir(dirent, name, l,
127 (n << PAGE_CACHE_SHIFT) | offset,
128 inumber, DT_UNKNOWN);
129 if (over) {
130 dir_put_page(page);
131 goto done;
132 }
133 }
134 }
135 dir_put_page(page);
136 }
137
138done:
139 filp->f_pos = (n << PAGE_CACHE_SHIFT) | offset;
140 return 0;
141}
142
143static inline int namecompare(int len, int maxlen,
144 const char * name, const char * buffer)
145{
146 if (len < maxlen && buffer[len])
147 return 0;
148 return !memcmp(name, buffer, len);
149}
150
151/*
152 * minix_find_entry()
153 *
154 * finds an entry in the specified directory with the wanted name. It
155 * returns the cache buffer in which the entry was found, and the entry
156 * itself (as a parameter - res_dir). It does NOT read the inode of the
157 * entry - you'll have to do that yourself if you want to.
158 */
159minix_dirent *minix_find_entry(struct dentry *dentry, struct page **res_page)
160{
161 const char * name = dentry->d_name.name;
162 int namelen = dentry->d_name.len;
163 struct inode * dir = dentry->d_parent->d_inode;
164 struct super_block * sb = dir->i_sb;
165 struct minix_sb_info * sbi = minix_sb(sb);
166 unsigned long n;
167 unsigned long npages = dir_pages(dir);
168 struct page *page = NULL;
169 char *p;
170
171 char *namx;
172 __u32 inumber;
173 *res_page = NULL;
174
175 for (n = 0; n < npages; n++) {
176 char *kaddr, *limit;
177
178 page = dir_get_page(dir, n);
179 if (IS_ERR(page))
180 continue;
181
182 kaddr = (char*)page_address(page);
183 limit = kaddr + minix_last_byte(dir, n) - sbi->s_dirsize;
184 for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
185 if (sbi->s_version == MINIX_V3) {
186 minix3_dirent *de3 = (minix3_dirent *)p;
187 namx = de3->name;
188 inumber = de3->inode;
189 } else {
190 minix_dirent *de = (minix_dirent *)p;
191 namx = de->name;
192 inumber = de->inode;
193 }
194 if (!inumber)
195 continue;
196 if (namecompare(namelen, sbi->s_namelen, name, namx))
197 goto found;
198 }
199 dir_put_page(page);
200 }
201 return NULL;
202
203found:
204 *res_page = page;
205 return (minix_dirent *)p;
206}
207
208int minix_add_link(struct dentry *dentry, struct inode *inode)
209{
210 struct inode *dir = dentry->d_parent->d_inode;
211 const char * name = dentry->d_name.name;
212 int namelen = dentry->d_name.len;
213 struct super_block * sb = dir->i_sb;
214 struct minix_sb_info * sbi = minix_sb(sb);
215 struct page *page = NULL;
216 unsigned long npages = dir_pages(dir);
217 unsigned long n;
218 char *kaddr, *p;
219 minix_dirent *de;
220 minix3_dirent *de3;
221 loff_t pos;
222 int err;
223 char *namx = NULL;
224 __u32 inumber;
225
226 /*
227 * We take care of directory expansion in the same loop
228 * This code plays outside i_size, so it locks the page
229 * to protect that region.
230 */
231 for (n = 0; n <= npages; n++) {
232 char *limit, *dir_end;
233
234 page = dir_get_page(dir, n);
235 err = PTR_ERR(page);
236 if (IS_ERR(page))
237 goto out;
238 lock_page(page);
239 kaddr = (char*)page_address(page);
240 dir_end = kaddr + minix_last_byte(dir, n);
241 limit = kaddr + PAGE_CACHE_SIZE - sbi->s_dirsize;
242 for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
243 de = (minix_dirent *)p;
244 de3 = (minix3_dirent *)p;
245 if (sbi->s_version == MINIX_V3) {
246 namx = de3->name;
247 inumber = de3->inode;
248 } else {
249 namx = de->name;
250 inumber = de->inode;
251 }
252 if (p == dir_end) {
253 /* We hit i_size */
254 if (sbi->s_version == MINIX_V3)
255 de3->inode = 0;
256 else
257 de->inode = 0;
258 goto got_it;
259 }
260 if (!inumber)
261 goto got_it;
262 err = -EEXIST;
263 if (namecompare(namelen, sbi->s_namelen, name, namx))
264 goto out_unlock;
265 }
266 unlock_page(page);
267 dir_put_page(page);
268 }
269 BUG();
270 return -EINVAL;
271
272got_it:
273 pos = page_offset(page) + p - (char *)page_address(page);
274 err = minix_prepare_chunk(page, pos, sbi->s_dirsize);
275 if (err)
276 goto out_unlock;
277 memcpy (namx, name, namelen);
278 if (sbi->s_version == MINIX_V3) {
279 memset (namx + namelen, 0, sbi->s_dirsize - namelen - 4);
280 de3->inode = inode->i_ino;
281 } else {
282 memset (namx + namelen, 0, sbi->s_dirsize - namelen - 2);
283 de->inode = inode->i_ino;
284 }
285 err = dir_commit_chunk(page, pos, sbi->s_dirsize);
286 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
287 mark_inode_dirty(dir);
288out_put:
289 dir_put_page(page);
290out:
291 return err;
292out_unlock:
293 unlock_page(page);
294 goto out_put;
295}
296
297int minix_delete_entry(struct minix_dir_entry *de, struct page *page)
298{
299 struct inode *inode = page->mapping->host;
300 char *kaddr = page_address(page);
301 loff_t pos = page_offset(page) + (char*)de - kaddr;
302 struct minix_sb_info *sbi = minix_sb(inode->i_sb);
303 unsigned len = sbi->s_dirsize;
304 int err;
305
306 lock_page(page);
307 err = minix_prepare_chunk(page, pos, len);
308 if (err == 0) {
309 if (sbi->s_version == MINIX_V3)
310 ((minix3_dirent *) de)->inode = 0;
311 else
312 de->inode = 0;
313 err = dir_commit_chunk(page, pos, len);
314 } else {
315 unlock_page(page);
316 }
317 dir_put_page(page);
318 inode->i_ctime = inode->i_mtime = CURRENT_TIME_SEC;
319 mark_inode_dirty(inode);
320 return err;
321}
322
323int minix_make_empty(struct inode *inode, struct inode *dir)
324{
325 struct page *page = grab_cache_page(inode->i_mapping, 0);
326 struct minix_sb_info *sbi = minix_sb(inode->i_sb);
327 char *kaddr;
328 int err;
329
330 if (!page)
331 return -ENOMEM;
332 err = minix_prepare_chunk(page, 0, 2 * sbi->s_dirsize);
333 if (err) {
334 unlock_page(page);
335 goto fail;
336 }
337
338 kaddr = kmap_atomic(page, KM_USER0);
339 memset(kaddr, 0, PAGE_CACHE_SIZE);
340
341 if (sbi->s_version == MINIX_V3) {
342 minix3_dirent *de3 = (minix3_dirent *)kaddr;
343
344 de3->inode = inode->i_ino;
345 strcpy(de3->name, ".");
346 de3 = minix_next_entry(de3, sbi);
347 de3->inode = dir->i_ino;
348 strcpy(de3->name, "..");
349 } else {
350 minix_dirent *de = (minix_dirent *)kaddr;
351
352 de->inode = inode->i_ino;
353 strcpy(de->name, ".");
354 de = minix_next_entry(de, sbi);
355 de->inode = dir->i_ino;
356 strcpy(de->name, "..");
357 }
358 kunmap_atomic(kaddr, KM_USER0);
359
360 err = dir_commit_chunk(page, 0, 2 * sbi->s_dirsize);
361fail:
362 page_cache_release(page);
363 return err;
364}
365
366/*
367 * routine to check that the specified directory is empty (for rmdir)
368 */
369int minix_empty_dir(struct inode * inode)
370{
371 struct page *page = NULL;
372 unsigned long i, npages = dir_pages(inode);
373 struct minix_sb_info *sbi = minix_sb(inode->i_sb);
374 char *name;
375 __u32 inumber;
376
377 for (i = 0; i < npages; i++) {
378 char *p, *kaddr, *limit;
379
380 page = dir_get_page(inode, i);
381 if (IS_ERR(page))
382 continue;
383
384 kaddr = (char *)page_address(page);
385 limit = kaddr + minix_last_byte(inode, i) - sbi->s_dirsize;
386 for (p = kaddr; p <= limit; p = minix_next_entry(p, sbi)) {
387 if (sbi->s_version == MINIX_V3) {
388 minix3_dirent *de3 = (minix3_dirent *)p;
389 name = de3->name;
390 inumber = de3->inode;
391 } else {
392 minix_dirent *de = (minix_dirent *)p;
393 name = de->name;
394 inumber = de->inode;
395 }
396
397 if (inumber != 0) {
398 /* check for . and .. */
399 if (name[0] != '.')
400 goto not_empty;
401 if (!name[1]) {
402 if (inumber != inode->i_ino)
403 goto not_empty;
404 } else if (name[1] != '.')
405 goto not_empty;
406 else if (name[2])
407 goto not_empty;
408 }
409 }
410 dir_put_page(page);
411 }
412 return 1;
413
414not_empty:
415 dir_put_page(page);
416 return 0;
417}
418
419/* Releases the page */
420void minix_set_link(struct minix_dir_entry *de, struct page *page,
421 struct inode *inode)
422{
423 struct inode *dir = page->mapping->host;
424 struct minix_sb_info *sbi = minix_sb(dir->i_sb);
425 loff_t pos = page_offset(page) +
426 (char *)de-(char*)page_address(page);
427 int err;
428
429 lock_page(page);
430
431 err = minix_prepare_chunk(page, pos, sbi->s_dirsize);
432 if (err == 0) {
433 if (sbi->s_version == MINIX_V3)
434 ((minix3_dirent *) de)->inode = inode->i_ino;
435 else
436 de->inode = inode->i_ino;
437 err = dir_commit_chunk(page, pos, sbi->s_dirsize);
438 } else {
439 unlock_page(page);
440 }
441 dir_put_page(page);
442 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
443 mark_inode_dirty(dir);
444}
445
446struct minix_dir_entry * minix_dotdot (struct inode *dir, struct page **p)
447{
448 struct page *page = dir_get_page(dir, 0);
449 struct minix_sb_info *sbi = minix_sb(dir->i_sb);
450 struct minix_dir_entry *de = NULL;
451
452 if (!IS_ERR(page)) {
453 de = minix_next_entry(page_address(page), sbi);
454 *p = page;
455 }
456 return de;
457}
458
459ino_t minix_inode_by_name(struct dentry *dentry)
460{
461 struct page *page;
462 struct minix_dir_entry *de = minix_find_entry(dentry, &page);
463 ino_t res = 0;
464
465 if (de) {
466 struct address_space *mapping = page->mapping;
467 struct inode *inode = mapping->host;
468 struct minix_sb_info *sbi = minix_sb(inode->i_sb);
469
470 if (sbi->s_version == MINIX_V3)
471 res = ((minix3_dirent *) de)->inode;
472 else
473 res = de->inode;
474 dir_put_page(page);
475 }
476 return res;
477}