Home
last modified time | relevance | path

Searched refs:num_hops (Results 1 – 25 of 98) sorted by relevance

1234

/dports/misc/py-mxnet/incubator-mxnet-1.9.0/tests/python/unittest/
H A Dtest_dgl_graph.py29 def check_uniform(out, num_hops, max_num_vertices): argument
41 assert(data <= num_hops)
43 def check_non_uniform(out, num_hops, max_num_vertices): argument
58 assert(data <= num_hops)
82 check_uniform(out, num_hops=1, max_num_vertices=5)
91 check_uniform(out, num_hops=1, max_num_vertices=4)
100 check_uniform(out, num_hops=2, max_num_vertices=3)
109 check_uniform(out, num_hops=1, max_num_vertices=5)
118 check_uniform(out, num_hops=1, max_num_vertices=5)
127 check_uniform(out, num_hops=2, max_num_vertices=5)
[all …]
/dports/misc/mxnet/incubator-mxnet-1.9.0/tests/python/unittest/
H A Dtest_dgl_graph.py29 def check_uniform(out, num_hops, max_num_vertices): argument
41 assert(data <= num_hops)
43 def check_non_uniform(out, num_hops, max_num_vertices): argument
58 assert(data <= num_hops)
82 check_uniform(out, num_hops=1, max_num_vertices=5)
91 check_uniform(out, num_hops=1, max_num_vertices=4)
100 check_uniform(out, num_hops=2, max_num_vertices=3)
109 check_uniform(out, num_hops=1, max_num_vertices=5)
118 check_uniform(out, num_hops=1, max_num_vertices=5)
127 check_uniform(out, num_hops=2, max_num_vertices=5)
[all …]
/dports/net-p2p/c-lightning/lightning-0.10.2/common/
H A Droute.c80 size_t num_hops = tal_count(*hops); in dijkstra_to_hops() local
89 tal_resize(hops, num_hops + 1); in dijkstra_to_hops()
94 (*hops)[num_hops].direction = 0; in dijkstra_to_hops()
97 (*hops)[num_hops].direction = 1; in dijkstra_to_hops()
107 (*hops)[num_hops].style = ROUTE_HOP_TLV; in dijkstra_to_hops()
109 (*hops)[num_hops].style = ROUTE_HOP_LEGACY; in dijkstra_to_hops()
112 (*hops)[num_hops].blinding = NULL; in dijkstra_to_hops()
113 (*hops)[num_hops].enctlv = NULL; in dijkstra_to_hops()
118 (*hops)[num_hops].amount = *amount; in dijkstra_to_hops()
119 (*hops)[num_hops].delay = *cltv; in dijkstra_to_hops()
[all …]
H A Dsphinx.c391 int i, j, num_hops = tal_count(path->hops); in generate_hop_params() local
413 for (i = 1; i < num_hops; i++) { in generate_hop_params()
469 int num_hops = tal_count(sp->hops); in sphinx_prefill() local
471 sphinx_hop_size(&sp->hops[num_hops - 1]); in sphinx_prefill()
472 size_t last_hop_size = sphinx_hop_size(&sp->hops[num_hops - 1]); in sphinx_prefill()
498 int i, num_hops = tal_count(sp->hops); in create_onionpacket() local
500 sphinx_hop_size(&sp->hops[num_hops - 1]); in create_onionpacket()
506 struct secret *secrets = tal_arr(ctx, struct secret, num_hops); in create_onionpacket()
550 for (i = num_hops - 1; i >= 0; i--) { in create_onionpacket()
562 if (i == num_hops - 1) { in create_onionpacket()
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/
H A DMeshSetSequence.cpp438 for( ; num_hops && !lists[index].empty(); --num_hops) { in get_parent_child_meshsets()
511 int num_hops ) const in get_parents()
513 if (num_hops == 1) { in get_parents()
526 if (num_hops > 0) in get_parents()
537 if (num_hops == 1) { in get_children()
550 if (num_hops > 0) in get_children()
561 if (num_hops == 1 && contained.empty()) { in get_contained_sets()
565 if (num_hops > 0) in get_contained_sets()
576 if (num_hops == 1) { in num_parents()
593 if (num_hops == 1) { in num_children()
[all …]
H A DMeshSetSequence.hpp88 …eManager const* seqman, EntityHandle of, std::vector<EntityHandle>& parents, int num_hops ) const;
89 …eManager const* seqman, EntityHandle of, std::vector<EntityHandle>& children, int num_hops ) const;
90 …eManager const* seqman, EntityHandle of, std::vector<EntityHandle>& contents, int num_hops ) const;
91 …_parents ( SequenceManager const* seqman, EntityHandle of, int& number, int num_hops ) const;
92 …_children ( SequenceManager const* seqman, EntityHandle of, int& number, int num_hops ) const;
93 …_contained_sets( SequenceManager const* seqman, EntityHandle of, int& number, int num_hops ) const;
108 int num_hops, SearchType link_type ) const;
/dports/multimedia/libv4l/linux-5.13-rc2/drivers/thunderbolt/
H A Dpath.c109 size_t num_hops; in tb_path_discover() local
127 num_hops = 0; in tb_path_discover()
148 num_hops++; in tb_path_discover()
157 path->path_length = num_hops; in tb_path_discover()
160 path->hops = kcalloc(num_hops, sizeof(*path->hops), GFP_KERNEL); in tb_path_discover()
169 for (i = 0; i < num_hops; i++) { in tb_path_discover()
235 size_t num_hops; in tb_path_alloc() local
258 num_hops = i / 2; in tb_path_alloc()
269 for (i = 0; i < num_hops; i++) { in tb_path_alloc()
310 if (i == num_hops - 1) in tb_path_alloc()
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/drivers/thunderbolt/
H A Dpath.c109 size_t num_hops; in tb_path_discover() local
127 num_hops = 0; in tb_path_discover()
148 num_hops++; in tb_path_discover()
157 path->path_length = num_hops; in tb_path_discover()
160 path->hops = kcalloc(num_hops, sizeof(*path->hops), GFP_KERNEL); in tb_path_discover()
169 for (i = 0; i < num_hops; i++) { in tb_path_discover()
235 size_t num_hops; in tb_path_alloc() local
258 num_hops = i / 2; in tb_path_alloc()
269 for (i = 0; i < num_hops; i++) { in tb_path_alloc()
310 if (i == num_hops - 1) in tb_path_alloc()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/drivers/thunderbolt/
H A Dpath.c109 size_t num_hops; in tb_path_discover() local
127 num_hops = 0; in tb_path_discover()
148 num_hops++; in tb_path_discover()
157 path->path_length = num_hops; in tb_path_discover()
160 path->hops = kcalloc(num_hops, sizeof(*path->hops), GFP_KERNEL); in tb_path_discover()
169 for (i = 0; i < num_hops; i++) { in tb_path_discover()
235 size_t num_hops; in tb_path_alloc() local
258 num_hops = i / 2; in tb_path_alloc()
269 for (i = 0; i < num_hops; i++) { in tb_path_alloc()
310 if (i == num_hops - 1) in tb_path_alloc()
[all …]
/dports/games/openttd/openttd-12.1/src/linkgraph/
H A Drefresh.cpp163 …r *LinkRefresher::PredictNextOrder(const Order *cur, const Order *next, uint8 flags, uint num_hops) in PredictNextOrder() argument
177 this->vehicle->orders.list->GetOrderAt(next->GetConditionSkipToOrder()), num_hops); in PredictNextOrder()
178 if (skip_to != nullptr && num_hops < this->vehicle->orders.list->GetNumOrders()) { in PredictNextOrder()
184 branch.RefreshLinks(cur, skip_to, flags, num_hops + 1); in PredictNextOrder()
191 this->vehicle->orders.list->GetNext(next), num_hops++); in PredictNextOrder()
265 void LinkRefresher::RefreshLinks(const Order *cur, const Order *next, uint8 flags, uint num_hops) in RefreshLinks() argument
278 this->RefreshLinks(cur, next, flags, num_hops); in RefreshLinks()
294 next = this->PredictNextOrder(cur, next, flags, num_hops); in RefreshLinks()
H A Drefresh.h96 const Order *PredictNextOrder(const Order *cur, const Order *next, uint8 flags, uint num_hops = 0);
98 void RefreshLinks(const Order *cur, const Order *next, uint8 flags, uint num_hops = 0);
/dports/finance/electrum/Electrum-4.1.5/electrum/
H A Dlnonion.py214 num_hops = len(payment_path_pubkeys)
215 hop_shared_secrets = num_hops * [b'']
218 for i in range(0, num_hops):
231 num_hops = len(payment_path_pubkeys)
232 assert num_hops == len(hops_data)
245 for i in range(num_hops-1, -1, -1):
254 if i == num_hops - 1 and len(filler) != 0:
319 num_hops = len(hops_data)
327 for i in range(0, num_hops-1): # -1, as last hop does not obfuscate
481 num_hops = len(payment_path_pubkeys)
[all …]
H A Dtrampoline.py229 num_hops = len(payment_path_pubkeys)
230 for i in range(num_hops):
234 if i < num_hops - 1:
240 if i == num_hops - 1:
246 if i == num_hops - 2 and route_edge.invoice_features:
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/moab/
H A DInterface.hpp1817 const int num_hops = 1) const = 0;
1829 const int num_hops = 1) const = 0;
1841 const int num_hops = 1) const = 0;
1853 const int num_hops = 1) const = 0;
1868 const int num_hops = 1) const = 0;
1883 const int num_hops = 1) const = 0;
1892 const int num_hops = 1) const = 0;
1901 const int num_hops = 1) const = 0;
1913 const int num_hops = 1) const = 0;
H A DCore.hpp1027 const int num_hops = 1) const;
1032 const int num_hops = 1) const;
1037 const int num_hops = 1) const;
1042 const int num_hops = 1) const;
1047 const int num_hops = 1) const;
1052 const int num_hops = 1) const;
1057 const int num_hops = 1) const;
1062 const int num_hops = 1) const;
1067 const int num_hops = 1) const;
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/examples/old/itaps/
H A DListSetsNTagsF90.F9031 integer i, j, num_hops, num_commands, tname_len
77 num_hops = 1
78 call iMesh_getEntSets(%VAL(mesh), %VAL(root_set), %VAL(num_hops), &
/dports/comms/uhd/uhd-90ce6062b6b5df2eddeee723777be85108e4e7c7/fpga/usrp3/lib/rfnoc/sim/chdr_stream_endpoint_tb/
H A Dchdr_stream_endpoint_tb.sv418 tx_mgmt_pl.header.num_hops = 3;
438 `ASSERT_ERROR(rx_mgmt_pl.header.num_hops == 1,
699 tx_mgmt_pl.header.num_hops = 2;
723 tx_mgmt_pl.header.num_hops = 3;
750 tx_mgmt_pl.header.num_hops = 3;
789 tx_mgmt_pl.header.num_hops = 2;
828 tx_mgmt_pl.header.num_hops = 3;
890 tx_mgmt_pl.header.num_hops = 3;
924 tx_mgmt_pl.header.num_hops = 3;
1190 tx_mgmt_pl.header.num_hops = 3;
[all …]
/dports/net/lft/lft-3.91/
H A Dlft_icmptrace.c331 …if((!sess->num_hops || sess->hop_info_length < sess->num_hops || need_reply) && sess->hop_info_len… in icmp_check_timeouts()
343 if(sess->num_hops > 0 && sess->hop_info_length >= sess->num_hops) in icmp_check_timeouts()
582 tp->hopno=sess->num_hops+1; in icmp_recv_packet()
591 if(!sess->num_hops) in icmp_recv_packet()
593 sess->num_hops = tp->hopno; in icmp_recv_packet()
594 if(!sess->num_hops) in icmp_recv_packet()
595 sess->num_hops=1; in icmp_recv_packet()
842 if(sess->num_hops) in icmp_finish()
844 maxhop = sess->num_hops; in icmp_finish()
1061 …nfo[hopno].flags & HF_ENDPOINT) && (noreply >= ((maxhop - sess->ttl_min)/2)) && sess->num_hops > 3) in icmp_finish()
[all …]
H A Dlft_btcptrace.c388 if (icmp_type != -2 && (!sess->num_hops || sess->num_hops > tp->hopno)) in tcp_base_recv_packet()
392 sess->num_hops = tp->hopno; in tcp_base_recv_packet()
469 if (sess->num_hops) { in tcp_base_finish()
470 maxhop = sess->num_hops; in tcp_base_finish()
659 …YN_ACK) && (sess->hop_info[hopno+1].state == HS_SEND_SYN_ACK) && (hopno == (sess->num_hops - 1))) { in tcp_base_finish()
667 …o[hopno].flags & HF_ENDPOINT) && (noreply >= ((maxhop - sess->ttl_min)/2)) && sess->num_hops > 3) { in tcp_base_finish()
791 if (!sess->num_hops) { in tcp_base_finish()
892 …if ((!sess->num_hops || sess->hop_info_length < sess->num_hops || need_reply) && sess->hop_info_le… in tcp_base_check_timeouts()
903 if (sess->num_hops > 0 && sess->hop_info_length >= sess->num_hops) { in tcp_base_check_timeouts()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/itaps/imesh/
H A DiMesh.h936 const int num_hops,
957 const int num_hops,
1216 const int num_hops,
1237 const int num_hops,
1258 const int num_hops,
1283 const int num_hops,
/dports/net/py-ripe.atlas.sagan/ripe.atlas.sagan-1.3.0/ripe/atlas/sagan/
H A Dtraceroute.py224 num_hops = len(hops)
233 if index + 1 == num_hops:
247 self.total_hops = num_hops
/dports/net-p2p/c-lightning/lightning-0.10.2/devtools/
H A Donion.c26 int num_hops = argc - 2; in do_generate() local
27 struct pubkey *path = tal_arr(ctx, struct pubkey, num_hops); in do_generate()
41 for (int i = 0; i < num_hops; i++) { in do_generate()
79 if (i == num_hops - 1) in do_generate()
/dports/comms/uhd/uhd-90ce6062b6b5df2eddeee723777be85108e4e7c7/fpga/usrp3/lib/rfnoc/core/
H A Drfnoc_chdr_internal_utils.vh405 input [9:0] num_hops, port
408 chdr_mgmt_build_hdr = {proto_ver, chdr_w, 19'h0, num_hops, src_epid};
/dports/devel/boost-docs/boost_1_72_0/libs/asio/example/cpp11/executors/
H A Dactor.cpp261 const int num_hops = 50000000; in main() local
263 const int token_value = (num_hops + num_actors - 1) / num_actors; in main()
/dports/devel/boost-python-libs/boost_1_72_0/libs/asio/example/cpp11/executors/
H A Dactor.cpp261 const int num_hops = 50000000; in main() local
263 const int token_value = (num_hops + num_actors - 1) / num_actors; in main()

1234