Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
att
GitHub Repository: att/ast
 Path: blob/master/src/lib/libast/sfio/_sfputl.c
1810 views
1
/***********************************************************************

2
*                                                                      *

3
*               This software is part of the ast package               *

4
*          Copyright (c) 1985-2011 AT&T Intellectual Property          *

5
*                      and is licensed under the                       *

6
*                 Eclipse Public License, Version 1.0                  *

7
*                    by AT&T Intellectual Property                     *

8
*                                                                      *

9
*                A copy of the License is available at                 *

10
*          http://www.eclipse.org/org/documents/epl-v10.html           *

11
*         (with md5 checksum b35adb5213ca9657e911e9befb180842)         *

12
*                                                                      *

13
*              Information and Software Systems Research               *

14
*                            AT&T Research                             *

15
*                           Florham Park NJ                            *

16
*                                                                      *

17
*                 Glenn Fowler <[email protected]>                  *

18
*                  David Korn <[email protected]>                   *

19
*                   Phong Vo <[email protected]>                    *

20
*                                                                      *

21
***********************************************************************/

22
#include	"sfhdr.h"

23


24
/*	Write out a long value in a portable format

25
**

26
**	Written by Kiem-Phong Vo.

27
*/

28


29
#if __STD_C

30
int _sfputl(Sfio_t* f, Sflong_t v)

31
#else

32
int _sfputl(f,v)

33
Sfio_t*		f;	/* write a portable long to this stream */

34
Sflong_t	v;	/* the value to be written */

35
#endif

36
{

37
#define N_ARRAY		(2*sizeof(Sflong_t))

38
	reg uchar	*s, *ps;

39
	reg ssize_t	n, p;

40
	uchar		c[N_ARRAY];

41
	SFMTXDECL(f);

42


43
	SFMTXENTER(f,-1);

44
	if(f->mode != SF_WRITE && _sfmode(f,SF_WRITE,0) < 0)

45
		SFMTXRETURN(f, -1);

46
	SFLOCK(f,0);

47


48
	s = ps = &(c[N_ARRAY-1]);

49
	if(v < 0)

50
	{	/* add 1 to avoid 2-complement problems with -SF_MAXINT */

51
		v = -(v+1);

52
		*s = (uchar)(SFSVALUE(v) | SF_SIGN);

53
	}

54
	else	*s = (uchar)(SFSVALUE(v));

55
	v = (Sfulong_t)v >> SF_SBITS;

56


57
	while(v > 0)

58
	{	*--s = (uchar)(SFUVALUE(v) | SF_MORE);

59
		v = (Sfulong_t)v >> SF_UBITS;

60
	}

61
	n = (ps-s)+1;

62


63
	if(n > 8 || SFWPEEK(f,ps,p) < n)

64
		n = SFWRITE(f,(Void_t*)s,n); /* write the hard way */

65
	else

66
	{	switch(n)

67
		{

68
		case 8 : *ps++ = *s++;

69
		case 7 : *ps++ = *s++;

70
		case 6 : *ps++ = *s++;

71
		case 5 : *ps++ = *s++;

72
		case 4 : *ps++ = *s++;

73
		case 3 : *ps++ = *s++;

74
		case 2 : *ps++ = *s++;

75
		case 1 : *ps++ = *s++;

76
		}

77
		f->next = ps;

78
	}

79


80
	SFOPEN(f,0);

81
	SFMTXRETURN(f, n);

82
}

83


84