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 #include	"sfhdr.h"
23*4887Schin 
24*4887Schin /*	Read a long value coded in a portable format.
25*4887Schin **
26*4887Schin **	Written by Kiem-Phong Vo
27*4887Schin */
28*4887Schin 
29*4887Schin #if __STD_C
30*4887Schin Sflong_t sfgetl(reg Sfio_t* f)
31*4887Schin #else
32*4887Schin Sflong_t sfgetl(f)
33*4887Schin reg Sfio_t*	f;
34*4887Schin #endif
35*4887Schin {
36*4887Schin 	Sflong_t	v;
37*4887Schin 	reg uchar	*s, *ends, c;
38*4887Schin 	reg int		p;
39*4887Schin 
40*4887Schin 	SFMTXSTART(f,(Sflong_t)(-1));
41*4887Schin 
42*4887Schin 	if(f->mode != SF_READ && _sfmode(f,SF_READ,0) < 0)
43*4887Schin 		SFMTXRETURN(f, (Sflong_t)(-1));
44*4887Schin 	SFLOCK(f,0);
45*4887Schin 
46*4887Schin 	for(v = 0;;)
47*4887Schin 	{	if(SFRPEEK(f,s,p) <= 0)
48*4887Schin 		{	f->flags |= SF_ERROR;
49*4887Schin 			v = (Sflong_t)(-1);
50*4887Schin 			goto done;
51*4887Schin 		}
52*4887Schin 		for(ends = s+p; s < ends;)
53*4887Schin 		{	c = *s++;
54*4887Schin 			if(c&SF_MORE)
55*4887Schin 				v = ((Sfulong_t)v << SF_UBITS) | SFUVALUE(c);
56*4887Schin 			else
57*4887Schin 			{	/* special translation for this byte */
58*4887Schin 				v = ((Sfulong_t)v << SF_SBITS) | SFSVALUE(c);
59*4887Schin 				f->next = s;
60*4887Schin 				v = (c&SF_SIGN) ? -v-1 : v;
61*4887Schin 				goto done;
62*4887Schin 			}
63*4887Schin 		}
64*4887Schin 		f->next = s;
65*4887Schin 	}
66*4887Schin done :
67*4887Schin 	SFOPEN(f,0);
68*4887Schin 	SFMTXRETURN(f, v);
69*4887Schin }
70