HelenOS sources
idx 172 common/adt/hash_table.c for (size_t idx = 0; idx < h->bucket_cnt; ++idx) {
idx 173 common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
idx 196 common/adt/hash_table.c size_t idx = h->op->hash(item) % h->bucket_cnt;
idx 198 common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
idx 218 common/adt/hash_table.c size_t idx = h->op->hash(item) % h->bucket_cnt;
idx 221 common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
idx 230 common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
idx 249 common/adt/hash_table.c size_t idx = h->op->key_hash(key) % h->bucket_cnt;
idx 251 common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
idx 272 common/adt/hash_table.c size_t idx = h->op->hash(item) % h->bucket_cnt;
idx 279 common/adt/hash_table.c if (cur == &h->bucket[idx].head)
idx 311 common/adt/hash_table.c size_t idx = h->op->key_hash(key) % h->bucket_cnt;
idx 315 common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
idx 367 common/adt/hash_table.c for (size_t idx = 0; idx < h->bucket_cnt; ++idx) {
idx 368 common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
idx 1016 common/str.c size_t idx = 0, dest_off = 0;
idx 1023 common/str.c while (src[idx]) {
idx 1024 common/str.c if ((src[idx] & 0xfc00) == 0xd800) {
idx 1025 common/str.c if (src[idx + 1] && (src[idx + 1] & 0xfc00) == 0xdc00) {
idx 1027 common/str.c ch += (src[idx] & 0x03FF) << 10;
idx 1028 common/str.c ch += (src[idx + 1] & 0x03FF);
idx 1029 common/str.c idx += 2;
idx 1033 common/str.c ch = src[idx];
idx 1034 common/str.c idx++;
idx 1060 common/str.c size_t idx = 0;
idx 1067 common/str.c if (idx + 2 >= dlen - 1) {
idx 1072 common/str.c dest[idx] = 0xD800 | (c >> 10);
idx 1073 common/str.c dest[idx + 1] = 0xDC00 | (c & 0x3FF);
idx 1074 common/str.c idx++;
idx 1076 common/str.c dest[idx] = c;
idx 1079 common/str.c idx++;
idx 1080 common/str.c if (idx >= dlen - 1) {
idx 1086 common/str.c dest[idx] = '\0';
idx 111 kernel/arch/sparc64/src/smp/sun4v/ipi.c unsigned idx = 0;
idx 117 kernel/arch/sparc64/src/smp/sun4v/ipi.c ipi_cpu_list[CPU->id][idx] = (uint16_t) cpus[i].id;
idx 118 kernel/arch/sparc64/src/smp/sun4v/ipi.c idx++;
idx 121 kernel/arch/sparc64/src/smp/sun4v/ipi.c ipi_brodcast_to(func, ipi_cpu_list[CPU->arch.id], idx);
idx 107 kernel/arch/sparc64/src/sun4v/md.c static md_element_t *get_element(element_idx_t idx)
idx 110 kernel/arch/sparc64/src/sun4v/md.c sizeof(md_header_t) + idx * sizeof(md_element_t));
idx 114 kernel/arch/sparc64/src/sun4v/md.c static const char *get_element_name(element_idx_t idx)
idx 117 kernel/arch/sparc64/src/sun4v/md.c uintptr_t name_offset = get_element(idx)->name_offset;
idx 136 kernel/arch/sparc64/src/sun4v/md.c element_idx_t idx = node;
idx 138 kernel/arch/sparc64/src/sun4v/md.c while (get_element(idx)->tag != NODE_END) {
idx 139 kernel/arch/sparc64/src/sun4v/md.c idx++;
idx 140 kernel/arch/sparc64/src/sun4v/md.c md_element_t *element = get_element(idx);
idx 142 kernel/arch/sparc64/src/sun4v/md.c str_cmp(key, get_element_name(idx)) == 0) {
idx 160 kernel/arch/sparc64/src/sun4v/md.c element_idx_t idx = node;
idx 162 kernel/arch/sparc64/src/sun4v/md.c while (get_element(idx)->tag != NODE_END) {
idx 163 kernel/arch/sparc64/src/sun4v/md.c idx++;
idx 164 kernel/arch/sparc64/src/sun4v/md.c md_element_t *element = get_element(idx);
idx 166 kernel/arch/sparc64/src/sun4v/md.c str_cmp(key, get_element_name(idx)) == 0) {
idx 172 kernel/generic/common/adt/hash_table.c for (size_t idx = 0; idx < h->bucket_cnt; ++idx) {
idx 173 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
idx 196 kernel/generic/common/adt/hash_table.c size_t idx = h->op->hash(item) % h->bucket_cnt;
idx 198 kernel/generic/common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
idx 218 kernel/generic/common/adt/hash_table.c size_t idx = h->op->hash(item) % h->bucket_cnt;
idx 221 kernel/generic/common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
idx 230 kernel/generic/common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
idx 249 kernel/generic/common/adt/hash_table.c size_t idx = h->op->key_hash(key) % h->bucket_cnt;
idx 251 kernel/generic/common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
idx 272 kernel/generic/common/adt/hash_table.c size_t idx = h->op->hash(item) % h->bucket_cnt;
idx 279 kernel/generic/common/adt/hash_table.c if (cur == &h->bucket[idx].head)
idx 311 kernel/generic/common/adt/hash_table.c size_t idx = h->op->key_hash(key) % h->bucket_cnt;
idx 315 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
idx 367 kernel/generic/common/adt/hash_table.c for (size_t idx = 0; idx < h->bucket_cnt; ++idx) {
idx 368 kernel/generic/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
idx 1016 kernel/generic/common/str.c size_t idx = 0, dest_off = 0;
idx 1023 kernel/generic/common/str.c while (src[idx]) {
idx 1024 kernel/generic/common/str.c if ((src[idx] & 0xfc00) == 0xd800) {
idx 1025 kernel/generic/common/str.c if (src[idx + 1] && (src[idx + 1] & 0xfc00) == 0xdc00) {
idx 1027 kernel/generic/common/str.c ch += (src[idx] & 0x03FF) << 10;
idx 1028 kernel/generic/common/str.c ch += (src[idx + 1] & 0x03FF);
idx 1029 kernel/generic/common/str.c idx += 2;
idx 1033 kernel/generic/common/str.c ch = src[idx];
idx 1034 kernel/generic/common/str.c idx++;
idx 1060 kernel/generic/common/str.c size_t idx = 0;
idx 1067 kernel/generic/common/str.c if (idx + 2 >= dlen - 1) {
idx 1072 kernel/generic/common/str.c dest[idx] = 0xD800 | (c >> 10);
idx 1073 kernel/generic/common/str.c dest[idx + 1] = 0xDC00 | (c & 0x3FF);
idx 1074 kernel/generic/common/str.c idx++;
idx 1076 kernel/generic/common/str.c dest[idx] = c;
idx 1079 kernel/generic/common/str.c idx++;
idx 1080 kernel/generic/common/str.c if (idx >= dlen - 1) {
idx 1086 kernel/generic/common/str.c dest[idx] = '\0';
idx 100 kernel/generic/src/lib/ubsan.c void __ubsan_handle_out_of_bounds(struct out_of_bounds_data *data, unsigned long idx);
idx 186 kernel/generic/src/lib/ubsan.c unsigned long idx)
idx 112 kernel/generic/src/mm/malloc.c size_t idx = fnzb(size - 1) - SLAB_MIN_MALLOC_W + 1;
idx 114 kernel/generic/src/mm/malloc.c assert(idx < sizeof(malloc_caches) / sizeof(malloc_caches[0]));
idx 116 kernel/generic/src/mm/malloc.c slab_cache_t *cache = malloc_caches[idx];
idx 112 kernel/generic/src/mm/tlb.c size_t idx = cpu->tlb_messages_count++;
idx 113 kernel/generic/src/mm/tlb.c cpu->tlb_messages[idx].type = type;
idx 114 kernel/generic/src/mm/tlb.c cpu->tlb_messages[idx].asid = asid;
idx 115 kernel/generic/src/mm/tlb.c cpu->tlb_messages[idx].page = page;
idx 116 kernel/generic/src/mm/tlb.c cpu->tlb_messages[idx].count = count;
idx 316 uspace/app/mkexfat/mkexfat.c unsigned idx;
idx 342 uspace/app/mkexfat/mkexfat.c for (idx = 0; idx < cfg->sector_size / sizeof(uint32_t); ++idx)
idx 343 uspace/app/mkexfat/mkexfat.c chksum_sector[idx] = host2uint32_t_le(vbr_checksum);
idx 440 uspace/app/mkfat/mkfat.c size_t idx;
idx 441 uspace/app/mkfat/mkfat.c for (idx = 0; idx < cfg->rootdir_sectors; ++idx) {
idx 443 uspace/app/mkfat/mkfat.c if (idx == 0 && cfg->label != NULL) {
idx 449 uspace/app/mkfat/mkfat.c } else if (idx == 1) {
idx 92 uspace/app/mkmfs/mkmfs.c static void mark_bmap(uint32_t *bmap, int idx, int v);
idx 691 uspace/app/mkmfs/mkmfs.c static void mark_bmap(uint32_t *bmap, int idx, int v)
idx 694 uspace/app/mkmfs/mkmfs.c bmap[idx / 32] &= ~(1 << (idx % 32));
idx 696 uspace/app/mkmfs/mkmfs.c bmap[idx / 32] |= 1 << (idx % 32);
idx 446 uspace/app/nic/nic.c int idx;
idx 459 uspace/app/nic/nic.c for (idx = 0; idx < 6; idx++) {
idx 460 uspace/app/nic/nic.c rc = str_uint8_t(&str[idx * 3], NULL, 16, false, &addr.address[idx]);
idx 63 uspace/app/sbi/src/bigint.c size_t idx;
idx 90 uspace/app/sbi/src/bigint.c for (idx = 0; idx < length; ++idx) {
idx 91 uspace/app/sbi/src/bigint.c bigint->digit[idx] = t % BIGINT_BASE;
idx 117 uspace/app/sbi/src/bigint.c size_t idx;
idx 129 uspace/app/sbi/src/bigint.c for (idx = 0; idx < dest->length; ++idx)
idx 130 uspace/app/sbi/src/bigint.c dest->digit[idx] = src->digit[idx];
idx 140 uspace/app/sbi/src/bigint.c size_t idx;
idx 152 uspace/app/sbi/src/bigint.c for (idx = 0; idx < dest->length; ++idx)
idx 153 uspace/app/sbi/src/bigint.c dest->digit[idx] = src->digit[idx];
idx 191 uspace/app/sbi/src/bigint.c size_t idx;
idx 199 uspace/app/sbi/src/bigint.c for (idx = 0; idx < bigint->length; ++idx) {
idx 200 uspace/app/sbi/src/bigint.c val = val * BIGINT_BASE + bigint->digit[idx];
idx 263 uspace/app/sbi/src/bigint.c size_t idx;
idx 276 uspace/app/sbi/src/bigint.c idx = lbound;
idx 277 uspace/app/sbi/src/bigint.c while (idx > 0) {
idx 278 uspace/app/sbi/src/bigint.c --idx;
idx 280 uspace/app/sbi/src/bigint.c da = a->digit[idx] + r * BIGINT_BASE;
idx 286 uspace/app/sbi/src/bigint.c quot->digit[idx] = q;
idx 338 uspace/app/sbi/src/bigint.c size_t idx;
idx 347 uspace/app/sbi/src/bigint.c for (idx = 0; idx < b->length; ++idx) {
idx 348 uspace/app/sbi/src/bigint.c bigint_shift_mul_dig(a, b->digit[idx], idx, &dprod);
idx 376 uspace/app/sbi/src/bigint.c size_t idx;
idx 413 uspace/app/sbi/src/bigint.c idx = 1;
idx 420 uspace/app/sbi/src/bigint.c str[nchars - idx] = digits[(int) rem];
idx 421 uspace/app/sbi/src/bigint.c ++idx;
idx 489 uspace/app/sbi/src/bigint.c size_t idx;
idx 504 uspace/app/sbi/src/bigint.c for (idx = 0; idx < lbound; ++idx) {
idx 505 uspace/app/sbi/src/bigint.c da = idx < a->length ? a->digit[idx] : 0;
idx 506 uspace/app/sbi/src/bigint.c db = idx < b->length ? b->digit[idx] : 0;
idx 513 uspace/app/sbi/src/bigint.c dest->digit[idx] = res;
idx 534 uspace/app/sbi/src/bigint.c size_t idx;
idx 548 uspace/app/sbi/src/bigint.c for (idx = 0; idx < lbound; ++idx) {
idx 549 uspace/app/sbi/src/bigint.c da = idx < a->length ? a->digit[idx] : 0;
idx 550 uspace/app/sbi/src/bigint.c db = idx < b->length ? b->digit[idx] : 0;
idx 561 uspace/app/sbi/src/bigint.c dest->digit[idx] = res;
idx 575 uspace/app/sbi/src/bigint.c for (idx = 0; idx < lbound; ++idx) {
idx 577 uspace/app/sbi/src/bigint.c db = dest->digit[idx];
idx 588 uspace/app/sbi/src/bigint.c dest->digit[idx] = res;
idx 610 uspace/app/sbi/src/bigint.c size_t idx;
idx 626 uspace/app/sbi/src/bigint.c for (idx = 0; idx < shift; ++idx)
idx 627 uspace/app/sbi/src/bigint.c dest->digit[idx] = 0;
idx 630 uspace/app/sbi/src/bigint.c for (idx = 0; idx < lbound - shift; ++idx) {
idx 631 uspace/app/sbi/src/bigint.c da = idx < a->length ? a->digit[idx] : 0;
idx 639 uspace/app/sbi/src/bigint.c dest->digit[shift + idx] = res;
idx 76 uspace/app/sbi/src/builtin/bi_task.c int idx, dim;
idx 105 uspace/app/sbi/src/builtin/bi_task.c for (idx = 0; idx < dim; ++idx) {
idx 106 uspace/app/sbi/src/builtin/bi_task.c arg = array->element[idx];
idx 113 uspace/app/sbi/src/builtin/bi_task.c cmd[idx] = arg->u.string_v->value;
idx 551 uspace/app/sbi/src/lex.c int idx;
idx 555 uspace/app/sbi/src/lex.c idx = 1;
idx 557 uspace/app/sbi/src/lex.c while (is_wcont(bp[idx])) {
idx 558 uspace/app/sbi/src/lex.c if (idx >= IBUF_SIZE) {
idx 563 uspace/app/sbi/src/lex.c ident_buf[idx] = bp[idx];
idx 564 uspace/app/sbi/src/lex.c ++idx;
idx 567 uspace/app/sbi/src/lex.c lex->ibp = bp + idx;
idx 569 uspace/app/sbi/src/lex.c ident_buf[idx] = '\0';
idx 1204 uspace/app/sbi/src/run.c int n_vargs, idx;
idx 1291 uspace/app/sbi/src/run.c idx = 0;
idx 1297 uspace/app/sbi/src/run.c array->element[idx] = elem_var;
idx 1300 uspace/app/sbi/src/run.c idx += 1;
idx 1652 uspace/app/sbi/src/stype_expr.c stree_prop_t *idx;
idx 1684 uspace/app/sbi/src/stype_expr.c idx = symbol_to_prop(idx_sym);
idx 1685 uspace/app/sbi/src/stype_expr.c assert(idx != NULL);
idx 1688 uspace/app/sbi/src/stype_expr.c run_texpr(stype->program, idx_sym->outer_csi, idx->type, &mtitem);
idx 425 uspace/app/taskbar/wndlist.c size_t idx;
idx 428 uspace/app/taskbar/wndlist.c idx = 0;
idx 433 uspace/app/taskbar/wndlist.c ++idx;
idx 446 uspace/app/taskbar/wndlist.c rect.p0.x = wndlist->rect.p0.x + pitch * idx;
idx 448 uspace/app/taskbar/wndlist.c rect.p1.x = wndlist->rect.p0.x + pitch * (idx + 1) - pad;
idx 50 uspace/app/taskdump/symtab.c static errno_t section_hdr_load(int fd, const elf_header_t *ehdr, int idx,
idx 305 uspace/app/taskdump/symtab.c static errno_t section_hdr_load(int fd, const elf_header_t *elf_hdr, int idx,
idx 310 uspace/app/taskdump/symtab.c aoff64_t pos = elf_hdr->e_shoff + idx * sizeof(elf_section_header_t);
idx 311 uspace/app/tester/mm/common.c unsigned long idx = rand() % mem_blocks_count;
idx 312 uspace/app/tester/mm/common.c link_t *entry = list_nth(&mem_blocks, idx);
idx 343 uspace/app/usbinfo/info.c size_t idx;
idx 344 uspace/app/usbinfo/info.c for (idx = 1; idx < 64; idx++) {
idx 345 uspace/app/usbinfo/info.c if ((str_mask & ((uint64_t)1 << idx)) == 0) {
idx 350 uspace/app/usbinfo/info.c usb_device_get_default_pipe(usb_dev), idx, lang,
idx 354 uspace/app/usbinfo/info.c get_indent(1), idx, str_error(rc));
idx 358 uspace/app/usbinfo/info.c idx, rc == EOK ? string : "");
idx 155 uspace/app/usbinfo/main.c int idx;
idx 172 uspace/app/usbinfo/main.c idx = 0;
idx 173 uspace/app/usbinfo/main.c while (actions[idx].opt != 0) {
idx 174 uspace/app/usbinfo/main.c if (actions[idx].opt == opt) {
idx 175 uspace/app/usbinfo/main.c actions[idx].active = true;
idx 179 uspace/app/usbinfo/main.c idx++;
idx 254 uspace/app/wavplay/main.c int idx = 0;
idx 261 uspace/app/wavplay/main.c ret = getopt_long(argc, argv, "d:prt:h", opts, &idx);
idx 391 uspace/drv/audio/hdaudio/hdactl.c size_t idx;
idx 401 uspace/drv/audio/hdaudio/hdactl.c idx = 0;
idx 402 uspace/drv/audio/hdaudio/hdactl.c while (idx < count) {
idx 403 uspace/drv/audio/hdaudio/hdactl.c now = min(avail, count - idx);
idx 407 uspace/drv/audio/hdaudio/hdactl.c corb[wp] = data[idx++];
idx 412 uspace/drv/audio/hdaudio/hdactl.c if (idx < count) {
idx 1231 uspace/drv/block/ata_bd/ata_bd.c uint64_t idx;
idx 1243 uspace/drv/block/ata_bd/ata_bd.c idx = ba % (d->geom.heads * d->geom.sectors);
idx 1247 uspace/drv/block/ata_bd/ata_bd.c bc->h = (idx / d->geom.sectors) & 0x0f;
idx 1248 uspace/drv/block/ata_bd/ata_bd.c bc->sector = (1 + (idx % d->geom.sectors)) & 0xff;
idx 237 uspace/drv/bus/usb/xhci/hw_struct/context.h #define XHCI_INPUT_CTRL_CTX_DROP(ctx, idx) \
idx 238 uspace/drv/bus/usb/xhci/hw_struct/context.h XHCI_DWORD_EXTRACT((ctx).data[0], (idx), (idx))
idx 240 uspace/drv/bus/usb/xhci/hw_struct/context.h #define XHCI_INPUT_CTRL_CTX_DROP_SET(ctx, idx) (ctx).data[0] |= (1 << (idx))
idx 241 uspace/drv/bus/usb/xhci/hw_struct/context.h #define XHCI_INPUT_CTRL_CTX_DROP_CLEAR(ctx, idx) (ctx).data[0] &= ~(1 << (idx))
idx 243 uspace/drv/bus/usb/xhci/hw_struct/context.h #define XHCI_INPUT_CTRL_CTX_ADD(ctx, idx) \
idx 244 uspace/drv/bus/usb/xhci/hw_struct/context.h XHCI_DWORD_EXTRACT((ctx).data[1], (idx), (idx))
idx 246 uspace/drv/bus/usb/xhci/hw_struct/context.h #define XHCI_INPUT_CTRL_CTX_ADD_SET(ctx, idx) (ctx).data[1] |= (1 << (idx))
idx 247 uspace/drv/bus/usb/xhci/hw_struct/context.h #define XHCI_INPUT_CTRL_CTX_ADD_CLEAR(ctx, idx) (ctx).data[1] &= ~(1 << (idx))
idx 208 uspace/drv/bus/usb/xhci/streams.c unsigned idx, unsigned count)
idx 215 uspace/drv/bus/usb/xhci/streams.c return initialize_primary_stream(hc, xhci_ep, idx);
idx 224 uspace/drv/bus/usb/xhci/streams.c xhci_stream_ctx_t *ctx = &xhci_ep->primary_stream_ctx_array[idx];
idx 225 uspace/drv/bus/usb/xhci/streams.c xhci_stream_data_t *data = &xhci_ep->primary_stream_data_array[idx];
idx 303 uspace/drv/char/ns8250/ns8250.c size_t idx;
idx 306 uspace/drv/char/ns8250/ns8250.c for (idx = 0; idx < count; idx++)
idx 307 uspace/drv/char/ns8250/ns8250.c ns8250_putchar(ns, bp[idx]);
idx 172 uspace/lib/c/common/adt/hash_table.c for (size_t idx = 0; idx < h->bucket_cnt; ++idx) {
idx 173 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
idx 196 uspace/lib/c/common/adt/hash_table.c size_t idx = h->op->hash(item) % h->bucket_cnt;
idx 198 uspace/lib/c/common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
idx 218 uspace/lib/c/common/adt/hash_table.c size_t idx = h->op->hash(item) % h->bucket_cnt;
idx 221 uspace/lib/c/common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
idx 230 uspace/lib/c/common/adt/hash_table.c list_append(&item->link, &h->bucket[idx]);
idx 249 uspace/lib/c/common/adt/hash_table.c size_t idx = h->op->key_hash(key) % h->bucket_cnt;
idx 251 uspace/lib/c/common/adt/hash_table.c list_foreach(h->bucket[idx], link, ht_link_t, cur_link) {
idx 272 uspace/lib/c/common/adt/hash_table.c size_t idx = h->op->hash(item) % h->bucket_cnt;
idx 279 uspace/lib/c/common/adt/hash_table.c if (cur == &h->bucket[idx].head)
idx 311 uspace/lib/c/common/adt/hash_table.c size_t idx = h->op->key_hash(key) % h->bucket_cnt;
idx 315 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
idx 367 uspace/lib/c/common/adt/hash_table.c for (size_t idx = 0; idx < h->bucket_cnt; ++idx) {
idx 368 uspace/lib/c/common/adt/hash_table.c list_foreach_safe(h->bucket[idx], cur, next) {
idx 1016 uspace/lib/c/common/str.c size_t idx = 0, dest_off = 0;
idx 1023 uspace/lib/c/common/str.c while (src[idx]) {
idx 1024 uspace/lib/c/common/str.c if ((src[idx] & 0xfc00) == 0xd800) {
idx 1025 uspace/lib/c/common/str.c if (src[idx + 1] && (src[idx + 1] & 0xfc00) == 0xdc00) {
idx 1027 uspace/lib/c/common/str.c ch += (src[idx] & 0x03FF) << 10;
idx 1028 uspace/lib/c/common/str.c ch += (src[idx + 1] & 0x03FF);
idx 1029 uspace/lib/c/common/str.c idx += 2;
idx 1033 uspace/lib/c/common/str.c ch = src[idx];
idx 1034 uspace/lib/c/common/str.c idx++;
idx 1060 uspace/lib/c/common/str.c size_t idx = 0;
idx 1067 uspace/lib/c/common/str.c if (idx + 2 >= dlen - 1) {
idx 1072 uspace/lib/c/common/str.c dest[idx] = 0xD800 | (c >> 10);
idx 1073 uspace/lib/c/common/str.c dest[idx + 1] = 0xDC00 | (c & 0x3FF);
idx 1074 uspace/lib/c/common/str.c idx++;
idx 1076 uspace/lib/c/common/str.c dest[idx] = c;
idx 1079 uspace/lib/c/common/str.c idx++;
idx 1080 uspace/lib/c/common/str.c if (idx >= dlen - 1) {
idx 1086 uspace/lib/c/common/str.c dest[idx] = '\0';
idx 322 uspace/lib/c/generic/getopt.c const struct option *long_options, int *idx)
idx 455 uspace/lib/c/generic/getopt.c if (idx)
idx 456 uspace/lib/c/generic/getopt.c *idx = match;
idx 831 uspace/lib/c/generic/io/io.c int idx;
idx 833 uspace/lib/c/generic/io/io.c idx = 0;
idx 834 uspace/lib/c/generic/io/io.c while (idx < size - 1) {
idx 839 uspace/lib/c/generic/io/io.c str[idx++] = c;
idx 848 uspace/lib/c/generic/io/io.c if (idx == 0)
idx 851 uspace/lib/c/generic/io/io.c str[idx] = '\0';
idx 397 uspace/lib/c/generic/stdio/scanf.c static errno_t strbuf_write(strbuf_t *strbuf, size_t idx, char c)
idx 399 uspace/lib/c/generic/stdio/scanf.c if (strbuf->memalloc && idx >= strbuf->size) {
idx 409 uspace/lib/c/generic/stdio/scanf.c strbuf->buf[idx] = c;
idx 101 uspace/lib/c/generic/ubsan.c void __ubsan_handle_out_of_bounds(struct out_of_bounds_data *data, unsigned long idx);
idx 196 uspace/lib/c/generic/ubsan.c unsigned long idx)
idx 80 uspace/lib/c/include/ipc/dev_iface.h #define DEV_IFACE_ID(idx) ((idx) + IPC_FIRST_USER_METHOD)
idx 409 uspace/lib/c/test/getopt.c int idx;
idx 413 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 416 uspace/lib/c/test/getopt.c PCUT_ASSERT_INT_EQUALS(0, idx);
idx 418 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 421 uspace/lib/c/test/getopt.c PCUT_ASSERT_INT_EQUALS(1, idx);
idx 424 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 446 uspace/lib/c/test/getopt.c int idx;
idx 450 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 453 uspace/lib/c/test/getopt.c PCUT_ASSERT_INT_EQUALS(0, idx);
idx 456 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 459 uspace/lib/c/test/getopt.c PCUT_ASSERT_INT_EQUALS(1, idx);
idx 462 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 484 uspace/lib/c/test/getopt.c int idx;
idx 488 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 491 uspace/lib/c/test/getopt.c PCUT_ASSERT_INT_EQUALS(0, idx);
idx 494 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 497 uspace/lib/c/test/getopt.c PCUT_ASSERT_INT_EQUALS(1, idx);
idx 500 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 522 uspace/lib/c/test/getopt.c int idx;
idx 526 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 529 uspace/lib/c/test/getopt.c PCUT_ASSERT_INT_EQUALS(0, idx);
idx 532 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 554 uspace/lib/c/test/getopt.c int idx;
idx 558 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 561 uspace/lib/c/test/getopt.c PCUT_ASSERT_INT_EQUALS(0, idx);
idx 564 uspace/lib/c/test/getopt.c ret = getopt_long(argc, (char *const *)argv, options, long_options, &idx);
idx 116 uspace/lib/cpp/include/__bits/adt/array.hpp reference operator[](size_type idx)
idx 118 uspace/lib/cpp/include/__bits/adt/array.hpp return elems[idx];
idx 121 uspace/lib/cpp/include/__bits/adt/array.hpp constexpr const_reference operator[](size_type idx) const
idx 123 uspace/lib/cpp/include/__bits/adt/array.hpp return elems[idx];
idx 126 uspace/lib/cpp/include/__bits/adt/array.hpp reference at(size_type idx)
idx 129 uspace/lib/cpp/include/__bits/adt/array.hpp return elems[idx];
idx 132 uspace/lib/cpp/include/__bits/adt/array.hpp constexpr const_reference at(size_type idx) const
idx 135 uspace/lib/cpp/include/__bits/adt/array.hpp return elems[idx];
idx 93 uspace/lib/cpp/include/__bits/adt/bitset.hpp reference(data_type& data, size_t idx)
idx 94 uspace/lib/cpp/include/__bits/adt/bitset.hpp : data_{data}, mask_{bitset::one_ << idx}
idx 68 uspace/lib/cpp/include/__bits/adt/deque.hpp deque_const_iterator(const deque<T, Allocator>& deq, size_type idx)
idx 69 uspace/lib/cpp/include/__bits/adt/deque.hpp : deq_{deq}, idx_{idx}
idx 173 uspace/lib/cpp/include/__bits/adt/deque.hpp return lhs.idx() == rhs.idx();
idx 194 uspace/lib/cpp/include/__bits/adt/deque.hpp deque_iterator(deque<T, Allocator>& deq, size_type idx)
idx 195 uspace/lib/cpp/include/__bits/adt/deque.hpp : deq_{deq}, idx_{idx}
idx 309 uspace/lib/cpp/include/__bits/adt/deque.hpp return lhs.idx() == rhs.idx();
idx 625 uspace/lib/cpp/include/__bits/adt/deque.hpp reference operator[](size_type idx)
idx 627 uspace/lib/cpp/include/__bits/adt/deque.hpp return data_[get_bucket_index_(idx)][get_element_index_(idx)];
idx 630 uspace/lib/cpp/include/__bits/adt/deque.hpp const_reference operator[](size_type idx) const
idx 632 uspace/lib/cpp/include/__bits/adt/deque.hpp return data_[get_bucket_index_(idx)][get_element_index_(idx)];
idx 635 uspace/lib/cpp/include/__bits/adt/deque.hpp reference at(size_type idx)
idx 638 uspace/lib/cpp/include/__bits/adt/deque.hpp return operator[](idx);
idx 641 uspace/lib/cpp/include/__bits/adt/deque.hpp const_reference at(size_type idx) const
idx 644 uspace/lib/cpp/include/__bits/adt/deque.hpp return operator[](idx);
idx 708 uspace/lib/cpp/include/__bits/adt/deque.hpp auto idx = position.idx();
idx 709 uspace/lib/cpp/include/__bits/adt/deque.hpp shift_right_(idx, 1);
idx 713 uspace/lib/cpp/include/__bits/adt/deque.hpp &data_[get_bucket_index_(idx)][get_element_index_(idx)],
idx 718 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
idx 759 uspace/lib/cpp/include/__bits/adt/deque.hpp auto idx = position.idx();
idx 760 uspace/lib/cpp/include/__bits/adt/deque.hpp shift_right_(idx, 1);
idx 769 uspace/lib/cpp/include/__bits/adt/deque.hpp data_[get_bucket_index_(idx)][get_element_index_(idx)] = value;
idx 772 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
idx 777 uspace/lib/cpp/include/__bits/adt/deque.hpp auto idx = position.idx();
idx 778 uspace/lib/cpp/include/__bits/adt/deque.hpp shift_right_(idx, 1);
idx 780 uspace/lib/cpp/include/__bits/adt/deque.hpp data_[get_bucket_index_(idx)][get_element_index_(idx)] = forward<value_type>(value);
idx 783 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
idx 798 uspace/lib/cpp/include/__bits/adt/deque.hpp auto idx = position.idx();
idx 801 uspace/lib/cpp/include/__bits/adt/deque.hpp if (idx < size_ / 2)
idx 803 uspace/lib/cpp/include/__bits/adt/deque.hpp shift_left_(idx, count);
idx 805 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator it{*this, idx - 1};
idx 811 uspace/lib/cpp/include/__bits/adt/deque.hpp shift_right_(idx, count);
idx 813 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator it{*this, idx};
idx 820 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
idx 875 uspace/lib/cpp/include/__bits/adt/deque.hpp auto idx = position.idx();
idx 877 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, idx + 1},
idx 879 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, idx}
idx 890 uspace/lib/cpp/include/__bits/adt/deque.hpp return iterator{*this, idx};
idx 898 uspace/lib/cpp/include/__bits/adt/deque.hpp auto first_idx = first.idx();
idx 899 uspace/lib/cpp/include/__bits/adt/deque.hpp auto last_idx = last.idx();
idx 1003 uspace/lib/cpp/include/__bits/adt/deque.hpp void ensure_space_front_(size_type idx, size_type count)
idx 1027 uspace/lib/cpp/include/__bits/adt/deque.hpp void ensure_space_back_(size_type idx, size_type count)
idx 1044 uspace/lib/cpp/include/__bits/adt/deque.hpp void shift_right_(size_type idx, size_type count)
idx 1046 uspace/lib/cpp/include/__bits/adt/deque.hpp ensure_space_back_(idx, count);
idx 1048 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator it{*this, idx};
idx 1053 uspace/lib/cpp/include/__bits/adt/deque.hpp void shift_left_(size_type idx, size_type count)
idx 1055 uspace/lib/cpp/include/__bits/adt/deque.hpp ensure_space_front_(idx, count);
idx 1059 uspace/lib/cpp/include/__bits/adt/deque.hpp iterator{*this, idx + count - 1},
idx 1127 uspace/lib/cpp/include/__bits/adt/deque.hpp size_type get_bucket_index_(size_type idx) const
idx 1129 uspace/lib/cpp/include/__bits/adt/deque.hpp if (idx < elements_in_front_bucket_())
idx 1132 uspace/lib/cpp/include/__bits/adt/deque.hpp idx -= elements_in_front_bucket_();
idx 1133 uspace/lib/cpp/include/__bits/adt/deque.hpp return idx / bucket_size_ + front_bucket_ + 1;
idx 1136 uspace/lib/cpp/include/__bits/adt/deque.hpp size_type get_element_index_(size_type idx) const
idx 1138 uspace/lib/cpp/include/__bits/adt/deque.hpp if (idx < elements_in_front_bucket_())
idx 1139 uspace/lib/cpp/include/__bits/adt/deque.hpp return bucket_size_ - elements_in_front_bucket_() + idx;
idx 1141 uspace/lib/cpp/include/__bits/adt/deque.hpp idx -= elements_in_front_bucket_();
idx 1142 uspace/lib/cpp/include/__bits/adt/deque.hpp return idx % bucket_size_;
idx 155 uspace/lib/cpp/include/__bits/adt/hash_table.hpp auto idx = first_filled_bucket_();
idx 157 uspace/lib/cpp/include/__bits/adt/hash_table.hpp table_, idx, bucket_count_,
idx 158 uspace/lib/cpp/include/__bits/adt/hash_table.hpp table_[idx].head
idx 179 uspace/lib/cpp/include/__bits/adt/hash_table.hpp auto idx = first_filled_bucket_();
idx 181 uspace/lib/cpp/include/__bits/adt/hash_table.hpp table_, idx, bucket_count_,
idx 182 uspace/lib/cpp/include/__bits/adt/hash_table.hpp table_[idx].head
idx 218 uspace/lib/cpp/include/__bits/adt/hash_table.hpp auto idx = it.idx();
idx 224 uspace/lib/cpp/include/__bits/adt/hash_table.hpp iterator res{table_, idx, size_, node};
idx 227 uspace/lib/cpp/include/__bits/adt/hash_table.hpp if (table_[idx].head == node)
idx 230 uspace/lib/cpp/include/__bits/adt/hash_table.hpp table_[idx].head = node->next;
idx 232 uspace/lib/cpp/include/__bits/adt/hash_table.hpp table_[idx].head = nullptr;
idx 277 uspace/lib/cpp/include/__bits/adt/hash_table.hpp auto idx = get_bucket_idx_(key);
idx 278 uspace/lib/cpp/include/__bits/adt/hash_table.hpp auto head = table_[idx].head;
idx 287 uspace/lib/cpp/include/__bits/adt/hash_table.hpp return iterator{table_, idx, size_, current};
idx 297 uspace/lib/cpp/include/__bits/adt/hash_table.hpp auto idx = get_bucket_idx_(key);
idx 298 uspace/lib/cpp/include/__bits/adt/hash_table.hpp auto head = table_[idx].head;
idx 307 uspace/lib/cpp/include/__bits/adt/hash_table.hpp return iterator{table_, idx, size_, current};
idx 534 uspace/lib/cpp/include/__bits/adt/hash_table.hpp hash_table_bucket<value_type, size_type>* head(size_type idx)
idx 536 uspace/lib/cpp/include/__bits/adt/hash_table.hpp if (idx < bucket_count_)
idx 537 uspace/lib/cpp/include/__bits/adt/hash_table.hpp return table_[idx]->head;
idx 52 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp size_type idx = size_type{}, size_type max_idx = size_type{},
idx 54 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp : table_{table}, idx_{idx}, max_idx_{max_idx}, current_{current}
idx 157 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp size_type idx = size_type{}, size_type max_idx = size_type{},
idx 159 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp : table_{table}, idx_{idx}, max_idx_{max_idx}, current_{current}
idx 48 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto idx = table.get_bucket_idx_(key);
idx 49 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto head = table.table_[idx].head;
idx 59 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp &table.table_[idx],
idx 61 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp idx
idx 70 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp &table.table_[idx],
idx 71 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head,
idx 72 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp idx
idx 79 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto idx = table.get_bucket_idx_(key);
idx 80 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto head = table.table_[idx].head;
idx 95 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head = current->next;
idx 97 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head = nullptr;
idx 153 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
idx 164 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx, table.bucket_count(),
idx 176 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx,
idx 194 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
idx 205 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx, table.bucket_count(),
idx 217 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx,
idx 236 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
idx 247 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx, table.bucket_count(),
idx 259 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx,
idx 293 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto idx = table.get_bucket_idx_(key);
idx 294 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto head = table.table_[idx].head;
idx 304 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp &table.table_[idx],
idx 306 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp idx
idx 315 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp &table.table_[idx],
idx 316 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head,
idx 317 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp idx
idx 324 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto idx = table.get_bucket_idx_(key);
idx 325 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto head = table.table_[idx].head;
idx 327 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head = nullptr;
idx 350 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table_[idx].head = tmp;
idx 445 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp auto [bucket, target, idx] = table.find_insertion_spot(key);
idx 456 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp table.table(), idx,
idx 319 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto [bucket, target, idx] = table_.find_insertion_spot(key);
idx 330 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx, table_.bucket_count(),
idx 342 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx,
idx 354 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto [bucket, target, idx] = table_.find_insertion_spot(key);
idx 365 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx, table_.bucket_count(),
idx 377 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx,
idx 401 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto [bucket, target, idx] = table_.find_insertion_spot(key);
idx 413 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx, table_.bucket_count(),
idx 425 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx,
idx 437 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp auto [bucket, target, idx] = table_.find_insertion_spot(key);
idx 449 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx, table_.bucket_count(),
idx 461 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), idx,
idx 496 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), first.idx(),
idx 497 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.bucket_count(), table_.head(first.idx())
idx 632 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp size_type bucket_size(size_type idx) const
idx 634 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.bucket_size(idx);
idx 642 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp local_iterator begin(size_type idx)
idx 644 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.begin(idx);
idx 647 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp const_local_iterator begin(size_type idx) const
idx 649 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.begin(idx);
idx 652 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp local_iterator end(size_type idx)
idx 654 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.end(idx);
idx 657 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp const_local_iterator end(size_type idx) const
idx 659 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.end(idx);
idx 662 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp const_local_iterator cbegin(size_type idx) const
idx 664 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.cbegin(idx);
idx 667 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp const_local_iterator cend(size_type idx) const
idx 669 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.cend(idx);
idx 1000 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.table(), first.idx(),
idx 1001 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp table_.bucket_count(), table_.head(first.idx())
idx 1064 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp size_type bucket_size(size_type idx) const
idx 1066 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.bucket_size(idx);
idx 1074 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp local_iterator begin(size_type idx)
idx 1076 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.begin(idx);
idx 1079 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp const_local_iterator begin(size_type idx) const
idx 1081 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.begin(idx);
idx 1084 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp local_iterator end(size_type idx)
idx 1086 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.end(idx);
idx 1089 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp const_local_iterator end(size_type idx) const
idx 1091 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.end(idx);
idx 1094 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp const_local_iterator cbegin(size_type idx) const
idx 1096 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.cbegin(idx);
idx 1099 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp const_local_iterator cend(size_type idx) const
idx 1101 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.cend(idx);
idx 309 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp table_.table(), first.idx(),
idx 373 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp size_type bucket_size(size_type idx) const
idx 375 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.bucket_size(idx);
idx 383 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp local_iterator begin(size_type idx)
idx 385 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.begin(idx);
idx 388 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp const_local_iterator begin(size_type idx) const
idx 390 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.begin(idx);
idx 393 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp local_iterator end(size_type idx)
idx 395 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.end(idx);
idx 398 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp const_local_iterator end(size_type idx) const
idx 400 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.end(idx);
idx 403 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp const_local_iterator cbegin(size_type idx) const
idx 405 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.cbegin(idx);
idx 408 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp const_local_iterator cend(size_type idx) const
idx 410 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.cend(idx);
idx 725 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp table_.table(), first.idx(),
idx 726 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp table_.bucket_count(), table_.head(first.idx())
idx 789 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp size_type bucket_size(size_type idx) const
idx 791 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.bucket_size(idx);
idx 799 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp local_iterator begin(size_type idx)
idx 801 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.begin(idx);
idx 804 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp const_local_iterator begin(size_type idx) const
idx 806 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.begin(idx);
idx 809 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp local_iterator end(size_type idx)
idx 811 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.end(idx);
idx 814 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp const_local_iterator end(size_type idx) const
idx 816 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.end(idx);
idx 819 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp const_local_iterator cbegin(size_type idx) const
idx 821 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.cbegin(idx);
idx 824 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp const_local_iterator cend(size_type idx) const
idx 826 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.cend(idx);
idx 313 uspace/lib/cpp/include/__bits/adt/vector.hpp reference operator[](size_type idx)
idx 315 uspace/lib/cpp/include/__bits/adt/vector.hpp return data_[idx];
idx 318 uspace/lib/cpp/include/__bits/adt/vector.hpp const_reference operator[](size_type idx) const
idx 320 uspace/lib/cpp/include/__bits/adt/vector.hpp return data_[idx];
idx 323 uspace/lib/cpp/include/__bits/adt/vector.hpp reference at(size_type idx)
idx 326 uspace/lib/cpp/include/__bits/adt/vector.hpp return data_[idx];
idx 329 uspace/lib/cpp/include/__bits/adt/vector.hpp const_reference at(size_type idx) const
idx 332 uspace/lib/cpp/include/__bits/adt/vector.hpp return data_[idx];
idx 862 uspace/lib/cpp/include/__bits/algorithm.hpp T heap_parent(T idx)
idx 864 uspace/lib/cpp/include/__bits/algorithm.hpp return (idx - 1) / 2;
idx 868 uspace/lib/cpp/include/__bits/algorithm.hpp T heap_left_child(T idx)
idx 870 uspace/lib/cpp/include/__bits/algorithm.hpp return 2 * idx + 1;
idx 874 uspace/lib/cpp/include/__bits/algorithm.hpp T heap_right_child(T idx)
idx 876 uspace/lib/cpp/include/__bits/algorithm.hpp return 2 * idx + 2;
idx 881 uspace/lib/cpp/include/__bits/algorithm.hpp Size idx, Size count, Compare comp)
idx 886 uspace/lib/cpp/include/__bits/algorithm.hpp auto left = heap_left_child(idx);
idx 887 uspace/lib/cpp/include/__bits/algorithm.hpp auto right = heap_right_child(idx);
idx 889 uspace/lib/cpp/include/__bits/algorithm.hpp bool left_incorrect{comp(first[idx], first[left])};
idx 890 uspace/lib/cpp/include/__bits/algorithm.hpp bool right_incorrect{comp(first[idx], first[right])};
idx 896 uspace/lib/cpp/include/__bits/algorithm.hpp swap(first[idx], first[left]);
idx 898 uspace/lib/cpp/include/__bits/algorithm.hpp idx = left;
idx 902 uspace/lib/cpp/include/__bits/algorithm.hpp swap(first[idx], first[right]);
idx 904 uspace/lib/cpp/include/__bits/algorithm.hpp idx = right;
idx 907 uspace/lib/cpp/include/__bits/algorithm.hpp left = heap_left_child(idx);
idx 908 uspace/lib/cpp/include/__bits/algorithm.hpp right = heap_right_child(idx);
idx 910 uspace/lib/cpp/include/__bits/algorithm.hpp left_incorrect = comp(first[idx], first[left]);
idx 911 uspace/lib/cpp/include/__bits/algorithm.hpp right_incorrect = comp(first[idx], first[right]);
idx 940 uspace/lib/cpp/include/__bits/algorithm.hpp auto idx = count - 1;
idx 941 uspace/lib/cpp/include/__bits/algorithm.hpp auto parent = heap_parent(idx);
idx 942 uspace/lib/cpp/include/__bits/algorithm.hpp while (idx > 0 && comp(first[parent], first[idx]))
idx 944 uspace/lib/cpp/include/__bits/algorithm.hpp swap(first[idx], first[parent]);
idx 946 uspace/lib/cpp/include/__bits/algorithm.hpp idx = parent;
idx 947 uspace/lib/cpp/include/__bits/algorithm.hpp parent = heap_parent(idx);
idx 1001 uspace/lib/cpp/include/__bits/algorithm.hpp auto idx = i - 1;
idx 1003 uspace/lib/cpp/include/__bits/algorithm.hpp aux::correct_children(first, idx, count, comp);
idx 1053 uspace/lib/cpp/include/__bits/algorithm.hpp for (decltype(count) idx = 0; idx < count; ++idx)
idx 1055 uspace/lib/cpp/include/__bits/algorithm.hpp auto left = heap_left_child(idx);
idx 1056 uspace/lib/cpp/include/__bits/algorithm.hpp auto right = heap_right_child(idx);
idx 1058 uspace/lib/cpp/include/__bits/algorithm.hpp if (left < count && comp(first[idx], first[left]))
idx 1060 uspace/lib/cpp/include/__bits/algorithm.hpp if (right < count && comp(first[idx], first[right]))
idx 191 uspace/lib/cpp/include/__bits/io/fstream.hpp auto idx = static_cast<off_type>(this->input_next_ - this->input_begin_);
idx 192 uspace/lib/cpp/include/__bits/io/fstream.hpp auto count = static_cast<off_type>(buf_size_) - idx;
idx 194 uspace/lib/cpp/include/__bits/io/fstream.hpp for (; i < count; ++i, ++idx)
idx 195 uspace/lib/cpp/include/__bits/io/fstream.hpp ibuf_[i] = ibuf_[idx];
idx 73 uspace/lib/cpp/include/__bits/io/streambufs.hpp auto idx = static_cast<off_type>(input_next_ - input_begin_);
idx 74 uspace/lib/cpp/include/__bits/io/streambufs.hpp auto count = buf_size_ - idx;
idx 76 uspace/lib/cpp/include/__bits/io/streambufs.hpp for (; i < count; ++i, ++idx)
idx 77 uspace/lib/cpp/include/__bits/io/streambufs.hpp buffer_[i] = buffer_[idx];
idx 641 uspace/lib/cpp/include/__bits/iterator.hpp auto operator[](difference_type idx) const
idx 643 uspace/lib/cpp/include/__bits/iterator.hpp return move(current_[idx]);
idx 392 uspace/lib/cpp/include/__bits/memory/unique_ptr.hpp element_type& operator[](size_t idx) const
idx 394 uspace/lib/cpp/include/__bits/memory/unique_ptr.hpp return ptr_[idx];
idx 413 uspace/lib/cpp/include/__bits/random.hpp size_t idx_(size_t idx) const
idx 415 uspace/lib/cpp/include/__bits/random.hpp return idx % n;
idx 617 uspace/lib/cpp/include/__bits/random.hpp size_t idx_(size_t idx) const
idx 619 uspace/lib/cpp/include/__bits/random.hpp return idx % r;
idx 757 uspace/lib/cpp/include/__bits/string/string.hpp const_reference operator[](size_type idx) const
idx 759 uspace/lib/cpp/include/__bits/string/string.hpp return data_[idx];
idx 762 uspace/lib/cpp/include/__bits/string/string.hpp reference operator[](size_type idx)
idx 764 uspace/lib/cpp/include/__bits/string/string.hpp return data_[idx];
idx 767 uspace/lib/cpp/include/__bits/string/string.hpp const_reference at(size_type idx) const
idx 770 uspace/lib/cpp/include/__bits/string/string.hpp return data_[idx];
idx 773 uspace/lib/cpp/include/__bits/string/string.hpp reference at(size_type idx)
idx 776 uspace/lib/cpp/include/__bits/string/string.hpp return data_[idx];
idx 981 uspace/lib/cpp/include/__bits/string/string.hpp auto idx = static_cast<size_type>(pos - begin());
idx 984 uspace/lib/cpp/include/__bits/string/string.hpp copy_backward_(begin() + idx, end(), end() + 1);
idx 985 uspace/lib/cpp/include/__bits/string/string.hpp traits_type::assign(data_[idx], c);
idx 990 uspace/lib/cpp/include/__bits/string/string.hpp return begin() + idx;
idx 998 uspace/lib/cpp/include/__bits/string/string.hpp auto idx = static_cast<size_type>(pos - begin());
idx 1001 uspace/lib/cpp/include/__bits/string/string.hpp copy_backward_(begin() + idx, end(), end() + n);
idx 1003 uspace/lib/cpp/include/__bits/string/string.hpp auto it = begin() + idx;
idx 1009 uspace/lib/cpp/include/__bits/string/string.hpp return begin() + idx;
idx 1019 uspace/lib/cpp/include/__bits/string/string.hpp auto idx = static_cast<size_type>(pos - begin());
idx 1021 uspace/lib/cpp/include/__bits/string/string.hpp insert(idx, str);
idx 1023 uspace/lib/cpp/include/__bits/string/string.hpp return begin() + idx;
idx 1043 uspace/lib/cpp/include/__bits/string/string.hpp auto idx = static_cast<size_type>(pos - cbegin());
idx 1044 uspace/lib/cpp/include/__bits/string/string.hpp erase(idx, 1);
idx 1046 uspace/lib/cpp/include/__bits/string/string.hpp return begin() + idx;
idx 1051 uspace/lib/cpp/include/__bits/string/string.hpp auto idx = static_cast<size_type>(first - cbegin());
idx 1053 uspace/lib/cpp/include/__bits/string/string.hpp erase(idx, count);
idx 1055 uspace/lib/cpp/include/__bits/string/string.hpp return begin() + idx;
idx 1215 uspace/lib/cpp/include/__bits/string/string.hpp size_type idx{pos};
idx 1217 uspace/lib/cpp/include/__bits/string/string.hpp while (idx + len < size_)
idx 1219 uspace/lib/cpp/include/__bits/string/string.hpp if (substr_starts_at_(idx, str, len))
idx 1220 uspace/lib/cpp/include/__bits/string/string.hpp return idx;
idx 1221 uspace/lib/cpp/include/__bits/string/string.hpp ++idx;
idx 1256 uspace/lib/cpp/include/__bits/string/string.hpp size_type idx{min(pos, size_ - 1) + 1};
idx 1258 uspace/lib/cpp/include/__bits/string/string.hpp while (idx > 0)
idx 1260 uspace/lib/cpp/include/__bits/string/string.hpp if (substr_starts_at_(idx - 1, str, len))
idx 1261 uspace/lib/cpp/include/__bits/string/string.hpp return idx - 1;
idx 1262 uspace/lib/cpp/include/__bits/string/string.hpp --idx;
idx 1297 uspace/lib/cpp/include/__bits/string/string.hpp size_type idx{pos};
idx 1299 uspace/lib/cpp/include/__bits/string/string.hpp while (idx < size_)
idx 1301 uspace/lib/cpp/include/__bits/string/string.hpp if (is_any_of_(idx, str, len))
idx 1302 uspace/lib/cpp/include/__bits/string/string.hpp return idx;
idx 1303 uspace/lib/cpp/include/__bits/string/string.hpp ++idx;
idx 1358 uspace/lib/cpp/include/__bits/string/string.hpp size_type idx{pos};
idx 1360 uspace/lib/cpp/include/__bits/string/string.hpp while (idx < size_)
idx 1362 uspace/lib/cpp/include/__bits/string/string.hpp if (!is_any_of_(idx, str, len))
idx 1363 uspace/lib/cpp/include/__bits/string/string.hpp return idx;
idx 1364 uspace/lib/cpp/include/__bits/string/string.hpp ++idx;
idx 1583 uspace/lib/cpp/include/__bits/string/string.hpp bool is_any_of_(size_type idx, const value_type* str, size_type len) const
idx 1587 uspace/lib/cpp/include/__bits/string/string.hpp if (traits_type::eq(data_[idx], str[i]))
idx 1594 uspace/lib/cpp/include/__bits/string/string.hpp bool substr_starts_at_(size_type idx, const value_type* str, size_type len) const
idx 1599 uspace/lib/cpp/include/__bits/string/string.hpp if (!traits_type::eq(data_[idx + i], str[i]))
idx 1882 uspace/lib/cpp/include/__bits/string/string.hpp int stoi(const string& str, size_t* idx = nullptr, int base = 10);
idx 1883 uspace/lib/cpp/include/__bits/string/string.hpp long stol(const string& str, size_t* idx = nullptr, int base = 10);
idx 1884 uspace/lib/cpp/include/__bits/string/string.hpp unsigned long stoul(const string& str, size_t* idx = nullptr, int base = 10);
idx 1885 uspace/lib/cpp/include/__bits/string/string.hpp long long stoll(const string& str, size_t* idx = nullptr, int base = 10);
idx 1886 uspace/lib/cpp/include/__bits/string/string.hpp unsigned long long stoull(const string& str, size_t* idx = nullptr, int base = 10);
idx 1888 uspace/lib/cpp/include/__bits/string/string.hpp float stof(const string& str, size_t* idx = nullptr);
idx 1889 uspace/lib/cpp/include/__bits/string/string.hpp double stod(const string& str, size_t* idx = nullptr);
idx 1890 uspace/lib/cpp/include/__bits/string/string.hpp long double stold(const string& str, size_t* idx = nullptr);
idx 1902 uspace/lib/cpp/include/__bits/string/string.hpp int stoi(const wstring& str, size_t* idx = nullptr, int base = 10);
idx 1903 uspace/lib/cpp/include/__bits/string/string.hpp long stol(const wstring& str, size_t* idx = nullptr, int base = 10);
idx 1904 uspace/lib/cpp/include/__bits/string/string.hpp unsigned long stoul(const wstring& str, size_t* idx = nullptr, int base = 10);
idx 1905 uspace/lib/cpp/include/__bits/string/string.hpp long long stoll(const wstring& str, size_t* idx = nullptr, int base = 10);
idx 1906 uspace/lib/cpp/include/__bits/string/string.hpp unsigned long long stoull(const wstring& str, size_t* idx = nullptr, int base = 10);
idx 1908 uspace/lib/cpp/include/__bits/string/string.hpp float stof(const wstring& str, size_t* idx = nullptr);
idx 1909 uspace/lib/cpp/include/__bits/string/string.hpp double stod(const wstring& str, size_t* idx = nullptr);
idx 1910 uspace/lib/cpp/include/__bits/string/string.hpp long double stold(const wstring& str, size_t* idx = nullptr);
idx 444 uspace/lib/cpp/include/__bits/thread/mutex.hpp int try_lock_tail(int idx, L& l)
idx 447 uspace/lib/cpp/include/__bits/thread/mutex.hpp return idx;
idx 453 uspace/lib/cpp/include/__bits/thread/mutex.hpp int try_lock_tail(int idx, L1& l1, L2&... ls)
idx 456 uspace/lib/cpp/include/__bits/thread/mutex.hpp return idx;
idx 458 uspace/lib/cpp/include/__bits/thread/mutex.hpp auto ret = try_lock_tail(idx + 1, ls...);
idx 403 uspace/lib/cpp/src/__bits/test/string.cpp auto idx = str1.find(target, 0);
idx 406 uspace/lib/cpp/src/__bits/test/string.cpp idx, 2ul
idx 409 uspace/lib/cpp/src/__bits/test/string.cpp idx = str1.find(target, 3);
idx 412 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 415 uspace/lib/cpp/src/__bits/test/string.cpp idx = str1.rfind(target, miss);
idx 418 uspace/lib/cpp/src/__bits/test/string.cpp idx, 2ul
idx 421 uspace/lib/cpp/src/__bits/test/string.cpp idx = str1.rfind(target, 1);
idx 424 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 427 uspace/lib/cpp/src/__bits/test/string.cpp idx = str1.find('B', 2);
idx 430 uspace/lib/cpp/src/__bits/test/string.cpp idx, 3ul
idx 433 uspace/lib/cpp/src/__bits/test/string.cpp idx = str1.rfind('B', 2);
idx 436 uspace/lib/cpp/src/__bits/test/string.cpp idx, 3ul
idx 441 uspace/lib/cpp/src/__bits/test/string.cpp idx = str2.find(target, 0);
idx 444 uspace/lib/cpp/src/__bits/test/string.cpp idx, 2ul
idx 447 uspace/lib/cpp/src/__bits/test/string.cpp idx = str2.find(target, 5);
idx 450 uspace/lib/cpp/src/__bits/test/string.cpp idx, 7ul
idx 453 uspace/lib/cpp/src/__bits/test/string.cpp idx = str2.rfind(target, miss);
idx 456 uspace/lib/cpp/src/__bits/test/string.cpp idx, 7ul
idx 459 uspace/lib/cpp/src/__bits/test/string.cpp idx = str2.rfind(target, 6);
idx 462 uspace/lib/cpp/src/__bits/test/string.cpp idx, 2ul
idx 467 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_of(target);
idx 470 uspace/lib/cpp/src/__bits/test/string.cpp idx, 2ul
idx 473 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_of(target, 6);
idx 476 uspace/lib/cpp/src/__bits/test/string.cpp idx, 8ul
idx 479 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_of("DEF", 3);
idx 482 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 485 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_of(target, 9);
idx 488 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 491 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_of("");
idx 494 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 497 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_of('A', 1);
idx 500 uspace/lib/cpp/src/__bits/test/string.cpp idx, 5ul
idx 503 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_of('A', 6);
idx 506 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 509 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_of(target);
idx 512 uspace/lib/cpp/src/__bits/test/string.cpp idx, 8ul
idx 515 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_of(target, 6);
idx 518 uspace/lib/cpp/src/__bits/test/string.cpp idx, 5ul
idx 521 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_of("DEF", 3);
idx 524 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 527 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_of(target, 1);
idx 530 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 533 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_of("");
idx 536 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 539 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_of('A', str3.size() - 1);
idx 542 uspace/lib/cpp/src/__bits/test/string.cpp idx, 5ul
idx 545 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_of('A', 3);
idx 548 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 553 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_not_of(not_target);
idx 556 uspace/lib/cpp/src/__bits/test/string.cpp idx, 5ul
idx 559 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_not_of(not_target, 6);
idx 562 uspace/lib/cpp/src/__bits/test/string.cpp idx, 8ul
idx 565 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_not_of("xABC", 3);
idx 568 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 571 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_not_of(not_target, 9);
idx 574 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 577 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_not_of("");
idx 580 uspace/lib/cpp/src/__bits/test/string.cpp idx, 0ul
idx 583 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_not_of('x', 3);
idx 586 uspace/lib/cpp/src/__bits/test/string.cpp idx, 5ul
idx 589 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_first_of('a', 9);
idx 592 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 597 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_not_of(not_last_target);
idx 600 uspace/lib/cpp/src/__bits/test/string.cpp idx, 5ul
idx 603 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_not_of(not_last_target, 4);
idx 606 uspace/lib/cpp/src/__bits/test/string.cpp idx, 2ul
idx 609 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_not_of("xABC");
idx 612 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 615 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_not_of(not_last_target, 1);
idx 618 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 621 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_not_of("");
idx 624 uspace/lib/cpp/src/__bits/test/string.cpp idx, str3.size() - 1
idx 627 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_not_of('x', str3.size() - 1);
idx 630 uspace/lib/cpp/src/__bits/test/string.cpp idx, 8ul
idx 633 uspace/lib/cpp/src/__bits/test/string.cpp idx = str3.find_last_not_of('x', 1);
idx 636 uspace/lib/cpp/src/__bits/test/string.cpp idx, miss
idx 135 uspace/lib/cpp/src/ios.cpp auto idx = static_cast<size_t>(index);
idx 136 uspace/lib/cpp/src/ios.cpp if (idx > iarray_size_)
idx 139 uspace/lib/cpp/src/ios.cpp size_t new_size = max(iarray_size_ * 2, idx + 1);
idx 151 uspace/lib/cpp/src/ios.cpp return iarray_[idx];
idx 154 uspace/lib/cpp/src/ios.cpp return iarray_[idx];
idx 167 uspace/lib/cpp/src/ios.cpp auto idx = static_cast<size_t>(index);
idx 168 uspace/lib/cpp/src/ios.cpp if (idx > parray_size_)
idx 171 uspace/lib/cpp/src/ios.cpp size_t new_size = max(parray_size_ * 2, idx + 1);
idx 183 uspace/lib/cpp/src/ios.cpp return parray_[idx];
idx 186 uspace/lib/cpp/src/ios.cpp return parray_[idx];
idx 34 uspace/lib/cpp/src/string.cpp int stoi(const string& str, size_t* idx, int base)
idx 41 uspace/lib/cpp/src/string.cpp long stol(const string& str, size_t* idx, int base)
idx 48 uspace/lib/cpp/src/string.cpp if (idx)
idx 49 uspace/lib/cpp/src/string.cpp *idx = static_cast<size_t>(end - str.c_str());
idx 57 uspace/lib/cpp/src/string.cpp unsigned long stoul(const string& str, size_t* idx, int base)
idx 64 uspace/lib/cpp/src/string.cpp if (idx)
idx 65 uspace/lib/cpp/src/string.cpp *idx = static_cast<size_t>(end - str.c_str());
idx 73 uspace/lib/cpp/src/string.cpp long long stoll(const string& str, size_t* idx, int base)
idx 80 uspace/lib/cpp/src/string.cpp unsigned long long stoull(const string& str, size_t* idx, int base)
idx 87 uspace/lib/cpp/src/string.cpp float stof(const string& str, size_t* idx)
idx 94 uspace/lib/cpp/src/string.cpp double stod(const string& str, size_t* idx)
idx 101 uspace/lib/cpp/src/string.cpp long double stold(const string& str, size_t* idx)
idx 207 uspace/lib/cpp/src/string.cpp int stoi(const wstring& str, size_t* idx, int base)
idx 214 uspace/lib/cpp/src/string.cpp long stol(const wstring& str, size_t* idx, int base)
idx 221 uspace/lib/cpp/src/string.cpp unsigned long stoul(const wstring& str, size_t* idx, int base)
idx 228 uspace/lib/cpp/src/string.cpp long long stoll(const wstring& str, size_t* idx, int base)
idx 235 uspace/lib/cpp/src/string.cpp unsigned long long stoull(const wstring& str, size_t* idx, int base)
idx 242 uspace/lib/cpp/src/string.cpp float stof(const wstring& str, size_t* idx)
idx 249 uspace/lib/cpp/src/string.cpp double stod(const wstring& str, size_t* idx)
idx 256 uspace/lib/cpp/src/string.cpp long double stold(const wstring& str, size_t* idx)
idx 77 uspace/lib/drv/generic/dev_iface.c const remote_iface_t *get_remote_iface(int idx)
idx 79 uspace/lib/drv/generic/dev_iface.c assert(is_valid_iface_idx(idx));
idx 80 uspace/lib/drv/generic/dev_iface.c return remote_ifaces.ifaces[idx];
idx 92 uspace/lib/drv/generic/dev_iface.c bool is_valid_iface_idx(int idx)
idx 94 uspace/lib/drv/generic/dev_iface.c return (0 <= idx) && (idx < DEV_IFACE_MAX);
idx 804 uspace/lib/drv/generic/driver.c static void *function_get_ops(ddf_fun_t *fun, dev_inferface_idx_t idx)
idx 806 uspace/lib/drv/generic/driver.c assert(is_valid_iface_idx(idx));
idx 810 uspace/lib/drv/generic/driver.c return fun->ops->interfaces[idx];
idx 72 uspace/lib/ext4/src/bitmap.c uint32_t idx = index;
idx 77 uspace/lib/ext4/src/bitmap.c while (((idx % 8) != 0) && (remaining > 0)) {
idx 78 uspace/lib/ext4/src/bitmap.c byte_index = idx / 8;
idx 79 uspace/lib/ext4/src/bitmap.c uint32_t bit_index = idx % 8;
idx 84 uspace/lib/ext4/src/bitmap.c idx++;
idx 92 uspace/lib/ext4/src/bitmap.c assert((idx % 8) == 0);
idx 94 uspace/lib/ext4/src/bitmap.c byte_index = idx / 8;
idx 101 uspace/lib/ext4/src/bitmap.c idx += 8;
idx 110 uspace/lib/ext4/src/bitmap.c byte_index = idx / 8;
idx 111 uspace/lib/ext4/src/bitmap.c uint32_t bit_index = idx % 8;
idx 116 uspace/lib/ext4/src/bitmap.c idx++;
idx 174 uspace/lib/ext4/src/bitmap.c uint32_t idx;
idx 178 uspace/lib/ext4/src/bitmap.c idx = start + (8 - (start % 8));
idx 180 uspace/lib/ext4/src/bitmap.c idx = start;
idx 182 uspace/lib/ext4/src/bitmap.c uint8_t *pos = bitmap + (idx / 8);
idx 185 uspace/lib/ext4/src/bitmap.c while (idx < max) {
idx 189 uspace/lib/ext4/src/bitmap.c *index = idx;
idx 193 uspace/lib/ext4/src/bitmap.c idx += 8;
idx 217 uspace/lib/ext4/src/bitmap.c uint32_t idx = start_idx;
idx 221 uspace/lib/ext4/src/bitmap.c while ((idx % 8) != 0) {
idx 224 uspace/lib/ext4/src/bitmap.c if ((*pos & (1 << (idx % 8))) == 0) {
idx 225 uspace/lib/ext4/src/bitmap.c *pos |= (1 << (idx % 8));
idx 226 uspace/lib/ext4/src/bitmap.c *index = idx;
idx 230 uspace/lib/ext4/src/bitmap.c ++idx;
idx 237 uspace/lib/ext4/src/bitmap.c while (idx < max) {
idx 243 uspace/lib/ext4/src/bitmap.c idx += 8;
idx 248 uspace/lib/ext4/src/bitmap.c if (idx < max) {
idx 255 uspace/lib/ext4/src/bitmap.c *index = idx;
idx 259 uspace/lib/ext4/src/bitmap.c idx++;
idx 755 uspace/lib/ext4/src/directory_index.c uint32_t idx = 0;
idx 779 uspace/lib/ext4/src/directory_index.c sort_array[idx].dentry = entry_buffer_ptr;
idx 780 uspace/lib/ext4/src/directory_index.c sort_array[idx].rec_len = rec_len;
idx 781 uspace/lib/ext4/src/directory_index.c sort_array[idx].hash = tmp_hinfo.hash;
idx 785 uspace/lib/ext4/src/directory_index.c idx++;
idx 793 uspace/lib/ext4/src/directory_index.c qsort(sort_array, idx, sizeof(ext4_dx_sort_entry_t),
idx 824 uspace/lib/ext4/src/directory_index.c for (uint32_t i = 0; i < idx; ++i) {
idx 860 uspace/lib/ext4/src/directory_index.c for (uint32_t i = mid; i < idx; ++i) {
idx 865 uspace/lib/ext4/src/directory_index.c if (i < (idx - 1))
idx 580 uspace/lib/ext4/src/extent.c ext4_extent_index_t *idx = EXT4_EXTENT_FIRST_INDEX(header);
idx 585 uspace/lib/ext4/src/extent.c ++i, ++idx) {
idx 586 uspace/lib/ext4/src/extent.c rc = ext4_extent_release_branch(inode_ref, idx);
idx 264 uspace/lib/ext4/src/filesystem.c uint32_t idx;
idx 315 uspace/lib/ext4/src/filesystem.c for (idx = 1; idx < EXT4_REV0_FIRST_INO; idx++) {
idx 316 uspace/lib/ext4/src/filesystem.c if (idx == EXT4_INODE_ROOT_INDEX) {
idx 317 uspace/lib/ext4/src/filesystem.c rc = ext4_filesystem_alloc_this_inode(fs, idx,
idx 327 uspace/lib/ext4/src/filesystem.c errno_t rc = ext4_ialloc_alloc_this_inode(fs, idx,
idx 332 uspace/lib/ext4/src/filesystem.c rc = ext4_filesystem_get_inode_ref(fs, idx,
idx 454 uspace/lib/ext4/src/inode.c uint32_t ext4_inode_get_direct_block(ext4_inode_t *inode, uint32_t idx)
idx 456 uspace/lib/ext4/src/inode.c assert(idx < EXT4_INODE_DIRECT_BLOCK_COUNT);
idx 458 uspace/lib/ext4/src/inode.c return uint32_t_le2host(inode->blocks[idx]);
idx 468 uspace/lib/ext4/src/inode.c void ext4_inode_set_direct_block(ext4_inode_t *inode, uint32_t idx, uint32_t fblock)
idx 470 uspace/lib/ext4/src/inode.c assert(idx < EXT4_INODE_DIRECT_BLOCK_COUNT);
idx 472 uspace/lib/ext4/src/inode.c inode->blocks[idx] = host2uint32_t_le(fblock);
idx 483 uspace/lib/ext4/src/inode.c uint32_t ext4_inode_get_indirect_block(ext4_inode_t *inode, uint32_t idx)
idx 485 uspace/lib/ext4/src/inode.c return uint32_t_le2host(inode->blocks[idx + EXT4_INODE_INDIRECT_BLOCK]);
idx 495 uspace/lib/ext4/src/inode.c void ext4_inode_set_indirect_block(ext4_inode_t *inode, uint32_t idx,
idx 498 uspace/lib/ext4/src/inode.c inode->blocks[idx + EXT4_INODE_INDIRECT_BLOCK] =
idx 1435 uspace/lib/ext4/src/superblock.c uint32_t idx)
idx 1442 uspace/lib/ext4/src/superblock.c if (idx <= 1)
idx 1452 uspace/lib/ext4/src/superblock.c if (idx == g1 || idx == g2)
idx 1462 uspace/lib/ext4/src/superblock.c if ((idx & 1) && (is_power_of(idx, 3) ||
idx 1463 uspace/lib/ext4/src/superblock.c is_power_of(idx, 5) || is_power_of(idx, 7)))
idx 1523 uspace/lib/ext4/src/superblock.c uint32_t idx;
idx 1654 uspace/lib/ext4/src/superblock.c for (idx = 0; idx < ngroups; idx++) {
idx 1655 uspace/lib/ext4/src/superblock.c free_blocks -= ext4_superblock_get_group_backup_blocks(sb, idx);
idx 1188 uspace/lib/label/src/mbr.c int idx;
idx 1190 uspace/lib/label/src/mbr.c idx = mbr_nprimary + 1;
idx 1194 uspace/lib/label/src/mbr.c part->index = idx++;
idx 80 uspace/lib/posix/include/libc/ipc/dev_iface.h #define DEV_IFACE_ID(idx) ((idx) + IPC_FIRST_USER_METHOD)
idx 1003 uspace/lib/ui/src/list.c size_t idx;
idx 1011 uspace/lib/ui/src/list.c idx = list->page_idx;
idx 1017 uspace/lib/ui/src/list.c ++idx;
idx 1020 uspace/lib/ui/src/list.c *ridx = idx;
idx 1043 uspace/lib/ui/src/list.c size_t idx;
idx 1045 uspace/lib/ui/src/list.c idx = ui_list_entry_get_idx(entry);
idx 1046 uspace/lib/ui/src/list.c ui_list_cursor_move(list, entry, idx);
idx 1498 uspace/lib/ui/src/list.c size_t idx;
idx 1500 uspace/lib/ui/src/list.c idx = 0;
idx 1503 uspace/lib/ui/src/list.c ++idx;
idx 1507 uspace/lib/ui/src/list.c return idx;
idx 1518 uspace/lib/ui/src/list.c size_t idx;
idx 1523 uspace/lib/ui/src/list.c idx = ui_list_entry_get_idx(entry);
idx 1525 uspace/lib/ui/src/list.c list->cursor_idx = idx;
idx 1727 uspace/lib/ui/test/list.c size_t idx;
idx 1769 uspace/lib/ui/test/list.c entry = ui_list_page_nth_entry(list, 0, &idx);
idx 1772 uspace/lib/ui/test/list.c PCUT_ASSERT_INT_EQUALS(1, idx);
idx 1774 uspace/lib/ui/test/list.c entry = ui_list_page_nth_entry(list, 1, &idx);
idx 1777 uspace/lib/ui/test/list.c PCUT_ASSERT_INT_EQUALS(2, idx);
idx 1779 uspace/lib/ui/test/list.c entry = ui_list_page_nth_entry(list, 2, &idx);
idx 394 uspace/lib/usbhost/src/bus.c const size_t idx = bus_endpoint_index(ep->endpoint, ep->direction);
idx 395 uspace/lib/usbhost/src/bus.c if (idx >= ARRAY_SIZE(device->endpoints)) {
idx 416 uspace/lib/usbhost/src/bus.c } else if (device->endpoints[idx] != NULL) {
idx 421 uspace/lib/usbhost/src/bus.c device->endpoints[idx] = ep;
idx 447 uspace/lib/usbhost/src/bus.c const size_t idx = bus_endpoint_index(endpoint, dir);
idx 453 uspace/lib/usbhost/src/bus.c if (idx < ARRAY_SIZE(device->endpoints))
idx 454 uspace/lib/usbhost/src/bus.c ep = device->endpoints[idx];
idx 495 uspace/lib/usbhost/src/bus.c const size_t idx = bus_endpoint_index(ep->endpoint, ep->direction);
idx 497 uspace/lib/usbhost/src/bus.c if (idx >= ARRAY_SIZE(device->endpoints))
idx 503 uspace/lib/usbhost/src/bus.c if (device->endpoints[idx] != ep) {
idx 509 uspace/lib/usbhost/src/bus.c device->endpoints[idx] = NULL;
idx 106 uspace/lib/virtio/virtio-pci.h ioport16_t idx;
idx 124 uspace/lib/virtio/virtio-pci.h ioport16_t idx;
idx 179 uspace/lib/virtio/virtio.c uint16_t idx = pio_read_le16(&q->avail->idx);
idx 180 uspace/lib/virtio/virtio.c pio_write_le16(&q->avail->ring[idx % q->queue_size], descno);
idx 182 uspace/lib/virtio/virtio.c pio_write_le16(&q->avail->idx, idx + 1);
idx 195 uspace/lib/virtio/virtio.c if (last_idx == (pio_read_le16(&q->used->idx) % q->queue_size)) {
idx 1114 uspace/srv/bd/vbd/disk.c int idx;
idx 1117 uspace/srv/bd/vbd/disk.c idx = part->lpart->index;
idx 1119 uspace/srv/bd/vbd/disk.c if (asprintf(&name, "%sp%u", part->disk->svc_name, idx) < 0) {
idx 1152 uspace/srv/bd/vbd/disk.c part->reg_idx = idx;
idx 137 uspace/srv/fs/exfat/exfat.h exfat_idx_t *idx;
idx 221 uspace/srv/fs/exfat/exfat_bitmap.c return exfat_bitmap_alloc_clusters(bs, nodep->idx->service_id,
idx 228 uspace/srv/fs/exfat/exfat_bitmap.c while (exfat_bitmap_is_free(bs, nodep->idx->service_id, clst) == EOK) {
idx 230 uspace/srv/fs/exfat/exfat_bitmap.c return exfat_bitmap_set_clusters(bs, nodep->idx->service_id,
idx 246 uspace/srv/fs/exfat/exfat_bitmap.c return exfat_bitmap_clear_clusters(bs, nodep->idx->service_id, lastc + 1, count);
idx 253 uspace/srv/fs/exfat/exfat_bitmap.c service_id_t service_id = nodep->idx->service_id;
idx 68 uspace/srv/fs/exfat/exfat_directory.c di->service_id = nodep->idx->service_id;
idx 292 uspace/srv/fs/exfat/exfat_directory.c size_t idx;
idx 294 uspace/srv/fs/exfat/exfat_directory.c for (idx = 0; idx < count; idx++) {
idx 295 uspace/srv/fs/exfat/exfat_directory.c if (idx == 2 || idx == 3)
idx 298 uspace/srv/fs/exfat/exfat_directory.c (uint16_t)bytes[idx];
idx 509 uspace/srv/fs/exfat/exfat_directory.c rc = exfat_node_expand(di->nodep->idx->service_id, di->nodep, 1);
idx 142 uspace/srv/fs/exfat/exfat_fat.c return block_get(block, nodep->idx->service_id, DATA_FS(bs) +
idx 157 uspace/srv/fs/exfat/exfat_fat.c rc = exfat_block_get_by_clst(block, bs, nodep->idx->service_id,
idx 400 uspace/srv/fs/exfat/exfat_fat.c service_id_t service_id = nodep->idx->service_id;
idx 419 uspace/srv/fs/exfat/exfat_fat.c rc = exfat_set_cluster(bs, nodep->idx->service_id, lastc, mcl);
idx 443 uspace/srv/fs/exfat/exfat_fat.c service_id_t service_id = nodep->idx->service_id;
idx 408 uspace/srv/fs/exfat/exfat_idx.c void exfat_idx_hashin(exfat_idx_t *idx)
idx 411 uspace/srv/fs/exfat/exfat_idx.c hash_table_insert(&up_hash, &idx->uph_link);
idx 415 uspace/srv/fs/exfat/exfat_idx.c void exfat_idx_hashout(exfat_idx_t *idx)
idx 418 uspace/srv/fs/exfat/exfat_idx.c hash_table_remove_item(&up_hash, &idx->uph_link);
idx 447 uspace/srv/fs/exfat/exfat_idx.c void exfat_idx_destroy(exfat_idx_t *idx)
idx 450 uspace/srv/fs/exfat/exfat_idx.c .service_id = idx->service_id,
idx 451 uspace/srv/fs/exfat/exfat_idx.c .index = idx->index,
idx 455 uspace/srv/fs/exfat/exfat_idx.c assert(idx->pfc == 0);
idx 103 uspace/srv/fs/exfat/exfat_ops.c node->idx = NULL;
idx 143 uspace/srv/fs/exfat/exfat_ops.c exfat_directory_open_parent(&di, node->idx->service_id, node->idx->pfc,
idx 144 uspace/srv/fs/exfat/exfat_ops.c node->idx->parent_fragmented);
idx 145 uspace/srv/fs/exfat/exfat_ops.c rc = exfat_directory_seek(&di, node->idx->pdi);
idx 176 uspace/srv/fs/exfat/exfat_ops.c if (!fibril_mutex_trylock(&nodep->idx->lock)) {
idx 181 uspace/srv/fs/exfat/exfat_ops.c if (nodep->idx->service_id != service_id) {
idx 182 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 195 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 203 uspace/srv/fs/exfat/exfat_ops.c nodep->idx->nodep = NULL;
idx 229 uspace/srv/fs/exfat/exfat_ops.c idxp_tmp = nodep->idx;
idx 281 uspace/srv/fs/exfat/exfat_ops.c (*nodepp)->idx = idxp;
idx 394 uspace/srv/fs/exfat/exfat_ops.c nodep->idx = idxp;
idx 517 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_lock(&parentp->idx->lock);
idx 518 uspace/srv/fs/exfat/exfat_ops.c service_id = parentp->idx->service_id;
idx 519 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&parentp->idx->lock);
idx 533 uspace/srv/fs/exfat/exfat_ops.c exfat_idx_t *idx = exfat_idx_get_by_pos(service_id,
idx 535 uspace/srv/fs/exfat/exfat_ops.c if (!idx) {
idx 543 uspace/srv/fs/exfat/exfat_ops.c rc = exfat_node_get_core(&nodep, idx);
idx 544 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&idx->lock);
idx 604 uspace/srv/fs/exfat/exfat_ops.c if (nodep->idx) {
idx 651 uspace/srv/fs/exfat/exfat_ops.c nodep->idx = idxp;
idx 701 uspace/srv/fs/exfat/exfat_ops.c bs = block_bb_get(nodep->idx->service_id);
idx 706 uspace/srv/fs/exfat/exfat_ops.c rc = exfat_free_clusters(bs, nodep->idx->service_id,
idx 713 uspace/srv/fs/exfat/exfat_ops.c exfat_idx_destroy(nodep->idx);
idx 740 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_lock(&parentp->idx->lock);
idx 753 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&parentp->idx->lock);
idx 758 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&parentp->idx->lock);
idx 762 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&parentp->idx->lock);
idx 763 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_lock(&childp->idx->lock);
idx 765 uspace/srv/fs/exfat/exfat_ops.c childp->idx->pfc = parentp->firstc;
idx 766 uspace/srv/fs/exfat/exfat_ops.c childp->idx->parent_fragmented = parentp->fragmented;
idx 767 uspace/srv/fs/exfat/exfat_ops.c childp->idx->pdi = di.pos;
idx 768 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&childp->idx->lock);
idx 778 uspace/srv/fs/exfat/exfat_ops.c exfat_idx_hashin(childp->idx);
idx 803 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_lock(&childp->idx->lock);
idx 809 uspace/srv/fs/exfat/exfat_ops.c rc = exfat_directory_erase_file(&di, childp->idx->pdi);
idx 817 uspace/srv/fs/exfat/exfat_ops.c exfat_idx_hashout(childp->idx);
idx 819 uspace/srv/fs/exfat/exfat_ops.c childp->idx->pfc = 0;
idx 820 uspace/srv/fs/exfat/exfat_ops.c childp->idx->pdi = 0;
idx 821 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&childp->idx->lock);
idx 832 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&childp->idx->lock);
idx 851 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_lock(&nodep->idx->lock);
idx 855 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 863 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 881 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 887 uspace/srv/fs/exfat/exfat_ops.c return EXFAT_NODE(fn)->idx->index;
idx 1068 uspace/srv/fs/exfat/exfat_ops.c assert(rootp->idx->index == EXFAT_ROOT_IDX);
idx 1086 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&rootp->idx->lock);
idx 1119 uspace/srv/fs/exfat/exfat_ops.c assert(bitmapp->idx->index == EXFAT_BITMAP_IDX);
idx 1120 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&bitmapp->idx->lock);
idx 1125 uspace/srv/fs/exfat/exfat_ops.c bitmapp->idx->parent_fragmented = true;
idx 1161 uspace/srv/fs/exfat/exfat_ops.c assert(uctablep->idx->index == EXFAT_UCTABLE_IDX);
idx 1162 uspace/srv/fs/exfat/exfat_ops.c fibril_mutex_unlock(&uctablep->idx->lock);
idx 1167 uspace/srv/fs/exfat/exfat_ops.c uctablep->idx->parent_fragmented = true;
idx 1202 uspace/srv/fs/exfat/exfat_ops.c *rridxp = rootp->idx;
idx 231 uspace/srv/fs/fat/fat.h fat_idx_t *idx;
idx 328 uspace/srv/fs/fat/fat_dentry.c size_t idx;
idx 329 uspace/srv/fs/fat/fat_dentry.c for (idx = 0; idx < FAT_LFN_PART1_SIZE; idx++) {
idx 331 uspace/srv/fs/fat/fat_dentry.c d->lfn.part1[idx] = host2uint16_t_le(src[*offset]);
idx 334 uspace/srv/fs/fat/fat_dentry.c d->lfn.part1[idx] = FAT_LFN_PAD;
idx 336 uspace/srv/fs/fat/fat_dentry.c for (idx = 0; idx < FAT_LFN_PART2_SIZE; idx++) {
idx 338 uspace/srv/fs/fat/fat_dentry.c d->lfn.part2[idx] = host2uint16_t_le(src[*offset]);
idx 341 uspace/srv/fs/fat/fat_dentry.c d->lfn.part2[idx] = FAT_LFN_PAD;
idx 343 uspace/srv/fs/fat/fat_dentry.c for (idx = 0; idx < FAT_LFN_PART3_SIZE; idx++) {
idx 345 uspace/srv/fs/fat/fat_dentry.c d->lfn.part3[idx] = host2uint16_t_le(src[*offset]);
idx 348 uspace/srv/fs/fat/fat_dentry.c d->lfn.part3[idx] = FAT_LFN_PAD;
idx 55 uspace/srv/fs/fat/fat_directory.c di->bs = block_bb_get(di->nodep->idx->service_id);
idx 167 uspace/srv/fs/fat/fat_directory.c rc = fs_instance_get(di->nodep->idx->service_id, &data);
idx 275 uspace/srv/fs/fat/fat_directory.c rc = fs_instance_get(di->nodep->idx->service_id, &data);
idx 328 uspace/srv/fs/fat/fat_directory.c size_t idx = 0;
idx 338 uspace/srv/fs/fat/fat_directory.c FAT_LFN_ORDER(d) = ++idx;
idx 372 uspace/srv/fs/fat/fat_directory.c unsigned idx;
idx 373 uspace/srv/fs/fat/fat_directory.c for (idx = 1; idx <= FAT_MAX_SFN; idx++) {
idx 374 uspace/srv/fs/fat/fat_directory.c snprintf(number, sizeof(number), "%u", idx);
idx 423 uspace/srv/fs/fat/fat_directory.c rc = fat_alloc_clusters(di->bs, di->nodep->idx->service_id, 1, &mcl,
idx 427 uspace/srv/fs/fat/fat_directory.c rc = fat_zero_cluster(di->bs, di->nodep->idx->service_id, mcl);
idx 429 uspace/srv/fs/fat/fat_directory.c (void) fat_free_clusters(di->bs, di->nodep->idx->service_id,
idx 435 uspace/srv/fs/fat/fat_directory.c (void) fat_free_clusters(di->bs, di->nodep->idx->service_id,
idx 146 uspace/srv/fs/fat/fat_fat.c return block_get(block, nodep->idx->service_id,
idx 160 uspace/srv/fs/fat/fat_fat.c rc = _fat_block_get(block, bs, nodep->idx->service_id, firstc,
idx 268 uspace/srv/fs/fat/fat_fat.c rc = _fat_block_get(&b, bs, nodep->idx->service_id, mcl,
idx 786 uspace/srv/fs/fat/fat_fat.c service_id_t service_id = nodep->idx->service_id;
idx 807 uspace/srv/fs/fat/fat_fat.c rc = fat_set_cluster(bs, nodep->idx->service_id,
idx 834 uspace/srv/fs/fat/fat_fat.c service_id_t service_id = nodep->idx->service_id;
idx 408 uspace/srv/fs/fat/fat_idx.c void fat_idx_hashin(fat_idx_t *idx)
idx 411 uspace/srv/fs/fat/fat_idx.c hash_table_insert(&up_hash, &idx->uph_link);
idx 415 uspace/srv/fs/fat/fat_idx.c void fat_idx_hashout(fat_idx_t *idx)
idx 418 uspace/srv/fs/fat/fat_idx.c hash_table_remove_item(&up_hash, &idx->uph_link);
idx 447 uspace/srv/fs/fat/fat_idx.c void fat_idx_destroy(fat_idx_t *idx)
idx 450 uspace/srv/fs/fat/fat_idx.c .service_id = idx->service_id,
idx 451 uspace/srv/fs/fat/fat_idx.c .index = idx->index,
idx 454 uspace/srv/fs/fat/fat_idx.c assert(idx->pfc == FAT_CLST_RES0);
idx 103 uspace/srv/fs/fat/fat_ops.c node->idx = NULL;
idx 126 uspace/srv/fs/fat/fat_ops.c bs = block_bb_get(node->idx->service_id);
idx 129 uspace/srv/fs/fat/fat_ops.c rc = _fat_block_get(&b, bs, node->idx->service_id, node->idx->pfc,
idx 130 uspace/srv/fs/fat/fat_ops.c NULL, (node->idx->pdi * sizeof(fat_dentry_t)) / BPS(bs),
idx 135 uspace/srv/fs/fat/fat_ops.c d = ((fat_dentry_t *)b->data) + (node->idx->pdi % DPS(bs));
idx 168 uspace/srv/fs/fat/fat_ops.c if (!fibril_mutex_trylock(&nodep->idx->lock)) {
idx 173 uspace/srv/fs/fat/fat_ops.c if (nodep->idx->service_id != service_id) {
idx 174 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 187 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 195 uspace/srv/fs/fat/fat_ops.c nodep->idx->nodep = NULL;
idx 221 uspace/srv/fs/fat/fat_ops.c idxp_tmp = nodep->idx;
idx 357 uspace/srv/fs/fat/fat_ops.c nodep->idx = idxp;
idx 381 uspace/srv/fs/fat/fat_ops.c fibril_mutex_lock(&parentp->idx->lock);
idx 382 uspace/srv/fs/fat/fat_ops.c service_id = parentp->idx->service_id;
idx 383 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&parentp->idx->lock);
idx 396 uspace/srv/fs/fat/fat_ops.c fat_idx_t *idx = fat_idx_get_by_pos(service_id,
idx 398 uspace/srv/fs/fat/fat_ops.c if (!idx) {
idx 406 uspace/srv/fs/fat/fat_ops.c rc = fat_node_get_core(&nodep, idx);
idx 407 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&idx->lock);
idx 464 uspace/srv/fs/fat/fat_ops.c if (nodep->idx) {
idx 528 uspace/srv/fs/fat/fat_ops.c nodep->idx = idxp;
idx 564 uspace/srv/fs/fat/fat_ops.c bs = block_bb_get(nodep->idx->service_id);
idx 568 uspace/srv/fs/fat/fat_ops.c rc = fat_free_clusters(bs, nodep->idx->service_id,
idx 572 uspace/srv/fs/fat/fat_ops.c fat_idx_destroy(nodep->idx);
idx 603 uspace/srv/fs/fat/fat_ops.c fibril_mutex_lock(&parentp->idx->lock);
idx 604 uspace/srv/fs/fat/fat_ops.c bs = block_bb_get(parentp->idx->service_id);
idx 607 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&parentp->idx->lock);
idx 622 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&parentp->idx->lock);
idx 627 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&parentp->idx->lock);
idx 631 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&parentp->idx->lock);
idx 633 uspace/srv/fs/fat/fat_ops.c fibril_mutex_lock(&childp->idx->lock);
idx 682 uspace/srv/fs/fat/fat_ops.c childp->idx->pfc = parentp->firstc;
idx 683 uspace/srv/fs/fat/fat_ops.c childp->idx->pdi = di.pos; /* di.pos holds absolute position of SFN entry */
idx 684 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&childp->idx->lock);
idx 694 uspace/srv/fs/fat/fat_ops.c fat_idx_hashin(childp->idx);
idx 718 uspace/srv/fs/fat/fat_ops.c fibril_mutex_lock(&childp->idx->lock);
idx 724 uspace/srv/fs/fat/fat_ops.c rc = fat_directory_seek(&di, childp->idx->pdi);
idx 735 uspace/srv/fs/fat/fat_ops.c fat_idx_hashout(childp->idx);
idx 737 uspace/srv/fs/fat/fat_ops.c childp->idx->pfc = FAT_CLST_RES0;
idx 738 uspace/srv/fs/fat/fat_ops.c childp->idx->pdi = 0;
idx 739 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&childp->idx->lock);
idx 750 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&childp->idx->lock);
idx 770 uspace/srv/fs/fat/fat_ops.c fibril_mutex_lock(&nodep->idx->lock);
idx 771 uspace/srv/fs/fat/fat_ops.c bs = block_bb_get(nodep->idx->service_id);
idx 780 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 792 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 798 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 805 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 810 uspace/srv/fs/fat/fat_ops.c fibril_mutex_unlock(&nodep->idx->lock);
idx 817 uspace/srv/fs/fat/fat_ops.c return FAT_NODE(fn)->idx->index;
idx 1013 uspace/srv/fs/fat/fat_ops.c rootp->idx = ridxp;
idx 41 uspace/srv/fs/mfs/mfs_balloc.c mfs_free_bit(struct mfs_instance *inst, uint32_t idx, bmap_id_t bid);
idx 44 uspace/srv/fs/mfs/mfs_balloc.c mfs_alloc_bit(struct mfs_instance *inst, uint32_t *idx, bmap_id_t bid);
idx 231 uspace/srv/fs/mfs/mfs_balloc.c mfs_free_bit(struct mfs_instance *inst, uint32_t idx, bmap_id_t bid)
idx 245 uspace/srv/fs/mfs/mfs_balloc.c if (idx > sbi->nzones) {
idx 253 uspace/srv/fs/mfs/mfs_balloc.c if (idx > sbi->ninodes) {
idx 261 uspace/srv/fs/mfs/mfs_balloc.c uint32_t block = idx / (sbi->block_size * 8) + start_block;
idx 268 uspace/srv/fs/mfs/mfs_balloc.c idx %= (sbi->block_size * 8);
idx 273 uspace/srv/fs/mfs/mfs_balloc.c chunk = conv32(sbi->native, ptr[idx / chunk_bits]);
idx 274 uspace/srv/fs/mfs/mfs_balloc.c chunk &= ~(1 << (idx % chunk_bits));
idx 275 uspace/srv/fs/mfs/mfs_balloc.c ptr[idx / chunk_bits] = conv32(sbi->native, chunk);
idx 280 uspace/srv/fs/mfs/mfs_balloc.c if (*search > idx)
idx 281 uspace/srv/fs/mfs/mfs_balloc.c *search = idx;
idx 298 uspace/srv/fs/mfs/mfs_balloc.c mfs_alloc_bit(struct mfs_instance *inst, uint32_t *idx, bmap_id_t bid)
idx 346 uspace/srv/fs/mfs/mfs_balloc.c *idx = freebit + bits_per_block * i;
idx 347 uspace/srv/fs/mfs/mfs_balloc.c if (*idx > limit) {
idx 355 uspace/srv/fs/mfs/mfs_balloc.c *search = *idx;
idx 139 uspace/srv/fs/udf/udf_osta.c for (size_t idx = 0; idx < udf_len; idx++) {
idx 140 uspace/srv/fs/udf/udf_osta.c uint16_t current = udf_name[idx];
idx 155 uspace/srv/fs/udf/udf_osta.c while ((idx + 1 < udf_len) &&
idx 156 uspace/srv/fs/udf/udf_osta.c (!legal_check(udf_name[idx + 1]) ||
idx 157 uspace/srv/fs/udf/udf_osta.c (!ascii_check(udf_name[idx + 1]))))
idx 158 uspace/srv/fs/udf/udf_osta.c idx++;
idx 162 uspace/srv/fs/udf/udf_osta.c if ((current == PERIOD) && ((udf_len - idx - 1) <= EXT_SIZE)) {
idx 163 uspace/srv/fs/udf/udf_osta.c if (udf_len == idx + 1) {
idx 168 uspace/srv/fs/udf/udf_osta.c ext_idx = idx;
idx 187 uspace/srv/fs/udf/udf_osta.c for (size_t idx = 0; (idx < EXT_SIZE) &&
idx 188 uspace/srv/fs/udf/udf_osta.c (ext_idx + idx + 1 < udf_len); idx++) {
idx 189 uspace/srv/fs/udf/udf_osta.c uint16_t current = udf_name[ext_idx + idx + 1];
idx 204 uspace/srv/fs/udf/udf_osta.c while ((idx + 1 < EXT_SIZE) &&
idx 205 uspace/srv/fs/udf/udf_osta.c ((!legal_check(udf_name[ext_idx + idx + 2])) ||
idx 206 uspace/srv/fs/udf/udf_osta.c (!ascii_check(udf_name[ext_idx + idx + 2]))))
idx 207 uspace/srv/fs/udf/udf_osta.c idx++;
idx 245 uspace/srv/fs/udf/udf_osta.c for (size_t idx = 0; idx < local_ext_idx; idx++)
idx 246 uspace/srv/fs/udf/udf_osta.c new_name[new_idx++] = ext[idx];
idx 484 uspace/srv/fs/udf/udf_volume.c uint8_t *idx = lvd[i].partition_map;
idx 488 uspace/srv/fs/udf/udf_volume.c (udf_type1_partition_map_t *) idx;
idx 520 uspace/srv/fs/udf/udf_volume.c idx += pm1->partition_map_length;
idx 525 uspace/srv/fs/udf/udf_volume.c (udf_type2_partition_map_t *) idx;
idx 531 uspace/srv/fs/udf/udf_volume.c (udf_metadata_partition_map_t *) idx;
idx 578 uspace/srv/fs/udf/udf_volume.c idx += metadata->partition_map_length;
idx 583 uspace/srv/fs/udf/udf_volume.c udf_general_type_t *pm = (udf_general_type_t *) idx;
idx 588 uspace/srv/fs/udf/udf_volume.c idx += pm->partition_map_length;
HelenOS homepage, sources at GitHub