Searched refs:fTable (Results 1 - 20 of 20) sorted by relevance

/haiku/src/servers/app/
H A DHashTable.cpp28 fTable(NULL),
52 if (fTable == NULL)
58 for (entry = fTable[index]; entry != NULL; entry = next) {
67 free(fTable);
68 fTable = NULL;
102 entry->next = fTable[index];
103 fTable[index] = entry;
117 if (fTable == NULL)
123 for (entry = fTable[index]; entry != NULL; entry = entry->next) {
131 fTable[inde
[all...]
H A DHashTable.h43 entry** fTable; member in class:HashTable
/haiku/headers/private/kernel/util/
H A DOpenHashTable.h103 fTable(NULL)
112 fTable(NULL)
122 fTable(NULL)
128 fAllocator.Free(fTable);
159 ValueType* slot = fTable[index];
197 _Insert(fTable, fTableSize, value);
228 ValueType* slot = fTable[index];
237 fTable[index] = next;
278 ValueType* element = fTable[i];
293 memset(this->fTable,
392 const HashTable* fTable; member in class:BOpenHashTable::Iterator
494 ValueType** fTable; member in class:BOpenHashTable
[all...]
H A DMultiHashTable.h56 _Insert(HashTable::fTable, HashTable::fTableSize, value);
79 Iterator::fTable = table; member in class:MultiHashTable::ValueIterator::Iterator
89 return ((const MultiTable *)Iterator::fTable)->_Definition().CompareValues(
113 slot = HashTable::fTable[index];
164 if (HashTable::fTable) {
166 ValueType *bucket = HashTable::fTable[i];
174 delete [] HashTable::fTable; member in class:MultiHashTable::HashTable
178 HashTable::fTable = newTable; member in class:MultiHashTable::HashTable
/haiku/src/tools/fs_shell/
H A DOpenHashTable.h103 fTable(NULL)
112 fTable(NULL)
122 fTable(NULL)
128 fAllocator.Free(fTable);
159 ValueType* slot = fTable[index];
197 _Insert(fTable, fTableSize, value);
228 ValueType* slot = fTable[index];
237 fTable[index] = next;
278 ValueType* element = fTable[i];
293 memset(this->fTable,
392 const HashTable* fTable; member in class:BOpenHashTable::Iterator
494 ValueType** fTable; member in class:BOpenHashTable
[all...]
/haiku/src/apps/debuganalyzer/gui/table/
H A DAbstractTable.cpp32 fTable(NULL)
47 fTable = table;
55 if (fTable == NULL)
58 if (fTable == NULL)
60 BLooper* window = fTable->Looper();
76 fTable->ColumnMouseDown(this, row, field, screenWhere, buttons);
84 if (fTable == NULL)
86 BLooper* window = fTable->Looper();
101 fTable->ColumnMouseUp(this, row, field, screenWhere, buttons);
H A DAbstractTable.h92 AbstractTable* fTable; member in class:AbstractTable::AbstractColumn
H A DTable.cpp142 fTable(table),
193 while ((row = fTable->CurrentSelection(row)) != NULL)
209 while ((row = fTable->CurrentSelection(row)) != NULL)
210 fRows[index++] = fTable->_ModelIndexOfRow(row);
H A DTable.h78 Table* fTable; member in class:TableSelectionModel
/haiku/src/apps/terminal/
H A DColors.cpp149 fTable(NULL),
157 // fTable as result of LoadResource call and owned
159 fTable = NULL;
182 if (fTable == NULL) {
194 ((fTable[i].hash < hash) ? left : right) = i;
197 if (fTable[right].hash == hash) {
198 *color = fTable[right].color;
214 fTable = (_XColorEntry*)res->LoadResource(B_RAW_TYPE, "XColorsTable", &size);
215 if (fTable == NULL || size < sizeof(_XColorEntry)) {
216 fTable
[all...]
H A DColors.h55 const _XColorEntry* fTable; member in class:XColorsTable
/haiku/headers/private/shared/
H A DHashSet.h103 fIterator(set->fTable.GetIterator()),
140 ElementTable fTable; member in class:BPrivate::HashSet
218 fTable()
220 fTable.Init();
237 return (fTable.TableSize() > 0 ? B_OK : B_NO_MEMORY);
246 Element* element = fTable.Lookup(key);
257 status_t error = fTable.Insert(element);
270 Element* element = fTable.Lookup(key);
274 fTable.Remove(element);
290 fTable
[all...]
H A DHashMap.h115 fIterator(map->fTable.GetIterator()),
154 ElementTable fTable; member in class:BPrivate::HashMap
350 fTable()
352 fTable.Init();
369 return (fTable.TableSize() > 0 ? B_OK : B_NO_MEMORY);
378 Element* element = fTable.Lookup(key);
390 status_t error = fTable.Insert(element);
403 Element* element = fTable.Lookup(key);
407 fTable.Remove(element);
426 fTable
[all...]
/haiku/src/add-ons/kernel/file_systems/ramfs/
H A DNodeChildTable.h84 OpenHashTable<Element, OpenHashElementArray<Element> > fTable; member in class:NodeChildTable
97 info.AddDirectoryEntryTableAllocation(fTable.ArraySize(),
98 fTable.VectorSize(),
100 fTable.CountElements());
112 info.AddNodeAttributeTableAllocation(fTable.ArraySize(),
113 fTable.VectorSize(),
115 fTable.CountElements());
126 fTable(1000, &fElementArray)
141 RETURN_ERROR(fTable.InitCheck() && fElementArray.InitCheck()
165 Element *element = fTable
[all...]
/haiku/src/bin/bfs_tools/lib/
H A DHashtable.cpp45 if (!(fTable = (struct Entry **)malloc(capacity * sizeof(void *))))
47 memset(fTable,0,capacity * sizeof(void *));
61 struct Entry **table = fTable;
124 fTable[index] = new Entry(fTable[index], key, value);
137 table = fTable;
170 fIteratorEntry = fTable[0];
177 fIteratorEntry = fTable[++fIteratorIndex];
203 for (entry = fTable[index]; entry; entry = next) {
225 fTable[inde
[all...]
H A DHashtable.h56 Entry **fTable; member in class:Hashtable
/haiku/src/system/kernel/
H A DTeamThreadTables.h75 return fTable.Init(initialSize);
81 fTable.InsertUnchecked(element);
87 fTable.RemoveUnchecked(element);
93 Element* element = fTable.Lookup(id);
175 ElementTable fTable; member in struct:BKernel::TeamThreadTable
/haiku/src/system/kernel/arch/x86/64/
H A Ddescriptors.cpp28 fTable { Function(Index)... }
32 T fTable[sizeof...(Index)]; member in struct:GenerateTable
106 alignas(uint64_t) Descriptor fTable[kDescriptorCount]; member in class:GlobalDescriptorTable
145 alignas(uint64_t) TableType fTable; member in class:InterruptDescriptorTable
240 fTable {
261 sizeof(fTable) - 1,
262 static_cast<const void*>(fTable),
274 fTable[index] = tss.GetLower();
275 fTable[index + 1] = tss.GetUpper();
286 fTable[inde
[all...]
/haiku/src/add-ons/translators/gif/
H A DGIFLoad.cpp403 if (fTable[fNewCode] != NULL) {
406 if (!OutputColor(fTable[fNewCode], fEntrySize[fNewCode]))
413 //memcpy(newEntry + fOldCodeLength, fTable[fNewCode], 1);
414 newEntry[fOldCodeLength] = fTable[fNewCode][0];
428 fTable[fNextCode] = MemblockAllocate(fOldCodeLength + 1);
429 if (fTable[fNextCode] == NULL)
432 //memcpy(fTable[fNextCode], newEntry, fOldCodeLength + 1);
434 fTable[fNextCode][x] = newEntry[x];
438 //memcpy(fOldCode, fTable[fNewCode], fEntrySize[fNewCode]);
440 fOldCode[x] = fTable[fNewCod
[all...]
H A DGIFLoad.h96 unsigned char* fTable[ENTRY_COUNT]; member in class:GIFLoad

Completed in 217 milliseconds