M_TRAILINGSPACE
if (M_TRAILINGSPACE(m) >= space) {
mbp->mb_mleft = M_TRAILINGSPACE(m);
mleft = M_TRAILINGSPACE(m);
mbp->mb_mleft = M_TRAILINGSPACE(m);
mbp->mb_mleft = M_TRAILINGSPACE(m);
KASSERT(M_TRAILINGSPACE(m) >= 0, ("overflowed mbuf %p", m));
m->m_len <= M_TRAILINGSPACE(mprev)) {
m->m_len <= M_TRAILINGSPACE(mprev)) {
if (m->m_pkthdr.len == m->m_len && M_TRAILINGSPACE(m) >= padlen) {
if (M_TRAILINGSPACE(last) < padlen) {
KKASSERT(M_TRAILINGSPACE(last) >= padlen);
if (m->m_next == NULL && (tlen = M_TRAILINGSPACE(m)) > 0) {
(tlen = M_TRAILINGSPACE(m)) > 0) {
space = M_TRAILINGSPACE(m);
if ((off == 0 || offp) && M_TRAILINGSPACE(n) >= tlen &&
m->m_len <= M_TRAILINGSPACE(tailm) &&
if (newlen - control->m_len > M_TRAILINGSPACE(control)) {
if (data_len > M_TRAILINGSPACE(m)) {
KKASSERT(data_len <= M_TRAILINGSPACE(n));
rval = LibAliasIn(priv->lib, c, m->m_len + M_TRAILINGSPACE(m));
rval = LibAliasOut(priv->lib, c, m->m_len + M_TRAILINGSPACE(m));
lenlim = M_TRAILINGSPACE(n);
ep = mtod(m, char *) + M_TRAILINGSPACE(m);
maxlen = M_TRAILINGSPACE(m);
if (8 - extra <= M_TRAILINGSPACE(m0)) {
maxhlen = M_TRAILINGSPACE(n) - maxlen;
if (elen >= M_TRAILINGSPACE(n)) {
if (mhist && M_TRAILINGSPACE(mhist) >= sizeof(nxt)) {
M_TRAILINGSPACE(mlast) >= sizeof(struct ip6_frag)) {
if (M_TRAILINGSPACE(mopt) < JUMBOOPTLEN) {
if (M_TRAILINGSPACE(m) < pad) { /* prepend to second */
if (M_TRAILINGSPACE(m) < pad) { /* prepend to second */
be = bp + M_TRAILINGSPACE(mp1);
be = bp + M_TRAILINGSPACE(mp1);
siz = min(M_TRAILINGSPACE(m), left);
siz = min(M_TRAILINGSPACE(m), left);
mlen = M_TRAILINGSPACE(mp);
mlen = M_TRAILINGSPACE(mp);
if (rem > M_TRAILINGSPACE(mp)) {
mlen = M_TRAILINGSPACE(mp);
mlen = M_TRAILINGSPACE(mp);
if (rem > M_TRAILINGSPACE(mp)) {
left = M_TRAILINGSPACE(m2);
if (M_TRAILINGSPACE(info.mb) == 0) {
i = min(siz, M_TRAILINGSPACE(info.mb));
if (M_TRAILINGSPACE(info.mb) == 0) {
i = min(siz, M_TRAILINGSPACE(info.mb));
if (bytes > M_TRAILINGSPACE(info->mb)) {
if (n <= M_TRAILINGSPACE(info->mb)) {
if (n <= M_TRAILINGSPACE(info->mb)) {