Coverage Report

Created: 2020-02-25 14:32

/Users/buildslave/jenkins/workspace/coverage/llvm-project/clang/lib/Lex/HeaderMap.cpp
Line
Count
Source (jump to first uncovered line)
1
//===--- HeaderMap.cpp - A file that acts like dir of symlinks ------------===//
2
//
3
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4
// See https://llvm.org/LICENSE.txt for license information.
5
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6
//
7
//===----------------------------------------------------------------------===//
8
//
9
// This file implements the HeaderMap interface.
10
//
11
//===----------------------------------------------------------------------===//
12
13
#include "clang/Lex/HeaderMap.h"
14
#include "clang/Lex/HeaderMapTypes.h"
15
#include "clang/Basic/CharInfo.h"
16
#include "clang/Basic/FileManager.h"
17
#include "llvm/ADT/SmallString.h"
18
#include "llvm/Support/Compiler.h"
19
#include "llvm/Support/DataTypes.h"
20
#include "llvm/Support/MathExtras.h"
21
#include "llvm/Support/MemoryBuffer.h"
22
#include "llvm/Support/SwapByteOrder.h"
23
#include "llvm/Support/Debug.h"
24
#include <cstring>
25
#include <memory>
26
using namespace clang;
27
28
/// HashHMapKey - This is the 'well known' hash function required by the file
29
/// format, used to look up keys in the hash table.  The hash table uses simple
30
/// linear probing based on this function.
31
59
static inline unsigned HashHMapKey(StringRef Str) {
32
59
  unsigned Result = 0;
33
59
  const char *S = Str.begin(), *End = Str.end();
34
59
35
627
  for (; S != End; 
S++568
)
36
568
    Result += toLowercase(*S) * 13;
37
59
  return Result;
38
59
}
39
40
41
42
//===----------------------------------------------------------------------===//
43
// Verification and Construction
44
//===----------------------------------------------------------------------===//
45
46
/// HeaderMap::Create - This attempts to load the specified file as a header
47
/// map.  If it doesn't look like a HeaderMap, it gives up and returns null.
48
/// If it looks like a HeaderMap but is obviously corrupted, it puts a reason
49
/// into the string error argument and returns null.
50
std::unique_ptr<HeaderMap> HeaderMap::Create(const FileEntry *FE,
51
33
                                             FileManager &FM) {
52
33
  // If the file is too small to be a header map, ignore it.
53
33
  unsigned FileSize = FE->getSize();
54
33
  if (FileSize <= sizeof(HMapHeader)) 
return nullptr4
;
55
29
56
29
  auto FileBuffer = FM.getBufferForFile(FE);
57
29
  if (!FileBuffer || !*FileBuffer)
58
0
    return nullptr;
59
29
  bool NeedsByteSwap;
60
29
  if (!checkHeader(**FileBuffer, NeedsByteSwap))
61
0
    return nullptr;
62
29
  return std::unique_ptr<HeaderMap>(new HeaderMap(std::move(*FileBuffer), NeedsByteSwap));
63
29
}
64
65
bool HeaderMapImpl::checkHeader(const llvm::MemoryBuffer &File,
66
42
                                bool &NeedsByteSwap) {
67
42
  if (File.getBufferSize() <= sizeof(HMapHeader))
68
2
    return false;
69
40
  const char *FileStart = File.getBufferStart();
70
40
71
40
  // We know the file is at least as big as the header, check it now.
72
40
  const HMapHeader *Header = reinterpret_cast<const HMapHeader*>(FileStart);
73
40
74
40
  // Sniff it to see if it's a headermap by checking the magic number and
75
40
  // version.
76
40
  if (Header->Magic == HMAP_HeaderMagicNumber &&
77
40
      
Header->Version == HMAP_HeaderVersion38
)
78
37
    NeedsByteSwap = false;
79
3
  else if (Header->Magic == llvm::ByteSwap_32(HMAP_HeaderMagicNumber) &&
80
3
           
Header->Version == llvm::ByteSwap_16(HMAP_HeaderVersion)1
)
81
1
    NeedsByteSwap = true;  // Mixed endianness headermap.
82
2
  else
83
2
    return false;  // Not a header map.
84
38
85
38
  if (Header->Reserved != 0)
86
1
    return false;
87
37
88
37
  // Check the number of buckets.  It should be a power of two, and there
89
37
  // should be enough space in the file for all of them.
90
37
  uint32_t NumBuckets = NeedsByteSwap
91
37
                            ? 
llvm::sys::getSwappedBytes(Header->NumBuckets)1
92
37
                            : 
Header->NumBuckets36
;
93
37
  if (!llvm::isPowerOf2_32(NumBuckets))
94
2
    return false;
95
35
  if (File.getBufferSize() <
96
35
      sizeof(HMapHeader) + sizeof(HMapBucket) * NumBuckets)
97
1
    return false;
98
34
99
34
  // Okay, everything looks good.
100
34
  return true;
101
34
}
102
103
//===----------------------------------------------------------------------===//
104
//  Utility Methods
105
//===----------------------------------------------------------------------===//
106
107
108
/// getFileName - Return the filename of the headermap.
109
0
StringRef HeaderMapImpl::getFileName() const {
110
0
  return FileBuffer->getBufferIdentifier();
111
0
}
112
113
360
unsigned HeaderMapImpl::getEndianAdjustedWord(unsigned X) const {
114
360
  if (!NeedsBSwap) return X;
115
0
  return llvm::ByteSwap_32(X);
116
0
}
117
118
/// getHeader - Return a reference to the file header, in unbyte-swapped form.
119
/// This method cannot fail.
120
135
const HMapHeader &HeaderMapImpl::getHeader() const {
121
135
  // We know the file is at least as big as the header.  Return it.
122
135
  return *reinterpret_cast<const HMapHeader*>(FileBuffer->getBufferStart());
123
135
}
124
125
/// getBucket - Return the specified hash table bucket from the header map,
126
/// bswap'ing its fields as appropriate.  If the bucket number is not valid,
127
/// this return a bucket with an empty key (0).
128
75
HMapBucket HeaderMapImpl::getBucket(unsigned BucketNo) const {
129
75
  assert(FileBuffer->getBufferSize() >=
130
75
             sizeof(HMapHeader) + sizeof(HMapBucket) * BucketNo &&
131
75
         "Expected bucket to be in range");
132
75
133
75
  HMapBucket Result;
134
75
  Result.Key = HMAP_EmptyBucketKey;
135
75
136
75
  const HMapBucket *BucketArray =
137
75
    reinterpret_cast<const HMapBucket*>(FileBuffer->getBufferStart() +
138
75
                                        sizeof(HMapHeader));
139
75
  const HMapBucket *BucketPtr = BucketArray+BucketNo;
140
75
141
75
  // Load the values, bswapping as needed.
142
75
  Result.Key    = getEndianAdjustedWord(BucketPtr->Key);
143
75
  Result.Prefix = getEndianAdjustedWord(BucketPtr->Prefix);
144
75
  Result.Suffix = getEndianAdjustedWord(BucketPtr->Suffix);
145
75
  return Result;
146
75
}
147
148
76
Optional<StringRef> HeaderMapImpl::getString(unsigned StrTabIdx) const {
149
76
  // Add the start of the string table to the idx.
150
76
  StrTabIdx += getEndianAdjustedWord(getHeader().StringsOffset);
151
76
152
76
  // Check for invalid index.
153
76
  if (StrTabIdx >= FileBuffer->getBufferSize())
154
0
    return None;
155
76
156
76
  const char *Data = FileBuffer->getBufferStart() + StrTabIdx;
157
76
  unsigned MaxLen = FileBuffer->getBufferSize() - StrTabIdx;
158
76
  unsigned Len = strnlen(Data, MaxLen);
159
76
160
76
  // Check whether the buffer is null-terminated.
161
76
  if (Len == MaxLen && 
Data[Len - 1]2
)
162
2
    return None;
163
74
164
74
  return StringRef(Data, Len);
165
74
}
166
167
//===----------------------------------------------------------------------===//
168
// The Main Drivers
169
//===----------------------------------------------------------------------===//
170
171
/// dump - Print the contents of this headermap to stderr.
172
0
LLVM_DUMP_METHOD void HeaderMapImpl::dump() const {
173
0
  const HMapHeader &Hdr = getHeader();
174
0
  unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets);
