strtbl.c 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118
  1. /* ----------------------------------------------------------------------- *
  2. *
  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.
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following
  9. * conditions are met:
  10. *
  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.
  17. *
  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.
  31. *
  32. * ----------------------------------------------------------------------- */
  33. /*
  34. * Common string table handling
  35. *
  36. * A number of output formats use a "string table"; a container for
  37. * a number of strings which may be reused at will. This implements
  38. * a string table which eliminates duplicates and returns the index
  39. * into the string table when queried.
  40. */
  41. #include "compiler.h"
  42. #include "nasm.h"
  43. #include "nasmlib.h"
  44. #include "error.h"
  45. #include "strtbl.h"
  46. struct strtbl_entry {
  47. size_t index;
  48. size_t bytes;
  49. char str[1];
  50. };
  51. void strtbl_init(struct nasm_strtbl *tbl)
  52. {
  53. tbl->size = 0;
  54. hash_init(&tbl->hash, HASH_LARGE);
  55. strtbl_add(tbl, ""); /* Index 0 is always an empty string */
  56. }
  57. void strtbl_free(struct nasm_strtbl *tbl)
  58. {
  59. hash_free_all(&tbl->hash, false);
  60. }
  61. size_t strtbl_add(struct nasm_strtbl *tbl, const char *str)
  62. {
  63. void **sep;
  64. struct strtbl_entry *se;
  65. struct hash_insert hi;
  66. sep = hash_find(&tbl->hash, str, &hi);
  67. if (sep) {
  68. se = *sep;
  69. } else {
  70. size_t bytes = strlen(str) + 1;
  71. se = nasm_malloc(sizeof(struct strtbl_entry)-1+bytes);
  72. se->index = tbl->size;
  73. tbl->size += bytes;
  74. se->bytes = bytes;
  75. memcpy(se->str, str, bytes);
  76. hash_add(&hi, se->str, se);
  77. }
  78. return se->index;
  79. }
  80. size_t strtbl_find(struct nasm_strtbl *tbl, const char *str)
  81. {
  82. void **sep;
  83. struct strtbl_entry *se;
  84. sep = hash_find(&tbl->hash, str, NULL);
  85. if (sep) {
  86. se = *sep;
  87. return se->index;
  88. } else {
  89. return STRTBL_NONE;
  90. }
  91. }
  92. /* This create a linearized buffer containing the actual string table */
  93. void *strtbl_generate(const struct nasm_strtbl *tbl)
  94. {
  95. char *buf = nasm_malloc(strtbl_size(tbl));
  96. struct hash_tbl_node *iter = NULL;
  97. struct strtbl_entry *se;
  98. while ((se = hash_iterate(&tbl->hash, &iter, NULL)))
  99. memcpy(buf + se->index, se->str, se->bytes);
  100. return buf;
  101. }