1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
|
/*
* Copyright (C) by Argonne National Laboratory
* See COPYRIGHT in top-level directory
*/
#include "heap_sort.h"
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#define NOEXP2
static void heapify(heap_t * heap, int i);
/* From Introduction To Algorithms by Cormen, Leiserson, and Rivest */
static inline int parent(int i)
{
return (i / 2);
}
static inline int left(int i)
{
return (2 * i);
}
static inline int right(int i)
{
return (2 * i + 1);
}
int ADIOI_Heap_create(heap_t * heap, int size)
{
heap->size = size;
heap->nodes = (heap_node_t *) ADIOI_Calloc(size, sizeof(heap_node_t));
if (heap->nodes == NULL)
return 1;
else
return 0;
}
void ADIOI_Heap_free(heap_t * heap)
{
ADIOI_Free(heap->nodes);
}
/* should suppress unused warnings on GCC */
static void build_heap(heap_t * heap) ATTRIBUTE((unused, used));
static void build_heap(heap_t * heap)
{
int i;
for (i = (heap->size / 2 - 1); i >= 0; i--)
heapify(heap, i);
}
static void heapify(heap_t * heap, int i)
{
int l, r, smallest;
heap_node_t *nodes;
heap_node_t tmp_node;
nodes = heap->nodes;
l = left(i);
r = right(i);
if ((l <= heap->size) && (nodes[l].offset < nodes[i].offset))
smallest = l;
else
smallest = i;
if ((r <= heap->size) && (nodes[r].offset < nodes[smallest].offset))
smallest = r;
if (smallest != i) {
tmp_node = nodes[i];
nodes[i] = nodes[smallest];
nodes[smallest] = tmp_node;
heapify(heap, smallest);
}
}
void ADIOI_Heap_insert(heap_t * heap, ADIO_Offset offset, int proc, ADIO_Offset reg_max_len)
{
heap_node_t *nodes;
int i;
nodes = heap->nodes;
i = ++heap->size - 1;
while ((i > 0) && (nodes[parent(i)].offset > offset)) {
nodes[i] = nodes[parent(i)];
i = parent(i);
}
nodes[i].offset = offset;
nodes[i].proc = proc;
nodes[i].reg_max_len = reg_max_len;
}
void ADIOI_Heap_extract_min(heap_t * heap, ADIO_Offset * offset, int *proc,
ADIO_Offset * reg_max_len)
{
heap_node_t *nodes;
nodes = heap->nodes;
assert(heap->size > 0);
*offset = nodes[0].offset;
*proc = nodes[0].proc;
*reg_max_len = nodes[0].reg_max_len;
nodes[0] = nodes[heap->size - 1];
heap->size--;
heapify(heap, 0);
}
/* should suppress unused warnings on GCC */
static void print_heap(heap_t * heap) ATTRIBUTE((unused, used));
static void print_heap(heap_t * heap)
{
#ifndef NOEXP2
int i;
double level = 0;
int next_level_idx = 1;
printf("heap->size = %d\n", heap->size);
printf("offsets:\n");
for (i = 0; i < heap->size; i++) {
printf("%lld ", (long long) heap->nodes[i].offset);
if ((i + 1) == next_level_idx) {
printf("\n");
next_level_idx += (int) exp2(level + 1);
level++;
}
}
printf("\n");
#endif
}
|
