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
|
/*
* Copyright (C) 2012 Apple Inc. All Rights Reserved.
* Copyright (C) 2015 Yusuke Suzuki <utatane.tea@gmail.com>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef SourceCodeKey_h
#define SourceCodeKey_h
#include "ParserModes.h"
#include "SourceCode.h"
#include <wtf/HashTraits.h>
namespace JSC {
class SourceCodeKey {
public:
enum CodeType { EvalType, ProgramType, FunctionType, ModuleType };
SourceCodeKey()
{
}
SourceCodeKey(const SourceCode& sourceCode, const String& name, CodeType codeType, JSParserBuiltinMode builtinMode, JSParserStrictMode strictMode, ThisTDZMode thisTDZMode = ThisTDZMode::CheckIfNeeded)
: m_sourceCode(sourceCode)
, m_name(name)
, m_flags((static_cast<unsigned>(codeType) << 3) | (static_cast<unsigned>(builtinMode) << 2) | (static_cast<unsigned>(strictMode) << 1) | static_cast<unsigned>(thisTDZMode))
, m_hash(sourceCode.hash())
{
}
SourceCodeKey(WTF::HashTableDeletedValueType)
: m_sourceCode(WTF::HashTableDeletedValue)
{
}
bool isHashTableDeletedValue() const { return m_sourceCode.isHashTableDeletedValue(); }
unsigned hash() const { return m_hash; }
size_t length() const { return m_sourceCode.length(); }
bool isNull() const { return m_sourceCode.isNull(); }
// To save memory, we compute our string on demand. It's expected that source
// providers cache their strings to make this efficient.
StringView string() const { return m_sourceCode.view(); }
bool operator==(const SourceCodeKey& other) const
{
return m_hash == other.m_hash
&& length() == other.length()
&& m_flags == other.m_flags
&& m_name == other.m_name
&& string() == other.string();
}
private:
SourceCode m_sourceCode;
String m_name;
unsigned m_flags;
unsigned m_hash;
};
struct SourceCodeKeyHash {
static unsigned hash(const SourceCodeKey& key) { return key.hash(); }
static bool equal(const SourceCodeKey& a, const SourceCodeKey& b) { return a == b; }
static const bool safeToCompareToEmptyOrDeleted = false;
};
struct SourceCodeKeyHashTraits : SimpleClassHashTraits<SourceCodeKey> {
static const bool hasIsEmptyValueFunction = true;
static bool isEmptyValue(const SourceCodeKey& sourceCodeKey) { return sourceCodeKey.isNull(); }
};
}
#endif // SourceCodeKey_h
|
