7 - n, " ",
(int) (7 - n), " ",
generate_call_graph (struct profdata *profdata){  size_t cnt;  puts ("\nindex % time    self  children    called     name\n");  for (cnt = 0; cnt < symidx; ++cnt)    if (sortsym[cnt]->froms != NULL || sortsym[cnt]->tos != NULL)      {	struct arc_list *runp;	size_t n;	/* First print the from-information.  */	runp = sortsym[cnt]->froms;	while (runp != NULL)	  {	    printf ("            %8.2f%8.2f%9" PRIdMAX "/%-9" PRIdMAX "   %s",		    (runp->idx != (size_t) -1l		     ? sortsym[runp->idx]->ticks * tick_unit : 0.0),		    0.0, /* FIXME: what's time for the children, recursive */		    runp->count, sortsym[cnt]->calls,		    (runp->idx != (size_t) -1l ?		     sortsym[runp->idx]->name : "<UNKNOWN>"));	    if (runp->idx != (size_t) -1l)	      printf (" [%Zd]", runp->idx);	    putchar_unlocked ('\n');	    runp = runp->next;	  }	/* Info abount the function itself.  */	n = printf ("[%Zu]", cnt);	printf ("%*s%5.1f%8.2f%8.2f%9" PRIdMAX "         %s [%Zd]\n",		7 - n, " ",		total_ticks ? (100.0 * sortsym[cnt]->ticks) / total_ticks : 0,		sortsym[cnt]->ticks * tick_unit,		0.0, /* FIXME: what's time for the children, recursive */		sortsym[cnt]->calls,		sortsym[cnt]->name, cnt);	/* Info about the functions this function calls.  */	runp = sortsym[cnt]->tos;	while (runp != NULL)	  {	    printf ("            %8.2f%8.2f%9" PRIdMAX "/",		    (runp->idx != (size_t) -1l		     ? sortsym[runp->idx]->ticks * tick_unit : 0.0),		    0.0, /* FIXME: what's time for the children, recursive */		    runp->count);	    if (runp->idx != (size_t) -1l)	      printf ("%-9" PRIdMAX "   %s [%Zd]\n",		      sortsym[runp->idx]->calls,		      sortsym[runp->idx]->name,		      runp->idx);	    else	      fputs ("???         <UNKNOWN>\n\n", stdout);	    runp = runp->next;	  }	fputs ("-----------------------------------------------\n", stdout);      }}