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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
/*
This program is part of the TACLeBench benchmark suite.
Version V 2.0
Name: dijkstra
Author: unknown
Function: dijkstra finds the shortest path between nodes in a graph
Source: network section of MiBench
Changes: Made some variables local, compute checksum
License: GPL
*/
#include "../extra.h"
#include "input.h"
/*
Definitions of symbolic constants
*/
#define NONE 9999
#define OUT_OF_MEMORY -1
#define QUEUE_SIZE 1000
/*
Type declarations
*/
struct _NODE {
int dist;
int prev;
};
struct _QITEM {
int node;
int dist;
int prev;
struct _QITEM *next;
};
/*
Global variable definitions
*/
struct _NODE dijkstra_rgnNodes[NUM_NODES];
int dijkstra_queueCount;
int dijkstra_queueNext;
struct _QITEM *dijkstra_queueHead;
struct _QITEM dijkstra_queueItems[QUEUE_SIZE];
int dijkstra_checksum = 0;
/*
Forward declaration of functions
*/
void dijkstra_init( void );
int dijkstra_return( void );
int dijkstra_enqueue( int node, int dist, int prev );
void dijkstra_dequeue( int *node, int *dist, int *prev );
int dijkstra_qcount( void );
int dijkstra_find( int chStart, int chEnd );
void dijkstra_main( void );
//int main( void );
void dijkstra_init( void )
{
int i, k;
volatile int x = 0;
_Pragma( "loopbound min 100 max 100" )
for ( i = 0; i < NUM_NODES; i++ ) {
_Pragma( "loopbound min 100 max 100" )
for ( k = 0; k < NUM_NODES; k++ ) {
dijkstra_AdjMatrix[i][k] ^= x;
}
}
dijkstra_queueCount = 0;
dijkstra_queueNext = 0;
dijkstra_queueHead = ( struct _QITEM * )0;
dijkstra_checksum = 0;
}
int dijkstra_return( void )
{
return ( ( dijkstra_checksum == 25 ) ? 0 : -1 );
}
int dijkstra_enqueue( int node, int dist, int prev )
{
struct _QITEM *newItem = &dijkstra_queueItems[dijkstra_queueNext];
struct _QITEM *last = dijkstra_queueHead;
if ( ++dijkstra_queueNext >= QUEUE_SIZE )
return OUT_OF_MEMORY;
newItem->node = node;
newItem->dist = dist;
newItem->prev = prev;
newItem->next = 0;
if ( !last )
dijkstra_queueHead = newItem;
else {
/* TODO: where does this magic loop bound come from? */
_Pragma( "loopbound min 0 max 313" )
while ( last->next )
last = last->next;
last->next = newItem;
}
dijkstra_queueCount++;
return 0;
}
void dijkstra_dequeue( int *node, int *dist, int *prev )
{
if ( dijkstra_queueHead ) {
*node = dijkstra_queueHead->node;
*dist = dijkstra_queueHead->dist;
*prev = dijkstra_queueHead->prev;
dijkstra_queueHead = dijkstra_queueHead->next;
dijkstra_queueCount--;
}
}
int dijkstra_qcount( void )
{
return ( dijkstra_queueCount );
}
int dijkstra_find( int chStart, int chEnd )
{
int ch;
int prev, node;
int cost, dist;
int i;
_Pragma( "loopbound min 100 max 100" )
for ( ch = 0; ch < NUM_NODES; ch++ ) {
dijkstra_rgnNodes[ch].dist = NONE;
dijkstra_rgnNodes[ch].prev = NONE;
}
if ( chStart == chEnd ) {
} else {
dijkstra_rgnNodes[chStart].dist = 0;
dijkstra_rgnNodes[chStart].prev = NONE;
if ( dijkstra_enqueue ( chStart, 0, NONE ) == OUT_OF_MEMORY )
return OUT_OF_MEMORY;
/* TODO: where does this magic loop bound come from? */
_Pragma( "loopbound min 618 max 928" )
while ( dijkstra_qcount() > 0 ) {
dijkstra_dequeue ( &node, &dist, &prev );
_Pragma( "loopbound min 100 max 100" )
for ( i = 0; i < NUM_NODES; i++ ) {
if ( ( cost = dijkstra_AdjMatrix[node][i] ) != NONE ) {
if ( ( NONE == dijkstra_rgnNodes[i].dist ) ||
( dijkstra_rgnNodes[i].dist > ( cost + dist ) ) ) {
dijkstra_rgnNodes[i].dist = dist + cost;
dijkstra_rgnNodes[i].prev = node;
if ( dijkstra_enqueue ( i, dist + cost, node ) == OUT_OF_MEMORY )
return OUT_OF_MEMORY;
}
}
}
}
}
return 0;
}
void _Pragma( "entrypoint" ) dijkstra_main( void )
{
int i, j;
/* finds 20 shortest paths between nodes */
_Pragma( "loopbound min 20 max 20" )
for ( i = 0, j = NUM_NODES / 2; i < 20; i++, j++ ) {
j = j % NUM_NODES;
if ( dijkstra_find( i, j ) == OUT_OF_MEMORY ) {
dijkstra_checksum += OUT_OF_MEMORY;
return;
} else
dijkstra_checksum += dijkstra_rgnNodes[j].dist;
dijkstra_queueNext = 0;
}
}
int main(int argc, char** argv )
{
SET_UP
for(jobsComplete=-1; jobsComplete<maxJobs; jobsComplete++){
START_LOOP
dijkstra_init();
dijkstra_main();
STOP_LOOP
}
WRITE_TO_FILE
return ( dijkstra_return() );
}
|
