Searched refs:route (Results 1 - 18 of 18) sorted by relevance

/barrelfish-master/usr/pci/
H A Dht_config.c23 static void route(unsigned int rt) function
70 printf("To Node %d: Request ", i); route(node.rqrte);
71 printf(", Response "); route(node.rprte);
72 printf(", Broadcast "); route(node.bcrte);
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/core/
H A Dcma.c312 id_priv->id.route.addr.dev_addr.transport =
351 ib_addr_get_mgid(&id_priv->id.route.addr.dev_addr, &rec.mgid);
366 struct rdma_dev_addr *dev_addr = &id_priv->id.route.addr.dev_addr;
609 struct rdma_dev_addr *dev_addr = &id_priv->id.route.addr.dev_addr;
838 rdma_addr_cancel(&id_priv->id.route.addr.dev_addr);
844 if (cma_any_addr((struct sockaddr *) &id_priv->id.route.addr.src_addr)
930 kfree(id_priv->id.route.path_rec);
1080 cma_save_net_info(&id->route.addr, &listen_id->route.addr,
1083 rt = &id->route;
1606 struct rdma_route *route; local
1715 struct rdma_route *route = &id_priv->id.route; local
1796 struct rdma_route *route = &id_priv->id.route; local
[all...]
H A Ducma.c559 struct rdma_route *route)
563 resp->num_paths = route->num_paths;
564 switch (route->num_paths) {
566 dev_addr = &route->addr.dev_addr;
575 &route->path_rec[1]);
579 &route->path_rec[0]);
587 struct rdma_route *route)
593 resp->num_paths = route->num_paths;
594 switch (route->num_paths) {
596 dev_addr = &route
558 ucma_copy_ib_route(struct rdma_ucm_query_route_resp *resp, struct rdma_route *route) argument
586 ucma_copy_iboe_route(struct rdma_ucm_query_route_resp *resp, struct rdma_route *route) argument
[all...]
H A Daddr.c42 #include <net/route.h>
425 * Make sure the route exists and has a valid link.
434 * If it's not multicast or broadcast and the route doesn't match the
436 * correct interface pointer and unlock the route.
/barrelfish-master/usr/skb/programs/
H A Droute_tree_radix.pl57 append(SubRoutesF, [route(Root,FE, Neighbours)],CurrRoutes).
107 R = route(El, Reach, Neighbours)
115 % to use: eclipse -b route_tree_radix.pl -e 'route_demo(4,16)' | dot -Tpdf -o route.pdf
H A Ddecoding_net2.pl442 % TODO: Resolve on regions should work like route.
838 route(N1Region, ResRegion, R1),
839 route(N2Region, ResRegion, R2),
856 route(N1Region, ResRegion, R1),
857 route(N2Region, ResRegion, R2),
1020 % Internal function for region route
1040 % block this should be ensured by the block splitting of the region route
1051 route(SrcRegion, DstRegion, Route) :-
1068 route(NextRegion, DstRegion, R2),
1083 route(
[all...]
H A Ddecoding_net3_multid.pl1153 route(N1Region, ResRegion, R1),
1154 route(N2Region, ResRegion, R2),
1171 route(N1Region, ResRegion, R1),
1172 route(N2Region, ResRegion, R2),
1335 % Internal function for region route
1355 % block this should be ensured by the block splitting of the region route
1366 route(SrcRegion, DstRegion, Route) :-
1383 route(NextRegion, DstRegion, R2),
1398 route(
1411 route(
[all...]
H A Dirq_routing_new.pl91 % route(100, nullMsg, Port, Msg, Li), term_variables(Li,List), labeling(List).
94 % Port=3, route(100, nullMsg, Port, Msg, Li), term_variables(Li,List), labeling(List).
96 % Example 3: Calculate, install and print the route
99 % Example 4: Remove the route installed in Ex3
358 % Try to find a route (without installing the mapping) between InPort and OutPort and OutMsg
359 route(InPort, InMsg, OutPort, OutMsg, List) :-
371 route(X, NOutMsg, OutPort, OutMsg, NList),
388 % effectively installing the route. Also assert int_dest_used for the
396 % Removes a route. The opposite of add_route. To
397 % get a route, us
[all...]
H A Ddecoding_net3.pl1231 route(N1Region, ResRegion, R1),
1232 route(N2Region, ResRegion, R2),
1249 route(N1Region, ResRegion, R1),
1250 route(N2Region, ResRegion, R2),
1413 % Internal function for region route
1457 retract(node_translate_dyn(MMU_IN_ID,_,_,_)), % Make sure there is no route
1463 route(SrcName, DstName, Route),
1473 retract(node_translate_dyn(MMU_IN_ID,_,_,_)), % Make sure there is no route
1491 route(
1506 route(
[all...]
/barrelfish-master/lib/devif/backends/net/mlx4/include/rdma/
H A Drdma_cm.h132 struct rdma_route route; member in struct:rdma_cm_id
186 * into route information needed to establish a connection.
240 * Users must have resolved a route for the rdma_cm_id to connect with
327 * performing route resolution, as existing communication on the
/barrelfish-master/lib/libc/net/
H A Dgetifmaddrs.c37 #include <net/route.h>
H A Dgetifaddrs.c42 #include <net/route.h>
/barrelfish-master/lib/int_route/client/
H A Dclient.c53 msgerr = cl->rpc_tx_vtbl.route(cl, intsrc, irq_idx, intdest, &err);
169 /* add route from int_src_cap to irq_dest_cap */
/barrelfish-master/include/net/
H A Dethernet.h169 #define ETHERTYPE_DECnet 0x6003 /* DEC DECNET Phase IV route */
391 struct route;
402 const struct sockaddr *, struct route *);
/barrelfish-master/doc/006-routing/
H A DRouting.tex62 two or more cores do not have access to the same region of memory. In such cases to communication these cores will have to route via another set of cores if such a path exists.
69 such environments, without having to worry about the concrete path a message takes from one core to another. The routing layer will properly route messages in a transparent way.
119 The optimal route and ordering of messages is machine dependent.
123 selecting the optimal route based on the machine type.
262 \item \textbf{Ring}: We route over all cores of a system. Core $i$ forwards a request to core $i+1$ mod num\_cores.
264 \item \textbf{Fat tree}: We route directly between the cores that are located on the same CPU socket. On each socket, we choose a ''leader'' and route directly between all leaders. A set-up request for a core on a different socket is always forwarded over the local leader to the leader on that socket.
546 \subsection{Multihop route}
550 \caption{Example multihop route}\label{fig:many-to-many}
597 The essential idea is that when a route i
[all...]
/barrelfish-master/doc/000-overview/
H A DOverview.tex570 \item Monitors route inter-core bind requests for communication
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex372 This route creates the data structures for the flow analysis.
1409 The example builds all pairs of sources and sink nodes for flows and creates contribution structures from them. An additional accumulator $NoPath$ is used to collect cases where there is no route between the nodes.
/barrelfish-master/usr/eclipseclp/documents/intro_paper/
H A Declipse.tex108 is to find the shortest route which

Completed in 219 milliseconds