Home
last modified time | relevance | path

Searched refs:n_edge (Results 1 – 3 of 3) sorted by relevance

/external/llvm-project/polly/lib/External/isl/
Disl_scheduler.c380 int n_edge; member
683 int n_node, int n_edge) in graph_alloc() argument
688 graph->n_edge = n_edge; in graph_alloc()
694 struct isl_sched_edge, graph->n_edge); in graph_alloc()
696 graph->intra_hmap = isl_map_to_basic_set_alloc(ctx, 2 * n_edge); in graph_alloc()
697 graph->intra_hmap_param = isl_map_to_basic_set_alloc(ctx, 2 * n_edge); in graph_alloc()
698 graph->inter_hmap = isl_map_to_basic_set_alloc(ctx, 2 * n_edge); in graph_alloc()
700 if (!graph->node || !graph->region || (graph->n_edge && !graph->edge) || in graph_alloc()
747 for (i = 0; i < graph->n_edge; ++i) { in graph_free()
788 int n_edge; in compute_max_row() local
[all …]
/external/deqp/external/openglcts/modules/glesext/tessellation_shader/
DesextcTessellationShaderVertexSpacing.cpp426 for (unsigned int n_edge = 0; n_edge < n_edge_ptrs; ++n_edge) in getEdgesForQuadsTessellation() local
428 _tess_edge& edge = *(edge_ptrs[n_edge]); in getEdgesForQuadsTessellation()
484 for (unsigned int n_edge = 0; n_edge < n_edge_ptrs; ++n_edge) in getEdgesForQuadsTessellation() local
486 _tess_edge& edge = *(edge_ptrs[n_edge]); in getEdgesForQuadsTessellation()
503 for (unsigned int n_edge = 0; n_edge < n_edge_ptrs; ++n_edge) in getEdgesForQuadsTessellation() local
505 _tess_edge& edge = *(edge_ptrs[n_edge]); in getEdgesForQuadsTessellation()
1106 unsigned int n_edge = 0; in verifyEdges() local
1109 edges_iterator++, n_edge++) in verifyEdges()
1286 expected_counter = (int)outermost_edge_tess_level_clamped_rounded - 2 * (n_edge / 3); in verifyEdges()
1295 expected_counter = (int)edge_clamped_rounded_tess_level - 2 * (n_edge / 4); in verifyEdges()
/external/deqp/external/openglcts/modules/glesext/geometry_shader/
DesextcGeometryShaderRendering.cpp1722 for (int n_edge = 0; n_edge < 4 /* edges */; ++n_edge) in verify() local
1736 switch (n_edge) in verify()
3407 for (unsigned int n_edge = 0; n_edge < 4 /* edges */; ++n_edge) in verify() local
3423 switch (n_edge) in verify()
3545 for (unsigned int n_edge = 0; n_edge < 4 /* edges */; ++n_edge) in verify() local
3556 switch (n_edge) in verify()
3673 for (unsigned int n_edge = 0; n_edge < 4 /* edges */; ++n_edge) in verify() local
3682 switch (n_edge) in verify()
5431 for (int n_edge = 0; n_edge < 8 /* edges */; ++n_edge) in verify() local
5433 switch (n_edge) in verify()