procfs.c 16 KB

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