Unified · Split
| @@ -544,20 +544,6 @@ void freeDiskOpEntryMem(void) · 543 unmodified lines | ||
| 544 | 544 | diskop.numEntries = 0; |
| 545 | 545 | } |
| 546 | 546 | |
| 547 | −static bool swapEntries(int32_t a, int32_t b) | |
| 548 | −{ | |
| 549 | − fileEntry_t tmpBuffer; | |
| 550 | − | |
| 551 | − if (a >= diskop.numEntries || b >= diskop.numEntries) | |
| 552 | − return false; | |
| 553 | − | |
| 554 | − tmpBuffer = diskOpEntry[a]; | |
| 555 | − diskOpEntry[a] = diskOpEntry[b]; | |
| 556 | − diskOpEntry[b] = tmpBuffer; | |
| 557 | − | |
| 558 | − return true; | |
| 559 | −} | |
| 560 | − | |
| 561 | 547 | // thanks to aTc for creating this simplified routine for qsort() (I edited it a little bit) |
| 562 | 548 | static int32_t fileEntryCompare(const void *f1, const void *f2) |
| 563 | 549 | { |