1 /* ----------------------------------------------------------------------- *
3 * Copyright 1996-2018 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 * strlist.c - list of unique, ordered strings
41 * Create a string list
43 StrList
*strlist_allocate(void)
48 hash_init(&list
->hash
, HASH_MEDIUM
);
49 list
->tailp
= &list
->head
;
55 * Append a string to a string list if and only if it isn't
56 * already there. Return true if it was added.
58 bool strlist_add_string(StrList
*list
, const char *str
)
60 struct hash_insert hi
;
61 struct strlist_entry
*sl
;
67 if (hash_find(&list
->hash
, str
, &hi
))
68 return false; /* Already present */
72 sl
= nasm_malloc(sizeof(struct strlist_entry
) + l
);
74 memcpy(sl
->str
, str
, l
+1);
77 list
->tailp
= &sl
->next
;
79 hash_add(&hi
, sl
->str
, (void *)sl
);
86 void strlist_free(StrList
*list
)
91 hash_free_all(&list
->hash
, false);