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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set et sw=2 ts=2: */
/***************************************************************************
* msgparser.cc
*
* Fri Feb 24 14:59:34 CET 2012
* Copyright 2012 Jonas Suhr Christensen
* jsc@umbraculum.org
****************************************************************************/
/*
* This file is part of Munia.
*
* Munia 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.
*
* Munia 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 Munia; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#include "messageparser.h"
#include <stdlib.h>
#include <stdio.h>
#include <list>
#include <vector>
typedef std::vector<std::string> TokenVector;
typedef std::list<TokenVector> MsgTokensList;
inline static void parse_into_msg_tokens(std::string& data,
MsgTokensList& msgTokensList) {
TokenVector tokenVector;
std::string token;
bool inside_quote = false;
char prev_ch = '0';
for(size_t i = 0; i < data.length(); i++) {
char ch = data[i];
switch(ch) {
case '\"':
if(prev_ch != '\\')
inside_quote = !inside_quote;
else {
token += ch;
}
break;
case ' ':
if(inside_quote) {
//printf("Appending %c\n", ch);
token += ch;
}
else {
if(token.empty()) continue; // skip multiple white spaces and pre white space
// printf("Adding token %s\n", token.c_str());
tokenVector.push_back(token);
token.clear();
}
break;
case ';':
if(inside_quote) {
token += ch;
}
else {
if(!token.empty()) {
tokenVector.push_back(token);
}
msgTokensList.push_back(tokenVector);
tokenVector.clear();
token.clear();
}
break;
default:
token += ch;
break;
}
prev_ch = ch;
}
if(!token.empty()) {
tokenVector.push_back(token);
token.clear();
}
if(!tokenVector.empty()) {
msgTokensList.push_back(tokenVector);
tokenVector.clear();
}
}
inline static void create_msg_list(MsgTokensList& msgTokensList,
MessageList& msgList,
bool clientmode) {
size_t origin = 0;
if(clientmode) {
origin = 1;
}
MsgTokensList::iterator it_msg;
for(it_msg = msgTokensList.begin(); it_msg != msgTokensList.end(); it_msg++) {
TokenVector t = *it_msg;
//malformed msg
if(t.size() < origin+1) continue;
message_t m;
// printf("t[%d] : %s, running in clientmode: %d\n", origin, t[origin].c_str(), clientmode);
// printf("%d\n", t.size());
if(t[origin] == "observe") m.cmd = cmd::observe;
else if(t[origin] == "unobserve") m.cmd = cmd::unobserve;
else if(t[origin] == "create") m.cmd = cmd::create;
else if(t[origin] == "remove") m.cmd = cmd::remove;
else if(t[origin] == "move") m.cmd = cmd::move;
else if(t[origin] == "update") m.cmd = cmd::update;
else m.cmd = cmd::error;
// printf("Number of tokens %d\n", t.size());
switch(m.cmd) {
case cmd::observe: {
if(t.size() != origin+1+1) {
printf("Wrong number of parameters\n");
continue;
}
m.observe.id = atoi(t[origin+1].c_str());
break;
}
case cmd::unobserve: {
if(t.size() != origin+1+1) {
printf("Wrong number of parameters\n");
continue;
}
m.unobserve.id = atoi(t[origin+1].c_str());
break;
}
case cmd::create: {
if(!clientmode && t.size() != origin+1+1) {
printf("Wrong number of parameters\n");
continue;
}
if(clientmode && t.size() != origin+1+2) {
printf("Wrong number of parameters\n");
continue;
}
if(clientmode) {
m.create.id = atoi(t[origin+1].c_str());
m.create.parentid = atoi(t[origin+2].c_str());
}
else {
m.create.parentid = atoi(t[origin+1].c_str());
}
break;
}
case cmd::remove: {
if(t.size() != origin+1+1) {
printf("Wrong number of parameters\n");
continue;
}
m.remove.id = atoi(t[origin+1].c_str());
break;
}
case cmd::move: {
if(t.size() != origin+2+1) {
printf("Wrong number of parameters\n");
continue;
}
m.move.id = atoi(t[origin+1].c_str());
m.move.parentid = atoi(t[origin+2].c_str());
break;
}
case cmd::update: {
if(t.size() != origin+2+1) {
printf("Wrong number of parameters\n");
continue;
}
m.update.id = atoi(t[origin+1].c_str());
sprintf(m.update.title, "%s", t[origin+2].c_str());
break;
}
default:
break;
};
msgList.push_back(m);
}
}
MessageList parse_msg(std::string data) {
// printf("Parsing: %s\n", data.c_str());
MsgTokensList msgTokensList;
parse_into_msg_tokens(data, msgTokensList);
MessageList msgList;
create_msg_list(msgTokensList, msgList, false);
return msgList;
}
MessageList parse_msg_client(std::string data) {
MsgTokensList msgTokensList;
parse_into_msg_tokens(data, msgTokensList);
MessageList msgList;
create_msg_list(msgTokensList, msgList, true);
return msgList;
}
std::string msg_tostring(message_t m) {
char* buf = NULL;
switch(m.cmd) {
case cmd::create: {
asprintf(&buf, "create %d %d;",
m.create.id,
m.create.parentid);
break;
}
case cmd::remove: {
asprintf(&buf, "remove %d;", m.remove.id);
break;
}
case cmd::move: {
asprintf(&buf, "move %d %d;", m.move.id, m.move.parentid);
break;
}
case cmd::update: {
asprintf(&buf, "update %d \"%s\";", m.update.id, m.update.title);
break;
};
default:
break;
}
std::string r;
if(buf) {
r = buf;
free(buf);
}
return r;
}
message_t create_msg_create(task_t t) {
message_t m;
m.cmd = cmd::create;
m.create.id = t.id;
m.create.parentid = t.parentid;
return m;
}
message_t create_msg_update(task_t t) {
message_t m;
m.cmd = cmd::update;
m.update.id = t.id;
sprintf(m.update.title, "%s", t.title.c_str());
return m;
}
message_t create_msg_remove(task_t t) {
message_t m;
m.cmd = cmd::remove;
m.remove.id = t.id;
return m;
}
message_t create_msg_move(taskid_t id, taskid_t to) {
message_t m;
m.cmd = cmd::move;
m.move.id = id;
m.move.parentid = to;
return m;
}
#ifdef TEST_MSGPARSER
//Additional dependency files
//deps:
//Required cflags (autoconf vars may be used)
//cflags:
//Required link options (autoconf vars may be used)
//libs:
#include "test.h"
TEST_BEGIN;
// TODO: Put some testcode here (see test.h for usable macros).
TEST_TRUE(false, "No tests yet!");
TEST_END;
#endif/*TEST_MSGPARSER*/
|