summaryrefslogtreecommitdiff
path: root/gnu/lib/libf2c/libF77/qbitbits.c
blob: ad4ac963ce20e1c487317094bf378d5e2b220a55 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include "f2c.h"

#ifndef LONGBITS
#define LONGBITS 32
#endif

#ifndef LONG8BITS
#define LONG8BITS (2*LONGBITS)
#endif

 integer
#ifdef KR_headers
qbit_bits(a, b, len) longint a; integer b, len;
#else
qbit_bits(longint a, integer b, integer len)
#endif
{
	/* Assume 2's complement arithmetic */

	ulongint x, y;

	x = (ulongint) a;
	y = (ulongint)-1L;
	x >>= b;
	y <<= len;
	return (longint)(x & y);
	}

 longint
#ifdef KR_headers
qbit_cshift(a, b, len) longint a; integer b, len;
#else
qbit_cshift(longint a, integer b, integer len)
#endif
{
	ulongint x, y, z;

	x = (ulongint)a;
	if (len <= 0) {
		if (len == 0)
			return 0;
		goto full_len;
		}
	if (len >= LONG8BITS) {
 full_len:
		if (b >= 0) {
			b %= LONG8BITS;
			return (longint)(x << b | x >> LONG8BITS - b );
			}
		b = -b;
		b %= LONG8BITS;
		return (longint)(x << LONG8BITS - b | x >> b);
		}
	y = z = (unsigned long)-1;
	y <<= len;
	z &= ~y;
	y &= x;
	x &= z;
	if (b >= 0) {
		b %= len;
		return (longint)(y | z & (x << b | x >> len - b));
		}
	b = -b;
	b %= len;
	return (longint)(y | z & (x >> b | x << len - b));
	}