1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin * *
3da2e3ebdSchin * This software is part of the ast package *
43e14f97fSRoger 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 #include "sfhdr.h"
23da2e3ebdSchin
24da2e3ebdSchin /* Write out a long value in a portable format
25da2e3ebdSchin **
26da2e3ebdSchin ** Written by Kiem-Phong Vo.
27da2e3ebdSchin */
28da2e3ebdSchin
29da2e3ebdSchin #if __STD_C
_sfputl(Sfio_t * f,Sflong_t v)307c2fbfb3SApril Chin int _sfputl(Sfio_t* f, Sflong_t v)
31da2e3ebdSchin #else
32da2e3ebdSchin int _sfputl(f,v)
337c2fbfb3SApril Chin Sfio_t* f; /* write a portable long to this stream */
34da2e3ebdSchin Sflong_t v; /* the value to be written */
35da2e3ebdSchin #endif
36da2e3ebdSchin {
37da2e3ebdSchin #define N_ARRAY (2*sizeof(Sflong_t))
38da2e3ebdSchin reg uchar *s, *ps;
39da2e3ebdSchin reg ssize_t n, p;
40da2e3ebdSchin uchar c[N_ARRAY];
417c2fbfb3SApril Chin SFMTXDECL(f);
42da2e3ebdSchin
437c2fbfb3SApril Chin SFMTXENTER(f,-1);
44da2e3ebdSchin if(f->mode != SF_WRITE && _sfmode(f,SF_WRITE,0) < 0)
45da2e3ebdSchin SFMTXRETURN(f, -1);
46da2e3ebdSchin SFLOCK(f,0);
47da2e3ebdSchin
48da2e3ebdSchin s = ps = &(c[N_ARRAY-1]);
49da2e3ebdSchin if(v < 0)
50da2e3ebdSchin { /* add 1 to avoid 2-complement problems with -SF_MAXINT */
51da2e3ebdSchin v = -(v+1);
52da2e3ebdSchin *s = (uchar)(SFSVALUE(v) | SF_SIGN);
53da2e3ebdSchin }
54da2e3ebdSchin else *s = (uchar)(SFSVALUE(v));
55da2e3ebdSchin v = (Sfulong_t)v >> SF_SBITS;
56da2e3ebdSchin
57da2e3ebdSchin while(v > 0)
58da2e3ebdSchin { *--s = (uchar)(SFUVALUE(v) | SF_MORE);
59da2e3ebdSchin v = (Sfulong_t)v >> SF_UBITS;
60da2e3ebdSchin }
61da2e3ebdSchin n = (ps-s)+1;
62da2e3ebdSchin
63da2e3ebdSchin if(n > 8 || SFWPEEK(f,ps,p) < n)
64da2e3ebdSchin n = SFWRITE(f,(Void_t*)s,n); /* write the hard way */
65da2e3ebdSchin else
66da2e3ebdSchin { switch(n)
67da2e3ebdSchin {
68da2e3ebdSchin case 8 : *ps++ = *s++;
69*f592a640SToomas Soome case 7 : *ps++ = *s++;
70da2e3ebdSchin case 6 : *ps++ = *s++;
71*f592a640SToomas Soome case 5 : *ps++ = *s++;
72da2e3ebdSchin case 4 : *ps++ = *s++;
73*f592a640SToomas Soome case 3 : *ps++ = *s++;
74da2e3ebdSchin case 2 : *ps++ = *s++;
75*f592a640SToomas Soome case 1 : *ps++ = *s++;
76da2e3ebdSchin }
77*f592a640SToomas Soome f->next = ps;
78da2e3ebdSchin }
79*f592a640SToomas Soome
80da2e3ebdSchin SFOPEN(f,0);
81*f592a640SToomas Soome SFMTXRETURN(f, n);
82da2e3ebdSchin }
83da2e3ebdSchin