Searched refs:table (Results 76 - 100 of 140) sorted by relevance

123456

/haiku/src/apps/debugger/user_interface/gui/team_window/
H A DStackTraceView.cpp17 #include "table/TableColumns.h"
218 StackTraceView::TableSelectionChanged(Table* table) argument
224 = fFramesTableModel->FrameAt(table->SelectionModel()->RowAt(0));
H A DImageListView.cpp20 #include "table/TableColumns.h"
284 ImageListView::TableSelectionChanged(Table* table) argument
291 TableSelectionModel* selectionModel = table->SelectionModel();
H A DThreadListView.cpp21 #include "table/TableColumns.h"
350 ThreadListView::TableSelectionChanged(Table* table) argument
356 TableSelectionModel* selectionModel = table->SelectionModel();
/haiku/src/apps/debuganalyzer/gui/main_window/
H A DTeamsPage.cpp13 #include "table/TableColumns.h"
125 MainWindow::TeamsPage::TableRowInvoked(Table* table, int32 rowIndex) argument
H A DThreadsPage.cpp13 #include "table/TableColumns.h"
191 MainWindow::ThreadsPage::TableRowInvoked(Table* table, int32 rowIndex) argument
/haiku/src/apps/debuganalyzer/gui/table/
H A DAbstractTable.h78 void SetTable(AbstractTable* table);
H A DTable.cpp6 #include "table/Table.h"
140 TableSelectionModel::TableSelectionModel(Table* table) argument
142 fTable(table),
231 TableListener::TableSelectionChanged(Table* table) argument
237 TableListener::TableRowInvoked(Table* table, int32 rowIndex) argument
243 TableListener::TableCellMouseDown(Table* table, int32 rowIndex, argument
250 TableListener::TableCellMouseUp(Table* table, int32 rowIndex, int32 columnIndex, argument
522 // get the table row
528 // get the table column
565 // get the table ro
[all...]
H A DTreeTable.cpp7 #include "table/TreeTable.h"
263 TreeTableListener::TreeTableSelectionChanged(TreeTable* table) argument
269 TreeTableListener::TreeTableNodeInvoked(TreeTable* table, argument
276 TreeTableListener::TreeTableNodeExpandedChanged(TreeTable* table, argument
283 TreeTableListener::TreeTableCellMouseDown(TreeTable* table, argument
291 TreeTableListener::TreeTableCellMouseUp(TreeTable* table, argument
575 TreeTableSelectionModel::TreeTableSelectionModel(TreeTable* table) argument
577 fTreeTable(table),
868 // get the table row
874 // get the table colum
[all...]
/haiku/src/system/libroot/posix/glibc/locale/
H A Dweight.h25 int_fast32_t i = table[*(*cpp)++];
30 /* This is an index into the weight table. Cool. */
114 the offset in the indirect table. */
/haiku/src/apps/serialconnect/libvterm/src/
H A Dencoding.c189 struct StaticTableEncoding *table = (struct StaticTableEncoding *)enc; local
198 if(table->chars[c])
199 cp[(*cpi)++] = table->chars[c];
H A Dunicode.c6 // moved 'combining' table to file scope, so other functions can see it
131 /* auxiliary function for binary search in interval table */
132 static int bisearch(wchar_t ucs, const struct interval *table, int max) { argument
136 if (ucs < table[0].first || ucs > table[max].last)
140 if (ucs > table[mid].last)
142 else if (ucs < table[mid].first)
193 /* binary search in table of non-spacing characters */
300 /* binary search in table of non-spacing characters */
/haiku/src/tests/add-ons/kernel/bus_managers/agp_gart/
H A Dgart_tester.cpp37 get_memory_map(const void* address, ulong numBytes, physical_entry* table, argument
40 table[0].address = (void *)((addr_t)address - 0x100000);
41 table[0].size = numBytes;
42 //dprintf("GET_MEMORY_MAP: %p -> %p\n", address, table[0].address);
/haiku/src/libs/udis86/
H A Ddecode.c348 u->mnemonic = ud_itab[ u->le->table[ inp_curr( u ) ] ].mnemonic;
1052 * valid entry in the table, decode the operands, and read the final
1060 UD_ASSERT(u->le->table[0xc] != 0);
1061 decode_insn(u, u->le->table[0xc]);
1066 ptr = u->le->table[inp_curr(u)];
1088 if (u->le->table[idx] == 0) {
1091 if (idx && u->le->table[idx] != 0) {
1106 return decode_ext(u, u->le->table[idx]);
1136 return decode_ext(u, u->le->table[index]);
1180 idx = (u->le->table[id
[all...]
/haiku/src/system/kernel/arch/x86/
H A Dioapic.cpp58 // Fields of each redirection table entry
737 // table as it will return different settings depending on the model
745 IRQRoutingTable table; local
746 status = prepare_irq_routing(acpiModule, table,
772 print_irq_routing_table(table);
775 status = enable_irq_routing(acpiModule, table);
783 print_irq_routing_table(table);
788 // configure IO-APIC interrupts from PCI routing table
789 for (int i = 0; i < table.Count(); i++) {
790 irq_routing_entry& entry = table
[all...]
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/contrib/ath_hal/ar9300/
H A Dar9300_phy.c146 /* Venice TODO: round_up_rate() is broken when the rate table does not represent
588 * Unfortunately, the rate table doesn't have separate entries for these!.
649 /* Get the correct OFDM rate to Power table Index */
763 /* Get the correct MCS rate to Power table Index */
786 /* Get the correct MCS rate to Power table Index */
809 /* Get the correct MCS rate to Power table Index */
1100 u_int8_t rateIdx; /* rate index in the rate table */
1119 struct rate_power_tbl *table; local
1139 table = (struct rate_power_tbl *)&data[1];
1143 table[
[all...]
/haiku/src/system/kernel/arch/arm64/
H A DVMSAv8TranslationMap.cpp225 // Handle misaligned header that straddles entry boundary in next-level table
230 phys_addr_t table = MakeTable(ptPa, level, index, reservation);
231 MapRange(table, level + 1, va, pa, aligned - va, action, attr, reservation);
279 // Otherwise handle mapping in next-level table
280 phys_addr_t table = MakeTable(ptPa, level, index, reservation);
281 MapRange(table, level + 1, nextVa, targetPa, entrySize, action, attr, reservation);
286 // Handle misaligned tail area (or entirety of small area) in next-level table
289 phys_addr_t table = MakeTable(ptPa, level, index, reservation);
291 table, level + 1, nextVa, pa + (nextVa - va), end - nextVa, action, attr, reservation);
/haiku/src/libs/compat/freebsd_network/compat/dev/usb/
H A Dusbdi.h225 #define USB_PNP_HOST_INFO(table)
226 #define USB_PNP_DEVICE_INFO(table)
227 #define USB_PNP_DUAL_INFO(table)
/haiku/headers/private/userlandfs/legacy/
H A Dcache.h27 hash_ent **table; member in struct:hash_table
/haiku/src/add-ons/kernel/busses/scsi/53c8xx/
H A Dsymbios.h85 SymInd table[131]; /* 92 --- 129 entries, 1 eot, 1 scratch */ member in struct:__anon1391
/haiku/headers/libs/udis86/libudis86/
H A Ddecode.h159 /* A single operand of an entry in the instruction table.
169 /* A single entry in an instruction table.
183 const uint16_t *table; member in struct:ud_lookup_table_list_entry
/haiku/src/tests/add-ons/print/pcl6/
H A Ddisasm.h104 void PrintAttributeValue(uint8 id, const AttrValue* table, int tableSize);
/haiku/headers/posix/
H A Dstdlib.h154 u_char const *table, u_int endByte);
156 u_char const *table, u_int endByte);
/haiku/headers/os/drivers/
H A DKernelExport.h195 size_t numBytes, physical_entry *table,
198 physical_entry *table, int32 numEntries);
/haiku/src/apps/terminal/
H A DThemeView.cpp82 for (const char** table = kColorTable; *table != NULL; ++table) {
83 fAttrList->AddItem(new ColorItem(B_TRANSLATE_NOCOLLECT(*table),
84 prefHandler->getRGB(*table)));
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/
H A Dfs_cache.c7 The cache is organized as a hash table (for lookups by device
179 ht->table = (hash_ent **)calloc(ht->max, sizeof(hash_ent *));
180 if (ht->table == NULL)
194 he = ht->table[i];
202 if (ht->table)
203 free(ht->table);
204 ht->table = NULL;
215 he = ht->table[i];
274 for(he=ht->table[i]; he; he=next) {
283 free(ht->table);
[all...]

Completed in 430 milliseconds

123456