void print_block(struct buffer_head *bh, ...) //int print_mode, int first, int last)
{
va_list args;
int mode, first, last;
if (!bh) {
printk("print_block: buffer is NULL\n");
return;
}
va_start(args, bh);
mode = va_arg(args, int);
first = va_arg(args, int);
last = va_arg(args, int);
if (print_leaf(bh, mode, first, last))
if (print_internal(bh, first, last))
if (print_super_block(bh))
if (print_desc_block(bh))
printk
("Block %llu contains unformatted data\n",
(unsigned long long)bh->b_blocknr);
va_end(args);
}
int main(int argc, char *argv[])
{
int n=0;
int i=0;
int val=0;
tnode *root=NULL;
int a=10, b=10;
swap(&a, &b);
printf("a(%d) b(%d)",a,b);
#if HARDCODED
n=10;
int a[10] = {15, 41, 6, 87, 9, 99, 150, 1, 75, 66 };
for(i=0;i<n;i++) {
val=a[i];
printf("Inserting %d to Tree...\n",val);
root=insert_tnode(root, val);
}
#else
scanf("%d", &n);
printf ("Reading %d integers",n);
for(i=0;i<n;i++) {
scanf("%d", &val);
printf("Inserting %d to Tree...\n",val);
root=insert_tnode(root, val);
}
#endif
printf("Inorder Tree...\n");
print_inorder(root);
printf("PreOrder Tree...\n");
print_preorder(root);
printf("PostOrder Tree...\n");
print_postorder(root);
printf("Leafs of the Tree...\n");
print_leaf(root);
printf("Program Exited Normally....\n");
}
