aboutsummaryrefslogtreecommitdiff
path: root/gold/stringpool.cc
blob: b1a2ce24336f35026d451d4b774d9ee2ccfa6570 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
// stringpool.cc -- a string pool for gold

#include "gold.h"

#include <cassert>
#include <cstring>
#include <algorithm>
#include <vector>

#include "output.h"
#include "stringpool.h"

namespace gold
{

Stringpool::Stringpool()
  : string_set_(), strings_(), strtab_size_(0)
{
}

Stringpool::~Stringpool()
{
  for (std::list<Stringdata*>::iterator p = this->strings_.begin();
       p != this->strings_.end();
       ++p)
    delete[] reinterpret_cast<char*>(*p);
}

// Hash function.

size_t
Stringpool::Stringpool_hash::operator()(const char* s) const
{
  // Fowler/Noll/Vo (FNV) hash (type FNV-1a).
  if (sizeof(size_t) == 8)
    {
      size_t result = static_cast<size_t>(14695981039346656037ULL);
      while (*s != '\0')
	{
	  result &= (size_t) *s++;
	  result *= 1099511628211ULL;
	}
      return result;
    }
  else
    {
      size_t result = 2166136261UL;
      while (*s != '\0')
	{
	  result ^= (size_t) *s++;
	  result *= 16777619UL;
	}
      return result;
    }
}

// Add a string to the list of canonical strings.  Return a pointer to
// the canonical string.

const char*
Stringpool::add_string(const char* s)
{
  const size_t buffer_size = 1000;
  size_t len = strlen(s);

  size_t alc;
  bool front = true;
  if (len >= buffer_size)
    {
      alc = sizeof(Stringdata) + len;
      front = false;
    }
  else if (this->strings_.empty())
    alc = sizeof(Stringdata) + buffer_size;
  else
    {
      Stringdata *psd = this->strings_.front();
      if (len >= psd->alc - psd->len)
	alc = sizeof(Stringdata) + buffer_size;
      else
	{
	  char* ret = psd->data + psd->len;
	  memcpy(ret, s, len + 1);
	  psd->len += len + 1;
	  return ret;
	}
    }

  Stringdata *psd = reinterpret_cast<Stringdata*>(new char[alc]);
  psd->alc = alc - sizeof(Stringdata);
  memcpy(psd->data, s, len + 1);
  psd->len = len + 1;
  if (front)
    this->strings_.push_front(psd);
  else
    this->strings_.push_back(psd);
  return psd->data;
}

// Add a string to a string pool.

const char*
Stringpool::add(const char* s)
{
  // FIXME: This will look up the entry twice in the hash table.  The
  // problem is that we can't insert S before we canonicalize it.  I
  // don't think there is a way to handle this correctly with
  // unordered_map, so this should be replaced with custom code to do
  // what we need, which is to return the empty slot.

  String_set_type::const_iterator p = this->string_set_.find(s);
  if (p != this->string_set_.end())
    return p->first;

  const char* ret = this->add_string(s);
  std::pair<const char*, off_t> val(ret, 0);
  std::pair<String_set_type::iterator, bool> ins =
    this->string_set_.insert(val);
  assert(ins.second);
  return ret;
}

// Add a prefix of a string to a string pool.

const char*
Stringpool::add(const char* s, size_t len)
{
  // FIXME: This implementation should be rewritten when we rewrite
  // the hash table to avoid copying.
  std::string st(s, len);
  return this->add(st);
}

const char*
Stringpool::find(const char* s) const
{
  String_set_type::const_iterator p = this->string_set_.find(s);
  if (p == this->string_set_.end())
    return NULL;
  return p->first;
}

// Comparison routine used when sorting into an ELF strtab.  We want
// to sort this so that when one string is a suffix of another, we
// always see the shorter string immediately after the longer string.
// For example, we want to see these strings in this order:
//   abcd
//   cd
//   d
// When strings are not suffixes, we don't care what order they are
// in, but we need to ensure that suffixes wind up next to each other.
// So we do a reversed lexicographic sort on the reversed string.

bool
Stringpool::Stringpool_sort_comparison::operator()(
  String_set_type::iterator it1,
  String_set_type::iterator it2) const
{
  const char* s1 = it1->first;
  const char* s2 = it2->first;
  int len1 = strlen(s1);
  int len2 = strlen(s2);
  int minlen = len1 < len2 ? len1 : len2;
  const char* p1 = s1 + len1 - 1;
  const char* p2 = s2 + len2 - 1;
  for (int i = minlen - 1; i >= 0; --i, --p1, --p2)
    {
      if (*p1 != *p2)
	return *p1 > *p2;
    }
  return len1 > len2;
}

// Return whether s1 is a suffix of s2.

bool
Stringpool::is_suffix(const char* s1, const char* s2)
{
  size_t len1 = strlen(s1);
  size_t len2 = strlen(s2);
  if (len1 > len2)
    return false;
  return strcmp(s1, s2 + len2 - len1) == 0;
}

// Turn the stringpool into an ELF strtab: determine the offsets of
// each string in the table.

void
Stringpool::set_string_offsets()
{
  size_t count = this->string_set_.size();

  std::vector<String_set_type::iterator> v;
  v.reserve(count);

  for (String_set_type::iterator p = this->string_set_.begin();
       p != this->string_set_.end();
       ++p)
    v.push_back(p);

  std::sort(v.begin(), v.end(), Stringpool_sort_comparison());

  // Offset 0 is reserved for the empty string.
  off_t offset = 1;
  for (size_t i = 0; i < count; ++i)
    {
      if (v[i]->first[0] == '\0')
	v[i]->second = 0;
      else if (i > 0 && Stringpool::is_suffix(v[i]->first, v[i - 1]->first))
	v[i]->second = (v[i - 1]->second
			+ strlen(v[i - 1]->first)
			- strlen(v[i]->first));
      else
	{
	  v[i]->second = offset;
	  offset += strlen(v[i]->first) + 1;
	}
    }

  this->strtab_size_ = offset;
}

// Get the offset of a string in the ELF strtab.  The string must
// exist.

off_t
Stringpool::get_offset(const char* s) const
{
  String_set_type::const_iterator p = this->string_set_.find(s);
  if (p != this->string_set_.end())
    return p->second;
  abort();
}

// Write the ELF strtab into the output file at the specified offset.

void
Stringpool::write(Output_file* of, off_t offset)
{
  unsigned char* viewu = of->get_output_view(offset, this->strtab_size_);
  char* view = reinterpret_cast<char*>(viewu);
  view[0] = '\0';
  for (String_set_type::const_iterator p = this->string_set_.begin();
       p != this->string_set_.end();
       ++p)
    strcpy(view + p->second, p->first);
  of->write_output_view(offset, this->strtab_size_, viewu);
}

} // End namespace gold.