| commit | 63af6a66233bd2bd8fc82b3aa68b81450d1f2081 | |
| author | Tobias Grosser <tobias@grosser.es> | |
| Thu, 2 Aug 2012 08:52:54 +0000 (2 10:52 +0200) | ||
| committer | Sven Verdoolaege <skimo@kotnet.org> | |
| Thu, 2 Aug 2012 10:19:58 +0000 (2 12:19 +0200) | ||
| tree | 74c8b44849765d591b4b7e7207a5007a922438c9 | treesnapshot (tar.gz zip) |
| parent | 374c21a666548b8794cf5e0e378925ce4aaad0e2 | commitdiff |
Use an MIT licensed mergesort as the sorting algorithm for isl
This patch replaces the old LGPL licenced quicksort implementation taken
from glibc.
The call sites are adjusted to the fact that isl_sort can now fail
(due to failed memory allocation).
Signed-off-by: Tobias Grosser <tobias@grosser.es>
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
This patch replaces the old LGPL licenced quicksort implementation taken
from glibc.
The call sites are adjusted to the fact that isl_sort can now fail
(due to failed memory allocation).
Signed-off-by: Tobias Grosser <tobias@grosser.es>
Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
| AUTHORS | diffblobblamehistory | |
| Makefile.am | diffblobblamehistory | |
| isl_flow.c | diffblobblamehistory | |
| isl_qsort.c | [deleted file] | blobblamehistory |
| isl_qsort.h | [deleted file] | blobblamehistory |
| isl_schedule.c | diffblobblamehistory | |
| isl_sort.c | [new file with mode: 0644] | blob |
| isl_sort.h | [new file with mode: 0644] | blob |