git.gag.com Git - fw/altos/blob - src/scheme/ao_scheme_cons.c

   1 /*
   2  * Copyright © 2016 Keith Packard <keithp@keithp.com>
   3  *
   4  * This program is free software; you can redistribute it and/or modify
   5  * it under the terms of the GNU General Public License as published by
   6  * the Free Software Foundation, either version 2 of the License, or
   7  * (at your option) any later version.
   8  *
   9  * This program 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  * General Public License for more details.
  13  */
  14
  15 #include "ao_scheme.h"
  16
  17 static void cons_mark(void *addr)
  18 {
  19         struct ao_scheme_cons   *cons = addr;
  20
  21         for (;;) {
  22                 ao_poly cdr = cons->cdr;
  23
  24                 ao_scheme_poly_mark(cons->car, 1);
  25                 if (!cdr)
  26                         break;
  27                 if (!AO_SCHEME_IS_CONS(cdr)) {
  28                         ao_scheme_poly_mark(cdr, 0);
  29                         break;
  30                 }
  31                 cons = ao_scheme_poly_cons(cdr);
  32                 if (ao_scheme_mark_memory(&ao_scheme_cons_type, cons))
  33                         break;
  34         }
  35 }
  36
  37 static int cons_size(void *addr)
  38 {
  39         (void) addr;
  40         return sizeof (struct ao_scheme_cons);
  41 }
  42
  43 static void cons_move(void *addr)
  44 {
  45         struct ao_scheme_cons   *cons = addr;
  46
  47         if (!cons)
  48                 return;
  49
  50         for (;;) {
  51                 ao_poly                 cdr;
  52                 struct ao_scheme_cons   *c;
  53                 int     ret;
  54
  55                 MDBG_MOVE("cons_move start %d (%d, %d)\n",
  56                           MDBG_OFFSET(cons), MDBG_OFFSET(ao_scheme_ref(cons->car)), MDBG_OFFSET(ao_scheme_ref(cons->cdr)));
  57                 (void) ao_scheme_poly_move(&cons->car, 1);
  58                 cdr = cons->cdr;
  59                 if (!cdr)
  60                         break;
  61                 if (!AO_SCHEME_IS_CONS(cdr)) {
  62                         (void) ao_scheme_poly_move(&cons->cdr, 0);
  63                         break;
  64                 }
  65                 c = ao_scheme_poly_cons(cdr);
  66                 ret = ao_scheme_move_memory(&ao_scheme_cons_type, (void **) &c);
  67                 if (c != ao_scheme_poly_cons(cons->cdr))
  68                         cons->cdr = ao_scheme_cons_poly(c);
  69                 MDBG_MOVE("cons_move end %d (%d, %d)\n",
  70                           MDBG_OFFSET(cons), MDBG_OFFSET(ao_scheme_ref(cons->car)), MDBG_OFFSET(ao_scheme_ref(cons->cdr)));
  71                 if (ret)
  72                         break;
  73                 cons = c;
  74         }
  75 }
  76
  77 const struct ao_scheme_type ao_scheme_cons_type = {
  78         .mark = cons_mark,
  79         .size = cons_size,
  80         .move = cons_move,
  81         .name = "cons",
  82 };
  83
  84 struct ao_scheme_cons *ao_scheme_cons_free_list;
  85
  86 struct ao_scheme_cons *
  87 ao_scheme_cons_cons(ao_poly car, ao_poly cdr)
  88 {
  89         struct ao_scheme_cons   *cons;
  90
  91         if (ao_scheme_cons_free_list) {
  92                 cons = ao_scheme_cons_free_list;
  93                 ao_scheme_cons_free_list = ao_scheme_poly_cons(cons->cdr);
  94         } else {
  95                 ao_scheme_poly_stash(0, car);
  96                 ao_scheme_poly_stash(1, cdr);
  97                 cons = ao_scheme_alloc(sizeof (struct ao_scheme_cons));
  98                 cdr = ao_scheme_poly_fetch(1);
  99                 car = ao_scheme_poly_fetch(0);
 100                 if (!cons)
 101                         return NULL;
 102         }
 103         cons->car = car;
 104         cons->cdr = cdr;
 105         return cons;
 106 }
 107
 108 struct ao_scheme_cons *
 109 ao_scheme_cons_cdr(struct ao_scheme_cons *cons)
 110 {
 111         ao_poly cdr = cons->cdr;
 112         if (cdr == AO_SCHEME_NIL)
 113                 return NULL;
 114         if (!AO_SCHEME_IS_CONS(cdr)) {
 115                 (void) ao_scheme_error(AO_SCHEME_INVALID, "improper cdr %v", cdr);
 116                 return NULL;
 117         }
 118         return ao_scheme_poly_cons(cdr);
 119 }
 120
 121 ao_poly
 122 ao_scheme__cons(ao_poly car, ao_poly cdr)
 123 {
 124         return ao_scheme_cons_poly(ao_scheme_cons_cons(car, cdr));
 125 }
 126
 127 struct ao_scheme_cons *
 128 ao_scheme_cons_copy(struct ao_scheme_cons *cons)
 129 {
 130         struct ao_scheme_cons   *head = NULL;
 131         struct ao_scheme_cons   *tail = NULL;
 132
 133         while (cons) {
 134                 struct ao_scheme_cons   *new;
 135                 ao_poly cdr;
 136
 137                 ao_scheme_cons_stash(0, cons);
 138                 ao_scheme_cons_stash(1, head);
 139                 ao_scheme_poly_stash(0, ao_scheme_cons_poly(tail));
 140                 new = ao_scheme_alloc(sizeof (struct ao_scheme_cons));
 141                 cons = ao_scheme_cons_fetch(0);
 142                 head = ao_scheme_cons_fetch(1);
 143                 tail = ao_scheme_poly_cons(ao_scheme_poly_fetch(0));
 144                 if (!new)
 145                         return AO_SCHEME_NIL;
 146                 new->car = cons->car;
 147                 new->cdr = AO_SCHEME_NIL;
 148                 if (!head)
 149                         head = new;
 150                 else
 151                         tail->cdr = ao_scheme_cons_poly(new);
 152                 tail = new;
 153                 cdr = cons->cdr;
 154                 if (!AO_SCHEME_IS_CONS(cdr)) {
 155                         tail->cdr = cdr;
 156                         break;
 157                 }
 158                 cons = ao_scheme_poly_cons(cdr);
 159         }
 160         return head;
 161 }
 162
 163 void
 164 ao_scheme_cons_free(struct ao_scheme_cons *cons)
 165 {
 166 #if DBG_FREE_CONS
 167         ao_scheme_cons_check(cons);
 168 #endif
 169         while (cons) {
 170                 ao_poly cdr = cons->cdr;
 171                 cons->cdr = ao_scheme_cons_poly(ao_scheme_cons_free_list);
 172                 ao_scheme_cons_free_list = cons;
 173                 cons = ao_scheme_poly_cons(cdr);
 174         }
 175 }
 176
 177 void
 178 ao_scheme_cons_write(ao_poly c, bool write)
 179 {
 180         struct ao_scheme_cons   *cons = ao_scheme_poly_cons(c);
 181         struct ao_scheme_cons   *clear = cons;
 182         ao_poly                 cdr;
 183         int                     written = 0;
 184
 185         ao_scheme_print_start();
 186         printf("(");
 187         while (cons) {
 188                 if (written != 0)
 189                         printf(" ");
 190
 191                 /* Note if there's recursion in printing. Not
 192                  * as good as actual references, but at least
 193                  * we don't infinite loop...
 194                  */
 195                 if (ao_scheme_print_mark_addr(cons)) {
 196                         printf("...");
 197                         break;
 198                 }
 199
 200                 ao_scheme_poly_write(cons->car, write);
 201
 202                 /* keep track of how many pairs have been printed */
 203                 written++;
 204
 205                 cdr = cons->cdr;
 206                 if (!AO_SCHEME_IS_CONS(cdr)) {
 207                         printf(" . ");
 208                         ao_scheme_poly_write(cdr, write);
 209                         break;
 210                 }
 211                 cons = ao_scheme_poly_cons(cdr);
 212         }
 213         printf(")");
 214
 215         if (ao_scheme_print_stop()) {
 216
 217                 /* If we're still printing, clear the print marks on
 218                  * all printed pairs
 219                  */
 220                 while (written--) {
 221                         ao_scheme_print_clear_addr(clear);
 222                         clear = ao_scheme_poly_cons(clear->cdr);
 223                 }
 224         }
 225 }
 226
 227 int
 228 ao_scheme_cons_length(struct ao_scheme_cons *cons)
 229 {
 230         int     len = 0;
 231         while (cons) {
 232                 len++;
 233                 cons = ao_scheme_cons_cdr(cons);
 234         }
 235         return len;
 236 }