Lines Matching defs:le

36 	struct lsa_entry	*le, *nle;
65 	for (le = TAILQ_FIRST(&nbr->ls_req_list); le != NULL &&
67 	    le = nle) {
68 		nbr->ls_req = nle = TAILQ_NEXT(le, entry);
69 		ls_req_hdr.type = htonl(le->le_lsa->type);
70 		ls_req_hdr.ls_id = le->le_lsa->ls_id;
71 		ls_req_hdr.adv_rtr = le->le_lsa->adv_rtr;
119 	struct lsa_entry	*le;
124 	if ((le = calloc(1, sizeof(*le))) == NULL)
127 	TAILQ_INSERT_TAIL(&nbr->ls_req_list, le, entry);
128 	le->le_lsa = lsa;
135 	struct lsa_entry	*le;
137 	TAILQ_FOREACH(le, &nbr->ls_req_list, entry) {
138 		if ((lsa_hdr->type == le->le_lsa->type) &&
139 		    (lsa_hdr->ls_id == le->le_lsa->ls_id) &&
140 		    (lsa_hdr->adv_rtr == le->le_lsa->adv_rtr))
141 			return (le);
147 ls_req_list_free(struct nbr *nbr, struct lsa_entry *le)
149 	if (nbr->ls_req == le) {
150 		nbr->ls_req = TAILQ_NEXT(le, entry);
153 	TAILQ_REMOVE(&nbr->ls_req_list, le, entry);
154 	free(le->le_lsa);
155 	free(le);
173 	struct lsa_entry	*le;
175 	while ((le = TAILQ_FIRST(&nbr->ls_req_list)) != NULL) {
176 		TAILQ_REMOVE(&nbr->ls_req_list, le, entry);
177 		free(le->le_lsa);
178 		free(le);