1*4887Schin /*********************************************************************** 2*4887Schin * * 3*4887Schin * This software is part of the ast package * 4*4887Schin * Copyright (c) 1985-2007 AT&T Knowledge Ventures * 5*4887Schin * and is licensed under the * 6*4887Schin * Common Public License, Version 1.0 * 7*4887Schin * by AT&T Knowledge Ventures * 8*4887Schin * * 9*4887Schin * A copy of the License is available at * 10*4887Schin * http://www.opensource.org/licenses/cpl1.0.txt * 11*4887Schin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 12*4887Schin * * 13*4887Schin * Information and Software Systems Research * 14*4887Schin * AT&T Research * 15*4887Schin * Florham Park NJ * 16*4887Schin * * 17*4887Schin * Glenn Fowler <gsf@research.att.com> * 18*4887Schin * David Korn <dgk@research.att.com> * 19*4887Schin * Phong Vo <kpv@research.att.com> * 20*4887Schin * * 21*4887Schin ***********************************************************************/ 22*4887Schin #pragma prototyped 23*4887Schin 24*4887Schin /* 25*4887Schin * return the record format string given a format descriptor 26*4887Schin */ 27*4887Schin 28*4887Schin #include <recfmt.h> 29*4887Schin #include <ctype.h> 30*4887Schin 31*4887Schin char* 32*4887Schin fmtrec(Recfmt_t f, int fs) 33*4887Schin { 34*4887Schin char* b; 35*4887Schin char* e; 36*4887Schin char* s; 37*4887Schin long n; 38*4887Schin char del[2]; 39*4887Schin 40*4887Schin b = s = fmtbuf(n = 32); 41*4887Schin e = b + n; 42*4887Schin switch (RECTYPE(f)) 43*4887Schin { 44*4887Schin case REC_delimited: 45*4887Schin *s++ = 'd'; 46*4887Schin if ((del[0] = REC_D_DELIMITER(f)) != '\n') 47*4887Schin { 48*4887Schin del[1] = 0; 49*4887Schin if (fs) 50*4887Schin sfsprintf(s, e - s, "0x%02x", *(unsigned char*)del); 51*4887Schin else 52*4887Schin sfsprintf(s, e - s, "%s", fmtquote(del, NiL, NiL, 1, 0)); 53*4887Schin } 54*4887Schin else 55*4887Schin *s = 0; 56*4887Schin break; 57*4887Schin case REC_fixed: 58*4887Schin if (!fs) 59*4887Schin *s++ = 'f'; 60*4887Schin sfsprintf(s, e - s, "%lu", REC_F_SIZE(f)); 61*4887Schin break; 62*4887Schin case REC_variable: 63*4887Schin *s++ = 'v'; 64*4887Schin if (n = REC_V_SIZE(f)) 65*4887Schin s += sfsprintf(s, e - s, "%lu", n); 66*4887Schin if (REC_V_HEADER(f) != 4) 67*4887Schin s += sfsprintf(s, e - s, "h%u", REC_V_HEADER(f)); 68*4887Schin if (REC_V_OFFSET(f) != 0) 69*4887Schin s += sfsprintf(s, e - s, "o%u", REC_V_OFFSET(f)); 70*4887Schin if (REC_V_LENGTH(f) != 2) 71*4887Schin s += sfsprintf(s, e - s, "z%u", REC_V_LENGTH(f)); 72*4887Schin if (REC_V_LITTLE(f) != 0) 73*4887Schin *s++ = 'l'; 74*4887Schin if (REC_V_INCLUSIVE(f) == 0) 75*4887Schin *s++ = 'n'; 76*4887Schin *s = 0; 77*4887Schin break; 78*4887Schin case REC_method: 79*4887Schin *s++ = 'm'; 80*4887Schin switch (n = REC_M_INDEX(f)) 81*4887Schin { 82*4887Schin case REC_M_data: 83*4887Schin sfsprintf(s, e - s, "data"); 84*4887Schin break; 85*4887Schin case REC_M_path: 86*4887Schin sfsprintf(s, e - s, "path"); 87*4887Schin break; 88*4887Schin default: 89*4887Schin sfsprintf(s, e - s, "%lu", n); 90*4887Schin break; 91*4887Schin } 92*4887Schin break; 93*4887Schin case REC_none: 94*4887Schin *s++ = 'n'; 95*4887Schin *s = 0; 96*4887Schin break; 97*4887Schin default: 98*4887Schin sfsprintf(s, e - s, "u%u.0x%07x", RECTYPE(f), REC_U_ATTRIBUTES(f)); 99*4887Schin break; 100*4887Schin } 101*4887Schin return b; 102*4887Schin } 103