rquota support completed by Ronnie Sahlberg.
svn path=/trunk/; revision=3357
This commit is contained in:
Guy Harris
parent
21f7cca50a
commit
17449f1186
1
AUTHORS
1
AUTHORS
|
|
@ -503,6 +503,7 @@ Ronnie Sahlberg <rsahlber@bigpond.net.au> {
|
|||
YPPASSWD support
|
||||
KLM support
|
||||
SPRAY support
|
||||
rquota support completed
|
||||
}
|
||||
|
||||
Borosa Tomislav <tomislav.borosa@SIEMENS.HR> {
|
||||
|
|
|
|||
182
packet-rquota.c
182
packet-rquota.c
|
|
@ -2,7 +2,7 @@
|
|||
* Routines for rquota dissection
|
||||
* Copyright 2001, Mike Frisch <frisch@hummingbird.com>
|
||||
*
|
||||
* $Id: packet-rquota.c,v 1.1 2001/02/27 19:40:58 guy Exp $
|
||||
* $Id: packet-rquota.c,v 1.2 2001/04/21 08:00:12 guy Exp $
|
||||
*
|
||||
* Ethereal - Network traffic analyzer
|
||||
* By Gerald Combs <gerald@zing.org>
|
||||
|
|
@ -39,26 +39,197 @@
|
|||
#include "packet-rquota.h"
|
||||
|
||||
static int proto_rquota = -1;
|
||||
static int hf_rquota_pathp = -1;
|
||||
static int hf_rquota_uid = -1;
|
||||
static int hf_rquota_status = -1;
|
||||
static int hf_rquota_rquota = -1;
|
||||
static int hf_rquota_bsize = -1;
|
||||
static int hf_rquota_active = -1;
|
||||
static int hf_rquota_bhardlimit = -1;
|
||||
static int hf_rquota_bsoftlimit = -1;
|
||||
static int hf_rquota_curblocks = -1;
|
||||
static int hf_rquota_fhardlimit = -1;
|
||||
static int hf_rquota_fsoftlimit = -1;
|
||||
static int hf_rquota_curfiles = -1;
|
||||
static int hf_rquota_btimeleft = -1;
|
||||
static int hf_rquota_ftimeleft = -1;
|
||||
|
||||
static gint ett_rquota = -1;
|
||||
static gint ett_rquota_rquota = -1;
|
||||
|
||||
const value_string names_rquota_status[] =
|
||||
{
|
||||
#define Q_OK 1
|
||||
{ Q_OK, "OK" },
|
||||
#define Q_NOQUOTA 2
|
||||
{ Q_NOQUOTA, "NOQUOTA" },
|
||||
#define Q_EPERM 3
|
||||
{ Q_EPERM, "EPERM" },
|
||||
};
|
||||
|
||||
|
||||
static int
|
||||
dissect_rquota(tvbuff_t *tvb, int offset, packet_info *pinfo, proto_tree *tree)
|
||||
{
|
||||
|
||||
proto_item *lock_item = NULL;
|
||||
proto_tree *lock_tree = NULL;
|
||||
|
||||
lock_item = proto_tree_add_item(tree, hf_rquota_rquota, tvb,
|
||||
offset, tvb_length_remaining(tvb, offset), FALSE);
|
||||
|
||||
lock_tree = proto_item_add_subtree(lock_item, ett_rquota_rquota);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_bsize, offset);
|
||||
|
||||
offset = dissect_rpc_bool_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_active, offset);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_bhardlimit, offset);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_bsoftlimit, offset);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_curblocks, offset);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_fhardlimit, offset);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_fsoftlimit, offset);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_curfiles, offset);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_btimeleft, offset);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, lock_tree,
|
||||
hf_rquota_ftimeleft, offset);
|
||||
|
||||
return offset;
|
||||
}
|
||||
|
||||
static int
|
||||
dissect_getquota_result(tvbuff_t *tvb, int offset, packet_info *pinfo, proto_tree *tree)
|
||||
{
|
||||
gint32 status;
|
||||
|
||||
status = tvb_get_ntohl(tvb, offset);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, tree,
|
||||
hf_rquota_status, offset);
|
||||
|
||||
if (status==Q_OK) {
|
||||
offset = dissect_rquota(tvb, offset, pinfo, tree);
|
||||
}
|
||||
|
||||
return offset;
|
||||
}
|
||||
|
||||
static int
|
||||
dissect_getquota_call(tvbuff_t *tvb, int offset, packet_info *pinfo, proto_tree *tree)
|
||||
{
|
||||
offset = dissect_rpc_string_tvb(tvb, pinfo, tree,
|
||||
hf_rquota_pathp, offset, NULL);
|
||||
|
||||
offset = dissect_rpc_uint32_tvb(tvb, pinfo, tree,
|
||||
hf_rquota_uid, offset);
|
||||
|
||||
return offset;
|
||||
}
|
||||
|
||||
/* proc number, "proc name", dissect_request, dissect_reply */
|
||||
/* NULL as function pointer means: type of arguments is "void". */
|
||||
static const vsff rquota1_proc[] = {
|
||||
{ RQUOTAPROC_NULL, "NULL", NULL, NULL },
|
||||
{ 0, NULL, NULL, NULL }
|
||||
{ RQUOTAPROC_NULL, "NULL",
|
||||
NULL, NULL },
|
||||
{ RQUOTAPROC_GETQUOTA, "GETQUOTA",
|
||||
dissect_getquota_call, dissect_getquota_result },
|
||||
{ RQUOTAPROC_GETACTIVEQUOTA, "GETACTIVEQUOTA",
|
||||
dissect_getquota_call, dissect_getquota_result },
|
||||
{ 0, NULL,
|
||||
NULL, NULL }
|
||||
};
|
||||
/* end of RQUOTA version 1 */
|
||||
|
||||
void
|
||||
proto_register_rquota(void)
|
||||
{
|
||||
static struct true_false_string tfs_active = { "Quota is ACTIVE", "Quota is NOT active" };
|
||||
|
||||
static hf_register_info hf[] = {
|
||||
{ &hf_rquota_uid, {
|
||||
"uid", "rquota.uid", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "User ID" }},
|
||||
|
||||
{ &hf_rquota_pathp, {
|
||||
"pathp", "rquota.pathp", FT_STRING, BASE_DEC,
|
||||
NULL, 0, "Filesystem of interest" }},
|
||||
|
||||
{ &hf_rquota_status, {
|
||||
"status", "rquota.status", FT_UINT32, BASE_DEC,
|
||||
VALS(names_rquota_status), 0, "Status code" }},
|
||||
|
||||
{ &hf_rquota_rquota, {
|
||||
"rquota", "rquota.rquota", FT_NONE, BASE_NONE,
|
||||
NULL, 0, "Rquota structure" }},
|
||||
|
||||
{ &hf_rquota_bsize, {
|
||||
"bsize", "rquota.bsize", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "Block size" }},
|
||||
|
||||
{ &hf_rquota_active, {
|
||||
"active", "rquota.active", FT_BOOLEAN, BASE_NONE,
|
||||
&tfs_active, 0, "Indicates whether quota is active" }},
|
||||
|
||||
{ &hf_rquota_bhardlimit, {
|
||||
"bhardlimit", "rquota.bhardlimit", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "Hard limit for blocks" }},
|
||||
|
||||
{ &hf_rquota_bsoftlimit, {
|
||||
"bsoftlimit", "rquota.bsoftlimit", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "Soft limit for blocks" }},
|
||||
|
||||
{ &hf_rquota_curblocks, {
|
||||
"curblocks", "rquota.curblocks", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "Current block count" }},
|
||||
|
||||
{ &hf_rquota_fhardlimit, {
|
||||
"fhardlimit", "rquota.fhardlimit", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "Hard limit on allocated files" }},
|
||||
|
||||
{ &hf_rquota_fsoftlimit, {
|
||||
"fsoftlimit", "rquota.fsoftlimit", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "Soft limit of allocated files" }},
|
||||
|
||||
{ &hf_rquota_curfiles, {
|
||||
"curfiles", "rquota.curfiles", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "Current # allocated files" }},
|
||||
|
||||
{ &hf_rquota_btimeleft, {
|
||||
"btimeleft", "rquota.btimeleft", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "Time left for excessive disk use" }},
|
||||
|
||||
{ &hf_rquota_ftimeleft, {
|
||||
"ftimeleft", "rquota.ftimeleft", FT_UINT32, BASE_DEC,
|
||||
NULL, 0, "Time left for excessive files" }},
|
||||
|
||||
};
|
||||
|
||||
static gint *ett[] = {
|
||||
&ett_rquota
|
||||
&ett_rquota,
|
||||
&ett_rquota_rquota,
|
||||
};
|
||||
|
||||
proto_rquota = proto_register_protocol("Remote Quota",
|
||||
"RQUOTA", "rquota");
|
||||
|
||||
proto_register_field_array(proto_rquota, hf, array_length(hf));
|
||||
|
||||
proto_register_subtree_array(ett, array_length(ett));
|
||||
}
|
||||
|
||||
|
|
@ -70,3 +241,6 @@ proto_reg_handoff_rquota(void)
|
|||
/* Register the procedure tables */
|
||||
rpc_init_proc_table(RQUOTA_PROGRAM, 1, rquota1_proc);
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -1,6 +1,6 @@
|
|||
/* packet-rquota.h
|
||||
*
|
||||
* $Id: packet-rquota.h,v 1.1 2001/02/27 19:40:58 guy Exp $
|
||||
* $Id: packet-rquota.h,v 1.2 2001/04/21 08:00:12 guy Exp $
|
||||
*
|
||||
* Ethereal - Network traffic analyzer
|
||||
* By Gerald Combs <gerald@zing.org>
|
||||
|
|
@ -25,7 +25,9 @@
|
|||
#ifndef PACKET_RQUOTA_H
|
||||
#define PACKET_RQUOTA_H
|
||||
|
||||
#define RQUOTAPROC_NULL 0
|
||||
#define RQUOTAPROC_NULL 0
|
||||
#define RQUOTAPROC_GETQUOTA 1
|
||||
#define RQUOTAPROC_GETACTIVEQUOTA 2
|
||||
|
||||
#define RQUOTA_PROGRAM 100011
|
||||
|
||||
|
|
|
|||
Loading…
Reference in New Issue