Removing ARGCHK1

Author: codereport

jsrc/adverbs/a.c

@@ -17,7 +17,6 @@ static DF2(swap2){DECLF; F2PREFIP; jtinplace = (J)(intptr_t)((I)jtinplace^((JTIN
 
 // w~, which is either reflexive/passive or evoke
 F1(jtswap){A y;C*s;I n;
- ARGCHK1(w); 
  if(VERB&AT(w)){
   // reflexive/passive.  Create verb that swaps.  Most flags do not apply to the derived verb
   I flag = FAV(w)->flag&(VIRS2|VJTFLGOK2); flag = (FAV(w)->flag&VASGSAFE)+flag+(flag>>1);  // set ASGSAFE, both inplace/irs bits from dyad; ISATOMIC immaterial, since always dyad
@@ -58,7 +57,6 @@ static DF1(jtbasis1){DECLF;A z;D*x;I j;V*v;
 }}
 
 F1(jtbdot){A b,h=0;I j=0,n,*v;
- ARGCHK1(w);
  if(VERB&AT(w))return ADERIV(CBDOT, jtbasis1,0L, 0L,0,0,0);
  RZ(w=vi(w));
  n=AN(w); v=AV(w);
@@ -137,7 +135,6 @@ static I jtint0(J jt,A w){A x;
 }
 
 static DF1(jtmemo1){DECLF;A z;I x,y;
- ARGCHK1(w);
  x=IMIN; y=int0(w);
  if(y==IMIN)return CALL1(f1,w,fs);
  return (z=memoget(x,y,self))?z:memoput(x,y,self,CALL1(f1,w,fs));
@@ -156,7 +153,6 @@ static DF2(jtmemo2){DECLF;A z;I x,y;
 // 2 boxed list containing results
 // All these start life on the tpush stack
 F1(jtmemo){PROLOG(300);A h,*hv,q;I m;V*v;
- ARGCHK1(w);
  ASSERT(VERB&AT(w),EVDOMAIN);
  v=FAV(w); FULLHASHSIZE(30,BOXSIZE,1,0,m);  // m = # items to allocate
  GAT0(h,BOX,3,1); hv=AAV(h);

jsrc/adverbs/af.c

@@ -7,14 +7,12 @@
 
 
 F1(jtunname){A x;V*v;
- ARGCHK1(w); 
  v=VAV(w);
  if(CTILDE==v->id&&!jt->uflags.us.cx.cx_c.glock&&!(VLOCK&v->flag)){x=v->fgh[0]; if(NAME&AT(x))return symbrd(x);}
  RETF(w);
 }
 
 static B jtselfq(J jt,A w){A hs,*u;V*v;
- ARGCHK1(w);
  if(AT(w)&NOUN+NAME)return 0;
  v=FAV(w);
  switch(v->id){
@@ -32,7 +30,6 @@ static B jtselfq(J jt,A w){A hs,*u;V*v;
 
 // See if there are references to implicit locatives.  Return 1 if so, 0 if not
 B jthasimploc(J jt,A w){A hs,*u;V*v;
- ARGCHK1(w);
  if(AT(w)&NOUN+NAME)return 0;
  v=FAV(w);
  switch(v->id){
@@ -73,7 +70,6 @@ EVERYFS(arofixaself,jtaro,jtfixa,0,VFLAGNONE)  // create A block to be used in e
 // AM(a) points to the recursion name-list and must be passed to all recursion levels
 static A jtfixa(J jt,A a,A w){A f,g,h,wf,x,y,z=w;V*v;fauxblock(fauxself); A aa; fauxINT(aa,fauxself,1,0); AM((A)aa)=AM(a);  // place to build recursion parm - make the AK field right, and pass the AM field along
 #define REFIXA(a,x) (IAV0(aa)[0]=(aif|(a)), fixa((A)aa,(x)))
- ARGCHK1(w);
  I ai=IAV(a)[0];  // value of a
  I aif=ai&(FIXALOCSONLY|FIXALOCSONLYLOWEST|FIXASTOPATINV); // extract control flags
  ai^=aif;   // now ai = state without flags
@@ -176,7 +172,6 @@ static A jtfixa(J jt,A a,A w){A f,g,h,wf,x,y,z=w;V*v;fauxblock(fauxself); A aa;
 
 // On internal calls, self is an integer whose value contains flags.  Otherwise zeroionei is used
 DF1(jtfix){PROLOG(0005);A z;
- ARGCHK1(w);
  if(LIT&AT(w)){ASSERT(1>=AR(w),EVRANK); RZ(w=nfs(AN(w),CAV(w)));}
  // only verbs/noun can get in through the parser, but internally we also vet adv/conj
  ASSERT(AT(w)&NAME+VERB+ADV+CONJ,EVDOMAIN);

jsrc/adverbs/ai.c

@@ -26,7 +26,6 @@ static F2(jtfong){A f;C c;V*v;
 }   // [: f g  with simplifications: [: ] w -> w;  [: (N/[: x y) w -> N/[: x [: y w   and y omittrd if ]
 
 static F1(jtinvfork){A f,fi,g,gi,h,k;B b,c;V*v;
- ARGCHK1(w);
  v=FAV(w); RZ(f=unname(v->fgh[0])); g=v->fgh[1]; RZ(h=unname(v->fgh[2]));
  if(CCAP==ID(f))return fong(invrecur(h),invrecur(g));
  c=1&&NOUN&AT(f); b=c||consf(f);
@@ -65,7 +64,6 @@ static F2(jtdiag){I d,m,p,r,t,*v;
 }}
 
 static F1(jtbminv){A*wv,x,z=w;I i,j,m,r,*s,t=0,*u,**v,*y,wn,wr,*ws;
- ARGCHK1(w);
  ASSERT(0,EVNONCE);
  ASSERT(BOX&AT(w),EVDOMAIN);
  wn=AN(w); wr=AR(w); ws=AS(w); wv=AAV(w); 
@@ -97,7 +95,6 @@ static F1(jtbminv){A*wv,x,z=w;I i,j,m,r,*s,t=0,*u,**v,*y,wn,wr,*ws;
 
 
 static F1(jtinvamp){A f,ff,g,h,x,y;B nf,ng;C c,d,*yv;I n;V*u,*v;
- ARGCHK1(w);
  v=FAV(w);
  f=v->fgh[0]; nf=!!(NOUN&AT(f));
  g=v->fgh[1]; ng=!!(NOUN&AT(g));
@@ -236,7 +233,7 @@ static const C simpleinv[128] = {
 // Return inverse of monad w.  recur is a recursion indicator, always forced to 0 for the initial call, and
 // set to 1 here for recursive calls
 A jtinv(J jt, A w, I recur){A f,ff,g;B b,nf,ng,vf,vg;C id;I p,q;V*v;
- ARGCHK1(w); STACKCHKOFL  // make sure we don't have a recursion loop through inv
+ STACKCHKOFL  // make sure we don't have a recursion loop through inv
  ASSERT(VERB&AT(w),EVDOMAIN); 
  id=ID(w); v=FAV(w);  // id=pseudochar for w, v->verb info
 #define simpleinvvalues(w) CCM(w,CDIV)+CCM(w,CPLUS)+CCM(w,CMINUS)+CCM(w,CLEFT)+CCM(w,CRIGHT)+CCM(w,CREV)+CCM(w,CCANT)+CCM(w,CPOLY)+ \
@@ -322,7 +319,6 @@ A jtinv(J jt, A w, I recur){A f,ff,g;B b,nf,ng,vf,vg;C id;I p,q;V*v;
 }
 
 static F1(jtneutral){A x,y;B b;V*v;
- ARGCHK1(w);
  v=FAV(w);
  ASSERT(!v->lrr,EVDOMAIN);
  RZ(y=v2(0L,1L));

jsrc/adverbs/am.c

@@ -57,7 +57,6 @@ static A jtmerge1(J jt,A w,A ind){A z;B*b;C*wc,*zc;D*wd,*zd;I c,it,j,k,m,r,*s,t,
 
 // Handle the case statement abc =: pqr} x,...,y,:z, with in-place operation if pqr is Boolean and abc appears on the right
 F1(jtcasev){A b,*u,*v,w1,x,y,z;B*bv,p,q;I*aa,c,*iv,j,m,n,r,*s,t;
- ARGCHK1(w);
  RZ(w1=ca(w)); u=AAV(w1);   // make a copy of the input, point to its value
  // the input is a boxed list.  The last 3 values are (name pqr);(index in which abc appeared in the x,y,... or -1 if it didn't);(original sentence queue)
  p=1; m=AN(w)-3; v=AAV(w); c=i0(v[m+1]);   // get # items in list, and index of the matching one
@@ -190,7 +189,6 @@ static A jtmerge2(J jt,A a,A w,A ind,I cellframelen){F2PREFIP;A z;I t;
 // speed to validate the input, and pdt works well for a large number of short vectors - in particular it avoids the carried dependency between axes that
 // Horner's Rule creates.  This version keeps things in registers and has less setup time; and it is much better if there are negative indexes.
 A jtcelloffset(J jt,AD * RESTRICT w,AD * RESTRICT ind){A z;
- ARGCHK1(w);
  if(AR(ind)<2){RZ(z=pind(AS(w)[0],ind));  // (m}only) treat a list as a list of independent indexes.  pind handles that case quickly and possibly in-place.
  }else if(AS(ind)[AR(ind)-1]==1){RZ(z=pind(AS(w)[0],IRS1(ind,0L,2L,jtravel,z)));  // if rows are 1 long, pind handles that too - remove the last axis
  }else{
@@ -389,7 +387,6 @@ B jtgerexact(J jt, A w){A*wv;
 
 // u} handling.  This is not inplaceable but the derived verb is
 F1(jtamend){
- ARGCHK1(w);
  if(VERB&AT(w)) return ADERIV(CRBRACE,mergv1,amccv2,VASGSAFE|VJTFLGOK2, RMAX,RMAX,RMAX);  // verb}
  else if(ger(w))return gadv(w,CRBRACE);   // v0`v1`v2}
  else           return ADERIV(CRBRACE,mergn1,jtamendn2,VASGSAFE|VJTFLGOK2, RMAX,RMAX,RMAX);  // m}

jsrc/adverbs/ao.c

@@ -7,7 +7,7 @@
 
 // This is the derived verb for f/. y
 static DF1(jtoblique){A x,y,z;I m,n,r;D rkblk[16];
- F1PREFIP;ARGCHK1(w);
+ F1PREFIP;
  r=AR(w);  // r = rank of w
  // create y= ,/ w - the _2-cells of w arranged in a list (virtual block)
  RZ(y=redcat(w,self)); if(1>=r){m=AN(w); n=1;}else{m=AS(w)[0]; n=AS(w)[1];}
@@ -36,7 +36,6 @@ static DF1(jtoblique){A x,y,z;I m,n,r;D rkblk[16];
 
 // Derived verb for f//. y for atomic f
 static DF1(jtobqfslash){A y,z;B b=0,p;C er,id,*wv;I c,d,k,m,m1,mn,n,n1,r,*s,wt;
- ARGCHK1(w);
  r=AR(w); s=AS(w); wt=AT(w); wv=CAV(w);
  if((-AN(w)&(1-r)&-(DENSE&wt))>=0)return oblique(w,self);  // revert to default if rank<2, empty, or sparse.  This implies m/n below are non0
  y=FAV(self)->fgh[0]; y=FAV(y)->fgh[0]; id=FAV(y)->id;
@@ -637,7 +636,6 @@ const UI4 shortrange[3][4] = {{0,65536,65536,0}, {0,2,258,0}, {0,256,65536,0}};
 static DF2(jtkeytally);
 
 static F1(jtkeytallysp){PROLOG(0015);A b,e,q,x,y,z;I c,d,j,k,*u,*v;P*p;
- ARGCHK1(w);
  RZ(q=indexof(w,w));
  p=PAV(q); 
  x=SPA(p,x); u=AV(x); c=AN(x);
@@ -778,7 +776,6 @@ DF2(jtkeyheadtally){F2PREFIP;PROLOG(0017);A f,q,x,y,z;I b;I at,*av,k,n,r,*qv,*u,
 F1(jtsldot){A h=0;AF f1=jtoblique,f2;C c,d,e;I flag=VJTFLGOK1|VJTFLGOK2;V*v;
 // NOTE: u/. is processed using the code for u;.1 and passing the self for /. into the cut verb.  So, the self produced
 // by /. and ;.1 must be the same as far as flags etc.
- ARGCHK1(w);
  if(NOUN&AT(w)){flag|=VGERL; RZ(h=fxeachv(1L,w));}
  v=VAV(w);
  switch(ID(w)){  // no default for f2: every path must set it

jsrc/adverbs/ap.c

@@ -305,13 +305,11 @@ PREFIXPFX(bw1111pfxI, UI,UI, BW1111, bw1111II,return EVOK;)
 // This old prefix support is needed for sparse matrices
 
 static DF1(jtprefix){DECLF;I r;
- ARGCHK1(w);
  r = (RANKT)jt->ranks; RESETRANK; if(r<AR(w)){return rank1ex(w,self,r,jtprefix);}
  return eachl(apv(SETIC(w,r),1L,1L),w,atop(fs,ds(CTAKE)));
 }    /* f\"r w for general f */
 
 static DF1(jtgprefix){A h,*hv,z,*zv;I m,n,r;
- ARGCHK1(w);
  ASSERT(DENSE&AT(w),EVNONCE);
  r = (RANKT)jt->ranks; RESETRANK; if(r<AR(w)){return rank1ex(w,self,r,jtgprefix);}
  SETIC(w,n); 
@@ -340,7 +338,6 @@ static F2(jtseg){A z;I c,k,m,n,*u,zn;
 // m is the infix length (x), w is the array (y)
 // Result is A for an nx2 table of (starting item#,length) for each infix
 static A jtifxi(J jt,I m,A w){A z;I d,j,k,n,p,*x;
- ARGCHK1(w);
  // p=|m, n=#items of w, d=#applications of u (depending on overlapping/nonoverlapping)
  p=ABS(m); SETIC(w,n);
  if(m>=0){d=MAX(0,1+n-m);}else{d=1+(n-1)/p; d=(n==0)?n:d;}
@@ -408,7 +405,6 @@ static DF2(jtginfix){A h,*hv,x,z,*zv;I d,m,n;
 static DF2(jtinfixprefix2){F2PREFIP;PROLOG(00202);A fs;I cger[128/SZI];
    I wt;
 
- ARGCHK1(w);
  PREF2IP(jtinfixprefix2);  // handle rank loop if needed
  wt=AT(w);
  if(unlikely((wt&SPARSE)!=0)){
@@ -592,7 +588,7 @@ static DF1(jtinfixprefix1){F1PREFIP;
 
 //  f/\"r y    w is y, fs is in self
 static DF1(jtpscan){A z;I f,n,r,t,wn,wr,*ws,wt;
- F1PREFIP;ARGCHK1(w);
+ F1PREFIP;
  wt=AT(w);   // get type of w
  if(unlikely((SPARSE&wt)!=0))return scansp(w,self,jtpscan);  // if sparse, go do it separately
  // wn = #atoms in w, wr=rank of w, r=effective rank, f=length of frame, ws->shape of w
@@ -841,7 +837,6 @@ static DF1(jtiota1){I j; return apv(SETIC(w,j),1L,1L);}
 
 F1(jtbslash){A f;AF f1=jtinfixprefix1,f2=jtinfixprefix2;V*v;I flag=FAV(ds(CBSLASH))->flag;
 ;
- ARGCHK1(w);
  if(NOUN&AT(w))return fdef(0,CBSLASH,VERB, jtinfixprefix1,jtinfixprefix2, w,0L,fxeachv(1L,w), VGERL|flag, RMAX,0L,RMAX);
  v=FAV(w);  // v is the u in u\ y
  switch(v->id){
@@ -864,4 +859,4 @@ F1(jtbslash){A f;AF f1=jtinfixprefix1,f2=jtinfixprefix2;V*v;I flag=FAV(ds(CBSLAS
  return f;
 }
 
-A jtascan(J jt,C c,A w){ARGCHK1(w); A z; return df1(z,w,bslash(slash(ds(c))));}
+A jtascan(J jt,C c,A w){A z; return df1(z,w,bslash(slash(ds(c))));}

jsrc/adverbs/ar.c

@@ -200,7 +200,6 @@ static DF1(jtred0){DECLF;A x,z;I f,r,wr,*s;
 
 // general reduce.  We inplace the results into the next iteration.  This routine cannot inplace its inputs.
 static DF1(jtredg){F1PREFIP;PROLOG(0020);DECLF;AD * RESTRICT a;I i,n,r,wr;
- ARGCHK1(w);
  ASSERT(DENSE&AT(w),EVNONCE);
  // loop over rank
  wr=AR(w); r=(RANKT)jt->ranks; r=wr<r?wr:r; RESETRANK;
@@ -271,7 +270,6 @@ static A jtredsp1a(J jt,C id,A z,A e,I n,I r,I*s){A t;B b,p=0;D d=1;
 }}   /* f/w on sparse vector w, post processing */
 
 static A jtredsp1(J jt,A w,A self,C id,VARPSF ado,I cv,I f,I r,I zt){A e,x,z;I m,n;P*wp;
- ARGCHK1(w);
  wp=PAV(w); e=SPA(wp,e); x=SPA(wp,x); n=AN(x); m=*AS(w);
  GA(z,zt,1,0,0);
  if(n){I rc=((AHDRRFN*)ado)(1L,n,1L,AV(x),AV(z),jt); if(255&rc)jsignal(rc); RE(0); if(m==n)return z;}
@@ -280,7 +278,6 @@ static A jtredsp1(J jt,A w,A self,C id,VARPSF ado,I cv,I f,I r,I zt){A e,x,z;I m
 
 DF1(jtredravel){A f,x,z;I n;P*wp;
  F1PREFIP;
- ARGCHK1(w);
  f=FAV(self)->fgh[0];  // f/
  if(likely(!(SPARSE&AT(w))))return reduce(jtravel(jtinplace,w),f);
  // The rest is sparse
@@ -296,7 +293,6 @@ DF1(jtredravel){A f,x,z;I n;P*wp;
 }  /* f/@, w */
 
 static A jtredspd(J jt,A w,A self,C id,VARPSF ado,I cv,I f,I r,I zt){A a,e,x,z,zx;I c,m,n,*s,t,*v,wr,*ws,xf,xr;P*wp,*zp;
- ARGCHK1(w);
  ASSERT(strchr(fca,id),EVNONCE);
  wp=PAV(w); a=SPA(wp,a); e=SPA(wp,e); x=SPA(wp,x); s=AS(x);
  xr=r; v=AV(a); DO(AN(a), if(f<v[i])--xr;); xf=AR(x)-xr;
@@ -367,7 +363,6 @@ static B jtredspse(J jt,C id,I wm,I xt,A e,A zx,A sn,A*ze,A*zzx){A b;B nz;I t,zt
 
 static A jtredsps(J jt,A w,A self,C id,VARPSF ado,I cv,I f,I r,I zt){A a,a1,e,sn,x,x1=0,y,z,zx,zy;B*pv;
      C*xv,*xxv,*zv;I*dv,i,m,n,*qv,*sv,*v,wr,xk,xt,wm,*ws,xc,yc,yr,*yu,*yv,zk;P*wp,*zp;
- ARGCHK1(w);
  ASSERT(strchr(fca,id),EVNONCE);
  wr=AR(w); ws=AS(w); wm=ws[f];
  wp=PAV(w); a=SPA(wp,a); e=SPA(wp,e); 
@@ -398,7 +393,7 @@ static A jtredsps(J jt,A w,A self,C id,VARPSF ado,I cv,I f,I r,I zt){A a,a1,e,sn
 }    /* f/"r w for sparse w, rank > 1, sparse axis */
 
 static DF1(jtreducesp){A a,g,z;B b;I f,n,r,*v,wn,wr,*ws,wt,zt;P*wp;
- ARGCHK1(w);J jtinplace=jt;
+ J jtinplace=jt;
  wr=AR(w); r=(RANKT)jt->ranks; r=wr<r?wr:r; f=wr-r;  // no RESETRANK
  wn=AN(w); ws=AS(w); n=r?ws[f]:1;
  wt=AT(w); wt=wn?DTYPE(wt):B01;
@@ -495,7 +490,7 @@ static B jtreduce2(J jt,A w,C id,I f,I r,A*zz){A z=0;B b=0,btab[258],*zv;I c,d,m
 }    /* f/"r for dense w over an axis of length 2 */
 
 static DF1(jtreduce){A z;I d,f,m,n,r,t,wr,*ws,zt;
- F1PREFIP;ARGCHK1(w);
+ F1PREFIP;
  if(unlikely((SPARSE&AT(w))!=0))return reducesp(w,self);  // If sparse, go handle it
  wr=AR(w); ws=AS(w);
  // Create  r: the effective rank; f: length of frame; n: # items in a CELL of w
@@ -577,7 +572,7 @@ static A jtredcatsp(J jt,A w,A z,I r){A a,q,x,y;B*b;I c,d,e,f,j,k,m,n,n1,p,*u,*v
 // ,&.:(<"r)  run together all axes above the last r.  r must not exceed AR(w)-1
 // w must not be sparse or empty
 A jtredcatcell(J jt,A w,I r){A z;
- F1PREFIP;ARGCHK1(w);
+ F1PREFIP;
  I wr=AR(w);  // get original rank, which may change if we inplace into the same block
  if(r>=wr-1)return RETARG(w);  // if only 1 axis left to run together, return the input
  if((ASGNINPLACESGN(SGNIF((I)jtinplace,JTINPLACEWX)&(-r),w) && !(AFLAG(w)&AFUNINCORPABLE))){  // inplace allowed, usecount is right
@@ -595,7 +590,7 @@ A jtredcatcell(J jt,A w,I r){A z;
 
 
 DF1(jtredcat){A z;B b;I f,r,*s,*v,wr;
- F1PREFIP;ARGCHK1(w);
+ F1PREFIP;
  wr=AR(w); r=(RANKT)jt->ranks; r=wr<r?wr:r; f=wr-r; s=AS(w); RESETRANK;
  b=1==r&&1==s[f];  // special case: ,/ on last axis which has length 1: in that case, the rules say the axis disappears (because of the way ,/ works on length-1 lists)
  if(2>r&&!b)RCA(w);  // in all OTHER cases, result=input for ranks<2
@@ -612,15 +607,13 @@ DF1(jtredcat){A z;B b;I f,r,*s,*v,wr;
 }    /* ,/"r w */
 
 static DF1(jtredsemi){I f,n,r,*s,wr;
- ARGCHK1(w);
  wr=AR(w); r=(RANKT)jt->ranks; r=wr<r?wr:r; f=wr-r; s=AS(w); SETICFR(w,f,r,n);   // let the rank run into tail   n=#items  in a cell of w
  if(2>n){ASSERT(n!=0,EVDOMAIN); return tail(w);}  // rank still set
  if(BOX&AT(w))return jtredg(jt,w,self);  // the old way failed because it did not mimic scalar replication; revert to the long way.  ranks are still set
  else{A z; return IRS1(w,0L,r-1,jtbox,z);}  // unboxed, just box the cells
 }    /* ;/"r w */
 
 static DF1(jtredstitch){A c,y;I f,n,r,*s,*v,wr;
- ARGCHK1(w);
  wr=AR(w); r=(RANKT)jt->ranks; r=wr<r?wr:r; f=wr-r; RESETRANK;
  s=AS(w); SETICFR(w,f,r,n);
  ASSERT(n!=0,EVDOMAIN);
@@ -640,7 +633,6 @@ static DF1(jtredstitch){A c,y;I f,n,r,*s,*v,wr;
 }}   /* ,./"r w */
 
 static DF1(jtredstiteach){A*wv,y;I n,p,r,t;
- ARGCHK1(w);
  n=AN(w);
  if(!(2<n&&1==AR(w)&&BOX&AT(w)))return reduce(w,self);
  wv=AAV(w);  y=wv[0]; SETIC(y,p); t=AT(y);
@@ -649,7 +641,6 @@ static DF1(jtredstiteach){A*wv,y;I n,p,r,t;
 }    /* ,.&.>/ w */
 
 static DF1(jtredcateach){A*u,*v,*wv,x,*xv,z,*zv;I f,m,mn,n,r,wr,*ws,zm,zn;I n1=0,n2=0;
- ARGCHK1(w);
  wr=AR(w); ws=AS(w); r=(RANKT)jt->ranks; r=wr<r?wr:r; f=wr-r; RESETRANK;
  SETICFR(w,f,r,n);
  if(!r||1>=n)return reshape(repeat(ne(sc(f),IX(wr)),shape(w)),n?w:ds(CACE));
@@ -668,7 +659,6 @@ static DF2(jtoprod){A z; return df2(z,a,w,FAV(self)->fgh[2]);}  // x u/ y - tran
 
 
 F1(jtslash){A h;AF f1;C c;V*v;I flag=0;
- ARGCHK1(w);
  if(NOUN&AT(w))return evger(w,sc(GINSERT));  // treat m/ as m;.6.  This means that a node with CSLASH never contains gerund u
  v=FAV(w); 
  switch(v->id){  // select the monadic case
@@ -690,7 +680,6 @@ A jtaslash1(J jt,C c,    A w){RZ(   w); A z; return df1(z,  w,qq(slash(ds(c)),ze
 A jtatab   (J jt,C c,A a,A w){ARGCHK2(a,w); A z; return df2(z,a,w,   slash(ds(c))     );}
 
 DF1(jtmean){
- ARGCHK1(w);
  I wr=AR(w); I r=(RANKT)jt->ranks; r=wr<r?wr:r;
  I n=AS(w)[wr-r]; n=r?n:1;
  // leave jt->ranks unchanged to pass into +/

jsrc/adverbs/as.c

@@ -169,13 +169,11 @@ SUFFIXPFX(bw1111sfxI, UI,UI, BW1111, bw1111II,return EVOK;)
 
 
 static DF1(jtsuffix){DECLF;I r;
- ARGCHK1(w);
  r=(RANKT)jt->ranks; RESETRANK; if(r<AR(w))return rank1ex(w,self,r,jtsuffix);
  return eachl(IX(SETIC(w,r)),w,atop(fs,ds(CDROP)));
 }    /* f\."r w for general f */
 
 static DF1(jtgsuffix){A h,*hv,z,*zv;I m,n,r;
- ARGCHK1(w);
  r=(RANKT)jt->ranks; RESETRANK; if(r<AR(w))return rank1ex(w,self,r,jtgsuffix);
  SETIC(w,n); 
  h=VAV(self)->fgh[2]; hv=AAV(h); m=AN(h);
@@ -193,7 +191,6 @@ static DF1(jtgsuffix){A h,*hv,z,*zv;I m,n,r;
  }}
 
 static DF1(jtssg){F1PREFIP;PROLOG(0020);A a,z;I i,n,r,wr;
- ARGCHK1(w);
  ASSERT(DENSE&AT(w),EVNONCE);
  // loop over rank - we claim to handle IRS
  wr=AR(w); r=(RANKT)jt->ranks; r=wr<r?wr:r; RESETRANK; if(r<wr)return rank1ex(w,self,r,jtssg);
@@ -299,7 +296,7 @@ A jtscansp(J jt,A w,A self,AF sf){A e,ee,x,z;B*b;I f,m,j,r,t,wr;P*wp,*zp;
 }    /* f/\"r or f/\."r on sparse w */
 
 static DF1(jtsscan){A y,z;I d,f,m,n,r,t,wn,wr,*ws,wt;
- F1PREFIP;ARGCHK1(w);
+ F1PREFIP;
  wt=AT(w);
  if(unlikely((SPARSE&wt)!=0))return scansp(w,self,jtsscan);
  wn=AN(w); wr=AR(w); r=(RANKT)jt->ranks; r=wr<r?wr:r; f=wr-r; ws=AS(w); RESETRANK;
@@ -383,7 +380,6 @@ static DF2(jtofxassoc){A f,i,j,p,s,x,z;C id,*zv;I c,d,k,kc,m,r,t;V*v;VA2 adocv;
 static DF1(jtiota1rev){I j; SETIC(w,j); return apv(j,j,-1L);}
 
 F1(jtbsdot){A f;AF f1=jtsuffix,f2=jtoutfix;I flag=FAV(ds(CBSDOT))->flag;C id;V*v;  // init flag is IRS1
- ARGCHK1(w);
  if(NOUN&AT(w))return fdef(0,CBSLASH,VERB, jtgsuffix,jtgoutfix, w,0L,fxeachv(1L,w), VGERL|VAV(ds(CBSLASH))->flag, RMAX,0L,RMAX);
  v=FAV(w);  // verb info for w
  switch(v->id){