sort.c 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
  1. #include <arm/NXP/LPC17xx/LPC17xx.h>
  2. #include <string.h>
  3. #include <stdlib.h>
  4. #include "config.h"
  5. #include "uart.h"
  6. #include "memory.h"
  7. #include "sort.h"
  8. /*
  9. heap sort algorithm for data located outside RAM
  10. addr: start address of pointer table
  11. i: index (in 32-bit elements)
  12. heapsize: size of heap (in 32-bit elements)
  13. */
  14. uint32_t stat_getstring = 0;
  15. static char sort_str1[21], sort_str2[21];
  16. uint32_t ptrcache[QSORT_MAXELEM] IN_AHBRAM;
  17. /* get element from pointer table in external RAM*/
  18. uint32_t sort_get_elem(uint32_t base, unsigned int index) {
  19. return sram_readlong(base+4*index);
  20. }
  21. /* put element from pointer table in external RAM */
  22. void sort_put_elem(uint32_t base, unsigned int index, uint32_t elem) {
  23. sram_writelong(elem, base+4*index);
  24. }
  25. /* compare strings pointed to by elements of pointer table */
  26. int sort_cmp_idx(uint32_t base, unsigned int index1, unsigned int index2) {
  27. uint32_t elem1, elem2;
  28. elem1 = sort_get_elem(base, index1);
  29. elem2 = sort_get_elem(base, index2);
  30. return sort_cmp_elem((void*)&elem1, (void*)&elem2);
  31. }
  32. int sort_cmp_elem(const void* elem1, const void* elem2) {
  33. uint32_t el1 = *(uint32_t*)elem1;
  34. uint32_t el2 = *(uint32_t*)elem2;
  35. sort_getstring_for_dirent(sort_str1, el1);
  36. sort_getstring_for_dirent(sort_str2, el2);
  37. /*printf("i1=%d i2=%d elem1=%lx elem2=%lx ; compare %s --- %s\n", index1, index2, elem1, elem2, sort_str1, sort_str2); */
  38. if ((el1 & 0x80000000) && !(el2 & 0x80000000)) {
  39. return -1;
  40. }
  41. if (!(el1 & 0x80000000) && (el2 & 0x80000000)) {
  42. return 1;
  43. }
  44. /*
  45. uint16_t cmp_i;
  46. for(cmp_i=0; cmp_i<8 && sort_long1[cmp_i] == sort_long2[cmp_i]; cmp_i++);
  47. if(cmp_i==8) {
  48. return 0;
  49. }
  50. return sort_long1[cmp_i]-sort_long2[cmp_i]; */
  51. return strcasecmp(sort_str1, sort_str2);
  52. }
  53. /* get truncated string from database */
  54. void sort_getstring_for_dirent(char *ptr, uint32_t addr) {
  55. uint8_t leaf_offset;
  56. if(addr & 0x80000000) {
  57. /* is directory link, name offset 4 */
  58. leaf_offset = sram_readbyte(addr + 4 + SRAM_MENU_ADDR);
  59. sram_readblock(ptr, addr + 5 + leaf_offset + SRAM_MENU_ADDR, 20);
  60. } else {
  61. /* is file link, name offset 6 */
  62. leaf_offset = sram_readbyte(addr + 6 + SRAM_MENU_ADDR);
  63. sram_readblock(ptr, addr + 7 + leaf_offset + SRAM_MENU_ADDR, 20);
  64. }
  65. ptr[20]=0;
  66. }
  67. void sort_heapify(uint32_t addr, unsigned int i, unsigned int heapsize)
  68. {
  69. while(1) {
  70. unsigned int l = 2*i+1;
  71. unsigned int r = 2*i+2;
  72. unsigned int largest = (l < heapsize && sort_cmp_idx(addr, i, l) < 0) ? l : i;
  73. if(r < heapsize && sort_cmp_idx(addr, largest, r) < 0)
  74. largest = r;
  75. if(largest != i) {
  76. uint32_t tmp = sort_get_elem(addr, i);
  77. sort_put_elem(addr, i, sort_get_elem(addr, largest));
  78. sort_put_elem(addr, largest, tmp);
  79. i = largest;
  80. }
  81. else break;
  82. }
  83. }
  84. void sort_dir(uint32_t addr, unsigned int size)
  85. {
  86. stat_getstring=0;
  87. if(size > QSORT_MAXELEM) {
  88. printf("more than %d dir entries, doing slower in-place sort\n", QSORT_MAXELEM);
  89. ext_heapsort(addr, size);
  90. } else {
  91. /* retrieve, sort, and store dir table */
  92. sram_readblock(ptrcache, addr, size*4);
  93. qsort((void*)ptrcache, size, 4, sort_cmp_elem);
  94. sram_writeblock(ptrcache, addr, size*4);
  95. }
  96. }
  97. void ext_heapsort(uint32_t addr, unsigned int size) {
  98. for(unsigned int i = size/2; i > 0;) sort_heapify(addr, --i, size);
  99. for(unsigned int i = size-1; i>0; --i) {
  100. uint32_t tmp = sort_get_elem(addr, 0);
  101. sort_put_elem(addr, 0, sort_get_elem(addr, i));
  102. sort_put_elem(addr, i, tmp);
  103. sort_heapify(addr, 0, i);
  104. }
  105. }