/dports/devel/z88dk/z88dk/libsrc/_DEVELOPMENT/EXAMPLES/ |
H A D | clisp.c | 59 #define TAG_CONS (4UL << D_TAG_BIT_POS) macro 511 case TAG_CONS: in l_equal() 564 case TAG_CONS: in l_print() 568 while (D_GET_TAG(l_cdr(t)) == TAG_CONS) { in l_print() 695 if (D_GET_TAG(a) != TAG_CONS) in special() 727 if (D_GET_TAG(a) != TAG_CONS) in special() 732 if (D_GET_TAG(u) != TAG_CONS) in special() 751 if (D_GET_TAG(a) != TAG_CONS) in special() 800 if (D_GET_TAG(arg) != TAG_CONS){ in eval_args() 1160 return (TAG_CONS | s); in l_cons() [all …]
|
/dports/devel/z88dk/z88dk/examples/clisp/ |
H A D | clisp.c | 119 #define TAG_CONS (4 << D_TAG_BIT_POS) macro 139 #define TAG_CONS (4UL << D_TAG_BIT_POS) macro 816 if (D_GET_TAG(s1) == TAG_CONS) 875 case TAG_CONS: 1008 if (D_GET_TAG(a) != TAG_CONS) 1043 if (D_GET_TAG(a) != TAG_CONS) 1048 if (D_GET_TAG(u) != TAG_CONS) 1069 if (D_GET_TAG(a) != TAG_CONS) 1118 if (D_GET_TAG(arg) != TAG_CONS){ 1537 return (TAG_CONS | s); [all …]
|
/dports/math/reduce/Reduce-svn5758-src/csl/cslbase/ |
H A D | allocate.cpp | 301 r += TAG_CONS; in cons() 320 r += TAG_CONS; in cons_no_gc() 338 r += TAG_CONS; in ncons() 351 r += TAG_CONS; in list2() 365 r += TAG_CONS; in list2star() 379 r += TAG_CONS; in list2starrev() 394 r += TAG_CONS; in list3star() 412 r += TAG_CONS; in list4() 434 r += TAG_CONS; in acons() 448 r += TAG_CONS; in acons_no_gc() [all …]
|
H A D | serialize.cpp | 2397 case TAG_CONS: in scan_data() 2398 if (address_used(p - TAG_CONS)) in scan_data() 2402 mark_address_as_used(p - TAG_CONS); in scan_data() 2406 b = w - TAG_CONS + BACKPOINTER_CDR; in scan_data() 2521 w = b - BACKPOINTER_CAR + TAG_CONS; in scan_data() 2642 case TAG_CONS: in write_data() 2813 b = p - TAG_CONS + BACKPOINTER_CDR; in write_data() 3231 w = b - BACKPOINTER_CAR + TAG_CONS; in write_data() 3973 case TAG_CONS: in push_symbols() 3976 mark_address_as_used(p - TAG_CONS); in push_symbols() [all …]
|
H A D | newallocate.h | 1407 { LispObject r = get_n_bytes(2*sizeof(LispObject)) + TAG_CONS; in cons() 1425 { LispObject r = get_n_bytes(2*sizeof(LispObject)) + TAG_CONS; in ncons() 1435 { LispObject r1 = get_n_bytes(4*sizeof(LispObject)) + TAG_CONS; in list2() 1445 { LispObject r1 = get_n_bytes(4*sizeof(LispObject)) + TAG_CONS; in list2star() 1456 { LispObject r1 = get_n_bytes(4*sizeof(LispObject)) + TAG_CONS; in list2starrev() 1467 { LispObject r1 = get_n_bytes(6*sizeof(LispObject)) + TAG_CONS; in list3star() 1481 { LispObject r1 = get_n_bytes(8*sizeof(LispObject)) + TAG_CONS; in list4() 1497 { LispObject r1 = get_n_bytes(4*sizeof(LispObject)) + TAG_CONS; in acons() 1512 { LispObject r1 = get_n_bytes(6*sizeof(LispObject)) + TAG_CONS; in list3() 1525 { LispObject r1 = get_n_bytes(6*sizeof(LispObject)) + TAG_CONS; in list3rev() [all …]
|
H A D | cslgc.cpp | 122 { *p = w - TAG_FORWARD + TAG_CONS; in copy() 154 *p = w = reinterpret_cast<LispObject>(fr + TAG_CONS); in copy()
|
H A D | alloctest.cpp | 140 LispObject r1 = TAG_CONS + reinterpret_cast<LispObject>(r); in zcons()
|
H A D | fns2.cpp | 1393 if (ta == TAG_CONS && a != nil) in cl_equal_fn() 1408 if (tca == TAG_CONS && ca != nil) in cl_equal_fn() 1686 if (ta == TAG_CONS && a != nil) 1701 if (tca == TAG_CONS && ca != nil) 1890 if (ta == TAG_CONS && a != nil) 1905 if (tca == TAG_CONS && ca != nil)
|
H A D | tags.h | 147 static const int TAG_CONS = 0; // Cons cells 01 variable 297 { return (((static_cast<int>(p)) & TAG_BITS) == TAG_CONS); in is_cons()
|
H A D | lisphash.cpp | 735 { case TAG_CONS: in hash_generic_equal()
|
H A D | eval1.cpp | 138 else if (t != TAG_CONS || u == nil) return onevalue(u); in eval()
|
/dports/math/reduce/Reduce-svn5758-src/csl/embedded/ |
H A D | fns1.c | 74 return reclaim((Lisp_Object)((char *)r + TAG_CONS), in cons() 76 else return (Lisp_Object)((char *)r + TAG_CONS); in cons() 86 return (Lisp_Object)((char *)r + TAG_CONS); in cons_no_gc() 109 return reclaim((Lisp_Object)((char *)r + TAG_CONS), in ncons() 111 else return (Lisp_Object)((char *)r + TAG_CONS); in ncons() 127 else return (Lisp_Object)((char *)r + TAG_CONS); in list2() 142 else return (Lisp_Object)((char *)r + TAG_CONS); in list2star() 160 else return (Lisp_Object)((char *)r + TAG_CONS); in list3star() 181 else return (Lisp_Object)((char *)r + TAG_CONS); in list4() 198 else return (Lisp_Object)((char *)r + TAG_CONS); in acons() [all …]
|
H A D | bytes1.c | 1539 else A_reg = (Lisp_Object)((char *)r1 + TAG_CONS); in bytestream_interpret() 1577 else A_reg = (Lisp_Object)((char *)r1 + TAG_CONS); in bytestream_interpret() 1597 sizeof(Cons_Cell) + TAG_CONS); in bytestream_interpret() 1611 else A_reg = (Lisp_Object)((char *)r1 + TAG_CONS); in bytestream_interpret() 1631 sizeof(Cons_Cell) + TAG_CONS); in bytestream_interpret() 1646 else A_reg = (Lisp_Object)((char *)r1 + TAG_CONS); in bytestream_interpret() 1753 sizeof(Cons_Cell) + TAG_CONS); in bytestream_interpret() 1767 else A_reg = (Lisp_Object)((char *)r1 + TAG_CONS); in bytestream_interpret() 1789 sizeof(Cons_Cell) + TAG_CONS); in bytestream_interpret() 1807 else A_reg = (Lisp_Object)((char *)r1 + TAG_CONS); in bytestream_interpret() [all …]
|
H A D | gc.c | 257 case TAG_CONS: /* Already processed */ in validate() 408 case TAG_CONS: in non_recursive_mark() 689 case TAG_CONS: in non_recursive_mark() 924 case TAG_CONS: in non_recursive_mark() 1155 case TAG_CONS: /* Already processed */ in mark() 1707 *cp = clear_mark_bit_p(p1 - TAG_VECTOR + TAG_CONS); in relocate() 1938 *p = w = (Lisp_Object)(fr + TAG_CONS); in copy() 2686 case TAG_CONS: in certainly_not_valid()
|
H A D | tags.h | 191 #define TAG_CONS 0 /* Cons cells (and for Common Lisp, the special */ 324 #define is_cons(p) ((((int)(p)) & TAG_BITS) == TAG_CONS)
|
H A D | fns2.c | 2360 if (ta == TAG_CONS in cl_equal_fn() 2386 if (tca == TAG_CONS in cl_equal_fn() 2640 if (ta == TAG_CONS 2666 if (tca == TAG_CONS 2873 if (ta == TAG_CONS 2899 if (tca == TAG_CONS
|
H A D | fns3.c | 550 case TAG_CONS: in hash_cl_equal() 710 case TAG_CONS: in hash_equal() 878 case TAG_CONS: in hash_equalp()
|
H A D | eval1.c | 133 else if (t != TAG_CONS) return onevalue(u); in Ceval()
|
H A D | csl.c | 2374 nil = doubleword_align_up(nilsegment) + TAG_CONS + 8; in cslstart()
|
/dports/graphics/nip2/nip2-8.7.1/src/ |
H A D | class.c | 383 base->type = TAG_CONS; in add_class_member() 392 sv->type = TAG_CONS; in add_class_member() 443 base->type = TAG_CONS; in add_class_svpair() 452 sv->type = TAG_CONS; in add_class_svpair() 555 sm->type = TAG_CONS; in class_new_single()
|
H A D | heap.c | 88 case TAG_CONS: in heap_map() 542 case TAG_CONS: in heap_mark_tree() 956 hn->type = TAG_CONS; in heap_list_add() 2080 if( hn->type != TAG_CONS ) in lisp_symval() 2087 if( hn2->type != TAG_CONS ) in lisp_symval() 2131 if( hn->type == TAG_CONS ) { in lisp_list() 2163 if( hn->type != TAG_CONS ) in lisp_string() 2249 case TAG_CONS: in lisp_node() 2541 case TAG_CONS: in shell_node()
|
H A D | dump.c | 119 case TAG_CONS: return( "TAG_CONS" ); in decode_NodeType() 618 case TAG_CONS: in graph_heap()
|
H A D | reduce.c | 1388 case TAG_CONS: in reduce_spine() 1483 hn->type = TAG_CONS; in reduce_spine() 1530 hn->type = TAG_CONS; in reduce_spine() 1830 arg[0]->type = TAG_CONS; in reduce_spine()
|
H A D | heap.h | 36 #define TAG_CONS (1) /* List cons */ macro 231 #define PEISFLIST(P) ((PEISNODE(P) && PEGETVAL(P)->type == TAG_CONS) || \
|
H A D | compile.c | 872 case TAG_CONS: in compile_abstract_body() 1208 case TAG_CONS: in compile_share_scan_node() 1369 case TAG_CONS: in compile_share_trim()
|