Replace insertion sort with hpsort in our kernel's qsort() function.
AbandonedPublic

Authored by hselasky on Feb 10 2016, 12:15 PM.

Details

Reviewers
rrs
gnn

Diff Detail

Repository
rS FreeBSD src repository
Lint
Lint Skipped
Unit
Unit Tests Skipped
hselasky updated this revision to Diff 13178.Feb 10 2016, 12:15 PM
hselasky retitled this revision from to Document the characteristics of our qsort() function..
hselasky updated this object.
hselasky edited the test plan for this revision. (Show Details)
hselasky set the repository for this revision to rS FreeBSD src repository.
hselasky updated this revision to Diff 15373.Apr 20 2016, 6:29 AM
hselasky retitled this revision from Document the characteristics of our qsort() function. to Replace insertion sort with hpsort in our kernel's qsort() function..

Don't use insertion sort which is O(N*N)

Use hpsort instead which is O(log2(N)*log2(N)*N).

gnn requested changes to this revision.Apr 20 2016, 1:41 PM
gnn edited edge metadata.

I'm in private conversation with hps@ about this proposal.

This revision now requires changes to proceed.Apr 20 2016, 1:41 PM
hselasky abandoned this revision.May 20 2016, 1:16 PM