Lines Matching defs:channels
9 * It talks to PPP `channels' via the interface defined in
113 * It can have 0 or more ppp channels connected to it.
118 struct list_head channels; /* list of attached channels 4c */
119 int n_channels; /* how many channels are attached 54 */
179 struct list_head clist; /* link in list of channels per unit */
198 * Both the ppp.rlock and ppp.wlock locks protect the ppp.channels
222 /* channels */
245 * depend on the number of channels and their characteristics.
450 * channels connected, unless it is looping
617 * When two channels are bridged, ppp_input on one channel is redirected to
619 * In order to safely bridge channels we must reject channels which are already
1237 INIT_LIST_HEAD(&ppp->channels);
1590 if (list_empty(&ppp->channels))
1593 pch = list_first_entry(&ppp->channels, struct channel, clist);
1868 list = &ppp->channels;
1931 nfree = 0; /* # channels which have no packet already queued */
1932 navail = 0; /* total # of usable channels (not deregistered) */
1933 nzero = 0; /* number of channels with zero speed associated*/
1934 totfree = 0; /*total # of channels available and
1940 list_for_each_entry(pch, &ppp->channels, clist) {
1967 * the channels are free. This gives much better TCP
1968 * performance if we have a lot of channels.
1986 list = &ppp->channels;
1989 if (list == &ppp->channels) {
1999 if (list == &ppp->channels) {
2010 * we haven't given a fragment to all of the free channels.
2040 *the packet evenly among the free channels;
2072 *it is not worth to tx on slow channels:
2642 * Reevaluate minseq, the minimum over all channels of the
2646 * The list of channels can't change because we have the receive
2649 list_for_each_entry(ch, &ppp->channels, clist) {
3303 * Stuff for handling the lists of ppp units and channels
3365 * there are no channels connected to the unit and no file structs
3424 * when we have a lot of channels in use.
3472 /* Don't connect unregistered channels */
3484 list_add_tail(&pch->clist, &ppp->channels);