2 * Copyright (c) 1995 Danny Gasparovski
4 * Please read the file COPYRIGHT for the
5 * terms and conditions of the copyright.
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
23 struct mbuf m_freelist
, m_usedlist
;
24 #define MBUF_THRESH 30
28 * Find a nice value for msize
29 * XXX if_maxlinkhdr already in mtu
31 #define SLIRP_MSIZE (IF_MTU + IF_MAXLINKHDR + sizeof(struct m_hdr ) + 6)
36 m_freelist
.m_next
= m_freelist
.m_prev
= &m_freelist
;
37 m_usedlist
.m_next
= m_usedlist
.m_prev
= &m_usedlist
;
41 * Get an mbuf from the free list, if there are none
44 * Because fragmentation can occur if we alloc new mbufs and
45 * free old mbufs, we mark all mbufs above mbuf_thresh as M_DOFREE,
46 * which tells m_free to actually free() it
51 register struct mbuf
*m
;
56 if (m_freelist
.m_next
== &m_freelist
) {
57 m
= (struct mbuf
*)malloc(SLIRP_MSIZE
);
58 if (m
== NULL
) goto end_error
;
60 if (mbuf_alloced
> MBUF_THRESH
)
62 if (mbuf_alloced
> mbuf_max
)
63 mbuf_max
= mbuf_alloced
;
65 m
= m_freelist
.m_next
;
69 /* Insert it in the used list */
70 insque(m
,&m_usedlist
);
71 m
->m_flags
= (flags
| M_USEDLIST
);
74 m
->m_size
= SLIRP_MSIZE
- sizeof(struct m_hdr
);
80 DEBUG_ARG("m = %lx", (long )m
);
90 DEBUG_ARG("m = %lx", (long )m
);
93 /* Remove from m_usedlist */
94 if (m
->m_flags
& M_USEDLIST
)
97 /* If it's M_EXT, free() it */
98 if (m
->m_flags
& M_EXT
)
102 * Either free() it or put it on the free list
104 if (m
->m_flags
& M_DOFREE
) {
107 } else if ((m
->m_flags
& M_FREELIST
) == 0) {
108 insque(m
,&m_freelist
);
109 m
->m_flags
= M_FREELIST
; /* Clobber other flags */
115 * Copy data from one mbuf to the end of
116 * the other.. if result is too big for one mbuf, malloc()
117 * an M_EXT data segment
121 register struct mbuf
*m
, *n
;
124 * If there's no room, realloc
126 if (M_FREEROOM(m
) < n
->m_len
)
127 m_inc(m
,m
->m_size
+MINCSIZE
);
129 memcpy(m
->m_data
+m
->m_len
, n
->m_data
, n
->m_len
);
130 m
->m_len
+= n
->m_len
;
136 /* make m size bytes large */
144 /* some compiles throw up on gotos. This one we can fake. */
145 if(m
->m_size
>size
) return;
147 if (m
->m_flags
& M_EXT
) {
148 datasize
= m
->m_data
- m
->m_ext
;
149 m
->m_ext
= (char *)realloc(m
->m_ext
,size
);
150 /* if (m->m_ext == NULL)
151 * return (struct mbuf *)NULL;
153 m
->m_data
= m
->m_ext
+ datasize
;
156 datasize
= m
->m_data
- m
->m_dat
;
157 dat
= (char *)malloc(size
);
159 * return (struct mbuf *)NULL;
161 memcpy(dat
, m
->m_dat
, m
->m_size
);
164 m
->m_data
= m
->m_ext
+ datasize
;
194 * Copy len bytes from m, starting off bytes into n
197 m_copy(n
, m
, off
, len
)
201 if (len
> M_FREEROOM(n
))
204 memcpy((n
->m_data
+ n
->m_len
), (m
->m_data
+ off
), len
);
211 * Given a pointer into an mbuf, return the mbuf
212 * XXX This is a kludge, I should eliminate the need for it
213 * Fortunately, it's not used often
222 DEBUG_ARG("dat = %lx", (long )dat
);
224 /* bug corrected for M_EXT buffers */
225 for (m
= m_usedlist
.m_next
; m
!= &m_usedlist
; m
= m
->m_next
) {
226 if (m
->m_flags
& M_EXT
) {
227 if( (char *)dat
>=m
->m_ext
&& (char *)dat
<(m
->m_ext
+ m
->m_size
) )
230 if( (char *)dat
>= m
->m_dat
&& (char *)dat
<(m
->m_dat
+ m
->m_size
) )
235 DEBUG_ERROR((dfd
, "dtom failed"));
237 return (struct mbuf
*)0;