Protocol Buffers - Google's data interchange format (grpc依赖)
https://developers.google.com/protocol-buffers/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
152 lines
3.5 KiB
152 lines
3.5 KiB
// Protocol Buffers - Google's data interchange format |
|
// Copyright 2023 Google LLC. All rights reserved. |
|
// https://developers.google.com/protocol-buffers/ |
|
// |
|
// Redistribution and use in source and binary forms, with or without |
|
// modification, are permitted provided that the following conditions are |
|
// met: |
|
// |
|
// * Redistributions of source code must retain the above copyright |
|
// notice, this list of conditions and the following disclaimer. |
|
// * 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. |
|
// * Neither the name of Google LLC nor the names of its |
|
// contributors may be used to endorse or promote products derived from |
|
// this software without specific prior written permission. |
|
// |
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
|
// "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 THE COPYRIGHT |
|
// OWNER 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. |
|
|
|
#include "upbc/keywords.h" |
|
|
|
#include <string> |
|
#include <unordered_set> |
|
|
|
namespace upbc { |
|
|
|
static const char* const kKeywordList[] = { |
|
// |
|
"NULL", |
|
"alignas", |
|
"alignof", |
|
"and", |
|
"and_eq", |
|
"asm", |
|
"auto", |
|
"bitand", |
|
"bitor", |
|
"bool", |
|
"break", |
|
"case", |
|
"catch", |
|
"char", |
|
"class", |
|
"compl", |
|
"const", |
|
"constexpr", |
|
"const_cast", |
|
"continue", |
|
"decltype", |
|
"default", |
|
"delete", |
|
"do", |
|
"double", |
|
"dynamic_cast", |
|
"else", |
|
"enum", |
|
"explicit", |
|
"export", |
|
"extern", |
|
"false", |
|
"float", |
|
"for", |
|
"friend", |
|
"goto", |
|
"if", |
|
"inline", |
|
"int", |
|
"long", |
|
"mutable", |
|
"namespace", |
|
"new", |
|
"noexcept", |
|
"not", |
|
"not_eq", |
|
"nullptr", |
|
"operator", |
|
"or", |
|
"or_eq", |
|
"private", |
|
"protected", |
|
"public", |
|
"register", |
|
"reinterpret_cast", |
|
"return", |
|
"short", |
|
"signed", |
|
"sizeof", |
|
"static", |
|
"static_assert", |
|
"static_cast", |
|
"struct", |
|
"switch", |
|
"template", |
|
"this", |
|
"thread_local", |
|
"throw", |
|
"true", |
|
"try", |
|
"typedef", |
|
"typeid", |
|
"typename", |
|
"union", |
|
"unsigned", |
|
"using", |
|
"virtual", |
|
"void", |
|
"volatile", |
|
"wchar_t", |
|
"while", |
|
"xor", |
|
"xor_eq", |
|
"char8_t", |
|
"char16_t", |
|
"char32_t", |
|
"concept", |
|
"consteval", |
|
"constinit", |
|
"co_await", |
|
"co_return", |
|
"co_yield", |
|
"requires", |
|
}; |
|
|
|
static std::unordered_set<std::string>* MakeKeywordsMap() { |
|
auto* result = new std::unordered_set<std::string>(); |
|
for (const auto keyword : kKeywordList) { |
|
result->emplace(keyword); |
|
} |
|
return result; |
|
} |
|
|
|
static std::unordered_set<std::string>& kKeywords = *MakeKeywordsMap(); |
|
|
|
std::string ResolveKeywordConflict(const std::string& name) { |
|
if (kKeywords.count(name) > 0) { |
|
return name + "_"; |
|
} |
|
return name; |
|
} |
|
|
|
} // namespace upbc
|
|
|