kadmin/ktutil/ktutil_funcs.c

54     krb5_kt_list lp, prev;
57     for (lp = list; lp;) {
58 	retval = krb5_kt_free_entry(context, lp->entry);
59 	free((char *)lp->entry);
62 	prev = lp;
63 	lp = lp->next;
78     krb5_kt_list lp, prev;
81     for (lp = *list, i = 1; lp; prev = lp, lp = lp->next, i++) {
84 		*list = lp->next;
86 		prev->next = lp->next;
87 	    lp->next = NULL;
88 	    return ktutil_free_kt_list(context, lp);
110     krb5_kt_list lp = NULL, prev = NULL;
140         /* point lp at the tail of the list */
141         for (lp = *list; lp->next; lp = lp->next);
149     if (!lp) {		/* if list is empty, start one */
150         lp = (krb5_kt_list) malloc(sizeof(*lp));
151 	if (!lp) {
155         lp->next = (krb5_kt_list) malloc(sizeof(*lp));
156 	if (!lp->next) {
159 	prev = lp;
160 	lp = lp->next;
162     lp->next = NULL;
163     lp->entry = entry;
188 	memcpy(&lp->entry->key, &key, sizeof(krb5_keyblock));
207         lp->entry->key.enctype = enctype;
208 	lp->entry->key.contents = (krb5_octet *) malloc((strlen(buf) + 1) / 2);
209 	if (!lp->entry->key.contents) {
223 	    lp->entry->key.contents[i++] = (krb5_octet) tmp;
225 	lp->entry->key.length = i;
227     lp->entry->principal = princ;
228     lp->entry->vno = kvno;
229     lp->entry->timestamp = now;
232 	*list = lp;
239     ktutil_free_kt_list(context, lp);
252     krb5_kt_list lp = NULL, tail = NULL, back = NULL;
259 	/* point lp at the tail of the list */
260 	for (lp = *list; lp->next; lp = lp->next);
261 	back = lp;
280 	if (!lp) {		/* if list is empty, start one */
281 	    lp = (krb5_kt_list)malloc(sizeof (*lp));
282 	    if (!lp) {
287 	    lp->next = (krb5_kt_list)malloc(sizeof (*lp));
288 	    if (!lp->next) {
292 	    lp = lp->next;
295 	    tail = lp;
296 	lp->next = NULL;
297 	lp->entry = entry;
327     krb5_kt_list lp;
339     for (lp = list; lp; lp = lp->next) {
340 	retval = krb5_kt_add_entry(context, kt, lp->entry);
381     krb5_kt_list lp = NULL, tail = NULL, back = NULL;
392 	/* point lp at the tail of the list */
393 	for (lp = *list; lp->next; lp = lp->next);
394 	back = lp;
432 	if (!lp) {		/* if list is empty, start one */
433 	    lp = (krb5_kt_list)malloc(sizeof (*lp));
434 	    if (!lp) {
439 	    lp->next = (krb5_kt_list)malloc(sizeof (*lp));
440 	    if (!lp->next) {
444 	    lp = lp->next;
446 	lp->next = NULL;
447 	lp->entry = entry;
449 	    tail = lp;
478     krb5_kt_list lp, lp1, prev, pruned = NULL;
486     for (lp = list; lp; lp = lp->next) {
487 	if ((lp->entry->key.enctype != ENCTYPE_DES_CBC_CRC) &&
488 	    (lp->entry->key.enctype != ENCTYPE_DES_CBC_MD5) &&
489 	    (lp->entry->key.enctype != ENCTYPE_DES_CBC_MD4) &&
490 	    (lp->entry->key.enctype != ENCTYPE_DES_CBC_RAW))
496 				       lp->entry->principal,
517 	    lp1->entry = lp->entry;
522 	    if (lp1->entry->vno > 240 || lp->entry->vno > 240) {
526 	    if (M(lp1->entry->vno) < M(lp->entry->vno))
527 		/* Check if lp->entry is newer kvno; if so, update */
528 		lp1->entry = lp->entry;
539     for (lp = pruned; lp; lp = lp->next) {
541 	kvno = (unsigned char) lp->entry->vno;
543 					 lp->entry->principal,
551 	fwrite((char *)lp->entry->key.contents,
560     for (lp = pruned; lp;) {
561 	prev = lp;
562 	lp = lp->next;