mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 20:23:11 +01:00
a106725fc5
patch brings numerous advantages to LLVM. One way to look at it is through diffstat: 109 files changed, 3005 insertions(+), 5906 deletions(-) Removing almost 3K lines of code is a good thing. Other advantages include: 1. Value::getType() is a simple load that can be CSE'd, not a mutating union-find operation. 2. Types a uniqued and never move once created, defining away PATypeHolder. 3. Structs can be "named" now, and their name is part of the identity that uniques them. This means that the compiler doesn't merge them structurally which makes the IR much less confusing. 4. Now that there is no way to get a cycle in a type graph without a named struct type, "upreferences" go away. 5. Type refinement is completely gone, which should make LTO much MUCH faster in some common cases with C++ code. 6. Types are now generally immutable, so we can use "Type *" instead "const Type *" everywhere. Downsides of this patch are that it removes some functions from the C API, so people using those will have to upgrade to (not yet added) new API. "LLVM 3.0" is the right time to do this. There are still some cleanups pending after this, this patch is large enough as-is. llvm-svn: 134829
94 lines
2.6 KiB
C++
94 lines
2.6 KiB
C++
//===- LLLexer.h - Lexer for LLVM Assembly Files ----------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This class represents the Lexer for .ll files.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LIB_ASMPARSER_LLLEXER_H
|
|
#define LIB_ASMPARSER_LLLEXER_H
|
|
|
|
#include "LLToken.h"
|
|
#include "llvm/ADT/APSInt.h"
|
|
#include "llvm/ADT/APFloat.h"
|
|
#include "llvm/Support/SourceMgr.h"
|
|
#include <string>
|
|
|
|
namespace llvm {
|
|
class MemoryBuffer;
|
|
class Type;
|
|
class SMDiagnostic;
|
|
class LLVMContext;
|
|
|
|
class LLLexer {
|
|
const char *CurPtr;
|
|
MemoryBuffer *CurBuf;
|
|
SMDiagnostic &ErrorInfo;
|
|
SourceMgr &SM;
|
|
LLVMContext &Context;
|
|
|
|
// Information about the current token.
|
|
const char *TokStart;
|
|
lltok::Kind CurKind;
|
|
std::string StrVal;
|
|
unsigned UIntVal;
|
|
Type *TyVal;
|
|
APFloat APFloatVal;
|
|
APSInt APSIntVal;
|
|
|
|
std::string TheError;
|
|
public:
|
|
explicit LLLexer(MemoryBuffer *StartBuf, SourceMgr &SM, SMDiagnostic &,
|
|
LLVMContext &C);
|
|
~LLLexer() {}
|
|
|
|
lltok::Kind Lex() {
|
|
return CurKind = LexToken();
|
|
}
|
|
|
|
typedef SMLoc LocTy;
|
|
LocTy getLoc() const { return SMLoc::getFromPointer(TokStart); }
|
|
lltok::Kind getKind() const { return CurKind; }
|
|
const std::string &getStrVal() const { return StrVal; }
|
|
Type *getTyVal() const { return TyVal; }
|
|
unsigned getUIntVal() const { return UIntVal; }
|
|
const APSInt &getAPSIntVal() const { return APSIntVal; }
|
|
const APFloat &getAPFloatVal() const { return APFloatVal; }
|
|
|
|
|
|
bool Error(LocTy L, const Twine &Msg) const;
|
|
bool Error(const Twine &Msg) const { return Error(getLoc(), Msg); }
|
|
std::string getFilename() const;
|
|
|
|
private:
|
|
lltok::Kind LexToken();
|
|
|
|
int getNextChar();
|
|
void SkipLineComment();
|
|
lltok::Kind ReadString(lltok::Kind kind);
|
|
bool ReadVarName();
|
|
|
|
lltok::Kind LexIdentifier();
|
|
lltok::Kind LexDigitOrNegative();
|
|
lltok::Kind LexPositive();
|
|
lltok::Kind LexAt();
|
|
lltok::Kind LexExclaim();
|
|
lltok::Kind LexPercent();
|
|
lltok::Kind LexQuote();
|
|
lltok::Kind Lex0x();
|
|
|
|
uint64_t atoull(const char *Buffer, const char *End);
|
|
uint64_t HexIntToVal(const char *Buffer, const char *End);
|
|
void HexToIntPair(const char *Buffer, const char *End, uint64_t Pair[2]);
|
|
void FP80HexToIntPair(const char *Buff, const char *End, uint64_t Pair[2]);
|
|
};
|
|
} // end namespace llvm
|
|
|
|
#endif
|