detectors/slsDetectorPackage
24
1
Fork 0
mirror of https://github.com/slsdetectorgroup/slsDetectorPackage.git synced 2026-01-16 10:44:39 +01:00
Code Issues Actions Packages Releases Activity

not yet gotthard

Browse Source
This commit is contained in:
Dhanya Maliakal
2017-03-08 14:37:00 +01:00
parent 0e4c7a9494
commit 0dccd78567
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
slsReceiverSoftware/src/UDPStandardImplementation.cpp
View File

@@ -734,19 +734,20 @@ int UDPStandardImplementation::SetupFifoStructure() {
//listen to only n jobs at a time //listen to only n jobs at a time
if (frameToGuiFrequency) if (frameToGuiFrequency)
numberofJobs = frameToGuiFrequency; numberofJobs = frameToGuiFrequency;
else {
/*else { NOT YET
//random freq depends on acquisition period/time (calculate upto 100ms/period) //random freq depends on acquisition period/time (calculate upto 100ms/period)
int i = ((acquisitionPeriod > 0) ? int i = ((acquisitionPeriod > 0) ?
(SAMPLE_TIME_IN_NS/acquisitionPeriod): (SAMPLE_TIME_IN_NS/acquisitionPeriod):
((acquisitionTime > 0) ? (SAMPLE_TIME_IN_NS/acquisitionTime) : SAMPLE_TIME_IN_NS)); ((acquisitionTime > 0) ? (SAMPLE_TIME_IN_NS/acquisitionTime) : SAMPLE_TIME_IN_NS));
//must be > 0 and < max jobs //must be > 0 and < max jobs
numberofJobs = ((i < 1) ? 1 : ((i > MAX_JOBS_PER_THREAD) ? MAX_JOBS_PER_THREAD : i)); numberofJobs = ((i < 1) ? 1 : ((i > MAX_JOBS_PER_THREAD) ? MAX_JOBS_PER_THREAD : i));
} }*/
FILE_LOG (logINFO) << "Number of Jobs Per Thread:" << numberofJobs << endl; FILE_LOG (logINFO) << "Number of Jobs Per Thread:" << numberofJobs << endl;
uint32_t oldfifodepth = fifoDepth; uint32_t oldfifodepth = fifoDepth;
//reduce fifo depth if numberofJobsPerBuffer > 1 (to save memory) //reduce fifo depth if numberofJobsPerBuffer > 1 (to save memory)
if (numberofJobs >1) { if (numberofJobs > 1) {
fifoDepth = ((fifoDepth % numberofJobs) ? fifoDepth = ((fifoDepth % numberofJobs) ?
((fifoDepth/numberofJobs)+1) : //if not directly divisible ((fifoDepth/numberofJobs)+1) : //if not directly divisible
(fifoDepth/numberofJobs)); (fifoDepth/numberofJobs));