自学教程：C++ tfree函数代码示例

static NODE *builtin_isany(NODE *a, TWORD rt, int cmpt){	NODE *p, *q;	TWORD t;	if ((t = mtcheck(a)) == 0)		return bcon(0);	p = buildtree(OROR, mtisnan(a->n_left), mtisnan(a->n_right));	p = buildtree(NOT, p, NIL);	q = buildtree(cmpt, cast(ccopy(a->n_left), t, 0),	    cast(ccopy(a->n_right), t, 0));	p = buildtree(ANDAND, p, q);	tfree(a);	return p;}

void mk_alternating(tl_Node *p) /* generates an alternating automaton for p */{    if (tl_stats)    {        getrusage(RUSAGE_SELF, &tr_debut);    }    node_size = calculate_node_size(p) + 1; /* number of states in the automaton */    label = (tl_Node **) tl_emalloc(node_size * sizeof(tl_Node *));    transition = (ATrans **) tl_emalloc(node_size * sizeof(ATrans *));    node_size = node_size / (8 * sizeof(int)) + 1;    sym_size = calculate_sym_size(p); /* number of predicates */    if (sym_size)    {        sym_table = (char **) tl_emalloc(sym_size * sizeof(char *));    }    sym_size = sym_size / (8 * sizeof(int)) + 1;    final_set = make_set(-1, 0);    transition[0] = boolean(p); /* generates the alternating automaton */    if (tl_verbose)    {        fprintf(tl_out, "/nAlternating automaton before simplification/n");        print_alternating();    }    if (tl_simp_diff)    {        simplify_astates(); /* keeps only accessible states */        if (tl_verbose)        {            fprintf(tl_out, "/nAlternating automaton after simplification/n");            print_alternating();        }    }    if (tl_stats)    {        getrusage(RUSAGE_SELF, &tr_fin);        fprintf(tl_out, "/n%i states, %i transitions/n", astate_count, atrans_count);    }    releasenode(1, p);    tfree(label);}

voiddb_print_pnode_tree(struct pnode *p, char *print){#if 1    NG_IGNORE(print);    db_print_pnode(stdout, p);#else    char *buf;    size_t  buf_size;    FILE *db_stream = open_memstream(&buf, &buf_size);    db_print_pnode(db_stream, p);    fclose(db_stream);    if (print)        printf("%s:%d: %s {%s}/n%s/n", __FILE__, __LINE__, __func__, print, buf);    tfree(buf);#endif}

/* * Find number of beginning 0's in a word of type t. * t should be deunsigned. */static NODE *builtin_ff(NODE *f, NODE *a, TWORD t){	NODE *t101, *t102;	NODE *rn, *p;	int l15, l16, l17;	int sz;	tfree(f);	t = ctype(t);	sz = (int)tsize(t, 0, 0)+1;	t101 = tempnode(0, INT, 0, 0);	t102 = tempnode(0, t, 0, 0);	l15 = getlab();	l16 = getlab();	l17 = getlab();	rn = buildtree(ASSIGN, ccopy(t101), bcon(0));	rn = cmop(rn, buildtree(ASSIGN, ccopy(t102), a));	p = buildtree(CBRANCH, buildtree(EQ, ccopy(t102), bcon(0)), bcon(l15));	rn = cmop(rn, p);	rn = cmop(rn, buildtree(INCR, ccopy(t101), bcon(1)));	rn = cmop(rn, lblnod(l16));	p = buildtree(CBRANCH, buildtree(GE, ccopy(t101), bcon(sz)), bcon(l15));	rn = cmop(rn, p);	p = buildtree(CBRANCH,	    buildtree(EQ, buildtree(AND, ccopy(t102), bcon(1)),	    bcon(0)), bcon(l17));	rn = cmop(rn, p);	rn = cmop(rn, block(GOTO, bcon(l15), NIL, INT, 0, 0));	rn = cmop(rn, lblnod(l17));	rn = cmop(rn, buildtree(RSEQ, t102, bcon(1)));	rn = cmop(rn, buildtree(INCR, ccopy(t101), bcon(1)));	rn = cmop(rn, block(GOTO, bcon(l16), NIL, INT, 0, 0));	rn = cmop(rn, lblnod(l15));	return cmop(rn, t101);}

GState *remove_gstate(GState *s, GState *s1) /* removes a state */{  GState *prv = s->prv;  s->prv->nxt = s->nxt;  s->nxt->prv = s->prv;  free_gtrans(s->trans->nxt, s->trans, 0);  s->trans = (GTrans *)0;  tfree(s->nodes_set);  s->nodes_set = 0;  s->nxt = gremoved->nxt;  gremoved->nxt = s;  s->prv = s1;  for(s1 = gremoved->nxt; s1 != gremoved; s1 = s1->nxt)    if(s1->prv == s)      s1->prv = s->prv;  return prv;} 

/* * define function. Returns 1 if function is being undefined (t == 0) and * function did not exist, returns 0 otherwise. */intdefine(const char *name, struct op *t){	uint32_t nhash;	struct tbl *tp;	bool was_set = false;	nhash = hash(name);	while (/* CONSTCOND */ 1) {		tp = findfunc(name, nhash, true);		if (tp->flag & ISSET)			was_set = true;		/*		 * If this function is currently being executed, we zap		 * this table entry so findfunc() won't see it		 */		if (tp->flag & FINUSE) {			tp->name[0] = '/0';			/* ensure it won't be found */			tp->flag &= ~DEFINED;			tp->flag |= FDELETE;		} else			break;	}	if (tp->flag & ALLOC) {		tp->flag &= ~(ISSET|ALLOC);		tfree(tp->val.t, tp->areap);	}	if (t == NULL) {		/* undefine */		ktdelete(tp);		return (was_set ? 0 : 1);	}	tp->val.t = tcopy(t->left, tp->areap);	tp->flag |= (ISSET|ALLOC);	if (t->u.ksh_func)		tp->flag |= FKSH;	return (0);}

/* * Create a reference for a TLS variable. * This is the "General dynamic" version. */static NODE *tlspic(NODE *p){	NODE *q, *r, *s;	char *s1, *s2;	/*	 * .byte   0x66	 * leaq [email
C++ tg函数代码示例
C++ tfp_sprintf函数代码示例