diff options
| author |   Christian Ehrhardt <christian.ehrhardt@canonical.com> | 2017-05-16 14:51:32 +0200 |
|---|---|---|
| committer | Christian Ehrhardt <christian.ehrhardt@canonical.com> | 2017-05-16 14:51:32 +0200 |
| commit | fca143f059a0bddd7d47b8dc2df646a891b0eb0f (patch) | |
| tree | 4bfeadc905c977e45e54a90c42330553b8942e4e /doc/guides/prog_guide/writing_efficient_code.rst | |
| parent | ce3d555e43e3795b5d9507fcfc76b7a0a92fd0d6 (diff) | |
Imported Upstream version 17.05
Diffstat (limited to 'doc/guides/prog_guide/writing_efficient_code.rst')
| -rw-r--r-- | doc/guides/prog_guide/writing_efficient_code.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/guides/prog_guide/writing_efficient_code.rst b/doc/guides/prog_guide/writing_efficient_code.rst index 78d2afa9..8223acee 100644 --- a/doc/guides/prog_guide/writing_efficient_code.rst +++ b/doc/guides/prog_guide/writing_efficient_code.rst @@ -124,7 +124,7 @@ The code algorithm that dequeues messages may be something similar to the follow while (1) { /* Process as many elements as can be dequeued. */ - count = rte_ring_dequeue_burst(ring, obj_table, MAX_BULK); + count = rte_ring_dequeue_burst(ring, obj_table, MAX_BULK, NULL); if (unlikely(count == 0)) continue; |