1 /* ----------------------------------------------------------------------- *
3 * Copyright 2017 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
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 * Common string table handling
37 * A number of output formats use a "string table"; a container for
38 * a number of strings which may be reused at will. This implements
39 * a string table which eliminates duplicates and returns the index
40 * into the string table when queried.
56 void strtbl_init(struct nasm_strtbl
*tbl
)
59 hash_init(&tbl
->hash
, HASH_LARGE
);
60 strtbl_find(tbl
, "", true); /* Index 0 is always an empty string */
63 void strtbl_free(struct nasm_strtbl
*tbl
)
65 struct hash_tbl_node
*iter
= NULL
;
66 struct strtbl_entry
*se
;
68 while ((se
= hash_iterate(&tbl
->hash
, &iter
, NULL
)))
71 hash_free(&tbl
->hash
);
74 size_t strtbl_find(struct nasm_strtbl
*tbl
, const char *str
, bool add
)
76 struct hash_insert hi
;
78 struct strtbl_entry
*se
;
80 dp
= hash_find(&tbl
->hash
, str
, &hi
);
84 size_t bytes
= strlen(str
) + 1;
86 se
= nasm_malloc(sizeof(struct strtbl_entry
)-1+bytes
);
87 se
->index
= tbl
->size
;
90 memcpy(se
->str
, str
, bytes
);
92 hash_add(&hi
, se
->str
, se
);
100 /* This create a linearized buffer containing the actual string table */
101 void *strtbl_generate(const struct nasm_strtbl
*tbl
)
103 char *buf
= nasm_malloc(strtbl_size(tbl
));
104 struct hash_tbl_node
*iter
= NULL
;
105 struct strtbl_entry
*se
;
107 while ((se
= hash_iterate(&tbl
->hash
, &iter
, NULL
)))
108 memcpy(buf
+ se
->index
, se
->str
, se
->bytes
);