Hash :
a02670d6
Author :
Date :
2025-08-26T20:41:16
Move unsafe buffers inside header guard macros While this is exactly opposite of what Chromium has chosen to do, there is an issue with clang-format trying to indent preprocessor directives four spaces relative to include guard. This is because Angle's .clang-format file specifies IndentPPDirectives: AfterHash but Chromium's does not. The current placement is sufficient to throw off clang-format's guard detection since the guard macro no longer covers the entire file. Bug: b/436880895 Change-Id: Ic6b99c8cef6213939cdf9b42af8730e1eb423065 Reviewed-on: https://chromium-review.googlesource.com/c/angle/angle/+/6885892 Reviewed-by: Geoff Lang <geofflang@chromium.org> Commit-Queue: Geoff Lang <geofflang@chromium.org> Auto-Submit: Tom Sepez <tsepez@chromium.org> Reviewed-by: Shahbaz Youssefi <syoussefi@chromium.org>
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
//
// Copyright 2002 The ANGLE Project Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
#ifndef COMPILER_TRANSLATOR_COMMON_H_
#define COMPILER_TRANSLATOR_COMMON_H_
#ifdef UNSAFE_BUFFERS_BUILD
# pragma allow_unsafe_buffers
#endif
#include <stdio.h>
#include <limits>
#include <map>
#include <sstream>
#include <string>
#include <string_view>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include "common/angleutils.h"
#include "common/debug.h"
#include "compiler/translator/PoolAlloc.h"
namespace sh
{
struct TSourceLoc
{
int first_file;
int first_line;
int last_file;
int last_line;
};
constexpr TSourceLoc kNoSourceLoc{-1, -1, -1, -1};
//
// Put POOL_ALLOCATOR_NEW_DELETE in base classes to make them use this scheme.
//
#define POOL_ALLOCATOR_NEW_DELETE \
void *operator new(size_t s) \
{ \
return GetGlobalPoolAllocator()->allocate(s); \
} \
void *operator new(size_t, void *_Where) \
{ \
return (_Where); \
} \
void operator delete(void *) \
{} \
void operator delete(void *, void *) \
{} \
void *operator new[](size_t s) \
{ \
return GetGlobalPoolAllocator()->allocate(s); \
} \
void *operator new[](size_t, void *_Where) \
{ \
return (_Where); \
} \
void operator delete[](void *) \
{} \
void operator delete[](void *, void *) \
{}
//
// Pool version of string.
//
typedef pool_allocator<char> TStringAllocator;
typedef std::basic_string<char, std::char_traits<char>, TStringAllocator> TString;
typedef std::basic_ostringstream<char, std::char_traits<char>, TStringAllocator> TStringStream;
//
// Persistent memory. Should only be used for strings that survive across compiles.
//
using TPersistString = std::string;
using TPersistStringStream = std::ostringstream;
//
// Pool allocator versions of vectors, lists, and maps
//
template <class T>
class TVector : public std::vector<T, pool_allocator<T>>
{
public:
static constexpr bool is_pool_allocated = true;
POOL_ALLOCATOR_NEW_DELETE
typedef typename std::vector<T, pool_allocator<T>>::size_type size_type;
TVector() : std::vector<T, pool_allocator<T>>() {}
TVector(const pool_allocator<T> &a) : std::vector<T, pool_allocator<T>>(a) {}
TVector(size_type i) : std::vector<T, pool_allocator<T>>(i) {}
TVector(size_type i, const T &value) : std::vector<T, pool_allocator<T>>(i, value) {}
template <typename InputIt>
TVector(InputIt first, InputIt last) : std::vector<T, pool_allocator<T>>(first, last)
{}
TVector(std::initializer_list<T> init) : std::vector<T, pool_allocator<T>>(init) {}
};
template <class K, class D, class H = std::hash<K>, class CMP = std::equal_to<K>>
class TUnorderedMap : public std::unordered_map<K, D, H, CMP, pool_allocator<std::pair<const K, D>>>
{
public:
POOL_ALLOCATOR_NEW_DELETE
typedef pool_allocator<std::pair<const K, D>> tAllocator;
TUnorderedMap() : std::unordered_map<K, D, H, CMP, tAllocator>() {}
// use correct two-stage name lookup supported in gcc 3.4 and above
TUnorderedMap(const tAllocator &a)
: std::unordered_map<K, D, H, CMP, tAllocator>(
std::unordered_map<K, D, H, CMP, tAllocator>::key_compare(),
a)
{}
};
template <class K, class H = std::hash<K>, class CMP = std::equal_to<K>>
class TUnorderedSet : public std::unordered_set<K, H, CMP, pool_allocator<K>>
{
public:
POOL_ALLOCATOR_NEW_DELETE
typedef pool_allocator<K> tAllocator;
TUnorderedSet() : std::unordered_set<K, H, CMP, tAllocator>() {}
// use correct two-stage name lookup supported in gcc 3.4 and above
TUnorderedSet(const tAllocator &a)
: std::unordered_set<K, H, CMP, tAllocator>(
std::unordered_set<K, H, CMP, tAllocator>::key_compare(),
a)
{}
};
template <class K, class D, class CMP = std::less<K>>
class TMap : public std::map<K, D, CMP, pool_allocator<std::pair<const K, D>>>
{
public:
POOL_ALLOCATOR_NEW_DELETE
typedef pool_allocator<std::pair<const K, D>> tAllocator;
TMap() : std::map<K, D, CMP, tAllocator>() {}
// use correct two-stage name lookup supported in gcc 3.4 and above
TMap(const tAllocator &a)
: std::map<K, D, CMP, tAllocator>(std::map<K, D, CMP, tAllocator>::key_compare(), a)
{}
};
template <class K, class CMP = std::less<K>>
class TSet : public std::set<K, CMP, pool_allocator<K>>
{
public:
POOL_ALLOCATOR_NEW_DELETE
typedef pool_allocator<K> tAllocator;
TSet() : std::set<K, CMP, tAllocator>() {}
// use correct two-stage name lookup supported in gcc 3.4 and above
TSet(const tAllocator &a)
: std::set<K, CMP, tAllocator>(std::map<K, CMP, tAllocator>::key_compare(), a)
{}
};
// Integer to TString conversion
template <typename T>
inline TString str(T i)
{
ASSERT(std::numeric_limits<T>::is_integer);
char buffer[((8 * sizeof(T)) / 3) + 3];
const char *formatStr = std::numeric_limits<T>::is_signed ? "%d" : "%u";
snprintf(buffer, sizeof(buffer), formatStr, i);
return buffer;
}
// Allocate a char array in the global memory pool. str must be a null terminated string. strLength
// is the length without the null terminator.
inline const char *AllocatePoolCharArray(const char *str, size_t strLength)
{
size_t requiredSize = strLength + 1;
char *buffer = static_cast<char *>(GetGlobalPoolAllocator()->allocate(requiredSize));
memcpy(buffer, str, requiredSize);
ASSERT(buffer[strLength] == '\0');
return buffer;
}
// Initialize a new stream which must be imbued with the classic locale
template <typename T>
T InitializeStream()
{
T stream;
stream.imbue(std::locale::classic());
return stream;
}
} // namespace sh
namespace std
{
template <>
struct hash<sh::TString>
{
size_t operator()(const sh::TString &s) const
{
auto v = std::string_view(s.data(), static_cast<int>(s.length()));
return std::hash<std::string_view>{}(v);
}
};
} // namespace std
#endif // COMPILER_TRANSLATOR_COMMON_H_