2009-06-29 08:25:15 +08:00
|
|
|
/* ----------------------------------------------------------------------- *
|
|
|
|
*
|
2011-04-06 22:32:15 +08:00
|
|
|
* Copyright 1996-2011 The NASM Authors - All Rights Reserved
|
2009-06-29 08:25:15 +08:00
|
|
|
* 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
|
2007-10-20 05:42:29 +08:00
|
|
|
* them with their relevant drivers. Also has a
|
|
|
|
* routine to find the correct driver given a name
|
|
|
|
* for it
|
2002-05-01 04:51:32 +08:00
|
|
|
*/
|
|
|
|
|
2007-10-03 12:53:51 +08:00
|
|
|
#include "compiler.h"
|
|
|
|
|
2002-05-01 04:51:32 +08:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <string.h>
|
2002-05-01 04:53:55 +08:00
|
|
|
|
|
|
|
#define BUILD_DRIVERS_ARRAY
|
2016-05-26 03:06:29 +08:00
|
|
|
#include "outform.h"
|
2002-05-01 04:51:32 +08:00
|
|
|
|
2016-02-18 18:16:36 +08:00
|
|
|
const struct ofmt *ofmt_find(const char *name,
|
|
|
|
const struct ofmt_alias **ofmt_alias)
|
2010-04-09 19:12:13 +08:00
|
|
|
{
|
2016-02-18 18:16:36 +08:00
|
|
|
const struct ofmt * const *ofp;
|
|
|
|
const struct ofmt *of;
|
2010-04-09 19:12:13 +08:00
|
|
|
unsigned int i;
|
2002-05-01 04:51:32 +08:00
|
|
|
|
2011-04-06 22:32:15 +08:00
|
|
|
*ofmt_alias = NULL;
|
|
|
|
|
2010-04-09 19:12:13 +08:00
|
|
|
/* primary targets first */
|
2009-07-19 09:07:17 +08:00
|
|
|
for (ofp = drivers; (of = *ofp); ofp++) {
|
|
|
|
if (!nasm_stricmp(name, of->shortname))
|
|
|
|
return of;
|
|
|
|
}
|
2010-04-09 19:12:13 +08:00
|
|
|
|
|
|
|
/* lets walk thru aliases then */
|
2010-06-04 02:04:36 +08:00
|
|
|
for (i = 0; i < ARRAY_SIZE(ofmt_aliases); i++) {
|
2010-04-09 19:12:13 +08:00
|
|
|
if (ofmt_aliases[i].shortname &&
|
2011-04-06 22:32:15 +08:00
|
|
|
!nasm_stricmp(name, ofmt_aliases[i].shortname)) {
|
|
|
|
*ofmt_alias = &ofmt_aliases[i];
|
2010-04-09 19:12:13 +08:00
|
|
|
return ofmt_aliases[i].ofmt;
|
2011-04-06 22:32:15 +08:00
|
|
|
}
|
2010-04-09 19:12:13 +08:00
|
|
|
}
|
|
|
|
|
2002-05-01 04:51:32 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
2009-07-19 09:07:17 +08:00
|
|
|
|
2016-02-18 18:16:36 +08:00
|
|
|
const struct dfmt *dfmt_find(const struct ofmt *ofmt, const char *name)
|
2010-04-09 19:12:13 +08:00
|
|
|
{
|
2016-02-18 18:16:36 +08:00
|
|
|
const struct dfmt * const *dfp;
|
|
|
|
const struct dfmt *df;
|
2009-07-19 09:07:17 +08:00
|
|
|
|
|
|
|
for (dfp = ofmt->debug_formats; (df = *dfp); dfp++) {
|
|
|
|
if (!nasm_stricmp(name, df->shortname))
|
|
|
|
return df;
|
2002-05-01 04:53:55 +08:00
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
2002-05-01 04:51:32 +08:00
|
|
|
|
2016-02-18 12:59:22 +08:00
|
|
|
void ofmt_list(const struct ofmt *deffmt, FILE * fp)
|
2002-05-01 04:51:32 +08:00
|
|
|
{
|
2016-02-18 18:16:36 +08:00
|
|
|
const struct ofmt * const *ofp, *of;
|
2010-04-09 19:12:13 +08:00
|
|
|
unsigned int i;
|
2009-07-19 09:07:17 +08:00
|
|
|
|
2010-04-09 19:12:13 +08:00
|
|
|
/* primary targets first */
|
2009-07-19 09:07:17 +08:00
|
|
|
for (ofp = drivers; (of = *ofp); ofp++) {
|
2005-01-16 06:15:51 +08:00
|
|
|
fprintf(fp, " %c %-10s%s\n",
|
2009-07-19 09:07:17 +08:00
|
|
|
of == deffmt ? '*' : ' ',
|
|
|
|
of->shortname, of->fullname);
|
2002-05-01 04:53:55 +08:00
|
|
|
}
|
2010-04-09 19:12:13 +08:00
|
|
|
|
|
|
|
/* lets walk through aliases then */
|
2010-06-04 02:04:36 +08:00
|
|
|
for (i = 0; i < ARRAY_SIZE(ofmt_aliases); i++) {
|
2010-04-09 19:12:13 +08:00
|
|
|
if (!ofmt_aliases[i].shortname)
|
|
|
|
continue;
|
|
|
|
fprintf(fp, " %-10s%s\n",
|
|
|
|
ofmt_aliases[i].shortname,
|
|
|
|
ofmt_aliases[i].fullname);
|
|
|
|
}
|
2002-05-01 04:53:55 +08:00
|
|
|
}
|
2009-07-19 09:07:17 +08:00
|
|
|
|
2016-02-18 12:59:22 +08:00
|
|
|
void dfmt_list(const struct ofmt *ofmt, FILE *fp)
|
2005-01-16 06:15:51 +08:00
|
|
|
{
|
2016-02-18 18:16:36 +08:00
|
|
|
const struct dfmt * const *dfp;
|
|
|
|
const struct dfmt *df;
|
2002-05-01 04:53:55 +08:00
|
|
|
|
2009-07-19 09:07:17 +08:00
|
|
|
for (dfp = ofmt->debug_formats; (df = *dfp); dfp++) {
|
|
|
|
fprintf(fp, " %c %-10s%s\n",
|
2016-02-18 12:55:08 +08:00
|
|
|
df == dfmt ? '*' : ' ',
|
2009-07-19 09:07:17 +08:00
|
|
|
df->shortname, df->fullname);
|
2002-05-01 04:53:55 +08:00
|
|
|
}
|
2002-05-01 04:51:32 +08:00
|
|
|
}
|