Home
last modified time | relevance | path

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

1234

/dports/math/fcl/fcl-0.7.0/test/
H A Dtest_fcl_broadphase_distance.cpp168 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
171 int y = (i - n_edge * n_edge * x) % n_edge; in generateSelfDistanceEnvironments()
181 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
184 int y = (i - n_edge * n_edge * x) % n_edge; in generateSelfDistanceEnvironments()
194 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
197 int y = (i - n_edge * n_edge * x) % n_edge; in generateSelfDistanceEnvironments()
207 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
210 int y = (i - n_edge * n_edge * x) % n_edge; in generateSelfDistanceEnvironments()
220 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
244 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironmentsMesh()
[all …]
/dports/math/fcl05/fcl-0.5.0/test/
H A Dtest_fcl_broadphase.cpp355 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
358 int y = (i - n_edge * n_edge * x) % n_edge; in generateSelfDistanceEnvironments()
368 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
371 int y = (i - n_edge * n_edge * x) % n_edge; in generateSelfDistanceEnvironments()
381 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
394 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
407 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironments()
430 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironmentsMesh()
445 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironmentsMesh()
460 for(; i < n_edge * n_edge * n_edge / 4; ++i) in generateSelfDistanceEnvironmentsMesh()
[all …]
/dports/graphics/geomview/geomview-1.9.5/src/lib/geometry/cmodel/
H A Dcmodel_data.c206 struct edge *n_edge; in new_edge() local
209 n_edge = last_edge + 1; in new_edge()
213 last_edge->next = n_edge; in new_edge()
214 n_edge->next = NULL; in new_edge()
215 last_edge = n_edge; in new_edge()
218 n_edge->v1 = v1; in new_edge()
219 n_edge->v2 = v2; in new_edge()
220 HPt3Copy(polar, &n_edge->polar); in new_edge()
221 n_edge->small = n_edge->split = n_edge->visible = n_edge->hascolor = FALSE; in new_edge()
222 n_edge->other_half = NULL; in new_edge()
[all …]
/dports/math/blis/blis-0.8.1/frame/1m/packm/
H A Dbli_packm_cxk_3mis.c103 const dim_t n_edge = panel_len_max; \
115 n_edge, \
128 n_edge, \
141 n_edge, \
155 const dim_t n_edge = panel_len_max - j; \
167 n_edge, \
180 n_edge, \
193 n_edge, \
H A Dbli_packm_struc_cxk_md.c118 const dim_t n_edge = panel_len_max; \
128 n_edge, \
152 n_edge, \
186 ( void ) n_edge; ( void )offn; \
194 n_edge, \
211 ( void ) n_edge; ( void )offn; \
219 n_edge, \
251 ( void ) n_edge; ( void )offn; \
259 n_edge, \
276 ( void ) n_edge; ( void )offn; \
[all …]
H A Dbli_packm_cxk_4mi.c102 const dim_t n_edge = panel_len_max; \
109 n_edge, \
115 n_edge, \
125 const dim_t n_edge = panel_len_max - j; \
132 n_edge, \
138 n_edge, \
H A Dbli_packm_cxk.c158 const dim_t n_edge = panel_len_max; \
164 n_edge, \
174 const dim_t n_edge = panel_len_max - panel_len; \
180 n_edge, \
H A Dbli_packm_cxk_1er.c107 const dim_t n_edge = panel_len_max; \
115 n_edge, \
128 const dim_t n_edge = panel_len_max - panel_len; \
136 n_edge, \
H A Dbli_packm_cxk_rih.c106 const dim_t n_edge = panel_len_max; \
116 n_edge, \
130 const dim_t n_edge = panel_len_max - j; \
140 n_edge, \
/dports/math/blis/blis-0.8.1/ref_kernels/1m/
H A Dbli_packm_cxk_3mis_ref.c158 n_edge, \
171 n_edge, \
184 n_edge, \
210 n_edge, \
223 n_edge, \
236 n_edge, \
430 n_edge, \
443 n_edge, \
456 n_edge, \
658 n_edge, \
[all …]
H A Dbli_packm_cxk_4mi_ref.c147 n_edge, \
153 n_edge, \
170 n_edge, \
176 n_edge, \
304 n_edge, \
310 n_edge, \
327 n_edge, \
333 n_edge, \
492 n_edge, \
498 n_edge, \
[all …]
H A Dbli_packm_cxk_bb_ref.c174 const dim_t n_edge = n_max; \
181 n_edge, \
198 n_edge, \
290 const dim_t n_edge = n_max; \
297 n_edge, \
314 n_edge, \
508 const dim_t n_edge = n_max; \
515 n_edge, \
532 n_edge, \
631 n_edge, \
[all …]
H A Dbli_packm_cxk_ref.c159 n_edge, \
176 n_edge, \
316 n_edge, \
333 n_edge, \
471 n_edge, \
488 n_edge, \
615 n_edge, \
632 n_edge, \
811 n_edge, \
971 n_edge, \
[all …]
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/polly/lib/External/isl/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3732 dst->n_edge = 0; in copy_edges()
3768 dst->n_edge++; in copy_edges()
3826 ++n_edge; in extract_sub_graph()
4424 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/math/barvinok/barvinok-0.41.5/isl/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3739 dst->n_edge = 0; in copy_edges()
3775 dst->n_edge++; in copy_edges()
3833 ++n_edge; in extract_sub_graph()
4431 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/polly/lib/External/isl/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3739 dst->n_edge = 0; in copy_edges()
3775 dst->n_edge++; in copy_edges()
3833 ++n_edge; in extract_sub_graph()
4431 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/devel/isl/isl-0.24/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3739 dst->n_edge = 0; in copy_edges()
3775 dst->n_edge++; in copy_edges()
3833 ++n_edge; in extract_sub_graph()
4431 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/devel/llvm12/llvm-project-12.0.1.src/polly/lib/External/isl/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3739 dst->n_edge = 0; in copy_edges()
3775 dst->n_edge++; in copy_edges()
3833 ++n_edge; in extract_sub_graph()
4431 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/polly/lib/External/isl/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3739 dst->n_edge = 0; in copy_edges()
3775 dst->n_edge++; in copy_edges()
3833 ++n_edge; in extract_sub_graph()
4431 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/polly/lib/External/isl/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3739 dst->n_edge = 0; in copy_edges()
3775 dst->n_edge++; in copy_edges()
3833 ++n_edge; in extract_sub_graph()
4431 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/polly/lib/External/isl/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3739 dst->n_edge = 0; in copy_edges()
3775 dst->n_edge++; in copy_edges()
3833 ++n_edge; in extract_sub_graph()
4431 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/polly/lib/External/isl/
H A Disl_scheduler.c380 int n_edge; member
673 graph->n_edge = n_edge; in graph_alloc()
771 int n_edge; in compute_max_row() local
783 if (n_edge < 0) in compute_max_row()
1363 graph->n_edge++; in extract_edge()
1432 graph->n_edge = 0; in graph_init()
3512 dst->n_edge = 0; in copy_edges()
3548 dst->n_edge++; in copy_edges()
3606 ++n_edge; in extract_sub_graph()
4200 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/polly/lib/External/isl/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3739 dst->n_edge = 0; in copy_edges()
3775 dst->n_edge++; in copy_edges()
3833 ++n_edge; in extract_sub_graph()
4431 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/devel/llvm13/llvm-project-13.0.1.src/polly/lib/External/isl/
H A Disl_scheduler.c380 int n_edge; member
688 graph->n_edge = n_edge; in graph_alloc()
788 int n_edge; in compute_max_row() local
800 if (n_edge < 0) in compute_max_row()
1537 graph->n_edge++; in extract_edge()
1613 graph->n_edge = 0; in graph_init()
3739 dst->n_edge = 0; in copy_edges()
3775 dst->n_edge++; in copy_edges()
3833 ++n_edge; in extract_sub_graph()
4431 n_ineq += n_edge; in setup_carry_lp()
[all …]
/dports/math/blis/blis-0.8.1/kernels/armsve/1m/
H A Dbli_dpackm_armsve256_asm_8xk.c209 const dim_t n_edge = n_max; in bli_dpackm_armsve256_asm_8xk() local
215 n_edge, in bli_dpackm_armsve256_asm_8xk()
225 const dim_t n_edge = n_max - j; in bli_dpackm_armsve256_asm_8xk() local
231 n_edge, in bli_dpackm_armsve256_asm_8xk()

1234