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 { PROC_ROOT_INO, 1, "." },
56 { PROC_ROOT_INO, 2, ".." },
57 { PROC_LOADAVG, 7, "loadavg" },
58 { PROC_UPTIME, 6, "uptime" },
59 { PROC_MEMINFO, 7, "meminfo" },
60 { PROC_KMSG, 4, "kmsg" },
61 { PROC_VERSION, 7, "version" },
62 #ifdef CONFIG_PCI
63 { PROC_PCI, 3, "pci" },
64 #endif
65 { PROC_CPUINFO, 7, "cpuinfo" },
66 { PROC_SELF, 4, "self" },
67 { PROC_NET, 3, "net" },
68 #ifdef CONFIG_DEBUG_MALLOC
69 { PROC_MALLOC, 6, "malloc" },
70 #endif
71 { PROC_KCORE, 5, "kcore" },
72 { PROC_MODULES, 7, "modules" },
73 { PROC_STAT, 4, "stat" },
74 { PROC_DEVICES, 7, "devices" },
75 { PROC_INTERRUPTS, 10,"interrupts" },
76 { PROC_FILESYSTEMS, 11,"filesystems" },
77 { PROC_KSYMS, 5, "ksyms" },
78 { PROC_DMA, 3, "dma" },
79 { PROC_IOPORTS, 7, "ioports"},
80 #ifdef CONFIG_PROFILE
81 { PROC_PROFILE, 7, "profile"},
82 #endif
83 };
84
85 #define NR_ROOT_DIRENTRY ((sizeof (root_dir))/(sizeof (root_dir[0])))
86
87 static int proc_lookuproot(struct inode * dir,const char * name, int len,
88 struct inode ** result)
89 {
90 unsigned int pid, c;
91 int i, ino;
92
93 *result = NULL;
94 if (!dir)
95 return -ENOENT;
96 if (!S_ISDIR(dir->i_mode)) {
97 iput(dir);
98 return -ENOENT;
99 }
100 i = NR_ROOT_DIRENTRY;
101 while (i-- > 0 && !proc_match(len,name,root_dir+i))
102 ;
103 if (i >= 0) {
104 ino = root_dir[i].low_ino;
105 if (ino == PROC_ROOT_INO) {
106 *result = dir;
107 return 0;
108 }
109 if (ino == PROC_SELF)
110 ino = (current->pid << 16) + 2;
111 } else {
112 pid = 0;
113 while (len-- > 0) {
114 c = *name - '0';
115 name++;
116 if (c > 9) {
117 pid = 0;
118 break;
119 }
120 pid *= 10;
121 pid += c;
122 if (pid & 0xffff0000) {
123 pid = 0;
124 break;
125 }
126 }
127 for (i = 0 ; i < NR_TASKS ; i++)
128 if (task[i] && task[i]->pid == pid)
129 break;
130 if (!pid || i >= NR_TASKS) {
131 iput(dir);
132 return -ENOENT;
133 }
134 ino = (pid << 16) + 2;
135 }
136 if (!(*result = iget(dir->i_sb,ino))) {
137 iput(dir);
138 return -ENOENT;
139 }
140 iput(dir);
141 return 0;
142 }
143
144 static int proc_readroot(struct inode * inode, struct file * filp,
145 struct dirent * dirent, int count)
146 {
147 struct task_struct * p;
148 unsigned int nr,pid;
149 int i,j;
150
151 if (!inode || !S_ISDIR(inode->i_mode))
152 return -EBADF;
153 repeat:
154 nr = filp->f_pos;
155 if (nr < NR_ROOT_DIRENTRY) {
156 struct proc_dir_entry * de = root_dir + nr;
157
158 filp->f_pos++;
159 i = de->namelen;
160 put_fs_long(de->low_ino, &dirent->d_ino);
161 put_fs_word(i,&dirent->d_reclen);
162 put_fs_byte(0,i+dirent->d_name);
163 j = i;
164 while (i--)
165 put_fs_byte(de->name[i], i+dirent->d_name);
166 return j;
167 }
168 nr -= NR_ROOT_DIRENTRY;
169 if (nr >= NR_TASKS)
170 return 0;
171 filp->f_pos++;
172 p = task[nr];
173 if (!p || !(pid = p->pid))
174 goto repeat;
175 if (pid & 0xffff0000)
176 goto repeat;
177 j = 10;
178 i = 1;
179 while (pid >= j) {
180 j *= 10;
181 i++;
182 }
183 j = i;
184 put_fs_long((pid << 16)+2, &dirent->d_ino);
185 put_fs_word(i, &dirent->d_reclen);
186 put_fs_byte(0, i+dirent->d_name);
187 while (i--) {
188 put_fs_byte('0'+(pid % 10), i+dirent->d_name);
189 pid /= 10;
190 }
191 return j;
192 }