2 Copyright (c) 2004 The Regents of the University of Michigan.
5 Redistribution and use in source and binary forms, with or without
6 modification, are permitted provided that the following conditions
9 1. Redistributions of source code must retain the above copyright
10 notice, this list of conditions and the following disclaimer.
11 2. Redistributions in binary form must reproduce the above copyright
12 notice, this list of conditions and the following disclaimer in the
13 documentation and/or other materials provided with the distribution.
14 3. Neither the name of the University nor the names of its
15 contributors may be used to endorse or promote products derived
16 from this software without specific prior written permission.
18 THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED
19 WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
20 MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
21 DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
25 BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
26 LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
27 NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
28 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 * support/nfs/cacheio.c
33 * support IO on the cache channel files in 2.5 and beyond.
34 * These use 'qwords' which are like words, but with a little quoting.
40 * Support routines for text-based upcalls.
41 * Fields are separated by spaces.
42 * Fields are either mangled to quote space tab newline slosh with slosh
43 * or a hexified with a leading \x
44 * Record is terminated with newline.
52 #include <sys/types.h>
59 #include <libcfs/util/string.h>
62 void qword_add(char **bpp, int *lp, const char *str)
70 while ((c=*str++) && len)
78 *bp++ = '0' + ((c & 0300)>>6);
79 *bp++ = '0' + ((c & 0070)>>3);
80 *bp++ = '0' + ((c & 0007)>>0);
88 if (c || len <1) len = -1;
97 void qword_addhex(char **bpp, int *lp, char *buf, int blen)
108 while (blen && len >= 2) {
109 unsigned char c = *buf++;
110 *bp++ = '0' + ((c&0xf0)>>4) + (c>=0xa0)*('a'-'9'-1);
111 *bp++ = '0' + (c&0x0f) + ((c&0x0f)>=0x0a)*('a'-'9'-1);
116 if (blen || len<1) len = -1;
125 void qword_addint(char **bpp, int *lp, int n)
129 len = scnprintf(*bpp, *lp, "%d ", n);
134 void qword_adduint(char **bpp, int *lp, unsigned int n)
138 len = scnprintf(*bpp, *lp, "%u ", n);
143 void qword_addeol(char **bpp, int *lp)
152 static char qword_buf[8192];
153 static char tmp_buf[8192];
154 int qword_print(FILE *f, const char *str)
156 char *bp = qword_buf;
157 int len = sizeof(qword_buf);
160 qword_add(&bp, &len, str);
161 sret = fwrite(qword_buf, bp-qword_buf, 1, f);
163 memcpy(tmp_buf, qword_buf, bp-qword_buf);
164 tmp_buf[bp-qword_buf] = '\0';
165 printerr(2, "%s", tmp_buf);
170 int qword_printhex(FILE *f, char *str, int slen)
172 char *bp = qword_buf;
173 int len = sizeof(qword_buf);
176 qword_addhex(&bp, &len, str, slen);
177 sret = fwrite(qword_buf, bp-qword_buf, 1, f);
179 memcpy(tmp_buf, qword_buf, bp-qword_buf);
180 tmp_buf[bp-qword_buf] = '\0';
181 printerr(2, "%s", tmp_buf);
186 void qword_printint(FILE *f, int num)
188 fprintf(f, "%d ", num);
189 printerr(2, "%d ", num);
192 int qword_eol(FILE *f)
203 #define isodigit(c) (isdigit(c) && c <= '7')
204 int qword_get(char **bpp, char *dest, int bufsize)
206 /* return bytes copied, or -1 on error */
210 while (*bp == ' ') bp++;
212 if (bp[0] == '\\' && bp[1] == 'x') {
215 while (isxdigit(bp[0]) && isxdigit(bp[1]) && len < bufsize) {
216 int byte = isdigit(*bp) ? *bp-'0' : toupper(*bp)-'A'+10;
219 byte |= isdigit(*bp) ? *bp-'0' : toupper(*bp)-'A'+10;
225 /* text with \nnn octal quoting */
226 while (*bp != ' ' && *bp != '\n' && *bp && len < bufsize-1) {
228 isodigit(bp[1]) && (bp[1] <= '3') &&
231 int byte = (*++bp -'0');
233 byte = (byte << 3) | (*bp++ - '0');
234 byte = (byte << 3) | (*bp++ - '0');
244 if (*bp != ' ' && *bp != '\n' && *bp != '\0')
246 while (*bp == ' ') bp++;
248 // why should we clear *dest???
253 int qword_get_int(char **bpp, int *anint)
258 int len = qword_get(bpp, buf, 50);
259 if (len < 0) return -1;
260 if (len ==0) return -1;
261 rv = strtol(buf, &ep, 0);
267 #define READLINE_BUFFER_INCREMENT 2048
269 int readline(int fd, char **buf, int *lenp)
271 /* read a line into *buf, which is malloced *len long
272 * realloc if needed until we find a \n
273 * nul out the \n and return
274 * 0 of eof, 1 of success
279 char *b = malloc(READLINE_BUFFER_INCREMENT);
283 *lenp = READLINE_BUFFER_INCREMENT;
285 len = read(fd, *buf, *lenp);
287 printerr(0, "readline: read error: len %d errno %d (%s)\n",
288 len, errno, strerror(errno));
291 while ((*buf)[len-1] != '\n') {
292 /* now the less common case. There was no newline,
293 * so we have to keep reading after re-alloc
297 *lenp += READLINE_BUFFER_INCREMENT;
298 new = realloc(*buf, *lenp);
302 nl = read(fd, *buf +len, *lenp - len);
304 printerr(0, "readline: read error: len %d "
305 "errno %d (%s)\n", nl, errno, strerror(errno));
311 printerr(3, "readline: read %d chars into buffer of size %d:\n%s\n",