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

static int mit_samba_get_nextkey(struct mit_samba_context *ctx,				 hdb_entry_ex **_hentry){	hdb_entry_ex *hentry;	int ret;	hentry = talloc(ctx, hdb_entry_ex);	if (!hentry) {		return ENOMEM;	}	ret = samba_kdc_nextkey(ctx->context, ctx->db_ctx, hentry);	if (ret) {		talloc_free(hentry);	} else {		talloc_steal(hentry->ctx, hentry);		*_hentry = hentry;	}	return ret;}

static TR_AAA_SERVER *tr_cfg_parse_one_aaa_server (TR_CFG *trc, json_t *jaddr, TR_CFG_RC *rc) {  TR_AAA_SERVER *aaa = NULL;  if ((!trc) || (!jaddr) || (!json_is_string(jaddr))) {    tr_debug("tr_cfg_parse_one_aaa_server: Bad parameters.");    *rc = TR_CFG_BAD_PARAMS;    return NULL;  }  if (NULL == (aaa = talloc(trc, TR_AAA_SERVER))) {    tr_debug("tr_cfg_parse_one_aaa_server: Out of memory.");    *rc = TR_CFG_NOMEM;    return NULL;  }  memset(aaa, 0, sizeof(TR_AAA_SERVER));  aaa->hostname = tr_new_name((char *)(json_string_value(jaddr)));  return aaa;}

void nn_network_code::init(nn_network *network){	values_cnt = 0;	for (int l = 1; l < network->layers_cnt; ++l)		values_cnt+= network->layers[l].neurons_cnt * (1 + network->layers[l - 1].neurons_cnt);	talloc(values, values_cnt);	unsigned b = 0;	for (int l = 1; l < network->layers_cnt; ++l)		for (int n = 0; n < network->layers[l].neurons_cnt; ++n)		{			values[b++] = network->layers[l].neurons[n].treshold;			for (int w = 0; w < network->layers[l-1].neurons_cnt; ++w)				values[b++] = network->layers[l].neurons[n].in_neurons_weights[w];		}	if (b != values_cnt)	{		std::cerr << "ERROR: NNLIB: Internal error (" << __FILE__ << "@" << __LINE__ << ")/n";		exit(EXIT_FAILURE);	}}

/* * Called with a function call with arguments as argument. * This is done early in buildtree() and only done once. * Returns p. */NODE *funcode(NODE *p){	NODE *r, *l;	/* Fix function call arguments. On x86, just add funarg */	for (r = p->n_right; r->n_op == CM; r = r->n_left) {		if (r->n_right->n_op != STARG)			r->n_right = block(FUNARG, r->n_right, NIL,			    r->n_right->n_type, r->n_right->n_df,			    r->n_right->n_ap);	}	if (r->n_op != STARG) {		l = talloc();		*l = *r;		r->n_op = FUNARG;		r->n_left = l;		r->n_type = l->n_type;	}	return p;}

static bool test_is_server_listening(struct dcerpc_pipe *p, 				     TALLOC_CTX *mem_ctx){	NTSTATUS status;	struct mgmt_is_server_listening r;	r.out.status = talloc(mem_ctx, uint32_t);	status = dcerpc_mgmt_is_server_listening(p, mem_ctx, &r);	if (!NT_STATUS_IS_OK(status)) {		printf("is_server_listening failed - %s/n", nt_errstr(status));		return false;	}	if (*r.out.status != 0 || r.out.result == 0) {		printf("/tserver is NOT listening/n");	} else {		printf("/tserver is listening/n");	}	return true;}

struct tnode* addtree(struct tnode* p, char* w)	{	int cond;	if(p==NULL)	{		p=talloc();		p->word = strdup(w);		p->count = 1;		p->linenum[p->count] = line;		p->left = p->right = NULL;	}	else if((cond=strcmp(w, p->word))==0)		p->linenum[p->count++] = line;	else if(cond<0)		p->left = addtree(p->left, w);	else		p->right = addtree(p->right, w);	return p;}

void CopyRange_velocities(	struct Velocities **tovelocity,	struct Velocities *fromvelocity,	Place *p1,	Place *p2){	struct Velocities *velocity;	if(fromvelocity==NULL) return;	if(PlaceGreaterOrEqual(&fromvelocity->l.p,p2)) return;	velocity=talloc(sizeof(struct Velocities));        memcpy(velocity, fromvelocity, sizeof(struct Velocities));	PlaceSub(&velocity->l.p,p1);	ListAddElement3(tovelocity,&velocity->l);	CopyRange_velocities(tovelocity,NextVelocity(fromvelocity),p1,p2);}

