u_long id; u_long map[][2]; int nentries;
id_t	id; id_map_t map; int	nentries;
umap_findid(id, map, nentries)	u_long id;	u_long map[][2];	int nentries;{	int i;	/* Find uid entry in map */	i = 0;	while ((i<nentries) && ((map[i][0]) != id))		i++;	if (i < nentries)		return (map[i][1]);	else		return (-1);}