• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /* debugfs/extent_cmds.c - automatically generated from debugfs/extent_cmds.ct */
2 #include <ss/ss.h>
3 
4 static char const * const ssu00001[] = {
5 "current_node",
6     "current",
7     (char const *)0
8 };
9 extern void do_current_node __SS_PROTO;
10 static char const * const ssu00002[] = {
11 "root_node",
12     "root",
13     (char const *)0
14 };
15 extern void do_root_node __SS_PROTO;
16 static char const * const ssu00003[] = {
17 "last_leaf",
18     (char const *)0
19 };
20 extern void do_last_leaf __SS_PROTO;
21 static char const * const ssu00004[] = {
22 "first_sibling",
23     "first_sib",
24     (char const *)0
25 };
26 extern void do_first_sib __SS_PROTO;
27 static char const * const ssu00005[] = {
28 "last_sibling",
29     "last_sib",
30     (char const *)0
31 };
32 extern void do_last_sib __SS_PROTO;
33 static char const * const ssu00006[] = {
34 "next_sibling",
35     "next_sib",
36     "ns",
37     (char const *)0
38 };
39 extern void do_next_sib __SS_PROTO;
40 static char const * const ssu00007[] = {
41 "prev_sibling",
42     "prev_sib",
43     "ps",
44     (char const *)0
45 };
46 extern void do_prev_sib __SS_PROTO;
47 static char const * const ssu00008[] = {
48 "next_leaf",
49     "nl",
50     (char const *)0
51 };
52 extern void do_next_leaf __SS_PROTO;
53 static char const * const ssu00009[] = {
54 "prev_leaf",
55     "pl",
56     (char const *)0
57 };
58 extern void do_prev_leaf __SS_PROTO;
59 static char const * const ssu00010[] = {
60 "next",
61     "n",
62     (char const *)0
63 };
64 extern void do_next __SS_PROTO;
65 static char const * const ssu00011[] = {
66 "previous",
67     "prev",
68     "p",
69     (char const *)0
70 };
71 extern void do_prev __SS_PROTO;
72 static char const * const ssu00012[] = {
73 "up_node",
74     "up",
75     "u",
76     (char const *)0
77 };
78 extern void do_up __SS_PROTO;
79 static char const * const ssu00013[] = {
80 "down_node",
81     "down",
82     "d",
83     (char const *)0
84 };
85 extern void do_down __SS_PROTO;
86 static char const * const ssu00014[] = {
87 "delete_node",
88     "delete",
89     (char const *)0
90 };
91 extern void do_delete_node __SS_PROTO;
92 static char const * const ssu00015[] = {
93 "insert_node",
94     "insert",
95     (char const *)0
96 };
97 extern void do_insert_node __SS_PROTO;
98 static char const * const ssu00016[] = {
99 "split_node",
100     "split",
101     (char const *)0
102 };
103 extern void do_split_node __SS_PROTO;
104 static char const * const ssu00017[] = {
105 "fix_parents",
106     "fixp",
107     (char const *)0
108 };
109 extern void do_fix_parents __SS_PROTO;
110 static char const * const ssu00018[] = {
111 "set_bmap",
112     (char const *)0
113 };
114 extern void do_set_bmap __SS_PROTO;
115 static char const * const ssu00019[] = {
116 "replace_node",
117     "replace",
118     (char const *)0
119 };
120 extern void do_replace_node __SS_PROTO;
121 static char const * const ssu00020[] = {
122 "print_all",
123     "all",
124     (char const *)0
125 };
126 extern void do_print_all __SS_PROTO;
127 static char const * const ssu00021[] = {
128 "goto_block",
129     "goto",
130     (char const *)0
131 };
132 extern void do_goto_block __SS_PROTO;
133 static char const * const ssu00022[] = {
134 "info",
135     (char const *)0
136 };
137 extern void do_info __SS_PROTO;
138 static char const * const ssu00023[] = {
139 "extent_close",
140     "ec",
141     (char const *)0
142 };
143 extern void do_extent_close __SS_PROTO;
144 static ss_request_entry ssu00024[] = {
145     { ssu00001,
146       do_current_node,
147       "Current extent node",
148       0 },
149     { ssu00002,
150       do_root_node,
151       "Goto root extent",
152       0 },
153     { ssu00003,
154       do_last_leaf,
155       "Goto last leaf",
156       0 },
157     { ssu00004,
158       do_first_sib,
159       "Goto first sibling",
160       0 },
161     { ssu00005,
162       do_last_sib,
163       "Goto last sibling",
164       0 },
165     { ssu00006,
166       do_next_sib,
167       "Goto next sibling",
168       0 },
169     { ssu00007,
170       do_prev_sib,
171       "Goto previous sibling",
172       0 },
173     { ssu00008,
174       do_next_leaf,
175       "Goto next leaf",
176       0 },
177     { ssu00009,
178       do_prev_leaf,
179       "Goto previous leaf",
180       0 },
181     { ssu00010,
182       do_next,
183       "Goto next node",
184       0 },
185     { ssu00011,
186       do_prev,
187       "Goto previous node",
188       0 },
189     { ssu00012,
190       do_up,
191       "Up node",
192       0 },
193     { ssu00013,
194       do_down,
195       "Down node",
196       0 },
197     { ssu00014,
198       do_delete_node,
199       "Delete node",
200       0 },
201     { ssu00015,
202       do_insert_node,
203       "Insert node",
204       0 },
205     { ssu00016,
206       do_split_node,
207       "Split node",
208       0 },
209     { ssu00017,
210       do_fix_parents,
211       "Fix parents",
212       0 },
213     { ssu00018,
214       do_set_bmap,
215       "Set block mapping",
216       0 },
217     { ssu00019,
218       do_replace_node,
219       "Insert node",
220       0 },
221     { ssu00020,
222       do_print_all,
223       "Iterate over all nodes and print them",
224       0 },
225     { ssu00021,
226       do_goto_block,
227       "Goto extent containing specified block",
228       0 },
229     { ssu00022,
230       do_info,
231       "Print extent info",
232       0 },
233     { ssu00023,
234       do_extent_close,
235       "Close extent handle",
236       0 },
237     { 0, 0, 0, 0 }
238 };
239 
240 ss_request_table extent_cmds = { 2, ssu00024 };
241