1 /* Copyright (C) 1995,1996,2000,2001, 2004, 2005, 2006, 2008, 2009,
2 * 2011, 2013 Free Software Foundation, Inc.
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public License
6 * as published by the Free Software Foundation; either version 3 of
7 * the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
26 #include "libguile/_scm.h"
27 #include "libguile/validate.h"
29 #include "libguile/pairs.h"
39 * This compile-time test verifies the properties needed for the
40 * efficient test macro scm_is_null_or_nil defined in pairs.h,
41 * which is defined in terms of the SCM_MATCHES_BITS_IN_COMMON macro.
43 * See the comments preceeding the definitions of SCM_BOOL_F and
44 * SCM_MATCHES_BITS_IN_COMMON in tags.h for more information.
46 verify (SCM_BITS_DIFFER_IN_EXACTLY_ONE_BIT_POSITION \
47 (SCM_ELISP_NIL_BITS
, SCM_EOL_BITS
));
50 #if (SCM_DEBUG_PAIR_ACCESSES == 1)
52 #include "libguile/ports.h"
53 #include "libguile/strings.h"
55 void scm_error_pair_access (SCM non_pair
)
57 static unsigned int running
= 0;
58 SCM message
= scm_from_locale_string ("Non-pair accessed with SCM_C[AD]R: `~S'\n");
63 scm_simple_format (scm_current_error_port (),
64 message
, scm_list_1 (non_pair
));
71 SCM_DEFINE (scm_cons
, "cons", 2, 0, 0,
73 "Return a newly allocated pair whose car is @var{x} and whose\n"
74 "cdr is @var{y}. The pair is guaranteed to be different (in the\n"
75 "sense of @code{eq?}) from every previously existing object.")
76 #define FUNC_NAME s_scm_cons
78 return scm_cell (SCM_UNPACK (x
), SCM_UNPACK (y
));
84 scm_cons2 (SCM w
, SCM x
, SCM y
)
86 return scm_cons (w
, scm_cons (x
, y
));
90 SCM_DEFINE (scm_pair_p
, "pair?", 1, 0, 0,
92 "Return @code{#t} if @var{x} is a pair; otherwise return\n"
94 #define FUNC_NAME s_scm_pair_p
96 return scm_from_bool (scm_is_pair (x
));
100 SCM_DEFINE (scm_set_car_x
, "set-car!", 2, 0, 0,
101 (SCM pair
, SCM value
),
102 "Stores @var{value} in the car field of @var{pair}. The value returned\n"
103 "by @code{set-car!} is unspecified.")
104 #define FUNC_NAME s_scm_set_car_x
106 SCM_VALIDATE_CONS (1, pair
);
107 SCM_SETCAR (pair
, value
);
108 return SCM_UNSPECIFIED
;
113 SCM_DEFINE (scm_set_cdr_x
, "set-cdr!", 2, 0, 0,
114 (SCM pair
, SCM value
),
115 "Stores @var{value} in the cdr field of @var{pair}. The value returned\n"
116 "by @code{set-cdr!} is unspecified.")
117 #define FUNC_NAME s_scm_set_cdr_x
119 SCM_VALIDATE_CONS (1, pair
);
120 SCM_SETCDR (pair
, value
);
121 return SCM_UNSPECIFIED
;
127 /* Every cxr-pattern is made up of pairs of bits, starting with the two least
128 * significant bits. If in a pair of bits the least significant of the two
129 * bits is 0, this means CDR, otherwise CAR. The most significant bits of the
130 * two bits is only needed to indicate when cxr-ing is ready. This is the
131 * case, when all remaining pairs of bits equal 00. */
133 /* The compiler should unroll this. */
134 #define CHASE_PAIRS(tree, FUNC_NAME, pattern) \
135 scm_t_uint32 pattern_var = pattern; \
138 if (!scm_is_pair (tree)) \
139 scm_wrong_type_arg_msg (FUNC_NAME, 0, tree, "pair"); \
140 tree = (pattern_var & 1) ? SCM_CAR (tree) : SCM_CDR (tree); \
143 while (pattern_var); \
147 SCM_DEFINE (scm_cdr
, "cdr", 1, 0, 0, (SCM x
), "")
148 #define FUNC_NAME s_scm_cdr
150 CHASE_PAIRS (x
, "cdr", 0x02); /* 00000010 */
154 SCM_DEFINE (scm_car
, "car", 1, 0, 0, (SCM x
), "")
155 #define FUNC_NAME s_scm_car
157 CHASE_PAIRS (x
, "car", 0x03); /* 00000011 */
161 SCM_DEFINE (scm_cddr
, "cddr", 1, 0, 0, (SCM x
), "")
162 #define FUNC_NAME s_scm_cddr
164 CHASE_PAIRS (x
, "cddr", 0x0a); /* 00001010 */
168 SCM_DEFINE (scm_cdar
, "cdar", 1, 0, 0, (SCM x
), "")
169 #define FUNC_NAME s_scm_cdar
171 CHASE_PAIRS (x
, "cdar", 0x0b); /* 00001011 */
175 SCM_DEFINE (scm_cadr
, "cadr", 1, 0, 0, (SCM x
), "")
176 #define FUNC_NAME s_scm_cadr
178 CHASE_PAIRS (x
, "cadr", 0x0e); /* 00001110 */
182 SCM_DEFINE (scm_caar
, "caar", 1, 0, 0, (SCM x
), "")
183 #define FUNC_NAME s_scm_caar
185 CHASE_PAIRS (x
, "caar", 0x0f); /* 00001111 */
189 SCM_DEFINE (scm_cdddr
, "cdddr", 1, 0, 0, (SCM x
), "")
190 #define FUNC_NAME s_scm_cdddr
192 CHASE_PAIRS (x
, "cdddr", 0x2a); /* 00101010 */
196 SCM_DEFINE (scm_cddar
, "cddar", 1, 0, 0, (SCM x
), "")
197 #define FUNC_NAME s_scm_cddar
199 CHASE_PAIRS (x
, "cddar", 0x2b); /* 00101011 */
203 SCM_DEFINE (scm_cdadr
, "cdadr", 1, 0, 0, (SCM x
), "")
204 #define FUNC_NAME s_scm_cdadr
206 CHASE_PAIRS (x
, "cdadr", 0x2e); /* 00101110 */
210 SCM_DEFINE (scm_cdaar
, "cdaar", 1, 0, 0, (SCM x
), "")
211 #define FUNC_NAME s_scm_cdaar
213 CHASE_PAIRS (x
, "cdaar", 0x2f); /* 00101111 */
217 SCM_DEFINE (scm_caddr
, "caddr", 1, 0, 0, (SCM x
), "")
218 #define FUNC_NAME s_scm_caddr
220 CHASE_PAIRS (x
, "caddr", 0x3a); /* 00111010 */
224 SCM_DEFINE (scm_cadar
, "cadar", 1, 0, 0, (SCM x
), "")
225 #define FUNC_NAME s_scm_cadar
227 CHASE_PAIRS (x
, "cadar", 0x3b); /* 00111011 */
231 SCM_DEFINE (scm_caadr
, "caadr", 1, 0, 0, (SCM x
), "")
232 #define FUNC_NAME s_scm_caadr
234 CHASE_PAIRS (x
, "caadr", 0x3e); /* 00111110 */
238 SCM_DEFINE (scm_caaar
, "caaar", 1, 0, 0, (SCM x
), "")
239 #define FUNC_NAME s_scm_caaar
241 CHASE_PAIRS (x
, "caaar", 0x3f); /* 00111111 */
245 SCM_DEFINE (scm_cddddr
, "cddddr", 1, 0, 0, (SCM x
), "")
246 #define FUNC_NAME s_scm_cddddr
248 CHASE_PAIRS (x
, "cddddr", 0xaa); /* 10101010 */
252 SCM_DEFINE (scm_cdddar
, "cdddar", 1, 0, 0, (SCM x
), "")
253 #define FUNC_NAME s_scm_cdddar
255 CHASE_PAIRS (x
, "cdddar", 0xab); /* 10101011 */
259 SCM_DEFINE (scm_cddadr
, "cddadr", 1, 0, 0, (SCM x
), "")
260 #define FUNC_NAME s_scm_cddadr
262 CHASE_PAIRS (x
, "cddadr", 0xae); /* 10101110 */
266 SCM_DEFINE (scm_cddaar
, "cddaar", 1, 0, 0, (SCM x
), "")
267 #define FUNC_NAME s_scm_cddaar
269 CHASE_PAIRS (x
, "cddaar", 0xaf); /* 10101111 */
273 SCM_DEFINE (scm_cdaddr
, "cdaddr", 1, 0, 0, (SCM x
), "")
274 #define FUNC_NAME s_scm_cdaddr
276 CHASE_PAIRS (x
, "cdaddr", 0xba); /* 10111010 */
280 SCM_DEFINE (scm_cdadar
, "cdadar", 1, 0, 0, (SCM x
), "")
281 #define FUNC_NAME s_scm_cdadar
283 CHASE_PAIRS (x
, "cdadar", 0xbb); /* 10111011 */
287 SCM_DEFINE (scm_cdaadr
, "cdaadr", 1, 0, 0, (SCM x
), "")
288 #define FUNC_NAME s_scm_cdaadr
290 CHASE_PAIRS (x
, "cdaadr", 0xbe); /* 10111110 */
294 SCM_DEFINE (scm_cdaaar
, "cdaaar", 1, 0, 0, (SCM x
), "")
295 #define FUNC_NAME s_scm_cdaaar
297 CHASE_PAIRS (x
, "cdaaar", 0xbf); /* 10111111 */
301 SCM_DEFINE (scm_cadddr
, "cadddr", 1, 0, 0, (SCM x
), "")
302 #define FUNC_NAME s_scm_cadddr
304 CHASE_PAIRS (x
, "cadddr", 0xea); /* 11101010 */
308 SCM_DEFINE (scm_caddar
, "caddar", 1, 0, 0, (SCM x
), "")
309 #define FUNC_NAME s_scm_caddar
311 CHASE_PAIRS (x
, "caddar", 0xeb); /* 11101011 */
315 SCM_DEFINE (scm_cadadr
, "cadadr", 1, 0, 0, (SCM x
), "")
316 #define FUNC_NAME s_scm_cadadr
318 CHASE_PAIRS (x
, "cadadr", 0xee); /* 11101110 */
322 SCM_DEFINE (scm_cadaar
, "cadaar", 1, 0, 0, (SCM x
), "")
323 #define FUNC_NAME s_scm_cadaar
325 CHASE_PAIRS (x
, "cadaar", 0xef); /* 11101111 */
329 SCM_DEFINE (scm_caaddr
, "caaddr", 1, 0, 0, (SCM x
), "")
330 #define FUNC_NAME s_scm_caaddr
332 CHASE_PAIRS (x
, "caaddr", 0xfa); /* 11111010 */
336 SCM_DEFINE (scm_caadar
, "caadar", 1, 0, 0, (SCM x
), "")
337 #define FUNC_NAME s_scm_caadar
339 CHASE_PAIRS (x
, "caadar", 0xfb); /* 11111011 */
343 SCM_DEFINE (scm_caaadr
, "caaadr", 1, 0, 0, (SCM x
), "")
344 #define FUNC_NAME s_scm_caaadr
346 CHASE_PAIRS (x
, "caaadr", 0xfe); /* 11111110 */
350 SCM_DEFINE (scm_caaaar
, "caaaar", 1, 0, 0, (SCM x
), "")
351 #define FUNC_NAME s_scm_caaaar
353 CHASE_PAIRS (x
, "caaaar", 0xff); /* 11111111 */
363 #include "libguile/pairs.x"