175
0
176
0
  llvm::dbgs() << "Header Map " << getFileName() << ":\n  " << NumBuckets
177
0
               << ", " << getEndianAdjustedWord(Hdr.NumEntries) << "\n";
178
0
179
0
  auto getStringOrInvalid = [this](unsigned Id) -> StringRef {
180
0
    if (Optional<StringRef> S = getString(Id))
181
0
      return *S;
182
0
    return "<invalid>";
183
0
  };
184
0
185
0
  for (unsigned i = 0; i != NumBuckets; ++i) {
186
0
    HMapBucket B = getBucket(i);
187
0
    if (B.Key == HMAP_EmptyBucketKey) continue;
188
0
189
0
    StringRef Key = getStringOrInvalid(B.Key);
190
0
    StringRef Prefix = getStringOrInvalid(B.Prefix);
191
0
    StringRef Suffix = getStringOrInvalid(B.Suffix);
192
0
    llvm::dbgs() << "  " << i << ". " << Key << " -> '" << Prefix << "' '"
193
0
                 << Suffix << "'\n";
194
0
  }
195
0
}
196
197
/// LookupFile - Check to see if the specified relative filename is located in
198
/// this HeaderMap.  If so, open it and return its FileEntry.
199
Optional<FileEntryRef> HeaderMap::LookupFile(StringRef Filename,
200
17
                                             FileManager &FM) const {
201
17
202
17
  SmallString<1024> Path;
203
17
  StringRef Dest = HeaderMapImpl::lookupFilename(Filename, Path);
204
17
  if (Dest.empty())
205
17
    return None;
206
0
207
0
  return FM.getOptionalFileRef(Dest);
208
0
}
209
210
StringRef HeaderMapImpl::lookupFilename(StringRef Filename,
211
59
                                        SmallVectorImpl<char> &DestPath) const {
212
59
  const HMapHeader &Hdr = getHeader();
213
59
  unsigned NumBuckets = getEndianAdjustedWord(Hdr.NumBuckets);
214
59
215
59
  // Don't probe infinitely.  This should be checked before constructing.
216
59
  assert(llvm::isPowerOf2_32(NumBuckets) && "Expected power of 2");
217
59
218
59
  // Linearly probe the hash table.
219
75
  for (unsigned Bucket = HashHMapKey(Filename);; 
++Bucket16
) {
220
75
    HMapBucket B = getBucket(Bucket & (NumBuckets-1));
221
75
    if (B.Key == HMAP_EmptyBucketKey) 
return StringRef()39
; // Hash miss.
222
36
223
36
    // See if the key matches.  If not, probe on.
224
36
    Optional<StringRef> Key = getString(B.Key);
225
36
    if (LLVM_UNLIKELY(!Key))
226
36
      
continue0
;
227
36
    if (!Filename.equals_lower(*Key))
228
16
      continue;
229
20
230
20
    // If so, we have a match in the hash table.  Construct the destination
231
20
    // path.
232
20
    Optional<StringRef> Prefix = getString(B.Prefix);
233
20
    Optional<StringRef> Suffix = getString(B.Suffix);
234
20
235
20
    DestPath.clear();
236
20
    if (LLVM_LIKELY(Prefix && Suffix)) {
237
18
      DestPath.append(Prefix->begin(), Prefix->end());
238
18
      DestPath.append(Suffix->begin(), Suffix->end());
239
18
    }
240
20
    return StringRef(DestPath.begin(), DestPath.size());
241
20
  }
242
59
}