#include #include #include #include #include "observation.h" typedef struct B_UserItem BFX_EXTRUSION_DECL(B_UserItem) { BFX_INTRUSION(B_UserItem) int userdata[64]; } B_UserItem; BFX_EXTRUSION_FOLLOWUP(B_UserItem) #if defined(NDEBUG) || (defined(__cforall) && !defined(__CFA_DEBUG__)) enum { DefaultNumNodes = 1000, DefaultExperimentDurSec = 1, DefaultCheckDoneFreq = 1000, DefaultExperimentDurOpCount = -1 }; #define TRACE(tp) #else enum { DefaultNumNodes = 10, DefaultExperimentDurSec = 1, DefaultCheckDoneFreq = 2, DefaultExperimentDurOpCount = 20 }; static const char * tp_filter // = ""; // = "+ea"; = "*"; #define TRACE(tp) \ if (strcmp("*", tp_filter) == 0 || strchr(tp_filter, tp)) { \ printf("%c", tp); \ bobs_report(); \ } #endif static B_UserItem *ui = NULL; static BFX_LISTED_ELEM_T(B_UserItem) *listedItems = NULL; static BFX_LISTED_ELEM_T(B_UserItem) observedItem; static BFX_LIST_HEAD_T(B_UserItem) lst; MAYBE_EXTERN_C ( volatile size_t bobs_ops_completed = 0; volatile unsigned int bobs_prog_inserting = 0; volatile unsigned int bobs_prog_removing = 0; volatile unsigned int bobs_prog_rollover_flag = 0; void bobs_seek(unsigned int i) { observedItem = listedItems[i]; } void bobs_moveNext() { observedItem = BFX_GET_AFTER(B_UserItem, lst, observedItem); } void bobs_movePrev() { observedItem = BFX_GET_BEFORE(B_UserItem, lst, observedItem); } int bobs_hasCurrent() { return BFX_IS_VALID_POS(B_UserItem, lst, observedItem); } int bobs_getCurrent() { B_UserItem * curUI = BFX_DEREF_POS(B_UserItem, lst, observedItem); return curUI->userdata[17]; } enum bobs_op_movement_t bobs_op_movement = OP_MOVEMENT; enum bobs_op_polarity_t bobs_op_polarity = OP_POLARITY; ) unsigned int uDefaultPreemption() { return 0; } int main(int argc, const char *argv[]) { const char * usage_args = "[ExperimentDurSec [CheckDoneFreq [NumNodes [ExperimentDurOpCount]]]]"; const int static_arg_posns = 4; unsigned int ExperimentDurSec = DefaultExperimentDurSec; unsigned int CheckDoneFreq = DefaultCheckDoneFreq; unsigned int NumNodes = DefaultNumNodes; size_t ExperimentDurOpCount = DefaultExperimentDurOpCount; switch (((argc - 1) < static_arg_posns) ? (argc - 1) : static_arg_posns) { case 4: ExperimentDurOpCount = atol(argv[4]); case 3: NumNodes = atoi(argv[3]); case 2: CheckDoneFreq = atoi(argv[2]); case 1: ExperimentDurSec = atoi(argv[1]); } if (ExperimentDurSec == 0 || CheckDoneFreq == 0 || NumNodes == 0 || ExperimentDurOpCount == 0 ) { printf("usage: %s %s\n", argv[0], usage_args); return -1; } #ifdef DISABLE_CLOCK_RECHECK if (ExperimentDurSec != -1) { printf("Error: experiment compiled as fixed-work only. ExperimentDurSec (currently %d) must be set to -1.\nUsage: %s %s\n", ExperimentDurSec, argv[0], usage_args); return -1; } #endif ui = (B_UserItem*) malloc( NumNodes * sizeof(B_UserItem) ); memset(ui, 0, NumNodes * sizeof(B_UserItem)); listedItems = (BFX_LISTED_ELEM_T(B_UserItem)*)malloc( NumNodes * sizeof(BFX_LISTED_ELEM_T(B_UserItem)) ); memset(listedItems, 0, NumNodes * sizeof(BFX_LISTED_ELEM_T(B_UserItem))); printf("ui @ %p\nlistedItems @ %p\n\n", ui, listedItems); for (int i = 0; i < NumNodes; i++) { B_UserItem * curUI = & ui[i]; curUI->userdata[17] = i; } BFX_INIT(B_UserItem, lst); bobs_init(NumNodes); // BOP Convention: // Action-number arguments are for the BOP cartridge to interpret. // I.e. the driver assumes no relationship between BOP_INSERT(_,_,xx) and ui[xx]. // Logical insert number 0 and remove number n-1 are given with a distinguished hook. // Logical insert numbers [1,n) and remove numbers [0,n-1) are pumped by the basic SUT hooks. // This pattern lets BOP cartridges that measure element-level operations know statically when there is a reference element in the list. // Default init/teardown is insert/remove // Cartridges whose SUT insert/remove actions work on empty lists need not provide special-case ones. #ifndef BOP_INIT #define BOP_INIT(lst, ui, iters, i) BOP_INSERT(lst, ui, iters, i) #endif #ifndef BOP_TEARDOWN #define BOP_TEARDOWN(lst, ui, iters, i) BOP_REMOVE(lst, ui, iters, i) #endif double elapsed_sec = 0; clock_t start = clock(); while (elapsed_sec <= (double) ExperimentDurSec && bobs_ops_completed < ExperimentDurOpCount) { for ( int t = 0; t < CheckDoneFreq; t += 1 ) { TRACE('a') listedItems[0] = BOP_INIT(lst, ui, listedItems, 0); TRACE('b') for ( int privateCurInsert = 1; (bobs_prog_inserting = privateCurInsert, privateCurInsert < NumNodes); privateCurInsert += 1 ) { TRACE('-') listedItems[privateCurInsert] = BOP_INSERT( lst, ui, listedItems, privateCurInsert ); TRACE('+') } TRACE('c') for ( int privateCurRemove = 1; (bobs_prog_removing = privateCurRemove, privateCurRemove < NumNodes); privateCurRemove += 1 ) { TRACE('-') BOP_REMOVE( lst, ui, listedItems, privateCurRemove-1 ); TRACE('+') } TRACE('D') BOP_TEARDOWN(lst, ui, listedItems, NumNodes-1); TRACE('d') bobs_prog_rollover_flag = 1; TRACE('e') bobs_prog_inserting = 0; bobs_prog_removing = 0; bobs_ops_completed += NumNodes; TRACE('f') bobs_prog_rollover_flag = 0; TRACE('g') } #ifndef DISABLE_CLOCK_RECHECK clock_t end = clock(); elapsed_sec = ((double)(end - start)) / ((double)CLOCKS_PER_SEC); #endif } #ifdef DISABLE_CLOCK_RECHECK { clock_t end = clock(); elapsed_sec = ((double)(end - start)) / ((double)CLOCKS_PER_SEC); } #endif double mean_op_dur_ns = elapsed_sec / ((double)bobs_ops_completed) * 1000 * 1000 * 1000; printf("%s,%zd,%f,%f\n", argv[0], bobs_ops_completed, elapsed_sec, mean_op_dur_ns); free(ui); free(listedItems); }