| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121 |
- /* ----------------------------------------------------------------------- *
- *
- * Copyright 1996-2011 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.
- *
- * ----------------------------------------------------------------------- */
- /*
- * outform.c manages a list of output formats, and associates
- * them with their relevant drivers. Also has a
- * routine to find the correct driver given a name
- * for it
- */
- #include "compiler.h"
- #include <stdio.h>
- #include <string.h>
- #define BUILD_DRIVERS_ARRAY
- #include "outform.h"
- const struct ofmt *ofmt_find(const char *name,
- const struct ofmt_alias **ofmt_alias)
- {
- const struct ofmt * const *ofp;
- const struct ofmt *of;
- unsigned int i;
- *ofmt_alias = NULL;
- /* primary targets first */
- for (ofp = drivers; (of = *ofp); ofp++) {
- if (!nasm_stricmp(name, of->shortname))
- return of;
- }
- /* lets walk thru aliases then */
- for (i = 0; i < ARRAY_SIZE(ofmt_aliases); i++) {
- if (ofmt_aliases[i].shortname &&
- !nasm_stricmp(name, ofmt_aliases[i].shortname)) {
- *ofmt_alias = &ofmt_aliases[i];
- return ofmt_aliases[i].ofmt;
- }
- }
- return NULL;
- }
- const struct dfmt *dfmt_find(const struct ofmt *ofmt, const char *name)
- {
- const struct dfmt * const *dfp;
- const struct dfmt *df;
- for (dfp = ofmt->debug_formats; (df = *dfp); dfp++) {
- if (!nasm_stricmp(name, df->shortname))
- return df;
- }
- return NULL;
- }
- void ofmt_list(const struct ofmt *deffmt, FILE * fp)
- {
- const struct ofmt * const *ofp, *of;
- unsigned int i;
- /* primary targets first */
- for (ofp = drivers; (of = *ofp); ofp++) {
- fprintf(fp, " %c %-10s%s\n",
- of == deffmt ? '*' : ' ',
- of->shortname, of->fullname);
- }
- /* lets walk through aliases then */
- for (i = 0; i < ARRAY_SIZE(ofmt_aliases); i++) {
- if (!ofmt_aliases[i].shortname)
- continue;
- fprintf(fp, " %-10s%s\n",
- ofmt_aliases[i].shortname,
- ofmt_aliases[i].fullname);
- }
- }
- void dfmt_list(const struct ofmt *ofmt, FILE *fp)
- {
- const struct dfmt * const *dfp;
- const struct dfmt *df;
- for (dfp = ofmt->debug_formats; (df = *dfp); dfp++) {
- fprintf(fp, " %c %-10s%s\n",
- df == dfmt ? '*' : ' ',
- df->shortname, df->fullname);
- }
- }
|