gem-graph-server/include/xml.h

208 lines
7.8 KiB
C
Raw Normal View History

2021-08-20 16:41:58 +02:00
//=-------------------------------------------------------------------------=//
// XML management tools //
// //
// Copyright © 2021 The Gem-graph Project //
// //
// This file is part of gem-graph. //
// //
// This program is free software: you can redistribute it and/or modify //
// it under the terms of the GNU Affero General Public License as //
// published by the Free Software Foundation, either version 3 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 Affero General Public License for more details. //
// //
// You should have received a copy of the GNU Affero General Public License //
// along with this program. If not, see <https://www.gnu.org/licenses/>. //
//=-------------------------------------------------------------------------=//
#ifndef BASE_H
#include "../include/base.h"
#endif
/* -------------------------------------------------------------------------- */
2021-08-20 17:33:41 +02:00
#include <string.h>
#include <stdlib.h>
#include <libxml2/libxml/xmlmemory.h>
#include <libxml2/libxml/parser.h>
/* -------------------------------------------------------------------------- */
2021-08-20 17:33:41 +02:00
static xmlDocPtr currentDocument = NULL;
static xmlNodePtr currentDocumentRoot = NULL;
/* -------------------------------------------------------------------------- */
// -------------------------------------------------------------------------- //
// Open and set a document as current document //
// -------------------------------------------------------------------------- //
static inline void XmlSetNewDocument(const char *filename)
2021-08-20 17:33:41 +02:00
{
currentDocument = xmlParseFile(filename);
if (currentDocument == NULL ) {
printLog("%s not parsed successfully.\n", filename);
xmlFreeDoc(currentDocument);
currentDocument = NULL;
2021-08-24 00:41:49 +02:00
return;
2021-08-20 17:33:41 +02:00
}
currentDocumentRoot = xmlDocGetRootElement(currentDocument);
if (currentDocumentRoot == NULL ) {
printLog("%s is invalid (no root)\n", filename);
xmlFreeDoc(currentDocument);
currentDocument = NULL;
currentDocumentRoot = NULL;
2021-08-24 00:41:49 +02:00
return;
2021-08-20 17:33:41 +02:00
}
}
// -------------------------------------------------------------------------- //
// Close and unset current document //
// -------------------------------------------------------------------------- //
static inline void XmlCloseCurrentDocument(void)
2021-08-20 17:33:41 +02:00
{
2021-08-24 00:41:49 +02:00
xmlFreeDoc(currentDocument);
2021-08-20 17:33:41 +02:00
currentDocumentRoot = NULL;
currentDocument = NULL;
}
2021-08-20 16:41:58 +02:00
// -------------------------------------------------------------------------- //
// Reset current working root to document root //
// -------------------------------------------------------------------------- //
static inline void XmlResetWorkingRoot(void)
2021-08-24 00:41:49 +02:00
{
currentDocumentRoot = xmlDocGetRootElement(currentDocument);
}
// -------------------------------------------------------------------------- //
// Parse content of a given XML tag //
// -------------------------------------------------------------------------- //
static inline int XmlParseTag(const char* tagName, char *destination,
char destSize)
2021-08-24 00:41:49 +02:00
{
char *curString;
size_t cursor = 0;
2021-08-24 01:14:48 +02:00
char res = 0;
2021-08-24 00:41:49 +02:00
xmlNodePtr cur = currentDocumentRoot;
2021-08-24 01:14:48 +02:00
2021-08-24 12:09:54 +02:00
//printLog("Asked for %s\n", tagName);
2021-08-24 01:14:48 +02:00
2021-08-24 12:09:54 +02:00
// Enumerate all brothers in tree from current root
2021-08-24 00:41:49 +02:00
while (cur != NULL) {
2021-08-24 12:09:54 +02:00
//printLog("\tGot %s (res = %d)\n", cur->name, res);
// Check if current tag is the asked tag
2021-08-24 00:41:49 +02:00
if ((!xmlStrcmp(cur->name, (const xmlChar *)tagName))) {
2021-08-24 12:09:54 +02:00
//printLog("\tFound %s\n", cur->name);
2021-08-24 00:41:49 +02:00
curString = (char*)xmlNodeListGetString(currentDocument,
cur->xmlChildrenNode, 1);
2021-08-24 12:09:54 +02:00
//printLog("\t\tString : %s\n", curString);
2021-08-24 01:14:48 +02:00
2021-08-24 12:09:54 +02:00
// Check there is text in that tag (and that is asked)
if (destination && curString[0] != '\n') {
cursor =
snprintf(
destination + cursor * sizeof(char),
destSize,
"%s\n",
curString);
2021-08-24 01:14:48 +02:00
res++;
}
2021-08-24 00:41:49 +02:00
free(curString);
}
cur = cur->next;
2021-08-24 01:14:48 +02:00
}
return res;
2021-08-24 00:41:49 +02:00
}
// -------------------------------------------------------------------------- //
// Find a working root for a given tag //
// -------------------------------------------------------------------------- //
static inline xmlNodePtr findWorkingRoot(const char *tagName,
xmlNodePtr curRoot)
2021-08-24 00:41:49 +02:00
{
xmlNodePtr cur = curRoot;
2021-08-24 01:14:48 +02:00
xmlNodePtr recur;
2021-08-24 12:09:54 +02:00
//printLog("Asked for %s\n", tagName);
2021-08-24 00:41:49 +02:00
while (cur != NULL) {
if ((!xmlStrcmp(cur->name, (const xmlChar *)tagName))){
currentDocumentRoot = cur;
2021-08-24 01:14:48 +02:00
return cur;
2021-08-24 00:41:49 +02:00
}
2021-08-24 01:14:48 +02:00
if (cur->xmlChildrenNode) {
2021-08-24 18:25:44 +02:00
if ((recur = findRoot(tagName, cur->xmlChildrenNode)) != NULL)
2021-08-24 01:14:48 +02:00
return recur;
}
2021-08-24 00:41:49 +02:00
cur = cur->next;
}
2021-08-24 01:14:48 +02:00
return NULL;
2021-08-24 00:41:49 +02:00
}
// -------------------------------------------------------------------------- //
// Parse and validate an XML tree from given structural tree //
// and current document //
// -------------------------------------------------------------------------- //
static inline int XmlParseTree(ModelField_t *curTree)
2021-08-24 00:41:49 +02:00
{
2021-08-24 12:09:54 +02:00
int currentOrSonCorrectlyParsed = 0;
int curValueLen;
2021-08-24 00:41:49 +02:00
while (curTree) {
2021-08-24 12:09:54 +02:00
if (findRoot(
curTree->tag,
currentDocumentRoot->parent
) == NULL) {
printLog("Error : can't find a new root\n");
2021-08-24 01:14:48 +02:00
return EBADF;
2021-08-24 12:09:54 +02:00
}
2021-08-24 01:14:48 +02:00
2021-08-24 12:09:54 +02:00
//printLog("Asked for %s\n", curTree->tag);
// Try to parse current tag
if (parseTag(curTree->tag, curTree->value, curTree->valueSize) != 0) {
// There are values in that tag
if (curTree->value[0])
if (!(curTree->value[0] == '\0')) {
curValueLen = strlen(curTree->value);
// Delete \n chars
for(int i = 0; i < curValueLen; i++) {
if(curTree->value[i] == '\n') {
memmove(&curTree->value[i],
&curTree->value[i+1],
curValueLen - i);
curValueLen--;
i--;
}
}
2021-08-24 19:39:53 +02:00
printLog("Field %s: %s\n", curTree->tag, curTree->value);
2021-08-24 12:09:54 +02:00
}
} else {
// There aren't values in that tag
if (curTree->mandatory) {
// But it was mandatory
printLog("Error : can't find %s\n", curTree->tag);
return EBADF;
}
2021-08-24 12:09:54 +02:00
}
2021-08-24 00:41:49 +02:00
if (curTree->son)
2021-08-24 12:09:54 +02:00
currentOrSonCorrectlyParsed |= parseTree(curTree->son);
2021-08-24 00:41:49 +02:00
curTree = curTree->next;
}
2021-08-24 12:09:54 +02:00
return currentOrSonCorrectlyParsed;
2021-08-24 00:41:49 +02:00
}