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
|
/*
* Copyright (c) 2009-2016, Albertas Vyšniauskas
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* * Neither the name of the software author nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
* IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "DynvHandler.h"
#include "DynvVariable.h"
#include "DynvIO.h"
#include "../Endian.h"
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <vector>
#include <iostream>
using namespace std;
bool dynvHandlerMap::dynvKeyCompare::operator() (const char* const& x, const char* const& y) const
{
return strcmp(x,y)<0;
}
struct dynvHandler* dynv_handler_create(const char* name){
struct dynvHandler* handler=new struct dynvHandler;
handler->name=strdup(name);
handler->create=nullptr;
handler->destroy=nullptr;
handler->set=nullptr;
handler->serialize=nullptr;
handler->deserialize=nullptr;
handler->serialize_xml=nullptr;
handler->deserialize_xml=nullptr;
handler->get=nullptr;
return handler;
}
void dynv_handler_destroy(struct dynvHandler* handler){
free(handler->name);
delete handler;
}
struct dynvHandlerMap* dynv_handler_map_create(){
struct dynvHandlerMap* handler_map=new struct dynvHandlerMap;
handler_map->refcnt=0;
return handler_map;
}
int dynv_handler_map_release(struct dynvHandlerMap* handler_map){
if (handler_map->refcnt){
handler_map->refcnt--;
return -1;
}else{
dynvHandlerMap::HandlerMap::iterator i;
for (i=handler_map->handlers.begin(); i != handler_map->handlers.end(); ++i){
dynv_handler_destroy((*i).second);
}
handler_map->handlers.clear();
delete handler_map;
return 0;
}
}
struct dynvHandlerMap* dynv_handler_map_ref(struct dynvHandlerMap* handler_map){
handler_map->refcnt++;
return handler_map;
}
int dynv_handler_map_add_handler(struct dynvHandlerMap* handler_map, struct dynvHandler* handler){
dynvHandlerMap::HandlerMap::iterator i;
i=handler_map->handlers.find(handler->name);
if (i != handler_map->handlers.end()){
return -1;
}else{
handler_map->handlers[handler->name]=handler;
return 0;
}
}
struct dynvHandler* dynv_handler_map_get_handler(struct dynvHandlerMap* handler_map, const char* handler_name){
dynvHandlerMap::HandlerMap::iterator i;
i=handler_map->handlers.find(handler_name);
if (i != handler_map->handlers.end()){
return (*i).second;
}else{
return 0;
}
}
int dynv_handler_map_serialize(struct dynvHandlerMap* handler_map, struct dynvIO* io){
dynvHandlerMap::HandlerMap::iterator i;
uint32_t written, length;
uint32_t id=0;
uint32_t handler_count=handler_map->handlers.size();
handler_count=UINT32_TO_LE(handler_count);
dynv_io_write(io, &handler_count, 4, &written);
for (i=handler_map->handlers.begin(); i != handler_map->handlers.end(); ++i){
struct dynvHandler* handler=(*i).second;
length=strlen(handler->name);
uint32_t length_le=UINT32_TO_LE(length);
dynv_io_write(io, &length_le, 4, &written);
dynv_io_write(io, handler->name, length, &written);
handler->id=id;
id++;
}
return 0;
}
int dynv_handler_map_deserialize(struct dynvHandlerMap* handler_map, struct dynvIO* io, dynvHandlerMap::HandlerVec& handler_vec){
uint32_t read;
uint32_t handler_count;
uint32_t length;
char* name;
struct dynvHandler* handler;
if (dynv_io_read(io, &handler_count, 4, &read) == 0){
if (read != 4) return -1;
}else return -1;
handler_count=UINT32_TO_LE(handler_count);
handler_vec.resize(handler_count);
for (uint32_t i=0; i != handler_count; ++i){
dynv_io_read(io, &length, 4, &read);
length=UINT32_TO_LE(length);
name=new char [length+1];
dynv_io_read(io, name, length, &read);
name[length]=0;
handler=dynv_handler_map_get_handler(handler_map, name);
handler_vec[i]=handler;
//cout<<"Handler: "<< name<<endl;
delete [] name;
}
return 0;
}
|
