HelenOS sources
table 113 boot/genarch/include/genarch/efi.h void *table;
table 40 boot/genarch/src/efi.c return st->conf_table[i].table;
table 130 kernel/generic/include/sysinfo/sysinfo.h struct sysinfo_item *table; /**< Fixed subtree (list of subitems) */
table 71 kernel/generic/src/sysinfo/sysinfo.c item->subtree.table = NULL;
table 152 kernel/generic/src/sysinfo/sysinfo.c cur->subtree.table, ret, dry_run);
table 222 kernel/generic/src/sysinfo/sysinfo.c &((*psubtree)->subtree.table));
table 258 kernel/generic/src/sysinfo/sysinfo.c &(cur->subtree.table));
table 262 kernel/generic/src/sysinfo/sysinfo.c &(cur->subtree.table));
table 300 kernel/generic/src/sysinfo/sysinfo.c name + i + 1, &(item->subtree.table));
table 574 kernel/generic/src/sysinfo/sysinfo.c sysinfo_dump_internal(cur->subtree.table, spaces + length);
table 736 kernel/generic/src/sysinfo/sysinfo.c subtree = item->subtree.table;
table 209 uspace/app/devctl/devctl.c table_t *table = NULL;
table 216 uspace/app/devctl/devctl.c rc = table_create(&table);
table 222 uspace/app/devctl/devctl.c table_header_row(table);
table 223 uspace/app/devctl/devctl.c table_printf(table, "Driver\t" "Devs\t" "State\n");
table 240 uspace/app/devctl/devctl.c table_printf(table, "%s\t" "%zu\t" "%s\n", drv_name, ndevs, sstate);
table 245 uspace/app/devctl/devctl.c rc = table_print_out(table, stdout);
table 250 uspace/app/devctl/devctl.c table_destroy(table);
table 215 uspace/app/disp/disp.c table_t *table = NULL;
table 239 uspace/app/disp/disp.c rc = table_create(&table);
table 246 uspace/app/disp/disp.c table_header_row(table);
table 247 uspace/app/disp/disp.c table_printf(table, "Seat Name\n");
table 258 uspace/app/disp/disp.c table_printf(table, "%s\n", sinfo->name);
table 264 uspace/app/disp/disp.c rc = table_print_out(table, stdout);
table 273 uspace/app/disp/disp.c table_destroy(table);
table 411 uspace/app/disp/disp.c table_t *table = NULL;
table 449 uspace/app/disp/disp.c rc = table_create(&table);
table 457 uspace/app/disp/disp.c table_header_row(table);
table 458 uspace/app/disp/disp.c table_printf(table, "Device Name\n");
table 468 uspace/app/disp/disp.c table_printf(table, "%s\n", svc_name);
table 473 uspace/app/disp/disp.c rc = table_print_out(table, stdout);
table 476 uspace/app/disp/disp.c table_destroy(table);
table 253 uspace/app/inet/inet.c table_t *table = NULL;
table 269 uspace/app/inet/inet.c rc = table_create(&table);
table 275 uspace/app/inet/inet.c table_header_row(table);
table 276 uspace/app/inet/inet.c table_printf(table, "Addr/Width\t" "Link-Name\t" "Addr-Name\t"
table 303 uspace/app/inet/inet.c table_printf(table, "%s\t" "%s\t" "%s\t" "%zu\n", astr,
table 316 uspace/app/inet/inet.c rc = table_print_out(table, stdout);
table 325 uspace/app/inet/inet.c table_destroy(table);
table 342 uspace/app/inet/inet.c table_t *table = NULL;
table 355 uspace/app/inet/inet.c rc = table_create(&table);
table 361 uspace/app/inet/inet.c table_header_row(table);
table 362 uspace/app/inet/inet.c table_printf(table, "Link-layer Address\t" "Link-Name\t" "Def-MTU\n");
table 373 uspace/app/inet/inet.c table_printf(table, "%s\t %s\t %zu\n", saddr.str, linfo.name,
table 382 uspace/app/inet/inet.c rc = table_print_out(table, stdout);
table 391 uspace/app/inet/inet.c table_destroy(table);
table 401 uspace/app/inet/inet.c table_t *table = NULL;
table 417 uspace/app/inet/inet.c rc = table_create(&table);
table 423 uspace/app/inet/inet.c table_header_row(table);
table 424 uspace/app/inet/inet.c table_printf(table, "Dest/Width\t" "Router-Addr\t" "Route-Name\n");
table 449 uspace/app/inet/inet.c table_printf(table, "%s\t" "%s\t" "%s\n", dest_str, router_str,
table 462 uspace/app/inet/inet.c rc = table_print_out(table, stdout);
table 471 uspace/app/inet/inet.c table_destroy(table);
table 177 uspace/app/pci/pci.c table_t *table = NULL;
table 186 uspace/app/pci/pci.c rc = table_create(&table);
table 193 uspace/app/pci/pci.c table_header_row(table);
table 194 uspace/app/pci/pci.c table_printf(table, "Address\t" "Type\t" "Driver\n");
table 231 uspace/app/pci/pci.c table_printf(table, "%02x.%02x.%x\t" "%04x:%04x\t"
table 238 uspace/app/pci/pci.c rc = table_print_out(table, stdout);
table 244 uspace/app/pci/pci.c table_destroy(table);
table 245 uspace/app/pci/pci.c table = NULL;
table 258 uspace/app/pci/pci.c if (table != NULL)
table 259 uspace/app/pci/pci.c table_destroy(table);
table 350 uspace/app/top/screen.c static inline void print_table_head(const table_t *table)
table 357 uspace/app/top/screen.c for (size_t i = 0; i < table->num_columns; i++) {
table 358 uspace/app/top/screen.c const char *name = table->columns[i].name;
table 359 uspace/app/top/screen.c int width = table->columns[i].width;
table 375 uspace/app/top/screen.c static inline void print_table(const table_t *table)
table 386 uspace/app/top/screen.c for (i = 0; (i < table->num_fields) && (row < rows); i++) {
table 387 uspace/app/top/screen.c size_t column_index = i % table->num_columns;
table 388 uspace/app/top/screen.c int width = table->columns[column_index].width;
table 389 uspace/app/top/screen.c field_t *field = &table->fields[i];
table 435 uspace/app/top/screen.c if (column_index == table->num_columns - 1) {
table 447 uspace/app/top/screen.c static inline void print_sort(table_t *table)
table 457 uspace/app/top/screen.c size_t num = min(table->num_columns, rows - row);
table 459 uspace/app/top/screen.c printf("%c - %s", table->columns[i].key, table->columns[i].name);
table 496 uspace/app/top/screen.c print_table_head(&data->table);
table 497 uspace/app/top/screen.c print_table(&data->table);
table 500 uspace/app/top/screen.c print_sort(&data->table);
table 149 uspace/app/top/top.c target->table.name = NULL;
table 150 uspace/app/top/top.c target->table.num_columns = 0;
table 151 uspace/app/top/top.c target->table.columns = NULL;
table 152 uspace/app/top/top.c target->table.num_fields = 0;
table 153 uspace/app/top/top.c target->table.fields = NULL;
table 400 uspace/app/top/top.c static void sort_table(table_t *table)
table 402 uspace/app/top/top.c if (sort_column >= table->num_columns)
table 405 uspace/app/top/top.c gsort((void *) table->fields, table->num_fields / table->num_columns,
table 406 uspace/app/top/top.c sizeof(field_t) * table->num_columns, cmp_data, NULL);
table 411 uspace/app/top/top.c data->table.name = "Tasks";
table 412 uspace/app/top/top.c data->table.num_columns = TASK_NUM_COLUMNS;
table 413 uspace/app/top/top.c data->table.columns = task_columns;
table 414 uspace/app/top/top.c data->table.num_fields = data->tasks_count * TASK_NUM_COLUMNS;
table 415 uspace/app/top/top.c data->table.fields = calloc(data->table.num_fields,
table 417 uspace/app/top/top.c if (data->table.fields == NULL)
table 420 uspace/app/top/top.c field_t *field = data->table.fields;
table 450 uspace/app/top/top.c data->table.name = "IPC";
table 451 uspace/app/top/top.c data->table.num_columns = IPC_NUM_COLUMNS;
table 452 uspace/app/top/top.c data->table.columns = ipc_columns;
table 453 uspace/app/top/top.c data->table.num_fields = data->tasks_count * IPC_NUM_COLUMNS;
table 454 uspace/app/top/top.c data->table.fields = calloc(data->table.num_fields,
table 456 uspace/app/top/top.c if (data->table.fields == NULL)
table 459 uspace/app/top/top.c field_t *field = data->table.fields;
table 483 uspace/app/top/top.c data->table.name = "Exceptions";
table 484 uspace/app/top/top.c data->table.num_columns = EXCEPTION_NUM_COLUMNS;
table 485 uspace/app/top/top.c data->table.columns = exception_columns;
table 486 uspace/app/top/top.c data->table.num_fields = data->exceptions_count *
table 488 uspace/app/top/top.c data->table.fields = calloc(data->table.num_fields, sizeof(field_t));
table 489 uspace/app/top/top.c if (data->table.fields == NULL)
table 492 uspace/app/top/top.c field_t *field = data->table.fields;
table 512 uspace/app/top/top.c data->table.num_fields = field - data->table.fields;
table 519 uspace/app/top/top.c if (data->table.fields != NULL) {
table 520 uspace/app/top/top.c free(data->table.fields);
table 521 uspace/app/top/top.c data->table.fields = NULL;
table 576 uspace/app/top/top.c if (target->table.fields != NULL)
table 577 uspace/app/top/top.c free(target->table.fields);
table 625 uspace/app/top/top.c for (size_t i = 0; i < data.table.num_columns; i++) {
table 626 uspace/app/top/top.c if (data.table.columns[i].key == c) {
table 677 uspace/app/top/top.c sort_table(&data.table);
table 149 uspace/app/top/top.h table_t table;
table 201 uspace/app/vol/vol.c table_t *table = NULL;
table 216 uspace/app/vol/vol.c rc = table_create(&table);
table 222 uspace/app/vol/vol.c table_header_row(table);
table 223 uspace/app/vol/vol.c table_printf(table, "Volume Name\t" "Resource\t" "Content\t" "Auto\t"
table 246 uspace/app/vol/vol.c table_printf(table, "%s\t" "%s\t" "%s\t" "%s\t" "%s\n",
table 255 uspace/app/vol/vol.c rc = table_print_out(table, stdout);
table 259 uspace/app/vol/vol.c table_destroy(table);
table 277 uspace/app/vol/vol.c table_t *table = NULL;
table 292 uspace/app/vol/vol.c rc = table_create(&table);
table 298 uspace/app/vol/vol.c table_header_row(table);
table 299 uspace/app/vol/vol.c table_printf(table, "Volume Name\t" "Path\n");
table 308 uspace/app/vol/vol.c table_printf(table, "%s\t" "%s\n", vinfo.label, vinfo.path);
table 311 uspace/app/vol/vol.c rc = table_print_out(table, stdout);
table 315 uspace/app/vol/vol.c table_destroy(table);
table 352 uspace/dist/src/c/demos/top/screen.c static inline void print_table_head(const table_t *table)
table 359 uspace/dist/src/c/demos/top/screen.c for (size_t i = 0; i < table->num_columns; i++) {
table 360 uspace/dist/src/c/demos/top/screen.c const char *name = table->columns[i].name;
table 361 uspace/dist/src/c/demos/top/screen.c int width = table->columns[i].width;
table 377 uspace/dist/src/c/demos/top/screen.c static inline void print_table(const table_t *table)
table 388 uspace/dist/src/c/demos/top/screen.c for (i = 0; (i < table->num_fields) && (row < rows); i++) {
table 389 uspace/dist/src/c/demos/top/screen.c size_t column_index = i % table->num_columns;
table 390 uspace/dist/src/c/demos/top/screen.c int width = table->columns[column_index].width;
table 391 uspace/dist/src/c/demos/top/screen.c field_t *field = &table->fields[i];
table 437 uspace/dist/src/c/demos/top/screen.c if (column_index == table->num_columns - 1) {
table 449 uspace/dist/src/c/demos/top/screen.c static inline void print_sort(table_t *table)
table 459 uspace/dist/src/c/demos/top/screen.c size_t num = min(table->num_columns, rows - row);
table 461 uspace/dist/src/c/demos/top/screen.c printf("%c - %s", table->columns[i].key, table->columns[i].name);
table 498 uspace/dist/src/c/demos/top/screen.c print_table_head(&data->table);
table 499 uspace/dist/src/c/demos/top/screen.c print_table(&data->table);
table 502 uspace/dist/src/c/demos/top/screen.c print_sort(&data->table);
table 150 uspace/dist/src/c/demos/top/top.c target->table.name = NULL;
table 151 uspace/dist/src/c/demos/top/top.c target->table.num_columns = 0;
table 152 uspace/dist/src/c/demos/top/top.c target->table.columns = NULL;
table 153 uspace/dist/src/c/demos/top/top.c target->table.num_fields = 0;
table 154 uspace/dist/src/c/demos/top/top.c target->table.fields = NULL;
table 401 uspace/dist/src/c/demos/top/top.c static void sort_table(table_t *table)
table 403 uspace/dist/src/c/demos/top/top.c if (sort_column >= table->num_columns)
table 406 uspace/dist/src/c/demos/top/top.c gsort((void *) table->fields, table->num_fields / table->num_columns,
table 407 uspace/dist/src/c/demos/top/top.c sizeof(field_t) * table->num_columns, cmp_data, NULL);
table 412 uspace/dist/src/c/demos/top/top.c data->table.name = "Tasks";
table 413 uspace/dist/src/c/demos/top/top.c data->table.num_columns = TASK_NUM_COLUMNS;
table 414 uspace/dist/src/c/demos/top/top.c data->table.columns = task_columns;
table 415 uspace/dist/src/c/demos/top/top.c data->table.num_fields = data->tasks_count * TASK_NUM_COLUMNS;
table 416 uspace/dist/src/c/demos/top/top.c data->table.fields = calloc(data->table.num_fields,
table 418 uspace/dist/src/c/demos/top/top.c if (data->table.fields == NULL)
table 421 uspace/dist/src/c/demos/top/top.c field_t *field = data->table.fields;
table 451 uspace/dist/src/c/demos/top/top.c data->table.name = "IPC";
table 452 uspace/dist/src/c/demos/top/top.c data->table.num_columns = IPC_NUM_COLUMNS;
table 453 uspace/dist/src/c/demos/top/top.c data->table.columns = ipc_columns;
table 454 uspace/dist/src/c/demos/top/top.c data->table.num_fields = data->tasks_count * IPC_NUM_COLUMNS;
table 455 uspace/dist/src/c/demos/top/top.c data->table.fields = calloc(data->table.num_fields,
table 457 uspace/dist/src/c/demos/top/top.c if (data->table.fields == NULL)
table 460 uspace/dist/src/c/demos/top/top.c field_t *field = data->table.fields;
table 484 uspace/dist/src/c/demos/top/top.c data->table.name = "Exceptions";
table 485 uspace/dist/src/c/demos/top/top.c data->table.num_columns = EXCEPTION_NUM_COLUMNS;
table 486 uspace/dist/src/c/demos/top/top.c data->table.columns = exception_columns;
table 487 uspace/dist/src/c/demos/top/top.c data->table.num_fields = data->exceptions_count *
table 489 uspace/dist/src/c/demos/top/top.c data->table.fields = calloc(data->table.num_fields, sizeof(field_t));
table 490 uspace/dist/src/c/demos/top/top.c if (data->table.fields == NULL)
table 493 uspace/dist/src/c/demos/top/top.c field_t *field = data->table.fields;
table 513 uspace/dist/src/c/demos/top/top.c data->table.num_fields = field - data->table.fields;
table 520 uspace/dist/src/c/demos/top/top.c if (data->table.fields != NULL) {
table 521 uspace/dist/src/c/demos/top/top.c free(data->table.fields);
table 522 uspace/dist/src/c/demos/top/top.c data->table.fields = NULL;
table 577 uspace/dist/src/c/demos/top/top.c if (target->table.fields != NULL)
table 578 uspace/dist/src/c/demos/top/top.c free(target->table.fields);
table 621 uspace/dist/src/c/demos/top/top.c for (size_t i = 0; i < data.table.num_columns; i++) {
table 622 uspace/dist/src/c/demos/top/top.c if (data.table.columns[i].key == c) {
table 673 uspace/dist/src/c/demos/top/top.c sort_table(&data.table);
table 149 uspace/dist/src/c/demos/top/top.h table_t table;
table 94 uspace/drv/audio/sb16/mixer.c const channel_t *table;
table 158 uspace/drv/audio/sb16/mixer.c const channel_t *ch = &volume_table[mixer->type].table[item];
table 182 uspace/drv/audio/sb16/mixer.c const channel_t *chan = &volume_table[mixer->type].table[item];
table 203 uspace/drv/audio/sb16/mixer.c const channel_t *chan = &volume_table[mixer->type].table[item];
table 218 uspace/drv/audio/sb16/mixer.c volume_table[mixer->type].table[item].name, value);
table 54 uspace/lib/c/generic/io/table.c static errno_t table_add_row(table_t *table, table_row_t **rrow)
table 62 uspace/lib/c/generic/io/table.c row->table = table;
table 64 uspace/lib/c/generic/io/table.c list_append(&row->ltable, &table->rows);
table 102 uspace/lib/c/generic/io/table.c static errno_t table_add_column(table_t *table, table_column_t **rcolumn)
table 110 uspace/lib/c/generic/io/table.c column->table = table;
table 112 uspace/lib/c/generic/io/table.c list_append(&column->ltable, &table->columns);
table 124 uspace/lib/c/generic/io/table.c static errno_t table_write_next_cell(table_t *table)
table 128 uspace/lib/c/generic/io/table.c rc = table_row_add_cell(table->wrow, &table->wcell);
table 134 uspace/lib/c/generic/io/table.c if (list_count(&table->wrow->cells) == 1) {
table 136 uspace/lib/c/generic/io/table.c table->wcolumn = table_column_first(table);
table 139 uspace/lib/c/generic/io/table.c table->wcolumn = table_column_next(table->wcolumn);
table 142 uspace/lib/c/generic/io/table.c if (table->wcolumn == NULL) {
table 143 uspace/lib/c/generic/io/table.c rc = table_add_column(table, &table->wcolumn);
table 158 uspace/lib/c/generic/io/table.c static errno_t table_write_next_row(table_t *table)
table 162 uspace/lib/c/generic/io/table.c rc = table_add_row(table, &table->wrow);
table 168 uspace/lib/c/generic/io/table.c table->wcell = NULL;
table 177 uspace/lib/c/generic/io/table.c static table_row_t *table_row_first(table_t *table)
table 181 uspace/lib/c/generic/io/table.c link = list_first(&table->rows);
table 197 uspace/lib/c/generic/io/table.c link = list_next(&cur->ltable, &cur->table->rows);
table 241 uspace/lib/c/generic/io/table.c static table_column_t *table_column_first(table_t *table)
table 245 uspace/lib/c/generic/io/table.c link = list_first(&table->columns);
table 261 uspace/lib/c/generic/io/table.c link = list_next(&cur->ltable, &cur->table->columns);
table 303 uspace/lib/c/generic/io/table.c table_t *table;
table 306 uspace/lib/c/generic/io/table.c table = calloc(1, sizeof(table_t));
table 307 uspace/lib/c/generic/io/table.c if (table == NULL)
table 310 uspace/lib/c/generic/io/table.c table->error = EOK;
table 311 uspace/lib/c/generic/io/table.c list_initialize(&table->rows);
table 312 uspace/lib/c/generic/io/table.c list_initialize(&table->columns);
table 314 uspace/lib/c/generic/io/table.c rc = table_add_row(table, &table->wrow);
table 318 uspace/lib/c/generic/io/table.c rc = table_row_add_cell(table->wrow, &table->wcell);
table 322 uspace/lib/c/generic/io/table.c rc = table_add_column(table, &table->wcolumn);
table 326 uspace/lib/c/generic/io/table.c *rtable = table;
table 329 uspace/lib/c/generic/io/table.c table_destroy(table);
table 337 uspace/lib/c/generic/io/table.c void table_destroy(table_t *table)
table 343 uspace/lib/c/generic/io/table.c if (table == NULL)
table 346 uspace/lib/c/generic/io/table.c row = table_row_first(table);
table 359 uspace/lib/c/generic/io/table.c row = table_row_first(table);
table 362 uspace/lib/c/generic/io/table.c column = table_column_first(table);
table 367 uspace/lib/c/generic/io/table.c column = table_column_first(table);
table 370 uspace/lib/c/generic/io/table.c free(table);
table 380 uspace/lib/c/generic/io/table.c errno_t table_print_out(table_t *table, FILE *f)
table 391 uspace/lib/c/generic/io/table.c if (table->error != EOK)
table 392 uspace/lib/c/generic/io/table.c return table->error;
table 394 uspace/lib/c/generic/io/table.c row = table_row_first(table);
table 401 uspace/lib/c/generic/io/table.c column = table_column_first(table);
table 405 uspace/lib/c/generic/io/table.c spacing = firstc ? table->metrics.margin_left : 1;
table 424 uspace/lib/c/generic/io/table.c if (firstr && table->header_row) {
table 426 uspace/lib/c/generic/io/table.c column = table_column_first(table);
table 429 uspace/lib/c/generic/io/table.c spacing = firstc ? table->metrics.margin_left : 1;
table 461 uspace/lib/c/generic/io/table.c void table_header_row(table_t *table)
table 463 uspace/lib/c/generic/io/table.c assert(list_count(&table->rows) == 1);
table 464 uspace/lib/c/generic/io/table.c assert(!table->header_row);
table 465 uspace/lib/c/generic/io/table.c table->header_row = true;
table 477 uspace/lib/c/generic/io/table.c errno_t table_printf(table_t *table, const char *fmt, ...)
table 486 uspace/lib/c/generic/io/table.c if (table->error != EOK)
table 487 uspace/lib/c/generic/io/table.c return table->error;
table 494 uspace/lib/c/generic/io/table.c table->error = ENOMEM;
table 495 uspace/lib/c/generic/io/table.c return table->error;
table 499 uspace/lib/c/generic/io/table.c while (*sp != '\0' && table->error == EOK) {
table 504 uspace/lib/c/generic/io/table.c if (table->wcell == NULL) {
table 505 uspace/lib/c/generic/io/table.c rc = table_write_next_cell(table);
table 512 uspace/lib/c/generic/io/table.c rc = table_cell_extend(table->wcell, sp, ep - sp);
table 515 uspace/lib/c/generic/io/table.c table->error = ENOMEM;
table 520 uspace/lib/c/generic/io/table.c width = str_width(table->wcell->text);
table 521 uspace/lib/c/generic/io/table.c if (width > table->wcolumn->width)
table 522 uspace/lib/c/generic/io/table.c table->wcolumn->width = width;
table 525 uspace/lib/c/generic/io/table.c rc = table_write_next_cell(table);
table 527 uspace/lib/c/generic/io/table.c rc = table_write_next_row(table);
table 533 uspace/lib/c/generic/io/table.c table->error = ENOMEM;
table 540 uspace/lib/c/generic/io/table.c rc = table->error;
table 551 uspace/lib/c/generic/io/table.c errno_t table_get_error(table_t *table)
table 553 uspace/lib/c/generic/io/table.c return table->error;
table 561 uspace/lib/c/generic/io/table.c void table_set_margin_left(table_t *table, size_t mleft)
table 563 uspace/lib/c/generic/io/table.c table->metrics.margin_left = mleft;
table 63 uspace/lib/c/include/io/table.h struct table *table;
table 73 uspace/lib/c/include/io/table.h struct table *table;
table 34 uspace/lib/c/test/io/table.c PCUT_TEST_SUITE(table);
table 38 uspace/lib/c/test/io/table.c table_t *table;
table 41 uspace/lib/c/test/io/table.c rc = table_create(&table);
table 43 uspace/lib/c/test/io/table.c table_header_row(table);
table 44 uspace/lib/c/test/io/table.c rc = table_printf(table, "A\t" "B\t" "C\t" "D\n");
table 46 uspace/lib/c/test/io/table.c rc = table_printf(table, "1\t" "2\t" "3\t" "4\n");
table 47 uspace/lib/c/test/io/table.c rc = table_printf(table, "i\t" "ii\t" "iii\t" "iv\n");
table 48 uspace/lib/c/test/io/table.c table_destroy(table);
table 51 uspace/lib/c/test/io/table.c PCUT_EXPORT(table);
table 58 uspace/lib/c/test/main.c PCUT_IMPORT(table);
table 51 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp hash_table_iterator(hash_table_bucket<value_type, size_type>* table = nullptr,
table 54 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp : table_{table}, idx_{idx}, max_idx_{max_idx}, current_{current}
table 156 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp hash_table_const_iterator(const hash_table_bucket<value_type, size_type>* table = nullptr,
table 159 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp : table_{table}, idx_{idx}, max_idx_{max_idx}, current_{current}
table 40 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::size_type count(const Table& table, const Key& key)
table 42 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return table.find(key) == table.end() ? 0 : 1;
table 46 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::place_type find_insertion_spot(const Table& table, const Key& key)
table 48 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto idx = table.get_bucket_idx_(key);
table 49 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto head = table.table_[idx].head;
table 56 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (table.keys_equal(key, current->value))
table 59 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp &table.table_[idx],
table 70 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp &table.table_[idx],
table 71 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head,
table 77 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::size_type erase(Table& table, const Key& key)
table 79 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto idx = table.get_bucket_idx_(key);
table 80 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto head = table.table_[idx].head;
table 88 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (table.keys_equal(key, current->value))
table 90 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp --table.size_;
table 95 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head = current->next;
table 97 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head = nullptr;
table 117 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp > equal_range(Table& table, const Key& key)
table 119 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto it = table.find(key);
table 127 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp > equal_range_const(const Table& table, const Key& key)
table 129 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto it = table.find(key);
table 143 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp > emplace(Table& table, Args&&... args)
table 149 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.increment_size();
table 152 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp const auto& key = table.get_key(val);
table 153 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
table 156 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return make_pair(table.end(), false);
table 158 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (target && table.keys_equal(key, target->value))
table 160 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.decrement_size();
table 164 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx, table.bucket_count(),
table 176 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx,
table 177 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.bucket_count(),
table 186 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp > insert(Table& table, const Value& val)
table 191 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.increment_size();
table 193 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp const auto& key = table.get_key(val);
table 194 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
table 197 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return make_pair(table.end(), false);
table 199 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (target && table.keys_equal(key, target->value))
table 201 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.decrement_size();
table 205 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx, table.bucket_count(),
table 217 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx,
table 218 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.bucket_count(),
table 227 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp > insert(Table& table, Value&& val)
table 233 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.increment_size();
table 235 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp const auto& key = table.get_key(val);
table 236 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
table 239 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return make_pair(table.end(), false);
table 241 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (target && table.keys_equal(key, target->value))
table 243 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.decrement_size();
table 247 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx, table.bucket_count(),
table 259 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx,
table 260 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.bucket_count(),
table 270 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::size_type count(const Table& table, const Key& key)
table 272 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto head = table.table_[table.get_bucket_idx_(key)].head;
table 280 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (table.keys_equal(key, current->value))
table 291 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::place_type find_insertion_spot(const Table& table, const Key& key)
table 293 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto idx = table.get_bucket_idx_(key);
table 294 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto head = table.table_[idx].head;
table 301 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (table.keys_equal(key, current->value))
table 304 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp &table.table_[idx],
table 315 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp &table.table_[idx],
table 316 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head,
table 322 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::size_type erase(Table& table, const Key& key)
table 324 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto idx = table.get_bucket_idx_(key);
table 325 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto head = table.table_[idx].head;
table 327 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head = nullptr;
table 347 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (!table.keys_equal(key, tmp->value))
table 350 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head = tmp;
table 357 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp --table.size_;
table 372 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp > equal_range(Table& table, const Key& key)
table 374 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto first = table.find(key);
table 375 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (first == table.end())
table 376 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return make_pair(table.end(), table.end());
table 382 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp } while (last != table.end() && table.keys_equal(key, *last));
table 391 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp > equal_range_const(const Table& table, const Key& key)
table 393 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto first = table.find(key);
table 394 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (first == table.end())
table 395 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return make_pair(table.end(), table.end());
table 401 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp } while (last != table.end() && table.keys_equal(key, *last));
table 407 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::iterator emplace(Table& table, Args&&... args)
table 413 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return insert(table, node);
table 417 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::iterator insert(Table& table, const Value& val)
table 423 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return insert(table, node);
table 427 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::iterator insert(Table& table, Value&& val)
table 434 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return insert(table, node);
table 438 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp static typename Table::iterator insert(Table& table, typename Table::node_type* node)
table 442 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.increment_size();
table 444 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp const auto& key = table.get_key(node->value);
table 445 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
table 448 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp return table.end();
table 450 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp if (target && table.keys_equal(key, target->value))
table 456 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx,
table 457 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.bucket_count(),
table 330 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx, table_.bucket_count(),
table 342 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx,
table 365 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx, table_.bucket_count(),
table 377 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx,
table 413 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx, table_.bucket_count(),
table 425 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx,
table 449 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx, table_.bucket_count(),
table 461 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx,
table 496 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), first.idx(),
table 1000 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), first.idx(),
table 309 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp table_.table(), first.idx(),
table 725 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp table_.table(), first.idx(),
table 57 uspace/lib/nic/include/nic_wol_virtues.h hash_table_t table;
table 83 uspace/lib/nic/src/nic_wol_virtues.c if (!hash_table_create(&wvs->table, 0, 0, &wvs->table_operations)) {
table 102 uspace/lib/nic/src/nic_wol_virtues.c hash_table_clear(&wvs->table);
table 171 uspace/lib/nic/src/nic_wol_virtues.c } while (NULL != hash_table_find(&wvs->table, &virtue->id));
table 172 uspace/lib/nic/src/nic_wol_virtues.c hash_table_insert(&wvs->table, &virtue->item);
table 191 uspace/lib/nic/src/nic_wol_virtues.c (nic_wol_virtue_t *) hash_table_find(&wvs->table, &id);
table 197 uspace/lib/nic/src/nic_wol_virtues.c hash_table_remove_item(&wvs->table, &virtue->item);
table 233 uspace/lib/nic/src/nic_wol_virtues.c ht_link_t *virtue = hash_table_find(&((nic_wol_virtues_t *) wvs)->table, &id);
table 63 uspace/lib/posix/include/libc/io/table.h struct table *table;
table 73 uspace/lib/posix/include/libc/io/table.h struct table *table;
HelenOS homepage, sources at GitHub