1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
|
/* packet-ldap.c
* Routines for ldap packet dissection
*
* $Id: packet-ldap.c,v 1.1 1999/12/09 04:06:53 nneul Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@unicom.net>
* Copyright 1998 Gerald Combs
*
* Copied from packet-tftp.c
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#endif
#include <stdio.h>
#ifdef HAVE_SYS_TYPES_H
# include <sys/types.h>
#endif
#ifdef HAVE_NETINET_IN_H
# include <netinet/in.h>
#endif
#include <string.h>
#include <glib.h>
#include "packet.h"
static int proto_ldap = -1;
static int hf_ldap_request = -1;
static int hf_ldap_response = -1;
static int hf_ldap_command = -1;
static gint ett_ldap = -1;
void dissect_ldap_request(proto_tree *tree, char *line, int offset, int len)
{
proto_tree_add_item_hidden(tree, hf_ldap_request,
offset, len, TRUE);
proto_tree_add_text(tree, offset,
len, "Request Line: %s", line);
}
void dissect_ldap_response(proto_tree *tree, char *line, int offset, int len)
{
proto_tree_add_item_hidden(tree, hf_ldap_response,
offset, len, TRUE);
proto_tree_add_text(tree, offset,
len, "Response Line: %s", line);
}
void
dissect_ldap(const u_char *pd, int offset, frame_data *fd, proto_tree *tree)
{
proto_tree *ldap_tree, *ti;
char *tmpline;
int start, cur, len;
const u_char *i;
if (check_col(fd, COL_PROTOCOL))
col_add_str(fd, COL_PROTOCOL, "LDAP");
if (check_col(fd, COL_INFO))
{
col_add_fstr(fd, COL_INFO, "%s",
(pi.match_port == pi.destport) ? "Request" : "Response");
}
if (tree)
{
ti = proto_tree_add_item(tree, proto_ldap, offset, END_OF_FRAME, NULL);
ldap_tree = proto_item_add_subtree(ti, ett_ldap);
tmpline = (char *)g_malloc( pi.captured_len );
i = pd+offset;
while ( i < pd + pi.captured_len )
{
start = i - pd;
cur = 0;
len = 0;
tmpline[cur] = 0;
/* copy up to end or cr/nl */
while ( i < pd + pi.captured_len && *i != '\r' && *i != '\n' )
{
tmpline[cur++] = *(i++);
len++;
}
tmpline[cur] = 0;
/* skip any CR/NL */
while ( i < pd + pi.captured_len &&
(*i == '\r' || *i == '\n') )
{
i++;
len++;
}
if ( strlen(tmpline) > 0 )
{
if (pi.match_port == pi.destport)
{
dissect_ldap_request(ldap_tree, tmpline, start, len);
}
else
{
dissect_ldap_response(ldap_tree, tmpline, start, len);
}
}
}
g_free(tmpline);
tmpline = 0;
}
}
void
proto_register_ldap(void)
{
static hf_register_info hf[] = {
{ &hf_ldap_response,
{ "Response", "ldap.response",
FT_BOOLEAN, BASE_NONE, NULL, 0x0,
"TRUE if LDAP response" }},
{ &hf_ldap_request,
{ "Request", "ldap.request",
FT_BOOLEAN, BASE_NONE, NULL, 0x0,
"TRUE if LDAP request" }},
{ &hf_ldap_command,
{ "Command", "ldap.command",
FT_STRING, BASE_NONE, NULL, 0x0,
"Command associated with request" }}
};
static gint *ett[] = {
&ett_ldap,
};
proto_ldap = proto_register_protocol("Lightweight Directory Access Protocol", "ldap");
proto_register_field_array(proto_ldap, hf, array_length(hf));
proto_register_subtree_array(ett, array_length(ett));
}
|
