l = s->tclst;
for(check_list_front(l); !check_list_at_end(l); check_list_advance(l))
{
- tc = check_list_val(l);
+ tc = (TCase *)check_list_val(l);
if(strcmp(tcname, tc->name) == 0)
return 1;
}
l = s->tclst;
for(check_list_front(l); !check_list_at_end(l); check_list_advance(l))
{
- tcase_free(check_list_val(l));
+ tcase_free((TCase *)check_list_val(l));
}
check_list_free(s->tclst);
free(s);
l = sr->slst;
for(check_list_front(l); !check_list_at_end(l); check_list_advance(l))
{
- suite_free(check_list_val(l));
+ suite_free((Suite *)check_list_val(l));
}
check_list_free(sr->slst);
l = sr->resultlst;
for(check_list_front(l); !check_list_at_end(l); check_list_advance(l))
{
- tr = check_list_val(l);
+ tr = (TestResult *)check_list_val(l);
tr_free(tr);
}
check_list_free(sr->resultlst);
for(check_list_front(rlst); !check_list_at_end(rlst);
check_list_advance(rlst))
{
- TestResult *tr = check_list_val(rlst);
+ TestResult *tr = (TestResult *)check_list_val(rlst);
if(non_pass(tr->rtype))
trarray[i++] = tr;
for(check_list_front(rlst); !check_list_at_end(rlst);
check_list_advance(rlst))
{
- trarray[i++] = check_list_val(rlst);
+ trarray[i++] = (TestResult *)check_list_val(rlst);
}
return trarray;
}
l = sr->loglst;
for(check_list_front(l); !check_list_at_end(l); check_list_advance(l))
{
- lg = check_list_val(l);
+ lg = (Log *)check_list_val(l);
fflush(lg->lfile);
lg->lfun(sr, lg->lfile, lg->mode, obj, evt);
fflush(lg->lfile);
l = sr->loglst;
for(check_list_front(l); !check_list_at_end(l); check_list_advance(l))
{
- Log *lg = check_list_val(l);
+ Log *lg = (Log *)check_list_val(l);
if(lg->close)
{
for(check_list_front(resultlst); !check_list_at_end(resultlst);
check_list_advance(resultlst))
{
- TestResult *tr = check_list_val(resultlst);
+ TestResult *tr = (TestResult *)check_list_val(resultlst);
tr_fprint(file, tr, print_mode);
}
for(check_list_front(slst); !check_list_at_end(slst);
check_list_advance(slst))
{
- Suite *s = check_list_val(slst);
+ Suite *s = (Suite *)check_list_val(slst);
if(((sname != NULL) && (strcmp(sname, s->name) != 0))
|| ((tcname != NULL) && (!suite_tcase(s, tcname))))
for(check_list_front(tcl); !check_list_at_end(tcl);
check_list_advance(tcl))
{
- tc = check_list_val(tcl);
+ tc = (TCase *)check_list_val(tcl);
if((tcname != NULL) && (strcmp(tcname, tc->name) != 0))
{
{
int i;
- tfun = check_list_val(tfl);
+ tfun = (TF *)check_list_val(tfl);
for(i = tfun->loop_start; i < tfun->loop_end; i++)
{
for(check_list_front(fixture_list); !check_list_at_end(fixture_list);
check_list_advance(fixture_list))
{
- setup_fixture = check_list_val(fixture_list);
+ setup_fixture = (Fixture *)check_list_val(fixture_list);
if(fork_usage == CK_NOFORK)
{
for(check_list_front(fixture_list); !check_list_at_end(fixture_list);
check_list_advance(fixture_list))
{
- fixture = check_list_val(fixture_list);
+ fixture = (Fixture *)check_list_val(fixture_list);
send_ctx_info(CK_CTX_TEARDOWN);
if(fork_usage == CK_NOFORK)
srunner_init_logging(sr, CK_SUBUNIT);
check_list_front (sr->loglst);
ck_assert_msg (!check_list_at_end(sr->loglst), "No entries in log list");
- first_log = check_list_val(sr->loglst);
+ first_log = (Log *)check_list_val(sr->loglst);
ck_assert_msg (first_log != NULL, "log is NULL");
check_list_advance(sr->loglst);
ck_assert_msg(check_list_at_end(sr->loglst), "More than one entry in log list");
check_list_add_end (lp, tval1);
check_list_add_end (lp, tval2);
check_list_front(lp);
- ck_assert_msg (strcmp (tval1, check_list_val (lp)) == 0,
+ ck_assert_msg (strcmp (tval1, (char *)check_list_val (lp)) == 0,
"List head val should equal first inserted val");
check_list_advance (lp);
ck_assert_msg (!check_list_at_end (lp),
"List should not be at end after two adds and one next");
- ck_assert_msg (strcmp (tval2, check_list_val (lp)) == 0,
+ ck_assert_msg (strcmp (tval2, (char *)check_list_val (lp)) == 0,
"List val should equal second inserted val");
check_list_advance(lp);
ck_assert_msg (check_list_at_end (lp),
check_list_add_front (lp, tval1);
check_list_add_front (lp, tval2);
check_list_front(lp);
- ck_assert_msg (strcmp (tval2, check_list_val (lp)) == 0,
+ ck_assert_msg (strcmp (tval2, (char *)check_list_val (lp)) == 0,
"List head val should equal last inserted val");
check_list_advance (lp);
ck_assert_msg (!check_list_at_end (lp),
"List should not be at end after two adds and one next");
- ck_assert_msg (strcmp (tval1, check_list_val (lp)) == 0,
+ ck_assert_msg (strcmp (tval1, (char *)check_list_val (lp)) == 0,
"List val should equal first inserted val");
check_list_advance(lp);
ck_assert_msg (check_list_at_end (lp),