Lines Matching refs:level
65 static void print_node(SmiNode *n, u_int level);
75 pindent(u_int level)
77 if (level >= cut)
78 printf("%*s", (level - cut) * 2, "");
95 close_node(u_int n, u_int level)
98 pindent(level);
99 level--;
100 if (level >= cut)
103 return (level);
107 open_node(const SmiNode *n, u_int level, SmiNode **last)
115 level = close_node((*last)->oidlen -
116 n->oidlen, level);
123 level = close_node((*last)->oidlen - 1 - i,
124 level - 1) + 1;
127 while (level < n->oidlen - 1) {
128 if (level >= cut) {
129 n1 = smiGetNodeByOID(level + 1, n->oid);
132 pindent(level);
133 printf("(%u", n->oid[level]);
138 level++;
140 return (level);
219 print_scalar(SmiNode *n, u_int level)
227 pindent(level);
228 printf("(%u ", n->oid[level]);
243 print_notification(SmiNode *n, u_int level)
250 pindent(level);
251 printf("(%u ", n->oid[level]);
259 print_col(SmiNode *n, u_int level)
265 pindent(level);
266 printf("(%u ", n->oid[level]);
288 print_table(SmiNode *n, u_int level)
296 pindent(level);
297 printf("(%u ", n->oid[level]);
307 pindent(level + 1);
308 printf("(%u ", row->oid[level + 1]);
336 print_col(col, level + 2);
339 pindent(level + 1);
342 pindent(level);
347 print_it(SmiNode *n, u_int level)
352 print_node(n, level);
356 print_scalar(n, level);
360 print_table(n, level);
369 print_notification(n, level);
378 print_node(SmiNode *n, u_int level)
384 pindent(level);
385 printf("(%u ", n->oid[level]);
391 print_it(n, level + 1);
394 pindent(level);
510 u_int level;
560 level = 0;
570 level = open_node(n, level, &last);
571 print_it(n, level);
583 level = close_node(last->oidlen - 1, level - 1);