static int
mpiPi_callsite_stats_op_comparator (const void *p1, const void *p2)
{
callsite_stats_t *csp_1 = (callsite_stats_t *) p1;
callsite_stats_t *csp_2 = (callsite_stats_t *) p2;
MPIP_CALLSITE_STATS_COOKIE_ASSERT (csp_1);
MPIP_CALLSITE_STATS_COOKIE_ASSERT (csp_2);
#define express(f) {if ((csp_1->f) > (csp_2->f)) {return 1;} if ((csp_1->f) < (csp_2->f)) {return -1;}}
express (op);
#undef express
return 0;
}
static int
mpiPi_pt2pt_stats_rank_comparator (const void *p1, const void *p2)
{
pt2pt_stats_t *ptp_1 = (pt2pt_stats_t *) p1;
pt2pt_stats_t *ptp_2 = (pt2pt_stats_t *) p2;
MPIP_PT2PT_STATS_COOKIE_ASSERT (ptp_1);
MPIP_PT2PT_STATS_COOKIE_ASSERT (ptp_2);
#define express(f) {if ((ptp_1->f) > (ptp_2->f)) {return 1;} if ((ptp_1->f) < (ptp_2->f)) {return -1;}}
express (rank);
#undef express
return 0;
}
//for语句
//<for循环语句>::=for<标识符>:=<表达式>（downto|to）<表达式>do<语句>
AST_node stat_for(AST_node t)
{
printf("----------------For Loop--------------\n");
t->ast_type = FORSTAT;
match(FOR,t);
if (!match(IDENT,t))
{
error("Missing identifier for \"for-statement\"");
recovery(1, BECOMES);
}
if (!match(BECOMES,t))
{
error("Missing assign symbol");
recovery(5, PLUS, MINUS, IDENT, LPARENT, NUM);
}
express(t);
if (!match(DOWNTO,t))
{
if (!match(TO,t))
{
error("Missing \"downto\" or \"to\"");
recovery(5, IDENT, MINUS, PLUS, NUM, LPARENT);
}
}
express(t);
if (!match(DO,t))
{
error("Missing do clause");
//因为可能是空语句，所以不需要错误恢复
//recovery(IDENT, IF, FOR, BEGIN, READ, WRITE);
}
AST_node stat = makeNode(STATS, t);
statement(stat);
printf("----------------End of For Loop--------------\n");
return t;
}
int
callsite_src_id_cache_comparator (const void *p1, const void *p2)
{
int i;
callsite_src_id_cache_entry_t *csp_1 = (callsite_src_id_cache_entry_t *) p1;
callsite_src_id_cache_entry_t *csp_2 = (callsite_src_id_cache_entry_t *) p2;
#define express(f) {if ((csp_1->f) > (csp_2->f)) {return 1;} if ((csp_1->f) < (csp_2->f)) {return -1;}}
for (i = 0; i < MPIP_CALLSITE_STACK_DEPTH; i++)
{
if (csp_1->filename[i] != NULL && csp_2->filename[i] != NULL)
{
if (strcmp (csp_1->filename[i], csp_2->filename[i]) > 0)
{
return 1;
}
if (strcmp (csp_1->filename[i], csp_2->filename[i]) < 0)
{
return -1;
}
express (line[i]);
if (strcmp (csp_1->functname[i], csp_2->functname[i]) > 0)
{
return 1;
}
if (strcmp (csp_1->functname[i], csp_2->functname[i]) < 0)
{
return -1;
}
}
express (pc[i]);
}
#undef express
return 0;
}
void sort (int n[5]) {
for (int j = 0; j < 10; j++) {
for (int i = 0; i < 5; i++) {
if (n[i] > n[i + 1]) {
int temp;
temp = n[i + 1];
n[i + 1] = n[i];
n[i] = temp;
}
}
}
express (n);
}
int main () {
printf ("\nBUBBLE SORT\n");
printf ("\nPlease enter five integers\n");
int numbers[5];
for (int i = 0; i < 5; i++) {
scanf ("%i", &numbers[i]);
}
express (numbers);
sort (numbers);
return 0;
}
int compute(const char* exp)
{
LinkStack* stack = LinkStack_Create();
int ret = 0;
int i = 0;
while (exp[i] != '\0')
{
if (isNumber3(exp[i]))
{
LinkStack_Push(stack, (void*)value(exp[i]));
}
else if (isOperator3(exp[i]))
{
int right = (int)LinkStack_Pop(stack);
int left = (int)LinkStack_Pop(stack);
int result = express(left, right, exp[i]);
LinkStack_Push(stack, (void*)result);
}
else
{
printf("Invalid expression!");
break;
}
i++;
}
if ((LinkStack_Size(stack) == 1) && (exp[i] == '\0'))
{
ret = (int)LinkStack_Pop(stack);
}
else
{
printf("Invalid expression!");
}
LinkStack_Destroy(stack);
return ret;
}
DecimalType PreciseDecimal::getValue() const
{
return express( myInteger, myDecimal, myMaxDecimalDigits, myIsNegative );
}
DecimalType PreciseDecimal::getMaxExpressibleNumber() const
{
return express( myMaxExpressibleInteger, myMaxExpressibleDecimal, myMaxDecimalDigits, myIsNegative );
}
scprog()
{ short i,j,k,l,m,n,stconj,np,pm1,ncr,crct,ndc,dcct,
lo,intexsk,stpt,lpt,stint,olen,pt,ad,*p1,*ip1,*p2,*ip2,
*pint,*ptr,*g,*ig,ino,olo,**vsvptr;
int quot;
char ingp,igth;
if ((ip=fopen(inf1,"r"))==0)
{ fprintf(stderr,"Cannot open %s.\n",inf1); return(-1); }
fscanf(ip,"%hd%hd%hd%hd",&npt,&exp,&nb,&l);
if (npt>mpt)
{ fprintf(stderr,"npt too big. Increase MPT.\n"); return(-1); }
if (nb>=mb)
{ fprintf(stderr,"nb too big. Increase MB.\n"); return(-1); }
if (nb*npt*2>svsp)
{ fprintf(stderr,"svsp too small. Increase SVSP.\n"); return(-1); }
if (exp>=mexp)
{ fprintf(stderr,"exp too big. Increase MEXP.\n"); return(-1); }
if (l!=2) {fprintf(stderr,"Wrong input format.\n"); return(-1);}
readbaselo(nb,base,lorb); npt1=npt+1;
quot=psp/npt1; if (quot>mp) quot=mp; mxp=quot; mxp=2*(mxp/2);
if (2*exp>mxp)
{ fprintf(stderr,"Out of perm space. Increase PSP (or MP).\n"); return(-1); }
for (i=0;i<mxp;i++) pptr[i]=perm+i*npt1-1;
for (i=1;i<=nb;i++) svptr[i]=sv+(i-1)*npt-1;
readpsv(0,nb,exp,svptr);
for (i=exp;i>=1;i--) fscanf(ip,"%hd",pwt+i);
fscanf(ip,"%hd%hd",&prime,&ngads);
if (2*exp+ngads>mxp)
{ fprintf(stderr,"Out of perm space. Increase PSP (or MP).\n"); return(-1); }
for (i=1;i<=exp;i++) fscanf(ip,"%hd",power+i);
for (i=1;i<=exp;i++) { j=2*(i-1); ngno[i]=j; igno[j+1]=i; }
k=2*exp-1;
for (i=1;i<=ngads;i++)
{ l=i+k; readvec(pptr[l],1); m=pptr[l][npt1]; ngno[m]=l; }
fclose(ip);
stconj=2*exp+ngads-1; itp=tp+npt1;
if (4*exp+ngads>mxp)
{ fprintf(stderr,"Out of perm space. Increase PSP (or MP).\n"); return(-1); }
if (subgp)
{ stig=stconj+2*exp;
for (i=1;i<=nb;i++) sv2ptr[i]=sv+(nb+i-1)*npt-1;
if (subgp>1)
{strcpy(inf3,inf0); strcat(inf3,"sg"); sgstr[0]=sgc; strcat(inf3,sgstr);}
if (rsgp()== -1) return(-1);
igth=1;
}
else vsvptr=svptr;
if ((ip=fopen(inf2,"r"))==0)
{ printf("Cannot open %s.\n",inf2); return(-1); }
fscanf(ip,"%hd%hd",&i,&ndc); while (getc(ip)!='\n');
if (i!=npt) {printf("dcr has npt false.\n"); return(-1); }
/* If subgp is true, then we will have to update the dcr file, so we print
it out on to a temporary file as we go along.
*/
if (subgp)
{ opy=fopen(outft,"w"); fprintf(opy,"%4d%4d%4d%4d\n",npt,ndc,0,0);}
op=fopen(outf,"w"); pm1=prime-1; setpinv();
for (dcct=1;dcct<=ndc;dcct++)
{ if (subgp>1 && igth==0)
{ strcpy(inf3,inf0); strcat(inf3,"sg"); sgstr[0]=sgc;
strcat(inf3,sgstr); ipkp=ip;
if (rsgp()== -1) return(-1);
ip=ipkp; vsvptr=sv2ptr; igth=1;
}
else if (subgp) vsvptr=sv2ptr;
readvec(dcrep,0); invert(dcrep,dcrepinv);
fscanf(ip,"%hd",&lo); intexp=0; olo=lo;
while (lo%prime==0) {intexp++; lo/=prime; }
if (lo!=1) printf("Warning. lo was not a power of p.\n");
intexp=exp-intexp; printf("dcct,intexp=%d,%d.\n",dcct,intexp);
/* intexp is the exponent of Q = P ^ gPg(-1), for the current dcrep g */
if (intexp==0 || (intexp==1 && mult))
{ if (subgp)
{ if (npt>=1000) for (n=1;n<=npt;n++) fprintf(opy,"%5d",dcrep[n]);
else for (n=1;n<=npt;n++) fprintf(opy,"%4d",dcrep[n]);
fprintf(opy," %4d\n",olo);
}
if (mult==0) fprintf(op,"%4d\n",0);
continue;
}
/* Now we compute the gens g(-1)h(i)g, where h(i) are the PCP gens of P */
for (i=1;i<=exp;i++)
{ p1=pptr[ngno[i]]; p2=pptr[stconj+i];
for (n=1;n<=npt;n++) p2[n]=dcrep[p1[dcrepinv[n]]];
}
stint=stconj+exp; pint=pptr[stint]; intexsk=0;
for (i=1;i<=exp;i++) intno[i]=0;
lpt=1; stpt=1; pm1=prime-1;
/* Now we search through the elements of g(-1)Pg, testing for membership of
P, until we have found the intexp gens of g(-1)Qg.
*/
for (i=1;i<=exp;i++)
{ olen=1; cp[1]=stconj+i;
for (j=1;j<=exp;j++) co[j]=0;
while(1)
{ *cp=olen; ingp=1;
for (k=1;k<=nb;k++)
{ pt=image(base[k]); ptr=vsvptr[k];
if (ptr[pt]==0) {ingp=0; ad=stpt; break;}
if (k<nb) addsv(pt,ptr);
}
if (ingp) break;
while (co[ad]==pm1) {olen-=pm1; co[ad]=0; ad=fpt[ad]; }
if (ad==i) { lpt=i; fpt[i]=i+1; break; }
olen++; co[ad]++; cp[olen]=stconj+ad;
}
if (ingp)
{ intexsk++; pint+=npt1; *cp=olen;
for (n=1;n<=npt;n++) pint[n]=image(n);
pint[npt1]=intexsk; intno[i]=stconj+2*intexsk-1;
if (intexsk==intexp) break;
if (stpt==i) {lpt=i+1; stpt=lpt; } else fpt[lpt]=i+1;
}
}
/* Search is complete */
if (intexsk<intexp) {fprintf(stderr,"Intersection error.\n"); return(-1); }
printf("Found intersection.\n");
/* If subgp, then we will now modify g, until H ^ gHg- contains Q */
if (subgp) for (m=subgp;m>=1;m--)
{ if (m==subgp) for (i=1;i<=npt;i++) {tp[i]=i; itp[i]=i;}
if (subgp>1)
{ strcpy(inf4,inf0); strcat(inf4,"cr"); strcat(inf4,sgstr);
if (m>1)
{ sgstr[0]--; strcpy(inf3,inf0); strcat(inf3,"sg"); strcat(inf3,sgstr);
ipkp=ip;
if (rsgp()== -1) return(-1);
ip=ipkp; igth=0; vsvptr=sv2ptr;
}
else vsvptr=svptr;
}
else vsvptr=svptr;
if ((ipcr=fopen(inf4,"r"))==0)
{ fprintf(stderr,"Cannot open %s.\n",inf4); return(-1); }
ingp=0;
fscanf(ipcr,"%hd%hd",&n,&ncr); while (getc(ipcr)!='\n');
if (n!=npt) { fprintf(stderr,"inf4 has npt wrong.\n"); return(-1); }
for (crct=0;crct<=ncr;crct++)
{ if (crct==0) for (n=1;n<=npt;n++) crep[n]=n;
else for (n=1;n<=npt;n++) fscanf(ipcr,"%hd",crep+n);
invert(crep,crepinv);
for (i=1;i<=intexp;i++)
{ p1=pptr[stint+i]; *cp=0;
for (j=1;j<=nb;j++)
{ pt=image(crep[tp[p1[itp[crepinv[base[j]]]]]]); ptr=vsvptr[j];
if (ptr[pt]==0) goto nextcr;
if (j<nb) addsv(pt,ptr);
}
}
ingp=1; printf("Got intersection in subgp %d. crct=%d.\n",m-1,crct);
for (n=1;n<=npt;n++) tp[n]=crep[tp[n]]; invert(tp,itp);
fclose(ipcr); break;
nextcr:;
}
if (ingp==0)
{ fprintf(stderr,"Cannot get intersection in subgp %d.\n",m-1);
return(-1);
}
}
/* Now we reconjugate the gens of g(-1)Qg by g(-1) to get gens of Q */
for (i=1;i<=intexp;i++)
{ p1=pptr[stconj+2*i-1]; p2=pptr[stint+i];
for (n=1;n<=npt;n++) p1[n]=dcrepinv[p2[dcrep[n]]]; p1[npt1]=p2[npt1];
invert(p1,p1+npt1);
}
/* If subgp, then update dcr */
if (subgp)
{ if (npt>=1000) for (n=1;n<=npt;n++)
{ dcrep[n]=tp[dcrep[n]]; fprintf(opy,"%5d",dcrep[n]); }
else for (n=1;n<=npt;n++)
{ dcrep[n]=tp[dcrep[n]]; fprintf(opy,"%4d",dcrep[n]); }
fprintf(opy," %4d\n",olo); invert(dcrep,dcrepinv);
}
norm= intexp==exp;
/* If norm, then we do not need to compute the PCP for Q */
if (norm)
{ fprintf(op,"%4d\n",intexp);
if (mult==0)
{ for (i=exp;i>=1;i--) { wt[i]=pwt[i]; fprintf(op,"%4d",wt[i]); }
fprintf(op,"\n");
}
goto outconj;
}
/* Now we compute the PCP for Q. This is similar to the algorithm in pcrun */
for (i=1;i<=intexp;i++) { wt[i]=1; d1[i]=0; d2[i]=0; }
restart:
if (mult) nwt=2;
for (i=intexp;i>=2;i--)
{ p1=pptr[stconj+2*i-1]; ip1=p1+npt1;
for (j=intexp;j>i;j--)
{ if (mult==0) nwt=wt[i]+wt[j];
p2=pptr[stconj+2*j-1]; ip2=p2+npt1;
for (n=1;n<=npt;n++) {pt=p2[p1[ip2[ip1[n]]]]; tp[n]=pt; itp[pt]=n; }
if ((n=expint(intexp+1-i,intexp+1-j,nwt))>0) goto restart;
if (n== -1) return(-1);
}
}
if (mult==0) for (i=intexp;i>=2;i--)
{ nwt=wt[i]+1; p1=pptr[stconj+2*i-1]; ip1=p1+npt1;
for (n=1;n<=npt;n++)
{ pt=n; for (m=1;m<=prime;m++) pt=p1[pt]; tp[n]=pt; itp[pt]=n; }
if ((n=expint(intexp+1-i,intexp+1-i,nwt))>0) goto restart;
if (n== -1) return(-1);
}
fprintf(op,"%4d\n",intexp);
if (mult==0)
{ for (i=intexp;i>=1;i--) fprintf(op,"%3d",wt[i]); fprintf(op,"\n"); }
/* We output the PCP gens of Q followed by those of g(-1)Qg */
for (i=intexp;i>=1;i--)
{ p1=pptr[stconj+2*i-1]; p2=tp; ptr=p1+2*npt1;
while (p1<ptr) *(++p2)= *(++p1);
express(tp,rel,0); l= *rel;
for (n=0;n<=l;n++) fprintf(op,"%4d",rel[n]); fprintf(op,"\n");
}
outconj:
for (i=intexp;i>=1;i--)
{ p1= pptr[stconj+2*i-1];
for (n=1;n<=npt;n++) {pt=dcrep[p1[dcrepinv[n]]]; tp[n]=pt; itp[pt]=n; }
express(tp,rel,0); l= *rel;
for (n=0;n<=l;n++) fprintf(op,"%4d",rel[n]); fprintf(op,"\n");
}
if (norm) continue;
if (mult==0)
{ for (i=intexp;i>=1;i--) fprintf(op,"%3d",d1[i]); fprintf(op,"\n");
for (i=intexp;i>=1;i--) fprintf(op,"%3d",d2[i]); fprintf(op,"\n");
}
for (i=intexp;i>=2;i--)
{ p1=pptr[stconj+2*i-1]; ip1=p1+npt1;
for (j=intexp;j>i;j--)
{ p2=pptr[stconj+2*j-1]; ip2=p2+npt1;
for (n=1;n<=npt;n++) {pt=p2[p1[ip2[ip1[n]]]]; tp[n]=pt; itp[pt]=n; }
expint(intexp+1-i,intexp+1-j,0);
}
}
if (mult==0) for (i=intexp;i>=2;i--)
{ p1=pptr[stconj+2*i-1]; ip1=p1+npt1;
for (n=1;n<=npt;n++)
{ pt=n; for (m=1;m<=prime;m++) pt=p1[pt]; tp[n]=pt; itp[pt]=n; }
expint(intexp+1-i,intexp+1-i,0);
}
}
fprintf(op,"%d\n",-1);
if (subgp)
{ fclose(opy); fclose(op); fclose(ip);
ip=fopen(outft,"r"); op=fopen(inf2,"w");
while ((i=getc(ip))!= -1) putc(i,op); fclose(ip); unlink(outft);
}
return(0);
}
void
bbsstart(void)
{
unsigned char stdinbuf[STDINBUFSIZ];
long uglastmsg; /* last msg seen in prev. rm */
long ugtemp = TWILIGHTZONE;
short prev_rm = TWILIGHTZONE;
char cit_cmd;
char bueller = 0;
room = &sroom;
setvbuf(stdin, (char *)stdinbuf, _IOFBF, STDINBUFSIZ);
setvbuf(stdout, (char *)stdoutbuf, _IOFBF, STDOUTBUFSIZ);
init_system();
/* Putty.exe is obstinate */
/* IAC WILL SGA */
putchar(IAC); putchar(WILL); putchar(TELOPT_SGA);
/* magic to set telnet into character mode */
/* IAC DO LINEMODE, IAC WILL ECHO */
write(1,"\377\375\042\377\373\001",6);
/* let window sizes come through */
/* IAC DO NAWS */
write(1,"\377\375\037",3);
reserve_slot();
do_login();
colorize("\n@G");
curr = LOBBY_RM_NBR;
inituser();
openroom();
storeug(&uglastmsg, &ugtemp);
/* The first thing we do is make the user read the lobby */
cit_cmd = 'N';
readroom(cit_cmd);
for(;;)
{
/*
* check if user has been kicked out of this room while they were in it,
* or if room was deleted
*/
if (ouruser->generation[curr] < 0 || !msg->room[curr].flags)
{
curr = LOBBY_RM_NBR;
openroom();
storeug(&uglastmsg, &ugtemp);
}
if (cit_cmd)
colorize("\n@Y%s>@G ", msg->room[curr].name);
checkx(0);
if (ouruser->f_prog)
cit_cmd = get_single_quiet("ABCD\005eEFGHIJKLNOpPqQRsSTUvVwWxX\027\030yYZ /?#%@-\"");
else if (ouruser->f_aide)
cit_cmd = get_single_quiet("ABC\005eEFGHIJKLNOpPqQRsSTUvVwWxX\027\030yYZ /?#%@-\"");
else if (ouruser->usernum == msg->room[curr].roomaide && !ouruser->f_twit)
cit_cmd = get_single_quiet("ABC\005eEFGHIJKLNOpPqQRsSTUwWxX\027\030yYZ /?#%-\"");
else
cit_cmd = get_single_quiet("BCeEFGHIJKLNOpPqQRsSTUwWxX\027\030yYZ /?#%-\"");
if (cit_cmd == SP)
cit_cmd = 'N';
if (guest && !strchr("BFGHIJKLNOpPRsSTUwWyY/?#-", cit_cmd))
{
colorize("\n\n@RThe Guest user cannot do that.@G\n");
continue;
}
if (curr == LOBBY_RM_NBR && strchr("DGNqsTU\027X\030Z% ", cit_cmd))
{
if (bueller++ >= 12)
flush_input(bueller / 25);
if (bueller >= 100)
{
colorize("@R\n\n\nGo away until you have something useful to do!\n\n\n@G");
my_exit(10);
}
}
else
bueller = 0;
if (strchr("AC\005eEHJpPQSvVx\030yYZ#-\"", cit_cmd))
mybtmp->nox = 1;
switch (cit_cmd)
{
case 'A':
printf("Sysop commands (%s)\n", msg->room[curr].name);
aide_menu();
break;
case 'R':
case 'B':
cit_cmd = 'R';
printf("Read Reverse\n");
readroom(cit_cmd);
break;
case 'C':
printf("Change config\n");
change_setup(NULL);
break;
case 'D':
printf("Debug\n");
debug();
break;
case '\005':
if (ouruser->usernum == msg->room[curr].roomaide)
{
printf("Enter Forum Moderator message\n\nAre you sure you want to enter a message as Forum Moderator? (Y/N) -> ");
if (!yesno(-1))
break;
sysopflags |= SYSOP_FROM_FM;
}
else if (ouruser->f_admin)
{
printf("Enter Sysop message\n\nNOTE: You are entering this message as Sysop!\n\n");
sysopflags |= SYSOP_FROM_SYSOP;
}
/* FALL THRU */
case 'e':
case 'E':
{
char work[20];
if (ouruser->f_newbie && (curr == MAIL_RM_NBR || curr > 4))
help("newuseraccess", NO);
else
{
if (cit_cmd == 'E')
printf("Upload message\n\n");
else if (cit_cmd == 'e')
printf("Enter message\n\n");
*work = 0;
(void)entermessage(curr, work, cit_cmd == 'e' ? 0 : 2);
sysopflags &= ~(SYSOP_FROM_SYSOP | SYSOP_FROM_FM);
}
}
break;
case 'F':
printf("Read Forward\n");
readroom(cit_cmd);
break;
case 'G':
printf("Goto ");
updatels(&prev_rm);
/* find next room with unread msgs and open it */
nextroom();
openroom();
storeug(&uglastmsg, &ugtemp);
break;
case 'H':
printf("Help!\n");
help("topics", YES);
break;
case 'q':
case 'Q':
get_syself_help(cit_cmd);
break;
case 'I':
printf("Forum Info\n");
readdesc();
break;
case 'J':
{
int old_rm;
printf("Jump to ");
old_rm = curr;
if (findroom() == YES)
{
int save_rm;
mybtmp->nox = 0;
save_rm = curr;
curr = old_rm;
updatels(&prev_rm);
curr = save_rm;
openroom();
storeug(&uglastmsg, &ugtemp);
}
}
break;
case 'K':
printf("Known forums and zapped list\n");
knrooms();
break;
case 'L':
dologout();
break;
case 'N':
if (ouruser->lastseen[curr] < room->num[MSGSPERRM - 1])
{
printf("Read New\n");
readroom(cit_cmd);
}
else
{ /* No new notes so just do a Goto now */
printf("Goto ");
updatels(&prev_rm);
/* find next room with unread msgs and open it */
nextroom();
openroom();
storeug(&uglastmsg, &ugtemp);
}
break;
case 'O':
printf("Read Old messages reverse\n");
readroom(cit_cmd);
break;
case 'p':
case 'P':
profile_user(cit_cmd == 'P');
break;
case 's': /* don't update lastseen, you're skipping the room */
printf("Skip %s\n", msg->room[curr].name);
skipping[curr >> 3] |= 1 << (curr & 7);
/* after skipping a room, find the next unread room (not a goto) */
nextroom();
openroom();
ugtemp = ouruser->lastseen[curr];
break;
case 'S':
{
int old_rm;
printf("Skip %s to ", msg->room[curr].name);
old_rm = curr;
if (findroom() == YES)
{
mybtmp->nox = 0;
skipping[old_rm >> 3] |= 1 << (old_rm & 7);
openroom();
ugtemp = ouruser->lastseen[curr];
}
}
break;
case 'T':
printdate("Time\n\n%s");
break;
case 'U':
printf("Ungoto\n");
ungoto(prev_rm, &uglastmsg, &ugtemp);
break;
case 'v':
cit_cmd = 0;
break;
case 'V':
printf("Validate new users\n");
validate_users(1);
break;
case '\027':
if (client)
clientwho();
else
cit_cmd = 0;
break;
case 'w': /* Short form of who's online */
show_online(3);
break;
case 'W': /* Who's online */
show_online(0);
break;
case 'x':
express();
break;
case 'X':
change_express(1);
break;
case CTRL_X:
old_express();
break;
case 'y':
case 'Y':
if (!wanttoyell(cit_cmd))
break;
(void)entermessage(-1, "", cit_cmd == 'y' ? 0 : 2);
break;
case 'Z':
printf("Zap forum\n");
if (forgetroom())
{
nextroom();
openroom();
ugtemp = ouruser->lastseen[curr];
}
break;
case '?':
case '/':
if (guest)
help("guestforumlevel", NO);
else
help("doccmd", NO);
break;
case '#':
readroom(cit_cmd);
break;
case '%':
if (ouruser->f_elf && !ouruser->f_restricted && !ouruser->f_twit)
if (mybtmp->xstat && !mybtmp->elf)
printf("\n\nYou can't enable yourself as a guide while your X's are disabled.\n");
else if ((mybtmp->elf = !mybtmp->elf))
printf("\n\nYou are now marked as being available to help others.\n");
else
printf("\n\nYou are no longer marked as being available to help others.\n");
else
cit_cmd = 0;
break;
case '-':
readroom(cit_cmd);
break;
case '@':
printf("Sysops, programmers, and forum moderators\n");
more(AIDELIST, 0);
break;
case '"':
{
char work[20];
printf("Quote X messages to Sysop\n");
*work = 0;
(void)entermessage(-1, work, -1);
}
break;
default:
break;
} /* switch */
}
