NameIndex
if (entry->NameIndex() < ((sizeof(indexNames) / sizeof(indexNames[0]))))
"linux", indexNames[entry->NameIndex()], entry->NameLength(),
"linux", entry->NameIndex(), entry->NameLength(), entry->name);
uint8 NameIndex() const { return name_index; }
struct NameIndex::Iterator : public GenericIndexIterator<IteratorPolicy> {
NameIndex::NameIndex()
NameIndex::~NameIndex()
NameIndex::Init(Volume* volume)
NameIndex::CountEntries() const
NameIndex::NodeAdded(Node* node)
NameIndex::NodeRemoved(Node* node)
NameIndex::NodeChanged(Node* node, uint32 statFields,
NameIndex::InternalGetIterator()
NameIndex::InternalFind(const void* _key, size_t length)
NameIndex::_UpdateLiveQueries(Node* entry, const char* oldName,
class NameIndex::EntryTree : public _EntryTree {
struct NameIndex::IteratorPolicy {
typedef NameIndex Index;
typedef NameIndex::EntryTree NodeTree;
class NameIndex : public Index, private NodeListener {
NameIndex();
virtual ~NameIndex();
NameIndex* index = new(std::nothrow) NameIndex;
fNameIndex = new(nothrow) NameIndex(volume);
class NameIndex;
NameIndex *GetNameIndex() const { return fNameIndex; }
NameIndex *fNameIndex;
NameIndex::NameIndex(Volume *volume)
NameIndex::~NameIndex()
NameIndex::CountEntries() const
NameIndex::Changed(Entry *entry, const char *oldName)
NameIndex::EntryAdded(Entry *entry)
NameIndex::EntryRemoved(Entry *entry)
NameIndex::InternalGetIterator()
NameIndex::InternalFind(const uint8 *key, size_t length)
NameIndex::_UpdateLiveQueries(Entry* entry, const char* oldName,
NameIndexEntryIterator::SetTo(NameIndex *index, const char *name,
class NameIndex::EntryTree : public _EntryTree {};
bool SetTo(NameIndex *index, const char *name, bool ignoreValue = false);
friend class NameIndex;
NameIndex *fIndex;
NameIndex::EntryTree::Iterator fIterator;
class NameIndex : public Index, private EntryListener {
NameIndex(Volume *volume);
virtual ~NameIndex();
NameIndex *
NameIndex *GetNameIndex() const;
class NameIndex;