Home
last modified time | relevance | path

Searched defs:nodes_left (Results 1 – 25 of 35) sorted by relevance

12

/dports/audio/musepack/musepack_src_r475/common/
H A Dhuffman-bcl.c131 unsigned int k, nodes_left, next_idx; in _Huffman_MakeTree() local
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/
H A DloopUnswitch.cpp62 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes(); in policy_unswitching() local
H A DloopTransform.cpp2281 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes(); in iteration_split_impl() local
H A Dloopopts.cpp756 int nodes_left = C->max_node_limit() - C->live_nodes(); in merge_point_too_heavy() local
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/
H A DloopUnswitch.cpp62 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes(); in policy_unswitching() local
H A DloopTransform.cpp2281 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes(); in iteration_split_impl() local
H A Dloopopts.cpp756 int nodes_left = C->max_node_limit() - C->live_nodes(); in merge_point_too_heavy() local
/dports/math/igraph/igraph-0.9.5/src/misc/
H A Dfeedback_arc_set.c191 long int i, j, k, v, eid, no_of_nodes = igraph_vcount(graph), nodes_left; in igraph_i_feedback_arc_set_eades() local
/dports/math/R-cran-igraph/igraph/src/
H A Dfeedback_arc_set.c194 long int i, j, k, v, eid, no_of_nodes = igraph_vcount(graph), nodes_left; in igraph_i_feedback_arc_set_eades() local
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/
H A DloopUnswitch.cpp70 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes(); in policy_unswitching() local
H A Dloopopts.cpp1036 int nodes_left = C->max_node_limit() - C->live_nodes(); in merge_point_too_heavy() local
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/opto/
H A DloopUnswitch.cpp70 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes(); in policy_unswitching() local
H A DloopTransform.cpp3157 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes(); in iteration_split_impl() local
H A Dloopopts.cpp1056 int nodes_left = C->max_node_limit() - C->live_nodes(); in merge_point_too_heavy() local
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/
H A DloopUnswitch.cpp70 int nodes_left = phase->C->max_node_limit() - phase->C->live_nodes(); in policy_unswitching() local
H A Dloopopts.cpp1036 int nodes_left = C->max_node_limit() - C->live_nodes(); in merge_point_too_heavy() local
/dports/editors/hnb/hnb-1.9.18/src/
H A Dtree.c149 unsigned int nodes_left (Node *node) in nodes_left() function
/dports/games/odamex/odamex-src-0.7.0/common/
H A Dhuffman.cpp260 unsigned int k, num_symbols, nodes_left, next_idx; in _Huffman_MakeTree() local
/dports/science/chrono/chrono-7.0.1/src/demos/fea/
H A Ddemo_FEA_shellsReissner.cpp334 std::vector<std::shared_ptr<ChNodeFEAxyzrot>> nodes_left(nels_U + 1); in main() local
/dports/science/chrono/chrono-7.0.1/src/demos/python/fea/
H A Ddemo_FEA_shells.py277 nodes_left = [fea.ChNodeFEAxyzrot]*(nels_U + 1) variable
/dports/devel/aws-c-mqtt/aws-c-mqtt-0.7.8/source/
H A Dtopic_tree.c403 size_t nodes_left = sub_parts_len; in s_topic_tree_action_commit() local
/dports/math/rocs/rocs-21.12.3/libgraphtheory/editorplugins/generategraph/
H A Dgenerategraphwidget.cpp658 void GenerateGraphWidget::generateCompleteBipartiteGraph(int nodes_left, int nodes_right) in generateCompleteBipartiteGraph()
/dports/www/squid/squid-4.15/lib/snmplib/
H A Dparse.c436 int bucket, nodes_left = 0; in build_tree() local
/dports/biology/hyphy/hyphy-2.5.33/src/new/
H A Dbgm.cpp603 _Matrix nodes_left (num_nodes, 1, false, true); in IsCyclic() local
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/opto/
H A Dloopopts.cpp1075 int nodes_left = C->max_node_limit() - C->live_nodes(); in merge_point_too_heavy() local

12