Home
last modified time | relevance | path

Searched refs:get_next_block (Results 1 - 15 of 15) sorted by relevance

/kernel/linux/linux-5.10/include/linux/
H A Dtextsearch.h21 * @cb: control buffer, for persistent variables of get_next_block()
56 * @get_next_block: callback to fetch the next block to search in
65 * @get_next_block: fetch next block of data
76 unsigned int (*get_next_block)(unsigned int consumed, member
82 * @finish: finalize/clean a series of get_next_block() calls
86 * Called after the last use of get_next_block(), may be used
/kernel/linux/linux-6.6/include/linux/
H A Dtextsearch.h21 * @cb: control buffer, for persistent variables of get_next_block()
56 * @get_next_block: callback to fetch the next block to search in
65 * @get_next_block: fetch next block of data
76 unsigned int (*get_next_block)(unsigned int consumed, member
82 * @finish: finalize/clean a series of get_next_block() calls
86 * Called after the last use of get_next_block(), may be used
/kernel/linux/linux-5.10/lib/
H A Dts_kmp.c50 text_len = conf->get_next_block(consumed, &text, conf, state); in kmp_find()
H A Dtextsearch.c26 * |get_next_block()|<--------------(5)---------------+ |
47 * (5) Algorithm calls get_next_block() provided by the user continuously
49 * (6) Algorithm invokes finish() after the last call to get_next_block
50 * to clean up any leftovers from get_next_block. (Optional)
68 * an own get_next_block() implementation and
237 conf->get_next_block = get_linear_data; in textsearch_find_continuous()
H A Dts_bm.c69 text_len = conf->get_next_block(consumed, &text, conf, state); in bm_find()
H A Ddecompress_bunzip2.c156 static int INIT get_next_block(struct bunzip_data *bd) in get_next_block() function
610 previous = get_next_block(bd); in read_bunzip()
H A Dts_fsm.c145 block_len = conf->get_next_block(consumed, &data, conf, state); }) in fsm_find()
/kernel/linux/linux-6.6/lib/
H A Dts_kmp.c50 text_len = conf->get_next_block(consumed, &text, conf, state); in kmp_find()
H A Dtextsearch.c26 * |get_next_block()|<--------------(5)---------------+ |
47 * (5) Algorithm calls get_next_block() provided by the user continuously
49 * (6) Algorithm invokes finish() after the last call to get_next_block
50 * to clean up any leftovers from get_next_block. (Optional)
68 * an own get_next_block() implementation and
237 conf->get_next_block = get_linear_data; in textsearch_find_continuous()
H A Ddecompress_bunzip2.c156 static int INIT get_next_block(struct bunzip_data *bd) in get_next_block() function
610 previous = get_next_block(bd); in read_bunzip()
H A Dts_bm.c87 text_len = conf->get_next_block(consumed, &text, conf, state); in bm_find()
H A Dts_fsm.c145 block_len = conf->get_next_block(consumed, &data, conf, state); }) in fsm_find()
/kernel/linux/linux-6.6/drivers/net/ethernet/marvell/prestera/
H A Dprestera_counter.c258 get_next_block: in prestera_counter_get()
268 goto get_next_block; in prestera_counter_get()
/kernel/linux/linux-5.10/net/core/
H A Dskbuff.c3622 config->get_next_block = skb_ts_get_next_block; in skb_find_text()
/kernel/linux/linux-6.6/net/core/
H A Dskbuff.c4263 config->get_next_block = skb_ts_get_next_block; in skb_find_text()

Completed in 23 milliseconds