bld_princ.c revision 505d05c73a6e56769f263d4803b22eddd168ee24
#pragma ident "%Z%%M% %I% %E% SMI"
/*
*
* Copyright 1991 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* require a specific license from the United States Government.
* It is the responsibility of any person or organization contemplating
* export to obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. Furthermore if you modify this software you must label
* your software as modified software and not distribute it in such a
* fashion that it might be confused with the original M.I.T. software.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is" without express
* or implied warranty.
*
*
* Build a principal from a list of strings
*/
#include <stdarg.h>
#include <k5-int.h>
/*ARGSUSED*/
{
register int i, count = 0;
register char *next;
char *tmpdata;
/* guess at an initial sufficent count of 2 pieces */
count = 2;
/* get space for array and realm, and insert realm */
if (data == 0)
return ENOMEM;
if (!tmpdata) {
return ENOMEM;
}
/* process rest of components */
next;
if (i == count) {
/* not big enough. realloc the array */
if (!p_tmp) {
while (--i >= 0)
return (ENOMEM);
}
count *= 2;
}
goto free_out;
}
return 0;
}
unsigned int rlen,
const char * realm, ...)
{
if (!pr_ret)
return ENOMEM;
if (retval == 0)
return retval;
}