This source file includes following definitions.
- proc_lookuproot
- proc_readroot
1
2
3
4
5
6
7
8
9 #include <asm/segment.h>
10
11 #include <linux/errno.h>
12 #include <linux/sched.h>
13 #include <linux/proc_fs.h>
14 #include <linux/stat.h>
15 #include <linux/config.h>
16
17 static int proc_readroot(struct inode *, struct file *, struct dirent *, int);
18 static int proc_lookuproot(struct inode *,const char *,int,struct inode **);
19
20 static struct file_operations proc_root_operations = {
21 NULL,
22 NULL,
23 NULL,
24 proc_readroot,
25 NULL,
26 NULL,
27 NULL,
28 NULL,
29 NULL,
30 NULL
31 };
32
33
34
35
36 struct inode_operations proc_root_inode_operations = {
37 &proc_root_operations,
38 NULL,
39 proc_lookuproot,
40 NULL,
41 NULL,
42 NULL,
43 NULL,
44 NULL,
45 NULL,
46 NULL,
47 NULL,
48 NULL,
49 NULL,
50 NULL,
51 NULL
52 };
53
54 static struct proc_dir_entry root_dir[] = {
55 { 1,1,"." },
56 { 1,2,".." },
57 { 2,7,"loadavg" },
58 { 3,6,"uptime" },
59 { 4,7,"meminfo" },
60 { 5,4,"kmsg" },
61 { 6,7,"version" },
62 { 7,4,"self" },
63 { 8,3,"net" },
64 #ifdef CONFIG_DEBUG_MALLOC
65 {13,6,"malloc" },
66 #endif
67 {14,5,"kcore" },
68 {16,7,"modules" },
69 {17,4,"stat" },
70 };
71
72 #define NR_ROOT_DIRENTRY ((sizeof (root_dir))/(sizeof (root_dir[0])))
73
74 static int proc_lookuproot(struct inode * dir,const char * name, int len,
75 struct inode ** result)
76 {
77 unsigned int pid, c;
78 int i, ino;
79
80 *result = NULL;
81 if (!dir)
82 return -ENOENT;
83 if (!S_ISDIR(dir->i_mode)) {
84 iput(dir);
85 return -ENOENT;
86 }
87 i = NR_ROOT_DIRENTRY;
88 while (i-- > 0 && !proc_match(len,name,root_dir+i))
89 ;
90 if (i >= 0) {
91 ino = root_dir[i].low_ino;
92 if (ino == 1) {
93 *result = dir;
94 return 0;
95 }
96 if (ino == 7)
97 ino = (current->pid << 16) + 2;
98 } else {
99 pid = 0;
100 while (len-- > 0) {
101 c = *name - '0';
102 name++;
103 if (c > 9) {
104 pid = 0;
105 break;
106 }
107 pid *= 10;
108 pid += c;
109 if (pid & 0xffff0000) {
110 pid = 0;
111 break;
112 }
113 }
114 for (i = 0 ; i < NR_TASKS ; i++)
115 if (task[i] && task[i]->pid == pid)
116 break;
117 if (!pid || i >= NR_TASKS) {
118 iput(dir);
119 return -ENOENT;
120 }
121 ino = (pid << 16) + 2;
122 }
123 if (!(*result = iget(dir->i_sb,ino))) {
124 iput(dir);
125 return -ENOENT;
126 }
127 iput(dir);
128 return 0;
129 }
130
131 static int proc_readroot(struct inode * inode, struct file * filp,
132 struct dirent * dirent, int count)
133 {
134 struct task_struct * p;
135 unsigned int nr,pid;
136 int i,j;
137
138 if (!inode || !S_ISDIR(inode->i_mode))
139 return -EBADF;
140 repeat:
141 nr = filp->f_pos;
142 if (nr < NR_ROOT_DIRENTRY) {
143 struct proc_dir_entry * de = root_dir + nr;
144
145 filp->f_pos++;
146 i = de->namelen;
147 put_fs_long(de->low_ino, &dirent->d_ino);
148 put_fs_word(i,&dirent->d_reclen);
149 put_fs_byte(0,i+dirent->d_name);
150 j = i;
151 while (i--)
152 put_fs_byte(de->name[i], i+dirent->d_name);
153 return j;
154 }
155 nr -= NR_ROOT_DIRENTRY;
156 if (nr >= NR_TASKS)
157 return 0;
158 filp->f_pos++;
159 p = task[nr];
160 if (!p || !(pid = p->pid))
161 goto repeat;
162 if (pid & 0xffff0000)
163 goto repeat;
164 j = 10;
165 i = 1;
166 while (pid >= j) {
167 j *= 10;
168 i++;
169 }
170 j = i;
171 put_fs_long((pid << 16)+2, &dirent->d_ino);
172 put_fs_word(i, &dirent->d_reclen);
173 put_fs_byte(0, i+dirent->d_name);
174 while (i--) {
175 put_fs_byte('0'+(pid % 10), i+dirent->d_name);
176 pid /= 10;
177 }
178 return j;
179 }