M_EXT
md->m_flags |= M_EXT;
if((m2->m_flags & M_EXT) != 0) {
m_new->m_flags |= M_EXT;
m_new->m_flags |= M_EXT;
m->m_flags |= M_EXT;
m_new->m_flags |= M_EXT;
if((m->m_flags & M_EXT) == 0) {
if ((m->m_flags & M_EXT) == 0) {
if (!(m_new->m_flags & M_EXT)) {
if (!(m_new->m_flags & M_EXT)) {
m->m_flags |= M_EXT;
m_new->m_flags |= M_EXT;
if (!(m_new->m_flags & M_EXT)) {
m->m_flags |= M_EXT;
if (!(m_new->m_flags & M_EXT)) {
if (!(m->m_flags & M_EXT)) {
if (!(m_new->m_flags & M_EXT)) {
m_new->m_flags |= M_EXT;
if (!(m_new->m_flags & M_EXT)) {
if ((m->m_flags & M_EXT) == 0) {
if (!(m_new->m_flags & M_EXT)) {
if ((mn->m_flags & M_EXT) == 0) {
m_new->m_flags |= M_EXT;
KKASSERT(m->m_flags & M_EXT);
if ((sd->sd_mbuf->m_flags & M_EXT) == 0) {
if (!(mnew->m_flags & M_EXT)) {
if ((sd->sd_mbuf->m_flags & M_EXT) == 0)
if ((m_new->m_flags & M_EXT) == 0) {
m_new->m_flags |= M_EXT;
if ((mbp->m_flags & M_EXT) == 0) {
KKASSERT((m->m_flags & M_EXT) == 0);
m->m_flags &= (M_EXT | M_EXT_CLUSTER | M_CLCACHE | M_PHCACHE);
switch (m->m_flags & (M_CLCACHE | M_EXT | M_EXT_CLUSTER)) {
case M_CLCACHE | M_EXT | M_EXT_CLUSTER:
if ((m->m_flags & M_EXT) &&
m->m_flags &= ~(M_EXT | M_EXT_CLUSTER);
case M_EXT | M_EXT_CLUSTER:
case M_EXT:
m->m_flags &= ~(M_EXT | M_EXT_CLUSTER);
m->m_flags |= M_EXT;
if (m->m_flags & M_EXT) {
KKASSERT((n->m_flags & M_EXT) == 0);
n->m_flags |= m->m_flags & (M_EXT | M_EXT_CLUSTER);
if (m->m_flags & M_EXT) {
KKASSERT((n->m_flags & M_EXT) == 0);
n->m_flags |= m->m_flags & (M_EXT | M_EXT_CLUSTER);
if (m->m_flags & M_EXT) {
KKASSERT((n->m_flags & M_EXT) == 0);
n->m_flags |= m->m_flags & (M_EXT | M_EXT_CLUSTER);
if (m->m_flags & M_EXT && m->m_ext.ext_size == MCLBYTES)
if (m->m_flags & M_EXT ||
if (m->m_flags & M_EXT)
if ((m->m_flags & M_EXT) == 0) {
if (mprev != NULL && (mprev->m_flags & M_EXT) &&
KASSERT(m->m_flags & M_EXT, ("m_flags 0x%x", m->m_flags));
if (mprev != NULL && (mprev->m_flags & M_EXT) &&
if ((n->m_flags & M_EXT) == 0) {
if (!(n->m_flags & M_EXT) &&
if (m->m_flags & M_EXT)
if (m->m_flags & M_EXT) {
KKASSERT((n->m_flags & M_EXT) == 0);
n->m_flags |= m->m_flags & (M_EXT | M_EXT_CLUSTER);
if (m->m_flags & M_EXT)
m->m_flags |= M_EXT | M_EXT_CLUSTER;
if (m->m_flags & M_EXT) {
if (m->m_flags & M_EXT && m->m_ext.ext_size != MCLBYTES)
switch (m->m_flags & (M_EXT | M_EXT_CLUSTER)) {
case M_EXT:
case M_EXT | M_EXT_CLUSTER:
if (m->m_flags & M_EXT) /*XXX*/ /* pretty sure this is bogus */
if (m->m_flags & M_EXT)
m->m_flags |= M_EXT;
if (control->m_flags & M_EXT)
if ((m->m_flags & M_EXT || m->m_len < minlen) &&
#define M_HASCL(m) ((m)->m_flags & M_EXT)
if ((m->m_flags & M_EXT) == 0) {
if ((packetlen > MHLEN) && !(m->m_flags & M_EXT)) {
if ((neg->m->m_flags & M_EXT) == 0) {
if ((hm->m_flags & M_EXT) == 0) {
if (!(sc->m->m_flags & M_EXT)) {
if (!(m->m_flags & M_EXT)) {
if (!(m->m_flags & M_EXT)) {
if (!(m->m_flags & M_EXT)) {
if ((packetlen > MHLEN) && !(m->m_flags & M_EXT)) {
if ((hm->m_flags & M_EXT) == 0) {
if ((m->m_flags & M_EXT || m->m_len < minlen) &&
} else if ((m)->m_flags & M_EXT) { \
KASSERT((mtemp->m_flags & M_EXT) == 0 &&
KASSERT((mtemp->m_flags & M_EXT) == 0 &&
if (copym != NULL && (copym->m_flags & M_EXT || copym->m_len < hlen))
if (m->m_flags & M_EXT || m->m_data - optlen < m->m_pktdat) {
if ((n->m_flags & M_EXT) ||
if (m->m_flags & M_EXT) {
#define M_HASCL(m) ((m)->m_flags & M_EXT)
if (!(mlast->m_flags & M_EXT) &&
if ((copym->m_flags & M_EXT) != 0 ||
#define M_WRITABLE(m) (!((m)->m_flags & M_EXT) || M_EXT_WRITABLE(m))
((m)->m_flags & M_EXT ? \
((m)->m_flags & M_EXT ? \
if ((m)->m_flags & M_EXT) \
if ((m)->m_flags & M_EXT) \
if ((m)->m_flags & M_EXT) \
else if (mb.m_flags & M_EXT)
if (mb.m_flags & M_EXT) {
m->m_flags |= M_EXT;
m->m_flags |= M_EXT;