summaryrefslogtreecommitdiff
path: root/srfi/srfi-60.c
diff options
context:
space:
mode:
authorMarius Vollmer <mvo@zagadka.de>2005-03-29 18:04:38 +0000
committerMarius Vollmer <mvo@zagadka.de>2005-03-29 18:04:38 +0000
commitba48957bd53cb06e57d177e5ac9c3746a0a84ba4 (patch)
treed7605b0524560a4d9d3ac43514b5eb980e2e94c6 /srfi/srfi-60.c
parent835c5e96191aef716e0ca1de33bccb9161f1f9a1 (diff)
downloadguile-ba48957bd53cb06e57d177e5ac9c3746a0a84ba4.tar.gz
Replaced SCM_INUMP with SCM_I_INUMP and SCM_INUM with SCM_I_INUM
throughout.
Diffstat (limited to 'srfi/srfi-60.c')
-rw-r--r--srfi/srfi-60.c16
1 files changed, 8 insertions, 8 deletions
diff --git a/srfi/srfi-60.c b/srfi/srfi-60.c
index 8d330cb4d..48d1a3e04 100644
--- a/srfi/srfi-60.c
+++ b/srfi/srfi-60.c
@@ -36,7 +36,7 @@ SCM_DEFINE (scm_srfi60_log2_binary_factors, "log2-binary-factors", 1, 0, 0,
{
SCM ret = SCM_EOL;
- if (SCM_INUMP (n))
+ if (SCM_I_INUMP (n))
{
long nn = SCM_I_INUM (n);
if (nn == 0)
@@ -77,9 +77,9 @@ SCM_DEFINE (scm_srfi60_copy_bit, "copy-bit", 3, 0, 0,
ii = scm_to_ulong (index);
bb = scm_to_bool (bit);
- if (SCM_INUMP (n))
+ if (SCM_I_INUMP (n))
{
- long nn = SCM_INUM (n);
+ long nn = SCM_I_INUM (n);
/* can't set high bit ii==SCM_LONG_BIT-1, that would change the sign,
which is not what's wanted */
@@ -146,9 +146,9 @@ SCM_DEFINE (scm_srfi60_rotate_bit_field, "rotate-bit-field", 4, 0, 0,
cc = scm_to_ulong (scm_modulo (count, scm_difference (end, start)));
- if (SCM_INUMP (n))
+ if (SCM_I_INUMP (n))
{
- long nn = SCM_INUM (n);
+ long nn = SCM_I_INUM (n);
if (ee <= SCM_LONG_BIT-1)
{
@@ -234,9 +234,9 @@ SCM_DEFINE (scm_srfi60_reverse_bit_field, "reverse-bit-field", 3, 0, 0,
long swaps = (ee - ss) / 2; /* number of swaps */
SCM b;
- if (SCM_INUMP (n))
+ if (SCM_I_INUMP (n))
{
- long nn = SCM_INUM (n);
+ long nn = SCM_I_INUM (n);
if (ee <= SCM_LONG_BIT-1)
{
@@ -327,7 +327,7 @@ SCM_DEFINE (scm_srfi60_integer_to_list, "integer->list", 1, 1, 0,
len = scm_integer_length (n);
ll = scm_to_ulong (len);
- if (SCM_INUMP (n))
+ if (SCM_I_INUMP (n))
{
long nn = SCM_I_INUM (n);
for (i = 0; i < ll; i++)