| /Linux-v5.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 …]
|
| D | speakup_dtlk.h | 62 u_char has_indexing; /* nonzero if indexing is implemented */
|
| /Linux-v5.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 | 547 dbg_gc("indexing LEB %d (free %d, dirty %d)", in ubifs_garbage_collect_leb()
645 * marking indexing nodes dirty when GC'ing indexing LEBs. Thus, at some point
655 * o GC moved indexing LEBs, but they can be used only after the commit;
704 * We've done enough iterations. Indexing LEBs were in ubifs_garbage_collect()
771 * This was an indexing LEB and it cannot be in ubifs_garbage_collect()
776 dbg_gc("indexing LEB %d freed, continue", lp.lnum); in ubifs_garbage_collect()
854 * 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
451 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash)
505 * @idx_lebs: number of indexing LEBs
524 * @total_used, @total_dead and @total_dark fields do not account indexing
738 * @lnum: LEB number of the target node (indexing node or data node)
756 * struct ubifs_znode - in-memory representation of an indexing node.
767 * @lnum: LEB number of the corresponding indexing node
768 * @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 | 333 dbg_budg("out of indexing space: min_idx_lebs %d (old %d), rsvd_idx_lebs %d", in do_budget_space()
580 /* And re-calculate the indexing space reservation */ in ubifs_convert_page_budget()
614 * node and it has to write indexing nodes as well. This introduces additional
632 * introduces. The overhead is the node header + indexing overhead. in ubifs_reported_space()
634 * Indexing overhead calculations are based on the following formula: in ubifs_reported_space()
635 * I = N/(f - 1) + 1, where I - number of indexing nodes, N - number in ubifs_reported_space()
|
| D | debug.c | 151 return "indexing node"; in dbg_ntype()
953 * This function dumps whole UBIFS indexing B-tree, unlike 'ubifs_dump_tnc()'
1166 * In UBIFS indexing B-tree colliding keys has to be sorted in binary order of
1551 * @znode_cb: called for each indexing node
1555 * node and @znode_cb for each indexing node. Returns zero in case of success
1570 /* If the root indexing node is not in TNC - pull it */ in dbg_walk_index()
1581 * We are going to traverse the indexing tree in the postorder manner. in dbg_walk_index()
1582 * Go down and find the leftmost indexing node where we are going to in dbg_walk_index()
1600 /* Iterate over all indexing nodes */ in dbg_walk_index()
1690 * every indexing node and adds its size to the 'long long' variable pointed to
[all …]
|
| /Linux-v5.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 */
|
| /Linux-v5.10/include/linux/ |
| D | node.h | 53 * @indexing: The ways memory blocks may be placed in cache
60 enum cache_indexing indexing; member
|
| D | dtlk.h | 85 unsigned char has_indexing; /* nonzero if indexing is implemented */
|
| /Linux-v5.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.
|
| /Linux-v5.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
|
| /Linux-v5.10/drivers/md/bcache/ |
| D | Kconfig | 8 a btree for indexing and the layout is optimized for SSDs.
|
| /Linux-v5.10/Documentation/ABI/stable/ |
| D | sysfs-devices-node | 153 What: /sys/devices/system/node/nodeX/memory_side_cache/indexY/indexing
157 The caches associativity indexing: 0 for direct mapped,
|
| /Linux-v5.10/arch/sh/include/asm/ |
| D | cache.h | 37 * 1. those used to select the cache set during indexing
|
| /Linux-v5.10/Documentation/admin-guide/mm/ |
| D | numaperf.rst | 157 | |-- indexing
162 The "indexing" will be 0 if it is a direct-mapped cache, and non-zero
|
| /Linux-v5.10/arch/alpha/include/uapi/asm/ |
| D | gentrap.h | 31 #define GEN_SUBRNG4 -22 /* subscripting (indexing) at levels 0..7 */
|
| /Linux-v5.10/drivers/net/wireless/marvell/mwifiex/ |
| D | ie.c | 197 /* save beacon ie index after auto-indexing */ in mwifiex_update_uap_custom_ie()
204 /* save probe resp ie index after auto-indexing */ in mwifiex_update_uap_custom_ie()
211 /* save assoc resp ie index after auto-indexing */ in mwifiex_update_uap_custom_ie()
|
| /Linux-v5.10/Documentation/devicetree/bindings/clock/ti/ |
| D | mux.txt | 23 into the register, instead indexing begins at 1. The optional property
|
| /Linux-v5.10/arch/sparc/include/asm/ |
| D | cmpxchg_32.h | 31 * by hashing the object address and indexing into an array
|
| /Linux-v5.10/arch/powerpc/platforms/ps3/ |
| D | smp.c | 60 * Check assumptions on ps3_ipi_virqs[] indexing. If this in ps3_smp_probe()
|
| /Linux-v5.10/fs/ext4/ |
| D | dir.c | 21 * Hash Tree Directory indexing (c) 2001 Daniel Phillips
36 * is_dx_dir() - check if a directory is using htree indexing
41 * indexing).
|
| /Linux-v5.10/tools/testing/selftests/rcutorture/formal/srcu-cbmc/include/linux/ |
| D | types.h | 55 * The type used for indexing onto a disc or disc partition.
|
| /Linux-v5.10/include/linux/mfd/ |
| D | stmpe.h | 53 * obtained by indexing stmpe->regs with one of the following.
|
