Home
last modified time | relevance | path

Searched full:indexing (Results 1 – 25 of 228) sorted by relevance

12345678910

/openbmc/linux/drivers/accessibility/speakup/
H A Dsynth.c296 synth->indexing.currindex++; in synth_insert_next_index()
298 if (synth->indexing.currindex > in synth_insert_next_index()
299 synth->indexing.highindex) in synth_insert_next_index()
300 synth->indexing.currindex = in synth_insert_next_index()
301 synth->indexing.lowindex; in synth_insert_next_index()
304 out = synth->indexing.currindex * 10 + sent_num; in synth_insert_next_index()
305 synth_printf(synth->indexing.command, out, out); in synth_insert_next_index()
316 if ((ind / 10) <= synth->indexing.currindex) in spk_get_index_count()
317 index_count = synth->indexing.currindex - (ind / 10); in spk_get_index_count()
319 index_count = synth->indexing.currindex in spk_get_index_count()
[all …]
/openbmc/u-boot/fs/ubifs/
H A Dubifs-media.h18 * also 8-byte aligned (except for the indexing node and the padding node).
108 /* Maximum number of levels in UBIFS indexing B-tree */
601 * @fanout: tree fanout (max. number of links per indexing node)
650 * @root_lnum: LEB number of the root indexing node
652 * @root_len: root indexing node length
673 * @idx_lebs: number of indexing logical eraseblocks
745 * struct ubifs_idx_node - indexing node.
H A Dtnc_misc.c251 * read_znode - read an indexing node from flash and fill znode.
253 * @lnum: LEB of the indexing node to read
258 * This function reads an indexing node from the flash media and fills znode
260 * code in case of failure. The read indexing node is validated and if anything
380 ubifs_err(c, "bad indexing node at LEB %d:%d, error %d", lnum, offs, err); in read_znode()
H A Dgc.c516 dbg_gc("indexing LEB %d (free %d, dirty %d)", in ubifs_garbage_collect_leb()
614 * marking indexing nodes dirty when GC'ing indexing LEBs. Thus, at some point
624 * o GC moved indexing LEBs, but they can be used only after the commit;
673 * We've done enough iterations. Indexing LEBs were in ubifs_garbage_collect()
740 * This was an indexing LEB and it cannot be in ubifs_garbage_collect()
745 dbg_gc("indexing LEB %d freed, continue", lp.lnum); in ubifs_garbage_collect()
823 * it free. Note, we cannot do this with indexing LEBs because dirty space may
H A Dbudget.c340 dbg_budg("out of indexing space: min_idx_lebs %d (old %d), rsvd_idx_lebs %d", in do_budget_space()
587 /* And re-calculate the indexing space reservation */ in ubifs_convert_page_budget()
622 * node and it has to write indexing nodes as well. This introduces additional
640 * introduces. The overhead is the node header + indexing overhead. in ubifs_reported_space()
642 * Indexing overhead calculations are based on the following formula: in ubifs_reported_space()
643 * I = N/(f - 1) + 1, where I - number of indexing nodes, N - number in ubifs_reported_space()
H A Dubifs.h859 * @LEB_FREED_IDX: indexing LEB was freed and can be used only after the commit
925 * struct ubifs_gced_idx_leb - garbage-collected indexing LEB.
930 * This data structure is used to temporary store garbage-collected indexing
1048 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash)
1102 * @idx_lebs: number of indexing LEBs
1121 * @total_used, @total_dead and @total_dark fields do not account indexing
1336 * @lnum: LEB number of the target node (indexing node or data node)
1352 * struct ubifs_znode - in-memory representation of an indexing node.
1361 * @lnum: LEB number of the corresponding indexing node
1362 * @offs: offset of the corresponding indexing node
[all …]
/openbmc/qemu/linux-user/include/host/aarch64/
H A Dhost-signal.h80 /* Ignore bits 10, 11 & 21, controlling indexing. */ in host_signal_write()
83 /* Ignore bits 23 & 24, controlling indexing. */ in host_signal_write()
/openbmc/linux/fs/ubifs/
H A Dubifs-media.h18 * also 8-byte aligned (except for the indexing node and the padding node).
108 /* Maximum number of levels in UBIFS indexing B-tree */
633 * @fanout: tree fanout (max. number of links per indexing node)
692 * @root_lnum: LEB number of the root indexing node
694 * @root_len: root indexing node length
715 * @idx_lebs: number of indexing logical eraseblocks
820 * struct ubifs_idx_node - indexing node.
H A Dbudget.c329 dbg_budg("out of indexing space: min_idx_lebs %d (old %d), rsvd_idx_lebs %d", in do_budget_space()
576 /* And re-calculate the indexing space reservation */ in ubifs_convert_page_budget()
610 * node and it has to write indexing nodes as well. This introduces additional
628 * introduces. The overhead is the node header + indexing overhead. in ubifs_reported_space()
630 * Indexing overhead calculations are based on the following formula: in ubifs_reported_space()
631 * I = N/(f - 1) + 1, where I - number of indexing nodes, N - number in ubifs_reported_space()
H A Dgc.c548 dbg_gc("indexing LEB %d (free %d, dirty %d)", in ubifs_garbage_collect_leb()
646 * marking indexing nodes dirty when GC'ing indexing LEBs. Thus, at some point
656 * o GC moved indexing LEBs, but they can be used only after the commit;
708 * We've done enough iterations. Indexing LEBs were in ubifs_garbage_collect()
786 * This was an indexing LEB and it cannot be in ubifs_garbage_collect()
791 dbg_gc("indexing LEB %d freed, continue", lp.lnum); in ubifs_garbage_collect()
870 * it free. Note, we cannot do this with indexing LEBs because dirty space may
H A Dubifs.h259 * @LEB_FREED_IDX: indexing LEB was freed and can be used only after the commit
337 * struct ubifs_gced_idx_leb - garbage-collected indexing LEB.
342 * This data structure is used to temporary store garbage-collected indexing
462 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash)
516 * @idx_lebs: number of indexing LEBs
535 * @total_used, @total_dead and @total_dark fields do not account indexing
749 * @lnum: LEB number of the target node (indexing node or data node)
767 * struct ubifs_znode - in-memory representation of an indexing node.
778 * @lnum: LEB number of the corresponding indexing node
779 * @offs: offset of the corresponding indexing node
[all …]
H A Dtnc_misc.c254 * read_znode - read an indexing node from flash and fill znode.
259 * This function reads an indexing node from the flash media and fills znode
261 * code in case of failure. The read indexing node is validated and if anything
392 ubifs_err(c, "bad indexing node at LEB %d:%d, error %d", lnum, offs, err); in read_znode()
/openbmc/linux/include/linux/
H A Dnode.h52 * @indexing: The ways memory blocks may be placed in cache
59 enum cache_indexing indexing; member
/openbmc/linux/tools/testing/selftests/rseq/
H A Drseq-s390.h133 /* Per-cpu-id indexing. */
145 /* Per-mm-cid indexing. */
H A Drseq-mips.h151 /* Per-cpu-id indexing. */
163 /* Per-mm-cid indexing. */
H A Drseq-arm.h146 /* Per-cpu-id indexing. */
158 /* Per-mm-cid indexing. */
H A Drseq-riscv.h168 /* Per-cpu-id indexing. */
180 /* Per-mm-cid indexing. */
H A Drseq-arm64.h205 /* Per-cpu-id indexing. */
217 /* Per-mm-cid indexing. */
H A Drseq-x86.h204 /* Per-cpu-id indexing. */
216 /* Per-mm-cid indexing. */
/openbmc/linux/Documentation/devicetree/bindings/pinctrl/
H A Drenesas,rza1-ports.yaml133 * The GPIO controller base in the global pin indexing space is pin
135 * in the global pin indexing space.
/openbmc/linux/Documentation/networking/
H A Dfib_trie.rst21 The number of bits in the key segment used for indexing into the
25 The position (in the key) of the key segment used for indexing into
/openbmc/linux/drivers/md/bcache/
H A DKconfig9 a btree for indexing and the layout is optimized for SSDs.
/openbmc/linux/arch/sh/include/asm/
H A Dcache.h43 * 1. those used to select the cache set during indexing
/openbmc/linux/tools/testing/selftests/mm/
H A Dgup_test.c193 * Do the 1-based indexing here, so that the user can in main()
194 * use normal 0-based indexing on the command line. in main()
/openbmc/linux/Documentation/admin-guide/mm/
H A Dnumaperf.rst156 | |-- indexing
161 The "indexing" will be 0 if it is a direct-mapped cache, and non-zero

12345678910