forked from torvalds/linux
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinode-v23.c
1847 lines (1582 loc) · 47.9 KB
/
inode-v23.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* JFFS -- Journalling Flash File System, Linux implementation.
*
* Copyright (C) 1999, 2000 Axis Communications AB.
*
* Created by Finn Hakansson <[email protected]>.
*
* This is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* $Id: inode-v23.c,v 1.70 2001/10/02 09:16:02 dwmw2 Exp $
*
* Ported to Linux 2.3.x and MTD:
* Copyright (C) 2000 Alexander Larsson ([email protected]), Cendio Systems AB
*
* Copyright 2000, 2001 Red Hat, Inc.
*/
/* inode.c -- Contains the code that is called from the VFS. */
/* TODO-ALEX:
* uid and gid are just 16 bit.
* jffs_file_write reads from user-space pointers without xx_from_user
* maybe other stuff do to.
*/
#include <linux/time.h>
#include <linux/module.h>
#include <linux/init.h>
#include <linux/types.h>
#include <linux/errno.h>
#include <linux/slab.h>
#include <linux/jffs.h>
#include <linux/fs.h>
#include <linux/smp_lock.h>
#include <linux/ioctl.h>
#include <linux/stat.h>
#include <linux/blkdev.h>
#include <linux/quotaops.h>
#include <linux/highmem.h>
#include <linux/vfs.h>
#include <linux/mutex.h>
#include <asm/byteorder.h>
#include <asm/uaccess.h>
#include "jffs_fm.h"
#include "intrep.h"
#ifdef CONFIG_JFFS_PROC_FS
#include "jffs_proc.h"
#endif
static int jffs_remove(struct inode *dir, struct dentry *dentry, int type);
static struct super_operations jffs_ops;
static const struct file_operations jffs_file_operations;
static struct inode_operations jffs_file_inode_operations;
static const struct file_operations jffs_dir_operations;
static struct inode_operations jffs_dir_inode_operations;
static const struct address_space_operations jffs_address_operations;
struct kmem_cache *node_cache = NULL;
struct kmem_cache *fm_cache = NULL;
/* Called by the VFS at mount time to initialize the whole file system. */
static int jffs_fill_super(struct super_block *sb, void *data, int silent)
{
struct inode *root_inode;
struct jffs_control *c;
sb->s_flags |= MS_NODIRATIME;
D1(printk(KERN_NOTICE "JFFS: Trying to mount device %s.\n",
sb->s_id));
if (MAJOR(sb->s_dev) != MTD_BLOCK_MAJOR) {
printk(KERN_WARNING "JFFS: Trying to mount a "
"non-mtd device.\n");
return -EINVAL;
}
sb->s_blocksize = PAGE_CACHE_SIZE;
sb->s_blocksize_bits = PAGE_CACHE_SHIFT;
sb->s_fs_info = (void *) 0;
sb->s_maxbytes = 0xFFFFFFFF;
/* Build the file system. */
if (jffs_build_fs(sb) < 0) {
goto jffs_sb_err1;
}
/*
* set up enough so that we can read an inode
*/
sb->s_magic = JFFS_MAGIC_SB_BITMASK;
sb->s_op = &jffs_ops;
root_inode = iget(sb, JFFS_MIN_INO);
if (!root_inode)
goto jffs_sb_err2;
/* Get the root directory of this file system. */
if (!(sb->s_root = d_alloc_root(root_inode))) {
goto jffs_sb_err3;
}
c = (struct jffs_control *) sb->s_fs_info;
#ifdef CONFIG_JFFS_PROC_FS
/* Set up the jffs proc file system. */
if (jffs_register_jffs_proc_dir(MINOR(sb->s_dev), c) < 0) {
printk(KERN_WARNING "JFFS: Failed to initialize the JFFS "
"proc file system for device %s.\n",
sb->s_id);
}
#endif
/* Set the Garbage Collection thresholds */
/* GC if free space goes below 5% of the total size */
c->gc_minfree_threshold = c->fmc->flash_size / 20;
if (c->gc_minfree_threshold < c->fmc->sector_size)
c->gc_minfree_threshold = c->fmc->sector_size;
/* GC if dirty space exceeds 33% of the total size. */
c->gc_maxdirty_threshold = c->fmc->flash_size / 3;
if (c->gc_maxdirty_threshold < c->fmc->sector_size)
c->gc_maxdirty_threshold = c->fmc->sector_size;
c->thread_pid = kernel_thread (jffs_garbage_collect_thread,
(void *) c,
CLONE_KERNEL);
D1(printk(KERN_NOTICE "JFFS: GC thread pid=%d.\n", (int) c->thread_pid));
D1(printk(KERN_NOTICE "JFFS: Successfully mounted device %s.\n",
sb->s_id));
return 0;
jffs_sb_err3:
iput(root_inode);
jffs_sb_err2:
jffs_cleanup_control((struct jffs_control *)sb->s_fs_info);
jffs_sb_err1:
printk(KERN_WARNING "JFFS: Failed to mount device %s.\n",
sb->s_id);
return -EINVAL;
}
/* This function is called when the file system is umounted. */
static void
jffs_put_super(struct super_block *sb)
{
struct jffs_control *c = (struct jffs_control *) sb->s_fs_info;
D2(printk("jffs_put_super()\n"));
#ifdef CONFIG_JFFS_PROC_FS
jffs_unregister_jffs_proc_dir(c);
#endif
if (c->gc_task) {
D1(printk (KERN_NOTICE "jffs_put_super(): Telling gc thread to die.\n"));
send_sig(SIGKILL, c->gc_task, 1);
}
wait_for_completion(&c->gc_thread_comp);
D1(printk (KERN_NOTICE "jffs_put_super(): Successfully waited on thread.\n"));
jffs_cleanup_control((struct jffs_control *)sb->s_fs_info);
D1(printk(KERN_NOTICE "JFFS: Successfully unmounted device %s.\n",
sb->s_id));
}
/* This function is called when user commands like chmod, chgrp and
chown are executed. System calls like trunc() results in a call
to this function. */
static int
jffs_setattr(struct dentry *dentry, struct iattr *iattr)
{
struct inode *inode = dentry->d_inode;
struct jffs_raw_inode raw_inode;
struct jffs_control *c;
struct jffs_fmcontrol *fmc;
struct jffs_file *f;
struct jffs_node *new_node;
int update_all;
int res = 0;
int recoverable = 0;
lock_kernel();
if ((res = inode_change_ok(inode, iattr)))
goto out;
c = (struct jffs_control *)inode->i_sb->s_fs_info;
fmc = c->fmc;
D3(printk (KERN_NOTICE "notify_change(): down biglock\n"));
mutex_lock(&fmc->biglock);
f = jffs_find_file(c, inode->i_ino);
ASSERT(if (!f) {
printk("jffs_setattr(): Invalid inode number: %lu\n",
inode->i_ino);
D3(printk (KERN_NOTICE "notify_change(): up biglock\n"));
mutex_unlock(&fmc->biglock);
res = -EINVAL;
goto out;
});
D1(printk("***jffs_setattr(): file: \"%s\", ino: %u\n",
f->name, f->ino));
update_all = iattr->ia_valid & ATTR_FORCE;
if ( (update_all || iattr->ia_valid & ATTR_SIZE)
&& (iattr->ia_size + 128 < f->size) ) {
/* We're shrinking the file by more than 128 bytes.
We'll be able to GC and recover this space, so
allow it to go into the reserved space. */
recoverable = 1;
}
if (!(new_node = jffs_alloc_node())) {
D(printk("jffs_setattr(): Allocation failed!\n"));
D3(printk (KERN_NOTICE "notify_change(): up biglock\n"));
mutex_unlock(&fmc->biglock);
res = -ENOMEM;
goto out;
}
new_node->data_offset = 0;
new_node->removed_size = 0;
raw_inode.magic = JFFS_MAGIC_BITMASK;
raw_inode.ino = f->ino;
raw_inode.pino = f->pino;
raw_inode.mode = f->mode;
raw_inode.uid = f->uid;
raw_inode.gid = f->gid;
raw_inode.atime = f->atime;
raw_inode.mtime = f->mtime;
raw_inode.ctime = f->ctime;
raw_inode.dsize = 0;
raw_inode.offset = 0;
raw_inode.rsize = 0;
raw_inode.dsize = 0;
raw_inode.nsize = f->nsize;
raw_inode.nlink = f->nlink;
raw_inode.spare = 0;
raw_inode.rename = 0;
raw_inode.deleted = 0;
if (update_all || iattr->ia_valid & ATTR_MODE) {
raw_inode.mode = iattr->ia_mode;
inode->i_mode = iattr->ia_mode;
}
if (update_all || iattr->ia_valid & ATTR_UID) {
raw_inode.uid = iattr->ia_uid;
inode->i_uid = iattr->ia_uid;
}
if (update_all || iattr->ia_valid & ATTR_GID) {
raw_inode.gid = iattr->ia_gid;
inode->i_gid = iattr->ia_gid;
}
if (update_all || iattr->ia_valid & ATTR_SIZE) {
int len;
D1(printk("jffs_notify_change(): Changing size "
"to %lu bytes!\n", (long)iattr->ia_size));
raw_inode.offset = iattr->ia_size;
/* Calculate how many bytes need to be removed from
the end. */
if (f->size < iattr->ia_size) {
len = 0;
}
else {
len = f->size - iattr->ia_size;
}
raw_inode.rsize = len;
/* The updated node will be a removal node, with
base at the new size and size of the nbr of bytes
to be removed. */
new_node->data_offset = iattr->ia_size;
new_node->removed_size = len;
inode->i_size = iattr->ia_size;
inode->i_blocks = (inode->i_size + 511) >> 9;
if (len) {
invalidate_inode_pages(inode->i_mapping);
}
inode->i_ctime = CURRENT_TIME_SEC;
inode->i_mtime = inode->i_ctime;
}
if (update_all || iattr->ia_valid & ATTR_ATIME) {
raw_inode.atime = iattr->ia_atime.tv_sec;
inode->i_atime = iattr->ia_atime;
}
if (update_all || iattr->ia_valid & ATTR_MTIME) {
raw_inode.mtime = iattr->ia_mtime.tv_sec;
inode->i_mtime = iattr->ia_mtime;
}
if (update_all || iattr->ia_valid & ATTR_CTIME) {
raw_inode.ctime = iattr->ia_ctime.tv_sec;
inode->i_ctime = iattr->ia_ctime;
}
/* Write this node to the flash. */
if ((res = jffs_write_node(c, new_node, &raw_inode, f->name, NULL, recoverable, f)) < 0) {
D(printk("jffs_notify_change(): The write failed!\n"));
jffs_free_node(new_node);
D3(printk (KERN_NOTICE "n_c(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
goto out;
}
jffs_insert_node(c, f, &raw_inode, NULL, new_node);
mark_inode_dirty(inode);
D3(printk (KERN_NOTICE "n_c(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
out:
unlock_kernel();
return res;
} /* jffs_notify_change() */
static struct inode *
jffs_new_inode(const struct inode * dir, struct jffs_raw_inode *raw_inode,
int * err)
{
struct super_block * sb;
struct inode * inode;
struct jffs_control *c;
struct jffs_file *f;
sb = dir->i_sb;
inode = new_inode(sb);
if (!inode) {
*err = -ENOMEM;
return NULL;
}
c = (struct jffs_control *)sb->s_fs_info;
inode->i_ino = raw_inode->ino;
inode->i_mode = raw_inode->mode;
inode->i_nlink = raw_inode->nlink;
inode->i_uid = raw_inode->uid;
inode->i_gid = raw_inode->gid;
inode->i_size = raw_inode->dsize;
inode->i_atime.tv_sec = raw_inode->atime;
inode->i_mtime.tv_sec = raw_inode->mtime;
inode->i_ctime.tv_sec = raw_inode->ctime;
inode->i_ctime.tv_nsec = 0;
inode->i_mtime.tv_nsec = 0;
inode->i_atime.tv_nsec = 0;
inode->i_blocks = (inode->i_size + 511) >> 9;
f = jffs_find_file(c, raw_inode->ino);
inode->i_private = (void *)f;
insert_inode_hash(inode);
return inode;
}
/* Get statistics of the file system. */
static int
jffs_statfs(struct dentry *dentry, struct kstatfs *buf)
{
struct jffs_control *c = (struct jffs_control *) dentry->d_sb->s_fs_info;
struct jffs_fmcontrol *fmc;
lock_kernel();
fmc = c->fmc;
D2(printk("jffs_statfs()\n"));
buf->f_type = JFFS_MAGIC_SB_BITMASK;
buf->f_bsize = PAGE_CACHE_SIZE;
buf->f_blocks = (fmc->flash_size / PAGE_CACHE_SIZE)
- (fmc->min_free_size / PAGE_CACHE_SIZE);
buf->f_bfree = (jffs_free_size1(fmc) + jffs_free_size2(fmc) +
fmc->dirty_size - fmc->min_free_size)
>> PAGE_CACHE_SHIFT;
buf->f_bavail = buf->f_bfree;
/* Find out how many files there are in the filesystem. */
buf->f_files = jffs_foreach_file(c, jffs_file_count);
buf->f_ffree = buf->f_bfree;
/* buf->f_fsid = 0; */
buf->f_namelen = JFFS_MAX_NAME_LEN;
unlock_kernel();
return 0;
}
/* Rename a file. */
static int
jffs_rename(struct inode *old_dir, struct dentry *old_dentry,
struct inode *new_dir, struct dentry *new_dentry)
{
struct jffs_raw_inode raw_inode;
struct jffs_control *c;
struct jffs_file *old_dir_f;
struct jffs_file *new_dir_f;
struct jffs_file *del_f;
struct jffs_file *f;
struct jffs_node *node;
struct inode *inode;
int result = 0;
__u32 rename_data = 0;
D2(printk("***jffs_rename()\n"));
D(printk("jffs_rename(): old_dir: 0x%p, old name: 0x%p, "
"new_dir: 0x%p, new name: 0x%p\n",
old_dir, old_dentry->d_name.name,
new_dir, new_dentry->d_name.name));
lock_kernel();
c = (struct jffs_control *)old_dir->i_sb->s_fs_info;
ASSERT(if (!c) {
printk(KERN_ERR "jffs_rename(): The old_dir inode "
"didn't have a reference to a jffs_file struct\n");
unlock_kernel();
return -EIO;
});
result = -ENOTDIR;
if (!(old_dir_f = old_dir->i_private)) {
D(printk("jffs_rename(): Old dir invalid.\n"));
goto jffs_rename_end;
}
/* Try to find the file to move. */
result = -ENOENT;
if (!(f = jffs_find_child(old_dir_f, old_dentry->d_name.name,
old_dentry->d_name.len))) {
goto jffs_rename_end;
}
/* Find the new directory. */
result = -ENOTDIR;
if (!(new_dir_f = new_dir->i_private)) {
D(printk("jffs_rename(): New dir invalid.\n"));
goto jffs_rename_end;
}
D3(printk (KERN_NOTICE "rename(): down biglock\n"));
mutex_lock(&c->fmc->biglock);
/* Create a node and initialize as much as needed. */
result = -ENOMEM;
if (!(node = jffs_alloc_node())) {
D(printk("jffs_rename(): Allocation failed: node == 0\n"));
goto jffs_rename_end;
}
node->data_offset = 0;
node->removed_size = 0;
/* Initialize the raw inode. */
raw_inode.magic = JFFS_MAGIC_BITMASK;
raw_inode.ino = f->ino;
raw_inode.pino = new_dir_f->ino;
/* raw_inode.version = f->highest_version + 1; */
raw_inode.mode = f->mode;
raw_inode.uid = current->fsuid;
raw_inode.gid = current->fsgid;
#if 0
raw_inode.uid = f->uid;
raw_inode.gid = f->gid;
#endif
raw_inode.atime = get_seconds();
raw_inode.mtime = raw_inode.atime;
raw_inode.ctime = f->ctime;
raw_inode.offset = 0;
raw_inode.dsize = 0;
raw_inode.rsize = 0;
raw_inode.nsize = new_dentry->d_name.len;
raw_inode.nlink = f->nlink;
raw_inode.spare = 0;
raw_inode.rename = 0;
raw_inode.deleted = 0;
/* See if there already exists a file with the same name as
new_name. */
if ((del_f = jffs_find_child(new_dir_f, new_dentry->d_name.name,
new_dentry->d_name.len))) {
raw_inode.rename = 1;
raw_inode.dsize = sizeof(__u32);
rename_data = del_f->ino;
}
/* Write the new node to the flash memory. */
if ((result = jffs_write_node(c, node, &raw_inode,
new_dentry->d_name.name,
(unsigned char*)&rename_data, 0, f)) < 0) {
D(printk("jffs_rename(): Failed to write node to flash.\n"));
jffs_free_node(node);
goto jffs_rename_end;
}
raw_inode.dsize = 0;
if (raw_inode.rename) {
/* The file with the same name must be deleted. */
//FIXME deadlock down(&c->fmc->gclock);
if ((result = jffs_remove(new_dir, new_dentry,
del_f->mode)) < 0) {
/* This is really bad. */
printk(KERN_ERR "JFFS: An error occurred in "
"rename().\n");
}
// up(&c->fmc->gclock);
}
if (old_dir_f != new_dir_f) {
/* Remove the file from its old position in the
filesystem tree. */
jffs_unlink_file_from_tree(f);
}
/* Insert the new node into the file system. */
if ((result = jffs_insert_node(c, f, &raw_inode,
new_dentry->d_name.name, node)) < 0) {
D(printk(KERN_ERR "jffs_rename(): jffs_insert_node() "
"failed!\n"));
}
if (old_dir_f != new_dir_f) {
/* Insert the file to its new position in the
file system. */
jffs_insert_file_into_tree(f);
}
/* This is a kind of update of the inode we're about to make
here. This is what they do in ext2fs. Kind of. */
if ((inode = iget(new_dir->i_sb, f->ino))) {
inode->i_ctime = CURRENT_TIME_SEC;
mark_inode_dirty(inode);
iput(inode);
}
jffs_rename_end:
D3(printk (KERN_NOTICE "rename(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
unlock_kernel();
return result;
} /* jffs_rename() */
/* Read the contents of a directory. Used by programs like `ls'
for instance. */
static int
jffs_readdir(struct file *filp, void *dirent, filldir_t filldir)
{
struct jffs_file *f;
struct dentry *dentry = filp->f_path.dentry;
struct inode *inode = dentry->d_inode;
struct jffs_control *c = (struct jffs_control *)inode->i_sb->s_fs_info;
int j;
int ddino;
lock_kernel();
D3(printk (KERN_NOTICE "readdir(): down biglock\n"));
mutex_lock(&c->fmc->biglock);
D2(printk("jffs_readdir(): inode: 0x%p, filp: 0x%p\n", inode, filp));
if (filp->f_pos == 0) {
D3(printk("jffs_readdir(): \".\" %lu\n", inode->i_ino));
if (filldir(dirent, ".", 1, filp->f_pos, inode->i_ino, DT_DIR) < 0) {
D3(printk (KERN_NOTICE "readdir(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
unlock_kernel();
return 0;
}
filp->f_pos = 1;
}
if (filp->f_pos == 1) {
if (inode->i_ino == JFFS_MIN_INO) {
ddino = JFFS_MIN_INO;
}
else {
ddino = ((struct jffs_file *)
inode->i_private)->pino;
}
D3(printk("jffs_readdir(): \"..\" %u\n", ddino));
if (filldir(dirent, "..", 2, filp->f_pos, ddino, DT_DIR) < 0) {
D3(printk (KERN_NOTICE "readdir(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
unlock_kernel();
return 0;
}
filp->f_pos++;
}
f = ((struct jffs_file *)inode->i_private)->children;
j = 2;
while(f && (f->deleted || j++ < filp->f_pos )) {
f = f->sibling_next;
}
while (f) {
D3(printk("jffs_readdir(): \"%s\" ino: %u\n",
(f->name ? f->name : ""), f->ino));
if (filldir(dirent, f->name, f->nsize,
filp->f_pos , f->ino, DT_UNKNOWN) < 0) {
D3(printk (KERN_NOTICE "readdir(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
unlock_kernel();
return 0;
}
filp->f_pos++;
do {
f = f->sibling_next;
} while(f && f->deleted);
}
D3(printk (KERN_NOTICE "readdir(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
unlock_kernel();
return filp->f_pos;
} /* jffs_readdir() */
/* Find a file in a directory. If the file exists, return its
corresponding dentry. */
static struct dentry *
jffs_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd)
{
struct jffs_file *d;
struct jffs_file *f;
struct jffs_control *c = (struct jffs_control *)dir->i_sb->s_fs_info;
int len;
int r = 0;
const char *name;
struct inode *inode = NULL;
len = dentry->d_name.len;
name = dentry->d_name.name;
lock_kernel();
D3({
char *s = kmalloc(len + 1, GFP_KERNEL);
memcpy(s, name, len);
s[len] = '\0';
printk("jffs_lookup(): dir: 0x%p, name: \"%s\"\n", dir, s);
kfree(s);
});
D3(printk (KERN_NOTICE "lookup(): down biglock\n"));
mutex_lock(&c->fmc->biglock);
r = -ENAMETOOLONG;
if (len > JFFS_MAX_NAME_LEN) {
goto jffs_lookup_end;
}
r = -EACCES;
if (!(d = (struct jffs_file *)dir->i_private)) {
D(printk("jffs_lookup(): No such inode! (%lu)\n",
dir->i_ino));
goto jffs_lookup_end;
}
/* Get the corresponding inode to the file. */
/* iget calls jffs_read_inode, so we need to drop the biglock
before calling iget. Unfortunately, the GC has a tendency
to sneak in here, because iget sometimes calls schedule ().
*/
if ((len == 1) && (name[0] == '.')) {
D3(printk (KERN_NOTICE "lookup(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
if (!(inode = iget(dir->i_sb, d->ino))) {
D(printk("jffs_lookup(): . iget() ==> NULL\n"));
goto jffs_lookup_end_no_biglock;
}
D3(printk (KERN_NOTICE "lookup(): down biglock\n"));
mutex_lock(&c->fmc->biglock);
} else if ((len == 2) && (name[0] == '.') && (name[1] == '.')) {
D3(printk (KERN_NOTICE "lookup(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
if (!(inode = iget(dir->i_sb, d->pino))) {
D(printk("jffs_lookup(): .. iget() ==> NULL\n"));
goto jffs_lookup_end_no_biglock;
}
D3(printk (KERN_NOTICE "lookup(): down biglock\n"));
mutex_lock(&c->fmc->biglock);
} else if ((f = jffs_find_child(d, name, len))) {
D3(printk (KERN_NOTICE "lookup(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
if (!(inode = iget(dir->i_sb, f->ino))) {
D(printk("jffs_lookup(): iget() ==> NULL\n"));
goto jffs_lookup_end_no_biglock;
}
D3(printk (KERN_NOTICE "lookup(): down biglock\n"));
mutex_lock(&c->fmc->biglock);
} else {
D3(printk("jffs_lookup(): Couldn't find the file. "
"f = 0x%p, name = \"%s\", d = 0x%p, d->ino = %u\n",
f, name, d, d->ino));
inode = NULL;
}
d_add(dentry, inode);
D3(printk (KERN_NOTICE "lookup(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
unlock_kernel();
return NULL;
jffs_lookup_end:
D3(printk (KERN_NOTICE "lookup(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
jffs_lookup_end_no_biglock:
unlock_kernel();
return ERR_PTR(r);
} /* jffs_lookup() */
/* Try to read a page of data from a file. */
static int
jffs_do_readpage_nolock(struct file *file, struct page *page)
{
void *buf;
unsigned long read_len;
int result;
struct inode *inode = (struct inode*)page->mapping->host;
struct jffs_file *f = (struct jffs_file *)inode->i_private;
struct jffs_control *c = (struct jffs_control *)inode->i_sb->s_fs_info;
int r;
loff_t offset;
D2(printk("***jffs_readpage(): file = \"%s\", page->index = %lu\n",
(f->name ? f->name : ""), (long)page->index));
get_page(page);
/* Don't SetPageLocked(page), should be locked already */
ClearPageUptodate(page);
ClearPageError(page);
D3(printk (KERN_NOTICE "readpage(): down biglock\n"));
mutex_lock(&c->fmc->biglock);
read_len = 0;
result = 0;
offset = page_offset(page);
kmap(page);
buf = page_address(page);
if (offset < inode->i_size) {
read_len = min_t(long, inode->i_size - offset, PAGE_SIZE);
r = jffs_read_data(f, buf, offset, read_len);
if (r != read_len) {
result = -EIO;
D(
printk("***jffs_readpage(): Read error! "
"Wanted to read %lu bytes but only "
"read %d bytes.\n", read_len, r);
);
}
}
/* This handles the case of partial or no read in above */
if(read_len < PAGE_SIZE)
memset(buf + read_len, 0, PAGE_SIZE - read_len);
flush_dcache_page(page);
kunmap(page);
D3(printk (KERN_NOTICE "readpage(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
if (result) {
SetPageError(page);
}else {
SetPageUptodate(page);
}
page_cache_release(page);
D3(printk("jffs_readpage(): Leaving...\n"));
return result;
} /* jffs_do_readpage_nolock() */
static int jffs_readpage(struct file *file, struct page *page)
{
int ret = jffs_do_readpage_nolock(file, page);
unlock_page(page);
return ret;
}
/* Create a new directory. */
static int
jffs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
{
struct jffs_raw_inode raw_inode;
struct jffs_control *c;
struct jffs_node *node;
struct jffs_file *dir_f;
struct inode *inode;
int dir_mode;
int result = 0;
int err;
D1({
int len = dentry->d_name.len;
char *_name = kmalloc(len + 1, GFP_KERNEL);
memcpy(_name, dentry->d_name.name, len);
_name[len] = '\0';
printk("***jffs_mkdir(): dir = 0x%p, name = \"%s\", "
"len = %d, mode = 0x%08x\n", dir, _name, len, mode);
kfree(_name);
});
lock_kernel();
dir_f = dir->i_private;
ASSERT(if (!dir_f) {
printk(KERN_ERR "jffs_mkdir(): No reference to a "
"jffs_file struct in inode.\n");
unlock_kernel();
return -EIO;
});
c = dir_f->c;
D3(printk (KERN_NOTICE "mkdir(): down biglock\n"));
mutex_lock(&c->fmc->biglock);
dir_mode = S_IFDIR | (mode & (S_IRWXUGO|S_ISVTX)
& ~current->fs->umask);
if (dir->i_mode & S_ISGID) {
dir_mode |= S_ISGID;
}
/* Create a node and initialize it as much as needed. */
if (!(node = jffs_alloc_node())) {
D(printk("jffs_mkdir(): Allocation failed: node == 0\n"));
result = -ENOMEM;
goto jffs_mkdir_end;
}
node->data_offset = 0;
node->removed_size = 0;
/* Initialize the raw inode. */
raw_inode.magic = JFFS_MAGIC_BITMASK;
raw_inode.ino = c->next_ino++;
raw_inode.pino = dir_f->ino;
raw_inode.version = 1;
raw_inode.mode = dir_mode;
raw_inode.uid = current->fsuid;
raw_inode.gid = (dir->i_mode & S_ISGID) ? dir->i_gid : current->fsgid;
/* raw_inode.gid = current->fsgid; */
raw_inode.atime = get_seconds();
raw_inode.mtime = raw_inode.atime;
raw_inode.ctime = raw_inode.atime;
raw_inode.offset = 0;
raw_inode.dsize = 0;
raw_inode.rsize = 0;
raw_inode.nsize = dentry->d_name.len;
raw_inode.nlink = 1;
raw_inode.spare = 0;
raw_inode.rename = 0;
raw_inode.deleted = 0;
/* Write the new node to the flash. */
if ((result = jffs_write_node(c, node, &raw_inode,
dentry->d_name.name, NULL, 0, NULL)) < 0) {
D(printk("jffs_mkdir(): jffs_write_node() failed.\n"));
jffs_free_node(node);
goto jffs_mkdir_end;
}
/* Insert the new node into the file system. */
if ((result = jffs_insert_node(c, NULL, &raw_inode, dentry->d_name.name,
node)) < 0) {
goto jffs_mkdir_end;
}
inode = jffs_new_inode(dir, &raw_inode, &err);
if (inode == NULL) {
result = err;
goto jffs_mkdir_end;
}
inode->i_op = &jffs_dir_inode_operations;
inode->i_fop = &jffs_dir_operations;
mark_inode_dirty(dir);
d_instantiate(dentry, inode);
result = 0;
jffs_mkdir_end:
D3(printk (KERN_NOTICE "mkdir(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
unlock_kernel();
return result;
} /* jffs_mkdir() */
/* Remove a directory. */
static int
jffs_rmdir(struct inode *dir, struct dentry *dentry)
{
struct jffs_control *c = (struct jffs_control *)dir->i_sb->s_fs_info;
int ret;
D3(printk("***jffs_rmdir()\n"));
D3(printk (KERN_NOTICE "rmdir(): down biglock\n"));
lock_kernel();
mutex_lock(&c->fmc->biglock);
ret = jffs_remove(dir, dentry, S_IFDIR);
D3(printk (KERN_NOTICE "rmdir(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
unlock_kernel();
return ret;
}
/* Remove any kind of file except for directories. */
static int
jffs_unlink(struct inode *dir, struct dentry *dentry)
{
struct jffs_control *c = (struct jffs_control *)dir->i_sb->s_fs_info;
int ret;
lock_kernel();
D3(printk("***jffs_unlink()\n"));
D3(printk (KERN_NOTICE "unlink(): down biglock\n"));
mutex_lock(&c->fmc->biglock);
ret = jffs_remove(dir, dentry, 0);
D3(printk (KERN_NOTICE "unlink(): up biglock\n"));
mutex_unlock(&c->fmc->biglock);
unlock_kernel();
return ret;
}
/* Remove a JFFS entry, i.e. plain files, directories, etc. Here we
shouldn't test for free space on the device. */
static int
jffs_remove(struct inode *dir, struct dentry *dentry, int type)
{
struct jffs_raw_inode raw_inode;
struct jffs_control *c;
struct jffs_file *dir_f; /* The file-to-remove's parent. */
struct jffs_file *del_f; /* The file to remove. */
struct jffs_node *del_node;
struct inode *inode = NULL;
int result = 0;
D1({
int len = dentry->d_name.len;
const char *name = dentry->d_name.name;
char *_name = kmalloc(len + 1, GFP_KERNEL);
memcpy(_name, name, len);
_name[len] = '\0';
printk("***jffs_remove(): file = \"%s\", ino = %ld\n", _name, dentry->d_inode->i_ino);
kfree(_name);
});
dir_f = dir->i_private;
c = dir_f->c;
result = -ENOENT;
if (!(del_f = jffs_find_child(dir_f, dentry->d_name.name,
dentry->d_name.len))) {
D(printk("jffs_remove(): jffs_find_child() failed.\n"));
goto jffs_remove_end;
}
if (S_ISDIR(type)) {
struct jffs_file *child = del_f->children;
while(child) {
if( !child->deleted ) {
result = -ENOTEMPTY;
goto jffs_remove_end;
}
child = child->sibling_next;
}
}
else if (S_ISDIR(del_f->mode)) {
D(printk("jffs_remove(): node is a directory "
"but it shouldn't be.\n"));
result = -EPERM;
goto jffs_remove_end;
}