/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-â
âvi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8                                :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ¡
â Copyright 2022 Justine Alexandra Roberts Tunney                              â
â                                                                              â
â Permission to use, copy, modify, and/or distribute this software for         â
â any purpose with or without fee is hereby granted, provided that the         â
â above copyright notice and this permission notice appear in all copies.      â
â                                                                              â
â THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL                â
â WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED                â
â WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE             â
â AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL         â
â DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR        â
â PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER               â
â TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR             â
â PERFORMANCE OF THIS SOFTWARE.                                                â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#include "libc/assert.h"
#include "libc/mem/mem.h"
#include "third_party/lua/visitor.h"

static inline bool IsVisited(struct LuaVisited *v, const void *p) {
  int i;
  for (i = 0; i < v->i; ++i) {
    if (v->p[i] == p) {
      return true;
    }
  }
  return false;
}

static inline int Visit(struct LuaVisited *v, const void *p) {
  int n2;
  const void **p2;
  if (v->i == v->n) {
    n2 = v->n;
    if (!n2) n2 = 2;
    n2 += n2 >> 1;
    if ((p2 = realloc(v->p, n2 * sizeof(*p2)))) {
      v->p = p2;
      v->n = n2;
    } else {
      return -1;
    }
  }
  v->p[v->i++] = p;
  return 0;
}

int LuaPushVisit(struct LuaVisited *v, const void *p) {
  if (IsVisited(v, p)) return 1;
  return Visit(v, p);
}

void LuaPopVisit(struct LuaVisited *v) {
  assert(v->i > 0);
  --v->i;
}
