Searched refs:transports (Results 1 - 12 of 12) sorted by relevance

/linux-master/net/rds/
H A Dtransport.c47 static struct rds_transport *transports[RDS_TRANS_COUNT]; variable in typeref:struct:rds_transport
56 if (transports[trans->t_type])
60 transports[trans->t_type] = trans;
72 transports[trans->t_type] = NULL;
102 trans = transports[i];
121 trans = transports[t_type];
127 trans = transports[t_type];
157 trans = transports[i];
/linux-master/net/sctp/
H A Dassociola.c376 transport = list_entry(pos, struct sctp_transport, transports);
498 list_del_rcu(&peer->transports);
504 transport = list_entry(pos, struct sctp_transport, transports);
606 /* An UNKNOWN state is only set on transports added by
607 * user in sctp_connectx() call. Such transports should be
719 list_add_tail_rcu(&peer->transports, &asoc->peer.transport_addr_list);
747 transport = list_entry(pos, struct sctp_transport, transports);
763 /* Cycle through all transports searching for a peer address. */
766 transports) {
774 /* Remove all transports excep
[all...]
H A Dproc.c121 transports) {
315 transports) {
H A Doutqueue.c214 transports) {
438 transports) {
791 /* These transports have chunks to send. */
814 * transports created.
860 /* Are we switching transports? Take care of transport locks. */
872 /* We've switched transports, so apply the
1000 /* Switch transports & prepare the packet. */
1269 list_for_each_entry(transport, transport_list, transports)
1304 transports) {
1337 list_for_each_entry(transport, transport_list, transports) {
[all...]
H A Dsm_sideeffect.c724 list_for_each_entry(t, &asoc->peer.transport_addr_list, transports)
736 transports) {
749 transports) {
1015 * transports.
1024 t = list_entry(pos, struct sctp_transport, transports);
1579 * all transports have been tried at the current
1594 * all transports have been tried at the current
1605 transports) {
1632 transports) {
H A Dsocket.c176 list_for_each_entry(t, &asoc->peer.transport_addr_list, transports)
644 &asoc->peer.transport_addr_list, transports) {
889 /* Update the route and saddr entries for all the transports
894 transports) {
2576 transports) {
2601 transports) {
2686 transports) {
2726 transports) {
3166 transports) {
3873 * transports i
[all...]
H A Ddiag.c108 transports) {
347 /* find the ep only once through the transports by this condition */
H A Dsm_make_chunk.c836 * generation is, if its 0, reset the transports to 0, and reset
845 transports)
2426 /* Walk list of transports, removing transports in the UNKNOWN state. */
2428 transport = list_entry(pos, struct sctp_transport, transports);
2476 transports) {
2519 transport = list_entry(pos, struct sctp_transport, transports);
3379 transports) {
3393 transports) {
H A Dtransport.c73 INIT_LIST_HEAD(&peer->transports);
H A Dsm_statefuns.c1377 list_for_each_entry(addr, list, transports) {
1408 transports) {
/linux-master/arch/um/drivers/
H A Dnet_kern.c542 static LIST_HEAD(transports);
583 list_add(&new->list, &transports);
609 list_for_each(ele, &transports) {
/linux-master/include/net/sctp/
H A Dstructs.h115 /* This is the hash of all transports. */
772 /* A list of transports. */
773 struct list_head transports; member in struct:sctp_transport
876 * transport? We use this to check for idle transports
952 /* This is the list of transports that have chunks to send. */
1811 * will be inherited by all new transports.
1818 /* This is the max_retrans value for new transports in the

Completed in 213 milliseconds