blob: ab68a9389a3e91a9ff2850e8419eb70b88500143 [file] [log] [blame]
/** @file
A brief file description
@section license License
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements. See the NOTICE file
distributed with this work for additional information
regarding copyright ownership. The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#include "P_EventSystem.h"
#include "RegressionSM.h"
#define REGRESSION_SM_RETRY (100*HRTIME_MSECOND)
void RegressionSM::set_status(int astatus)
{
ink_assert(astatus != REGRESSION_TEST_INPROGRESS);
// INPROGRESS < NOT_RUN < PASSED < FAILED
if (status != REGRESSION_TEST_FAILED) {
if (status == REGRESSION_TEST_PASSED) {
if (astatus != REGRESSION_TEST_NOT_RUN)
status = astatus;
} else {
// INPROGRESS or NOT_RUN
status = astatus;
}
} // else FAILED is FAILED
}
void RegressionSM::done(int astatus)
{
if (pending_action) {
pending_action->cancel();
pending_action = 0;
}
set_status(astatus);
if (pstatus) *pstatus = status;
if (parent) parent->child_done(status);
}
void RegressionSM::run(int *apstatus)
{
pstatus = apstatus;
run();
}
void RegressionSM::xrun(RegressionSM *aparent)
{
parent = aparent;
parent->nwaiting++;
run();
}
void RegressionSM::run_in(int *apstatus, ink_hrtime t)
{
pstatus = apstatus;
SET_HANDLER(&RegressionSM::regression_sm_start);
eventProcessor.schedule_in(this, t);
}
void RegressionSM::child_done(int astatus)
{
MUTEX_LOCK(l, mutex, this_ethread());
ink_assert(nwaiting > 0);
--nwaiting;
set_status(astatus);
}
int RegressionSM::regression_sm_waiting(int event, void *data)
{
NOWARN_UNUSED(event);
if (!nwaiting) {
done(REGRESSION_TEST_NOT_RUN);
delete this;
return EVENT_DONE;
}
if (par || nwaiting > 1) {
((Event*)data)->schedule_in(REGRESSION_SM_RETRY);
return EVENT_CONT;
}
run();
return EVENT_DONE;
}
int RegressionSM::regression_sm_start(int event, void *data)
{
NOWARN_UNUSED(event);
NOWARN_UNUSED(data);
run();
return EVENT_CONT;
}
RegressionSM *r_sequential(RegressionTest *t, RegressionSM* sm, ...)
{
RegressionSM *new_sm = new RegressionSM(t);
va_list ap;
va_start(ap, sm);
new_sm->par = false;
new_sm->rep = false;
new_sm->ichild = 0;
new_sm->nchildren = 0;
new_sm->nwaiting = 0;
while (0 != sm) {
new_sm->children(new_sm->nchildren++) = sm;
sm = va_arg(ap, RegressionSM*);
}
new_sm->n = new_sm->nchildren;
va_end(ap);
return new_sm;
}
RegressionSM *r_sequential(RegressionTest *t, int an, RegressionSM *sm)
{
RegressionSM *new_sm = new RegressionSM(t);
new_sm->par = false;
new_sm->rep = true;
new_sm->ichild = 0;
new_sm->nchildren = 1;
new_sm->children(0) = sm;
new_sm->nwaiting = 0;
new_sm->n = an;
return new_sm;
}
RegressionSM *r_parallel(RegressionTest *t, RegressionSM *sm, ...)
{
RegressionSM *new_sm = new RegressionSM(t);
va_list ap;
va_start(ap, sm);
new_sm->par = true;
new_sm->rep = false;
new_sm->ichild = 0;
new_sm->nchildren = 0;
new_sm->nwaiting = 0;
while (sm) {
new_sm->children(new_sm->nchildren++) = sm;
sm = va_arg(ap, RegressionSM*);
}
new_sm->n = new_sm->nchildren;
va_end(ap);
return new_sm;
}
RegressionSM *r_parallel(RegressionTest *t, int an, RegressionSM *sm)
{
RegressionSM *new_sm = new RegressionSM(t);
new_sm->par = true;
new_sm->rep = true;
new_sm->ichild = 0;
new_sm->nchildren = 1;
new_sm->children(0) = sm;
new_sm->nwaiting = 0;
new_sm->n = an;
return new_sm;
}
void RegressionSM::run()
{
// TODO: Why introduce another scope here?
{
MUTEX_TRY_LOCK(l, mutex, this_ethread());
if (!l || nwaiting > 1)
goto Lretry;
RegressionSM *x = 0;
while (ichild < n) {
if (!rep)
x = children[ichild];
else {
if (ichild != n-1)
x = children[(intptr_t)0]->clone();
else
x = children[(intptr_t)0];
}
if (!ichild) nwaiting++;
x->xrun(this);
ichild++;
if (!par && nwaiting > 1)
goto Lretry;
}
}
nwaiting--;
if (!nwaiting) {
done(REGRESSION_TEST_NOT_RUN);
delete this;
return;
}
Lretry:
SET_HANDLER(&RegressionSM::regression_sm_waiting);
pending_action = eventProcessor.schedule_in(this, REGRESSION_SM_RETRY);
}
RegressionSM::RegressionSM(const RegressionSM &ao)
{
RegressionSM &o = *(RegressionSM*)&ao;
t = o.t;
status = o.status;
pstatus = o.pstatus;
parent = &o;
nwaiting = o.nwaiting;
nchildren = o.nchildren;
for (intptr_t i = 0; i < nchildren; i++)
children(i) = o.children[i]->clone();
n = o.n;
ichild = o.ichild;
par = o.par;
rep = o.rep;
pending_action = o.pending_action;
ink_assert(status == REGRESSION_TEST_INPROGRESS);
ink_assert(nwaiting == 0);
ink_assert(ichild == 0);
mutex = new_ProxyMutex();
}
struct ReRegressionSM: public RegressionSM
{
virtual void run() {
if (time(NULL) < 1) { // example test
rprintf(t,"impossible");
done(REGRESSION_TEST_FAILED);
} else
done(REGRESSION_TEST_PASSED);
}
ReRegressionSM(RegressionTest *at) : RegressionSM(at) {}
virtual RegressionSM *clone() { return new ReRegressionSM(*this); }
ReRegressionSM(const ReRegressionSM &o) {
t = o.t;
}
};
REGRESSION_TEST(RegressionSM)(RegressionTest *t, int atype, int *pstatus)
{
NOWARN_UNUSED(atype);
r_sequential(
t,
r_parallel(t, new ReRegressionSM(t), new ReRegressionSM(t), NULL_PTR),
r_sequential(t, new ReRegressionSM(t), new ReRegressionSM(t), NULL_PTR),
r_parallel(t, 3, new ReRegressionSM(t)),
r_sequential(t, 3, new ReRegressionSM(t)),
r_parallel(
t,
r_sequential(t, 2, new ReRegressionSM(t)),
r_parallel(t, 2, new ReRegressionSM(t)),
NULL_PTR),
NULL_PTR)->run(pstatus);
}