summaryrefslogtreecommitdiff
path: root/usr/src/lib/libast/common/misc/recstr.c
diff options
context:
space:
mode:
authorchin <none@none>2007-08-17 12:01:52 -0700
committerchin <none@none>2007-08-17 12:01:52 -0700
commitda2e3ebdc1edfbc5028edf1354e7dd2fa69a7968 (patch)
tree5280d3b78e289fe9551371ab6e7f15ef9944ea14 /usr/src/lib/libast/common/misc/recstr.c
parent073dbf9103ef2a2b05d8a16e2d26db04e0374b0e (diff)
downloadillumos-joyent-da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968.tar.gz
6437624 RFE: Add ksh93 (as /usr/bin/ksh93) and libshell.so to OS/Net
6505835 AST tools and library (libpp) required for creating l10n messages for ksh93 PSARC/2006/550 Korn Shell 93 Integration PSARC/2006/587 /etc/ksh.kshrc for ksh93 PSARC/2007/035 ksh93 Amendments Contributed by Roland Mainz <roland.mainz@nrubsig.org> --HG-- rename : usr/src/lib/libcmd/common/mapfile-vers => deleted_files/usr/src/lib/libcmd/common/mapfile-vers rename : usr/src/lib/libcmd/common/placeholder.c => deleted_files/usr/src/lib/libcmd/common/placeholder.c
Diffstat (limited to 'usr/src/lib/libast/common/misc/recstr.c')
-rw-r--r--usr/src/lib/libast/common/misc/recstr.c203
1 files changed, 203 insertions, 0 deletions
diff --git a/usr/src/lib/libast/common/misc/recstr.c b/usr/src/lib/libast/common/misc/recstr.c
new file mode 100644
index 0000000000..1d0c823b91
--- /dev/null
+++ b/usr/src/lib/libast/common/misc/recstr.c
@@ -0,0 +1,203 @@
+/***********************************************************************
+* *
+* This software is part of the ast package *
+* Copyright (c) 1985-2007 AT&T Knowledge Ventures *
+* and is licensed under the *
+* Common Public License, Version 1.0 *
+* by AT&T Knowledge Ventures *
+* *
+* A copy of the License is available at *
+* http://www.opensource.org/licenses/cpl1.0.txt *
+* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
+* *
+* Information and Software Systems Research *
+* AT&T Research *
+* Florham Park NJ *
+* *
+* Glenn Fowler <gsf@research.att.com> *
+* David Korn <dgk@research.att.com> *
+* Phong Vo <kpv@research.att.com> *
+* *
+***********************************************************************/
+#pragma prototyped
+
+/*
+ * return the record format descriptor given a format string
+ * e!=0 set to the first unrecognized char after the format
+ * REC_N_TYPE() returned on error
+ *
+ * d[0xNN|delimiter] (delimited, newline default)
+ * [f][+]size (fixed length)
+ * v hN oN zN b|l i|n (variable length with size header)
+ * h header size in bytes (ibm V 4)
+ * o size offset in bytes (ibm V 0)
+ * z size length in bytes (ibm V 2)
+ * l|b little-endian or big-endian size (ibm V b (0))
+ * i|n header included/not-included in size (ibm V i (1))
+ */
+
+#include <recfmt.h>
+#include <ctype.h>
+
+Recfmt_t
+recstr(register const char* s, char** e)
+{
+ char* t;
+ int n;
+ long v;
+ int a[6];
+
+ while (*s == ' ' || *s == '\t' || *s == ',')
+ s++;
+ switch (*s)
+ {
+ case 'd':
+ case 'D':
+ if (!*s)
+ n = '\n';
+ else
+ {
+ if (*s == '0' && (*(s + 1) == 'x' || *(s + 1) == 'X'))
+ n = (int)strtol(s, &t, 0);
+ else
+ n = chresc(s, &t);
+ s = (const char*)t;
+ }
+ if (e)
+ *e = (char*)s;
+ return REC_D_TYPE(n);
+ case 'f':
+ case 'F':
+ while (*++s == ' ' || *s == '\t' || *s == ',');
+ /*FALLTHROUGH*/
+ case '+':
+ case '0': case '1': case '2': case '3': case '4':
+ case '5': case '6': case '7': case '8': case '9':
+ n = strton(s, &t, NiL, 0);
+ if (n > 0 && t > (char*)s)
+ {
+ if (e)
+ *e = t;
+ return REC_F_TYPE(n);
+ }
+ break;
+ case 'm':
+ case 'M':
+ while (*++s == ' ' || *s == '\t' || *s == ',');
+ for (t = (char*)s; *t && *t != ' ' && *t != '\t' && *t != ','; t++);
+ if ((t - s) == 4)
+ {
+ if (strneq(s, "data", 4))
+ {
+ if (e)
+ *e = t;
+ return REC_M_TYPE(REC_M_data);
+ }
+ else if (strneq(s, "path", 4))
+ {
+ if (e)
+ *e = t;
+ return REC_M_TYPE(REC_M_path);
+ }
+ }
+
+ /*
+ * TBD: look up name in method libraries
+ * and assign an integer index
+ */
+
+ break;
+ case 'u':
+ case 'U':
+ while (*++s == ' ' || *s == '\t' || *s == ',');
+ n = strtol(s, &t, 0);
+ if (n < 0 || n > 15 || *t++ != '.')
+ break;
+ v = strtol(t, &t, 0);
+ if (*t)
+ break;
+ if (e)
+ *e = t;
+ return REC_U_TYPE(n, v);
+ case 'v':
+ case 'V':
+ a[0] = 0;
+ a[1] = 4;
+ a[2] = 0;
+ a[3] = 2;
+ a[4] = 0;
+ a[5] = 1;
+ n = 0;
+ for (;;)
+ {
+ switch (*++s)
+ {
+ case 0:
+ break;
+ case 'm':
+ case 'M':
+ n = 0;
+ continue;
+ case 'h':
+ case 'H':
+ n = 1;
+ continue;
+ case 'o':
+ case 'O':
+ n = 2;
+ continue;
+ case 'z':
+ case 'Z':
+ n = 3;
+ continue;
+ case 'b':
+ case 'B':
+ n = 4;
+ a[n++] = 0;
+ continue;
+ case 'l':
+ case 'L':
+ n = 4;
+ a[n++] = 1;
+ continue;
+ case 'n':
+ case 'N':
+ n = 0;
+ a[5] = 0;
+ continue;
+ case 'i':
+ case 'I':
+ n = 0;
+ a[5] = 1;
+ continue;
+ case ' ':
+ case '\t':
+ case ',':
+ case '-':
+ case '+':
+ continue;
+ case '0': case '1': case '2': case '3': case '4':
+ case '5': case '6': case '7': case '8': case '9':
+ a[n++] = strtol(s, &t, 0);
+ s = (const char*)t - 1;
+ continue;
+ }
+ break;
+ }
+ if (e)
+ *e = (char*)s;
+ return REC_V_RECORD(REC_V_TYPE(a[1], a[2], a[3], a[4], a[5]), a[0]);
+ case '%':
+ if (e)
+ *e = (char*)s + 1;
+ return REC_M_TYPE(REC_M_path);
+ case '-':
+ case '?':
+ if (e)
+ *e = (char*)s + 1;
+ return REC_M_TYPE(REC_M_data);
+ }
+ if (e)
+ *e = (char*)s;
+ return REC_N_TYPE();
+}