while(i--) if(tempcp[i] == '\0') tempcp[i]='\x1a';
if(!ick_cesspoolout) ick_cesspoolout=stdout;
fprintf(ick_cesspoolout,"%s\n",tempcp);
- fflush(ick_cesspoolout);
+ (void) fflush(ick_cesspoolout);
free(tempcp);
free(buf);
}
just with extra arrows in. The annotations here show that nulls are allowed
when called recursively, but not otherwise. */
/*@-incondefs@*/
-/*@null@*/ node *nodecopy(/*@null@*/ node* n)
+/*@null@*/ node *nodecopy(/*@null@*/ const node* n)
/*@=incondefs@*/
{
node* np;
/* This function by AIS. Compares expressions. In C++, I'd call this
node::operator== . */
-ick_bool nodessame(const node* n1, const node* n2)
+ick_bool nodessame(/*@observer@*/ const node* n1, /*@observer@*/ const node* n2)
{
if(!n1) return !n2;
if(!n2) return 0;
extern void optimizef(void); /* AIS */
extern void nodefree(/*@keep@*/ /*@null@*/ node* np); /* AIS */
extern unsigned long varextern(unsigned long intern, int vartype); /* AIS */
-extern node *nodecopy(node*); /* AIS */
-extern ick_bool nodessame(const node*, const node*); /* AIS */
+extern node *nodecopy(const node*); /* AIS */
+extern ick_bool nodessame(/*@observer@*/ const node*, /*@observer@*/ const node*); /* AIS */
extern node *optdebugnode; /* AIS */
extern const char **enablers; /* AIS: so that there can be an element before the