| /kernel/linux/linux-5.10/drivers/accessibility/speakup/ |
| D | synth.c | 294 synth->indexing.currindex++; in synth_insert_next_index()
296 if (synth->indexing.currindex > in synth_insert_next_index()
297 synth->indexing.highindex) in synth_insert_next_index()
298 synth->indexing.currindex = in synth_insert_next_index()
299 synth->indexing.lowindex; in synth_insert_next_index()
302 out = synth->indexing.currindex * 10 + sent_num; in synth_insert_next_index()
303 synth_printf(synth->indexing.command, out, out); in synth_insert_next_index()
314 if ((ind / 10) <= synth->indexing.currindex) in spk_get_index_count()
315 index_count = synth->indexing.currindex - (ind / 10); in spk_get_index_count()
317 index_count = synth->indexing.currindex in spk_get_index_count()
[all …]
|
| /kernel/linux/linux-6.6/drivers/accessibility/speakup/ |
| D | synth.c | 296 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 …]
|
| /kernel/linux/linux-6.6/fs/ubifs/ |
| D | ubifs-media.h | 18 * 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.
|
| D | budget.c | 329 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()
|
| D | gc.c | 548 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
|
| D | ubifs.h | 259 * @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 …]
|
| D | tnc_misc.c | 254 * 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()
|
| /kernel/linux/linux-5.10/fs/ubifs/ |
| D | ubifs-media.h | 18 * 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.
|
| D | gc.c | 548 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()
783 * This was an indexing LEB and it cannot be in ubifs_garbage_collect()
788 dbg_gc("indexing LEB %d freed, continue", lp.lnum); in ubifs_garbage_collect()
867 * it free. Note, we cannot do this with indexing LEBs because dirty space may
|
| D | ubifs.h | 250 * @LEB_FREED_IDX: indexing LEB was freed and can be used only after the commit
328 * struct ubifs_gced_idx_leb - garbage-collected indexing LEB.
333 * This data structure is used to temporary store garbage-collected indexing
453 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash)
507 * @idx_lebs: number of indexing LEBs
526 * @total_used, @total_dead and @total_dark fields do not account indexing
740 * @lnum: LEB number of the target node (indexing node or data node)
758 * struct ubifs_znode - in-memory representation of an indexing node.
769 * @lnum: LEB number of the corresponding indexing node
770 * @offs: offset of the corresponding indexing node
[all …]
|
| D | tnc_misc.c | 254 * 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()
|
| D | budget.c | 332 dbg_budg("out of indexing space: min_idx_lebs %d (old %d), rsvd_idx_lebs %d", in do_budget_space()
579 /* And re-calculate the indexing space reservation */ in ubifs_convert_page_budget()
613 * node and it has to write indexing nodes as well. This introduces additional
631 * introduces. The overhead is the node header + indexing overhead. in ubifs_reported_space()
633 * Indexing overhead calculations are based on the following formula: in ubifs_reported_space()
634 * I = N/(f - 1) + 1, where I - number of indexing nodes, N - number in ubifs_reported_space()
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/iommu/ |
| D | arm,smmu.yaml | 96 interrupts, specified in order of their indexing by the SMMU.
125 input IDs). This property is not valid for SMMUs using stream indexing, or
172 /* SMMU with stream matching or stream indexing */
|
| /kernel/linux/linux-6.6/include/linux/ |
| D | node.h | 52 * @indexing: The ways memory blocks may be placed in cache
59 enum cache_indexing indexing; member
|
| /kernel/linux/linux-5.10/include/linux/ |
| D | node.h | 53 * @indexing: The ways memory blocks may be placed in cache
60 enum cache_indexing indexing; member
|
| /kernel/linux/linux-6.6/tools/testing/selftests/rseq/ |
| D | rseq-s390.h | 133 /* Per-cpu-id indexing. */
145 /* Per-mm-cid indexing. */
|
| D | rseq-mips.h | 151 /* Per-cpu-id indexing. */
163 /* Per-mm-cid indexing. */
|
| D | rseq-arm.h | 146 /* Per-cpu-id indexing. */
158 /* Per-mm-cid indexing. */
|
| D | rseq-riscv.h | 168 /* Per-cpu-id indexing. */
180 /* Per-mm-cid indexing. */
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/pinctrl/ |
| D | renesas,rza1-ports.yaml | 133 * The GPIO controller base in the global pin indexing space is pin
135 * in the global pin indexing space.
|
| /kernel/linux/linux-5.10/Documentation/networking/ |
| D | fib_trie.rst | 21 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
|
| /kernel/linux/linux-6.6/Documentation/networking/ |
| D | fib_trie.rst | 21 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
|
| /kernel/linux/linux-6.6/Documentation/devicetree/bindings/pinctrl/ |
| D | renesas,rza1-ports.yaml | 133 * The GPIO controller base in the global pin indexing space is pin
135 * in the global pin indexing space.
|
| /kernel/linux/linux-5.10/drivers/md/bcache/ |
| D | Kconfig | 8 a btree for indexing and the layout is optimized for SSDs.
|
| /kernel/linux/linux-6.6/drivers/md/bcache/ |
| D | Kconfig | 9 a btree for indexing and the layout is optimized for SSDs.
|