467 	struct label_mapping *lma;  in ldp_peer_add_mapping()  local
471 	if ((lma = ldp_peer_get_lm(p, a, prefix)) != NULL) {  in ldp_peer_add_mapping()
473 		lma->label = label;  in ldp_peer_add_mapping()
477 	lma = malloc(sizeof(*lma));  in ldp_peer_add_mapping()
479 	if (!lma) {  in ldp_peer_add_mapping()
484 	memcpy(&lma->address, a, a->sa_len);  in ldp_peer_add_mapping()
485 	lma->prefix = prefix;  in ldp_peer_add_mapping()
486 	lma->label = label;  in ldp_peer_add_mapping()
488 	rb_tree_insert_node(&p->label_mapping_tree, lma);  in ldp_peer_add_mapping()
497 	struct label_mapping *lma;  in ldp_peer_delete_mapping()  local
499 	if (a == NULL || (lma = ldp_peer_get_lm(p, a, prefix)) == NULL)  in ldp_peer_delete_mapping()
502 	rb_tree_remove_node(&p->label_mapping_tree, lma);  in ldp_peer_delete_mapping()
503 	free(lma);  in ldp_peer_delete_mapping()
526 	struct label_mapping *lma;  in ldp_peer_delete_all_mappings()  local
528 	while((lma = RB_TREE_MIN(&p->label_mapping_tree)) != NULL) {  in ldp_peer_delete_all_mappings()
529 		rb_tree_remove_node(&p->label_mapping_tree, lma);  in ldp_peer_delete_all_mappings()
530 		free(lma);  in ldp_peer_delete_all_mappings()