164 lines
3.9 KiB
C
164 lines
3.9 KiB
C
/*
|
|
|
|
This program is part of the TACLeBench benchmark suite.
|
|
Version V 2.0
|
|
|
|
Name: binarysearch
|
|
|
|
Author: Sung-Soo Lim <sslim@archi.snu.ac.kr>
|
|
|
|
Function: binarysearch performs binary search in an array of 15 integer
|
|
elements.
|
|
This program is completely structured (no unconditional jumps, no exits
|
|
from loop bodies), and does not contain switch statements, no do-while
|
|
loops.
|
|
|
|
Source: MRTC
|
|
http://www.mrtc.mdh.se/projects/wcet/wcet_bench/bs/bs.c
|
|
|
|
Original name: bs
|
|
|
|
Changes: No major functional changes.
|
|
|
|
License: May be used, modified, and re-distributed freely, but
|
|
the SNU-RT Benchmark Suite must be acknowledged
|
|
|
|
*/
|
|
|
|
/*
|
|
This program is derived from the SNU-RT Benchmark Suite for Worst
|
|
Case Timing Analysis by Sung-Soo Lim
|
|
*/
|
|
|
|
/*
|
|
Forward declaration of functions
|
|
*/
|
|
|
|
// Wasm loop bounds
|
|
|
|
|
|
|
|
|
|
__attribute__((import_module("__pragma"), import_name("loopbound"))) extern void
|
|
__pragma_loopbound(unsigned int min_bound, unsigned int max_bound);
|
|
|
|
__attribute__((always_inline)) static inline void binarysearch_initSeed(void);
|
|
__attribute__((always_inline)) static inline long
|
|
binarysearch_randomInteger(void);
|
|
__attribute__((always_inline)) static inline void binarysearch_init(void);
|
|
__attribute__((always_inline)) static inline int binarysearch_return(void);
|
|
__attribute__((always_inline)) static inline int
|
|
binarysearch_binary_search(int);
|
|
__attribute__((noinline)) __attribute__((export_name("entrypoint")))
|
|
__attribute__((noinline)) __attribute__((export_name("entrypoint"))) void
|
|
binarysearch_main(void);
|
|
__attribute__((noinline)) __attribute__((export_name("main")))
|
|
__attribute__((noinline)) __attribute__((export_name("main"))) int
|
|
main(void);
|
|
|
|
/*
|
|
Declaration of global variables
|
|
*/
|
|
|
|
volatile int binarysearch_seed;
|
|
|
|
struct binarysearch_DATA {
|
|
int key;
|
|
int value;
|
|
};
|
|
|
|
struct binarysearch_DATA binarysearch_data[15];
|
|
|
|
int binarysearch_result;
|
|
|
|
/*
|
|
Initialization- and return-value-related functions
|
|
*/
|
|
|
|
/*
|
|
binarysearch_initSeed initializes the seed used in the "random" number
|
|
generator.
|
|
*/
|
|
__attribute__((always_inline)) static inline void
|
|
binarysearch_initSeed(void) {
|
|
binarysearch_seed = 0;
|
|
}
|
|
|
|
/*
|
|
binarysearch_RandomInteger generates "random" integers between 0 and 8094.
|
|
*/
|
|
__attribute__((always_inline)) static inline long
|
|
binarysearch_randomInteger(void) {
|
|
binarysearch_seed = ((binarysearch_seed * 133) + 81) % 8095;
|
|
return (binarysearch_seed);
|
|
}
|
|
|
|
__attribute__((always_inline)) static inline void
|
|
binarysearch_init(void) {
|
|
int i;
|
|
|
|
binarysearch_initSeed();
|
|
|
|
__pragma_loopbound(15, 15);
|
|
for (i = 0; i < 15; ++i) {
|
|
binarysearch_data[i].key = binarysearch_randomInteger();
|
|
binarysearch_data[i].value = binarysearch_randomInteger();
|
|
}
|
|
}
|
|
|
|
__attribute__((always_inline)) static inline int
|
|
binarysearch_return(void) {
|
|
return (binarysearch_result);
|
|
}
|
|
|
|
/*
|
|
Algorithm core functions
|
|
*/
|
|
|
|
__attribute__((always_inline)) static inline int
|
|
binarysearch_binary_search(int x) {
|
|
int fvalue, mid, up, low;
|
|
|
|
low = 0;
|
|
up = 14;
|
|
fvalue = -1;
|
|
|
|
__pragma_loopbound(1, 4);
|
|
while (low <= up) {
|
|
mid = (low + up) >> 1;
|
|
|
|
if (binarysearch_data[mid].key == x) {
|
|
/* Item found */
|
|
up = low - 1;
|
|
fvalue = binarysearch_data[mid].value;
|
|
} else
|
|
|
|
if (binarysearch_data[mid].key > x)
|
|
/* Item not found */
|
|
up = mid - 1;
|
|
else
|
|
low = mid + 1;
|
|
}
|
|
|
|
return (fvalue);
|
|
}
|
|
|
|
/*
|
|
Main functions
|
|
*/
|
|
|
|
__attribute__((noinline)) __attribute__((export_name("entrypoint")))
|
|
__attribute__((noinline)) __attribute__((export_name("entrypoint"))) void
|
|
binarysearch_main(void) {
|
|
binarysearch_result = binarysearch_binary_search(8);
|
|
}
|
|
|
|
__attribute__((noinline)) __attribute__((export_name("main")))
|
|
__attribute__((noinline)) __attribute__((export_name("main"))) int
|
|
main(void) {
|
|
binarysearch_init();
|
|
binarysearch_main();
|
|
|
|
return (binarysearch_return() - (-1) != 0);
|
|
}
|