procfs.c 15 KB

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