Home
last modified time | relevance | path

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

123456

/linux/drivers/accessibility/speakup/
H A Dsynth.c378 synth->indexing.currindex++; in synth_insert_next_index()
380 if (synth->indexing.currindex > in synth_insert_next_index()
381 synth->indexing.highindex) in synth_insert_next_index()
382 synth->indexing.currindex = in synth_insert_next_index()
383 synth->indexing.lowindex; in synth_insert_next_index()
386 out = synth->indexing.currindex * 10 + sent_num; in synth_insert_next_index()
387 synth_printf(synth->indexing.command, out, out); in synth_insert_next_index()
398 if ((ind / 10) <= synth->indexing.currindex) in spk_get_index_count()
399 index_count = synth->indexing.currindex - (ind / 10); in spk_get_index_count()
401 index_count = synth->indexing.currindex in spk_get_index_count()
[all …]
H A Dspeakup_dtlk.h62 u_char has_indexing; /* nonzero if indexing is implemented */
/linux/drivers/md/dm-vdo/indexer/
H A Dconfig.h59 /* Sampling rate for sparse indexing */
79 /* Sampling rate for sparse indexing */
105 /* Sampling rate for sparse indexing */
/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 Dtnc_misc.c276 * read_znode - read an indexing node from flash and fill znode.
281 * This function reads an indexing node from the flash media and fills znode
283 * code in case of failure. The read indexing node is validated and if anything
407 ubifs_err(c, "bad indexing node at LEB %d:%d", lnum, offs); in read_znode()
/linux/tools/testing/selftests/rseq/
H A Drseq-s390.h94 /* Per-cpu-id indexing. */
106 /* 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.h167 /* Per-cpu-id indexing. */
179 /* 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. */
H A Drseq-ppc.h208 /* Per-cpu-id indexing. */
220 /* Per-mm-cid indexing. */
/linux/include/linux/
H A Dnode.h68 * @indexing: The ways memory blocks may be placed in cache
76 enum cache_indexing indexing; member
/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
/linux/drivers/md/bcache/
H A DKconfig10 a btree for indexing and the layout is optimized for SSDs.
/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()
/linux/drivers/net/wireless/marvell/mwifiex/
H A Die.c185 /* save beacon ie index after auto-indexing */ in mwifiex_update_uap_custom_ie()
192 /* save probe resp ie index after auto-indexing */ in mwifiex_update_uap_custom_ie()
199 /* save assoc resp ie index after auto-indexing */ in mwifiex_update_uap_custom_ie()
/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
/linux/arch/sh/include/asm/
H A Dcache.h43 * 1. those used to select the cache set during indexing
/linux/arch/alpha/include/uapi/asm/
H A Dgentrap.h31 #define GEN_SUBRNG4 -22 /* subscripting (indexing) at levels 0..7 */
/linux/arch/arc/mm/
H A Dtlbex.S171 lsr r0, r2, PGDIR_SHIFT ; Bits for indexing into PGD
177 lsr r0, r2, PUD_SHIFT ; Bits for indexing into PUD
186 lsr r0, r2, PMD_SHIFT ; Bits for indexing into PMD
/linux/arch/arm/probes/
H A Ddecode.h149 * indexing into the action array using the value of 'handler'. This
155 * indexing into the action array using the value of 'handler'. This
/linux/arch/sparc/include/asm/
H A Dcmpxchg_32.h31 * by hashing the object address and indexing into an array
/linux/arch/powerpc/platforms/ps3/
H A Dsmp.c60 * Check assumptions on ps3_ipi_virqs[] indexing. If this in ps3_smp_probe()

123456