Home
last modified time | relevance | path

Searched refs:npkts (Results 1 – 3 of 3) sorted by relevance

/external/blktrace/btreplay/
Dbtrecord.c257 cur->hdr.npkts = 0; in io_bunch_create()
280 assert(cur->hdr.npkts < BT_MAX_PKTS); in io_bunch_add()
283 cur->pkts[cur->hdr.npkts++] = iop; // Struct copy in io_bunch_add()
575 assert(0 < hdrp->npkts && hdrp->npkts <= BT_MAX_PKTS); in bunch_output_hdr()
589 (unsigned long long)hdrp->npkts); in bunch_output_hdr()
600 size_t npkts = stream->cur->hdr.npkts; in bunch_output_pkts() local
602 assert(0 < npkts && npkts <= BT_MAX_PKTS); in bunch_output_pkts()
603 if (fwrite(p, sizeof(struct io_pkt), npkts, stream->ofp) != npkts) { in bunch_output_pkts()
612 for (i = 0; i < npkts; i++, p++) in bunch_output_pkts()
629 if (cur->hdr.npkts) { in stream_flush()
[all …]
Dbtreplay.c1131 assert(bunch->hdr.npkts <= BT_MAX_PKTS); in next_bunch()
1133 count = bunch->hdr.npkts * sizeof(struct io_pkt); in next_bunch()
1255 struct iocb *list[bunch->hdr.npkts]; in process_bunch()
1257 assert(0 < bunch->hdr.npkts && bunch->hdr.npkts <= BT_MAX_PKTS); in process_bunch()
1258 while (!is_send_done(tip) && (i < bunch->hdr.npkts)) { in process_bunch()
1260 int ntodo = min(nfree_current(tip), bunch->hdr.npkts - i); in process_bunch()
1289 assert(i <= bunch->hdr.npkts); in process_bunch()
Dbtrecord.h35 __u64 npkts; member