/* This file is part of asmc, a bootstrapping OS with minimal seed
   Copyright (C) 2019 Giovanni Mascellani <gio@debian.org>
   https://gitlab.com/giomasce/asmc

   This program is free software: you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation, either version 3 of the License, or
   (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program.  If not, see <https://www.gnu.org/licenses/>. */

/* Stuff is a bit complicated here, because we are already in iPXE
   namespace, so we cannot use asmc's stdlib, because it would clash
   with iPXE. OTOH, iPXE stuff is not yet initialized. So we just pass
   a few pointers with the needed library functions and data. Clearly,
   type definitions in this file must be manually kept in sync with
   their original versions. */

#include "ipxe_asmc.h"
#include "ipxe_handover.h"

ipxe_handover *ih;

int pre_main(ipxe_handover *ih_) {
    ih = ih_;
    return main();
}

static table_sect *find_section(const char *name) {
    int i;
    for (i = 0; i < ih->sects_num; i++) {
        const char *name2 = ih->sects[i].name;
        int j;
        for (j = 0; ; j++) {
            if (name[j] != name2[j]) break;
            if (name2[j] == '\0') {
                return &ih->sects[i];
            }
        }
    }
    return 0;
}

// Just a random number, but such that subtracting any reasonable
// structure size does not wrap around (otherwise reverse for cycles
// choke).
#define EMPTY_LIST ((void*) 0x100000)

void *get_table_start(const char *name) {
    table_sect *sect = find_section(name);
    if (!sect) return EMPTY_LIST;
    return sect->data;
}

void *get_table_end(const char *name) {
    table_sect *sect = find_section(name);
    if (!sect) return EMPTY_LIST;
    return sect->data + sect->len;
}

void *asmc_malloc(size_t size) {
    return ih->malloc(size);
}

void asmc_free(void *ptr) {
    ih->free(ptr);
}

void *asmc_realloc(void *ptr, size_t size) {
    return ih->realloc(ptr, size);
}

void push_to_asmc(void *msg) {
    ipxe_list_push(ih, &ih->from_ipxe, msg);
}

void *pop_from_asmc(void) {
    return ipxe_list_pop(ih, &ih->to_ipxe);
}

void coro_yield(void) {
    ih->coro_yield();
}