cbuf* cbuf_copy(const cbuf* b){    cbuf* s = talloc(talloc_parent(b), cbuf);    if (s == NULL) {        return NULL;    }    s->buf = (char *)talloc_memdup(s, b->buf, b->size); /* only up to pos? */    /* XXX shallow did not work, because realloc */    /* fails with multiple references */    /* s->buf = talloc_reference(s, b->buf); */    if (s->buf == NULL) {        cbuf_delete(s);        return NULL;    }    s->size = b->size;    s->pos  = b->pos;    return s;}

void UpdateFXNodeLines(	struct Tracker_Windows *window,	struct WBlocks *wblock,	struct WTracks *wtrack){	struct FXs *fx=wtrack->track->fxs;	struct FXNodeLines *prev;	struct FXNodeLines *fxnode;	struct FXextrainfo fxextrainfo={0};        wtrack->wfxnodes=talloc(sizeof(WFXNodes *) * wblock->num_reallines);	while(fx!=NULL){		fxextrainfo.FXs=fx;		prev=fx->fxnodelines;		fxnode=NextFXNodeLine(prev);		fxextrainfo.color=fx->fx->color;		while(fxnode!=NULL){			fxextrainfo.FXNodeLine=prev;			MakeNodeLines(				window,				wblock,                                wtrack,				&prev->l.p,				&fxnode->l.p,				(float)prev->val,(float)fxnode->val,				(float) fx->fx->min,(float) fx->fx->max,				&fxextrainfo,				&MakeWFXNodesCallBack			);			prev=fxnode;			fxnode=NextFXNodeLine(fxnode);		}		fx=NextFX(fx);	}}

Value *primitiveGreater(Value *args){    //Exact same as less than but the comparison between the first and second value is changed to less than or equal to instead.    if (length(args) != 2){        printf("Evaluation Error: the number of arguments is not 2/n");        texit(1);    }    Value *result = talloc(sizeof(Value));    result->type = BOOL_TYPE;    result->i = 1;    double check;    if (length(args) != 2) {        printf("Evaluation Error: not a correct number of arguments/n");        texit(1);    }    if (car(args)->type == INT_TYPE) {        check = car(args)->i;    } else if (car(args)->type == DOUBLE_TYPE) {        check = car(args)->d;    } else {        printf("Evaluation Error: argument not a number/n");        texit(1);    }    args = cdr(args);    if (car(args)->type == INT_TYPE) {        if (check <= car(args)->i) {            result->i = 0;            return result;         }    } else if (car(args)->type == DOUBLE_TYPE) {        if (check <= car(args)->d) {            result->i = 0;            return result;        }    } else {        printf("Evaluation Error: argument not a number/n");        texit(1);    }    return result;}

static void unbecomeDC_drsuapi_remove_ds_server_send(struct libnet_UnbecomeDC_state *s){	struct composite_context *c = s->creq;	struct drsuapi_DsRemoveDSServer *r = &s->drsuapi.rm_ds_srv_r;	struct tevent_req *subreq;	r->in.bind_handle	= &s->drsuapi.bind_handle;	r->in.level		= 1;	r->in.req		= talloc(s, union drsuapi_DsRemoveDSServerRequest);	r->in.req->req1.server_dn = s->dest_dsa.server_dn_str;	r->in.req->req1.domain_dn = s->domain.dn_str;	r->in.req->req1.commit	= true;	r->out.level_out	= talloc(s, uint32_t);	r->out.res		= talloc(s, union drsuapi_DsRemoveDSServerResult);	subreq = dcerpc_drsuapi_DsRemoveDSServer_r_send(s, c->event_ctx,							s->drsuapi.drsuapi_handle,							r);	if (composite_nomem(subreq, c)) return;	tevent_req_set_callback(subreq, unbecomeDC_drsuapi_remove_ds_server_recv, s);}

struct tnode *addtree(struct tnode *p, char *w){    int cond;    if (p == NULL) { // A new word has arrived        p = talloc(); // Make a new node        p->word = my_strdup(w);        p->count = 1;        p->left = p->right = NULL;        printf("added word: %s /n", w);    }    else if ((cond = strcmp(w, p->word)) == 0)  // Husk p
C++ talloc_array函数代码示例
C++ tal_free函数代码示例