Searched refs:n_nodes (Results 1 - 8 of 8) sorted by relevance
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | replay.c | 596 int n_nodes = 0; in authenticate_sleb() local
606 n_nodes++; in authenticate_sleb()
654 return err ? err : n_nodes - n_not_auth; in authenticate_sleb()
670 int n_nodes, n = 0; in replay_bud() local
690 n_nodes = authenticate_sleb(c, sleb, b->bud->log_hash, is_last); in replay_bud()
691 if (n_nodes < 0) { in replay_bud()
692 err = n_nodes; in replay_bud()
814 if (n == n_nodes) in replay_bud()
|
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | replay.c | 596 int n_nodes = 0; in authenticate_sleb() local
606 n_nodes++; in authenticate_sleb()
654 return err ? err : n_nodes - n_not_auth; in authenticate_sleb()
670 int n_nodes, n = 0; in replay_bud() local
690 n_nodes = authenticate_sleb(c, sleb, b->bud->log_hash, is_last); in replay_bud()
691 if (n_nodes < 0) { in replay_bud()
692 err = n_nodes; in replay_bud()
814 if (n == n_nodes) in replay_bud()
|
| /kernel/linux/linux-5.10/drivers/dma/ |
| H A D | st_fdma.c | 231 for (i = 0; i < fdesc->n_nodes; i++) in st_fdma_free_desc()
248 fdesc->n_nodes = sg_len; in st_fdma_alloc_desc()
569 for (i = fchan->fdesc->n_nodes - 1 ; i >= 0; i--) { in st_fdma_desc_residue()
|
| H A D | st_fdma.h | 99 unsigned int n_nodes; member
|
| /kernel/linux/linux-5.10/tools/testing/selftests/bpf/ |
| H A D | test_lpm_map.c | 211 size_t i, j, n_matches, n_matches_after_delete, n_nodes, n_lookups; in test_lpm_map() local
224 n_nodes = 1 << 8; in test_lpm_map()
243 for (i = 0; i < n_nodes; ++i) { in test_lpm_map()
324 * n_nodes, n_lookups, n_matches, n_matches_after_delete); in test_lpm_map()
|
| /kernel/linux/linux-6.6/drivers/dma/ |
| H A D | st_fdma.c | 231 for (i = 0; i < fdesc->n_nodes; i++) in st_fdma_free_desc()
248 fdesc->n_nodes = sg_len; in st_fdma_alloc_desc()
569 for (i = fchan->fdesc->n_nodes - 1 ; i >= 0; i--) { in st_fdma_desc_residue()
|
| H A D | st_fdma.h | 99 unsigned int n_nodes; member
|
| /kernel/linux/linux-6.6/tools/testing/selftests/bpf/ |
| H A D | test_lpm_map.c | 212 size_t i, j, n_nodes, n_lookups; in test_lpm_map() local
225 n_nodes = 1 << 8; in test_lpm_map()
244 for (i = 0; i < n_nodes; ++i) { in test_lpm_map()
325 * n_nodes, n_lookups, n_matches, n_matches_after_delete); in test_lpm_map()
|
Completed in 9 milliseconds