]> git.ipfire.org Git - thirdparty/suricata.git/commit
projects / thirdparty / suricata.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 643ae85) | patch
detect/port: use qsort instead of insert sort
authorVictor Julien <vjulien@oisf.net>
Mon, 26 Feb 2024 16:08:21 +0000 (21:38 +0530)
committerVictor Julien <victor@inliniac.net>
Mon, 4 Mar 2024 10:50:30 +0000 (11:50 +0100)
commite7e4305d91a05acde921b5bc87f7adbdf566def6
tree10bb92b77103c3b3901e7a60ec2155d5f9c707b6tree
parent643ae85b5faa91958fe9ee79987fa20f06849059commit | diff
detect/port: use qsort instead of insert sort

Instead of using in place insertion sort on linked list based on two
keys, convert the linked list to an array, perform sorting on it using
qsort and convert it back to a linked list. This turns out to be much
faster.

Ticket #6795
src/detect-engine-build.c diff | blob | blame | history
Mirror of https://github.com/OISF/suricata.git