Home
last modified time | relevance | path

Searched refs:n_nodes (Results 1 – 5 of 5) sorted by relevance

/openbmc/qemu/tests/unit/
H A Dtest-rcu-list.c37 static long long n_nodes = 0LL; variable
248 n_nodes += n_nodes_local; in rcu_q_updater()
266 n_nodes += RCU_Q_LEN; in rcu_qtest_init()
/openbmc/linux/fs/ubifs/
H A Dreplay.c596 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()
/openbmc/linux/drivers/dma/
H A Dst_fdma.h99 unsigned int n_nodes; member
H A Dst_fdma.c231 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()
/openbmc/linux/tools/testing/selftests/bpf/
H A Dtest_lpm_map.c212 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()