Lines Matching full:it
15 a means to hold the packet, write and read it, as well as necessary
19 The data structure and the whole API around it are defined in
44 Note, however, one will rarely have to use it, as the core provides
54 needs various metadata information to become relevant as well. It
55 requires at least to get the network interface it is meant to be sent
56 through or through which it was received. As this is a very common
78 :ref:`net_buf_interface` for more information). However, it mostly
94 once via :c:func:`net_pkt_alloc_with_buffer`. It is actually the most
140 :c:func:`net_pkt_alloc_buffer`, as it will take into account the
141 existing buffer. It will also account for the header space if
175 As said earlier, though net_pkt uses net_buf for its buffer, it
176 provides its own API to access it. Indeed, a network packet might be
185 length parameters: if it cannot r/w the given length it will
186 fail. Length is not interpreted as an upper limit, it is instead the
228 point, it will fail because there is nothing to read at the cursor
229 where we are at in the net_pkt. It is possible, while in write mode,
251 :c:func:`net_pkt_set_overwrite` function. It is possible to switch
260 Now the same operators can be used, but it will be limited to the
263 If it is necessary to know how much space is available in the net_pkt
288 Though the API shown previously is rather simple, it involves always
289 copying things to and from the net_pkt buffer. In many occasions, it
293 These headers are, most of the time, a known fixed set of bytes. It is
295 header. In addition to this, if it is known the header size appears
296 in a contiguous area of the buffer, it will be way more efficient to
298 for reading or writing the fields of such header, accessing it
302 previously described API. It is able to handle both contiguous and
306 :c:macro:`NET_PKT_DATA_ACCESS_DEFINE` when it is not possible to
309 it is guaranteed the data is in a contiguous area.
323 It would be the same for struct net_ipv4_hdr. For a UDP header it
350 If the data are in a contiguous area, it will advance the cursor
351 relevantly. If not, it will write the data and the cursor will be
353 path as well, but it is slightly faster to use
355 contiguity at all, it just advances the cursor via