1 /***********************************************************************
3 * This software is part of the ast package *
4 * Copyright (c) 1985-2010 AT&T Intellectual Property *
5 * and is licensed under the *
6 * Common Public License, Version 1.0 *
7 * by AT&T Intellectual Property *
9 * A copy of the License is available at *
10 * http://www.opensource.org/licenses/cpl1.0.txt *
11 * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
13 * Information and Software Systems Research *
17 * Glenn Fowler <gsf@research.att.com> *
18 * David Korn <dgk@research.att.com> *
19 * Phong Vo <kpv@research.att.com> *
21 ***********************************************************************/
24 /* Write out an unsigned long value in a portable format.
26 ** Written by Kiem-Phong Vo.
30 int _sfputm(Sfio_t
* f
, Sfulong_t v
, Sfulong_t m
)
33 Sfio_t
* f
; /* write a portable ulong to this stream */
34 Sfulong_t v
; /* the unsigned value to be written */
35 Sfulong_t m
; /* the max value of the range */
38 #define N_ARRAY (2*sizeof(Sfulong_t))
46 if(v
> m
|| (f
->mode
!= SF_WRITE
&& _sfmode(f
,SF_WRITE
,0) < 0) )
50 /* code v as integers in base SF_UBASE */
51 s
= ps
= &(c
[N_ARRAY
-1]);
52 *s
= (uchar
)SFBVALUE(v
);
53 while((m
>>= SF_BBITS
) > 0 )
55 *--s
= (uchar
)SFBVALUE(v
);
59 if(n
> 8 || SFWPEEK(f
,ps
,p
) < n
)
60 n
= SFWRITE(f
,(Void_t
*)s
,n
); /* write the hard way */
64 case 8 : *ps
++ = *s
++;
65 case 7 : *ps
++ = *s
++;
66 case 6 : *ps
++ = *s
++;
67 case 5 : *ps
++ = *s
++;
68 case 4 : *ps
++ = *s
++;
69 case 3 : *ps
++ = *s
++;
70 case 2 : *ps
++ = *s
++;
71 case 1 : *ps
++ = *s
++;
77 SFMTXRETURN(f
, (int)n
);