mirror of
https://github.com/RfidResearchGroup/proxmark3.git
synced 2025-08-14 10:37:23 -07:00
CHG: my idea of malloc and free for bucketsort didn't work so well. Back to the original.
This commit is contained in:
parent
6b10e3294e
commit
df4ee66ea9
3 changed files with 11 additions and 24 deletions
|
@ -1,23 +1,5 @@
|
|||
#include "bucketsort.h"
|
||||
|
||||
bool bucket_malloc(bucket_array_t bucket) {
|
||||
for (uint32_t i = 0; i < 2; i++) {
|
||||
for (uint32_t j = 0; j <= 0xff; j++) {
|
||||
bucket[i][j].head = malloc(sizeof(uint32_t)<<14);
|
||||
if (!bucket[i][j].head) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
void bucket_free(bucket_array_t bucket) {
|
||||
for (uint8_t i = 0; i < 2; i++)
|
||||
for (uint8_t j = 0; j <= 0xff; j++)
|
||||
free(bucket[i][j].head);
|
||||
}
|
||||
|
||||
void bucket_sort_intersect(uint32_t* const estart, uint32_t* const estop,
|
||||
uint32_t* const ostart, uint32_t* const ostop,
|
||||
bucket_info_t *bucket_info, bucket_array_t bucket)
|
||||
|
|
|
@ -1,7 +1,6 @@
|
|||
#ifndef BUCKETSORT_H__
|
||||
#define BUCKETSORT_H__
|
||||
#include <stdint.h>
|
||||
#include <stdbool.h>
|
||||
#include <stdlib.h>
|
||||
typedef struct bucket {
|
||||
uint32_t *head;
|
||||
|
@ -17,9 +16,6 @@ typedef struct bucket_info {
|
|||
uint32_t numbuckets;
|
||||
} bucket_info_t;
|
||||
|
||||
|
||||
bool bucket_malloc(bucket_array_t bucket);
|
||||
void bucket_free(bucket_array_t bucket);
|
||||
void bucket_sort_intersect(uint32_t* const estart, uint32_t* const estop,
|
||||
uint32_t* const ostart, uint32_t* const ostop,
|
||||
bucket_info_t *bucket_info, bucket_array_t bucket);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue