da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/***********************************************************************
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* This software is part of the ast package *
3e14f97f673e8a630f076077de35afdd43dc1587Roger A. Faulkner* Copyright (c) 1985-2010 AT&T Intellectual Property *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* and is licensed under the *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Common Public License, Version 1.0 *
7c2fbfb345896881c631598ee3852ce9ce33fb07April Chin* by AT&T Intellectual Property *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* A copy of the License is available at *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* http://www.opensource.org/licenses/cpl1.0.txt *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Information and Software Systems Research *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* AT&T Research *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Florham Park NJ *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Glenn Fowler <gsf@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* David Korn <dgk@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* Phong Vo <kpv@research.att.com> *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin* *
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin***********************************************************************/
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#pragma prototyped
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin/*
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * return the length of the current record at b, size n, according to f
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * -1 returned on error
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin * 0 returned if more data is required
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin */
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#include <recfmt.h>
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin#include <ctype.h>
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chinssize_t
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chinreclen(Recfmt_t f, const void* b, size_t n)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin{
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin register unsigned char* s = (unsigned char*)b;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin register unsigned char* e;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin size_t h;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin size_t z;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin switch (RECTYPE(f))
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin {
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin case REC_delimited:
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if (e = (unsigned char*)memchr(s, REC_D_DELIMITER(f), n))
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin return e - s + 1;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin return 0;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin case REC_fixed:
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin return REC_F_SIZE(f);
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin case REC_variable:
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin h = REC_V_HEADER(f);
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if (n < h)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin return 0;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin z = 0;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin s += REC_V_OFFSET(f);
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin e = s + REC_V_LENGTH(f);
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if (REC_V_LITTLE(f))
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin while (e > s)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin z = (z<<8)|*--e;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin else
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin while (s < e)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin z = (z<<8)|*s++;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin if (!REC_V_INCLUSIVE(f))
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin z += h;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin else if (z < h)
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin z = h;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin return z;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin case REC_method:
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin return -1;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin }
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin return -1;
da2e3ebdc1edfbc5028edf1354e7dd2fa69a7968chin}