Home
last modified time | relevance | path

Searched refs:num_branches (Results 1 – 25 of 142) sorted by relevance

123456

/dports/devel/volk/volk-2.2.1/kernels/volk/
H A Dvolk_8u_x2_encodeframepolar_8u.h50 for(branch = 0; branch < num_branches; ++branch){ in encodepolar_single_stage()
69 unsigned int num_branches = 1; in volk_8u_x2_encodeframepolar_8u_generic() local
77 num_branches = num_branches << 1; in volk_8u_x2_encodeframepolar_8u_generic()
98 unsigned int num_branches = 1; in volk_8u_x2_encodeframepolar_8u_u_ssse3() local
146 num_branches = num_branches << 1; in volk_8u_x2_encodeframepolar_8u_u_ssse3()
215 unsigned int num_branches = 1; in volk_8u_x2_encodeframepolar_8u_u_avx2() local
296 num_branches = num_branches << 1; in volk_8u_x2_encodeframepolar_8u_u_avx2()
374 unsigned int num_branches = 1; in volk_8u_x2_encodeframepolar_8u_a_ssse3() local
422 num_branches = num_branches << 1; in volk_8u_x2_encodeframepolar_8u_a_ssse3()
490 unsigned int num_branches = 1; in volk_8u_x2_encodeframepolar_8u_a_avx2() local
[all …]
/dports/comms/uhd/uhd-90ce6062b6b5df2eddeee723777be85108e4e7c7/host/lib/rfnoc/
H A Dsplit_stream_block_control.cpp28 const size_t num_branches = num_output_ports / num_input_ports; in RFNOC_BLOCK_CONSTRUCTOR() local
29 UHD_ASSERT_THROW((num_output_ports % num_input_ports == 0) && (num_branches > 1)); in RFNOC_BLOCK_CONSTRUCTOR()
33 auto calculate_output_port = [num_input_ports, num_branches]( in RFNOC_BLOCK_CONSTRUCTOR()
35 UHD_ASSERT_THROW(branch < num_branches); in RFNOC_BLOCK_CONSTRUCTOR()
56 for (size_t branch = 0; branch < num_branches; branch++) { in RFNOC_BLOCK_CONSTRUCTOR()
63 for (size_t branch_a = 0; branch_a < num_branches; branch_a++) { in RFNOC_BLOCK_CONSTRUCTOR()
70 for (size_t branch_b = 0; branch_b < num_branches; branch_b++) { in RFNOC_BLOCK_CONSTRUCTOR()
95 for (size_t branch = 0; branch < num_branches; branch++) { in RFNOC_BLOCK_CONSTRUCTOR()
/dports/math/fxt/fxt/src/comb/
H A Dordered-tree-branches.h64 ulong num_branches() const { return m_; } in num_branches() function
104 if ( ! is_composition_nz(length_data(), num_branches(), n_) ) return false; in OK()
109 for (ulong j=2; j<=num_branches(); ++j) in OK()
117 print_vec(bla, length_data(), num_branches(), false); in print()
119 print_vec(bla, height_data(), num_branches(), false); in print()
H A Dordered-tree-branches.cc17 for (ulong j=1; j<=num_branches(); ++j) in print_level_seq()
29 for (ulong j=1; j<=num_branches(); ++j) in print_aa()
/dports/graphics/blender/blender-2.91.0/intern/cycles/kernel/
H A Dkernel_random.h225 int num_branches, in path_branched_rng_1D() argument
230 state->sample * num_branches + branch, in path_branched_rng_1D()
231 state->num_samples * num_branches, in path_branched_rng_1D()
239 int num_branches, in path_branched_rng_2D() argument
246 state->sample * num_branches + branch, in path_branched_rng_2D()
247 state->num_samples * num_branches, in path_branched_rng_2D()
269 int num_branches) in path_branched_rng_light_termination() argument
272 return path_branched_rng_1D(kg, rng_hash, state, branch, num_branches, PRNG_LIGHT_TERMINATE); in path_branched_rng_light_termination()
H A Dkernel_path_state.h265 int num_branches) in path_state_branch() argument
267 if (num_branches > 1) { in path_state_branch()
270 state->sample = state->sample * num_branches + branch; in path_state_branch()
271 state->num_samples = state->num_samples * num_branches; in path_state_branch()
272 state->branch_factor *= num_branches; in path_state_branch()
/dports/comms/uhd/uhd-90ce6062b6b5df2eddeee723777be85108e4e7c7/host/tests/rfnoc_block_tests/
H A Dsplit_stream_block_test.cpp110 const size_t num_branches = num_outputs / num_inputs; in BOOST_FIXTURE_TEST_CASE() local
117 for (size_t branch = 0; branch < num_branches; branch++) { in BOOST_FIXTURE_TEST_CASE()
129 for (size_t branch = 0; branch < num_branches; branch++) { in BOOST_FIXTURE_TEST_CASE()
143 for (size_t branch = 0; branch < num_branches; branch++) { in BOOST_FIXTURE_TEST_CASE()
153 for (size_t other_branch = 0; other_branch < num_branches; in BOOST_FIXTURE_TEST_CASE()
175 for (size_t branch = 0; branch < num_branches; branch++) { in BOOST_FIXTURE_TEST_CASE()
189 for (size_t branch = 0; branch < num_branches; branch++) { in BOOST_FIXTURE_TEST_CASE()
/dports/misc/py-gluoncv/gluon-cv-0.9.0/gluoncv/model_zoo/
H A Dhrnet.py140 self.num_branches = num_branches
146 num_branches, blocks, num_blocks, num_channels)
169 for i in range(num_branches):
176 if self.num_branches == 1:
179 num_branches = self.num_branches
184 for j in range(num_branches):
221 if self.num_branches == 1:
227 for i in range(1, self.num_branches):
233 for j in range(1, self.num_branches):
376 num_branches = len(num_blocks)
[all …]
/dports/cad/py-lcapy/lcapy-23c940f/lcapy/
H A Dmna.py120 num_branches = len(self.unknown_branch_currents)
123 self._B = sym.zeros(num_nodes, num_branches)
124 self._C = sym.zeros(num_branches, num_nodes)
125 self._D = sym.zeros(num_branches, num_branches)
128 self._Es = sym.zeros(num_branches, 1)
/dports/math/flann/flann-1.9.1-29-g1d04523/src/python/pyflann/
H A Dindex.py369 def hierarchical_kmeans(self, pts, branch_size, num_branches, argument
396 if int(num_branches) != num_branches or num_branches < 1:
399 num_branches = int(num_branches)
409 num_clusters = (branch_size - 1) * num_branches + 1
/dports/finance/frontaccounting/frontaccounting/sales/manage/
H A Dcustomer_branches.php171 global $Mode, $num_branches;
214 if(!$num_branches) {
284 $num_branches = db_customer_has_branches($_POST['customer_id']); variable
289 if ($num_branches)
/dports/math/fxt/fxt/demo/comb/
H A Dordered-tree-branches-demo.cc49 ulong m = T.num_branches(); in main()
54 if ( ! is_sorted( T.length_data(), T.num_branches() ) ) continue; // A246565 in main()
/dports/math/z3/z3-z3-4.8.13/src/qe/
H A Dqe_datatype_plugin.cpp454 bool get_num_branches( contains_app& x, expr* fml, rational& num_branches) override { in get_num_branches() argument
458 return get_num_branches_rec(x, fml, num_branches); in get_num_branches()
461 return get_num_branches_nonrec(x, fml, num_branches); in get_num_branches()
584 bool get_num_branches_rec( contains_app& x, expr* fml, rational& num_branches) { in get_num_branches_rec() argument
590 num_branches = rational(sz); in get_num_branches_rec()
603 num_branches = rational(1); in get_num_branches_rec()
612 num_branches = rational(eqs.num_eqs() + 1); in get_num_branches_rec()
747 bool get_num_branches_nonrec( contains_app& x, expr* fml, rational& num_branches) { in get_num_branches_nonrec() argument
750 num_branches = rational(sz); in get_num_branches_nonrec()
755 num_branches = rational(1); in get_num_branches_nonrec()
H A Dqe_dl_plugin.cpp68 bool get_num_branches(contains_app & x,expr * fml,rational & num_branches) override { in get_num_branches() argument
75 num_branches = rational(domain_size, rational::ui64()); in get_num_branches()
78 num_branches = rational(eqs.num_eqs() + 1); in get_num_branches()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/qe/
H A Dqe_datatype_plugin.cpp454 bool get_num_branches( contains_app& x, expr* fml, rational& num_branches) override { in get_num_branches() argument
458 return get_num_branches_rec(x, fml, num_branches); in get_num_branches()
461 return get_num_branches_nonrec(x, fml, num_branches); in get_num_branches()
584 bool get_num_branches_rec( contains_app& x, expr* fml, rational& num_branches) { in get_num_branches_rec() argument
590 num_branches = rational(sz); in get_num_branches_rec()
603 num_branches = rational(1); in get_num_branches_rec()
612 num_branches = rational(eqs.num_eqs() + 1); in get_num_branches_rec()
747 bool get_num_branches_nonrec( contains_app& x, expr* fml, rational& num_branches) { in get_num_branches_nonrec() argument
750 num_branches = rational(sz); in get_num_branches_nonrec()
755 num_branches = rational(1); in get_num_branches_nonrec()
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/net/ethernet/apm/xgene/
H A Dxgene_enet_cle.c85 for (i = 0; i < dn->num_branches; i++) { in xgene_cle_dn_to_hw()
206 .num_branches = 2,
242 .num_branches = 3,
290 .num_branches = 6,
375 .num_branches = 6,
460 .num_branches = 6,
546 .num_branches = 1,
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/net/ethernet/apm/xgene/
H A Dxgene_enet_cle.c85 for (i = 0; i < dn->num_branches; i++) { in xgene_cle_dn_to_hw()
206 .num_branches = 2,
242 .num_branches = 3,
290 .num_branches = 6,
375 .num_branches = 6,
460 .num_branches = 6,
546 .num_branches = 1,
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/net/ethernet/apm/xgene/
H A Dxgene_enet_cle.c85 for (i = 0; i < dn->num_branches; i++) { in xgene_cle_dn_to_hw()
206 .num_branches = 2,
242 .num_branches = 3,
290 .num_branches = 6,
375 .num_branches = 6,
460 .num_branches = 6,
546 .num_branches = 1,
/dports/devel/avro-c/avro-c-1.11.0/src/
H A Dresolver.c239 size_t num_branches = avro_schema_union_size(rschema); \
242 for (i = 0; i < num_branches; i++) { \
1158 size_t num_branches = avro_schema_union_size(wschema); in try_union() local
1159 debug("Checking %" PRIsz "-branch writer union schema", num_branches); in try_union()
1165 (avro_consumer_t **) avro_calloc(num_branches, sizeof(avro_consumer_t *)); in try_union()
1169 for (i = 0; i < num_branches; i++) { in try_union()
1208 resolver->num_children = num_branches; in try_union()
1221 for (i = 0; i < num_branches; i++) { in try_union()
1227 avro_free(child_resolvers, num_branches * sizeof(avro_consumer_t *)); in try_union()
/dports/sysutils/fluent-bit/fluent-bit-1.8.11/lib/avro/src/
H A Dresolver.c239 size_t num_branches = avro_schema_union_size(rschema); \
242 for (i = 0; i < num_branches; i++) { \
1158 size_t num_branches = avro_schema_union_size(wschema); in try_union() local
1159 debug("Checking %" PRIsz "-branch writer union schema", num_branches); in try_union()
1165 (avro_consumer_t **) avro_calloc(num_branches, sizeof(avro_consumer_t *)); in try_union()
1169 for (i = 0; i < num_branches; i++) { in try_union()
1208 resolver->num_children = num_branches; in try_union()
1221 for (i = 0; i < num_branches; i++) { in try_union()
1227 avro_free(child_resolvers, num_branches * sizeof(avro_consumer_t *)); in try_union()
/dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/
H A Dprofile.c278 int num_branches; in compute_branch_probabilities() local
493 num_branches = 0; in compute_branch_probabilities()
568 num_branches++; in compute_branch_probabilities()
615 num_branches++, num_never_executed; in compute_branch_probabilities()
622 fprintf (dump_file, "%d branches\n", num_branches); in compute_branch_probabilities()
625 if (num_branches) in compute_branch_probabilities()
628 (hist_br_prob[i] + hist_br_prob[19-i]) * 100 / num_branches, in compute_branch_probabilities()
631 total_num_branches += num_branches; in compute_branch_probabilities()
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dprofile.c531 int num_branches; in compute_branch_probabilities() local
732 num_branches = 0; in compute_branch_probabilities()
793 num_branches++; in compute_branch_probabilities()
825 num_branches++; in compute_branch_probabilities()
834 fprintf (dump_file, "%d branches\n", num_branches); in compute_branch_probabilities()
835 if (num_branches) in compute_branch_probabilities()
838 (hist_br_prob[i] + hist_br_prob[19-i]) * 100 / num_branches, in compute_branch_probabilities()
841 total_num_branches += num_branches; in compute_branch_probabilities()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dprofile.c530 int num_branches; in compute_branch_probabilities() local
731 num_branches = 0; in compute_branch_probabilities()
792 num_branches++; in compute_branch_probabilities()
824 num_branches++; in compute_branch_probabilities()
833 fprintf (dump_file, "%d branches\n", num_branches); in compute_branch_probabilities()
834 if (num_branches) in compute_branch_probabilities()
837 (hist_br_prob[i] + hist_br_prob[19-i]) * 100 / num_branches, in compute_branch_probabilities()
840 total_num_branches += num_branches; in compute_branch_probabilities()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dprofile.c531 int num_branches; in compute_branch_probabilities() local
732 num_branches = 0; in compute_branch_probabilities()
793 num_branches++; in compute_branch_probabilities()
825 num_branches++; in compute_branch_probabilities()
834 fprintf (dump_file, "%d branches\n", num_branches); in compute_branch_probabilities()
835 if (num_branches) in compute_branch_probabilities()
838 (hist_br_prob[i] + hist_br_prob[19-i]) * 100 / num_branches, in compute_branch_probabilities()
841 total_num_branches += num_branches; in compute_branch_probabilities()
/dports/math/py-or-tools/or-tools-9.2/ortools/bop/
H A Dbop_ls.cc524 int32_t num_branches = 0;
534 ++num_branches;
535 if (num_branches >= selected_num_branches) break;
540 if (num_branches == 0) continue;
541 if (num_branches < selected_num_branches) { in init_wimax_globals()
543 selected_num_branches = num_branches; in init_wimax_globals()
544 if (num_branches == 1) break; in init_wimax_globals()

123456