Bottleneck, and my 31 character limit. Ideas?

Code:
$ diff permute.c permutepatch.c

38a39,128

> void conv (char *line_buf, int line_len, int *map)

> {

>   static const char grp_pos[] = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };

> 

>   int A_sav = 0;

>   int B_sav = 0;

>   int C_sav = 0;

> 

>   int i;

>   int p;

> 

>   for (i = 0, p = 0; i < line_len; i++, p += 2)

>   {

>     if (line_buf[i] == 'A')

>     {

>       A_sav = p;

> 

>       p++;

>     }

>     else if (line_buf[i] == 'B')

>     {

>       B_sav = p;

> 

>       p++;

>     }

>     else if (line_buf[i] == 'C')

>     {

>       C_sav = p;

> 

>       p++;

>     }

>   }

> 

>   int key = (A_sav <<  0)

>           + (B_sav <<  8)

>           + (C_sav << 16);

> 

>   if (map[key] == 1) return;

> 

>   map[key] = 1;

> 

>   if (A_sav < B_sav && A_sav < C_sav)

>   {

>     printf ("i%c1 i%c0 i%c- ", grp_pos[A_sav + 0], grp_pos[A_sav + 1], grp_pos[A_sav + 2]);

> 

>     if (B_sav < C_sav)

>     {

>       printf ("i%c1 i%c1 i%c- ", grp_pos[B_sav + 0], grp_pos[B_sav + 1], grp_pos[B_sav + 2]);

>       printf ("i%c1 i%c2 i%c- ", grp_pos[C_sav + 0], grp_pos[C_sav + 1], grp_pos[C_sav + 2]);

>     }

>     else

>     {

>       printf ("i%c1 i%c2 i%c- ", grp_pos[C_sav + 0], grp_pos[C_sav + 1], grp_pos[C_sav + 2]);

>       printf ("i%c1 i%c1 i%c- ", grp_pos[B_sav + 0], grp_pos[B_sav + 1], grp_pos[B_sav + 2]);

>     }

>   }

>   else if (B_sav < A_sav && B_sav < C_sav)

>   {

>     printf ("i%c1 i%c1 i%c- ", grp_pos[B_sav + 0], grp_pos[B_sav + 1], grp_pos[B_sav + 2]);

> 

>     if (A_sav < C_sav)

>     {

>       printf ("i%c1 i%c0 i%c- ", grp_pos[A_sav + 0], grp_pos[A_sav + 1], grp_pos[A_sav + 2]);

>       printf ("i%c1 i%c2 i%c- ", grp_pos[C_sav + 0], grp_pos[C_sav + 1], grp_pos[C_sav + 2]);

>     }

>     else

>     {

>       printf ("i%c1 i%c2 i%c- ", grp_pos[C_sav + 0], grp_pos[C_sav + 1], grp_pos[C_sav + 2]);

>       printf ("i%c1 i%c0 i%c- ", grp_pos[A_sav + 0], grp_pos[A_sav + 1], grp_pos[A_sav + 2]);

>     }

>   }

>   else if (C_sav < A_sav && C_sav < B_sav)

>   {

>     printf ("i%c1 i%c2 i%c- ", grp_pos[C_sav + 0], grp_pos[C_sav + 1], grp_pos[C_sav + 2]);

> 

>     if (A_sav < B_sav)

>     {

>       printf ("i%c1 i%c0 i%c- ", grp_pos[A_sav + 0], grp_pos[A_sav + 1], grp_pos[A_sav + 2]);

>       printf ("i%c1 i%c1 i%c- ", grp_pos[B_sav + 0], grp_pos[B_sav + 1], grp_pos[B_sav + 2]);

>     }

>     else

>     {

>       printf ("i%c1 i%c1 i%c- ", grp_pos[B_sav + 0], grp_pos[B_sav + 1], grp_pos[B_sav + 2]);

>       printf ("i%c1 i%c0 i%c- ", grp_pos[A_sav + 0], grp_pos[A_sav + 1], grp_pos[A_sav + 2]);

>     }

>   }

> 

>   printf (" ] ^[ $]\n");

> }

> 

51a142,143

>   int *map = (int *) calloc (256 * 256 * 256, sizeof (int));

> 

72c164

<     puts (line_buf);

---

>     conv (line_buf, line_len, map);

74c166

<     while ((k = next_permutation (line_buf, p, k)) != line_len) puts (line_buf);

---

>     while ((k = next_permutation (line_buf, p, k)) != line_len) conv (line_buf, line_len, map);

76c168

<     puts (line_buf);

---

>     conv (line_buf, line_len, map);