diff options
| author | Dustin Brown <dustinb@codeaurora.org> | 2017-08-10 17:27:50 -0700 |
|---|---|---|
| committer | snandini <snandini@codeaurora.org> | 2017-08-24 13:30:47 -0700 |
| commit | e2793cc5410cb976d8faa31f98cb09b438a71f49 (patch) | |
| tree | a2b76be1aa35b624468ff91ef8478252467bfd10 /tools/perf/scripts/python | |
| parent | cc44c90c1a07c58934b5c15b0e57032276c65ce7 (diff) | |
qcacmn: Remove membership check from list APIs
Getting the next node of a linked list should be a O(1) operation.
qdf_list_peek_next, however, iterates though the list first, checking
for node membership, before returning the next node. This makes the O(1)
operation a O(n) operation instead. Code that uses this API for list
traversal inadvertently performs a O(n^2) operation, causing unexpected
performance issues. Similar problems exist for qdf_list_remove_node as
well. Remove the membership checks in qdf_list_peek_next and
qdf_list_remove_node to prevent unexpected performance penalties.
Change-Id: If20825690ad861815c8164caebbf75318e572f0a
CRs-Fixed: 2091815
Diffstat (limited to 'tools/perf/scripts/python')
0 files changed, 0 insertions, 0 deletions
