56     struct mkt_data *d;  in mkt_resolve()  local
60     for (d = mkt_head; d != NULL; d = d->next)  in mkt_resolve()
61 	if (strcmp(d->name, name) == 0)  in mkt_resolve()
63     if (d) {  in mkt_resolve()
64 	if (d->refcount < 1)  in mkt_resolve()
66 			"refcount < 1 %d", d->refcount);  in mkt_resolve()
67 	d->refcount++;  in mkt_resolve()
68 	id->data = d;  in mkt_resolve()
73     d = calloc(1, sizeof(*d));  in mkt_resolve()
74     if(d == NULL) {  in mkt_resolve()
80     d->name = strdup(name);  in mkt_resolve()
81     if (d->name == NULL) {  in mkt_resolve()
83 	free(d);  in mkt_resolve()
88     d->entries = NULL;  in mkt_resolve()
89     d->num_entries = 0;  in mkt_resolve()
90     d->refcount = 1;  in mkt_resolve()
91     d->next = mkt_head;  in mkt_resolve()
92     mkt_head = d;  in mkt_resolve()
94     id->data = d;  in mkt_resolve()
101     struct mkt_data *d = id->data, **dp;  in mkt_close()  local
105     if (d->refcount < 1)  in mkt_close()
109     if (--d->refcount > 0) {  in mkt_close()
114 	if (*dp == d) {  in mkt_close()
115 	    *dp = d->next;  in mkt_close()
121     free(d->name);  in mkt_close()
122     for(i = 0; i < d->num_entries; i++)  in mkt_close()
123 	krb5_kt_free_entry(context, &d->entries[i]);  in mkt_close()
124     free(d->entries);  in mkt_close()
125     free(d);  in mkt_close()
135     struct mkt_data *d = id->data;  in mkt_get_name()  local
136     strlcpy(name, d->name, namesize);  in mkt_get_name()
156     struct mkt_data *d = id->data;  in mkt_next_entry()  local
157     if(c->fd >= d->num_entries)  in mkt_next_entry()
159     return krb5_kt_copy_entry_contents(context, &d->entries[c->fd++], entry);  in mkt_next_entry()
175     struct mkt_data *d = id->data;  in mkt_add_entry()  local
177     tmp = realloc(d->entries, (d->num_entries + 1) * sizeof(*d->entries));  in mkt_add_entry()
183     d->entries = tmp;  in mkt_add_entry()
185 				       &d->entries[d->num_entries++]);  in mkt_add_entry()
193     struct mkt_data *d = id->data;  in mkt_remove_entry()  local
197     if (d->num_entries == 0) {  in mkt_remove_entry()
203     for(end = d->entries + d->num_entries, e = end - 1; e >= d->entries; e--) {  in mkt_remove_entry()
209 	    d->num_entries--;  in mkt_remove_entry()
218     e = realloc(d->entries, d->num_entries * sizeof(*d->entries));  in mkt_remove_entry()
219     if(e != NULL || d->num_entries == 0)  in mkt_remove_entry()
220 	d->entries = e;  in mkt_remove_entry()