| 1 |
#include <QvInput.h> |
| 2 |
#include <QvReadError.h> |
| 3 |
#include <QvField.h> |
| 4 |
#include <QvFieldData.h> |
| 5 |
#include <QvUnknownNode.h> |
| 6 |
|
| 7 |
#define OPEN_BRACE_CHAR '[' |
| 8 |
#define CLOSE_BRACE_CHAR ']' |
| 9 |
#define VALUE_SEPARATOR_CHAR ',' |
| 10 |
|
| 11 |
struct QvFieldEntry { |
| 12 |
QvName name; |
| 13 |
long offset; |
| 14 |
}; |
| 15 |
|
| 16 |
struct QvEnumEntry { |
| 17 |
QvName typeName; |
| 18 |
int num; |
| 19 |
int arraySize; |
| 20 |
int *vals; |
| 21 |
QvName *names; |
| 22 |
QvEnumEntry(const QvName &name); |
| 23 |
~QvEnumEntry(); |
| 24 |
|
| 25 |
static int growSize; |
| 26 |
}; |
| 27 |
|
| 28 |
int QvEnumEntry::growSize = 6; |
| 29 |
|
| 30 |
QvEnumEntry::QvEnumEntry(const QvName &name) |
| 31 |
{ |
| 32 |
typeName = name; |
| 33 |
num = 0; |
| 34 |
arraySize = growSize; |
| 35 |
vals = new int[arraySize]; |
| 36 |
names = new QvName[arraySize]; |
| 37 |
} |
| 38 |
|
| 39 |
QvEnumEntry::~QvEnumEntry() |
| 40 |
{ |
| 41 |
delete [] vals; |
| 42 |
delete [] names; |
| 43 |
} |
| 44 |
|
| 45 |
QvFieldData::~QvFieldData() |
| 46 |
{ |
| 47 |
struct QvFieldEntry *tmpField; |
| 48 |
struct QvEnumEntry *tmpEnum; |
| 49 |
|
| 50 |
for (int i=0; i<fields.getLength(); i++) { |
| 51 |
tmpField = (struct QvFieldEntry *)fields[i]; |
| 52 |
delete tmpField; |
| 53 |
} |
| 54 |
|
| 55 |
for (int j=0; j<enums.getLength(); j++) { |
| 56 |
tmpEnum = (struct QvEnumEntry *)enums[j]; |
| 57 |
delete tmpEnum; |
| 58 |
} |
| 59 |
} |
| 60 |
|
| 61 |
void |
| 62 |
QvFieldData::addField(QvNode *defobj, const char *fieldName, |
| 63 |
const QvField *field) |
| 64 |
{ |
| 65 |
struct QvFieldEntry *newField = new (struct QvFieldEntry); |
| 66 |
newField->name = fieldName; |
| 67 |
newField->offset = (const char *) field - (const char *) defobj; |
| 68 |
|
| 69 |
fields.append((void *) newField); |
| 70 |
} |
| 71 |
|
| 72 |
const QvName & |
| 73 |
QvFieldData::getFieldName(int index) const |
| 74 |
{ |
| 75 |
return ((QvFieldEntry *) fields[index])->name; |
| 76 |
} |
| 77 |
|
| 78 |
QvField * |
| 79 |
QvFieldData::getField(const QvNode *object, int index) const |
| 80 |
{ |
| 81 |
return (QvField *) ((char *) object + |
| 82 |
((QvFieldEntry *) fields[index])->offset); |
| 83 |
} |
| 84 |
|
| 85 |
#include <ctype.h> |
| 86 |
static QvName |
| 87 |
stripWhite(const char *name) |
| 88 |
{ |
| 89 |
int firstchar = -1; |
| 90 |
int lastchar = -1; |
| 91 |
int lastwhite = -1; |
| 92 |
int i; |
| 93 |
|
| 94 |
for (i=0; name[i]; i++) { |
| 95 |
if (isspace(name[i])) |
| 96 |
lastwhite = i; |
| 97 |
else { |
| 98 |
if (firstchar == -1) firstchar = i; |
| 99 |
lastchar = i; |
| 100 |
} |
| 101 |
} |
| 102 |
|
| 103 |
if (lastchar > lastwhite) |
| 104 |
return QvName(&name[firstchar]); |
| 105 |
|
| 106 |
char buf[500]; |
| 107 |
int b; |
| 108 |
for (b=0, i=firstchar; i<=lastchar; i++, b++) |
| 109 |
buf[b] = name[i]; |
| 110 |
buf[b] = 0; |
| 111 |
return QvName(buf); |
| 112 |
} |
| 113 |
|
| 114 |
void |
| 115 |
QvFieldData::addEnumValue(const char *typeNameArg, |
| 116 |
const char *valNameArg, int val) |
| 117 |
{ |
| 118 |
struct QvEnumEntry *e = NULL; |
| 119 |
QvName typeName = stripWhite(typeNameArg); |
| 120 |
QvName valName = stripWhite(valNameArg); |
| 121 |
|
| 122 |
for (int i=0; i<enums.getLength(); i++) { |
| 123 |
e = (struct QvEnumEntry *) enums[i]; |
| 124 |
if (e->typeName == typeName) |
| 125 |
break; |
| 126 |
else |
| 127 |
e = NULL; |
| 128 |
} |
| 129 |
if (e == NULL) { |
| 130 |
e = new QvEnumEntry(typeName); |
| 131 |
enums.append((void*) e); |
| 132 |
} |
| 133 |
if (e->num == e->arraySize) { |
| 134 |
e->arraySize += QvEnumEntry::growSize; |
| 135 |
int *ovals = e->vals; |
| 136 |
QvName *onames = e->names; |
| 137 |
e->vals = new int[e->arraySize]; |
| 138 |
e->names = new QvName[e->arraySize]; |
| 139 |
for (int i=0; i<e->num; i++) { |
| 140 |
e->vals[i] = ovals[i]; |
| 141 |
e->names[i] = onames[i]; |
| 142 |
} |
| 143 |
delete [] ovals; |
| 144 |
delete [] onames; |
| 145 |
} |
| 146 |
e->vals[e->num] = val; |
| 147 |
e->names[e->num] = valName; |
| 148 |
e->num++; |
| 149 |
} |
| 150 |
|
| 151 |
void |
| 152 |
QvFieldData::getEnumData(const char *typeNameArg, int &num, |
| 153 |
const int *&vals, const QvName *&names) |
| 154 |
{ |
| 155 |
QvName typeName = stripWhite(typeNameArg); |
| 156 |
|
| 157 |
for (int i=0; i<enums.getLength(); i++) { |
| 158 |
struct QvEnumEntry *e = (struct QvEnumEntry *) enums[i]; |
| 159 |
if (e->typeName == typeName) { |
| 160 |
num = e->num; |
| 161 |
vals = e->vals; |
| 162 |
names = e->names; |
| 163 |
return; |
| 164 |
} |
| 165 |
} |
| 166 |
num = 0; |
| 167 |
vals = NULL; |
| 168 |
names = NULL; |
| 169 |
} |
| 170 |
|
| 171 |
QvBool |
| 172 |
QvFieldData::readFieldTypes(QvInput *in, QvNode *object) |
| 173 |
{ |
| 174 |
QvName fieldType, fieldName; |
| 175 |
char c; |
| 176 |
|
| 177 |
if (! (in->read(c) || c != OPEN_BRACE_CHAR)) |
| 178 |
return FALSE; |
| 179 |
|
| 180 |
if (in->read(c) && c == CLOSE_BRACE_CHAR) |
| 181 |
return TRUE; |
| 182 |
|
| 183 |
in->putBack(c); |
| 184 |
|
| 185 |
QvBool alreadyHasFields = (object->isBuiltIn || getNumFields() != 0); |
| 186 |
|
| 187 |
while (TRUE) { |
| 188 |
|
| 189 |
if (! in->read(fieldType, TRUE) || ! in->read(fieldName, TRUE)) |
| 190 |
return FALSE; |
| 191 |
|
| 192 |
if (! alreadyHasFields) { |
| 193 |
QvField *fld = QvField::createInstanceFromName(fieldType); |
| 194 |
fld->setContainer(object); |
| 195 |
addField(object, fieldName.getString(), fld); |
| 196 |
} |
| 197 |
|
| 198 |
if (! in->read(c)) |
| 199 |
return FALSE; |
| 200 |
if (c == VALUE_SEPARATOR_CHAR) { |
| 201 |
|
| 202 |
if (in->read(c)) { |
| 203 |
if (c == CLOSE_BRACE_CHAR) |
| 204 |
return TRUE; |
| 205 |
else |
| 206 |
in->putBack(c); |
| 207 |
} |
| 208 |
} |
| 209 |
else if (c == CLOSE_BRACE_CHAR) |
| 210 |
return TRUE; |
| 211 |
else |
| 212 |
return FALSE; |
| 213 |
} |
| 214 |
} |
| 215 |
|
| 216 |
QvBool |
| 217 |
QvFieldData::read(QvInput *in, QvNode *object, |
| 218 |
QvBool errorOnUnknownField) const |
| 219 |
{ |
| 220 |
QvName fieldName; |
| 221 |
|
| 222 |
if (fields.getLength() == 0) return TRUE; |
| 223 |
|
| 224 |
while (TRUE) { |
| 225 |
|
| 226 |
if (! in->read(fieldName, TRUE) || ! fieldName) |
| 227 |
return TRUE; |
| 228 |
|
| 229 |
QvBool foundName; |
| 230 |
if (! read(in, object, fieldName, foundName)) |
| 231 |
return FALSE; |
| 232 |
|
| 233 |
if (!foundName) { |
| 234 |
if (errorOnUnknownField) { |
| 235 |
QvReadError::post(in, "Unknown field \"%s\"", |
| 236 |
fieldName.getString()); |
| 237 |
return FALSE; |
| 238 |
} |
| 239 |
else { |
| 240 |
in->putBack(fieldName.getString()); |
| 241 |
return TRUE; |
| 242 |
} |
| 243 |
} |
| 244 |
} |
| 245 |
} |
| 246 |
|
| 247 |
QvBool |
| 248 |
QvFieldData::read(QvInput *in, QvNode *object, |
| 249 |
const QvName &fieldName, QvBool &foundName) const |
| 250 |
{ |
| 251 |
int i; |
| 252 |
for (i = 0; i < fields.getLength(); i++) { |
| 253 |
if (fieldName == getFieldName(i)) { |
| 254 |
if (! getField(object, i)->read(in, fieldName)) |
| 255 |
return FALSE; |
| 256 |
break; |
| 257 |
} |
| 258 |
} |
| 259 |
if (i == fields.getLength()) |
| 260 |
foundName = FALSE; |
| 261 |
else foundName = TRUE; |
| 262 |
|
| 263 |
return TRUE; |
| 264 |
} |