Lines Matching refs:p2
1111 struct alisp_object *p1 = car(args), *p2; in F_car() local
1116 p2 = car(p1); in F_car()
1118 return p2; in F_car()
1126 struct alisp_object *p1 = car(args), *p2; in F_cdr() local
1131 p2 = cdr(p1); in F_cdr()
1133 return p2; in F_cdr()
1361 struct alisp_object * p1, * p2, * p3; in F_mod() local
1364 p2 = eval(instance, car(cdr(args))); in F_mod()
1370 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) { in F_mod()
1371 if (p2->value.i == 0) { in F_mod()
1375 p3 = new_integer(instance, p1->value.i % p2->value.i); in F_mod()
1379 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) || in F_mod()
1380 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) { in F_mod()
1383 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f; in F_mod()
1394 delete_tree(instance, p2); in F_mod()
1399 delete_tree(instance, p2); in F_mod()
1408 struct alisp_object * p1, * p2; in F_lt() local
1411 p2 = eval(instance, car(cdr(args))); in F_lt()
1417 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) { in F_lt()
1418 if (p1->value.i < p2->value.i) { in F_lt()
1421 delete_tree(instance, p2); in F_lt()
1426 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) || in F_lt()
1427 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) { in F_lt()
1430 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f; in F_lt()
1438 delete_tree(instance, p2); in F_lt()
1447 struct alisp_object * p1, * p2; in F_gt() local
1450 p2 = eval(instance, car(cdr(args))); in F_gt()
1456 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) { in F_gt()
1457 if (p1->value.i > p2->value.i) { in F_gt()
1460 delete_tree(instance, p2); in F_gt()
1465 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) || in F_gt()
1466 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) { in F_gt()
1469 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f; in F_gt()
1477 delete_tree(instance, p2); in F_gt()
1486 struct alisp_object * p1, * p2; in F_le() local
1489 p2 = eval(instance, car(cdr(args))); in F_le()
1495 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) { in F_le()
1496 if (p1->value.i <= p2->value.i) { in F_le()
1499 delete_tree(instance, p2); in F_le()
1504 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) || in F_le()
1505 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) { in F_le()
1508 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f; in F_le()
1516 delete_tree(instance, p2); in F_le()
1525 struct alisp_object * p1, * p2; in F_ge() local
1528 p2 = eval(instance, car(cdr(args))); in F_ge()
1534 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) { in F_ge()
1535 if (p1->value.i >= p2->value.i) { in F_ge()
1538 delete_tree(instance, p2); in F_ge()
1543 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) || in F_ge()
1544 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) { in F_ge()
1547 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f; in F_ge()
1555 delete_tree(instance, p2); in F_ge()
1564 struct alisp_object * p1, * p2; in F_numeq() local
1567 p2 = eval(instance, car(cdr(args))); in F_numeq()
1573 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) { in F_numeq()
1574 if (p1->value.i == p2->value.i) { in F_numeq()
1577 delete_tree(instance, p2); in F_numeq()
1582 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) || in F_numeq()
1583 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) { in F_numeq()
1586 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f; in F_numeq()
1594 delete_tree(instance, p2); in F_numeq()
1617 struct alisp_object * p1, * p2; in F_exfun() local
1622 p2 = get_object(instance, p1); in F_exfun()
1623 if (p2 == &alsa_lisp_nil) { in F_exfun()
1627 p2 = car(p2); in F_exfun()
1628 if (alisp_compare_type(p2, ALISP_OBJ_IDENTIFIER) && in F_exfun()
1629 !strcmp(p2->value.s, "lambda")) { in F_exfun()
1814 static inline int eq(struct alisp_object * p1, struct alisp_object * p2) in eq() argument
1816 return p1 == p2; in eq()
1819 static int equal(struct alisp_object * p1, struct alisp_object * p2) in equal() argument
1823 if (eq(p1, p2)) in equal()
1827 type2 = alisp_get_type(p2); in equal()
1835 return !strcmp(p1->value.s, p2->value.s); in equal()
1837 return p1->value.i == p2->value.i; in equal()
1839 return p1->value.i == p2->value.i; in equal()
1851 struct alisp_object * p1, * p2; in F_eq() local
1854 p2 = eval(instance, car(cdr(args))); in F_eq()
1859 if (eq(p1, p2)) { in F_eq()
1861 delete_tree(instance, p2); in F_eq()
1865 delete_tree(instance, p2); in F_eq()
1874 struct alisp_object * p1, * p2; in F_equal() local
1877 p2 = eval(instance, car(cdr(args))); in F_equal()
1882 if (equal(p1, p2)) { in F_equal()
1884 delete_tree(instance, p2); in F_equal()
1888 delete_tree(instance, p2); in F_equal()
1975 struct alisp_object * p = args, * p1, * p2, * p3; in F_cond() local
1979 if ((p2 = eval(instance, car(p1))) != &alsa_lisp_nil) { in F_cond()
1985 delete_tree(instance, p2); in F_cond()
1989 return p2; in F_cond()
1992 delete_tree(instance, p2); in F_cond()
1996 p = cdr(p2 = p); in F_cond()
1997 delete_object(instance, p2); in F_cond()
2008 struct alisp_object * p1, * p2, * p3; in F_if() local
2011 p2 = car(cdr(args)); in F_if()
2020 return eval(instance, p2); in F_if()
2024 delete_tree(instance, p2); in F_if()
2033 struct alisp_object * p1, * p2; in F_when() local
2036 p2 = cdr(args); in F_when()
2040 return F_progn(instance, p2); in F_when()
2043 delete_tree(instance, p2); in F_when()
2054 struct alisp_object * p1, * p2; in F_unless() local
2057 p2 = cdr(args); in F_unless()
2060 return F_progn(instance, p2); in F_unless()
2063 delete_tree(instance, p2); in F_unless()
2074 struct alisp_object * p1, * p2, * p3; in F_while() local
2077 p2 = cdr(args); in F_while()
2085 incref_tree(instance, p2); in F_while()
2086 delete_tree(instance, F_progn(instance, p2)); in F_while()
2090 delete_tree(instance, p2); in F_while()
2169 * p2 = eval(instance, car(cdr(args))); in F_set() local
2175 delete_tree(instance, p2); in F_set()
2176 p2 = &alsa_lisp_nil; in F_set()
2178 if (set_object(instance, p1, p2) == NULL) { in F_set()
2180 delete_tree(instance, p2); in F_set()
2185 return incref_tree(instance, p2); in F_set()
2208 struct alisp_object * p = args, * p1, * p2 = NULL, *n; in F_setq() local
2212 p2 = eval(instance, car(cdr(p))); in F_setq()
2217 delete_tree(instance, p2); in F_setq()
2218 p2 = &alsa_lisp_nil; in F_setq()
2220 if (set_object(instance, p1, p2) == NULL) { in F_setq()
2222 delete_tree(instance, p2); in F_setq()
2230 return incref_tree(instance, p2); in F_setq()
2262 * p2 = car(cdr(args)), in F_defun() local
2280 lexpr->value.c.cdr->value.c.car = p2; in F_defun()
2298 struct alisp_object * p1, * p2, * p3, * p4; in eval_func() local
2305 p2 = car(cdr(p)); in eval_func()
2308 if ((i = count_list(p2)) != count_list(p3)) { in eval_func()
2334 while (p2 != &alsa_lisp_nil) { in eval_func()
2335 p3 = car(p2); in eval_func()
2342 p2 = cdr(p2); in eval_func()
2351 p2 = car(p3); in eval_func()
2354 while (p2 != &alsa_lisp_nil) { in eval_func()
2355 p3 = car(p2); in eval_func()
2363 delete_tree(instance, car(p2)); in eval_func()
2364 p2 = cdr(p3 = p2); in eval_func()
2752 struct alisp_object * p1, * p2, * n; in F_assoc() local
2755 p2 = eval(instance, car(cdr(args))); in F_assoc()
2761 if (eq(p1, car(car(p2)))) { in F_assoc()
2762 n = car(p2); in F_assoc()
2764 delete_tree(instance, cdr(p2)); in F_assoc()
2765 delete_object(instance, p2); in F_assoc()
2768 delete_tree(instance, car(p2)); in F_assoc()
2769 p2 = cdr(n = p2); in F_assoc()
2771 } while (p2 != &alsa_lisp_nil); in F_assoc()
2782 struct alisp_object * p1, *p2, * n; in F_rassoc() local
2785 p2 = eval(instance, car(cdr(args))); in F_rassoc()
2791 if (eq(p1, cdr(car(p2)))) { in F_rassoc()
2792 n = car(p2); in F_rassoc()
2794 delete_tree(instance, cdr(p2)); in F_rassoc()
2795 delete_object(instance, p2); in F_rassoc()
2798 delete_tree(instance, car(p2)); in F_rassoc()
2799 p2 = cdr(n = p2); in F_rassoc()
2801 } while (p2 != &alsa_lisp_nil); in F_rassoc()
2812 struct alisp_object * p1, * p2, * n; in F_assq() local
2815 p2 = eval(instance, car(cdr(args))); in F_assq()
2821 if (equal(p1, car(car(p2)))) { in F_assq()
2822 n = car(p2); in F_assq()
2824 delete_tree(instance, cdr(p2)); in F_assq()
2825 delete_object(instance, p2); in F_assq()
2828 delete_tree(instance, car(p2)); in F_assq()
2829 p2 = cdr(n = p2); in F_assq()
2831 } while (p2 != &alsa_lisp_nil); in F_assq()
2842 struct alisp_object * p1, * p2, * n; in F_nth() local
2846 p2 = eval(instance, car(cdr(args))); in F_nth()
2853 delete_tree(instance, p2); in F_nth()
2856 if (!alisp_compare_type(p2, ALISP_OBJ_CONS)) { in F_nth()
2858 delete_tree(instance, p2); in F_nth()
2864 delete_tree(instance, car(p2)); in F_nth()
2865 p2 = cdr(n = p2); in F_nth()
2868 n = car(p2); in F_nth()
2869 delete_tree(instance, cdr(p2)); in F_nth()
2870 delete_object(instance, p2); in F_nth()
2879 struct alisp_object * p1, * p2, * n; in F_rassq() local
2882 p2 = eval(instance, car(cdr(args))); in F_rassq()
2888 if (equal(p1, cdr(car(p2)))) { in F_rassq()
2889 n = car(p2); in F_rassq()
2891 delete_tree(instance, cdr(p2)); in F_rassq()
2892 delete_object(instance, p2); in F_rassq()
2895 delete_tree(instance, car(p2)); in F_rassq()
2896 p2 = cdr(n = p2); in F_rassq()
2898 } while (p2 != &alsa_lisp_nil); in F_rassq()
3040 static int compar(const void *p1, const void *p2) in compar() argument
3043 ((struct intrinsic *)p2)->name); in compar()
3046 …t * eval_cons1(struct alisp_instance *instance, struct alisp_object * p1, struct alisp_object * p2) in eval_cons1() argument
3057 return item->func(instance, p2); in eval_cons1()
3064 return item->func(instance, p2); in eval_cons1()
3069 return eval_func(instance, p3, p2); in eval_cons1()
3073 delete_tree(instance, p2); in eval_cons1()
3101 struct alisp_object * p1 = car(p), * p2; in eval_cons() local
3107 p2 = cdr(p); in eval_cons()
3109 return eval_cons1(instance, p1, p2); in eval_cons()
3476 struct alisp_object * p2; in alsa_lisp_seq_pointer() local
3482 p2 = seq->value.c.car; in alsa_lisp_seq_pointer()
3483 if (!alisp_compare_type(p2, ALISP_OBJ_STRING)) in alsa_lisp_seq_pointer()
3485 if (strcmp(p2->value.s, ptr_id)) in alsa_lisp_seq_pointer()
3487 p2 = seq->value.c.cdr; in alsa_lisp_seq_pointer()
3488 if (!alisp_compare_type(p2, ALISP_OBJ_POINTER)) in alsa_lisp_seq_pointer()