free(ph, M_PFIL);

	int i, j, k;

	struct radix6_addr_entry *ae;

	/* 2 records per addr entry */

	size_t max_items = lr->num_items * 2;

	/* rn_detachhead doesn't clean up all the rn_mklist entries properly.

	 * Since we know we're done, we can do a second pass here on the flat

	 * array of nodes to free any pointers when we see them for the first time.

	 */

	struct radix_mask **mask_list = malloc(max_items * sizeof(void *), M_RTABLE, 0);

	memset(mask_list, 0, max_items * sizeof(void *));

	int cur_entry = 0;

	for (i = 0; i < lr->num_items; i++) {

		ae = (struct radix6_addr_entry *)((char *)lr->radix_mem +

		    (i * LRADIX6_ITEM_SZ));

		for (j = 0; j < 2; j++) {

			if (ae->rn[j].rn_mklist != NULL) {

				bool found = false;

				for (k = 0; k < cur_entry; k++) {

					if (ae->rn[j].rn_mklist == mask_list[k]) {

						found = true;

						break;

					}

				}

				if (!found) {

					free(ae->rn[j].rn_mklist, M_RTABLE);

					mask_list[cur_entry++] = ae->rn[j].rn_mklist;

				}

			}

		}

	}

	free(mask_list, M_RTABLE);