if (_strnicmp(szSetCmd, szLine, strlen(szSetCmd)) == 0) {
char *value = strchr(szLine, '=');
if (value)
- *ppszEnvValue = _strdup(++value);
+ *ppszEnvValue = strdup(++value);
break;
}
}
char *ls1, *ls2;
BOOL bFound = FALSE;
- ls1 = _strdup(s1);
+ ls1 = strdup(s1);
if (!ls1)
return FALSE;
- ls2 = _strdup(s2);
+ ls2 = strdup(s2);
if (!ls2) {
free(ls1);
return FALSE;
#include <afsconfig.h>
#include <afs/param.h>
+#include <afs/stds.h>
#include <roken.h>
#include <osilog.h>
next = (struct principal_ccache_data *) malloc(sizeof(struct principal_ccache_data));
next->next = princ_cc_data;
princ_cc_data = next;
- next->principal = _strdup(pname);
+ next->principal = strdup(pname);
next->ccache_name = ccfullname;
ccfullname = NULL;
next->from_lsa = lsa;
if ( next->from_lsa || !strcmp(next->ccache_name, principal) )
free(response);
}
- response = _strdup(next->ccache_name);
+ response = strdup(next->ccache_name);
// MS Kerberos LSA is our best option so use it and quit
if ( next->from_lsa )
break;
next = (struct cell_principal_map *) malloc(sizeof(struct cell_principal_map));
next->next = cell_princ_map;
cell_princ_map = next;
- next->principal = _strdup(pname);
- next->cell = _strdup(cell);
+ next->principal = strdup(pname);
+ next->cell = strdup(cell);
next->active = active;
}
}
for ( next_map = cell_princ_map, i=0 ; next_map && i<count; next_map = next_map->next )
{
if ( (!active_only || next_map->active) && !strcmp(next_map->cell,cell) ) {
- (*principals)[i++] = _strdup(next_map->principal);
+ (*principals)[i++] = strdup(next_map->principal);
}
}
return count;
for ( next_map = cell_princ_map, i=0 ; next_map && i<count; next_map = next_map->next )
{
if ( (!active_only || next_map->active) && !strcmp(next_map->principal,pname) ) {
- (*cells)[i++] = _strdup(next_map->cell);
+ (*cells)[i++] = strdup(next_map->cell);
}
}
return count;
RegDeleteEntryAlt(const char *entryName, regentry_t entryType)
{
long status = ERROR_SUCCESS;
- char *entryBuf = _strdup(entryName);
+ char *entryBuf = strdup(entryName);
if (entryBuf == NULL) {
status = ERROR_NOT_ENOUGH_MEMORY;