laag-nasm 2.13.03.2

data/vendor/repo.or.cz/nasm/rdoff/rdx.1

@@ -0,0 +1,21 @@
+.TH RDX 1 "September 6, 1999" "Debian Project" "Debian Manual"
+.SH NAME
+rdx \- load and execute an RDOFF object
+.SH SYNOPSIS
+.B rdx
+.I object
+.SH DESCRIPTION
+.B rdx
+loads an RDOFF
+.IR object ,
+and then calls
+.RB ` _main ',
+which it expects to be a C-style function, accepting two parameters,
+.I argc
+and
+.I argv
+in normal C style.
+.SH AUTHORS
+Julian Hall <jules@earthcorp.com>.
+.PP
+This manual page was written by Matej Vela <vela@debian.org>.

data/vendor/repo.or.cz/nasm/rdoff/rdx.c

@@ -0,0 +1,90 @@
+/* ----------------------------------------------------------------------- *
+ *
+ *   Copyright 1996-2009 The NASM Authors - All Rights Reserved
+ *   See the file AUTHORS included with the NASM distribution for
+ *   the specific copyright holders.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following
+ *   conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright
+ *     notice, this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above
+ *     copyright notice, this list of conditions and the following
+ *     disclaimer in the documentation and/or other materials provided
+ *     with the distribution.
+ *
+ *     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
+ *     CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
+ *     INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+ *     MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ *     DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+ *     CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *     SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ *     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ *     LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ *     HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ *     CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ *     OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+ *     EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * ----------------------------------------------------------------------- */
+
+/*
+ * rdx.c	RDOFF Object File loader program
+ */
+
+/* note: most of the actual work of this program is done by the modules
+   "rdfload.c", which loads and relocates the object file, and by "rdoff.c",
+   which contains general purpose routines to manipulate RDOFF object
+   files. You can use these files in your own program to load RDOFF objects
+   and execute the code in them in a similar way to what is shown here. */
+
+#include "compiler.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "rdfload.h"
+#include "symtab.h"
+
+typedef int (*main_fn) (int, char **);  /* Main function prototype */
+
+int main(int argc, char **argv)
+{
+    rdfmodule *m;
+    main_fn code;
+    symtabEnt *s;
+
+    if (argc < 2) {
+        puts("usage: rdx <rdoff-executable> [params]\n");
+        exit(255);
+    }
+
+    rdoff_init();
+
+    m = rdfload(argv[1]);
+
+    if (!m) {
+        rdfperror("rdx", argv[1]);
+        exit(255);
+    }
+
+    rdf_relocate(m);            /* in this instance, the default relocation
+                                   values will work fine, but they may need changing
+                                   in other cases... */
+
+    s = symtabFind(m->symtab, "_main");
+    if (!s) {
+        fprintf(stderr, "rdx: could not find symbol '_main' in '%s'\n",
+                argv[1]);
+        exit(255);
+    }
+
+    code = (main_fn)(size_t) s->offset;
+
+    argv++, argc--;             /* remove 'rdx' from command line */
+
+    return code(argc, argv);    /* execute */
+}

data/vendor/repo.or.cz/nasm/rdoff/segtab.c

@@ -0,0 +1,172 @@
+/* ----------------------------------------------------------------------- *
+ *
+ *   Copyright 1996-2014 The NASM Authors - All Rights Reserved
+ *   See the file AUTHORS included with the NASM distribution for
+ *   the specific copyright holders.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following
+ *   conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright
+ *     notice, this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above
+ *     copyright notice, this list of conditions and the following
+ *     disclaimer in the documentation and/or other materials provided
+ *     with the distribution.
+ *
+ *     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
+ *     CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
+ *     INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+ *     MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ *     DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+ *     CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *     SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ *     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ *     LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ *     HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ *     CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ *     OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+ *     EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * ----------------------------------------------------------------------- */
+
+#include "rdfutils.h"
+#include "segtab.h"
+
+struct segtabnode {
+    int localseg;
+    int destseg;
+    int32_t offset;
+
+    struct segtabnode *left;
+    struct segtabnode *right;
+    /*
+     * counts of how many are left or right, for use in reorganising
+     * the tree
+     */
+    int leftcount;
+    int rightcount;
+};
+
+/*
+ * init_seglocations()
+ * add_seglocation()
+ * get_seglocation()
+ * done_seglocation()
+ *
+ * functions used by write_output() to manipulate associations
+ * between segment numbers and locations (which are built up on a per
+ * module basis, but we only need one module at a time...)
+ *
+ * implementation: we build a binary tree.
+ */
+
+void init_seglocations(segtab * root)
+{
+    *root = NULL;
+}
+
+static void descend_tree_add(struct segtabnode **node,
+                      int localseg, int destseg, int32_t offset)
+{
+    struct segtabnode *n;
+
+    if (*node == NULL) {
+        *node = nasm_malloc(sizeof(**node));
+        if (!*node) {
+            fprintf(stderr, "segment table: out of memory\n");
+            exit(1);
+        }
+        (*node)->localseg = localseg;
+        (*node)->offset = offset;
+        (*node)->left = NULL;
+        (*node)->leftcount = 0;
+        (*node)->right = NULL;
+        (*node)->rightcount = 0;
+        (*node)->destseg = destseg;
+        return;
+    }
+
+    if (localseg < (*node)->localseg) {
+        (*node)->leftcount++;
+        descend_tree_add(&(*node)->left, localseg, destseg, offset);
+
+        if ((*node)->leftcount > (*node)->rightcount + 2) {
+            n = *node;
+            *node = n->left;
+            n->left = (*node)->right;
+            n->leftcount = (*node)->rightcount;
+            (*node)->right = n;
+            (*node)->rightcount = n->leftcount + n->rightcount + 1;
+        }
+    } else {
+        (*node)->rightcount++;
+        descend_tree_add(&(*node)->right, localseg, destseg, offset);
+
+        if ((*node)->rightcount > (*node)->leftcount + 2) {
+            n = *node;
+            *node = n->right;
+            n->right = (*node)->left;
+            n->rightcount = (*node)->leftcount;
+            (*node)->left = n;
+            (*node)->leftcount = n->leftcount + n->rightcount + 1;
+        }
+    }
+}
+
+void add_seglocation(segtab * root, int localseg, int destseg, int32_t offset)
+{
+    descend_tree_add((struct segtabnode **)root, localseg, destseg,
+                     offset);
+}
+
+int get_seglocation(segtab * root, int localseg, int *destseg,
+                    int32_t *offset)
+{
+    struct segtabnode *n = (struct segtabnode *)*root;
+
+    while (n && n->localseg != localseg) {
+        if (localseg < n->localseg)
+            n = n->left;
+        else
+            n = n->right;
+    }
+    if (n) {
+        *destseg = n->destseg;
+        *offset = n->offset;
+        return 1;
+    } else
+        return 0;
+}
+
+static void freenode(struct segtabnode *n)
+{
+    if (!n)
+        return;
+    freenode(n->left);
+    freenode(n->right);
+    nasm_free(n);
+}
+
+void done_seglocations(segtab * root)
+{
+    freenode(*root);
+    *root = NULL;
+}
+
+#if 0
+void printnode(int i, struct segtabnode *n)
+{
+    if (!n)
+        return;
+    printnode(i + 1, n->left);
+    printf("%*s%d %d %ld\n", i, "", n->localseg, n->destseg, n->offset);
+    printnode(i + 1, n->right);
+}
+
+void printtable()
+{
+    printnode(0, root);
+}
+#endif

data/vendor/repo.or.cz/nasm/rdoff/segtab.h

@@ -0,0 +1,45 @@
+/* ----------------------------------------------------------------------- *
+ *   
+ *   Copyright 1996-2009 The NASM Authors - All Rights Reserved
+ *   See the file AUTHORS included with the NASM distribution for
+ *   the specific copyright holders.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following
+ *   conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright
+ *     notice, this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above
+ *     copyright notice, this list of conditions and the following
+ *     disclaimer in the documentation and/or other materials provided
+ *     with the distribution.
+ *     
+ *     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
+ *     CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
+ *     INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+ *     MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ *     DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+ *     CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *     SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ *     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ *     LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ *     HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ *     CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ *     OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+ *     EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * ----------------------------------------------------------------------- */
+
+#ifndef RDOFF_SEGTAB_H
+#define RDOFF_SEGTAB_H 1
+
+
+typedef void *segtab;
+
+void init_seglocations(segtab * r);
+void add_seglocation(segtab * r, int localseg, int destseg, int32_t offset);
+int get_seglocation(segtab * r, int localseg, int *destseg, int32_t *offset);
+void done_seglocations(segtab * r);
+
+#endif

data/vendor/repo.or.cz/nasm/rdoff/symtab.c

@@ -0,0 +1,159 @@
+/* ----------------------------------------------------------------------- *
+ *
+ *   Copyright 1996-2009 The NASM Authors - All Rights Reserved
+ *   See the file AUTHORS included with the NASM distribution for
+ *   the specific copyright holders.
+ *
+ *   Redistribution and use in source and binary forms, with or without
+ *   modification, are permitted provided that the following
+ *   conditions are met:
+ *
+ *   * Redistributions of source code must retain the above copyright
+ *     notice, this list of conditions and the following disclaimer.
+ *   * Redistributions in binary form must reproduce the above
+ *     copyright notice, this list of conditions and the following
+ *     disclaimer in the documentation and/or other materials provided
+ *     with the distribution.
+ *
+ *     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
+ *     CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
+ *     INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+ *     MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ *     DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+ *     CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ *     SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ *     NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ *     LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ *     HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ *     CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
+ *     OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+ *     EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * ----------------------------------------------------------------------- */
+
+/*
+ * symtab.c     Routines to maintain and manipulate a symbol table
+ *
+ *   These routines donated to the NASM effort by Graeme Defty.
+ */
+
+#include "rdfutils.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "symtab.h"
+#include "hash.h"
+
+#define SYMTABSIZE 64
+#define slotnum(x) (hash((x)) % SYMTABSIZE)
+
+/* ------------------------------------- */
+/* Private data types */
+
+typedef struct tagSymtabNode {
+    struct tagSymtabNode *next;
+    symtabEnt ent;
+} symtabNode;
+
+typedef symtabNode *(symtabTab[SYMTABSIZE]);
+
+typedef symtabTab *symtab;
+
+/* ------------------------------------- */
+void *symtabNew(void)
+{
+    symtab mytab;
+
+    mytab = (symtabTab *) nasm_calloc(SYMTABSIZE, sizeof(symtabNode *));
+    if (mytab == NULL) {
+        fprintf(stderr, "symtab: out of memory\n");
+        exit(3);
+    }
+
+    return mytab;
+}
+
+/* ------------------------------------- */
+void symtabDone(void *stab)
+{
+    symtab mytab = (symtab) stab;
+    int i;
+    symtabNode *this, *next;
+
+    for (i = 0; i < SYMTABSIZE; ++i) {
+
+        for (this = (*mytab)[i]; this; this = next) {
+            next = this->next;
+            nasm_free(this);
+        }
+
+    }
+    nasm_free(*mytab);
+}
+
+/* ------------------------------------- */
+void symtabInsert(void *stab, symtabEnt * ent)
+{
+    symtab mytab = (symtab) stab;
+    symtabNode *node;
+    int slot;
+
+    node = nasm_malloc(sizeof(symtabNode));
+    if (node == NULL) {
+        fprintf(stderr, "symtab: out of memory\n");
+        exit(3);
+    }
+
+    slot = slotnum(ent->name);
+
+    node->ent = *ent;
+    node->next = (*mytab)[slot];
+    (*mytab)[slot] = node;
+}
+
+/* ------------------------------------- */
+symtabEnt *symtabFind(void *stab, const char *name)
+{
+    symtab mytab = (symtab) stab;
+    int slot = slotnum(name);
+    symtabNode *node = (*mytab)[slot];
+
+    while (node) {
+        if (!strcmp(node->ent.name, name)) {
+            return &(node->ent);
+        }
+        node = node->next;
+    }
+
+    return NULL;
+}
+
+/* ------------------------------------- */
+void symtabDump(void *stab, FILE * of)
+{
+    symtab mytab = (symtab) stab;
+    int i;
+    char *SegNames[3] = { "code", "data", "bss" };
+
+    fprintf(of, "Symbol table is ...\n");
+    for (i = 0; i < SYMTABSIZE; ++i) {
+        symtabNode *l = (symtabNode *) (*mytab)[i];
+
+        if (l) {
+            fprintf(of, " ... slot %d ...\n", i);
+        }
+        while (l) {
+            if ((l->ent.segment) == -1) {
+                fprintf(of, "%-32s Unresolved reference\n", l->ent.name);
+            } else {
+                fprintf(of, "%-32s %s:%08"PRIx32" (%"PRId32")\n", l->ent.name,
+                        SegNames[l->ent.segment],
+                        l->ent.offset, l->ent.flags);
+            }
+            l = l->next;
+        }
+    }
+    fprintf(of, "........... end of Symbol table.\n");
+}