Lines Matching refs:p2
1112 struct alisp_object *p1 = car(args), *p2;
1117 p2 = car(p1);
1119 return p2;
1127 struct alisp_object *p1 = car(args), *p2;
1132 p2 = cdr(p1);
1134 return p2;
1362 struct alisp_object * p1, * p2, * p3;
1365 p2 = eval(instance, car(cdr(args)));
1371 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) {
1372 if (p2->value.i == 0) {
1376 p3 = new_integer(instance, p1->value.i % p2->value.i);
1380 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) ||
1381 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) {
1384 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f;
1395 delete_tree(instance, p2);
1400 delete_tree(instance, p2);
1409 struct alisp_object * p1, * p2;
1412 p2 = eval(instance, car(cdr(args)));
1418 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) {
1419 if (p1->value.i < p2->value.i) {
1422 delete_tree(instance, p2);
1427 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) ||
1428 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) {
1431 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f;
1439 delete_tree(instance, p2);
1448 struct alisp_object * p1, * p2;
1451 p2 = eval(instance, car(cdr(args)));
1457 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) {
1458 if (p1->value.i > p2->value.i) {
1461 delete_tree(instance, p2);
1466 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) ||
1467 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) {
1470 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f;
1478 delete_tree(instance, p2);
1487 struct alisp_object * p1, * p2;
1490 p2 = eval(instance, car(cdr(args)));
1496 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) {
1497 if (p1->value.i <= p2->value.i) {
1500 delete_tree(instance, p2);
1505 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) ||
1506 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) {
1509 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f;
1517 delete_tree(instance, p2);
1526 struct alisp_object * p1, * p2;
1529 p2 = eval(instance, car(cdr(args)));
1535 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) {
1536 if (p1->value.i >= p2->value.i) {
1539 delete_tree(instance, p2);
1544 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) ||
1545 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) {
1548 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f;
1556 delete_tree(instance, p2);
1565 struct alisp_object * p1, * p2;
1568 p2 = eval(instance, car(cdr(args)));
1574 alisp_compare_type(p2, ALISP_OBJ_INTEGER)) {
1575 if (p1->value.i == p2->value.i) {
1578 delete_tree(instance, p2);
1583 (alisp_compare_type(p2, ALISP_OBJ_INTEGER) ||
1584 alisp_compare_type(p2, ALISP_OBJ_FLOAT))) {
1587 f2 = alisp_compare_type(p2, ALISP_OBJ_INTEGER) ? p2->value.i : p2->value.f;
1595 delete_tree(instance, p2);
1618 struct alisp_object * p1, * p2;
1623 p2 = get_object(instance, p1);
1624 if (p2 == &alsa_lisp_nil) {
1628 p2 = car(p2);
1629 if (alisp_compare_type(p2, ALISP_OBJ_IDENTIFIER) &&
1630 !strcmp(p2->value.s, "lambda")) {
1815 static inline int eq(struct alisp_object * p1, struct alisp_object * p2)
1817 return p1 == p2;
1820 static int equal(struct alisp_object * p1, struct alisp_object * p2)
1824 if (eq(p1, p2))
1828 type2 = alisp_get_type(p2);
1836 return !strcmp(p1->value.s, p2->value.s);
1838 return p1->value.i == p2->value.i;
1840 return p1->value.i == p2->value.i;
1852 struct alisp_object * p1, * p2;
1855 p2 = eval(instance, car(cdr(args)));
1860 if (eq(p1, p2)) {
1862 delete_tree(instance, p2);
1866 delete_tree(instance, p2);
1875 struct alisp_object * p1, * p2;
1878 p2 = eval(instance, car(cdr(args)));
1883 if (equal(p1, p2)) {
1885 delete_tree(instance, p2);
1889 delete_tree(instance, p2);
1976 struct alisp_object * p = args, * p1, * p2, * p3;
1980 if ((p2 = eval(instance, car(p1))) != &alsa_lisp_nil) {
1986 delete_tree(instance, p2);
1990 return p2;
1993 delete_tree(instance, p2);
1997 p = cdr(p2 = p);
1998 delete_object(instance, p2);
2009 struct alisp_object * p1, * p2, * p3;
2012 p2 = car(cdr(args));
2021 return eval(instance, p2);
2025 delete_tree(instance, p2);
2034 struct alisp_object * p1, * p2;
2037 p2 = cdr(args);
2041 return F_progn(instance, p2);
2044 delete_tree(instance, p2);
2055 struct alisp_object * p1, * p2;
2058 p2 = cdr(args);
2061 return F_progn(instance, p2);
2064 delete_tree(instance, p2);
2075 struct alisp_object * p1, * p2, * p3;
2078 p2 = cdr(args);
2086 incref_tree(instance, p2);
2087 delete_tree(instance, F_progn(instance, p2));
2091 delete_tree(instance, p2);
2170 * p2 = eval(instance, car(cdr(args)));
2176 delete_tree(instance, p2);
2177 p2 = &alsa_lisp_nil;
2179 if (set_object(instance, p1, p2) == NULL) {
2181 delete_tree(instance, p2);
2186 return incref_tree(instance, p2);
2209 struct alisp_object * p = args, * p1, * p2 = NULL, *n;
2213 p2 = eval(instance, car(cdr(p)));
2218 delete_tree(instance, p2);
2219 p2 = &alsa_lisp_nil;
2221 if (set_object(instance, p1, p2) == NULL) {
2223 delete_tree(instance, p2);
2231 return incref_tree(instance, p2);
2263 * p2 = car(cdr(args)),
2281 lexpr->value.c.cdr->value.c.car = p2;
2299 struct alisp_object * p1, * p2, * p3, * p4;
2306 p2 = car(cdr(p));
2309 if ((i = count_list(p2)) != count_list(p3)) {
2335 while (p2 != &alsa_lisp_nil) {
2336 p3 = car(p2);
2343 p2 = cdr(p2);
2352 p2 = car(p3);
2355 while (p2 != &alsa_lisp_nil) {
2356 p3 = car(p2);
2364 delete_tree(instance, car(p2));
2365 p2 = cdr(p3 = p2);
2753 struct alisp_object * p1, * p2, * n;
2756 p2 = eval(instance, car(cdr(args)));
2762 if (eq(p1, car(car(p2)))) {
2763 n = car(p2);
2765 delete_tree(instance, cdr(p2));
2766 delete_object(instance, p2);
2769 delete_tree(instance, car(p2));
2770 p2 = cdr(n = p2);
2772 } while (p2 != &alsa_lisp_nil);
2783 struct alisp_object * p1, *p2, * n;
2786 p2 = eval(instance, car(cdr(args)));
2792 if (eq(p1, cdr(car(p2)))) {
2793 n = car(p2);
2795 delete_tree(instance, cdr(p2));
2796 delete_object(instance, p2);
2799 delete_tree(instance, car(p2));
2800 p2 = cdr(n = p2);
2802 } while (p2 != &alsa_lisp_nil);
2813 struct alisp_object * p1, * p2, * n;
2816 p2 = eval(instance, car(cdr(args)));
2822 if (equal(p1, car(car(p2)))) {
2823 n = car(p2);
2825 delete_tree(instance, cdr(p2));
2826 delete_object(instance, p2);
2829 delete_tree(instance, car(p2));
2830 p2 = cdr(n = p2);
2832 } while (p2 != &alsa_lisp_nil);
2843 struct alisp_object * p1, * p2, * n;
2847 p2 = eval(instance, car(cdr(args)));
2854 delete_tree(instance, p2);
2857 if (!alisp_compare_type(p2, ALISP_OBJ_CONS)) {
2859 delete_tree(instance, p2);
2865 delete_tree(instance, car(p2));
2866 p2 = cdr(n = p2);
2869 n = car(p2);
2870 delete_tree(instance, cdr(p2));
2871 delete_object(instance, p2);
2880 struct alisp_object * p1, * p2, * n;
2883 p2 = eval(instance, car(cdr(args)));
2889 if (equal(p1, cdr(car(p2)))) {
2890 n = car(p2);
2892 delete_tree(instance, cdr(p2));
2893 delete_object(instance, p2);
2896 delete_tree(instance, car(p2));
2897 p2 = cdr(n = p2);
2899 } while (p2 != &alsa_lisp_nil);
3041 static int compar(const void *p1, const void *p2)
3044 ((struct intrinsic *)p2)->name);
3047 static inline struct alisp_object * eval_cons1(struct alisp_instance *instance, struct alisp_object * p1, struct alisp_object * p2)
3058 return item->func(instance, p2);
3065 return item->func(instance, p2);
3070 return eval_func(instance, p3, p2);
3074 delete_tree(instance, p2);
3102 struct alisp_object * p1 = car(p), * p2;
3108 p2 = cdr(p);
3110 return eval_cons1(instance, p1, p2);
3477 struct alisp_object * p2;
3483 p2 = seq->value.c.car;
3484 if (!alisp_compare_type(p2, ALISP_OBJ_STRING))
3486 if (strcmp(p2->value.s, ptr_id))
3488 p2 = seq->value.c.cdr;
3489 if (!alisp_compare_type(p2, ALISP_OBJ_POINTER))