vde/slirpvde/mbuf.c

   1 /*
   2  * Copyright (c) 1995 Danny Gasparovski
   3  *
   4  * Please read the file COPYRIGHT for the
   5  * terms and conditions of the copyright.
   6  */
   7
   8 /*
   9  * mbuf's in SLiRP are much simpler than the real mbufs in
  10  * FreeBSD.  They are fixed size, determined by the MTU,
  11  * so that one whole packet can fit.  Mbuf's cannot be
  12  * chained together.  If there's more data than the mbuf
  13  * could hold, an external malloced buffer is pointed to
  14  * by m_ext (and the data pointers) and M_EXT is set in
  15  * the flags
  16  */
  17
  18 #include <config.h>
  19 #include <slirp.h>
  20
  21 struct  mbuf *mbutl;
  22 char    *mclrefcnt;
  23 int mbuf_alloced = 0;
  24 struct mbuf m_freelist, m_usedlist;
  25 int mbuf_thresh = 30;
  26 int mbuf_max = 0;
  27 int msize;
  28
  29 void
  30 m_init()
  31 {
  32         m_freelist.m_next = m_freelist.m_prev = &m_freelist;
  33         m_usedlist.m_next = m_usedlist.m_prev = &m_usedlist;
  34         msize_init();
  35 }
  36
  37 void
  38 msize_init()
  39 {
  40         /*
  41          * Find a nice value for msize
  42          * XXX if_maxlinkhdr already in mtu
  43          */
  44         msize = (if_mtu>if_mru?if_mtu:if_mru) +
  45                         if_maxlinkhdr + sizeof(struct m_hdr ) + 6;
  46 }
  47
  48 /*
  49  * Get an mbuf from the free list, if there are none
  50  * malloc one
  51  *
  52  * Because fragmentation can occur if we alloc new mbufs and
  53  * free old mbufs, we mark all mbufs above mbuf_thresh as M_DOFREE,
  54  * which tells m_free to actually free() it
  55  */
  56 struct mbuf *
  57 m_get()
  58 {
  59         register struct mbuf *m;
  60         int flags = 0;
  61
  62         DEBUG_CALL("m_get");
  63
  64         if (m_freelist.m_next == &m_freelist) {
  65                 m = (struct mbuf *)malloc(msize);
  66                 if (m == NULL) goto end_error;
  67                 mbuf_alloced++;
  68                 if (mbuf_alloced > mbuf_thresh)
  69                         flags = M_DOFREE;
  70                 if (mbuf_alloced > mbuf_max)
  71                         mbuf_max = mbuf_alloced;
  72         } else {
  73                 m = m_freelist.m_next;
  74                 remque(m);
  75         }
  76
  77         /* Insert it in the used list */
  78         insque(m,&m_usedlist);
  79         m->m_flags = (flags | M_USEDLIST);
  80
  81         /* Initialise it */
  82         m->m_size = msize - sizeof(struct m_hdr);
  83         m->m_data = m->m_dat;
  84         m->m_len = 0;
  85         m->m_nextpkt = 0;
  86         m->m_prevpkt = 0;
  87 end_error:
  88         DEBUG_ARG("m = %lx", (long )m);
  89         return m;
  90 }
  91
  92 void
  93 m_free(m)
  94         struct mbuf *m;
  95 {
  96
  97   DEBUG_CALL("m_free");
  98   DEBUG_ARG("m = %lx", (long )m);
  99
 100   if(m) {
 101         /* Remove from m_usedlist */
 102         if (m->m_flags & M_USEDLIST)
 103            remque(m);
 104
 105         /* If it's M_EXT, free() it */
 106         if (m->m_flags & M_EXT)
 107            free(m->m_ext);
 108
 109         /*
 110          * Either free() it or put it on the free list
 111          */
 112         if (m->m_flags & M_DOFREE) {
 113                 free(m);
 114                 mbuf_alloced--;
 115         } else if ((m->m_flags & M_FREELIST) == 0) {
 116                 insque(m,&m_freelist);
 117                 m->m_flags = M_FREELIST; /* Clobber other flags */
 118         }
 119   } /* if(m) */
 120 }
 121
 122 /*
 123  * Copy data from one mbuf to the end of
 124  * the other.. if result is too big for one mbuf, malloc()
 125  * an M_EXT data segment
 126  */
 127 void
 128 m_cat(m, n)
 129         register struct mbuf *m, *n;
 130 {
 131         /*
 132          * If there's no room, realloc
 133          */
 134         if (M_FREEROOM(m) < n->m_len)
 135                 m_inc(m,m->m_size+MINCSIZE);
 136
 137         memcpy(m->m_data+m->m_len, n->m_data, n->m_len);
 138         m->m_len += n->m_len;
 139
 140         m_free(n);
 141 }
 142
 143
 144 /* make m size bytes large */
 145 void
 146 m_inc(m, size)
 147         struct mbuf *m;
 148         int size;
 149 {
 150         /* some compiles throw up on gotos.  This one we can fake. */
 151         if(m->m_size>size) return;
 152
 153         if (m->m_flags & M_EXT) {
 154           /* datasize = m->m_data - m->m_ext; */
 155           m->m_ext = (char *)realloc(m->m_ext,size);
 156 /*              if (m->m_ext == NULL)
 157  *                      return (struct mbuf *)NULL;
 158  */
 159           /* m->m_data = m->m_ext + datasize; */
 160         } else {
 161           int datasize;
 162           char *dat;
 163           datasize = m->m_data - m->m_dat;
 164           dat = (char *)malloc(size);
 165 /*              if (dat == NULL)
 166  *                      return (struct mbuf *)NULL;
 167  */
 168           memcpy(dat, m->m_dat, m->m_size);
 169
 170           m->m_ext = dat;
 171           m->m_data = m->m_ext + datasize;
 172           m->m_flags |= M_EXT;
 173         }
 174
 175         m->m_size = size;
 176
 177 }
 178
 179
 180
 181 void
 182 m_adj(m, len)
 183         struct mbuf *m;
 184         int len;
 185 {
 186         if (m == NULL)
 187                 return;
 188         if (len >= 0) {
 189                 /* Trim from head */
 190                 m->m_data += len;
 191                 m->m_len -= len;
 192         } else {
 193                 /* Trim from tail */
 194                 len = -len;
 195                 m->m_len -= len;
 196         }
 197 }
 198
 199
 200 /*
 201  * Copy len bytes from m, starting off bytes into n
 202  */
 203 int
 204 m_copy(n, m, off, len)
 205         struct mbuf *n, *m;
 206         int off, len;
 207 {
 208         if (len > M_FREEROOM(n))
 209                 return -1;
 210
 211         memcpy((n->m_data + n->m_len), (m->m_data + off), len);
 212         n->m_len += len;
 213         return 0;
 214 }
 215
 216
 217 /*
 218  * Given a pointer into an mbuf, return the mbuf
 219  * XXX This is a kludge, I should eliminate the need for it
 220  * Fortunately, it's not used often
 221  */
 222 struct mbuf *
 223 dtom(dat)
 224         void *dat;
 225 {
 226         struct mbuf *m;
 227
 228         DEBUG_CALL("dtom");
 229         DEBUG_ARG("dat = %lx", (long )dat);
 230
 231         /* bug corrected for M_EXT buffers */
 232         for (m = m_usedlist.m_next; m != &m_usedlist; m = m->m_next) {
 233           if (m->m_flags & M_EXT) {
 234             if( (char *)dat>=m->m_ext && (char *)dat<(m->m_ext + m->m_size) )
 235               return m;
 236           } else {
 237             if( (char *)dat >= m->m_dat && (char *)dat<(m->m_dat + m->m_size) )
 238               return m;
 239           }
 240         }
 241
 242         DEBUG_ERROR((dfd, "dtom failed"));
 243
 244         return (struct mbuf *)0;
 245 }
 246