mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 03:33:20 +01:00
ca305491f6
AKA: Recompile *ALL* the source code! This one went much better. No manual edits here. I spot-checked for silliness and grep-checked for really broken edits and everything seemed good. It all still compiles. Yell if you see something that looks goofy. llvm-svn: 169133
140 lines
4.1 KiB
C++
140 lines
4.1 KiB
C++
//===-- StringPool.h - Interned string pool ---------------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file declares an interned string pool, which helps reduce the cost of
|
|
// strings by using the same storage for identical strings.
|
|
//
|
|
// To intern a string:
|
|
//
|
|
// StringPool Pool;
|
|
// PooledStringPtr Str = Pool.intern("wakka wakka");
|
|
//
|
|
// To use the value of an interned string, use operator bool and operator*:
|
|
//
|
|
// if (Str)
|
|
// cerr << "the string is" << *Str << "\n";
|
|
//
|
|
// Pooled strings are immutable, but you can change a PooledStringPtr to point
|
|
// to another instance. So that interned strings can eventually be freed,
|
|
// strings in the string pool are reference-counted (automatically).
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_SUPPORT_STRINGPOOL_H
|
|
#define LLVM_SUPPORT_STRINGPOOL_H
|
|
|
|
#include "llvm/ADT/StringMap.h"
|
|
#include <cassert>
|
|
#include <new>
|
|
|
|
namespace llvm {
|
|
|
|
class PooledStringPtr;
|
|
|
|
/// StringPool - An interned string pool. Use the intern method to add a
|
|
/// string. Strings are removed automatically as PooledStringPtrs are
|
|
/// destroyed.
|
|
class StringPool {
|
|
/// PooledString - This is the value of an entry in the pool's interning
|
|
/// table.
|
|
struct PooledString {
|
|
StringPool *Pool; ///< So the string can remove itself.
|
|
unsigned Refcount; ///< Number of referencing PooledStringPtrs.
|
|
|
|
public:
|
|
PooledString() : Pool(0), Refcount(0) { }
|
|
};
|
|
|
|
friend class PooledStringPtr;
|
|
|
|
typedef StringMap<PooledString> table_t;
|
|
typedef StringMapEntry<PooledString> entry_t;
|
|
table_t InternTable;
|
|
|
|
public:
|
|
StringPool();
|
|
~StringPool();
|
|
|
|
/// intern - Adds a string to the pool and returns a reference-counted
|
|
/// pointer to it. No additional memory is allocated if the string already
|
|
/// exists in the pool.
|
|
PooledStringPtr intern(StringRef Str);
|
|
|
|
/// empty - Checks whether the pool is empty. Returns true if so.
|
|
///
|
|
inline bool empty() const { return InternTable.empty(); }
|
|
};
|
|
|
|
/// PooledStringPtr - A pointer to an interned string. Use operator bool to
|
|
/// test whether the pointer is valid, and operator * to get the string if so.
|
|
/// This is a lightweight value class with storage requirements equivalent to
|
|
/// a single pointer, but it does have reference-counting overhead when
|
|
/// copied.
|
|
class PooledStringPtr {
|
|
typedef StringPool::entry_t entry_t;
|
|
entry_t *S;
|
|
|
|
public:
|
|
PooledStringPtr() : S(0) {}
|
|
|
|
explicit PooledStringPtr(entry_t *E) : S(E) {
|
|
if (S) ++S->getValue().Refcount;
|
|
}
|
|
|
|
PooledStringPtr(const PooledStringPtr &That) : S(That.S) {
|
|
if (S) ++S->getValue().Refcount;
|
|
}
|
|
|
|
PooledStringPtr &operator=(const PooledStringPtr &That) {
|
|
if (S != That.S) {
|
|
clear();
|
|
S = That.S;
|
|
if (S) ++S->getValue().Refcount;
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
void clear() {
|
|
if (!S)
|
|
return;
|
|
if (--S->getValue().Refcount == 0) {
|
|
S->getValue().Pool->InternTable.remove(S);
|
|
S->Destroy();
|
|
}
|
|
S = 0;
|
|
}
|
|
|
|
~PooledStringPtr() { clear(); }
|
|
|
|
inline const char *begin() const {
|
|
assert(*this && "Attempt to dereference empty PooledStringPtr!");
|
|
return S->getKeyData();
|
|
}
|
|
|
|
inline const char *end() const {
|
|
assert(*this && "Attempt to dereference empty PooledStringPtr!");
|
|
return S->getKeyData() + S->getKeyLength();
|
|
}
|
|
|
|
inline unsigned size() const {
|
|
assert(*this && "Attempt to dereference empty PooledStringPtr!");
|
|
return S->getKeyLength();
|
|
}
|
|
|
|
inline const char *operator*() const { return begin(); }
|
|
inline operator bool() const { return S != 0; }
|
|
|
|
inline bool operator==(const PooledStringPtr &That) { return S == That.S; }
|
|
inline bool operator!=(const PooledStringPtr &That) { return S != That.S; }
|
|
};
|
|
|
|
} // End llvm namespace
|
|
|
|
#endif
|