/haiku/src/add-ons/kernel/file_systems/netfs/shared/ |
H A D | NetAddress.cpp | 109 route_table_req table; local 110 table.rrtp = routes; 111 table.len = count * sizeof(route_req_t); 112 table.cnt = count; 113 if (ioctl(fd, SIOCGRTTABLE, &table) == 0) { 114 for (uint32 i = 0; i < table.cnt; i++) {
|
/haiku/src/tools/fs_shell/ |
H A D | OpenHashTable.h | 74 /** Implements an hash table with open hashing, that is, colliding entries are 75 * stored in a linked list. The table may be made to adjust its number of slots 81 * sure the table can always accept new items and will never fail because it is 182 /*! \brief Inserts a value without resizing the table. 184 Use this method if you need to insert a value into the table while 191 panic("Hash Table: value already in table."); 193 debugger("Hash Table: value already in table."); 215 /*! \brief Removes a value without resizing the table. 217 Use this method if you need to remove a value from the table while 222 table agai 354 Iterator(const HashTable* table) argument 360 Iterator(const HashTable* table, size_t index, ValueType* value) argument 426 _Insert(ValueType** table, size_t tableSize, ValueType* value) argument [all...] |
/haiku/headers/private/kernel/util/ |
H A D | OpenHashTable.h | 74 /** Implements an hash table with open hashing, that is, colliding entries are 75 * stored in a linked list. The table may be made to adjust its number of slots 81 * sure the table can always accept new items and will never fail because it is 182 /*! \brief Inserts a value without resizing the table. 184 Use this method if you need to insert a value into the table while 191 panic("Hash Table: value already in table."); 193 debugger("Hash Table: value already in table."); 215 /*! \brief Removes a value without resizing the table. 217 Use this method if you need to remove a value from the table while 222 table agai 354 Iterator(const HashTable* table) argument 360 Iterator(const HashTable* table, size_t index, ValueType* value) argument 426 _Insert(ValueType** table, size_t tableSize, ValueType* value) argument [all...] |
/haiku/src/apps/debuganalyzer/gui/table/ |
H A D | Table.h | 14 #include "table/AbstractTable.h" 15 #include "table/TableColumn.h" 64 TableSelectionModel(Table* table); 98 virtual void TableSelectionChanged(Table* table); 99 virtual void TableRowInvoked(Table* table, int32 rowIndex); 101 virtual void TableCellMouseDown(Table* table, int32 rowIndex, 104 virtual void TableCellMouseUp(Table* table, int32 rowIndex,
|
H A D | AbstractTable.cpp | 6 #include "table/AbstractTable.h" 13 #include "table/TableColumn.h" 45 AbstractTable::AbstractColumn::SetTable(AbstractTable* table) argument 47 fTable = table;
|
/haiku/headers/private/shared/ |
H A D | AutoDeleter.h | 233 template<typename Type, typename Table, Table **table, 239 ((**table).*Deleter)(object); 243 template<typename Type, typename Table, Table **table, 246 : AutoDeleter<Type, MethodObjectDelete<Type, Table, table, Deleter> > 249 MethodObjectDelete<Type, Table, table, Deleter> > Base;
|
/haiku/src/apps/debugger/user_interface/gui/team_window/ |
H A D | VariablesView.h | 13 #include "table/TreeTable.h" 64 virtual void TreeTableNodeExpandedChanged(TreeTable* table, 66 virtual void TreeTableNodeInvoked(TreeTable* table, 68 virtual void TreeTableCellMouseDown(TreeTable* table,
|
H A D | ImageListView.h | 10 #include "table/Table.h" 44 virtual void TableSelectionChanged(Table* table);
|
H A D | ThreadListView.h | 11 #include "table/Table.h" 50 virtual void TableSelectionChanged(Table* table);
|
H A D | BreakpointListView.h | 12 #include "table/Table.h" 74 virtual void TableSelectionChanged(Table* table);
|
H A D | ImageFunctionsView.h | 11 #include "table/TreeTable.h" 48 virtual void TreeTableSelectionChanged(TreeTable* table);
|
/haiku/src/system/boot/platform/efi/ |
H A D | acpi.cpp | 103 TRACE(("acpi: invalid extended system description table\n")); 111 // validate the root system description table 119 TRACE(("acpi: invalid root system description table\n")); 159 TRACE(("acpi: root system description table is empty\n")); 163 TRACE(("acpi: searching %" B_PRId32 " entries for table '%.4s'\n", sNumEntries, 209 efi_configuration_table *table = kSystemTable->ConfigurationTable; local 214 if (!table[i].VendorGuid.equals(acpi)) 217 acpi_rsdp *rsdp = (acpi_rsdp *)(table[i].VendorTable);
|
/haiku/src/tests/kits/shared/ |
H A D | KeymapTest.cpp | 89 const int32(*table)[128] = (*p).second; 94 char* mapChars = &charArray[(*table)[keycode]];
|
/haiku/src/system/libroot/posix/glibc/locale/ |
H A D | weightwc.h | 30 i = __collidx_table_lookup ((const char *) table, ch); 33 /* This is an index into the weight table. Cool. */ 105 the offset in the indirect table. */
|
/haiku/src/system/boot/platform/efi/arch/x86_64/ |
H A D | relocation_func.cpp | 39 #include <efi/system-table.h>
|
/haiku/src/system/boot/platform/efi/arch/arm/ |
H A D | relocation_func.cpp | 38 #include <efi/system-table.h>
|
/haiku/src/system/boot/platform/efi/arch/riscv64/ |
H A D | relocation_func.cpp | 40 #include <efi/system-table.h>
|
/haiku/src/system/boot/platform/efi/arch/arm64/ |
H A D | relocation_func.cpp | 38 #include <efi/system-table.h>
|
/haiku/src/system/boot/platform/efi/arch/x86/ |
H A D | relocation_func.cpp | 37 #include <efi/system-table.h>
|
/haiku/src/libs/icon/style/ |
H A D | Style.cpp | 304 Style::GammaCorrectedColors(const GammaTable& table) const 314 fGammaCorrectedColors[i].r = table.dir(fColors[i].r); 315 fGammaCorrectedColors[i].g = table.dir(fColors[i].g); 316 fGammaCorrectedColors[i].b = table.dir(fColors[i].b);
|
H A D | Style.h | 97 const GammaTable& table) const;
|
/haiku/src/add-ons/kernel/drivers/misc/ |
H A D | poke.cpp | 278 physical_entry table; 284 result = get_memory_map(ioctl.address, ioctl.size, &table, 1); 285 ioctl.physical_address = table.address; 286 ioctl.size = table.size;
|
/haiku/src/system/kernel/locks/ |
H A D | user_mutex.cpp | 71 UserMutexTable table; member in struct:user_mutex_context 184 const bool physical = (sSharedUserMutexContext.table.Lookup(entry->address) == entry); 210 sSharedUserMutexContext.lock = RW_LOCK_INITIALIZER("shared user mutex table"); 211 if (sSharedUserMutexContext.table.Init() != B_OK) 212 panic("user_mutex_init(): Failed to init table!"); 239 context->lock = RW_LOCK_INITIALIZER("user mutex table"); 240 if (context->table.Init() != B_OK) { 257 ASSERT(context->table.IsEmpty()); 270 UserMutexEntry* entry = context->table.Lookup(address); 280 entry = context->table [all...] |
/haiku/src/system/kernel/arch/generic/ |
H A D | acpi_irq_routing_table.cpp | 89 print_irq_routing_table(const IRQRoutingTable& table) argument 91 dprintf("IRQ routing table with %i entries\n", (int)table.Count()); 92 for (int i = 0; i < table.Count(); i++) 93 print_irq_routing_entry(table.ElementAt(i)); 402 // the table pointing to disabled/optional devices. Also they can be 429 find_routing_table_entry(IRQRoutingTable& table, uint8 bus, uint8 device, argument 432 for (int i = 0; i < table.Count(); i++) { 433 irq_routing_entry& irqEntry = table.ElementAt(i); 526 // This function has no matching routing table entr 611 read_irq_routing_table_recursive(acpi_module_info* acpi, pci_module_info* pci, acpi_handle parent, acpi_handle device, uint8 currentBus, IRQRoutingTable& table, IRQRoutingTable& unmatchedTable, bool rootBridge, interrupt_available_check_function checkFunction) argument 769 read_irq_routing_table(acpi_module_info* acpi, IRQRoutingTable& table, interrupt_available_check_function checkFunction) argument [all...] |
/haiku/docs/develop/kits/storage/resources/ |
H A D | ResourcesFormat.tex | 130 table, section header table or sections), but will enlarge the file by some 137 table (if any), section header table (if any), sections and segments. 282 The resource index section starts with a header, it follows a table of 338 Specifies the offset of the resource info table relative to the beginning 342 Specifies the size of the resource info table. 349 Directly, without padding, it follows a table of \code{resource\_index\_entry} 350 structures. The number of entries in the table is the number of resources 353 are stored without padding, the size of the table i [all...] |