| /dports/editors/hnb/hnb-1.9.18/src/ |
| H A D | node.h | 42 #define if_node(a,b) ((a)?(b):0) macro
50 #define node_up(node) if_node((node),(node)->up)
51 #define node_down(node) if_node((node),(node)->down)
52 #define node_right(node) if_node((node),(node)->right)
53 #define node_left(node) if_node((node),(node)->left)
58 #define node_setflags(node,tflags) if_node((node),(node)->flags=(tflags))
63 #define node_getflags(node) if_node((node),((node)->flags))
69 #define node_getflag(node,flag) if_node((node),((node)->flags&(flag)?1:0))
|
| /dports/graphics/mesa-dri-classic/mesa-20.2.3/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 190 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
191 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
192 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
193 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
229 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
230 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
231 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
232 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/lang/clover/mesa-21.3.6/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/graphics/libosmesa-gallium/mesa-21.3.6/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/graphics/libosmesa/mesa-21.3.6/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/graphics/mesa-libs/mesa-21.3.6/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/graphics/mesa-gallium-va/mesa-21.3.6/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/graphics/mesa-dri-gallium/mesa-21.3.6/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/graphics/mesa-gallium-xa/mesa-21.3.6/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/graphics/mesa-dri/mesa-21.3.6/src/compiler/nir/ |
| H A D | nir_lower_memory_model.c | 209 foreach_list_typed(nir_cf_node, if_node, node, &nif->then_list) in lower_make_visible()
210 progress |= lower_make_visible(if_node, &cur_modes_then); in lower_make_visible()
211 foreach_list_typed(nir_cf_node, if_node, node, &nif->else_list) in lower_make_visible()
212 progress |= lower_make_visible(if_node, &cur_modes_else); in lower_make_visible()
248 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->then_list) in lower_make_available()
249 progress |= lower_make_available(if_node, &cur_modes_then); in lower_make_available()
250 foreach_list_typed_reverse(nir_cf_node, if_node, node, &nif->else_list) in lower_make_available()
251 progress |= lower_make_available(if_node, &cur_modes_else); in lower_make_available()
|
| /dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/src/relay/transforms/ |
| H A D | device_annotation.cc | 170 Expr VisitExpr_(const IfNode* if_node) final { in VisitExpr_() argument
171 Expr cond = GetDeviceCopyExpr(if_node->cond, if_node); in VisitExpr_()
172 Expr true_br = GetDeviceCopyExpr(if_node->true_branch, if_node); in VisitExpr_()
173 Expr false_br = GetDeviceCopyExpr(if_node->false_branch, if_node); in VisitExpr_()
175 if (if_node->cond.same_as(cond) && if_node->true_branch.same_as(true_br) && in VisitExpr_()
176 if_node->false_branch.same_as(false_br)) { in VisitExpr_()
177 return ExprMutator::VisitExpr_(if_node); in VisitExpr_()
180 UpdateAnnotationMap(if_node, new_if.operator->()); in VisitExpr_()
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/polly/lib/External/isl/ |
| H A D | isl_ast_graft.c | 284 isl_ast_node *if_node; in ast_node_insert_if() local
519 isl_set_free(if_node[i].guard); in clear_if_nodes()
550 struct isl_if_node *if_node = NULL; in insert_pending_guard_nodes() local
563 if (!if_node) in insert_pending_guard_nodes()
587 if_node[j].guard); in insert_pending_guard_nodes()
595 if_node[j].complement); in insert_pending_guard_nodes()
623 if_node[n_if].node = graft->node; in insert_pending_guard_nodes()
624 if_node[n_if].guard = guard; in insert_pending_guard_nodes()
633 if_node[n_if].complement = set; in insert_pending_guard_nodes()
653 clear_if_nodes(if_node, 0, n_if); in insert_pending_guard_nodes()
[all …]
|
| /dports/misc/tvm/incubator-tvm-0.6.1/src/relay/pass/ |
| H A D | device_annotation.cc | 172 Expr VisitExpr_(const IfNode* if_node) final { in VisitExpr_() argument
173 Expr cond = GetDeviceCopyExpr(if_node->cond, if_node); in VisitExpr_()
174 Expr true_br = GetDeviceCopyExpr(if_node->true_branch, if_node); in VisitExpr_()
175 Expr false_br = GetDeviceCopyExpr(if_node->false_branch, if_node); in VisitExpr_()
177 if (if_node->cond.same_as(cond) && if_node->true_branch.same_as(true_br) && in VisitExpr_()
178 if_node->false_branch.same_as(false_br)) { in VisitExpr_()
179 return ExprMutator::VisitExpr_(if_node); in VisitExpr_()
182 UpdateAnnotationMap(if_node, new_if.operator->()); in VisitExpr_()
|
| /dports/misc/py-tvm/incubator-tvm-0.6.1/src/relay/pass/ |
| H A D | device_annotation.cc | 172 Expr VisitExpr_(const IfNode* if_node) final { in VisitExpr_() argument
173 Expr cond = GetDeviceCopyExpr(if_node->cond, if_node); in VisitExpr_()
174 Expr true_br = GetDeviceCopyExpr(if_node->true_branch, if_node); in VisitExpr_()
175 Expr false_br = GetDeviceCopyExpr(if_node->false_branch, if_node); in VisitExpr_()
177 if (if_node->cond.same_as(cond) && if_node->true_branch.same_as(true_br) && in VisitExpr_()
178 if_node->false_branch.same_as(false_br)) { in VisitExpr_()
179 return ExprMutator::VisitExpr_(if_node); in VisitExpr_()
182 UpdateAnnotationMap(if_node, new_if.operator->()); in VisitExpr_()
|
| /dports/security/suricata/suricata-6.0.4/src/ |
| H A D | util-conf.c | 130 ConfNode *if_node, *item; local
131 TAILQ_FOREACH(if_node, &node->head, next) {
132 TAILQ_FOREACH(item, &if_node->head, next) {
135 return if_node;
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/cpp/src/gandiva/tests/ |
| H A D | projector_build_validation_test.cc | 163 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_b, int32()); in TEST_F() local
165 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
186 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_b, boolean()); in TEST_F() local
188 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
211 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_c, int32()); in TEST_F() local
213 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
236 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_c, int32()); in TEST_F() local
238 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
|
| /dports/databases/arrow/apache-arrow-6.0.1/cpp/src/gandiva/tests/ |
| H A D | projector_build_validation_test.cc | 163 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_b, int32()); in TEST_F() local
165 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
186 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_b, boolean()); in TEST_F() local
188 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
211 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_c, int32()); in TEST_F() local
213 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
236 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_c, int32()); in TEST_F() local
238 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
|
| /dports/security/vault/vault-1.8.2/vendor/github.com/apache/arrow/cpp/src/gandiva/tests/ |
| H A D | projector_build_validation_test.cc | 163 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_b, int32()); in TEST_F() local
165 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
186 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_b, boolean()); in TEST_F() local
188 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
211 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_c, int32()); in TEST_F() local
213 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
236 auto if_node = TreeExprBuilder::MakeIf(condition, node_a, node_c, int32()); in TEST_F() local
238 auto expr = TreeExprBuilder::MakeExpression(if_node, field_result); in TEST_F()
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/polly/lib/External/isl/ |
| H A D | isl_ast_graft.c | 304 isl_ast_node *if_node; in ast_node_insert_if() local
547 isl_set_free(if_node[i].guard); in clear_if_nodes()
579 struct isl_if_node *if_node = NULL; in insert_pending_guard_nodes() local
592 if (!if_node) in insert_pending_guard_nodes()
616 if_node[j].guard); in insert_pending_guard_nodes()
624 if_node[j].complement); in insert_pending_guard_nodes()
652 if_node[n_if].node = graft->node; in insert_pending_guard_nodes()
653 if_node[n_if].guard = guard; in insert_pending_guard_nodes()
662 if_node[n_if].complement = set; in insert_pending_guard_nodes()
682 clear_if_nodes(if_node, 0, n_if); in insert_pending_guard_nodes()
[all …]
|
| /dports/math/barvinok/barvinok-0.41.5/isl/ |
| H A D | isl_ast_graft.c | 304 isl_ast_node *if_node; in ast_node_insert_if() local
547 isl_set_free(if_node[i].guard); in clear_if_nodes()
579 struct isl_if_node *if_node = NULL; in insert_pending_guard_nodes() local
592 if (!if_node) in insert_pending_guard_nodes()
616 if_node[j].guard); in insert_pending_guard_nodes()
624 if_node[j].complement); in insert_pending_guard_nodes()
652 if_node[n_if].node = graft->node; in insert_pending_guard_nodes()
653 if_node[n_if].guard = guard; in insert_pending_guard_nodes()
662 if_node[n_if].complement = set; in insert_pending_guard_nodes()
682 clear_if_nodes(if_node, 0, n_if); in insert_pending_guard_nodes()
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/polly/lib/External/isl/ |
| H A D | isl_ast_graft.c | 304 isl_ast_node *if_node; in ast_node_insert_if() local
547 isl_set_free(if_node[i].guard); in clear_if_nodes()
579 struct isl_if_node *if_node = NULL; in insert_pending_guard_nodes() local
592 if (!if_node) in insert_pending_guard_nodes()
616 if_node[j].guard); in insert_pending_guard_nodes()
624 if_node[j].complement); in insert_pending_guard_nodes()
652 if_node[n_if].node = graft->node; in insert_pending_guard_nodes()
653 if_node[n_if].guard = guard; in insert_pending_guard_nodes()
662 if_node[n_if].complement = set; in insert_pending_guard_nodes()
682 clear_if_nodes(if_node, 0, n_if); in insert_pending_guard_nodes()
[all …]
|
| /dports/devel/isl/isl-0.24/ |
| H A D | isl_ast_graft.c | 304 isl_ast_node *if_node; in ast_node_insert_if() local
547 isl_set_free(if_node[i].guard); in clear_if_nodes()
579 struct isl_if_node *if_node = NULL; in insert_pending_guard_nodes() local
592 if (!if_node) in insert_pending_guard_nodes()
616 if_node[j].guard); in insert_pending_guard_nodes()
624 if_node[j].complement); in insert_pending_guard_nodes()
652 if_node[n_if].node = graft->node; in insert_pending_guard_nodes()
653 if_node[n_if].guard = guard; in insert_pending_guard_nodes()
662 if_node[n_if].complement = set; in insert_pending_guard_nodes()
682 clear_if_nodes(if_node, 0, n_if); in insert_pending_guard_nodes()
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/polly/lib/External/isl/ |
| H A D | isl_ast_graft.c | 304 isl_ast_node *if_node; in ast_node_insert_if() local
547 isl_set_free(if_node[i].guard); in clear_if_nodes()
579 struct isl_if_node *if_node = NULL; in insert_pending_guard_nodes() local
592 if (!if_node) in insert_pending_guard_nodes()
616 if_node[j].guard); in insert_pending_guard_nodes()
624 if_node[j].complement); in insert_pending_guard_nodes()
652 if_node[n_if].node = graft->node; in insert_pending_guard_nodes()
653 if_node[n_if].guard = guard; in insert_pending_guard_nodes()
662 if_node[n_if].complement = set; in insert_pending_guard_nodes()
682 clear_if_nodes(if_node, 0, n_if); in insert_pending_guard_nodes()
[all …]
|