Searched refs:node_count (Results 1 – 6 of 6) sorted by relevance
158 unsigned int i, node_count; in dpaax_iova_table_populate() local176 nodes = read_memory_node(&node_count); in dpaax_iova_table_populate()184 for (i = 0; i < node_count; i++) in dpaax_iova_table_populate()191 (sizeof(struct dpaax_iovat_element) * node_count) + in dpaax_iova_table_populate()207 dpaax_iova_table_p->count = node_count; in dpaax_iova_table_populate()213 for (i = 0; i < node_count; i++) { in dpaax_iova_table_populate()236 node_count)); in dpaax_iova_table_populate()
25 val = rte_align32pow2(graph->node_count * sizeof(rte_graph_off_t)); in graph_fp_mem_calc_size()28 graph->cir_mask = rte_align32pow2(graph->node_count) - 1; in graph_fp_mem_calc_size()54 graph->nb_nodes = _graph->node_count; in graph_header_popluate()
91 rte_node_t node_count; member
21 fprintf(f, " node_count=%" PRIu32 "\n", g->node_count); in graph_dump()
328 graph->node_count = graph_nodes_count(graph); in rte_graph_create()
946 int field_index, node_count; in build_trie() local1048 node_count = context->num_nodes; in build_trie()1055 node_count = context->num_nodes - node_count; in build_trie()1056 if (node_count > context->cur_node_max) { in build_trie()