void progress_rename(int set_only)
{
const char *player = config_get_s(CONFIG_PLAYER);
if (curr_mode() == MODE_STANDALONE)
{
/* HACK Avoid touching the set. */
level_rename_player(level, time_rank, goal_rank, coin_rank, player);
demo_rename_player(USER_REPLAY_FILE, player);
return;
}
if (set_only)
{
set_rename_player(score_rank, times_rank, player);
}
else
{
level_rename_player(level, time_rank, goal_rank, coin_rank, player);
demo_rename_player(USER_REPLAY_FILE, player);
if (progress_done())
set_rename_player(score_rank, times_rank, player);
}
set_store_hs();
}
void
pass1b(void)
{
int c, i;
union dinode *dp;
struct inodesc idesc;
ino_t inumber;
memset(&idesc, 0, sizeof(struct inodesc));
idesc.id_type = ADDR;
idesc.id_func = pass1bcheck;
duphead = duplist;
inumber = 0;
for (c = 0; c < sblock->fs_ncg; c++) {
if (got_siginfo) {
fprintf(stderr,
"%s: phase 1b: cyl group %d of %d (%d%%)\n",
cdevname(), c, sblock->fs_ncg,
c * 100 / sblock->fs_ncg);
got_siginfo = 0;
}
#ifdef PROGRESS
progress_bar(cdevname(), "phase 1b", c, sblock->fs_ncg);
#endif /* PROGRESS */
for (i = 0; i < sblock->fs_ipg; i++, inumber++) {
if (inumber < ROOTINO)
continue;
dp = ginode(inumber);
if (dp == NULL)
continue;
idesc.id_number = inumber;
if (inoinfo(inumber)->ino_state != USTATE &&
(ckinode(dp, &idesc) & STOP))
return;
}
}
#ifdef PROGRESS
progress_done();
#endif /* PROGRESS */
}
/**
* Perform the rule query within a thread.
*/
static gpointer policy_view_find_terules_runner(gpointer data)
{
struct find_terules_datum *run = (struct find_terules_datum *)data;
run->results = NULL;
qpol_policy_t *q = apol_policy_get_qpol(run->policy);
if (!qpol_policy_has_capability(q, QPOL_CAP_SYN_RULES)) {
progress_update(run->progress, "Searching AV rules");
run->retval = apol_avrule_get_by_query(run->policy, run->query, &run->results);
run->is_syn_rules = 0;
} else {
qpol_policy_build_syn_rule_table(q);
progress_update(run->progress, "Searching syntactic AV rules");
run->retval = apol_syn_avrule_get_by_query(run->policy, run->query, &run->results);
run->is_syn_rules = 1;
}
if (run->retval == 0) {
progress_done(run->progress);
} else {
progress_abort(run->progress, NULL);
}
return NULL;
}
void ensure_allinstfiles_available(void) {
struct pkg_array array;
struct pkginfo *pkg;
struct progress progress;
int i;
if (allpackagesdone) return;
if (saidread<2) {
int max = pkg_db_count_pkg();
saidread=1;
progress_init(&progress, _("(Reading database ... "), max);
}
pkg_array_init_from_db(&array);
pkg_files_optimize_load(&array);
for (i = 0; i < array.n_pkgs; i++) {
pkg = array.pkgs[i];
ensure_packagefiles_available(pkg);
if (saidread == 1)
progress_step(&progress);
}
pkg_array_destroy(&array);
allpackagesdone = true;
if (saidread==1) {
progress_done(&progress);
printf(P_("%d file or directory currently installed.)\n",
"%d files and directories currently installed.)\n", nfiles),
nfiles);
saidread=2;
}
}
static int goal_gui(void)
{
const char *s1 = _("New Record");
const char *s2 = _("GOAL");
int id, jd, kd, ld, md;
int high = progress_lvl_high();
if ((id = gui_vstack(0)))
{
int gid = 0;
if (curr_mode() == MODE_CHALLENGE)
{
int coins, score, balls;
int i;
/* Reverse-engineer initial score and balls. */
if (resume)
{
coins = 0;
score = curr_score();
balls = curr_balls();
}
else
{
coins = curr_coins();
score = curr_score() - coins;
balls = curr_balls();
for (i = curr_score(); i > score; i--)
if (progress_reward_ball(i))
balls--;
}
/*if ((jd = gui_hstack(id)))
{
gui_filler(jd);*/
if ((kd = gui_vstack(id)))
{
if ((ld = video.device_w < video.device_h ? gui_vstack(kd) : gui_hstack(kd)))
{
if ((md = gui_harray(ld)))
{
balls_id = gui_count(md, 100, GUI_MED);
gui_label(md, _("Balls"), GUI_MED,
gui_wht, gui_wht);
}
if ((md = gui_harray(ld)))
{
score_id = gui_count(md, 1000, GUI_MED);
gui_label(md, _("Score"), GUI_MED,
gui_wht, gui_wht);
}
if ((md = gui_harray(ld)))
{
coins_id = gui_count(md, 100, GUI_MED);
gui_label(md, _("Coins"), GUI_MED,
gui_wht, gui_wht);
}
gui_set_count(balls_id, balls);
gui_set_count(score_id, score);
gui_set_count(coins_id, coins);
}
if ((ld = gui_harray(kd)))
{
const struct level *l;
gui_label(ld, "", GUI_SML, 0, 0);
for (i = MAXLVL - 1; i >= 0; i--)
if ((l = get_level(i)) && level_bonus(l))
{
const GLubyte *c = (level_opened(l) ?
gui_grn : gui_gry);
gui_label(ld, level_name(l), GUI_SML, c, c);
}
gui_label(ld, "", GUI_SML, 0, 0);
}
gui_set_rect(kd, GUI_ALL);
}
/*gui_filler(jd);
}*/
gui_space(id);
}
else
{
gid = gui_label(id, high ? s1 : s2, GUI_LRG, gui_blu, gui_grn);
gui_space(id);
balls_id = score_id = coins_id = 0;
}
gui_score_board(id, (GUI_SCORE_COIN |
GUI_SCORE_TIME |
GUI_SCORE_GOAL |
GUI_SCORE_SAVE), 1, high);
gui_space(id);
if ((jd = gui_harray(id)))
{
if (progress_done())
gui_start(jd, _("Finish"), GUI_MED, GOAL_DONE, 0);
else if (progress_last())
gui_start(jd, _("Finish"), GUI_MED, GOAL_LAST, 0);
if (progress_next_avail())
gui_start(jd, _("Next"), GUI_MED, GOAL_NEXT, 0);
if (progress_same_avail())
gui_start(jd, _("Retry"), GUI_MED, GOAL_SAME, 0);
if (!progress_done() && !progress_last())
gui_start(jd, _("Quit"), GUI_MED, GOAL_DONE, 0);
//if (demo_saved())
// gui_state(jd, _("Save Replay"), GUI_SML, GOAL_SAVE, 0);
}
if (!resume && gid)
gui_pulse(gid, 1.2f);
gui_layout(id, 0, 0);
}
set_score_board(level_score(curr_level(), SCORE_COIN), progress_coin_rank(),
level_score(curr_level(), SCORE_TIME), progress_time_rank(),
level_score(curr_level(), SCORE_GOAL), progress_goal_rank());
return id;
}
void
pass5(void)
{
int c, blk, frags, basesize, sumsize, mapsize, cssize;
int inomapsize, blkmapsize;
struct fs *fs = sblock;
daddr_t dbase, dmax;
daddr_t d;
long i, j, k;
struct csum *cs;
struct csum_total cstotal;
struct inodesc idesc[4];
char buf[MAXBSIZE];
struct cg *newcg = (struct cg *)buf;
struct ocg *ocg = (struct ocg *)buf;
struct cg *cg = cgrp, *ncg;
struct inostat *info;
u_int32_t ncgsize;
inoinfo(WINO)->ino_state = USTATE;
memset(newcg, 0, (size_t)fs->fs_cgsize);
newcg->cg_niblk = fs->fs_ipg;
if (cvtlevel >= 3) {
if (fs->fs_maxcontig < 2 && fs->fs_contigsumsize > 0) {
if (preen)
pwarn("DELETING CLUSTERING MAPS\n");
if (preen || reply("DELETE CLUSTERING MAPS")) {
fs->fs_contigsumsize = 0;
doinglevel1 = 1;
sbdirty();
}
}
if (fs->fs_maxcontig > 1) {
const char *doit = NULL;
if (fs->fs_contigsumsize < 1) {
doit = "CREAT";
} else if (fs->fs_contigsumsize < fs->fs_maxcontig &&
fs->fs_contigsumsize < FS_MAXCONTIG) {
doit = "EXPAND";
}
if (doit) {
i = fs->fs_contigsumsize;
fs->fs_contigsumsize =
MIN(fs->fs_maxcontig, FS_MAXCONTIG);
if (CGSIZE(fs) > fs->fs_bsize) {
pwarn("CANNOT %s CLUSTER MAPS\n", doit);
fs->fs_contigsumsize = i;
} else if (preen ||
reply("CREATE CLUSTER MAPS")) {
if (preen)
pwarn("%sING CLUSTER MAPS\n",
doit);
ncgsize = fragroundup(fs, CGSIZE(fs));
ncg = realloc(cgrp, ncgsize);
if (ncg == NULL)
errexit(
"cannot reallocate cg space");
cg = cgrp = ncg;
fs->fs_cgsize = ncgsize;
doinglevel1 = 1;
sbdirty();
}
}
}
}
basesize = &newcg->cg_space[0] - (u_char *)(&newcg->cg_firstfield);
cssize = (u_char *)&cstotal.cs_spare[0] - (u_char *)&cstotal.cs_ndir;
sumsize = 0;
if (is_ufs2) {
newcg->cg_iusedoff = basesize;
} else {
/*
* We reserve the space for the old rotation summary
* tables for the benefit of old kernels, but do not
* maintain them in modern kernels. In time, they can
* go away.
*/
newcg->cg_old_btotoff = basesize;
newcg->cg_old_boff = newcg->cg_old_btotoff +
fs->fs_old_cpg * sizeof(int32_t);
newcg->cg_iusedoff = newcg->cg_old_boff +
fs->fs_old_cpg * fs->fs_old_nrpos * sizeof(u_int16_t);
memset(&newcg->cg_space[0], 0, newcg->cg_iusedoff - basesize);
}
inomapsize = howmany(fs->fs_ipg, CHAR_BIT);
newcg->cg_freeoff = newcg->cg_iusedoff + inomapsize;
blkmapsize = howmany(fs->fs_fpg, CHAR_BIT);
newcg->cg_nextfreeoff = newcg->cg_freeoff + blkmapsize;
if (fs->fs_contigsumsize > 0) {
newcg->cg_clustersumoff = newcg->cg_nextfreeoff -
sizeof(u_int32_t);
if (isappleufs) {
/* Apple PR2216969 gives rationale for this change.
* I believe they were mistaken, but we need to
* duplicate it for compatibility. -- [email protected]
*/
newcg->cg_clustersumoff += sizeof(u_int32_t);
}
newcg->cg_clustersumoff =
roundup(newcg->cg_clustersumoff, sizeof(u_int32_t));
newcg->cg_clusteroff = newcg->cg_clustersumoff +
(fs->fs_contigsumsize + 1) * sizeof(u_int32_t);
newcg->cg_nextfreeoff = newcg->cg_clusteroff +
howmany(fragstoblks(fs, fs->fs_fpg), CHAR_BIT);
}
newcg->cg_magic = CG_MAGIC;
mapsize = newcg->cg_nextfreeoff - newcg->cg_iusedoff;
if (!is_ufs2 && ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0)) {
switch ((int)fs->fs_old_postblformat) {
case FS_42POSTBLFMT:
basesize = (char *)(&ocg->cg_btot[0]) -
(char *)(&ocg->cg_firstfield);
sumsize = &ocg->cg_iused[0] - (u_int8_t *)(&ocg->cg_btot[0]);
mapsize = &ocg->cg_free[howmany(fs->fs_fpg, NBBY)] -
(u_char *)&ocg->cg_iused[0];
blkmapsize = howmany(fs->fs_fpg, NBBY);
inomapsize = &ocg->cg_free[0] - (u_char *)&ocg->cg_iused[0];
ocg->cg_magic = CG_MAGIC;
newcg->cg_magic = 0;
break;
case FS_DYNAMICPOSTBLFMT:
sumsize = newcg->cg_iusedoff - newcg->cg_old_btotoff;
break;
default:
errexit("UNKNOWN ROTATIONAL TABLE FORMAT %d",
fs->fs_old_postblformat);
}
}
memset(&idesc[0], 0, sizeof idesc);
for (i = 0; i < 4; i++) {
idesc[i].id_type = ADDR;
if (!is_ufs2 && doinglevel2)
idesc[i].id_fix = FIX;
}
memset(&cstotal, 0, sizeof(struct csum_total));
dmax = blknum(fs, fs->fs_size + fs->fs_frag - 1);
for (d = fs->fs_size; d < dmax; d++)
setbmap(d);
for (c = 0; c < fs->fs_ncg; c++) {
if (got_siginfo) {
fprintf(stderr,
"%s: phase 5: cyl group %d of %d (%d%%)\n",
cdevname(), c, fs->fs_ncg,
c * 100 / fs->fs_ncg);
got_siginfo = 0;
}
#ifdef PROGRESS
progress_bar(cdevname(), preen ? NULL : "phase 5",
c, fs->fs_ncg);
#endif /* PROGRESS */
getblk(&cgblk, cgtod(fs, c), fs->fs_cgsize);
memcpy(cg, cgblk.b_un.b_cg, fs->fs_cgsize);
if((doswap && !needswap) || (!doswap && needswap))
ffs_cg_swap(cgblk.b_un.b_cg, cg, sblock);
if (!doinglevel1 && !cg_chkmagic(cg, 0))
pfatal("CG %d: PASS5: BAD MAGIC NUMBER\n", c);
if(doswap)
cgdirty();
/*
* While we have the disk head where we want it,
* write back the superblock to the spare at this
* cylinder group.
*/
if ((cvtlevel && sblk.b_dirty) || doswap) {
bwrite(fswritefd, sblk.b_un.b_buf,
fsbtodb(sblock, cgsblock(sblock, c)),
sblock->fs_sbsize);
} else {
/*
* Read in the current alternate superblock,
* and compare it to the master. If it's
* wrong, fix it up.
*/
getblk(&asblk, cgsblock(sblock, c), sblock->fs_sbsize);
if (asblk.b_errs)
pfatal("CG %d: UNABLE TO READ ALTERNATE "
"SUPERBLK\n", c);
else {
memmove(altsblock, asblk.b_un.b_fs,
sblock->fs_sbsize);
if (needswap)
ffs_sb_swap(asblk.b_un.b_fs, altsblock);
}
sb_oldfscompat_write(sblock, sblocksave);
if ((asblk.b_errs || cmpsblks(sblock, altsblock)) &&
dofix(&idesc[3],
"ALTERNATE SUPERBLK(S) ARE INCORRECT")) {
bwrite(fswritefd, sblk.b_un.b_buf,
fsbtodb(sblock, cgsblock(sblock, c)),
sblock->fs_sbsize);
}
sb_oldfscompat_read(sblock, 0);
}
dbase = cgbase(fs, c);
dmax = dbase + fs->fs_fpg;
if (dmax > fs->fs_size)
dmax = fs->fs_size;
if (is_ufs2 || (fs->fs_old_flags & FS_FLAGS_UPDATED))
newcg->cg_time = cg->cg_time;
newcg->cg_old_time = cg->cg_old_time;
newcg->cg_cgx = c;
newcg->cg_ndblk = dmax - dbase;
if (!is_ufs2) {
if (c == fs->fs_ncg - 1) {
/* Avoid fighting old fsck for this value. Its never used
* outside of this check anyway.
*/
if ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0)
newcg->cg_old_ncyl = fs->fs_old_ncyl % fs->fs_old_cpg;
else
newcg->cg_old_ncyl = howmany(newcg->cg_ndblk,
fs->fs_fpg / fs->fs_old_cpg);
} else
newcg->cg_old_ncyl = fs->fs_old_cpg;
newcg->cg_old_niblk = fs->fs_ipg;
newcg->cg_niblk = 0;
}
if (fs->fs_contigsumsize > 0)
newcg->cg_nclusterblks = newcg->cg_ndblk / fs->fs_frag;
newcg->cg_cs.cs_ndir = 0;
newcg->cg_cs.cs_nffree = 0;
newcg->cg_cs.cs_nbfree = 0;
newcg->cg_cs.cs_nifree = fs->fs_ipg;
if (cg->cg_rotor >= 0 && cg->cg_rotor < newcg->cg_ndblk)
newcg->cg_rotor = cg->cg_rotor;
else
newcg->cg_rotor = 0;
if (cg->cg_frotor >= 0 && cg->cg_frotor < newcg->cg_ndblk)
newcg->cg_frotor = cg->cg_frotor;
else
newcg->cg_frotor = 0;
if (cg->cg_irotor >= 0 && cg->cg_irotor < fs->fs_ipg)
newcg->cg_irotor = cg->cg_irotor;
else
newcg->cg_irotor = 0;
if (!is_ufs2) {
newcg->cg_initediblk = 0;
} else {
if ((unsigned)cg->cg_initediblk > fs->fs_ipg)
newcg->cg_initediblk = fs->fs_ipg;
else
newcg->cg_initediblk = cg->cg_initediblk;
}
memset(&newcg->cg_frsum[0], 0, sizeof newcg->cg_frsum);
memset(&old_cg_blktot(newcg, 0)[0], 0, (size_t)(sumsize));
memset(cg_inosused(newcg, 0), 0, (size_t)(mapsize));
if (!is_ufs2 && ((fs->fs_old_flags & FS_FLAGS_UPDATED) == 0) &&
fs->fs_old_postblformat == FS_42POSTBLFMT)
ocg->cg_magic = CG_MAGIC;
j = fs->fs_ipg * c;
for (i = 0; i < fs->fs_ipg; j++, i++) {
info = inoinfo(j);
switch (info->ino_state) {
case USTATE:
break;
case DSTATE:
case DCLEAR:
case DFOUND:
newcg->cg_cs.cs_ndir++;
/* fall through */
case FSTATE:
case FCLEAR:
newcg->cg_cs.cs_nifree--;
setbit(cg_inosused(newcg, 0), i);
break;
default:
if (j < ROOTINO)
break;
errexit("BAD STATE %d FOR INODE I=%ld",
info->ino_state, (long)j);
}
}
if (c == 0)
for (i = 0; i < ROOTINO; i++) {
setbit(cg_inosused(newcg, 0), i);
newcg->cg_cs.cs_nifree--;
}
for (i = 0, d = dbase;
d < dmax;
d += fs->fs_frag, i += fs->fs_frag) {
frags = 0;
for (j = 0; j < fs->fs_frag; j++) {
if (testbmap(d + j))
continue;
setbit(cg_blksfree(newcg, 0), i + j);
frags++;
}
if (frags == fs->fs_frag) {
newcg->cg_cs.cs_nbfree++;
if (sumsize) {
j = old_cbtocylno(fs, i);
old_cg_blktot(newcg, 0)[j]++;
old_cg_blks(fs, newcg, j, 0)[old_cbtorpos(fs, i)]++;
}
if (fs->fs_contigsumsize > 0)
setbit(cg_clustersfree(newcg, 0),
fragstoblks(fs, i));
} else if (frags > 0) {
newcg->cg_cs.cs_nffree += frags;
blk = blkmap(fs, cg_blksfree(newcg, 0), i);
ffs_fragacct(fs, blk, newcg->cg_frsum, 1, 0);
}
}
if (fs->fs_contigsumsize > 0) {
int32_t *sump = cg_clustersum(newcg, 0);
u_char *mapp = cg_clustersfree(newcg, 0);
int map = *mapp++;
int bit = 1;
int run = 0;
for (i = 0; i < newcg->cg_nclusterblks; i++) {
if ((map & bit) != 0) {
run++;
} else if (run != 0) {
if (run > fs->fs_contigsumsize)
run = fs->fs_contigsumsize;
sump[run]++;
run = 0;
}
if ((i & (NBBY - 1)) != (NBBY - 1)) {
bit <<= 1;
} else {
map = *mapp++;
bit = 1;
}
}
if (run != 0) {
if (run > fs->fs_contigsumsize)
run = fs->fs_contigsumsize;
sump[run]++;
}
}
cstotal.cs_nffree += newcg->cg_cs.cs_nffree;
cstotal.cs_nbfree += newcg->cg_cs.cs_nbfree;
cstotal.cs_nifree += newcg->cg_cs.cs_nifree;
cstotal.cs_ndir += newcg->cg_cs.cs_ndir;
cs = &fs->fs_cs(fs, c);
if (memcmp(&newcg->cg_cs, cs, sizeof *cs) != 0) {
if (debug) {
printf("cg %d: nffree: %d/%d nbfree %d/%d"
" nifree %d/%d ndir %d/%d\n",
c, cs->cs_nffree,newcg->cg_cs.cs_nffree,
cs->cs_nbfree,newcg->cg_cs.cs_nbfree,
cs->cs_nifree,newcg->cg_cs.cs_nifree,
cs->cs_ndir,newcg->cg_cs.cs_ndir);
}
if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
memmove(cs, &newcg->cg_cs, sizeof *cs);
sbdirty();
} else
markclean = 0;
}
if (doinglevel1) {
memmove(cg, newcg, (size_t)fs->fs_cgsize);
cgdirty();
continue;
}
if ((memcmp(newcg, cg, basesize) != 0) ||
(memcmp(&old_cg_blktot(newcg, 0)[0],
&old_cg_blktot(cg, 0)[0], sumsize) != 0)) {
if (dofix(&idesc[2], "SUMMARY INFORMATION BAD")) {
memmove(cg, newcg, (size_t)basesize);
memmove(&old_cg_blktot(cg, 0)[0],
&old_cg_blktot(newcg, 0)[0], (size_t)sumsize);
cgdirty();
} else
markclean = 0;
}
if (usedsoftdep) {
for (i = 0; i < inomapsize; i++) {
j = cg_inosused(newcg, 0)[i];
if ((cg_inosused(cg, 0)[i] & j) == j)
continue;
for (k = 0; k < NBBY; k++) {
if ((j & (1 << k)) == 0)
continue;
if (cg_inosused(cg, 0)[i] & (1 << k))
continue;
pwarn("ALLOCATED INODE %ld "
"MARKED FREE\n",
c * fs->fs_ipg + i * 8 + k);
}
}
for (i = 0; i < blkmapsize; i++) {
j = cg_blksfree(cg, 0)[i];
if ((cg_blksfree(newcg, 0)[i] & j) == j)
continue;
for (k = 0; k < NBBY; k++) {
if ((j & (1 << k)) == 0)
continue;
if (cg_inosused(cg, 0)[i] & (1 << k))
continue;
pwarn("ALLOCATED FRAG %ld "
"MARKED FREE\n",
c * fs->fs_fpg + i * 8 + k);
}
}
}
if (memcmp(cg_inosused(newcg, 0), cg_inosused(cg, 0), mapsize)
!= 0 && dofix(&idesc[1], "BLK(S) MISSING IN BIT MAPS")) {
memmove(cg_inosused(cg, 0), cg_inosused(newcg, 0),
(size_t)mapsize);
cgdirty();
}
}
if (memcmp(&cstotal, &fs->fs_cstotal, cssize) != 0) {
if (debug) {
printf("total: nffree: %lld/%lld nbfree %lld/%lld"
" nifree %lld/%lld ndir %lld/%lld\n",
(long long int)fs->fs_cstotal.cs_nffree,
(long long int)cstotal.cs_nffree,
(long long int)fs->fs_cstotal.cs_nbfree,
(long long int)cstotal.cs_nbfree,
(long long int)fs->fs_cstotal.cs_nifree,
(long long int)cstotal.cs_nifree,
(long long int)fs->fs_cstotal.cs_ndir,
(long long int)cstotal.cs_ndir);
}
if (dofix(&idesc[0], "FREE BLK COUNT(S) WRONG IN SUPERBLK")) {
memmove(&fs->fs_cstotal, &cstotal, sizeof cstotal);
fs->fs_ronly = 0;
fs->fs_fmod = 0;
sbdirty();
} else
markclean = 0;
}
#ifdef PROGRESS
if (!preen)
progress_done();
#endif /* PROGRESS */
}
int
do_run_test (int n_rounds, int _local_w_id, int _n_ware)
{
int i;
long start_check_point = get_msec_count (), check_point;
long start_total = get_msec_count (), total;
if (strstr (dbms, "Virtuoso"))
{
new_order_text = new_order_text_kubl;
payment_text = payment_text_kubl;
delivery_text = delivery_text_kubl;
slevel_text = slevel_text_kubl;
ostat_text = ostat_text_kubl;
}
else if (strstr (dbms, "SQL Server"))
{
new_order_text = new_order_text_mssql;
payment_text = payment_text_mssql;
delivery_text = delivery_text_mssql;
slevel_text = slevel_text_mssql;
ostat_text = ostat_text_mssql;
}
else if (strstr (dbms, "Oracle"))
{
new_order_text = new_order_text_ora;
payment_text = payment_text_ora;
delivery_text = delivery_text_ora;
slevel_text = slevel_text_ora;
ostat_text = ostat_text_ora;
}
else if (strstr (dbms, "SOAP"))
{
new_order_text = new_order_text_SOAP;
payment_text = payment_text_SOAP;
delivery_text = delivery_text_SOAP;
slevel_text = slevel_text_SOAP;
ostat_text = ostat_text_SOAP;
}
else
{
return 0;
}
if (_local_w_id != -1)
{
local_w_id = _local_w_id;
n_ware = _n_ware;
}
reset_times ();
#ifdef GUI
set_progress_max (n_rounds);
#endif
ta_init (&total_ta, "TOTAL");
ta_init (&check_point_ta, "CHECK_POINT");
ta_enter (&total_ta);
ta_enter (&check_point_ta);
for (i = 0; i < n_rounds; i++)
{
do_10_pack ();
if (i && 0 == i % SAMPLE_CHECK)
{
check_point = get_msec_count () - start_check_point;
total = get_msec_count () - start_total;
printf
("# Transaction No:%d Last cycle:%ld tpmC From start:%ld tpmC\n", \
i, 600000 / (check_point / SAMPLE_CHECK),
600000 / (total / i));
ta_init (&check_point_ta, "CHECK_POINT");
/*Do statistic */
}
#if 0
/* not the client's problem during test run */
if (i && 0 == i % CHECK_POINT_INTERVAL)
scrap_log ();
#endif
if (i && 0 == i % 10)
{
#if !defined(GUI)
print_times ();
reset_times ();
#endif
}
#if defined(GUI)
progress (i);
#endif
}
#if defined(GUI)
progress_done ();
#endif
total = get_msec_count () - start_total;
printf ("# Total transactions:%d %ld tpmC, %d retries\n", i, 600000 / (total / i), n_deadlocks);
return 1;
}
static int goal_enter(void)
{
const char *s1 = _("New Record");
const char *s2 = _("GOAL");
int id, jd, kd, ld, md;
const struct level *l = get_level(curr_level());
int high = progress_lvl_high();
if (new_name)
{
progress_rename(0);
new_name = 0;
}
if ((id = gui_vstack(0)))
{
int gid;
if (high)
gid = gui_label(id, s1, GUI_MED, GUI_ALL, gui_grn, gui_grn);
else
gid = gui_label(id, s2, GUI_LRG, GUI_ALL, gui_blu, gui_grn);
gui_space(id);
if (curr_mode() == MODE_CHALLENGE)
{
int coins, score, balls;
char msg[MAXSTR] = "";
int i;
/* Reverse-engineer initial score and balls. */
if (resume)
{
coins = 0;
score = curr_score();
balls = curr_balls();
}
else
{
coins = curr_coins();
score = curr_score() - coins;
balls = curr_balls();
for (i = curr_score(); i > score; i--)
if (progress_reward_ball(i))
balls--;
}
sprintf(msg, ngettext("%d new bonus level",
"%d new bonus levels",
curr_bonus()), curr_bonus());
if ((jd = gui_hstack(id)))
{
gui_filler(jd);
if ((kd = gui_vstack(jd)))
{
if ((ld = gui_hstack(kd)))
{
if ((md = gui_harray(ld)))
{
balls_id = gui_count(md, 100, GUI_MED, GUI_NE);
gui_label(md, _("Balls"), GUI_SML, 0,
gui_wht, gui_wht);
}
if ((md = gui_harray(ld)))
{
score_id = gui_count(md, 1000, GUI_MED, 0);
gui_label(md, _("Score"), GUI_SML, 0,
gui_wht, gui_wht);
}
if ((md = gui_harray(ld)))
{
coins_id = gui_count(md, 100, GUI_MED, 0);
gui_label(md, _("Coins"), GUI_SML, GUI_NW,
gui_wht, gui_wht);
}
gui_set_count(balls_id, balls);
gui_set_count(score_id, score);
gui_set_count(coins_id, coins);
}
gui_label(kd, msg, GUI_SML, GUI_BOT, 0, 0);
}
gui_filler(jd);
}
gui_space(id);
}
else
{
balls_id = score_id = coins_id = 0;
}
gui_score_board(id, (GUI_MOST_COINS |
GUI_BEST_TIMES |
GUI_FAST_UNLOCK), 1, high);
gui_space(id);
if ((jd = gui_harray(id)))
{
if (progress_done())
gui_start(jd, _("Finish"), GUI_SML, GOAL_DONE, 0);
else if (progress_last())
gui_start(jd, _("Finish"), GUI_SML, GOAL_LAST, 0);
if (progress_next_avail())
gui_start(jd, _("Next Level"), GUI_SML, GOAL_NEXT, 0);
if (progress_same_avail())
gui_start(jd, _("Retry Level"), GUI_SML, GOAL_SAME, 0);
if (demo_saved())
gui_state(jd, _("Save Replay"), GUI_SML, GOAL_SAVE, 0);
}
if (!resume)
gui_pulse(gid, 1.2f);
gui_layout(id, 0, 0);
}
set_score_board(&l->score.most_coins, progress_coin_rank(),
&l->score.best_times, progress_time_rank(),
&l->score.fast_unlock, progress_goal_rank());
audio_music_fade_out(2.0f);
video_clr_grab();
/* Reset hack. */
resume = 0;
return id;
}
int
test_dispatch(int u, test_t *test, int loops, args_t *a)
/*
* Function: test_dispatch
* Purpose: Run a selected test.
* Parameters: test - Pointer to test entry to run.
* loops - # of iterations, if -1 count taken from test default.
* a - arguments to pass to test.
* Returns: TEST_XXX
*/
{
jmp_buf jmp; /* ^C out of tests must be trapped */
int i; /* Loop counter */
int error; /* No error */
int arg_saved;
volatile int vloops = loops; /* "loops"/setjmp clobber war */
args_t * volatile av = a;
args_t * volatile args = 0;
void * volatile fp; /* Test function pointer parameter */
volatile int cleanup = FALSE;
int rv;
/* Check if test supported */
if (!(test->t_flags & _test_chip(u))) {
if (test_options & TEST_O_OVERRIDE) {
cli_out("Warning: Running test %d (%s) not supported on %s\n",
test->t_test, test->t_name, SOC_UNIT_GROUP(u));
}
}
if (test_options & TEST_O_RUN) {
cli_out("Test %d (%s) Started\n", test->t_test, test->t_name);
}
COMPILER_REFERENCE(cleanup);
error = TEST_RUNNING;
#ifndef NO_CTRL_C
if (TEST_RUNNING != (error = setjmp(jmp))) { /* Control C handler */
if (test_active) {
if (cleanup) {
cli_out("Warning: Cleanup aborted - "
"continue at your own risk\n");
} else {
cleanup = TRUE;
cli_out("Warning: cleaning up active test: %s\n",
test_active->t_name);
test->t_flags |= T_F_STOP; /* Say processed stop */
test_done(u, test_active, error);
test_test_done(u, test_active, fp);
if (args) {
sal_free(args);
}
}
sh_pop_ctrl_c();
test_thread = NULL;
test_active = NULL;
return(TEST_INTR);
}
}
#endif
sh_push_ctrl_c(&jmp);
test_thread = sal_thread_self();
/* If no arguments passed in, use default args */
error = TEST_ABORT;
if (!av) {
if ((av = args = sal_alloc(sizeof(args_t), "test_args")) == NULL) {
goto return_no_free;
}
if (diag_parse_args(test->t_override_string ?
test->t_override_string : test->t_default_string,
NULL,
av)) {
test->t_fail++;
last_test_status[u] = -1;
goto return_with_free;
}
}
fp = NULL;
if (-1 == vloops) { /* Assign AFTER setjmp */
vloops = test->t_loops; /* Use default */
}
test_active = test;
test->t_flags |= T_F_ACTIVE;
arg_saved = av->a_arg; /* Some may be consumed */
rv = test_test_init(u, test, av, (void **)&fp);
/* check if return value is != BCM_E_UNAVAIL because the memory test on the internal
* memories will return BCM_E_UNAVAIL if External TCAM is present. Those memories shouldn't
* be tested instead should be skipped. */
if ((rv != BCM_E_UNAVAIL) && (rv)){
test->t_runs++; /* Increment RUN/FAIL count */
test->t_fail++;
last_test_status[u] = -1;
test->t_flags &= ~T_F_ACTIVE;
test_active = NULL;
test_thread = NULL;
goto return_with_free;
}
#ifndef NO_CTRL_C
if (TEST_RUNNING != (error = setjmp(test_active_jmp))) {
if (cleanup) {
cli_out("Warning: Cleanup aborted - "
"continue at your own risk\n");
} else {
cleanup = TRUE;
test_done(u, test, error);
}
} else {
#endif
/* If progress reporting requested, set it up ... */
if (test_options & TEST_O_PROGRESS) {
progress_init(vloops, 0, FALSE);
progress_status(test->t_name);
}
for (i = 0; i < vloops; i++) {
if (vloops > 1) {
LOG_VERBOSE(BSL_LS_APPL_TESTS,
(BSL_META_U(u,
"Test %d: %s. Starting interation %d.\n"),
test->t_test, test->t_name, i+1));
}
test->t_runs++; /* Let-em know we ran */
av->a_arg = arg_saved; /* Reset ARG pointer */
test->t_flags &= ~(T_F_STOP|T_F_ERROR);
/* Skip if rv is BCM_E_UNAVAIL as we mentioned above */
if (rv != BCM_E_UNAVAIL) {
error = test->t_test_f(u, av, fp);/* Run Test */
}
if (error == 0 && test->t_flags & T_F_ERROR) {
/* Some tests call test_error but fail to return error */
error = -1;
}
test_done(u, test, error);
if (test_options & TEST_O_PROGRESS) {
progress_report(1);
}
}
if (test_options & TEST_O_PROGRESS) {
progress_done();
}
#ifndef NO_CTRL_C
}
#endif
/* Skip if rv is BCM_E_UNAVAIL as we mentioned above */
if (rv != BCM_E_UNAVAIL) {
(void)test_test_done(u, test, fp); /* Run done routines/scripts */
} else {
/* If Return Value is BCM_E_UNAVAIL it is assumed that the internal
* memories are being tested for External TCAm devices and the test has
* not supported these memories. Even though the test is not executed
* increasing the test success count in order to show up in the final test
* results as not failed.
* */
test_active = NULL;
test_thread = NULL;
test->t_success++;
}
return_with_free:
if (args != NULL) {
sh_block_ctrl_c(TRUE);
sal_free(args);
args = 0;
sh_block_ctrl_c(FALSE);
}
return_no_free:
sh_pop_ctrl_c();
if (test_options & TEST_O_RUN) {
cli_out("Completed test (%d) %s\n", test->t_test, test->t_name);
}
if (a != NULL)
ARG_DISCARD(a);
return(error);
}
void
pass2(void)
{
union dinode *dp;
struct inoinfo **inpp, *inp, *pinp;
struct inoinfo **inpend;
struct inostat *rinfo, *info;
struct inodesc curino;
union dinode dino;
int i, maxblk;
char pathbuf[MAXPATHLEN + 1];
rinfo = inoinfo(ROOTINO);
switch (rinfo->ino_state) {
case USTATE:
pfatal("ROOT INODE UNALLOCATED");
if (reply("ALLOCATE") == 0) {
markclean = 0;
ckfini();
exit(FSCK_EXIT_CHECK_FAILED);
}
if (allocdir(ROOTINO, ROOTINO, 0755) != ROOTINO)
errexit("CANNOT ALLOCATE ROOT INODE");
break;
case DCLEAR:
pfatal("DUPS/BAD IN ROOT INODE");
if (reply("REALLOCATE")) {
freeino(ROOTINO);
if (allocdir(ROOTINO, ROOTINO, 0755) != ROOTINO)
errexit("CANNOT ALLOCATE ROOT INODE");
break;
}
markclean = 0;
if (reply("CONTINUE") == 0) {
ckfini();
exit(FSCK_EXIT_CHECK_FAILED);
}
break;
case FSTATE:
case FCLEAR:
pfatal("ROOT INODE NOT DIRECTORY");
if (reply("REALLOCATE")) {
freeino(ROOTINO);
if (allocdir(ROOTINO, ROOTINO, 0755) != ROOTINO)
errexit("CANNOT ALLOCATE ROOT INODE");
break;
}
if (reply("FIX") == 0) {
markclean = 0;
ckfini();
exit(FSCK_EXIT_CHECK_FAILED);
}
dp = ginode(ROOTINO);
DIP_SET(dp, mode,
iswap16((iswap16(DIP(dp, mode)) & ~IFMT) | IFDIR));
inodirty();
break;
case DSTATE:
break;
default:
errexit("BAD STATE %d FOR ROOT INODE", rinfo->ino_state);
}
if (newinofmt) {
info = inoinfo(WINO);
info->ino_state = FSTATE;
info->ino_type = DT_WHT;
}
/*
* Sort the directory list into disk block order.
*/
qsort((char *)inpsort, (size_t)inplast, sizeof *inpsort, blksort);
/*
* Check the integrity of each directory.
*/
memset(&curino, 0, sizeof(struct inodesc));
curino.id_type = DATA;
curino.id_func = pass2check;
inpend = &inpsort[inplast];
for (inpp = inpsort; inpp < inpend; inpp++) {
if (got_siginfo) {
fprintf(stderr,
"%s: phase 2: dir %ld of %d (%d%%)\n", cdevname(),
(long)(inpp - inpsort), (int)inplast,
(int)((inpp - inpsort) * 100 / inplast));
got_siginfo = 0;
}
#ifdef PROGRESS
progress_bar(cdevname(), preen ? NULL : "phase 2",
(inpp - inpsort), inplast);
#endif /* PROGRESS */
inp = *inpp;
if (inp->i_isize == 0)
continue;
if (inp->i_isize < MINDIRSIZE) {
direrror(inp->i_number, "DIRECTORY TOO SHORT");
inp->i_isize = roundup(MINDIRSIZE, dirblksiz);
if (reply("FIX") == 1) {
dp = ginode(inp->i_number);
DIP_SET(dp, size, iswap64(inp->i_isize));
inodirty();
} else
markclean = 0;
} else if ((inp->i_isize & (dirblksiz - 1)) != 0) {
getpathname(pathbuf, sizeof(pathbuf), inp->i_number,
inp->i_number);
if (usedsoftdep)
pfatal("%s %s: LENGTH %lld NOT MULTIPLE OF %d",
"DIRECTORY", pathbuf,
(long long)inp->i_isize, dirblksiz);
else
pwarn("%s %s: LENGTH %lld NOT MULTIPLE OF %d",
"DIRECTORY", pathbuf,
(long long)inp->i_isize, dirblksiz);
if (preen)
printf(" (ADJUSTED)\n");
inp->i_isize = roundup(inp->i_isize, dirblksiz);
if (preen || reply("ADJUST") == 1) {
dp = ginode(inp->i_number);
DIP_SET(dp, size, iswap64(inp->i_isize));
inodirty();
} else
markclean = 0;
}
memset(&dino, 0, sizeof dino);
dp = &dino;
if (!is_ufs2) {
dp->dp1.di_mode = iswap16(IFDIR);
dp->dp1.di_size = iswap64(inp->i_isize);
maxblk = inp->i_numblks < NDADDR ? inp->i_numblks :
NDADDR;
for (i = 0; i < maxblk; i++)
dp->dp1.di_db[i] = inp->i_blks[i];
if (inp->i_numblks > NDADDR) {
for (i = 0; i < NIADDR; i++)
dp->dp1.di_ib[i] =
inp->i_blks[NDADDR + i];
}
} else {
dp->dp2.di_mode = iswap16(IFDIR);
dp->dp2.di_size = iswap64(inp->i_isize);
maxblk = inp->i_numblks < NDADDR ? inp->i_numblks :
NDADDR;
for (i = 0; i < maxblk; i++)
dp->dp2.di_db[i] = inp->i_blks[i];
if (inp->i_numblks > NDADDR) {
for (i = 0; i < NIADDR; i++)
dp->dp2.di_ib[i] =
inp->i_blks[NDADDR + i];
}
}
curino.id_number = inp->i_number;
curino.id_parent = inp->i_parent;
(void)ckinode(&dino, &curino);
}
/*
* Byte swapping in directory entries, if needed, has been done.
* Now rescan dirs for pass2check()
*/
if (do_dirswap) {
do_dirswap = 0;
for (inpp = inpsort; inpp < inpend; inpp++) {
inp = *inpp;
if (inp->i_isize == 0)
continue;
memset(&dino, 0, sizeof dino);
if (!is_ufs2) {
dino.dp1.di_mode = iswap16(IFDIR);
dino.dp1.di_size = iswap64(inp->i_isize);
for (i = 0; i < inp->i_numblks; i++)
dino.dp1.di_db[i] = inp->i_blks[i];
} else {
dino.dp2.di_mode = iswap16(IFDIR);
dino.dp2.di_size = iswap64(inp->i_isize);
for (i = 0; i < inp->i_numblks; i++)
dino.dp2.di_db[i] = inp->i_blks[i];
}
curino.id_number = inp->i_number;
curino.id_parent = inp->i_parent;
(void)ckinode(&dino, &curino);
}
}
/*
* Now that the parents of all directories have been found,
* make another pass to verify the value of `..'
*/
for (inpp = inpsort; inpp < inpend; inpp++) {
inp = *inpp;
if (inp->i_parent == 0 || inp->i_isize == 0)
continue;
if (inp->i_dotdot == inp->i_parent ||
inp->i_dotdot == (ino_t)-1)
continue;
info = inoinfo(inp->i_parent);
if (inp->i_dotdot == 0) {
inp->i_dotdot = inp->i_parent;
fileerror(inp->i_parent, inp->i_number, "MISSING '..'");
if (reply("FIX") == 0) {
markclean = 0;
continue;
}
(void)makeentry(inp->i_number, inp->i_parent, "..");
info->ino_linkcnt--;
continue;
}
fileerror(inp->i_parent, inp->i_number,
"BAD INODE NUMBER FOR '..'");
if (reply("FIX") == 0) {
markclean = 0;
continue;
}
inoinfo(inp->i_dotdot)->ino_linkcnt++;
info->ino_linkcnt--;
inp->i_dotdot = inp->i_parent;
(void)changeino(inp->i_number, "..", inp->i_parent);
}
/*
* Create a list of children for each directory.
*/
inpend = &inpsort[inplast];
for (inpp = inpsort; inpp < inpend; inpp++) {
inp = *inpp;
info = inoinfo(inp->i_number);
inp->i_child = inp->i_sibling = 0;
if (info->ino_state == DFOUND)
info->ino_state = DSTATE;
}
for (inpp = inpsort; inpp < inpend; inpp++) {
inp = *inpp;
if (inp->i_parent == 0 ||
inp->i_number == ROOTINO)
continue;
pinp = getinoinfo(inp->i_parent);
inp->i_sibling = pinp->i_child;
pinp->i_child = inp;
}
/*
* Mark all the directories that can be found from the root.
*/
propagate(ROOTINO);
#ifdef PROGRESS
if (!preen)
progress_done();
#endif /* PROGRESS */
}
