rbtree: add rb_search_exact()
[nasm.git] / output / outform.c
bloba2fdde84f30c21b70b256b78529b5683fe9c4ea4
1 /* ----------------------------------------------------------------------- *
2 *
3 * Copyright 1996-2011 The NASM Authors - All Rights Reserved
4 * See the file AUTHORS included with the NASM distribution for
5 * the specific copyright holders.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following
9 * conditions are met:
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
30 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 * ----------------------------------------------------------------------- */
35 * outform.c manages a list of output formats, and associates
36 * them with their relevant drivers. Also has a
37 * routine to find the correct driver given a name
38 * for it
41 #include "compiler.h"
44 #define BUILD_DRIVERS_ARRAY
45 #include "outform.h"
46 #include "outlib.h"
48 const struct ofmt *ofmt_find(const char *name,
49 const struct ofmt_alias **ofmt_alias)
51 const struct ofmt * const *ofp;
52 const struct ofmt *of;
53 unsigned int i;
55 *ofmt_alias = NULL;
57 /* primary targets first */
58 for (ofp = drivers; (of = *ofp); ofp++) {
59 if (!nasm_stricmp(name, of->shortname))
60 return of;
63 /* lets walk thru aliases then */
64 for (i = 0; i < ARRAY_SIZE(ofmt_aliases); i++) {
65 if (ofmt_aliases[i].shortname &&
66 !nasm_stricmp(name, ofmt_aliases[i].shortname)) {
67 *ofmt_alias = &ofmt_aliases[i];
68 return ofmt_aliases[i].ofmt;
72 return NULL;
75 const struct dfmt *dfmt_find(const struct ofmt *ofmt, const char *name)
77 const struct dfmt * const *dfp;
78 const struct dfmt *df;
80 for (dfp = ofmt->debug_formats; (df = *dfp); dfp++) {
81 if (!nasm_stricmp(name, df->shortname))
82 return df;
84 return NULL;
87 void ofmt_list(const struct ofmt *deffmt, FILE * fp)
89 const struct ofmt * const *ofp, *of;
90 unsigned int i;
92 /* primary targets first */
93 for (ofp = drivers; (of = *ofp); ofp++) {
94 fprintf(fp, " %-20s %s%s\n",
95 of->shortname,
96 of->fullname,
97 of == deffmt ? " [default]" : "");
100 /* lets walk through aliases then */
101 for (i = 0; i < ARRAY_SIZE(ofmt_aliases); i++) {
102 if (!ofmt_aliases[i].shortname)
103 continue;
104 fprintf(fp, " %-20s Legacy alias for \"%s\"\n",
105 ofmt_aliases[i].shortname,
106 ofmt_aliases[i].ofmt->shortname);
110 void dfmt_list(FILE *fp)
112 const struct ofmt * const *ofp;
113 const struct ofmt *of;
114 const struct dfmt * const *dfp;
115 const struct dfmt *df;
116 char prefixbuf[32];
117 const char *prefix;
119 for (ofp = drivers; (of = *ofp); ofp++) {
120 if (of->debug_formats && of->debug_formats != null_debug_arr) {
121 snprintf(prefixbuf, sizeof prefixbuf, "%s:",
122 of->shortname);
123 prefix = prefixbuf;
125 for (dfp = of->debug_formats; (df = *dfp); dfp++) {
126 if (df != &null_debug_form)
127 fprintf(fp, " %-10s %-9s %s%s\n",
128 prefix,
129 df->shortname, df->fullname,
130 df == of->default_dfmt ? " [default]" : "");
131 prefix = "";