X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=timeXMLTree.cpp;fp=timeXMLTree.cpp;h=aef9731343747db92720dbb381f64a2c2a189de1;hb=92455238a637876bec18bfdaed4f5342f4cbbd1f;hp=0000000000000000000000000000000000000000;hpb=25a3fa55f6de1835d2407283eeb43b01819543f6;p=SXSI%2Fxpathcomp.git

diff --git a/timeXMLTree.cpp b/timeXMLTree.cpp
new file mode 100644
index 0000000..aef9731
--- /dev/null
+++ b/timeXMLTree.cpp
@@ -0,0 +1,200 @@
+#include "XMLDocShredder.h"
+#include "XMLTree.h"
+#include "Utils.h"
+#include <sys/time.h>
+#include <time.h>
+
+using std::cout;
+using std::string;
+using std::left;
+using std::right;
+
+static clock_t tFirstChild = 0;
+static clock_t tNextSibling = 0;
+static clock_t tTaggedDesc = 0;
+static clock_t tTaggedFoll = 0;
+static clock_t tParentNode = 0;
+static clock_t tPrevNode = 0;
+static clock_t tTag = 0;
+static clock_t tMyText = 0;
+static clock_t tPrevText = 0;
+static clock_t tNextText = 0;
+static clock_t tFullTraversal = 0;
+static clock_t tJumpTraversal = 0;
+
+static unsigned int cFirstChild = 0;
+static unsigned int cNextSibling = 0;
+static unsigned int cTaggedDesc = 0;
+static unsigned int cTaggedFoll = 0;
+static unsigned int cParentNode = 0;
+static unsigned int cPrevNode = 0;
+static unsigned int cTag = 0;
+static unsigned int cMyText = 0;
+static unsigned int cPrevText = 0;
+static unsigned int cNextText = 0;
+static unsigned int cFullTraversal = 0;
+static unsigned int cJumpTraversal = 0;
+
+static clock_t tmp;
+
+static TagType target_tag = -1;
+
+#define STARTTIMER()   (tmp= clock())
+#define STOPTIMER(x)   do {  (t##x) = (t##x) + (clock() - tmp); (c##x)= (c##x)+1;  } while (0)
+#define PRINTSTATS(x)  do {						\
+    std::cout.width(11);						\
+    std::cout << std::left << #x;					\
+    std::cout << " : ";        						\
+    std::cout.width(8);							\
+    std::cout << std::right << c##x << " calls,";			\
+    std::cout.width(8);							\
+    std::cout << std::right << t##x << " cycles, total:";		\
+    std::cout.width(5);							\
+    std::cout << std::right << ((t##x) *1000.00)  /CLOCKS_PER_SEC	\
+	      << " ms, mean: ";						\
+    std::cout.width(5);							\
+    std::cout << std::right						\
+	      << (((t##x)* 1000.00)  /CLOCKS_PER_SEC) / c##x		\
+	      << "\n";							\
+  } while (0)
+
+
+void traversal(XMLTree * tree, treeNode node,unsigned char* targettagname){
+  treeNode res1,res2;
+  TagType tag;
+  DocID id1,id2,id3;
+  const unsigned char * tagname;
+  if (node != NULLT){
+    STARTTIMER();
+    tag = tree->Tag(node);
+    STOPTIMER(Tag);
+    if (target_tag == -1){
+      tagname = tree->GetTagNameByRef(tag);
+      if (strcmp( (char*) tagname, (char*) targettagname) == 0)
+	target_tag = tag;
+    };
+    STARTTIMER();
+    res1 = tree->TaggedDesc(node,tag);
+    STOPTIMER(TaggedDesc);
+
+    STARTTIMER();
+    res1 = tree->TaggedFoll(node,tag);
+    STOPTIMER(TaggedFoll);
+
+    STARTTIMER();
+    id1 = tree->MyText(node);
+    STOPTIMER(MyText);
+
+    STARTTIMER();
+    id2 = tree->PrevText(node);
+    STOPTIMER(PrevText);
+
+    STARTTIMER();
+    id3 = tree->NextText(node);
+    STOPTIMER(NextText);
+    
+    id1 = max(id1, max(id2,id3));
+
+    STARTTIMER();
+    res1 = tree->ParentNode(id1);
+    STOPTIMER(ParentNode);
+
+    STARTTIMER();
+    res1 = tree->PrevNode(id1);
+    STOPTIMER(PrevNode);
+    
+    STARTTIMER();
+    res1 = tree->FirstChild(node);
+    STOPTIMER(FirstChild);
+
+    STARTTIMER();
+    res2 = tree->NextSibling(node);
+    STOPTIMER(NextSibling);
+    traversal(tree,res1,targettagname);
+    traversal(tree,res2,targettagname);
+    
+  };
+  
+}
+
+unsigned int time_traversal(XMLTree *tree,treeNode node,unsigned int count){
+  TagType tag;
+  if (node != NULLT) {
+    cFullTraversal++;
+    tag = tree->Tag(node);
+    if (tag == target_tag)
+      count = count + 1;
+    return time_traversal(tree,tree->NextSibling(node), 
+			  time_traversal(tree,tree->FirstChild(node),count));
+
+  }
+  else 
+    return count;
+}
+
+
+unsigned int time_jump(XMLTree* tree, treeNode node,unsigned int count,treeNode root){
+  TagType tag;
+  if (node != NULLT) {
+    cJumpTraversal++;
+    tag = tree->Tag(node);
+    if (tag == target_tag)
+      count = count + 1;
+    return time_jump(tree,
+			  tree->TaggedFollBelow(node,target_tag,root), 
+			  time_jump(tree,
+				    tree->TaggedDesc(node,target_tag),
+				    count,
+				    node),
+		     root);
+    
+  }
+  else 
+    return count;
+}
+
+
+
+
+
+int main(int argc, char ** argv){
+  unsigned int count1,count2;
+  unsigned char * tagname = (unsigned char *) "keyword";
+
+  if (argc != 2){
+    std::cout << "Usage : " << argv[0] << " filename (without .srx)\n";
+    return 1;
+  };
+
+  // The samplerate is not taken into account for loading anymore
+  XMLTree * tree = XMLTree::Load((unsigned char*) argv[1],64);
+  
+  traversal(tree,tree->Root(),tagname);
+
+  STARTTIMER();
+  count1 = time_traversal(tree,tree->Root(),0);
+  STOPTIMER(FullTraversal);
+
+  count2 = time_jump(tree,tree->Root(),0,tree->Root());
+  STOPTIMER(JumpTraversal);
+  
+  PRINTSTATS(FirstChild);
+  PRINTSTATS(NextSibling);
+  PRINTSTATS(Tag);
+  PRINTSTATS(TaggedDesc);
+  PRINTSTATS(TaggedFoll);
+  PRINTSTATS(PrevText);
+  PRINTSTATS(MyText);
+  PRINTSTATS(NextText);
+  PRINTSTATS(ParentNode);
+  PRINTSTATS(PrevNode);
+  std::cout << "\n";
+  std::cout << "Full traversal found " << count1 << " " << tagname << "  nodes\n";
+  PRINTSTATS(FullTraversal);
+  std::cout << "\n";
+  std::cout << "Jump traversal found " << count2 << " " << tagname << "  nodes\n";
+  PRINTSTATS(JumpTraversal);
+  
+  
+  return 0;
+}