dbg_log (_("Haven't found \"%s\" in group cache!"), key);
dbg_log (_("Haven't found \"%s\" in group cache!"), (char *)key);
addgrbyname (struct database *db, int fd, request_header *req,	     void *key, uid_t uid){  /* Search for the entry matching the key.  Please note that we don't     look again in the table whether the dataset is now available.  We     simply insert it.  It does not matter if it is in there twice.  The     pruning function only will look at the timestamp.  */  int buflen = 256;  char *buffer = alloca (buflen);  struct group resultbuf;  struct group *grp;  uid_t oldeuid = 0;  if (debug_level > 0)    dbg_log (_("Haven't found \"%s\" in group cache!"), key);  if (secure[grpdb])    {      oldeuid = geteuid ();      seteuid (uid);    }  while (__getgrnam_r (key, &resultbuf, buffer, buflen, &grp) != 0	 && errno == ERANGE)    {      errno = 0;      buflen += 256;      buffer = alloca (buflen);    }  if (secure[grpdb])    seteuid (oldeuid);  cache_addgr (db, fd, req, key, grp, uid);}