Archipelago » qemu

	 * Find a nice value for msize

	 * XXX if_maxlinkhdr already in mtu

	 */

			if_maxlinkhdr + sizeof(struct m_hdr ) + 6;

}

/*

 * Get an mbuf from the free list, if there are none

 * malloc one

 * Because fragmentation can occur if we alloc new mbufs and

 * free old mbufs, we mark all mbufs above mbuf_thresh as M_DOFREE,

 * which tells m_free to actually free() it

{

	register struct mbuf *m;

	int flags = 0;

	DEBUG_CALL("m_get");

	if (m_freelist.m_next == &m_freelist) {

		m = (struct mbuf *)malloc(msize);

		if (m == NULL) goto end_error;

		m = m_freelist.m_next;

		remque(m);

	}

	/* Insert it in the used list */

	insque(m,&m_usedlist);

	m->m_flags = (flags | M_USEDLIST);

	/* Initialise it */

	m->m_size = msize - sizeof(struct m_hdr);

	m->m_data = m->m_dat;

m_free(m)

	struct mbuf *m;

{

  DEBUG_CALL("m_free");

  DEBUG_ARG("m = %lx", (long )m);

  if(m) {

	/* Remove from m_usedlist */

	if (m->m_flags & M_USEDLIST)

	   remque(m);

	/* If it's M_EXT, free() it */

	if (m->m_flags & M_EXT)

	   free(m->m_ext);

	 */

	if (M_FREEROOM(m) < n->m_len)

		m_inc(m,m->m_size+MINCSIZE);

	memcpy(m->m_data+m->m_len, n->m_data, n->m_len);

	m->m_len += n->m_len;

	  m->m_ext = (char *)realloc(m->m_ext,size);

/*		if (m->m_ext == NULL)

 *			return (struct mbuf *)NULL;

	  m->m_data = m->m_ext + datasize;

        } else {

	  char *dat;

 *			return (struct mbuf *)NULL;

 */

	  memcpy(dat, m->m_dat, m->m_size);

	  m->m_ext = dat;

	  m->m_data = m->m_ext + datasize;

	  m->m_flags |= M_EXT;

        }

        m->m_size = size;

}

	void *dat;

{

	struct mbuf *m;

	DEBUG_CALL("dtom");

	DEBUG_ARG("dat = %lx", (long )dat);

	      return m;

	  }

	}

	DEBUG_ERROR((dfd, "dtom failed"));

	return (struct mbuf *)0;

}