| /Linux-v6.1/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-v6.1/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()
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()
|
| D | budget.c | 330 dbg_budg("out of indexing space: min_idx_lebs %d (old %d), rsvd_idx_lebs %d", in do_budget_space()
577 /* And re-calculate the indexing space reservation */ in ubifs_convert_page_budget()
611 * node and it has to write indexing nodes as well. This introduces additional
629 * introduces. The overhead is the node header + indexing overhead. in ubifs_reported_space()
631 * Indexing overhead calculations are based on the following formula: in ubifs_reported_space()
632 * 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()
974 * This function dumps whole UBIFS indexing B-tree, unlike 'ubifs_dump_tnc()'
1187 * In UBIFS indexing B-tree colliding keys has to be sorted in binary order of
1572 * @znode_cb: called for each indexing node
1576 * node and @znode_cb for each indexing node. Returns zero in case of success
1591 /* If the root indexing node is not in TNC - pull it */ in dbg_walk_index()
1602 * We are going to traverse the indexing tree in the postorder manner. in dbg_walk_index()
1603 * Go down and find the leftmost indexing node where we are going to in dbg_walk_index()
1621 /* Iterate over all indexing nodes */ in dbg_walk_index()
1711 * every indexing node and adds its size to the 'long long' variable pointed to
[all …]
|
| /Linux-v6.1/include/linux/ |
| D | node.h | 52 * @indexing: The ways memory blocks may be placed in cache
59 enum cache_indexing indexing; member
|
| /Linux-v6.1/Documentation/devicetree/bindings/iommu/ |
| D | arm,smmu.yaml | 116 interrupts, specified in order of their indexing by the SMMU.
145 input IDs). This property is not valid for SMMUs using stream indexing, or
211 /* SMMU with stream matching or stream indexing */
|
| /Linux-v6.1/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-v6.1/Documentation/devicetree/bindings/pinctrl/ |
| D | renesas,rza1-ports.yaml | 137 * The GPIO controller base in the global pin indexing space is pin
139 * in the global pin indexing space.
|
| /Linux-v6.1/drivers/md/bcache/ |
| D | Kconfig | 9 a btree for indexing and the layout is optimized for SSDs.
|
| /Linux-v6.1/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-v6.1/tools/testing/selftests/vm/ |
| D | gup_test.c | 191 * Do the 1-based indexing here, so that the user can in main()
192 * use normal 0-based indexing on the command line. in main()
|
| /Linux-v6.1/arch/sh/include/asm/ |
| D | cache.h | 37 * 1. those used to select the cache set during indexing
|
| /Linux-v6.1/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-v6.1/drivers/net/wireless/marvell/mwifiex/ |
| D | ie.c | 185 /* 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-v6.1/arch/alpha/include/uapi/asm/ |
| D | gentrap.h | 31 #define GEN_SUBRNG4 -22 /* subscripting (indexing) at levels 0..7 */
|
| /Linux-v6.1/arch/arc/mm/ |
| D | tlbex.S | 171 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-v6.1/arch/sparc/include/asm/ |
| D | cmpxchg_32.h | 31 * by hashing the object address and indexing into an array
|
| /Linux-v6.1/Documentation/devicetree/bindings/clock/ti/ |
| D | mux.txt | 23 into the register, instead indexing begins at 1. The optional property
|
| /Linux-v6.1/fs/cifs/ |
| D | cifs_fs_sb.h | 64 /* randomly generated 128-bit number for indexing dfs mount groups in referral cache */
|
| /Linux-v6.1/arch/powerpc/platforms/ps3/ |
| D | smp.c | 60 * Check assumptions on ps3_ipi_virqs[] indexing. If this in ps3_smp_probe()
|
| /Linux-v6.1/arch/arm/probes/ |
| D | decode.h | 149 * indexing into the action array using the value of 'handler'. This
155 * indexing into the action array using the value of 'handler'. This
|
