XML 解析（和验证）C 程序的分析

发布于 2024-11-28 04:53:04 字数 1031 浏览 0 评论 0原文

感谢 Stack Overflow 上的 jmbr，我终于找到了一种通过 C 程序针对 RELAX NG 验证 xml 的方法。该程序如下...

#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>

#include <libxml/xmlmemory.h>
#include <libxml/parser.h>
#include <libxml/relaxng.h>

int main(int argc, char *argv[])
{
   int status;
   xmlDoc *doc;
   xmlRelaxNGPtr schema;
   xmlRelaxNGValidCtxtPtr validctxt;
   xmlRelaxNGParserCtxtPtr rngparser;

   doc = xmlParseFile(argv[1]);

   rngparser = xmlRelaxNGNewParserCtxt(argv[2]);
   schema = xmlRelaxNGParse(rngparser);
   validctxt = xmlRelaxNGNewValidCtxt(schema);

   status = xmlRelaxNGValidateDoc(validctxt, doc);
   printf("status == %d\n", status);

   xmlRelaxNGFree(schema);
   xmlRelaxNGFreeValidCtxt(validctxt);
   xmlRelaxNGFreeParserCtxt(rngparser);
   xmlFreeDoc(doc);
   exit(EXIT_SUCCESS);

}

从那时起，我对程序进行了重大调整，以便找出解析和验证 xml 文件的“处理时间”。有什么方法可以找出该程序的最佳情况和最坏情况。最坏的情况是，对于任何作为输入的 xml 文件，所花费的时间始终是最高的。最好的情况是，所花费的时间总是最短的。我真的很困惑。如果你们中有人能帮助我，我将非常感激。

原文

Thanks to jmbr at Stack Overflow, I finally found a way to validate xml against RELAX NG via a C program. The program is as follows...

#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>

#include <libxml/xmlmemory.h>
#include <libxml/parser.h>
#include <libxml/relaxng.h>

int main(int argc, char *argv[])
{
   int status;
   xmlDoc *doc;
   xmlRelaxNGPtr schema;
   xmlRelaxNGValidCtxtPtr validctxt;
   xmlRelaxNGParserCtxtPtr rngparser;

   doc = xmlParseFile(argv[1]);

   rngparser = xmlRelaxNGNewParserCtxt(argv[2]);
   schema = xmlRelaxNGParse(rngparser);
   validctxt = xmlRelaxNGNewValidCtxt(schema);

   status = xmlRelaxNGValidateDoc(validctxt, doc);
   printf("status == %d\n", status);

   xmlRelaxNGFree(schema);
   xmlRelaxNGFreeValidCtxt(validctxt);
   xmlRelaxNGFreeParserCtxt(rngparser);
   xmlFreeDoc(doc);
   exit(EXIT_SUCCESS);

}

I have, since then, significantly tweaked the program so as to find out the "processing time" for parsing and validating an xml file. Is there any way to find out the best case and worst case for this program. Worst case being, the time taken is always highest for any xml file as input. And best case being, the time taken is always lowest. I am really stuck at this. Would really appreciate it, if any of you guys could help me out.

分享到QQ

分享到微博