Mercurial > cgi-bin > hgwebdir.cgi > VMS > VMS_Implementations > VMS_impls > VMS__MC_shared_impl
view MasterLoop.c @ 184:50b29548d4f0
handler interface for counters... not working
| author | Nina Engelhardt <nengel@mailbox.tu-berlin.de> |
|---|---|
| date | Fri, 13 Jan 2012 15:03:32 +0100 |
| parents | 7523ee70d66c |
| children | 28cc465f7eb7 |
line source
1 /*
2 * Copyright 2010 OpenSourceStewardshipFoundation
3 *
4 * Licensed under BSD
5 */
9 #include <stdio.h>
10 #include <stddef.h>
12 #include "VMS.h"
13 #include "ProcrContext.h"
16 //===========================================================================
17 void inline
18 stealWorkInto( SchedSlot *currSlot, VMSQueueStruc *readyToAnimateQ,
19 VirtProcr *masterPr );
21 //===========================================================================
25 /*This code is animated by the virtual Master processor.
26 *
27 *Polls each sched slot exactly once, hands any requests made by a newly
28 * done slave to the "request handler" plug-in function
29 *
30 *Any slots that need a virt procr assigned are given to the "schedule"
31 * plug-in function, which tries to assign a virt procr (slave) to it.
32 *
33 *When all slots needing a processor have been given to the schedule plug-in,
34 * a fraction of the procrs successfully scheduled are put into the
35 * work queue, then a continuation of this function is put in, then the rest
36 * of the virt procrs that were successfully scheduled.
37 *
38 *The first thing the continuation does is busy-wait until the previous
39 * animation completes. This is because an (unlikely) continuation may
40 * sneak through queue before previous continuation is done putting second
41 * part of scheduled slaves in, which is the only race condition.
42 *
43 */
45 /*May 29, 2010 -- birth a Master during init so that first core loop to
46 * start running gets it and does all the stuff for a newly born --
47 * from then on, will be doing continuation, but do suspension self
48 * directly at end of master loop
49 *So VMS__init just births the master virtual processor same way it births
50 * all the others -- then does any extra setup needed and puts it into the
51 * work queue.
52 *However means have to make masterEnv a global static volatile the same way
53 * did with readyToAnimateQ in core loop. -- for performance, put the
54 * jump to the core loop directly in here, and have it directly jump back.
55 *
56 *
57 *Aug 18, 2010 -- Going to a separate MasterVP for each core, to see if this
58 * avoids the suspected bug in the system stack that causes bizarre faults
59 * at random places in the system code.
60 *
61 *So, this function is coupled to each of the MasterVPs, -- meaning this
62 * function can't rely on a particular stack and frame -- each MasterVP that
63 * animates this function has a different one.
64 *
65 *At this point, the masterLoop does not write itself into the queue anymore,
66 * instead, the coreLoop acquires the masterLock when it has nothing to
67 * animate, and then animates its own masterLoop. However, still try to put
68 * several AppVPs into the queue to amortize the startup cost of switching
69 * to the MasterVP. Note, don't have to worry about latency of requests much
70 * because most requests generate work for same core -- only latency issue
71 * is case when other cores starved and one core's requests generate work
72 * for them -- so keep max in queue to 3 or 4..
73 */
74 void masterLoop( void *initData, VirtProcr *animatingPr )
75 {
76 int32 slotIdx, numSlotsFilled;
77 VirtProcr *schedVirtPr;
78 SchedSlot *currSlot, **schedSlots;
79 MasterEnv *masterEnv;
80 VMSQueueStruc *readyToAnimateQ;
82 SlaveScheduler slaveScheduler;
83 RequestHandler requestHandler;
84 void *semanticEnv;
86 int32 thisCoresIdx;
87 VirtProcr *masterPr;
88 volatile VirtProcr *volatileMasterPr;
90 volatileMasterPr = animatingPr;
91 masterPr = (VirtProcr*)volatileMasterPr; //used to force re-define after jmp
93 //First animation of each MasterVP will in turn animate this part
94 // of setup code.. (VP creator sets up the stack as if this function
95 // was called normally, but actually get here by jmp)
96 //So, setup values about stack ptr, jmp pt and all that
97 //masterPr->nextInstrPt = &&masterLoopStartPt;
100 //Note, got rid of writing the stack and frame ptr up here, because
101 // only one
102 // core can ever animate a given MasterVP, so don't need to communicate
103 // new frame and stack ptr to the MasterVP storage before a second
104 // version of that MasterVP can get animated on a different core.
105 //Also got rid of the busy-wait.
108 //masterLoopStartPt:
109 while(1){
111 //============================= MEASUREMENT STUFF ========================
112 #ifdef MEAS__TIME_MASTER
113 //Total Master time includes one coreloop time -- just assume the core
114 // loop time is same for Master as for AppVPs, even though it may be
115 // smaller due to higher predictability of the fixed jmp.
116 saveLowTimeStampCountInto( masterPr->startMasterTSCLow );
117 #endif
118 //========================================================================
120 masterEnv = (MasterEnv*)_VMSMasterEnv;
122 //GCC may optimize so doesn't always re-define from frame-storage
123 masterPr = (VirtProcr*)volatileMasterPr; //just to make sure after jmp
124 thisCoresIdx = masterPr->coreAnimatedBy;
125 readyToAnimateQ = masterEnv->readyToAnimateQs[thisCoresIdx];
126 schedSlots = masterEnv->allSchedSlots[thisCoresIdx];
128 requestHandler = masterEnv->requestHandler;
129 slaveScheduler = masterEnv->slaveScheduler;
130 semanticEnv = masterEnv->semanticEnv;
132 #ifdef MEAS__PERF_COUNTERS
133 //CounterHandler counterHandler = masterEnv->counterHandler;
134 #endif
136 //Poll each slot's Done flag
137 numSlotsFilled = 0;
138 for( slotIdx = 0; slotIdx < NUM_SCHED_SLOTS; slotIdx++)
139 {
140 currSlot = schedSlots[ slotIdx ];
142 if( currSlot->workIsDone )
143 {
144 currSlot->workIsDone = FALSE;
145 currSlot->needsProcrAssigned = TRUE;
147 //process requests from slave to master
148 //====================== MEASUREMENT STUFF ===================
149 #ifdef MEAS__TIME_PLUGIN
150 int32 startStamp1, endStamp1;
151 saveLowTimeStampCountInto( startStamp1 );
152 #endif
153 #ifdef MEAS__PERF_COUNTERS
154 int cycles, instrs;
155 saveCyclesAndInstrs(thisCoresIdx,cycles, instrs);
156 //(*counterHandler)(MasterLoop_beforeReqHdlr,thisCoresIdx,slotIdx,currSlot->procrAssignedToSlot,cycles,instrs);
158 /*
159 int lastRecordIdx = currSlot->procrAssignedToSlot->counter_history_array_info->numInArray -1;
160 CounterRecord* lastRecord = currSlot->procrAssignedToSlot->counter_history[lastRecordIdx];
161 lastRecord->req_core = thisCoresIdx;
162 saveCyclesAndInstrs(thisCoresIdx,lastRecord->next_task_req_cycles,lastRecord->next_task_req_instrs);
163 //End of task, start of next task
164 //print counters from last run
165 addToDynArray((void*)lastRecord,masterEnv->counter_history_array_info);
166 print_record_csv_to_file(lastRecord,_VMSMasterEnv->counteroutput);
168 //print_record_human_readable(lastRecord);
169 //create new entry in record array
170 CounterRecord* newRecord = VMS__malloc(sizeof(CounterRecord));
171 newRecord->req_core = thisCoresIdx;
172 newRecord->vp_id = currSlot->procrAssignedToSlot->procrID;
173 newRecord->task_position = lastRecord->task_position + 1;
174 newRecord->req_cycles = lastRecord->next_task_req_cycles;
175 newRecord->req_instrs = lastRecord->next_task_req_instrs;
176 getReturnAddressBeforeLibraryCall(currSlot->procrAssignedToSlot, &(newRecord->addr_of_libcall_for_req));
177 addToDynArray( (void*) newRecord, currSlot->procrAssignedToSlot->counter_history_array_info);
178 lastRecord = newRecord;
179 */
180 #endif
181 //============================================================
182 (*requestHandler)( currSlot->procrAssignedToSlot, semanticEnv );
183 //====================== MEASUREMENT STUFF ===================
184 #ifdef MEAS__TIME_PLUGIN
185 saveLowTimeStampCountInto( endStamp1 );
186 addIntervalToHist( startStamp1, endStamp1,
187 _VMSMasterEnv->reqHdlrLowTimeHist );
188 addIntervalToHist( startStamp1, endStamp1,
189 _VMSMasterEnv->reqHdlrHighTimeHist );
190 #endif
191 #ifdef MEAS__PERF_COUNTERS
192 //done with constraints check
193 saveCyclesAndInstrs(thisCoresIdx,cycles, instrs);
194 //(*counterHandler)(MasterLoop_afterReqHdlr,thisCoresIdx,slotIdx,currSlot->procrAssignedToSlot,cycles,instrs);
195 /*
196 saveCyclesAndInstrs(thisCoresIdx,lastRecord->sc_done_cycles,lastRecord->sc_done_instrs);
197 saveLowTimeStampCountInto(lastRecord->blocked_timestamp);
198 */
199 #endif
200 //============================================================
201 }
202 if( currSlot->needsProcrAssigned )
203 { //give slot a new virt procr
204 #ifdef MEAS__PERF_COUNTERS
205 //start assigner
206 uint64 tmp_cycles;
207 uint64 tmp_instrs;
208 saveCyclesAndInstrs(thisCoresIdx,tmp_cycles,tmp_instrs);
209 #endif
210 schedVirtPr =
211 (*slaveScheduler)( semanticEnv, thisCoresIdx, slotIdx );
213 if( schedVirtPr != NULL )
214 { currSlot->procrAssignedToSlot = schedVirtPr;
215 schedVirtPr->schedSlot = currSlot;
216 currSlot->needsProcrAssigned = FALSE;
217 numSlotsFilled += 1;
219 #ifdef MEAS__PERF_COUNTERS
220 uint64 cycles;
221 uint64 instrs;
222 saveCyclesAndInstrs(thisCoresIdx,cycles,instrs);
223 //(*counterHandler)(MasterLoop_beforeAssign,thisCoresIdx,slotIdx,schedVirtPr,tmp_cycles,tmp_instrs);
224 //(*counterHandler)(MasterLoop_afterAssign,thisCoresIdx,slotIdx,schedVirtPr,cycles,instrs);
225 //end assigner
226 //int lastRecordIdx = currSlot->procrAssignedToSlot->counter_history_array_info->numInArray -1;
227 //CounterRecord* lastRecord = currSlot->procrAssignedToSlot->counter_history[lastRecordIdx];
228 //lastRecord->assigning_core = thisCoresIdx;
229 //lastRecord->start_assign_cycles = tmp_cycles;
230 //lastRecord->start_assign_instrs = tmp_instrs;
231 //saveCyclesAndInstrs(thisCoresIdx,lastRecord->end_assign_cycles,lastRecord->end_assign_instrs);
232 #endif
234 writeVMSQ( schedVirtPr, readyToAnimateQ );
235 }
236 }
238 }
241 #ifdef USE_WORK_STEALING
242 //If no slots filled, means no more work, look for work to steal.
243 if( numSlotsFilled == 0 )
244 { gateProtected_stealWorkInto( currSlot, readyToAnimateQ, masterPr );
245 }
246 #endif
249 #ifdef MEAS__TIME_MASTER
250 saveLowTimeStampCountInto( masterPr->endMasterTSCLow );
251 #endif
253 masterSwitchToCoreLoop(animatingPr);
254 flushRegisters();
255 }//MasterLoop
258 }
262 /*This has a race condition -- the coreloops are accessing their own queues
263 * at the same time that this work-stealer on a different core is trying to
264 */
265 void inline
266 stealWorkInto( SchedSlot *currSlot, VMSQueueStruc *readyToAnimateQ,
267 VirtProcr *masterPr )
268 {
269 VirtProcr *stolenPr;
270 int32 coreIdx, i;
271 VMSQueueStruc *currQ;
273 stolenPr = NULL;
274 coreIdx = masterPr->coreAnimatedBy;
275 for( i = 0; i < NUM_CORES -1; i++ )
276 {
277 if( coreIdx >= NUM_CORES -1 )
278 { coreIdx = 0;
279 }
280 else
281 { coreIdx++;
282 }
283 currQ = _VMSMasterEnv->readyToAnimateQs[coreIdx];
284 if( numInVMSQ( currQ ) > 0 )
285 { stolenPr = readVMSQ (currQ );
286 break;
287 }
288 }
290 if( stolenPr != NULL )
291 { currSlot->procrAssignedToSlot = stolenPr;
292 stolenPr->schedSlot = currSlot;
293 currSlot->needsProcrAssigned = FALSE;
295 writeVMSQ( stolenPr, readyToAnimateQ );
296 }
297 }
299 /*This algorithm makes the common case fast. Make the coreloop passive,
300 * and show its progress. Make the stealer control a gate that coreloop
301 * has to pass.
302 *To avoid interference, only one stealer at a time. Use a global
303 * stealer-lock.
304 *
305 *The pattern is based on a gate -- stealer shuts the gate, then monitors
306 * to be sure any already past make it all the way out, before starting.
307 *So, have a "progress" measure just before the gate, then have two after it,
308 * one is in a "waiting room" outside the gate, the other is at the exit.
309 *Then, the stealer first shuts the gate, then checks the progress measure
310 * outside it, then looks to see if the progress measure at the exit is the
311 * same. If yes, it knows the protected area is empty 'cause no other way
312 * to get in and the last to get in also exited.
313 *If the progress measure at the exit is not the same, then the stealer goes
314 * into a loop checking both the waiting-area and the exit progress-measures
315 * until one of them shows the same as the measure outside the gate. Might
316 * as well re-read the measure outside the gate each go around, just to be
317 * sure. It is guaranteed that one of the two will eventually match the one
318 * outside the gate.
319 *
320 *Here's an informal proof of correctness:
321 *The gate can be closed at any point, and have only four cases:
322 * 1) coreloop made it past the gate-closing but not yet past the exit
323 * 2) coreloop made it past the pre-gate progress update but not yet past
324 * the gate,
325 * 3) coreloop is right before the pre-gate update
326 * 4) coreloop is past the exit and far from the pre-gate update.
327 *
328 * Covering the cases in reverse order,
329 * 4) is not a problem -- stealer will read pre-gate progress, see that it
330 * matches exit progress, and the gate is closed, so stealer can proceed.
331 * 3) stealer will read pre-gate progress just after coreloop updates it..
332 * so stealer goes into a loop until the coreloop causes wait-progress
333 * to match pre-gate progress, so then stealer can proceed
334 * 2) same as 3..
335 * 1) stealer reads pre-gate progress, sees that it's different than exit,
336 * so goes into loop until exit matches pre-gate, now it knows coreloop
337 * is not in protected and cannot get back in, so can proceed.
338 *
339 *Implementation for the stealer:
340 *
341 *First, acquire the stealer lock -- only cores with no work to do will
342 * compete to steal, so not a big performance penalty having only one --
343 * will rarely have multiple stealers in a system with plenty of work -- and
344 * in a system with little work, it doesn't matter.
345 *
346 *Note, have single-reader, single-writer pattern for all variables used to
347 * communicate between stealer and victims
348 *
349 *So, scan the queues of the core loops, until find non-empty. Each core
350 * has its own list that it scans. The list goes in order from closest to
351 * furthest core, so it steals first from close cores. Later can add
352 * taking info from the app about overlapping footprints, and scan all the
353 * others then choose work with the most footprint overlap with the contents
354 * of this core's cache.
355 *
356 *Now, have a victim want to take work from. So, shut the gate in that
357 * coreloop, by setting the "gate closed" var on its stack to TRUE.
358 *Then, read the core's pre-gate progress and compare to the core's exit
359 * progress.
360 *If same, can proceed to take work from the coreloop's queue. When done,
361 * write FALSE to gate closed var.
362 *If different, then enter a loop that reads the pre-gate progress, then
363 * compares to exit progress then to wait progress. When one of two
364 * matches, proceed. Take work from the coreloop's queue. When done,
365 * write FALSE to the gate closed var.
366 *
367 */
368 void inline
369 gateProtected_stealWorkInto( SchedSlot *currSlot,
370 VMSQueueStruc *myReadyToAnimateQ,
371 VirtProcr *masterPr )
372 {
373 VirtProcr *stolenPr;
374 int32 coreIdx, i, haveAVictim, gotLock;
375 VMSQueueStruc *victimsQ;
377 volatile GateStruc *vicGate;
378 int32 coreMightBeInProtected;
382 //see if any other cores have work available to steal
383 haveAVictim = FALSE;
384 coreIdx = masterPr->coreAnimatedBy;
385 for( i = 0; i < NUM_CORES -1; i++ )
386 {
387 if( coreIdx >= NUM_CORES -1 )
388 { coreIdx = 0;
389 }
390 else
391 { coreIdx++;
392 }
393 victimsQ = _VMSMasterEnv->readyToAnimateQs[coreIdx];
394 if( numInVMSQ( victimsQ ) > 0 )
395 { haveAVictim = TRUE;
396 vicGate = _VMSMasterEnv->workStealingGates[ coreIdx ];
397 break;
398 }
399 }
400 if( !haveAVictim ) return; //no work to steal, exit
402 //have a victim core, now get the stealer-lock
403 gotLock =__sync_bool_compare_and_swap( &(_VMSMasterEnv->workStealingLock),
404 UNLOCKED, LOCKED );
405 if( !gotLock ) return; //go back to core loop, which will re-start master
408 //====== Start Gate-protection =======
409 vicGate->gateClosed = TRUE;
410 coreMightBeInProtected= vicGate->preGateProgress != vicGate->exitProgress;
411 while( coreMightBeInProtected )
412 { //wait until sure
413 if( vicGate->preGateProgress == vicGate->waitProgress )
414 coreMightBeInProtected = FALSE;
415 if( vicGate->preGateProgress == vicGate->exitProgress )
416 coreMightBeInProtected = FALSE;
417 }
419 stolenPr = readVMSQ ( victimsQ );
421 vicGate->gateClosed = FALSE;
422 //======= End Gate-protection =======
425 if( stolenPr != NULL ) //victim could have been in protected and taken
426 { currSlot->procrAssignedToSlot = stolenPr;
427 stolenPr->schedSlot = currSlot;
428 currSlot->needsProcrAssigned = FALSE;
430 writeVMSQ( stolenPr, myReadyToAnimateQ );
431 }
433 //unlock the work stealing lock
434 _VMSMasterEnv->workStealingLock = UNLOCKED;
435 }