// Copyright 2006-2012, the V8 project authors. All rights reserved. // 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 Inc. 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. // // Modifications as part of cpp-ethereum under the following license: // // cpp-ethereum is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // cpp-ethereum is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with cpp-ethereum. If not, see . #include #include using namespace std; namespace dev { namespace solidity { tuple ElementaryTypeNameToken::parseDetails(Token::Value _baseType, string const& _details) { solAssert(Token::isElementaryTypeName(_baseType), ""); string baseType = Token::toString(_baseType); if (_details.length() == 0) return make_tuple(baseType, 0, 0); if (baseType == "bytesM") { for (unsigned m = 1; m <= 32; m++) if (to_string(m) == _details) return make_tuple(baseType.substr(0, baseType.size()-1) + to_string(m), m, 0); } else if (baseType == "uintM" || baseType == "intM") { for (unsigned m = 8; m <= 256; m+=8) if (to_string(m) == _details) return make_tuple(baseType.substr(0, baseType.size()-1) + to_string(m), m, 0); } else if (baseType == "ufixedMxN" || baseType == "fixedMxN") { for (unsigned m = 0; m <= 256; m+=8) for (unsigned n = 8; m + n <= 256; n+=8) if ((to_string(m) + "x" + to_string(n)) == _details) return make_tuple(baseType.substr(0, baseType.size()-3) + to_string(m) + "x" + to_string(n), m, n); } BOOST_THROW_EXCEPTION(Error(Error::Type::TypeError) << errinfo_comment("Cannot create elementary type name token out of type " + baseType + " and size " + _details) ); } #define T(name, string, precedence) #name, char const* const Token::m_name[NUM_TOKENS] = { TOKEN_LIST(T, T) }; #undef T #define T(name, string, precedence) string, char const* const Token::m_string[NUM_TOKENS] = { TOKEN_LIST(T, T) }; #undef T #define T(name, string, precedence) precedence, int8_t const Token::m_precedence[NUM_TOKENS] = { TOKEN_LIST(T, T) }; #undef T #define KT(a, b, c) 'T', #define KK(a, b, c) 'K', char const Token::m_tokenType[] = { TOKEN_LIST(KT, KK) }; tuple Token::fromIdentifierOrKeyword(const string& _literal) { string token = _literal; string details; if (_literal == "uintM" || _literal == "intM" || _literal == "fixedMxN" || _literal == "ufixedMxN" || _literal == "bytesM") return make_pair(Token::Identifier, details); if (_literal.find_first_of("0123456789") != string::npos) { string baseType = _literal.substr(0, _literal.find_first_of("0123456789")); short m = stoi(_literal.substr(_literal.find_first_of("0123456789"))); if (baseType == "bytes") { details = (0 < m && m <= 32) ? to_string(m) : ""; token = details.empty() ? _literal : baseType + "M"; } else if (baseType == "uint" || baseType == "int") { details = (0 < m && m <= 256 && m % 8 == 0) ? to_string(m) : ""; token = details.empty() ? _literal : baseType + "M"; } else if (baseType == "ufixed" || baseType == "fixed") { m = stoi(to_string(m).substr(0, to_string(m).find_first_of("x") - 1)); short n = stoi(_literal.substr(_literal.find_last_of("x") + 1)); details = (0 < n + m && n + m <= 256 && ((n % 8 == 0) && (m % 8 == 0))) ? to_string(m) + "x" + to_string(n) : ""; token = details.empty() ? _literal : baseType + "MxN" ; } } // The following macros are used inside TOKEN_LIST and cause non-keyword tokens to be ignored // and keywords to be put inside the keywords variable. #define KEYWORD(name, string, precedence) {string, Token::name}, #define TOKEN(name, string, precedence) static const map keywords({TOKEN_LIST(TOKEN, KEYWORD)}); #undef KEYWORD #undef TOKEN auto it = keywords.find(token); return it == keywords.end() ? make_pair(Token::Identifier, details) : make_pair(it->second, details); } #undef KT #undef KK } }