blob: f96350b0f5907234cdaf7c6e471e0a8c617e2646 (
plain) (
blame)
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
|
File: dijkstra.c
Original provenience: network section of MiBench
2015-11-30:
- Replaced "NULL" with "0", remove #include of glibc_common.h
- Removed commented code referring to variable "qKill"
- Made ch, i, iPrev, iNode, iCost and iDist local variables
- Stripped (inconsistently applied) Hungarian notation, replaced
prefix "q" with prefix "queue" for global variables, renamed
"next_in" to "queueNext" and "qNew" to "newItem"
- Initialize queueHead statically (like queueCount and queueNext)
- Prefixed all functions and global variables with "dijkstra_",
renaming "dijkstra" to "dijkstra_find"
- Calculate a checksum in dijkstra_main, return its value in new
function dijkstra_return
- Added (empty) function dijkstra_init and a main function
- Reordered functions in source code: initialization- and
return-value-related functions first, followed by algorithm core
functions, followed by main functions
- Added function prototypes
- Applied code formatting with astyle as in the example
- Added general TACLeBench header to beginning of source code
2016-03-15:
- Return 0 if checksum is as expected, -1 otherwise
- Make all initializations explicit
- Touch input matrix with volatile to rule out optimizations
- Add entrypoint pragma
2016-06-14:
- Removed cast to make C++ compiler happy
Files: input.h, input.c
Original provenience: network section of MiBench
2015-11-30:
- Prefix global variable "AdjMatrix" with "dijkstra_"
- Applied code formatting with astyle as in the example
File: glibc_common.h
Original provenience: network section of MiBench
2015-11-30:
- Removed file
|
