Lines Matching +full:un +full:- +full:padded

1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
33 #include <sys/un.h>
77 if (l->stats.gather) { in link_AddInOctets()
78 throughput_addin(&l->stats.total, n); in link_AddInOctets()
79 if (l->stats.parent) in link_AddInOctets()
80 throughput_addin(l->stats.parent, n); in link_AddInOctets()
87 if (l->stats.gather) { in link_AddOutOctets()
88 throughput_addout(&l->stats.total, n); in link_AddOutOctets()
89 if (l->stats.parent) in link_AddOutOctets()
90 throughput_addout(l->stats.parent, n); in link_AddOutOctets()
102 for (queue = l->Queue; queue < highest; queue++) in link_SequenceQueue()
103 while (queue->len) in link_SequenceQueue()
113 for (queue = l->Queue; queue <= highest; queue++) in link_DeleteQueue()
114 while (queue->top) in link_DeleteQueue()
125 len += l->Queue[i].len; in link_QueueLen()
139 len = l->Queue[i].len; in link_QueueBytes()
140 m = l->Queue[i].top; in link_QueueBytes()
141 while (len--) { in link_QueueBytes()
143 m = m->m_nextpkt; in link_QueueBytes()
161 * we've already async-encoded our data at this point, but the async in link_PendingLowPriorityData()
162 * encodings MUSTn't be a part of the LQR-reported payload :( So, we have in link_PendingLowPriorityData()
163 * the async layer record how much it's padded the packet in the mbuf's in link_PendingLowPriorityData()
170 for (queue = l->Queue; queue < highest; queue++) { in link_PendingLowPriorityData()
171 len = queue->len; in link_PendingLowPriorityData()
173 for (m = queue->top; len--; m = m->m_nextpkt) in link_PendingLowPriorityData()
174 *octets += m_length(m) - m->priv; in link_PendingLowPriorityData()
184 for (bp = NULL, pri = LINK_QUEUES(l) - 1; pri >= 0; pri--) in link_Dequeue()
185 if (l->Queue[pri].len) { in link_Dequeue()
186 bp = m_dequeue(l->Queue + pri); in link_Dequeue()
189 (u_long)l->Queue[pri].len); in link_Dequeue()
223 l->proto_in[i]++; in link_ProtocolRecord()
225 l->proto_out[i]++; in link_ProtocolRecord()
238 prompt_Printf(prompt, " %-9s: %8lu, %8lu", in link_ReportProtocolStatus()
239 ProtocolStat[i].name, l->proto_in[i], l->proto_out[i]); in link_ReportProtocolStatus()
263 bp->priv = 0; /* Adjusted by the async layer ! */ in link_PushPacket()
264 for (layer = l->nlayers; layer && bp; layer--) in link_PushPacket()
265 if (l->layer[layer - 1]->push != NULL) in link_PushPacket()
266 bp = (*l->layer[layer - 1]->push)(b, l, bp, pri, &proto); in link_PushPacket()
271 m_enqueue(l->Queue + pri, m_pullup(bp)); in link_PushPacket()
286 * bp->m_nextpkt. in link_PullPacket()
304 layer--; in link_PullPacket()
308 lbp[layer] = bp->m_nextpkt; in link_PullPacket()
309 bp->m_nextpkt = NULL; in link_PullPacket()
312 if (l->layer[layer]->pull != NULL) in link_PullPacket()
313 bp = (*l->layer[layer]->pull)(b, l, bp, &proto); in link_PullPacket()
315 if (layer == l->nlayers - 1) { in link_PullPacket()
318 next = bp->m_nextpkt; in link_PullPacket()
319 bp->m_nextpkt = NULL; in link_PullPacket()
334 if (l->nlayers == sizeof l->layer / sizeof l->layer[0]) { in link_Stack()
336 l->name, layer->name); in link_Stack()
339 l->layer[l->nlayers++] = layer; in link_Stack()
346 l->nlayers = 0; in link_EmptyStack()
390 lcp_SendProtoRej(&l->lcp, MBUF_CTOP(bp), bp->m_len); in Despatch()
392 p->hdlc.lqm.ifInDiscards++; in Despatch()
393 p->hdlc.stats.unknownproto++; in Despatch()
405 for (layer = l->nlayers; layer; layer--) in link_ShowLayers()
406 prompt_Printf(arg->prompt, "%s%s", layer == l->nlayers ? "" : ", ", in link_ShowLayers()
407 l->layer[layer - 1]->name); in link_ShowLayers()
408 if (l->nlayers) in link_ShowLayers()
409 prompt_Printf(arg->prompt, "\n"); in link_ShowLayers()