1da2e3ebdSchin /*********************************************************************** 2da2e3ebdSchin * * 3da2e3ebdSchin * This software is part of the ast package * 4*3e14f97fSRoger A. Faulkner * Copyright (c) 1985-2010 AT&T Intellectual Property * 5da2e3ebdSchin * and is licensed under the * 6da2e3ebdSchin * Common Public License, Version 1.0 * 77c2fbfb3SApril Chin * by AT&T Intellectual Property * 8da2e3ebdSchin * * 9da2e3ebdSchin * A copy of the License is available at * 10da2e3ebdSchin * http://www.opensource.org/licenses/cpl1.0.txt * 11da2e3ebdSchin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 12da2e3ebdSchin * * 13da2e3ebdSchin * Information and Software Systems Research * 14da2e3ebdSchin * AT&T Research * 15da2e3ebdSchin * Florham Park NJ * 16da2e3ebdSchin * * 17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> * 18da2e3ebdSchin * David Korn <dgk@research.att.com> * 19da2e3ebdSchin * Phong Vo <kpv@research.att.com> * 20da2e3ebdSchin * * 21da2e3ebdSchin ***********************************************************************/ 22da2e3ebdSchin #pragma prototyped 23da2e3ebdSchin 24da2e3ebdSchin /* 25da2e3ebdSchin * return the length of the current record at b, size n, according to f 26da2e3ebdSchin * -1 returned on error 27da2e3ebdSchin * 0 returned if more data is required 28da2e3ebdSchin */ 29da2e3ebdSchin 30da2e3ebdSchin #include <recfmt.h> 31da2e3ebdSchin #include <ctype.h> 32da2e3ebdSchin 33da2e3ebdSchin ssize_t reclen(Recfmt_t f,const void * b,size_t n)34da2e3ebdSchinreclen(Recfmt_t f, const void* b, size_t n) 35da2e3ebdSchin { 36da2e3ebdSchin register unsigned char* s = (unsigned char*)b; 37da2e3ebdSchin register unsigned char* e; 38da2e3ebdSchin size_t h; 39da2e3ebdSchin size_t z; 40da2e3ebdSchin 41da2e3ebdSchin switch (RECTYPE(f)) 42da2e3ebdSchin { 43da2e3ebdSchin case REC_delimited: 44da2e3ebdSchin if (e = (unsigned char*)memchr(s, REC_D_DELIMITER(f), n)) 45da2e3ebdSchin return e - s + 1; 46da2e3ebdSchin return 0; 47da2e3ebdSchin case REC_fixed: 48da2e3ebdSchin return REC_F_SIZE(f); 49da2e3ebdSchin case REC_variable: 50da2e3ebdSchin h = REC_V_HEADER(f); 51da2e3ebdSchin if (n < h) 52da2e3ebdSchin return 0; 53da2e3ebdSchin z = 0; 54da2e3ebdSchin s += REC_V_OFFSET(f); 55da2e3ebdSchin e = s + REC_V_LENGTH(f); 56da2e3ebdSchin if (REC_V_LITTLE(f)) 57da2e3ebdSchin while (e > s) 58da2e3ebdSchin z = (z<<8)|*--e; 59da2e3ebdSchin else 60da2e3ebdSchin while (s < e) 61da2e3ebdSchin z = (z<<8)|*s++; 62da2e3ebdSchin if (!REC_V_INCLUSIVE(f)) 63da2e3ebdSchin z += h; 64da2e3ebdSchin else if (z < h) 65da2e3ebdSchin z = h; 66da2e3ebdSchin return z; 67da2e3ebdSchin case REC_method: 68da2e3ebdSchin return -1; 69da2e3ebdSchin } 70da2e3ebdSchin return -1; 71da2e3ebdSchin } 72