Home
last modified time | relevance | path

Searched refs:for_node (Results 1 – 25 of 59) sorted by relevance

123

/dports/misc/py-tvm/incubator-tvm-0.6.1/src/pass/
H A Dhoist_if_then_else.cc128 const For* for_node = for_stmt.as<For>(); in is_first_if() local
129 CHECK(for_node); in is_first_if()
203 const For* for_node = node.as<For>(); in SelectCandidates() local
204 if (!for_node) return; in SelectCandidates()
207 tracker.push(for_node->body); in SelectCandidates()
255 const For* for_node = for_stmt.as<For>(); in LocateTopFor() local
256 CHECK(for_node); in LocateTopFor()
271 const For* for_node = for_stmt.as<For>(); in LocateTopFor() local
272 CHECK(for_node); in LocateTopFor()
276 .count(for_node->loop_var.get())) { in LocateTopFor()
[all …]
H A Dloop_partition.cc596 const For *for_node = static_cast<const For*>(node); in MakeFor() local
597 CHECK(for_node); in MakeFor()
600 return Substitute(body, {{Var{for_node->loop_var}, make_const(Int(32), 0)}}); in MakeFor()
602 return For::make(for_node->loop_var, 0, extent, in MakeFor()
603 for_node->for_type, for_node->device_api, body); in MakeFor()
/dports/misc/tvm/incubator-tvm-0.6.1/src/pass/
H A Dhoist_if_then_else.cc128 const For* for_node = for_stmt.as<For>(); in is_first_if() local
129 CHECK(for_node); in is_first_if()
203 const For* for_node = node.as<For>(); in SelectCandidates() local
204 if (!for_node) return; in SelectCandidates()
207 tracker.push(for_node->body); in SelectCandidates()
255 const For* for_node = for_stmt.as<For>(); in LocateTopFor() local
256 CHECK(for_node); in LocateTopFor()
271 const For* for_node = for_stmt.as<For>(); in LocateTopFor() local
272 CHECK(for_node); in LocateTopFor()
276 .count(for_node->loop_var.get())) { in LocateTopFor()
[all …]
H A Dloop_partition.cc596 const For *for_node = static_cast<const For*>(node); in MakeFor() local
597 CHECK(for_node); in MakeFor()
600 return Substitute(body, {{Var{for_node->loop_var}, make_const(Int(32), 0)}}); in MakeFor()
602 return For::make(for_node->loop_var, 0, extent, in MakeFor()
603 for_node->for_type, for_node->device_api, body); in MakeFor()
/dports/www/py-dj32-django-treebeard/django-treebeard-4.4/treebeard/
H A Dforms.py100 choices = self.mk_dropdown_tree(opts.model, for_node=instance)
166 def is_loop_safe(for_node, possible_parent): argument
167 if for_node is not None:
169 possible_parent == for_node
170 ) or (possible_parent.is_descendant_of(for_node))
178 def add_subtree(cls, for_node, node, options): argument
180 if cls.is_loop_safe(for_node, node):
185 def mk_dropdown_tree(cls, model, for_node=None): argument
190 cls.add_subtree(for_node, node, options)
/dports/www/py-django-treebeard/django-treebeard-4.4/treebeard/
H A Dforms.py100 choices = self.mk_dropdown_tree(opts.model, for_node=instance)
166 def is_loop_safe(for_node, possible_parent): argument
167 if for_node is not None:
169 possible_parent == for_node
170 ) or (possible_parent.is_descendant_of(for_node))
178 def add_subtree(cls, for_node, node, options): argument
180 if cls.is_loop_safe(for_node, node):
185 def mk_dropdown_tree(cls, model, for_node=None): argument
190 cls.add_subtree(for_node, node, options)
/dports/security/john/john-1.9.0-jumbo-1/src/
H A Dwordlist.c752 int for_node = nWordFileLines % in do_wordlist_crack() local
755 for_node < options.node_min || in do_wordlist_crack()
756 for_node > options.node_max; in do_wordlist_crack()
782 for_node < options.node_min || in do_wordlist_crack()
783 for_node > options.node_max; in do_wordlist_crack()
1214 int for_node = in do_wordlist_crack() local
1217 for_node > options.node_max) in do_wordlist_crack()
1245 int for_node = loop_line_no % in do_wordlist_crack() local
1248 || for_node > options.node_max; in do_wordlist_crack()
1308 int for_node = line_number % in do_wordlist_crack() local
[all …]
H A Dexternal.c509 int for_node = seq % options.node_count + 1; in do_external_crack() local
510 if (for_node < options.node_min || in do_external_crack()
511 for_node > options.node_max) { in do_external_crack()
515 my_words = options.node_max - for_node + 1; in do_external_crack()
H A Dsubsets.c646 int for_node = set % options.node_count + 1; in do_subsets_crack() local
647 skip = for_node < options.node_min || in do_subsets_crack()
648 for_node > options.node_max; in do_subsets_crack()
H A Dsingle.c765 int for_node = rule_number % options.node_count + 1; in single_run() local
766 if (for_node < options.node_min || in single_run()
767 for_node > options.node_max) { in single_run()
H A Dinc.c794 int for_node = entry % options.node_count + 1; in do_incremental_crack() local
795 skip = for_node < options.node_min || in do_incremental_crack()
796 for_node > options.node_max; in do_incremental_crack()
/dports/devel/rttr/rttr-0.9.6-16-gb3a131c/3rd_party/chaiscript-develop/chaiscript/language/
H A Dchaiscript_optimizer.hpp385 auto optimize(eval::AST_Node_Impl_Ptr<T> for_node) { in optimize()
387 if (for_node->identifier != AST_Node_Type::For) { in optimize()
388 return for_node; in optimize()
391 const auto &eq_node = child_at(*for_node, 0); in optimize()
392 const auto &binary_node = child_at(*for_node, 1); in optimize()
393 const auto &prefix_node = child_at(*for_node, 2); in optimize()
395 if (child_count(*for_node) == 4 in optimize()
425 auto body_child = std::move(for_node->children[3]); in optimize()
426 for_node->children.pop_back(); in optimize()
456 return for_node; in optimize()
[all …]
/dports/lang/chaiscript/ChaiScript-6.1.0/include/chaiscript/language/
H A Dchaiscript_optimizer.hpp385 auto optimize(eval::AST_Node_Impl_Ptr<T> for_node) { in optimize()
387 if (for_node->identifier != AST_Node_Type::For) { in optimize()
388 return for_node; in optimize()
391 const auto &eq_node = child_at(*for_node, 0); in optimize()
392 const auto &binary_node = child_at(*for_node, 1); in optimize()
393 const auto &prefix_node = child_at(*for_node, 2); in optimize()
395 if (child_count(*for_node) == 4 in optimize()
425 auto body_child = std::move(for_node->children[3]); in optimize()
426 for_node->children.pop_back(); in optimize()
456 return for_node; in optimize()
[all …]
/dports/devel/cargo-generate/cargo-generate-0.9.0/cargo-crates/cargo-0.55.0/src/cargo/ops/tree/format/
H A Dmod.rs104 let for_node = self.graph.node(*node_index); in fmt() localVariable
105 match for_node { in fmt()
114 _ => panic!("unexpected feature node {:?}", for_node), in fmt()
/dports/lang/rust/rustc-1.58.1-src/src/tools/cargo/src/cargo/ops/tree/format/
H A Dmod.rs118 let for_node = self.graph.node(*node_index); in fmt() localVariable
119 match for_node { in fmt()
128 _ => panic!("unexpected feature node {:?}", for_node), in fmt()
/dports/devel/cargo-c/cargo-c-0.9.6+cargo-0.58/cargo-crates/cargo-0.58.0/src/cargo/ops/tree/format/
H A Dmod.rs118 let for_node = self.graph.node(*node_index); in fmt() localVariable
119 match for_node { in fmt()
128 _ => panic!("unexpected feature node {:?}", for_node), in fmt()
/dports/multimedia/gpac-mp4box/gpac-1.0.0/src/compositor/
H A Dvisual_manager.c213 if (self == tr_state->for_node) { in gf_sc_get_nodes_bounds()
255 if (children->node == tr_state->for_node) in gf_sc_get_nodes_bounds()
282 if (iri == tr_state->for_node) in gf_sc_get_nodes_bounds()
300 if (self != tr_state->for_node) { in gf_sc_get_nodes_bounds()
/dports/multimedia/gpac-libgpac/gpac-1.0.0/src/compositor/
H A Dvisual_manager.c213 if (self == tr_state->for_node) { in gf_sc_get_nodes_bounds()
255 if (children->node == tr_state->for_node) in gf_sc_get_nodes_bounds()
282 if (iri == tr_state->for_node) in gf_sc_get_nodes_bounds()
300 if (self != tr_state->for_node) { in gf_sc_get_nodes_bounds()
/dports/misc/mxnet/incubator-mxnet-1.9.0/3rdparty/tvm/src/tir/transforms/
H A Dloop_partition.cc597 const ForNode* for_node = static_cast<const ForNode*>(node); in MakeFor() local
598 CHECK(for_node); in MakeFor()
601 return Substitute(body, {{Var{for_node->loop_var}, make_const(DataType::Int(32), 0)}}); in MakeFor()
603 return For(for_node->loop_var, IntImm(for_node->min.dtype(), 0), extent, for_node->for_type, in MakeFor()
604 for_node->device_api, body); in MakeFor()
H A Dhoist_if_then_else.cc300 void StopAndAddRecord(const ForNode* for_node, const IfThenElseNode* if_node) { in StopAndAddRecord() argument
301 hoist_for_if_recorder = std::make_tuple(true, for_node, if_node); in StopAndAddRecord()
/dports/dns/knot3-lib/knot-3.1.5/src/knot/dnssec/
H A Dnsec3-chain.c475 uint32_t ttl, const knot_dname_t *for_node) in fix_nsec3_for_node() argument
478 const zone_node_t *old_n = zone_contents_find_node(update->zone->contents, for_node); in fix_nsec3_for_node()
479 const zone_node_t *new_n = zone_contents_find_node(update->new_cont, for_node); in fix_nsec3_for_node()
490 for_node, update->new_cont->apex->owner, params); in fix_nsec3_for_node()
/dports/dns/knot3/knot-3.1.5/src/knot/dnssec/
H A Dnsec3-chain.c475 uint32_t ttl, const knot_dname_t *for_node) in fix_nsec3_for_node() argument
478 const zone_node_t *old_n = zone_contents_find_node(update->zone->contents, for_node); in fix_nsec3_for_node()
479 const zone_node_t *new_n = zone_contents_find_node(update->new_cont, for_node); in fix_nsec3_for_node()
490 for_node, update->new_cont->apex->owner, params); in fix_nsec3_for_node()
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/crates/parser/src/
H A Dlib.rs110 pub fn for_node( in for_node() method
/dports/lang/rust/rustc-1.58.1-src/src/tools/rust-analyzer/crates/parser/src/
H A Dlib.rs132 pub fn for_node( in for_node() method
/dports/devel/rust-analyzer/rust-analyzer-2021-12-20/crates/syntax/src/parsing/
H A Dreparsing.rs127 Reparser::for_node(node.kind(), first_child, parent).map(|r| (node, r)) in find_reparsable_node()

123