epics/epics-base
0
0
Fork 0
Code Issues Pull Requests Projects Wiki Activity

Added one more put/process to go over the buffer length

Browse Source 
Note that it is not really a circular buffer in this case, but
a full reset of the buffer to the beginning. This matches the
documentation, but it seems valuable to add an explicit test for
this case.
This commit is contained in:
Simon Rose
2022-05-12 10:57:37 +02:00
committed by Michael Davidsaver
parent d66e90a016
commit 84d9617375
1 changed files with 8 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
modules/database/test/std/rec/compressTest.c
View File

@@ -590,8 +590,12 @@ testNto1LowValue(void) {
void
testAIAveragePartial(void) {
double buf = 0.;
double data[4] = {1., 2., 3., 4.};
double expected[4] = {1., 1.5, 2., 2.5};
double data[5] = {1., 2., 3., 4., 5.};
/*
* Note that the fifth dbPut essentially resets the circular buffer, so the
* average is once again the average of the _first_ entry alone.
*/
double expected[5] = {1., 1.5, 2., 2.5, 5.};
long nReq = 1;
int i;
DBADDR aiaddr, caddr;
@@ -610,7 +614,7 @@ testAIAveragePartial(void) {
fetchRecordOrDie("ai", aiaddr);
fetchRecordOrDie("comp", caddr);
for (i = 0; i < 4; i++) {
for (i = 0; i < 5; i++) {
dbScanLock(aiaddr.precord);
dbPut(&aiaddr, DBR_DOUBLE, &data[i], 1);
dbScanUnlock(aiaddr.precord);
@@ -630,7 +634,7 @@ testAIAveragePartial(void) {
MAIN(compressTest)
{
testPlan(131);
testPlan(132);
testFIFOCirc();
testLIFOCirc();
testArrayAverage();