rev |
line source |
seanhalle@0
|
1 /*
|
seanhalle@0
|
2 * Copyright 2010 OpenSourceCodeStewardshipFoundation
|
seanhalle@0
|
3 *
|
seanhalle@0
|
4 * Licensed under BSD
|
seanhalle@0
|
5 */
|
seanhalle@0
|
6
|
seanhalle@0
|
7 #include <stdio.h>
|
seanhalle@0
|
8 #include <stdlib.h>
|
seanhalle@0
|
9 #include <malloc.h>
|
seanhalle@0
|
10
|
seanhalle@0
|
11 #include "Queue_impl/PrivateQueue.h"
|
seanhalle@0
|
12 #include "Hash_impl/PrivateHash.h"
|
seanhalle@0
|
13
|
seanhalle@2
|
14 #include "VSs.h"
|
seanhalle@3
|
15 #include "Measurement/VSs_Counter_Recording.h"
|
seanhalle@0
|
16
|
seanhalle@0
|
17 //==========================================================================
|
seanhalle@0
|
18
|
seanhalle@0
|
19 void
|
seanhalle@2
|
20 VSs__init();
|
seanhalle@0
|
21
|
seanhalle@0
|
22 void
|
seanhalle@2
|
23 VSs__init_Helper();
|
seanhalle@0
|
24 //==========================================================================
|
seanhalle@0
|
25
|
seanhalle@0
|
26
|
seanhalle@0
|
27
|
seanhalle@0
|
28 //===========================================================================
|
seanhalle@0
|
29
|
seanhalle@0
|
30
|
seanhalle@0
|
31 /*These are the library functions *called in the application*
|
seanhalle@0
|
32 *
|
seanhalle@0
|
33 *There's a pattern for the outside sequential code to interact with the
|
seanhalle@0
|
34 * VMS_HW code.
|
seanhalle@2
|
35 *The VMS_HW system is inside a boundary.. every VSs system is in its
|
seanhalle@0
|
36 * own directory that contains the functions for each of the processor types.
|
seanhalle@0
|
37 * One of the processor types is the "seed" processor that starts the
|
seanhalle@0
|
38 * cascade of creating all the processors that do the work.
|
seanhalle@0
|
39 *So, in the directory is a file called "EntryPoint.c" that contains the
|
seanhalle@0
|
40 * function, named appropriately to the work performed, that the outside
|
seanhalle@0
|
41 * sequential code calls. This function follows a pattern:
|
seanhalle@2
|
42 *1) it calls VSs__init()
|
seanhalle@0
|
43 *2) it creates the initial data for the seed processor, which is passed
|
seanhalle@0
|
44 * in to the function
|
seanhalle@2
|
45 *3) it creates the seed VSs processor, with the data to start it with.
|
seanhalle@2
|
46 *4) it calls startVSsThenWaitUntilWorkDone
|
seanhalle@0
|
47 *5) it gets the returnValue from the transfer struc and returns that
|
seanhalle@0
|
48 * from the function
|
seanhalle@0
|
49 *
|
seanhalle@2
|
50 *For now, a new VSs system has to be created via VSs__init every
|
seanhalle@0
|
51 * time an entry point function is called -- later, might add letting the
|
seanhalle@2
|
52 * VSs system be created once, and let all the entry points just reuse
|
seanhalle@0
|
53 * it -- want to be as simple as possible now, and see by using what makes
|
seanhalle@0
|
54 * sense for later..
|
seanhalle@0
|
55 */
|
seanhalle@0
|
56
|
seanhalle@0
|
57
|
seanhalle@0
|
58
|
seanhalle@0
|
59 //===========================================================================
|
seanhalle@0
|
60
|
seanhalle@0
|
61 /*This is the "border crossing" function -- the thing that crosses from the
|
seanhalle@0
|
62 * outside world, into the VMS_HW world. It initializes and starts up the
|
seanhalle@0
|
63 * VMS system, then creates one processor from the specified function and
|
seanhalle@0
|
64 * puts it into the readyQ. From that point, that one function is resp.
|
seanhalle@0
|
65 * for creating all the other processors, that then create others, and so
|
seanhalle@0
|
66 * forth.
|
seanhalle@0
|
67 *When all the processors, including the seed, have dissipated, then this
|
seanhalle@0
|
68 * function returns. The results will have been written by side-effect via
|
seanhalle@0
|
69 * pointers read from, or written into initData.
|
seanhalle@0
|
70 *
|
seanhalle@0
|
71 *NOTE: no Threads should exist in the outside program that might touch
|
seanhalle@0
|
72 * any of the data reachable from initData passed in to here
|
seanhalle@0
|
73 */
|
seanhalle@0
|
74 void
|
seanhalle@2
|
75 VSs__create_seed_slave_and_do_work( TopLevelFnPtr fnPtr, void *initData )
|
seanhalle@6
|
76 { VSsSemEnv *semEnv;
|
seanhalle@6
|
77 SlaveVP *seedSlv;
|
seanhalle@6
|
78 VSsSemData *semData;
|
seanhalle@8
|
79 VSsTaskStub *threadTaskStub, *parentTaskStub;
|
seanhalle@0
|
80
|
seanhalle@2
|
81 VSs__init(); //normal multi-thd
|
seanhalle@0
|
82
|
seanhalle@0
|
83 semEnv = _VMSMasterEnv->semanticEnv;
|
seanhalle@0
|
84
|
seanhalle@2
|
85 //VSs starts with one processor, which is put into initial environ,
|
seanhalle@0
|
86 // and which then calls create() to create more, thereby expanding work
|
seanhalle@3
|
87 seedSlv = VSs__create_slave_helper( fnPtr, initData,
|
seanhalle@6
|
88 semEnv, semEnv->nextCoreToGetNewSlv++ );
|
seanhalle@3
|
89
|
seanhalle@8
|
90 //seed slave is a thread slave, so make a thread's task stub for it
|
seanhalle@8
|
91 // and then make another to stand for the seed's parent task. Make
|
seanhalle@8
|
92 // the parent be already ended, and have one child (the seed). This
|
seanhalle@8
|
93 // will make the dissipate handler do the right thing when the seed
|
seanhalle@8
|
94 // is dissipated.
|
seanhalle@8
|
95 threadTaskStub = create_thread_task_stub( initData );
|
seanhalle@8
|
96 parentTaskStub = create_thread_task_stub( NULL );
|
seanhalle@8
|
97 parentTaskStub->isEnded = TRUE;
|
seanhalle@8
|
98 parentTaskStub->numLiveChildThreads = 1; //so dissipate works for seed
|
nengel@11
|
99 threadTaskStub->parentTaskStub = parentTaskStub;
|
seanhalle@6
|
100
|
seanhalle@6
|
101 semData = (VSsSemData *)seedSlv->semanticData;
|
seanhalle@8
|
102 //seedVP is a thread, so has a permanent task
|
seanhalle@6
|
103 semData->needsTaskAssigned = FALSE;
|
seanhalle@8
|
104 semData->taskStub = threadTaskStub;
|
nengel@13
|
105 semData->slaveType = ThreadSlv;
|
seanhalle@0
|
106
|
seanhalle@6
|
107 resume_slaveVP( seedSlv, semEnv ); //returns right away, just queues Slv
|
seanhalle@0
|
108
|
seanhalle@0
|
109 VMS_SS__start_the_work_then_wait_until_done(); //normal multi-thd
|
seanhalle@0
|
110
|
seanhalle@2
|
111 VSs__cleanup_after_shutdown();
|
seanhalle@0
|
112 }
|
seanhalle@0
|
113
|
seanhalle@0
|
114
|
seanhalle@0
|
115 int32
|
seanhalle@2
|
116 VSs__giveMinWorkUnitCycles( float32 percentOverhead )
|
seanhalle@0
|
117 {
|
seanhalle@0
|
118 return MIN_WORK_UNIT_CYCLES;
|
seanhalle@0
|
119 }
|
seanhalle@0
|
120
|
seanhalle@0
|
121 int32
|
seanhalle@2
|
122 VSs__giveIdealNumWorkUnits()
|
seanhalle@0
|
123 {
|
seanhalle@0
|
124 return NUM_ANIM_SLOTS * NUM_CORES;
|
seanhalle@0
|
125 }
|
seanhalle@0
|
126
|
seanhalle@0
|
127 int32
|
seanhalle@2
|
128 VSs__give_number_of_cores_to_schedule_onto()
|
seanhalle@0
|
129 {
|
seanhalle@0
|
130 return NUM_CORES;
|
seanhalle@0
|
131 }
|
seanhalle@0
|
132
|
seanhalle@0
|
133 /*For now, use TSC -- later, make these two macros with assembly that first
|
seanhalle@0
|
134 * saves jump point, and second jumps back several times to get reliable time
|
seanhalle@0
|
135 */
|
seanhalle@0
|
136 void
|
seanhalle@2
|
137 VSs__start_primitive()
|
seanhalle@2
|
138 { saveLowTimeStampCountInto( ((VSsSemEnv *)(_VMSMasterEnv->semanticEnv))->
|
seanhalle@0
|
139 primitiveStartTime );
|
seanhalle@0
|
140 }
|
seanhalle@0
|
141
|
seanhalle@0
|
142 /*Just quick and dirty for now -- make reliable later
|
seanhalle@0
|
143 * will want this to jump back several times -- to be sure cache is warm
|
seanhalle@0
|
144 * because don't want comm time included in calc-time measurement -- and
|
seanhalle@0
|
145 * also to throw out any "weird" values due to OS interrupt or TSC rollover
|
seanhalle@0
|
146 */
|
seanhalle@0
|
147 int32
|
seanhalle@2
|
148 VSs__end_primitive_and_give_cycles()
|
seanhalle@0
|
149 { int32 endTime, startTime;
|
seanhalle@0
|
150 //TODO: fix by repeating time-measurement
|
seanhalle@0
|
151 saveLowTimeStampCountInto( endTime );
|
seanhalle@2
|
152 startTime =((VSsSemEnv*)(_VMSMasterEnv->semanticEnv))->primitiveStartTime;
|
seanhalle@0
|
153 return (endTime - startTime);
|
seanhalle@0
|
154 }
|
seanhalle@0
|
155
|
seanhalle@0
|
156 //===========================================================================
|
seanhalle@0
|
157
|
seanhalle@2
|
158 /*Initializes all the data-structures for a VSs system -- but doesn't
|
seanhalle@0
|
159 * start it running yet!
|
seanhalle@0
|
160 *
|
seanhalle@0
|
161 *This runs in the main thread -- before VMS starts up
|
seanhalle@0
|
162 *
|
seanhalle@0
|
163 *This sets up the semantic layer over the VMS system
|
seanhalle@0
|
164 *
|
seanhalle@0
|
165 *First, calls VMS_Setup, then creates own environment, making it ready
|
seanhalle@0
|
166 * for creating the seed processor and then starting the work.
|
seanhalle@0
|
167 */
|
seanhalle@0
|
168 void
|
seanhalle@2
|
169 VSs__init()
|
seanhalle@0
|
170 {
|
seanhalle@0
|
171 VMS_SS__init();
|
seanhalle@0
|
172 //masterEnv, a global var, now is partially set up by init_VMS
|
seanhalle@0
|
173 // after this, have VMS_int__malloc and VMS_int__free available
|
seanhalle@0
|
174
|
seanhalle@2
|
175 VSs__init_Helper();
|
seanhalle@0
|
176 }
|
seanhalle@0
|
177
|
seanhalle@0
|
178
|
seanhalle@0
|
179 void idle_fn(void* data, SlaveVP *animatingSlv){
|
seanhalle@0
|
180 while(1){
|
seanhalle@0
|
181 VMS_int__suspend_slaveVP_and_send_req(animatingSlv);
|
seanhalle@0
|
182 }
|
seanhalle@0
|
183 }
|
seanhalle@0
|
184
|
seanhalle@0
|
185 void
|
seanhalle@2
|
186 VSs__init_Helper()
|
seanhalle@2
|
187 { VSsSemEnv *semanticEnv;
|
seanhalle@6
|
188 int32 i, coreNum, slotNum;
|
seanhalle@10
|
189 VSsSemData *semData;
|
seanhalle@0
|
190
|
seanhalle@0
|
191 //Hook up the semantic layer's plug-ins to the Master virt procr
|
seanhalle@2
|
192 _VMSMasterEnv->requestHandler = &VSs__Request_Handler;
|
seanhalle@2
|
193 _VMSMasterEnv->slaveAssigner = &VSs__assign_slaveVP_to_slot;
|
seanhalle@0
|
194 #ifdef HOLISTIC__TURN_ON_PERF_COUNTERS
|
seanhalle@2
|
195 _VMSMasterEnv->counterHandler = &VSs__counter_handler;
|
seanhalle@0
|
196 #endif
|
seanhalle@0
|
197
|
seanhalle@0
|
198 //create the semantic layer's environment (all its data) and add to
|
seanhalle@0
|
199 // the master environment
|
seanhalle@2
|
200 semanticEnv = VMS_int__malloc( sizeof( VSsSemEnv ) );
|
seanhalle@0
|
201 _VMSMasterEnv->semanticEnv = semanticEnv;
|
seanhalle@0
|
202
|
seanhalle@0
|
203 #ifdef HOLISTIC__TURN_ON_PERF_COUNTERS
|
seanhalle@2
|
204 VSs__init_counter_data_structs();
|
seanhalle@0
|
205 #endif
|
seanhalle@3
|
206
|
seanhalle@0
|
207 semanticEnv->shutdownInitiated = FALSE;
|
seanhalle@3
|
208 semanticEnv->coreIsDone = VMS_int__malloc( NUM_CORES * sizeof( bool32 ) );
|
seanhalle@6
|
209 //For each animation slot, there is an idle slave, and an initial
|
seanhalle@6
|
210 // slave assigned as the current-task-slave. Create them here.
|
seanhalle@10
|
211 SlaveVP *idleSlv, *slotTaskSlv;
|
seanhalle@6
|
212 for( coreNum = 0; coreNum < NUM_CORES; coreNum++ )
|
seanhalle@6
|
213 { semanticEnv->coreIsDone[coreNum] = FALSE; //use during shutdown
|
seanhalle@6
|
214
|
seanhalle@6
|
215 for( slotNum = 0; slotNum < NUM_ANIM_SLOTS; ++slotNum )
|
seanhalle@10
|
216 { idleSlv = VSs__create_slave_helper( &idle_fn, NULL, semanticEnv, 0);
|
seanhalle@6
|
217 idleSlv->coreAnimatedBy = coreNum;
|
seanhalle@9
|
218 idleSlv->animSlotAssignedTo =
|
seanhalle@9
|
219 _VMSMasterEnv->allAnimSlots[coreNum][slotNum];
|
seanhalle@6
|
220 semanticEnv->idleSlv[coreNum][slotNum] = idleSlv;
|
seanhalle@6
|
221
|
seanhalle@10
|
222 slotTaskSlv = VSs__create_slave_helper( &idle_fn, NULL, semanticEnv, 0);
|
seanhalle@10
|
223 slotTaskSlv->coreAnimatedBy = coreNum;
|
seanhalle@10
|
224 slotTaskSlv->animSlotAssignedTo =
|
seanhalle@9
|
225 _VMSMasterEnv->allAnimSlots[coreNum][slotNum];
|
seanhalle@10
|
226
|
seanhalle@10
|
227 semData = slotTaskSlv->semanticData;
|
seanhalle@10
|
228 semData->needsTaskAssigned = TRUE;
|
seanhalle@10
|
229 semData->slaveType = SlotTaskSlv;
|
seanhalle@10
|
230 semanticEnv->slotTaskSlvs[coreNum][slotNum] = slotTaskSlv;
|
seanhalle@0
|
231 }
|
seanhalle@3
|
232 }
|
seanhalle@0
|
233
|
seanhalle@6
|
234 //create the ready queues, hash tables used for matching and so forth
|
seanhalle@6
|
235 semanticEnv->slavesReadyToResumeQ = makeVMSQ();
|
seanhalle@9
|
236 semanticEnv->freeExtraTaskSlvQ = makeVMSQ();
|
seanhalle@6
|
237 semanticEnv->taskReadyQ = makeVMSQ();
|
seanhalle@0
|
238
|
seanhalle@3
|
239 semanticEnv->argPtrHashTbl = makeHashTable32( 16, &VMS_int__free );
|
seanhalle@4
|
240 semanticEnv->commHashTbl = makeHashTable32( 16, &VMS_int__free );
|
seanhalle@6
|
241
|
seanhalle@6
|
242 semanticEnv->nextCoreToGetNewSlv = 0;
|
seanhalle@6
|
243
|
seanhalle@0
|
244
|
seanhalle@0
|
245 //TODO: bug -- turn these arrays into dyn arrays to eliminate limit
|
seanhalle@0
|
246 //semanticEnv->singletonHasBeenExecutedFlags = makeDynArrayInfo( );
|
seanhalle@0
|
247 //semanticEnv->transactionStrucs = makeDynArrayInfo( );
|
seanhalle@0
|
248 for( i = 0; i < NUM_STRUCS_IN_SEM_ENV; i++ )
|
seanhalle@0
|
249 {
|
seanhalle@0
|
250 semanticEnv->fnSingletons[i].endInstrAddr = NULL;
|
seanhalle@0
|
251 semanticEnv->fnSingletons[i].hasBeenStarted = FALSE;
|
seanhalle@0
|
252 semanticEnv->fnSingletons[i].hasFinished = FALSE;
|
seanhalle@0
|
253 semanticEnv->fnSingletons[i].waitQ = makeVMSQ();
|
seanhalle@0
|
254 semanticEnv->transactionStrucs[i].waitingVPQ = makeVMSQ();
|
seanhalle@0
|
255 }
|
seanhalle@6
|
256
|
seanhalle@8
|
257 semanticEnv->numLiveExtraTaskSlvs = 0; //must be last
|
seanhalle@8
|
258 semanticEnv->numLiveThreadSlvs = 1; //must be last, count the seed
|
seanhalle@6
|
259
|
seanhalle@6
|
260 #ifdef HOLISTIC__TURN_ON_OBSERVE_UCC
|
seanhalle@6
|
261 semanticEnv->unitList = makeListOfArrays(sizeof(Unit),128);
|
seanhalle@6
|
262 semanticEnv->ctlDependenciesList = makeListOfArrays(sizeof(Dependency),128);
|
seanhalle@6
|
263 semanticEnv->commDependenciesList = makeListOfArrays(sizeof(Dependency),128);
|
seanhalle@6
|
264 semanticEnv->dynDependenciesList = makeListOfArrays(sizeof(Dependency),128);
|
seanhalle@6
|
265 semanticEnv->ntonGroupsInfo = makePrivDynArrayOfSize((void***)&(semanticEnv->ntonGroups),8);
|
seanhalle@6
|
266
|
seanhalle@6
|
267 semanticEnv->hwArcs = makeListOfArrays(sizeof(Dependency),128);
|
seanhalle@6
|
268 memset(semanticEnv->last_in_slot,0,sizeof(NUM_CORES * NUM_ANIM_SLOTS * sizeof(Unit)));
|
seanhalle@6
|
269 #endif
|
seanhalle@0
|
270 }
|
seanhalle@0
|
271
|
seanhalle@0
|
272
|
seanhalle@2
|
273 /*Frees any memory allocated by VSs__init() then calls VMS_int__shutdown
|
seanhalle@0
|
274 */
|
seanhalle@0
|
275 void
|
seanhalle@2
|
276 VSs__cleanup_after_shutdown()
|
seanhalle@2
|
277 { VSsSemEnv *semanticEnv;
|
seanhalle@0
|
278
|
seanhalle@0
|
279 semanticEnv = _VMSMasterEnv->semanticEnv;
|
seanhalle@0
|
280
|
seanhalle@0
|
281 #ifdef HOLISTIC__TURN_ON_OBSERVE_UCC
|
seanhalle@0
|
282 //UCC
|
seanhalle@0
|
283 FILE* output;
|
seanhalle@0
|
284 int n;
|
seanhalle@0
|
285 char filename[255];
|
seanhalle@0
|
286 for(n=0;n<255;n++)
|
seanhalle@0
|
287 {
|
seanhalle@0
|
288 sprintf(filename, "./counters/UCC.%d",n);
|
seanhalle@0
|
289 output = fopen(filename,"r");
|
seanhalle@0
|
290 if(output)
|
seanhalle@0
|
291 {
|
seanhalle@0
|
292 fclose(output);
|
seanhalle@0
|
293 }else{
|
seanhalle@0
|
294 break;
|
seanhalle@0
|
295 }
|
seanhalle@0
|
296 }
|
seanhalle@0
|
297 if(n<255){
|
seanhalle@0
|
298 printf("Saving UCC to File: %s ...\n", filename);
|
seanhalle@0
|
299 output = fopen(filename,"w+");
|
seanhalle@0
|
300 if(output!=NULL){
|
seanhalle@0
|
301 set_dependency_file(output);
|
seanhalle@0
|
302 //fprintf(output,"digraph Dependencies {\n");
|
seanhalle@0
|
303 //set_dot_file(output);
|
seanhalle@0
|
304 //FIXME: first line still depends on counters being enabled, replace w/ unit struct!
|
seanhalle@0
|
305 //forAllInDynArrayDo(_VMSMasterEnv->counter_history_array_info, &print_dot_node_info );
|
seanhalle@0
|
306 forAllInListOfArraysDo(semanticEnv->unitList, &print_unit_to_file);
|
seanhalle@0
|
307 forAllInListOfArraysDo( semanticEnv->commDependenciesList, &print_comm_dependency_to_file );
|
seanhalle@0
|
308 forAllInListOfArraysDo( semanticEnv->ctlDependenciesList, &print_ctl_dependency_to_file );
|
seanhalle@0
|
309 forAllInDynArrayDo(semanticEnv->ntonGroupsInfo,&print_nton_to_file);
|
seanhalle@0
|
310 //fprintf(output,"}\n");
|
seanhalle@0
|
311 fflush(output);
|
seanhalle@0
|
312
|
seanhalle@0
|
313 } else
|
seanhalle@0
|
314 printf("Opening UCC file failed. Please check that folder \"counters\" exists in run directory and has write permission.\n");
|
seanhalle@0
|
315 } else {
|
seanhalle@0
|
316 printf("Could not open UCC file, please clean \"counters\" folder. (Must contain less than 255 files.)\n");
|
seanhalle@0
|
317 }
|
seanhalle@0
|
318 //Loop Graph
|
seanhalle@0
|
319 for(n=0;n<255;n++)
|
seanhalle@0
|
320 {
|
seanhalle@0
|
321 sprintf(filename, "./counters/LoopGraph.%d",n);
|
seanhalle@0
|
322 output = fopen(filename,"r");
|
seanhalle@0
|
323 if(output)
|
seanhalle@0
|
324 {
|
seanhalle@0
|
325 fclose(output);
|
seanhalle@0
|
326 }else{
|
seanhalle@0
|
327 break;
|
seanhalle@0
|
328 }
|
seanhalle@0
|
329 }
|
seanhalle@0
|
330 if(n<255){
|
seanhalle@0
|
331 printf("Saving LoopGraph to File: %s ...\n", filename);
|
seanhalle@0
|
332 output = fopen(filename,"w+");
|
seanhalle@0
|
333 if(output!=NULL){
|
seanhalle@0
|
334 set_dependency_file(output);
|
seanhalle@0
|
335 //fprintf(output,"digraph Dependencies {\n");
|
seanhalle@0
|
336 //set_dot_file(output);
|
seanhalle@0
|
337 //FIXME: first line still depends on counters being enabled, replace w/ unit struct!
|
seanhalle@0
|
338 //forAllInDynArrayDo(_VMSMasterEnv->counter_history_array_info, &print_dot_node_info );
|
seanhalle@0
|
339 forAllInListOfArraysDo( semanticEnv->unitList, &print_unit_to_file );
|
seanhalle@0
|
340 forAllInListOfArraysDo( semanticEnv->commDependenciesList, &print_comm_dependency_to_file );
|
seanhalle@0
|
341 forAllInListOfArraysDo( semanticEnv->ctlDependenciesList, &print_ctl_dependency_to_file );
|
seanhalle@0
|
342 forAllInListOfArraysDo( semanticEnv->dynDependenciesList, &print_dyn_dependency_to_file );
|
seanhalle@0
|
343 forAllInListOfArraysDo( semanticEnv->hwArcs, &print_hw_dependency_to_file );
|
seanhalle@0
|
344 //fprintf(output,"}\n");
|
seanhalle@0
|
345 fflush(output);
|
seanhalle@0
|
346
|
seanhalle@0
|
347 } else
|
seanhalle@0
|
348 printf("Opening LoopGraph file failed. Please check that folder \"counters\" exists in run directory and has write permission.\n");
|
seanhalle@0
|
349 } else {
|
seanhalle@0
|
350 printf("Could not open LoopGraph file, please clean \"counters\" folder. (Must contain less than 255 files.)\n");
|
seanhalle@0
|
351 }
|
seanhalle@0
|
352
|
seanhalle@0
|
353
|
seanhalle@0
|
354 freeListOfArrays(semanticEnv->unitList);
|
seanhalle@0
|
355 freeListOfArrays(semanticEnv->commDependenciesList);
|
seanhalle@0
|
356 freeListOfArrays(semanticEnv->ctlDependenciesList);
|
seanhalle@0
|
357 freeListOfArrays(semanticEnv->dynDependenciesList);
|
seanhalle@0
|
358
|
seanhalle@0
|
359 #endif
|
seanhalle@0
|
360 #ifdef HOLISTIC__TURN_ON_PERF_COUNTERS
|
seanhalle@0
|
361 for(n=0;n<255;n++)
|
seanhalle@0
|
362 {
|
seanhalle@0
|
363 sprintf(filename, "./counters/Counters.%d.csv",n);
|
seanhalle@0
|
364 output = fopen(filename,"r");
|
seanhalle@0
|
365 if(output)
|
seanhalle@0
|
366 {
|
seanhalle@0
|
367 fclose(output);
|
seanhalle@0
|
368 }else{
|
seanhalle@0
|
369 break;
|
seanhalle@0
|
370 }
|
seanhalle@0
|
371 }
|
seanhalle@0
|
372 if(n<255){
|
seanhalle@0
|
373 printf("Saving Counter measurements to File: %s ...\n", filename);
|
seanhalle@0
|
374 output = fopen(filename,"w+");
|
seanhalle@0
|
375 if(output!=NULL){
|
seanhalle@0
|
376 set_counter_file(output);
|
seanhalle@0
|
377 int i;
|
seanhalle@0
|
378 for(i=0;i<NUM_CORES;i++){
|
seanhalle@0
|
379 forAllInListOfArraysDo( semanticEnv->counterList[i], &print_counter_events_to_file );
|
seanhalle@0
|
380 fflush(output);
|
seanhalle@0
|
381 }
|
seanhalle@0
|
382
|
seanhalle@0
|
383 } else
|
seanhalle@0
|
384 printf("Opening UCC file failed. Please check that folder \"counters\" exists in run directory and has write permission.\n");
|
seanhalle@0
|
385 } else {
|
seanhalle@0
|
386 printf("Could not open UCC file, please clean \"counters\" folder. (Must contain less than 255 files.)\n");
|
seanhalle@0
|
387 }
|
seanhalle@0
|
388
|
seanhalle@0
|
389 #endif
|
seanhalle@0
|
390 /* It's all allocated inside VMS's big chunk -- that's about to be freed, so
|
seanhalle@0
|
391 * nothing to do here
|
seanhalle@0
|
392
|
seanhalle@0
|
393
|
seanhalle@0
|
394 for( coreIdx = 0; coreIdx < NUM_CORES; coreIdx++ )
|
seanhalle@0
|
395 {
|
seanhalle@0
|
396 VMS_int__free( semanticEnv->readyVPQs[coreIdx]->startOfData );
|
seanhalle@0
|
397 VMS_int__free( semanticEnv->readyVPQs[coreIdx] );
|
seanhalle@0
|
398 }
|
seanhalle@0
|
399 VMS_int__free( semanticEnv->readyVPQs );
|
seanhalle@0
|
400
|
seanhalle@0
|
401 freeHashTable( semanticEnv->commHashTbl );
|
seanhalle@0
|
402 VMS_int__free( _VMSMasterEnv->semanticEnv );
|
seanhalle@0
|
403 */
|
seanhalle@0
|
404 VMS_SS__cleanup_at_end_of_shutdown();
|
seanhalle@0
|
405 }
|
seanhalle@0
|
406
|
seanhalle@0
|
407
|
seanhalle@0
|
408 //===========================================================================
|
seanhalle@0
|
409
|
seanhalle@2
|
410 SlaveVP *
|
seanhalle@7
|
411 VSs__create_thread( TopLevelFnPtr fnPtr, void *initData,
|
seanhalle@7
|
412 SlaveVP *creatingThd )
|
seanhalle@2
|
413 { VSsSemReq reqData;
|
seanhalle@0
|
414
|
seanhalle@0
|
415 //the semantic request data is on the stack and disappears when this
|
seanhalle@0
|
416 // call returns -- it's guaranteed to remain in the VP's stack for as
|
seanhalle@0
|
417 // long as the VP is suspended.
|
seanhalle@0
|
418 reqData.reqType = 0; //know type because in a VMS create req
|
seanhalle@0
|
419 reqData.fnPtr = fnPtr;
|
seanhalle@0
|
420 reqData.initData = initData;
|
seanhalle@7
|
421 reqData.callingSlv = creatingThd;
|
seanhalle@0
|
422
|
seanhalle@7
|
423 VMS_WL__send_create_slaveVP_req( &reqData, creatingThd );
|
seanhalle@0
|
424
|
seanhalle@7
|
425 return creatingThd->dataRetFromReq;
|
seanhalle@0
|
426 }
|
seanhalle@0
|
427
|
seanhalle@10
|
428 /*This is always the last thing done in the code animated by a thread VP.
|
seanhalle@7
|
429 * Normally, this would be the last line of the thread's top level function.
|
seanhalle@7
|
430 * But, if the thread exits from any point, it has to do so by calling
|
seanhalle@7
|
431 * this.
|
seanhalle@10
|
432 *
|
seanhalle@10
|
433 *It simply sends a dissipate request, which handles all the state cleanup.
|
seanhalle@7
|
434 */
|
seanhalle@2
|
435 void
|
seanhalle@7
|
436 VSs__end_thread( SlaveVP *thdToEnd )
|
seanhalle@8
|
437 { VSsSemData *semData;
|
seanhalle@8
|
438
|
seanhalle@7
|
439 VMS_WL__send_dissipate_req( thdToEnd );
|
seanhalle@0
|
440 }
|
seanhalle@0
|
441
|
seanhalle@0
|
442
|
seanhalle@10
|
443
|
seanhalle@0
|
444 //===========================================================================
|
seanhalle@0
|
445
|
seanhalle@0
|
446
|
seanhalle@4
|
447 //======================= task submit and end ==============================
|
seanhalle@4
|
448 /*
|
seanhalle@2
|
449 */
|
seanhalle@4
|
450 void
|
seanhalle@2
|
451 VSs__submit_task( VSsTaskType *taskType, void *args, SlaveVP *animSlv)
|
seanhalle@2
|
452 { VSsSemReq reqData;
|
seanhalle@0
|
453
|
seanhalle@2
|
454 reqData.reqType = submit_task;
|
seanhalle@4
|
455
|
seanhalle@2
|
456 reqData.taskType = taskType;
|
seanhalle@2
|
457 reqData.args = args;
|
seanhalle@4
|
458 reqData.callingSlv = animSlv;
|
seanhalle@2
|
459
|
seanhalle@4
|
460 reqData.taskID = NULL;
|
seanhalle@2
|
461
|
seanhalle@2
|
462 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@0
|
463 }
|
seanhalle@0
|
464
|
seanhalle@4
|
465 inline int32 *
|
seanhalle@4
|
466 VSs__create_taskID_of_size( int32 numInts, SlaveVP *animSlv )
|
seanhalle@4
|
467 { int32 *taskID;
|
seanhalle@4
|
468
|
seanhalle@4
|
469 taskID = VMS_WL__malloc( sizeof(int32) + numInts * sizeof(int32) );
|
seanhalle@4
|
470 taskID[0] = numInts;
|
seanhalle@4
|
471 return taskID;
|
seanhalle@4
|
472 }
|
seanhalle@4
|
473
|
seanhalle@4
|
474 void
|
seanhalle@4
|
475 VSs__submit_task_with_ID( VSsTaskType *taskType, void *args, int32 *taskID,
|
seanhalle@4
|
476 SlaveVP *animSlv)
|
seanhalle@4
|
477 { VSsSemReq reqData;
|
seanhalle@4
|
478
|
seanhalle@4
|
479 reqData.reqType = submit_task;
|
seanhalle@4
|
480
|
seanhalle@4
|
481 reqData.taskType = taskType;
|
seanhalle@4
|
482 reqData.args = args;
|
seanhalle@4
|
483 reqData.taskID = taskID;
|
seanhalle@4
|
484 reqData.callingSlv = animSlv;
|
seanhalle@4
|
485
|
seanhalle@4
|
486 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@4
|
487 }
|
seanhalle@4
|
488
|
seanhalle@4
|
489
|
seanhalle@4
|
490 /*This call is the last to happen in every task. It causes the slave to
|
seanhalle@2
|
491 * suspend and get the next task out of the task-queue. Notice there is no
|
seanhalle@2
|
492 * assigner here.. only one slave, no slave ReadyQ, and so on..
|
seanhalle@2
|
493 *Can either make the assigner take the next task out of the taskQ, or can
|
seanhalle@2
|
494 * leave all as it is, and make task-end take the next task.
|
seanhalle@2
|
495 *Note: this fits the case in the new VMS for no-context tasks, so will use
|
seanhalle@2
|
496 * the built-in taskQ of new VMS, and should be local and much faster.
|
seanhalle@2
|
497 *
|
seanhalle@2
|
498 *The task-stub is saved in the animSlv, so the request handler will get it
|
seanhalle@2
|
499 * from there, along with the task-type which has arg types, and so on..
|
seanhalle@4
|
500 *
|
seanhalle@4
|
501 * NOTE: if want, don't need to send the animating SlaveVP around..
|
seanhalle@4
|
502 * instead, can make a single slave per core, and coreCtrlr looks up the
|
seanhalle@4
|
503 * slave from having the core number.
|
seanhalle@4
|
504 *
|
seanhalle@4
|
505 *But, to stay compatible with all the other VMS languages, leave it in..
|
seanhalle@0
|
506 */
|
seanhalle@0
|
507 void
|
seanhalle@2
|
508 VSs__end_task( SlaveVP *animSlv )
|
seanhalle@2
|
509 { VSsSemReq reqData;
|
seanhalle@0
|
510
|
seanhalle@2
|
511 reqData.reqType = end_task;
|
seanhalle@2
|
512 reqData.callingSlv = animSlv;
|
seanhalle@2
|
513
|
seanhalle@2
|
514 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@0
|
515 }
|
seanhalle@0
|
516
|
seanhalle@4
|
517
|
nengel@5
|
518 void
|
nengel@5
|
519 VSs__taskwait(SlaveVP *animSlv)
|
nengel@5
|
520 {
|
nengel@5
|
521 VSsSemReq reqData;
|
nengel@5
|
522
|
nengel@5
|
523 reqData.reqType = taskwait;
|
nengel@5
|
524 reqData.callingSlv = animSlv;
|
nengel@5
|
525
|
nengel@5
|
526 VMS_WL__send_sem_request( &reqData, animSlv );
|
nengel@5
|
527 }
|
nengel@5
|
528
|
nengel@5
|
529
|
nengel@5
|
530
|
seanhalle@4
|
531 //========================== send and receive ============================
|
seanhalle@4
|
532 //
|
seanhalle@4
|
533
|
seanhalle@4
|
534 inline int32 *
|
seanhalle@4
|
535 VSs__give_self_taskID( SlaveVP *animSlv )
|
seanhalle@4
|
536 {
|
seanhalle@4
|
537 return ((VSsSemData*)animSlv->semanticData)->taskStub->taskID;
|
seanhalle@4
|
538 }
|
seanhalle@4
|
539
|
seanhalle@4
|
540 //================================ send ===================================
|
seanhalle@4
|
541
|
seanhalle@4
|
542 void
|
seanhalle@4
|
543 VSs__send_of_type_to( void *msg, const int32 type, int32 *receiverID,
|
seanhalle@4
|
544 SlaveVP *senderSlv )
|
seanhalle@4
|
545 { VSsSemReq reqData;
|
seanhalle@4
|
546
|
seanhalle@4
|
547 reqData.reqType = send_type_to;
|
seanhalle@4
|
548
|
seanhalle@4
|
549 reqData.msg = msg;
|
seanhalle@4
|
550 reqData.msgType = type;
|
seanhalle@4
|
551 reqData.receiverID = receiverID;
|
seanhalle@4
|
552 reqData.senderSlv = senderSlv;
|
seanhalle@4
|
553
|
seanhalle@4
|
554 reqData.nextReqInHashEntry = NULL;
|
seanhalle@4
|
555
|
seanhalle@4
|
556 VMS_WL__send_sem_request( &reqData, senderSlv );
|
seanhalle@4
|
557
|
seanhalle@4
|
558 //When come back from suspend, no longer own data reachable from msg
|
seanhalle@4
|
559 }
|
seanhalle@4
|
560
|
seanhalle@4
|
561 void
|
seanhalle@4
|
562 VSs__send_from_to( void *msg, int32 *senderID, int32 *receiverID, SlaveVP *senderSlv )
|
seanhalle@4
|
563 { VSsSemReq reqData;
|
seanhalle@4
|
564
|
seanhalle@4
|
565 reqData.reqType = send_from_to;
|
seanhalle@4
|
566
|
seanhalle@4
|
567 reqData.msg = msg;
|
seanhalle@4
|
568 reqData.senderID = senderID;
|
seanhalle@4
|
569 reqData.receiverID = receiverID;
|
seanhalle@4
|
570 reqData.senderSlv = senderSlv;
|
seanhalle@4
|
571
|
seanhalle@4
|
572 reqData.nextReqInHashEntry = NULL;
|
seanhalle@4
|
573
|
seanhalle@4
|
574 VMS_WL__send_sem_request( &reqData, senderSlv );
|
seanhalle@4
|
575 }
|
seanhalle@4
|
576
|
seanhalle@4
|
577
|
seanhalle@4
|
578 //================================ receive ================================
|
seanhalle@4
|
579
|
seanhalle@4
|
580 /*The "type" version of send and receive creates a many-to-one relationship.
|
seanhalle@4
|
581 * The sender is anonymous, and many sends can stack up, waiting to be
|
seanhalle@4
|
582 * received. The same receiver can also have send from-to's
|
seanhalle@4
|
583 * waiting for it, and those will be kept separate from the "type"
|
seanhalle@4
|
584 * messages.
|
seanhalle@4
|
585 */
|
seanhalle@4
|
586 void *
|
seanhalle@4
|
587 VSs__receive_type_to( const int32 type, int32* receiverID, SlaveVP *receiverSlv )
|
seanhalle@4
|
588 { DEBUG__printf1(dbgRqstHdlr,"WL: receive type to %d",receiverID[1] );
|
seanhalle@4
|
589 VSsSemReq reqData;
|
seanhalle@4
|
590
|
seanhalle@4
|
591 reqData.reqType = receive_type_to;
|
seanhalle@4
|
592
|
seanhalle@4
|
593 reqData.msgType = type;
|
seanhalle@4
|
594 reqData.receiverID = receiverID;
|
seanhalle@4
|
595 reqData.receiverSlv = receiverSlv;
|
seanhalle@4
|
596
|
seanhalle@4
|
597 reqData.nextReqInHashEntry = NULL;
|
seanhalle@4
|
598
|
seanhalle@4
|
599 VMS_WL__send_sem_request( &reqData, receiverSlv );
|
seanhalle@4
|
600
|
seanhalle@4
|
601 return receiverSlv->dataRetFromReq;
|
seanhalle@4
|
602 }
|
seanhalle@4
|
603
|
seanhalle@4
|
604
|
seanhalle@4
|
605
|
seanhalle@4
|
606 /*Call this at the point a receiving task wants in-coming data.
|
seanhalle@4
|
607 * Use this from-to form when know senderID -- it makes a direct channel
|
seanhalle@4
|
608 * between sender and receiver.
|
seanhalle@4
|
609 */
|
seanhalle@4
|
610 void *
|
seanhalle@4
|
611 VSs__receive_from_to( int32 *senderID, int32 *receiverID, SlaveVP *receiverSlv )
|
seanhalle@4
|
612 {
|
seanhalle@4
|
613 VSsSemReq reqData;
|
seanhalle@4
|
614
|
seanhalle@4
|
615 reqData.reqType = receive_from_to;
|
seanhalle@4
|
616
|
seanhalle@4
|
617 reqData.senderID = senderID;
|
seanhalle@4
|
618 reqData.receiverID = receiverID;
|
seanhalle@4
|
619 reqData.receiverSlv = receiverSlv;
|
seanhalle@4
|
620
|
seanhalle@4
|
621 reqData.nextReqInHashEntry = NULL;
|
seanhalle@4
|
622 DEBUG__printf2(dbgRqstHdlr,"WL: receive from %d to: %d", reqData.senderID[1], reqData.receiverID[1]);
|
seanhalle@4
|
623
|
seanhalle@4
|
624 VMS_WL__send_sem_request( &reqData, receiverSlv );
|
seanhalle@4
|
625
|
seanhalle@4
|
626 return receiverSlv->dataRetFromReq;
|
seanhalle@4
|
627 }
|
seanhalle@4
|
628
|
seanhalle@4
|
629
|
seanhalle@4
|
630
|
seanhalle@4
|
631
|
seanhalle@2
|
632 //==========================================================================
|
seanhalle@0
|
633 //
|
seanhalle@0
|
634 /*A function singleton is a function whose body executes exactly once, on a
|
seanhalle@0
|
635 * single core, no matter how many times the fuction is called and no
|
seanhalle@0
|
636 * matter how many cores or the timing of cores calling it.
|
seanhalle@0
|
637 *
|
seanhalle@0
|
638 *A data singleton is a ticket attached to data. That ticket can be used
|
seanhalle@0
|
639 * to get the data through the function exactly once, no matter how many
|
seanhalle@0
|
640 * times the data is given to the function, and no matter the timing of
|
seanhalle@0
|
641 * trying to get the data through from different cores.
|
seanhalle@0
|
642 */
|
seanhalle@0
|
643
|
seanhalle@0
|
644 /*asm function declarations*/
|
seanhalle@2
|
645 void asm_save_ret_to_singleton(VSsSingleton *singletonPtrAddr);
|
seanhalle@2
|
646 void asm_write_ret_from_singleton(VSsSingleton *singletonPtrAddr);
|
seanhalle@0
|
647
|
seanhalle@0
|
648 /*Fn singleton uses ID as index into array of singleton structs held in the
|
seanhalle@0
|
649 * semantic environment.
|
seanhalle@0
|
650 */
|
seanhalle@0
|
651 void
|
seanhalle@3
|
652 VSs__start_fn_singleton( int32 singletonID, SlaveVP *animSlv )
|
seanhalle@0
|
653 {
|
seanhalle@2
|
654 VSsSemReq reqData;
|
seanhalle@0
|
655
|
seanhalle@0
|
656 //
|
seanhalle@0
|
657 reqData.reqType = singleton_fn_start;
|
seanhalle@0
|
658 reqData.singletonID = singletonID;
|
seanhalle@0
|
659
|
seanhalle@3
|
660 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@3
|
661 if( animSlv->dataRetFromReq ) //will be 0 or addr of label in end singleton
|
seanhalle@0
|
662 {
|
seanhalle@3
|
663 VSsSemEnv *semEnv = VMS_int__give_sem_env_for( animSlv );
|
seanhalle@0
|
664 asm_write_ret_from_singleton(&(semEnv->fnSingletons[ singletonID]));
|
seanhalle@0
|
665 }
|
seanhalle@0
|
666 }
|
seanhalle@0
|
667
|
seanhalle@0
|
668 /*Data singleton hands addr of loc holding a pointer to a singleton struct.
|
seanhalle@0
|
669 * The start_data_singleton makes the structure and puts its addr into the
|
seanhalle@0
|
670 * location.
|
seanhalle@0
|
671 */
|
seanhalle@0
|
672 void
|
seanhalle@3
|
673 VSs__start_data_singleton( VSsSingleton **singletonAddr, SlaveVP *animSlv )
|
seanhalle@0
|
674 {
|
seanhalle@2
|
675 VSsSemReq reqData;
|
seanhalle@0
|
676
|
seanhalle@0
|
677 if( *singletonAddr && (*singletonAddr)->hasFinished )
|
seanhalle@0
|
678 goto JmpToEndSingleton;
|
seanhalle@0
|
679
|
seanhalle@0
|
680 reqData.reqType = singleton_data_start;
|
seanhalle@0
|
681 reqData.singletonPtrAddr = singletonAddr;
|
seanhalle@0
|
682
|
seanhalle@3
|
683 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@3
|
684 if( animSlv->dataRetFromReq ) //either 0 or end singleton's return addr
|
seanhalle@0
|
685 { //Assembly code changes the return addr on the stack to the one
|
seanhalle@0
|
686 // saved into the singleton by the end-singleton-fn
|
seanhalle@0
|
687 //The return addr is at 0x4(%%ebp)
|
seanhalle@0
|
688 JmpToEndSingleton:
|
seanhalle@0
|
689 asm_write_ret_from_singleton(*singletonAddr);
|
seanhalle@0
|
690 }
|
seanhalle@0
|
691 //now, simply return
|
seanhalle@0
|
692 //will exit either from the start singleton call or the end-singleton call
|
seanhalle@0
|
693 }
|
seanhalle@0
|
694
|
seanhalle@0
|
695 /*Uses ID as index into array of flags. If flag already set, resumes from
|
seanhalle@0
|
696 * end-label. Else, sets flag and resumes normally.
|
seanhalle@0
|
697 *
|
seanhalle@0
|
698 *Note, this call cannot be inlined because the instr addr at the label
|
seanhalle@0
|
699 * inside is shared by all invocations of a given singleton ID.
|
seanhalle@0
|
700 */
|
seanhalle@0
|
701 void
|
seanhalle@3
|
702 VSs__end_fn_singleton( int32 singletonID, SlaveVP *animSlv )
|
seanhalle@0
|
703 {
|
seanhalle@2
|
704 VSsSemReq reqData;
|
seanhalle@0
|
705
|
seanhalle@0
|
706 //don't need this addr until after at least one singleton has reached
|
seanhalle@0
|
707 // this function
|
seanhalle@3
|
708 VSsSemEnv *semEnv = VMS_int__give_sem_env_for( animSlv );
|
seanhalle@0
|
709 asm_write_ret_from_singleton(&(semEnv->fnSingletons[ singletonID]));
|
seanhalle@0
|
710
|
seanhalle@0
|
711 reqData.reqType = singleton_fn_end;
|
seanhalle@0
|
712 reqData.singletonID = singletonID;
|
seanhalle@0
|
713
|
seanhalle@3
|
714 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@0
|
715
|
seanhalle@0
|
716 EndSingletonInstrAddr:
|
seanhalle@0
|
717 return;
|
seanhalle@0
|
718 }
|
seanhalle@0
|
719
|
seanhalle@0
|
720 void
|
seanhalle@3
|
721 VSs__end_data_singleton( VSsSingleton **singletonPtrAddr, SlaveVP *animSlv )
|
seanhalle@0
|
722 {
|
seanhalle@2
|
723 VSsSemReq reqData;
|
seanhalle@0
|
724
|
seanhalle@0
|
725 //don't need this addr until after singleton struct has reached
|
seanhalle@0
|
726 // this function for first time
|
seanhalle@0
|
727 //do assembly that saves the return addr of this fn call into the
|
seanhalle@0
|
728 // data singleton -- that data-singleton can only be given to exactly
|
seanhalle@0
|
729 // one instance in the code of this function. However, can use this
|
seanhalle@0
|
730 // function in different places for different data-singletons.
|
seanhalle@0
|
731 // (*(singletonAddr))->endInstrAddr = &&EndDataSingletonInstrAddr;
|
seanhalle@0
|
732
|
seanhalle@0
|
733
|
seanhalle@0
|
734 asm_save_ret_to_singleton(*singletonPtrAddr);
|
seanhalle@0
|
735
|
seanhalle@0
|
736 reqData.reqType = singleton_data_end;
|
seanhalle@0
|
737 reqData.singletonPtrAddr = singletonPtrAddr;
|
seanhalle@0
|
738
|
seanhalle@3
|
739 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@0
|
740 }
|
seanhalle@0
|
741
|
seanhalle@0
|
742 /*This executes the function in the masterVP, so it executes in isolation
|
seanhalle@0
|
743 * from any other copies -- only one copy of the function can ever execute
|
seanhalle@0
|
744 * at a time.
|
seanhalle@0
|
745 *
|
seanhalle@0
|
746 *It suspends to the master, and the request handler takes the function
|
seanhalle@0
|
747 * pointer out of the request and calls it, then resumes the VP.
|
seanhalle@0
|
748 *Only very short functions should be called this way -- for longer-running
|
seanhalle@0
|
749 * isolation, use transaction-start and transaction-end, which run the code
|
seanhalle@0
|
750 * between as work-code.
|
seanhalle@0
|
751 */
|
seanhalle@0
|
752 void
|
seanhalle@2
|
753 VSs__animate_short_fn_in_isolation( PtrToAtomicFn ptrToFnToExecInMaster,
|
seanhalle@3
|
754 void *data, SlaveVP *animSlv )
|
seanhalle@0
|
755 {
|
seanhalle@2
|
756 VSsSemReq reqData;
|
seanhalle@0
|
757
|
seanhalle@0
|
758 //
|
seanhalle@0
|
759 reqData.reqType = atomic;
|
seanhalle@0
|
760 reqData.fnToExecInMaster = ptrToFnToExecInMaster;
|
seanhalle@0
|
761 reqData.dataForFn = data;
|
seanhalle@0
|
762
|
seanhalle@3
|
763 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@0
|
764 }
|
seanhalle@0
|
765
|
seanhalle@0
|
766
|
seanhalle@0
|
767 /*This suspends to the master.
|
seanhalle@0
|
768 *First, it looks at the VP's data, to see the highest transactionID that VP
|
seanhalle@0
|
769 * already has entered. If the current ID is not larger, it throws an
|
seanhalle@0
|
770 * exception stating a bug in the code. Otherwise it puts the current ID
|
seanhalle@0
|
771 * there, and adds the ID to a linked list of IDs entered -- the list is
|
seanhalle@0
|
772 * used to check that exits are properly ordered.
|
seanhalle@0
|
773 *Next it is uses transactionID as index into an array of transaction
|
seanhalle@0
|
774 * structures.
|
seanhalle@0
|
775 *If the "VP_currently_executing" field is non-null, then put requesting VP
|
seanhalle@0
|
776 * into queue in the struct. (At some point a holder will request
|
seanhalle@0
|
777 * end-transaction, which will take this VP from the queue and resume it.)
|
seanhalle@0
|
778 *If NULL, then write requesting into the field and resume.
|
seanhalle@0
|
779 */
|
seanhalle@0
|
780 void
|
seanhalle@3
|
781 VSs__start_transaction( int32 transactionID, SlaveVP *animSlv )
|
seanhalle@0
|
782 {
|
seanhalle@2
|
783 VSsSemReq reqData;
|
seanhalle@0
|
784
|
seanhalle@0
|
785 //
|
seanhalle@3
|
786 reqData.callingSlv = animSlv;
|
seanhalle@0
|
787 reqData.reqType = trans_start;
|
seanhalle@0
|
788 reqData.transID = transactionID;
|
seanhalle@0
|
789
|
seanhalle@3
|
790 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@0
|
791 }
|
seanhalle@0
|
792
|
seanhalle@0
|
793 /*This suspends to the master, then uses transactionID as index into an
|
seanhalle@0
|
794 * array of transaction structures.
|
seanhalle@0
|
795 *It looks at VP_currently_executing to be sure it's same as requesting VP.
|
seanhalle@0
|
796 * If different, throws an exception, stating there's a bug in the code.
|
seanhalle@0
|
797 *Next it looks at the queue in the structure.
|
seanhalle@0
|
798 *If it's empty, it sets VP_currently_executing field to NULL and resumes.
|
seanhalle@0
|
799 *If something in, gets it, sets VP_currently_executing to that VP, then
|
seanhalle@0
|
800 * resumes both.
|
seanhalle@0
|
801 */
|
seanhalle@0
|
802 void
|
seanhalle@3
|
803 VSs__end_transaction( int32 transactionID, SlaveVP *animSlv )
|
seanhalle@0
|
804 {
|
seanhalle@2
|
805 VSsSemReq reqData;
|
seanhalle@0
|
806
|
seanhalle@0
|
807 //
|
seanhalle@3
|
808 reqData.callingSlv = animSlv;
|
seanhalle@0
|
809 reqData.reqType = trans_end;
|
seanhalle@0
|
810 reqData.transID = transactionID;
|
seanhalle@0
|
811
|
seanhalle@3
|
812 VMS_WL__send_sem_request( &reqData, animSlv );
|
seanhalle@0
|
813 }
|
seanhalle@7
|
814
|
seanhalle@7
|
815 //======================== Internal ==================================
|
seanhalle@7
|
816 /*
|
seanhalle@7
|
817 */
|
seanhalle@7
|
818 SlaveVP *
|
seanhalle@7
|
819 VSs__create_slave_with( TopLevelFnPtr fnPtr, void *initData,
|
seanhalle@7
|
820 SlaveVP *creatingSlv )
|
seanhalle@7
|
821 { VSsSemReq reqData;
|
seanhalle@7
|
822
|
seanhalle@7
|
823 //the semantic request data is on the stack and disappears when this
|
seanhalle@7
|
824 // call returns -- it's guaranteed to remain in the VP's stack for as
|
seanhalle@7
|
825 // long as the VP is suspended.
|
seanhalle@7
|
826 reqData.reqType = 0; //know type because in a VMS create req
|
seanhalle@7
|
827 reqData.coreToAssignOnto = -1; //means round-robin assign
|
seanhalle@7
|
828 reqData.fnPtr = fnPtr;
|
seanhalle@7
|
829 reqData.initData = initData;
|
seanhalle@7
|
830 reqData.callingSlv = creatingSlv;
|
seanhalle@7
|
831
|
seanhalle@7
|
832 VMS_WL__send_create_slaveVP_req( &reqData, creatingSlv );
|
seanhalle@7
|
833
|
seanhalle@7
|
834 return creatingSlv->dataRetFromReq;
|
seanhalle@7
|
835 }
|
seanhalle@7
|
836
|
seanhalle@7
|
837 SlaveVP *
|
seanhalle@7
|
838 VSs__create_slave_with_affinity( TopLevelFnPtr fnPtr, void *initData,
|
seanhalle@7
|
839 SlaveVP *creatingSlv, int32 coreToAssignOnto )
|
seanhalle@7
|
840 { VSsSemReq reqData;
|
seanhalle@7
|
841
|
seanhalle@7
|
842 //the semantic request data is on the stack and disappears when this
|
seanhalle@7
|
843 // call returns -- it's guaranteed to remain in the VP's stack for as
|
seanhalle@7
|
844 // long as the VP is suspended.
|
seanhalle@7
|
845 reqData.reqType = create_slave_w_aff; //not used, May 2012
|
seanhalle@7
|
846 reqData.coreToAssignOnto = coreToAssignOnto;
|
seanhalle@7
|
847 reqData.fnPtr = fnPtr;
|
seanhalle@7
|
848 reqData.initData = initData;
|
seanhalle@7
|
849 reqData.callingSlv = creatingSlv;
|
seanhalle@7
|
850
|
seanhalle@7
|
851 VMS_WL__send_create_slaveVP_req( &reqData, creatingSlv );
|
seanhalle@7
|
852
|
seanhalle@7
|
853 return creatingSlv->dataRetFromReq;
|
seanhalle@7
|
854 }
|
seanhalle@7
|
855
|