2 .TH pkbuf 3 "16 July 2000" "Straylight/Edgeware" "mLib utilities library"
4 pkbuf \- split packets out of asynchronously received blocks
14 .B "#include <mLib/pkbuf.h>"
16 .BI "void pkbuf_flush(pkbuf *" pk ", octet *" p ", size_t " len );
17 .BI "void pkbuf_close(pkbuf *" pk );
18 .BI "size_t pkbuf_free(pkbuf *" pk ", octet **" p );
19 .BI "void pkbuf_snarf(pkbuf *" pk ", const void *" p ", size_t " sz );
20 .BI "void pkbuf_want(pkbuf *" pk ", size_t " want );
21 .BI "void pkbuf_init(pkbuf *" pk ", pkbuf_func *" func ", void *" p );
22 .BI "void pkbuf_destroy(pkbuf *" pk );
29 Given unpredictably-sized chunks of data, the packet buffer extracts
30 completed packets of data, with sizes ascertained by a handler
33 The state of a packet buffer is stored in an object of type
35 This is a structure which must be allocated by the caller. The
36 structure should normally be considered opaque (see the section on
38 for an exception to this).
39 .SS "Initialization and finalization"
42 initializes a packet buffer ready for use. It is given three arguments:
45 A pointer to the block of memory to use for the packet buffer. The packet
46 buffer will allocate memory to store incoming data automatically: this
47 structure just contains bookkeeping information.
49 .BI "pkbuf_func *" func
52 function to which the packet buffer should pass packets of data when
54 .B "Packet breaking and the handler function"
58 A pointer argument to be passed to the function when a packet arrives.
60 By default, the buffer is
61 allocated from the current arena,
63 this may be changed by altering the buffer's
65 member to refer to a different arena at any time when the buffer is
68 A packet buffer must be destroyed after use by calling
70 passing it the address of the buffer block.
71 .SS "Inserting data into the buffer"
72 There are two interfaces for inserting data into the buffer. One's much
73 simpler than the other, although it's less expressive.
75 The simple interface is
77 This function is given three arguments: a pointer
79 to a packet buffer structure; a pointer
81 to a chunk of data to read; and the size
83 of the chunk of data. The data is pushed through the packet buffer and
84 any complete packets are passed on to the packet handler.
86 The complex interface is the pair of functions
93 function returns the address and size of a free portion of the packet
94 buffer's memory into which data may be written. The function is passed
97 of the packet buffer. Its result is the size of the free area, and it
98 writes the base address of this free space to the location pointed to by
101 The caller's data must be written to ascending memory locations starting
104 and no data may be written beyond the end of the free space. However,
105 it isn't necessary to completely fill the buffer.
107 Once the free area has had some data written to it,
109 is called to examine the new data and break it into packets. This is
110 given three arguments:
113 The address of the packet buffer.
116 The address at which the new data has been written. This must be the
117 base address returned from
121 The number of bytes which have been written to the buffer.
125 function breaks the new data into packets as described below, and passes
126 each one in turn to the packet-handler function.
130 function is trivially implemented in terms of the more complex
131 .BR pkbuf_free / pkbuf_flush
133 .SS "Packet breaking and the handler function"
136 is used to inform the packet buffer of the expected length of the next
137 packet. It is given the pointer
139 to the packet buffer and a size
143 When enough data has arrived, the packet-handler function is called.
144 This has the signature
147 .BI "void (*" func ")(octet *" b ", size_t " sz ", pkbuf *" p ,
148 .BI " size_t *" keep ", void *" p );
154 A pointer to the packet data in the buffer, or zero to signify
158 The size of the packet, as previously configured via
162 A pointer to the packet buffer.
165 A location in which to store the number of bytes of the current packet
166 to be retained. The bytes kept are from the end of the current packet:
167 if you want to keep bytes from the beginning of the packet, you should
168 move them into the right place.
171 The pointer which was set up in the call to
174 .SS "Flushing the remaining data"
175 When the client program knows that there's no more data arriving (for
176 example, an end-of-file condition exists on its data source) it should
179 This will call the handler one final time with a null pointer to inform
180 it of the end-of-file.
182 The packet buffer is intended to be used in higher-level program
183 objects, such as the packet selector described in
185 Unfortunately, a concept from this high level needs to exist at the
186 packet buffer level, which complicates the description somewhat. The
187 idea is that, when a packet-handler attached to some higher-level object
188 decides that it's read enough, it can
190 the object so that it doesn't see any more data.
194 call can emit more than one packet, it must be aware that the packet
195 handler isn't interested in any more packet. However, this fact must
196 also be signalled to the higher-level object so that it can detach
197 itself from its data source.
199 Rather than invent some complex interface for this, the packet buffer
200 exports one of its structure members, a flags words called
202 A higher-level object wishing to disable the packet buffer simply clears
207 Disabling a buffer causes an immediate return from
209 However, it is not permitted for the functions
213 to be called on a disabled buffer. (This condition isn't checked for;
214 it'll just do the wrong thing.) Furthermore, the
216 function does not handle disablement at all, because it would complicate
217 the interface so much that it wouldn't have any advantage over the more
219 .BR pkbuf_free / pkbuf_flush .
225 Mark Wooding, <mdw@distorted.org.uk>