Symbol: fTable
headers/private/shared/HashMap.h
115
fIterator(map->fTable.GetIterator()),
headers/private/shared/HashMap.h
154
ElementTable fTable;
headers/private/shared/HashMap.h
350
fTable()
headers/private/shared/HashMap.h
352
fTable.Init();
headers/private/shared/HashMap.h
369
return (fTable.TableSize() > 0 ? B_OK : B_NO_MEMORY);
headers/private/shared/HashMap.h
378
Element* element = fTable.Lookup(key);
headers/private/shared/HashMap.h
390
status_t error = fTable.Insert(element);
headers/private/shared/HashMap.h
403
Element* element = fTable.Lookup(key);
headers/private/shared/HashMap.h
407
fTable.Remove(element);
headers/private/shared/HashMap.h
426
fTable.RemoveUnchecked(element);
headers/private/shared/HashMap.h
440
Element* element = fTable.Clear(true);
headers/private/shared/HashMap.h
454
if (Element* element = fTable.Lookup(key))
headers/private/shared/HashMap.h
465
if (Element* element = fTable.Lookup(key)) {
headers/private/shared/HashMap.h
478
return fTable.Lookup(key) != NULL;
headers/private/shared/HashMap.h
487
return fTable.CountElements();
headers/private/shared/HashSet.h
103
fIterator(set->fTable.GetIterator()),
headers/private/shared/HashSet.h
140
ElementTable fTable;
headers/private/shared/HashSet.h
218
fTable()
headers/private/shared/HashSet.h
220
fTable.Init();
headers/private/shared/HashSet.h
237
return (fTable.TableSize() > 0 ? B_OK : B_NO_MEMORY);
headers/private/shared/HashSet.h
246
Element* element = fTable.Lookup(key);
headers/private/shared/HashSet.h
257
status_t error = fTable.Insert(element);
headers/private/shared/HashSet.h
270
Element* element = fTable.Lookup(key);
headers/private/shared/HashSet.h
274
fTable.Remove(element);
headers/private/shared/HashSet.h
290
fTable.RemoveUnchecked(element);
headers/private/shared/HashSet.h
304
Element* element = fTable.Clear(true);
headers/private/shared/HashSet.h
318
return fTable.Lookup(key) != NULL;
headers/private/shared/HashSet.h
327
return fTable.CountElements();
headers/private/util/AtomicsHashTable.h
47
ValueType** link = &HashTable::fTable[index];
headers/private/util/MultiHashTable.h
113
slot = HashTable::fTable[index];
headers/private/util/MultiHashTable.h
164
if (HashTable::fTable) {
headers/private/util/MultiHashTable.h
166
ValueType *bucket = HashTable::fTable[i];
headers/private/util/MultiHashTable.h
174
delete [] HashTable::fTable;
headers/private/util/MultiHashTable.h
178
HashTable::fTable = newTable;
headers/private/util/MultiHashTable.h
56
_Insert(HashTable::fTable, HashTable::fTableSize, value);
headers/private/util/MultiHashTable.h
79
Iterator::fTable = table;
headers/private/util/MultiHashTable.h
89
return ((const MultiTable *)Iterator::fTable)->_Definition().CompareValues(
headers/private/util/OpenHashTable.h
103
fTable(NULL)
headers/private/util/OpenHashTable.h
112
fTable(NULL)
headers/private/util/OpenHashTable.h
122
fTable(NULL)
headers/private/util/OpenHashTable.h
128
fAllocator.Free(fTable);
headers/private/util/OpenHashTable.h
159
ValueType* slot = fTable[index];
headers/private/util/OpenHashTable.h
197
_Insert(fTable, fTableSize, value);
headers/private/util/OpenHashTable.h
228
ValueType* slot = fTable[index];
headers/private/util/OpenHashTable.h
237
fTable[index] = next;
headers/private/util/OpenHashTable.h
278
ValueType* element = fTable[i];
headers/private/util/OpenHashTable.h
293
memset(this->fTable, 0, sizeof(ValueType*) * this->fTableSize);
headers/private/util/OpenHashTable.h
355
: fTable(table)
headers/private/util/OpenHashTable.h
361
: fTable(table), fIndex(index), fNext(value) {}
headers/private/util/OpenHashTable.h
386
fNext = fTable->_Link(fNext);
headers/private/util/OpenHashTable.h
388
while (fNext == NULL && fIndex < fTable->fTableSize)
headers/private/util/OpenHashTable.h
389
fNext = fTable->fTable[fIndex++];
headers/private/util/OpenHashTable.h
392
const HashTable* fTable;
headers/private/util/OpenHashTable.h
408
ValueType* slot = fTable[index];
headers/private/util/OpenHashTable.h
450
if (fTable) {
headers/private/util/OpenHashTable.h
452
ValueType* bucket = fTable[i];
headers/private/util/OpenHashTable.h
461
*_oldTable = fTable;
headers/private/util/OpenHashTable.h
463
fAllocator.Free(fTable);
headers/private/util/OpenHashTable.h
468
fTable = newTable;
headers/private/util/OpenHashTable.h
479
ValueType* bucket = fTable[i];
headers/private/util/OpenHashTable.h
494
ValueType** fTable;
src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h
109
SET_ERROR(error, fTable.Insert(child));
src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h
138
Entry* child = fTable.Lookup(DirectoryEntryHash::Key(id, name));
src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h
141
return fTable.Remove(child) ? B_OK : B_ERROR;
src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h
148
Entry *child = fTable.Lookup(DirectoryEntryHash::Key(id, name));
src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h
65
info.AddDirectoryEntryTableAllocation(0, fTable.TableSize(),
src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h
66
sizeof(void*), fTable.CountElements());
src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h
70
BOpenHashTable<DirectoryEntryHash> fTable;
src/add-ons/kernel/file_systems/ramfs/DirectoryEntryTable.h
77
fInitStatus = fTable.Init(1000);
src/add-ons/translators/gif/GIFLoad.cpp
403
if (fTable[fNewCode] != NULL) {
src/add-ons/translators/gif/GIFLoad.cpp
406
if (!OutputColor(fTable[fNewCode], fEntrySize[fNewCode]))
src/add-ons/translators/gif/GIFLoad.cpp
414
newEntry[fOldCodeLength] = fTable[fNewCode][0];
src/add-ons/translators/gif/GIFLoad.cpp
428
fTable[fNextCode] = MemblockAllocate(fOldCodeLength + 1);
src/add-ons/translators/gif/GIFLoad.cpp
429
if (fTable[fNextCode] == NULL)
src/add-ons/translators/gif/GIFLoad.cpp
434
fTable[fNextCode][x] = newEntry[x];
src/add-ons/translators/gif/GIFLoad.cpp
440
fOldCode[x] = fTable[fNewCode][x];
src/add-ons/translators/gif/GIFLoad.cpp
507
fTable[x] = NULL;
src/add-ons/translators/gif/GIFLoad.cpp
509
fTable[x] = MemblockAllocate(1);
src/add-ons/translators/gif/GIFLoad.cpp
510
if (fTable[x] != NULL) {
src/add-ons/translators/gif/GIFLoad.cpp
511
fTable[x][0] = x;
src/add-ons/translators/gif/GIFLoad.h
96
unsigned char* fTable[ENTRY_COUNT];
src/apps/debuganalyzer/gui/table/AbstractTable.cpp
101
fTable->ColumnMouseUp(this, row, field, screenWhere, buttons);
src/apps/debuganalyzer/gui/table/AbstractTable.cpp
47
fTable = table;
src/apps/debuganalyzer/gui/table/AbstractTable.cpp
55
if (fTable == NULL)
src/apps/debuganalyzer/gui/table/AbstractTable.cpp
58
if (fTable == NULL)
src/apps/debuganalyzer/gui/table/AbstractTable.cpp
60
BLooper* window = fTable->Looper();
src/apps/debuganalyzer/gui/table/AbstractTable.cpp
76
fTable->ColumnMouseDown(this, row, field, screenWhere, buttons);
src/apps/debuganalyzer/gui/table/AbstractTable.cpp
84
if (fTable == NULL)
src/apps/debuganalyzer/gui/table/AbstractTable.cpp
86
BLooper* window = fTable->Looper();
src/apps/debuganalyzer/gui/table/AbstractTable.h
92
AbstractTable* fTable;
src/apps/debuganalyzer/gui/table/Table.cpp
142
fTable(table),
src/apps/debuganalyzer/gui/table/Table.cpp
193
while ((row = fTable->CurrentSelection(row)) != NULL)
src/apps/debuganalyzer/gui/table/Table.cpp
209
while ((row = fTable->CurrentSelection(row)) != NULL)
src/apps/debuganalyzer/gui/table/Table.cpp
210
fRows[index++] = fTable->_ModelIndexOfRow(row);
src/apps/debuganalyzer/gui/table/Table.h
78
Table* fTable;
src/apps/terminal/Colors.cpp
116
if (fTable == NULL) {
src/apps/terminal/Colors.cpp
128
((fTable[i].hash < hash) ? left : right) = i;
src/apps/terminal/Colors.cpp
131
if (fTable[right].hash == hash) {
src/apps/terminal/Colors.cpp
132
*color = fTable[right].color;
src/apps/terminal/Colors.cpp
148
fTable = (_XColorEntry*)res->LoadResource(B_RAW_TYPE, "XColorsTable", &size);
src/apps/terminal/Colors.cpp
149
if (fTable == NULL || size < sizeof(_XColorEntry)) {
src/apps/terminal/Colors.cpp
150
fTable = NULL;
src/apps/terminal/Colors.cpp
68
fTable(NULL),
src/apps/terminal/Colors.cpp
78
fTable = NULL;
src/apps/terminal/Colors.h
86
const _XColorEntry* fTable;
src/bin/bfs_tools/lib/Hashtable.cpp
124
fTable[index] = new Entry(fTable[index], key, value);
src/bin/bfs_tools/lib/Hashtable.cpp
137
table = fTable;
src/bin/bfs_tools/lib/Hashtable.cpp
170
fIteratorEntry = fTable[0];
src/bin/bfs_tools/lib/Hashtable.cpp
177
fIteratorEntry = fTable[++fIteratorIndex];
src/bin/bfs_tools/lib/Hashtable.cpp
203
for (entry = fTable[index]; entry; entry = next) {
src/bin/bfs_tools/lib/Hashtable.cpp
225
fTable[index] = NULL;
src/bin/bfs_tools/lib/Hashtable.cpp
245
struct Entry **oldTable = fTable,**newtable;
src/bin/bfs_tools/lib/Hashtable.cpp
256
fTable = newtable;
src/bin/bfs_tools/lib/Hashtable.cpp
282
table = fTable;
src/bin/bfs_tools/lib/Hashtable.cpp
45
if (!(fTable = (struct Entry **)malloc(capacity * sizeof(void *))))
src/bin/bfs_tools/lib/Hashtable.cpp
47
memset(fTable,0,capacity * sizeof(void *));
src/bin/bfs_tools/lib/Hashtable.cpp
61
struct Entry **table = fTable;
src/bin/bfs_tools/lib/Hashtable.h
56
Entry **fTable;
src/system/kernel/TeamThreadTables.h
175
ElementTable fTable;
src/system/kernel/TeamThreadTables.h
75
return fTable.Init(initialSize);
src/system/kernel/TeamThreadTables.h
81
fTable.InsertUnchecked(element);
src/system/kernel/TeamThreadTables.h
87
fTable.RemoveUnchecked(element);
src/system/kernel/TeamThreadTables.h
93
Element* element = fTable.Lookup(id);
src/system/kernel/arch/x86/64/descriptors.cpp
106
alignas(uint64_t) Descriptor fTable[kDescriptorCount];
src/system/kernel/arch/x86/64/descriptors.cpp
145
alignas(uint64_t) TableType fTable;
src/system/kernel/arch/x86/64/descriptors.cpp
240
fTable {
src/system/kernel/arch/x86/64/descriptors.cpp
261
sizeof(fTable) - 1,
src/system/kernel/arch/x86/64/descriptors.cpp
262
static_cast<const void*>(fTable),
src/system/kernel/arch/x86/64/descriptors.cpp
274
fTable[index] = tss.GetLower();
src/system/kernel/arch/x86/64/descriptors.cpp
275
fTable[index + 1] = tss.GetUpper();
src/system/kernel/arch/x86/64/descriptors.cpp
28
fTable { Function(Index)... }
src/system/kernel/arch/x86/64/descriptors.cpp
286
fTable[index] = desc.GetDescriptor();
src/system/kernel/arch/x86/64/descriptors.cpp
32
T fTable[sizeof...(Index)];
src/system/kernel/arch/x86/64/descriptors.cpp
327
sizeof(fTable) - 1,
src/system/kernel/arch/x86/64/descriptors.cpp
328
static_cast<const void*>(fTable.fTable),
src/tools/fs_shell/OpenHashTable.h
103
fTable(NULL)
src/tools/fs_shell/OpenHashTable.h
112
fTable(NULL)
src/tools/fs_shell/OpenHashTable.h
122
fTable(NULL)
src/tools/fs_shell/OpenHashTable.h
128
fAllocator.Free(fTable);
src/tools/fs_shell/OpenHashTable.h
159
ValueType* slot = fTable[index];
src/tools/fs_shell/OpenHashTable.h
197
_Insert(fTable, fTableSize, value);
src/tools/fs_shell/OpenHashTable.h
228
ValueType* slot = fTable[index];
src/tools/fs_shell/OpenHashTable.h
237
fTable[index] = next;
src/tools/fs_shell/OpenHashTable.h
278
ValueType* element = fTable[i];
src/tools/fs_shell/OpenHashTable.h
293
memset(this->fTable, 0, sizeof(ValueType*) * this->fTableSize);
src/tools/fs_shell/OpenHashTable.h
355
: fTable(table)
src/tools/fs_shell/OpenHashTable.h
361
: fTable(table), fIndex(index), fNext(value) {}
src/tools/fs_shell/OpenHashTable.h
386
fNext = fTable->_Link(fNext);
src/tools/fs_shell/OpenHashTable.h
388
while (fNext == NULL && fIndex < fTable->fTableSize)
src/tools/fs_shell/OpenHashTable.h
389
fNext = fTable->fTable[fIndex++];
src/tools/fs_shell/OpenHashTable.h
392
const HashTable* fTable;
src/tools/fs_shell/OpenHashTable.h
408
ValueType* slot = fTable[index];
src/tools/fs_shell/OpenHashTable.h
450
if (fTable) {
src/tools/fs_shell/OpenHashTable.h
452
ValueType* bucket = fTable[i];
src/tools/fs_shell/OpenHashTable.h
461
*_oldTable = fTable;
src/tools/fs_shell/OpenHashTable.h
463
fAllocator.Free(fTable);
src/tools/fs_shell/OpenHashTable.h
468
fTable = newTable;
src/tools/fs_shell/OpenHashTable.h
479
ValueType* bucket = fTable[i];
src/tools/fs_shell/OpenHashTable.h
494
ValueType** fTable;