/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2005 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
/*
* University Copyright- Copyright (c) 1982, 1986, 1988
* The Regents of the University of California
* All Rights Reserved
*
* University Acknowledgment- Portions of this document are derived from
* software developed by the University of California, Berkeley, and its
* contributors.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* nfs dfmounts
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <rpc/rpcb_clnt.h>
#include <netdb.h>
#include <locale.h>
static int hflg;
static void pr_mounts(char *);
static void freemntlist(struct mountbody *);
static int sortpath(const void *, const void *);
static void usage(void);
static void pr_err(char *, ...);
int
{
extern int optind;
int i, c;
#if !defined(TEXT_DOMAIN)
#endif
(void) textdomain(TEXT_DOMAIN);
switch (c) {
case 'h':
hflg++;
break;
default:
usage();
exit(1);
}
}
} else {
perror("nfs dfmounts: gethostname");
exit(1);
}
}
return (0);
}
/*
* Print the filesystems on "host" that are currently mounted by a client.
*/
static void
char *host;
{
char *lastpath;
char *lastclient;
int tail = 0;
/*
* First try circuit, then drop back to datagram if
* circuit is unavailable (an old version of mountd perhaps)
* Using circuit is preferred because it can handle
* arbitrarily long export lists.
*/
"datagram_n");
(void) __rpc_control(CLCR_SET_RPCB_TIMEOUT,
return;
}
}
return;
}
return; /* no mounts */
if (!hflg) {
printf("%-8s %10s %-24s %s",
hflg++;
}
/*
* Create an array describing the mounts, so that we can sort them.
*/
/*
* Print out the sorted array. Group entries for the same
* filesystem together, and ignore duplicate entries.
*/
lastpath = "";
lastclient = "";
continue;
continue; /* ignore duplicate */
}
} else {
printf("\n%-8s %10s %-24s ",
tail = 0;
}
if (tail++)
printf(",");
}
printf("\n");
}
static void
{
while (ml) {
if (ml->ml_hostname)
if (ml->ml_directory)
}
}
/*
* Compare two structs for mounted filesystems. The primary sort key is
* the name of the exported filesystem. There is also a secondary sort on
* the name of the client, so that duplicate entries (same path and
* hostname) will sort together.
*
* Returns < 0 if the first entry sorts before the second entry, 0 if they
* sort the same, and > 0 if the first entry sorts after the second entry.
*/
static int
sortpath(a, b)
const void *a, *b;
{
int result;
if (result == 0) {
}
return (result);
}
static void
usage()
{
}
/* VARARGS1 */
static void
{
}