procfs.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642
  1. /* -*- linux-c -*- */
  2. /* fs/reiserfs/procfs.c */
  3. /*
  4. * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
  5. */
  6. /* proc info support a la one created by Sizif@Botik.RU for PGC */
  7. /* $Id: procfs.c,v 1.1.8.2 2001/07/15 17:08:42 god Exp $ */
  8. #include <linux/config.h>
  9. #include <linux/module.h>
  10. #include <linux/time.h>
  11. #include <linux/seq_file.h>
  12. #include <asm/uaccess.h>
  13. #include <linux/reiserfs_fs.h>
  14. #include <linux/reiserfs_fs_sb.h>
  15. #include <linux/smp_lock.h>
  16. #include <linux/init.h>
  17. #include <linux/proc_fs.h>
  18. #if defined( REISERFS_PROC_INFO )
  19. /*
  20. * LOCKING:
  21. *
  22. * We rely on new Alexander Viro's super-block locking.
  23. *
  24. */
  25. static int show_version(struct seq_file *m, struct super_block *sb)
  26. {
  27. char *format;
  28. if (REISERFS_SB(sb)->s_properties & (1 << REISERFS_3_6)) {
  29. format = "3.6";
  30. } else if (REISERFS_SB(sb)->s_properties & (1 << REISERFS_3_5)) {
  31. format = "3.5";
  32. } else {
  33. format = "unknown";
  34. }
  35. seq_printf(m, "%s format\twith checks %s\n", format,
  36. #if defined( CONFIG_REISERFS_CHECK )
  37. "on"
  38. #else
  39. "off"
  40. #endif
  41. );
  42. return 0;
  43. }
  44. int reiserfs_global_version_in_proc(char *buffer, char **start, off_t offset,
  45. int count, int *eof, void *data)
  46. {
  47. *start = buffer;
  48. *eof = 1;
  49. return 0;
  50. }
  51. #define SF( x ) ( r -> x )
  52. #define SFP( x ) SF( s_proc_info_data.x )
  53. #define SFPL( x ) SFP( x[ level ] )
  54. #define SFPF( x ) SFP( scan_bitmap.x )
  55. #define SFPJ( x ) SFP( journal.x )
  56. #define D2C( x ) le16_to_cpu( x )
  57. #define D4C( x ) le32_to_cpu( x )
  58. #define DF( x ) D2C( rs -> s_v1.x )
  59. #define DFL( x ) D4C( rs -> s_v1.x )
  60. #define objectid_map( s, rs ) (old_format_only (s) ? \
  61. (__le32 *)((struct reiserfs_super_block_v1 *)rs + 1) : \
  62. (__le32 *)(rs + 1))
  63. #define MAP( i ) D4C( objectid_map( sb, rs )[ i ] )
  64. #define DJF( x ) le32_to_cpu( rs -> x )
  65. #define DJV( x ) le32_to_cpu( s_v1 -> x )
  66. #define DJP( x ) le32_to_cpu( jp -> x )
  67. #define JF( x ) ( r -> s_journal -> x )
  68. static int show_super(struct seq_file *m, struct super_block *sb)
  69. {
  70. struct reiserfs_sb_info *r = REISERFS_SB(sb);
  71. seq_printf(m, "state: \t%s\n"
  72. "mount options: \t%s%s%s%s%s%s%s%s%s%s%s\n"
  73. "gen. counter: \t%i\n"
  74. "s_disk_reads: \t%i\n"
  75. "s_disk_writes: \t%i\n"
  76. "s_fix_nodes: \t%i\n"
  77. "s_do_balance: \t%i\n"
  78. "s_unneeded_left_neighbor: \t%i\n"
  79. "s_good_search_by_key_reada: \t%i\n"
  80. "s_bmaps: \t%i\n"
  81. "s_bmaps_without_search: \t%i\n"
  82. "s_direct2indirect: \t%i\n"
  83. "s_indirect2direct: \t%i\n"
  84. "\n"
  85. "max_hash_collisions: \t%i\n"
  86. "breads: \t%lu\n"
  87. "bread_misses: \t%lu\n"
  88. "search_by_key: \t%lu\n"
  89. "search_by_key_fs_changed: \t%lu\n"
  90. "search_by_key_restarted: \t%lu\n"
  91. "insert_item_restarted: \t%lu\n"
  92. "paste_into_item_restarted: \t%lu\n"
  93. "cut_from_item_restarted: \t%lu\n"
  94. "delete_solid_item_restarted: \t%lu\n"
  95. "delete_item_restarted: \t%lu\n"
  96. "leaked_oid: \t%lu\n"
  97. "leaves_removable: \t%lu\n",
  98. SF(s_mount_state) == REISERFS_VALID_FS ?
  99. "REISERFS_VALID_FS" : "REISERFS_ERROR_FS",
  100. reiserfs_r5_hash(sb) ? "FORCE_R5 " : "",
  101. reiserfs_rupasov_hash(sb) ? "FORCE_RUPASOV " : "",
  102. reiserfs_tea_hash(sb) ? "FORCE_TEA " : "",
  103. reiserfs_hash_detect(sb) ? "DETECT_HASH " : "",
  104. reiserfs_no_border(sb) ? "NO_BORDER " : "BORDER ",
  105. reiserfs_no_unhashed_relocation(sb) ?
  106. "NO_UNHASHED_RELOCATION " : "",
  107. reiserfs_hashed_relocation(sb) ? "UNHASHED_RELOCATION " : "",
  108. reiserfs_test4(sb) ? "TEST4 " : "",
  109. have_large_tails(sb) ? "TAILS " : have_small_tails(sb) ?
  110. "SMALL_TAILS " : "NO_TAILS ",
  111. replay_only(sb) ? "REPLAY_ONLY " : "",
  112. convert_reiserfs(sb) ? "CONV " : "",
  113. atomic_read(&r->s_generation_counter),
  114. SF(s_disk_reads), SF(s_disk_writes), SF(s_fix_nodes),
  115. SF(s_do_balance), SF(s_unneeded_left_neighbor),
  116. SF(s_good_search_by_key_reada), SF(s_bmaps),
  117. SF(s_bmaps_without_search), SF(s_direct2indirect),
  118. SF(s_indirect2direct), SFP(max_hash_collisions), SFP(breads),
  119. SFP(bread_miss), SFP(search_by_key),
  120. SFP(search_by_key_fs_changed), SFP(search_by_key_restarted),
  121. SFP(insert_item_restarted), SFP(paste_into_item_restarted),
  122. SFP(cut_from_item_restarted),
  123. SFP(delete_solid_item_restarted), SFP(delete_item_restarted),
  124. SFP(leaked_oid), SFP(leaves_removable));
  125. return 0;
  126. }
  127. static int show_per_level(struct seq_file *m, struct super_block *sb)
  128. {
  129. struct reiserfs_sb_info *r = REISERFS_SB(sb);
  130. int level;
  131. seq_printf(m, "level\t"
  132. " balances"
  133. " [sbk: reads"
  134. " fs_changed"
  135. " restarted]"
  136. " free space"
  137. " items"
  138. " can_remove"
  139. " lnum"
  140. " rnum"
  141. " lbytes"
  142. " rbytes"
  143. " get_neig"
  144. " get_neig_res" " need_l_neig" " need_r_neig" "\n");
  145. for (level = 0; level < MAX_HEIGHT; ++level) {
  146. seq_printf(m, "%i\t"
  147. " %12lu"
  148. " %12lu"
  149. " %12lu"
  150. " %12lu"
  151. " %12lu"
  152. " %12lu"
  153. " %12lu"
  154. " %12li"
  155. " %12li"
  156. " %12li"
  157. " %12li"
  158. " %12lu"
  159. " %12lu"
  160. " %12lu"
  161. " %12lu"
  162. "\n",
  163. level,
  164. SFPL(balance_at),
  165. SFPL(sbk_read_at),
  166. SFPL(sbk_fs_changed),
  167. SFPL(sbk_restarted),
  168. SFPL(free_at),
  169. SFPL(items_at),
  170. SFPL(can_node_be_removed),
  171. SFPL(lnum),
  172. SFPL(rnum),
  173. SFPL(lbytes),
  174. SFPL(rbytes),
  175. SFPL(get_neighbors),
  176. SFPL(get_neighbors_restart),
  177. SFPL(need_l_neighbor), SFPL(need_r_neighbor)
  178. );
  179. }
  180. return 0;
  181. }
  182. static int show_bitmap(struct seq_file *m, struct super_block *sb)
  183. {
  184. struct reiserfs_sb_info *r = REISERFS_SB(sb);
  185. seq_printf(m, "free_block: %lu\n"
  186. " scan_bitmap:"
  187. " wait"
  188. " bmap"
  189. " retry"
  190. " stolen"
  191. " journal_hint"
  192. "journal_nohint"
  193. "\n"
  194. " %14lu"
  195. " %14lu"
  196. " %14lu"
  197. " %14lu"
  198. " %14lu"
  199. " %14lu"
  200. " %14lu"
  201. "\n",
  202. SFP(free_block),
  203. SFPF(call),
  204. SFPF(wait),
  205. SFPF(bmap),
  206. SFPF(retry),
  207. SFPF(stolen),
  208. SFPF(in_journal_hint), SFPF(in_journal_nohint));
  209. return 0;
  210. }
  211. static int show_on_disk_super(struct seq_file *m, struct super_block *sb)
  212. {
  213. struct reiserfs_sb_info *sb_info = REISERFS_SB(sb);
  214. struct reiserfs_super_block *rs = sb_info->s_rs;
  215. int hash_code = DFL(s_hash_function_code);
  216. __u32 flags = DJF(s_flags);
  217. seq_printf(m, "block_count: \t%i\n"
  218. "free_blocks: \t%i\n"
  219. "root_block: \t%i\n"
  220. "blocksize: \t%i\n"
  221. "oid_maxsize: \t%i\n"
  222. "oid_cursize: \t%i\n"
  223. "umount_state: \t%i\n"
  224. "magic: \t%10.10s\n"
  225. "fs_state: \t%i\n"
  226. "hash: \t%s\n"
  227. "tree_height: \t%i\n"
  228. "bmap_nr: \t%i\n"
  229. "version: \t%i\n"
  230. "flags: \t%x[%s]\n"
  231. "reserved_for_journal: \t%i\n",
  232. DFL(s_block_count),
  233. DFL(s_free_blocks),
  234. DFL(s_root_block),
  235. DF(s_blocksize),
  236. DF(s_oid_maxsize),
  237. DF(s_oid_cursize),
  238. DF(s_umount_state),
  239. rs->s_v1.s_magic,
  240. DF(s_fs_state),
  241. hash_code == TEA_HASH ? "tea" :
  242. (hash_code == YURA_HASH) ? "rupasov" :
  243. (hash_code == R5_HASH) ? "r5" :
  244. (hash_code == UNSET_HASH) ? "unset" : "unknown",
  245. DF(s_tree_height),
  246. DF(s_bmap_nr),
  247. DF(s_version), flags, (flags & reiserfs_attrs_cleared)
  248. ? "attrs_cleared" : "", DF(s_reserved_for_journal));
  249. return 0;
  250. }
  251. static int show_oidmap(struct seq_file *m, struct super_block *sb)
  252. {
  253. struct reiserfs_sb_info *sb_info = REISERFS_SB(sb);
  254. struct reiserfs_super_block *rs = sb_info->s_rs;
  255. unsigned int mapsize = le16_to_cpu(rs->s_v1.s_oid_cursize);
  256. unsigned long total_used = 0;
  257. int i;
  258. for (i = 0; i < mapsize; ++i) {
  259. __u32 right;
  260. right = (i == mapsize - 1) ? MAX_KEY_OBJECTID : MAP(i + 1);
  261. seq_printf(m, "%s: [ %x .. %x )\n",
  262. (i & 1) ? "free" : "used", MAP(i), right);
  263. if (!(i & 1)) {
  264. total_used += right - MAP(i);
  265. }
  266. }
  267. #if defined( REISERFS_USE_OIDMAPF )
  268. if (sb_info->oidmap.use_file && (sb_info->oidmap.mapf != NULL)) {
  269. loff_t size = sb_info->oidmap.mapf->f_dentry->d_inode->i_size;
  270. total_used += size / sizeof(reiserfs_oidinterval_d_t);
  271. }
  272. #endif
  273. seq_printf(m, "total: \t%i [%i/%i] used: %lu [exact]\n",
  274. mapsize,
  275. mapsize, le16_to_cpu(rs->s_v1.s_oid_maxsize), total_used);
  276. return 0;
  277. }
  278. static int show_journal(struct seq_file *m, struct super_block *sb)
  279. {
  280. struct reiserfs_sb_info *r = REISERFS_SB(sb);
  281. struct reiserfs_super_block *rs = r->s_rs;
  282. struct journal_params *jp = &rs->s_v1.s_journal;
  283. char b[BDEVNAME_SIZE];
  284. seq_printf(m, /* on-disk fields */
  285. "jp_journal_1st_block: \t%i\n"
  286. "jp_journal_dev: \t%s[%x]\n"
  287. "jp_journal_size: \t%i\n"
  288. "jp_journal_trans_max: \t%i\n"
  289. "jp_journal_magic: \t%i\n"
  290. "jp_journal_max_batch: \t%i\n"
  291. "jp_journal_max_commit_age: \t%i\n"
  292. "jp_journal_max_trans_age: \t%i\n"
  293. /* incore fields */
  294. "j_1st_reserved_block: \t%i\n"
  295. "j_state: \t%li\n"
  296. "j_trans_id: \t%lu\n"
  297. "j_mount_id: \t%lu\n"
  298. "j_start: \t%lu\n"
  299. "j_len: \t%lu\n"
  300. "j_len_alloc: \t%lu\n"
  301. "j_wcount: \t%i\n"
  302. "j_bcount: \t%lu\n"
  303. "j_first_unflushed_offset: \t%lu\n"
  304. "j_last_flush_trans_id: \t%lu\n"
  305. "j_trans_start_time: \t%li\n"
  306. "j_list_bitmap_index: \t%i\n"
  307. "j_must_wait: \t%i\n"
  308. "j_next_full_flush: \t%i\n"
  309. "j_next_async_flush: \t%i\n"
  310. "j_cnode_used: \t%i\n" "j_cnode_free: \t%i\n" "\n"
  311. /* reiserfs_proc_info_data_t.journal fields */
  312. "in_journal: \t%12lu\n"
  313. "in_journal_bitmap: \t%12lu\n"
  314. "in_journal_reusable: \t%12lu\n"
  315. "lock_journal: \t%12lu\n"
  316. "lock_journal_wait: \t%12lu\n"
  317. "journal_begin: \t%12lu\n"
  318. "journal_relock_writers: \t%12lu\n"
  319. "journal_relock_wcount: \t%12lu\n"
  320. "mark_dirty: \t%12lu\n"
  321. "mark_dirty_already: \t%12lu\n"
  322. "mark_dirty_notjournal: \t%12lu\n"
  323. "restore_prepared: \t%12lu\n"
  324. "prepare: \t%12lu\n"
  325. "prepare_retry: \t%12lu\n",
  326. DJP(jp_journal_1st_block),
  327. bdevname(SB_JOURNAL(sb)->j_dev_bd, b),
  328. DJP(jp_journal_dev),
  329. DJP(jp_journal_size),
  330. DJP(jp_journal_trans_max),
  331. DJP(jp_journal_magic),
  332. DJP(jp_journal_max_batch),
  333. SB_JOURNAL(sb)->j_max_commit_age,
  334. DJP(jp_journal_max_trans_age),
  335. JF(j_1st_reserved_block),
  336. JF(j_state),
  337. JF(j_trans_id),
  338. JF(j_mount_id),
  339. JF(j_start),
  340. JF(j_len),
  341. JF(j_len_alloc),
  342. atomic_read(&r->s_journal->j_wcount),
  343. JF(j_bcount),
  344. JF(j_first_unflushed_offset),
  345. JF(j_last_flush_trans_id),
  346. JF(j_trans_start_time),
  347. JF(j_list_bitmap_index),
  348. JF(j_must_wait),
  349. JF(j_next_full_flush),
  350. JF(j_next_async_flush),
  351. JF(j_cnode_used),
  352. JF(j_cnode_free),
  353. SFPJ(in_journal),
  354. SFPJ(in_journal_bitmap),
  355. SFPJ(in_journal_reusable),
  356. SFPJ(lock_journal),
  357. SFPJ(lock_journal_wait),
  358. SFPJ(journal_being),
  359. SFPJ(journal_relock_writers),
  360. SFPJ(journal_relock_wcount),
  361. SFPJ(mark_dirty),
  362. SFPJ(mark_dirty_already),
  363. SFPJ(mark_dirty_notjournal),
  364. SFPJ(restore_prepared), SFPJ(prepare), SFPJ(prepare_retry)
  365. );
  366. return 0;
  367. }
  368. /* iterator */
  369. static int test_sb(struct super_block *sb, void *data)
  370. {
  371. return data == sb;
  372. }
  373. static int set_sb(struct super_block *sb, void *data)
  374. {
  375. return -ENOENT;
  376. }
  377. static void *r_start(struct seq_file *m, loff_t * pos)
  378. {
  379. struct proc_dir_entry *de = m->private;
  380. struct super_block *s = de->parent->data;
  381. loff_t l = *pos;
  382. if (l)
  383. return NULL;
  384. if (IS_ERR(sget(&reiserfs_fs_type, test_sb, set_sb, s)))
  385. return NULL;
  386. up_write(&s->s_umount);
  387. if (de->deleted) {
  388. deactivate_super(s);
  389. return NULL;
  390. }
  391. return s;
  392. }
  393. static void *r_next(struct seq_file *m, void *v, loff_t * pos)
  394. {
  395. ++*pos;
  396. if (v)
  397. deactivate_super(v);
  398. return NULL;
  399. }
  400. static void r_stop(struct seq_file *m, void *v)
  401. {
  402. if (v)
  403. deactivate_super(v);
  404. }
  405. static int r_show(struct seq_file *m, void *v)
  406. {
  407. struct proc_dir_entry *de = m->private;
  408. int (*show) (struct seq_file *, struct super_block *) = de->data;
  409. return show(m, v);
  410. }
  411. static struct seq_operations r_ops = {
  412. .start = r_start,
  413. .next = r_next,
  414. .stop = r_stop,
  415. .show = r_show,
  416. };
  417. static int r_open(struct inode *inode, struct file *file)
  418. {
  419. int ret = seq_open(file, &r_ops);
  420. if (!ret) {
  421. struct seq_file *m = file->private_data;
  422. m->private = PDE(inode);
  423. }
  424. return ret;
  425. }
  426. static struct file_operations r_file_operations = {
  427. .open = r_open,
  428. .read = seq_read,
  429. .llseek = seq_lseek,
  430. .release = seq_release,
  431. };
  432. static struct proc_dir_entry *proc_info_root = NULL;
  433. static const char proc_info_root_name[] = "fs/reiserfs";
  434. static void add_file(struct super_block *sb, char *name,
  435. int (*func) (struct seq_file *, struct super_block *))
  436. {
  437. struct proc_dir_entry *de;
  438. de = create_proc_entry(name, 0, REISERFS_SB(sb)->procdir);
  439. if (de) {
  440. de->data = func;
  441. de->proc_fops = &r_file_operations;
  442. }
  443. }
  444. int reiserfs_proc_info_init(struct super_block *sb)
  445. {
  446. spin_lock_init(&__PINFO(sb).lock);
  447. REISERFS_SB(sb)->procdir =
  448. proc_mkdir(reiserfs_bdevname(sb), proc_info_root);
  449. if (REISERFS_SB(sb)->procdir) {
  450. REISERFS_SB(sb)->procdir->owner = THIS_MODULE;
  451. REISERFS_SB(sb)->procdir->data = sb;
  452. add_file(sb, "version", show_version);
  453. add_file(sb, "super", show_super);
  454. add_file(sb, "per-level", show_per_level);
  455. add_file(sb, "bitmap", show_bitmap);
  456. add_file(sb, "on-disk-super", show_on_disk_super);
  457. add_file(sb, "oidmap", show_oidmap);
  458. add_file(sb, "journal", show_journal);
  459. return 0;
  460. }
  461. reiserfs_warning(sb, "reiserfs: cannot create /proc/%s/%s",
  462. proc_info_root_name, reiserfs_bdevname(sb));
  463. return 1;
  464. }
  465. int reiserfs_proc_info_done(struct super_block *sb)
  466. {
  467. struct proc_dir_entry *de = REISERFS_SB(sb)->procdir;
  468. if (de) {
  469. remove_proc_entry("journal", de);
  470. remove_proc_entry("oidmap", de);
  471. remove_proc_entry("on-disk-super", de);
  472. remove_proc_entry("bitmap", de);
  473. remove_proc_entry("per-level", de);
  474. remove_proc_entry("super", de);
  475. remove_proc_entry("version", de);
  476. }
  477. spin_lock(&__PINFO(sb).lock);
  478. __PINFO(sb).exiting = 1;
  479. spin_unlock(&__PINFO(sb).lock);
  480. if (proc_info_root) {
  481. remove_proc_entry(reiserfs_bdevname(sb), proc_info_root);
  482. REISERFS_SB(sb)->procdir = NULL;
  483. }
  484. return 0;
  485. }
  486. struct proc_dir_entry *reiserfs_proc_register_global(char *name,
  487. read_proc_t * func)
  488. {
  489. return (proc_info_root) ? create_proc_read_entry(name, 0,
  490. proc_info_root,
  491. func, NULL) : NULL;
  492. }
  493. void reiserfs_proc_unregister_global(const char *name)
  494. {
  495. remove_proc_entry(name, proc_info_root);
  496. }
  497. int reiserfs_proc_info_global_init(void)
  498. {
  499. if (proc_info_root == NULL) {
  500. proc_info_root = proc_mkdir(proc_info_root_name, NULL);
  501. if (proc_info_root) {
  502. proc_info_root->owner = THIS_MODULE;
  503. } else {
  504. reiserfs_warning(NULL,
  505. "reiserfs: cannot create /proc/%s",
  506. proc_info_root_name);
  507. return 1;
  508. }
  509. }
  510. return 0;
  511. }
  512. int reiserfs_proc_info_global_done(void)
  513. {
  514. if (proc_info_root != NULL) {
  515. proc_info_root = NULL;
  516. remove_proc_entry(proc_info_root_name, NULL);
  517. }
  518. return 0;
  519. }
  520. /* REISERFS_PROC_INFO */
  521. #else
  522. int reiserfs_proc_info_init(struct super_block *sb)
  523. {
  524. return 0;
  525. }
  526. int reiserfs_proc_info_done(struct super_block *sb)
  527. {
  528. return 0;
  529. }
  530. struct proc_dir_entry *reiserfs_proc_register_global(char *name,
  531. read_proc_t * func)
  532. {
  533. return NULL;
  534. }
  535. void reiserfs_proc_unregister_global(const char *name)
  536. {;
  537. }
  538. int reiserfs_proc_info_global_init(void)
  539. {
  540. return 0;
  541. }
  542. int reiserfs_proc_info_global_done(void)
  543. {
  544. return 0;
  545. }
  546. int reiserfs_global_version_in_proc(char *buffer, char **start,
  547. off_t offset,
  548. int count, int *eof, void *data)
  549. {
  550. return 0;
  551. }
  552. /* REISERFS_PROC_INFO */
  553. #endif
  554. /*
  555. * $Log: procfs.c,v $
  556. * Revision 1.1.8.2 2001/07/15 17:08:42 god
  557. * . use get_super() in procfs.c
  558. * . remove remove_save_link() from reiserfs_do_truncate()
  559. *
  560. * I accept terms and conditions stated in the Legal Agreement
  561. * (available at http://www.namesys.com/legalese.html)
  562. *
  563. * Revision 1.1.8.1 2001/07/11 16:48:50 god
  564. * proc info support
  565. *
  566. * I accept terms and conditions stated in the Legal Agreement
  567. * (available at http://www.namesys.com/legalese.html)
  568. *
  569. */
  570. /*
  571. * Make Linus happy.
  572. * Local variables:
  573. * c-indentation-style: "K&R"
  574. * mode-name: "LC"
  575. * c-basic-offset: 8
  576. * tab-width: 8
  577. * End:
  578. */