Home
last modified time | relevance | path

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

12345678910>>...12

/OK3568_Linux_fs/kernel/drivers/accessibility/speakup/
H A Dsynth.c294 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 …]
/OK3568_Linux_fs/yocto/meta-openembedded/meta-python/recipes-devtools/python/
H A Dpython3-whoosh_2.7.4.bb1 SUMMARY = "Fast, pure-Python full text indexing, search, and spell checking library."
3 Whoosh is a fast, featureful full-text indexing and searching library \
/OK3568_Linux_fs/u-boot/fs/ubifs/
H A Dubifs-media.h19 * also 8-byte aligned (except for the indexing node and the padding node).
109 /* Maximum number of levels in UBIFS indexing B-tree */
602 * @fanout: tree fanout (max. number of links per indexing node)
651 * @root_lnum: LEB number of the root indexing node
653 * @root_len: root indexing node length
674 * @idx_lebs: number of indexing logical eraseblocks
746 * struct ubifs_idx_node - indexing node.
H A Dtnc_misc.c252 * read_znode - read an indexing node from flash and fill znode.
254 * @lnum: LEB of the indexing node to read
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
381 ubifs_err(c, "bad indexing node at LEB %d:%d, error %d", lnum, offs, err); in read_znode()
H A Dgc.c517 dbg_gc("indexing LEB %d (free %d, dirty %d)", in ubifs_garbage_collect_leb()
615 * marking indexing nodes dirty when GC'ing indexing LEBs. Thus, at some point
625 * o GC moved indexing LEBs, but they can be used only after the commit;
674 * We've done enough iterations. Indexing LEBs were in ubifs_garbage_collect()
741 * This was an indexing LEB and it cannot be in ubifs_garbage_collect()
746 dbg_gc("indexing LEB %d freed, continue", lp.lnum); in ubifs_garbage_collect()
824 * it free. Note, we cannot do this with indexing LEBs because dirty space may
H A Dbudget.c341 dbg_budg("out of indexing space: min_idx_lebs %d (old %d), rsvd_idx_lebs %d", in do_budget_space()
588 /* And re-calculate the indexing space reservation */ in ubifs_convert_page_budget()
623 * node and it has to write indexing nodes as well. This introduces additional
641 * introduces. The overhead is the node header + indexing overhead. in ubifs_reported_space()
643 * Indexing overhead calculations are based on the following formula: in ubifs_reported_space()
644 * I = N/(f - 1) + 1, where I - number of indexing nodes, N - number in ubifs_reported_space()
H A Dubifs.h860 * @LEB_FREED_IDX: indexing LEB was freed and can be used only after the commit
926 * struct ubifs_gced_idx_leb - garbage-collected indexing LEB.
931 * This data structure is used to temporary store garbage-collected indexing
1049 * LPROPS_INDEX: LEB contains indexing nodes (this flag also exists on flash)
1103 * @idx_lebs: number of indexing LEBs
1122 * @total_used, @total_dead and @total_dark fields do not account indexing
1337 * @lnum: LEB number of the target node (indexing node or data node)
1353 * struct ubifs_znode - in-memory representation of an indexing node.
1362 * @lnum: LEB number of the corresponding indexing node
1363 * @offs: offset of the corresponding indexing node
[all …]
/OK3568_Linux_fs/kernel/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 Dubifs.h250 * @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 …]
H A Dgc.c547 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
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()
H A Dbudget.c333 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()
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/iommu/
H A Darm,smmu.yaml101 interrupts, specified in order of their indexing by the SMMU.
130 input IDs). This property is not valid for SMMUs using stream indexing, or
177 /* SMMU with stream matching or stream indexing */
/OK3568_Linux_fs/kernel/include/linux/
H A Dnode.h53 * @indexing: The ways memory blocks may be placed in cache
60 enum cache_indexing indexing; member
/OK3568_Linux_fs/kernel/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.
/OK3568_Linux_fs/kernel/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
/OK3568_Linux_fs/kernel/Documentation/ABI/stable/
H A Dsysfs-devices-node153 What: /sys/devices/system/node/nodeX/memory_side_cache/indexY/indexing
157 The caches associativity indexing: 0 for direct mapped,
/OK3568_Linux_fs/buildroot/package/python-whoosh/
H A DConfig.in6 Whoosh is a fast, pure-Python full text indexing, search and
/OK3568_Linux_fs/buildroot/package/pixz/
H A DConfig.in8 Pixz (pronounced pixie) is a parallel, indexing version of xz.
/OK3568_Linux_fs/buildroot/package/xapian/
H A DConfig.in9 to easily add advanced indexing and search facilities to
/OK3568_Linux_fs/kernel/drivers/net/wireless/marvell/mwifiex/
H A Die.c197 /* 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()
/OK3568_Linux_fs/kernel/Documentation/admin-guide/mm/
H A Dnumaperf.rst157 | |-- indexing
162 The "indexing" will be 0 if it is a direct-mapped cache, and non-zero
/OK3568_Linux_fs/buildroot/package/libspatialindex/
H A DConfig.in9 indexing methods.
/OK3568_Linux_fs/kernel/drivers/md/bcache/
H A DKconfig8 a btree for indexing and the layout is optimized for SSDs.
/OK3568_Linux_fs/external/mpp/mpp/codec/rc/
H A Drc_data_impl.cpp196 // ready on filling add to indexing list by property in rc_data_group_put_node()
234 // removed from indexing list in rc_data_group_put_node()

12345678910>>...12