diff --git a/.gitignore b/.gitignore deleted file mode 100644 index 8649cbf..0000000 --- a/.gitignore +++ /dev/null @@ -1,25 +0,0 @@ -*~ -*.out -*.o -*.gch -dom_parser - -libxmlquery.so -documentation/_build/singlehtml/ -bindings/python/_libxmlquery.so -bindings/python/libxmlquery.py -bindings/python/libxmlquery_wrap.c -*.pyc -documentation/_build/latex/*.sty -documentation/_build/latex/*.aux -documentation/_build/latex/*.idx -documentation/_build/latex/*.ind -documentation/_build/latex/*.log -documentation/_build/latex/*.tex -documentation/_build/latex/*.toc -documentation/_build/latex/*.ist -documentation/_build/latex/*.cls -documentation/_build/latex/*.sty -documentation/_build/doctrees/ -documentation/_build/latex/*.ilg -*/main.c diff --git a/LICENSE b/LICENSE deleted file mode 100644 index 206aabd..0000000 --- a/LICENSE +++ /dev/null @@ -1,21 +0,0 @@ -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - diff --git a/Makefile b/Makefile deleted file mode 100644 index 7d3009a..0000000 --- a/Makefile +++ /dev/null @@ -1,38 +0,0 @@ -include Makefile.inc - -DOM_SRC = ./dom -PARSER_SRC = ./parser -STRUCTS = ./data_structures -SELECTORS = ./selectors -OUT = xmlquery - -all: exec so - -object_code: - make -C $(DOM_SRC) all - make -C $(PARSER_SRC) all - make -C $(STRUCTS) all - make -C $(SELECTORS) all - -tests: so - make -C tests - -exec: object_code - $(CC) $(CFLAGS) -o $(OUT) $(PARSER_SRC)/*.o $(DOM_SRC)/*.o $(STRUCTS)/*.o $(SELECTORS)/*.o main.c - -clean: - make -C $(DOM_SRC) clean - make -C $(PARSER_SRC) clean - make -C $(STRUCTS) clean - make -C $(SELECTORS) clean - rm -rf *~ *.o $(OUT) libxmlquery.so - -so: object_code - $(CC) $(CFLAGS) $(PARSER_SRC)/*.o $(DOM_SRC)/*.o $(STRUCTS)/*.o $(SELECTORS)/*.o -shared -o libxmlquery.so - -install: - ./install.sh - -uninstall: - ./install.sh -u - diff --git a/Makefile.inc b/Makefile.inc deleted file mode 100644 index 1f09f18..0000000 --- a/Makefile.inc +++ /dev/null @@ -1,6 +0,0 @@ -# common definitions - -CC = gcc -CFLAGS = -Wall -Os -g -DDEBUG -fPIC -LEXFLAGS = -DDEBUG -c -g -Os -fPIC - diff --git a/README.rst b/README.rst deleted file mode 100644 index 529e579..0000000 --- a/README.rst +++ /dev/null @@ -1,13 +0,0 @@ -=========== -libxmlquery -=========== - -C library to parse and query xml using css selectors, built for low -memory footprint and portability. - -This software is released under the `MIT license -`_. - -Both the software and its documentation are in a *pre alpha* stage, -please use with caution. - diff --git a/applications/shell.html b/applications/shell.html new file mode 100644 index 0000000..9c112a0 --- /dev/null +++ b/applications/shell.html @@ -0,0 +1,186 @@ + + + + + + + + Shell — libxmlquery v0.1.4 documentation + + + + + + + + + + +
+

Navigation

+ +
+ +
+
+
+
+ +
+

Shell

+

The shell application is the most simplest application we’ve created to demonstrate the features of our querying engine. It has a simple interface and its purpose +is to load xml files, print them and query them.

+
+

Compiling

+

Compiling the shell is very easy. You just type make and it’ll generate a binary called shell.

+
+
+

Running

+

After compiling the shell application, you just need to run the binary file shell without any arguments.

+
+
+

Interaction

+

After running the application, you’ll be presented with a banner and a prompt. You can begin by typing help to see which commands it supports.

+

As an example:

+
############################################################################
+#                                                                          #
+#  ll   iii bbb  xx   xx mm   mm ll     qqqq   uu  uu eeeee rrrr  yy   yy  #
+#  ll    i  bb b  xx xx  mmm mmm ll    qq  qq  uu  uu ee    rr rr  yy yy   #
+#  ll    i  bbb    xxx   mmmmmmm ll   qq    qq uu  uu eeee  rrrr    yyy    #
+#  ll    i  bb b  xx xx  mm m mm ll    qq  qq  uu  uu ee    rr rr   yyy    #
+#  llll iii bbb  xx   xx mm   mm llll   qqqq q uuuuuu eeeee rr  rr  yyy    #
+#                                                                          #
+############################################################################
+
+>>> help
+gdb:
+Call gdb for a given program
+        Usage:gdb <binary_file>
+load:
+Load an xml file into a variable.
+        Usage: load <file_to_load> <variable_name>
+
+help:
+Print this help message
+
+query:
+Query an existing xml document
+        Usage:query <variable_name> "<query_expression>"
+
+quit:
+Exit from shell
+
+print_xml:
+Print a loaded document into xml format
+        Usage: print_xml <variable_name>
+>>>
+
+
+

From here you can deduce what commands we implemented. The gdb command is there just for development convenience. A typical interaction would be:

+
############################################################################
+#                                                                          #
+#  ll   iii bbb  xx   xx mm   mm ll     qqqq   uu  uu eeeee rrrr  yy   yy  #
+#  ll    i  bb b  xx xx  mmm mmm ll    qq  qq  uu  uu ee    rr rr  yy yy   #
+#  ll    i  bbb    xxx   mmmmmmm ll   qq    qq uu  uu eeee  rrrr    yyy    #
+#  ll    i  bb b  xx xx  mm m mm ll    qq  qq  uu  uu ee    rr rr   yyy    #
+#  llll iii bbb  xx   xx mm   mm llll   qqqq q uuuuuu eeeee rr  rr  yyy    #
+#                                                                          #
+############################################################################
+
+>>> load ../test.xml doc
+XML ../test.xml loaded and stored in doc
+>>> query doc "@title"
+Node:
+<title>
+  RSS Example
+</title>
+
+Node:
+<title>
+  Item Example
+</title>
+
+>>> quit
+exiting...
+
+
+

This example shows how to load and query a document.

+
+
+ + +
+
+
+
+
+

Table Of Contents

+ + +

Previous topic

+

Special Macros

+

This Page

+ + + +
+
+
+
+
+

Navigation

+ +
+
+ © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
+ + \ No newline at end of file diff --git a/bindings/Makefile b/bindings/Makefile deleted file mode 100644 index bc38a30..0000000 --- a/bindings/Makefile +++ /dev/null @@ -1,14 +0,0 @@ -include ../Makefile.inc - -PYTHON = ./python - -all: helpers.o - make -C $(PYTHON) all - -helpers.o: helpers.c helpers.h - $(CC) $(CFLAGS) -c helpers.c - -clean: - make -C $(PYTHON) clean - rm helpers.o - diff --git a/bindings/helpers.c b/bindings/helpers.c deleted file mode 100644 index 43a51a5..0000000 --- a/bindings/helpers.c +++ /dev/null @@ -1,45 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include -#include - -dom_node* internal_parse_xml_file(char* xmlstring){ - return parse_xml_from_string(xmlstring)->root; -} - -char* node_to_xml_string(dom_node* root){ - return node_to_string(root, XML); -} - -int list_size(struct generic_list_s* l){ - return l->count; -} - -dom_node* get_dom_node_at(struct generic_list_s* l, int p){ - return (dom_node*)get_element_at(l, p); -} - diff --git a/bindings/helpers.h b/bindings/helpers.h deleted file mode 100644 index 3c3ba06..0000000 --- a/bindings/helpers.h +++ /dev/null @@ -1,32 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __HELPERS_H__ -#define __HELPERS_H__ - -extern dom_node* internal_parse_xml_file(char* filename); -extern char* node_to_xml_string(dom_node* root); - -#endif - diff --git a/bindings/python/MANIFEST b/bindings/python/MANIFEST deleted file mode 100644 index 8bf854f..0000000 --- a/bindings/python/MANIFEST +++ /dev/null @@ -1,5 +0,0 @@ -helpers.c -libxmlquery.py -libxmlquery_wrap.c -setup.py -xmlquery.py diff --git a/bindings/python/Makefile b/bindings/python/Makefile deleted file mode 100644 index d5e0d0d..0000000 --- a/bindings/python/Makefile +++ /dev/null @@ -1,24 +0,0 @@ -SO = pyxmlquery.so - -all: _libxmlquery.so - - -libxmlquery.py libxmlquery_wrap.c: libxmlquery.i - swig -python libxmlquery.i - -libxmlquery_wrap.o: libxmlquery_wrap.c - gcc -c -fpic libxmlquery_wrap.c -I/usr/include/python2.7 - -libxmlquery.so: - make -C ../.. so - sudo make -C ../.. uninstall - sudo make -C ../.. install - -_libxmlquery.so: libxmlquery_wrap.o libxmlquery.so ../helpers.o - gcc -shared -lxmlquery libxmlquery_wrap.o ../helpers.o -o _libxmlquery.so - -../helpers.o: ../helpers.c ../helpers.h - -clean: - rm -rf libxmlquery.py libxmlquery_wrap.c libxmlquery_wrap.o _libxmlquery.so - diff --git a/bindings/python/helpers.c b/bindings/python/helpers.c deleted file mode 120000 index 4f91024..0000000 --- a/bindings/python/helpers.c +++ /dev/null @@ -1 +0,0 @@ -../helpers.c \ No newline at end of file diff --git a/bindings/python/html2xml b/bindings/python/html2xml deleted file mode 120000 index a15ad53..0000000 --- a/bindings/python/html2xml +++ /dev/null @@ -1 +0,0 @@ -html2xml.py \ No newline at end of file diff --git a/bindings/python/html2xml.py b/bindings/python/html2xml.py deleted file mode 100755 index c4b37aa..0000000 --- a/bindings/python/html2xml.py +++ /dev/null @@ -1,29 +0,0 @@ -#!/usr/bin/python - -import sys -from BeautifulSoup import BeautifulSoup -import re - - -def translate(html, force=False): - - if force: - html = re.sub(re.compile("(.*?)", re.I|re.S), r"", html) - else: - html = re.sub(re.compile("(.*?)", re.I|re.S), r"", html) - - - soup = BeautifulSoup(html) - - return soup.prettify() - -if __name__ == "__main__": - if len(sys.argv) == 1: - f = sys.stdin - elif len(sys.argv) == 2: - f = open(sys.argv[1], 'r') - print "Usage: html2python 'file.html'" - - print translate(f.read()) - f.close() - diff --git a/bindings/python/libxmlquery.i b/bindings/python/libxmlquery.i deleted file mode 100644 index 67c3466..0000000 --- a/bindings/python/libxmlquery.i +++ /dev/null @@ -1,51 +0,0 @@ - -%module libxmlquery -%{ -/* Put headers and other declarations here */ -#include -#include - -extern dom_node* internal_parse_xml_file(char* filename); -extern char* node_to_xml_string(dom_node* root); -extern int list_size(struct generic_list_s* l); -extern struct generic_list_s* query(char* q, dom_node*); -extern dom_node* get_dom_node_at(struct generic_list_s* l, int p); -%} - -extern void set_namespace(dom_node* node, char* namespace); -extern void set_name(dom_node* node, char* name); -extern void set_value(dom_node* node, char* value); -extern void set_parent(dom_node* node, dom_node* parent); - -extern char* get_namespace(dom_node* node); -extern char* get_name(dom_node* node); -extern char* get_value(dom_node* node); - -extern void prepend_child(dom_node* parent, dom_node* child); -extern void append_child(dom_node* parent, dom_node* child); -extern void append_children(dom_node* parent, struct generic_list_s* children); -extern void add_attribute(dom_node* node, dom_node* attribute); - -extern dom_node* new_element_node(char* name); -extern dom_node* new_text_node(char* text); -extern dom_node* new_attribute(char* name, char* value); -extern dom_node* new_cdata(char* cdata_text); - -extern dom_node* get_child_at(dom_node* parent, int index); -extern struct generic_list_s* get_children(dom_node* node); -extern dom_node* get_attribute_by_name(dom_node* node, char* attr_name); - -extern dom_node* delete_attribute(dom_node* node, char* name); - -//query_runner -extern struct generic_list_s* query(char* q, dom_node*); - -//helpers -extern dom_node* internal_parse_xml_file(char* filename); -extern char* node_to_xml_string(dom_node* root); -extern int list_size(struct generic_list_s* l); -extern dom_node* get_dom_node_at(struct generic_list_s* l, int p); - -//stack.h -extern void remove_element(struct generic_list_s* l, void* obj); - diff --git a/bindings/python/setup.py b/bindings/python/setup.py deleted file mode 100644 index 5074bc8..0000000 --- a/bindings/python/setup.py +++ /dev/null @@ -1,12 +0,0 @@ -from distutils.core import setup -from distutils.extension import Extension - -setup(name='xmlquery', - version='0.9alpha', - py_modules=['xmlquery', 'libxmlquery', 'html2xml'], - ext_modules=[Extension('_libxmlquery', - ['libxmlquery_wrap.c', 'helpers.c'], - libraries=['xmlquery'])], - scripts=['html2xml'], - ) - diff --git a/bindings/python/test.py b/bindings/python/test.py deleted file mode 100644 index 9162d0a..0000000 --- a/bindings/python/test.py +++ /dev/null @@ -1,9 +0,0 @@ -import xmlquery - -xml = xmlquery.parse_xml("") -c = xml.query("*") -#c[1].name = "banana" - -for n in c: - print n.name - diff --git a/bindings/python/xmlquery.py b/bindings/python/xmlquery.py deleted file mode 100644 index e5eef4a..0000000 --- a/bindings/python/xmlquery.py +++ /dev/null @@ -1,145 +0,0 @@ -import libxmlquery as lxq -import collections - -def parse_xml(string): - if not isinstance(string, str) and not isinstance(string, unicode): raise TypeError - return NodeWrapper(lxq.internal_parse_xml_file(string)) - - -class NodeList: - def __init__(self, listptr): - self._list = listptr - - def __len__(self): - return lxq.list_size(self._list) - - def get_attribute(attr): - return map(lambda x: x.attributes[key], self) - - def __getitem__(self, key): - if isinstance(key, int): - if 0 <= key < len(self): return NodeWrapper(lxq.get_dom_node_at(self._list, key)) - elif -len(self) <= key < 0: return NodeWrapper(lxq.get_dom_node_at(self._list, len(self) + key)) - else: raise IndexError - elif isinstance(key, slice): - if key.start == None: start = 0 - if key.stop == None: stop = len(self) - if key.step == None: step = 1; - if key.step == 0: raise ValueError("Step value cannot be 0") - return lxq.slice_list(self._list, start, stop, step) - else: raise TypeError - - def __delitem__(self, key): - if not isinstance(key, int): - raise TypeError - lxq.remove_element(self._list, self[key]._node) - - def __contains__(self, item): - if not isinstance(item, Node): return False - return not lxq.get_element_pos(self._list, item._node) == -1 - -class Node: - def __init__(self, name, namespace=None): - self._node = lxq.new_element_node(name) - self._python_owner = True - if isinstance(namespace, str): - lxq.set_namespace(self._node, namespace) - - def query(self, q): - if not isinstance(q, str): raise TypeError - if not q or q[0] != "@": q = "@" + q - return NodeList(lxq.query(q, self._node)) - - def queryone(self, q): - r = self.query(q) - if(len(r) > 0): - return r[0] - else: - return None - - def __getattr__(self, name): - if name in self.__dict__: return self.__dict__[name] - elif name == 'name': return lxq.get_name(self._node) - elif name == 'namespace': return lxq.get_namespace(self._node) - elif name == 'children': return NodeList(lxq.get_children(self._node)) - elif name == 'attributes': return AttributeMap(self._node) - elif name == 'text': return str(reduce(lambda x, y: str(x)+ '\n' +str(y), self.__getattr__("children"))) - else: raise AttributeError - - def __setattr__(self, name, value): - if name == 'name': lxq.set_name(self._node, value) - elif name == 'namespace': lxq.set_namespace(self._node, value) - elif name == 'children': raise AttributeError("Attribute 'children' is read only") - elif name == 'attributes': raise AttributeError("Attribute 'attributes' is read only") - else: self.__dict__[name] = value - - def __str__(self): - return lxq.node_to_xml_string(self._node)[:-1] - - def __repr__(self): - name = self.name - if self.namespace: name = self.namespace + self.name - return "<" + name + " .../>" - - def __del__(self): - if self._python_owner: - lxq.destroy_dom_node(self._node) - self._node = None - - def append_child(self, child): - if isinstance(child, Node): - lxq.append_child(self._node, child._node) - else: raise TypeError - - -class NodeWrapper(Node): - def __init__(self, node_ptr): - self._node = node_ptr - self._python_owner = False - - -class AttributeMap: - def __init__(self, nodeptr): - self._node = nodeptr - - def __contains__(self, item): - if not isinstance(item, str): return False - return not lxq.get_attribute_by_name(self._node, item) == None - - def __getitem__(self, name): - if not isinstance(name, str): raise TypeError - r = lxq.get_attribute_by_name(self._node, name) - if r: return lxq.get_value(r) - else: raise KeyError - - def __setitem__(self, name, value): - if not (isinstance(name, str) and isinstance(value, str)): - raise TypeError - attr = lxq.new_attribute(name, value) - lxq.add_attribute(self._node, attr) - - def __delitem__(self, name): - if not isinstance(name, str): - raise TypeError - lxq.delete_attribute(self._node, name) - -#class Attribute: -# def __init__(self, name, value): -# self._node = lxq.new_attribute(name, value) -# self._python_owner = True -# -# def __getattr__(self, name): -# if name == 'name': return lxq.get_name(self._node) -# elif name == 'value': return lxq.get_value(self._node) -# else: raise AttributeError -# -# def __setattr__(self, name, value) -# if name == 'name': lxq.set_name(self._node, value) -# elif name == 'value': lxq.set_value(self._node, value) -# else: raise AttributeError -# -# def __del__(self): -# if self._python_owner: -# lxq.destroy_dom_node(self._node) -# self._node = None - diff --git a/data_structures/Makefile b/data_structures/Makefile deleted file mode 100644 index a85936d..0000000 --- a/data_structures/Makefile +++ /dev/null @@ -1,21 +0,0 @@ -include ../Makefile.inc - - -OBJS = rbtree.o stack.o btree.o bitbuffer.o byte_buffer.o - -all: $(OBJS) - -rbtree.o: ../include/rbtree.h rbtree.c - $(CC) $(CFLAGS) -c rbtree.c -stack.o: ../include/stack.h stack.c - $(CC) $(CFLAGS) -c stack.c -btree.o: ../include/btree.h btree.c - $(CC) $(CFLAGS) -c btree.c -bitbuffer.o: ../include/bitbuffer.h bitbuffer.c - $(CC) $(CFLAGS) -c bitbuffer.c -byte_buffer.o: ../include/byte_buffer.h byte_buffer.c - $(CC) $(CFLAGS) -c byte_buffer.c - -clean: - rm -rf $(OBJS) *~ *.out - diff --git a/data_structures/bitbuffer.c b/data_structures/bitbuffer.c deleted file mode 100644 index 3da95c3..0000000 --- a/data_structures/bitbuffer.c +++ /dev/null @@ -1,137 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include "../include/macros.h" -#include "../include/bitbuffer.h" - - -bitbuffer* new_bitbuffer(int byte_size){ - bitbuffer* r = alloc(bitbuffer, 1); - r->buffer = alloc(char, byte_size); - memset(r->buffer, 0, byte_size); - r->capacity = byte_size; - r->size = 0; - return r; -} - -bitbuffer* duplicate_bitbuffer(bitbuffer* bb){ - bitbuffer* r = new_bitbuffer(bb->capacity); - r->size = bb->size; - - //memcpy(r->buffer, bb->buffer, (r->size / 8)+1); - memcpy(r->buffer, bb->buffer, r->capacity); - return r; -} - -void append_bitbuffer_to_bitbuffer(const bitbuffer* from, bitbuffer* to){ - int i; - for(i = 0; i < from->size; i++){ - append_bit_to_buffer(get_bit_from_buffer(from, i), to); - } -} - -void print_bitbuffer(bitbuffer* bb){ - int j; - - for(j = 0; j < bb->size; j++){ - printf("%d", get_bit_from_buffer(bb, j)); - } - printf("\n"); -} - -void append_bit_to_buffer(char c, bitbuffer* bb){ - char v = c & (unsigned char) 0x01; - int bit_offset = bb->size % 8; - char* cur = bb->buffer + (bb->size / 8); - //char* cur = bb->buffer + (bb->size / 8); - - //for(i = 0; i < bit_offset; i++){ v <<= 1; } - - *cur |= (v << bit_offset); - - bb->size += 1; - if(bit_offset == 7){ - if(cur - bb->buffer >= bb->capacity){ - bb->buffer = (char*)realloc(bb->buffer, bb->capacity*2); - memset(bb->buffer + (bb->size/8), 0, bb->capacity*2 - (bb->size/8)); - bb->capacity *= 2; - } - } - - -} - -void append_bits_to_buffer(char c, int bit_count, bitbuffer* bb){ - int i; - for(i = bit_count; i > 0; i--){ - char v = c >> (i-1); - append_bit_to_buffer(v, bb); - } - -} - -char get_bit_from_buffer(const bitbuffer* bb, int offset){ - if(offset < 0 || offset > bb->size){ - exit(-1); - } - char* cur = bb->buffer + (offset / 8); - int bit_offset = offset % 8; - - return (*cur >> bit_offset) & 1; -} - -char get_byte_from_buffer(const bitbuffer* bb, int offset){ - char r = 0; - int i; - - for(i = 0; i < 7; i++){ - r |= get_bit_from_buffer(bb, offset+i); - r <<= 1; - } - r |= get_bit_from_buffer(bb, offset+i); - return r; -} - - -/*int main(){ - bitbuffer* bb = new_bitbuffer(1); - int i, seed = 12244543; - char c; - for(i = 0; i < 25; i++){ - c = (char) ((seed >> i) & 1); - append_bit_to_buffer(c, bb); - printf("%d", c); - } - printf("\n"); - - for(i = 0; i < bb->size; i++){ - printf("%d", get_bit_from_buffer(bb, i)); - } - printf("\n"); - - return 0; -}*/ - diff --git a/data_structures/btree.c b/data_structures/btree.c deleted file mode 100644 index e7c351d..0000000 --- a/data_structures/btree.c +++ /dev/null @@ -1,35 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include "../include/btree.h" - -btree* new_btree(){ - btree* r = alloc(btree, 1); - r->value = NULL; - r->left = NULL; - r->right = NULL; - - return r; -} - diff --git a/data_structures/byte_buffer.c b/data_structures/byte_buffer.c deleted file mode 100644 index 9ca2018..0000000 --- a/data_structures/byte_buffer.c +++ /dev/null @@ -1,69 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include "../include/byte_buffer.h" -#include "../include/macros.h" - -void destroy_byte_buffer(byte_buffer* bb){ - if(bb == NULL) return; - - free(bb->buffer); - free(bb); -} - -byte_buffer* new_byte_buffer(int initial){ - byte_buffer* b = alloc(byte_buffer, 1); - b->buffer = alloc(char, initial); - b->size = 0; - b->capacity = initial; - - return b; -} - -void append_string_to_buffer(const char* s, byte_buffer* b){ - int strl = strlen(s); - append_bytes_to_buffer(s, b, strl); -} - -void append_bytes_to_buffer(const char* bytes, byte_buffer* b, size_t size){ - if(b->size + size > b->capacity){ - b->buffer = (char*)realloc(b->buffer, (b->size+size)*2); - b->capacity = (b->size+size)*2; - } - - memcpy(b->buffer+b->size, bytes, size); - b->size += size; -} - -void append_buffer_to_buffer(byte_buffer* b2, byte_buffer* b){ - if(b->size + b2->size > b->capacity){ - b->buffer = (char*)realloc(b->buffer, (b->size+b2->size)*2); - b->capacity = (b->size+b2->size)*2; - } - - memcpy(b->buffer+b->size, b2->buffer, b2->size); - b->size += b2->size; -} diff --git a/data_structures/datastructures.html b/data_structures/datastructures.html new file mode 100644 index 0000000..26573db --- /dev/null +++ b/data_structures/datastructures.html @@ -0,0 +1,970 @@ + + + + + + + + Data Structures — libxmlquery v0.1.4 documentation + + + + + + + + + + + +
+

Navigation

+ +
+ +
+
+
+
+ +
+

Data Structures

+
+

Generic List

+

Generic array list optimized for fast access. This structure is defined in stack.h and implemented in stack.c. It can act as a stack, queue or random access list. Although they seem different, the datastructure is the same and every function of one type can be used in another. This means that you can have a random access list and start poping out elements as though it was a stack.

+
+
+struct generic_list_s
+
+ +
+
+list
+
+ +

This structure defines the random access list. Its structure definition is:

+
typedef struct generic_list_s{
+  struct list_bucket** array;
+  int32_t start;
+  int32_t count;
+  int32_t capacity;
+} list;
+
+
+

As you can see this is just a list backed up by an array of struct list_bucket. These buckets are defined as follows:

+
+
+struct list_bucket
+
+ +
struct list_bucket
+{
+  int16_t type;
+  void* element;
+};
+
+
+

Finally, notice that the stack and queue type are just typedefs of list.

+
typedef struct generic_list_s stack;
+typedef struct generic_list_s queue;
+
+
+

The next sections will show how to use these types.

+
+

Function description

+
+
+uint8_t generic_list_is_empty(struct generic_list_s* l)
+

l The generic list to check if is empty.

+

This function checks if the generic list is empty. It return an integer bigger than 0 if true, or 0 if false.

+
+ +
+
+int32_t generic_list_get_count(struct generic_list_s* l)
+

l The generic list to obtain the count of elements.

+

This function return the number of elements in the generic list.

+
+ +
+
+struct generic_list_s *new_generic_list(int32_t initial)
+

initial Initial capcity for a generic list.

+

This function returns a generic list with a given initial capacity. Capacity dictates how much space the list will take. You don’t need to +worry about reallocation, but consider using small values for capacity when you know that the list will not grow that much.

+
+ +
+
+stack* new_stack(int32_t initial)
+

initial Initial capcity for a stack.

+

This function is just an alias for new_generic_list().

+
+ +
+
+queue* new_queue(int32_t initial)
+

initial Initial capcity for a queue.

+

This function is just an alias for new_generic_list().

+
+ +
+
+void* set_element_with_type_at(list *l, void* obj, int16_t type, int32_t pos)
+

l List where to set the element.

+

obj New element to store in the list.

+

type The type of the new element.

+

pos The position of the element to be set.

+

This function sets an already exiting element to a new one. A pointer to the old one is returned so the user can free the space used by it.

+
+ +
+
+void* set_element_at(list *l, void* obj, int32_t pos)
+

l List where to set the element.

+

obj New element to store in the list.

+

pos The position of the element to be set.

+

This function does exactly the same as set_element_with_type_at(), but without the type feature.

+
+ +
+
+void insert_element_with_type_at(list* l, void* obj, int16_t type, int32_t pos)
+

l List where to insert the element.

+

obj New element to store in the list.

+

type The type of the new element.

+

pos The position of the element to be set.

+

This function inserts an element at a given position with a given type. The list will be resized if necessary.

+
+ +
+
+void insert_element_at(list* l, void* obj, int32_t pos)
+

l List where to insert the element.

+

obj New element to store in the list.

+

pos The position of the element to be set.

+

This function does exactly the same thing as insert_element_with_type_at(), but without the type feature.

+
+ +
+
+void sorted_insert_element_with_type(list* l, void* obj, int16_t type, int(*compare)(void* o1, int16_t type1, void* o2, int16_t type2))
+

l List where to insert the element.

+

obj New element to store in the list.

+

type The type of the new element.

+

compare A function pointer to a function that compares elements in the list.

+

This function inserts an element into a list in sorted order, according to the function pointer passed as an argument.

+
+ +
+
+void append_element_with_type(list* l, void* obj, int16_t type)
+

l List where to append the element.

+

obj New element to store in the list.

+

type The type of the new element.

+

This function inserts an element at the end of the list.

+
+ +
+
+void prepend_element_with_type(list* l, void* obj, int16_t type)
+

l List where to prepend the element.

+

obj New element to store in the list.

+

type The type of the new element.

+

This function inserts an element at the beginning of the list.

+
+ +
+
+void add_element_with_type(list* l, void* obj, int16_t type)
+

l List where to add the element.

+

obj New element to store in the list.

+

type The type of the new element.

+

This function adds an element to a list. It differs from prepend_element() and append_element() in the sense that the user doesn’t need to know +Where the element will be added.

+
+ +
+
+void add_element(list* l, void* obj)
+

l List where to add the element.

+

obj New element to store in the list.

+

This function is exactly the same as add_element_with_type(), but without the type feature.

+
+ +
+
+void* get_element_at(const list* l, int32_t pos)
+

l List from where to get the element.

+

pos The element’s position.

+

This function returns the element stored at the given position.

+
+ +
+
+void* get_element_with_type_at(const list* l, int32_t pos, int16_t* type)
+

l List from where to get the element.

+

pos The element’s position.

+

type An address to store the elements type.

+

This function does the same as get_element_at(), but it also returns the element’s type. This is stored in a location passed as the third argument +to this function.

+
+ +
+
+int get_element_pos(const list* l, void* el)
+

l List from where to get the element’s position.

+

el The element to look for in the list.

+

This function returns the position of the element passed as an argument. If no element is found, then -1 is returned.

+
+ +
+
+int32_t remove_element(list *l, void* obj)
+

l List from where to remove the element.

+

obj The element to be removed.

+

This function removes the first occurrence of a given element from a list. If the element doesn’t exist then nothing will happen.

+
+ +
+
+int32_t remove_all(list *l, void* obj)
+

l List from where to remove the element.

+

obj The element to be removed.

+

This function removes all occurrences of a given element from a list. If no element is found then nothing will happen.

+
+ +
+
+void* remove_element_at(list* l, int32_t pos)
+

l List from where to remove the element.

+

pos Position of the element to be removed.

+

This function removes the element at a given position from a list.

+
+ +
+
+void enqueue_with_type(queue* q, void* obj, int16_t type)
+

q Queue where to enqueue the element.

+

obj Element to enqueue.

+

type The type of the element being enqueued.

+

This function enqueues an element with a given type in a given queue.

+
+ +
+
+void enqueue(queue* q, void* obj)
+

q Queue where to enqueue the element.

+

obj Element to enqueue.

+

This function is the same as enqueue_with_type(), but without the type feature.

+
+ +
+
+void* dequeue(queue* q)
+

q Queue from where to dequeue an element.

+

This function dequeues an element from a given queue. If no element is present, then NULL is returned.

+
+ +
+
+void push_stack_type(stack* s, void* obj, int16_t type)
+

s Stack where to push the element.

+

obj Element to push onto the stack.

+

type The type of the element being push.

+

This function pushes an element with a given type onto a given stack.

+
+ +
+
+void push_stack(stack* s, void* obj)
+

s Stack where to push the element.

+

obj Element to push onto the stack.

+

This function is the same as push_stack_type(), but without the type feature.

+
+ +
+
+void* pop_stack(stack* s)
+

s Stack from where to pop an element.

+

This function pops an element from a given stack. If no element is present, NULL is returned.

+
+ +
+
+list* remove_duplicates(list* l)
+

l List from where to remove duplicate elements.

+

This function removes duplicate values based on their memory address.

+
+ +
+
+int16_t peek_element_type_at(list* l, int32_t pos)
+

l List from where to peek an element’s type.

+

pos The element’s position in the list.

+

This function lets you see which type the element at a given position has. If no element is in that position the program will exit.

+
+ +
+
+int16_t peek_stack_type(stack *s)
+

s Stack from where to peek the element’s type.

+

This function is the same as peek_element_type_at(), but it applies only to stacks. This means that it will only check the element at the head of the stack.

+
+ +
+
+int16_t peek_queue_type(queue *s)
+

s Queue from where to peek the element’s type.

+

This function is the same as peek_stack_type(). However, it applies only to queues.

+
+ +
+
+struct generic_list_s *merge_lists(struct generic_list_s *l1, struct generic_list_s *l2)
+

l1 Any list.

+

l2 Any list.

+

This function merges two list onto a single one. The list l2 will be append to l1. Beware that the input lists will be destroyed. The merged list is returned. If +both lists are NULL, then NULL is returned.

+
+ +
+
+struct generic_list_s *duplicate_generic_list(const struct generic_list_s*)
+

s List to be duplicated.

+

This function allocates and fills a new list with the same values as the given list. Only the buckets are duplicated, the elements on the list stay exactly the same.

+
+ +
+
+void destroy_generic_list(struct generic_list_s *s)
+

s List to be destroyed

+

This function destroys a given list. Only the buckets get destroyed, the elements must be detroyed by the user.

+

Example:

+
#include <stdlib.h>
+#include <stdio.h>
+#include "stack.h"
+
+int main(){
+   list* l = new_generic_list(2);
+   int *a, *b;
+
+   a = (int*) malloc(sizeof(int));
+   b = (int*) malloc(sizeof(int));
+   if(!a || !b){
+     printf("malloc failed\n");
+     return -1;
+   }
+
+   *a = 9;
+   *b = 7;
+
+   append_element(l, a, 0);
+   append_element(l, b, 0);
+
+   generic_list_iterator* it = new_generic_list_iterator(l);
+   while(generic_list_iterator_has_next(it)){
+     int *c = (int*) generic_list_iterator_next(it);
+     free(c);
+   }
+   destroy_generic_list_iterator(it);
+
+   destroy_generic_list(l);
+
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where stack.h is kept>
+
+
+
+ +
+
+generic_list_iterator* new_generic_list_iterator(struct generic_list_s* s)
+

s List to be iterated.

+

This function creates an iterator for the given list.

+
+ +
+
+uint8_t generic_list_iterator_has_next(generic_list_iterator* i)
+

i A list iterator.

+

This function checks if there are elements still to be iterated. If not 0 is returned, otherwise a value different from 0 is returned.

+
+ +
+
+void* generic_list_iterator_next(generic_list_iterator* i)
+

i A list iterator

+

This function returns an element from the list and advances the iterator to the next position.

+
+ +
+
+void destroy_generic_list_iterator(generic_list_iterator* i)
+

i A list iterator

+

This function frees a list iterator.

+
+ +
+
+
+

Generic Red Black Tree

+

The file rbtree.c contains the source code for a generic red black tree. This data structure is capable of storing any kind of data and its defined in rbtree.h as:

+
+
+tree_root
+
+ +
+
+struct sroot
+
+ +
typedef struct sroot{
+   struct stree_node* root;
+   void* (*key)(struct stree_node* node);
+   int64_t (*compare)(void* keyA, void* keyB);
+}tree_root;
+
+
+

There are two things to notice here. First, this is only the root of the tree and points to the first tree_node of the rbtree. Second, it contains two function pointers. The first points to a function, which receives a tree_node and should return a pointer to that node’s key. The second is a pointer to a compare function, which compares two keys and should return:

+
    +
  • A negative integer if the first key is smaller than the second.
    • +
  • 0 if the keys are the same.
    • +
  • A positive integer if the first key is bigger than the second.
    • +
+

The compare function must be:

+
    +
  • Reflexive: Given an object a. compare(a, a) should always return 0.
    • +
  • Symetric: Given two identical objects a and b, if compare(a,b) returns 0, then compare(b,a) must return 0.
    • +
  • Transitive: Given three objects a, b, c. If compare(a,b) returns 0, and compare(b,c) returns 0, then compare(a,c) must return 0.
    • +
  • Consistent: Multiple invocations of compare on the same objects in the same other, must return always the same value.
    • +
+

These properties should hold even if objects aren’t equal.

+

The compare and key function pointers must be provided by the user. Why do we need these pointers? Because the data stored in the rbtree can be anything, but we still need to know how to sort it. Nevertheless, if you wish to use this data structure as a container and don’t care how things are sorted, you can always use the method new_simple_rbtree().

+

Each node in an rbtree is called a tree_node and is defined in rbtree.h as:

+
+
+tree_node
+
+ +
+
+struct stree_node
+
+ +
typedef struct stree_node{
+   void* node;
+
+   uint8_t color;
+
+   struct stree_node* parent;
+   struct stree_node* left;
+   struct stree_node* right;
+ }tree_node;
+
+
+

There’s not much to say about this structure, the only thing relevant is the field node, which is used to store the actual data. The other fields are used to keep the rbtree intact.

+

Finally, there’s one more structure, which is defined in rbtree.h as:

+
+
+tree_iterator
+
+ +
+
+struct siterator
+
+ +
typedef struct siterator{
+   struct stree_node* current;
+}tree_iterator;
+
+
+

As the name implies, this structure is an iterator to the tree nodes.

+

As a final note, remember that we provide functions to destroy our structures, but the actual data must be destroyed by you. Do not use iterators for this purpose.

+
+

Function description

+
+
+tree_root* new_simple_rbtree()
+

This function creates an rbtree, which sorts the data acording to its memory pointer. This function should be used when you just want the rbtree to behave as a container, +but you still need O(log(n)) when accessing the data. Keep in mind that in order to retreive the stored data, you need to know it’s memory pointer.

+

The return value is a tree_root structure.

+
+ +
+
+tree_root* new_rbtree(void* (*key_function_pointer)(struct stree_node* node), int64_t (*compare_function_pointer)(void* keyA, void* keyB))
+

key_function_pointer A function that should return the address of the node’s key.

+

compare_function_pointer A function that should compare two keys and return values as described above. It receives the addresses of each key.

+

This function creates an rbtree, which sorts the data according to the given functions. The following example shows how to create an rbtree to store integers.

+

Example:

+
#include <stdio.h>
+#include "rbtree.h"
+
+void* key_address(tree_node* node){
+   return node->node;
+}
+
+int64_t compare_integers(void* keyA, void* keyB){
+   return *((int *) keyA) - *((int *) keyB);
+}
+
+int main(){
+   tree_root* rbtree = new_rbtree(& key_address, & compare_integers);
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where rbtree.h is kept>
+
+
+
+ +
+
+void* rb_tree_insert(tree_root* root, void* node)
+

root A pointer to the tree root where to insert the data represented by node.

+

node A pointer to the data, which will be inserted in the tree.

+

As the name implies this function inserts data into the rbtree. In the eventuality that the inserted value is already in the tree, it will be replaced and a pointer to the older value is returned. This is done so the user can free the space stored by that data. The following example shows how to insert integers in an rbtree.

+

Example:

+
#include <stdio.h>
+#include "rbtree.h"
+
+void* key_address(tree_node* node){
+   return node->node;
+}
+
+int64_t compare_integers(void* keyA, void* keyB){
+   return *((int *) keyA) - *((int *) keyB);
+}
+
+int main(){
+   tree_root* rbtree = new_rbtree(& key_address, & compare_integers);
+   int a = 9, b = 6, c = 10, d = 6;
+
+   rb_tree_insert(rbtree, &a);
+   rb_tree_insert(rbtree, &b);
+   rb_tree_insert(rbtree, &c);
+   int older = *((int *) rb_tree_insert(rbtree, &d));
+
+   //don't free older because it was "alloched" by the compiler.
+   printf("Found a %d already stored in the tree.\n", older);
+
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where rbtree.h is kept>
+
+
+
+ +
+
+void* rb_tree_delete(tree_root* root, void* key)
+

root A pointer to the tree root where to delete the data with key pointed by key.

+

key A pointer to the key of the node to be deleted.

+

This function deletes a node from an rbtree. If a node with a key equal to the one pointed by key does not exist, NULL will be return. However, if such a node is found, then a pointer to the data is returned. This is done so the user can free the space used by that data. The following example shows how to use this function on an rbtree that stores integers.

+

Example:

+
#include <stdio.h>
+#include "rbtree.h"
+
+void* key_address(tree_node* node){
+   return node->node;
+}
+
+int64_t compare_integers(void* keyA, void* keyB){
+   return *((int *) keyA) - *((int *) keyB);
+}
+
+int main(){
+   tree_root* rbtree = new_rbtree(& key_address, & compare_integers);
+   int a = 9, b = 6, c = 10;
+
+   rb_tree_insert(rbtree, &a);
+   rb_tree_insert(rbtree, &b);
+   rb_tree_insert(rbtree, &c);
+
+   int d = 10, stored;
+   stored = *((int *) rb_tree_delete(rbtree, &d));
+
+   //don't free stored because it was "alloched" by the compiler.
+   printf("Found a %d stored in the tree.\n", stored);
+
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where rbtree.h is kept>
+
+
+
+ +
+
+void* search_rbtree(tree_root root, void* key)
+

root The root of the tree where to perform the search.

+

key A pointer to the key of the node to be searched.

+

This function searchs an rbtree for a node. It returns NULL if nothing is found, or the data stored in the tree with a key equal to the value pointed by key. The following example shows how to search a tree that stores integers.

+

Example:

+
#include <stdio.h>
+#include "rbtree.h"
+
+void* key_address(tree_node* node){
+   return node->node;
+}
+
+int64_t compare_integers(void* keyA, void* keyB){
+   return *((int *) keyA) - *((int *) keyB);
+}
+
+int main(){
+   tree_root* rbtree = new_rbtree(& key_address, & compare_integers);
+   int a = 9, b = 6, c = 10;
+
+   rb_tree_insert(rbtree, &a);
+   rb_tree_insert(rbtree, &b);
+   rb_tree_insert(rbtree, &c);
+
+   int d = 10, stored;
+   stored = *((int *) search_rbtree(*rbtree, &d));
+
+   printf("Found a %d stored in the tree.\n", stored);
+
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where rbtree.h is kept>
+
+
+
+ +
+
+void destroy_rbtree(tree_root* root)
+

root A pointer to the tree to be destroyed.

+

This function destroys an rbtree. Note that this doesn’t free the user stored data. The following example shows how to use this in a tree that stores integers.

+

Example:

+
#include <stdio.h>
+#include "rbtree.h"
+
+void* key_address(tree_node* node){
+   return node->node;
+}
+
+int64_t compare_integers(void* keyA, void* keyB){
+   return *((int *) keyA) - *((int *) keyB);
+}
+
+int main(){
+   tree_root* rbtree = new_rbtree(& key_address, & compare_integers);
+   int a = 9, b = 6, c = 10;
+
+   rb_tree_insert(rbtree, &a);
+   rb_tree_insert(rbtree, &b);
+   rb_tree_insert(rbtree, &c);
+
+   destroy_rbtree(rbtree);
+   //We do not need to free the stored data because it was "alloched" by the compiler.
+
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where rbtree.h is kept>
+
+
+

Notice that running the command

+
valgrind --show-reachable=yes --leak-check=full ./test
+
+
+

produces the ouput:

+
==1188== HEAP SUMMARY:
+==1188==     in use at exit: 0 bytes in 0 blocks
+==1188==   total heap usage: 4 allocs, 4 frees, 72 bytes allocated
+==1188==
+==1188== All heap blocks were freed -- no leaks are possible
+
+
+

Which means that there are no memory leaks and you should always use this function to free the space stored by any rbtree you use.

+
+ +
+
+tree_iterator* new_tree_iterator(tree_root* root)
+

root A pointer to a tree root, which the iteration will be performed.

+

This function creates an iterator to an rbtree. Note that when you create an iterator, you should not insert or delete nodes from the tree before the iteration is over. Otherwise, the behaviour of the program will be unpredictable. It returns pointer to the created iterator. The following example shows how to create an iterator for a tree that stores integers.

+

Example:

+
#include <stdio.h>
+#include "rbtree.h"
+
+void* key_address(tree_node* node){
+   return node->node;
+}
+
+int64_t compare_integers(void* keyA, void* keyB){
+   return *((int *) keyA) - *((int *) keyB);
+}
+
+int main(){
+   tree_root* rbtree = new_rbtree(& key_address, & compare_integers);
+   int a = 9, b = 6, c = 10;
+
+   rb_tree_insert(rbtree, &a);
+   rb_tree_insert(rbtree, &b);
+   rb_tree_insert(rbtree, &c);
+
+   tree_iterator* it = new_tree_iterator(rbtree);
+
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where rbtree.h is kept>
+
+
+
+ +
+
+uint8_t tree_iterator_has_next(tree_iterator* it)
+

it A tree iterator created by calling new_tree_iterator().

+

This function returns 1 if there are more elements in the tree to be iterated. The following code shows a simple usage of this function.

+

Example:

+
#include <stdio.h>
+#include "rbtree.h"
+
+void* key_address(tree_node* node){
+   return node->node;
+}
+
+int64_t compare_integers(void* keyA, void* keyB){
+   return *((int *) keyA) - *((int *) keyB);
+}
+
+int main(){
+   tree_root* rbtree = new_rbtree(& key_address, & compare_integers);
+   int a = 9, b = 6, c = 10;
+
+   rb_tree_insert(rbtree, &a);
+   rb_tree_insert(rbtree, &b);
+   rb_tree_insert(rbtree, &c);
+
+   tree_iterator* it = new_tree_iterator(rbtree);
+
+   if(tree_iterator_has_next(it))
+     printf("There are still elements to be iterated.\n");
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where rbtree.h is kept>
+
+
+
+ +
+
+void* tree_iterator_next(tree_iterator* it)
+

it A tree iterator created by calling new_tree_iterator().

+

This functions returns the current element pointed by iterator it and advances to the next element in the iteration. This function should be used with tree_iterator_has_next(). Note that there is no guaranty about the order of iteration. The following code shows how to use it.

+

Example:

+
#include <stdio.h>
+#include "rbtree.h"
+
+void* key_address(tree_node* node){
+   return node->node;
+}
+
+int64_t compare_integers(void* keyA, void* keyB){
+   return *((int *) keyA) - *((int *) keyB);
+}
+
+int main(){
+   tree_root* rbtree = new_rbtree(& key_address, & compare_integers);
+   int a = 9, b = 6, c = 10;
+
+   rb_tree_insert(rbtree, &a);
+   rb_tree_insert(rbtree, &b);
+   rb_tree_insert(rbtree, &c);
+
+   tree_iterator* it = new_tree_iterator(rbtree);
+
+   while(tree_iterator_has_next(it)){
+     int d = *((int *) tree_iterator_next(it));
+     printf("%d\n", d);
+   }
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where rbtree.h is kept>
+
+
+
+ +
+
+void destroy_iterator(tree_iterator* it)
+

it A tree iterator created by calling new_tree_iterator().

+

This function frees the iterator pointed by it. The following example shows how to use it.

+

Example:

+
#include <stdio.h>
+#include "rbtree.h"
+
+void* key_address(tree_node* node){
+   return node->node;
+}
+
+int64_t compare_integers(void* keyA, void* keyB){
+   return *((int *) keyA) - *((int *) keyB);
+}
+
+int main(){
+   tree_root* rbtree = new_rbtree(& key_address, & compare_integers);
+   int a = 9, b = 6, c = 10;
+
+   rb_tree_insert(rbtree, &a);
+   rb_tree_insert(rbtree, &b);
+   rb_tree_insert(rbtree, &c);
+
+   tree_iterator* it = new_tree_iterator(rbtree);
+
+   while(tree_iterator_has_next(it)){
+     int d = *((int *) tree_iterator_next(it));
+     printf("%d\n", d);
+   }
+   destroy_iterator(it);
+
+   destroy_rbtree(rbtree);
+   return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where rbtree.h is kept>
+
+
+
valgrind --show-reachable=yes --leak-check=full ./test
+
+
+

produces the ouput:

+
==4432== HEAP SUMMARY:
+==4432==     in use at exit: 0 bytes in 0 blocks
+==4432==   total heap usage: 5 allocs, 5 frees, 76 bytes allocated
+==4432==
+==4432== All heap blocks were freed -- no leaks are possible
+
+
+

Which means that there are no memory leaks and you should always use this function when iterating.

+
+ +
+
+
+ + +
+
+
+
+
+

Table Of Contents

+ + +

Previous topic

+

Querying

+

Next topic

+

Special Macros

+

This Page

+ + + +
+
+
+
+
+

Navigation

+ +
+
+ © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
+ + \ No newline at end of file diff --git a/data_structures/rbtree.c b/data_structures/rbtree.c deleted file mode 100644 index 8ad748d..0000000 --- a/data_structures/rbtree.c +++ /dev/null @@ -1,426 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include -#include -#include "../include/rbtree.h" - - - -tree_node RBNIL = { - .node = NULL, - .color = BLACK, - .parent = &RBNIL, - .left = &RBNIL, - .right = &RBNIL -}; - -const void* ident(const struct stree_node* o){ - return o->node; -} - -int64_t compare_string(const void* keyA, const void* keyB){ - return strcmp((char*) keyA, (char*) keyB); -} - -static tree_node* new_rbtree_node(void* node){ - tree_node *z = alloc(tree_node, 1); - - z->node = node; - z->parent = &RBNIL; - z->left = &RBNIL; - z->right = &RBNIL; - z->color = RED; - return z; -} - -static const void* __pointer(const tree_node* node){ - return node->node; -} - -static int64_t __compare_by_pointer(const void* keyA, const void* keyB){ - return keyA - keyB; -} - -tree_root* new_simple_rbtree(){ - return new_rbtree(NULL, NULL); -} - -tree_root* new_rbtree(const void* (*key_function_pointer)(const struct stree_node* node), - int64_t (*compare_function_pointer)(const void* keyA, const void* keyB)){ - tree_root* r = alloc(tree_root, 1); - r->root = &RBNIL; - if(key_function_pointer == NULL && compare_function_pointer == NULL){ - r->key = &__pointer; - r->compare = &__compare_by_pointer; - }else{ - r->key = key_function_pointer; - r->compare = compare_function_pointer; - } - return r; -} - -/*WARNNING left_rbrotate assumes that rbrotate_on->right is NOT &RBNIL and that root->parent IS &RBNIL*/ -static void left_rbrotate(tree_root* root, tree_node* rbrotate_on){ - tree_node* y = rbrotate_on->right; - rbrotate_on->right = y->left; - - if(y->left != &RBNIL) - y->left->parent = rbrotate_on; - - y->parent = rbrotate_on->parent; - - if(rbrotate_on->parent == &RBNIL) - root->root = y; - else - if(rbrotate_on == rbrotate_on->parent->left) - rbrotate_on->parent->left = y; - else - rbrotate_on->parent->right = y; - - y->left = rbrotate_on; - rbrotate_on->parent = y; - return; -} - -/*WARNNING right_rbrotate assumes that rbrotate_on->left is NOT &RBNIL and that root->parent IS &RBNIL*/ -static void right_rbrotate(tree_root* root, tree_node* rbrotate_on){ - tree_node* y = rbrotate_on->left; - rbrotate_on->left = y->right; - - if(y->right != &RBNIL) - y->right->parent = rbrotate_on; - - y->parent = rbrotate_on->parent; - - if(rbrotate_on->parent == &RBNIL) - root->root = y; - else - if(rbrotate_on == rbrotate_on->parent->right) - rbrotate_on->parent->right = y; - else - rbrotate_on->parent->left = y; - - y->right = rbrotate_on; - rbrotate_on->parent = y; - return; -} - -static void rb_tree_insert_fixup(tree_root* root, tree_node* z){ - tree_node* y; - - while(z->parent->color == RED){ - - if(z->parent == z->parent->parent->left){ - y = z->parent->parent->right; - - if(y->color == RED){ - z->parent->color = BLACK; - y->color = BLACK; - z->parent->parent->color = RED; - z = z->parent->parent; - }else{ - if(z == z->parent->right){ - z = z->parent; - left_rbrotate(root, z); - } - z->parent->color = BLACK; - z->parent->parent->color = RED; - right_rbrotate(root, z->parent->parent); - } - - }else{ - y = z->parent->parent->left; - - if(y->color == RED){ - z->parent->color = BLACK; - y->color = BLACK; - z->parent->parent->color = RED; - z = z->parent->parent; - }else{ - if(z == z->parent->left){ - z = z->parent; - right_rbrotate(root, z); - } - z->parent->color = BLACK; - z->parent->parent->color = RED; - left_rbrotate(root, z->parent->parent); - } - } - } - - root->root->color = BLACK; -} - -void* rb_tree_insert(tree_root* root, void* node){ - tree_node *y = &RBNIL, *x = root->root; - - tree_node *z = new_rbtree_node(node); - - while(x != &RBNIL){ - y = x; - - if(root->compare(root->key(z), root->key(x)) == 0){ - void* holder = x->node; - free(z); - x->node = node; - return holder; - } - - if(root->compare(root->key(z), root->key(x)) < 0) - x = x->left; - else - x = x->right; - } - - z->parent = y; - - if(y == &RBNIL) - root->root = z; - else{ - if(root->compare(root->key(z),root->key(y)) < 0) - y->left = z; - else - y->right = z; - } - - rb_tree_insert_fixup(root, z); - return NULL; -} - -static tree_node* __search_rbtree_node(const tree_root* root, const void* key){ - tree_node *z = root->root; - - while(z != &RBNIL){ - if(root->compare(root->key(z), key) == 0) - return z; - - if(root->compare(root->key(z), key) < 0) - z = z->right; - else - z = z->left; - } - - return NULL; -} - -void* search_rbtree(const tree_root* root, const void* key){ - tree_node *z = __search_rbtree_node(root, key); - if(z) - return z->node; - return NULL; -} - -static void __destroy_rbtree(tree_node* root){ - tree_node *l, *r; - - if(root == &RBNIL) - return; - - l = root->left; - r = root->right; - - free(root); - - __destroy_rbtree(l); - __destroy_rbtree(r); -} - -void destroy_rbtree(tree_root* root){ - __destroy_rbtree(root->root); - free(root); -} - -static void __rb_transplant(tree_root* root, tree_node* u, tree_node* v){ - if(u->parent == &RBNIL) - root->root = v; - else - if(u == u->parent->left) - u->parent->left = v; - else - u->parent->right = v; - v->parent = u->parent; -} - -static tree_node* __rb_tree_minimum(tree_node* z){ - for(; z->left != &RBNIL; z = z->left); - return z; -} - -static void __rb_tree_delete_fixup(tree_root* root, tree_node* x){ - tree_node* w; - while( x != root->root && x->color == BLACK){ - if(x == x->parent->left){ - w = x->parent->right; - if(w->color == RED){ - w->color = BLACK; - x->parent->color = RED; - left_rbrotate(root, x->parent); - w = x->parent->right; - } - if(w->left->color == BLACK && w->right->color == BLACK){ - w->color = RED; - x = x->parent; - } - else{ - if(w->right->color == BLACK){ - w->left->color = BLACK; - w->color = RED; - right_rbrotate(root, w); - w = w->parent->right; - } - w->color = x->parent->color; - x->parent->color = BLACK; - w->right->color = BLACK; - left_rbrotate(root, x->parent); - x = root->root; - } - } - else{ - w = x->parent->left; - if(w->color == RED){ - w->color = BLACK; - x->parent->color = RED; - right_rbrotate(root, x->parent); - w = x->parent->left; - } - if(w->right->color == BLACK && w->left->color == BLACK){ - w->color = RED; - x = x->parent; - } - else{ - if(w->left->color == BLACK){ - w->right->color = BLACK; - w->color = RED; - left_rbrotate(root, w); - w = w->parent->left; - } - w->color = x->parent->color; - x->parent->color = BLACK; - w->left->color = BLACK; - right_rbrotate(root, x->parent); - x = root->root; - } - } - } - x->color = BLACK; - return; -} - -void* rb_tree_delete(tree_root* root, void* key){ - tree_node *y, *z, *x, *hold_node_to_delete; - uint8_t y_original_color; - void* node_to_return; - - hold_node_to_delete = y = z = __search_rbtree_node(root, key); - - if(y == NULL){ - log(W, "Trying to remove a node from tree that does not exist."); - return NULL; - } - - node_to_return = y->node; - - y_original_color = y->color; - if(z->left == &RBNIL){ - x = z->right; - __rb_transplant(root, z, z->right); - } - else - if(z->right == &RBNIL){ - x = z->left; - __rb_transplant(root, z, z->left); - } - else{ - y = __rb_tree_minimum(z->right); - y_original_color = y->color; - x = y->right; - if(y->parent == z) - x->parent = y; - else{ - __rb_transplant(root, y, y->right); - y->right = z->right; - y->right->parent = y; - } - __rb_transplant(root, z, y); - y->left = z->left; - y->left->parent = y; - y->color = z->color; - } - if(y_original_color == BLACK) - __rb_tree_delete_fixup(root, x); - - free(hold_node_to_delete); - return node_to_return; -} - -tree_iterator* new_tree_iterator(tree_root* root){ - tree_node* aux = root->root; - tree_iterator* it = alloc(tree_iterator, 1); - - while(aux->left != &RBNIL || aux->right != &RBNIL){ - while(aux->left != &RBNIL) - aux = aux->left; - - if(aux->right != &RBNIL) - aux = aux->right; - } - it->current = aux; - return it; -} - -uint8_t tree_iterator_has_next(tree_iterator* it){ - if(it->current != &RBNIL) - return 1; - return 0; -} - -void* tree_iterator_next(tree_iterator* it){ - tree_node* aux; - tree_node* tn = it->current; - - if(tn->parent != &RBNIL && - tn->parent->right != &RBNIL && - tn->parent->right != tn){ - aux = tn->parent->right; - while(aux->left != &RBNIL || aux->right != &RBNIL){ - while(aux->left != &RBNIL) - aux = aux->left; - - if(aux->right != &RBNIL) - aux = aux->right; - } - it->current = aux; - } - else - it->current = it->current->parent; - return tn->node; -} - -void destroy_iterator(tree_iterator* it){ - free(it); -} - diff --git a/data_structures/stack.c b/data_structures/stack.c deleted file mode 100644 index a6ac7c1..0000000 --- a/data_structures/stack.c +++ /dev/null @@ -1,614 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include "../include/macros.h" -#include "../include/stack.h" - -struct generic_list_s *_new_generic_list(int32_t initial, int8_t with_type) -{ - if(initial <= 0){ - log(F, "New generic list initial capacity must be greater than 0, %d given.", initial); - exit(1); - } - - struct generic_list_s* l = alloc(struct generic_list_s, 1); - l->start = 0; - l->count = 0; - l->capacity = initial; - l->with_type = with_type; - - l->array = alloc(void*, initial); - memset(l->array, 0, initial * sizeof(void**)); - return l; -} - -struct generic_list_s* new_generic_list(int32_t initial){ - return _new_generic_list(initial, 0); -} - -struct generic_list_s* new_generic_list_with_type(int32_t initial){ - return _new_generic_list(initial, 1); -} - -uint8_t generic_list_is_empty(struct generic_list_s* l){ - return l->count == 0; -} - -int32_t generic_list_get_count(struct generic_list_s* l){ - return l->count; -} - -/* -static void rebase_generic_list(list* l){ - if(l->start == 0){ return ; } - void** tmp; - //apparently this function is never called !!!! - //printf("[%d] + %d of %d\n", l->start, l->count, l->capacity); - - int cpy = l->count - l->capacity + l->start; - - if(cpy > 0){ - tmp = alloc(void*, cpy) - - memcpy(tmp, l->array, sizeof(void*)*cpy); - } - else{ cpy = 0; } - - //printf("mv %d + %d to 0\n", l->start, l->count - cpy); - memcpy(l->array, l->array + l->start, sizeof(void*)*(l->count - cpy)); - - if(cpy > 0){ - printf("mv + %d to %d\n", cpy, l->count - cpy); - memcpy(l->array + l->count - cpy, tmp, sizeof(void*)*cpy); - free(tmp); - } - - l->start = 0; -} -*/ - -static void refactor_generic_list(list* l){ - int32_t cpy; - - l->array = realloc(l->array, sizeof(void*) * l->capacity * 2); - if(l->array == NULL){ - log(F, "Realloc failed."); - exit(1); - } - - //number of items behind start (circular!) - cpy = l->count - l->capacity + l->start; - - if(cpy > 0){ - memcpy(l->array + l->capacity, l->array, cpy); - memset(l->array, 0, cpy); - } - - l->capacity *= 2; -} - -stack* new_stack(int32_t initial) -{ - return new_generic_list(initial); -} -queue* new_queue(int32_t initial) -{ - return new_generic_list(initial); -} - -void* set_element_with_type_at(list *l, void* obj, int16_t type, int32_t pos) -{ - void* r = NULL; - - if(!l->with_type && type != 0){ log(W, "Setting list element with type %d in a list without type, type will be lost.", type);} - - if(!(pos < l->count && pos >= 0)){ - log(E, "Tried to set element the a list at an invalid position, list-size: %d, position requested: %d.", l->count, pos); - exit(-1); - } - - - if(l->with_type){ - struct list_bucket *b = l->array[(l->start + pos) % l->capacity]; - if(b != NULL) { r = b->element; } - else { - b = alloc(struct list_bucket, 1); - l->array[(l->start + pos) % l->capacity] = b; - } - - b->type = type; - b->element = obj; - } - else{ - r = l->array[(l->start + pos) % l->capacity]; - l->array[(l->start + pos) % l->capacity] = obj; - } - - return r; -} - -void* set_element_at(list* l, void* obj, int32_t pos) -{ - return set_element_with_type_at(l, obj, -1, pos); -} - -void insert_element_with_type_at(list* l, void* obj, int16_t type, int32_t pos){ - int32_t i; - - if(!l->with_type && type != 0){ log(W, "Inserting element with type %d in a list without type, type will be lost.", type);} - - - if(!(pos <= l->count && pos >= 0)){ - log(E, "Tried to insert an element to list at invalid position, list-size: %d, position requested: %d.", l->count, pos); - exit(1); - } - - if(l->count >= l->capacity){ - refactor_generic_list(l); - } - - for(i = l->count - 1; i >= pos; i--){ - int32_t d = (l->start + i) % l->capacity; - int32_t dn = (d+1) % l->capacity; - l->array[dn] = l->array[d]; - } - - if(l->with_type){ - struct list_bucket* b = alloc(struct list_bucket, 1); - b->type = type; - b->element = obj; - l->array[(l->start + pos) % l->capacity] = b; - } - else{ - l->array[(l->start + pos) % l->capacity] = obj; - } - - l->count++; -} - -void insert_element_at(list* l, void* obj, int32_t pos){ - insert_element_with_type_at(l, obj, 0, pos); -} - -void sorted_insert_element_with_type(list* l, void* obj, int16_t type, int(*compare)(void* o1, int16_t type1, void* o2, int16_t type2)){ - int32_t i; - int16_t type_v; - - for(i = 0; i < l->count; i++){ - void* v = get_element_with_type_at(l, i, &type_v); - //printf("%d:%d <> %d:%d => %d\n", ((bc*)obj)->byte, ((bc*)obj)->count, ((bc*)v)->byte, ((bc*)v)->count, compare(obj, type, v, type_v)); - if(compare(obj, type, v, type_v) < 0) break; - } - - insert_element_with_type_at(l, obj, type, i); -} - -void append_element_with_type(list* l, void* obj, int16_t type) -{ - insert_element_with_type_at(l, obj, type, l->count); -} - -void prepend_element_with_type(list* l, void* obj, int16_t type) -{ - if(!l->with_type && type != 0){ log(W, "Inserting element with type %d in a list without type, type will be lost.", type);} - - if(l->count >= l->capacity){ refactor_generic_list(l); } - if(--l->start < 0){ l->start = l->capacity + l->start; }; - - if(l->with_type){ - struct list_bucket *b = alloc(struct list_bucket, 1); - l->array[l->start] = b; - b->type = type; - b->element = obj; - } - else{ - l->array[l->start] = obj; - } - - l->count++; -} - - -void add_element_with_type(list* l, void* obj, int16_t type) -{ - append_element_with_type(l, obj, type); -} - -void add_element(list* l, void* obj) -{ - append_element_with_type(l, obj, 0); -} - -int32_t _remove_element(list* l, void* obj) -{ - int32_t i, d; - - for(i = 0;i < l->count; i++) - { - d = (i + l->start) % l->capacity; - - if(get_element_at(l, i) == obj){ - if(l->with_type){ - free(l->array[d]); - } - l->array[d] = NULL; - - if(d == l->start) { l->start = ++l->start % l->capacity; l->count--; } - else if(i == l->count-1){ l->count--; } - - return i; - } - } - return -1; -} - -static void collapse_generic_list(list* l){ - int32_t i = 0, c = 0, d, e; - for(; i < l->count; i++){ - d = (l->start + i) % l->capacity; - if(l->array[d] == NULL){ - c++; - } - else if(c > 0){ - e = d-c; - if(e < 0) e = l->capacity - e; - l->array[e] = l->array[d]; - } - } - l->count -= c; -} - -int32_t remove_element(list* l, void* obj) -{ - int32_t p = _remove_element(l, obj); - if(p > 0 && p != l->count){ - collapse_generic_list(l); - } - return p; -} - -int32_t remove_all(list* l, void* obj) -{ - int32_t c = 0; - while(_remove_element(l, obj) == -1){ c++; } - if(c > 0){ collapse_generic_list(l); } - - return c; -} - -void* remove_element_at(list* l, int32_t pos) -{ - if(pos >= l->count){ log(W, "Trying to remove object on position (%d) greater than element count (%d).", pos, l->count); return NULL; } - int32_t d = (l->start + pos) % l->capacity; - - void* r; - - if(l->with_type){ - r = ((struct list_bucket*)l->array[d])->element; - - free(l->array[d]); - l->array[d] = NULL; - } - else{ - r = l->array[d]; - } - - if(pos == 0) { - l->start = ++l->start % l->capacity; - l->count--; - } - else if(pos == l->count-1){ - l->count--; - } - else{ - collapse_generic_list(l); - } - - return r; -} - -void* get_element_with_type_at(const list* l, int32_t pos, int16_t* type) -{ - if(pos < 0 || pos >= l->count){ log(W, "Trying to access object on position (%d) outside range (0 to %d).", pos, l->count-1); return NULL; } - - int32_t d = (l->start + pos) % l->capacity; - - void* r; - - if(l->with_type){ - r = ((struct list_bucket*)l->array[d])->element; - if(type != NULL){ *type = ((struct list_bucket*)l->array[d])->type; } - } - else{ - if(type != NULL){ log(W, "Accessing type on a list without type, returned type is undefined.");} - r = l->array[d]; - } - return r; -} - -void* get_element_at(const list* l, int32_t pos){ - return get_element_with_type_at(l, pos, NULL); -} - -int get_element_pos(const list* l, void* el){ - int i; - if(l == NULL) return -1; - - for(i = 0; i < l->count; i++){ - if(get_element_at(l, i) == el) return i; - } - - return -1; -} - -void enqueue_with_type(queue* q, void* obj, int16_t type) -{ - add_element_with_type(q, obj, type); -} - -void enqueue(queue* q, void* obj) -{ - add_element(q, obj); -} - -void* dequeue(queue* q) -{ - return remove_element_at(q, 0); -} - -void push_stack_type(stack* s, void* obj, int16_t type) -{ - add_element_with_type(s, obj, type); -} - -void push_stack(stack* s, void* obj) -{ - add_element(s, obj); -} - -void* pop_stack(stack* s) -{ - return remove_element_at(s, s->count-1); -} - -int16_t peek_element_type_at(list* l, int32_t pos) -{ - if(!l->with_type) { log(W, "Peeking type on a list without type, returned type is ALWAYS 0."); return 0; } - if(pos < 0 || pos >= l->count){ log(W, "Trying to access object on position (%d) outside range (0 to %d).", pos, l->count-1); exit(1); } - int d = (l->start + pos) % l->capacity; - return ((struct list_bucket*)l->array[d])->type; -} - -int16_t peek_stack_type(stack *s) -{ - if(!s->with_type) { log(W, "Peeking type on a stack without type, returned type is ALWAYS 0."); return 0; } - if(s == NULL) - { - log(F, "Stack is not initialized."); - exit(1); - } - - if(s->count == 0) - { - log(F, "Stack is empty."); - exit(1); - } - return ((struct list_bucket*)s->array[s->count-1])->type; -} - -int16_t peek_queue_type(queue *s) -{ - if(!s->with_type) { log(W, "Peeking type on a queue without type, returned type is ALWAYS 0."); return 0; } - if(s == NULL) - { - log(F, "Queue is not initialized."); - exit(1); - } - - if(s->count == 0) - { - log(F, "Queue is empty"); - exit(1); - } - return ((struct list_bucket*)s->array[s->start])->type; -} - -struct generic_list_s *merge_lists(struct generic_list_s *l1, struct generic_list_s *l2) -{ - if(!l2) return l1; - if(!l1) return l2; - - if(l1->with_type && !l2->with_type){ log(F, "List 1 has type information and list 2 does not, cannot merge."); exit(1); } - if(!l1->with_type && l2->with_type){ log(F, "List 2 has type information and list 1 does not, cannot merge."); exit(1); } - - if(l1->count == 0){ - destroy_generic_list(l1); - return l2; - } - else if(l2->count == 0){ - destroy_generic_list(l2); - return l1; - } - - int32_t i; - int32_t new_count = l1->count + l2->count; - - struct generic_list_s *r = new_generic_list(new_count); - - int32_t n_d = 0, d; - for(i = 0; i < l1->count; i++){ - d = (l1->start + i) % l1->capacity; - r->array[n_d++] = l1->array[d]; - } - - for(i = 0; i < l2->count; i++){ - d = (l2->start + i) % l2->capacity; - r->array[n_d++] = l2->array[d]; - } - r->count = l1->count + l2->count; - - //current merge_list implementation depends on the containers of the source lists - //therefor: - l1->count = 0; - l2->count = 0; - - //by placing count at 0 the destroy does not free those containers - destroy_generic_list(l1); - destroy_generic_list(l2); - return r; -} - -/*void __quicksort_generic_list_aux(struct list_bucket** arr, int start, int end) { - if (start < end) { - struct list_bucket* pivot = arr[end]; - int i = start; - int j = end; - while (i != j) { - if ((arr[i]->element) < (pivot->element)) { - i = i + 1; - } - else { - arr[j] = arr[i]; - arr[i] = arr[j-1]; - j = j - 1; - } - } - arr[j] = pivot; - __quicksort_generic_list_aux(arr, start, j-1); - __quicksort_generic_list_aux(arr, j+1, end); - } -} - -void __quicksort_generic_list(list* l) { - __quicksort_generic_list_aux(l->array, 0, l->count - 1); - } - -list* remove_duplicates(list* l){ - if(l == NULL) - return NULL; - if(l->count <= 1) - return l; - - int i; - list* r = new_generic_list(l->capacity); - rebase_generic_list(l); - __quicksort_generic_list(l); - add_element(r, get_element_at(l, 0)); - for(i = 1; i < l->count; i++){ - if(get_element_at(l, i-1) != get_element_at(l, i)){ - add_element(r, get_element_at(l, i)); - } - } - - destroy_generic_list(l); - return r; -}*/ - -list* duplicate_generic_list(const list *l){ - if(!l) return NULL; - list* new; - if(l->with_type){ - new = new_generic_list_with_type(l->capacity); - } - else{ - new = new_generic_list(l->capacity); - } - - int i; - int16_t type; - for(i = 0; i < l->count; i++) - if(l->with_type){ - insert_element_with_type_at(new, get_element_with_type_at(l, i, &type), type, i); - } - else{ - insert_element_at(new, get_element_at(l, i), i); - } - - return new; -} - - -list* exclude_list_from_list(const list* l1, const list* l2){ - if(l2 == NULL || l2->count == 0) return NULL; - if(l1 == NULL || l1->count == 0) return duplicate_generic_list(l2); - - int32_t i; - - list* r = new_generic_list(l2->capacity + l1->capacity); - - int32_t pos; - int16_t _type; - int16_t* type = (l2->with_type)? &_type : NULL; - - void* obj; - - for(i = 0; i < l2->count; i++){ - obj = get_element_with_type_at(l2, i, type); - pos = get_element_pos(l1, obj); - if(pos > 0) append_element_with_type(r, obj, (l2->with_type)? *type : 0); - } - - return r; -} - - -void destroy_generic_list(struct generic_list_s *s) -{ - int32_t i, d; - if(s == NULL) - return; - - if(s->with_type){ - for(i = 0; i < s->count; i++) - { - d = (s->start + i) % s->capacity; - free(s->array[d]); - } - } - - free(s->array); - free(s); -} - -generic_list_iterator* new_generic_list_iterator(struct generic_list_s* l){ - generic_list_iterator* i = alloc(generic_list_iterator, 1); - i->pos = 0; - i->list = l; - return i; -} - -uint8_t generic_list_iterator_has_next(generic_list_iterator* i){ - return (i->list == NULL)? 0 : (i->pos < i->list->count); -} - -void* generic_list_iterator_next(generic_list_iterator* i){ - return get_element_at(i->list, (i->pos)++); -} - -void destroy_generic_list_iterator(generic_list_iterator* i){ - free(i); -} - diff --git a/documentation/Makefile b/documentation/Makefile deleted file mode 100644 index b388161..0000000 --- a/documentation/Makefile +++ /dev/null @@ -1,138 +0,0 @@ -# Makefile for Sphinx documentation -# - -# You can set these variables from the command line. -SPHINXOPTS = -SPHINXBUILD = sphinx-build -PAPER = -BUILDDIR = _build - -# Internal variables. -PAPEROPT_a4 = -D latex_paper_size=a4 -PAPEROPT_letter = -D latex_paper_size=letter -ALLSPHINXOPTS = -d $(BUILDDIR)/doctrees $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) . - -.PHONY: help clean html dirhtml singlehtml pickle json htmlhelp qthelp devhelp epub latex latexpdf text man changes linkcheck doctest - -help: - @echo "Please use \`make ' where is one of" - @echo " html to make standalone HTML files" - @echo " dirhtml to make HTML files named index.html in directories" - @echo " singlehtml to make a single large HTML file" - @echo " pickle to make pickle files" - @echo " json to make JSON files" - @echo " htmlhelp to make HTML files and a HTML help project" - @echo " qthelp to make HTML files and a qthelp project" - @echo " devhelp to make HTML files and a Devhelp project" - @echo " epub to make an epub" - @echo " latex to make LaTeX files, you can set PAPER=a4 or PAPER=letter" - @echo " latexpdf to make LaTeX files and run them through pdflatex" - @echo " text to make text files" - @echo " man to make manual pages" - @echo " changes to make an overview of all changed/added/deprecated items" - @echo " linkcheck to check all external links for integrity" - @echo " doctest to run all doctests embedded in the documentation (if enabled)" - -clean: - -rm -rf $(BUILDDIR)/* - -html: - $(SPHINXBUILD) -b html $(ALLSPHINXOPTS) $(BUILDDIR)/html - @echo - @echo "Build finished. The HTML pages are in $(BUILDDIR)/html." - -gh_pages: html - mv $(BUILDDIR)/html/_static $(BUILDDIR)/html/lxq_static - mv $(BUILDDIR)/html/_sources $(BUILDDIR)/html/lxq_sources - find $(BUILDDIR)/html -type f | xargs sed -ri 's/"(\.\.\/)*_static/"\1lxq_static/' - find $(BUILDDIR)/html -type f | xargs sed -ri 's/"(\.\.\/)*_sources/"\1lxq_sources/' - ./commit.sh - -dirhtml: - $(SPHINXBUILD) -b dirhtml $(ALLSPHINXOPTS) $(BUILDDIR)/dirhtml - @echo - @echo "Build finished. The HTML pages are in $(BUILDDIR)/dirhtml." - -singlehtml: - $(SPHINXBUILD) -b singlehtml $(ALLSPHINXOPTS) $(BUILDDIR)/singlehtml - @echo - @echo "Build finished. The HTML page is in $(BUILDDIR)/singlehtml." - -pickle: - $(SPHINXBUILD) -b pickle $(ALLSPHINXOPTS) $(BUILDDIR)/pickle - @echo - @echo "Build finished; now you can process the pickle files." - -json: - $(SPHINXBUILD) -b json $(ALLSPHINXOPTS) $(BUILDDIR)/json - @echo - @echo "Build finished; now you can process the JSON files." - -htmlhelp: - $(SPHINXBUILD) -b htmlhelp $(ALLSPHINXOPTS) $(BUILDDIR)/htmlhelp - @echo - @echo "Build finished; now you can run HTML Help Workshop with the" \ - ".hhp project file in $(BUILDDIR)/htmlhelp." - -qthelp: - $(SPHINXBUILD) -b qthelp $(ALLSPHINXOPTS) $(BUILDDIR)/qthelp - @echo - @echo "Build finished; now you can run "qcollectiongenerator" with the" \ - ".qhcp project file in $(BUILDDIR)/qthelp, like this:" - @echo "# qcollectiongenerator $(BUILDDIR)/qthelp/libxmlquery.qhcp" - @echo "To view the help file:" - @echo "# assistant -collectionFile $(BUILDDIR)/qthelp/libxmlquery.qhc" - -devhelp: - $(SPHINXBUILD) -b devhelp $(ALLSPHINXOPTS) $(BUILDDIR)/devhelp - @echo - @echo "Build finished." - @echo "To view the help file:" - @echo "# mkdir -p $$HOME/.local/share/devhelp/libxmlquery" - @echo "# ln -s $(BUILDDIR)/devhelp $$HOME/.local/share/devhelp/libxmlquery" - @echo "# devhelp" - -epub: - $(SPHINXBUILD) -b epub $(ALLSPHINXOPTS) $(BUILDDIR)/epub - @echo - @echo "Build finished. The epub file is in $(BUILDDIR)/epub." - -latex: - $(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex - @echo - @echo "Build finished; the LaTeX files are in $(BUILDDIR)/latex." - @echo "Run \`make' in that directory to run these through (pdf)latex" \ - "(use \`make latexpdf' here to do that automatically)." - -latexpdf: - $(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex - @echo "Running LaTeX files through pdflatex..." - make -C $(BUILDDIR)/latex all-pdf - @echo "pdflatex finished; the PDF files are in $(BUILDDIR)/latex." - -text: - $(SPHINXBUILD) -b text $(ALLSPHINXOPTS) $(BUILDDIR)/text - @echo - @echo "Build finished. The text files are in $(BUILDDIR)/text." - -man: - $(SPHINXBUILD) -b man $(ALLSPHINXOPTS) $(BUILDDIR)/man - @echo - @echo "Build finished. The manual pages are in $(BUILDDIR)/man." - -changes: - $(SPHINXBUILD) -b changes $(ALLSPHINXOPTS) $(BUILDDIR)/changes - @echo - @echo "The overview file is in $(BUILDDIR)/changes." - -linkcheck: - $(SPHINXBUILD) -b linkcheck $(ALLSPHINXOPTS) $(BUILDDIR)/linkcheck - @echo - @echo "Link check complete; look for any errors in the above output " \ - "or in $(BUILDDIR)/linkcheck/output.txt." - -doctest: - $(SPHINXBUILD) -b doctest $(ALLSPHINXOPTS) $(BUILDDIR)/doctest - @echo "Testing of doctests in the sources finished, look at the " \ - "results in $(BUILDDIR)/doctest/output.txt." - diff --git a/documentation/_theme/nature/theme.conf b/documentation/_theme/nature/theme.conf deleted file mode 100644 index 1cc4004..0000000 --- a/documentation/_theme/nature/theme.conf +++ /dev/null @@ -1,4 +0,0 @@ -[theme] -inherit = basic -stylesheet = nature.css -pygments_style = tango diff --git a/documentation/commit.sh b/documentation/commit.sh deleted file mode 100755 index 3220f5d..0000000 --- a/documentation/commit.sh +++ /dev/null @@ -1,12 +0,0 @@ -#!/bin/bash - -BUILDDIR=_build - -git clone -b gh-pages git@github.com:nullable/libxmlquery.git /tmp/gh_pages -cp -r $BUILDDIR/html/* /tmp/gh_pages/ -pushd /tmp/gh_pages -git add . -git commit -m 'Auto-commit by make gh_pages target' -git push origin gh-pages:gh-pages -popd -rm -rf /tmp/gh_pages \ No newline at end of file diff --git a/documentation/conf.py b/documentation/conf.py deleted file mode 100644 index 03d0565..0000000 --- a/documentation/conf.py +++ /dev/null @@ -1,257 +0,0 @@ -# -*- coding: utf-8 -*- -# -# libxmlquery documentation build configuration file, created by -# sphinx-quickstart on Fri Nov 5 15:13:45 2010. -# -# This file is execfile()d with the current directory set to its containing dir. -# -# Note that not all possible configuration values are present in this -# autogenerated file. -# -# All configuration values have a default; values that are commented out -# serve to show the default. - -import sys, os - -# If extensions (or modules to document with autodoc) are in another directory, -# add these directories to sys.path here. If the directory is relative to the -# documentation root, use os.path.abspath to make it absolute, like shown here. -#sys.path.insert(0, os.path.abspath('.')) - -# -- General configuration ----------------------------------------------------- - -# If your documentation needs a minimal Sphinx version, state it here. -#needs_sphinx = '1.0' - -# Add any Sphinx extension module names here, as strings. They can be extensions -# coming with Sphinx (named 'sphinx.ext.*') or your custom ones. -extensions = ['sphinx.ext.autodoc', 'sphinx.ext.coverage', 'sphinx.ext.ifconfig'] - -# Add any paths that contain templates here, relative to this directory. -templates_path = ['_templates'] - -# The suffix of source filenames. -source_suffix = '.rst' - -# The encoding of source files. -#source_encoding = 'utf-8-sig' - -# The master toctree document. -master_doc = 'index' - -# General information about the project. -project = u'libxmlquery' -copyright = u'2010, Frederico Gonçalves, Vasco Fernandes' - -# The version info for the project you're documenting, acts as replacement for -# |version| and |release|, also used in various other places throughout the -# built documents. -# -# The short X.Y version. -version = '0.1' -# The full version, including alpha/beta/rc tags. -release = '0.1.4' - -# The language for content autogenerated by Sphinx. Refer to documentation -# for a list of supported languages. -#language = None - -# There are two options for replacing |today|: either, you set today to some -# non-false value, then it is used: -#today = '' -# Else, today_fmt is used as the format for a strftime call. -#today_fmt = '%B %d, %Y' - -# List of patterns, relative to source directory, that match files and -# directories to ignore when looking for source files. -exclude_patterns = ['_build'] - -# The reST default role (used for this markup: `text`) to use for all documents. -#default_role = None - -# If true, '()' will be appended to :func: etc. cross-reference text. -#add_function_parentheses = True - -# If true, the current module name will be prepended to all description -# unit titles (such as .. function::). -#add_module_names = True - -# If true, sectionauthor and moduleauthor directives will be shown in the -# output. They are ignored by default. -#show_authors = False - -# The name of the Pygments (syntax highlighting) style to use. -pygments_style = 'sphinx' - -# A list of ignored prefixes for module index sorting. -#modindex_common_prefix = [] - - -# -- Options for HTML output --------------------------------------------------- - -# The theme to use for HTML and HTML Help pages. See the documentation for -# a list of builtin themes. -html_theme = 'nature' - -# Theme options are theme-specific and customize the look and feel of a theme -# further. For a list of options available for each theme, see the -# documentation. -#html_theme_options = {} - -# Add any paths that contain custom themes here, relative to this directory. -html_theme_path = ['_theme'] - -# The name for this set of Sphinx documents. If None, it defaults to -# " v documentation". -#html_title = None - -# A shorter title for the navigation bar. Default is the same as html_title. -#html_short_title = None - -# The name of an image file (relative to this directory) to place at the top -# of the sidebar. -#html_logo = None - -# The name of an image file (within the static path) to use as favicon of the -# docs. This file should be a Windows icon file (.ico) being 16x16 or 32x32 -# pixels large. -#html_favicon = None - -# Add any paths that contain custom static files (such as style sheets) here, -# relative to this directory. They are copied after the builtin static files, -# so a file named "default.css" will overwrite the builtin "default.css". -html_static_path = ['_static'] - -# If not '', a 'Last updated on:' timestamp is inserted at every page bottom, -# using the given strftime format. -#html_last_updated_fmt = '%b %d, %Y' - -# If true, SmartyPants will be used to convert quotes and dashes to -# typographically correct entities. -#html_use_smartypants = True - -# Custom sidebar templates, maps document names to template names. -#html_sidebars = {} - -# Additional templates that should be rendered to pages, maps page names to -# template names. -#html_additional_pages = {} - -# If false, no module index is generated. -#html_domain_indices = True - -# If false, no index is generated. -#html_use_index = True - -# If true, the index is split into individual pages for each letter. -#html_split_index = False - -# If true, links to the reST sources are added to the pages. -#html_show_sourcelink = True - -# If true, "Created using Sphinx" is shown in the HTML footer. Default is True. -#html_show_sphinx = True - -# If true, "(C) Copyright ..." is shown in the HTML footer. Default is True. -#html_show_copyright = True - -# If true, an OpenSearch description file will be output, and all pages will -# contain a tag referring to it. The value of this option must be the -# base URL from which the finished HTML is served. -#html_use_opensearch = '' - -# This is the file name suffix for HTML files (e.g. ".xhtml"). -#html_file_suffix = None - -# Output file base name for HTML help builder. -htmlhelp_basename = 'libxmlquerydoc' - - -# -- Options for LaTeX output -------------------------------------------------- - -# The paper size ('letter' or 'a4'). -#latex_paper_size = 'letter' - -# The font size ('10pt', '11pt' or '12pt'). -#latex_font_size = '10pt' - -# Grouping the document tree into LaTeX files. List of tuples -# (source start file, target name, title, author, documentclass [howto/manual]). -latex_documents = [ - ('index', 'libxmlquery.tex', u'libxmlquery Documentation', - u'Frederico Gonçalves, Vasco Fernandes', 'manual'), -] - -# The name of an image file (relative to this directory) to place at the top of -# the title page. -#latex_logo = None - -# For "manual" documents, if this is true, then toplevel headings are parts, -# not chapters. -#latex_use_parts = False - -# If true, show page references after internal links. -#latex_show_pagerefs = False - -# If true, show URL addresses after external links. -#latex_show_urls = False - -# Additional stuff for the LaTeX preamble. -#latex_preamble = '' - -# Documents to append as an appendix to all manuals. -#latex_appendices = [] - -# If false, no module index is generated. -#latex_domain_indices = True - - -# -- Options for manual page output -------------------------------------------- - -# One entry per manual page. List of tuples -# (source start file, name, description, authors, manual section). -man_pages = [ - ('index', 'libxmlquery', u'libxmlquery Documentation', - [u'Frederico Gonçalves, Vasco Fernandes'], 1) -] - - -# -- Options for Epub output --------------------------------------------------- - -# Bibliographic Dublin Core info. -epub_title = u'libxmlquery' -epub_author = u'Frederico Gonçalves, Vasco Fernandes' -epub_publisher = u'Frederico Gonçalves, Vasco Fernandes' -epub_copyright = u'2010, Frederico Gonçalves, Vasco Fernandes' - -# The language of the text. It defaults to the language option -# or en if the language is not set. -#epub_language = '' - -# The scheme of the identifier. Typical schemes are ISBN or URL. -#epub_scheme = '' - -# The unique identifier of the text. This can be a ISBN number -# or the project homepage. -#epub_identifier = '' - -# A unique identification for the text. -#epub_uid = '' - -# HTML files that should be inserted before the pages created by sphinx. -# The format is a list of tuples containing the path and title. -#epub_pre_files = [] - -# HTML files shat should be inserted after the pages created by sphinx. -# The format is a list of tuples containing the path and title. -#epub_post_files = [] - -# A list of files that should not be packed into the epub file. -#epub_exclude_files = [] - -# The depth of the table of contents in toc.ncx. -#epub_tocdepth = 3 - -# Allow duplicate toc entries. -#epub_tocdup = True - diff --git a/dom.html b/dom.html new file mode 100644 index 0000000..8006d82 --- /dev/null +++ b/dom.html @@ -0,0 +1,510 @@ + + + + + + + + Document Object Model — libxmlquery v0.1.4 documentation + + + + + + + + + + + +
+

Navigation

+ +
+ +
+
+
+
+ +
+

Document Object Model

+
+

DOM

+

After the parsing of the xml is done, a DOM structure is created and +can be accessed through a global variable denominated lxq_document. +Bear in mind that this variable is dependent of the current parser. +In other words, if the parser module changes, then the variable name +may also change.

+

The DOM structure is a tree, where each node is an xml element. Since +the input xml has already been validated we know it has only one root +, so the document variable will point to a single node in the dom +tree, the root node (This can be accessed through document->root, but we really recommend the use of get_doc_root()).

+

The dom structure provides flexible and extendable xml document +handling. It has the capability to add, remove and modify elements in +the xml.

+
+

Data types

+
+
+dom_node
+
+ +
+
+struct snode
+
+ +

The structure definition for a dom node is in the file node.h.

+
typedef struct snode{
+ enum node_type type;
+ struct snode* parent;
+ union{
+    struct sroot* attributes;
+    char* value;
+ };
+
+ char* name;
+ char* namespace;
+
+ struct generic_list_s* children;
+}dom_node;
+
+
+

This structure is used to store any kind of entity in an xml file. It can be an element, attribute, cdata or text node. In order to control these different kind of entities, the dom_node has an enumerate field. This field is called node_type .

+
+
+node_type
+
+ +

This enum is defined as:

+
enum node_type {
+  ATTRIBUTE,
+  ELEMENT,
+  TEXT_NODE,
+  CDATA
+};
+
+
+

Each enum represents a different kind of xml entity.

+
+
+doc
+
+ +
+
+struct sdoc
+
+ +

Finally, a document is a structure that points to two dom nodes - The root of the dom tree and a list of xml declarations. Lets look at its definition.

+
+
::
+
+
typedef struct sdoc{
+
struct snode* root; +list* xml_declarations;
+
+

}doc;

+
+
+

Suppose we have the following xml file

+
<?xml version="1.0" ?>
+<x>
+  ...
+</x>
+
+
+

When this xml is parsed, a doc is created with the field xml_declaration pointing to a list that corresponds to ‘<?xml version=”1.0” ?>’ and the root field pointing to a tree that corresponds to the rest of the document.

+
+
+

Function description

+
+
+char* set_namespace(dom_node* node, char* namespace)
+

node The node whose namespace will be set.

+

namespace The namespace to set.

+

This function sets the namespace of the given node. If the node already contained a namespace, a pointer to it will be returned. Otherwise, NULL is returned.

+
+ +
+
+char* set_name(dom_node* node, char* name)
+

node The node whose name will be set.

+

name The name to set.

+

This function sets the name of the given node. If the node already contained a name, a pointer to it will be returned. Otherwise, NULL is returned.

+
+ +
+
+char* set_value(dom_node* node, char* value)
+

node The node whose value will be set.

+

value The value to set.

+

This function sets the value of the given node. If the node already contained a value, a pointer to it will be returned. Otherwise, NULL is returned.

+
+ +
+
+dom_node* set_doc_root(doc* document, struct snode* root)
+

doc The document whose root will be set.

+

root The root to set.

+

This function sets the root of the given document. If the document already contained a root, a pointer to it will be returned. Otherwise, NULL is returned.

+
+ +
+
+dom_node* set_xml_declarations(doc* document, list declarations)
+

doc The document whose xml declarations will be set.

+

declarations The xml declarations to set.

+

This function sets the xml declarations of the given document. If the document already contained xml declarations, a pointer to that list will be returned. Otherwise, NULL is returned.

+
+ +
+
+void set_parent(dom_node* node, dom_node* parent)
+

node The node whose parent will be set.

+

parent The parent to set.

+

This function sets the parent of the given node. If the node already contained a parent, a pointer to it will be returned. Otherwise, NULL is returned.

+
+ +
+
+char* get_namespace(dom_node* node)
+

node The node from which the namespace will be returned.

+

This functions returns the namespace of the given node, or NULL if the node doesn’t contain any.

+
+ +
+
+char* get_name(dom_node* node)
+

node The node from which the names will be returned.

+

This functions returns the names of the given node, or NULL if the node doesn’t contain any.

+
+ +
+
+char* get_value(dom_node* node)
+

node The node from which the value will be returned.

+

This functions returns the value of the given node, or NULL if the node doesn’t contain any.

+
+ +
+
+list* get_xml_declarations(doc* document)
+

document The document from which the xml declarations list will be returned.

+

This functions returns the list of the xml declarations, or NULL if there isn’t any.

+
+ +
+
+dom_node* get_doc_root(doc* document)
+

document The document from which the dom tree will be returned.

+

This functions returns the dom node at the root of the dom tree, or NULL if there isn’t any.

+
+ +
+
+void prepend_child(dom_node* parent, dom_node* child)
+

parent The parent node to whom the child will be prepended.

+

child The child to be prepended.

+

This function inserts a dom node at the head of the children’s list of the dom node given as first argument.

+
+ +
+
+void append_child(dom_node* parent, dom_node* child)
+

parent The parent node to whom the child will be appended.

+

child The child to be appended.

+

This function inserts a dom node at the end of the children’s list of the dom node given as first argument.

+
+ +
+
+void append_children(dom_node* parent, struct generic_list_s* children)
+

parent The parent node to whom the children list will be appended.

+

children The children list to be appended.

+

This functions calls append_child() for each node in the children’s list, passed as the second argument.

+
+ +
+
+void add_attribute(dom_node* node, dom_node* attribute)
+

node The node to whom the attribute will be added.

+

attribute The attribute to add to the node.

+

This function adds an attribute to the node given as the first argument.

+
+ +
+
+doc* new_document(struct snode* xml_declaration)
+

xml_declaration The declaration tree of the document. Can be NULL.

+

This function creates a new document with the given xml declaration.

+
+ +
+
+dom_node* new_element_node(char* name)
+

name The name of the new element node.

+

This function creates a new element node with the given name. The name should correspond to an xml tag.

+
+ +
+
+dom_node* new_text_node(char* text)
+

text The text in the xml document.

+

This function creates a new text node and stores the given text in the value field of the dom node.

+
+ +
+
+dom_node* new_attribute(char* name, char* value)
+

name The name of the attribute.

+

value The value of the attribute.

+

This function creates a new attribute with the given name and value.

+
+ +
+
+dom_node* new_cdata(char* cdata_text)
+

cdata_text The cdata text in the xml document.

+

This function creates a new cdata node and stores the text in the value field.

+
+ +
+
+dom_node* get_child_at(dom_node* parent, int index)
+

parent The node from which the child will be returned.

+

index The index of the child beggining at 0.

+

This function returns the nth child of the parent node. If no child is found, NULL will be returned.

+
+ +
+
+struct generic_list_s* get_children(dom_node* node)
+

node The node from which the children will be returned.

+

This function returns a pointer to the node’s children. Be aware that this function only returns nodes directly below the given argument. If you want the other ones too, consider using get_descedants().

+
+ +
+
+struct generic_list_s* get_descendants(dom_node* node)
+

node The node from which the descedants will be returned.

+

This function returns the descendants of the node. This differs from get_children() because it returns all nodes below the given argument.

+
+ +
+
+struct generic_list_s* get_text_nodes(doc* root)
+

root The document root of the xml.

+

This function traverses the entire dom tree and returns all text nodes in it.

+
+ +
+
+dom_node* get_attribute_by_name(dom_node* node, char* attr_name)
+

node The node from whom the attribute will be returned.

+

attr_name The name of the attribute.

+

This function returns the attribute with the given name, or NULL if there isn’t any.

+
+ +
+
+struct generic_list_s* get_elements_by_name(doc* root, char* name)
+

root The document root of the xml.

+

name The name of the elements to search.

+

This function traverses the entire dom tree and returns all element with the given name.

+
+ +
+
+dom_node* delete_attribute(dom_node* node, char* name)
+

node The node from whom the attribute will be removed.

+

name The name of the attribute to remove.

+

This function deletes the attribute with the given name from the given node. If the node doesn’t contain an attribute with the given name, then nothing will happen.

+
+ +
+
+void remove_node(doc* root, dom_node* node)
+

root The root of the xml document.

+

node The node to remove from the dom tree.

+

This function removes the given node from the given dom tree. Be carefull because it also removes all nodes below the given node. This doesn’t free the given node, so you should keep the pointer to it and free it yourself.

+
+ +
+
+void destroy_dom_node(dom_node* n)
+

n The dom node to be destroyed.

+

This function should be used with caution. This frees the space associated with the given dom node, but it also frees all nodes below it. A simple way to clean the dom tree keeping only the document structure is to pass the root node to this function as follows:

+
#include "node.h"
+#include "lxq_parser.h"
+
+int main(){
+  doc* document = parse_dom("xml_file.xml");
+  //clean the tree but keep my doc structure and xml declaration intact.
+  destroy_dom_node(get_doc_root(document));
+  return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where node.h and lxq_parser.h are kept>
+
+
+
+ +
+
+void destroy_dom_tree(doc* root)
+

root The document to be destroyed.

+

This function does exactly the same thing as destroy_dom_node() but it also frees the space associated with the document structure. As an example consider:

+
#include "node.h"
+#include "lxq_parser.h"
+
+int main(){
+  doc* document = parse_dom("xml_file.xml");
+  destroy_dom_tree(document);
+  return 0;
+}
+
+
+

You may compile it with

+
gcc -o test <above_source_file> -I<folder path where node.h and lxq_parser.h are kept>
+
+
+

If you use a memory leak checker you’ll notice that there are no leaks, so this actually destroys all nodes.

+
+ +
+
+
+
+

Serialize DOM

+

This section explains how to serialize a DOM tree into a string. Currently we support three different types of output format:

+
    +
  • XML - print the DOM tree as XML format.
    • +
  • JSON - print the DOM tree as JavaScript Object Notation format.
    • +
  • YAML - print the DOM tree as YAML Ain’t Markup Language format.
    • +
+

To do this we’ve defined an enumerate as:

+
typedef enum{
+  XML=0,
+  JSON=1,
+  YAML=2
+} serialization_type;
+
+
+

The serializarion is done throw the function:

+
+
+char* node_to_string(dom_node* root, serialization_type t)
+

root The root of the tree to serialize onto a string. Can be any part of the DOM tree.

+

t The type of serialization to do. Must be one of XML, JSON, YAML.

+

The following example shows how to serialize a document onto JSON format. If another one is desired you can change the type of serialization:

+
#include <stdio.h>
+#include "include/node.h"
+#include "include/serialize.h"
+#include "include/lxq_parser.h"
+
+int main(int argc, char** argv){
+  doc* document = parse_xml("some.xml");
+  char* json;
+  json = node_to_string(get_doc_root(document), JSON);
+  printf("%s", json);
+  free(json);
+  return 0;
+}
+
+
+
+ +
+ + +
+
+
+
+
+

Table Of Contents

+ + +

Previous topic

+

Parser Module

+

Next topic

+

Querying

+

This Page

+ + + +
+
+
+
+
+

Navigation

+ +
+
+ © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
+ + \ No newline at end of file diff --git a/dom/Makefile b/dom/Makefile deleted file mode 100644 index cc90c13..0000000 --- a/dom/Makefile +++ /dev/null @@ -1,15 +0,0 @@ -include ../Makefile.inc - - -OBJS = node.o numbers.o serialize.o huffman.o -includes = ../include/node.h ../include/serializer.h ../include/bitbuffer.h ../includes/huffman.h ../include/byte_buffer.h - - -all: $(OBJS) - -%.o: %.c $(includes) - $(CC) $(CFLAGS) -c $< - -clean: - rm -rf *~ *.out $(OBJS) - diff --git a/dom/README.rst b/dom/README.rst deleted file mode 100644 index a1784a1..0000000 --- a/dom/README.rst +++ /dev/null @@ -1,4 +0,0 @@ -DOM -=== - -This is the source for our DOM tree. diff --git a/dom/huffman.c b/dom/huffman.c deleted file mode 100644 index a9f5569..0000000 --- a/dom/huffman.c +++ /dev/null @@ -1,223 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include "../include/huffman.h" -#include "../include/btree.h" -#include "../include/bitbuffer.h" -#include "../include/stack.h" -#include "../include/byte_buffer.h" - -int compare_bc(void* o1, int16_t t1, void* o2, int16_t t2){ - return ((bc*)o2)->count - ((bc*)o1)->count; -} - -void print_btree(btree* node, int depth){ - int i; - for(i = 0; i++ < depth; printf(" ")); - if(node->left == NULL){ - printf("%c:%d\n", ((bc*)(node->value))->byte, ((bc*)(node->value))->count); - } - else{ - printf("| 0\n"); - print_btree(node->left, depth+1); - } - - for(i = 0; i++ < depth; printf(" ")); - if(node->right == NULL){ - printf("%c:%d\n", ((bc*)(node->value))->byte, ((bc*)(node->value))->count); - } - else{ - printf("| 1\n"); - print_btree(node->right, depth+1); - } -} - - - -void pack_huffman_tree(btree* tree, bitbuffer* bb){ - if(tree->left != NULL && tree->right != NULL){ - append_bit_to_buffer(0, bb); - pack_huffman_tree(tree->left, bb); - append_bit_to_buffer(0, bb); - pack_huffman_tree(tree->right, bb); - append_bit_to_buffer(1, bb); - } - else{ - append_bit_to_buffer(1, bb); - bc* node_bc = (bc*)tree->value; - append_bits_to_buffer(node_bc->byte, 8, bb); - } -} - -btree* unpack_huffman_tree(bitbuffer* packed_tree, int* i){ - btree* tree = new_btree(); - - char bit = get_bit_from_buffer(packed_tree, (*i)++); - if(bit == 0){ - tree->left = unpack_huffman_tree(packed_tree, i); - bit = get_bit_from_buffer(packed_tree, (*i)++); - if(bit == 0) tree->right = unpack_huffman_tree(packed_tree, i); - (*i)++; //next value must be 1 - } - else{ - char value = get_byte_from_buffer(packed_tree, *i); - (*i) += 8; - tree->value = alloc(char, 1); - *((char*)tree->value) = value; - } - - return tree; -} - -void set_translation(btree* node){ - bc* node_bc = (bc*)node->value; - bc *left_bc, *right_bc; - - if(node->left != NULL){ - left_bc = (bc*)node->left->value; - left_bc->bb = duplicate_bitbuffer(node_bc->bb); - append_bit_to_buffer(0, left_bc->bb); - set_translation(node->left); - } - - if(node->right != NULL){ - right_bc = (bc*)node->right->value; - right_bc->bb = duplicate_bitbuffer(node_bc->bb); - append_bit_to_buffer(1, right_bc->bb);; - set_translation(node->right); - } -} - -void print_simple_btree(btree* bt, int depth){ - int i; - if(bt->left != NULL){ - for(i = 0; i++ < depth; printf(" ")); - printf("|\n"); - print_simple_btree(bt->left, depth+1); - } - if(bt->right != NULL){ - for(i = 0; i++ < depth; printf(" ")); - printf("|\n"); - print_simple_btree(bt->right, depth+1); - } - if(bt->value != NULL){ - for(i = 0; i++ < depth; printf(" ")); - printf("'%c'\n", *((char*)bt->value)); - } -} - -char* huffman_decode(bitbuffer* bit_string){ - int* offset = alloc(int, 1); - *offset = 0; - btree* ut = unpack_huffman_tree(bit_string, offset); - - int i = *offset; - - btree* ct = ut; - byte_buffer* bb = new_byte_buffer(bit_string->size / 8); - - for(; i < bit_string->size; i++){ - char b = get_bit_from_buffer(bit_string, i); - if(b == 0) ct = ct->left; - else ct = ct->right; - - if(ct->left == NULL && ct->right == NULL){ - append_bytes_to_buffer(ct->value, bb, 1); - ct = ut; - } - } - - char end = 0; - append_bytes_to_buffer(&end, bb, 1); - return bb->buffer; -} - -bitbuffer* huffman_encode(char* byte_string, int size){ - bc* table = alloc(bc, 256); - int i; - - //initialize - for(i = 0; i < 256; i++){ - table[i].count = 0; - table[i].byte = i; - table[i].bt = NULL; - table[i].bb = NULL; - } - - //count - for(i = 0; i < size; i++){ - table[(int)(byte_string[i])].count++; - } - - //sort - list* l = new_generic_list(256); - for(i = 0; i < 256; i++){ - if(table[i].count == 0) continue; - - sorted_insert_element_with_type(l, table+i, 0, &compare_bc); - } - - - while(l->count > 1){ - int16_t t1 = peek_stack_type(l); - bc* c1 = pop_stack(l); - - int16_t t2 = peek_stack_type(l); - bc* c2 = pop_stack(l); - - bc* parent = alloc(bc, 1); - parent->byte = 0; - parent->count = c1->count + c2->count; - parent->bt = new_btree(); - parent->bt->value = parent; - - if(t1 == 0){ - parent->bt->left = new_btree(); - parent->bt->left->value = c1; - } - else {parent->bt->left = c1->bt; } - - if(t2 == 0){ - parent->bt->right = new_btree(); - parent->bt->right->value = c2; - } - else {parent->bt->right = c2->bt; } - - sorted_insert_element_with_type(l, parent, 1, &compare_bc); - } - - bc* root = pop_stack(l); - root->bb = new_bitbuffer(256); - set_translation(root->bt); - bitbuffer* packed_data = new_bitbuffer(256); - pack_huffman_tree(root->bt, packed_data); - - for(i = 0; i < size; i++){ - append_bitbuffer_to_bitbuffer(table[(int)byte_string[i]].bb, packed_data); - } - - - return packed_data; -} - diff --git a/dom/node.c b/dom/node.c deleted file mode 100644 index 8d4ec40..0000000 --- a/dom/node.c +++ /dev/null @@ -1,414 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include -#include "../include/macros.h" -#include "../include/node.h" - -#define USE_DICT 1 - - - -struct sroot* dictionary = NULL; - -void initialize_dictionary(){ - dictionary = new_rbtree(&ident, &compare_string); -} - -char* get_string_pointer(const char* string){ - char* value = NULL; - if(string == NULL){ return NULL; } - if(USE_DICT){ - if(!dictionary){ initialize_dictionary(); } - value = search_rbtree(dictionary, (const void*)string); - if(value == NULL){ - value = strdup(string); - rb_tree_insert(dictionary, value); - } - } - else{ - value = strdup(string); - } - - //log(I, "%p: '%s' | '%s'", value, value, string); - return value; -} - -char* set_namespace(dom_node* node, const char* namespace){ - char* old; - - if(!namespace) - return NULL; - old = node->namespace; - node->namespace = get_string_pointer(namespace); - - return old; -} - -char* set_name(dom_node* node, char* name){ - char* old; - - if(!name) - return NULL; - - old = node->name; - node->name = get_string_pointer(name); - return (USE_DICT)? NULL: old; -} - -char* set_value(dom_node* node, char* value){ - char* old; - - if(!value) - return NULL; - - if(node->type == ELEMENT){ log(F, "Element node does not support the value attribute."); exit(1); } - - old = node->value; - node->value = get_string_pointer(value); - return (USE_DICT)? NULL: old; -} - -dom_node* set_doc_root(doc* document, struct snode* root){ - dom_node* old; - if(!document) - return NULL; - old = document->root; - document->root = root; - return old; -} - -list* set_xml_declaration(doc* document, list* declarations){ - list* old; - if(!document) - return NULL; - old = document->xml_declarations; - document->xml_declarations = declarations; - return old; -} - -void set_parent(dom_node* node, dom_node* parent){ - node->parent = parent; -} - -char* get_namespace(dom_node* node){ - return node->namespace; -} - -char* get_name(dom_node* node){ - return node->name; -} - -char* get_value(dom_node* node){ - return node->value; -} - -dom_node* get_doc_root(doc* document){ - return document->root; -} - -list* get_xml_declarations(doc* document){ - return document->xml_declarations; -} - -void prepend_child(dom_node* parent, dom_node* child){ - if(child == NULL) { - log(W, "Trying to prepend a NULL child."); - return; - } - if(child->type == ATTRIBUTE){ - log(W, "Trying to prepend attribute %s as child of node %s.", child->name, parent->name); - return; - } - if(parent->children == NULL) - parent->children = new_generic_list(1); - - //log(W, "prepend_child needs to be implemented."); - - prepend_element_with_type(parent->children, child, 0); - child->parent = parent; -} - -void append_child(dom_node* parent, dom_node* child){ - if(child == NULL) { - log(W, "Trying to append a NULL child."); - return; - } - if(child->type == ATTRIBUTE){ - log(W, "Trying to append attribute %s as child of node %s.", child->name, parent->name); - return; - } - /*if(child->parent != NULL){ - remove_element(child->parent->children, child); - }*/ - - if(parent->children == NULL) - parent->children = new_generic_list(1); - add_element(parent->children, child); - child->parent = parent; -} - -const void* dom_node_key(const struct stree_node* node){ - return ((dom_node*) node->node)->name; -} - -void add_attribute(dom_node* node, dom_node* attribute){ - if(attribute == NULL) { - log(W, "Trying to add a NULL attrubute."); - return; - } - if(attribute->type == ATTRIBUTE){ - if(node->attributes == NULL) - node->attributes = new_rbtree(&dom_node_key, &compare_string); - dom_node* older = (dom_node*) rb_tree_insert(node->attributes, attribute); - if(older != NULL) - destroy_dom_node(older); - return; - } - log(W, "Trying to add node %s as attribute of node %s", attribute->name, node->name); - return; -} - -void append_children(dom_node* parent, struct generic_list_s* children){ - int i; - if(children == NULL){ - log(W, "Trying to append NULL children."); - return; - } - if(parent->children == NULL) - parent->children = new_generic_list(16); - - for(i = 0; i < children->count; i++){ - append_child(parent, get_element_at(children, i)); - } - //destroy_generic_list(children); - return; -} - -doc* new_document(list* xml_declarations){ - doc* document = alloc(doc, 1); - set_xml_declaration(document, xml_declarations); - return document; -} - -dom_node* new_element_node(const char* name){ - dom_node* node = alloc(dom_node, 1); - - node->value = NULL; - node->namespace = NULL; - node->attributes = NULL; - node->children = NULL; - node->parent = NULL; - - node->type = ELEMENT; - node->name = get_string_pointer(name); - return node; -} - -dom_node* new_text_node(char* text){ - //dangerous memory optimization - textnode_dom_node* node = alloc(textnode_dom_node, 1); - - //node->namespace = NULL; - //node->attributes = NULL; - //node->children = NULL; - //node->name = NULL; - - node->parent = NULL; - node->type = TEXT_NODE; - node->value = get_string_pointer(text); - return (dom_node*)node; -} - -dom_node* new_attribute(char* name, char* value){ - dom_node* node = alloc(dom_node, 1); - - node->namespace = NULL; - node->attributes = NULL; - node->children = NULL; - - node->type = ATTRIBUTE; - node->name = get_string_pointer(name); - node->value = get_string_pointer(value); - return node; -} - -dom_node* new_cdata(char* cdata_text){ - dom_node* node = alloc(dom_node, 1); - - node->name = NULL; - node->namespace = NULL; - node->attributes = NULL; - node->children = NULL; - - node->type = CDATA; - node->value = get_string_pointer(cdata_text); - return node; -} - -dom_node* get_attribute_by_name(dom_node* node, char* attr_name){ - if(node->attributes == NULL) - return NULL; - - return (dom_node*) search_rbtree(node->attributes, attr_name); -} - -dom_node* get_child_at(dom_node* parent, int index){ - if(parent->children == NULL) - return NULL; - return (dom_node*) get_element_at(parent->children, index); -} - -static void __get_elements_by_name(dom_node* root, char* name, list* lk){ - int it; - - if(root == NULL) - return; - - if(root->type == ELEMENT && strcmp(root->name, name) == 0) - append_element_with_type(lk, root, 0); - - if(root->children != NULL) - for(it = 0; it < root->children->count; it++) - __get_elements_by_name((dom_node*) get_element_at(root->children, it), name, lk); -} - -struct generic_list_s* get_elements_by_name(doc* root, char* name){ - list* lk = new_generic_list(16); - __get_elements_by_name(root->root, name, lk); - return lk; -} - -static void __get_text_nodes(dom_node* root, list* lk){ - int it; - - if(root == NULL) - return; - - if(root->type == TEXT_NODE) - append_element_with_type(lk, root, 0); - - if(root->children != NULL) - for(it = 0; it < root->children->count; it++) - __get_text_nodes((dom_node*) get_element_at(root->children, it), lk); -} - -struct generic_list_s* get_text_nodes(doc* root){ - list* lk = new_generic_list(16); - __get_text_nodes(root->root, lk); - return lk; -} - -list* get_children(dom_node* node){ - return node->children; -} - -list* get_descendants(dom_node* node) -{ - int i; - if(node == NULL) return NULL; - - list* children = get_children(node); - if(children == NULL) return NULL; - - list* descendants = new_generic_list(1); - for(i = 0; i < children->count; i++) - { - dom_node* n = get_element_at(children, i); - if(n->type != ELEMENT) continue; - - list* nd = get_descendants(n); - descendants = merge_lists(descendants, nd); - add_element(descendants, n); - } - - return descendants; -} - -void destroy_dom_node(dom_node* n){ - struct siterator* ti; - int it; - - if( n == NULL) return; - if((n->type == ELEMENT || n->type == ATTRIBUTE) && n->namespace != NULL) - if(!USE_DICT) free(n->namespace); - if((n->type == ELEMENT || n->type == ATTRIBUTE) && n->name != NULL) - if(!USE_DICT) free(n->name); - if((n->type == TEXT_NODE || n->type == CDATA || n->type == ATTRIBUTE) && n->value != NULL) - if(!USE_DICT) free(n->value); - if(n->type == ELEMENT && n->attributes != NULL){ - ti = new_tree_iterator(n->attributes); - while(tree_iterator_has_next(ti)) - destroy_dom_node(tree_iterator_next(ti)); - destroy_iterator(ti); - destroy_rbtree(n->attributes); - } - if(n->type == ELEMENT && n->children != NULL){ - for(it = 0; it < n->children->count; it++) - destroy_dom_node((dom_node*) get_element_at(n->children, it)); - destroy_generic_list(n->children); - } - free(n); -} - -void destroy_dictionary(){ - if(dictionary != NULL){ - struct siterator* ti = new_tree_iterator(dictionary); - while(tree_iterator_has_next(ti)) - free(tree_iterator_next(ti)); - destroy_iterator(ti); - destroy_rbtree(dictionary); - dictionary = NULL; - } -} - -void destroy_dom_tree(doc* root){ - destroy_dom_node(root->root); - if(root->xml_declarations){ - int i; - for(i = 0; i < root->xml_declarations->count; i++){ - destroy_dom_node(get_element_at(root->xml_declarations, i)); - } - destroy_generic_list(root->xml_declarations); - } - - free(root); -} - -dom_node* delete_attribute(dom_node* node, char* name){ - return (dom_node*) rb_tree_delete(node->attributes, name); -} - -void remove_node(doc* root, dom_node* node){ - if(node == root->root){ - root->root = NULL; - return; - } - - remove_element(node->parent->children, node); - return; -} - diff --git a/dom/numbers.c b/dom/numbers.c deleted file mode 100644 index 6b07f43..0000000 --- a/dom/numbers.c +++ /dev/null @@ -1,151 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -/* Copyright 2009 10gen Inc. - * - * Licensed under the Apache License, Version 2.0 (the "License"); - * you may not use this file except in compliance with the License. - * You may obtain a copy of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, - * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. - * See the License for the specific language governing permissions and - * limitations under the License. - */ - -/* all the numbers that fit in a 4 byte string */ -const char bson_numstrs[1000][4] = { - "0", "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", "168", "169", - "170", "171", "172", "173", "174", "175", "176", "177", "178", "179", - "180", "181", "182", "183", "184", "185", "186", "187", "188", "189", - "190", "191", "192", "193", "194", "195", "196", "197", "198", "199", - - "200", "201", "202", "203", "204", "205", "206", "207", "208", "209", - "210", "211", "212", "213", "214", "215", "216", "217", "218", "219", - "220", "221", "222", "223", "224", "225", "226", "227", "228", "229", - "230", "231", "232", "233", "234", "235", "236", "237", "238", "239", - "240", "241", "242", "243", "244", "245", "246", "247", "248", "249", - "250", "251", "252", "253", "254", "255", "256", "257", "258", "259", - "260", "261", "262", "263", "264", "265", "266", "267", "268", "269", - "270", "271", "272", "273", "274", "275", "276", "277", "278", "279", - "280", "281", "282", "283", "284", "285", "286", "287", "288", "289", - "290", "291", "292", "293", "294", "295", "296", "297", "298", "299", - - "300", "301", "302", "303", "304", "305", "306", "307", "308", "309", - "310", "311", "312", "313", "314", "315", "316", "317", "318", "319", - "320", "321", "322", "323", "324", "325", "326", "327", "328", "329", - "330", "331", "332", "333", "334", "335", "336", "337", "338", "339", - "340", "341", "342", "343", "344", "345", "346", "347", "348", "349", - "350", "351", "352", "353", "354", "355", "356", "357", "358", "359", - "360", "361", "362", "363", "364", "365", "366", "367", "368", "369", - "370", "371", "372", "373", "374", "375", "376", "377", "378", "379", - "380", "381", "382", "383", "384", "385", "386", "387", "388", "389", - "390", "391", "392", "393", "394", "395", "396", "397", "398", "399", - - "400", "401", "402", "403", "404", "405", "406", "407", "408", "409", - "410", "411", "412", "413", "414", "415", "416", "417", "418", "419", - "420", "421", "422", "423", "424", "425", "426", "427", "428", "429", - "430", "431", "432", "433", "434", "435", "436", "437", "438", "439", - "440", "441", "442", "443", "444", "445", "446", "447", "448", "449", - "450", "451", "452", "453", "454", "455", "456", "457", "458", "459", - "460", "461", "462", "463", "464", "465", "466", "467", "468", "469", - "470", "471", "472", "473", "474", "475", "476", "477", "478", "479", - "480", "481", "482", "483", "484", "485", "486", "487", "488", "489", - "490", "491", "492", "493", "494", "495", "496", "497", "498", "499", - - "500", "501", "502", "503", "504", "505", "506", "507", "508", "509", - "510", "511", "512", "513", "514", "515", "516", "517", "518", "519", - "520", "521", "522", "523", "524", "525", "526", "527", "528", "529", - "530", "531", "532", "533", "534", "535", "536", "537", "538", "539", - "540", "541", "542", "543", "544", "545", "546", "547", "548", "549", - "550", "551", "552", "553", "554", "555", "556", "557", "558", "559", - "560", "561", "562", "563", "564", "565", "566", "567", "568", "569", - "570", "571", "572", "573", "574", "575", "576", "577", "578", "579", - "580", "581", "582", "583", "584", "585", "586", "587", "588", "589", - "590", "591", "592", "593", "594", "595", "596", "597", "598", "599", - - "600", "601", "602", "603", "604", "605", "606", "607", "608", "609", - "610", "611", "612", "613", "614", "615", "616", "617", "618", "619", - "620", "621", "622", "623", "624", "625", "626", "627", "628", "629", - "630", "631", "632", "633", "634", "635", "636", "637", "638", "639", - "640", "641", "642", "643", "644", "645", "646", "647", "648", "649", - "650", "651", "652", "653", "654", "655", "656", "657", "658", "659", - "660", "661", "662", "663", "664", "665", "666", "667", "668", "669", - "670", "671", "672", "673", "674", "675", "676", "677", "678", "679", - "680", "681", "682", "683", "684", "685", "686", "687", "688", "689", - "690", "691", "692", "693", "694", "695", "696", "697", "698", "699", - - "700", "701", "702", "703", "704", "705", "706", "707", "708", "709", - "710", "711", "712", "713", "714", "715", "716", "717", "718", "719", - "720", "721", "722", "723", "724", "725", "726", "727", "728", "729", - "730", "731", "732", "733", "734", "735", "736", "737", "738", "739", - "740", "741", "742", "743", "744", "745", "746", "747", "748", "749", - "750", "751", "752", "753", "754", "755", "756", "757", "758", "759", - "760", "761", "762", "763", "764", "765", "766", "767", "768", "769", - "770", "771", "772", "773", "774", "775", "776", "777", "778", "779", - "780", "781", "782", "783", "784", "785", "786", "787", "788", "789", - "790", "791", "792", "793", "794", "795", "796", "797", "798", "799", - - "800", "801", "802", "803", "804", "805", "806", "807", "808", "809", - "810", "811", "812", "813", "814", "815", "816", "817", "818", "819", - "820", "821", "822", "823", "824", "825", "826", "827", "828", "829", - "830", "831", "832", "833", "834", "835", "836", "837", "838", "839", - "840", "841", "842", "843", "844", "845", "846", "847", "848", "849", - "850", "851", "852", "853", "854", "855", "856", "857", "858", "859", - "860", "861", "862", "863", "864", "865", "866", "867", "868", "869", - "870", "871", "872", "873", "874", "875", "876", "877", "878", "879", - "880", "881", "882", "883", "884", "885", "886", "887", "888", "889", - "890", "891", "892", "893", "894", "895", "896", "897", "898", "899", - - "900", "901", "902", "903", "904", "905", "906", "907", "908", "909", - "910", "911", "912", "913", "914", "915", "916", "917", "918", "919", - "920", "921", "922", "923", "924", "925", "926", "927", "928", "929", - "930", "931", "932", "933", "934", "935", "936", "937", "938", "939", - "940", "941", "942", "943", "944", "945", "946", "947", "948", "949", - "950", "951", "952", "953", "954", "955", "956", "957", "958", "959", - "960", "961", "962", "963", "964", "965", "966", "967", "968", "969", - "970", "971", "972", "973", "974", "975", "976", "977", "978", "979", - "980", "981", "982", "983", "984", "985", "986", "987", "988", "989", - "990", "991", "992", "993", "994", "995", "996", "997", "998", "999", -}; diff --git a/dom/serialize.c b/dom/serialize.c deleted file mode 100644 index 8cb6dab..0000000 --- a/dom/serialize.c +++ /dev/null @@ -1,363 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include "../include/byte_buffer.h" -#include "../include/serialize.h" -#include "../include/rbtree.h" - -byte_buffer* __node_list_to_xml(list* l, int depth); -byte_buffer* __node_list_to_json(list* l, int depth); - -byte_buffer* __element_list_to_yaml(list* l, int depth); -byte_buffer* __text_list_to_yaml(list* l, int depth); - -byte_buffer* __attribute_to_xml(dom_node* attr); -byte_buffer* __attribute_to_json(dom_node* attr, int depth); -byte_buffer* __attribute_to_yaml(dom_node* attr, int depth); - -byte_buffer* __dom_node_to_xml(dom_node* n, int depth){ - int i; - byte_buffer* b = new_byte_buffer(16); - - if(!n) - return b; - - switch(n->type){ - case CDATA: - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("value, b); - append_string_to_buffer("]]>\n", b); - break; - case TEXT_NODE: - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer(n->value, b); - append_string_to_buffer("\n", b); - break; - case ELEMENT: - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("<", b); - if(n->namespace != NULL) - { append_string_to_buffer(n->namespace, b); append_string_to_buffer(":", b); } - - append_string_to_buffer(n->name, b); - if(n->attributes != NULL){ - struct siterator *it = new_tree_iterator(n->attributes); - while(tree_iterator_has_next(it)){ - byte_buffer* attr = __attribute_to_xml((dom_node*) tree_iterator_next(it)); - append_buffer_to_buffer(attr, b); - destroy_byte_buffer(attr); - } - destroy_iterator(it); - } - if(n->children != NULL && n->children->count > 0){ - append_string_to_buffer(">\n", b); - byte_buffer* children_xml = __node_list_to_xml(n->children, depth+1); - append_buffer_to_buffer(children_xml, b); - destroy_byte_buffer(children_xml); - - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("namespace != NULL){ append_string_to_buffer(n->namespace, b); append_string_to_buffer(":", b); } - append_string_to_buffer(n->name, b); - append_string_to_buffer(">\n", b); - } - else{ - append_string_to_buffer(" />\n", b); - } - break; - case ATTRIBUTE: - break; - } - return b; -} - -byte_buffer* __dom_element_to_json(dom_node* n, int depth){ - byte_buffer* b = new_byte_buffer(16); - int i; - - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer(n->name, b); - - - if(n->attributes == NULL && n->children == NULL && n->namespace == NULL){ - append_string_to_buffer(": null,\n", b); - return b; - } - else{ - append_string_to_buffer(": {\n", b); - } - - if(n->attributes != NULL){ - struct siterator *it = new_tree_iterator(n->attributes); - while(tree_iterator_has_next(it)){ - byte_buffer* attr = __attribute_to_json((dom_node*) tree_iterator_next(it), depth+1); - append_buffer_to_buffer(attr, b); - destroy_byte_buffer(attr); - } - destroy_iterator(it); - } - - if(n->children != NULL && n->children->count > 0){ - byte_buffer* children_xml = __node_list_to_json(n->children, depth+1); - append_buffer_to_buffer(children_xml, b); - destroy_byte_buffer(children_xml); - } - - if(n->namespace != NULL){ - for(i = 0; i < depth+1; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("#ns: \"", b); - append_string_to_buffer(n->namespace, b); - append_string_to_buffer("\",\n", b); - } - - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("},\n", b); - - return b; -} - -byte_buffer* __dom_element_to_yaml(dom_node* n, int depth){ - byte_buffer* b = new_byte_buffer(16); - int i; - - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer(n->name, b); - - - if(n->attributes == NULL && n->children == NULL && n->namespace == NULL){ - append_string_to_buffer(": null\n", b); - return b; - } - else{ - append_string_to_buffer(":\n", b); - } - - if(n->attributes != NULL){ - for(i = 0; i < depth+1; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("- !attributes\n", b); - struct siterator *it = new_tree_iterator(n->attributes); - i = 0; - while(tree_iterator_has_next(it)){ - byte_buffer* attr = __attribute_to_yaml((dom_node*) tree_iterator_next(it), depth+2); - append_buffer_to_buffer(attr, b); - destroy_byte_buffer(attr); - } - destroy_iterator(it); - } - - if(n->children != NULL && n->children->count > 0){ - for(i = 0; i < depth+1; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("- !children\n", b); - byte_buffer* children_xml = __element_list_to_yaml(n->children, depth+2); - append_buffer_to_buffer(children_xml, b); - destroy_byte_buffer(children_xml); - } - - if(n->children != NULL && n->children->count > 0){ - for(i = 0; i < depth+1; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("- !text >\n", b); - byte_buffer* children_xml = __text_list_to_yaml(n->children, depth+2); - append_buffer_to_buffer(children_xml, b); - destroy_byte_buffer(children_xml); - } - - if(n->namespace != NULL){ - for(i = 0; i < depth+1; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("- !ns ", b); - append_string_to_buffer(n->namespace, b); - append_string_to_buffer("\n", b); - } - - return b; -} - -byte_buffer* __dom_node_to_json(dom_node* n, int depth){ - int i; - byte_buffer* b = new_byte_buffer(16); - byte_buffer* node_json; - - if(!n) - return b; - - switch(n->type){ - case CDATA: - case TEXT_NODE: - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer("\"#text\": \"", b); - append_string_to_buffer(n->value, b); - append_string_to_buffer("\",\n", b); - break; - case ELEMENT: - node_json = __dom_element_to_json(n, depth); - append_buffer_to_buffer(node_json, b); - destroy_byte_buffer(node_json); - break; - case ATTRIBUTE: - break; - } - return b; -} - -byte_buffer* __dom_node_to_yaml(dom_node* n, int depth){ - int i; - byte_buffer* b = new_byte_buffer(16); - - if(!n) - return b; - - byte_buffer* node_yaml; - switch(n->type){ - case CDATA: - case TEXT_NODE: - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer(n->value, b); - append_string_to_buffer("\n", b); - break; - case ELEMENT: - node_yaml = __dom_element_to_yaml(n, depth); - append_buffer_to_buffer(node_yaml, b); - destroy_byte_buffer(node_yaml); - break; - case ATTRIBUTE: - break; - } - return b; -} - -byte_buffer* __node_list_to_xml(list* l, int depth){ - byte_buffer* b = new_byte_buffer(16); - byte_buffer* element_buffer; - int i; - for(i = 0; i < l->count; i++){ - element_buffer = __dom_node_to_xml(get_element_at(l, i), depth); - append_buffer_to_buffer(element_buffer, b); - destroy_byte_buffer(element_buffer); - } - return b; -} - -byte_buffer* __node_list_to_json(list* l, int depth){ - byte_buffer* b = new_byte_buffer(16); - byte_buffer* element_buffer; - int i; - for(i = 0; i < l->count; i++){ - element_buffer = __dom_node_to_json(get_element_at(l, i), depth); - append_buffer_to_buffer(element_buffer, b); - destroy_byte_buffer(element_buffer); - } - return b; -} - -byte_buffer* __element_list_to_yaml(list* l, int depth){ - byte_buffer* b = new_byte_buffer(16); - int i; - byte_buffer* element_buffer; - for(i = 0; i < l->count; i++){ - if(((dom_node*)get_element_at(l, i))->type == ELEMENT){ - element_buffer = __dom_node_to_yaml(get_element_at(l, i), depth); - append_buffer_to_buffer(element_buffer, b); - destroy_byte_buffer(element_buffer); - } - } - return b; -} - -byte_buffer* __text_list_to_yaml(list* l, int depth){ - byte_buffer* b = new_byte_buffer(16); - int i; - byte_buffer* element_buffer; - for(i = 0; i < l->count; i++){ - if(((dom_node*)get_element_at(l, i))->type == TEXT_NODE){ - element_buffer = __dom_node_to_yaml(get_element_at(l, i), depth); - append_buffer_to_buffer(element_buffer, b); - destroy_byte_buffer(element_buffer); - } - } - return b; -} -//char* __node_list_to_yaml(list* l, char* buffer, int depth); - -byte_buffer* __attribute_to_xml(dom_node* attr){ - byte_buffer* b = new_byte_buffer(16); - - append_string_to_buffer(" ", b); - if(attr->namespace != NULL){ - append_string_to_buffer(attr->namespace, b); - append_string_to_buffer(":", b); - } - append_string_to_buffer(attr->name, b); - append_string_to_buffer("=\"", b); - append_string_to_buffer(attr->value, b); - append_string_to_buffer("\"", b); - return b; -} - -byte_buffer* __attribute_to_json(dom_node* attr, int depth){ - byte_buffer* b = new_byte_buffer(16); - int i; - - for(i = 0; i < depth; i++){ - append_string_to_buffer(" ", b); - } - append_string_to_buffer(attr->name, b); - append_string_to_buffer(": \"", b); - append_string_to_buffer(attr->value, b); - append_string_to_buffer("\",\n", b); - return b; -} - -byte_buffer* __attribute_to_yaml(dom_node* attr, int depth){ - byte_buffer* b = new_byte_buffer(16); - int i; - - for(i = 0; i < depth; i++){ append_string_to_buffer(" ", b); } - append_string_to_buffer(attr->name, b); - append_string_to_buffer(": \"", b); - append_string_to_buffer(attr->value, b); - append_string_to_buffer("\"\n", b); - return b; -} - -char* node_to_string(dom_node* root, serialization_type t){ - byte_buffer* b; - char* buff; - switch(t){ - case XML: - b = __dom_node_to_xml(root, 0); - break; - case JSON: - b = __dom_node_to_json(root, 0); - break; - case YAML: - b = __dom_node_to_yaml(root, 0); - break; - } - append_bytes_to_buffer("\0", b, 1); - buff = b->buffer; - free(b); - return buff; -} - diff --git a/genindex.html b/genindex.html new file mode 100644 index 0000000..e00f04a --- /dev/null +++ b/genindex.html @@ -0,0 +1,297 @@ + + + + + + + + Index — libxmlquery v0.1.4 documentation + + + + + + + + + +
+

Navigation

+ +
+ +
+
+
+
+ + +

Index

+ +
+ _ | A | D | E | G | I | L | M | N | P | R | S | T | X +
+

_

+ + +
+
__alloc (C function)
+
+ +

A

+ + + +
+
add_attribute (C function)
+
add_element (C function)
+
add_element_with_type (C function)
+
alloc (C macro)
+
+
append_child (C function)
+
append_children (C function)
+
append_element_with_type (C function)
+
+ +

D

+ + + +
+
delete_attribute (C function)
+
dequeue (C function)
+
destroy_dom_node (C function)
+
destroy_dom_tree (C function)
+
destroy_generic_list (C function)
+
destroy_generic_list_iterator (C function)
+
+
destroy_iterator (C function)
+
destroy_rbtree (C function)
+
doc (C type)
+
dom_node (C type)
+
duplicate_generic_list (C function)
+
+ +

E

+ + + +
+
enqueue (C function)
+
+
enqueue_with_type (C function)
+
+ +

G

+ + + +
+
generic_list_get_count (C function)
+
generic_list_is_empty (C function)
+
generic_list_iterator_has_next (C function)
+
generic_list_iterator_next (C function)
+
generic_list_s (C type)
+
get_attribute_by_name (C function)
+
get_child_at (C function)
+
get_children (C function)
+
get_descendants (C function)
+
get_doc_root (C function)
+
+
get_element_at (C function)
+
get_element_pos (C function)
+
get_element_with_type_at (C function)
+
get_elements_by_name (C function)
+
get_name (C function)
+
get_namespace (C function)
+
get_text_nodes (C function)
+
get_value (C function)
+
get_xml_declarations (C function)
+
+ +

I

+ + + +
+
insert_element_at (C function)
+
+
insert_element_with_type_at (C function)
+
+ +

L

+ + + +
+
list (C type)
+
list_bucket (C type)
+
+
log (C macro)
+
+ +

M

+ + +
+
merge_lists (C function)
+
+ +

N

+ + + +
+
new_attribute (C function)
+
new_cdata (C function)
+
new_document (C function)
+
new_element_node (C function)
+
new_generic_list (C function)
+
new_generic_list_iterator (C function)
+
new_queue (C function)
+
+
new_rbtree (C function)
+
new_simple_rbtree (C function)
+
new_stack (C function)
+
new_text_node (C function)
+
new_tree_iterator (C function)
+
node_to_string (C function)
+
node_type (C type)
+
+ +

P

+ + + +
+
parse_file (C function)
+
parse_string (C function)
+
parse_xml (C function)
+
parse_xml_from_string (C function)
+
peek_element_type_at (C function)
+
peek_queue_type (C function)
+
+
peek_stack_type (C function)
+
pop_stack (C function)
+
prepend_child (C function)
+
prepend_element_with_type (C function)
+
push_stack (C function)
+
push_stack_type (C function)
+
+ +

R

+ + + +
+
rb_tree_delete (C function)
+
rb_tree_insert (C function)
+
register_custom_filter (C function)
+
register_simple_custom_filter (C function)
+
remove_all (C function)
+
+
remove_duplicates (C function)
+
remove_element (C function)
+
remove_element_at (C function)
+
remove_node (C function)
+
+ +

S

+ + + +
+
sdoc (C type)
+
search_rbtree (C function)
+
set_doc_root (C function)
+
set_element_at (C function)
+
set_element_with_type_at (C function)
+
set_name (C function)
+
set_namespace (C function)
+
set_parent (C function)
+
+
set_value (C function)
+
set_xml_declarations (C function)
+
siterator (C type)
+
snode (C type)
+
sorted_insert_element_with_type (C function)
+
sroot (C type)
+
stree_node (C type)
+
+ +

T

+ + + +
+
tree_iterator (C type)
+
tree_iterator_has_next (C function)
+
tree_iterator_next (C function)
+
+
tree_node (C type)
+
tree_root (C type)
+
+ +

X

+ + +
+
xmlquery_query (C function)
+
+ + + +
+
+
+
+
+ + + + + +
+
+
+
+
+

Navigation

+ +
+
+ © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
+ + \ No newline at end of file diff --git a/include/bitbuffer.h b/include/bitbuffer.h deleted file mode 100644 index b6aa798..0000000 --- a/include/bitbuffer.h +++ /dev/null @@ -1,47 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __BITBUFFER_H__ -#define __BITBUFFER_H__ - - -typedef struct bitbuffer_s{ - char* buffer; - //in bytes - int capacity; - - //in bits - int size; -} bitbuffer; - -extern bitbuffer* new_bitbuffer(int byte_size); -extern bitbuffer* duplicate_bitbuffer(bitbuffer* bb); -extern void append_bit_to_buffer(char c, bitbuffer* bb); -extern void append_bits_to_buffer(char c, int bit_count, bitbuffer* bb); -extern void append_bitbuffer_to_bitbuffer(const bitbuffer* from, bitbuffer* to); -extern char get_bit_from_buffer(const bitbuffer* bb, int offset); -extern char get_byte_from_buffer(const bitbuffer* bb, int offset); - -#endif - diff --git a/include/btree.h b/include/btree.h deleted file mode 100644 index abff8b2..0000000 --- a/include/btree.h +++ /dev/null @@ -1,45 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __BTREE_H__ -#define __BTREE_H__ - -#include "macros.h" -#include "stdlib.h" - -typedef struct btree_s{ - void* value; - struct btree_s* left; - struct btree_s* right; -} btree; - -//typedef struct btree_iterator_s{ -// btree* cur; -// int pos; -//} btree_iterator; - -btree* new_btree(); - -#endif - diff --git a/include/byte_buffer.h b/include/byte_buffer.h deleted file mode 100644 index 3ff9c35..0000000 --- a/include/byte_buffer.h +++ /dev/null @@ -1,39 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __BYTE_BUFFER_H__ -#define __BYTE_BUFFER_H__ -typedef struct bb_s{ - char* buffer; - int capacity; - int size; -} byte_buffer; - -extern void destroy_byte_buffer(byte_buffer* bb); -extern byte_buffer* new_byte_buffer(int initial); -extern void append_string_to_buffer(const char* s, byte_buffer* b); -extern void append_bytes_to_buffer(const char* bytes, byte_buffer* b, size_t size); -extern void append_buffer_to_buffer(byte_buffer* b2, byte_buffer* b); - -#endif diff --git a/include/custom_selectors.h b/include/custom_selectors.h deleted file mode 100644 index 8348f8a..0000000 --- a/include/custom_selectors.h +++ /dev/null @@ -1,70 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __CUSTOM_SELECTORS_H__ -#define __CUSTOM_SELECTORS_H__ - -#include "stack.h" -#include "node.h" - - -typedef struct custom_filter_s{ - char* name; - struct{ - int (*simple)(dom_node* node); - int (*complex)(dom_node* node, list* args); - } function; -} custom_filter; - -typedef struct custom_operator_s{ - char* name; - struct{ - list* (*simple)(list* nodes); - list* (*complex)(list* nodes, list* args); - } function; -} custom_operator; - -/* registers */ - -extern void register_simple_custom_filter(const char* name, int (*filter)(dom_node* node)); -extern void register_custom_filter(const char* name, int (*filter)(dom_node* node, list* args)); -extern void register_simple_custom_operator(const char* name, list* (*operator)(list* nodes)); - -/* getters */ - -extern int (*get_simple_custom_filter_by_name(const char* name))(dom_node*); -extern int (*get_custom_filter_by_name(const char* name))(dom_node*, list* args); -extern list* (*get_simple_custom_operator_by_name(const char* name))(list*); - -/* destroys*/ - -extern void destroy_custom_filters(); -extern void destroy_custom_operators(); - -/* extend operators */ - -extern void register_extended_operators(); - -#endif - diff --git a/include/eregex.h b/include/eregex.h deleted file mode 100644 index 7aedee7..0000000 --- a/include/eregex.h +++ /dev/null @@ -1,28 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __EREGEX_H__ -#define __EREGEX_H__ -extern int match(const char *string, char *pattern, int ignore_case); -#endif diff --git a/include/huffman.h b/include/huffman.h deleted file mode 100644 index 98d4528..0000000 --- a/include/huffman.h +++ /dev/null @@ -1,42 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __HUFFMAN_H__ -#define __HUFFMAN_H__ - -#include "btree.h" -#include "bitbuffer.h" - -typedef struct byte_count{ - int count; - char byte; - btree* bt; - bitbuffer* bb; -} bc; - -extern bitbuffer* huffman_encode(char* byte_string, int size); -extern char* huffman_decode(bitbuffer* bit_string); - -#endif - diff --git a/include/lxq_parser.h b/include/lxq_parser.h deleted file mode 100644 index 4bfc641..0000000 --- a/include/lxq_parser.h +++ /dev/null @@ -1,33 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __DOM_PARSER_H__ -#define __DOM_PARSER_H__ - -#include "node.h" - -extern doc* parse_xml(char* filename); -extern list* parse_query(const char* query); -extern doc* parse_xml_from_string(const char* xmlstring); -#endif diff --git a/include/macros.h b/include/macros.h deleted file mode 100644 index aa1bf83..0000000 --- a/include/macros.h +++ /dev/null @@ -1,59 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __MACROS_H__ -#define __MACROS_H__ - -#include - -#ifdef DEBUG -#include -#define log(level, format, ...) \ - do{ \ - fprintf(stderr, "%s %s:%d: ", level, __FILE__, __LINE__); \ - fprintf(stderr, format, ## __VA_ARGS__); \ - fprintf(stderr, "\n"); \ - }while(0) -#else -#define log(level, str, ...) -#endif - -#define I "\x1B[1;34;34m[INFO]\x1B[0;0;0m" -#define W "\x1B[1;33;33m[WARNNING]\x1B[0;0;0m" -#define E "\x1B[1;31;31m[ERROR]\x1B[0;0;0m" -#define F "\x1B[1;31;31m[FATAL ERROR]\x1B[0;0;0m" - -#define alloc(type, how_many) \ - (type *) __alloc(malloc(how_many * sizeof(type))); - -static inline void* __alloc(void* x){ - if(x) - return x; - log(F,"malloc failed."); - exit(1); - return 0; -} - -#endif - diff --git a/include/node.h b/include/node.h deleted file mode 100644 index ca6350a..0000000 --- a/include/node.h +++ /dev/null @@ -1,102 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __NODE_H__ -#define __NODE_H__ - -#include "rbtree.h" -#include "stack.h" - -enum node_type { - ATTRIBUTE, - ELEMENT, - TEXT_NODE, - CDATA -}; - -typedef struct textnode_s{ - enum node_type type; - struct snode* parent; - char* value; -} textnode_dom_node; - - -typedef struct snode{ - enum node_type type; - struct snode* parent; - union{ - struct sroot* attributes; - char* value; - }; - - char* name; - char* namespace; - - struct generic_list_s* children; -}dom_node; - -typedef struct sdoc{ - struct snode* root; - list* xml_declarations; -}doc; - -extern char* set_namespace(dom_node* node, const char* namespace); -extern char* set_name(dom_node* node, char* name); -extern char* set_value(dom_node* node, char* value); -extern dom_node* set_doc_root(doc* document, struct snode* root); -extern list* set_xml_declarations(doc* document, list* declarations); -extern void set_parent(dom_node* node, dom_node* parent); - -extern char* get_namespace(dom_node* node); -extern char* get_name(dom_node* node); -extern char* get_value(dom_node* node); -extern list* get_xml_declarations(doc* document); -extern dom_node* get_doc_root(doc* document); - -extern void prepend_child(dom_node* parent, dom_node* child); -extern void append_child(dom_node* parent, dom_node* child); -extern void append_children(dom_node* parent, struct generic_list_s* children); -extern void add_attribute(dom_node* node, dom_node* attribute); - -extern doc* new_document(list* xml_declarations); -extern dom_node* new_element_node(const char* name); -extern dom_node* new_text_node(char* text); -extern dom_node* new_attribute(char* name, char* value); -extern dom_node* new_cdata(char* cdata_text); - -extern dom_node* get_child_at(dom_node* parent, int index); -extern struct generic_list_s* get_children(dom_node* node); -extern struct generic_list_s* get_descendants(dom_node* node); -extern struct generic_list_s* get_text_nodes(doc* root); -extern dom_node* get_attribute_by_name(dom_node* node, char* attr_name); -extern struct generic_list_s* get_elements_by_name(doc* root, char* name); - -extern dom_node* delete_attribute(dom_node* node, char* name); -extern void remove_node(doc* root, dom_node* node); - -extern void destroy_dom_node(dom_node* n); -extern void destroy_dom_tree(doc* root); -extern void destroy_dictionary(); -#endif - diff --git a/include/query_parser.h b/include/query_parser.h deleted file mode 100644 index 618990b..0000000 --- a/include/query_parser.h +++ /dev/null @@ -1,75 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __QUERY_PARSER_H__ -#define __QUERY_PARSER_H__ - -#define LXQ_RELATION_TYPE 0 -#define LXQ_SELECTOR_TYPE 1 - -#include "stack.h" - -struct selector_s; - -typedef struct match_value_s{ - char* value; - int op; -} match_value; - -typedef struct attr_selector_s{ - match_value* name; - match_value* value; -} attr_selector; - -typedef struct step_s{ int multiplier; int offset; } step; - -typedef struct filter_selector_s{ - int op; - char* name; - list* args; - struct { - step* s; - struct generic_list_s* selector; - } value; -} filter_selector; - -typedef struct selector_s{ - match_value* id; - stack* attrs; - stack* filters; -} selector; - -extern selector* new_selector(match_value* id); -extern attr_selector* new_attr_value_selector(match_value* name, match_value* value); -extern filter_selector* new_filter(int filter); -extern match_value* new_match_value(const char* value, int op); -extern match_value* new_match_value_no_strdup(char* value, int op); - -extern void destroy_selector(selector* s); -extern void destroy_filter_selector(filter_selector* fs); -extern void destroy_attr_selector(attr_selector* as); - -extern match_value* make_operators(char* str, int op); -#endif - diff --git a/include/query_runner.h b/include/query_runner.h deleted file mode 100644 index c1b35e0..0000000 --- a/include/query_runner.h +++ /dev/null @@ -1,34 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __QUERY_RUNNER_H__ -#define __QUERY_RUNNER_H__ - -#include "stack.h" -#include "node.h" - -extern list* query(const char*, dom_node*); - -#endif - diff --git a/include/rbtree.h b/include/rbtree.h deleted file mode 100644 index c9f0f02..0000000 --- a/include/rbtree.h +++ /dev/null @@ -1,70 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __RBTREE_H__ -#define __RBTREE_H__ - -#define RED 1 -#define BLACK 2 - -#include -#include "macros.h" - -typedef struct stree_node{ - void* node; - - uint8_t color; - - struct stree_node* parent; - struct stree_node* left; - struct stree_node* right; -}tree_node; - -typedef struct sroot{ - struct stree_node* root; - const void* (*key)(const struct stree_node* node); - int64_t (*compare)(const void* keyA, const void* keyB); -}tree_root; - -typedef struct siterator{ - struct stree_node* current; -}tree_iterator; - -extern tree_root* new_simple_rbtree(); -extern tree_root* new_rbtree(const void* (*key_function_pointer)(const struct stree_node* node), - int64_t (*compare_function_pointer)(const void* keyA, const void* keyB)); -extern void* rb_tree_insert(tree_root* root, void* node); -extern void* rb_tree_delete(tree_root* root, void* key); -extern void* search_rbtree(const tree_root* root, const void* key); -extern void destroy_rbtree(tree_root* root); - -extern tree_iterator* new_tree_iterator(tree_root* root); -extern uint8_t tree_iterator_has_next(tree_iterator* it); -extern void* tree_iterator_next(tree_iterator* it); -extern void destroy_iterator(tree_iterator* it); - -extern const void* ident(const struct stree_node* o); -extern int64_t compare_string(const void* keyA, const void* keyB); -#endif - diff --git a/include/serialize.h b/include/serialize.h deleted file mode 100644 index 5148bc8..0000000 --- a/include/serialize.h +++ /dev/null @@ -1,40 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef _LXQ_SERIALIZE_H_ -#define _LXQ_SERIALIZE_H_ - -#include -#include -#include "node.h" - -typedef enum{ - XML=0, - JSON=1, - YAML=2 -} serialization_type; - -extern char* node_to_string(dom_node* root, serialization_type t); -#endif - diff --git a/include/stack.h b/include/stack.h deleted file mode 100644 index 2272377..0000000 --- a/include/stack.h +++ /dev/null @@ -1,107 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __STACK_H__ -#define __STACK_H__ - -#include - -struct list_bucket -{ - int16_t type; - void* element; -}; - -typedef struct generic_list_s{ - void** array; - int8_t with_type; - int32_t start; - int32_t count; - int32_t capacity; -} list; - -typedef struct generic_list_iterator_s{ - uint32_t pos; - struct generic_list_s* list; -} generic_list_iterator; - -typedef struct generic_list_s stack; -typedef struct generic_list_s queue; - -extern uint8_t generic_list_is_empty(struct generic_list_s* l); -extern int32_t generic_list_get_count(struct generic_list_s* l); - -extern struct generic_list_s *new_generic_list(int32_t initial); -extern struct generic_list_s *new_generic_list_with_type(int32_t initial); -extern stack* new_stack(int32_t initial); -extern queue* new_queue(int32_t initial); - -extern void* set_element_with_type_at(list *l, void* obj, int16_t type, int32_t pos); -extern void* set_element_at(list *l, void* obj, int32_t pos); - -extern void insert_element_with_type_at(list* l, void* obj, int16_t type, int32_t pos); -extern void insert_element_at(list* l, void* obj, int32_t pos); - -extern void sorted_insert_element_with_type(list* l, void* obj, int16_t type, int(*compare)(void* o1, int16_t type1, void* o2, int16_t type2)); - -extern void append_element_with_type(list* l, void* obj, int16_t type); -extern void prepend_element_with_type(list* l, void* obj, int16_t type); - -extern void add_element_with_type(list* l, void* obj, int16_t type); -extern void add_element(list* l, void* obj); - -extern void* get_element_at(const list* l, int32_t pos); -extern void* get_element_with_type_at(const list* l, int32_t pos, int16_t* type); - -extern int get_element_pos(const list* l, void* el); - -extern int32_t remove_element(list *l, void* obj); -extern int32_t remove_all(list *l, void* obj); -extern void* remove_element_at(list* l, int32_t pos); - -extern void enqueue_with_type(queue* q, void* obj, int16_t type); -extern void enqueue(queue* q, void* obj); -extern void* dequeue(queue* q); - -extern void push_stack_type(stack* s, void* obj, int16_t type); -extern void push_stack(stack* s, void* obj); -extern void* pop_stack(stack* s); - -extern list* remove_duplicates(list* l); - -extern int16_t peek_element_type_at(list* l, int32_t pos); -extern int16_t peek_stack_type(stack *s); -extern int16_t peek_queue_type(queue *s); - -extern struct generic_list_s *merge_lists(struct generic_list_s *l1, struct generic_list_s *l2); - -extern struct generic_list_s *duplicate_generic_list(const struct generic_list_s*); -extern void destroy_generic_list(struct generic_list_s *s); - -extern generic_list_iterator* new_generic_list_iterator(struct generic_list_s*); -extern uint8_t generic_list_iterator_has_next(generic_list_iterator* i); -extern void* generic_list_iterator_next(generic_list_iterator* i); -extern void destroy_generic_list_iterator(generic_list_iterator* i); -#endif - diff --git a/include/y.tab.h b/include/y.tab.h deleted file mode 100644 index 7af958b..0000000 --- a/include/y.tab.h +++ /dev/null @@ -1,147 +0,0 @@ - -/* A Bison parser, made by GNU Bison 2.4.1. */ - -/* Skeleton interface for Bison's Yacc-like parsers in C - - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 - Free Software Foundation, Inc. - - This program is free software: you can redistribute it and/or modify - it under the terms of the GNU 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 General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program. If not, see . */ - -/* As a special exception, you may create a larger work that contains - part or all of the Bison parser skeleton and distribute that work - under terms of your choice, so long as that work isn't itself a - parser generator using the skeleton or a modified version thereof - as a parser skeleton. Alternatively, if you modify or redistribute - the parser skeleton itself, you may (at your option) remove this - special exception, which will cause the skeleton and the resulting - Bison output files to be licensed under the GNU General Public - License without this special exception. - - This special exception was added by the Free Software Foundation in - version 2.2 of Bison. */ - - -/* Tokens. */ -#ifndef YYTOKENTYPE -# define YYTOKENTYPE - /* Put the tokens into the symbol table, so that GDB and other debuggers - know about them. */ - enum yytokentype { - START_EL = 258, - END_EL = 259, - SLASH = 260, - SCUSTOM_FILTER = 261, - WORD = 262, - TEXT = 263, - CDATA_TOK = 264, - REGEX = 265, - CUSTOM_FILTER = 266, - CUSTOM_OPERATOR = 267, - CUSTOM_RELATION_OPERATOR = 268, - ALL = 269, - SPACE = 270, - END_REGEXI = 271, - NO_OP = 272, - EQUAL_OP = 273, - WSSV_OP = 274, - STARTSW_OP = 275, - ENDSW_OP = 276, - CONTAINS_OP = 277, - REGEX_OP = 278, - REGEXI_OP = 279, - DSV_OP = 280, - NOTEQUAL_OP = 281, - EVEN = 282, - ODD = 283, - NTH_CHILD_FILTER = 284, - NTH_LAST_CHILD_FILTER = 285, - FIRST_CHILD_FILTER = 286, - LAST_CHILD_FILTER = 287, - ONLY_CHILD_FILTER = 288, - EMPTY_FILTER = 289, - NOT_FILTER = 290, - DIGITS = 291 - }; -#endif -/* Tokens. */ -#define START_EL 258 -#define END_EL 259 -#define SLASH 260 -#define SCUSTOM_FILTER 261 -#define WORD 262 -#define TEXT 263 -#define CDATA_TOK 264 -#define REGEX 265 -#define CUSTOM_FILTER 266 -#define CUSTOM_OPERATOR 267 -#define CUSTOM_RELATION_OPERATOR 268 -#define ALL 269 -#define SPACE 270 -#define END_REGEXI 271 -#define NO_OP 272 -#define EQUAL_OP 273 -#define WSSV_OP 274 -#define STARTSW_OP 275 -#define ENDSW_OP 276 -#define CONTAINS_OP 277 -#define REGEX_OP 278 -#define REGEXI_OP 279 -#define DSV_OP 280 -#define NOTEQUAL_OP 281 -#define EVEN 282 -#define ODD 283 -#define NTH_CHILD_FILTER 284 -#define NTH_LAST_CHILD_FILTER 285 -#define FIRST_CHILD_FILTER 286 -#define LAST_CHILD_FILTER 287 -#define ONLY_CHILD_FILTER 288 -#define EMPTY_FILTER 289 -#define NOT_FILTER 290 -#define DIGITS 291 - - - - -#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED -typedef union YYSTYPE -{ - -/* Line 1676 of yacc.c */ -#line 104 "parser.y" - - char * string; - struct snode* dn; - int digits; - struct attr_selector_s* attrselector; - struct step_s* s; - int token; - struct filter_selector_s* fa; - struct generic_list_s* q; - struct selector_s* sel; - struct match_value_s* mv; - - - -/* Line 1676 of yacc.c */ -#line 139 "y.tab.h" -} YYSTYPE; -# define YYSTYPE_IS_TRIVIAL 1 -# define yystype YYSTYPE /* obsolescent; will be withdrawn */ -# define YYSTYPE_IS_DECLARED 1 -#endif - -extern YYSTYPE yylval; - - diff --git a/index.html b/index.html new file mode 100644 index 0000000..f6c6b44 --- /dev/null +++ b/index.html @@ -0,0 +1,137 @@ + + + + + + + + libxmlquery documentation — libxmlquery v0.1.4 documentation + + + + + + + + + + +
+

Navigation

+ +
+ +
+
+
+
+ +
+

libxmlquery documentation

+

libxmlquery is a colection of C functions to help parse, create and +query xml documents.

+

If you are new to libxmlquery start by reading the +Tutorial.

+
+ +
+

You may also find specific object documentation in the Index.

+
+ + +
+
+
+
+
+

Next topic

+

Tutorial

+

This Page

+ + + +
+
+
+
+
+

Navigation

+ +
+
+ © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
+ + \ No newline at end of file diff --git a/install.sh b/install.sh deleted file mode 100755 index 2fef04a..0000000 --- a/install.sh +++ /dev/null @@ -1,52 +0,0 @@ -#!/bin/bash - -if [ "$(id -u)" != "0" ] -then - echo "You must run install as super user" - exit 1 -fi - -function install { - if [ -d include/ -a -f libxmlquery.so ] - then - if [ -d /etc/ld.so.conf.d/ ] - then - echo "/usr/lib" > /etc/ld.so.conf.d/libxmlquery.conf - fi - - cp libxmlquery.so /usr/lib/ - cp xmlquery /usr/bin/ - chmod -x /usr/lib/libxmlquery.so - - if [ ! -e /usr/include/xmlquery ] - then - mkdir /usr/include/xmlquery - fi - cp -r include/* /usr/include/xmlquery - else - echo "Unable to find libxmlquery header files or libxmlquery.so. Header files should be in ./include dir and libxmlquery.so in ./ ." - fi -} - -function uninstall { - if [ -d /etc/ld.so.conf.d/ ] - then - rm -f /etc/ld.so.conf.d/libxmlquery.conf - fi - - rm -f /usr/lib/libxmlquery.so - rm -rf /usr/include/xmlquery/ -} - -if [ $# -eq 0 ] -then - install -else - if [ "$1" == "-u" ] - then - uninstall - else - echo "Unrecognized options: $*" - fi -fi - diff --git a/documentation/index.rst b/lxq_sources/_sources/index.txt similarity index 100% rename from documentation/index.rst rename to lxq_sources/_sources/index.txt diff --git a/lxq_sources/_sources/querying.txt b/lxq_sources/_sources/querying.txt new file mode 100644 index 0000000..a78943d --- /dev/null +++ b/lxq_sources/_sources/querying.txt @@ -0,0 +1,102 @@ +.. highlight:: c + +======== +Querying +======== + +Querying xml nodes to provide quick *random* access to inner nodes is +implemented through `CSS3 selectors `_. + +.. note:: + `CSS `_ stands for + cascading style sheets, it is primarily used for styling (x)html documents + as method to separate content from presentation. + +The CSS3 selectors specification is a `W3C `_ proposed +recomendation widely implemented by most modern browsers, it has also been used, +in its current and earlier forms (CSS and CSS2), by web developers for over 13 +years. + +The W3C recomendation does not tie CSS rules to the presentation of of (x)html +documents, in fact it does define it as a query language capable of selecting +xml/html nodes. With the rise in popularity of AJAX technologies several +javascript libraries became widely used, these libraries (most notabily +`JQuery `_) first proposed the utilization of CSS rules +not only for presentation but also to help manipulation and transversion of the +DOM. + +This library embraces CSS rules as a better/simpler alternative to manual +transversion as well as other W3C recomendations such as +`XPath `_ and +`XQuery `_. + + +Selectors +--------- + +The function `xmlquery_query` is defined to help filter and match nodes in the +:doc:`DOM tree `: + +.. c:function:: generic_list* xmlquery_query(const char* pattern, dom_node* root) + + :c:member:`pattern` Query pattern to apply to XML document. + + :c:member:`root` A root of a DOM tree where to begin the query. + + This function applies a query to a given DOM tree and returns a list of elements. + +Introduction +^^^^^^^^^^^^ + +Node selection is implemented as a **pattern string** to be matched against a +:doc:`DOM tree `. The pattern string matches some number of nodes that are +then returned as a flat list. + +A pattern example: + +.. code-block:: css + + foo + +this simple pattern matches all nodes named `foo`. Upon matching the DOM tree +with this pattern, a reference to every node named `foo` would be returned. +Independent of their position in the tree. Returned references may be +manipulated, rearanged or deleted. + + +Pattern strings match dom nodes in three different realms, according to the node +name (as we've seen), according to the node attributes and according to +*pseudo-filters*, a special kind of selectors aware of the node context. + +.. code-block:: css + + foo[attr='bar']:only-child + +A more complex selector, this selector will match nodes with the name *foo*, +with an attribute named *attr* with the value *bar*, and the node must also be +the *only child* of its parent node. + + +Custom pseudo-filters +^^^^^^^^^^^^^^^^^^^^^ + +We've created some new features. We added the possibility of making *custom pseudo-filters*. +*Custom pseudo-filters* provide a way for the user to define their own filters, which can be +chained with other query operators. + +To create a *custom pseudo-filter* you just need to define a function with the one of the following signatures:: + + int simple_filter(dom_node* node); + int complex_filter(dom_node* node, list* args); + +The first one creates a filter that doesn't take any arguments. If you want to design a filter that takes arguments, you must use the second signature. + +After defining your filter you need to register them. You do this by calling:: + +.. c:function:: void register_simple_custom_filter(const char* name, int (*filter)(dom_node* node)) + +.. c:function:: void register_custom_filter(const char* name, int (*filter)(dom_node* node, list* args)) + +The first function registers a simple filter, while the second registers a complex one. + +When you're done with this you can call your filters just like a CSS3 *pseudo-filter*. diff --git a/documentation/applications/shell.rst b/lxq_sources/applications/shell.txt similarity index 100% rename from documentation/applications/shell.rst rename to lxq_sources/applications/shell.txt diff --git a/documentation/data_structures/datastructures.rst b/lxq_sources/data_structures/datastructures.txt similarity index 100% rename from documentation/data_structures/datastructures.rst rename to lxq_sources/data_structures/datastructures.txt diff --git a/documentation/dom.rst b/lxq_sources/dom.txt similarity index 100% rename from documentation/dom.rst rename to lxq_sources/dom.txt diff --git a/lxq_sources/index.txt b/lxq_sources/index.txt new file mode 100644 index 0000000..3b0527c --- /dev/null +++ b/lxq_sources/index.txt @@ -0,0 +1,30 @@ +.. libxmlquery documentation master file, created by + sphinx-quickstart on Fri Nov 5 15:13:45 2010. + You can adapt this file completely to your liking, but it should at least + contain the root `toctree` directive. + +.. highlight:: c + +libxmlquery documentation +========================= + +**libxmlquery** is a colection of C functions to help **parse**, **create** and +**query** xml documents. + +If you are new to **libxmlquery** start by reading the +:doc:`Tutorial `. + +.. toctree:: + :maxdepth: 2 + + tutorial/tutorial + parser/parser + dom + querying + data_structures/datastructures + macros.h + bindings + applications/shell + +You may also find specific object documentation in the :ref:`genindex`. + diff --git a/documentation/macros.h.rst b/lxq_sources/macros.h.txt similarity index 100% rename from documentation/macros.h.rst rename to lxq_sources/macros.h.txt diff --git a/documentation/parser/parser.rst b/lxq_sources/parser/parser.txt similarity index 100% rename from documentation/parser/parser.rst rename to lxq_sources/parser/parser.txt diff --git a/documentation/querying.rst b/lxq_sources/querying.txt similarity index 100% rename from documentation/querying.rst rename to lxq_sources/querying.txt diff --git a/lxq_sources/tutorial.txt b/lxq_sources/tutorial.txt new file mode 100644 index 0000000..afd702b --- /dev/null +++ b/lxq_sources/tutorial.txt @@ -0,0 +1,47 @@ +.. highlight:: c + +======== +Tutorial +======== + +The following code shows how to use the library to rename a node in a xml file:: + + #include + #include + #include + #include + + dom_node* node = xmlquery_parsefile("test.xml"); + node_list* q_result = xmlquery_query("@hi[foo=bar]"); + dom_node* n_result = xmlquery_pop_node(q_result); + xmlquery_set_node_name(n_result, "bye"); + + printf("%s\n", xmlquery_dom_node_to_string(node, XML); + +if ``test.xml`` contains: + +.. code-block:: xml + + + + + + +the resulting output would change the node: + +.. code-block:: xml + + + +to: + +.. code-block:: xml + + + + +this code will read an xml file in ``test.xml`` into our abstract representation +of the DOM (\ **D**\ ocument **O**\ bject **M**\ odel) tree:: + + dom_node* node = xmlquery_parsefile("test.xml"); + diff --git a/documentation/tutorial/tutorial.rst b/lxq_sources/tutorial/tutorial.txt similarity index 100% rename from documentation/tutorial/tutorial.rst rename to lxq_sources/tutorial/tutorial.txt diff --git a/lxq_static/_static/basic.css b/lxq_static/_static/basic.css new file mode 100644 index 0000000..69f30d4 --- /dev/null +++ b/lxq_static/_static/basic.css @@ -0,0 +1,509 @@ +/* + * basic.css + * ~~~~~~~~~ + * + * Sphinx stylesheet -- basic theme. + * + * :copyright: Copyright 2007-2010 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/* -- main layout ----------------------------------------------------------- */ + +div.clearer { + clear: both; +} + +/* -- relbar ---------------------------------------------------------------- */ + +div.related { + width: 100%; + font-size: 90%; +} + +div.related h3 { + display: none; +} + +div.related ul { + margin: 0; + padding: 0 0 0 10px; + list-style: none; +} + +div.related li { + display: inline; +} + +div.related li.right { + float: right; + margin-right: 5px; +} + +/* -- sidebar --------------------------------------------------------------- */ + +div.sphinxsidebarwrapper { + padding: 10px 5px 0 10px; +} + +div.sphinxsidebar { + float: left; + width: 230px; + margin-left: -100%; + font-size: 90%; +} + +div.sphinxsidebar ul { + list-style: none; +} + +div.sphinxsidebar ul ul, +div.sphinxsidebar ul.want-points { + margin-left: 20px; + list-style: square; +} + +div.sphinxsidebar ul ul { + margin-top: 0; + margin-bottom: 0; +} + +div.sphinxsidebar form { + margin-top: 10px; +} + +div.sphinxsidebar input { + border: 1px solid #98dbcc; + font-family: sans-serif; + font-size: 1em; +} + +img { + border: 0; +} + +/* -- search page ----------------------------------------------------------- */ + +ul.search { + margin: 10px 0 0 20px; + padding: 0; +} + +ul.search li { + padding: 5px 0 5px 20px; + background-image: url(file.png); + background-repeat: no-repeat; + background-position: 0 7px; +} + +ul.search li a { + font-weight: bold; +} + +ul.search li div.context { + color: #888; + margin: 2px 0 0 30px; + text-align: left; +} + +ul.keywordmatches li.goodmatch a { + font-weight: bold; +} + +/* -- index page ------------------------------------------------------------ */ + +table.contentstable { + width: 90%; +} + +table.contentstable p.biglink { + line-height: 150%; +} + +a.biglink { + font-size: 1.3em; +} + +span.linkdescr { + font-style: italic; + padding-top: 5px; + font-size: 90%; +} + +/* -- general index --------------------------------------------------------- */ + +table.indextable { + width: 100%; +} + +table.indextable td { + text-align: left; + vertical-align: top; +} + +table.indextable dl, table.indextable dd { + margin-top: 0; + margin-bottom: 0; +} + +table.indextable tr.pcap { + height: 10px; +} + +table.indextable tr.cap { + margin-top: 10px; + background-color: #f2f2f2; +} + +img.toggler { + margin-right: 3px; + margin-top: 3px; + cursor: pointer; +} + +div.modindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +div.genindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +/* -- general body styles --------------------------------------------------- */ + +a.headerlink { + visibility: hidden; +} + +h1:hover > a.headerlink, +h2:hover > a.headerlink, +h3:hover > a.headerlink, +h4:hover > a.headerlink, +h5:hover > a.headerlink, +h6:hover > a.headerlink, +dt:hover > a.headerlink { + visibility: visible; +} + +div.body p.caption { + text-align: inherit; +} + +div.body td { + text-align: left; +} + +.field-list ul { + padding-left: 1em; +} + +.first { + margin-top: 0 !important; +} + +p.rubric { + margin-top: 30px; + font-weight: bold; +} + +.align-left { + text-align: left; +} + +.align-center { + clear: both; + text-align: center; +} + +.align-right { + text-align: right; +} + +/* -- sidebars -------------------------------------------------------------- */ + +div.sidebar { + margin: 0 0 0.5em 1em; + border: 1px solid #ddb; + padding: 7px 7px 0 7px; + background-color: #ffe; + width: 40%; + float: right; +} + +p.sidebar-title { + font-weight: bold; +} + +/* -- topics ---------------------------------------------------------------- */ + +div.topic { + border: 1px solid #ccc; + padding: 7px 7px 0 7px; + margin: 10px 0 10px 0; +} + +p.topic-title { + font-size: 1.1em; + font-weight: bold; + margin-top: 10px; +} + +/* -- admonitions ----------------------------------------------------------- */ + +div.admonition { + margin-top: 10px; + margin-bottom: 10px; + padding: 7px; +} + +div.admonition dt { + font-weight: bold; +} + +div.admonition dl { + margin-bottom: 0; +} + +p.admonition-title { + margin: 0px 10px 5px 0px; + font-weight: bold; +} + +div.body p.centered { + text-align: center; + margin-top: 25px; +} + +/* -- tables ---------------------------------------------------------------- */ + +table.docutils { + border: 0; + border-collapse: collapse; +} + +table.docutils td, table.docutils th { + padding: 1px 8px 1px 5px; + border-top: 0; + border-left: 0; + border-right: 0; + border-bottom: 1px solid #aaa; +} + +table.field-list td, table.field-list th { + border: 0 !important; +} + +table.footnote td, table.footnote th { + border: 0 !important; +} + +th { + text-align: left; + padding-right: 5px; +} + +table.citation { + border-left: solid 1px gray; + margin-left: 1px; +} + +table.citation td { + border-bottom: none; +} + +/* -- other body styles ----------------------------------------------------- */ + +ol.arabic { + list-style: decimal; +} + +ol.loweralpha { + list-style: lower-alpha; +} + +ol.upperalpha { + list-style: upper-alpha; +} + +ol.lowerroman { + list-style: lower-roman; +} + +ol.upperroman { + list-style: upper-roman; +} + +dl { + margin-bottom: 15px; +} + +dd p { + margin-top: 0px; +} + +dd ul, dd table { + margin-bottom: 10px; +} + +dd { + margin-top: 3px; + margin-bottom: 10px; + margin-left: 30px; +} + +dt:target, .highlighted { + background-color: #fbe54e; +} + +dl.glossary dt { + font-weight: bold; + font-size: 1.1em; +} + +.field-list ul { + margin: 0; + padding-left: 1em; +} + +.field-list p { + margin: 0; +} + +.refcount { + color: #060; +} + +.optional { + font-size: 1.3em; +} + +.versionmodified { + font-style: italic; +} + +.system-message { + background-color: #fda; + padding: 5px; + border: 3px solid red; +} + +.footnote:target { + background-color: #ffa +} + +.line-block { + display: block; + margin-top: 1em; + margin-bottom: 1em; +} + +.line-block .line-block { + margin-top: 0; + margin-bottom: 0; + margin-left: 1.5em; +} + +.guilabel, .menuselection { + font-family: sans-serif; +} + +.accelerator { + text-decoration: underline; +} + +.classifier { + font-style: oblique; +} + +/* -- code displays --------------------------------------------------------- */ + +pre { + overflow: auto; +} + +td.linenos pre { + padding: 5px 0px; + border: 0; + background-color: transparent; + color: #aaa; +} + +table.highlighttable { + margin-left: 0.5em; +} + +table.highlighttable td { + padding: 0 0.5em 0 0.5em; +} + +tt.descname { + background-color: transparent; + font-weight: bold; + font-size: 1.2em; +} + +tt.descclassname { + background-color: transparent; +} + +tt.xref, a tt { + background-color: transparent; + font-weight: bold; +} + +h1 tt, h2 tt, h3 tt, h4 tt, h5 tt, h6 tt { + background-color: transparent; +} + +.viewcode-link { + float: right; +} + +.viewcode-back { + float: right; + font-family: sans-serif; +} + +div.viewcode-block:target { + margin: -1px -10px; + padding: 0 10px; +} + +/* -- math display ---------------------------------------------------------- */ + +img.math { + vertical-align: middle; +} + +div.body div.math p { + text-align: center; +} + +span.eqno { + float: right; +} + +/* -- printout stylesheet --------------------------------------------------- */ + +@media print { + div.document, + div.documentwrapper, + div.bodywrapper { + margin: 0 !important; + width: 100%; + } + + div.sphinxsidebar, + div.related, + div.footer, + #top-link { + display: none; + } +} diff --git a/lxq_static/_static/doctools.js b/lxq_static/_static/doctools.js new file mode 100644 index 0000000..eeea95e --- /dev/null +++ b/lxq_static/_static/doctools.js @@ -0,0 +1,247 @@ +/* + * doctools.js + * ~~~~~~~~~~~ + * + * Sphinx JavaScript utilties for all documentation. + * + * :copyright: Copyright 2007-2010 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/** + * select a different prefix for underscore + */ +$u = _.noConflict(); + +/** + * make the code below compatible with browsers without + * an installed firebug like debugger +if (!window.console || !console.firebug) { + var names = ["log", "debug", "info", "warn", "error", "assert", "dir", + "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace", + "profile", "profileEnd"]; + window.console = {}; + for (var i = 0; i < names.length; ++i) + window.console[names[i]] = function() {}; +} + */ + +/** + * small helper function to urldecode strings + */ +jQuery.urldecode = function(x) { + return decodeURIComponent(x).replace(/\+/g, ' '); +} + +/** + * small helper function to urlencode strings + */ +jQuery.urlencode = encodeURIComponent; + +/** + * This function returns the parsed url parameters of the + * current request. Multiple values per key are supported, + * it will always return arrays of strings for the value parts. + */ +jQuery.getQueryParameters = function(s) { + if (typeof s == 'undefined') + s = document.location.search; + var parts = s.substr(s.indexOf('?') + 1).split('&'); + var result = {}; + for (var i = 0; i < parts.length; i++) { + var tmp = parts[i].split('=', 2); + var key = jQuery.urldecode(tmp[0]); + var value = jQuery.urldecode(tmp[1]); + if (key in result) + result[key].push(value); + else + result[key] = [value]; + } + return result; +}; + +/** + * small function to check if an array contains + * a given item. + */ +jQuery.contains = function(arr, item) { + for (var i = 0; i < arr.length; i++) { + if (arr[i] == item) + return true; + } + return false; +}; + +/** + * highlight a given string on a jquery object by wrapping it in + * span elements with the given class name. + */ +jQuery.fn.highlightText = function(text, className) { + function highlight(node) { + if (node.nodeType == 3) { + var val = node.nodeValue; + var pos = val.toLowerCase().indexOf(text); + if (pos >= 0 && !jQuery(node.parentNode).hasClass(className)) { + var span = document.createElement("span"); + span.className = className; + span.appendChild(document.createTextNode(val.substr(pos, text.length))); + node.parentNode.insertBefore(span, node.parentNode.insertBefore( + document.createTextNode(val.substr(pos + text.length)), + node.nextSibling)); + node.nodeValue = val.substr(0, pos); + } + } + else if (!jQuery(node).is("button, select, textarea")) { + jQuery.each(node.childNodes, function() { + highlight(this); + }); + } + } + return this.each(function() { + highlight(this); + }); +}; + +/** + * Small JavaScript module for the documentation. + */ +var Documentation = { + + init : function() { + this.fixFirefoxAnchorBug(); + this.highlightSearchWords(); + this.initIndexTable(); + }, + + /** + * i18n support + */ + TRANSLATIONS : {}, + PLURAL_EXPR : function(n) { return n == 1 ? 0 : 1; }, + LOCALE : 'unknown', + + // gettext and ngettext don't access this so that the functions + // can safely bound to a different name (_ = Documentation.gettext) + gettext : function(string) { + var translated = Documentation.TRANSLATIONS[string]; + if (typeof translated == 'undefined') + return string; + return (typeof translated == 'string') ? translated : translated[0]; + }, + + ngettext : function(singular, plural, n) { + var translated = Documentation.TRANSLATIONS[singular]; + if (typeof translated == 'undefined') + return (n == 1) ? singular : plural; + return translated[Documentation.PLURALEXPR(n)]; + }, + + addTranslations : function(catalog) { + for (var key in catalog.messages) + this.TRANSLATIONS[key] = catalog.messages[key]; + this.PLURAL_EXPR = new Function('n', 'return +(' + catalog.plural_expr + ')'); + this.LOCALE = catalog.locale; + }, + + /** + * add context elements like header anchor links + */ + addContextElements : function() { + $('div[id] > :header:first').each(function() { + $('\u00B6'). + attr('href', '#' + this.id). + attr('title', _('Permalink to this headline')). + appendTo(this); + }); + $('dt[id]').each(function() { + $('\u00B6'). + attr('href', '#' + this.id). + attr('title', _('Permalink to this definition')). + appendTo(this); + }); + }, + + /** + * workaround a firefox stupidity + */ + fixFirefoxAnchorBug : function() { + if (document.location.hash && $.browser.mozilla) + window.setTimeout(function() { + document.location.href += ''; + }, 10); + }, + + /** + * highlight the search words provided in the url in the text + */ + highlightSearchWords : function() { + var params = $.getQueryParameters(); + var terms = (params.highlight) ? params.highlight[0].split(/\s+/) : []; + if (terms.length) { + var body = $('div.body'); + window.setTimeout(function() { + $.each(terms, function() { + body.highlightText(this.toLowerCase(), 'highlighted'); + }); + }, 10); + $('
  • ' + _('Hide Search Matches') + '
    • ') + .appendTo($('.sidebar .this-page-menu')); + } + }, + + /** + * init the domain index toggle buttons + */ + initIndexTable : function() { + var togglers = $('img.toggler').click(function() { + var src = $(this).attr('src'); + var idnum = $(this).attr('id').substr(7); + $('tr.cg-' + idnum).toggle(); + if (src.substr(-9) == 'minus.png') + $(this).attr('src', src.substr(0, src.length-9) + 'plus.png'); + else + $(this).attr('src', src.substr(0, src.length-8) + 'minus.png'); + }).css('display', ''); + if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) { + togglers.click(); + } + }, + + /** + * helper function to hide the search marks again + */ + hideSearchWords : function() { + $('.sidebar .this-page-menu li.highlight-link').fadeOut(300); + $('span.highlighted').removeClass('highlighted'); + }, + + /** + * make the url absolute + */ + makeURL : function(relativeURL) { + return DOCUMENTATION_OPTIONS.URL_ROOT + '/' + relativeURL; + }, + + /** + * get the current relative url + */ + getCurrentURL : function() { + var path = document.location.pathname; + var parts = path.split(/\//); + $.each(DOCUMENTATION_OPTIONS.URL_ROOT.split(/\//), function() { + if (this == '..') + parts.pop(); + }); + var url = parts.join('/'); + return path.substring(url.lastIndexOf('/') + 1, path.length - 1); + } +}; + +// quick alias for translations +_ = Documentation.gettext; + +$(document).ready(function() { + Documentation.init(); +}); diff --git a/lxq_static/_static/file.png b/lxq_static/_static/file.png new file mode 100644 index 0000000..d18082e Binary files /dev/null and b/lxq_static/_static/file.png differ diff --git a/lxq_static/_static/jquery.js b/lxq_static/_static/jquery.js new file mode 100644 index 0000000..7c24308 --- /dev/null +++ b/lxq_static/_static/jquery.js @@ -0,0 +1,154 @@ +/*! + * jQuery JavaScript Library v1.4.2 + * http://jquery.com/ + * + * Copyright 2010, John Resig + * Dual licensed under the MIT or GPL Version 2 licenses. + * http://jquery.org/license + * + * Includes Sizzle.js + * http://sizzlejs.com/ + * Copyright 2010, The Dojo Foundation + * Released under the MIT, BSD, and GPL Licenses. + * + * Date: Sat Feb 13 22:33:48 2010 -0500 + */ +(function(A,w){function ma(){if(!c.isReady){try{s.documentElement.doScroll("left")}catch(a){setTimeout(ma,1);return}c.ready()}}function Qa(a,b){b.src?c.ajax({url:b.src,async:false,dataType:"script"}):c.globalEval(b.text||b.textContent||b.innerHTML||"");b.parentNode&&b.parentNode.removeChild(b)}function X(a,b,d,f,e,j){var i=a.length;if(typeof b==="object"){for(var o in b)X(a,o,b[o],f,e,d);return a}if(d!==w){f=!j&&f&&c.isFunction(d);for(o=0;o)[^>]*$|^#([\w-]+)$/,Ua=/^.[^:#\[\.,]*$/,Va=/\S/, +Wa=/^(\s|\u00A0)+|(\s|\u00A0)+$/g,Xa=/^<(\w+)\s*\/?>(?:<\/\1>)?$/,P=navigator.userAgent,xa=false,Q=[],L,$=Object.prototype.toString,aa=Object.prototype.hasOwnProperty,ba=Array.prototype.push,R=Array.prototype.slice,ya=Array.prototype.indexOf;c.fn=c.prototype={init:function(a,b){var d,f;if(!a)return this;if(a.nodeType){this.context=this[0]=a;this.length=1;return this}if(a==="body"&&!b){this.context=s;this[0]=s.body;this.selector="body";this.length=1;return this}if(typeof a==="string")if((d=Ta.exec(a))&& +(d[1]||!b))if(d[1]){f=b?b.ownerDocument||b:s;if(a=Xa.exec(a))if(c.isPlainObject(b)){a=[s.createElement(a[1])];c.fn.attr.call(a,b,true)}else a=[f.createElement(a[1])];else{a=sa([d[1]],[f]);a=(a.cacheable?a.fragment.cloneNode(true):a.fragment).childNodes}return c.merge(this,a)}else{if(b=s.getElementById(d[2])){if(b.id!==d[2])return T.find(a);this.length=1;this[0]=b}this.context=s;this.selector=a;return this}else if(!b&&/^\w+$/.test(a)){this.selector=a;this.context=s;a=s.getElementsByTagName(a);return c.merge(this, +a)}else return!b||b.jquery?(b||T).find(a):c(b).find(a);else if(c.isFunction(a))return T.ready(a);if(a.selector!==w){this.selector=a.selector;this.context=a.context}return c.makeArray(a,this)},selector:"",jquery:"1.4.2",length:0,size:function(){return this.length},toArray:function(){return R.call(this,0)},get:function(a){return a==null?this.toArray():a<0?this.slice(a)[0]:this[a]},pushStack:function(a,b,d){var f=c();c.isArray(a)?ba.apply(f,a):c.merge(f,a);f.prevObject=this;f.context=this.context;if(b=== +"find")f.selector=this.selector+(this.selector?" ":"")+d;else if(b)f.selector=this.selector+"."+b+"("+d+")";return f},each:function(a,b){return c.each(this,a,b)},ready:function(a){c.bindReady();if(c.isReady)a.call(s,c);else Q&&Q.push(a);return this},eq:function(a){return a===-1?this.slice(a):this.slice(a,+a+1)},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},slice:function(){return this.pushStack(R.apply(this,arguments),"slice",R.call(arguments).join(","))},map:function(a){return this.pushStack(c.map(this, +function(b,d){return a.call(b,d,b)}))},end:function(){return this.prevObject||c(null)},push:ba,sort:[].sort,splice:[].splice};c.fn.init.prototype=c.fn;c.extend=c.fn.extend=function(){var a=arguments[0]||{},b=1,d=arguments.length,f=false,e,j,i,o;if(typeof a==="boolean"){f=a;a=arguments[1]||{};b=2}if(typeof a!=="object"&&!c.isFunction(a))a={};if(d===b){a=this;--b}for(;b
    a"; +var e=d.getElementsByTagName("*"),j=d.getElementsByTagName("a")[0];if(!(!e||!e.length||!j)){c.support={leadingWhitespace:d.firstChild.nodeType===3,tbody:!d.getElementsByTagName("tbody").length,htmlSerialize:!!d.getElementsByTagName("link").length,style:/red/.test(j.getAttribute("style")),hrefNormalized:j.getAttribute("href")==="/a",opacity:/^0.55$/.test(j.style.opacity),cssFloat:!!j.style.cssFloat,checkOn:d.getElementsByTagName("input")[0].value==="on",optSelected:s.createElement("select").appendChild(s.createElement("option")).selected, +parentNode:d.removeChild(d.appendChild(s.createElement("div"))).parentNode===null,deleteExpando:true,checkClone:false,scriptEval:false,noCloneEvent:true,boxModel:null};b.type="text/javascript";try{b.appendChild(s.createTextNode("window."+f+"=1;"))}catch(i){}a.insertBefore(b,a.firstChild);if(A[f]){c.support.scriptEval=true;delete A[f]}try{delete b.test}catch(o){c.support.deleteExpando=false}a.removeChild(b);if(d.attachEvent&&d.fireEvent){d.attachEvent("onclick",function k(){c.support.noCloneEvent= +false;d.detachEvent("onclick",k)});d.cloneNode(true).fireEvent("onclick")}d=s.createElement("div");d.innerHTML="";a=s.createDocumentFragment();a.appendChild(d.firstChild);c.support.checkClone=a.cloneNode(true).cloneNode(true).lastChild.checked;c(function(){var k=s.createElement("div");k.style.width=k.style.paddingLeft="1px";s.body.appendChild(k);c.boxModel=c.support.boxModel=k.offsetWidth===2;s.body.removeChild(k).style.display="none"});a=function(k){var n= +s.createElement("div");k="on"+k;var r=k in n;if(!r){n.setAttribute(k,"return;");r=typeof n[k]==="function"}return r};c.support.submitBubbles=a("submit");c.support.changeBubbles=a("change");a=b=d=e=j=null}})();c.props={"for":"htmlFor","class":"className",readonly:"readOnly",maxlength:"maxLength",cellspacing:"cellSpacing",rowspan:"rowSpan",colspan:"colSpan",tabindex:"tabIndex",usemap:"useMap",frameborder:"frameBorder"};var G="jQuery"+J(),Ya=0,za={};c.extend({cache:{},expando:G,noData:{embed:true,object:true, +applet:true},data:function(a,b,d){if(!(a.nodeName&&c.noData[a.nodeName.toLowerCase()])){a=a==A?za:a;var f=a[G],e=c.cache;if(!f&&typeof b==="string"&&d===w)return null;f||(f=++Ya);if(typeof b==="object"){a[G]=f;e[f]=c.extend(true,{},b)}else if(!e[f]){a[G]=f;e[f]={}}a=e[f];if(d!==w)a[b]=d;return typeof b==="string"?a[b]:a}},removeData:function(a,b){if(!(a.nodeName&&c.noData[a.nodeName.toLowerCase()])){a=a==A?za:a;var d=a[G],f=c.cache,e=f[d];if(b){if(e){delete e[b];c.isEmptyObject(e)&&c.removeData(a)}}else{if(c.support.deleteExpando)delete a[c.expando]; +else a.removeAttribute&&a.removeAttribute(c.expando);delete f[d]}}}});c.fn.extend({data:function(a,b){if(typeof a==="undefined"&&this.length)return c.data(this[0]);else if(typeof a==="object")return this.each(function(){c.data(this,a)});var d=a.split(".");d[1]=d[1]?"."+d[1]:"";if(b===w){var f=this.triggerHandler("getData"+d[1]+"!",[d[0]]);if(f===w&&this.length)f=c.data(this[0],a);return f===w&&d[1]?this.data(d[0]):f}else return this.trigger("setData"+d[1]+"!",[d[0],b]).each(function(){c.data(this, +a,b)})},removeData:function(a){return this.each(function(){c.removeData(this,a)})}});c.extend({queue:function(a,b,d){if(a){b=(b||"fx")+"queue";var f=c.data(a,b);if(!d)return f||[];if(!f||c.isArray(d))f=c.data(a,b,c.makeArray(d));else f.push(d);return f}},dequeue:function(a,b){b=b||"fx";var d=c.queue(a,b),f=d.shift();if(f==="inprogress")f=d.shift();if(f){b==="fx"&&d.unshift("inprogress");f.call(a,function(){c.dequeue(a,b)})}}});c.fn.extend({queue:function(a,b){if(typeof a!=="string"){b=a;a="fx"}if(b=== +w)return c.queue(this[0],a);return this.each(function(){var d=c.queue(this,a,b);a==="fx"&&d[0]!=="inprogress"&&c.dequeue(this,a)})},dequeue:function(a){return this.each(function(){c.dequeue(this,a)})},delay:function(a,b){a=c.fx?c.fx.speeds[a]||a:a;b=b||"fx";return this.queue(b,function(){var d=this;setTimeout(function(){c.dequeue(d,b)},a)})},clearQueue:function(a){return this.queue(a||"fx",[])}});var Aa=/[\n\t]/g,ca=/\s+/,Za=/\r/g,$a=/href|src|style/,ab=/(button|input)/i,bb=/(button|input|object|select|textarea)/i, +cb=/^(a|area)$/i,Ba=/radio|checkbox/;c.fn.extend({attr:function(a,b){return X(this,a,b,true,c.attr)},removeAttr:function(a){return this.each(function(){c.attr(this,a,"");this.nodeType===1&&this.removeAttribute(a)})},addClass:function(a){if(c.isFunction(a))return this.each(function(n){var r=c(this);r.addClass(a.call(this,n,r.attr("class")))});if(a&&typeof a==="string")for(var b=(a||"").split(ca),d=0,f=this.length;d-1)return true;return false},val:function(a){if(a===w){var b=this[0];if(b){if(c.nodeName(b,"option"))return(b.attributes.value||{}).specified?b.value:b.text;if(c.nodeName(b,"select")){var d=b.selectedIndex,f=[],e=b.options;b=b.type==="select-one";if(d<0)return null;var j=b?d:0;for(d=b?d+1:e.length;j=0;else if(c.nodeName(this,"select")){var u=c.makeArray(r);c("option",this).each(function(){this.selected= +c.inArray(c(this).val(),u)>=0});if(!u.length)this.selectedIndex=-1}else this.value=r}})}});c.extend({attrFn:{val:true,css:true,html:true,text:true,data:true,width:true,height:true,offset:true},attr:function(a,b,d,f){if(!a||a.nodeType===3||a.nodeType===8)return w;if(f&&b in c.attrFn)return c(a)[b](d);f=a.nodeType!==1||!c.isXMLDoc(a);var e=d!==w;b=f&&c.props[b]||b;if(a.nodeType===1){var j=$a.test(b);if(b in a&&f&&!j){if(e){b==="type"&&ab.test(a.nodeName)&&a.parentNode&&c.error("type property can't be changed"); +a[b]=d}if(c.nodeName(a,"form")&&a.getAttributeNode(b))return a.getAttributeNode(b).nodeValue;if(b==="tabIndex")return(b=a.getAttributeNode("tabIndex"))&&b.specified?b.value:bb.test(a.nodeName)||cb.test(a.nodeName)&&a.href?0:w;return a[b]}if(!c.support.style&&f&&b==="style"){if(e)a.style.cssText=""+d;return a.style.cssText}e&&a.setAttribute(b,""+d);a=!c.support.hrefNormalized&&f&&j?a.getAttribute(b,2):a.getAttribute(b);return a===null?w:a}return c.style(a,b,d)}});var O=/\.(.*)$/,db=function(a){return a.replace(/[^\w\s\.\|`]/g, +function(b){return"\\"+b})};c.event={add:function(a,b,d,f){if(!(a.nodeType===3||a.nodeType===8)){if(a.setInterval&&a!==A&&!a.frameElement)a=A;var e,j;if(d.handler){e=d;d=e.handler}if(!d.guid)d.guid=c.guid++;if(j=c.data(a)){var i=j.events=j.events||{},o=j.handle;if(!o)j.handle=o=function(){return typeof c!=="undefined"&&!c.event.triggered?c.event.handle.apply(o.elem,arguments):w};o.elem=a;b=b.split(" ");for(var k,n=0,r;k=b[n++];){j=e?c.extend({},e):{handler:d,data:f};if(k.indexOf(".")>-1){r=k.split("."); +k=r.shift();j.namespace=r.slice(0).sort().join(".")}else{r=[];j.namespace=""}j.type=k;j.guid=d.guid;var u=i[k],z=c.event.special[k]||{};if(!u){u=i[k]=[];if(!z.setup||z.setup.call(a,f,r,o)===false)if(a.addEventListener)a.addEventListener(k,o,false);else a.attachEvent&&a.attachEvent("on"+k,o)}if(z.add){z.add.call(a,j);if(!j.handler.guid)j.handler.guid=d.guid}u.push(j);c.event.global[k]=true}a=null}}},global:{},remove:function(a,b,d,f){if(!(a.nodeType===3||a.nodeType===8)){var e,j=0,i,o,k,n,r,u,z=c.data(a), +C=z&&z.events;if(z&&C){if(b&&b.type){d=b.handler;b=b.type}if(!b||typeof b==="string"&&b.charAt(0)==="."){b=b||"";for(e in C)c.event.remove(a,e+b)}else{for(b=b.split(" ");e=b[j++];){n=e;i=e.indexOf(".")<0;o=[];if(!i){o=e.split(".");e=o.shift();k=new RegExp("(^|\\.)"+c.map(o.slice(0).sort(),db).join("\\.(?:.*\\.)?")+"(\\.|$)")}if(r=C[e])if(d){n=c.event.special[e]||{};for(B=f||0;B=0){a.type= +e=e.slice(0,-1);a.exclusive=true}if(!d){a.stopPropagation();c.event.global[e]&&c.each(c.cache,function(){this.events&&this.events[e]&&c.event.trigger(a,b,this.handle.elem)})}if(!d||d.nodeType===3||d.nodeType===8)return w;a.result=w;a.target=d;b=c.makeArray(b);b.unshift(a)}a.currentTarget=d;(f=c.data(d,"handle"))&&f.apply(d,b);f=d.parentNode||d.ownerDocument;try{if(!(d&&d.nodeName&&c.noData[d.nodeName.toLowerCase()]))if(d["on"+e]&&d["on"+e].apply(d,b)===false)a.result=false}catch(j){}if(!a.isPropagationStopped()&& +f)c.event.trigger(a,b,f,true);else if(!a.isDefaultPrevented()){f=a.target;var i,o=c.nodeName(f,"a")&&e==="click",k=c.event.special[e]||{};if((!k._default||k._default.call(d,a)===false)&&!o&&!(f&&f.nodeName&&c.noData[f.nodeName.toLowerCase()])){try{if(f[e]){if(i=f["on"+e])f["on"+e]=null;c.event.triggered=true;f[e]()}}catch(n){}if(i)f["on"+e]=i;c.event.triggered=false}}},handle:function(a){var b,d,f,e;a=arguments[0]=c.event.fix(a||A.event);a.currentTarget=this;b=a.type.indexOf(".")<0&&!a.exclusive; +if(!b){d=a.type.split(".");a.type=d.shift();f=new RegExp("(^|\\.)"+d.slice(0).sort().join("\\.(?:.*\\.)?")+"(\\.|$)")}e=c.data(this,"events");d=e[a.type];if(e&&d){d=d.slice(0);e=0;for(var j=d.length;e-1?c.map(a.options,function(f){return f.selected}).join("-"):"";else if(a.nodeName.toLowerCase()==="select")d=a.selectedIndex;return d},fa=function(a,b){var d=a.target,f,e;if(!(!da.test(d.nodeName)||d.readOnly)){f=c.data(d,"_change_data");e=Fa(d);if(a.type!=="focusout"||d.type!=="radio")c.data(d,"_change_data", +e);if(!(f===w||e===f))if(f!=null||e){a.type="change";return c.event.trigger(a,b,d)}}};c.event.special.change={filters:{focusout:fa,click:function(a){var b=a.target,d=b.type;if(d==="radio"||d==="checkbox"||b.nodeName.toLowerCase()==="select")return fa.call(this,a)},keydown:function(a){var b=a.target,d=b.type;if(a.keyCode===13&&b.nodeName.toLowerCase()!=="textarea"||a.keyCode===32&&(d==="checkbox"||d==="radio")||d==="select-multiple")return fa.call(this,a)},beforeactivate:function(a){a=a.target;c.data(a, +"_change_data",Fa(a))}},setup:function(){if(this.type==="file")return false;for(var a in ea)c.event.add(this,a+".specialChange",ea[a]);return da.test(this.nodeName)},teardown:function(){c.event.remove(this,".specialChange");return da.test(this.nodeName)}};ea=c.event.special.change.filters}s.addEventListener&&c.each({focus:"focusin",blur:"focusout"},function(a,b){function d(f){f=c.event.fix(f);f.type=b;return c.event.handle.call(this,f)}c.event.special[b]={setup:function(){this.addEventListener(a, +d,true)},teardown:function(){this.removeEventListener(a,d,true)}}});c.each(["bind","one"],function(a,b){c.fn[b]=function(d,f,e){if(typeof d==="object"){for(var j in d)this[b](j,f,d[j],e);return this}if(c.isFunction(f)){e=f;f=w}var i=b==="one"?c.proxy(e,function(k){c(this).unbind(k,i);return e.apply(this,arguments)}):e;if(d==="unload"&&b!=="one")this.one(d,f,e);else{j=0;for(var o=this.length;j0){y=t;break}}t=t[g]}m[q]=y}}}var f=/((?:\((?:\([^()]+\)|[^()]+)+\)|\[(?:\[[^[\]]*\]|['"][^'"]*['"]|[^[\]'"]+)+\]|\\.|[^ >+~,(\[\\]+)+|[>+~])(\s*,\s*)?((?:.|\r|\n)*)/g, +e=0,j=Object.prototype.toString,i=false,o=true;[0,0].sort(function(){o=false;return 0});var k=function(g,h,l,m){l=l||[];var q=h=h||s;if(h.nodeType!==1&&h.nodeType!==9)return[];if(!g||typeof g!=="string")return l;for(var p=[],v,t,y,S,H=true,M=x(h),I=g;(f.exec(""),v=f.exec(I))!==null;){I=v[3];p.push(v[1]);if(v[2]){S=v[3];break}}if(p.length>1&&r.exec(g))if(p.length===2&&n.relative[p[0]])t=ga(p[0]+p[1],h);else for(t=n.relative[p[0]]?[h]:k(p.shift(),h);p.length;){g=p.shift();if(n.relative[g])g+=p.shift(); +t=ga(g,t)}else{if(!m&&p.length>1&&h.nodeType===9&&!M&&n.match.ID.test(p[0])&&!n.match.ID.test(p[p.length-1])){v=k.find(p.shift(),h,M);h=v.expr?k.filter(v.expr,v.set)[0]:v.set[0]}if(h){v=m?{expr:p.pop(),set:z(m)}:k.find(p.pop(),p.length===1&&(p[0]==="~"||p[0]==="+")&&h.parentNode?h.parentNode:h,M);t=v.expr?k.filter(v.expr,v.set):v.set;if(p.length>0)y=z(t);else H=false;for(;p.length;){var D=p.pop();v=D;if(n.relative[D])v=p.pop();else D="";if(v==null)v=h;n.relative[D](y,v,M)}}else y=[]}y||(y=t);y||k.error(D|| +g);if(j.call(y)==="[object Array]")if(H)if(h&&h.nodeType===1)for(g=0;y[g]!=null;g++){if(y[g]&&(y[g]===true||y[g].nodeType===1&&E(h,y[g])))l.push(t[g])}else for(g=0;y[g]!=null;g++)y[g]&&y[g].nodeType===1&&l.push(t[g]);else l.push.apply(l,y);else z(y,l);if(S){k(S,q,l,m);k.uniqueSort(l)}return l};k.uniqueSort=function(g){if(B){i=o;g.sort(B);if(i)for(var h=1;h":function(g,h){var l=typeof h==="string";if(l&&!/\W/.test(h)){h=h.toLowerCase();for(var m=0,q=g.length;m=0))l||m.push(v);else if(l)h[p]=false;return false},ID:function(g){return g[1].replace(/\\/g,"")},TAG:function(g){return g[1].toLowerCase()}, +CHILD:function(g){if(g[1]==="nth"){var h=/(-?)(\d*)n((?:\+|-)?\d*)/.exec(g[2]==="even"&&"2n"||g[2]==="odd"&&"2n+1"||!/\D/.test(g[2])&&"0n+"+g[2]||g[2]);g[2]=h[1]+(h[2]||1)-0;g[3]=h[3]-0}g[0]=e++;return g},ATTR:function(g,h,l,m,q,p){h=g[1].replace(/\\/g,"");if(!p&&n.attrMap[h])g[1]=n.attrMap[h];if(g[2]==="~=")g[4]=" "+g[4]+" ";return g},PSEUDO:function(g,h,l,m,q){if(g[1]==="not")if((f.exec(g[3])||"").length>1||/^\w/.test(g[3]))g[3]=k(g[3],null,null,h);else{g=k.filter(g[3],h,l,true^q);l||m.push.apply(m, +g);return false}else if(n.match.POS.test(g[0])||n.match.CHILD.test(g[0]))return true;return g},POS:function(g){g.unshift(true);return g}},filters:{enabled:function(g){return g.disabled===false&&g.type!=="hidden"},disabled:function(g){return g.disabled===true},checked:function(g){return g.checked===true},selected:function(g){return g.selected===true},parent:function(g){return!!g.firstChild},empty:function(g){return!g.firstChild},has:function(g,h,l){return!!k(l[3],g).length},header:function(g){return/h\d/i.test(g.nodeName)}, +text:function(g){return"text"===g.type},radio:function(g){return"radio"===g.type},checkbox:function(g){return"checkbox"===g.type},file:function(g){return"file"===g.type},password:function(g){return"password"===g.type},submit:function(g){return"submit"===g.type},image:function(g){return"image"===g.type},reset:function(g){return"reset"===g.type},button:function(g){return"button"===g.type||g.nodeName.toLowerCase()==="button"},input:function(g){return/input|select|textarea|button/i.test(g.nodeName)}}, +setFilters:{first:function(g,h){return h===0},last:function(g,h,l,m){return h===m.length-1},even:function(g,h){return h%2===0},odd:function(g,h){return h%2===1},lt:function(g,h,l){return hl[3]-0},nth:function(g,h,l){return l[3]-0===h},eq:function(g,h,l){return l[3]-0===h}},filter:{PSEUDO:function(g,h,l,m){var q=h[1],p=n.filters[q];if(p)return p(g,l,h,m);else if(q==="contains")return(g.textContent||g.innerText||a([g])||"").indexOf(h[3])>=0;else if(q==="not"){h= +h[3];l=0;for(m=h.length;l=0}},ID:function(g,h){return g.nodeType===1&&g.getAttribute("id")===h},TAG:function(g,h){return h==="*"&&g.nodeType===1||g.nodeName.toLowerCase()===h},CLASS:function(g,h){return(" "+(g.className||g.getAttribute("class"))+" ").indexOf(h)>-1},ATTR:function(g,h){var l=h[1];g=n.attrHandle[l]?n.attrHandle[l](g):g[l]!=null?g[l]:g.getAttribute(l);l=g+"";var m=h[2];h=h[4];return g==null?m==="!=":m=== +"="?l===h:m==="*="?l.indexOf(h)>=0:m==="~="?(" "+l+" ").indexOf(h)>=0:!h?l&&g!==false:m==="!="?l!==h:m==="^="?l.indexOf(h)===0:m==="$="?l.substr(l.length-h.length)===h:m==="|="?l===h||l.substr(0,h.length+1)===h+"-":false},POS:function(g,h,l,m){var q=n.setFilters[h[2]];if(q)return q(g,l,h,m)}}},r=n.match.POS;for(var u in n.match){n.match[u]=new RegExp(n.match[u].source+/(?![^\[]*\])(?![^\(]*\))/.source);n.leftMatch[u]=new RegExp(/(^(?:.|\r|\n)*?)/.source+n.match[u].source.replace(/\\(\d+)/g,function(g, +h){return"\\"+(h-0+1)}))}var z=function(g,h){g=Array.prototype.slice.call(g,0);if(h){h.push.apply(h,g);return h}return g};try{Array.prototype.slice.call(s.documentElement.childNodes,0)}catch(C){z=function(g,h){h=h||[];if(j.call(g)==="[object Array]")Array.prototype.push.apply(h,g);else if(typeof g.length==="number")for(var l=0,m=g.length;l";var l=s.documentElement;l.insertBefore(g,l.firstChild);if(s.getElementById(h)){n.find.ID=function(m,q,p){if(typeof q.getElementById!=="undefined"&&!p)return(q=q.getElementById(m[1]))?q.id===m[1]||typeof q.getAttributeNode!=="undefined"&& +q.getAttributeNode("id").nodeValue===m[1]?[q]:w:[]};n.filter.ID=function(m,q){var p=typeof m.getAttributeNode!=="undefined"&&m.getAttributeNode("id");return m.nodeType===1&&p&&p.nodeValue===q}}l.removeChild(g);l=g=null})();(function(){var g=s.createElement("div");g.appendChild(s.createComment(""));if(g.getElementsByTagName("*").length>0)n.find.TAG=function(h,l){l=l.getElementsByTagName(h[1]);if(h[1]==="*"){h=[];for(var m=0;l[m];m++)l[m].nodeType===1&&h.push(l[m]);l=h}return l};g.innerHTML=""; +if(g.firstChild&&typeof g.firstChild.getAttribute!=="undefined"&&g.firstChild.getAttribute("href")!=="#")n.attrHandle.href=function(h){return h.getAttribute("href",2)};g=null})();s.querySelectorAll&&function(){var g=k,h=s.createElement("div");h.innerHTML="

    ";if(!(h.querySelectorAll&&h.querySelectorAll(".TEST").length===0)){k=function(m,q,p,v){q=q||s;if(!v&&q.nodeType===9&&!x(q))try{return z(q.querySelectorAll(m),p)}catch(t){}return g(m,q,p,v)};for(var l in g)k[l]=g[l];h=null}}(); +(function(){var g=s.createElement("div");g.innerHTML="
    ";if(!(!g.getElementsByClassName||g.getElementsByClassName("e").length===0)){g.lastChild.className="e";if(g.getElementsByClassName("e").length!==1){n.order.splice(1,0,"CLASS");n.find.CLASS=function(h,l,m){if(typeof l.getElementsByClassName!=="undefined"&&!m)return l.getElementsByClassName(h[1])};g=null}}})();var E=s.compareDocumentPosition?function(g,h){return!!(g.compareDocumentPosition(h)&16)}: +function(g,h){return g!==h&&(g.contains?g.contains(h):true)},x=function(g){return(g=(g?g.ownerDocument||g:0).documentElement)?g.nodeName!=="HTML":false},ga=function(g,h){var l=[],m="",q;for(h=h.nodeType?[h]:h;q=n.match.PSEUDO.exec(g);){m+=q[0];g=g.replace(n.match.PSEUDO,"")}g=n.relative[g]?g+"*":g;q=0;for(var p=h.length;q=0===d})};c.fn.extend({find:function(a){for(var b=this.pushStack("","find",a),d=0,f=0,e=this.length;f0)for(var j=d;j0},closest:function(a,b){if(c.isArray(a)){var d=[],f=this[0],e,j= +{},i;if(f&&a.length){e=0;for(var o=a.length;e-1:c(f).is(e)){d.push({selector:i,elem:f});delete j[i]}}f=f.parentNode}}return d}var k=c.expr.match.POS.test(a)?c(a,b||this.context):null;return this.map(function(n,r){for(;r&&r.ownerDocument&&r!==b;){if(k?k.index(r)>-1:c(r).is(a))return r;r=r.parentNode}return null})},index:function(a){if(!a||typeof a=== +"string")return c.inArray(this[0],a?c(a):this.parent().children());return c.inArray(a.jquery?a[0]:a,this)},add:function(a,b){a=typeof a==="string"?c(a,b||this.context):c.makeArray(a);b=c.merge(this.get(),a);return this.pushStack(qa(a[0])||qa(b[0])?b:c.unique(b))},andSelf:function(){return this.add(this.prevObject)}});c.each({parent:function(a){return(a=a.parentNode)&&a.nodeType!==11?a:null},parents:function(a){return c.dir(a,"parentNode")},parentsUntil:function(a,b,d){return c.dir(a,"parentNode", +d)},next:function(a){return c.nth(a,2,"nextSibling")},prev:function(a){return c.nth(a,2,"previousSibling")},nextAll:function(a){return c.dir(a,"nextSibling")},prevAll:function(a){return c.dir(a,"previousSibling")},nextUntil:function(a,b,d){return c.dir(a,"nextSibling",d)},prevUntil:function(a,b,d){return c.dir(a,"previousSibling",d)},siblings:function(a){return c.sibling(a.parentNode.firstChild,a)},children:function(a){return c.sibling(a.firstChild)},contents:function(a){return c.nodeName(a,"iframe")? +a.contentDocument||a.contentWindow.document:c.makeArray(a.childNodes)}},function(a,b){c.fn[a]=function(d,f){var e=c.map(this,b,d);eb.test(a)||(f=d);if(f&&typeof f==="string")e=c.filter(f,e);e=this.length>1?c.unique(e):e;if((this.length>1||gb.test(f))&&fb.test(a))e=e.reverse();return this.pushStack(e,a,R.call(arguments).join(","))}});c.extend({filter:function(a,b,d){if(d)a=":not("+a+")";return c.find.matches(a,b)},dir:function(a,b,d){var f=[];for(a=a[b];a&&a.nodeType!==9&&(d===w||a.nodeType!==1||!c(a).is(d));){a.nodeType=== +1&&f.push(a);a=a[b]}return f},nth:function(a,b,d){b=b||1;for(var f=0;a;a=a[d])if(a.nodeType===1&&++f===b)break;return a},sibling:function(a,b){for(var d=[];a;a=a.nextSibling)a.nodeType===1&&a!==b&&d.push(a);return d}});var Ja=/ jQuery\d+="(?:\d+|null)"/g,V=/^\s+/,Ka=/(<([\w:]+)[^>]*?)\/>/g,hb=/^(?:area|br|col|embed|hr|img|input|link|meta|param)$/i,La=/<([\w:]+)/,ib=/"},F={option:[1,""],legend:[1,"
    ","
    "],thead:[1,"","
    "],tr:[2,"","
    "],td:[3,"","
    "],col:[2,"","
    "],area:[1,"",""],_default:[0,"",""]};F.optgroup=F.option;F.tbody=F.tfoot=F.colgroup=F.caption=F.thead;F.th=F.td;if(!c.support.htmlSerialize)F._default=[1,"div
    ","
    "];c.fn.extend({text:function(a){if(c.isFunction(a))return this.each(function(b){var d= +c(this);d.text(a.call(this,b,d.text()))});if(typeof a!=="object"&&a!==w)return this.empty().append((this[0]&&this[0].ownerDocument||s).createTextNode(a));return c.text(this)},wrapAll:function(a){if(c.isFunction(a))return this.each(function(d){c(this).wrapAll(a.call(this,d))});if(this[0]){var b=c(a,this[0].ownerDocument).eq(0).clone(true);this[0].parentNode&&b.insertBefore(this[0]);b.map(function(){for(var d=this;d.firstChild&&d.firstChild.nodeType===1;)d=d.firstChild;return d}).append(this)}return this}, +wrapInner:function(a){if(c.isFunction(a))return this.each(function(b){c(this).wrapInner(a.call(this,b))});return this.each(function(){var b=c(this),d=b.contents();d.length?d.wrapAll(a):b.append(a)})},wrap:function(a){return this.each(function(){c(this).wrapAll(a)})},unwrap:function(){return this.parent().each(function(){c.nodeName(this,"body")||c(this).replaceWith(this.childNodes)}).end()},append:function(){return this.domManip(arguments,true,function(a){this.nodeType===1&&this.appendChild(a)})}, +prepend:function(){return this.domManip(arguments,true,function(a){this.nodeType===1&&this.insertBefore(a,this.firstChild)})},before:function(){if(this[0]&&this[0].parentNode)return this.domManip(arguments,false,function(b){this.parentNode.insertBefore(b,this)});else if(arguments.length){var a=c(arguments[0]);a.push.apply(a,this.toArray());return this.pushStack(a,"before",arguments)}},after:function(){if(this[0]&&this[0].parentNode)return this.domManip(arguments,false,function(b){this.parentNode.insertBefore(b, +this.nextSibling)});else if(arguments.length){var a=this.pushStack(this,"after",arguments);a.push.apply(a,c(arguments[0]).toArray());return a}},remove:function(a,b){for(var d=0,f;(f=this[d])!=null;d++)if(!a||c.filter(a,[f]).length){if(!b&&f.nodeType===1){c.cleanData(f.getElementsByTagName("*"));c.cleanData([f])}f.parentNode&&f.parentNode.removeChild(f)}return this},empty:function(){for(var a=0,b;(b=this[a])!=null;a++)for(b.nodeType===1&&c.cleanData(b.getElementsByTagName("*"));b.firstChild;)b.removeChild(b.firstChild); +return this},clone:function(a){var b=this.map(function(){if(!c.support.noCloneEvent&&!c.isXMLDoc(this)){var d=this.outerHTML,f=this.ownerDocument;if(!d){d=f.createElement("div");d.appendChild(this.cloneNode(true));d=d.innerHTML}return c.clean([d.replace(Ja,"").replace(/=([^="'>\s]+\/)>/g,'="$1">').replace(V,"")],f)[0]}else return this.cloneNode(true)});if(a===true){ra(this,b);ra(this.find("*"),b.find("*"))}return b},html:function(a){if(a===w)return this[0]&&this[0].nodeType===1?this[0].innerHTML.replace(Ja, +""):null;else if(typeof a==="string"&&!ta.test(a)&&(c.support.leadingWhitespace||!V.test(a))&&!F[(La.exec(a)||["",""])[1].toLowerCase()]){a=a.replace(Ka,Ma);try{for(var b=0,d=this.length;b0||e.cacheable||this.length>1?k.cloneNode(true):k)}o.length&&c.each(o,Qa)}return this}});c.fragments={};c.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(a,b){c.fn[a]=function(d){var f=[];d=c(d);var e=this.length===1&&this[0].parentNode;if(e&&e.nodeType===11&&e.childNodes.length===1&&d.length===1){d[b](this[0]); +return this}else{e=0;for(var j=d.length;e0?this.clone(true):this).get();c.fn[b].apply(c(d[e]),i);f=f.concat(i)}return this.pushStack(f,a,d.selector)}}});c.extend({clean:function(a,b,d,f){b=b||s;if(typeof b.createElement==="undefined")b=b.ownerDocument||b[0]&&b[0].ownerDocument||s;for(var e=[],j=0,i;(i=a[j])!=null;j++){if(typeof i==="number")i+="";if(i){if(typeof i==="string"&&!jb.test(i))i=b.createTextNode(i);else if(typeof i==="string"){i=i.replace(Ka,Ma);var o=(La.exec(i)||["", +""])[1].toLowerCase(),k=F[o]||F._default,n=k[0],r=b.createElement("div");for(r.innerHTML=k[1]+i+k[2];n--;)r=r.lastChild;if(!c.support.tbody){n=ib.test(i);o=o==="table"&&!n?r.firstChild&&r.firstChild.childNodes:k[1]===""&&!n?r.childNodes:[];for(k=o.length-1;k>=0;--k)c.nodeName(o[k],"tbody")&&!o[k].childNodes.length&&o[k].parentNode.removeChild(o[k])}!c.support.leadingWhitespace&&V.test(i)&&r.insertBefore(b.createTextNode(V.exec(i)[0]),r.firstChild);i=r.childNodes}if(i.nodeType)e.push(i);else e= +c.merge(e,i)}}if(d)for(j=0;e[j];j++)if(f&&c.nodeName(e[j],"script")&&(!e[j].type||e[j].type.toLowerCase()==="text/javascript"))f.push(e[j].parentNode?e[j].parentNode.removeChild(e[j]):e[j]);else{e[j].nodeType===1&&e.splice.apply(e,[j+1,0].concat(c.makeArray(e[j].getElementsByTagName("script"))));d.appendChild(e[j])}return e},cleanData:function(a){for(var b,d,f=c.cache,e=c.event.special,j=c.support.deleteExpando,i=0,o;(o=a[i])!=null;i++)if(d=o[c.expando]){b=f[d];if(b.events)for(var k in b.events)e[k]? +c.event.remove(o,k):Ca(o,k,b.handle);if(j)delete o[c.expando];else o.removeAttribute&&o.removeAttribute(c.expando);delete f[d]}}});var kb=/z-?index|font-?weight|opacity|zoom|line-?height/i,Na=/alpha\([^)]*\)/,Oa=/opacity=([^)]*)/,ha=/float/i,ia=/-([a-z])/ig,lb=/([A-Z])/g,mb=/^-?\d+(?:px)?$/i,nb=/^-?\d/,ob={position:"absolute",visibility:"hidden",display:"block"},pb=["Left","Right"],qb=["Top","Bottom"],rb=s.defaultView&&s.defaultView.getComputedStyle,Pa=c.support.cssFloat?"cssFloat":"styleFloat",ja= +function(a,b){return b.toUpperCase()};c.fn.css=function(a,b){return X(this,a,b,true,function(d,f,e){if(e===w)return c.curCSS(d,f);if(typeof e==="number"&&!kb.test(f))e+="px";c.style(d,f,e)})};c.extend({style:function(a,b,d){if(!a||a.nodeType===3||a.nodeType===8)return w;if((b==="width"||b==="height")&&parseFloat(d)<0)d=w;var f=a.style||a,e=d!==w;if(!c.support.opacity&&b==="opacity"){if(e){f.zoom=1;b=parseInt(d,10)+""==="NaN"?"":"alpha(opacity="+d*100+")";a=f.filter||c.curCSS(a,"filter")||"";f.filter= +Na.test(a)?a.replace(Na,b):b}return f.filter&&f.filter.indexOf("opacity=")>=0?parseFloat(Oa.exec(f.filter)[1])/100+"":""}if(ha.test(b))b=Pa;b=b.replace(ia,ja);if(e)f[b]=d;return f[b]},css:function(a,b,d,f){if(b==="width"||b==="height"){var e,j=b==="width"?pb:qb;function i(){e=b==="width"?a.offsetWidth:a.offsetHeight;f!=="border"&&c.each(j,function(){f||(e-=parseFloat(c.curCSS(a,"padding"+this,true))||0);if(f==="margin")e+=parseFloat(c.curCSS(a,"margin"+this,true))||0;else e-=parseFloat(c.curCSS(a, +"border"+this+"Width",true))||0})}a.offsetWidth!==0?i():c.swap(a,ob,i);return Math.max(0,Math.round(e))}return c.curCSS(a,b,d)},curCSS:function(a,b,d){var f,e=a.style;if(!c.support.opacity&&b==="opacity"&&a.currentStyle){f=Oa.test(a.currentStyle.filter||"")?parseFloat(RegExp.$1)/100+"":"";return f===""?"1":f}if(ha.test(b))b=Pa;if(!d&&e&&e[b])f=e[b];else if(rb){if(ha.test(b))b="float";b=b.replace(lb,"-$1").toLowerCase();e=a.ownerDocument.defaultView;if(!e)return null;if(a=e.getComputedStyle(a,null))f= +a.getPropertyValue(b);if(b==="opacity"&&f==="")f="1"}else if(a.currentStyle){d=b.replace(ia,ja);f=a.currentStyle[b]||a.currentStyle[d];if(!mb.test(f)&&nb.test(f)){b=e.left;var j=a.runtimeStyle.left;a.runtimeStyle.left=a.currentStyle.left;e.left=d==="fontSize"?"1em":f||0;f=e.pixelLeft+"px";e.left=b;a.runtimeStyle.left=j}}return f},swap:function(a,b,d){var f={};for(var e in b){f[e]=a.style[e];a.style[e]=b[e]}d.call(a);for(e in b)a.style[e]=f[e]}});if(c.expr&&c.expr.filters){c.expr.filters.hidden=function(a){var b= +a.offsetWidth,d=a.offsetHeight,f=a.nodeName.toLowerCase()==="tr";return b===0&&d===0&&!f?true:b>0&&d>0&&!f?false:c.curCSS(a,"display")==="none"};c.expr.filters.visible=function(a){return!c.expr.filters.hidden(a)}}var sb=J(),tb=//gi,ub=/select|textarea/i,vb=/color|date|datetime|email|hidden|month|number|password|range|search|tel|text|time|url|week/i,N=/=\?(&|$)/,ka=/\?/,wb=/(\?|&)_=.*?(&|$)/,xb=/^(\w+:)?\/\/([^\/?#]+)/,yb=/%20/g,zb=c.fn.load;c.fn.extend({load:function(a,b,d){if(typeof a!== +"string")return zb.call(this,a);else if(!this.length)return this;var f=a.indexOf(" ");if(f>=0){var e=a.slice(f,a.length);a=a.slice(0,f)}f="GET";if(b)if(c.isFunction(b)){d=b;b=null}else if(typeof b==="object"){b=c.param(b,c.ajaxSettings.traditional);f="POST"}var j=this;c.ajax({url:a,type:f,dataType:"html",data:b,complete:function(i,o){if(o==="success"||o==="notmodified")j.html(e?c("
    ").append(i.responseText.replace(tb,"")).find(e):i.responseText);d&&j.each(d,[i.responseText,o,i])}});return this}, +serialize:function(){return c.param(this.serializeArray())},serializeArray:function(){return this.map(function(){return this.elements?c.makeArray(this.elements):this}).filter(function(){return this.name&&!this.disabled&&(this.checked||ub.test(this.nodeName)||vb.test(this.type))}).map(function(a,b){a=c(this).val();return a==null?null:c.isArray(a)?c.map(a,function(d){return{name:b.name,value:d}}):{name:b.name,value:a}}).get()}});c.each("ajaxStart ajaxStop ajaxComplete ajaxError ajaxSuccess ajaxSend".split(" "), +function(a,b){c.fn[b]=function(d){return this.bind(b,d)}});c.extend({get:function(a,b,d,f){if(c.isFunction(b)){f=f||d;d=b;b=null}return c.ajax({type:"GET",url:a,data:b,success:d,dataType:f})},getScript:function(a,b){return c.get(a,null,b,"script")},getJSON:function(a,b,d){return c.get(a,b,d,"json")},post:function(a,b,d,f){if(c.isFunction(b)){f=f||d;d=b;b={}}return c.ajax({type:"POST",url:a,data:b,success:d,dataType:f})},ajaxSetup:function(a){c.extend(c.ajaxSettings,a)},ajaxSettings:{url:location.href, +global:true,type:"GET",contentType:"application/x-www-form-urlencoded",processData:true,async:true,xhr:A.XMLHttpRequest&&(A.location.protocol!=="file:"||!A.ActiveXObject)?function(){return new A.XMLHttpRequest}:function(){try{return new A.ActiveXObject("Microsoft.XMLHTTP")}catch(a){}},accepts:{xml:"application/xml, text/xml",html:"text/html",script:"text/javascript, application/javascript",json:"application/json, text/javascript",text:"text/plain",_default:"*/*"}},lastModified:{},etag:{},ajax:function(a){function b(){e.success&& +e.success.call(k,o,i,x);e.global&&f("ajaxSuccess",[x,e])}function d(){e.complete&&e.complete.call(k,x,i);e.global&&f("ajaxComplete",[x,e]);e.global&&!--c.active&&c.event.trigger("ajaxStop")}function f(q,p){(e.context?c(e.context):c.event).trigger(q,p)}var e=c.extend(true,{},c.ajaxSettings,a),j,i,o,k=a&&a.context||e,n=e.type.toUpperCase();if(e.data&&e.processData&&typeof e.data!=="string")e.data=c.param(e.data,e.traditional);if(e.dataType==="jsonp"){if(n==="GET")N.test(e.url)||(e.url+=(ka.test(e.url)? +"&":"?")+(e.jsonp||"callback")+"=?");else if(!e.data||!N.test(e.data))e.data=(e.data?e.data+"&":"")+(e.jsonp||"callback")+"=?";e.dataType="json"}if(e.dataType==="json"&&(e.data&&N.test(e.data)||N.test(e.url))){j=e.jsonpCallback||"jsonp"+sb++;if(e.data)e.data=(e.data+"").replace(N,"="+j+"$1");e.url=e.url.replace(N,"="+j+"$1");e.dataType="script";A[j]=A[j]||function(q){o=q;b();d();A[j]=w;try{delete A[j]}catch(p){}z&&z.removeChild(C)}}if(e.dataType==="script"&&e.cache===null)e.cache=false;if(e.cache=== +false&&n==="GET"){var r=J(),u=e.url.replace(wb,"$1_="+r+"$2");e.url=u+(u===e.url?(ka.test(e.url)?"&":"?")+"_="+r:"")}if(e.data&&n==="GET")e.url+=(ka.test(e.url)?"&":"?")+e.data;e.global&&!c.active++&&c.event.trigger("ajaxStart");r=(r=xb.exec(e.url))&&(r[1]&&r[1]!==location.protocol||r[2]!==location.host);if(e.dataType==="script"&&n==="GET"&&r){var z=s.getElementsByTagName("head")[0]||s.documentElement,C=s.createElement("script");C.src=e.url;if(e.scriptCharset)C.charset=e.scriptCharset;if(!j){var B= +false;C.onload=C.onreadystatechange=function(){if(!B&&(!this.readyState||this.readyState==="loaded"||this.readyState==="complete")){B=true;b();d();C.onload=C.onreadystatechange=null;z&&C.parentNode&&z.removeChild(C)}}}z.insertBefore(C,z.firstChild);return w}var E=false,x=e.xhr();if(x){e.username?x.open(n,e.url,e.async,e.username,e.password):x.open(n,e.url,e.async);try{if(e.data||a&&a.contentType)x.setRequestHeader("Content-Type",e.contentType);if(e.ifModified){c.lastModified[e.url]&&x.setRequestHeader("If-Modified-Since", +c.lastModified[e.url]);c.etag[e.url]&&x.setRequestHeader("If-None-Match",c.etag[e.url])}r||x.setRequestHeader("X-Requested-With","XMLHttpRequest");x.setRequestHeader("Accept",e.dataType&&e.accepts[e.dataType]?e.accepts[e.dataType]+", */*":e.accepts._default)}catch(ga){}if(e.beforeSend&&e.beforeSend.call(k,x,e)===false){e.global&&!--c.active&&c.event.trigger("ajaxStop");x.abort();return false}e.global&&f("ajaxSend",[x,e]);var g=x.onreadystatechange=function(q){if(!x||x.readyState===0||q==="abort"){E|| +d();E=true;if(x)x.onreadystatechange=c.noop}else if(!E&&x&&(x.readyState===4||q==="timeout")){E=true;x.onreadystatechange=c.noop;i=q==="timeout"?"timeout":!c.httpSuccess(x)?"error":e.ifModified&&c.httpNotModified(x,e.url)?"notmodified":"success";var p;if(i==="success")try{o=c.httpData(x,e.dataType,e)}catch(v){i="parsererror";p=v}if(i==="success"||i==="notmodified")j||b();else c.handleError(e,x,i,p);d();q==="timeout"&&x.abort();if(e.async)x=null}};try{var h=x.abort;x.abort=function(){x&&h.call(x); +g("abort")}}catch(l){}e.async&&e.timeout>0&&setTimeout(function(){x&&!E&&g("timeout")},e.timeout);try{x.send(n==="POST"||n==="PUT"||n==="DELETE"?e.data:null)}catch(m){c.handleError(e,x,null,m);d()}e.async||g();return x}},handleError:function(a,b,d,f){if(a.error)a.error.call(a.context||a,b,d,f);if(a.global)(a.context?c(a.context):c.event).trigger("ajaxError",[b,a,f])},active:0,httpSuccess:function(a){try{return!a.status&&location.protocol==="file:"||a.status>=200&&a.status<300||a.status===304||a.status=== +1223||a.status===0}catch(b){}return false},httpNotModified:function(a,b){var d=a.getResponseHeader("Last-Modified"),f=a.getResponseHeader("Etag");if(d)c.lastModified[b]=d;if(f)c.etag[b]=f;return a.status===304||a.status===0},httpData:function(a,b,d){var f=a.getResponseHeader("content-type")||"",e=b==="xml"||!b&&f.indexOf("xml")>=0;a=e?a.responseXML:a.responseText;e&&a.documentElement.nodeName==="parsererror"&&c.error("parsererror");if(d&&d.dataFilter)a=d.dataFilter(a,b);if(typeof a==="string")if(b=== +"json"||!b&&f.indexOf("json")>=0)a=c.parseJSON(a);else if(b==="script"||!b&&f.indexOf("javascript")>=0)c.globalEval(a);return a},param:function(a,b){function d(i,o){if(c.isArray(o))c.each(o,function(k,n){b||/\[\]$/.test(i)?f(i,n):d(i+"["+(typeof n==="object"||c.isArray(n)?k:"")+"]",n)});else!b&&o!=null&&typeof o==="object"?c.each(o,function(k,n){d(i+"["+k+"]",n)}):f(i,o)}function f(i,o){o=c.isFunction(o)?o():o;e[e.length]=encodeURIComponent(i)+"="+encodeURIComponent(o)}var e=[];if(b===w)b=c.ajaxSettings.traditional; +if(c.isArray(a)||a.jquery)c.each(a,function(){f(this.name,this.value)});else for(var j in a)d(j,a[j]);return e.join("&").replace(yb,"+")}});var la={},Ab=/toggle|show|hide/,Bb=/^([+-]=)?([\d+-.]+)(.*)$/,W,va=[["height","marginTop","marginBottom","paddingTop","paddingBottom"],["width","marginLeft","marginRight","paddingLeft","paddingRight"],["opacity"]];c.fn.extend({show:function(a,b){if(a||a===0)return this.animate(K("show",3),a,b);else{a=0;for(b=this.length;a").appendTo("body");f=e.css("display");if(f==="none")f="block";e.remove();la[d]=f}c.data(this[a],"olddisplay",f)}}a=0;for(b=this.length;a=0;f--)if(d[f].elem===this){b&&d[f](true);d.splice(f,1)}});b||this.dequeue();return this}});c.each({slideDown:K("show",1),slideUp:K("hide",1),slideToggle:K("toggle",1),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"}},function(a,b){c.fn[a]=function(d,f){return this.animate(b,d,f)}});c.extend({speed:function(a,b,d){var f=a&&typeof a==="object"?a:{complete:d||!d&&b||c.isFunction(a)&&a,duration:a,easing:d&&b||b&&!c.isFunction(b)&&b};f.duration=c.fx.off?0:typeof f.duration=== +"number"?f.duration:c.fx.speeds[f.duration]||c.fx.speeds._default;f.old=f.complete;f.complete=function(){f.queue!==false&&c(this).dequeue();c.isFunction(f.old)&&f.old.call(this)};return f},easing:{linear:function(a,b,d,f){return d+f*a},swing:function(a,b,d,f){return(-Math.cos(a*Math.PI)/2+0.5)*f+d}},timers:[],fx:function(a,b,d){this.options=b;this.elem=a;this.prop=d;if(!b.orig)b.orig={}}});c.fx.prototype={update:function(){this.options.step&&this.options.step.call(this.elem,this.now,this);(c.fx.step[this.prop]|| +c.fx.step._default)(this);if((this.prop==="height"||this.prop==="width")&&this.elem.style)this.elem.style.display="block"},cur:function(a){if(this.elem[this.prop]!=null&&(!this.elem.style||this.elem.style[this.prop]==null))return this.elem[this.prop];return(a=parseFloat(c.css(this.elem,this.prop,a)))&&a>-10000?a:parseFloat(c.curCSS(this.elem,this.prop))||0},custom:function(a,b,d){function f(j){return e.step(j)}this.startTime=J();this.start=a;this.end=b;this.unit=d||this.unit||"px";this.now=this.start; +this.pos=this.state=0;var e=this;f.elem=this.elem;if(f()&&c.timers.push(f)&&!W)W=setInterval(c.fx.tick,13)},show:function(){this.options.orig[this.prop]=c.style(this.elem,this.prop);this.options.show=true;this.custom(this.prop==="width"||this.prop==="height"?1:0,this.cur());c(this.elem).show()},hide:function(){this.options.orig[this.prop]=c.style(this.elem,this.prop);this.options.hide=true;this.custom(this.cur(),0)},step:function(a){var b=J(),d=true;if(a||b>=this.options.duration+this.startTime){this.now= +this.end;this.pos=this.state=1;this.update();this.options.curAnim[this.prop]=true;for(var f in this.options.curAnim)if(this.options.curAnim[f]!==true)d=false;if(d){if(this.options.display!=null){this.elem.style.overflow=this.options.overflow;a=c.data(this.elem,"olddisplay");this.elem.style.display=a?a:this.options.display;if(c.css(this.elem,"display")==="none")this.elem.style.display="block"}this.options.hide&&c(this.elem).hide();if(this.options.hide||this.options.show)for(var e in this.options.curAnim)c.style(this.elem, +e,this.options.orig[e]);this.options.complete.call(this.elem)}return false}else{e=b-this.startTime;this.state=e/this.options.duration;a=this.options.easing||(c.easing.swing?"swing":"linear");this.pos=c.easing[this.options.specialEasing&&this.options.specialEasing[this.prop]||a](this.state,e,0,1,this.options.duration);this.now=this.start+(this.end-this.start)*this.pos;this.update()}return true}};c.extend(c.fx,{tick:function(){for(var a=c.timers,b=0;b
    "; +a.insertBefore(b,a.firstChild);d=b.firstChild;f=d.firstChild;e=d.nextSibling.firstChild.firstChild;this.doesNotAddBorder=f.offsetTop!==5;this.doesAddBorderForTableAndCells=e.offsetTop===5;f.style.position="fixed";f.style.top="20px";this.supportsFixedPosition=f.offsetTop===20||f.offsetTop===15;f.style.position=f.style.top="";d.style.overflow="hidden";d.style.position="relative";this.subtractsBorderForOverflowNotVisible=f.offsetTop===-5;this.doesNotIncludeMarginInBodyOffset=a.offsetTop!==j;a.removeChild(b); +c.offset.initialize=c.noop},bodyOffset:function(a){var b=a.offsetTop,d=a.offsetLeft;c.offset.initialize();if(c.offset.doesNotIncludeMarginInBodyOffset){b+=parseFloat(c.curCSS(a,"marginTop",true))||0;d+=parseFloat(c.curCSS(a,"marginLeft",true))||0}return{top:b,left:d}},setOffset:function(a,b,d){if(/static/.test(c.curCSS(a,"position")))a.style.position="relative";var f=c(a),e=f.offset(),j=parseInt(c.curCSS(a,"top",true),10)||0,i=parseInt(c.curCSS(a,"left",true),10)||0;if(c.isFunction(b))b=b.call(a, +d,e);d={top:b.top-e.top+j,left:b.left-e.left+i};"using"in b?b.using.call(a,d):f.css(d)}};c.fn.extend({position:function(){if(!this[0])return null;var a=this[0],b=this.offsetParent(),d=this.offset(),f=/^body|html$/i.test(b[0].nodeName)?{top:0,left:0}:b.offset();d.top-=parseFloat(c.curCSS(a,"marginTop",true))||0;d.left-=parseFloat(c.curCSS(a,"marginLeft",true))||0;f.top+=parseFloat(c.curCSS(b[0],"borderTopWidth",true))||0;f.left+=parseFloat(c.curCSS(b[0],"borderLeftWidth",true))||0;return{top:d.top- +f.top,left:d.left-f.left}},offsetParent:function(){return this.map(function(){for(var a=this.offsetParent||s.body;a&&!/^body|html$/i.test(a.nodeName)&&c.css(a,"position")==="static";)a=a.offsetParent;return a})}});c.each(["Left","Top"],function(a,b){var d="scroll"+b;c.fn[d]=function(f){var e=this[0],j;if(!e)return null;if(f!==w)return this.each(function(){if(j=wa(this))j.scrollTo(!a?f:c(j).scrollLeft(),a?f:c(j).scrollTop());else this[d]=f});else return(j=wa(e))?"pageXOffset"in j?j[a?"pageYOffset": +"pageXOffset"]:c.support.boxModel&&j.document.documentElement[d]||j.document.body[d]:e[d]}});c.each(["Height","Width"],function(a,b){var d=b.toLowerCase();c.fn["inner"+b]=function(){return this[0]?c.css(this[0],d,false,"padding"):null};c.fn["outer"+b]=function(f){return this[0]?c.css(this[0],d,false,f?"margin":"border"):null};c.fn[d]=function(f){var e=this[0];if(!e)return f==null?null:this;if(c.isFunction(f))return this.each(function(j){var i=c(this);i[d](f.call(this,j,i[d]()))});return"scrollTo"in +e&&e.document?e.document.compatMode==="CSS1Compat"&&e.document.documentElement["client"+b]||e.document.body["client"+b]:e.nodeType===9?Math.max(e.documentElement["client"+b],e.body["scroll"+b],e.documentElement["scroll"+b],e.body["offset"+b],e.documentElement["offset"+b]):f===w?c.css(e,d):this.css(d,typeof f==="string"?f:f+"px")}});A.jQuery=A.$=c})(window); diff --git a/lxq_static/_static/minus.png b/lxq_static/_static/minus.png new file mode 100644 index 0000000..da1c562 Binary files /dev/null and b/lxq_static/_static/minus.png differ diff --git a/documentation/_theme/nature/static/nature.css_t b/lxq_static/_static/nature.css similarity index 99% rename from documentation/_theme/nature/static/nature.css_t rename to lxq_static/_static/nature.css index 4252a8d..ac9c45e 100644 --- a/documentation/_theme/nature/static/nature.css_t +++ b/lxq_static/_static/nature.css @@ -235,4 +235,3 @@ tt { #table-of-contents ul { padding-left: 2em; } - diff --git a/lxq_static/_static/plus.png b/lxq_static/_static/plus.png new file mode 100644 index 0000000..b3cb374 Binary files /dev/null and b/lxq_static/_static/plus.png differ diff --git a/documentation/_theme/nature/static/pygments.css b/lxq_static/_static/pygments.css similarity index 100% rename from documentation/_theme/nature/static/pygments.css rename to lxq_static/_static/pygments.css diff --git a/lxq_static/_static/searchtools.js b/lxq_static/_static/searchtools.js new file mode 100644 index 0000000..5cbfe00 --- /dev/null +++ b/lxq_static/_static/searchtools.js @@ -0,0 +1,518 @@ +/* + * searchtools.js + * ~~~~~~~~~~~~~~ + * + * Sphinx JavaScript utilties for the full-text search. + * + * :copyright: Copyright 2007-2010 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/** + * helper function to return a node containing the + * search summary for a given text. keywords is a list + * of stemmed words, hlwords is the list of normal, unstemmed + * words. the first one is used to find the occurance, the + * latter for highlighting it. + */ + +jQuery.makeSearchSummary = function(text, keywords, hlwords) { + var textLower = text.toLowerCase(); + var start = 0; + $.each(keywords, function() { + var i = textLower.indexOf(this.toLowerCase()); + if (i > -1) + start = i; + }); + start = Math.max(start - 120, 0); + var excerpt = ((start > 0) ? '...' : '') + + $.trim(text.substr(start, 240)) + + ((start + 240 - text.length) ? '...' : ''); + var rv = $('
    ').text(excerpt); + $.each(hlwords, function() { + rv = rv.highlightText(this, 'highlighted'); + }); + return rv; +} + +/** + * Porter Stemmer + */ +var PorterStemmer = function() { + + var step2list = { + ational: 'ate', + tional: 'tion', + enci: 'ence', + anci: 'ance', + izer: 'ize', + bli: 'ble', + alli: 'al', + entli: 'ent', + eli: 'e', + ousli: 'ous', + ization: 'ize', + ation: 'ate', + ator: 'ate', + alism: 'al', + iveness: 'ive', + fulness: 'ful', + ousness: 'ous', + aliti: 'al', + iviti: 'ive', + biliti: 'ble', + logi: 'log' + }; + + var step3list = { + icate: 'ic', + ative: '', + alize: 'al', + iciti: 'ic', + ical: 'ic', + ful: '', + ness: '' + }; + + var c = "[^aeiou]"; // consonant + var v = "[aeiouy]"; // vowel + var C = c + "[^aeiouy]*"; // consonant sequence + var V = v + "[aeiou]*"; // vowel sequence + + var mgr0 = "^(" + C + ")?" + V + C; // [C]VC... is m>0 + var meq1 = "^(" + C + ")?" + V + C + "(" + V + ")?$"; // [C]VC[V] is m=1 + var mgr1 = "^(" + C + ")?" + V + C + V + C; // [C]VCVC... is m>1 + var s_v = "^(" + C + ")?" + v; // vowel in stem + + this.stemWord = function (w) { + var stem; + var suffix; + var firstch; + var origword = w; + + if (w.length < 3) + return w; + + var re; + var re2; + var re3; + var re4; + + firstch = w.substr(0,1); + if (firstch == "y") + w = firstch.toUpperCase() + w.substr(1); + + // Step 1a + re = /^(.+?)(ss|i)es$/; + re2 = /^(.+?)([^s])s$/; + + if (re.test(w)) + w = w.replace(re,"$1$2"); + else if (re2.test(w)) + w = w.replace(re2,"$1$2"); + + // Step 1b + re = /^(.+?)eed$/; + re2 = /^(.+?)(ed|ing)$/; + if (re.test(w)) { + var fp = re.exec(w); + re = new RegExp(mgr0); + if (re.test(fp[1])) { + re = /.$/; + w = w.replace(re,""); + } + } + else if (re2.test(w)) { + var fp = re2.exec(w); + stem = fp[1]; + re2 = new RegExp(s_v); + if (re2.test(stem)) { + w = stem; + re2 = /(at|bl|iz)$/; + re3 = new RegExp("([^aeiouylsz])\\1$"); + re4 = new RegExp("^" + C + v + "[^aeiouwxy]$"); + if (re2.test(w)) + w = w + "e"; + else if (re3.test(w)) { + re = /.$/; + w = w.replace(re,""); + } + else if (re4.test(w)) + w = w + "e"; + } + } + + // Step 1c + re = /^(.+?)y$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + re = new RegExp(s_v); + if (re.test(stem)) + w = stem + "i"; + } + + // Step 2 + re = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + suffix = fp[2]; + re = new RegExp(mgr0); + if (re.test(stem)) + w = stem + step2list[suffix]; + } + + // Step 3 + re = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + suffix = fp[2]; + re = new RegExp(mgr0); + if (re.test(stem)) + w = stem + step3list[suffix]; + } + + // Step 4 + re = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/; + re2 = /^(.+?)(s|t)(ion)$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + re = new RegExp(mgr1); + if (re.test(stem)) + w = stem; + } + else if (re2.test(w)) { + var fp = re2.exec(w); + stem = fp[1] + fp[2]; + re2 = new RegExp(mgr1); + if (re2.test(stem)) + w = stem; + } + + // Step 5 + re = /^(.+?)e$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + re = new RegExp(mgr1); + re2 = new RegExp(meq1); + re3 = new RegExp("^" + C + v + "[^aeiouwxy]$"); + if (re.test(stem) || (re2.test(stem) && !(re3.test(stem)))) + w = stem; + } + re = /ll$/; + re2 = new RegExp(mgr1); + if (re.test(w) && re2.test(w)) { + re = /.$/; + w = w.replace(re,""); + } + + // and turn initial Y back to y + if (firstch == "y") + w = firstch.toLowerCase() + w.substr(1); + return w; + } +} + + +/** + * Search Module + */ +var Search = { + + _index : null, + _queued_query : null, + _pulse_status : -1, + + init : function() { + var params = $.getQueryParameters(); + if (params.q) { + var query = params.q[0]; + $('input[name="q"]')[0].value = query; + this.performSearch(query); + } + }, + + loadIndex : function(url) { + $.ajax({type: "GET", url: url, data: null, success: null, + dataType: "script", cache: true}); + }, + + setIndex : function(index) { + var q; + this._index = index; + if ((q = this._queued_query) !== null) { + this._queued_query = null; + Search.query(q); + } + }, + + hasIndex : function() { + return this._index !== null; + }, + + deferQuery : function(query) { + this._queued_query = query; + }, + + stopPulse : function() { + this._pulse_status = 0; + }, + + startPulse : function() { + if (this._pulse_status >= 0) + return; + function pulse() { + Search._pulse_status = (Search._pulse_status + 1) % 4; + var dotString = ''; + for (var i = 0; i < Search._pulse_status; i++) + dotString += '.'; + Search.dots.text(dotString); + if (Search._pulse_status > -1) + window.setTimeout(pulse, 500); + }; + pulse(); + }, + + /** + * perform a search for something + */ + performSearch : function(query) { + // create the required interface elements + this.out = $('#search-results'); + this.title = $('

    ' + _('Searching') + '

    ').appendTo(this.out); + this.dots = $('').appendTo(this.title); + this.status = $('

    ').appendTo(this.out); + this.output = $('
      ').appendTo(this.out); + + $('#search-progress').text(_('Preparing search...')); + this.startPulse(); + + // index already loaded, the browser was quick! + if (this.hasIndex()) + this.query(query); + else + this.deferQuery(query); + }, + + query : function(query) { + var stopwords = ['and', 'then', 'into', 'it', 'as', 'are', 'in', + 'if', 'for', 'no', 'there', 'their', 'was', 'is', + 'be', 'to', 'that', 'but', 'they', 'not', 'such', + 'with', 'by', 'a', 'on', 'these', 'of', 'will', + 'this', 'near', 'the', 'or', 'at']; + + // stem the searchterms and add them to the correct list + var stemmer = new PorterStemmer(); + var searchterms = []; + var excluded = []; + var hlterms = []; + var tmp = query.split(/\s+/); + var object = (tmp.length == 1) ? tmp[0].toLowerCase() : null; + for (var i = 0; i < tmp.length; i++) { + if ($u.indexOf(stopwords, tmp[i]) != -1 || tmp[i].match(/^\d+$/) || + tmp[i] == "") { + // skip this "word" + continue; + } + // stem the word + var word = stemmer.stemWord(tmp[i]).toLowerCase(); + // select the correct list + if (word[0] == '-') { + var toAppend = excluded; + word = word.substr(1); + } + else { + var toAppend = searchterms; + hlterms.push(tmp[i].toLowerCase()); + } + // only add if not already in the list + if (!$.contains(toAppend, word)) + toAppend.push(word); + }; + var highlightstring = '?highlight=' + $.urlencode(hlterms.join(" ")); + + // console.debug('SEARCH: searching for:'); + // console.info('required: ', searchterms); + // console.info('excluded: ', excluded); + + // prepare search + var filenames = this._index.filenames; + var titles = this._index.titles; + var terms = this._index.terms; + var objects = this._index.objects; + var objtypes = this._index.objtypes; + var objnames = this._index.objnames; + var fileMap = {}; + var files = null; + // different result priorities + var importantResults = []; + var objectResults = []; + var regularResults = []; + var unimportantResults = []; + $('#search-progress').empty(); + + // lookup as object + if (object != null) { + for (var prefix in objects) { + for (var name in objects[prefix]) { + var fullname = (prefix ? prefix + '.' : '') + name; + if (fullname.toLowerCase().indexOf(object) > -1) { + match = objects[prefix][name]; + descr = objnames[match[1]] + _(', in ') + titles[match[0]]; + // XXX the generated anchors are not generally correct + // XXX there may be custom prefixes + result = [filenames[match[0]], fullname, '#'+fullname, descr]; + switch (match[2]) { + case 1: objectResults.push(result); break; + case 0: importantResults.push(result); break; + case 2: unimportantResults.push(result); break; + } + } + } + } + } + + // sort results descending + objectResults.sort(function(a, b) { + return (a[1] > b[1]) ? -1 : ((a[1] < b[1]) ? 1 : 0); + }); + + importantResults.sort(function(a, b) { + return (a[1] > b[1]) ? -1 : ((a[1] < b[1]) ? 1 : 0); + }); + + unimportantResults.sort(function(a, b) { + return (a[1] > b[1]) ? -1 : ((a[1] < b[1]) ? 1 : 0); + }); + + + // perform the search on the required terms + for (var i = 0; i < searchterms.length; i++) { + var word = searchterms[i]; + // no match but word was a required one + if ((files = terms[word]) == null) + break; + if (files.length == undefined) { + files = [files]; + } + // create the mapping + for (var j = 0; j < files.length; j++) { + var file = files[j]; + if (file in fileMap) + fileMap[file].push(word); + else + fileMap[file] = [word]; + } + } + + // now check if the files don't contain excluded terms + for (var file in fileMap) { + var valid = true; + + // check if all requirements are matched + if (fileMap[file].length != searchterms.length) + continue; + + // ensure that none of the excluded terms is in the + // search result. + for (var i = 0; i < excluded.length; i++) { + if (terms[excluded[i]] == file || + $.contains(terms[excluded[i]] || [], file)) { + valid = false; + break; + } + } + + // if we have still a valid result we can add it + // to the result list + if (valid) + regularResults.push([filenames[file], titles[file], '', null]); + } + + // delete unused variables in order to not waste + // memory until list is retrieved completely + delete filenames, titles, terms; + + // now sort the regular results descending by title + regularResults.sort(function(a, b) { + var left = a[1].toLowerCase(); + var right = b[1].toLowerCase(); + return (left > right) ? -1 : ((left < right) ? 1 : 0); + }); + + // combine all results + var results = unimportantResults.concat(regularResults) + .concat(objectResults).concat(importantResults); + + // print the results + var resultCount = results.length; + function displayNextItem() { + // results left, load the summary and display it + if (results.length) { + var item = results.pop(); + var listItem = $('
    • '); + if (DOCUMENTATION_OPTIONS.FILE_SUFFIX == '') { + // dirhtml builder + var dirname = item[0] + '/'; + if (dirname.match(/\/index\/$/)) { + dirname = dirname.substring(0, dirname.length-6); + } else if (dirname == 'index/') { + dirname = ''; + } + listItem.append($('').attr('href', + DOCUMENTATION_OPTIONS.URL_ROOT + dirname + + highlightstring + item[2]).html(item[1])); + } else { + // normal html builders + listItem.append($('').attr('href', + item[0] + DOCUMENTATION_OPTIONS.FILE_SUFFIX + + highlightstring + item[2]).html(item[1])); + } + if (item[3]) { + listItem.append($(' (' + item[3] + ')')); + Search.output.append(listItem); + listItem.slideDown(5, function() { + displayNextItem(); + }); + } else if (DOCUMENTATION_OPTIONS.HAS_SOURCE) { + $.get(DOCUMENTATION_OPTIONS.URL_ROOT + '_sources/' + + item[0] + '.txt', function(data) { + if (data != '') { + listItem.append($.makeSearchSummary(data, searchterms, hlterms)); + Search.output.append(listItem); + } + listItem.slideDown(5, function() { + displayNextItem(); + }); + }); + } else { + // no source available, just display title + Search.output.append(listItem); + listItem.slideDown(5, function() { + displayNextItem(); + }); + } + } + // search finished, update title and status message + else { + Search.stopPulse(); + Search.title.text(_('Search Results')); + if (!resultCount) + Search.status.text(_('Your search did not match any documents. Please make sure that all words are spelled correctly and that you\'ve selected enough categories.')); + else + Search.status.text(_('Search finished, found %s page(s) matching the search query.').replace('%s', resultCount)); + Search.status.fadeIn(500); + } + } + displayNextItem(); + } +} + +$(document).ready(function() { + Search.init(); +}); diff --git a/lxq_static/_static/underscore.js b/lxq_static/_static/underscore.js new file mode 100644 index 0000000..9146e08 --- /dev/null +++ b/lxq_static/_static/underscore.js @@ -0,0 +1,16 @@ +(function(){var j=this,n=j._,i=function(a){this._wrapped=a},m=typeof StopIteration!=="undefined"?StopIteration:"__break__",b=j._=function(a){return new i(a)};if(typeof exports!=="undefined")exports._=b;var k=Array.prototype.slice,o=Array.prototype.unshift,p=Object.prototype.toString,q=Object.prototype.hasOwnProperty,r=Object.prototype.propertyIsEnumerable;b.VERSION="0.5.5";b.each=function(a,c,d){try{if(a.forEach)a.forEach(c,d);else if(b.isArray(a)||b.isArguments(a))for(var e=0,f=a.length;e=e.computed&&(e={value:f,computed:g})});return e.value};b.min=function(a,c,d){if(!c&&b.isArray(a))return Math.min.apply(Math,a);var e={computed:Infinity};b.each(a,function(f,g,h){g=c?c.call(d,f,g,h):f;gf?1:0}),"value")};b.sortedIndex=function(a,c,d){d=d||b.identity;for(var e=0,f=a.length;e>1;d(a[g])=0})})};b.zip=function(){for(var a=b.toArray(arguments),c=b.max(b.pluck(a,"length")),d=new Array(c),e=0;e0?f-c:c-f)>=0)return e;e[g++]=f}};b.bind=function(a,c){var d=b.rest(arguments,2);return function(){return a.apply(c||j,d.concat(b.toArray(arguments)))}};b.bindAll=function(a){var c=b.rest(arguments);if(c.length==0)c=b.functions(a);b.each(c,function(d){a[d]=b.bind(a[d],a)}); +return a};b.delay=function(a,c){var d=b.rest(arguments,2);return setTimeout(function(){return a.apply(a,d)},c)};b.defer=function(a){return b.delay.apply(b,[a,1].concat(b.rest(arguments)))};b.wrap=function(a,c){return function(){var d=[a].concat(b.toArray(arguments));return c.apply(c,d)}};b.compose=function(){var a=b.toArray(arguments);return function(){for(var c=b.toArray(arguments),d=a.length-1;d>=0;d--)c=[a[d].apply(this,c)];return c[0]}};b.keys=function(a){if(b.isArray(a))return b.range(0,a.length); +var c=[];for(var d in a)q.call(a,d)&&c.push(d);return c};b.values=function(a){return b.map(a,b.identity)};b.functions=function(a){return b.select(b.keys(a),function(c){return b.isFunction(a[c])}).sort()};b.extend=function(a,c){for(var d in c)a[d]=c[d];return a};b.clone=function(a){if(b.isArray(a))return a.slice(0);return b.extend({},a)};b.tap=function(a,c){c(a);return a};b.isEqual=function(a,c){if(a===c)return true;var d=typeof a;if(d!=typeof c)return false;if(a==c)return true;if(!a&&c||a&&!c)return false; +if(a.isEqual)return a.isEqual(c);if(b.isDate(a)&&b.isDate(c))return a.getTime()===c.getTime();if(b.isNaN(a)&&b.isNaN(c))return true;if(b.isRegExp(a)&&b.isRegExp(c))return a.source===c.source&&a.global===c.global&&a.ignoreCase===c.ignoreCase&&a.multiline===c.multiline;if(d!=="object")return false;if(a.length&&a.length!==c.length)return false;d=b.keys(a);var e=b.keys(c);if(d.length!=e.length)return false;for(var f in a)if(!b.isEqual(a[f],c[f]))return false;return true};b.isEmpty=function(a){return b.keys(a).length== +0};b.isElement=function(a){return!!(a&&a.nodeType==1)};b.isArray=function(a){return!!(a&&a.concat&&a.unshift)};b.isArguments=function(a){return a&&b.isNumber(a.length)&&!b.isArray(a)&&!r.call(a,"length")};b.isFunction=function(a){return!!(a&&a.constructor&&a.call&&a.apply)};b.isString=function(a){return!!(a===""||a&&a.charCodeAt&&a.substr)};b.isNumber=function(a){return p.call(a)==="[object Number]"};b.isDate=function(a){return!!(a&&a.getTimezoneOffset&&a.setUTCFullYear)};b.isRegExp=function(a){return!!(a&& +a.test&&a.exec&&(a.ignoreCase||a.ignoreCase===false))};b.isNaN=function(a){return b.isNumber(a)&&isNaN(a)};b.isNull=function(a){return a===null};b.isUndefined=function(a){return typeof a=="undefined"};b.noConflict=function(){j._=n;return this};b.identity=function(a){return a};b.breakLoop=function(){throw m;};var s=0;b.uniqueId=function(a){var c=s++;return a?a+c:c};b.template=function(a,c){a=new Function("obj","var p=[],print=function(){p.push.apply(p,arguments);};with(obj){p.push('"+a.replace(/[\r\t\n]/g, +" ").replace(/'(?=[^%]*%>)/g,"\t").split("'").join("\\'").split("\t").join("'").replace(/<%=(.+?)%>/g,"',$1,'").split("<%").join("');").split("%>").join("p.push('")+"');}return p.join('');");return c?a(c):a};b.forEach=b.each;b.foldl=b.inject=b.reduce;b.foldr=b.reduceRight;b.filter=b.select;b.every=b.all;b.some=b.any;b.head=b.first;b.tail=b.rest;b.methods=b.functions;var l=function(a,c){return c?b(a).chain():a};b.each(b.functions(b),function(a){var c=b[a];i.prototype[a]=function(){var d=b.toArray(arguments); +o.call(d,this._wrapped);return l(c.apply(b,d),this._chain)}});b.each(["pop","push","reverse","shift","sort","splice","unshift"],function(a){var c=Array.prototype[a];i.prototype[a]=function(){c.apply(this._wrapped,arguments);return l(this._wrapped,this._chain)}});b.each(["concat","join","slice"],function(a){var c=Array.prototype[a];i.prototype[a]=function(){return l(c.apply(this._wrapped,arguments),this._chain)}});i.prototype.chain=function(){this._chain=true;return this};i.prototype.value=function(){return this._wrapped}})(); diff --git a/lxq_static/basic.css b/lxq_static/basic.css new file mode 100644 index 0000000..69f30d4 --- /dev/null +++ b/lxq_static/basic.css @@ -0,0 +1,509 @@ +/* + * basic.css + * ~~~~~~~~~ + * + * Sphinx stylesheet -- basic theme. + * + * :copyright: Copyright 2007-2010 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/* -- main layout ----------------------------------------------------------- */ + +div.clearer { + clear: both; +} + +/* -- relbar ---------------------------------------------------------------- */ + +div.related { + width: 100%; + font-size: 90%; +} + +div.related h3 { + display: none; +} + +div.related ul { + margin: 0; + padding: 0 0 0 10px; + list-style: none; +} + +div.related li { + display: inline; +} + +div.related li.right { + float: right; + margin-right: 5px; +} + +/* -- sidebar --------------------------------------------------------------- */ + +div.sphinxsidebarwrapper { + padding: 10px 5px 0 10px; +} + +div.sphinxsidebar { + float: left; + width: 230px; + margin-left: -100%; + font-size: 90%; +} + +div.sphinxsidebar ul { + list-style: none; +} + +div.sphinxsidebar ul ul, +div.sphinxsidebar ul.want-points { + margin-left: 20px; + list-style: square; +} + +div.sphinxsidebar ul ul { + margin-top: 0; + margin-bottom: 0; +} + +div.sphinxsidebar form { + margin-top: 10px; +} + +div.sphinxsidebar input { + border: 1px solid #98dbcc; + font-family: sans-serif; + font-size: 1em; +} + +img { + border: 0; +} + +/* -- search page ----------------------------------------------------------- */ + +ul.search { + margin: 10px 0 0 20px; + padding: 0; +} + +ul.search li { + padding: 5px 0 5px 20px; + background-image: url(file.png); + background-repeat: no-repeat; + background-position: 0 7px; +} + +ul.search li a { + font-weight: bold; +} + +ul.search li div.context { + color: #888; + margin: 2px 0 0 30px; + text-align: left; +} + +ul.keywordmatches li.goodmatch a { + font-weight: bold; +} + +/* -- index page ------------------------------------------------------------ */ + +table.contentstable { + width: 90%; +} + +table.contentstable p.biglink { + line-height: 150%; +} + +a.biglink { + font-size: 1.3em; +} + +span.linkdescr { + font-style: italic; + padding-top: 5px; + font-size: 90%; +} + +/* -- general index --------------------------------------------------------- */ + +table.indextable { + width: 100%; +} + +table.indextable td { + text-align: left; + vertical-align: top; +} + +table.indextable dl, table.indextable dd { + margin-top: 0; + margin-bottom: 0; +} + +table.indextable tr.pcap { + height: 10px; +} + +table.indextable tr.cap { + margin-top: 10px; + background-color: #f2f2f2; +} + +img.toggler { + margin-right: 3px; + margin-top: 3px; + cursor: pointer; +} + +div.modindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +div.genindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +/* -- general body styles --------------------------------------------------- */ + +a.headerlink { + visibility: hidden; +} + +h1:hover > a.headerlink, +h2:hover > a.headerlink, +h3:hover > a.headerlink, +h4:hover > a.headerlink, +h5:hover > a.headerlink, +h6:hover > a.headerlink, +dt:hover > a.headerlink { + visibility: visible; +} + +div.body p.caption { + text-align: inherit; +} + +div.body td { + text-align: left; +} + +.field-list ul { + padding-left: 1em; +} + +.first { + margin-top: 0 !important; +} + +p.rubric { + margin-top: 30px; + font-weight: bold; +} + +.align-left { + text-align: left; +} + +.align-center { + clear: both; + text-align: center; +} + +.align-right { + text-align: right; +} + +/* -- sidebars -------------------------------------------------------------- */ + +div.sidebar { + margin: 0 0 0.5em 1em; + border: 1px solid #ddb; + padding: 7px 7px 0 7px; + background-color: #ffe; + width: 40%; + float: right; +} + +p.sidebar-title { + font-weight: bold; +} + +/* -- topics ---------------------------------------------------------------- */ + +div.topic { + border: 1px solid #ccc; + padding: 7px 7px 0 7px; + margin: 10px 0 10px 0; +} + +p.topic-title { + font-size: 1.1em; + font-weight: bold; + margin-top: 10px; +} + +/* -- admonitions ----------------------------------------------------------- */ + +div.admonition { + margin-top: 10px; + margin-bottom: 10px; + padding: 7px; +} + +div.admonition dt { + font-weight: bold; +} + +div.admonition dl { + margin-bottom: 0; +} + +p.admonition-title { + margin: 0px 10px 5px 0px; + font-weight: bold; +} + +div.body p.centered { + text-align: center; + margin-top: 25px; +} + +/* -- tables ---------------------------------------------------------------- */ + +table.docutils { + border: 0; + border-collapse: collapse; +} + +table.docutils td, table.docutils th { + padding: 1px 8px 1px 5px; + border-top: 0; + border-left: 0; + border-right: 0; + border-bottom: 1px solid #aaa; +} + +table.field-list td, table.field-list th { + border: 0 !important; +} + +table.footnote td, table.footnote th { + border: 0 !important; +} + +th { + text-align: left; + padding-right: 5px; +} + +table.citation { + border-left: solid 1px gray; + margin-left: 1px; +} + +table.citation td { + border-bottom: none; +} + +/* -- other body styles ----------------------------------------------------- */ + +ol.arabic { + list-style: decimal; +} + +ol.loweralpha { + list-style: lower-alpha; +} + +ol.upperalpha { + list-style: upper-alpha; +} + +ol.lowerroman { + list-style: lower-roman; +} + +ol.upperroman { + list-style: upper-roman; +} + +dl { + margin-bottom: 15px; +} + +dd p { + margin-top: 0px; +} + +dd ul, dd table { + margin-bottom: 10px; +} + +dd { + margin-top: 3px; + margin-bottom: 10px; + margin-left: 30px; +} + +dt:target, .highlighted { + background-color: #fbe54e; +} + +dl.glossary dt { + font-weight: bold; + font-size: 1.1em; +} + +.field-list ul { + margin: 0; + padding-left: 1em; +} + +.field-list p { + margin: 0; +} + +.refcount { + color: #060; +} + +.optional { + font-size: 1.3em; +} + +.versionmodified { + font-style: italic; +} + +.system-message { + background-color: #fda; + padding: 5px; + border: 3px solid red; +} + +.footnote:target { + background-color: #ffa +} + +.line-block { + display: block; + margin-top: 1em; + margin-bottom: 1em; +} + +.line-block .line-block { + margin-top: 0; + margin-bottom: 0; + margin-left: 1.5em; +} + +.guilabel, .menuselection { + font-family: sans-serif; +} + +.accelerator { + text-decoration: underline; +} + +.classifier { + font-style: oblique; +} + +/* -- code displays --------------------------------------------------------- */ + +pre { + overflow: auto; +} + +td.linenos pre { + padding: 5px 0px; + border: 0; + background-color: transparent; + color: #aaa; +} + +table.highlighttable { + margin-left: 0.5em; +} + +table.highlighttable td { + padding: 0 0.5em 0 0.5em; +} + +tt.descname { + background-color: transparent; + font-weight: bold; + font-size: 1.2em; +} + +tt.descclassname { + background-color: transparent; +} + +tt.xref, a tt { + background-color: transparent; + font-weight: bold; +} + +h1 tt, h2 tt, h3 tt, h4 tt, h5 tt, h6 tt { + background-color: transparent; +} + +.viewcode-link { + float: right; +} + +.viewcode-back { + float: right; + font-family: sans-serif; +} + +div.viewcode-block:target { + margin: -1px -10px; + padding: 0 10px; +} + +/* -- math display ---------------------------------------------------------- */ + +img.math { + vertical-align: middle; +} + +div.body div.math p { + text-align: center; +} + +span.eqno { + float: right; +} + +/* -- printout stylesheet --------------------------------------------------- */ + +@media print { + div.document, + div.documentwrapper, + div.bodywrapper { + margin: 0 !important; + width: 100%; + } + + div.sphinxsidebar, + div.related, + div.footer, + #top-link { + display: none; + } +} diff --git a/lxq_static/doctools.js b/lxq_static/doctools.js new file mode 100644 index 0000000..eeea95e --- /dev/null +++ b/lxq_static/doctools.js @@ -0,0 +1,247 @@ +/* + * doctools.js + * ~~~~~~~~~~~ + * + * Sphinx JavaScript utilties for all documentation. + * + * :copyright: Copyright 2007-2010 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/** + * select a different prefix for underscore + */ +$u = _.noConflict(); + +/** + * make the code below compatible with browsers without + * an installed firebug like debugger +if (!window.console || !console.firebug) { + var names = ["log", "debug", "info", "warn", "error", "assert", "dir", + "dirxml", "group", "groupEnd", "time", "timeEnd", "count", "trace", + "profile", "profileEnd"]; + window.console = {}; + for (var i = 0; i < names.length; ++i) + window.console[names[i]] = function() {}; +} + */ + +/** + * small helper function to urldecode strings + */ +jQuery.urldecode = function(x) { + return decodeURIComponent(x).replace(/\+/g, ' '); +} + +/** + * small helper function to urlencode strings + */ +jQuery.urlencode = encodeURIComponent; + +/** + * This function returns the parsed url parameters of the + * current request. Multiple values per key are supported, + * it will always return arrays of strings for the value parts. + */ +jQuery.getQueryParameters = function(s) { + if (typeof s == 'undefined') + s = document.location.search; + var parts = s.substr(s.indexOf('?') + 1).split('&'); + var result = {}; + for (var i = 0; i < parts.length; i++) { + var tmp = parts[i].split('=', 2); + var key = jQuery.urldecode(tmp[0]); + var value = jQuery.urldecode(tmp[1]); + if (key in result) + result[key].push(value); + else + result[key] = [value]; + } + return result; +}; + +/** + * small function to check if an array contains + * a given item. + */ +jQuery.contains = function(arr, item) { + for (var i = 0; i < arr.length; i++) { + if (arr[i] == item) + return true; + } + return false; +}; + +/** + * highlight a given string on a jquery object by wrapping it in + * span elements with the given class name. + */ +jQuery.fn.highlightText = function(text, className) { + function highlight(node) { + if (node.nodeType == 3) { + var val = node.nodeValue; + var pos = val.toLowerCase().indexOf(text); + if (pos >= 0 && !jQuery(node.parentNode).hasClass(className)) { + var span = document.createElement("span"); + span.className = className; + span.appendChild(document.createTextNode(val.substr(pos, text.length))); + node.parentNode.insertBefore(span, node.parentNode.insertBefore( + document.createTextNode(val.substr(pos + text.length)), + node.nextSibling)); + node.nodeValue = val.substr(0, pos); + } + } + else if (!jQuery(node).is("button, select, textarea")) { + jQuery.each(node.childNodes, function() { + highlight(this); + }); + } + } + return this.each(function() { + highlight(this); + }); +}; + +/** + * Small JavaScript module for the documentation. + */ +var Documentation = { + + init : function() { + this.fixFirefoxAnchorBug(); + this.highlightSearchWords(); + this.initIndexTable(); + }, + + /** + * i18n support + */ + TRANSLATIONS : {}, + PLURAL_EXPR : function(n) { return n == 1 ? 0 : 1; }, + LOCALE : 'unknown', + + // gettext and ngettext don't access this so that the functions + // can safely bound to a different name (_ = Documentation.gettext) + gettext : function(string) { + var translated = Documentation.TRANSLATIONS[string]; + if (typeof translated == 'undefined') + return string; + return (typeof translated == 'string') ? translated : translated[0]; + }, + + ngettext : function(singular, plural, n) { + var translated = Documentation.TRANSLATIONS[singular]; + if (typeof translated == 'undefined') + return (n == 1) ? singular : plural; + return translated[Documentation.PLURALEXPR(n)]; + }, + + addTranslations : function(catalog) { + for (var key in catalog.messages) + this.TRANSLATIONS[key] = catalog.messages[key]; + this.PLURAL_EXPR = new Function('n', 'return +(' + catalog.plural_expr + ')'); + this.LOCALE = catalog.locale; + }, + + /** + * add context elements like header anchor links + */ + addContextElements : function() { + $('div[id] > :header:first').each(function() { + $('\u00B6'). + attr('href', '#' + this.id). + attr('title', _('Permalink to this headline')). + appendTo(this); + }); + $('dt[id]').each(function() { + $('\u00B6'). + attr('href', '#' + this.id). + attr('title', _('Permalink to this definition')). + appendTo(this); + }); + }, + + /** + * workaround a firefox stupidity + */ + fixFirefoxAnchorBug : function() { + if (document.location.hash && $.browser.mozilla) + window.setTimeout(function() { + document.location.href += ''; + }, 10); + }, + + /** + * highlight the search words provided in the url in the text + */ + highlightSearchWords : function() { + var params = $.getQueryParameters(); + var terms = (params.highlight) ? params.highlight[0].split(/\s+/) : []; + if (terms.length) { + var body = $('div.body'); + window.setTimeout(function() { + $.each(terms, function() { + body.highlightText(this.toLowerCase(), 'highlighted'); + }); + }, 10); + $('
    • ' + _('Hide Search Matches') + '
      • ') + .appendTo($('.sidebar .this-page-menu')); + } + }, + + /** + * init the domain index toggle buttons + */ + initIndexTable : function() { + var togglers = $('img.toggler').click(function() { + var src = $(this).attr('src'); + var idnum = $(this).attr('id').substr(7); + $('tr.cg-' + idnum).toggle(); + if (src.substr(-9) == 'minus.png') + $(this).attr('src', src.substr(0, src.length-9) + 'plus.png'); + else + $(this).attr('src', src.substr(0, src.length-8) + 'minus.png'); + }).css('display', ''); + if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) { + togglers.click(); + } + }, + + /** + * helper function to hide the search marks again + */ + hideSearchWords : function() { + $('.sidebar .this-page-menu li.highlight-link').fadeOut(300); + $('span.highlighted').removeClass('highlighted'); + }, + + /** + * make the url absolute + */ + makeURL : function(relativeURL) { + return DOCUMENTATION_OPTIONS.URL_ROOT + '/' + relativeURL; + }, + + /** + * get the current relative url + */ + getCurrentURL : function() { + var path = document.location.pathname; + var parts = path.split(/\//); + $.each(DOCUMENTATION_OPTIONS.URL_ROOT.split(/\//), function() { + if (this == '..') + parts.pop(); + }); + var url = parts.join('/'); + return path.substring(url.lastIndexOf('/') + 1, path.length - 1); + } +}; + +// quick alias for translations +_ = Documentation.gettext; + +$(document).ready(function() { + Documentation.init(); +}); diff --git a/lxq_static/file.png b/lxq_static/file.png new file mode 100644 index 0000000..d18082e Binary files /dev/null and b/lxq_static/file.png differ diff --git a/lxq_static/jquery.js b/lxq_static/jquery.js new file mode 100644 index 0000000..7c24308 --- /dev/null +++ b/lxq_static/jquery.js @@ -0,0 +1,154 @@ +/*! + * jQuery JavaScript Library v1.4.2 + * http://jquery.com/ + * + * Copyright 2010, John Resig + * Dual licensed under the MIT or GPL Version 2 licenses. + * http://jquery.org/license + * + * Includes Sizzle.js + * http://sizzlejs.com/ + * Copyright 2010, The Dojo Foundation + * Released under the MIT, BSD, and GPL Licenses. + * + * Date: Sat Feb 13 22:33:48 2010 -0500 + */ +(function(A,w){function ma(){if(!c.isReady){try{s.documentElement.doScroll("left")}catch(a){setTimeout(ma,1);return}c.ready()}}function Qa(a,b){b.src?c.ajax({url:b.src,async:false,dataType:"script"}):c.globalEval(b.text||b.textContent||b.innerHTML||"");b.parentNode&&b.parentNode.removeChild(b)}function X(a,b,d,f,e,j){var i=a.length;if(typeof b==="object"){for(var o in b)X(a,o,b[o],f,e,d);return a}if(d!==w){f=!j&&f&&c.isFunction(d);for(o=0;o)[^>]*$|^#([\w-]+)$/,Ua=/^.[^:#\[\.,]*$/,Va=/\S/, +Wa=/^(\s|\u00A0)+|(\s|\u00A0)+$/g,Xa=/^<(\w+)\s*\/?>(?:<\/\1>)?$/,P=navigator.userAgent,xa=false,Q=[],L,$=Object.prototype.toString,aa=Object.prototype.hasOwnProperty,ba=Array.prototype.push,R=Array.prototype.slice,ya=Array.prototype.indexOf;c.fn=c.prototype={init:function(a,b){var d,f;if(!a)return this;if(a.nodeType){this.context=this[0]=a;this.length=1;return this}if(a==="body"&&!b){this.context=s;this[0]=s.body;this.selector="body";this.length=1;return this}if(typeof a==="string")if((d=Ta.exec(a))&& +(d[1]||!b))if(d[1]){f=b?b.ownerDocument||b:s;if(a=Xa.exec(a))if(c.isPlainObject(b)){a=[s.createElement(a[1])];c.fn.attr.call(a,b,true)}else a=[f.createElement(a[1])];else{a=sa([d[1]],[f]);a=(a.cacheable?a.fragment.cloneNode(true):a.fragment).childNodes}return c.merge(this,a)}else{if(b=s.getElementById(d[2])){if(b.id!==d[2])return T.find(a);this.length=1;this[0]=b}this.context=s;this.selector=a;return this}else if(!b&&/^\w+$/.test(a)){this.selector=a;this.context=s;a=s.getElementsByTagName(a);return c.merge(this, +a)}else return!b||b.jquery?(b||T).find(a):c(b).find(a);else if(c.isFunction(a))return T.ready(a);if(a.selector!==w){this.selector=a.selector;this.context=a.context}return c.makeArray(a,this)},selector:"",jquery:"1.4.2",length:0,size:function(){return this.length},toArray:function(){return R.call(this,0)},get:function(a){return a==null?this.toArray():a<0?this.slice(a)[0]:this[a]},pushStack:function(a,b,d){var f=c();c.isArray(a)?ba.apply(f,a):c.merge(f,a);f.prevObject=this;f.context=this.context;if(b=== +"find")f.selector=this.selector+(this.selector?" ":"")+d;else if(b)f.selector=this.selector+"."+b+"("+d+")";return f},each:function(a,b){return c.each(this,a,b)},ready:function(a){c.bindReady();if(c.isReady)a.call(s,c);else Q&&Q.push(a);return this},eq:function(a){return a===-1?this.slice(a):this.slice(a,+a+1)},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},slice:function(){return this.pushStack(R.apply(this,arguments),"slice",R.call(arguments).join(","))},map:function(a){return this.pushStack(c.map(this, +function(b,d){return a.call(b,d,b)}))},end:function(){return this.prevObject||c(null)},push:ba,sort:[].sort,splice:[].splice};c.fn.init.prototype=c.fn;c.extend=c.fn.extend=function(){var a=arguments[0]||{},b=1,d=arguments.length,f=false,e,j,i,o;if(typeof a==="boolean"){f=a;a=arguments[1]||{};b=2}if(typeof a!=="object"&&!c.isFunction(a))a={};if(d===b){a=this;--b}for(;b
      a"; +var e=d.getElementsByTagName("*"),j=d.getElementsByTagName("a")[0];if(!(!e||!e.length||!j)){c.support={leadingWhitespace:d.firstChild.nodeType===3,tbody:!d.getElementsByTagName("tbody").length,htmlSerialize:!!d.getElementsByTagName("link").length,style:/red/.test(j.getAttribute("style")),hrefNormalized:j.getAttribute("href")==="/a",opacity:/^0.55$/.test(j.style.opacity),cssFloat:!!j.style.cssFloat,checkOn:d.getElementsByTagName("input")[0].value==="on",optSelected:s.createElement("select").appendChild(s.createElement("option")).selected, +parentNode:d.removeChild(d.appendChild(s.createElement("div"))).parentNode===null,deleteExpando:true,checkClone:false,scriptEval:false,noCloneEvent:true,boxModel:null};b.type="text/javascript";try{b.appendChild(s.createTextNode("window."+f+"=1;"))}catch(i){}a.insertBefore(b,a.firstChild);if(A[f]){c.support.scriptEval=true;delete A[f]}try{delete b.test}catch(o){c.support.deleteExpando=false}a.removeChild(b);if(d.attachEvent&&d.fireEvent){d.attachEvent("onclick",function k(){c.support.noCloneEvent= +false;d.detachEvent("onclick",k)});d.cloneNode(true).fireEvent("onclick")}d=s.createElement("div");d.innerHTML="";a=s.createDocumentFragment();a.appendChild(d.firstChild);c.support.checkClone=a.cloneNode(true).cloneNode(true).lastChild.checked;c(function(){var k=s.createElement("div");k.style.width=k.style.paddingLeft="1px";s.body.appendChild(k);c.boxModel=c.support.boxModel=k.offsetWidth===2;s.body.removeChild(k).style.display="none"});a=function(k){var n= +s.createElement("div");k="on"+k;var r=k in n;if(!r){n.setAttribute(k,"return;");r=typeof n[k]==="function"}return r};c.support.submitBubbles=a("submit");c.support.changeBubbles=a("change");a=b=d=e=j=null}})();c.props={"for":"htmlFor","class":"className",readonly:"readOnly",maxlength:"maxLength",cellspacing:"cellSpacing",rowspan:"rowSpan",colspan:"colSpan",tabindex:"tabIndex",usemap:"useMap",frameborder:"frameBorder"};var G="jQuery"+J(),Ya=0,za={};c.extend({cache:{},expando:G,noData:{embed:true,object:true, +applet:true},data:function(a,b,d){if(!(a.nodeName&&c.noData[a.nodeName.toLowerCase()])){a=a==A?za:a;var f=a[G],e=c.cache;if(!f&&typeof b==="string"&&d===w)return null;f||(f=++Ya);if(typeof b==="object"){a[G]=f;e[f]=c.extend(true,{},b)}else if(!e[f]){a[G]=f;e[f]={}}a=e[f];if(d!==w)a[b]=d;return typeof b==="string"?a[b]:a}},removeData:function(a,b){if(!(a.nodeName&&c.noData[a.nodeName.toLowerCase()])){a=a==A?za:a;var d=a[G],f=c.cache,e=f[d];if(b){if(e){delete e[b];c.isEmptyObject(e)&&c.removeData(a)}}else{if(c.support.deleteExpando)delete a[c.expando]; +else a.removeAttribute&&a.removeAttribute(c.expando);delete f[d]}}}});c.fn.extend({data:function(a,b){if(typeof a==="undefined"&&this.length)return c.data(this[0]);else if(typeof a==="object")return this.each(function(){c.data(this,a)});var d=a.split(".");d[1]=d[1]?"."+d[1]:"";if(b===w){var f=this.triggerHandler("getData"+d[1]+"!",[d[0]]);if(f===w&&this.length)f=c.data(this[0],a);return f===w&&d[1]?this.data(d[0]):f}else return this.trigger("setData"+d[1]+"!",[d[0],b]).each(function(){c.data(this, +a,b)})},removeData:function(a){return this.each(function(){c.removeData(this,a)})}});c.extend({queue:function(a,b,d){if(a){b=(b||"fx")+"queue";var f=c.data(a,b);if(!d)return f||[];if(!f||c.isArray(d))f=c.data(a,b,c.makeArray(d));else f.push(d);return f}},dequeue:function(a,b){b=b||"fx";var d=c.queue(a,b),f=d.shift();if(f==="inprogress")f=d.shift();if(f){b==="fx"&&d.unshift("inprogress");f.call(a,function(){c.dequeue(a,b)})}}});c.fn.extend({queue:function(a,b){if(typeof a!=="string"){b=a;a="fx"}if(b=== +w)return c.queue(this[0],a);return this.each(function(){var d=c.queue(this,a,b);a==="fx"&&d[0]!=="inprogress"&&c.dequeue(this,a)})},dequeue:function(a){return this.each(function(){c.dequeue(this,a)})},delay:function(a,b){a=c.fx?c.fx.speeds[a]||a:a;b=b||"fx";return this.queue(b,function(){var d=this;setTimeout(function(){c.dequeue(d,b)},a)})},clearQueue:function(a){return this.queue(a||"fx",[])}});var Aa=/[\n\t]/g,ca=/\s+/,Za=/\r/g,$a=/href|src|style/,ab=/(button|input)/i,bb=/(button|input|object|select|textarea)/i, +cb=/^(a|area)$/i,Ba=/radio|checkbox/;c.fn.extend({attr:function(a,b){return X(this,a,b,true,c.attr)},removeAttr:function(a){return this.each(function(){c.attr(this,a,"");this.nodeType===1&&this.removeAttribute(a)})},addClass:function(a){if(c.isFunction(a))return this.each(function(n){var r=c(this);r.addClass(a.call(this,n,r.attr("class")))});if(a&&typeof a==="string")for(var b=(a||"").split(ca),d=0,f=this.length;d-1)return true;return false},val:function(a){if(a===w){var b=this[0];if(b){if(c.nodeName(b,"option"))return(b.attributes.value||{}).specified?b.value:b.text;if(c.nodeName(b,"select")){var d=b.selectedIndex,f=[],e=b.options;b=b.type==="select-one";if(d<0)return null;var j=b?d:0;for(d=b?d+1:e.length;j=0;else if(c.nodeName(this,"select")){var u=c.makeArray(r);c("option",this).each(function(){this.selected= +c.inArray(c(this).val(),u)>=0});if(!u.length)this.selectedIndex=-1}else this.value=r}})}});c.extend({attrFn:{val:true,css:true,html:true,text:true,data:true,width:true,height:true,offset:true},attr:function(a,b,d,f){if(!a||a.nodeType===3||a.nodeType===8)return w;if(f&&b in c.attrFn)return c(a)[b](d);f=a.nodeType!==1||!c.isXMLDoc(a);var e=d!==w;b=f&&c.props[b]||b;if(a.nodeType===1){var j=$a.test(b);if(b in a&&f&&!j){if(e){b==="type"&&ab.test(a.nodeName)&&a.parentNode&&c.error("type property can't be changed"); +a[b]=d}if(c.nodeName(a,"form")&&a.getAttributeNode(b))return a.getAttributeNode(b).nodeValue;if(b==="tabIndex")return(b=a.getAttributeNode("tabIndex"))&&b.specified?b.value:bb.test(a.nodeName)||cb.test(a.nodeName)&&a.href?0:w;return a[b]}if(!c.support.style&&f&&b==="style"){if(e)a.style.cssText=""+d;return a.style.cssText}e&&a.setAttribute(b,""+d);a=!c.support.hrefNormalized&&f&&j?a.getAttribute(b,2):a.getAttribute(b);return a===null?w:a}return c.style(a,b,d)}});var O=/\.(.*)$/,db=function(a){return a.replace(/[^\w\s\.\|`]/g, +function(b){return"\\"+b})};c.event={add:function(a,b,d,f){if(!(a.nodeType===3||a.nodeType===8)){if(a.setInterval&&a!==A&&!a.frameElement)a=A;var e,j;if(d.handler){e=d;d=e.handler}if(!d.guid)d.guid=c.guid++;if(j=c.data(a)){var i=j.events=j.events||{},o=j.handle;if(!o)j.handle=o=function(){return typeof c!=="undefined"&&!c.event.triggered?c.event.handle.apply(o.elem,arguments):w};o.elem=a;b=b.split(" ");for(var k,n=0,r;k=b[n++];){j=e?c.extend({},e):{handler:d,data:f};if(k.indexOf(".")>-1){r=k.split("."); +k=r.shift();j.namespace=r.slice(0).sort().join(".")}else{r=[];j.namespace=""}j.type=k;j.guid=d.guid;var u=i[k],z=c.event.special[k]||{};if(!u){u=i[k]=[];if(!z.setup||z.setup.call(a,f,r,o)===false)if(a.addEventListener)a.addEventListener(k,o,false);else a.attachEvent&&a.attachEvent("on"+k,o)}if(z.add){z.add.call(a,j);if(!j.handler.guid)j.handler.guid=d.guid}u.push(j);c.event.global[k]=true}a=null}}},global:{},remove:function(a,b,d,f){if(!(a.nodeType===3||a.nodeType===8)){var e,j=0,i,o,k,n,r,u,z=c.data(a), +C=z&&z.events;if(z&&C){if(b&&b.type){d=b.handler;b=b.type}if(!b||typeof b==="string"&&b.charAt(0)==="."){b=b||"";for(e in C)c.event.remove(a,e+b)}else{for(b=b.split(" ");e=b[j++];){n=e;i=e.indexOf(".")<0;o=[];if(!i){o=e.split(".");e=o.shift();k=new RegExp("(^|\\.)"+c.map(o.slice(0).sort(),db).join("\\.(?:.*\\.)?")+"(\\.|$)")}if(r=C[e])if(d){n=c.event.special[e]||{};for(B=f||0;B=0){a.type= +e=e.slice(0,-1);a.exclusive=true}if(!d){a.stopPropagation();c.event.global[e]&&c.each(c.cache,function(){this.events&&this.events[e]&&c.event.trigger(a,b,this.handle.elem)})}if(!d||d.nodeType===3||d.nodeType===8)return w;a.result=w;a.target=d;b=c.makeArray(b);b.unshift(a)}a.currentTarget=d;(f=c.data(d,"handle"))&&f.apply(d,b);f=d.parentNode||d.ownerDocument;try{if(!(d&&d.nodeName&&c.noData[d.nodeName.toLowerCase()]))if(d["on"+e]&&d["on"+e].apply(d,b)===false)a.result=false}catch(j){}if(!a.isPropagationStopped()&& +f)c.event.trigger(a,b,f,true);else if(!a.isDefaultPrevented()){f=a.target;var i,o=c.nodeName(f,"a")&&e==="click",k=c.event.special[e]||{};if((!k._default||k._default.call(d,a)===false)&&!o&&!(f&&f.nodeName&&c.noData[f.nodeName.toLowerCase()])){try{if(f[e]){if(i=f["on"+e])f["on"+e]=null;c.event.triggered=true;f[e]()}}catch(n){}if(i)f["on"+e]=i;c.event.triggered=false}}},handle:function(a){var b,d,f,e;a=arguments[0]=c.event.fix(a||A.event);a.currentTarget=this;b=a.type.indexOf(".")<0&&!a.exclusive; +if(!b){d=a.type.split(".");a.type=d.shift();f=new RegExp("(^|\\.)"+d.slice(0).sort().join("\\.(?:.*\\.)?")+"(\\.|$)")}e=c.data(this,"events");d=e[a.type];if(e&&d){d=d.slice(0);e=0;for(var j=d.length;e-1?c.map(a.options,function(f){return f.selected}).join("-"):"";else if(a.nodeName.toLowerCase()==="select")d=a.selectedIndex;return d},fa=function(a,b){var d=a.target,f,e;if(!(!da.test(d.nodeName)||d.readOnly)){f=c.data(d,"_change_data");e=Fa(d);if(a.type!=="focusout"||d.type!=="radio")c.data(d,"_change_data", +e);if(!(f===w||e===f))if(f!=null||e){a.type="change";return c.event.trigger(a,b,d)}}};c.event.special.change={filters:{focusout:fa,click:function(a){var b=a.target,d=b.type;if(d==="radio"||d==="checkbox"||b.nodeName.toLowerCase()==="select")return fa.call(this,a)},keydown:function(a){var b=a.target,d=b.type;if(a.keyCode===13&&b.nodeName.toLowerCase()!=="textarea"||a.keyCode===32&&(d==="checkbox"||d==="radio")||d==="select-multiple")return fa.call(this,a)},beforeactivate:function(a){a=a.target;c.data(a, +"_change_data",Fa(a))}},setup:function(){if(this.type==="file")return false;for(var a in ea)c.event.add(this,a+".specialChange",ea[a]);return da.test(this.nodeName)},teardown:function(){c.event.remove(this,".specialChange");return da.test(this.nodeName)}};ea=c.event.special.change.filters}s.addEventListener&&c.each({focus:"focusin",blur:"focusout"},function(a,b){function d(f){f=c.event.fix(f);f.type=b;return c.event.handle.call(this,f)}c.event.special[b]={setup:function(){this.addEventListener(a, +d,true)},teardown:function(){this.removeEventListener(a,d,true)}}});c.each(["bind","one"],function(a,b){c.fn[b]=function(d,f,e){if(typeof d==="object"){for(var j in d)this[b](j,f,d[j],e);return this}if(c.isFunction(f)){e=f;f=w}var i=b==="one"?c.proxy(e,function(k){c(this).unbind(k,i);return e.apply(this,arguments)}):e;if(d==="unload"&&b!=="one")this.one(d,f,e);else{j=0;for(var o=this.length;j0){y=t;break}}t=t[g]}m[q]=y}}}var f=/((?:\((?:\([^()]+\)|[^()]+)+\)|\[(?:\[[^[\]]*\]|['"][^'"]*['"]|[^[\]'"]+)+\]|\\.|[^ >+~,(\[\\]+)+|[>+~])(\s*,\s*)?((?:.|\r|\n)*)/g, +e=0,j=Object.prototype.toString,i=false,o=true;[0,0].sort(function(){o=false;return 0});var k=function(g,h,l,m){l=l||[];var q=h=h||s;if(h.nodeType!==1&&h.nodeType!==9)return[];if(!g||typeof g!=="string")return l;for(var p=[],v,t,y,S,H=true,M=x(h),I=g;(f.exec(""),v=f.exec(I))!==null;){I=v[3];p.push(v[1]);if(v[2]){S=v[3];break}}if(p.length>1&&r.exec(g))if(p.length===2&&n.relative[p[0]])t=ga(p[0]+p[1],h);else for(t=n.relative[p[0]]?[h]:k(p.shift(),h);p.length;){g=p.shift();if(n.relative[g])g+=p.shift(); +t=ga(g,t)}else{if(!m&&p.length>1&&h.nodeType===9&&!M&&n.match.ID.test(p[0])&&!n.match.ID.test(p[p.length-1])){v=k.find(p.shift(),h,M);h=v.expr?k.filter(v.expr,v.set)[0]:v.set[0]}if(h){v=m?{expr:p.pop(),set:z(m)}:k.find(p.pop(),p.length===1&&(p[0]==="~"||p[0]==="+")&&h.parentNode?h.parentNode:h,M);t=v.expr?k.filter(v.expr,v.set):v.set;if(p.length>0)y=z(t);else H=false;for(;p.length;){var D=p.pop();v=D;if(n.relative[D])v=p.pop();else D="";if(v==null)v=h;n.relative[D](y,v,M)}}else y=[]}y||(y=t);y||k.error(D|| +g);if(j.call(y)==="[object Array]")if(H)if(h&&h.nodeType===1)for(g=0;y[g]!=null;g++){if(y[g]&&(y[g]===true||y[g].nodeType===1&&E(h,y[g])))l.push(t[g])}else for(g=0;y[g]!=null;g++)y[g]&&y[g].nodeType===1&&l.push(t[g]);else l.push.apply(l,y);else z(y,l);if(S){k(S,q,l,m);k.uniqueSort(l)}return l};k.uniqueSort=function(g){if(B){i=o;g.sort(B);if(i)for(var h=1;h":function(g,h){var l=typeof h==="string";if(l&&!/\W/.test(h)){h=h.toLowerCase();for(var m=0,q=g.length;m=0))l||m.push(v);else if(l)h[p]=false;return false},ID:function(g){return g[1].replace(/\\/g,"")},TAG:function(g){return g[1].toLowerCase()}, +CHILD:function(g){if(g[1]==="nth"){var h=/(-?)(\d*)n((?:\+|-)?\d*)/.exec(g[2]==="even"&&"2n"||g[2]==="odd"&&"2n+1"||!/\D/.test(g[2])&&"0n+"+g[2]||g[2]);g[2]=h[1]+(h[2]||1)-0;g[3]=h[3]-0}g[0]=e++;return g},ATTR:function(g,h,l,m,q,p){h=g[1].replace(/\\/g,"");if(!p&&n.attrMap[h])g[1]=n.attrMap[h];if(g[2]==="~=")g[4]=" "+g[4]+" ";return g},PSEUDO:function(g,h,l,m,q){if(g[1]==="not")if((f.exec(g[3])||"").length>1||/^\w/.test(g[3]))g[3]=k(g[3],null,null,h);else{g=k.filter(g[3],h,l,true^q);l||m.push.apply(m, +g);return false}else if(n.match.POS.test(g[0])||n.match.CHILD.test(g[0]))return true;return g},POS:function(g){g.unshift(true);return g}},filters:{enabled:function(g){return g.disabled===false&&g.type!=="hidden"},disabled:function(g){return g.disabled===true},checked:function(g){return g.checked===true},selected:function(g){return g.selected===true},parent:function(g){return!!g.firstChild},empty:function(g){return!g.firstChild},has:function(g,h,l){return!!k(l[3],g).length},header:function(g){return/h\d/i.test(g.nodeName)}, +text:function(g){return"text"===g.type},radio:function(g){return"radio"===g.type},checkbox:function(g){return"checkbox"===g.type},file:function(g){return"file"===g.type},password:function(g){return"password"===g.type},submit:function(g){return"submit"===g.type},image:function(g){return"image"===g.type},reset:function(g){return"reset"===g.type},button:function(g){return"button"===g.type||g.nodeName.toLowerCase()==="button"},input:function(g){return/input|select|textarea|button/i.test(g.nodeName)}}, +setFilters:{first:function(g,h){return h===0},last:function(g,h,l,m){return h===m.length-1},even:function(g,h){return h%2===0},odd:function(g,h){return h%2===1},lt:function(g,h,l){return hl[3]-0},nth:function(g,h,l){return l[3]-0===h},eq:function(g,h,l){return l[3]-0===h}},filter:{PSEUDO:function(g,h,l,m){var q=h[1],p=n.filters[q];if(p)return p(g,l,h,m);else if(q==="contains")return(g.textContent||g.innerText||a([g])||"").indexOf(h[3])>=0;else if(q==="not"){h= +h[3];l=0;for(m=h.length;l=0}},ID:function(g,h){return g.nodeType===1&&g.getAttribute("id")===h},TAG:function(g,h){return h==="*"&&g.nodeType===1||g.nodeName.toLowerCase()===h},CLASS:function(g,h){return(" "+(g.className||g.getAttribute("class"))+" ").indexOf(h)>-1},ATTR:function(g,h){var l=h[1];g=n.attrHandle[l]?n.attrHandle[l](g):g[l]!=null?g[l]:g.getAttribute(l);l=g+"";var m=h[2];h=h[4];return g==null?m==="!=":m=== +"="?l===h:m==="*="?l.indexOf(h)>=0:m==="~="?(" "+l+" ").indexOf(h)>=0:!h?l&&g!==false:m==="!="?l!==h:m==="^="?l.indexOf(h)===0:m==="$="?l.substr(l.length-h.length)===h:m==="|="?l===h||l.substr(0,h.length+1)===h+"-":false},POS:function(g,h,l,m){var q=n.setFilters[h[2]];if(q)return q(g,l,h,m)}}},r=n.match.POS;for(var u in n.match){n.match[u]=new RegExp(n.match[u].source+/(?![^\[]*\])(?![^\(]*\))/.source);n.leftMatch[u]=new RegExp(/(^(?:.|\r|\n)*?)/.source+n.match[u].source.replace(/\\(\d+)/g,function(g, +h){return"\\"+(h-0+1)}))}var z=function(g,h){g=Array.prototype.slice.call(g,0);if(h){h.push.apply(h,g);return h}return g};try{Array.prototype.slice.call(s.documentElement.childNodes,0)}catch(C){z=function(g,h){h=h||[];if(j.call(g)==="[object Array]")Array.prototype.push.apply(h,g);else if(typeof g.length==="number")for(var l=0,m=g.length;l";var l=s.documentElement;l.insertBefore(g,l.firstChild);if(s.getElementById(h)){n.find.ID=function(m,q,p){if(typeof q.getElementById!=="undefined"&&!p)return(q=q.getElementById(m[1]))?q.id===m[1]||typeof q.getAttributeNode!=="undefined"&& +q.getAttributeNode("id").nodeValue===m[1]?[q]:w:[]};n.filter.ID=function(m,q){var p=typeof m.getAttributeNode!=="undefined"&&m.getAttributeNode("id");return m.nodeType===1&&p&&p.nodeValue===q}}l.removeChild(g);l=g=null})();(function(){var g=s.createElement("div");g.appendChild(s.createComment(""));if(g.getElementsByTagName("*").length>0)n.find.TAG=function(h,l){l=l.getElementsByTagName(h[1]);if(h[1]==="*"){h=[];for(var m=0;l[m];m++)l[m].nodeType===1&&h.push(l[m]);l=h}return l};g.innerHTML=""; +if(g.firstChild&&typeof g.firstChild.getAttribute!=="undefined"&&g.firstChild.getAttribute("href")!=="#")n.attrHandle.href=function(h){return h.getAttribute("href",2)};g=null})();s.querySelectorAll&&function(){var g=k,h=s.createElement("div");h.innerHTML="

      ";if(!(h.querySelectorAll&&h.querySelectorAll(".TEST").length===0)){k=function(m,q,p,v){q=q||s;if(!v&&q.nodeType===9&&!x(q))try{return z(q.querySelectorAll(m),p)}catch(t){}return g(m,q,p,v)};for(var l in g)k[l]=g[l];h=null}}(); +(function(){var g=s.createElement("div");g.innerHTML="
      ";if(!(!g.getElementsByClassName||g.getElementsByClassName("e").length===0)){g.lastChild.className="e";if(g.getElementsByClassName("e").length!==1){n.order.splice(1,0,"CLASS");n.find.CLASS=function(h,l,m){if(typeof l.getElementsByClassName!=="undefined"&&!m)return l.getElementsByClassName(h[1])};g=null}}})();var E=s.compareDocumentPosition?function(g,h){return!!(g.compareDocumentPosition(h)&16)}: +function(g,h){return g!==h&&(g.contains?g.contains(h):true)},x=function(g){return(g=(g?g.ownerDocument||g:0).documentElement)?g.nodeName!=="HTML":false},ga=function(g,h){var l=[],m="",q;for(h=h.nodeType?[h]:h;q=n.match.PSEUDO.exec(g);){m+=q[0];g=g.replace(n.match.PSEUDO,"")}g=n.relative[g]?g+"*":g;q=0;for(var p=h.length;q=0===d})};c.fn.extend({find:function(a){for(var b=this.pushStack("","find",a),d=0,f=0,e=this.length;f0)for(var j=d;j0},closest:function(a,b){if(c.isArray(a)){var d=[],f=this[0],e,j= +{},i;if(f&&a.length){e=0;for(var o=a.length;e-1:c(f).is(e)){d.push({selector:i,elem:f});delete j[i]}}f=f.parentNode}}return d}var k=c.expr.match.POS.test(a)?c(a,b||this.context):null;return this.map(function(n,r){for(;r&&r.ownerDocument&&r!==b;){if(k?k.index(r)>-1:c(r).is(a))return r;r=r.parentNode}return null})},index:function(a){if(!a||typeof a=== +"string")return c.inArray(this[0],a?c(a):this.parent().children());return c.inArray(a.jquery?a[0]:a,this)},add:function(a,b){a=typeof a==="string"?c(a,b||this.context):c.makeArray(a);b=c.merge(this.get(),a);return this.pushStack(qa(a[0])||qa(b[0])?b:c.unique(b))},andSelf:function(){return this.add(this.prevObject)}});c.each({parent:function(a){return(a=a.parentNode)&&a.nodeType!==11?a:null},parents:function(a){return c.dir(a,"parentNode")},parentsUntil:function(a,b,d){return c.dir(a,"parentNode", +d)},next:function(a){return c.nth(a,2,"nextSibling")},prev:function(a){return c.nth(a,2,"previousSibling")},nextAll:function(a){return c.dir(a,"nextSibling")},prevAll:function(a){return c.dir(a,"previousSibling")},nextUntil:function(a,b,d){return c.dir(a,"nextSibling",d)},prevUntil:function(a,b,d){return c.dir(a,"previousSibling",d)},siblings:function(a){return c.sibling(a.parentNode.firstChild,a)},children:function(a){return c.sibling(a.firstChild)},contents:function(a){return c.nodeName(a,"iframe")? +a.contentDocument||a.contentWindow.document:c.makeArray(a.childNodes)}},function(a,b){c.fn[a]=function(d,f){var e=c.map(this,b,d);eb.test(a)||(f=d);if(f&&typeof f==="string")e=c.filter(f,e);e=this.length>1?c.unique(e):e;if((this.length>1||gb.test(f))&&fb.test(a))e=e.reverse();return this.pushStack(e,a,R.call(arguments).join(","))}});c.extend({filter:function(a,b,d){if(d)a=":not("+a+")";return c.find.matches(a,b)},dir:function(a,b,d){var f=[];for(a=a[b];a&&a.nodeType!==9&&(d===w||a.nodeType!==1||!c(a).is(d));){a.nodeType=== +1&&f.push(a);a=a[b]}return f},nth:function(a,b,d){b=b||1;for(var f=0;a;a=a[d])if(a.nodeType===1&&++f===b)break;return a},sibling:function(a,b){for(var d=[];a;a=a.nextSibling)a.nodeType===1&&a!==b&&d.push(a);return d}});var Ja=/ jQuery\d+="(?:\d+|null)"/g,V=/^\s+/,Ka=/(<([\w:]+)[^>]*?)\/>/g,hb=/^(?:area|br|col|embed|hr|img|input|link|meta|param)$/i,La=/<([\w:]+)/,ib=/"},F={option:[1,""],legend:[1,"
      ","
      "],thead:[1,"","
      "],tr:[2,"","
      "],td:[3,"","
      "],col:[2,"","
      "],area:[1,"",""],_default:[0,"",""]};F.optgroup=F.option;F.tbody=F.tfoot=F.colgroup=F.caption=F.thead;F.th=F.td;if(!c.support.htmlSerialize)F._default=[1,"div
      ","
      "];c.fn.extend({text:function(a){if(c.isFunction(a))return this.each(function(b){var d= +c(this);d.text(a.call(this,b,d.text()))});if(typeof a!=="object"&&a!==w)return this.empty().append((this[0]&&this[0].ownerDocument||s).createTextNode(a));return c.text(this)},wrapAll:function(a){if(c.isFunction(a))return this.each(function(d){c(this).wrapAll(a.call(this,d))});if(this[0]){var b=c(a,this[0].ownerDocument).eq(0).clone(true);this[0].parentNode&&b.insertBefore(this[0]);b.map(function(){for(var d=this;d.firstChild&&d.firstChild.nodeType===1;)d=d.firstChild;return d}).append(this)}return this}, +wrapInner:function(a){if(c.isFunction(a))return this.each(function(b){c(this).wrapInner(a.call(this,b))});return this.each(function(){var b=c(this),d=b.contents();d.length?d.wrapAll(a):b.append(a)})},wrap:function(a){return this.each(function(){c(this).wrapAll(a)})},unwrap:function(){return this.parent().each(function(){c.nodeName(this,"body")||c(this).replaceWith(this.childNodes)}).end()},append:function(){return this.domManip(arguments,true,function(a){this.nodeType===1&&this.appendChild(a)})}, +prepend:function(){return this.domManip(arguments,true,function(a){this.nodeType===1&&this.insertBefore(a,this.firstChild)})},before:function(){if(this[0]&&this[0].parentNode)return this.domManip(arguments,false,function(b){this.parentNode.insertBefore(b,this)});else if(arguments.length){var a=c(arguments[0]);a.push.apply(a,this.toArray());return this.pushStack(a,"before",arguments)}},after:function(){if(this[0]&&this[0].parentNode)return this.domManip(arguments,false,function(b){this.parentNode.insertBefore(b, +this.nextSibling)});else if(arguments.length){var a=this.pushStack(this,"after",arguments);a.push.apply(a,c(arguments[0]).toArray());return a}},remove:function(a,b){for(var d=0,f;(f=this[d])!=null;d++)if(!a||c.filter(a,[f]).length){if(!b&&f.nodeType===1){c.cleanData(f.getElementsByTagName("*"));c.cleanData([f])}f.parentNode&&f.parentNode.removeChild(f)}return this},empty:function(){for(var a=0,b;(b=this[a])!=null;a++)for(b.nodeType===1&&c.cleanData(b.getElementsByTagName("*"));b.firstChild;)b.removeChild(b.firstChild); +return this},clone:function(a){var b=this.map(function(){if(!c.support.noCloneEvent&&!c.isXMLDoc(this)){var d=this.outerHTML,f=this.ownerDocument;if(!d){d=f.createElement("div");d.appendChild(this.cloneNode(true));d=d.innerHTML}return c.clean([d.replace(Ja,"").replace(/=([^="'>\s]+\/)>/g,'="$1">').replace(V,"")],f)[0]}else return this.cloneNode(true)});if(a===true){ra(this,b);ra(this.find("*"),b.find("*"))}return b},html:function(a){if(a===w)return this[0]&&this[0].nodeType===1?this[0].innerHTML.replace(Ja, +""):null;else if(typeof a==="string"&&!ta.test(a)&&(c.support.leadingWhitespace||!V.test(a))&&!F[(La.exec(a)||["",""])[1].toLowerCase()]){a=a.replace(Ka,Ma);try{for(var b=0,d=this.length;b0||e.cacheable||this.length>1?k.cloneNode(true):k)}o.length&&c.each(o,Qa)}return this}});c.fragments={};c.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(a,b){c.fn[a]=function(d){var f=[];d=c(d);var e=this.length===1&&this[0].parentNode;if(e&&e.nodeType===11&&e.childNodes.length===1&&d.length===1){d[b](this[0]); +return this}else{e=0;for(var j=d.length;e0?this.clone(true):this).get();c.fn[b].apply(c(d[e]),i);f=f.concat(i)}return this.pushStack(f,a,d.selector)}}});c.extend({clean:function(a,b,d,f){b=b||s;if(typeof b.createElement==="undefined")b=b.ownerDocument||b[0]&&b[0].ownerDocument||s;for(var e=[],j=0,i;(i=a[j])!=null;j++){if(typeof i==="number")i+="";if(i){if(typeof i==="string"&&!jb.test(i))i=b.createTextNode(i);else if(typeof i==="string"){i=i.replace(Ka,Ma);var o=(La.exec(i)||["", +""])[1].toLowerCase(),k=F[o]||F._default,n=k[0],r=b.createElement("div");for(r.innerHTML=k[1]+i+k[2];n--;)r=r.lastChild;if(!c.support.tbody){n=ib.test(i);o=o==="table"&&!n?r.firstChild&&r.firstChild.childNodes:k[1]===""&&!n?r.childNodes:[];for(k=o.length-1;k>=0;--k)c.nodeName(o[k],"tbody")&&!o[k].childNodes.length&&o[k].parentNode.removeChild(o[k])}!c.support.leadingWhitespace&&V.test(i)&&r.insertBefore(b.createTextNode(V.exec(i)[0]),r.firstChild);i=r.childNodes}if(i.nodeType)e.push(i);else e= +c.merge(e,i)}}if(d)for(j=0;e[j];j++)if(f&&c.nodeName(e[j],"script")&&(!e[j].type||e[j].type.toLowerCase()==="text/javascript"))f.push(e[j].parentNode?e[j].parentNode.removeChild(e[j]):e[j]);else{e[j].nodeType===1&&e.splice.apply(e,[j+1,0].concat(c.makeArray(e[j].getElementsByTagName("script"))));d.appendChild(e[j])}return e},cleanData:function(a){for(var b,d,f=c.cache,e=c.event.special,j=c.support.deleteExpando,i=0,o;(o=a[i])!=null;i++)if(d=o[c.expando]){b=f[d];if(b.events)for(var k in b.events)e[k]? +c.event.remove(o,k):Ca(o,k,b.handle);if(j)delete o[c.expando];else o.removeAttribute&&o.removeAttribute(c.expando);delete f[d]}}});var kb=/z-?index|font-?weight|opacity|zoom|line-?height/i,Na=/alpha\([^)]*\)/,Oa=/opacity=([^)]*)/,ha=/float/i,ia=/-([a-z])/ig,lb=/([A-Z])/g,mb=/^-?\d+(?:px)?$/i,nb=/^-?\d/,ob={position:"absolute",visibility:"hidden",display:"block"},pb=["Left","Right"],qb=["Top","Bottom"],rb=s.defaultView&&s.defaultView.getComputedStyle,Pa=c.support.cssFloat?"cssFloat":"styleFloat",ja= +function(a,b){return b.toUpperCase()};c.fn.css=function(a,b){return X(this,a,b,true,function(d,f,e){if(e===w)return c.curCSS(d,f);if(typeof e==="number"&&!kb.test(f))e+="px";c.style(d,f,e)})};c.extend({style:function(a,b,d){if(!a||a.nodeType===3||a.nodeType===8)return w;if((b==="width"||b==="height")&&parseFloat(d)<0)d=w;var f=a.style||a,e=d!==w;if(!c.support.opacity&&b==="opacity"){if(e){f.zoom=1;b=parseInt(d,10)+""==="NaN"?"":"alpha(opacity="+d*100+")";a=f.filter||c.curCSS(a,"filter")||"";f.filter= +Na.test(a)?a.replace(Na,b):b}return f.filter&&f.filter.indexOf("opacity=")>=0?parseFloat(Oa.exec(f.filter)[1])/100+"":""}if(ha.test(b))b=Pa;b=b.replace(ia,ja);if(e)f[b]=d;return f[b]},css:function(a,b,d,f){if(b==="width"||b==="height"){var e,j=b==="width"?pb:qb;function i(){e=b==="width"?a.offsetWidth:a.offsetHeight;f!=="border"&&c.each(j,function(){f||(e-=parseFloat(c.curCSS(a,"padding"+this,true))||0);if(f==="margin")e+=parseFloat(c.curCSS(a,"margin"+this,true))||0;else e-=parseFloat(c.curCSS(a, +"border"+this+"Width",true))||0})}a.offsetWidth!==0?i():c.swap(a,ob,i);return Math.max(0,Math.round(e))}return c.curCSS(a,b,d)},curCSS:function(a,b,d){var f,e=a.style;if(!c.support.opacity&&b==="opacity"&&a.currentStyle){f=Oa.test(a.currentStyle.filter||"")?parseFloat(RegExp.$1)/100+"":"";return f===""?"1":f}if(ha.test(b))b=Pa;if(!d&&e&&e[b])f=e[b];else if(rb){if(ha.test(b))b="float";b=b.replace(lb,"-$1").toLowerCase();e=a.ownerDocument.defaultView;if(!e)return null;if(a=e.getComputedStyle(a,null))f= +a.getPropertyValue(b);if(b==="opacity"&&f==="")f="1"}else if(a.currentStyle){d=b.replace(ia,ja);f=a.currentStyle[b]||a.currentStyle[d];if(!mb.test(f)&&nb.test(f)){b=e.left;var j=a.runtimeStyle.left;a.runtimeStyle.left=a.currentStyle.left;e.left=d==="fontSize"?"1em":f||0;f=e.pixelLeft+"px";e.left=b;a.runtimeStyle.left=j}}return f},swap:function(a,b,d){var f={};for(var e in b){f[e]=a.style[e];a.style[e]=b[e]}d.call(a);for(e in b)a.style[e]=f[e]}});if(c.expr&&c.expr.filters){c.expr.filters.hidden=function(a){var b= +a.offsetWidth,d=a.offsetHeight,f=a.nodeName.toLowerCase()==="tr";return b===0&&d===0&&!f?true:b>0&&d>0&&!f?false:c.curCSS(a,"display")==="none"};c.expr.filters.visible=function(a){return!c.expr.filters.hidden(a)}}var sb=J(),tb=//gi,ub=/select|textarea/i,vb=/color|date|datetime|email|hidden|month|number|password|range|search|tel|text|time|url|week/i,N=/=\?(&|$)/,ka=/\?/,wb=/(\?|&)_=.*?(&|$)/,xb=/^(\w+:)?\/\/([^\/?#]+)/,yb=/%20/g,zb=c.fn.load;c.fn.extend({load:function(a,b,d){if(typeof a!== +"string")return zb.call(this,a);else if(!this.length)return this;var f=a.indexOf(" ");if(f>=0){var e=a.slice(f,a.length);a=a.slice(0,f)}f="GET";if(b)if(c.isFunction(b)){d=b;b=null}else if(typeof b==="object"){b=c.param(b,c.ajaxSettings.traditional);f="POST"}var j=this;c.ajax({url:a,type:f,dataType:"html",data:b,complete:function(i,o){if(o==="success"||o==="notmodified")j.html(e?c("
      ").append(i.responseText.replace(tb,"")).find(e):i.responseText);d&&j.each(d,[i.responseText,o,i])}});return this}, +serialize:function(){return c.param(this.serializeArray())},serializeArray:function(){return this.map(function(){return this.elements?c.makeArray(this.elements):this}).filter(function(){return this.name&&!this.disabled&&(this.checked||ub.test(this.nodeName)||vb.test(this.type))}).map(function(a,b){a=c(this).val();return a==null?null:c.isArray(a)?c.map(a,function(d){return{name:b.name,value:d}}):{name:b.name,value:a}}).get()}});c.each("ajaxStart ajaxStop ajaxComplete ajaxError ajaxSuccess ajaxSend".split(" "), +function(a,b){c.fn[b]=function(d){return this.bind(b,d)}});c.extend({get:function(a,b,d,f){if(c.isFunction(b)){f=f||d;d=b;b=null}return c.ajax({type:"GET",url:a,data:b,success:d,dataType:f})},getScript:function(a,b){return c.get(a,null,b,"script")},getJSON:function(a,b,d){return c.get(a,b,d,"json")},post:function(a,b,d,f){if(c.isFunction(b)){f=f||d;d=b;b={}}return c.ajax({type:"POST",url:a,data:b,success:d,dataType:f})},ajaxSetup:function(a){c.extend(c.ajaxSettings,a)},ajaxSettings:{url:location.href, +global:true,type:"GET",contentType:"application/x-www-form-urlencoded",processData:true,async:true,xhr:A.XMLHttpRequest&&(A.location.protocol!=="file:"||!A.ActiveXObject)?function(){return new A.XMLHttpRequest}:function(){try{return new A.ActiveXObject("Microsoft.XMLHTTP")}catch(a){}},accepts:{xml:"application/xml, text/xml",html:"text/html",script:"text/javascript, application/javascript",json:"application/json, text/javascript",text:"text/plain",_default:"*/*"}},lastModified:{},etag:{},ajax:function(a){function b(){e.success&& +e.success.call(k,o,i,x);e.global&&f("ajaxSuccess",[x,e])}function d(){e.complete&&e.complete.call(k,x,i);e.global&&f("ajaxComplete",[x,e]);e.global&&!--c.active&&c.event.trigger("ajaxStop")}function f(q,p){(e.context?c(e.context):c.event).trigger(q,p)}var e=c.extend(true,{},c.ajaxSettings,a),j,i,o,k=a&&a.context||e,n=e.type.toUpperCase();if(e.data&&e.processData&&typeof e.data!=="string")e.data=c.param(e.data,e.traditional);if(e.dataType==="jsonp"){if(n==="GET")N.test(e.url)||(e.url+=(ka.test(e.url)? +"&":"?")+(e.jsonp||"callback")+"=?");else if(!e.data||!N.test(e.data))e.data=(e.data?e.data+"&":"")+(e.jsonp||"callback")+"=?";e.dataType="json"}if(e.dataType==="json"&&(e.data&&N.test(e.data)||N.test(e.url))){j=e.jsonpCallback||"jsonp"+sb++;if(e.data)e.data=(e.data+"").replace(N,"="+j+"$1");e.url=e.url.replace(N,"="+j+"$1");e.dataType="script";A[j]=A[j]||function(q){o=q;b();d();A[j]=w;try{delete A[j]}catch(p){}z&&z.removeChild(C)}}if(e.dataType==="script"&&e.cache===null)e.cache=false;if(e.cache=== +false&&n==="GET"){var r=J(),u=e.url.replace(wb,"$1_="+r+"$2");e.url=u+(u===e.url?(ka.test(e.url)?"&":"?")+"_="+r:"")}if(e.data&&n==="GET")e.url+=(ka.test(e.url)?"&":"?")+e.data;e.global&&!c.active++&&c.event.trigger("ajaxStart");r=(r=xb.exec(e.url))&&(r[1]&&r[1]!==location.protocol||r[2]!==location.host);if(e.dataType==="script"&&n==="GET"&&r){var z=s.getElementsByTagName("head")[0]||s.documentElement,C=s.createElement("script");C.src=e.url;if(e.scriptCharset)C.charset=e.scriptCharset;if(!j){var B= +false;C.onload=C.onreadystatechange=function(){if(!B&&(!this.readyState||this.readyState==="loaded"||this.readyState==="complete")){B=true;b();d();C.onload=C.onreadystatechange=null;z&&C.parentNode&&z.removeChild(C)}}}z.insertBefore(C,z.firstChild);return w}var E=false,x=e.xhr();if(x){e.username?x.open(n,e.url,e.async,e.username,e.password):x.open(n,e.url,e.async);try{if(e.data||a&&a.contentType)x.setRequestHeader("Content-Type",e.contentType);if(e.ifModified){c.lastModified[e.url]&&x.setRequestHeader("If-Modified-Since", +c.lastModified[e.url]);c.etag[e.url]&&x.setRequestHeader("If-None-Match",c.etag[e.url])}r||x.setRequestHeader("X-Requested-With","XMLHttpRequest");x.setRequestHeader("Accept",e.dataType&&e.accepts[e.dataType]?e.accepts[e.dataType]+", */*":e.accepts._default)}catch(ga){}if(e.beforeSend&&e.beforeSend.call(k,x,e)===false){e.global&&!--c.active&&c.event.trigger("ajaxStop");x.abort();return false}e.global&&f("ajaxSend",[x,e]);var g=x.onreadystatechange=function(q){if(!x||x.readyState===0||q==="abort"){E|| +d();E=true;if(x)x.onreadystatechange=c.noop}else if(!E&&x&&(x.readyState===4||q==="timeout")){E=true;x.onreadystatechange=c.noop;i=q==="timeout"?"timeout":!c.httpSuccess(x)?"error":e.ifModified&&c.httpNotModified(x,e.url)?"notmodified":"success";var p;if(i==="success")try{o=c.httpData(x,e.dataType,e)}catch(v){i="parsererror";p=v}if(i==="success"||i==="notmodified")j||b();else c.handleError(e,x,i,p);d();q==="timeout"&&x.abort();if(e.async)x=null}};try{var h=x.abort;x.abort=function(){x&&h.call(x); +g("abort")}}catch(l){}e.async&&e.timeout>0&&setTimeout(function(){x&&!E&&g("timeout")},e.timeout);try{x.send(n==="POST"||n==="PUT"||n==="DELETE"?e.data:null)}catch(m){c.handleError(e,x,null,m);d()}e.async||g();return x}},handleError:function(a,b,d,f){if(a.error)a.error.call(a.context||a,b,d,f);if(a.global)(a.context?c(a.context):c.event).trigger("ajaxError",[b,a,f])},active:0,httpSuccess:function(a){try{return!a.status&&location.protocol==="file:"||a.status>=200&&a.status<300||a.status===304||a.status=== +1223||a.status===0}catch(b){}return false},httpNotModified:function(a,b){var d=a.getResponseHeader("Last-Modified"),f=a.getResponseHeader("Etag");if(d)c.lastModified[b]=d;if(f)c.etag[b]=f;return a.status===304||a.status===0},httpData:function(a,b,d){var f=a.getResponseHeader("content-type")||"",e=b==="xml"||!b&&f.indexOf("xml")>=0;a=e?a.responseXML:a.responseText;e&&a.documentElement.nodeName==="parsererror"&&c.error("parsererror");if(d&&d.dataFilter)a=d.dataFilter(a,b);if(typeof a==="string")if(b=== +"json"||!b&&f.indexOf("json")>=0)a=c.parseJSON(a);else if(b==="script"||!b&&f.indexOf("javascript")>=0)c.globalEval(a);return a},param:function(a,b){function d(i,o){if(c.isArray(o))c.each(o,function(k,n){b||/\[\]$/.test(i)?f(i,n):d(i+"["+(typeof n==="object"||c.isArray(n)?k:"")+"]",n)});else!b&&o!=null&&typeof o==="object"?c.each(o,function(k,n){d(i+"["+k+"]",n)}):f(i,o)}function f(i,o){o=c.isFunction(o)?o():o;e[e.length]=encodeURIComponent(i)+"="+encodeURIComponent(o)}var e=[];if(b===w)b=c.ajaxSettings.traditional; +if(c.isArray(a)||a.jquery)c.each(a,function(){f(this.name,this.value)});else for(var j in a)d(j,a[j]);return e.join("&").replace(yb,"+")}});var la={},Ab=/toggle|show|hide/,Bb=/^([+-]=)?([\d+-.]+)(.*)$/,W,va=[["height","marginTop","marginBottom","paddingTop","paddingBottom"],["width","marginLeft","marginRight","paddingLeft","paddingRight"],["opacity"]];c.fn.extend({show:function(a,b){if(a||a===0)return this.animate(K("show",3),a,b);else{a=0;for(b=this.length;a").appendTo("body");f=e.css("display");if(f==="none")f="block";e.remove();la[d]=f}c.data(this[a],"olddisplay",f)}}a=0;for(b=this.length;a=0;f--)if(d[f].elem===this){b&&d[f](true);d.splice(f,1)}});b||this.dequeue();return this}});c.each({slideDown:K("show",1),slideUp:K("hide",1),slideToggle:K("toggle",1),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"}},function(a,b){c.fn[a]=function(d,f){return this.animate(b,d,f)}});c.extend({speed:function(a,b,d){var f=a&&typeof a==="object"?a:{complete:d||!d&&b||c.isFunction(a)&&a,duration:a,easing:d&&b||b&&!c.isFunction(b)&&b};f.duration=c.fx.off?0:typeof f.duration=== +"number"?f.duration:c.fx.speeds[f.duration]||c.fx.speeds._default;f.old=f.complete;f.complete=function(){f.queue!==false&&c(this).dequeue();c.isFunction(f.old)&&f.old.call(this)};return f},easing:{linear:function(a,b,d,f){return d+f*a},swing:function(a,b,d,f){return(-Math.cos(a*Math.PI)/2+0.5)*f+d}},timers:[],fx:function(a,b,d){this.options=b;this.elem=a;this.prop=d;if(!b.orig)b.orig={}}});c.fx.prototype={update:function(){this.options.step&&this.options.step.call(this.elem,this.now,this);(c.fx.step[this.prop]|| +c.fx.step._default)(this);if((this.prop==="height"||this.prop==="width")&&this.elem.style)this.elem.style.display="block"},cur:function(a){if(this.elem[this.prop]!=null&&(!this.elem.style||this.elem.style[this.prop]==null))return this.elem[this.prop];return(a=parseFloat(c.css(this.elem,this.prop,a)))&&a>-10000?a:parseFloat(c.curCSS(this.elem,this.prop))||0},custom:function(a,b,d){function f(j){return e.step(j)}this.startTime=J();this.start=a;this.end=b;this.unit=d||this.unit||"px";this.now=this.start; +this.pos=this.state=0;var e=this;f.elem=this.elem;if(f()&&c.timers.push(f)&&!W)W=setInterval(c.fx.tick,13)},show:function(){this.options.orig[this.prop]=c.style(this.elem,this.prop);this.options.show=true;this.custom(this.prop==="width"||this.prop==="height"?1:0,this.cur());c(this.elem).show()},hide:function(){this.options.orig[this.prop]=c.style(this.elem,this.prop);this.options.hide=true;this.custom(this.cur(),0)},step:function(a){var b=J(),d=true;if(a||b>=this.options.duration+this.startTime){this.now= +this.end;this.pos=this.state=1;this.update();this.options.curAnim[this.prop]=true;for(var f in this.options.curAnim)if(this.options.curAnim[f]!==true)d=false;if(d){if(this.options.display!=null){this.elem.style.overflow=this.options.overflow;a=c.data(this.elem,"olddisplay");this.elem.style.display=a?a:this.options.display;if(c.css(this.elem,"display")==="none")this.elem.style.display="block"}this.options.hide&&c(this.elem).hide();if(this.options.hide||this.options.show)for(var e in this.options.curAnim)c.style(this.elem, +e,this.options.orig[e]);this.options.complete.call(this.elem)}return false}else{e=b-this.startTime;this.state=e/this.options.duration;a=this.options.easing||(c.easing.swing?"swing":"linear");this.pos=c.easing[this.options.specialEasing&&this.options.specialEasing[this.prop]||a](this.state,e,0,1,this.options.duration);this.now=this.start+(this.end-this.start)*this.pos;this.update()}return true}};c.extend(c.fx,{tick:function(){for(var a=c.timers,b=0;b
      "; +a.insertBefore(b,a.firstChild);d=b.firstChild;f=d.firstChild;e=d.nextSibling.firstChild.firstChild;this.doesNotAddBorder=f.offsetTop!==5;this.doesAddBorderForTableAndCells=e.offsetTop===5;f.style.position="fixed";f.style.top="20px";this.supportsFixedPosition=f.offsetTop===20||f.offsetTop===15;f.style.position=f.style.top="";d.style.overflow="hidden";d.style.position="relative";this.subtractsBorderForOverflowNotVisible=f.offsetTop===-5;this.doesNotIncludeMarginInBodyOffset=a.offsetTop!==j;a.removeChild(b); +c.offset.initialize=c.noop},bodyOffset:function(a){var b=a.offsetTop,d=a.offsetLeft;c.offset.initialize();if(c.offset.doesNotIncludeMarginInBodyOffset){b+=parseFloat(c.curCSS(a,"marginTop",true))||0;d+=parseFloat(c.curCSS(a,"marginLeft",true))||0}return{top:b,left:d}},setOffset:function(a,b,d){if(/static/.test(c.curCSS(a,"position")))a.style.position="relative";var f=c(a),e=f.offset(),j=parseInt(c.curCSS(a,"top",true),10)||0,i=parseInt(c.curCSS(a,"left",true),10)||0;if(c.isFunction(b))b=b.call(a, +d,e);d={top:b.top-e.top+j,left:b.left-e.left+i};"using"in b?b.using.call(a,d):f.css(d)}};c.fn.extend({position:function(){if(!this[0])return null;var a=this[0],b=this.offsetParent(),d=this.offset(),f=/^body|html$/i.test(b[0].nodeName)?{top:0,left:0}:b.offset();d.top-=parseFloat(c.curCSS(a,"marginTop",true))||0;d.left-=parseFloat(c.curCSS(a,"marginLeft",true))||0;f.top+=parseFloat(c.curCSS(b[0],"borderTopWidth",true))||0;f.left+=parseFloat(c.curCSS(b[0],"borderLeftWidth",true))||0;return{top:d.top- +f.top,left:d.left-f.left}},offsetParent:function(){return this.map(function(){for(var a=this.offsetParent||s.body;a&&!/^body|html$/i.test(a.nodeName)&&c.css(a,"position")==="static";)a=a.offsetParent;return a})}});c.each(["Left","Top"],function(a,b){var d="scroll"+b;c.fn[d]=function(f){var e=this[0],j;if(!e)return null;if(f!==w)return this.each(function(){if(j=wa(this))j.scrollTo(!a?f:c(j).scrollLeft(),a?f:c(j).scrollTop());else this[d]=f});else return(j=wa(e))?"pageXOffset"in j?j[a?"pageYOffset": +"pageXOffset"]:c.support.boxModel&&j.document.documentElement[d]||j.document.body[d]:e[d]}});c.each(["Height","Width"],function(a,b){var d=b.toLowerCase();c.fn["inner"+b]=function(){return this[0]?c.css(this[0],d,false,"padding"):null};c.fn["outer"+b]=function(f){return this[0]?c.css(this[0],d,false,f?"margin":"border"):null};c.fn[d]=function(f){var e=this[0];if(!e)return f==null?null:this;if(c.isFunction(f))return this.each(function(j){var i=c(this);i[d](f.call(this,j,i[d]()))});return"scrollTo"in +e&&e.document?e.document.compatMode==="CSS1Compat"&&e.document.documentElement["client"+b]||e.document.body["client"+b]:e.nodeType===9?Math.max(e.documentElement["client"+b],e.body["scroll"+b],e.documentElement["scroll"+b],e.body["offset"+b],e.documentElement["offset"+b]):f===w?c.css(e,d):this.css(d,typeof f==="string"?f:f+"px")}});A.jQuery=A.$=c})(window); diff --git a/lxq_static/minus.png b/lxq_static/minus.png new file mode 100644 index 0000000..da1c562 Binary files /dev/null and b/lxq_static/minus.png differ diff --git a/lxq_static/nature.css b/lxq_static/nature.css new file mode 100644 index 0000000..ac9c45e --- /dev/null +++ b/lxq_static/nature.css @@ -0,0 +1,237 @@ +/** + * Sphinx stylesheet -- default theme + * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ + */ + +@import url("basic.css"); + +/* -- page layout ----------------------------------------------------------- */ + +body { + font-family: Arial, sans-serif; + font-size: 100%; + background-color: #111111; + color: #555555; + margin: 0; + padding: 0; +} + +div.documentwrapper { + float: left; + width: 100%; +} + +div.bodywrapper { + margin: 0 0 0 300px; +} + +hr{ + border: 1px solid #B1B4B6; +} + +div.document { + background-color: #fafafa; +} + +div.body { + background-color: #ffffff; + color: #3E4349; + padding: 1em 30px 30px 30px; + font-size: 0.9em; +} + +div.footer { + color: #555; + width: 100%; + padding: 13px 0; + text-align: center; + font-size: 75%; +} + +div.footer a { + color: #444444; +} + +div.related { + /*background-color: #6BA81E;*/ + background-color: #444; + line-height: 36px; + color: #ffffff; + text-shadow: #666 -1px -1px 0; + font-size: 1.1em; +} + +div.related a { + color: #fff; +} + +div.related .right { + font-size: 0.9em; +} + +div.sphinxsidebar { + font-size: 0.9em; + line-height: 1.5em; + width: 300px; +} + +div.sphinxsidebarwrapper{ + padding: 20px 0; +} + +div.sphinxsidebar h3, +div.sphinxsidebar h4 { + font-family: Arial, sans-serif; + color: #444; + font-size: 1.2em; + font-weight: bold; + margin: 0; + padding: 5px 10px; + text-shadow: 1px 1px 0 white +} + +div.sphinxsidebar h3 a { + color: #444444; +} + +div.sphinxsidebar p { + color: #888888; + padding: 5px 20px; + margin: 0.5em 0px; +} + +div.sphinxsidebar p.topless { +} + +div.sphinxsidebar ul { + margin: 10px 10px 10px 20px; + padding: 0; + color: #000000; +} + +div.sphinxsidebar a { + color: #444444; +} + +div.sphinxsidebar a:hover { + color: #E32E00; +} + +div.sphinxsidebar input { + border: 1px solid #cccccc; + font-family: sans-serif; + font-size: 1.1em; + padding: 0.15em 0.3em; +} + +div.sphinxsidebar input[type=text]{ + margin-left: 20px; +} + +/* -- body styles ----------------------------------------------------------- */ + +a { + color: #005B81; + text-decoration: none; +} + +a:hover { + color: #E32E00; +} + +div.body h1, +div.body h2, +div.body h3, +div.body h4, +div.body h5, +div.body h6 { + font-family: Arial, sans-serif; + font-weight: normal; + color: #212224; + margin: 30px 0px 10px 0px; + padding: 5px 0 5px 0px; + text-shadow: 0px 1px 0 white; + border-bottom: 1px solid #C8D5E3; +} + +div.body h1 { margin-top: 0; font-size: 200%; } +div.body h2 { font-size: 150%; } +div.body h3 { font-size: 120%; } +div.body h4 { font-size: 110%; } +div.body h5 { font-size: 100%; } +div.body h6 { font-size: 100%; } + +a.headerlink { + color: #c60f0f; + font-size: 0.8em; + padding: 0 4px 0 4px; + text-decoration: none; +} + +a.headerlink:hover { + background-color: #c60f0f; + color: white; +} + +div.body p, div.body dd, div.body li { + line-height: 1.8em; +} + +div.admonition p.admonition-title + p { + display: inline; +} + +div.highlight{ + background-color: white; +} + +div.note { + background-color: #eeeeee; + border: 1px solid #cccccc; +} + +div.seealso { + background-color: #ffffcc; + border: 1px solid #ffff66; +} + +div.topic { + background-color: #fafafa; + border-width: 0; +} + +div.warning { + background-color: #ffe4e4; + border: 1px solid #ff6666; +} + +p.admonition-title { + display: inline; +} + +p.admonition-title:after { + content: ":"; +} + +pre { + padding: 10px; + background-color: #fafafa; + color: #222222; + line-height: 1.5em; + font-size: 1.1em; + margin: 1.5em 0 1.5em 0; + -webkit-box-shadow: 0px 0px 4px #d8d8d8; + -moz-box-shadow: 0px 0px 4px #d8d8d8; + box-shadow: 0px 0px 4px #d8d8d8; +} + +tt { + color: #222222; + padding: 1px 2px; + font-size: 1.2em; + font-family: monospace; +} + +#table-of-contents ul { + padding-left: 2em; +} diff --git a/lxq_static/plus.png b/lxq_static/plus.png new file mode 100644 index 0000000..b3cb374 Binary files /dev/null and b/lxq_static/plus.png differ diff --git a/lxq_static/pygments.css b/lxq_static/pygments.css new file mode 100644 index 0000000..652b761 --- /dev/null +++ b/lxq_static/pygments.css @@ -0,0 +1,54 @@ +.c { color: #999988; font-style: italic } /* Comment */ +.k { font-weight: bold } /* Keyword */ +.o { font-weight: bold } /* Operator */ +.cm { color: #999988; font-style: italic } /* Comment.Multiline */ +.cp { color: #999999; font-weight: bold } /* Comment.preproc */ +.c1 { color: #999988; font-style: italic } /* Comment.Single */ +.gd { color: #000000; background-color: #ffdddd } /* Generic.Deleted */ +.ge { font-style: italic } /* Generic.Emph */ +.gr { color: #aa0000 } /* Generic.Error */ +.gh { color: #999999 } /* Generic.Heading */ +.gi { color: #000000; background-color: #ddffdd } /* Generic.Inserted */ +.go { color: #111 } /* Generic.Output */ +.gp { color: #555555 } /* Generic.Prompt */ +.gs { font-weight: bold } /* Generic.Strong */ +.gu { color: #aaaaaa } /* Generic.Subheading */ +.gt { color: #aa0000 } /* Generic.Traceback */ +.kc { font-weight: bold } /* Keyword.Constant */ +.kd { font-weight: bold } /* Keyword.Declaration */ +.kp { font-weight: bold } /* Keyword.Pseudo */ +.kr { font-weight: bold } /* Keyword.Reserved */ +.kt { color: #445588; font-weight: bold } /* Keyword.Type */ +.m { color: #009999 } /* Literal.Number */ +.s { color: #bb8844 } /* Literal.String */ +.na { color: #008080 } /* Name.Attribute */ +.nb { color: #999999 } /* Name.Builtin */ +.nc { color: #445588; font-weight: bold } /* Name.Class */ +.no { color: #ff99ff } /* Name.Constant */ +.ni { color: #800080 } /* Name.Entity */ +.ne { color: #990000; font-weight: bold } /* Name.Exception */ +.nf { color: #990000; font-weight: bold } /* Name.Function */ +.nn { color: #555555 } /* Name.Namespace */ +.nt { color: #000080 } /* Name.Tag */ +.nv { color: purple } /* Name.Variable */ +.ow { font-weight: bold } /* Operator.Word */ +.mf { color: #009999 } /* Literal.Number.Float */ +.mh { color: #009999 } /* Literal.Number.Hex */ +.mi { color: #009999 } /* Literal.Number.Integer */ +.mo { color: #009999 } /* Literal.Number.Oct */ +.sb { color: #bb8844 } /* Literal.String.Backtick */ +.sc { color: #bb8844 } /* Literal.String.Char */ +.sd { color: #bb8844 } /* Literal.String.Doc */ +.s2 { color: #bb8844 } /* Literal.String.Double */ +.se { color: #bb8844 } /* Literal.String.Escape */ +.sh { color: #bb8844 } /* Literal.String.Heredoc */ +.si { color: #bb8844 } /* Literal.String.Interpol */ +.sx { color: #bb8844 } /* Literal.String.Other */ +.sr { color: #808000 } /* Literal.String.Regex */ +.s1 { color: #bb8844 } /* Literal.String.Single */ +.ss { color: #bb8844 } /* Literal.String.Symbol */ +.bp { color: #999999 } /* Name.Builtin.Pseudo */ +.vc { color: #ff99ff } /* Name.Variable.Class */ +.vg { color: #ff99ff } /* Name.Variable.Global */ +.vi { color: #ff99ff } /* Name.Variable.Instance */ +.il { color: #009999 } /* Literal.Number.Integer.Long */ \ No newline at end of file diff --git a/lxq_static/searchtools.js b/lxq_static/searchtools.js new file mode 100644 index 0000000..5cbfe00 --- /dev/null +++ b/lxq_static/searchtools.js @@ -0,0 +1,518 @@ +/* + * searchtools.js + * ~~~~~~~~~~~~~~ + * + * Sphinx JavaScript utilties for the full-text search. + * + * :copyright: Copyright 2007-2010 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/** + * helper function to return a node containing the + * search summary for a given text. keywords is a list + * of stemmed words, hlwords is the list of normal, unstemmed + * words. the first one is used to find the occurance, the + * latter for highlighting it. + */ + +jQuery.makeSearchSummary = function(text, keywords, hlwords) { + var textLower = text.toLowerCase(); + var start = 0; + $.each(keywords, function() { + var i = textLower.indexOf(this.toLowerCase()); + if (i > -1) + start = i; + }); + start = Math.max(start - 120, 0); + var excerpt = ((start > 0) ? '...' : '') + + $.trim(text.substr(start, 240)) + + ((start + 240 - text.length) ? '...' : ''); + var rv = $('
      ').text(excerpt); + $.each(hlwords, function() { + rv = rv.highlightText(this, 'highlighted'); + }); + return rv; +} + +/** + * Porter Stemmer + */ +var PorterStemmer = function() { + + var step2list = { + ational: 'ate', + tional: 'tion', + enci: 'ence', + anci: 'ance', + izer: 'ize', + bli: 'ble', + alli: 'al', + entli: 'ent', + eli: 'e', + ousli: 'ous', + ization: 'ize', + ation: 'ate', + ator: 'ate', + alism: 'al', + iveness: 'ive', + fulness: 'ful', + ousness: 'ous', + aliti: 'al', + iviti: 'ive', + biliti: 'ble', + logi: 'log' + }; + + var step3list = { + icate: 'ic', + ative: '', + alize: 'al', + iciti: 'ic', + ical: 'ic', + ful: '', + ness: '' + }; + + var c = "[^aeiou]"; // consonant + var v = "[aeiouy]"; // vowel + var C = c + "[^aeiouy]*"; // consonant sequence + var V = v + "[aeiou]*"; // vowel sequence + + var mgr0 = "^(" + C + ")?" + V + C; // [C]VC... is m>0 + var meq1 = "^(" + C + ")?" + V + C + "(" + V + ")?$"; // [C]VC[V] is m=1 + var mgr1 = "^(" + C + ")?" + V + C + V + C; // [C]VCVC... is m>1 + var s_v = "^(" + C + ")?" + v; // vowel in stem + + this.stemWord = function (w) { + var stem; + var suffix; + var firstch; + var origword = w; + + if (w.length < 3) + return w; + + var re; + var re2; + var re3; + var re4; + + firstch = w.substr(0,1); + if (firstch == "y") + w = firstch.toUpperCase() + w.substr(1); + + // Step 1a + re = /^(.+?)(ss|i)es$/; + re2 = /^(.+?)([^s])s$/; + + if (re.test(w)) + w = w.replace(re,"$1$2"); + else if (re2.test(w)) + w = w.replace(re2,"$1$2"); + + // Step 1b + re = /^(.+?)eed$/; + re2 = /^(.+?)(ed|ing)$/; + if (re.test(w)) { + var fp = re.exec(w); + re = new RegExp(mgr0); + if (re.test(fp[1])) { + re = /.$/; + w = w.replace(re,""); + } + } + else if (re2.test(w)) { + var fp = re2.exec(w); + stem = fp[1]; + re2 = new RegExp(s_v); + if (re2.test(stem)) { + w = stem; + re2 = /(at|bl|iz)$/; + re3 = new RegExp("([^aeiouylsz])\\1$"); + re4 = new RegExp("^" + C + v + "[^aeiouwxy]$"); + if (re2.test(w)) + w = w + "e"; + else if (re3.test(w)) { + re = /.$/; + w = w.replace(re,""); + } + else if (re4.test(w)) + w = w + "e"; + } + } + + // Step 1c + re = /^(.+?)y$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + re = new RegExp(s_v); + if (re.test(stem)) + w = stem + "i"; + } + + // Step 2 + re = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + suffix = fp[2]; + re = new RegExp(mgr0); + if (re.test(stem)) + w = stem + step2list[suffix]; + } + + // Step 3 + re = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + suffix = fp[2]; + re = new RegExp(mgr0); + if (re.test(stem)) + w = stem + step3list[suffix]; + } + + // Step 4 + re = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/; + re2 = /^(.+?)(s|t)(ion)$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + re = new RegExp(mgr1); + if (re.test(stem)) + w = stem; + } + else if (re2.test(w)) { + var fp = re2.exec(w); + stem = fp[1] + fp[2]; + re2 = new RegExp(mgr1); + if (re2.test(stem)) + w = stem; + } + + // Step 5 + re = /^(.+?)e$/; + if (re.test(w)) { + var fp = re.exec(w); + stem = fp[1]; + re = new RegExp(mgr1); + re2 = new RegExp(meq1); + re3 = new RegExp("^" + C + v + "[^aeiouwxy]$"); + if (re.test(stem) || (re2.test(stem) && !(re3.test(stem)))) + w = stem; + } + re = /ll$/; + re2 = new RegExp(mgr1); + if (re.test(w) && re2.test(w)) { + re = /.$/; + w = w.replace(re,""); + } + + // and turn initial Y back to y + if (firstch == "y") + w = firstch.toLowerCase() + w.substr(1); + return w; + } +} + + +/** + * Search Module + */ +var Search = { + + _index : null, + _queued_query : null, + _pulse_status : -1, + + init : function() { + var params = $.getQueryParameters(); + if (params.q) { + var query = params.q[0]; + $('input[name="q"]')[0].value = query; + this.performSearch(query); + } + }, + + loadIndex : function(url) { + $.ajax({type: "GET", url: url, data: null, success: null, + dataType: "script", cache: true}); + }, + + setIndex : function(index) { + var q; + this._index = index; + if ((q = this._queued_query) !== null) { + this._queued_query = null; + Search.query(q); + } + }, + + hasIndex : function() { + return this._index !== null; + }, + + deferQuery : function(query) { + this._queued_query = query; + }, + + stopPulse : function() { + this._pulse_status = 0; + }, + + startPulse : function() { + if (this._pulse_status >= 0) + return; + function pulse() { + Search._pulse_status = (Search._pulse_status + 1) % 4; + var dotString = ''; + for (var i = 0; i < Search._pulse_status; i++) + dotString += '.'; + Search.dots.text(dotString); + if (Search._pulse_status > -1) + window.setTimeout(pulse, 500); + }; + pulse(); + }, + + /** + * perform a search for something + */ + performSearch : function(query) { + // create the required interface elements + this.out = $('#search-results'); + this.title = $('

      ' + _('Searching') + '

      ').appendTo(this.out); + this.dots = $('').appendTo(this.title); + this.status = $('

      ').appendTo(this.out); + this.output = $('
        ').appendTo(this.out); + + $('#search-progress').text(_('Preparing search...')); + this.startPulse(); + + // index already loaded, the browser was quick! + if (this.hasIndex()) + this.query(query); + else + this.deferQuery(query); + }, + + query : function(query) { + var stopwords = ['and', 'then', 'into', 'it', 'as', 'are', 'in', + 'if', 'for', 'no', 'there', 'their', 'was', 'is', + 'be', 'to', 'that', 'but', 'they', 'not', 'such', + 'with', 'by', 'a', 'on', 'these', 'of', 'will', + 'this', 'near', 'the', 'or', 'at']; + + // stem the searchterms and add them to the correct list + var stemmer = new PorterStemmer(); + var searchterms = []; + var excluded = []; + var hlterms = []; + var tmp = query.split(/\s+/); + var object = (tmp.length == 1) ? tmp[0].toLowerCase() : null; + for (var i = 0; i < tmp.length; i++) { + if ($u.indexOf(stopwords, tmp[i]) != -1 || tmp[i].match(/^\d+$/) || + tmp[i] == "") { + // skip this "word" + continue; + } + // stem the word + var word = stemmer.stemWord(tmp[i]).toLowerCase(); + // select the correct list + if (word[0] == '-') { + var toAppend = excluded; + word = word.substr(1); + } + else { + var toAppend = searchterms; + hlterms.push(tmp[i].toLowerCase()); + } + // only add if not already in the list + if (!$.contains(toAppend, word)) + toAppend.push(word); + }; + var highlightstring = '?highlight=' + $.urlencode(hlterms.join(" ")); + + // console.debug('SEARCH: searching for:'); + // console.info('required: ', searchterms); + // console.info('excluded: ', excluded); + + // prepare search + var filenames = this._index.filenames; + var titles = this._index.titles; + var terms = this._index.terms; + var objects = this._index.objects; + var objtypes = this._index.objtypes; + var objnames = this._index.objnames; + var fileMap = {}; + var files = null; + // different result priorities + var importantResults = []; + var objectResults = []; + var regularResults = []; + var unimportantResults = []; + $('#search-progress').empty(); + + // lookup as object + if (object != null) { + for (var prefix in objects) { + for (var name in objects[prefix]) { + var fullname = (prefix ? prefix + '.' : '') + name; + if (fullname.toLowerCase().indexOf(object) > -1) { + match = objects[prefix][name]; + descr = objnames[match[1]] + _(', in ') + titles[match[0]]; + // XXX the generated anchors are not generally correct + // XXX there may be custom prefixes + result = [filenames[match[0]], fullname, '#'+fullname, descr]; + switch (match[2]) { + case 1: objectResults.push(result); break; + case 0: importantResults.push(result); break; + case 2: unimportantResults.push(result); break; + } + } + } + } + } + + // sort results descending + objectResults.sort(function(a, b) { + return (a[1] > b[1]) ? -1 : ((a[1] < b[1]) ? 1 : 0); + }); + + importantResults.sort(function(a, b) { + return (a[1] > b[1]) ? -1 : ((a[1] < b[1]) ? 1 : 0); + }); + + unimportantResults.sort(function(a, b) { + return (a[1] > b[1]) ? -1 : ((a[1] < b[1]) ? 1 : 0); + }); + + + // perform the search on the required terms + for (var i = 0; i < searchterms.length; i++) { + var word = searchterms[i]; + // no match but word was a required one + if ((files = terms[word]) == null) + break; + if (files.length == undefined) { + files = [files]; + } + // create the mapping + for (var j = 0; j < files.length; j++) { + var file = files[j]; + if (file in fileMap) + fileMap[file].push(word); + else + fileMap[file] = [word]; + } + } + + // now check if the files don't contain excluded terms + for (var file in fileMap) { + var valid = true; + + // check if all requirements are matched + if (fileMap[file].length != searchterms.length) + continue; + + // ensure that none of the excluded terms is in the + // search result. + for (var i = 0; i < excluded.length; i++) { + if (terms[excluded[i]] == file || + $.contains(terms[excluded[i]] || [], file)) { + valid = false; + break; + } + } + + // if we have still a valid result we can add it + // to the result list + if (valid) + regularResults.push([filenames[file], titles[file], '', null]); + } + + // delete unused variables in order to not waste + // memory until list is retrieved completely + delete filenames, titles, terms; + + // now sort the regular results descending by title + regularResults.sort(function(a, b) { + var left = a[1].toLowerCase(); + var right = b[1].toLowerCase(); + return (left > right) ? -1 : ((left < right) ? 1 : 0); + }); + + // combine all results + var results = unimportantResults.concat(regularResults) + .concat(objectResults).concat(importantResults); + + // print the results + var resultCount = results.length; + function displayNextItem() { + // results left, load the summary and display it + if (results.length) { + var item = results.pop(); + var listItem = $('
      • '); + if (DOCUMENTATION_OPTIONS.FILE_SUFFIX == '') { + // dirhtml builder + var dirname = item[0] + '/'; + if (dirname.match(/\/index\/$/)) { + dirname = dirname.substring(0, dirname.length-6); + } else if (dirname == 'index/') { + dirname = ''; + } + listItem.append($('').attr('href', + DOCUMENTATION_OPTIONS.URL_ROOT + dirname + + highlightstring + item[2]).html(item[1])); + } else { + // normal html builders + listItem.append($('').attr('href', + item[0] + DOCUMENTATION_OPTIONS.FILE_SUFFIX + + highlightstring + item[2]).html(item[1])); + } + if (item[3]) { + listItem.append($(' (' + item[3] + ')')); + Search.output.append(listItem); + listItem.slideDown(5, function() { + displayNextItem(); + }); + } else if (DOCUMENTATION_OPTIONS.HAS_SOURCE) { + $.get(DOCUMENTATION_OPTIONS.URL_ROOT + '_sources/' + + item[0] + '.txt', function(data) { + if (data != '') { + listItem.append($.makeSearchSummary(data, searchterms, hlterms)); + Search.output.append(listItem); + } + listItem.slideDown(5, function() { + displayNextItem(); + }); + }); + } else { + // no source available, just display title + Search.output.append(listItem); + listItem.slideDown(5, function() { + displayNextItem(); + }); + } + } + // search finished, update title and status message + else { + Search.stopPulse(); + Search.title.text(_('Search Results')); + if (!resultCount) + Search.status.text(_('Your search did not match any documents. Please make sure that all words are spelled correctly and that you\'ve selected enough categories.')); + else + Search.status.text(_('Search finished, found %s page(s) matching the search query.').replace('%s', resultCount)); + Search.status.fadeIn(500); + } + } + displayNextItem(); + } +} + +$(document).ready(function() { + Search.init(); +}); diff --git a/lxq_static/underscore.js b/lxq_static/underscore.js new file mode 100644 index 0000000..9146e08 --- /dev/null +++ b/lxq_static/underscore.js @@ -0,0 +1,16 @@ +(function(){var j=this,n=j._,i=function(a){this._wrapped=a},m=typeof StopIteration!=="undefined"?StopIteration:"__break__",b=j._=function(a){return new i(a)};if(typeof exports!=="undefined")exports._=b;var k=Array.prototype.slice,o=Array.prototype.unshift,p=Object.prototype.toString,q=Object.prototype.hasOwnProperty,r=Object.prototype.propertyIsEnumerable;b.VERSION="0.5.5";b.each=function(a,c,d){try{if(a.forEach)a.forEach(c,d);else if(b.isArray(a)||b.isArguments(a))for(var e=0,f=a.length;e=e.computed&&(e={value:f,computed:g})});return e.value};b.min=function(a,c,d){if(!c&&b.isArray(a))return Math.min.apply(Math,a);var e={computed:Infinity};b.each(a,function(f,g,h){g=c?c.call(d,f,g,h):f;gf?1:0}),"value")};b.sortedIndex=function(a,c,d){d=d||b.identity;for(var e=0,f=a.length;e>1;d(a[g])=0})})};b.zip=function(){for(var a=b.toArray(arguments),c=b.max(b.pluck(a,"length")),d=new Array(c),e=0;e0?f-c:c-f)>=0)return e;e[g++]=f}};b.bind=function(a,c){var d=b.rest(arguments,2);return function(){return a.apply(c||j,d.concat(b.toArray(arguments)))}};b.bindAll=function(a){var c=b.rest(arguments);if(c.length==0)c=b.functions(a);b.each(c,function(d){a[d]=b.bind(a[d],a)}); +return a};b.delay=function(a,c){var d=b.rest(arguments,2);return setTimeout(function(){return a.apply(a,d)},c)};b.defer=function(a){return b.delay.apply(b,[a,1].concat(b.rest(arguments)))};b.wrap=function(a,c){return function(){var d=[a].concat(b.toArray(arguments));return c.apply(c,d)}};b.compose=function(){var a=b.toArray(arguments);return function(){for(var c=b.toArray(arguments),d=a.length-1;d>=0;d--)c=[a[d].apply(this,c)];return c[0]}};b.keys=function(a){if(b.isArray(a))return b.range(0,a.length); +var c=[];for(var d in a)q.call(a,d)&&c.push(d);return c};b.values=function(a){return b.map(a,b.identity)};b.functions=function(a){return b.select(b.keys(a),function(c){return b.isFunction(a[c])}).sort()};b.extend=function(a,c){for(var d in c)a[d]=c[d];return a};b.clone=function(a){if(b.isArray(a))return a.slice(0);return b.extend({},a)};b.tap=function(a,c){c(a);return a};b.isEqual=function(a,c){if(a===c)return true;var d=typeof a;if(d!=typeof c)return false;if(a==c)return true;if(!a&&c||a&&!c)return false; +if(a.isEqual)return a.isEqual(c);if(b.isDate(a)&&b.isDate(c))return a.getTime()===c.getTime();if(b.isNaN(a)&&b.isNaN(c))return true;if(b.isRegExp(a)&&b.isRegExp(c))return a.source===c.source&&a.global===c.global&&a.ignoreCase===c.ignoreCase&&a.multiline===c.multiline;if(d!=="object")return false;if(a.length&&a.length!==c.length)return false;d=b.keys(a);var e=b.keys(c);if(d.length!=e.length)return false;for(var f in a)if(!b.isEqual(a[f],c[f]))return false;return true};b.isEmpty=function(a){return b.keys(a).length== +0};b.isElement=function(a){return!!(a&&a.nodeType==1)};b.isArray=function(a){return!!(a&&a.concat&&a.unshift)};b.isArguments=function(a){return a&&b.isNumber(a.length)&&!b.isArray(a)&&!r.call(a,"length")};b.isFunction=function(a){return!!(a&&a.constructor&&a.call&&a.apply)};b.isString=function(a){return!!(a===""||a&&a.charCodeAt&&a.substr)};b.isNumber=function(a){return p.call(a)==="[object Number]"};b.isDate=function(a){return!!(a&&a.getTimezoneOffset&&a.setUTCFullYear)};b.isRegExp=function(a){return!!(a&& +a.test&&a.exec&&(a.ignoreCase||a.ignoreCase===false))};b.isNaN=function(a){return b.isNumber(a)&&isNaN(a)};b.isNull=function(a){return a===null};b.isUndefined=function(a){return typeof a=="undefined"};b.noConflict=function(){j._=n;return this};b.identity=function(a){return a};b.breakLoop=function(){throw m;};var s=0;b.uniqueId=function(a){var c=s++;return a?a+c:c};b.template=function(a,c){a=new Function("obj","var p=[],print=function(){p.push.apply(p,arguments);};with(obj){p.push('"+a.replace(/[\r\t\n]/g, +" ").replace(/'(?=[^%]*%>)/g,"\t").split("'").join("\\'").split("\t").join("'").replace(/<%=(.+?)%>/g,"',$1,'").split("<%").join("');").split("%>").join("p.push('")+"');}return p.join('');");return c?a(c):a};b.forEach=b.each;b.foldl=b.inject=b.reduce;b.foldr=b.reduceRight;b.filter=b.select;b.every=b.all;b.some=b.any;b.head=b.first;b.tail=b.rest;b.methods=b.functions;var l=function(a,c){return c?b(a).chain():a};b.each(b.functions(b),function(a){var c=b[a];i.prototype[a]=function(){var d=b.toArray(arguments); +o.call(d,this._wrapped);return l(c.apply(b,d),this._chain)}});b.each(["pop","push","reverse","shift","sort","splice","unshift"],function(a){var c=Array.prototype[a];i.prototype[a]=function(){c.apply(this._wrapped,arguments);return l(this._wrapped,this._chain)}});b.each(["concat","join","slice"],function(a){var c=Array.prototype[a];i.prototype[a]=function(){return l(c.apply(this._wrapped,arguments),this._chain)}});i.prototype.chain=function(){this._chain=true;return this};i.prototype.value=function(){return this._wrapped}})(); diff --git a/macros.h.html b/macros.h.html new file mode 100644 index 0000000..66468bc --- /dev/null +++ b/macros.h.html @@ -0,0 +1,208 @@ + + + + + + + + Special Macros — libxmlquery v0.1.4 documentation + + + + + + + + + + + +
        +

        Navigation

        +         +
        + +
        +
        +
        +
        + +
        +

        Special Macros

        +

        The file macros.h contains macros used all over our project. These macros were made to ease our pain in coding some things. This page describes and shows how to use them

        +
        +

        alloc

        +

        This section describes the macro

        +
        +
        +alloc
        +
        + +

        Ever get tired of calling malloc and check if the return address is a valid address, and if not print an error message and exit? The alloc macro can do all of this for you. It depends on the function __alloc():

        +
        +
        +static inline void* __alloc(void* x)
        +
        + +

        It is defined as:

        +
        #define alloc(type, how_many)                           \
+   (type *) __alloc(malloc(how_many * sizeof(type)));
+
+static inline void* __alloc(void* x){
+   if(x)
+     return x;
+   log(F,"malloc failed.");
+   exit(1);
+   return 0;
+}
+
        +
        +

        The key to this macro resides in the __alloc() function. It receives the address returned by malloc() and checks if it is valid. If not, then a log message is printed and exit() function is called. The following example shows how to use this function to allocate an array of 100 characters:

        +
        #include <stdio.h>
+#include "macros.h"
+
+int main(){
+  char* buffer = alloc(char, 100);
+  return 0;
+}
+
        +
        +

        You may compile it with

        +
        +
        gcc -o test <above_source_file> -I<folder path where macros.h is kept>
+
        +
        +
        +

        Notice that you won’t even have to bother with casting it to the right type.

        +
        +
        +

        log

        +

        This section describes the macro

        +
        +
        +log
        +
        + +

        Ever filled your code with printf() functions to debug it? And when you’re done with it needed to erase them? The log adds proper debug messages and doesn’t need to be removed when the code is functional. Let’s look at its definition:

        +
        #ifdef DEBUG
+#include <stdio.h>
+#define log(level, format, ...)                                 \
+  do{                                                           \
+    fprintf(stderr, "%s  %s:%d: ", level, __FILE__, __LINE__);  \
+    fprintf(stderr, format, ## __VA_ARGS__);                    \
+    fprintf(stderr, "\n");                                      \
+  }while(0)
+#else
+#define log(level, str, ...)
+#endif
+
+#define I "INFO"
+#define W "WARNNING"
+#define E "ERROR"
+#define F "FATAL ERROR"
+
        +
        +

        First note the macros for I, W, E, F at the bottom. These are merely alias for the level of severity, you may use any other. The log macro prints messages to the stderr and is able to format strings according to printf() format options. Consider this example:

        +
        #include "macros.h"
+
+int main(){
+ log(I, "Printing info");
+ return 0;
+}
+
        +
        +

        If we compile and run this example with the option -DDEBUG we’ll get the following output

        +
        +
        Printing info
+
        +
        +
        +

        If such option is not passed to the compiler, them no output will be shown. This happens because the macro is not created. What this means is that you can actually fill the code with logging messages and debug it, and when you’re done just compile it without -DDEBUG . The result is a binary file that doesn’t contain code related to debug messages, thus is smaller than the debug version. However, if you need to debug it again, you can always recompile it with the debug flag.

        +

        Notice that file name and line number are printed as well, which helps you pin-point the location of the print and check what may have been the cause of the problem.

        +
        +
        + + +
        +
        +
        +
        +
        +

        Table Of Contents

        + + +

        Previous topic

        +

        Data Structures

        +

        Next topic

        +

        Shell

        +

        This Page

        + + + +
        +
        +
        +
        +
        +

        Navigation

        + +
        +
        + © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
        + + \ No newline at end of file diff --git a/main.c b/main.c deleted file mode 100644 index 3791d59..0000000 --- a/main.c +++ /dev/null @@ -1,78 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include "include/node.h" -#include "include/serialize.h" -#include "include/lxq_parser.h" -#include "include/stack.h" -#include "include/query_runner.h" -#include "include/custom_selectors.h" -#include "include/node.h" - -int main(int argc, char** argv){ - int i; - char *filename, *query_string, *node; - - if(argc == 2){ - filename = "-"; - } - else if(argc != 3){ - printf("usage: %s \"query\" \"xml_file\"\n", argv[0]); - return 0; - } - else{ - filename = argv[2]; - } - - query_string = argv[1]; - - doc* document = parse_xml(filename); - if(document == NULL) exit(1); - - register_extended_operators(); - list* result = query(query_string, document->root); - - if(result == NULL) exit(1); - - for(i=0; i < result->count; i++){ - dom_node* t = (dom_node*)get_element_at(result, i); - node = node_to_string(t, XML); - printf("%s", node); - free(node); - } - - if(result) - destroy_generic_list(result); - - if(document != NULL) - destroy_dom_tree(document); - - destroy_dictionary(); - destroy_custom_filters(); - destroy_custom_operators(); - return 0; -} - diff --git a/objects.inv b/objects.inv new file mode 100644 index 0000000..37a47c1 Binary files /dev/null and b/objects.inv differ diff --git a/parser/Makefile b/parser/Makefile deleted file mode 100644 index 0b68d51..0000000 --- a/parser/Makefile +++ /dev/null @@ -1,14 +0,0 @@ -include ../Makefile.inc - -all: lex y.tab.h yacc ../include/lxq_parser.h lxq_parser.c - $(CC) $(CFLAGS) -c lxq_parser.c - $(CC) $(LEXFLAGS) lex.yy.c y.tab.c - -lex y.tab.h yacc: parser.y parser.l - yacc -d parser.y - lex parser.l - mv y.tab.h ../include/ - -clean: - rm -rf *~ *.o *.out - diff --git a/parser/lex.yy.c b/parser/lex.yy.c deleted file mode 100644 index 1d0be41..0000000 --- a/parser/lex.yy.c +++ /dev/null @@ -1,2559 +0,0 @@ - -#line 3 "lex.yy.c" - -#define YY_INT_ALIGNED short int - -/* A lexical scanner generated by flex */ - -#define FLEX_SCANNER -#define YY_FLEX_MAJOR_VERSION 2 -#define YY_FLEX_MINOR_VERSION 5 -#define YY_FLEX_SUBMINOR_VERSION 35 -#if YY_FLEX_SUBMINOR_VERSION > 0 -#define FLEX_BETA -#endif - -/* First, we deal with platform-specific or compiler-specific issues. */ - -/* begin standard C headers. */ -#include -#include -#include -#include - -/* end standard C headers. */ - -/* flex integer type definitions */ - -#ifndef FLEXINT_H -#define FLEXINT_H - -/* C99 systems have . Non-C99 systems may or may not. */ - -#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L - -/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, - * if you want the limit (max/min) macros for int types. - */ -#ifndef __STDC_LIMIT_MACROS -#define __STDC_LIMIT_MACROS 1 -#endif - -#include -typedef int8_t flex_int8_t; -typedef uint8_t flex_uint8_t; -typedef int16_t flex_int16_t; -typedef uint16_t flex_uint16_t; -typedef int32_t flex_int32_t; -typedef uint32_t flex_uint32_t; -#else -typedef signed char flex_int8_t; -typedef short int flex_int16_t; -typedef int flex_int32_t; -typedef unsigned char flex_uint8_t; -typedef unsigned short int flex_uint16_t; -typedef unsigned int flex_uint32_t; - -/* Limits of integral types. */ -#ifndef INT8_MIN -#define INT8_MIN (-128) -#endif -#ifndef INT16_MIN -#define INT16_MIN (-32767-1) -#endif -#ifndef INT32_MIN -#define INT32_MIN (-2147483647-1) -#endif -#ifndef INT8_MAX -#define INT8_MAX (127) -#endif -#ifndef INT16_MAX -#define INT16_MAX (32767) -#endif -#ifndef INT32_MAX -#define INT32_MAX (2147483647) -#endif -#ifndef UINT8_MAX -#define UINT8_MAX (255U) -#endif -#ifndef UINT16_MAX -#define UINT16_MAX (65535U) -#endif -#ifndef UINT32_MAX -#define UINT32_MAX (4294967295U) -#endif - -#endif /* ! C99 */ - -#endif /* ! FLEXINT_H */ - -#ifdef __cplusplus - -/* The "const" storage-class-modifier is valid. */ -#define YY_USE_CONST - -#else /* ! __cplusplus */ - -/* C99 requires __STDC__ to be defined as 1. */ -#if defined (__STDC__) - -#define YY_USE_CONST - -#endif /* defined (__STDC__) */ -#endif /* ! __cplusplus */ - -#ifdef YY_USE_CONST -#define yyconst const -#else -#define yyconst -#endif - -/* Returned upon end-of-file. */ -#define YY_NULL 0 - -/* Promotes a possibly negative, possibly signed char to an unsigned - * integer for use as an array index. If the signed char is negative, - * we want to instead treat it as an 8-bit unsigned char, hence the - * double cast. - */ -#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) - -/* Enter a start condition. This macro really ought to take a parameter, - * but we do it the disgusting crufty way forced on us by the ()-less - * definition of BEGIN. - */ -#define BEGIN (yy_start) = 1 + 2 * - -/* Translate the current start state into a value that can be later handed - * to BEGIN to return to the state. The YYSTATE alias is for lex - * compatibility. - */ -#define YY_START (((yy_start) - 1) / 2) -#define YYSTATE YY_START - -/* Action number for EOF rule of a given start state. */ -#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) - -/* Special action meaning "start processing a new file". */ -#define YY_NEW_FILE yyrestart(yyin ) - -#define YY_END_OF_BUFFER_CHAR 0 - -/* Size of default input buffer. */ -#ifndef YY_BUF_SIZE -#ifdef __ia64__ -/* On IA-64, the buffer size is 16k, not 8k. - * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case. - * Ditto for the __ia64__ case accordingly. - */ -#define YY_BUF_SIZE 32768 -#else -#define YY_BUF_SIZE 16384 -#endif /* __ia64__ */ -#endif - -/* The state buf must be large enough to hold one state per character in the main buffer. - */ -#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) - -#ifndef YY_TYPEDEF_YY_BUFFER_STATE -#define YY_TYPEDEF_YY_BUFFER_STATE -typedef struct yy_buffer_state *YY_BUFFER_STATE; -#endif - -extern int yyleng; - -extern FILE *yyin, *yyout; - -#define EOB_ACT_CONTINUE_SCAN 0 -#define EOB_ACT_END_OF_FILE 1 -#define EOB_ACT_LAST_MATCH 2 - - /* Note: We specifically omit the test for yy_rule_can_match_eol because it requires - * access to the local variable yy_act. Since yyless() is a macro, it would break - * existing scanners that call yyless() from OUTSIDE yylex. - * One obvious solution it to make yy_act a global. I tried that, and saw - * a 5% performance hit in a non-yylineno scanner, because yy_act is - * normally declared as a register variable-- so it is not worth it. - */ - #define YY_LESS_LINENO(n) \ - do { \ - int yyl;\ - for ( yyl = n; yyl < yyleng; ++yyl )\ - if ( yytext[yyl] == '\n' )\ - --yylineno;\ - }while(0) - -/* Return all but the first "n" matched characters back to the input stream. */ -#define yyless(n) \ - do \ - { \ - /* Undo effects of setting up yytext. */ \ - int yyless_macro_arg = (n); \ - YY_LESS_LINENO(yyless_macro_arg);\ - *yy_cp = (yy_hold_char); \ - YY_RESTORE_YY_MORE_OFFSET \ - (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ - YY_DO_BEFORE_ACTION; /* set up yytext again */ \ - } \ - while ( 0 ) - -#define unput(c) yyunput( c, (yytext_ptr) ) - -#ifndef YY_TYPEDEF_YY_SIZE_T -#define YY_TYPEDEF_YY_SIZE_T -typedef size_t yy_size_t; -#endif - -#ifndef YY_STRUCT_YY_BUFFER_STATE -#define YY_STRUCT_YY_BUFFER_STATE -struct yy_buffer_state - { - FILE *yy_input_file; - - char *yy_ch_buf; /* input buffer */ - char *yy_buf_pos; /* current position in input buffer */ - - /* Size of input buffer in bytes, not including room for EOB - * characters. - */ - yy_size_t yy_buf_size; - - /* Number of characters read into yy_ch_buf, not including EOB - * characters. - */ - int yy_n_chars; - - /* Whether we "own" the buffer - i.e., we know we created it, - * and can realloc() it to grow it, and should free() it to - * delete it. - */ - int yy_is_our_buffer; - - /* Whether this is an "interactive" input source; if so, and - * if we're using stdio for input, then we want to use getc() - * instead of fread(), to make sure we stop fetching input after - * each newline. - */ - int yy_is_interactive; - - /* Whether we're considered to be at the beginning of a line. - * If so, '^' rules will be active on the next match, otherwise - * not. - */ - int yy_at_bol; - - int yy_bs_lineno; /**< The line count. */ - int yy_bs_column; /**< The column count. */ - - /* Whether to try to fill the input buffer when we reach the - * end of it. - */ - int yy_fill_buffer; - - int yy_buffer_status; - -#define YY_BUFFER_NEW 0 -#define YY_BUFFER_NORMAL 1 - /* When an EOF's been seen but there's still some text to process - * then we mark the buffer as YY_EOF_PENDING, to indicate that we - * shouldn't try reading from the input source any more. We might - * still have a bunch of tokens to match, though, because of - * possible backing-up. - * - * When we actually see the EOF, we change the status to "new" - * (via yyrestart()), so that the user can continue scanning by - * just pointing yyin at a new input file. - */ -#define YY_BUFFER_EOF_PENDING 2 - - }; -#endif /* !YY_STRUCT_YY_BUFFER_STATE */ - -/* Stack of input buffers. */ -static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ -static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ -static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */ - -/* We provide macros for accessing buffer states in case in the - * future we want to put the buffer states in a more general - * "scanner state". - * - * Returns the top of the stack, or NULL. - */ -#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ - ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ - : NULL) - -/* Same as previous macro, but useful when we know that the buffer stack is not - * NULL or when we need an lvalue. For internal use only. - */ -#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] - -/* yy_hold_char holds the character lost when yytext is formed. */ -static char yy_hold_char; -static int yy_n_chars; /* number of characters read into yy_ch_buf */ -int yyleng; - -/* Points to current character in buffer. */ -static char *yy_c_buf_p = (char *) 0; -static int yy_init = 0; /* whether we need to initialize */ -static int yy_start = 0; /* start state number */ - -/* Flag which is used to allow yywrap()'s to do buffer switches - * instead of setting up a fresh yyin. A bit of a hack ... - */ -static int yy_did_buffer_switch_on_eof; - -void yyrestart (FILE *input_file ); -void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ); -YY_BUFFER_STATE yy_create_buffer (FILE *file,int size ); -void yy_delete_buffer (YY_BUFFER_STATE b ); -void yy_flush_buffer (YY_BUFFER_STATE b ); -void yypush_buffer_state (YY_BUFFER_STATE new_buffer ); -void yypop_buffer_state (void ); - -static void yyensure_buffer_stack (void ); -static void yy_load_buffer_state (void ); -static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file ); - -#define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER ) - -YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size ); -YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str ); -YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,int len ); - -void *yyalloc (yy_size_t ); -void *yyrealloc (void *,yy_size_t ); -void yyfree (void * ); - -#define yy_new_buffer yy_create_buffer - -#define yy_set_interactive(is_interactive) \ - { \ - if ( ! YY_CURRENT_BUFFER ){ \ - yyensure_buffer_stack (); \ - YY_CURRENT_BUFFER_LVALUE = \ - yy_create_buffer(yyin,YY_BUF_SIZE ); \ - } \ - YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ - } - -#define yy_set_bol(at_bol) \ - { \ - if ( ! YY_CURRENT_BUFFER ){\ - yyensure_buffer_stack (); \ - YY_CURRENT_BUFFER_LVALUE = \ - yy_create_buffer(yyin,YY_BUF_SIZE ); \ - } \ - YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ - } - -#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) - -/* Begin user sect3 */ - -typedef unsigned char YY_CHAR; - -FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; - -typedef int yy_state_type; - -extern int yylineno; - -int yylineno = 1; - -extern char *yytext; -#define yytext_ptr yytext - -static yy_state_type yy_get_previous_state (void ); -static yy_state_type yy_try_NUL_trans (yy_state_type current_state ); -static int yy_get_next_buffer (void ); -static void yy_fatal_error (yyconst char msg[] ); - -/* Done after the current pattern has been matched and before the - * corresponding action - sets up yytext. - */ -#define YY_DO_BEFORE_ACTION \ - (yytext_ptr) = yy_bp; \ - yyleng = (size_t) (yy_cp - yy_bp); \ - (yy_hold_char) = *yy_cp; \ - *yy_cp = '\0'; \ - (yy_c_buf_p) = yy_cp; - -#define YY_NUM_RULES 88 -#define YY_END_OF_BUFFER 89 -/* This struct is not used in this scanner, - but its presence is necessary. */ -struct yy_trans_info - { - flex_int32_t yy_verify; - flex_int32_t yy_nxt; - }; -static yyconst flex_int16_t yy_accept[251] = - { 0, - 5, 5, 0, 0, 25, 25, 27, 27, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 10, 10, - 39, 39, 85, 85, 83, 83, 78, 78, 0, 0, - 89, 5, 4, 88, 6, 1, 88, 24, 17, 22, - 23, 20, 18, 21, 88, 19, 15, 16, 25, 26, - 27, 28, 29, 29, 29, 31, 31, 31, 67, 67, - 67, 67, 67, 67, 71, 77, 72, 73, 69, 76, - 76, 70, 76, 68, 11, 10, 9, 88, 13, 59, - 34, 34, 39, 59, 40, 51, 59, 41, 48, 49, - 33, 46, 44, 50, 42, 43, 52, 45, 35, 37, - - 38, 59, 59, 47, 85, 86, 83, 84, 78, 81, - 88, 87, 5, 4, 0, 24, 20, 0, 25, 27, - 0, 0, 67, 67, 67, 67, 67, 67, 67, 71, - 69, 76, 76, 76, 12, 0, 10, 9, 0, 34, - 39, 0, 0, 0, 46, 44, 52, 45, 0, 0, - 47, 58, 36, 55, 56, 46, 44, 52, 45, 35, - 54, 57, 47, 53, 85, 83, 78, 80, 79, 82, - 0, 0, 0, 30, 32, 67, 67, 67, 66, 67, - 67, 76, 75, 0, 0, 58, 36, 36, 55, 56, - 54, 57, 53, 2, 0, 14, 67, 67, 67, 67, - - 67, 74, 7, 0, 0, 65, 67, 67, 67, 67, - 67, 0, 0, 67, 67, 67, 67, 67, 0, 0, - 67, 67, 67, 67, 67, 0, 0, 67, 67, 67, - 67, 67, 0, 3, 67, 67, 60, 67, 67, 8, - 67, 63, 67, 64, 62, 67, 67, 67, 61, 0 - } ; - -static yyconst flex_int32_t yy_ec[256] = - { 0, - 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, - 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 5, 6, 7, 8, 9, 1, 1, 10, 11, - 12, 13, 14, 15, 16, 17, 18, 19, 20, 20, - 20, 20, 20, 20, 20, 20, 20, 21, 1, 22, - 23, 24, 25, 26, 27, 28, 29, 30, 28, 28, - 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, - 28, 28, 28, 31, 28, 28, 28, 28, 28, 28, - 32, 33, 34, 35, 28, 1, 36, 28, 37, 38, - - 39, 40, 28, 41, 42, 28, 28, 43, 44, 45, - 46, 47, 28, 48, 49, 50, 28, 51, 28, 28, - 52, 28, 1, 53, 1, 54, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1 - } ; - -static yyconst flex_int32_t yy_meta[55] = - { 0, - 1, 1, 2, 2, 3, 1, 4, 1, 1, 5, - 1, 1, 1, 1, 1, 6, 1, 7, 6, 6, - 1, 2, 8, 1, 1, 9, 10, 10, 10, 10, - 10, 1, 7, 1, 1, 10, 10, 10, 10, 10, - 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, - 10, 10, 1, 1 - } ; - -static yyconst flex_int16_t yy_base[275] = - { 0, - 0, 2, 28, 0, 635, 634, 636, 635, 79, 80, - 3, 4, 114, 0, 168, 0, 212, 0, 83, 87, - 264, 0, 634, 633, 629, 628, 75, 77, 634, 633, - 635, 0, 646, 631, 627, 646, 646, 7, 646, 646, - 646, 0, 646, 646, 626, 646, 646, 646, 0, 646, - 0, 646, 646, 646, 597, 646, 646, 614, 0, 585, - 586, 591, 48, 581, 10, 646, 646, 646, 77, 0, - 574, 0, 586, 646, 16, 97, 646, 620, 616, 646, - 13, 97, 314, 598, 646, 646, 597, 646, 646, 646, - 596, 613, 612, 646, 646, 646, 611, 610, 0, 646, - - 646, 591, 590, 221, 0, 646, 0, 646, 0, 570, - 593, 646, 0, 646, 213, 228, 0, 594, 0, 0, - 585, 584, 0, 560, 558, 556, 554, 562, 559, 231, - 84, 0, 562, 562, 222, 223, 319, 646, 309, 103, - 0, 576, 575, 574, 591, 590, 589, 588, 569, 568, - 317, 585, 584, 583, 582, 581, 580, 579, 578, 0, - 577, 576, 575, 573, 0, 0, 0, 646, 646, 646, - 561, 547, 558, 646, 646, 523, 509, 496, 0, 519, - 478, 484, 0, 512, 496, 510, 507, 506, 505, 502, - 501, 500, 492, 646, 458, 646, 430, 431, 464, 289, - - 461, 0, 646, 440, 339, 0, 349, 327, 322, 326, - 324, 333, 328, 321, 316, 314, 306, 313, 322, 325, - 310, 308, 305, 297, 304, 318, 312, 301, 299, 301, - 320, 292, 302, 646, 290, 293, 0, 293, 209, 646, - 208, 0, 197, 0, 0, 195, 69, 73, 0, 646, - 368, 378, 388, 398, 408, 418, 428, 438, 448, 458, - 468, 473, 483, 493, 498, 503, 513, 516, 521, 531, - 541, 551, 561, 569 - } ; - -static yyconst flex_int16_t yy_def[275] = - { 0, - 251, 251, 250, 3, 252, 252, 253, 253, 254, 254, - 255, 255, 250, 13, 250, 15, 13, 17, 256, 256, - 250, 21, 257, 257, 258, 258, 259, 259, 260, 260, - 250, 261, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 262, 250, 250, 250, 250, 250, 250, 263, 250, - 264, 250, 250, 250, 250, 250, 250, 250, 265, 265, - 265, 265, 265, 265, 250, 250, 250, 250, 250, 266, - 266, 266, 266, 250, 267, 250, 250, 250, 250, 250, - 250, 250, 250, 268, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 269, 250, - - 250, 250, 250, 250, 270, 250, 271, 250, 272, 250, - 273, 250, 261, 250, 250, 250, 262, 250, 263, 264, - 250, 250, 265, 265, 265, 265, 265, 265, 265, 250, - 250, 266, 266, 266, 267, 267, 250, 250, 250, 250, - 83, 268, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 274, 250, 250, 250, 250, 250, 250, 269, - 250, 250, 250, 250, 270, 271, 272, 250, 250, 250, - 250, 250, 250, 250, 250, 265, 265, 265, 265, 265, - 265, 266, 266, 250, 250, 250, 250, 274, 250, 250, - 250, 250, 250, 250, 250, 250, 265, 265, 265, 265, - - 265, 266, 250, 250, 250, 265, 265, 265, 265, 265, - 265, 250, 250, 265, 265, 265, 265, 265, 250, 250, - 265, 265, 265, 265, 265, 250, 250, 265, 265, 265, - 265, 265, 250, 250, 265, 265, 265, 265, 265, 250, - 265, 265, 265, 265, 265, 265, 265, 265, 265, 0, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250 - } ; - -static yyconst flex_int16_t yy_nxt[701] = - { 0, - 250, 250, 33, 34, 33, 34, 57, 57, 116, 116, - 116, 116, 130, 130, 130, 140, 140, 136, 58, 58, - 136, 35, 250, 35, 250, 36, 250, 36, 37, 38, - 38, 38, 38, 39, 40, 37, 37, 41, 37, 37, - 37, 37, 37, 42, 37, 43, 37, 37, 44, 45, - 46, 47, 48, 37, 42, 42, 42, 42, 42, 37, - 37, 37, 37, 42, 42, 42, 42, 42, 42, 42, - 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, - 37, 37, 54, 54, 76, 77, 78, 76, 76, 77, - 78, 76, 110, 127, 110, 131, 131, 128, 137, 140, - - 140, 137, 131, 131, 79, 140, 140, 111, 79, 111, - 249, 248, 55, 55, 37, 37, 37, 37, 37, 37, - 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, - 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, - 59, 59, 59, 59, 59, 37, 37, 37, 37, 59, - 59, 59, 60, 61, 59, 59, 62, 59, 63, 64, - 59, 59, 59, 59, 59, 59, 37, 37, 37, 37, - 65, 65, 65, 37, 37, 37, 37, 37, 37, 66, - 37, 67, 37, 68, 37, 37, 37, 69, 37, 37, - 37, 37, 37, 37, 70, 70, 70, 70, 70, 37, - - 37, 37, 37, 70, 70, 70, 71, 70, 70, 70, - 70, 70, 72, 73, 70, 70, 70, 70, 70, 70, - 37, 37, 74, 136, 136, 163, 136, 136, 171, 116, - 116, 116, 116, 130, 130, 130, 247, 246, 37, 37, - 37, 37, 37, 164, 172, 245, 244, 37, 37, 37, - 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, - 37, 37, 37, 37, 80, 80, 81, 82, 83, 84, - 85, 86, 87, 88, 89, 90, 91, 92, 93, 80, - 94, 95, 80, 80, 96, 80, 97, 98, 80, 80, - 99, 99, 99, 99, 99, 100, 80, 101, 102, 99, - - 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, - 99, 99, 99, 99, 99, 99, 103, 104, 141, 142, - 137, 163, 143, 137, 184, 209, 144, 145, 146, 243, - 242, 210, 241, 240, 239, 238, 147, 148, 237, 164, - 185, 236, 235, 234, 233, 232, 231, 230, 149, 229, - 228, 227, 226, 225, 224, 223, 222, 221, 220, 219, - 218, 217, 216, 215, 214, 213, 150, 151, 32, 32, - 32, 32, 32, 32, 32, 32, 32, 32, 49, 49, - 49, 49, 49, 49, 49, 49, 49, 49, 51, 51, - 51, 51, 51, 51, 51, 51, 51, 51, 53, 53, - - 53, 53, 53, 53, 53, 53, 53, 53, 56, 56, - 56, 56, 56, 56, 56, 56, 56, 56, 75, 75, - 75, 75, 75, 75, 75, 75, 75, 75, 105, 105, - 105, 105, 105, 105, 105, 105, 105, 105, 107, 107, - 107, 107, 107, 107, 107, 107, 107, 107, 109, 109, - 109, 109, 109, 109, 109, 109, 109, 109, 112, 112, - 112, 112, 112, 112, 112, 112, 112, 112, 113, 212, - 113, 113, 113, 113, 113, 113, 211, 113, 117, 208, - 207, 206, 117, 119, 119, 119, 119, 205, 119, 119, - 119, 119, 119, 120, 120, 120, 193, 120, 120, 120, - - 120, 120, 120, 123, 192, 191, 190, 123, 132, 189, - 187, 187, 132, 135, 186, 135, 135, 135, 135, 135, - 135, 135, 135, 153, 204, 153, 160, 203, 202, 201, - 160, 165, 165, 165, 200, 165, 165, 165, 165, 165, - 165, 166, 166, 166, 166, 199, 166, 166, 166, 166, - 166, 167, 167, 167, 167, 167, 167, 198, 167, 167, - 167, 169, 169, 169, 169, 169, 169, 169, 169, 169, - 169, 188, 197, 196, 188, 195, 194, 193, 188, 163, - 192, 191, 159, 158, 157, 156, 190, 189, 187, 186, - 162, 161, 159, 158, 157, 156, 155, 154, 152, 183, - - 182, 181, 180, 179, 178, 177, 176, 175, 174, 173, - 170, 168, 162, 161, 159, 158, 157, 156, 155, 154, - 152, 139, 138, 134, 133, 129, 126, 125, 124, 122, - 121, 118, 115, 114, 250, 37, 37, 108, 108, 106, - 106, 52, 52, 50, 50, 31, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250 - - } ; - -static yyconst flex_int16_t yy_chk[701] = - { 0, - 0, 0, 1, 1, 2, 2, 11, 12, 38, 38, - 38, 38, 65, 65, 65, 81, 81, 75, 11, 12, - 75, 1, 0, 2, 0, 1, 0, 2, 3, 3, - 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, - 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, - 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, - 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, - 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, - 3, 3, 9, 10, 19, 19, 19, 19, 20, 20, - 20, 20, 27, 63, 28, 69, 69, 63, 76, 82, - - 82, 76, 131, 131, 19, 140, 140, 27, 20, 28, - 248, 247, 9, 10, 13, 13, 13, 13, 13, 13, - 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, - 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, - 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, - 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, - 13, 13, 13, 13, 13, 13, 13, 13, 15, 15, - 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, - 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, - 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, - - 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, - 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, - 15, 15, 17, 135, 136, 104, 135, 136, 115, 116, - 116, 116, 116, 130, 130, 130, 246, 243, 17, 17, - 17, 17, 17, 104, 115, 241, 239, 17, 17, 17, - 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, - 17, 17, 17, 17, 21, 21, 21, 21, 21, 21, - 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, - 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, - 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, - - 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, - 21, 21, 21, 21, 21, 21, 21, 21, 83, 83, - 137, 151, 83, 137, 139, 200, 83, 83, 83, 238, - 236, 200, 235, 233, 232, 231, 83, 83, 230, 151, - 139, 229, 228, 227, 226, 225, 224, 223, 83, 222, - 221, 220, 219, 218, 217, 216, 215, 214, 213, 212, - 211, 210, 209, 208, 207, 205, 83, 83, 251, 251, - 251, 251, 251, 251, 251, 251, 251, 251, 252, 252, - 252, 252, 252, 252, 252, 252, 252, 252, 253, 253, - 253, 253, 253, 253, 253, 253, 253, 253, 254, 254, - - 254, 254, 254, 254, 254, 254, 254, 254, 255, 255, - 255, 255, 255, 255, 255, 255, 255, 255, 256, 256, - 256, 256, 256, 256, 256, 256, 256, 256, 257, 257, - 257, 257, 257, 257, 257, 257, 257, 257, 258, 258, - 258, 258, 258, 258, 258, 258, 258, 258, 259, 259, - 259, 259, 259, 259, 259, 259, 259, 259, 260, 260, - 260, 260, 260, 260, 260, 260, 260, 260, 261, 204, - 261, 261, 261, 261, 261, 261, 201, 261, 262, 199, - 198, 197, 262, 263, 263, 263, 263, 195, 263, 263, - 263, 263, 263, 264, 264, 264, 193, 264, 264, 264, - - 264, 264, 264, 265, 192, 191, 190, 265, 266, 189, - 188, 187, 266, 267, 186, 267, 267, 267, 267, 267, - 267, 267, 267, 268, 185, 268, 269, 184, 182, 181, - 269, 270, 270, 270, 180, 270, 270, 270, 270, 270, - 270, 271, 271, 271, 271, 178, 271, 271, 271, 271, - 271, 272, 272, 272, 272, 272, 272, 177, 272, 272, - 272, 273, 273, 273, 273, 273, 273, 273, 273, 273, - 273, 274, 176, 173, 274, 172, 171, 164, 274, 163, - 162, 161, 159, 158, 157, 156, 155, 154, 153, 152, - 150, 149, 148, 147, 146, 145, 144, 143, 142, 134, - - 133, 129, 128, 127, 126, 125, 124, 122, 121, 118, - 111, 110, 103, 102, 98, 97, 93, 92, 91, 87, - 84, 79, 78, 73, 71, 64, 62, 61, 60, 58, - 55, 45, 35, 34, 31, 30, 29, 26, 25, 24, - 23, 8, 7, 6, 5, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250, - 250, 250, 250, 250, 250, 250, 250, 250, 250, 250 - - } ; - -/* Table of booleans, true if rule could match eol. */ -static yyconst flex_int32_t yy_rule_can_match_eol[89] = - { 0, -0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, - 0, 0, 0, 1, 0, 1, 0, 0, 0, }; - -static yy_state_type yy_last_accepting_state; -static char *yy_last_accepting_cpos; - -extern int yy_flex_debug; -int yy_flex_debug = 0; - -/* The intent behind this definition is that it'll catch - * any uses of REJECT which flex missed. - */ -#define REJECT reject_used_but_not_detected -#define yymore() yymore_used_but_not_detected -#define YY_MORE_ADJ 0 -#define YY_RESTORE_YY_MORE_OFFSET -char *yytext; -#line 1 "parser.l" -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ -#line 26 "parser.l" -#include -#include "../include/y.tab.h" -#include "../include/stack.h" -#include "../include/byte_buffer.h" - -stack* trash_bin = NULL; -byte_buffer* lxq_cdata_buffer = NULL; -int lxq_parser_last_state; - -char *trimwhitespace(char *str) -{ - char *end; - - // Trim leading space - while(*str == ' ') str++; - - if(*str == 0) // All spaces? - return str; - - // Trim trailing space - end = str + strlen(str) - 1; - while(end > str && *end == ' ') end--; - - // Write new null terminator - *(end+1) = 0; - - return str; -} - -#line 774 "lex.yy.c" - -#define INITIAL 0 -#define IN_STATE 1 -#define TEXT_BLOCK_SQ_XML 2 -#define TEXT_BLOCK_DQ_XML 3 -#define CDATA 4 -#define COMMENT 5 -#define FUNC 6 -#define PARAMS 7 -#define NOT_STATE 8 -#define XML_INITIAL 9 -#define QUERY_INITIAL 10 -#define TEXT_BLOCK_DQ_QUERY 11 -#define TEXT_BLOCK_SQ_QUERY 12 -#define REGEX_BLOCK 13 -#define ESCAPE 14 - -#ifndef YY_NO_UNISTD_H -/* Special case for "unistd.h", since it is non-ANSI. We include it way - * down here because we want the user's section 1 to have been scanned first. - * The user has a chance to override it with an option. - */ -#include -#endif - -#ifndef YY_EXTRA_TYPE -#define YY_EXTRA_TYPE void * -#endif - -static int yy_init_globals (void ); - -/* Accessor methods to globals. - These are made visible to non-reentrant scanners for convenience. */ - -int yylex_destroy (void ); - -int yyget_debug (void ); - -void yyset_debug (int debug_flag ); - -YY_EXTRA_TYPE yyget_extra (void ); - -void yyset_extra (YY_EXTRA_TYPE user_defined ); - -FILE *yyget_in (void ); - -void yyset_in (FILE * in_str ); - -FILE *yyget_out (void ); - -void yyset_out (FILE * out_str ); - -int yyget_leng (void ); - -char *yyget_text (void ); - -int yyget_lineno (void ); - -void yyset_lineno (int line_number ); - -/* Macros after this point can all be overridden by user definitions in - * section 1. - */ - -#ifndef YY_SKIP_YYWRAP -#ifdef __cplusplus -extern "C" int yywrap (void ); -#else -extern int yywrap (void ); -#endif -#endif - - static void yyunput (int c,char *buf_ptr ); - -#ifndef yytext_ptr -static void yy_flex_strncpy (char *,yyconst char *,int ); -#endif - -#ifdef YY_NEED_STRLEN -static int yy_flex_strlen (yyconst char * ); -#endif - -#ifndef YY_NO_INPUT - -#ifdef __cplusplus -static int yyinput (void ); -#else -static int input (void ); -#endif - -#endif - -/* Amount of stuff to slurp up with each read. */ -#ifndef YY_READ_BUF_SIZE -#ifdef __ia64__ -/* On IA-64, the buffer size is 16k, not 8k */ -#define YY_READ_BUF_SIZE 16384 -#else -#define YY_READ_BUF_SIZE 8192 -#endif /* __ia64__ */ -#endif - -/* Copy whatever the last rule matched to the standard output. */ -#ifndef ECHO -/* This used to be an fputs(), but since the string might contain NUL's, - * we now use fwrite(). - */ -#define ECHO do { if (fwrite( yytext, yyleng, 1, yyout )) {} } while (0) -#endif - -/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, - * is returned in "result". - */ -#ifndef YY_INPUT -#define YY_INPUT(buf,result,max_size) \ - if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ - { \ - int c = '*'; \ - size_t n; \ - for ( n = 0; n < max_size && \ - (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ - buf[n] = (char) c; \ - if ( c == '\n' ) \ - buf[n++] = (char) c; \ - if ( c == EOF && ferror( yyin ) ) \ - YY_FATAL_ERROR( "input in flex scanner failed" ); \ - result = n; \ - } \ - else \ - { \ - errno=0; \ - while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \ - { \ - if( errno != EINTR) \ - { \ - YY_FATAL_ERROR( "input in flex scanner failed" ); \ - break; \ - } \ - errno=0; \ - clearerr(yyin); \ - } \ - }\ -\ - -#endif - -/* No semi-colon after return; correct usage is to write "yyterminate();" - - * we don't want an extra ';' after the "return" because that will cause - * some compilers to complain about unreachable statements. - */ -#ifndef yyterminate -#define yyterminate() return YY_NULL -#endif - -/* Number of entries by which start-condition stack grows. */ -#ifndef YY_START_STACK_INCR -#define YY_START_STACK_INCR 25 -#endif - -/* Report a fatal error. */ -#ifndef YY_FATAL_ERROR -#define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) -#endif - -/* end tables serialization structures and prototypes */ - -/* Default declaration of generated scanner - a define so the user can - * easily add parameters. - */ -#ifndef YY_DECL -#define YY_DECL_IS_OURS 1 - -extern int yylex (void); - -#define YY_DECL int yylex (void) -#endif /* !YY_DECL */ - -/* Code executed at the beginning of each rule, after yytext and yyleng - * have been set up. - */ -#ifndef YY_USER_ACTION -#define YY_USER_ACTION -#endif - -/* Code executed at the end of each rule. */ -#ifndef YY_BREAK -#define YY_BREAK break; -#endif - -#define YY_RULE_SETUP \ - YY_USER_ACTION - -/** The main scanner function which does all the work. - */ -YY_DECL -{ - register yy_state_type yy_current_state; - register char *yy_cp, *yy_bp; - register int yy_act; - -#line 58 "parser.l" - -#line 977 "lex.yy.c" - - if ( !(yy_init) ) - { - (yy_init) = 1; - -#ifdef YY_USER_INIT - YY_USER_INIT; -#endif - - if ( ! (yy_start) ) - (yy_start) = 1; /* first start state */ - - if ( ! yyin ) - yyin = stdin; - - if ( ! yyout ) - yyout = stdout; - - if ( ! YY_CURRENT_BUFFER ) { - yyensure_buffer_stack (); - YY_CURRENT_BUFFER_LVALUE = - yy_create_buffer(yyin,YY_BUF_SIZE ); - } - - yy_load_buffer_state( ); - } - - while ( 1 ) /* loops until end-of-file is reached */ - { - yy_cp = (yy_c_buf_p); - - /* Support of yytext. */ - *yy_cp = (yy_hold_char); - - /* yy_bp points to the position in yy_ch_buf of the start of - * the current run. - */ - yy_bp = yy_cp; - - yy_current_state = (yy_start); -yy_match: - do - { - register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; - if ( yy_accept[yy_current_state] ) - { - (yy_last_accepting_state) = yy_current_state; - (yy_last_accepting_cpos) = yy_cp; - } - while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) - { - yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 251 ) - yy_c = yy_meta[(unsigned int) yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; - ++yy_cp; - } - while ( yy_base[yy_current_state] != 646 ); - -yy_find_action: - yy_act = yy_accept[yy_current_state]; - if ( yy_act == 0 ) - { /* have to back up */ - yy_cp = (yy_last_accepting_cpos); - yy_current_state = (yy_last_accepting_state); - yy_act = yy_accept[yy_current_state]; - } - - YY_DO_BEFORE_ACTION; - - if ( yy_act != YY_END_OF_BUFFER && yy_rule_can_match_eol[yy_act] ) - { - int yyl; - for ( yyl = 0; yyl < yyleng; ++yyl ) - if ( yytext[yyl] == '\n' ) - - yylineno++; -; - } - -do_action: /* This label is used only to access EOF actions. */ - - switch ( yy_act ) - { /* beginning of action switch */ - case 0: /* must back up */ - /* undo the effects of YY_DO_BEFORE_ACTION */ - *yy_cp = (yy_hold_char); - yy_cp = (yy_last_accepting_cpos); - yy_current_state = (yy_last_accepting_state); - goto yy_find_action; - -case 1: -YY_RULE_SETUP -#line 59 "parser.l" -{BEGIN QUERY_INITIAL; return '@';} - YY_BREAK -case 2: -YY_RULE_SETUP -#line 60 "parser.l" -{ BEGIN COMMENT; lxq_parser_last_state = XML_INITIAL;} - YY_BREAK -case 3: -YY_RULE_SETUP -#line 61 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; BEGIN CDATA; } - YY_BREAK -case 4: -/* rule 4 can match eol */ -YY_RULE_SETUP -#line 62 "parser.l" -{BEGIN XML_INITIAL;} - YY_BREAK -case 5: -YY_RULE_SETUP -#line 63 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; BEGIN XML_INITIAL; return TEXT; } - YY_BREAK -case 6: -YY_RULE_SETUP -#line 64 "parser.l" -{ BEGIN IN_STATE; return START_EL; } - YY_BREAK -case 7: -YY_RULE_SETUP -#line 66 "parser.l" -{ BEGIN COMMENT; lxq_parser_last_state = XML_INITIAL; } - YY_BREAK -case 8: -YY_RULE_SETUP -#line 67 "parser.l" -{ BEGIN CDATA; lxq_cdata_buffer = new_byte_buffer(16); } - YY_BREAK -case 9: -/* rule 9 can match eol */ -YY_RULE_SETUP -#line 68 "parser.l" -; - YY_BREAK -case 10: -YY_RULE_SETUP -#line 69 "parser.l" -; - YY_BREAK -case 11: -YY_RULE_SETUP -#line 70 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return TEXT; } - YY_BREAK -case 12: -YY_RULE_SETUP -#line 71 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return TEXT; } - YY_BREAK -case 13: -YY_RULE_SETUP -#line 72 "parser.l" -{ BEGIN IN_STATE; return START_EL; } - YY_BREAK -case 14: -YY_RULE_SETUP -#line 74 "parser.l" -{ BEGIN COMMENT; lxq_parser_last_state = IN_STATE;} - YY_BREAK -case 15: -YY_RULE_SETUP -#line 75 "parser.l" -{ BEGIN XML_INITIAL; return END_EL; } - YY_BREAK -case 16: -YY_RULE_SETUP -#line 76 "parser.l" -{ return '?'; } - YY_BREAK -case 17: -YY_RULE_SETUP -#line 77 "parser.l" -{ return '!'; } - YY_BREAK -case 18: -YY_RULE_SETUP -#line 78 "parser.l" -{ return SLASH; } - YY_BREAK -case 19: -YY_RULE_SETUP -#line 79 "parser.l" -{ return '='; } - YY_BREAK -case 20: -YY_RULE_SETUP -#line 80 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return WORD; } - YY_BREAK -case 21: -YY_RULE_SETUP -#line 81 "parser.l" -{ return ':'; } - YY_BREAK -case 22: -YY_RULE_SETUP -#line 82 "parser.l" -{ BEGIN TEXT_BLOCK_DQ_XML; return '"'; } - YY_BREAK -case 23: -YY_RULE_SETUP -#line 83 "parser.l" -{ BEGIN TEXT_BLOCK_SQ_XML; return '\''; } - YY_BREAK -case 24: -/* rule 24 can match eol */ -YY_RULE_SETUP -#line 84 "parser.l" -; - YY_BREAK -case 25: -/* rule 25 can match eol */ -YY_RULE_SETUP -#line 86 "parser.l" -{ yylval.string = strdup(yytext); return TEXT; } - YY_BREAK -case 26: -YY_RULE_SETUP -#line 87 "parser.l" -{ BEGIN IN_STATE; return '\''; } - YY_BREAK -case 27: -/* rule 27 can match eol */ -YY_RULE_SETUP -#line 89 "parser.l" -{ yylval.string = strdup(yytext); return TEXT; } - YY_BREAK -case 28: -YY_RULE_SETUP -#line 90 "parser.l" -{ BEGIN IN_STATE; return '"'; } - YY_BREAK -case 29: -/* rule 29 can match eol */ -YY_RULE_SETUP -#line 92 "parser.l" -{ append_string_to_buffer(yytext, lxq_cdata_buffer); } - YY_BREAK -case 30: -YY_RULE_SETUP -#line 93 "parser.l" -{ append_bytes_to_buffer("\0", lxq_cdata_buffer, 1); - yylval.string = lxq_cdata_buffer->buffer; - lxq_cdata_buffer->buffer = NULL; - destroy_byte_buffer(lxq_cdata_buffer); - lxq_cdata_buffer = NULL; - BEGIN XML_INITIAL; - return CDATA_TOK; - - } - YY_BREAK -case 31: -/* rule 31 can match eol */ -YY_RULE_SETUP -#line 103 "parser.l" -{;} - YY_BREAK -case 32: -YY_RULE_SETUP -#line 104 "parser.l" -{ BEGIN lxq_parser_last_state; } - YY_BREAK -case 33: -YY_RULE_SETUP -#line 106 "parser.l" -{ return ALL; } - YY_BREAK -case 34: -/* rule 34 can match eol */ -YY_RULE_SETUP -#line 107 "parser.l" -; - YY_BREAK -case 35: -YY_RULE_SETUP -#line 108 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return WORD; } - YY_BREAK -case 36: -YY_RULE_SETUP -#line 109 "parser.l" -{ yylval.string = strdup(yytext); char* aux = strdup(trimwhitespace(yylval.string)); - free(yylval.string); yylval.string = aux; return CUSTOM_RELATION_OPERATOR; } - YY_BREAK -case 37: -YY_RULE_SETUP -#line 111 "parser.l" -{ return '['; } - YY_BREAK -case 38: -YY_RULE_SETUP -#line 112 "parser.l" -{ return ']'; } - YY_BREAK -case 39: -YY_RULE_SETUP -#line 113 "parser.l" -{ return SPACE; } - YY_BREAK -case 40: -YY_RULE_SETUP -#line 114 "parser.l" -{ BEGIN TEXT_BLOCK_DQ_QUERY; return '"'; } - YY_BREAK -case 41: -YY_RULE_SETUP -#line 115 "parser.l" -{ BEGIN TEXT_BLOCK_SQ_QUERY; return '\''; } - YY_BREAK -case 42: -YY_RULE_SETUP -#line 116 "parser.l" -{ BEGIN REGEX_BLOCK; return '/'; } - YY_BREAK -case 43: -YY_RULE_SETUP -#line 117 "parser.l" -{ BEGIN FUNC; return ':'; } - YY_BREAK -case 44: -YY_RULE_SETUP -#line 118 "parser.l" -{ return ','; } - YY_BREAK -case 45: -YY_RULE_SETUP -#line 119 "parser.l" -{ return '>'; } - YY_BREAK -case 46: -YY_RULE_SETUP -#line 120 "parser.l" -{ return '+'; } - YY_BREAK -case 47: -YY_RULE_SETUP -#line 121 "parser.l" -{ return '~'; } - YY_BREAK -case 48: -YY_RULE_SETUP -#line 122 "parser.l" -{ BEGIN PARAMS; return '('; } - YY_BREAK -case 49: -YY_RULE_SETUP -#line 123 "parser.l" -{ return ')'; } - YY_BREAK -case 50: -YY_RULE_SETUP -#line 124 "parser.l" -{ return '.'; } - YY_BREAK -case 51: -YY_RULE_SETUP -#line 125 "parser.l" -{ return '#'; } - YY_BREAK -case 52: -YY_RULE_SETUP -#line 126 "parser.l" -{ return EQUAL_OP; } - YY_BREAK -case 53: -YY_RULE_SETUP -#line 127 "parser.l" -{ return WSSV_OP; } - YY_BREAK -case 54: -YY_RULE_SETUP -#line 128 "parser.l" -{ return STARTSW_OP; } - YY_BREAK -case 55: -YY_RULE_SETUP -#line 129 "parser.l" -{ return ENDSW_OP; } - YY_BREAK -case 56: -YY_RULE_SETUP -#line 130 "parser.l" -{ return CONTAINS_OP; } - YY_BREAK -case 57: -YY_RULE_SETUP -#line 131 "parser.l" -{ return DSV_OP; } - YY_BREAK -case 58: -YY_RULE_SETUP -#line 132 "parser.l" -{ return NOTEQUAL_OP; } - YY_BREAK -case 59: -YY_RULE_SETUP -#line 133 "parser.l" -{ return yytext[0];} - YY_BREAK -case 60: -YY_RULE_SETUP -#line 135 "parser.l" -{ BEGIN QUERY_INITIAL; return NTH_CHILD_FILTER; } - YY_BREAK -case 61: -YY_RULE_SETUP -#line 136 "parser.l" -{ BEGIN QUERY_INITIAL; return NTH_LAST_CHILD_FILTER; } - YY_BREAK -case 62: -YY_RULE_SETUP -#line 137 "parser.l" -{ BEGIN QUERY_INITIAL; return FIRST_CHILD_FILTER; } - YY_BREAK -case 63: -YY_RULE_SETUP -#line 138 "parser.l" -{ BEGIN QUERY_INITIAL; return LAST_CHILD_FILTER; } - YY_BREAK -case 64: -YY_RULE_SETUP -#line 139 "parser.l" -{ BEGIN QUERY_INITIAL; return ONLY_CHILD_FILTER; } - YY_BREAK -case 65: -YY_RULE_SETUP -#line 140 "parser.l" -{ BEGIN QUERY_INITIAL; return EMPTY_FILTER; } - YY_BREAK -case 66: -YY_RULE_SETUP -#line 141 "parser.l" -{ BEGIN NOT_STATE; return NOT_FILTER; } - YY_BREAK -case 67: -YY_RULE_SETUP -#line 142 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; BEGIN QUERY_INITIAL; return CUSTOM_FILTER; } - YY_BREAK -case 68: -YY_RULE_SETUP -#line 146 "parser.l" -{ BEGIN QUERY_INITIAL; return '('; } - YY_BREAK -case 69: -YY_RULE_SETUP -#line 148 "parser.l" -{ yylval.digits = atoi(yytext); return DIGITS; } - YY_BREAK -case 70: -YY_RULE_SETUP -#line 149 "parser.l" -{ return 'n'; } - YY_BREAK -case 71: -/* rule 71 can match eol */ -YY_RULE_SETUP -#line 150 "parser.l" -; - YY_BREAK -case 72: -YY_RULE_SETUP -#line 151 "parser.l" -{ return '+'; } - YY_BREAK -case 73: -YY_RULE_SETUP -#line 152 "parser.l" -{ return '-'; } - YY_BREAK -case 74: -YY_RULE_SETUP -#line 153 "parser.l" -{ return EVEN; } - YY_BREAK -case 75: -YY_RULE_SETUP -#line 154 "parser.l" -{ return ODD; } - YY_BREAK -case 76: -YY_RULE_SETUP -#line 155 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return WORD; } - YY_BREAK -case 77: -YY_RULE_SETUP -#line 156 "parser.l" -{ BEGIN QUERY_INITIAL; return ')'; } - YY_BREAK -case 78: -/* rule 78 can match eol */ -YY_RULE_SETUP -#line 158 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return REGEX; } - YY_BREAK -case 79: -/* rule 79 can match eol */ -YY_RULE_SETUP -#line 159 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return REGEX; } - YY_BREAK -case 80: -YY_RULE_SETUP -#line 160 "parser.l" -{ BEGIN QUERY_INITIAL; return END_REGEXI; } - YY_BREAK -case 81: -YY_RULE_SETUP -#line 161 "parser.l" -{ BEGIN QUERY_INITIAL; return '/'; } - YY_BREAK -case 82: -YY_RULE_SETUP -#line 162 "parser.l" -{ yylval.string = strdup("/"); return REGEX; } - YY_BREAK -case 83: -/* rule 83 can match eol */ -YY_RULE_SETUP -#line 164 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return TEXT; } - YY_BREAK -case 84: -YY_RULE_SETUP -#line 165 "parser.l" -{ BEGIN QUERY_INITIAL; return '\''; } - YY_BREAK -case 85: -/* rule 85 can match eol */ -YY_RULE_SETUP -#line 167 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return TEXT; } - YY_BREAK -case 86: -YY_RULE_SETUP -#line 168 "parser.l" -{ BEGIN QUERY_INITIAL; return '"'; } - YY_BREAK -case 87: -YY_RULE_SETUP -#line 170 "parser.l" -{ yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return TEXT; } - YY_BREAK -case 88: -YY_RULE_SETUP -#line 171 "parser.l" -ECHO; - YY_BREAK -#line 1532 "lex.yy.c" -case YY_STATE_EOF(INITIAL): -case YY_STATE_EOF(IN_STATE): -case YY_STATE_EOF(TEXT_BLOCK_SQ_XML): -case YY_STATE_EOF(TEXT_BLOCK_DQ_XML): -case YY_STATE_EOF(CDATA): -case YY_STATE_EOF(COMMENT): -case YY_STATE_EOF(FUNC): -case YY_STATE_EOF(PARAMS): -case YY_STATE_EOF(NOT_STATE): -case YY_STATE_EOF(XML_INITIAL): -case YY_STATE_EOF(QUERY_INITIAL): -case YY_STATE_EOF(TEXT_BLOCK_DQ_QUERY): -case YY_STATE_EOF(TEXT_BLOCK_SQ_QUERY): -case YY_STATE_EOF(REGEX_BLOCK): -case YY_STATE_EOF(ESCAPE): - yyterminate(); - - case YY_END_OF_BUFFER: - { - /* Amount of text matched not including the EOB char. */ - int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; - - /* Undo the effects of YY_DO_BEFORE_ACTION. */ - *yy_cp = (yy_hold_char); - YY_RESTORE_YY_MORE_OFFSET - - if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) - { - /* We're scanning a new file or input source. It's - * possible that this happened because the user - * just pointed yyin at a new source and called - * yylex(). If so, then we have to assure - * consistency between YY_CURRENT_BUFFER and our - * globals. Here is the right place to do so, because - * this is the first action (other than possibly a - * back-up) that will match for the new input source. - */ - (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; - YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; - YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; - } - - /* Note that here we test for yy_c_buf_p "<=" to the position - * of the first EOB in the buffer, since yy_c_buf_p will - * already have been incremented past the NUL character - * (since all states make transitions on EOB to the - * end-of-buffer state). Contrast this with the test - * in input(). - */ - if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) - { /* This was really a NUL. */ - yy_state_type yy_next_state; - - (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; - - yy_current_state = yy_get_previous_state( ); - - /* Okay, we're now positioned to make the NUL - * transition. We couldn't have - * yy_get_previous_state() go ahead and do it - * for us because it doesn't know how to deal - * with the possibility of jamming (and we don't - * want to build jamming into it because then it - * will run more slowly). - */ - - yy_next_state = yy_try_NUL_trans( yy_current_state ); - - yy_bp = (yytext_ptr) + YY_MORE_ADJ; - - if ( yy_next_state ) - { - /* Consume the NUL. */ - yy_cp = ++(yy_c_buf_p); - yy_current_state = yy_next_state; - goto yy_match; - } - - else - { - yy_cp = (yy_c_buf_p); - goto yy_find_action; - } - } - - else switch ( yy_get_next_buffer( ) ) - { - case EOB_ACT_END_OF_FILE: - { - (yy_did_buffer_switch_on_eof) = 0; - - if ( yywrap( ) ) - { - /* Note: because we've taken care in - * yy_get_next_buffer() to have set up - * yytext, we can now set up - * yy_c_buf_p so that if some total - * hoser (like flex itself) wants to - * call the scanner after we return the - * YY_NULL, it'll still work - another - * YY_NULL will get returned. - */ - (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ; - - yy_act = YY_STATE_EOF(YY_START); - goto do_action; - } - - else - { - if ( ! (yy_did_buffer_switch_on_eof) ) - YY_NEW_FILE; - } - break; - } - - case EOB_ACT_CONTINUE_SCAN: - (yy_c_buf_p) = - (yytext_ptr) + yy_amount_of_matched_text; - - yy_current_state = yy_get_previous_state( ); - - yy_cp = (yy_c_buf_p); - yy_bp = (yytext_ptr) + YY_MORE_ADJ; - goto yy_match; - - case EOB_ACT_LAST_MATCH: - (yy_c_buf_p) = - &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)]; - - yy_current_state = yy_get_previous_state( ); - - yy_cp = (yy_c_buf_p); - yy_bp = (yytext_ptr) + YY_MORE_ADJ; - goto yy_find_action; - } - break; - } - - default: - YY_FATAL_ERROR( - "fatal flex scanner internal error--no action found" ); - } /* end of action switch */ - } /* end of scanning one token */ -} /* end of yylex */ - -/* yy_get_next_buffer - try to read in a new buffer - * - * Returns a code representing an action: - * EOB_ACT_LAST_MATCH - - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position - * EOB_ACT_END_OF_FILE - end of file - */ -static int yy_get_next_buffer (void) -{ - register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; - register char *source = (yytext_ptr); - register int number_to_move, i; - int ret_val; - - if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] ) - YY_FATAL_ERROR( - "fatal flex scanner internal error--end of buffer missed" ); - - if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) - { /* Don't try to fill the buffer, so this is an EOF. */ - if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 ) - { - /* We matched a single character, the EOB, so - * treat this as a final EOF. - */ - return EOB_ACT_END_OF_FILE; - } - - else - { - /* We matched some text prior to the EOB, first - * process it. - */ - return EOB_ACT_LAST_MATCH; - } - } - - /* Try to read more data. */ - - /* First move last chars to start of buffer. */ - number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1; - - for ( i = 0; i < number_to_move; ++i ) - *(dest++) = *(source++); - - if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) - /* don't do the read, it's not guaranteed to return an EOF, - * just force an EOF - */ - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0; - - else - { - int num_to_read = - YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; - - while ( num_to_read <= 0 ) - { /* Not enough room in the buffer - grow it. */ - - /* just a shorter name for the current buffer */ - YY_BUFFER_STATE b = YY_CURRENT_BUFFER; - - int yy_c_buf_p_offset = - (int) ((yy_c_buf_p) - b->yy_ch_buf); - - if ( b->yy_is_our_buffer ) - { - int new_size = b->yy_buf_size * 2; - - if ( new_size <= 0 ) - b->yy_buf_size += b->yy_buf_size / 8; - else - b->yy_buf_size *= 2; - - b->yy_ch_buf = (char *) - /* Include room in for 2 EOB chars. */ - yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ); - } - else - /* Can't grow it, we don't own it. */ - b->yy_ch_buf = 0; - - if ( ! b->yy_ch_buf ) - YY_FATAL_ERROR( - "fatal error - scanner input buffer overflow" ); - - (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; - - num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - - number_to_move - 1; - - } - - if ( num_to_read > YY_READ_BUF_SIZE ) - num_to_read = YY_READ_BUF_SIZE; - - /* Read in more data. */ - YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), - (yy_n_chars), (size_t) num_to_read ); - - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); - } - - if ( (yy_n_chars) == 0 ) - { - if ( number_to_move == YY_MORE_ADJ ) - { - ret_val = EOB_ACT_END_OF_FILE; - yyrestart(yyin ); - } - - else - { - ret_val = EOB_ACT_LAST_MATCH; - YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = - YY_BUFFER_EOF_PENDING; - } - } - - else - ret_val = EOB_ACT_CONTINUE_SCAN; - - if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { - /* Extend the array by 50%, plus the number we really need. */ - yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); - YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ); - if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) - YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); - } - - (yy_n_chars) += number_to_move; - YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; - YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; - - (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; - - return ret_val; -} - -/* yy_get_previous_state - get the state just before the EOB char was reached */ - - static yy_state_type yy_get_previous_state (void) -{ - register yy_state_type yy_current_state; - register char *yy_cp; - - yy_current_state = (yy_start); - - for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) - { - register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); - if ( yy_accept[yy_current_state] ) - { - (yy_last_accepting_state) = yy_current_state; - (yy_last_accepting_cpos) = yy_cp; - } - while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) - { - yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 251 ) - yy_c = yy_meta[(unsigned int) yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; - } - - return yy_current_state; -} - -/* yy_try_NUL_trans - try to make a transition on the NUL character - * - * synopsis - * next_state = yy_try_NUL_trans( current_state ); - */ - static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) -{ - register int yy_is_jam; - register char *yy_cp = (yy_c_buf_p); - - register YY_CHAR yy_c = 1; - if ( yy_accept[yy_current_state] ) - { - (yy_last_accepting_state) = yy_current_state; - (yy_last_accepting_cpos) = yy_cp; - } - while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) - { - yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 251 ) - yy_c = yy_meta[(unsigned int) yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; - yy_is_jam = (yy_current_state == 250); - - return yy_is_jam ? 0 : yy_current_state; -} - - static void yyunput (int c, register char * yy_bp ) -{ - register char *yy_cp; - - yy_cp = (yy_c_buf_p); - - /* undo effects of setting up yytext */ - *yy_cp = (yy_hold_char); - - if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) - { /* need to shift things up to make room */ - /* +2 for EOB chars. */ - register int number_to_move = (yy_n_chars) + 2; - register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[ - YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; - register char *source = - &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]; - - while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) - *--dest = *--source; - - yy_cp += (int) (dest - source); - yy_bp += (int) (dest - source); - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = - (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size; - - if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) - YY_FATAL_ERROR( "flex scanner push-back overflow" ); - } - - *--yy_cp = (char) c; - - if ( c == '\n' ){ - --yylineno; - } - - (yytext_ptr) = yy_bp; - (yy_hold_char) = *yy_cp; - (yy_c_buf_p) = yy_cp; -} - -#ifndef YY_NO_INPUT -#ifdef __cplusplus - static int yyinput (void) -#else - static int input (void) -#endif - -{ - int c; - - *(yy_c_buf_p) = (yy_hold_char); - - if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR ) - { - /* yy_c_buf_p now points to the character we want to return. - * If this occurs *before* the EOB characters, then it's a - * valid NUL; if not, then we've hit the end of the buffer. - */ - if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) - /* This was really a NUL. */ - *(yy_c_buf_p) = '\0'; - - else - { /* need more input */ - int offset = (yy_c_buf_p) - (yytext_ptr); - ++(yy_c_buf_p); - - switch ( yy_get_next_buffer( ) ) - { - case EOB_ACT_LAST_MATCH: - /* This happens because yy_g_n_b() - * sees that we've accumulated a - * token and flags that we need to - * try matching the token before - * proceeding. But for input(), - * there's no matching to consider. - * So convert the EOB_ACT_LAST_MATCH - * to EOB_ACT_END_OF_FILE. - */ - - /* Reset buffer status. */ - yyrestart(yyin ); - - /*FALLTHROUGH*/ - - case EOB_ACT_END_OF_FILE: - { - if ( yywrap( ) ) - return EOF; - - if ( ! (yy_did_buffer_switch_on_eof) ) - YY_NEW_FILE; -#ifdef __cplusplus - return yyinput(); -#else - return input(); -#endif - } - - case EOB_ACT_CONTINUE_SCAN: - (yy_c_buf_p) = (yytext_ptr) + offset; - break; - } - } - } - - c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ - *(yy_c_buf_p) = '\0'; /* preserve yytext */ - (yy_hold_char) = *++(yy_c_buf_p); - - if ( c == '\n' ) - - yylineno++; -; - - return c; -} -#endif /* ifndef YY_NO_INPUT */ - -/** Immediately switch to a different input stream. - * @param input_file A readable stream. - * - * @note This function does not reset the start condition to @c INITIAL . - */ - void yyrestart (FILE * input_file ) -{ - - if ( ! YY_CURRENT_BUFFER ){ - yyensure_buffer_stack (); - YY_CURRENT_BUFFER_LVALUE = - yy_create_buffer(yyin,YY_BUF_SIZE ); - } - - yy_init_buffer(YY_CURRENT_BUFFER,input_file ); - yy_load_buffer_state( ); -} - -/** Switch to a different input buffer. - * @param new_buffer The new input buffer. - * - */ - void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ) -{ - - /* TODO. We should be able to replace this entire function body - * with - * yypop_buffer_state(); - * yypush_buffer_state(new_buffer); - */ - yyensure_buffer_stack (); - if ( YY_CURRENT_BUFFER == new_buffer ) - return; - - if ( YY_CURRENT_BUFFER ) - { - /* Flush out information for old buffer. */ - *(yy_c_buf_p) = (yy_hold_char); - YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); - } - - YY_CURRENT_BUFFER_LVALUE = new_buffer; - yy_load_buffer_state( ); - - /* We don't actually know whether we did this switch during - * EOF (yywrap()) processing, but the only time this flag - * is looked at is after yywrap() is called, so it's safe - * to go ahead and always set it. - */ - (yy_did_buffer_switch_on_eof) = 1; -} - -static void yy_load_buffer_state (void) -{ - (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; - (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; - yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; - (yy_hold_char) = *(yy_c_buf_p); -} - -/** Allocate and initialize an input buffer state. - * @param file A readable stream. - * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. - * - * @return the allocated buffer state. - */ - YY_BUFFER_STATE yy_create_buffer (FILE * file, int size ) -{ - YY_BUFFER_STATE b; - - b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); - if ( ! b ) - YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); - - b->yy_buf_size = size; - - /* yy_ch_buf has to be 2 characters longer than the size given because - * we need to put in 2 end-of-buffer characters. - */ - b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 ); - if ( ! b->yy_ch_buf ) - YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); - - b->yy_is_our_buffer = 1; - - yy_init_buffer(b,file ); - - return b; -} - -/** Destroy the buffer. - * @param b a buffer created with yy_create_buffer() - * - */ - void yy_delete_buffer (YY_BUFFER_STATE b ) -{ - - if ( ! b ) - return; - - if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ - YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; - - if ( b->yy_is_our_buffer ) - yyfree((void *) b->yy_ch_buf ); - - yyfree((void *) b ); -} - -#ifndef __cplusplus -extern int isatty (int ); -#endif /* __cplusplus */ - -/* Initializes or reinitializes a buffer. - * This function is sometimes called more than once on the same buffer, - * such as during a yyrestart() or at EOF. - */ - static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file ) - -{ - int oerrno = errno; - - yy_flush_buffer(b ); - - b->yy_input_file = file; - b->yy_fill_buffer = 1; - - /* If b is the current buffer, then yy_init_buffer was _probably_ - * called from yyrestart() or through yy_get_next_buffer. - * In that case, we don't want to reset the lineno or column. - */ - if (b != YY_CURRENT_BUFFER){ - b->yy_bs_lineno = 1; - b->yy_bs_column = 0; - } - - b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; - - errno = oerrno; -} - -/** Discard all buffered characters. On the next scan, YY_INPUT will be called. - * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. - * - */ - void yy_flush_buffer (YY_BUFFER_STATE b ) -{ - if ( ! b ) - return; - - b->yy_n_chars = 0; - - /* We always need two end-of-buffer characters. The first causes - * a transition to the end-of-buffer state. The second causes - * a jam in that state. - */ - b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; - b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; - - b->yy_buf_pos = &b->yy_ch_buf[0]; - - b->yy_at_bol = 1; - b->yy_buffer_status = YY_BUFFER_NEW; - - if ( b == YY_CURRENT_BUFFER ) - yy_load_buffer_state( ); -} - -/** Pushes the new state onto the stack. The new state becomes - * the current state. This function will allocate the stack - * if necessary. - * @param new_buffer The new state. - * - */ -void yypush_buffer_state (YY_BUFFER_STATE new_buffer ) -{ - if (new_buffer == NULL) - return; - - yyensure_buffer_stack(); - - /* This block is copied from yy_switch_to_buffer. */ - if ( YY_CURRENT_BUFFER ) - { - /* Flush out information for old buffer. */ - *(yy_c_buf_p) = (yy_hold_char); - YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); - } - - /* Only push if top exists. Otherwise, replace top. */ - if (YY_CURRENT_BUFFER) - (yy_buffer_stack_top)++; - YY_CURRENT_BUFFER_LVALUE = new_buffer; - - /* copied from yy_switch_to_buffer. */ - yy_load_buffer_state( ); - (yy_did_buffer_switch_on_eof) = 1; -} - -/** Removes and deletes the top of the stack, if present. - * The next element becomes the new top. - * - */ -void yypop_buffer_state (void) -{ - if (!YY_CURRENT_BUFFER) - return; - - yy_delete_buffer(YY_CURRENT_BUFFER ); - YY_CURRENT_BUFFER_LVALUE = NULL; - if ((yy_buffer_stack_top) > 0) - --(yy_buffer_stack_top); - - if (YY_CURRENT_BUFFER) { - yy_load_buffer_state( ); - (yy_did_buffer_switch_on_eof) = 1; - } -} - -/* Allocates the stack if it does not exist. - * Guarantees space for at least one push. - */ -static void yyensure_buffer_stack (void) -{ - int num_to_alloc; - - if (!(yy_buffer_stack)) { - - /* First allocation is just for 2 elements, since we don't know if this - * scanner will even need a stack. We use 2 instead of 1 to avoid an - * immediate realloc on the next call. - */ - num_to_alloc = 1; - (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc - (num_to_alloc * sizeof(struct yy_buffer_state*) - ); - if ( ! (yy_buffer_stack) ) - YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); - - memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); - - (yy_buffer_stack_max) = num_to_alloc; - (yy_buffer_stack_top) = 0; - return; - } - - if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ - - /* Increase the buffer to prepare for a possible push. */ - int grow_size = 8 /* arbitrary grow size */; - - num_to_alloc = (yy_buffer_stack_max) + grow_size; - (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc - ((yy_buffer_stack), - num_to_alloc * sizeof(struct yy_buffer_state*) - ); - if ( ! (yy_buffer_stack) ) - YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); - - /* zero only the new slots.*/ - memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); - (yy_buffer_stack_max) = num_to_alloc; - } -} - -/** Setup the input buffer state to scan directly from a user-specified character buffer. - * @param base the character buffer - * @param size the size in bytes of the character buffer - * - * @return the newly allocated buffer state object. - */ -YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size ) -{ - YY_BUFFER_STATE b; - - if ( size < 2 || - base[size-2] != YY_END_OF_BUFFER_CHAR || - base[size-1] != YY_END_OF_BUFFER_CHAR ) - /* They forgot to leave room for the EOB's. */ - return 0; - - b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); - if ( ! b ) - YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); - - b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ - b->yy_buf_pos = b->yy_ch_buf = base; - b->yy_is_our_buffer = 0; - b->yy_input_file = 0; - b->yy_n_chars = b->yy_buf_size; - b->yy_is_interactive = 0; - b->yy_at_bol = 1; - b->yy_fill_buffer = 0; - b->yy_buffer_status = YY_BUFFER_NEW; - - yy_switch_to_buffer(b ); - - return b; -} - -/** Setup the input buffer state to scan a string. The next call to yylex() will - * scan from a @e copy of @a str. - * @param yystr a NUL-terminated string to scan - * - * @return the newly allocated buffer state object. - * @note If you want to scan bytes that may contain NUL values, then use - * yy_scan_bytes() instead. - */ -YY_BUFFER_STATE yy_scan_string (yyconst char * yystr ) -{ - - return yy_scan_bytes(yystr,strlen(yystr) ); -} - -/** Setup the input buffer state to scan the given bytes. The next call to yylex() will - * scan from a @e copy of @a bytes. - * @param yybytes the byte buffer to scan - * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes. - * - * @return the newly allocated buffer state object. - */ -YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, int _yybytes_len ) -{ - YY_BUFFER_STATE b; - char *buf; - yy_size_t n; - int i; - - /* Get memory for full buffer, including space for trailing EOB's. */ - n = _yybytes_len + 2; - buf = (char *) yyalloc(n ); - if ( ! buf ) - YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); - - for ( i = 0; i < _yybytes_len; ++i ) - buf[i] = yybytes[i]; - - buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; - - b = yy_scan_buffer(buf,n ); - if ( ! b ) - YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); - - /* It's okay to grow etc. this buffer, and we should throw it - * away when we're done. - */ - b->yy_is_our_buffer = 1; - - return b; -} - -#ifndef YY_EXIT_FAILURE -#define YY_EXIT_FAILURE 2 -#endif - -static void yy_fatal_error (yyconst char* msg ) -{ - (void) fprintf( stderr, "%s\n", msg ); - exit( YY_EXIT_FAILURE ); -} - -/* Redefine yyless() so it works in section 3 code. */ - -#undef yyless -#define yyless(n) \ - do \ - { \ - /* Undo effects of setting up yytext. */ \ - int yyless_macro_arg = (n); \ - YY_LESS_LINENO(yyless_macro_arg);\ - yytext[yyleng] = (yy_hold_char); \ - (yy_c_buf_p) = yytext + yyless_macro_arg; \ - (yy_hold_char) = *(yy_c_buf_p); \ - *(yy_c_buf_p) = '\0'; \ - yyleng = yyless_macro_arg; \ - } \ - while ( 0 ) - -/* Accessor methods (get/set functions) to struct members. */ - -/** Get the current line number. - * - */ -int yyget_lineno (void) -{ - - return yylineno; -} - -/** Get the input stream. - * - */ -FILE *yyget_in (void) -{ - return yyin; -} - -/** Get the output stream. - * - */ -FILE *yyget_out (void) -{ - return yyout; -} - -/** Get the length of the current token. - * - */ -int yyget_leng (void) -{ - return yyleng; -} - -/** Get the current token. - * - */ - -char *yyget_text (void) -{ - return yytext; -} - -/** Set the current line number. - * @param line_number - * - */ -void yyset_lineno (int line_number ) -{ - - yylineno = line_number; -} - -/** Set the input stream. This does not discard the current - * input buffer. - * @param in_str A readable stream. - * - * @see yy_switch_to_buffer - */ -void yyset_in (FILE * in_str ) -{ - yyin = in_str ; -} - -void yyset_out (FILE * out_str ) -{ - yyout = out_str ; -} - -int yyget_debug (void) -{ - return yy_flex_debug; -} - -void yyset_debug (int bdebug ) -{ - yy_flex_debug = bdebug ; -} - -static int yy_init_globals (void) -{ - /* Initialization is the same as for the non-reentrant scanner. - * This function is called from yylex_destroy(), so don't allocate here. - */ - - /* We do not touch yylineno unless the option is enabled. */ - yylineno = 1; - - (yy_buffer_stack) = 0; - (yy_buffer_stack_top) = 0; - (yy_buffer_stack_max) = 0; - (yy_c_buf_p) = (char *) 0; - (yy_init) = 0; - (yy_start) = 0; - -/* Defined in main.c */ -#ifdef YY_STDINIT - yyin = stdin; - yyout = stdout; -#else - yyin = (FILE *) 0; - yyout = (FILE *) 0; -#endif - - /* For future reference: Set errno on error, since we are called by - * yylex_init() - */ - return 0; -} - -/* yylex_destroy is for both reentrant and non-reentrant scanners. */ -int yylex_destroy (void) -{ - - /* Pop the buffer stack, destroying each element. */ - while(YY_CURRENT_BUFFER){ - yy_delete_buffer(YY_CURRENT_BUFFER ); - YY_CURRENT_BUFFER_LVALUE = NULL; - yypop_buffer_state(); - } - - /* Destroy the stack itself. */ - yyfree((yy_buffer_stack) ); - (yy_buffer_stack) = NULL; - - /* Reset the globals. This is important in a non-reentrant scanner so the next time - * yylex() is called, initialization will occur. */ - yy_init_globals( ); - - return 0; -} - -/* - * Internal utility routines. - */ - -#ifndef yytext_ptr -static void yy_flex_strncpy (char* s1, yyconst char * s2, int n ) -{ - register int i; - for ( i = 0; i < n; ++i ) - s1[i] = s2[i]; -} -#endif - -#ifdef YY_NEED_STRLEN -static int yy_flex_strlen (yyconst char * s ) -{ - register int n; - for ( n = 0; s[n]; ++n ) - ; - - return n; -} -#endif - -void *yyalloc (yy_size_t size ) -{ - return (void *) malloc( size ); -} - -void *yyrealloc (void * ptr, yy_size_t size ) -{ - /* The cast to (char *) in the following accommodates both - * implementations that use char* generic pointers, and those - * that use void* generic pointers. It works with the latter - * because both ANSI C and C++ allow castless assignment from - * any pointer type to void*, and deal with argument conversions - * as though doing an assignment. - */ - return (void *) realloc( (char *) ptr, size ); -} - -void yyfree (void * ptr ) -{ - free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ -} - -#define YYTABLES_NAME "yytables" - -#line 171 "parser.l" - - - - diff --git a/parser/lxq_parser.c b/parser/lxq_parser.c deleted file mode 100644 index b0d9e8f..0000000 --- a/parser/lxq_parser.c +++ /dev/null @@ -1,104 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include -#include "../include/y.tab.h" -#include "../include/stack.h" -#include "../include/macros.h" -#include "../include/lxq_parser.h" - -extern doc* lxq_document; -extern list* lxq_selected_elements; -extern stack* trash_bin; -extern void parse_file(char*); -extern void parse_string(const char*); - -doc* parse_xml(char* filename){ - doc* document; - - trash_bin = new_stack(16); - - parse_file(filename); - - while(trash_bin->count > 0){ - free(pop_stack(trash_bin)); - } - destroy_generic_list(trash_bin); - - if(lxq_document == NULL) - return NULL; - - document = alloc(doc, 1); - memcpy(document, lxq_document, sizeof(doc)); - free(lxq_document); - lxq_document = NULL; - return document; -} - -list* parse_query(const char* query){ - list* sles; - - trash_bin = new_stack(16); - - parse_string(query); - - while(trash_bin->count > 0){ - free(pop_stack(trash_bin)); - } - destroy_generic_list(trash_bin); - - if(lxq_selected_elements == NULL) - return NULL; - - sles = alloc(list, 1); - memcpy(sles, lxq_selected_elements, sizeof(list)); - free(lxq_selected_elements); - lxq_selected_elements = NULL; - return sles; -} - -doc* parse_xml_from_string(const char* xmlstring){ - doc* document; - - trash_bin = new_stack(16); - - parse_string(xmlstring); - - while(trash_bin->count > 0){ - free(pop_stack(trash_bin)); - } - destroy_generic_list(trash_bin); - - if(lxq_document == NULL) - return NULL; - - document = alloc(doc, 1); - memcpy(document, lxq_document, sizeof(doc)); - free(lxq_document); - lxq_document = NULL; - return document; -} - diff --git a/parser/parser.html b/parser/parser.html new file mode 100644 index 0000000..2d853d0 --- /dev/null +++ b/parser/parser.html @@ -0,0 +1,199 @@ + + + + + + + + Parser Module — libxmlquery v0.1.4 documentation + + + + + + + + + + + +
        +

        Navigation

        + +
        + +
        +
        +
        +
        + +
        +

        Parser Module

        +

        The parser module is currently done with the flex lib and yacc. This forced us to merge the xml and query parser onto a single lexer file.

        +

        Be aware that the parser is not thread safe and because it uses global variables, xmls and queries have to be parsed one at a time.

        +

        Our implementation is divided into 3 files - parser.l, parser.y and lxq_parser.c. The parser.l file has all the lexer code. The parser.y defines the yacc grammar and a couple of functions explained in the next section. The lxq_parser.c defines two functions which are front ends to the parser and through where all parsing should be done.

        +

        If for some reason your program exits without priting any message, you should recompile libxmlquery with -DDEBUG, which may report extra error messages.

        +
        +

        Function description

        +
        +
        +void parse_file(char* filename)
        +

        filename The name of the file to be parsed

        +

        This function maps the file in memory and parses it. The parsed structure is accessible through lxq_document, which is a global variable declared in parser.y. If you need to parse an xml, we strongly recommend that you use parse_dom() .

        +
        + +
        +
        +void parse_string(const char* str)
        +

        str The string to be parsed.

        +

        This function parses the input string and stores the result in lxq_selected_elements. If you need to parse a query, we stringly recommend that you use parse_query() .

        +
        + +
        +
        +doc* parse_xml(char* filename)
        +

        filename The name of the xml file to be parsed.

        +

        This function parses an xml file, copying the result from parse_file() to another location so you can parse as many xml files as possible. If an error occurs, this function returns NULL.

        +

        The following example shows how to use this function to parse an xml.

        +

        Example:

        +
        #include <stdio.h>
+#include "serialize.h"
+#include "lxq_parser.h"
+
+int main(){
+  doc* document = parse_xml("xml_file.xml");
+  char* parsed = node_to_string(get_doc_root(document), XML);
+
+  printf("%s", parsed);
+  free(parsed);
+
+  if(document != NULL)
+    destroy_dom_tree(document);
+
+  return 0;
+}
+
        +
        +

        You may compile it with

        +
        gcc -o test <above_source_file> -I<folder path where our header files are kept>
+
        +
        +
        + +
        +
        +doc* parse_xml_from_string(char* xmlstring)
        +

        xmlstring The the xml string to be parsed.

        +

        This function parses an xml string, copying the result from parse_string() to another location so you can parse as many xml strings as possible. If an error occurs, this function returns NULL.

        +

        The following example shows how to use this function to parse an xml string.

        +

        Example:

        +
        #include <stdio.h>
+#include "serialize.h"
+#include "lxq_parser.h"
+
+int main(){
+  doc* document = parse_xml_from_string("<root> <someelement with=\"someattribute\" /> </root>");
+  char* parsed = node_to_string(get_doc_root(document), XML);
+
+  printf("%s", parsed);
+  free(parsed);
+
+  if(document != NULL)
+    destroy_dom_tree(document);
+
+  return 0;
+}
+
        +
        +

        You may compile it with

        +
        gcc -o test <above_source_file> -I<folder path where our header files are kept>
+
        +
        +
        + +
        +
        + + +
        +
        +
        +
        +
        +

        Table Of Contents

        + + +

        Previous topic

        +

        Tutorial

        +

        Next topic

        +

        Document Object Model

        +

        This Page

        + + + +
        +
        +
        +
        +
        +

        Navigation

        + +
        +
        + © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
        + + \ No newline at end of file diff --git a/parser/parser.l b/parser/parser.l deleted file mode 100644 index b4987f5..0000000 --- a/parser/parser.l +++ /dev/null @@ -1,172 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -%{ -#include -#include "../include/y.tab.h" -#include "../include/stack.h" -#include "../include/byte_buffer.h" - -stack* trash_bin = NULL; -byte_buffer* lxq_cdata_buffer = NULL; -int lxq_parser_last_state; - -char *trimwhitespace(char *str) -{ - char *end; - - // Trim leading space - while(*str == ' ') str++; - - if(*str == 0) // All spaces? - return str; - - // Trim trailing space - end = str + strlen(str) - 1; - while(end > str && *end == ' ') end--; - - // Write new null terminator - *(end+1) = 0; - - return str; -} -%} -%x IN_STATE TEXT_BLOCK_SQ_XML TEXT_BLOCK_DQ_XML CDATA COMMENT FUNC PARAMS NOT_STATE XML_INITIAL QUERY_INITIAL TEXT_BLOCK_DQ_QUERY TEXT_BLOCK_SQ_QUERY REGEX_BLOCK ESCAPE - -%option yylineno -%% -\@ {BEGIN QUERY_INITIAL; return '@';} -"" { BEGIN lxq_parser_last_state; } - -\* { return ALL; } -[\n\r]+ ; -[_a-zA-Z][-_a-zA-Z0-9]* { yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return WORD; } -[ ]*![_a-zA-Z][-_a-zA-Z0-9]*[ ]* { yylval.string = strdup(yytext); char* aux = strdup(trimwhitespace(yylval.string)); - free(yylval.string); yylval.string = aux; return CUSTOM_RELATION_OPERATOR; } -\[ { return '['; } -\] { return ']'; } -[ ]* { return SPACE; } -\" { BEGIN TEXT_BLOCK_DQ_QUERY; return '"'; } -\' { BEGIN TEXT_BLOCK_SQ_QUERY; return '\''; } -\/ { BEGIN REGEX_BLOCK; return '/'; } -\: { BEGIN FUNC; return ':'; } -[ ]*\,[ ]* { return ','; } -[ ]*\>[ ]* { return '>'; } -[ ]*\+[ ]* { return '+'; } -[ ]*\~[ ]* { return '~'; } -\( { BEGIN PARAMS; return '('; } -\) { return ')'; } -\. { return '.'; } -\# { return '#'; } -[ ]*=[ ]* { return EQUAL_OP; } -[ ]*"~="[ ]* { return WSSV_OP; } -[ ]*"^="[ ]* { return STARTSW_OP; } -[ ]*"$="[ ]* { return ENDSW_OP; } -[ ]*"*="[ ]* { return CONTAINS_OP; } -[ ]*"|="[ ]* { return DSV_OP; } -[ ]*"!="[ ]* { return NOTEQUAL_OP; } -. { return yytext[0];} - -"nth-child" { BEGIN QUERY_INITIAL; return NTH_CHILD_FILTER; } -"nth-last-child" { BEGIN QUERY_INITIAL; return NTH_LAST_CHILD_FILTER; } -"first-child" { BEGIN QUERY_INITIAL; return FIRST_CHILD_FILTER; } -"last-child" { BEGIN QUERY_INITIAL; return LAST_CHILD_FILTER; } -"only-child" { BEGIN QUERY_INITIAL; return ONLY_CHILD_FILTER; } -"empty" { BEGIN QUERY_INITIAL; return EMPTY_FILTER; } -"not" { BEGIN NOT_STATE; return NOT_FILTER; } -[_a-zA-Z][-_a-zA-Z0-9]* { yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; BEGIN QUERY_INITIAL; return CUSTOM_FILTER; } - - - -\( { BEGIN QUERY_INITIAL; return '('; } - -[1-9][0-9]* { yylval.digits = atoi(yytext); return DIGITS; } -"n" { return 'n'; } -[\n\r ]+ ; -\+ { return '+'; } -\- { return '-'; } -"even" { return EVEN; } -"odd" { return ODD; } -[_a-zA-Z][-_a-zA-Z0-9]* { yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return WORD; } -\) { BEGIN QUERY_INITIAL; return ')'; } - -[^/\\]* { yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return REGEX; } -\\[^/] { yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return REGEX; } -"/i" { BEGIN QUERY_INITIAL; return END_REGEXI; } -"/" { BEGIN QUERY_INITIAL; return '/'; } -\\\/ { yylval.string = strdup("/"); return REGEX; } - -[^']* { yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return TEXT; } -\' { BEGIN QUERY_INITIAL; return '\''; } - -[^"]* { yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return TEXT; } -\" { BEGIN QUERY_INITIAL; return '"'; } - -. { yylval.string = strdup(yytext); /*push_stack(trash_bin, yylval.string)*/; return TEXT; } -%% - diff --git a/parser/parser.y b/parser/parser.y deleted file mode 100644 index 61f776a..0000000 --- a/parser/parser.y +++ /dev/null @@ -1,406 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -%{ -#include -#include -#include "../include/node.h" -#include "../include/stack.h" -#include "../include/query_parser.h" -#include "../include/macros.h" - -#define LXQ_RELATION_TYPE 0 -#define LXQ_SELECTOR_TYPE 1 - -extern int yylex(void); -extern int yyparse(void); -extern int yylineno; -extern char* yytext; -extern FILE* yyin; - -doc* lxq_document; - -char* lxq_parser_dot_query_operator = "class"; -char* lxq_parser_pound_query_operator = "id"; -list* lxq_selected_elements; - -void yyerror(const char *str) -{ - fprintf(stderr,"error at:%d: %s at '%s'\n", yylineno, str, yytext); - lxq_document = NULL; - lxq_selected_elements = NULL; -} - -int yywrap() -{ - return 1; -} - -void parse_file(char* filename){ - char* address; - FILE* holder; - struct yy_buffer_state* bs; - - if(!strcmp(filename, "-")){ - holder = yyin = 0; - } - else{ - holder = yyin = fopen(filename, "r"); - if(yyin == NULL){ - log(F, "Unable to open file %s for reading.", filename); - exit(1); - } - } - - yylineno = 1; - yyparse(); - yylex_destroy(); - if(holder) fclose(holder); -} - -void parse_string(const char* str){ - int len = strlen(str); - char* internal_cpy = alloc(char, len + 2); - - memcpy(internal_cpy, str, len); - - internal_cpy[len] = '\0'; - internal_cpy[len + 1] = '\0'; - - if(!yy_scan_buffer(internal_cpy, len + 2)){ - log(F, "Flex could not allocate a new buffer to parse the string."); - exit(1); - } - yylineno = 1; - yyparse(); - yylex_destroy(); - free(internal_cpy); -} - - -%} - -%union{ - char * string; - struct snode* dn; - int digits; - struct attr_selector_s* attrselector; - struct step_s* s; - int token; - struct filter_selector_s* fa; - struct generic_list_s* q; - struct selector_s* sel; - struct match_value_s* mv; - } - -%token START_EL END_EL SLASH SCUSTOM_FILTER -%token WORD TEXT CDATA_TOK REGEX CUSTOM_FILTER CUSTOM_OPERATOR CUSTOM_RELATION_OPERATOR -%token ALL SPACE END_REGEXI NO_OP EQUAL_OP WSSV_OP STARTSW_OP ENDSW_OP CONTAINS_OP REGEX_OP REGEXI_OP DSV_OP NOTEQUAL_OP EVEN ODD -%token NTH_CHILD_FILTER NTH_LAST_CHILD_FILTER FIRST_CHILD_FILTER LAST_CHILD_FILTER ONLY_CHILD_FILTER EMPTY_FILTER NOT_FILTER -%type attr node prop inner attrs declaration start_tag end_tag namespace doctype words_and_values -%token DIGITS - -%type attr_filter attrsel; -%type step parameters; -%type offset; -%type operator pseudo_op nth_pseudo_op relation_operator end_regex; -%type pseudo_filter; -%type value -%type selector_group pseudo_filters attrsels regex_stack words declarations -%type regex id -%type selector - -%start choose - -%% - -choose: '@' selector_group - | document - ; - -document: prop inner { lxq_document = new_document(NULL); - if($2->children == NULL && $1->type == ELEMENT){ - set_doc_root(lxq_document, $1); - } - else{ - set_name($2, "root"); - prepend_child($2, $1); - set_doc_root(lxq_document, $2); - } - } - | declarations node { lxq_document = new_document($1); set_doc_root(lxq_document, $2);} - ; - -namespace: WORD { $$ = new_element_node($1); free($1);} - | WORD ':' WORD { $$ = new_element_node($3); - free($3); - char* old = $$->namespace; - $$->namespace = $1; - free($1); - if(old) - free(old); - } - ; - - -declarations: declaration { $$ = new_generic_list(1); add_element($$, $1); } - | doctype { $$ = new_generic_list(1); add_element($$, $1); } - | declarations declaration { $$ = $1; add_element($$, $2); } - | declarations doctype { $$ = $1; add_element($$, $2); } - -doctype: START_EL '!' WORD words_and_values END_EL { $$ = $4; set_name($$, $3); free($3); } - -declaration: START_EL '?' namespace attrs '?' END_EL { - //if(strcmp(get_name($3), "xml") != 0){ - // yyerror("Declaration does not begin with xml"); - // exit(-1); - //} - $$ = $4; - char* old = set_name($$, get_name($3)); - if(old) - free(old); - old = set_namespace($$, get_namespace($3)); - if(old) - free(old); - destroy_dom_node($3); - } - ; - -node: start_tag inner end_tag { - if(strcmp(get_name($1),get_name($3)) != 0){ - char* error_line = alloc(char, 41 + strlen(get_name($1)) + strlen(get_name($3))); - sprintf(error_line, "Start tag '%s' does not match end tag '%s' ", get_name($1), get_name($3)); - yyerror(error_line); - free(error_line); - exit(1); - } - - $1->children = $2->children; - int i; - if($1->children){ - for(i = 0; i < $1->children->count; i++){ - ((dom_node*)get_element_at($1->children, i))->parent = $1; - } - } - - $2->children = NULL; - destroy_dom_node($2); - - $$ = $1; - destroy_dom_node($3); - } - | START_EL namespace attrs SLASH END_EL { $$ = $3; - char* old = set_name($$, get_name($2)); - if(old) - free(old); - old = set_namespace($$, get_namespace($2)); - if(old) - free(old); - destroy_dom_node($2); - } - ; - -inner: { $$ = new_element_node(NULL);} - | inner prop { $$ = $1; - append_child($$, $2); - } - ; - -prop: CDATA_TOK {$$ = new_cdata($1); free($1);} - | TEXT {$$ = new_text_node($1); free($1);} - | node {$$ = $1;} - ; - - -start_tag: START_EL namespace attrs END_EL { $$ = $3; - char* old = set_name($$, get_name($2)); - if(old) - free(old); - old = set_namespace($$, get_namespace($2)); - if(old) - free(old); - destroy_dom_node($2); - } - ; - -end_tag: START_EL SLASH namespace END_EL { $$ = $3;} - ; - -attrs: { $$ = new_element_node(NULL); } - | attrs attr { - $$ = $1; - add_attribute($$, $2); - } - ; - -attr: namespace '=' value {$$ = new_attribute(get_name($1), $3); - free($3); - char* old = set_namespace($$, get_namespace($1)); - if(old) - free(old); - destroy_dom_node($1); } - | namespace { $$ = new_attribute(get_name($1), NULL); - char* old = set_namespace($$, get_namespace($1)); - if(old) - free(old); - destroy_dom_node($1); - } - ; - -words_and_values: { $$ = new_element_node(NULL); } - | words_and_values WORD { $$ = $1; add_attribute($$, new_attribute($2, NULL)); free($2);} - | words_and_values value { $$ = $1; append_child($$, new_text_node($2)); free($2);} - - -value: '"' TEXT '"' {$$ = $2;} - | '"' '"' {$$ = strdup("");} - | '\'' TEXT '\'' {$$ = $2;} - | '\'' '\'' {$$ = strdup("");} - ; - - -selector_group: selector { lxq_selected_elements = $$ = new_generic_list_with_type(4); enqueue_with_type($$, $1, LXQ_SELECTOR_TYPE); } - | selector_group relation_operator selector { int* a = alloc(int, 1); - *a = $2; - $$ = $1; - enqueue_with_type($$, a, LXQ_RELATION_TYPE); - enqueue_with_type($$, $3, LXQ_SELECTOR_TYPE); - } - | selector_group CUSTOM_RELATION_OPERATOR selector { $$ = $1; - enqueue_with_type($$, strdup($2+1), CUSTOM_RELATION_OPERATOR); - free($2); - enqueue_with_type($$, $3, LXQ_SELECTOR_TYPE); - } - ; - -selector: id attrsels pseudo_filters { $$ = new_selector($1); $$->attrs = $2; $$->filters = $3; } - ; - -attrsels: { $$ = new_stack(4); } - | attrsels '[' attrsel ']' { $$ = $1; push_stack($$, $3); } - | attrsels '.' WORD { $$ = $1; - push_stack($$, new_attr_value_selector( - new_match_value(lxq_parser_dot_query_operator, EQUAL_OP), - make_operators($3, WSSV_OP))); - } - | attrsels '#' WORD { $$ = $1; - push_stack($$, new_attr_value_selector( - new_match_value(lxq_parser_pound_query_operator, EQUAL_OP), - new_match_value_no_strdup($3, EQUAL_OP))); - } - ; - -attrsel: WORD attr_filter { $$ = $2; $$->name = new_match_value_no_strdup($1, EQUAL_OP); } - | regex attr_filter { $$ = $2; $$->name = $1; } - ; - -id: { $$ = NULL; } - | ALL { $$ = NULL; } - | WORD { $$ = new_match_value_no_strdup($1, EQUAL_OP);} - | regex { $$ = $1; } - ; - -pseudo_filters: { $$ = new_stack(4); } - | pseudo_filters ':' pseudo_filter { push_stack($$, $3); } - ; - -pseudo_filter: pseudo_op { $$ = new_filter($1); } - | CUSTOM_FILTER { $$ = new_filter(SCUSTOM_FILTER); $$->name = $1; } - | CUSTOM_FILTER '(' words ')' { $$ = new_filter(CUSTOM_FILTER); $$->name = $1; $$->args = $3; } - | nth_pseudo_op '(' parameters ')' { $$ = new_filter($1); $$->value.s = $3; } - | NOT_FILTER '(' selector_group ')' { $$ = new_filter(NOT_FILTER); $$->value.selector = $3; } - ; - -words: { $$ = new_stack(2); } - | words DIGITS { int* i = alloc(int, 1); *i = $2; push_stack($1, i); $$ = $1;} - | words WORD { push_stack($1, $2); $$ = $1;} - -nth_pseudo_op: NTH_CHILD_FILTER { $$ = NTH_CHILD_FILTER; } - | NTH_LAST_CHILD_FILTER { $$ = NTH_LAST_CHILD_FILTER; } - ; - -pseudo_op: FIRST_CHILD_FILTER { $$ = FIRST_CHILD_FILTER; } - | LAST_CHILD_FILTER { $$ = LAST_CHILD_FILTER; } - | ONLY_CHILD_FILTER { $$ = ONLY_CHILD_FILTER; } - | EMPTY_FILTER { $$ = EMPTY_FILTER; } - ; - -parameters: step { $$ = $1; } - | offset { $$ = alloc(struct step_s, 1); $$->multiplier = 0; $$->offset = $1;} - | EVEN { $$ = alloc(struct step_s, 1); $$->multiplier = 2; $$->offset = 0; } - | ODD { $$ = alloc(struct step_s, 1); $$->multiplier = 2; $$->offset = 1; } - ; - -step: 'n' { $$ = alloc(struct step_s, 1); $$->multiplier = 1; $$->offset = 0; } - | DIGITS 'n' { $$ = alloc(struct step_s, 1); $$->multiplier = $1; $$->offset = 0; } - | 'n' offset { $$ = alloc(struct step_s, 1); $$->multiplier = 1; $$->offset = $2; } - | DIGITS 'n' offset { $$ = alloc(struct step_s, 1); $$->multiplier = $1; $$->offset = $3; } - ; - -offset: '+' DIGITS { $$ = $2; } - | '-' DIGITS { $$ = -$2; } - | DIGITS { $$ = $1; } - ; - -relation_operator: '>' { $$ = '>'; } - | '~' { $$ = '~'; } - | '+' { $$ = '+'; } - | ',' { $$ = ','; } - | SPACE { $$ = SPACE; } - ; - -attr_filter: { $$ = new_attr_value_selector(NULL, NULL); } - | operator '"' TEXT '"' { $$ = new_attr_value_selector(NULL, make_operators($3, $1)); } - | operator '\'' TEXT '\'' { $$ = new_attr_value_selector(NULL, make_operators($3, $1)); } - | EQUAL_OP regex { $$ = new_attr_value_selector(NULL, $2); } - ; - -regex: '/' regex_stack end_regex { char* text = (char*)dequeue($2); - while($2->count > 0){ - char* r = (char*)dequeue($2); - text = (char*)realloc(text, strlen(text) + strlen(r)); - strcat(text, r); - free(r); - } - $$ = new_match_value_no_strdup(text, $3); - destroy_generic_list($2); - } - -regex_stack: REGEX { $$ = new_queue(4); enqueue($$, $1); } - | regex_stack REGEX { $$ = $1; enqueue($$, $2); } - ; - -end_regex: '/' { $$ = REGEX_OP; } - | END_REGEXI { $$ = REGEXI_OP; } - ; - -operator: EQUAL_OP { $$ = EQUAL_OP; } - | WSSV_OP { $$ = WSSV_OP; } - | STARTSW_OP { $$ = STARTSW_OP; } - | ENDSW_OP { $$ = ENDSW_OP; } - | CONTAINS_OP { $$ = CONTAINS_OP; } - | DSV_OP { $$ = DSV_OP; } - | NOTEQUAL_OP { $$ = NOTEQUAL_OP; } - ; - diff --git a/parser/test.xml b/parser/test.xml deleted file mode 100644 index 60f7156..0000000 --- a/parser/test.xml +++ /dev/null @@ -1,20 +0,0 @@ - - - - - - diff --git a/parser/y.tab.c b/parser/y.tab.c deleted file mode 100644 index 33e7c28..0000000 --- a/parser/y.tab.c +++ /dev/null @@ -1,2585 +0,0 @@ - -/* A Bison parser, made by GNU Bison 2.4.1. */ - -/* Skeleton implementation for Bison's Yacc-like parsers in C - - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 - Free Software Foundation, Inc. - - This program is free software: you can redistribute it and/or modify - it under the terms of the GNU 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 General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program. If not, see . */ - -/* As a special exception, you may create a larger work that contains - part or all of the Bison parser skeleton and distribute that work - under terms of your choice, so long as that work isn't itself a - parser generator using the skeleton or a modified version thereof - as a parser skeleton. Alternatively, if you modify or redistribute - the parser skeleton itself, you may (at your option) remove this - special exception, which will cause the skeleton and the resulting - Bison output files to be licensed under the GNU General Public - License without this special exception. - - This special exception was added by the Free Software Foundation in - version 2.2 of Bison. */ - -/* C LALR(1) parser skeleton written by Richard Stallman, by - simplifying the original so-called "semantic" parser. */ - -/* All symbols defined below should begin with yy or YY, to avoid - infringing on user name space. This should be done even for local - variables, as they might otherwise be expanded by user macros. - There are some unavoidable exceptions within include files to - define necessary library symbols; they are noted "INFRINGES ON - USER NAME SPACE" below. */ - -/* Identify Bison output. */ -#define YYBISON 1 - -/* Bison version. */ -#define YYBISON_VERSION "2.4.1" - -/* Skeleton name. */ -#define YYSKELETON_NAME "yacc.c" - -/* Pure parsers. */ -#define YYPURE 0 - -/* Push parsers. */ -#define YYPUSH 0 - -/* Pull parsers. */ -#define YYPULL 1 - -/* Using locations. */ -#define YYLSP_NEEDED 0 - - - -/* Copy the first part of user declarations. */ - -/* Line 189 of yacc.c */ -#line 25 "parser.y" - -#include -#include -#include "../include/node.h" -#include "../include/stack.h" -#include "../include/query_parser.h" -#include "../include/macros.h" - -#define LXQ_RELATION_TYPE 0 -#define LXQ_SELECTOR_TYPE 1 - -extern int yylex(void); -extern int yyparse(void); -extern int yylineno; -extern char* yytext; -extern FILE* yyin; - -doc* lxq_document; - -char* lxq_parser_dot_query_operator = "class"; -char* lxq_parser_pound_query_operator = "id"; -list* lxq_selected_elements; - -void yyerror(const char *str) -{ - fprintf(stderr,"error at:%d: %s at '%s'\n", yylineno, str, yytext); - lxq_document = NULL; - lxq_selected_elements = NULL; -} - -int yywrap() -{ - return 1; -} - -void parse_file(char* filename){ - char* address; - FILE* holder; - struct yy_buffer_state* bs; - - if(!strcmp(filename, "-")){ - holder = yyin = 0; - } - else{ - holder = yyin = fopen(filename, "r"); - if(yyin == NULL){ - log(F, "Unable to open file %s for reading.", filename); - exit(1); - } - } - - yylineno = 1; - yyparse(); - yylex_destroy(); - if(holder) fclose(holder); -} - -void parse_string(const char* str){ - int len = strlen(str); - char* internal_cpy = alloc(char, len + 2); - - memcpy(internal_cpy, str, len); - - internal_cpy[len] = '\0'; - internal_cpy[len + 1] = '\0'; - - if(!yy_scan_buffer(internal_cpy, len + 2)){ - log(F, "Flex could not allocate a new buffer to parse the string."); - exit(1); - } - yylineno = 1; - yyparse(); - yylex_destroy(); - free(internal_cpy); -} - - - - -/* Line 189 of yacc.c */ -#line 153 "y.tab.c" - -/* Enabling traces. */ -#ifndef YYDEBUG -# define YYDEBUG 0 -#endif - -/* Enabling verbose error messages. */ -#ifdef YYERROR_VERBOSE -# undef YYERROR_VERBOSE -# define YYERROR_VERBOSE 1 -#else -# define YYERROR_VERBOSE 0 -#endif - -/* Enabling the token table. */ -#ifndef YYTOKEN_TABLE -# define YYTOKEN_TABLE 0 -#endif - - -/* Tokens. */ -#ifndef YYTOKENTYPE -# define YYTOKENTYPE - /* Put the tokens into the symbol table, so that GDB and other debuggers - know about them. */ - enum yytokentype { - START_EL = 258, - END_EL = 259, - SLASH = 260, - SCUSTOM_FILTER = 261, - WORD = 262, - TEXT = 263, - CDATA_TOK = 264, - REGEX = 265, - CUSTOM_FILTER = 266, - CUSTOM_OPERATOR = 267, - CUSTOM_RELATION_OPERATOR = 268, - ALL = 269, - SPACE = 270, - END_REGEXI = 271, - NO_OP = 272, - EQUAL_OP = 273, - WSSV_OP = 274, - STARTSW_OP = 275, - ENDSW_OP = 276, - CONTAINS_OP = 277, - REGEX_OP = 278, - REGEXI_OP = 279, - DSV_OP = 280, - NOTEQUAL_OP = 281, - EVEN = 282, - ODD = 283, - NTH_CHILD_FILTER = 284, - NTH_LAST_CHILD_FILTER = 285, - FIRST_CHILD_FILTER = 286, - LAST_CHILD_FILTER = 287, - ONLY_CHILD_FILTER = 288, - EMPTY_FILTER = 289, - NOT_FILTER = 290, - DIGITS = 291 - }; -#endif -/* Tokens. */ -#define START_EL 258 -#define END_EL 259 -#define SLASH 260 -#define SCUSTOM_FILTER 261 -#define WORD 262 -#define TEXT 263 -#define CDATA_TOK 264 -#define REGEX 265 -#define CUSTOM_FILTER 266 -#define CUSTOM_OPERATOR 267 -#define CUSTOM_RELATION_OPERATOR 268 -#define ALL 269 -#define SPACE 270 -#define END_REGEXI 271 -#define NO_OP 272 -#define EQUAL_OP 273 -#define WSSV_OP 274 -#define STARTSW_OP 275 -#define ENDSW_OP 276 -#define CONTAINS_OP 277 -#define REGEX_OP 278 -#define REGEXI_OP 279 -#define DSV_OP 280 -#define NOTEQUAL_OP 281 -#define EVEN 282 -#define ODD 283 -#define NTH_CHILD_FILTER 284 -#define NTH_LAST_CHILD_FILTER 285 -#define FIRST_CHILD_FILTER 286 -#define LAST_CHILD_FILTER 287 -#define ONLY_CHILD_FILTER 288 -#define EMPTY_FILTER 289 -#define NOT_FILTER 290 -#define DIGITS 291 - - - - -#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED -typedef union YYSTYPE -{ - -/* Line 214 of yacc.c */ -#line 104 "parser.y" - - char * string; - struct snode* dn; - int digits; - struct attr_selector_s* attrselector; - struct step_s* s; - int token; - struct filter_selector_s* fa; - struct generic_list_s* q; - struct selector_s* sel; - struct match_value_s* mv; - - - -/* Line 214 of yacc.c */ -#line 276 "y.tab.c" -} YYSTYPE; -# define YYSTYPE_IS_TRIVIAL 1 -# define yystype YYSTYPE /* obsolescent; will be withdrawn */ -# define YYSTYPE_IS_DECLARED 1 -#endif - - -/* Copy the second part of user declarations. */ - - -/* Line 264 of yacc.c */ -#line 288 "y.tab.c" - -#ifdef short -# undef short -#endif - -#ifdef YYTYPE_UINT8 -typedef YYTYPE_UINT8 yytype_uint8; -#else -typedef unsigned char yytype_uint8; -#endif - -#ifdef YYTYPE_INT8 -typedef YYTYPE_INT8 yytype_int8; -#elif (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -typedef signed char yytype_int8; -#else -typedef short int yytype_int8; -#endif - -#ifdef YYTYPE_UINT16 -typedef YYTYPE_UINT16 yytype_uint16; -#else -typedef unsigned short int yytype_uint16; -#endif - -#ifdef YYTYPE_INT16 -typedef YYTYPE_INT16 yytype_int16; -#else -typedef short int yytype_int16; -#endif - -#ifndef YYSIZE_T -# ifdef __SIZE_TYPE__ -# define YYSIZE_T __SIZE_TYPE__ -# elif defined size_t -# define YYSIZE_T size_t -# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -# include /* INFRINGES ON USER NAME SPACE */ -# define YYSIZE_T size_t -# else -# define YYSIZE_T unsigned int -# endif -#endif - -#define YYSIZE_MAXIMUM ((YYSIZE_T) -1) - -#ifndef YY_ -# if YYENABLE_NLS -# if ENABLE_NLS -# include /* INFRINGES ON USER NAME SPACE */ -# define YY_(msgid) dgettext ("bison-runtime", msgid) -# endif -# endif -# ifndef YY_ -# define YY_(msgid) msgid -# endif -#endif - -/* Suppress unused-variable warnings by "using" E. */ -#if ! defined lint || defined __GNUC__ -# define YYUSE(e) ((void) (e)) -#else -# define YYUSE(e) /* empty */ -#endif - -/* Identity function, used to suppress warnings about constant conditions. */ -#ifndef lint -# define YYID(n) (n) -#else -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static int -YYID (int yyi) -#else -static int -YYID (yyi) - int yyi; -#endif -{ - return yyi; -} -#endif - -#if ! defined yyoverflow || YYERROR_VERBOSE - -/* The parser invokes alloca or malloc; define the necessary symbols. */ - -# ifdef YYSTACK_USE_ALLOCA -# if YYSTACK_USE_ALLOCA -# ifdef __GNUC__ -# define YYSTACK_ALLOC __builtin_alloca -# elif defined __BUILTIN_VA_ARG_INCR -# include /* INFRINGES ON USER NAME SPACE */ -# elif defined _AIX -# define YYSTACK_ALLOC __alloca -# elif defined _MSC_VER -# include /* INFRINGES ON USER NAME SPACE */ -# define alloca _alloca -# else -# define YYSTACK_ALLOC alloca -# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -# include /* INFRINGES ON USER NAME SPACE */ -# ifndef _STDLIB_H -# define _STDLIB_H 1 -# endif -# endif -# endif -# endif -# endif - -# ifdef YYSTACK_ALLOC - /* Pacify GCC's `empty if-body' warning. */ -# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0)) -# ifndef YYSTACK_ALLOC_MAXIMUM - /* The OS might guarantee only one guard page at the bottom of the stack, - and a page size can be as small as 4096 bytes. So we cannot safely - invoke alloca (N) if N exceeds 4096. Use a slightly smaller number - to allow for a few compiler-allocated temporary stack slots. */ -# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ -# endif -# else -# define YYSTACK_ALLOC YYMALLOC -# define YYSTACK_FREE YYFREE -# ifndef YYSTACK_ALLOC_MAXIMUM -# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM -# endif -# if (defined __cplusplus && ! defined _STDLIB_H \ - && ! ((defined YYMALLOC || defined malloc) \ - && (defined YYFREE || defined free))) -# include /* INFRINGES ON USER NAME SPACE */ -# ifndef _STDLIB_H -# define _STDLIB_H 1 -# endif -# endif -# ifndef YYMALLOC -# define YYMALLOC malloc -# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# ifndef YYFREE -# define YYFREE free -# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -void free (void *); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# endif -#endif /* ! defined yyoverflow || YYERROR_VERBOSE */ - - -#if (! defined yyoverflow \ - && (! defined __cplusplus \ - || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) - -/* A type that is properly aligned for any stack member. */ -union yyalloc -{ - yytype_int16 yyss_alloc; - YYSTYPE yyvs_alloc; -}; - -/* The size of the maximum gap between one aligned stack and the next. */ -# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) - -/* The size of an array large to enough to hold all stacks, each with - N elements. */ -# define YYSTACK_BYTES(N) \ - ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAXIMUM) - -/* Copy COUNT objects from FROM to TO. The source and destination do - not overlap. */ -# ifndef YYCOPY -# if defined __GNUC__ && 1 < __GNUC__ -# define YYCOPY(To, From, Count) \ - __builtin_memcpy (To, From, (Count) * sizeof (*(From))) -# else -# define YYCOPY(To, From, Count) \ - do \ - { \ - YYSIZE_T yyi; \ - for (yyi = 0; yyi < (Count); yyi++) \ - (To)[yyi] = (From)[yyi]; \ - } \ - while (YYID (0)) -# endif -# endif - -/* Relocate STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ -# define YYSTACK_RELOCATE(Stack_alloc, Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \ - Stack = &yyptr->Stack_alloc; \ - yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (YYID (0)) - -#endif - -/* YYFINAL -- State number of the termination state. */ -#define YYFINAL 24 -/* YYLAST -- Last index in YYTABLE. */ -#define YYLAST 131 - -/* YYNTOKENS -- Number of terminals. */ -#define YYNTOKENS 57 -/* YYNNTS -- Number of nonterminals. */ -#define YYNNTS 35 -/* YYNRULES -- Number of rules. */ -#define YYNRULES 95 -/* YYNRULES -- Number of states. */ -#define YYNSTATES 144 - -/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ -#define YYUNDEFTOK 2 -#define YYMAXUTOK 291 - -#define YYTRANSLATE(YYX) \ - ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) - -/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ -static const yytype_uint8 yytranslate[] = -{ - 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 39, 42, 47, 2, 2, 2, 43, - 48, 49, 2, 51, 55, 52, 46, 56, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 38, 2, - 2, 41, 53, 40, 37, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 44, 2, 45, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 50, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 54, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 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 -}; - -#if YYDEBUG -/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in - YYRHS. */ -static const yytype_uint16 yyprhs[] = -{ - 0, 0, 3, 6, 8, 11, 14, 16, 20, 22, - 24, 27, 30, 36, 43, 47, 53, 54, 57, 59, - 61, 63, 68, 73, 74, 77, 81, 83, 84, 87, - 90, 94, 97, 101, 104, 106, 110, 114, 118, 119, - 124, 128, 132, 135, 138, 139, 141, 143, 145, 146, - 150, 152, 154, 159, 164, 169, 170, 173, 176, 178, - 180, 182, 184, 186, 188, 190, 192, 194, 196, 198, - 201, 204, 208, 211, 214, 216, 218, 220, 222, 224, - 226, 227, 232, 237, 240, 244, 246, 249, 251, 253, - 255, 257, 259, 261, 263, 265 -}; - -/* YYRHS -- A `-1'-separated list of the rules' RHS. */ -static const yytype_int8 yyrhs[] = -{ - 58, 0, -1, 37, 73, -1, 59, -1, 66, 65, - -1, 61, 64, -1, 7, -1, 7, 38, 7, -1, - 63, -1, 62, -1, 61, 63, -1, 61, 62, -1, - 3, 39, 7, 71, 4, -1, 3, 40, 60, 69, - 40, 4, -1, 67, 65, 68, -1, 3, 60, 69, - 5, 4, -1, -1, 65, 66, -1, 9, -1, 8, - -1, 64, -1, 3, 60, 69, 4, -1, 3, 5, - 60, 4, -1, -1, 69, 70, -1, 60, 41, 72, - -1, 60, -1, -1, 71, 7, -1, 71, 72, -1, - 42, 8, 42, -1, 42, 42, -1, 43, 8, 43, - -1, 43, 43, -1, 74, -1, 73, 86, 74, -1, - 73, 13, 74, -1, 77, 75, 78, -1, -1, 75, - 44, 76, 45, -1, 75, 46, 7, -1, 75, 47, - 7, -1, 7, 87, -1, 88, 87, -1, -1, 14, - -1, 7, -1, 88, -1, -1, 78, 38, 79, -1, - 82, -1, 11, -1, 11, 48, 80, 49, -1, 81, - 48, 83, 49, -1, 35, 48, 73, 49, -1, -1, - 80, 36, -1, 80, 7, -1, 29, -1, 30, -1, - 31, -1, 32, -1, 33, -1, 34, -1, 84, -1, - 85, -1, 27, -1, 28, -1, 50, -1, 36, 50, - -1, 50, 85, -1, 36, 50, 85, -1, 51, 36, - -1, 52, 36, -1, 36, -1, 53, -1, 54, -1, - 51, -1, 55, -1, 15, -1, -1, 91, 42, 8, - 42, -1, 91, 43, 8, 43, -1, 18, 88, -1, - 56, 89, 90, -1, 10, -1, 89, 10, -1, 56, - -1, 16, -1, 18, -1, 19, -1, 20, -1, 21, - -1, 22, -1, 25, -1, 26, -1 -}; - -/* YYRLINE[YYN] -- source line where rule number YYN was defined. */ -static const yytype_uint16 yyrline[] = -{ - 0, 138, 138, 139, 142, 152, 155, 156, 167, 168, - 169, 170, 172, 174, 190, 213, 224, 225, 230, 231, - 232, 236, 247, 250, 251, 257, 263, 271, 272, 273, - 276, 277, 278, 279, 283, 284, 290, 297, 300, 301, - 302, 307, 314, 315, 318, 319, 320, 321, 324, 325, - 328, 329, 330, 331, 332, 335, 336, 337, 339, 340, - 343, 344, 345, 346, 349, 350, 351, 352, 355, 356, - 357, 358, 361, 362, 363, 366, 367, 368, 369, 370, - 373, 374, 375, 376, 379, 390, 391, 394, 395, 398, - 399, 400, 401, 402, 403, 404 -}; -#endif - -#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE -/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. - First, the terminals, then, starting at YYNTOKENS, nonterminals. */ -static const char *const yytname[] = -{ - "$end", "error", "$undefined", "START_EL", "END_EL", "SLASH", - "SCUSTOM_FILTER", "WORD", "TEXT", "CDATA_TOK", "REGEX", "CUSTOM_FILTER", - "CUSTOM_OPERATOR", "CUSTOM_RELATION_OPERATOR", "ALL", "SPACE", - "END_REGEXI", "NO_OP", "EQUAL_OP", "WSSV_OP", "STARTSW_OP", "ENDSW_OP", - "CONTAINS_OP", "REGEX_OP", "REGEXI_OP", "DSV_OP", "NOTEQUAL_OP", "EVEN", - "ODD", "NTH_CHILD_FILTER", "NTH_LAST_CHILD_FILTER", "FIRST_CHILD_FILTER", - "LAST_CHILD_FILTER", "ONLY_CHILD_FILTER", "EMPTY_FILTER", "NOT_FILTER", - "DIGITS", "'@'", "':'", "'!'", "'?'", "'='", "'\"'", "'\\''", "'['", - "']'", "'.'", "'#'", "'('", "')'", "'n'", "'+'", "'-'", "'>'", "'~'", - "','", "'/'", "$accept", "choose", "document", "namespace", - "declarations", "doctype", "declaration", "node", "inner", "prop", - "start_tag", "end_tag", "attrs", "attr", "words_and_values", "value", - "selector_group", "selector", "attrsels", "attrsel", "id", - "pseudo_filters", "pseudo_filter", "words", "nth_pseudo_op", "pseudo_op", - "parameters", "step", "offset", "relation_operator", "attr_filter", - "regex", "regex_stack", "end_regex", "operator", 0 -}; -#endif - -# ifdef YYPRINT -/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to - token YYLEX-NUM. */ -static const yytype_uint16 yytoknum[] = -{ - 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, - 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, - 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, - 285, 286, 287, 288, 289, 290, 291, 64, 58, 33, - 63, 61, 34, 39, 91, 93, 46, 35, 40, 41, - 110, 43, 45, 62, 126, 44, 47 -}; -# endif - -/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ -static const yytype_uint8 yyr1[] = -{ - 0, 57, 58, 58, 59, 59, 60, 60, 61, 61, - 61, 61, 62, 63, 64, 64, 65, 65, 66, 66, - 66, 67, 68, 69, 69, 70, 70, 71, 71, 71, - 72, 72, 72, 72, 73, 73, 73, 74, 75, 75, - 75, 75, 76, 76, 77, 77, 77, 77, 78, 78, - 79, 79, 79, 79, 79, 80, 80, 80, 81, 81, - 82, 82, 82, 82, 83, 83, 83, 83, 84, 84, - 84, 84, 85, 85, 85, 86, 86, 86, 86, 86, - 87, 87, 87, 87, 88, 89, 89, 90, 90, 91, - 91, 91, 91, 91, 91, 91 -}; - -/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ -static const yytype_uint8 yyr2[] = -{ - 0, 2, 2, 1, 2, 2, 1, 3, 1, 1, - 2, 2, 5, 6, 3, 5, 0, 2, 1, 1, - 1, 4, 4, 0, 2, 3, 1, 0, 2, 2, - 3, 2, 3, 2, 1, 3, 3, 3, 0, 4, - 3, 3, 2, 2, 0, 1, 1, 1, 0, 3, - 1, 1, 4, 4, 4, 0, 2, 2, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, - 2, 3, 2, 2, 1, 1, 1, 1, 1, 1, - 0, 4, 4, 2, 3, 1, 2, 1, 1, 1, - 1, 1, 1, 1, 1, 1 -}; - -/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state - STATE-NUM when YYTABLE doesn't specify something else to do. Zero - means the default is an error. */ -static const yytype_uint8 yydefact[] = -{ - 0, 0, 19, 18, 44, 0, 3, 0, 9, 8, - 20, 16, 16, 6, 0, 0, 23, 46, 45, 0, - 2, 34, 38, 47, 1, 11, 10, 5, 4, 0, - 0, 27, 23, 0, 85, 0, 44, 79, 77, 75, - 76, 78, 44, 48, 0, 17, 0, 14, 7, 0, - 0, 21, 0, 26, 24, 86, 88, 87, 84, 36, - 35, 0, 0, 0, 37, 0, 12, 28, 0, 0, - 29, 0, 15, 0, 80, 0, 80, 40, 41, 0, - 0, 0, 31, 0, 33, 13, 25, 89, 90, 91, - 92, 93, 94, 95, 42, 0, 39, 43, 51, 58, - 59, 60, 61, 62, 63, 0, 49, 0, 50, 22, - 30, 32, 83, 0, 0, 55, 44, 0, 0, 0, - 0, 0, 66, 67, 74, 68, 0, 0, 0, 64, - 65, 81, 82, 57, 56, 52, 54, 69, 74, 70, - 72, 73, 53, 71 -}; - -/* YYDEFGOTO[NTERM-NUM]. */ -static const yytype_int16 yydefgoto[] = -{ - -1, 5, 6, 16, 7, 8, 9, 10, 28, 45, - 12, 47, 33, 54, 49, 70, 20, 21, 43, 75, - 22, 64, 106, 120, 107, 108, 128, 129, 130, 42, - 94, 23, 35, 58, 95 -}; - -/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing - STATE-NUM. */ -#define YYPACT_NINF -113 -static const yytype_int8 yypact[] = -{ - 12, 27, -113, -113, -5, 14, -113, 13, -113, -113, - -113, -113, -113, 35, 32, 47, -113, -113, -113, 78, - 9, -113, -113, -113, -113, -113, -113, -113, 23, 62, - 82, -113, -113, 33, -113, -9, -5, -113, -113, -113, - -113, -113, -5, 28, 47, -113, 71, -113, -113, 1, - 16, -113, 86, 58, -113, -113, -113, -113, -113, -113, - -113, -4, 93, 96, 66, 47, -113, -113, 3, -2, - -113, 101, -113, -13, 76, 61, 76, -113, -113, 50, - 103, 67, -113, 65, -113, -113, -113, 54, -113, -113, - -113, -113, -113, -113, -113, 44, -113, -113, 63, -113, - -113, -113, -113, -113, -113, 64, -113, 68, -113, -113, - -113, -113, -113, 105, 106, -113, -5, 41, 73, 74, - -3, 4, -113, -113, 69, -24, 84, 85, 75, -113, - -113, -113, -113, -113, -113, -113, -113, -24, -113, -113, - -113, -113, -113, -113 -}; - -/* YYPGOTO[NTERM-NUM]. */ -static const yytype_int8 yypgoto[] = -{ - -113, -113, -113, -15, -113, 111, 115, 116, 113, 126, - -113, -113, 95, -113, -113, 55, 15, 6, -113, -113, - -113, -113, -113, -113, -113, -113, -113, -113, -112, -113, - 53, -51, -113, -113, -113 -}; - -/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If - positive, shift that token. If negative, reduce the rule which - number is the opposite. If zero, do what YYDEFACT says. - If YYTABLE_NINF, syntax error. */ -#define YYTABLE_NINF -1 -static const yytype_uint8 yytable[] = -{ - 32, 55, 17, 74, 133, 66, 83, 56, 67, 18, - 76, 81, 138, 139, 24, 1, 1, 36, 53, 37, - 2, 3, 36, 13, 37, 143, 44, 126, 127, 68, - 69, 2, 3, 134, 13, 53, 112, 51, 52, 31, - 13, 84, 59, 68, 69, 82, 135, 57, 60, 4, - 80, 19, 19, 136, 13, 38, 71, 39, 40, 41, - 38, 98, 39, 40, 41, 46, 14, 15, 122, 123, - 2, 3, 61, 30, 62, 63, 65, 124, 13, 99, - 100, 101, 102, 103, 104, 105, 113, 114, 34, 48, - 72, 125, 126, 127, 87, 88, 89, 90, 91, 73, - 77, 92, 93, 78, 79, 85, 96, 109, 111, 110, - 19, 115, 116, 118, 119, 131, 117, 132, 25, 137, - 140, 141, 26, 27, 142, 29, 11, 50, 86, 97, - 0, 121 -}; - -static const yytype_int16 yycheck[] = -{ - 15, 10, 7, 7, 7, 4, 8, 16, 7, 14, - 61, 8, 36, 125, 0, 3, 3, 13, 33, 15, - 8, 9, 13, 7, 15, 137, 3, 51, 52, 42, - 43, 8, 9, 36, 7, 50, 87, 4, 5, 7, - 7, 43, 36, 42, 43, 42, 49, 56, 42, 37, - 65, 56, 56, 49, 7, 51, 40, 53, 54, 55, - 51, 11, 53, 54, 55, 3, 39, 40, 27, 28, - 8, 9, 44, 38, 46, 47, 5, 36, 7, 29, - 30, 31, 32, 33, 34, 35, 42, 43, 10, 7, - 4, 50, 51, 52, 18, 19, 20, 21, 22, 41, - 7, 25, 26, 7, 38, 4, 45, 4, 43, 42, - 56, 48, 48, 8, 8, 42, 48, 43, 7, 50, - 36, 36, 7, 7, 49, 12, 0, 32, 73, 76, - -1, 116 -}; - -/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing - symbol of state STATE-NUM. */ -static const yytype_uint8 yystos[] = -{ - 0, 3, 8, 9, 37, 58, 59, 61, 62, 63, - 64, 66, 67, 7, 39, 40, 60, 7, 14, 56, - 73, 74, 77, 88, 0, 62, 63, 64, 65, 65, - 38, 7, 60, 69, 10, 89, 13, 15, 51, 53, - 54, 55, 86, 75, 3, 66, 3, 68, 7, 71, - 69, 4, 5, 60, 70, 10, 16, 56, 90, 74, - 74, 44, 46, 47, 78, 5, 4, 7, 42, 43, - 72, 40, 4, 41, 7, 76, 88, 7, 7, 38, - 60, 8, 42, 8, 43, 4, 72, 18, 19, 20, - 21, 22, 25, 26, 87, 91, 45, 87, 11, 29, - 30, 31, 32, 33, 34, 35, 79, 81, 82, 4, - 42, 43, 88, 42, 43, 48, 48, 48, 8, 8, - 80, 73, 27, 28, 36, 50, 51, 52, 83, 84, - 85, 42, 43, 7, 36, 49, 49, 50, 36, 85, - 36, 36, 49, 85 -}; - -#define yyerrok (yyerrstatus = 0) -#define yyclearin (yychar = YYEMPTY) -#define YYEMPTY (-2) -#define YYEOF 0 - -#define YYACCEPT goto yyacceptlab -#define YYABORT goto yyabortlab -#define YYERROR goto yyerrorlab - - -/* Like YYERROR except do call yyerror. This remains here temporarily - to ease the transition to the new meaning of YYERROR, for GCC. - Once GCC version 2 has supplanted version 1, this can go. */ - -#define YYFAIL goto yyerrlab - -#define YYRECOVERING() (!!yyerrstatus) - -#define YYBACKUP(Token, Value) \ -do \ - if (yychar == YYEMPTY && yylen == 1) \ - { \ - yychar = (Token); \ - yylval = (Value); \ - yytoken = YYTRANSLATE (yychar); \ - YYPOPSTACK (1); \ - goto yybackup; \ - } \ - else \ - { \ - yyerror (YY_("syntax error: cannot back up")); \ - YYERROR; \ - } \ -while (YYID (0)) - - -#define YYTERROR 1 -#define YYERRCODE 256 - - -/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. - If N is 0, then set CURRENT to the empty location which ends - the previous symbol: RHS[0] (always defined). */ - -#define YYRHSLOC(Rhs, K) ((Rhs)[K]) -#ifndef YYLLOC_DEFAULT -# define YYLLOC_DEFAULT(Current, Rhs, N) \ - do \ - if (YYID (N)) \ - { \ - (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ - (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ - (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ - (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ - } \ - else \ - { \ - (Current).first_line = (Current).last_line = \ - YYRHSLOC (Rhs, 0).last_line; \ - (Current).first_column = (Current).last_column = \ - YYRHSLOC (Rhs, 0).last_column; \ - } \ - while (YYID (0)) -#endif - - -/* YY_LOCATION_PRINT -- Print the location on the stream. - This macro was not mandated originally: define only if we know - we won't break user code: when these are the locations we know. */ - -#ifndef YY_LOCATION_PRINT -# if YYLTYPE_IS_TRIVIAL -# define YY_LOCATION_PRINT(File, Loc) \ - fprintf (File, "%d.%d-%d.%d", \ - (Loc).first_line, (Loc).first_column, \ - (Loc).last_line, (Loc).last_column) -# else -# define YY_LOCATION_PRINT(File, Loc) ((void) 0) -# endif -#endif - - -/* YYLEX -- calling `yylex' with the right arguments. */ - -#ifdef YYLEX_PARAM -# define YYLEX yylex (YYLEX_PARAM) -#else -# define YYLEX yylex () -#endif - -/* Enable debugging if requested. */ -#if YYDEBUG - -# ifndef YYFPRINTF -# include /* INFRINGES ON USER NAME SPACE */ -# define YYFPRINTF fprintf -# endif - -# define YYDPRINTF(Args) \ -do { \ - if (yydebug) \ - YYFPRINTF Args; \ -} while (YYID (0)) - -# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ -do { \ - if (yydebug) \ - { \ - YYFPRINTF (stderr, "%s ", Title); \ - yy_symbol_print (stderr, \ - Type, Value); \ - YYFPRINTF (stderr, "\n"); \ - } \ -} while (YYID (0)) - - -/*--------------------------------. -| Print this symbol on YYOUTPUT. | -`--------------------------------*/ - -/*ARGSUSED*/ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) -#else -static void -yy_symbol_value_print (yyoutput, yytype, yyvaluep) - FILE *yyoutput; - int yytype; - YYSTYPE const * const yyvaluep; -#endif -{ - if (!yyvaluep) - return; -# ifdef YYPRINT - if (yytype < YYNTOKENS) - YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); -# else - YYUSE (yyoutput); -# endif - switch (yytype) - { - default: - break; - } -} - - -/*--------------------------------. -| Print this symbol on YYOUTPUT. | -`--------------------------------*/ - -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) -#else -static void -yy_symbol_print (yyoutput, yytype, yyvaluep) - FILE *yyoutput; - int yytype; - YYSTYPE const * const yyvaluep; -#endif -{ - if (yytype < YYNTOKENS) - YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); - else - YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); - - yy_symbol_value_print (yyoutput, yytype, yyvaluep); - YYFPRINTF (yyoutput, ")"); -} - -/*------------------------------------------------------------------. -| yy_stack_print -- Print the state stack from its BOTTOM up to its | -| TOP (included). | -`------------------------------------------------------------------*/ - -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop) -#else -static void -yy_stack_print (yybottom, yytop) - yytype_int16 *yybottom; - yytype_int16 *yytop; -#endif -{ - YYFPRINTF (stderr, "Stack now"); - for (; yybottom <= yytop; yybottom++) - { - int yybot = *yybottom; - YYFPRINTF (stderr, " %d", yybot); - } - YYFPRINTF (stderr, "\n"); -} - -# define YY_STACK_PRINT(Bottom, Top) \ -do { \ - if (yydebug) \ - yy_stack_print ((Bottom), (Top)); \ -} while (YYID (0)) - - -/*------------------------------------------------. -| Report that the YYRULE is going to be reduced. | -`------------------------------------------------*/ - -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_reduce_print (YYSTYPE *yyvsp, int yyrule) -#else -static void -yy_reduce_print (yyvsp, yyrule) - YYSTYPE *yyvsp; - int yyrule; -#endif -{ - int yynrhs = yyr2[yyrule]; - int yyi; - unsigned long int yylno = yyrline[yyrule]; - YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", - yyrule - 1, yylno); - /* The symbols being reduced. */ - for (yyi = 0; yyi < yynrhs; yyi++) - { - YYFPRINTF (stderr, " $%d = ", yyi + 1); - yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi], - &(yyvsp[(yyi + 1) - (yynrhs)]) - ); - YYFPRINTF (stderr, "\n"); - } -} - -# define YY_REDUCE_PRINT(Rule) \ -do { \ - if (yydebug) \ - yy_reduce_print (yyvsp, Rule); \ -} while (YYID (0)) - -/* Nonzero means print parse trace. It is left uninitialized so that - multiple parsers can coexist. */ -int yydebug; -#else /* !YYDEBUG */ -# define YYDPRINTF(Args) -# define YY_SYMBOL_PRINT(Title, Type, Value, Location) -# define YY_STACK_PRINT(Bottom, Top) -# define YY_REDUCE_PRINT(Rule) -#endif /* !YYDEBUG */ - - -/* YYINITDEPTH -- initial size of the parser's stacks. */ -#ifndef YYINITDEPTH -# define YYINITDEPTH 200 -#endif - -/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only - if the built-in stack extension method is used). - - Do not make this value too large; the results are undefined if - YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) - evaluated with infinite-precision integer arithmetic. */ - -#ifndef YYMAXDEPTH -# define YYMAXDEPTH 10000 -#endif - - - -#if YYERROR_VERBOSE - -# ifndef yystrlen -# if defined __GLIBC__ && defined _STRING_H -# define yystrlen strlen -# else -/* Return the length of YYSTR. */ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static YYSIZE_T -yystrlen (const char *yystr) -#else -static YYSIZE_T -yystrlen (yystr) - const char *yystr; -#endif -{ - YYSIZE_T yylen; - for (yylen = 0; yystr[yylen]; yylen++) - continue; - return yylen; -} -# endif -# endif - -# ifndef yystpcpy -# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE -# define yystpcpy stpcpy -# else -/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in - YYDEST. */ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static char * -yystpcpy (char *yydest, const char *yysrc) -#else -static char * -yystpcpy (yydest, yysrc) - char *yydest; - const char *yysrc; -#endif -{ - char *yyd = yydest; - const char *yys = yysrc; - - while ((*yyd++ = *yys++) != '\0') - continue; - - return yyd - 1; -} -# endif -# endif - -# ifndef yytnamerr -/* Copy to YYRES the contents of YYSTR after stripping away unnecessary - quotes and backslashes, so that it's suitable for yyerror. The - heuristic is that double-quoting is unnecessary unless the string - contains an apostrophe, a comma, or backslash (other than - backslash-backslash). YYSTR is taken from yytname. If YYRES is - null, do not copy; instead, return the length of what the result - would have been. */ -static YYSIZE_T -yytnamerr (char *yyres, const char *yystr) -{ - if (*yystr == '"') - { - YYSIZE_T yyn = 0; - char const *yyp = yystr; - - for (;;) - switch (*++yyp) - { - case '\'': - case ',': - goto do_not_strip_quotes; - - case '\\': - if (*++yyp != '\\') - goto do_not_strip_quotes; - /* Fall through. */ - default: - if (yyres) - yyres[yyn] = *yyp; - yyn++; - break; - - case '"': - if (yyres) - yyres[yyn] = '\0'; - return yyn; - } - do_not_strip_quotes: ; - } - - if (! yyres) - return yystrlen (yystr); - - return yystpcpy (yyres, yystr) - yyres; -} -# endif - -/* Copy into YYRESULT an error message about the unexpected token - YYCHAR while in state YYSTATE. Return the number of bytes copied, - including the terminating null byte. If YYRESULT is null, do not - copy anything; just return the number of bytes that would be - copied. As a special case, return 0 if an ordinary "syntax error" - message will do. Return YYSIZE_MAXIMUM if overflow occurs during - size calculation. */ -static YYSIZE_T -yysyntax_error (char *yyresult, int yystate, int yychar) -{ - int yyn = yypact[yystate]; - - if (! (YYPACT_NINF < yyn && yyn <= YYLAST)) - return 0; - else - { - int yytype = YYTRANSLATE (yychar); - YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); - YYSIZE_T yysize = yysize0; - YYSIZE_T yysize1; - int yysize_overflow = 0; - enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; - char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; - int yyx; - -# if 0 - /* This is so xgettext sees the translatable formats that are - constructed on the fly. */ - YY_("syntax error, unexpected %s"); - YY_("syntax error, unexpected %s, expecting %s"); - YY_("syntax error, unexpected %s, expecting %s or %s"); - YY_("syntax error, unexpected %s, expecting %s or %s or %s"); - YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); -# endif - char *yyfmt; - char const *yyf; - static char const yyunexpected[] = "syntax error, unexpected %s"; - static char const yyexpecting[] = ", expecting %s"; - static char const yyor[] = " or %s"; - char yyformat[sizeof yyunexpected - + sizeof yyexpecting - 1 - + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) - * (sizeof yyor - 1))]; - char const *yyprefix = yyexpecting; - - /* Start YYX at -YYN if negative to avoid negative indexes in - YYCHECK. */ - int yyxbegin = yyn < 0 ? -yyn : 0; - - /* Stay within bounds of both yycheck and yytname. */ - int yychecklim = YYLAST - yyn + 1; - int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; - int yycount = 1; - - yyarg[0] = yytname[yytype]; - yyfmt = yystpcpy (yyformat, yyunexpected); - - for (yyx = yyxbegin; yyx < yyxend; ++yyx) - if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) - { - if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) - { - yycount = 1; - yysize = yysize0; - yyformat[sizeof yyunexpected - 1] = '\0'; - break; - } - yyarg[yycount++] = yytname[yyx]; - yysize1 = yysize + yytnamerr (0, yytname[yyx]); - yysize_overflow |= (yysize1 < yysize); - yysize = yysize1; - yyfmt = yystpcpy (yyfmt, yyprefix); - yyprefix = yyor; - } - - yyf = YY_(yyformat); - yysize1 = yysize + yystrlen (yyf); - yysize_overflow |= (yysize1 < yysize); - yysize = yysize1; - - if (yysize_overflow) - return YYSIZE_MAXIMUM; - - if (yyresult) - { - /* Avoid sprintf, as that infringes on the user's name space. - Don't have undefined behavior even if the translation - produced a string with the wrong number of "%s"s. */ - char *yyp = yyresult; - int yyi = 0; - while ((*yyp = *yyf) != '\0') - { - if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) - { - yyp += yytnamerr (yyp, yyarg[yyi++]); - yyf += 2; - } - else - { - yyp++; - yyf++; - } - } - } - return yysize; - } -} -#endif /* YYERROR_VERBOSE */ - - -/*-----------------------------------------------. -| Release the memory associated to this symbol. | -`-----------------------------------------------*/ - -/*ARGSUSED*/ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) -#else -static void -yydestruct (yymsg, yytype, yyvaluep) - const char *yymsg; - int yytype; - YYSTYPE *yyvaluep; -#endif -{ - YYUSE (yyvaluep); - - if (!yymsg) - yymsg = "Deleting"; - YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); - - switch (yytype) - { - - default: - break; - } -} - -/* Prevent warnings from -Wmissing-prototypes. */ -#ifdef YYPARSE_PARAM -#if defined __STDC__ || defined __cplusplus -int yyparse (void *YYPARSE_PARAM); -#else -int yyparse (); -#endif -#else /* ! YYPARSE_PARAM */ -#if defined __STDC__ || defined __cplusplus -int yyparse (void); -#else -int yyparse (); -#endif -#endif /* ! YYPARSE_PARAM */ - - -/* The lookahead symbol. */ -int yychar; - -/* The semantic value of the lookahead symbol. */ -YYSTYPE yylval; - -/* Number of syntax errors so far. */ -int yynerrs; - - - -/*-------------------------. -| yyparse or yypush_parse. | -`-------------------------*/ - -#ifdef YYPARSE_PARAM -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -int -yyparse (void *YYPARSE_PARAM) -#else -int -yyparse (YYPARSE_PARAM) - void *YYPARSE_PARAM; -#endif -#else /* ! YYPARSE_PARAM */ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -int -yyparse (void) -#else -int -yyparse () - -#endif -#endif -{ - - - int yystate; - /* Number of tokens to shift before error messages enabled. */ - int yyerrstatus; - - /* The stacks and their tools: - `yyss': related to states. - `yyvs': related to semantic values. - - Refer to the stacks thru separate pointers, to allow yyoverflow - to reallocate them elsewhere. */ - - /* The state stack. */ - yytype_int16 yyssa[YYINITDEPTH]; - yytype_int16 *yyss; - yytype_int16 *yyssp; - - /* The semantic value stack. */ - YYSTYPE yyvsa[YYINITDEPTH]; - YYSTYPE *yyvs; - YYSTYPE *yyvsp; - - YYSIZE_T yystacksize; - - int yyn; - int yyresult; - /* Lookahead token as an internal (translated) token number. */ - int yytoken; - /* The variables used to return semantic value and location from the - action routines. */ - YYSTYPE yyval; - -#if YYERROR_VERBOSE - /* Buffer for error messages, and its allocated size. */ - char yymsgbuf[128]; - char *yymsg = yymsgbuf; - YYSIZE_T yymsg_alloc = sizeof yymsgbuf; -#endif - -#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) - - /* The number of symbols on the RHS of the reduced rule. - Keep to zero when no symbol should be popped. */ - int yylen = 0; - - yytoken = 0; - yyss = yyssa; - yyvs = yyvsa; - yystacksize = YYINITDEPTH; - - YYDPRINTF ((stderr, "Starting parse\n")); - - yystate = 0; - yyerrstatus = 0; - yynerrs = 0; - yychar = YYEMPTY; /* Cause a token to be read. */ - - /* Initialize stack pointers. - Waste one element of value and location stack - so that they stay on the same level as the state stack. - The wasted elements are never initialized. */ - yyssp = yyss; - yyvsp = yyvs; - - goto yysetstate; - -/*------------------------------------------------------------. -| yynewstate -- Push a new state, which is found in yystate. | -`------------------------------------------------------------*/ - yynewstate: - /* In all cases, when you get here, the value and location stacks - have just been pushed. So pushing a state here evens the stacks. */ - yyssp++; - - yysetstate: - *yyssp = yystate; - - if (yyss + yystacksize - 1 <= yyssp) - { - /* Get the current used size of the three stacks, in elements. */ - YYSIZE_T yysize = yyssp - yyss + 1; - -#ifdef yyoverflow - { - /* Give user a chance to reallocate the stack. Use copies of - these so that the &'s don't force the real ones into - memory. */ - YYSTYPE *yyvs1 = yyvs; - yytype_int16 *yyss1 = yyss; - - /* Each stack pointer address is followed by the size of the - data in use in that stack, in bytes. This used to be a - conditional around just the two extra args, but that might - be undefined if yyoverflow is a macro. */ - yyoverflow (YY_("memory exhausted"), - &yyss1, yysize * sizeof (*yyssp), - &yyvs1, yysize * sizeof (*yyvsp), - &yystacksize); - - yyss = yyss1; - yyvs = yyvs1; - } -#else /* no yyoverflow */ -# ifndef YYSTACK_RELOCATE - goto yyexhaustedlab; -# else - /* Extend the stack our own way. */ - if (YYMAXDEPTH <= yystacksize) - goto yyexhaustedlab; - yystacksize *= 2; - if (YYMAXDEPTH < yystacksize) - yystacksize = YYMAXDEPTH; - - { - yytype_int16 *yyss1 = yyss; - union yyalloc *yyptr = - (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); - if (! yyptr) - goto yyexhaustedlab; - YYSTACK_RELOCATE (yyss_alloc, yyss); - YYSTACK_RELOCATE (yyvs_alloc, yyvs); -# undef YYSTACK_RELOCATE - if (yyss1 != yyssa) - YYSTACK_FREE (yyss1); - } -# endif -#endif /* no yyoverflow */ - - yyssp = yyss + yysize - 1; - yyvsp = yyvs + yysize - 1; - - YYDPRINTF ((stderr, "Stack size increased to %lu\n", - (unsigned long int) yystacksize)); - - if (yyss + yystacksize - 1 <= yyssp) - YYABORT; - } - - YYDPRINTF ((stderr, "Entering state %d\n", yystate)); - - if (yystate == YYFINAL) - YYACCEPT; - - goto yybackup; - -/*-----------. -| yybackup. | -`-----------*/ -yybackup: - - /* Do appropriate processing given the current state. Read a - lookahead token if we need one and don't already have one. */ - - /* First try to decide what to do without reference to lookahead token. */ - yyn = yypact[yystate]; - if (yyn == YYPACT_NINF) - goto yydefault; - - /* Not known => get a lookahead token if don't already have one. */ - - /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */ - if (yychar == YYEMPTY) - { - YYDPRINTF ((stderr, "Reading a token: ")); - yychar = YYLEX; - } - - if (yychar <= YYEOF) - { - yychar = yytoken = YYEOF; - YYDPRINTF ((stderr, "Now at end of input.\n")); - } - else - { - yytoken = YYTRANSLATE (yychar); - YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); - } - - /* If the proper action on seeing token YYTOKEN is to reduce or to - detect an error, take that action. */ - yyn += yytoken; - if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) - goto yydefault; - yyn = yytable[yyn]; - if (yyn <= 0) - { - if (yyn == 0 || yyn == YYTABLE_NINF) - goto yyerrlab; - yyn = -yyn; - goto yyreduce; - } - - /* Count tokens shifted since error; after three, turn off error - status. */ - if (yyerrstatus) - yyerrstatus--; - - /* Shift the lookahead token. */ - YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); - - /* Discard the shifted token. */ - yychar = YYEMPTY; - - yystate = yyn; - *++yyvsp = yylval; - - goto yynewstate; - - -/*-----------------------------------------------------------. -| yydefault -- do the default action for the current state. | -`-----------------------------------------------------------*/ -yydefault: - yyn = yydefact[yystate]; - if (yyn == 0) - goto yyerrlab; - goto yyreduce; - - -/*-----------------------------. -| yyreduce -- Do a reduction. | -`-----------------------------*/ -yyreduce: - /* yyn is the number of a rule to reduce with. */ - yylen = yyr2[yyn]; - - /* If YYLEN is nonzero, implement the default value of the action: - `$$ = $1'. - - Otherwise, the following line sets YYVAL to garbage. - This behavior is undocumented and Bison - users should not rely upon it. Assigning to YYVAL - unconditionally makes the parser a bit smaller, and it avoids a - GCC warning that YYVAL may be used uninitialized. */ - yyval = yyvsp[1-yylen]; - - - YY_REDUCE_PRINT (yyn); - switch (yyn) - { - case 4: - -/* Line 1455 of yacc.c */ -#line 142 "parser.y" - { lxq_document = new_document(NULL); - if((yyvsp[(2) - (2)].dn)->children == NULL && (yyvsp[(1) - (2)].dn)->type == ELEMENT){ - set_doc_root(lxq_document, (yyvsp[(1) - (2)].dn)); - } - else{ - set_name((yyvsp[(2) - (2)].dn), "root"); - prepend_child((yyvsp[(2) - (2)].dn), (yyvsp[(1) - (2)].dn)); - set_doc_root(lxq_document, (yyvsp[(2) - (2)].dn)); - } - } - break; - - case 5: - -/* Line 1455 of yacc.c */ -#line 152 "parser.y" - { lxq_document = new_document((yyvsp[(1) - (2)].q)); set_doc_root(lxq_document, (yyvsp[(2) - (2)].dn));} - break; - - case 6: - -/* Line 1455 of yacc.c */ -#line 155 "parser.y" - { (yyval.dn) = new_element_node((yyvsp[(1) - (1)].string)); free((yyvsp[(1) - (1)].string));} - break; - - case 7: - -/* Line 1455 of yacc.c */ -#line 156 "parser.y" - { (yyval.dn) = new_element_node((yyvsp[(3) - (3)].string)); - free((yyvsp[(3) - (3)].string)); - char* old = (yyval.dn)->namespace; - (yyval.dn)->namespace = (yyvsp[(1) - (3)].string); - free((yyvsp[(1) - (3)].string)); - if(old) - free(old); - } - break; - - case 8: - -/* Line 1455 of yacc.c */ -#line 167 "parser.y" - { (yyval.q) = new_generic_list(1); add_element((yyval.q), (yyvsp[(1) - (1)].dn)); } - break; - - case 9: - -/* Line 1455 of yacc.c */ -#line 168 "parser.y" - { (yyval.q) = new_generic_list(1); add_element((yyval.q), (yyvsp[(1) - (1)].dn)); } - break; - - case 10: - -/* Line 1455 of yacc.c */ -#line 169 "parser.y" - { (yyval.q) = (yyvsp[(1) - (2)].q); add_element((yyval.q), (yyvsp[(2) - (2)].dn)); } - break; - - case 11: - -/* Line 1455 of yacc.c */ -#line 170 "parser.y" - { (yyval.q) = (yyvsp[(1) - (2)].q); add_element((yyval.q), (yyvsp[(2) - (2)].dn)); } - break; - - case 12: - -/* Line 1455 of yacc.c */ -#line 172 "parser.y" - { (yyval.dn) = (yyvsp[(4) - (5)].dn); set_name((yyval.dn), (yyvsp[(3) - (5)].string)); free((yyvsp[(3) - (5)].string)); } - break; - - case 13: - -/* Line 1455 of yacc.c */ -#line 174 "parser.y" - { - //if(strcmp(get_name($3), "xml") != 0){ - // yyerror("Declaration does not begin with xml"); - // exit(-1); - //} - (yyval.dn) = (yyvsp[(4) - (6)].dn); - char* old = set_name((yyval.dn), get_name((yyvsp[(3) - (6)].dn))); - if(old) - free(old); - old = set_namespace((yyval.dn), get_namespace((yyvsp[(3) - (6)].dn))); - if(old) - free(old); - destroy_dom_node((yyvsp[(3) - (6)].dn)); - } - break; - - case 14: - -/* Line 1455 of yacc.c */ -#line 190 "parser.y" - { - if(strcmp(get_name((yyvsp[(1) - (3)].dn)),get_name((yyvsp[(3) - (3)].dn))) != 0){ - char* error_line = alloc(char, 41 + strlen(get_name((yyvsp[(1) - (3)].dn))) + strlen(get_name((yyvsp[(3) - (3)].dn)))); - sprintf(error_line, "Start tag '%s' does not match end tag '%s' ", get_name((yyvsp[(1) - (3)].dn)), get_name((yyvsp[(3) - (3)].dn))); - yyerror(error_line); - free(error_line); - exit(1); - } - - (yyvsp[(1) - (3)].dn)->children = (yyvsp[(2) - (3)].dn)->children; - int i; - if((yyvsp[(1) - (3)].dn)->children){ - for(i = 0; i < (yyvsp[(1) - (3)].dn)->children->count; i++){ - ((dom_node*)get_element_at((yyvsp[(1) - (3)].dn)->children, i))->parent = (yyvsp[(1) - (3)].dn); - } - } - - (yyvsp[(2) - (3)].dn)->children = NULL; - destroy_dom_node((yyvsp[(2) - (3)].dn)); - - (yyval.dn) = (yyvsp[(1) - (3)].dn); - destroy_dom_node((yyvsp[(3) - (3)].dn)); - } - break; - - case 15: - -/* Line 1455 of yacc.c */ -#line 213 "parser.y" - { (yyval.dn) = (yyvsp[(3) - (5)].dn); - char* old = set_name((yyval.dn), get_name((yyvsp[(2) - (5)].dn))); - if(old) - free(old); - old = set_namespace((yyval.dn), get_namespace((yyvsp[(2) - (5)].dn))); - if(old) - free(old); - destroy_dom_node((yyvsp[(2) - (5)].dn)); - } - break; - - case 16: - -/* Line 1455 of yacc.c */ -#line 224 "parser.y" - { (yyval.dn) = new_element_node(NULL);} - break; - - case 17: - -/* Line 1455 of yacc.c */ -#line 225 "parser.y" - { (yyval.dn) = (yyvsp[(1) - (2)].dn); - append_child((yyval.dn), (yyvsp[(2) - (2)].dn)); - } - break; - - case 18: - -/* Line 1455 of yacc.c */ -#line 230 "parser.y" - {(yyval.dn) = new_cdata((yyvsp[(1) - (1)].string)); free((yyvsp[(1) - (1)].string));} - break; - - case 19: - -/* Line 1455 of yacc.c */ -#line 231 "parser.y" - {(yyval.dn) = new_text_node((yyvsp[(1) - (1)].string)); free((yyvsp[(1) - (1)].string));} - break; - - case 20: - -/* Line 1455 of yacc.c */ -#line 232 "parser.y" - {(yyval.dn) = (yyvsp[(1) - (1)].dn);} - break; - - case 21: - -/* Line 1455 of yacc.c */ -#line 236 "parser.y" - { (yyval.dn) = (yyvsp[(3) - (4)].dn); - char* old = set_name((yyval.dn), get_name((yyvsp[(2) - (4)].dn))); - if(old) - free(old); - old = set_namespace((yyval.dn), get_namespace((yyvsp[(2) - (4)].dn))); - if(old) - free(old); - destroy_dom_node((yyvsp[(2) - (4)].dn)); - } - break; - - case 22: - -/* Line 1455 of yacc.c */ -#line 247 "parser.y" - { (yyval.dn) = (yyvsp[(3) - (4)].dn);} - break; - - case 23: - -/* Line 1455 of yacc.c */ -#line 250 "parser.y" - { (yyval.dn) = new_element_node(NULL); } - break; - - case 24: - -/* Line 1455 of yacc.c */ -#line 251 "parser.y" - { - (yyval.dn) = (yyvsp[(1) - (2)].dn); - add_attribute((yyval.dn), (yyvsp[(2) - (2)].dn)); - } - break; - - case 25: - -/* Line 1455 of yacc.c */ -#line 257 "parser.y" - {(yyval.dn) = new_attribute(get_name((yyvsp[(1) - (3)].dn)), (yyvsp[(3) - (3)].string)); - free((yyvsp[(3) - (3)].string)); - char* old = set_namespace((yyval.dn), get_namespace((yyvsp[(1) - (3)].dn))); - if(old) - free(old); - destroy_dom_node((yyvsp[(1) - (3)].dn)); } - break; - - case 26: - -/* Line 1455 of yacc.c */ -#line 263 "parser.y" - { (yyval.dn) = new_attribute(get_name((yyvsp[(1) - (1)].dn)), NULL); - char* old = set_namespace((yyval.dn), get_namespace((yyvsp[(1) - (1)].dn))); - if(old) - free(old); - destroy_dom_node((yyvsp[(1) - (1)].dn)); - } - break; - - case 27: - -/* Line 1455 of yacc.c */ -#line 271 "parser.y" - { (yyval.dn) = new_element_node(NULL); } - break; - - case 28: - -/* Line 1455 of yacc.c */ -#line 272 "parser.y" - { (yyval.dn) = (yyvsp[(1) - (2)].dn); add_attribute((yyval.dn), new_attribute((yyvsp[(2) - (2)].string), NULL)); free((yyvsp[(2) - (2)].string));} - break; - - case 29: - -/* Line 1455 of yacc.c */ -#line 273 "parser.y" - { (yyval.dn) = (yyvsp[(1) - (2)].dn); append_child((yyval.dn), new_text_node((yyvsp[(2) - (2)].string))); free((yyvsp[(2) - (2)].string));} - break; - - case 30: - -/* Line 1455 of yacc.c */ -#line 276 "parser.y" - {(yyval.string) = (yyvsp[(2) - (3)].string);} - break; - - case 31: - -/* Line 1455 of yacc.c */ -#line 277 "parser.y" - {(yyval.string) = strdup("");} - break; - - case 32: - -/* Line 1455 of yacc.c */ -#line 278 "parser.y" - {(yyval.string) = (yyvsp[(2) - (3)].string);} - break; - - case 33: - -/* Line 1455 of yacc.c */ -#line 279 "parser.y" - {(yyval.string) = strdup("");} - break; - - case 34: - -/* Line 1455 of yacc.c */ -#line 283 "parser.y" - { lxq_selected_elements = (yyval.q) = new_generic_list_with_type(4); enqueue_with_type((yyval.q), (yyvsp[(1) - (1)].sel), LXQ_SELECTOR_TYPE); } - break; - - case 35: - -/* Line 1455 of yacc.c */ -#line 284 "parser.y" - { int* a = alloc(int, 1); - *a = (yyvsp[(2) - (3)].token); - (yyval.q) = (yyvsp[(1) - (3)].q); - enqueue_with_type((yyval.q), a, LXQ_RELATION_TYPE); - enqueue_with_type((yyval.q), (yyvsp[(3) - (3)].sel), LXQ_SELECTOR_TYPE); - } - break; - - case 36: - -/* Line 1455 of yacc.c */ -#line 290 "parser.y" - { (yyval.q) = (yyvsp[(1) - (3)].q); - enqueue_with_type((yyval.q), strdup((yyvsp[(2) - (3)].string)+1), CUSTOM_RELATION_OPERATOR); - free((yyvsp[(2) - (3)].string)); - enqueue_with_type((yyval.q), (yyvsp[(3) - (3)].sel), LXQ_SELECTOR_TYPE); - } - break; - - case 37: - -/* Line 1455 of yacc.c */ -#line 297 "parser.y" - { (yyval.sel) = new_selector((yyvsp[(1) - (3)].mv)); (yyval.sel)->attrs = (yyvsp[(2) - (3)].q); (yyval.sel)->filters = (yyvsp[(3) - (3)].q); } - break; - - case 38: - -/* Line 1455 of yacc.c */ -#line 300 "parser.y" - { (yyval.q) = new_stack(4); } - break; - - case 39: - -/* Line 1455 of yacc.c */ -#line 301 "parser.y" - { (yyval.q) = (yyvsp[(1) - (4)].q); push_stack((yyval.q), (yyvsp[(3) - (4)].attrselector)); } - break; - - case 40: - -/* Line 1455 of yacc.c */ -#line 302 "parser.y" - { (yyval.q) = (yyvsp[(1) - (3)].q); - push_stack((yyval.q), new_attr_value_selector( - new_match_value(lxq_parser_dot_query_operator, EQUAL_OP), - make_operators((yyvsp[(3) - (3)].string), WSSV_OP))); - } - break; - - case 41: - -/* Line 1455 of yacc.c */ -#line 307 "parser.y" - { (yyval.q) = (yyvsp[(1) - (3)].q); - push_stack((yyval.q), new_attr_value_selector( - new_match_value(lxq_parser_pound_query_operator, EQUAL_OP), - new_match_value_no_strdup((yyvsp[(3) - (3)].string), EQUAL_OP))); - } - break; - - case 42: - -/* Line 1455 of yacc.c */ -#line 314 "parser.y" - { (yyval.attrselector) = (yyvsp[(2) - (2)].attrselector); (yyval.attrselector)->name = new_match_value_no_strdup((yyvsp[(1) - (2)].string), EQUAL_OP); } - break; - - case 43: - -/* Line 1455 of yacc.c */ -#line 315 "parser.y" - { (yyval.attrselector) = (yyvsp[(2) - (2)].attrselector); (yyval.attrselector)->name = (yyvsp[(1) - (2)].mv); } - break; - - case 44: - -/* Line 1455 of yacc.c */ -#line 318 "parser.y" - { (yyval.mv) = NULL; } - break; - - case 45: - -/* Line 1455 of yacc.c */ -#line 319 "parser.y" - { (yyval.mv) = NULL; } - break; - - case 46: - -/* Line 1455 of yacc.c */ -#line 320 "parser.y" - { (yyval.mv) = new_match_value_no_strdup((yyvsp[(1) - (1)].string), EQUAL_OP);} - break; - - case 47: - -/* Line 1455 of yacc.c */ -#line 321 "parser.y" - { (yyval.mv) = (yyvsp[(1) - (1)].mv); } - break; - - case 48: - -/* Line 1455 of yacc.c */ -#line 324 "parser.y" - { (yyval.q) = new_stack(4); } - break; - - case 49: - -/* Line 1455 of yacc.c */ -#line 325 "parser.y" - { push_stack((yyval.q), (yyvsp[(3) - (3)].fa)); } - break; - - case 50: - -/* Line 1455 of yacc.c */ -#line 328 "parser.y" - { (yyval.fa) = new_filter((yyvsp[(1) - (1)].token)); } - break; - - case 51: - -/* Line 1455 of yacc.c */ -#line 329 "parser.y" - { (yyval.fa) = new_filter(SCUSTOM_FILTER); (yyval.fa)->name = (yyvsp[(1) - (1)].string); } - break; - - case 52: - -/* Line 1455 of yacc.c */ -#line 330 "parser.y" - { (yyval.fa) = new_filter(CUSTOM_FILTER); (yyval.fa)->name = (yyvsp[(1) - (4)].string); (yyval.fa)->args = (yyvsp[(3) - (4)].q); } - break; - - case 53: - -/* Line 1455 of yacc.c */ -#line 331 "parser.y" - { (yyval.fa) = new_filter((yyvsp[(1) - (4)].token)); (yyval.fa)->value.s = (yyvsp[(3) - (4)].s); } - break; - - case 54: - -/* Line 1455 of yacc.c */ -#line 332 "parser.y" - { (yyval.fa) = new_filter(NOT_FILTER); (yyval.fa)->value.selector = (yyvsp[(3) - (4)].q); } - break; - - case 55: - -/* Line 1455 of yacc.c */ -#line 335 "parser.y" - { (yyval.q) = new_stack(2); } - break; - - case 56: - -/* Line 1455 of yacc.c */ -#line 336 "parser.y" - { int* i = alloc(int, 1); *i = (yyvsp[(2) - (2)].digits); push_stack((yyvsp[(1) - (2)].q), i); (yyval.q) = (yyvsp[(1) - (2)].q);} - break; - - case 57: - -/* Line 1455 of yacc.c */ -#line 337 "parser.y" - { push_stack((yyvsp[(1) - (2)].q), (yyvsp[(2) - (2)].string)); (yyval.q) = (yyvsp[(1) - (2)].q);} - break; - - case 58: - -/* Line 1455 of yacc.c */ -#line 339 "parser.y" - { (yyval.token) = NTH_CHILD_FILTER; } - break; - - case 59: - -/* Line 1455 of yacc.c */ -#line 340 "parser.y" - { (yyval.token) = NTH_LAST_CHILD_FILTER; } - break; - - case 60: - -/* Line 1455 of yacc.c */ -#line 343 "parser.y" - { (yyval.token) = FIRST_CHILD_FILTER; } - break; - - case 61: - -/* Line 1455 of yacc.c */ -#line 344 "parser.y" - { (yyval.token) = LAST_CHILD_FILTER; } - break; - - case 62: - -/* Line 1455 of yacc.c */ -#line 345 "parser.y" - { (yyval.token) = ONLY_CHILD_FILTER; } - break; - - case 63: - -/* Line 1455 of yacc.c */ -#line 346 "parser.y" - { (yyval.token) = EMPTY_FILTER; } - break; - - case 64: - -/* Line 1455 of yacc.c */ -#line 349 "parser.y" - { (yyval.s) = (yyvsp[(1) - (1)].s); } - break; - - case 65: - -/* Line 1455 of yacc.c */ -#line 350 "parser.y" - { (yyval.s) = alloc(struct step_s, 1); (yyval.s)->multiplier = 0; (yyval.s)->offset = (yyvsp[(1) - (1)].digits);} - break; - - case 66: - -/* Line 1455 of yacc.c */ -#line 351 "parser.y" - { (yyval.s) = alloc(struct step_s, 1); (yyval.s)->multiplier = 2; (yyval.s)->offset = 0; } - break; - - case 67: - -/* Line 1455 of yacc.c */ -#line 352 "parser.y" - { (yyval.s) = alloc(struct step_s, 1); (yyval.s)->multiplier = 2; (yyval.s)->offset = 1; } - break; - - case 68: - -/* Line 1455 of yacc.c */ -#line 355 "parser.y" - { (yyval.s) = alloc(struct step_s, 1); (yyval.s)->multiplier = 1; (yyval.s)->offset = 0; } - break; - - case 69: - -/* Line 1455 of yacc.c */ -#line 356 "parser.y" - { (yyval.s) = alloc(struct step_s, 1); (yyval.s)->multiplier = (yyvsp[(1) - (2)].digits); (yyval.s)->offset = 0; } - break; - - case 70: - -/* Line 1455 of yacc.c */ -#line 357 "parser.y" - { (yyval.s) = alloc(struct step_s, 1); (yyval.s)->multiplier = 1; (yyval.s)->offset = (yyvsp[(2) - (2)].digits); } - break; - - case 71: - -/* Line 1455 of yacc.c */ -#line 358 "parser.y" - { (yyval.s) = alloc(struct step_s, 1); (yyval.s)->multiplier = (yyvsp[(1) - (3)].digits); (yyval.s)->offset = (yyvsp[(3) - (3)].digits); } - break; - - case 72: - -/* Line 1455 of yacc.c */ -#line 361 "parser.y" - { (yyval.digits) = (yyvsp[(2) - (2)].digits); } - break; - - case 73: - -/* Line 1455 of yacc.c */ -#line 362 "parser.y" - { (yyval.digits) = -(yyvsp[(2) - (2)].digits); } - break; - - case 74: - -/* Line 1455 of yacc.c */ -#line 363 "parser.y" - { (yyval.digits) = (yyvsp[(1) - (1)].digits); } - break; - - case 75: - -/* Line 1455 of yacc.c */ -#line 366 "parser.y" - { (yyval.token) = '>'; } - break; - - case 76: - -/* Line 1455 of yacc.c */ -#line 367 "parser.y" - { (yyval.token) = '~'; } - break; - - case 77: - -/* Line 1455 of yacc.c */ -#line 368 "parser.y" - { (yyval.token) = '+'; } - break; - - case 78: - -/* Line 1455 of yacc.c */ -#line 369 "parser.y" - { (yyval.token) = ','; } - break; - - case 79: - -/* Line 1455 of yacc.c */ -#line 370 "parser.y" - { (yyval.token) = SPACE; } - break; - - case 80: - -/* Line 1455 of yacc.c */ -#line 373 "parser.y" - { (yyval.attrselector) = new_attr_value_selector(NULL, NULL); } - break; - - case 81: - -/* Line 1455 of yacc.c */ -#line 374 "parser.y" - { (yyval.attrselector) = new_attr_value_selector(NULL, make_operators((yyvsp[(3) - (4)].string), (yyvsp[(1) - (4)].token))); } - break; - - case 82: - -/* Line 1455 of yacc.c */ -#line 375 "parser.y" - { (yyval.attrselector) = new_attr_value_selector(NULL, make_operators((yyvsp[(3) - (4)].string), (yyvsp[(1) - (4)].token))); } - break; - - case 83: - -/* Line 1455 of yacc.c */ -#line 376 "parser.y" - { (yyval.attrselector) = new_attr_value_selector(NULL, (yyvsp[(2) - (2)].mv)); } - break; - - case 84: - -/* Line 1455 of yacc.c */ -#line 379 "parser.y" - { char* text = (char*)dequeue((yyvsp[(2) - (3)].q)); - while((yyvsp[(2) - (3)].q)->count > 0){ - char* r = (char*)dequeue((yyvsp[(2) - (3)].q)); - text = (char*)realloc(text, strlen(text) + strlen(r)); - strcat(text, r); - free(r); - } - (yyval.mv) = new_match_value_no_strdup(text, (yyvsp[(3) - (3)].token)); - destroy_generic_list((yyvsp[(2) - (3)].q)); - } - break; - - case 85: - -/* Line 1455 of yacc.c */ -#line 390 "parser.y" - { (yyval.q) = new_queue(4); enqueue((yyval.q), (yyvsp[(1) - (1)].string)); } - break; - - case 86: - -/* Line 1455 of yacc.c */ -#line 391 "parser.y" - { (yyval.q) = (yyvsp[(1) - (2)].q); enqueue((yyval.q), (yyvsp[(2) - (2)].string)); } - break; - - case 87: - -/* Line 1455 of yacc.c */ -#line 394 "parser.y" - { (yyval.token) = REGEX_OP; } - break; - - case 88: - -/* Line 1455 of yacc.c */ -#line 395 "parser.y" - { (yyval.token) = REGEXI_OP; } - break; - - case 89: - -/* Line 1455 of yacc.c */ -#line 398 "parser.y" - { (yyval.token) = EQUAL_OP; } - break; - - case 90: - -/* Line 1455 of yacc.c */ -#line 399 "parser.y" - { (yyval.token) = WSSV_OP; } - break; - - case 91: - -/* Line 1455 of yacc.c */ -#line 400 "parser.y" - { (yyval.token) = STARTSW_OP; } - break; - - case 92: - -/* Line 1455 of yacc.c */ -#line 401 "parser.y" - { (yyval.token) = ENDSW_OP; } - break; - - case 93: - -/* Line 1455 of yacc.c */ -#line 402 "parser.y" - { (yyval.token) = CONTAINS_OP; } - break; - - case 94: - -/* Line 1455 of yacc.c */ -#line 403 "parser.y" - { (yyval.token) = DSV_OP; } - break; - - case 95: - -/* Line 1455 of yacc.c */ -#line 404 "parser.y" - { (yyval.token) = NOTEQUAL_OP; } - break; - - - -/* Line 1455 of yacc.c */ -#line 2376 "y.tab.c" - default: break; - } - YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); - - YYPOPSTACK (yylen); - yylen = 0; - YY_STACK_PRINT (yyss, yyssp); - - *++yyvsp = yyval; - - /* Now `shift' the result of the reduction. Determine what state - that goes to, based on the state we popped back to and the rule - number reduced by. */ - - yyn = yyr1[yyn]; - - yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; - if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) - yystate = yytable[yystate]; - else - yystate = yydefgoto[yyn - YYNTOKENS]; - - goto yynewstate; - - -/*------------------------------------. -| yyerrlab -- here on detecting error | -`------------------------------------*/ -yyerrlab: - /* If not already recovering from an error, report this error. */ - if (!yyerrstatus) - { - ++yynerrs; -#if ! YYERROR_VERBOSE - yyerror (YY_("syntax error")); -#else - { - YYSIZE_T yysize = yysyntax_error (0, yystate, yychar); - if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM) - { - YYSIZE_T yyalloc = 2 * yysize; - if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM)) - yyalloc = YYSTACK_ALLOC_MAXIMUM; - if (yymsg != yymsgbuf) - YYSTACK_FREE (yymsg); - yymsg = (char *) YYSTACK_ALLOC (yyalloc); - if (yymsg) - yymsg_alloc = yyalloc; - else - { - yymsg = yymsgbuf; - yymsg_alloc = sizeof yymsgbuf; - } - } - - if (0 < yysize && yysize <= yymsg_alloc) - { - (void) yysyntax_error (yymsg, yystate, yychar); - yyerror (yymsg); - } - else - { - yyerror (YY_("syntax error")); - if (yysize != 0) - goto yyexhaustedlab; - } - } -#endif - } - - - - if (yyerrstatus == 3) - { - /* If just tried and failed to reuse lookahead token after an - error, discard it. */ - - if (yychar <= YYEOF) - { - /* Return failure if at end of input. */ - if (yychar == YYEOF) - YYABORT; - } - else - { - yydestruct ("Error: discarding", - yytoken, &yylval); - yychar = YYEMPTY; - } - } - - /* Else will try to reuse lookahead token after shifting the error - token. */ - goto yyerrlab1; - - -/*---------------------------------------------------. -| yyerrorlab -- error raised explicitly by YYERROR. | -`---------------------------------------------------*/ -yyerrorlab: - - /* Pacify compilers like GCC when the user code never invokes - YYERROR and the label yyerrorlab therefore never appears in user - code. */ - if (/*CONSTCOND*/ 0) - goto yyerrorlab; - - /* Do not reclaim the symbols of the rule which action triggered - this YYERROR. */ - YYPOPSTACK (yylen); - yylen = 0; - YY_STACK_PRINT (yyss, yyssp); - yystate = *yyssp; - goto yyerrlab1; - - -/*-------------------------------------------------------------. -| yyerrlab1 -- common code for both syntax error and YYERROR. | -`-------------------------------------------------------------*/ -yyerrlab1: - yyerrstatus = 3; /* Each real token shifted decrements this. */ - - for (;;) - { - yyn = yypact[yystate]; - if (yyn != YYPACT_NINF) - { - yyn += YYTERROR; - if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) - { - yyn = yytable[yyn]; - if (0 < yyn) - break; - } - } - - /* Pop the current state because it cannot handle the error token. */ - if (yyssp == yyss) - YYABORT; - - - yydestruct ("Error: popping", - yystos[yystate], yyvsp); - YYPOPSTACK (1); - yystate = *yyssp; - YY_STACK_PRINT (yyss, yyssp); - } - - *++yyvsp = yylval; - - - /* Shift the error token. */ - YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); - - yystate = yyn; - goto yynewstate; - - -/*-------------------------------------. -| yyacceptlab -- YYACCEPT comes here. | -`-------------------------------------*/ -yyacceptlab: - yyresult = 0; - goto yyreturn; - -/*-----------------------------------. -| yyabortlab -- YYABORT comes here. | -`-----------------------------------*/ -yyabortlab: - yyresult = 1; - goto yyreturn; - -#if !defined(yyoverflow) || YYERROR_VERBOSE -/*-------------------------------------------------. -| yyexhaustedlab -- memory exhaustion comes here. | -`-------------------------------------------------*/ -yyexhaustedlab: - yyerror (YY_("memory exhausted")); - yyresult = 2; - /* Fall through. */ -#endif - -yyreturn: - if (yychar != YYEMPTY) - yydestruct ("Cleanup: discarding lookahead", - yytoken, &yylval); - /* Do not reclaim the symbols of the rule which action triggered - this YYABORT or YYACCEPT. */ - YYPOPSTACK (yylen); - YY_STACK_PRINT (yyss, yyssp); - while (yyssp != yyss) - { - yydestruct ("Cleanup: popping", - yystos[*yyssp], yyvsp); - YYPOPSTACK (1); - } -#ifndef yyoverflow - if (yyss != yyssa) - YYSTACK_FREE (yyss); -#endif -#if YYERROR_VERBOSE - if (yymsg != yymsgbuf) - YYSTACK_FREE (yymsg); -#endif - /* Make sure YYID is used. */ - return YYID (yyresult); -} - - - diff --git a/profiling/Makefile b/profiling/Makefile deleted file mode 100644 index 62e30cc..0000000 --- a/profiling/Makefile +++ /dev/null @@ -1,3 +0,0 @@ -dom_size: - gcc -o dom_size dom_size.c ../libxmlquery.so - diff --git a/profiling/com_remove_dups_e_quick_sort.gprof b/profiling/com_remove_dups_e_quick_sort.gprof deleted file mode 100644 index b28386e..0000000 --- a/profiling/com_remove_dups_e_quick_sort.gprof +++ /dev/null @@ -1,741 +0,0 @@ -Flat profile: - -Each sample counts as 0.01 seconds. - % cumulative self self total - time seconds seconds calls s/call s/call name - 94.49 17.50 17.50 1 17.50 17.50 __quicksort_generic_list_aux - 2.48 17.96 0.46 129625 0.00 0.00 merge_lists - 0.65 18.08 0.12 2303395 0.00 0.00 yylex - 0.59 18.19 0.11 1788810 0.00 0.00 append_element - 0.59 18.30 0.11 894017 0.00 0.00 remove_element_at - 0.49 18.39 0.09 1654457 0.00 0.00 get_element_and_type_at - 0.11 18.41 0.02 513002 0.00 0.00 destroy_dom_node - 0.11 18.43 0.02 390453 0.00 0.00 destroy_generic_list - 0.11 18.45 0.02 1 0.02 0.51 get_descendants - 0.11 18.47 0.02 1 0.02 17.55 remove_duplicates - 0.05 18.48 0.01 2513880 0.00 0.00 append_bytes_to_buffer - 0.05 18.49 0.01 628470 0.00 0.00 new_byte_buffer - 0.05 18.50 0.01 252176 0.00 0.00 new_tree_iterator - 0.05 18.51 0.01 251388 0.00 0.00 __dom_node_to_xml - 0.05 18.52 0.01 2 0.01 0.14 yyparse - 0.00 18.52 0.00 2569718 0.00 0.00 __alloc - 0.00 18.52 0.00 2560282 0.00 0.00 __alloc - 0.00 18.52 0.00 2388186 0.00 0.00 append_string_to_buffer - 0.00 18.52 0.00 1654457 0.00 0.00 get_element_at - 0.00 18.52 0.00 1275029 0.00 0.00 add_element - 0.00 18.52 0.00 1256940 0.00 0.00 __alloc - 0.00 18.52 0.00 894016 0.00 0.00 pop_stack - 0.00 18.52 0.00 894016 0.00 0.00 push_stack - 0.00 18.52 0.00 772251 0.00 0.00 new_element_node - 0.00 18.52 0.00 763602 0.00 0.00 key - 0.00 18.52 0.00 757313 0.00 0.00 tree_iterator_has_next - 0.00 18.52 0.00 642626 0.00 0.00 get_name - 0.00 18.52 0.00 632407 0.00 0.00 __alloc - 0.00 18.52 0.00 513780 0.00 0.00 append_child - 0.00 18.52 0.00 505137 0.00 0.00 tree_iterator_next - 0.00 18.52 0.00 502776 0.00 0.00 append_buffer_to_buffer - 0.00 18.52 0.00 502776 0.00 0.00 destroy_byte_buffer - 0.00 18.52 0.00 390454 0.00 0.00 new_generic_list - 0.00 18.52 0.00 383375 0.00 0.00 get_namespace - 0.00 18.52 0.00 383375 0.00 0.00 set_namespace - 0.00 18.52 0.00 381801 0.00 0.00 compare - 0.00 18.52 0.00 253749 0.00 0.00 add_attribute - 0.00 18.52 0.00 253749 0.00 0.00 new_attribute - 0.00 18.52 0.00 253749 0.00 0.00 new_rbtree_node - 0.00 18.52 0.00 253749 0.00 0.00 rb_tree_insert - 0.00 18.52 0.00 253749 0.00 0.00 rb_tree_insert_fixup - 0.00 18.52 0.00 252176 0.00 0.00 destroy_iterator - 0.00 18.52 0.00 251388 0.00 0.00 __attribute_to_xml - 0.00 18.52 0.00 129626 0.00 0.00 set_name - 0.00 18.52 0.00 129625 0.00 0.00 append_children - 0.00 18.52 0.00 129625 0.00 0.00 get_children - 0.00 18.52 0.00 127266 0.00 0.00 new_text_node - 0.00 18.52 0.00 126482 0.00 0.00 __destroy_rbtree - 0.00 18.52 0.00 126482 0.00 0.00 destroy_rbtree - 0.00 18.52 0.00 126482 0.00 0.00 new_rbtree - 0.00 18.52 0.00 125694 0.00 0.00 __node_list_to_xml - 0.00 18.52 0.00 125694 0.00 0.00 node_to_string - 0.00 18.52 0.00 13612 0.00 0.00 refactor_generic_list - 0.00 18.52 0.00 4 0.00 0.00 new_stack - 0.00 18.52 0.00 4 0.00 0.00 yy_load_buffer_state - 0.00 18.52 0.00 4 0.00 0.00 yyalloc - 0.00 18.52 0.00 4 0.00 0.00 yydestruct - 0.00 18.52 0.00 4 0.00 0.00 yyfree - 0.00 18.52 0.00 3 0.00 0.00 yy_get_next_buffer - 0.00 18.52 0.00 2 0.00 0.00 __alloc - 0.00 18.52 0.00 2 0.00 0.00 yy_delete_buffer - 0.00 18.52 0.00 2 0.00 0.00 yy_init_globals - 0.00 18.52 0.00 2 0.00 0.00 yy_scan_buffer - 0.00 18.52 0.00 2 0.00 0.00 yy_switch_to_buffer - 0.00 18.52 0.00 2 0.00 0.00 yyensure_buffer_stack - 0.00 18.52 0.00 2 0.00 0.00 yylex_destroy - 0.00 18.52 0.00 2 0.00 0.00 yywrap - 0.00 18.52 0.00 1 0.00 0.00 __alloc - 0.00 18.52 0.00 1 0.00 0.00 __alloc - 0.00 18.52 0.00 1 0.00 17.50 __quicksort_generic_list - 0.00 18.52 0.00 1 0.00 0.00 add_element_with_type - 0.00 18.52 0.00 1 0.00 0.00 dequeue - 0.00 18.52 0.00 1 0.00 0.00 destroy_dom_tree - 0.00 18.52 0.00 1 0.00 0.00 destroy_selector - 0.00 18.52 0.00 1 0.00 0.00 enqueue_with_type - 0.00 18.52 0.00 1 0.00 0.02 filter_nodes_by_name - 0.00 18.52 0.00 1 0.00 0.02 filter_nodes_by_selector - 0.00 18.52 0.00 1 0.00 0.00 new_document - 0.00 18.52 0.00 1 0.00 0.00 new_queue - 0.00 18.52 0.00 1 0.00 0.00 new_selector - 0.00 18.52 0.00 1 0.00 0.25 parse_dom - 0.00 18.52 0.00 1 0.00 0.14 parse_file - 0.00 18.52 0.00 1 0.00 0.14 parse_query - 0.00 18.52 0.00 1 0.00 0.14 parse_string - 0.00 18.52 0.00 1 0.00 0.00 peek_queue_type - 0.00 18.52 0.00 1 0.00 18.22 query - 0.00 18.52 0.00 1 0.00 0.00 rebase_generic_list - 0.00 18.52 0.00 1 0.00 0.00 set_doc_root - 0.00 18.52 0.00 1 0.00 0.00 set_xml_declaration - 0.00 18.52 0.00 1 0.00 0.00 yy_get_previous_state - - % the percentage of the total running time of the -time program used by this function. - -cumulative a running sum of the number of seconds accounted - seconds for by this function and those listed above it. - - self the number of seconds accounted for by this -seconds function alone. This is the major sort for this - listing. - -calls the number of times this function was invoked, if - this function is profiled, else blank. - - self the average number of milliseconds spent in this -ms/call function per call, if this function is profiled, - else blank. - - total the average number of milliseconds spent in this -ms/call function and its descendents per call, if this - function is profiled, else blank. - -name the name of the function. This is the minor sort - for this listing. The index shows the location of - the function in the gprof listing. If the index is - in parenthesis it shows where it would appear in - the gprof listing if it were to be printed. - - Call graph (explanation follows) - - -granularity: each sample hit covers 4 byte(s) for 0.05% of 18.52 seconds - -index % time self children called name - -[1] 100.0 0.00 18.52 main [1] - 0.00 18.22 1/1 query [2] - 0.00 0.25 1/1 parse_dom [9] - 0.00 0.04 125694/125694 node_to_string [22] - 0.00 0.01 125694/1654457 get_element_at [18] - 0.00 0.00 1/1 destroy_dom_tree [36] ------------------------------------------------ - 0.00 18.22 1/1 main [1] -[2] 98.4 0.00 18.22 1 query [2] - 0.02 17.53 1/1 remove_duplicates [3] - 0.02 0.49 1/1 get_descendants [6] - 0.00 0.14 1/1 parse_query [11] - 0.00 0.02 1/1 filter_nodes_by_selector [27] - 0.00 0.00 1/129625 merge_lists [7] - 0.00 0.00 1/1 dequeue [37] - 0.00 0.00 1/1 destroy_selector [38] - 0.00 0.00 1/1275029 add_element [19] - 0.00 0.00 1/390453 destroy_generic_list [29] - 0.00 0.00 1/390454 new_generic_list [48] - 0.00 0.00 1/1 peek_queue_type [80] ------------------------------------------------ - 0.02 17.53 1/1 query [2] -[3] 94.8 0.02 17.53 1 remove_duplicates [3] - 0.00 17.50 1/1 __quicksort_generic_list [4] - 0.00 0.02 377080/1654457 get_element_at [18] - 0.00 0.01 125694/1275029 add_element [19] - 0.00 0.00 1/390453 destroy_generic_list [29] - 0.00 0.00 1/390454 new_generic_list [48] - 0.00 0.00 1/1 rebase_generic_list [81] ------------------------------------------------ - 0.00 17.50 1/1 remove_duplicates [3] -[4] 94.5 0.00 17.50 1 __quicksort_generic_list [4] - 17.50 0.00 1/1 __quicksort_generic_list_aux [5] ------------------------------------------------ - 200662 __quicksort_generic_list_aux [5] - 17.50 0.00 1/1 __quicksort_generic_list [4] -[5] 94.5 17.50 0.00 1+200662 __quicksort_generic_list_aux [5] - 200662 __quicksort_generic_list_aux [5] ------------------------------------------------ - 129624 get_descendants [6] - 0.02 0.49 1/1 query [2] -[6] 2.7 0.02 0.49 1+129624 get_descendants [6] - 0.46 0.01 129624/129625 merge_lists [7] - 0.00 0.01 256890/1654457 get_element_at [18] - 0.00 0.01 129624/1275029 add_element [19] - 0.00 0.00 129625/129625 get_children [59] - 0.00 0.00 129625/390454 new_generic_list [48] - 129624 get_descendants [6] ------------------------------------------------ - 0.00 0.00 1/129625 query [2] - 0.46 0.01 129624/129625 get_descendants [6] -[7] 2.5 0.46 0.01 129625 merge_lists [7] - 0.01 0.00 131196/390453 destroy_generic_list [29] - 0.00 0.00 1571/390454 new_generic_list [48] ------------------------------------------------ - 0.01 0.14 1/2 parse_file [12] - 0.01 0.14 1/2 parse_string [13] -[8] 1.5 0.01 0.27 2 yyparse [8] - 0.12 0.05 2303395/2303395 yylex [10] - 0.02 0.03 513000/513002 destroy_dom_node [21] - 0.00 0.03 129625/129625 append_children [26] - 0.00 0.02 256890/513780 append_child [25] - 0.01 0.00 129625/390453 destroy_generic_list [29] - 0.00 0.00 1/1 enqueue_with_type [40] - 0.00 0.00 772251/772251 new_element_node [41] - 0.00 0.00 642626/642626 get_name [44] - 0.00 0.00 383375/383375 get_namespace [49] - 0.00 0.00 383375/383375 set_namespace [50] - 0.00 0.00 253749/253749 add_attribute [52] - 0.00 0.00 253749/253749 new_attribute [53] - 0.00 0.00 129626/129626 set_name [58] - 0.00 0.00 127266/127266 new_text_node [60] - 0.00 0.00 4/4 yydestruct [67] - 0.00 0.00 2/4 new_stack [64] - 0.00 0.00 1/1 new_document [77] - 0.00 0.00 1/1 set_doc_root [82] - 0.00 0.00 1/1 new_queue [78] - 0.00 0.00 1/1 new_selector [79] ------------------------------------------------ - 0.00 0.25 1/1 main [1] -[9] 1.4 0.00 0.25 1 parse_dom [9] - 0.00 0.14 1/1 parse_file [12] - 0.00 0.11 894015/894016 pop_stack [16] - 0.00 0.00 1/390453 destroy_generic_list [29] - 0.00 0.00 1/4 new_stack [64] - 0.00 0.00 1/2 __alloc [178] ------------------------------------------------ - 0.12 0.05 2303395/2303395 yyparse [8] -[10] 0.9 0.12 0.05 2303395 yylex [10] - 0.00 0.05 894016/894016 push_stack [20] - 0.00 0.00 3/3 yy_get_next_buffer [69] - 0.00 0.00 2/4 yy_load_buffer_state [65] - 0.00 0.00 2/2 yywrap [76] - 0.00 0.00 1/1 yy_get_previous_state [84] ------------------------------------------------ - 0.00 0.14 1/1 query [2] -[11] 0.8 0.00 0.14 1 parse_query [11] - 0.00 0.14 1/1 parse_string [13] - 0.00 0.00 1/894016 pop_stack [16] - 0.00 0.00 1/390453 destroy_generic_list [29] - 0.00 0.00 1/4 new_stack [64] - 0.00 0.00 1/2 __alloc [178] ------------------------------------------------ - 0.00 0.14 1/1 parse_dom [9] -[12] 0.8 0.00 0.14 1 parse_file [12] - 0.01 0.14 1/2 yyparse [8] - 0.00 0.00 1/2 yy_scan_buffer [72] - 0.00 0.00 1/2 yy_delete_buffer [70] - 0.00 0.00 1/2 yylex_destroy [75] ------------------------------------------------ - 0.00 0.14 1/1 parse_query [11] -[13] 0.8 0.00 0.14 1 parse_string [13] - 0.01 0.14 1/2 yyparse [8] - 0.00 0.00 1/1 __alloc [179] - 0.00 0.00 1/2 yy_scan_buffer [72] - 0.00 0.00 1/2 yylex_destroy [75] - 0.00 0.00 1/2 yy_delete_buffer [70] ------------------------------------------------ - 0.00 0.00 1/894017 dequeue [37] - 0.11 0.00 894016/894017 pop_stack [16] -[14] 0.6 0.11 0.00 894017 remove_element_at [14] ------------------------------------------------ - 0.00 0.00 1/1788810 add_element_with_type [39] - 0.03 0.00 513780/1788810 append_child [25] - 0.08 0.00 1275029/1788810 add_element [19] -[15] 0.6 0.11 0.00 1788810 append_element [15] - 0.00 0.00 1788810/2569718 __alloc [173] - 0.00 0.00 13612/13612 refactor_generic_list [63] ------------------------------------------------ - 0.00 0.00 1/894016 parse_query [11] - 0.00 0.11 894015/894016 parse_dom [9] -[16] 0.6 0.00 0.11 894016 pop_stack [16] - 0.11 0.00 894016/894017 remove_element_at [14] ------------------------------------------------ - 0.09 0.00 1654457/1654457 get_element_at [18] -[17] 0.5 0.09 0.00 1654457 get_element_and_type_at [17] ------------------------------------------------ - 0.00 0.01 125694/1654457 __node_list_to_xml [35] - 0.00 0.01 125694/1654457 main [1] - 0.00 0.01 255319/1654457 filter_nodes_by_name [28] - 0.00 0.01 256890/1654457 append_children [26] - 0.00 0.01 256890/1654457 get_descendants [6] - 0.00 0.01 256890/1654457 destroy_dom_node [21] - 0.00 0.02 377080/1654457 remove_duplicates [3] -[18] 0.5 0.00 0.09 1654457 get_element_at [18] - 0.09 0.00 1654457/1654457 get_element_and_type_at [17] ------------------------------------------------ - 0.00 0.00 1/1275029 query [2] - 0.00 0.01 125694/1275029 remove_duplicates [3] - 0.00 0.01 125694/1275029 filter_nodes_by_name [28] - 0.00 0.01 129624/1275029 get_descendants [6] - 0.00 0.05 894016/1275029 push_stack [20] -[19] 0.4 0.00 0.08 1275029 add_element [19] - 0.08 0.00 1275029/1788810 append_element [15] ------------------------------------------------ - 0.00 0.05 894016/894016 yylex [10] -[20] 0.3 0.00 0.05 894016 push_stack [20] - 0.00 0.05 894016/1275029 add_element [19] ------------------------------------------------ - 510639 destroy_dom_node [21] - 0.00 0.00 2/513002 destroy_dom_tree [36] - 0.02 0.03 513000/513002 yyparse [8] -[21] 0.2 0.02 0.03 513002+510639 destroy_dom_node [21] - 0.00 0.01 256890/1654457 get_element_at [18] - 0.01 0.00 129625/390453 destroy_generic_list [29] - 0.01 0.00 126482/252176 new_tree_iterator [32] - 0.00 0.00 380231/757313 tree_iterator_has_next [43] - 0.00 0.00 253749/505137 tree_iterator_next [45] - 0.00 0.00 126482/252176 destroy_iterator [57] - 0.00 0.00 126482/126482 destroy_rbtree [61] - 510639 destroy_dom_node [21] ------------------------------------------------ - 0.00 0.04 125694/125694 main [1] -[22] 0.2 0.00 0.04 125694 node_to_string [22] - 0.01 0.03 125694/125694 __dom_node_to_xml [24] - 0.00 0.00 125694/2513880 append_bytes_to_buffer [30] ------------------------------------------------ -[23] 0.2 0.01 0.03 125694+251388 [23] - 0.01 0.02 251388 __dom_node_to_xml [24] - 0.00 0.01 125694 __node_list_to_xml [35] ------------------------------------------------ - 125694 __node_list_to_xml [35] - 0.01 0.03 125694/125694 node_to_string [22] -[24] 0.2 0.01 0.02 251388 __dom_node_to_xml [24] - 0.00 0.01 251388/251388 __attribute_to_xml [34] - 0.00 0.00 125694/252176 new_tree_iterator [32] - 0.00 0.00 1131246/2388186 append_string_to_buffer [33] - 0.00 0.00 251388/628470 new_byte_buffer [31] - 0.00 0.00 377082/502776 append_buffer_to_buffer [46] - 0.00 0.00 377082/502776 destroy_byte_buffer [47] - 0.00 0.00 377082/757313 tree_iterator_has_next [43] - 0.00 0.00 251388/505137 tree_iterator_next [45] - 0.00 0.00 125694/252176 destroy_iterator [57] - 125694 __node_list_to_xml [35] ------------------------------------------------ - 0.00 0.02 256890/513780 yyparse [8] - 0.00 0.02 256890/513780 append_children [26] -[25] 0.2 0.00 0.03 513780 append_child [25] - 0.03 0.00 513780/1788810 append_element [15] - 0.00 0.00 129625/390454 new_generic_list [48] ------------------------------------------------ - 0.00 0.03 129625/129625 yyparse [8] -[26] 0.2 0.00 0.03 129625 append_children [26] - 0.00 0.02 256890/513780 append_child [25] - 0.00 0.01 256890/1654457 get_element_at [18] - 0.00 0.00 129625/390454 new_generic_list [48] ------------------------------------------------ - 0.00 0.02 1/1 query [2] -[27] 0.1 0.00 0.02 1 filter_nodes_by_selector [27] - 0.00 0.02 1/1 filter_nodes_by_name [28] - 0.00 0.00 1/390453 destroy_generic_list [29] ------------------------------------------------ - 0.00 0.02 1/1 filter_nodes_by_selector [27] -[28] 0.1 0.00 0.02 1 filter_nodes_by_name [28] - 0.00 0.01 255319/1654457 get_element_at [18] - 0.00 0.01 125694/1275029 add_element [19] - 0.00 0.00 1/390454 new_generic_list [48] ------------------------------------------------ - 0.00 0.00 1/390453 parse_dom [9] - 0.00 0.00 1/390453 parse_query [11] - 0.00 0.00 1/390453 remove_duplicates [3] - 0.00 0.00 1/390453 filter_nodes_by_selector [27] - 0.00 0.00 1/390453 query [2] - 0.00 0.00 2/390453 destroy_selector [38] - 0.01 0.00 129625/390453 yyparse [8] - 0.01 0.00 129625/390453 destroy_dom_node [21] - 0.01 0.00 131196/390453 merge_lists [7] -[29] 0.1 0.02 0.00 390453 destroy_generic_list [29] ------------------------------------------------ - 0.00 0.00 125694/2513880 node_to_string [22] - 0.01 0.00 2388186/2513880 append_string_to_buffer [33] -[30] 0.1 0.01 0.00 2513880 append_bytes_to_buffer [30] ------------------------------------------------ - 0.00 0.00 125694/628470 __node_list_to_xml [35] - 0.00 0.00 251388/628470 __dom_node_to_xml [24] - 0.00 0.00 251388/628470 __attribute_to_xml [34] -[31] 0.1 0.01 0.00 628470 new_byte_buffer [31] - 0.00 0.00 1256940/1256940 __alloc [175] ------------------------------------------------ - 0.00 0.00 125694/252176 __dom_node_to_xml [24] - 0.01 0.00 126482/252176 destroy_dom_node [21] -[32] 0.1 0.01 0.00 252176 new_tree_iterator [32] - 0.00 0.00 252176/632407 __alloc [176] ------------------------------------------------ - 0.00 0.00 1131246/2388186 __dom_node_to_xml [24] - 0.00 0.01 1256940/2388186 __attribute_to_xml [34] -[33] 0.1 0.00 0.01 2388186 append_string_to_buffer [33] - 0.01 0.00 2388186/2513880 append_bytes_to_buffer [30] ------------------------------------------------ - 0.00 0.01 251388/251388 __dom_node_to_xml [24] -[34] 0.0 0.00 0.01 251388 __attribute_to_xml [34] - 0.00 0.01 1256940/2388186 append_string_to_buffer [33] - 0.00 0.00 251388/628470 new_byte_buffer [31] ------------------------------------------------ - 125694 __dom_node_to_xml [24] -[35] 0.0 0.00 0.01 125694 __node_list_to_xml [35] - 0.00 0.01 125694/1654457 get_element_at [18] - 0.00 0.00 125694/628470 new_byte_buffer [31] - 0.00 0.00 125694/502776 append_buffer_to_buffer [46] - 0.00 0.00 125694/502776 destroy_byte_buffer [47] - 125694 __dom_node_to_xml [24] ------------------------------------------------ - 0.00 0.00 1/1 main [1] -[36] 0.0 0.00 0.00 1 destroy_dom_tree [36] - 0.00 0.00 2/513002 destroy_dom_node [21] ------------------------------------------------ - 0.00 0.00 1/1 query [2] -[37] 0.0 0.00 0.00 1 dequeue [37] - 0.00 0.00 1/894017 remove_element_at [14] ------------------------------------------------ - 0.00 0.00 1/1 query [2] -[38] 0.0 0.00 0.00 1 destroy_selector [38] - 0.00 0.00 2/390453 destroy_generic_list [29] ------------------------------------------------ - 0.00 0.00 1/1 enqueue_with_type [40] -[39] 0.0 0.00 0.00 1 add_element_with_type [39] - 0.00 0.00 1/1788810 append_element [15] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [8] -[40] 0.0 0.00 0.00 1 enqueue_with_type [40] - 0.00 0.00 1/1 add_element_with_type [39] ------------------------------------------------ - 0.00 0.00 772251/772251 yyparse [8] -[41] 0.0 0.00 0.00 772251 new_element_node [41] - 0.00 0.00 1544502/2560282 __alloc [174] ------------------------------------------------ - 0.00 0.00 763602/763602 rb_tree_insert [55] -[42] 0.0 0.00 0.00 763602 key [42] ------------------------------------------------ - 0.00 0.00 377082/757313 __dom_node_to_xml [24] - 0.00 0.00 380231/757313 destroy_dom_node [21] -[43] 0.0 0.00 0.00 757313 tree_iterator_has_next [43] ------------------------------------------------ - 0.00 0.00 642626/642626 yyparse [8] -[44] 0.0 0.00 0.00 642626 get_name [44] ------------------------------------------------ - 0.00 0.00 251388/505137 __dom_node_to_xml [24] - 0.00 0.00 253749/505137 destroy_dom_node [21] -[45] 0.0 0.00 0.00 505137 tree_iterator_next [45] ------------------------------------------------ - 0.00 0.00 125694/502776 __node_list_to_xml [35] - 0.00 0.00 377082/502776 __dom_node_to_xml [24] -[46] 0.0 0.00 0.00 502776 append_buffer_to_buffer [46] ------------------------------------------------ - 0.00 0.00 125694/502776 __node_list_to_xml [35] - 0.00 0.00 377082/502776 __dom_node_to_xml [24] -[47] 0.0 0.00 0.00 502776 destroy_byte_buffer [47] ------------------------------------------------ - 0.00 0.00 1/390454 new_queue [78] - 0.00 0.00 1/390454 remove_duplicates [3] - 0.00 0.00 1/390454 filter_nodes_by_name [28] - 0.00 0.00 1/390454 query [2] - 0.00 0.00 4/390454 new_stack [64] - 0.00 0.00 1571/390454 merge_lists [7] - 0.00 0.00 129625/390454 append_child [25] - 0.00 0.00 129625/390454 append_children [26] - 0.00 0.00 129625/390454 get_descendants [6] -[48] 0.0 0.00 0.00 390454 new_generic_list [48] - 0.00 0.00 780908/2569718 __alloc [173] ------------------------------------------------ - 0.00 0.00 383375/383375 yyparse [8] -[49] 0.0 0.00 0.00 383375 get_namespace [49] ------------------------------------------------ - 0.00 0.00 383375/383375 yyparse [8] -[50] 0.0 0.00 0.00 383375 set_namespace [50] ------------------------------------------------ - 0.00 0.00 381801/381801 rb_tree_insert [55] -[51] 0.0 0.00 0.00 381801 compare [51] ------------------------------------------------ - 0.00 0.00 253749/253749 yyparse [8] -[52] 0.0 0.00 0.00 253749 add_attribute [52] - 0.00 0.00 253749/253749 rb_tree_insert [55] - 0.00 0.00 126482/126482 new_rbtree [62] ------------------------------------------------ - 0.00 0.00 253749/253749 yyparse [8] -[53] 0.0 0.00 0.00 253749 new_attribute [53] - 0.00 0.00 761247/2560282 __alloc [174] ------------------------------------------------ - 0.00 0.00 253749/253749 rb_tree_insert [55] -[54] 0.0 0.00 0.00 253749 new_rbtree_node [54] - 0.00 0.00 253749/632407 __alloc [176] ------------------------------------------------ - 0.00 0.00 253749/253749 add_attribute [52] -[55] 0.0 0.00 0.00 253749 rb_tree_insert [55] - 0.00 0.00 763602/763602 key [42] - 0.00 0.00 381801/381801 compare [51] - 0.00 0.00 253749/253749 new_rbtree_node [54] - 0.00 0.00 253749/253749 rb_tree_insert_fixup [56] ------------------------------------------------ - 0.00 0.00 253749/253749 rb_tree_insert [55] -[56] 0.0 0.00 0.00 253749 rb_tree_insert_fixup [56] ------------------------------------------------ - 0.00 0.00 125694/252176 __dom_node_to_xml [24] - 0.00 0.00 126482/252176 destroy_dom_node [21] -[57] 0.0 0.00 0.00 252176 destroy_iterator [57] ------------------------------------------------ - 0.00 0.00 129626/129626 yyparse [8] -[58] 0.0 0.00 0.00 129626 set_name [58] ------------------------------------------------ - 0.00 0.00 129625/129625 get_descendants [6] -[59] 0.0 0.00 0.00 129625 get_children [59] ------------------------------------------------ - 0.00 0.00 127266/127266 yyparse [8] -[60] 0.0 0.00 0.00 127266 new_text_node [60] - 0.00 0.00 254532/2560282 __alloc [174] ------------------------------------------------ - 0.00 0.00 126482/126482 destroy_dom_node [21] -[61] 0.0 0.00 0.00 126482 destroy_rbtree [61] - 0.00 0.00 126482/126482 __destroy_rbtree [177] ------------------------------------------------ - 0.00 0.00 126482/126482 add_attribute [52] -[62] 0.0 0.00 0.00 126482 new_rbtree [62] - 0.00 0.00 126482/632407 __alloc [176] ------------------------------------------------ - 0.00 0.00 13612/13612 append_element [15] -[63] 0.0 0.00 0.00 13612 refactor_generic_list [63] ------------------------------------------------ - 0.00 0.00 1/4 parse_dom [9] - 0.00 0.00 1/4 parse_query [11] - 0.00 0.00 2/4 yyparse [8] -[64] 0.0 0.00 0.00 4 new_stack [64] - 0.00 0.00 4/390454 new_generic_list [48] ------------------------------------------------ - 0.00 0.00 2/4 yylex [10] - 0.00 0.00 2/4 yy_switch_to_buffer [73] -[65] 0.0 0.00 0.00 4 yy_load_buffer_state [65] ------------------------------------------------ - 0.00 0.00 2/4 yyensure_buffer_stack [74] - 0.00 0.00 2/4 yy_scan_buffer [72] -[66] 0.0 0.00 0.00 4 yyalloc [66] ------------------------------------------------ - 0.00 0.00 4/4 yyparse [8] -[67] 0.0 0.00 0.00 4 yydestruct [67] ------------------------------------------------ - 0.00 0.00 2/4 yy_delete_buffer [70] - 0.00 0.00 2/4 yylex_destroy [75] -[68] 0.0 0.00 0.00 4 yyfree [68] ------------------------------------------------ - 0.00 0.00 3/3 yylex [10] -[69] 0.0 0.00 0.00 3 yy_get_next_buffer [69] ------------------------------------------------ - 0.00 0.00 1/2 parse_file [12] - 0.00 0.00 1/2 parse_string [13] -[70] 0.0 0.00 0.00 2 yy_delete_buffer [70] - 0.00 0.00 2/4 yyfree [68] ------------------------------------------------ - 0.00 0.00 2/2 yylex_destroy [75] -[71] 0.0 0.00 0.00 2 yy_init_globals [71] ------------------------------------------------ - 0.00 0.00 1/2 parse_file [12] - 0.00 0.00 1/2 parse_string [13] -[72] 0.0 0.00 0.00 2 yy_scan_buffer [72] - 0.00 0.00 2/4 yyalloc [66] - 0.00 0.00 2/2 yy_switch_to_buffer [73] ------------------------------------------------ - 0.00 0.00 2/2 yy_scan_buffer [72] -[73] 0.0 0.00 0.00 2 yy_switch_to_buffer [73] - 0.00 0.00 2/2 yyensure_buffer_stack [74] - 0.00 0.00 2/4 yy_load_buffer_state [65] ------------------------------------------------ - 0.00 0.00 2/2 yy_switch_to_buffer [73] -[74] 0.0 0.00 0.00 2 yyensure_buffer_stack [74] - 0.00 0.00 2/4 yyalloc [66] ------------------------------------------------ - 0.00 0.00 1/2 parse_file [12] - 0.00 0.00 1/2 parse_string [13] -[75] 0.0 0.00 0.00 2 yylex_destroy [75] - 0.00 0.00 2/4 yyfree [68] - 0.00 0.00 2/2 yy_init_globals [71] ------------------------------------------------ - 0.00 0.00 2/2 yylex [10] -[76] 0.0 0.00 0.00 2 yywrap [76] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [8] -[77] 0.0 0.00 0.00 1 new_document [77] - 0.00 0.00 1/2560282 __alloc [174] - 0.00 0.00 1/1 set_xml_declaration [83] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [8] -[78] 0.0 0.00 0.00 1 new_queue [78] - 0.00 0.00 1/390454 new_generic_list [48] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [8] -[79] 0.0 0.00 0.00 1 new_selector [79] - 0.00 0.00 1/1 __alloc [180] ------------------------------------------------ - 0.00 0.00 1/1 query [2] -[80] 0.0 0.00 0.00 1 peek_queue_type [80] ------------------------------------------------ - 0.00 0.00 1/1 remove_duplicates [3] -[81] 0.0 0.00 0.00 1 rebase_generic_list [81] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [8] -[82] 0.0 0.00 0.00 1 set_doc_root [82] ------------------------------------------------ - 0.00 0.00 1/1 new_document [77] -[83] 0.0 0.00 0.00 1 set_xml_declaration [83] ------------------------------------------------ - 0.00 0.00 1/1 yylex [10] -[84] 0.0 0.00 0.00 1 yy_get_previous_state [84] ------------------------------------------------ - 0.00 0.00 780908/2569718 new_generic_list [48] - 0.00 0.00 1788810/2569718 append_element [15] -[173] 0.0 0.00 0.00 2569718 __alloc [173] ------------------------------------------------ - 0.00 0.00 1/2560282 new_document [77] - 0.00 0.00 254532/2560282 new_text_node [60] - 0.00 0.00 761247/2560282 new_attribute [53] - 0.00 0.00 1544502/2560282 new_element_node [41] -[174] 0.0 0.00 0.00 2560282 __alloc [174] ------------------------------------------------ - 0.00 0.00 1256940/1256940 new_byte_buffer [31] -[175] 0.0 0.00 0.00 1256940 __alloc [175] ------------------------------------------------ - 0.00 0.00 126482/632407 new_rbtree [62] - 0.00 0.00 252176/632407 new_tree_iterator [32] - 0.00 0.00 253749/632407 new_rbtree_node [54] -[176] 0.0 0.00 0.00 632407 __alloc [176] ------------------------------------------------ - 507498 __destroy_rbtree [177] - 0.00 0.00 126482/126482 destroy_rbtree [61] -[177] 0.0 0.00 0.00 126482+507498 __destroy_rbtree [177] - 507498 __destroy_rbtree [177] ------------------------------------------------ - 0.00 0.00 1/2 parse_dom [9] - 0.00 0.00 1/2 parse_query [11] -[178] 0.0 0.00 0.00 2 __alloc [178] ------------------------------------------------ - 0.00 0.00 1/1 parse_string [13] -[179] 0.0 0.00 0.00 1 __alloc [179] ------------------------------------------------ - 0.00 0.00 1/1 new_selector [79] -[180] 0.0 0.00 0.00 1 __alloc [180] ------------------------------------------------ - - This table describes the call tree of the program, and was sorted by - the total amount of time spent in each function and its children. - - Each entry in this table consists of several lines. The line with the - index number at the left hand margin lists the current function. - The lines above it list the functions that called this function, - and the lines below it list the functions this one called. - This line lists: - index A unique number given to each element of the table. - Index numbers are sorted numerically. - The index number is printed next to every function name so - it is easier to look up where the function in the table. - - % time This is the percentage of the `total' time that was spent - in this function and its children. Note that due to - different viewpoints, functions excluded by options, etc, - these numbers will NOT add up to 100%. - - self This is the total amount of time spent in this function. - - children This is the total amount of time propagated into this - function by its children. - - called This is the number of times the function was called. - If the function called itself recursively, the number - only includes non-recursive calls, and is followed by - a `+' and the number of recursive calls. - - name The name of the current function. The index number is - printed after it. If the function is a member of a - cycle, the cycle number is printed between the - function's name and the index number. - - - For the function's parents, the fields have the following meanings: - - self This is the amount of time that was propagated directly - from the function into this parent. - - children This is the amount of time that was propagated from - the function's children into this parent. - - called This is the number of times this parent called the - function `/' the total number of times the function - was called. Recursive calls to the function are not - included in the number after the `/'. - - name This is the name of the parent. The parent's index - number is printed after it. If the parent is a - member of a cycle, the cycle number is printed between - the name and the index number. - - If the parents of the function cannot be determined, the word - `' is printed in the `name' field, and all the other - fields are blank. - - For the function's children, the fields have the following meanings: - - self This is the amount of time that was propagated directly - from the child into the function. - - children This is the amount of time that was propagated from the - child's children to the function. - - called This is the number of times the function called - this child `/' the total number of times the child - was called. Recursive calls by the child are not - listed in the number after the `/'. - - name This is the name of the child. The child's index - number is printed after it. If the child is a - member of a cycle, the cycle number is printed - between the name and the index number. - - If there are any cycles (circles) in the call graph, there is an - entry for the cycle-as-a-whole. This entry shows who called the - cycle (as parents) and the members of the cycle (as children.) - The `+' recursive calls entry shows the number of function calls that - were internal to the cycle, and the calls entry for each member shows, - for that member, how many times it was called from other members of - the cycle. - - -Index by function name - - [178] __alloc (macros.h) [40] enqueue_with_type [2] query - [179] __alloc (macros.h) [28] filter_nodes_by_name [55] rb_tree_insert - [174] __alloc (macros.h) [27] filter_nodes_by_selector [56] rb_tree_insert_fixup (rbtree.c) - [175] __alloc (macros.h) [59] get_children [81] rebase_generic_list (stack.c) - [176] __alloc (macros.h) [6] get_descendants [63] refactor_generic_list (stack.c) - [173] __alloc (macros.h) [17] get_element_and_type_at [3] remove_duplicates - [180] __alloc (macros.h) [18] get_element_at [14] remove_element_at - [34] __attribute_to_xml [44] get_name [82] set_doc_root - [177] __destroy_rbtree (rbtree.c) [49] get_namespace [58] set_name - [24] __dom_node_to_xml [42] key [50] set_namespace - [35] __node_list_to_xml [7] merge_lists [83] set_xml_declaration - [4] __quicksort_generic_list [53] new_attribute [43] tree_iterator_has_next - [5] __quicksort_generic_list_aux [31] new_byte_buffer [45] tree_iterator_next - [52] add_attribute [77] new_document [70] yy_delete_buffer - [19] add_element [41] new_element_node [69] yy_get_next_buffer (lex.yy.c) - [39] add_element_with_type [48] new_generic_list [84] yy_get_previous_state (lex.yy.c) - [46] append_buffer_to_buffer [78] new_queue [71] yy_init_globals (lex.yy.c) - [30] append_bytes_to_buffer [62] new_rbtree [65] yy_load_buffer_state (lex.yy.c) - [25] append_child [54] new_rbtree_node (rbtree.c) [72] yy_scan_buffer - [26] append_children [79] new_selector [73] yy_switch_to_buffer - [15] append_element [64] new_stack [66] yyalloc - [33] append_string_to_buffer [60] new_text_node [67] yydestruct (y.tab.c) - [51] compare [32] new_tree_iterator [74] yyensure_buffer_stack (lex.yy.c) - [37] dequeue [22] node_to_string [68] yyfree - [47] destroy_byte_buffer [9] parse_dom [10] yylex - [21] destroy_dom_node [12] parse_file [75] yylex_destroy - [36] destroy_dom_tree [11] parse_query [8] yyparse - [29] destroy_generic_list [13] parse_string [76] yywrap - [57] destroy_iterator [80] peek_queue_type [23] - [61] destroy_rbtree [16] pop_stack - [38] destroy_selector [20] push_stack diff --git a/profiling/com_remove_dups_e_quick_sort.massif b/profiling/com_remove_dups_e_quick_sort.massif deleted file mode 100644 index 22587d6..0000000 --- a/profiling/com_remove_dups_e_quick_sort.massif +++ /dev/null @@ -1,1958 +0,0 @@ --------------------------------------------------------------------------------- -Command: ./dom_parser really_big.xml @segment -Massif arguments: --time-unit=B --massif-out-file=stats.massif -ms_print arguments: stats.massif --------------------------------------------------------------------------------- - - - MB -98.74^ # - | # - | # - | ::# - | : # - | @: #: - | @: #: - | @@: #: :@::::::::::::::::::::::::@:::::::@:::@:::::@::::@::::: - | @@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@::::: - | @@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@ - | @@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@ - | @@@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@ - | @@@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@ - | @@@@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@: - | @@@@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@: - | @@@@@@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@: - | @ @@@@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@: - | :@ @@@@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@:: - | :@ @@@@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@:: - | :@ @@@@@: #:::@::::::::::::::::::::::::@:::: : @:::@:::::@::::@:::::@:: - 0 +----------------------------------------------------------------------->GB - 0 1.290 - -Number of snapshots: 91 - Detailed snapshots: [3, 4, 5, 6, 7, 8, 10 (peak), 14, 39, 47, 55, 65, 75, 85] - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 0 0 0 0 0 0 - 1 10,298,352 5,045,456 3,205,383 1,840,073 0 - 2 32,043,984 15,745,712 10,047,334 5,698,378 0 - 3 57,505,768 27,777,784 17,388,133 10,389,651 0 -62.60% (17,388,133B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->10.93% (3,036,707B) 0x40B14AE: strdup (strdup.c:43) -| ->04.97% (1,381,441B) 0x8049150: yylex (parser.l:24) -| | ->04.97% (1,381,441B) 0x804B370: yyparse (y.tab.c:1517) -| | ->04.97% (1,381,441B) 0x804AFCA: parse_file (parser.y:67) -| | ->04.97% (1,381,441B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->04.97% (1,381,441B) 0x8051749: main (main.c:30) -| | -| ->03.56% (990,239B) 0x80491E2: yylex (parser.l:32) -| | ->03.56% (990,239B) 0x804B370: yyparse (y.tab.c:1517) -| | ->03.56% (990,239B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.56% (990,239B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.56% (990,239B) 0x8051749: main (main.c:30) -| | -| ->01.40% (390,209B) 0x8049238: yylex (parser.l:37) -| | ->01.40% (390,209B) 0x804B370: yyparse (y.tab.c:1517) -| | ->01.40% (390,209B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.40% (390,209B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.40% (390,209B) 0x8051749: main (main.c:30) -| | -| ->00.99% (274,818B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.84% (2,456,096B) 0x804FB2B: append_element (stack.c:147) -| ->06.87% (1,908,272B) 0x804FC8C: add_element (stack.c:180) -| | ->06.87% (1,908,272B) 0x805021C: push_stack (stack.c:311) -| | ->03.94% (1,094,304B) 0x80491FE: yylex (parser.l:32) -| | | ->03.94% (1,094,304B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->03.94% (1,094,304B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.94% (1,094,304B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.94% (1,094,304B) 0x8051749: main (main.c:30) -| | | -| | ->01.95% (542,184B) 0x8049254: yylex (parser.l:37) -| | | ->01.95% (542,184B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->01.95% (542,184B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.95% (542,184B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.95% (542,184B) 0x8051749: main (main.c:30) -| | | -| | ->00.98% (271,784B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.97% (547,824B) 0x804CAD3: append_child (node.c:112) -| ->01.96% (544,696B) 0x804CD2D: append_children (node.c:151) -| | ->01.96% (544,696B) 0x804B668: yyparse (parser.y:169) -| | ->01.96% (544,696B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.96% (544,696B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.96% (544,696B) 0x8051749: main (main.c:30) -| | -| ->00.01% (3,128B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.91% (2,198,528B) 0x804F52E: new_generic_list (stack.c:18) -| ->07.91% (2,198,464B) 0x804CCFD: append_children (node.c:148) -| | ->07.91% (2,198,464B) 0x804B668: yyparse (parser.y:169) -| | ->07.91% (2,198,464B) 0x804AFCA: parse_file (parser.y:67) -| | ->07.91% (2,198,464B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->07.91% (2,198,464B) 0x8051749: main (main.c:30) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.83% (1,897,644B) 0x804CECF: new_attribute (node.c:192) -| ->06.83% (1,897,644B) 0x804B8C1: yyparse (parser.y:222) -| ->06.83% (1,897,644B) 0x804AFCA: parse_file (parser.y:67) -| ->06.83% (1,897,644B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->06.83% (1,897,644B) 0x8051749: main (main.c:30) -| -->04.97% (1,381,441B) 0x804CE69: new_text_node (node.c:183) -| ->04.97% (1,381,441B) 0x804B7BD: yyparse (parser.y:196) -| ->04.97% (1,381,441B) 0x804AFCA: parse_file (parser.y:67) -| ->04.97% (1,381,441B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.97% (1,381,441B) 0x8051749: main (main.c:30) -| -->04.88% (1,355,440B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->04.88% (1,355,440B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->04.88% (1,355,440B) 0x804CBDC: add_attribute (node.c:132) -| ->04.88% (1,355,440B) 0x804B89B: yyparse (parser.y:218) -| ->04.88% (1,355,440B) 0x804AFCA: parse_file (parser.y:67) -| ->04.88% (1,355,440B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.88% (1,355,440B) 0x8051749: main (main.c:30) -| -->04.70% (1,306,368B) 0x804F716: refactor_generic_list (stack.c:59) -| ->04.70% (1,306,368B) 0x804FB1F: append_element (stack.c:144) -| ->03.77% (1,048,576B) 0x804FC8C: add_element (stack.c:180) -| | ->03.77% (1,048,576B) 0x805021C: push_stack (stack.c:311) -| | ->03.77% (1,048,576B) 0x8049254: yylex (parser.l:37) -| | | ->03.77% (1,048,576B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->03.77% (1,048,576B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.77% (1,048,576B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.77% (1,048,576B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.93% (257,792B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.48% (966,420B) 0x804CD8F: new_element_node (node.c:164) -| ->03.48% (966,280B) 0x804B874: yyparse (parser.y:215) -| | ->03.48% (966,280B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.48% (966,280B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.48% (966,280B) 0x8051749: main (main.c:30) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.42% (951,244B) 0x804CE2F: new_text_node (node.c:178) -| ->03.42% (951,244B) 0x804B7BD: yyparse (parser.y:196) -| ->03.42% (951,244B) 0x804AFCA: parse_file (parser.y:67) -| ->03.42% (951,244B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->03.42% (951,244B) 0x8051749: main (main.c:30) -| -->01.99% (552,144B) 0x804F4F8: new_generic_list (stack.c:13) -| ->01.99% (552,080B) 0x804CCFD: append_children (node.c:148) -| | ->01.99% (552,080B) 0x804B668: yyparse (parser.y:169) -| | ->01.99% (552,080B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.99% (552,080B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.99% (552,080B) 0x8051749: main (main.c:30) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.59% (440,617B) 0x804CF10: new_attribute (node.c:197) -| ->01.59% (440,617B) 0x804B8C1: yyparse (parser.y:222) -| ->01.59% (440,617B) 0x804AFCA: parse_file (parser.y:67) -| ->01.59% (440,617B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.59% (440,617B) 0x8051749: main (main.c:30) -| -->01.46% (405,576B) 0x804E815: new_rbtree (rbtree.c:39) -| ->01.46% (405,576B) 0x804CBC1: add_attribute (node.c:131) -| ->01.46% (405,576B) 0x804B89B: yyparse (parser.y:218) -| ->01.46% (405,576B) 0x804AFCA: parse_file (parser.y:67) -| ->01.46% (405,576B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.46% (405,576B) 0x8051749: main (main.c:30) -| -->01.40% (390,209B) 0x804CF47: new_attribute (node.c:199) -| ->01.40% (390,209B) 0x804B8C1: yyparse (parser.y:222) -| ->01.40% (390,209B) 0x804AFCA: parse_file (parser.y:67) -| ->01.40% (390,209B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.40% (390,209B) 0x8051749: main (main.c:30) -| -->00.18% (49,699B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 4 83,931,400 40,770,808 25,711,261 15,059,547 0 -63.06% (25,711,261B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->10.77% (4,391,496B) 0x40B14AE: strdup (strdup.c:43) -| ->04.90% (1,996,346B) 0x8049150: yylex (parser.l:24) -| | ->04.90% (1,996,346B) 0x804B370: yyparse (y.tab.c:1517) -| | ->04.90% (1,996,346B) 0x804AFCA: parse_file (parser.y:67) -| | ->04.90% (1,996,346B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->04.90% (1,996,346B) 0x8051749: main (main.c:30) -| | -| ->03.51% (1,432,668B) 0x80491E2: yylex (parser.l:32) -| | ->03.51% (1,432,668B) 0x804B370: yyparse (y.tab.c:1517) -| | ->03.51% (1,432,668B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.51% (1,432,668B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.51% (1,432,668B) 0x8051749: main (main.c:30) -| | -| ->01.39% (564,854B) 0x8049238: yylex (parser.l:37) -| | ->01.39% (564,854B) 0x804B370: yyparse (y.tab.c:1517) -| | ->01.39% (564,854B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.39% (564,854B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.39% (564,854B) 0x8051749: main (main.c:30) -| | -| ->00.98% (397,628B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.72% (3,553,432B) 0x804FB2B: append_element (stack.c:147) -| ->06.77% (2,760,808B) 0x804FC8C: add_element (stack.c:180) -| | ->06.77% (2,760,808B) 0x805021C: push_stack (stack.c:311) -| | ->03.88% (1,583,248B) 0x80491FE: yylex (parser.l:32) -| | | ->03.88% (1,583,248B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->03.88% (1,583,248B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.88% (1,583,248B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.88% (1,583,248B) 0x8051749: main (main.c:30) -| | | -| | ->01.92% (784,360B) 0x8049254: yylex (parser.l:37) -| | | ->01.92% (784,360B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->01.92% (784,360B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.92% (784,360B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.92% (784,360B) 0x8051749: main (main.c:30) -| | | -| | ->00.96% (393,200B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.94% (792,624B) 0x804CAD3: append_child (node.c:112) -| ->01.94% (789,616B) 0x804CD2D: append_children (node.c:151) -| | ->01.94% (789,616B) 0x804B668: yyparse (parser.y:169) -| | ->01.94% (789,616B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.94% (789,616B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.94% (789,616B) 0x8051749: main (main.c:30) -| | -| ->00.01% (3,008B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.80% (3,181,120B) 0x804F52E: new_generic_list (stack.c:18) -| ->07.80% (3,181,056B) 0x804CCFD: append_children (node.c:148) -| | ->07.80% (3,181,056B) 0x804B668: yyparse (parser.y:169) -| | ->07.80% (3,181,056B) 0x804AFCA: parse_file (parser.y:67) -| | ->07.80% (3,181,056B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->07.80% (3,181,056B) 0x8051749: main (main.c:30) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.73% (2,745,260B) 0x804CECF: new_attribute (node.c:192) -| ->06.73% (2,745,260B) 0x804B8C1: yyparse (parser.y:222) -| ->06.73% (2,745,260B) 0x804AFCA: parse_file (parser.y:67) -| ->06.73% (2,745,260B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->06.73% (2,745,260B) 0x8051749: main (main.c:30) -| -->06.06% (2,470,656B) 0x804F716: refactor_generic_list (stack.c:59) -| ->06.06% (2,470,656B) 0x804FB1F: append_element (stack.c:144) -| ->05.14% (2,097,152B) 0x804FC8C: add_element (stack.c:180) -| | ->05.14% (2,097,152B) 0x805021C: push_stack (stack.c:311) -| | ->05.14% (2,097,152B) 0x804916C: yylex (parser.l:24) -| | | ->05.14% (2,097,152B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->05.14% (2,097,152B) 0x804AFCA: parse_file (parser.y:67) -| | | ->05.14% (2,097,152B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->05.14% (2,097,152B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.92% (373,504B) in 1+ places, all below ms_print's threshold (01.00%) -| -->04.90% (1,996,346B) 0x804CE69: new_text_node (node.c:183) -| ->04.90% (1,996,346B) 0x804B7BD: yyparse (parser.y:196) -| ->04.90% (1,996,346B) 0x804AFCA: parse_file (parser.y:67) -| ->04.90% (1,996,346B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.90% (1,996,346B) 0x8051749: main (main.c:30) -| -->04.81% (1,960,880B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->04.81% (1,960,880B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->04.81% (1,960,880B) 0x804CBDC: add_attribute (node.c:132) -| ->04.81% (1,960,880B) 0x804B89B: yyparse (parser.y:218) -| ->04.81% (1,960,880B) 0x804AFCA: parse_file (parser.y:67) -| ->04.81% (1,960,880B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.81% (1,960,880B) 0x8051749: main (main.c:30) -| -->03.43% (1,398,264B) 0x804CD8F: new_element_node (node.c:164) -| ->03.43% (1,398,124B) 0x804B874: yyparse (parser.y:215) -| | ->03.43% (1,398,124B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.43% (1,398,124B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.43% (1,398,124B) 0x8051749: main (main.c:30) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.38% (1,376,200B) 0x804CE2F: new_text_node (node.c:178) -| ->03.38% (1,376,200B) 0x804B7BD: yyparse (parser.y:196) -| ->03.38% (1,376,200B) 0x804AFCA: parse_file (parser.y:67) -| ->03.38% (1,376,200B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->03.38% (1,376,200B) 0x8051749: main (main.c:30) -| -->01.96% (798,912B) 0x804F4F8: new_generic_list (stack.c:13) -| ->01.96% (798,848B) 0x804CCFD: append_children (node.c:148) -| | ->01.96% (798,848B) 0x804B668: yyparse (parser.y:169) -| | ->01.96% (798,848B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.96% (798,848B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.96% (798,848B) 0x8051749: main (main.c:30) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.56% (637,426B) 0x804CF10: new_attribute (node.c:197) -| ->01.56% (637,426B) 0x804B8C1: yyparse (parser.y:222) -| ->01.56% (637,426B) 0x804AFCA: parse_file (parser.y:67) -| ->01.56% (637,426B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.56% (637,426B) 0x8051749: main (main.c:30) -| -->01.44% (586,716B) 0x804E815: new_rbtree (rbtree.c:39) -| ->01.44% (586,716B) 0x804CBC1: add_attribute (node.c:131) -| ->01.44% (586,716B) 0x804B89B: yyparse (parser.y:218) -| ->01.44% (586,716B) 0x804AFCA: parse_file (parser.y:67) -| ->01.44% (586,716B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.44% (586,716B) 0x8051749: main (main.c:30) -| -->01.39% (564,854B) 0x804CF47: new_attribute (node.c:199) -| ->01.39% (564,854B) 0x804B8C1: yyparse (parser.y:222) -| ->01.39% (564,854B) 0x804AFCA: parse_file (parser.y:67) -| ->01.39% (564,854B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.39% (564,854B) 0x8051749: main (main.c:30) -| -->00.12% (49,699B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 5 101,842,064 49,258,544 30,898,351 18,360,193 0 -62.73% (30,898,351B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->10.88% (5,358,853B) 0x40B14AE: strdup (strdup.c:43) -| ->04.95% (2,436,266B) 0x8049150: yylex (parser.l:24) -| | ->04.95% (2,436,266B) 0x804B370: yyparse (y.tab.c:1517) -| | ->04.95% (2,436,266B) 0x804AFCA: parse_file (parser.y:67) -| | ->04.95% (2,436,266B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->04.95% (2,436,266B) 0x8051749: main (main.c:30) -| | -| ->03.55% (1,747,992B) 0x80491E2: yylex (parser.l:32) -| | ->03.55% (1,747,992B) 0x804B370: yyparse (y.tab.c:1517) -| | ->03.55% (1,747,992B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.55% (1,747,992B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.55% (1,747,992B) 0x8051749: main (main.c:30) -| | -| ->01.40% (689,428B) 0x8049238: yylex (parser.l:37) -| | ->01.40% (689,428B) 0x804B370: yyparse (y.tab.c:1517) -| | ->01.40% (689,428B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.40% (689,428B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.40% (689,428B) 0x8051749: main (main.c:30) -| | -| ->00.98% (485,167B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.80% (4,335,520B) 0x804FB2B: append_element (stack.c:147) -| ->06.84% (3,368,408B) 0x804FC8C: add_element (stack.c:180) -| | ->06.84% (3,368,408B) 0x805021C: push_stack (stack.c:311) -| | ->03.92% (1,931,728B) 0x80491FE: yylex (parser.l:32) -| | | ->03.92% (1,931,728B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->03.92% (1,931,728B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.92% (1,931,728B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.92% (1,931,728B) 0x8051749: main (main.c:30) -| | | -| | ->01.94% (956,944B) 0x8049254: yylex (parser.l:37) -| | | ->01.94% (956,944B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->01.94% (956,944B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.94% (956,944B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.94% (956,944B) 0x8051749: main (main.c:30) -| | | -| | ->00.97% (479,736B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.96% (967,112B) 0x804CAD3: append_child (node.c:112) -| ->01.95% (962,776B) 0x804CD2D: append_children (node.c:151) -| | ->01.95% (962,776B) 0x804B668: yyparse (parser.y:169) -| | ->01.95% (962,776B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.95% (962,776B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.95% (962,776B) 0x8051749: main (main.c:30) -| | -| ->00.01% (4,336B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.88% (3,881,536B) 0x804F52E: new_generic_list (stack.c:18) -| ->07.88% (3,881,408B) 0x804CCFD: append_children (node.c:148) -| | ->07.88% (3,881,408B) 0x804B668: yyparse (parser.y:169) -| | ->07.88% (3,881,408B) 0x804AFCA: parse_file (parser.y:67) -| | ->07.88% (3,881,408B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->07.88% (3,881,408B) 0x8051749: main (main.c:30) -| | -| ->00.00% (128B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.80% (3,349,304B) 0x804CECF: new_attribute (node.c:192) -| ->06.80% (3,349,304B) 0x804B8C1: yyparse (parser.y:222) -| ->06.80% (3,349,304B) 0x804AFCA: parse_file (parser.y:67) -| ->06.80% (3,349,304B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->06.80% (3,349,304B) 0x8051749: main (main.c:30) -| -->05.18% (2,551,936B) 0x804F716: refactor_generic_list (stack.c:59) -| ->05.18% (2,551,936B) 0x804FB1F: append_element (stack.c:144) -| ->04.26% (2,097,152B) 0x804FC8C: add_element (stack.c:180) -| | ->04.26% (2,097,152B) 0x805021C: push_stack (stack.c:311) -| | ->04.26% (2,097,152B) 0x804916C: yylex (parser.l:24) -| | | ->04.26% (2,097,152B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->04.26% (2,097,152B) 0x804AFCA: parse_file (parser.y:67) -| | | ->04.26% (2,097,152B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->04.26% (2,097,152B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.92% (454,784B) in 1+ places, all below ms_print's threshold (01.00%) -| -->04.95% (2,436,266B) 0x804CE69: new_text_node (node.c:183) -| ->04.95% (2,436,266B) 0x804B7BD: yyparse (parser.y:196) -| ->04.95% (2,436,266B) 0x804AFCA: parse_file (parser.y:67) -| ->04.95% (2,436,266B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.95% (2,436,266B) 0x8051749: main (main.c:30) -| -->04.86% (2,392,360B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->04.86% (2,392,360B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->04.86% (2,392,360B) 0x804CBDC: add_attribute (node.c:132) -| ->04.86% (2,392,360B) 0x804B89B: yyparse (parser.y:218) -| ->04.86% (2,392,360B) 0x804AFCA: parse_file (parser.y:67) -| ->04.86% (2,392,360B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.86% (2,392,360B) 0x8051749: main (main.c:30) -| -->03.46% (1,706,068B) 0x804CD8F: new_element_node (node.c:164) -| ->03.46% (1,705,928B) 0x804B874: yyparse (parser.y:215) -| | ->03.46% (1,705,928B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.46% (1,705,928B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.46% (1,705,928B) 0x8051749: main (main.c:30) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.41% (1,679,076B) 0x804CE2F: new_text_node (node.c:178) -| ->03.41% (1,679,076B) 0x804B7BD: yyparse (parser.y:196) -| ->03.41% (1,679,076B) 0x804AFCA: parse_file (parser.y:67) -| ->03.41% (1,679,076B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->03.41% (1,679,076B) 0x8051749: main (main.c:30) -| -->01.98% (974,832B) 0x804F4F8: new_generic_list (stack.c:13) -| ->01.98% (974,752B) 0x804CCFD: append_children (node.c:148) -| | ->01.98% (974,752B) 0x804B668: yyparse (parser.y:169) -| | ->01.98% (974,752B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.98% (974,752B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.98% (974,752B) 0x8051749: main (main.c:30) -| | -| ->00.00% (80B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.58% (777,680B) 0x804CF10: new_attribute (node.c:197) -| ->01.58% (777,680B) 0x804B8C1: yyparse (parser.y:222) -| ->01.58% (777,680B) 0x804AFCA: parse_file (parser.y:67) -| ->01.58% (777,680B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.58% (777,680B) 0x8051749: main (main.c:30) -| -->01.45% (715,800B) 0x804E815: new_rbtree (rbtree.c:39) -| ->01.45% (715,800B) 0x804CBC1: add_attribute (node.c:131) -| ->01.45% (715,800B) 0x804B89B: yyparse (parser.y:218) -| ->01.45% (715,800B) 0x804AFCA: parse_file (parser.y:67) -| ->01.45% (715,800B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.45% (715,800B) 0x8051749: main (main.c:30) -| -->01.40% (689,428B) 0x804CF47: new_attribute (node.c:199) -| ->01.40% (689,428B) 0x804B8C1: yyparse (parser.y:222) -| ->01.40% (689,428B) 0x804AFCA: parse_file (parser.y:67) -| ->01.40% (689,428B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.40% (689,428B) 0x8051749: main (main.c:30) -| -->00.10% (49,692B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 6 117,384,272 56,626,032 35,400,591 21,225,441 0 -62.52% (35,400,591B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->10.95% (6,201,159B) 0x40B14AE: strdup (strdup.c:43) -| ->04.98% (2,821,216B) 0x8049150: yylex (parser.l:24) -| | ->04.98% (2,821,216B) 0x804B370: yyparse (y.tab.c:1517) -| | ->04.98% (2,821,216B) 0x804AFCA: parse_file (parser.y:67) -| | ->04.98% (2,821,216B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->04.98% (2,821,216B) 0x8051749: main (main.c:30) -| | -| ->03.57% (2,021,190B) 0x80491E2: yylex (parser.l:32) -| | ->03.57% (2,021,190B) 0x804B370: yyparse (y.tab.c:1517) -| | ->03.57% (2,021,190B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.57% (2,021,190B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.57% (2,021,190B) 0x8051749: main (main.c:30) -| | -| ->01.41% (797,724B) 0x8049238: yylex (parser.l:37) -| | ->01.41% (797,724B) 0x804B370: yyparse (y.tab.c:1517) -| | ->01.41% (797,724B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.41% (797,724B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.41% (797,724B) 0x8051749: main (main.c:30) -| | -| ->00.99% (561,029B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.85% (5,013,064B) 0x804FB2B: append_element (stack.c:147) -| ->06.88% (3,894,768B) 0x804FC8C: add_element (stack.c:180) -| | ->06.88% (3,894,768B) 0x805021C: push_stack (stack.c:311) -| | ->03.94% (2,233,680B) 0x80491FE: yylex (parser.l:32) -| | | ->03.94% (2,233,680B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->03.94% (2,233,680B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.94% (2,233,680B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.94% (2,233,680B) 0x8051749: main (main.c:30) -| | | -| | ->01.95% (1,106,408B) 0x8049254: yylex (parser.l:37) -| | | ->01.95% (1,106,408B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->01.95% (1,106,408B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.95% (1,106,408B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.95% (1,106,408B) 0x8051749: main (main.c:30) -| | | -| | ->00.98% (554,680B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.97% (1,118,296B) 0x804CAD3: append_child (node.c:112) -| ->01.97% (1,114,328B) 0x804CD2D: append_children (node.c:151) -| | ->01.97% (1,114,328B) 0x804B668: yyparse (parser.y:169) -| | ->01.97% (1,114,328B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.97% (1,114,328B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.97% (1,114,328B) 0x8051749: main (main.c:30) -| | -| ->00.01% (3,968B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.93% (4,488,512B) 0x804F52E: new_generic_list (stack.c:18) -| ->07.93% (4,488,448B) 0x804CCFD: append_children (node.c:148) -| | ->07.93% (4,488,448B) 0x804B668: yyparse (parser.y:169) -| | ->07.93% (4,488,448B) 0x804AFCA: parse_file (parser.y:67) -| | ->07.93% (4,488,448B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->07.93% (4,488,448B) 0x8051749: main (main.c:30) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.84% (3,872,428B) 0x804CECF: new_attribute (node.c:192) -| ->06.84% (3,872,428B) 0x804B8C1: yyparse (parser.y:222) -| ->06.84% (3,872,428B) 0x804AFCA: parse_file (parser.y:67) -| ->06.84% (3,872,428B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->06.84% (3,872,428B) 0x8051749: main (main.c:30) -| -->04.98% (2,821,216B) 0x804CE69: new_text_node (node.c:183) -| ->04.98% (2,821,216B) 0x804B7BD: yyparse (parser.y:196) -| ->04.98% (2,821,216B) 0x804AFCA: parse_file (parser.y:67) -| ->04.98% (2,821,216B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.98% (2,821,216B) 0x8051749: main (main.c:30) -| -->04.88% (2,766,000B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->04.88% (2,766,000B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->04.88% (2,766,000B) 0x804CBDC: add_attribute (node.c:132) -| ->04.88% (2,766,000B) 0x804B89B: yyparse (parser.y:218) -| ->04.88% (2,766,000B) 0x804AFCA: parse_file (parser.y:67) -| ->04.88% (2,766,000B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.88% (2,766,000B) 0x8051749: main (main.c:30) -| -->04.63% (2,622,464B) 0x804F716: refactor_generic_list (stack.c:59) -| ->04.63% (2,622,464B) 0x804FB1F: append_element (stack.c:144) -| ->03.70% (2,097,152B) 0x804FC8C: add_element (stack.c:180) -| | ->03.70% (2,097,152B) 0x805021C: push_stack (stack.c:311) -| | ->03.70% (2,097,152B) 0x804916C: yylex (parser.l:24) -| | | ->03.70% (2,097,152B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->03.70% (2,097,152B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.70% (2,097,152B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.70% (2,097,152B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.93% (525,312B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.48% (1,972,936B) 0x804CD8F: new_element_node (node.c:164) -| ->03.48% (1,972,796B) 0x804B874: yyparse (parser.y:215) -| | ->03.48% (1,972,796B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.48% (1,972,796B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.48% (1,972,796B) 0x8051749: main (main.c:30) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.43% (1,941,380B) 0x804CE2F: new_text_node (node.c:178) -| ->03.43% (1,941,380B) 0x804B7BD: yyparse (parser.y:196) -| ->03.43% (1,941,380B) 0x804AFCA: parse_file (parser.y:67) -| ->03.43% (1,941,380B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->03.43% (1,941,380B) 0x8051749: main (main.c:30) -| -->01.99% (1,127,296B) 0x804F4F8: new_generic_list (stack.c:13) -| ->01.99% (1,127,232B) 0x804CCFD: append_children (node.c:148) -| | ->01.99% (1,127,232B) 0x804B668: yyparse (parser.y:169) -| | ->01.99% (1,127,232B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.99% (1,127,232B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.99% (1,127,232B) 0x8051749: main (main.c:30) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.59% (899,146B) 0x804CF10: new_attribute (node.c:197) -| ->01.59% (899,146B) 0x804B8C1: yyparse (parser.y:222) -| ->01.59% (899,146B) 0x804AFCA: parse_file (parser.y:67) -| ->01.59% (899,146B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.59% (899,146B) 0x8051749: main (main.c:30) -| -->01.46% (827,568B) 0x804E815: new_rbtree (rbtree.c:39) -| ->01.46% (827,568B) 0x804CBC1: add_attribute (node.c:131) -| ->01.46% (827,568B) 0x804B89B: yyparse (parser.y:218) -| ->01.46% (827,568B) 0x804AFCA: parse_file (parser.y:67) -| ->01.46% (827,568B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.46% (827,568B) 0x8051749: main (main.c:30) -| -->01.41% (797,724B) 0x804CF47: new_attribute (node.c:199) -| ->01.41% (797,724B) 0x804B8C1: yyparse (parser.y:222) -| ->01.41% (797,724B) 0x804AFCA: parse_file (parser.y:67) -| ->01.41% (797,724B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.41% (797,724B) 0x8051749: main (main.c:30) -| -->00.09% (49,698B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 7 142,478,080 69,533,024 44,073,175 25,459,849 0 -63.38% (44,073,175B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->10.69% (7,432,840B) 0x40B14AE: strdup (strdup.c:43) -| ->04.87% (3,385,886B) 0x8049150: yylex (parser.l:24) -| | ->04.87% (3,385,886B) 0x804B370: yyparse (y.tab.c:1517) -| | ->04.87% (3,385,886B) 0x804AFCA: parse_file (parser.y:67) -| | ->04.87% (3,385,886B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->04.87% (3,385,886B) 0x8051749: main (main.c:30) -| | -| ->03.48% (2,419,850B) 0x80491E2: yylex (parser.l:32) -| | ->03.48% (2,419,850B) 0x804B370: yyparse (y.tab.c:1517) -| | ->03.48% (2,419,850B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.48% (2,419,850B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.48% (2,419,850B) 0x8051749: main (main.c:30) -| | -| ->01.37% (955,391B) 0x8049238: yylex (parser.l:37) -| | ->01.37% (955,391B) 0x804B370: yyparse (y.tab.c:1517) -| | ->01.37% (955,391B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.37% (955,391B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.37% (955,391B) 0x8051749: main (main.c:30) -| | -| ->00.97% (671,713B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.63% (6,001,824B) 0x804FB2B: append_element (stack.c:147) -| ->06.71% (4,662,920B) 0x804FC8C: add_element (stack.c:180) -| | ->06.71% (4,662,920B) 0x805021C: push_stack (stack.c:311) -| | ->03.85% (2,674,272B) 0x80491FE: yylex (parser.l:32) -| | | ->03.85% (2,674,272B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->03.85% (2,674,272B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.85% (2,674,272B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.85% (2,674,272B) 0x8051749: main (main.c:30) -| | | -| | ->01.90% (1,324,576B) 0x8049254: yylex (parser.l:37) -| | | ->01.90% (1,324,576B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->01.90% (1,324,576B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.90% (1,324,576B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.90% (1,324,576B) 0x8051749: main (main.c:30) -| | | -| | ->00.96% (664,072B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.93% (1,338,904B) 0x804CAD3: append_child (node.c:112) -| ->01.92% (1,334,504B) 0x804CD2D: append_children (node.c:151) -| | ->01.92% (1,334,504B) 0x804B668: yyparse (parser.y:169) -| | ->01.92% (1,334,504B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.92% (1,334,504B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.92% (1,334,504B) 0x8051749: main (main.c:30) -| | -| ->00.01% (4,400B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.73% (5,374,208B) 0x804F52E: new_generic_list (stack.c:18) -| ->07.73% (5,374,080B) 0x804CCFD: append_children (node.c:148) -| | ->07.73% (5,374,080B) 0x804B668: yyparse (parser.y:169) -| | ->07.73% (5,374,080B) 0x804AFCA: parse_file (parser.y:67) -| | ->07.73% (5,374,080B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->07.73% (5,374,080B) 0x8051749: main (main.c:30) -| | -| ->00.00% (128B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.94% (4,822,528B) 0x804F716: refactor_generic_list (stack.c:59) -| ->06.94% (4,822,528B) 0x804FB1F: append_element (stack.c:144) -| ->06.03% (4,194,304B) 0x804FC8C: add_element (stack.c:180) -| | ->06.03% (4,194,304B) 0x805021C: push_stack (stack.c:311) -| | ->06.03% (4,194,304B) 0x80491FE: yylex (parser.l:32) -| | | ->06.03% (4,194,304B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->06.03% (4,194,304B) 0x804AFCA: parse_file (parser.y:67) -| | | ->06.03% (4,194,304B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->06.03% (4,194,304B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.90% (628,224B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.67% (4,636,016B) 0x804CECF: new_attribute (node.c:192) -| ->06.67% (4,636,016B) 0x804B8C1: yyparse (parser.y:222) -| ->06.67% (4,636,016B) 0x804AFCA: parse_file (parser.y:67) -| ->06.67% (4,636,016B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->06.67% (4,636,016B) 0x8051749: main (main.c:30) -| -->04.87% (3,385,886B) 0x804CE69: new_text_node (node.c:183) -| ->04.87% (3,385,886B) 0x804B7BD: yyparse (parser.y:196) -| ->04.87% (3,385,886B) 0x804AFCA: parse_file (parser.y:67) -| ->04.87% (3,385,886B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.87% (3,385,886B) 0x8051749: main (main.c:30) -| -->04.76% (3,311,440B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->04.76% (3,311,440B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->04.76% (3,311,440B) 0x804CBDC: add_attribute (node.c:132) -| ->04.76% (3,311,440B) 0x804B89B: yyparse (parser.y:218) -| ->04.76% (3,311,440B) 0x804AFCA: parse_file (parser.y:67) -| ->04.76% (3,311,440B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.76% (3,311,440B) 0x8051749: main (main.c:30) -| -->03.40% (2,362,164B) 0x804CD8F: new_element_node (node.c:164) -| ->03.40% (2,362,024B) 0x804B874: yyparse (parser.y:215) -| | ->03.40% (2,362,024B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.40% (2,362,024B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.40% (2,362,024B) 0x8051749: main (main.c:30) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.34% (2,324,252B) 0x804CE2F: new_text_node (node.c:178) -| ->03.34% (2,324,252B) 0x804B7BD: yyparse (parser.y:196) -| ->03.34% (2,324,252B) 0x804AFCA: parse_file (parser.y:67) -| ->03.34% (2,324,252B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->03.34% (2,324,252B) 0x8051749: main (main.c:30) -| -->01.94% (1,349,744B) 0x804F4F8: new_generic_list (stack.c:13) -| ->01.94% (1,349,664B) 0x804CCFD: append_children (node.c:148) -| | ->01.94% (1,349,664B) 0x804B668: yyparse (parser.y:169) -| | ->01.94% (1,349,664B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.94% (1,349,664B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.94% (1,349,664B) 0x8051749: main (main.c:30) -| | -| ->00.00% (80B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.55% (1,076,446B) 0x804CF10: new_attribute (node.c:197) -| ->01.55% (1,076,446B) 0x804B8C1: yyparse (parser.y:222) -| ->01.55% (1,076,446B) 0x804AFCA: parse_file (parser.y:67) -| ->01.55% (1,076,446B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.55% (1,076,446B) 0x8051749: main (main.c:30) -| -->01.42% (990,744B) 0x804E815: new_rbtree (rbtree.c:39) -| ->01.42% (990,744B) 0x804CBC1: add_attribute (node.c:131) -| ->01.42% (990,744B) 0x804B89B: yyparse (parser.y:218) -| ->01.42% (990,744B) 0x804AFCA: parse_file (parser.y:67) -| ->01.42% (990,744B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.42% (990,744B) 0x8051749: main (main.c:30) -| -->01.37% (955,391B) 0x804CF47: new_attribute (node.c:199) -| ->01.37% (955,391B) 0x804B8C1: yyparse (parser.y:222) -| ->01.37% (955,391B) 0x804AFCA: parse_file (parser.y:67) -| ->01.37% (955,391B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.37% (955,391B) 0x8051749: main (main.c:30) -| -->00.07% (49,692B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 8 166,112,224 80,728,640 50,917,611 29,811,029 0 -63.07% (50,917,611B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->10.79% (8,708,037B) 0x40B14AE: strdup (strdup.c:43) -| ->04.91% (3,965,134B) 0x8049150: yylex (parser.l:24) -| | ->04.91% (3,965,134B) 0x804B370: yyparse (y.tab.c:1517) -| | ->04.91% (3,965,134B) 0x804AFCA: parse_file (parser.y:67) -| | ->04.91% (3,965,134B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->04.91% (3,965,134B) 0x8051749: main (main.c:30) -| | -| ->03.51% (2,835,951B) 0x80491E2: yylex (parser.l:32) -| | ->03.51% (2,835,951B) 0x804B370: yyparse (y.tab.c:1517) -| | ->03.51% (2,835,951B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.51% (2,835,951B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.51% (2,835,951B) 0x8051749: main (main.c:30) -| | -| ->01.39% (1,119,729B) 0x8049238: yylex (parser.l:37) -| | ->01.39% (1,119,729B) 0x804B370: yyparse (y.tab.c:1517) -| | ->01.39% (1,119,729B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.39% (1,119,729B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.39% (1,119,729B) 0x8051749: main (main.c:30) -| | -| ->00.98% (787,223B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.71% (7,033,848B) 0x804FB2B: append_element (stack.c:147) -| ->06.77% (5,464,704B) 0x804FC8C: add_element (stack.c:180) -| | ->06.77% (5,464,704B) 0x805021C: push_stack (stack.c:311) -| | ->03.88% (3,134,128B) 0x80491FE: yylex (parser.l:32) -| | | ->03.88% (3,134,128B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->03.88% (3,134,128B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.88% (3,134,128B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.88% (3,134,128B) 0x8051749: main (main.c:30) -| | | -| | ->01.92% (1,552,320B) 0x8049254: yylex (parser.l:37) -| | | ->01.92% (1,552,320B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->01.92% (1,552,320B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.92% (1,552,320B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.92% (1,552,320B) 0x8051749: main (main.c:30) -| | | -| | ->00.96% (778,256B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.94% (1,569,144B) 0x804CAD3: append_child (node.c:112) -| ->01.94% (1,563,720B) 0x804CD2D: append_children (node.c:151) -| | ->01.94% (1,563,720B) 0x804B668: yyparse (parser.y:169) -| | ->01.94% (1,563,720B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.94% (1,563,720B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.94% (1,563,720B) 0x8051749: main (main.c:30) -| | -| ->00.01% (5,424B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.80% (6,298,432B) 0x804F52E: new_generic_list (stack.c:18) -| ->07.80% (6,298,304B) 0x804CCFD: append_children (node.c:148) -| | ->07.80% (6,298,304B) 0x804B668: yyparse (parser.y:169) -| | ->07.80% (6,298,304B) 0x804AFCA: parse_file (parser.y:67) -| | ->07.80% (6,298,304B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->07.80% (6,298,304B) 0x8051749: main (main.c:30) -| | -| ->00.00% (128B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.73% (5,433,120B) 0x804CECF: new_attribute (node.c:192) -| ->06.73% (5,433,120B) 0x804B8C1: yyparse (parser.y:222) -| ->06.73% (5,433,120B) 0x804AFCA: parse_file (parser.y:67) -| ->06.73% (5,433,120B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->06.73% (5,433,120B) 0x8051749: main (main.c:30) -| -->06.11% (4,932,096B) 0x804F716: refactor_generic_list (stack.c:59) -| ->06.11% (4,932,096B) 0x804FB1F: append_element (stack.c:144) -| ->05.20% (4,194,304B) 0x804FC8C: add_element (stack.c:180) -| | ->05.20% (4,194,304B) 0x805021C: push_stack (stack.c:311) -| | ->05.20% (4,194,304B) 0x80491FE: yylex (parser.l:32) -| | | ->05.20% (4,194,304B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->05.20% (4,194,304B) 0x804AFCA: parse_file (parser.y:67) -| | | ->05.20% (4,194,304B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->05.20% (4,194,304B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.91% (737,792B) in 1+ places, all below ms_print's threshold (01.00%) -| -->04.91% (3,965,134B) 0x804CE69: new_text_node (node.c:183) -| ->04.91% (3,965,134B) 0x804B7BD: yyparse (parser.y:196) -| ->04.91% (3,965,134B) 0x804AFCA: parse_file (parser.y:67) -| ->04.91% (3,965,134B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.91% (3,965,134B) 0x8051749: main (main.c:30) -| -->04.81% (3,880,800B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->04.81% (3,880,800B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->04.81% (3,880,800B) 0x804CBDC: add_attribute (node.c:132) -| ->04.81% (3,880,800B) 0x804B89B: yyparse (parser.y:218) -| ->04.81% (3,880,800B) 0x804AFCA: parse_file (parser.y:67) -| ->04.81% (3,880,800B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.81% (3,880,800B) 0x8051749: main (main.c:30) -| -->03.43% (2,768,360B) 0x804CD8F: new_element_node (node.c:164) -| ->03.43% (2,768,220B) 0x804B874: yyparse (parser.y:215) -| | ->03.43% (2,768,220B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.43% (2,768,220B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.43% (2,768,220B) 0x8051749: main (main.c:30) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.37% (2,723,896B) 0x804CE2F: new_text_node (node.c:178) -| ->03.37% (2,723,896B) 0x804B7BD: yyparse (parser.y:196) -| ->03.37% (2,723,896B) 0x804AFCA: parse_file (parser.y:67) -| ->03.37% (2,723,896B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->03.37% (2,723,896B) 0x8051749: main (main.c:30) -| -->01.96% (1,581,856B) 0x804F4F8: new_generic_list (stack.c:13) -| ->01.96% (1,581,776B) 0x804CCFD: append_children (node.c:148) -| | ->01.96% (1,581,776B) 0x804B668: yyparse (parser.y:169) -| | ->01.96% (1,581,776B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.96% (1,581,776B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.96% (1,581,776B) 0x8051749: main (main.c:30) -| | -| ->00.00% (80B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.56% (1,261,527B) 0x804CF10: new_attribute (node.c:197) -| ->01.56% (1,261,527B) 0x804B8C1: yyparse (parser.y:222) -| ->01.56% (1,261,527B) 0x804AFCA: parse_file (parser.y:67) -| ->01.56% (1,261,527B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.56% (1,261,527B) 0x8051749: main (main.c:30) -| -->01.44% (1,161,084B) 0x804E815: new_rbtree (rbtree.c:39) -| ->01.44% (1,161,084B) 0x804CBC1: add_attribute (node.c:131) -| ->01.44% (1,161,084B) 0x804B89B: yyparse (parser.y:218) -| ->01.44% (1,161,084B) 0x804AFCA: parse_file (parser.y:67) -| ->01.44% (1,161,084B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.44% (1,161,084B) 0x8051749: main (main.c:30) -| -->01.39% (1,119,729B) 0x804CF47: new_attribute (node.c:199) -| ->01.39% (1,119,729B) 0x804B8C1: yyparse (parser.y:222) -| ->01.39% (1,119,729B) 0x804AFCA: parse_file (parser.y:67) -| ->01.39% (1,119,729B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.39% (1,119,729B) 0x8051749: main (main.c:30) -| -->00.06% (49,692B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 9 187,552,424 90,881,944 57,123,664 33,758,280 0 - 10 214,272,344 103,538,680 64,862,204 38,676,476 0 -62.65% (64,862,204B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->10.94% (11,323,700B) 0x40B14AE: strdup (strdup.c:43) -| ->04.97% (5,147,426B) 0x8049150: yylex (parser.l:24) -| | ->04.97% (5,147,426B) 0x804B370: yyparse (y.tab.c:1517) -| | ->04.97% (5,147,426B) 0x804AFCA: parse_file (parser.y:67) -| | ->04.97% (5,147,426B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->04.97% (5,147,426B) 0x8051749: main (main.c:30) -| | -| ->03.56% (3,682,036B) 0x80491E2: yylex (parser.l:32) -| | ->03.56% (3,682,036B) 0x804B370: yyparse (y.tab.c:1517) -| | ->03.56% (3,682,036B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.56% (3,682,036B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.56% (3,682,036B) 0x8051749: main (main.c:30) -| | -| ->01.42% (1,471,284B) 0x8049238: yylex (parser.l:37) -| | ->01.42% (1,471,284B) 0x804B370: yyparse (y.tab.c:1517) -| | ->01.42% (1,471,284B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.42% (1,471,284B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.42% (1,471,284B) 0x8051749: main (main.c:30) -| | -| ->00.99% (1,022,954B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.82% (9,131,080B) 0x804FB2B: append_element (stack.c:147) -| ->06.85% (7,092,984B) 0x804FC8C: add_element (stack.c:180) -| | ->06.85% (7,092,984B) 0x805021C: push_stack (stack.c:311) -| | ->03.93% (4,070,024B) 0x80491FE: yylex (parser.l:32) -| | | ->03.93% (4,070,024B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->03.93% (4,070,024B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.93% (4,070,024B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.93% (4,070,024B) 0x8051749: main (main.c:30) -| | | -| | ->01.94% (2,013,240B) 0x8049254: yylex (parser.l:37) -| | | ->01.94% (2,013,240B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->01.94% (2,013,240B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.94% (2,013,240B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.94% (2,013,240B) 0x8051749: main (main.c:30) -| | | -| | ->00.98% (1,009,720B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.97% (2,038,096B) 0x804CAD3: append_child (node.c:112) -| ->01.96% (2,030,560B) 0x804CD2D: append_children (node.c:151) -| | ->01.96% (2,030,560B) 0x804B668: yyparse (parser.y:169) -| | ->01.96% (2,030,560B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.96% (2,030,560B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.96% (2,030,560B) 0x8051749: main (main.c:30) -| | -| ->00.01% (7,536B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.91% (8,188,800B) 0x804F52E: new_generic_list (stack.c:18) -| ->07.91% (8,188,672B) 0x804CCFD: append_children (node.c:148) -| | ->07.91% (8,188,672B) 0x804B668: yyparse (parser.y:169) -| | ->07.91% (8,188,672B) 0x804AFCA: parse_file (parser.y:67) -| | ->07.91% (8,188,672B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->07.91% (8,188,672B) 0x8051749: main (main.c:30) -| | -| ->00.00% (128B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.81% (7,046,340B) 0x804CECF: new_attribute (node.c:192) -| ->06.81% (7,046,340B) 0x804B8C1: yyparse (parser.y:222) -| ->06.81% (7,046,340B) 0x804AFCA: parse_file (parser.y:67) -| ->06.81% (7,046,340B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->06.81% (7,046,340B) 0x8051749: main (main.c:30) -| -->04.97% (5,147,426B) 0x804CE69: new_text_node (node.c:183) -| ->04.97% (5,147,426B) 0x804B7BD: yyparse (parser.y:196) -| ->04.97% (5,147,426B) 0x804AFCA: parse_file (parser.y:67) -| ->04.97% (5,147,426B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.97% (5,147,426B) 0x8051749: main (main.c:30) -| -->04.96% (5,138,944B) 0x804F716: refactor_generic_list (stack.c:59) -| ->04.96% (5,138,944B) 0x804FB1F: append_element (stack.c:144) -| ->04.05% (4,194,304B) 0x804FC8C: add_element (stack.c:180) -| | ->04.05% (4,194,304B) 0x805021C: push_stack (stack.c:311) -| | ->04.05% (4,194,304B) 0x80491FE: yylex (parser.l:32) -| | | ->04.05% (4,194,304B) 0x804B370: yyparse (y.tab.c:1517) -| | | ->04.05% (4,194,304B) 0x804AFCA: parse_file (parser.y:67) -| | | ->04.05% (4,194,304B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->04.05% (4,194,304B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.91% (944,640B) in 1+ places, all below ms_print's threshold (01.00%) -| -->04.86% (5,033,100B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->04.86% (5,033,100B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->04.86% (5,033,100B) 0x804CBDC: add_attribute (node.c:132) -| ->04.86% (5,033,100B) 0x804B89B: yyparse (parser.y:218) -| ->04.86% (5,033,100B) 0x804AFCA: parse_file (parser.y:67) -| ->04.86% (5,033,100B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->04.86% (5,033,100B) 0x8051749: main (main.c:30) -| -->03.48% (3,599,568B) 0x804CD8F: new_element_node (node.c:164) -| ->03.48% (3,599,428B) 0x804B874: yyparse (parser.y:215) -| | ->03.48% (3,599,428B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.48% (3,599,428B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.48% (3,599,428B) 0x8051749: main (main.c:30) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.41% (3,534,020B) 0x804CE2F: new_text_node (node.c:178) -| ->03.41% (3,534,020B) 0x804B7BD: yyparse (parser.y:196) -| ->03.41% (3,534,020B) 0x804AFCA: parse_file (parser.y:67) -| ->03.41% (3,534,020B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->03.41% (3,534,020B) 0x8051749: main (main.c:30) -| -->01.99% (2,056,832B) 0x804F4F8: new_generic_list (stack.c:13) -| ->01.99% (2,056,752B) 0x804CCFD: append_children (node.c:148) -| | ->01.99% (2,056,752B) 0x804B668: yyparse (parser.y:169) -| | ->01.99% (2,056,752B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.99% (2,056,752B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.99% (2,056,752B) 0x8051749: main (main.c:30) -| | -| ->00.00% (80B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.58% (1,636,150B) 0x804CF10: new_attribute (node.c:197) -| ->01.58% (1,636,150B) 0x804B8C1: yyparse (parser.y:222) -| ->01.58% (1,636,150B) 0x804AFCA: parse_file (parser.y:67) -| ->01.58% (1,636,150B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.58% (1,636,150B) 0x8051749: main (main.c:30) -| -->01.45% (1,505,268B) 0x804E815: new_rbtree (rbtree.c:39) -| ->01.45% (1,505,268B) 0x804CBC1: add_attribute (node.c:131) -| ->01.45% (1,505,268B) 0x804B89B: yyparse (parser.y:218) -| ->01.45% (1,505,268B) 0x804AFCA: parse_file (parser.y:67) -| ->01.45% (1,505,268B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.45% (1,505,268B) 0x8051749: main (main.c:30) -| -->01.42% (1,471,284B) 0x804CF47: new_attribute (node.c:199) -| ->01.42% (1,471,284B) 0x804B8C1: yyparse (parser.y:222) -| ->01.42% (1,471,284B) 0x804AFCA: parse_file (parser.y:67) -| ->01.42% (1,471,284B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->01.42% (1,471,284B) 0x8051749: main (main.c:30) -| -->00.05% (49,692B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 11 239,036,848 81,380,368 53,242,658 28,137,710 0 - 12 253,528,040 66,889,176 43,632,735 23,256,441 0 - 13 278,965,120 67,539,984 44,097,571 23,442,413 0 - 14 301,667,296 67,789,248 44,270,511 23,518,737 0 -65.31% (44,270,511B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->12.37% (8,384,704B) 0x804F52E: new_generic_list (stack.c:18) -| ->12.18% (8,257,152B) 0x804CCFD: append_children (node.c:148) -| | ->12.18% (8,257,152B) 0x804B668: yyparse (parser.y:169) -| | ->12.18% (8,257,152B) 0x804AFCA: parse_file (parser.y:67) -| | ->12.18% (8,257,152B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->12.18% (8,257,152B) 0x8051749: main (main.c:30) -| | -| ->00.19% (127,552B) in 1+ places, all below ms_print's threshold (01.00%) -| -->10.48% (7,104,972B) 0x804CECF: new_attribute (node.c:192) -| ->10.48% (7,104,972B) 0x804B8C1: yyparse (parser.y:222) -| ->10.48% (7,104,972B) 0x804AFCA: parse_file (parser.y:67) -| ->10.48% (7,104,972B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->10.48% (7,104,972B) 0x8051749: main (main.c:30) -| -->07.65% (5,188,706B) 0x804CE69: new_text_node (node.c:183) -| ->07.65% (5,188,706B) 0x804B7BD: yyparse (parser.y:196) -| ->07.65% (5,188,706B) 0x804AFCA: parse_file (parser.y:67) -| ->07.65% (5,188,706B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.65% (5,188,706B) 0x8051749: main (main.c:30) -| -->07.49% (5,074,980B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->07.49% (5,074,980B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->07.49% (5,074,980B) 0x804CBDC: add_attribute (node.c:132) -| ->07.49% (5,074,980B) 0x804B89B: yyparse (parser.y:218) -| ->07.49% (5,074,980B) 0x804AFCA: parse_file (parser.y:67) -| ->07.49% (5,074,980B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.49% (5,074,980B) 0x8051749: main (main.c:30) -| -->05.35% (3,629,528B) 0x804CD8F: new_element_node (node.c:164) -| ->05.35% (3,629,528B) 0x804B874: yyparse (parser.y:215) -| | ->05.35% (3,629,528B) 0x804AFCA: parse_file (parser.y:67) -| | ->05.35% (3,629,528B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->05.35% (3,629,528B) 0x8051749: main (main.c:30) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.26% (3,563,448B) 0x804CE2F: new_text_node (node.c:178) -| ->05.26% (3,563,448B) 0x804B7BD: yyparse (parser.y:196) -| ->05.26% (3,563,448B) 0x804AFCA: parse_file (parser.y:67) -| ->05.26% (3,563,448B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->05.26% (3,563,448B) 0x8051749: main (main.c:30) -| -->03.41% (2,310,224B) 0x804FB2B: append_element (stack.c:147) -| ->03.03% (2,055,120B) 0x804CAD3: append_child (node.c:112) -| | ->03.03% (2,055,120B) 0x804CD2D: append_children (node.c:151) -| | | ->03.03% (2,055,120B) 0x804B668: yyparse (parser.y:169) -| | | ->03.03% (2,055,120B) 0x804AFCA: parse_file (parser.y:67) -| | | ->03.03% (2,055,120B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->03.03% (2,055,120B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.38% (255,104B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.06% (2,074,048B) 0x804F4F8: new_generic_list (stack.c:13) -| ->03.06% (2,074,000B) 0x804CCFD: append_children (node.c:148) -| | ->03.06% (2,074,000B) 0x804B668: yyparse (parser.y:169) -| | ->03.06% (2,074,000B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.06% (2,074,000B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.06% (2,074,000B) 0x8051749: main (main.c:30) -| | -| ->00.00% (48B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.43% (1,649,765B) 0x804CF10: new_attribute (node.c:197) -| ->02.43% (1,649,765B) 0x804B8C1: yyparse (parser.y:222) -| ->02.43% (1,649,765B) 0x804AFCA: parse_file (parser.y:67) -| ->02.43% (1,649,765B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.43% (1,649,765B) 0x8051749: main (main.c:30) -| -->02.24% (1,517,784B) 0x804E815: new_rbtree (rbtree.c:39) -| ->02.24% (1,517,784B) 0x804CBC1: add_attribute (node.c:131) -| ->02.24% (1,517,784B) 0x804B89B: yyparse (parser.y:218) -| ->02.24% (1,517,784B) 0x804AFCA: parse_file (parser.y:67) -| ->02.24% (1,517,784B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.24% (1,517,784B) 0x8051749: main (main.c:30) -| -->02.19% (1,483,582B) 0x804CF47: new_attribute (node.c:199) -| ->02.19% (1,483,582B) 0x804B8C1: yyparse (parser.y:222) -| ->02.19% (1,483,582B) 0x804AFCA: parse_file (parser.y:67) -| ->02.19% (1,483,582B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.19% (1,483,582B) 0x8051749: main (main.c:30) -| -->01.78% (1,207,664B) 0x804F716: refactor_generic_list (stack.c:59) -| ->01.78% (1,207,664B) 0x804FB1F: append_element (stack.c:144) -| ->01.41% (952,576B) 0x804CAD3: append_child (node.c:112) -| | ->01.41% (952,576B) 0x804CD2D: append_children (node.c:151) -| | | ->01.41% (952,576B) 0x804B668: yyparse (parser.y:169) -| | | ->01.41% (952,576B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.41% (952,576B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.41% (952,576B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.38% (255,088B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.52% (1,031,498B) 0x40B14AE: strdup (strdup.c:43) -| ->01.52% (1,031,498B) 0x804C6EC: set_name (node.c:26) -| | ->01.52% (1,031,494B) 0x804B7FC: yyparse (parser.y:202) -| | | ->01.52% (1,031,494B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.52% (1,031,494B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.52% (1,031,494B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (4B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->00.07% (49,608B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 15 318,887,328 67,653,600 44,087,939 23,565,661 0 - 16 333,018,008 68,073,704 44,473,711 23,599,993 0 - 17 350,627,736 67,811,848 44,182,247 23,629,601 0 - 18 372,983,552 68,362,048 44,679,671 23,682,377 0 - 19 386,542,072 68,000,312 44,295,971 23,704,341 0 - 20 409,012,880 68,085,408 44,346,219 23,739,189 0 - 21 427,218,000 68,406,448 44,639,487 23,766,961 0 - 22 445,330,664 68,753,272 44,959,111 23,794,161 0 - 23 472,721,560 68,576,104 44,752,591 23,823,513 0 - 24 486,440,184 68,352,872 44,507,507 23,845,365 0 - 25 509,401,312 68,422,208 44,549,111 23,873,097 0 - 26 526,940,392 68,465,512 44,575,091 23,890,421 0 - 27 545,091,224 68,506,728 44,598,991 23,907,737 0 - 28 567,310,408 69,245,992 45,311,051 23,934,941 0 - 29 582,547,792 69,314,928 45,360,291 23,954,637 0 - 30 598,048,432 69,352,416 45,387,071 23,965,345 0 - 31 621,369,240 69,440,728 45,450,151 23,990,577 0 - 32 644,693,224 68,781,288 44,763,955 24,017,333 0 - 33 667,832,176 68,834,608 44,796,551 24,038,057 0 - 34 683,585,592 68,854,568 44,807,695 24,046,873 0 - 35 699,538,968 68,878,168 44,821,855 24,056,313 0 - 36 715,821,320 68,916,632 44,845,023 24,071,609 0 - 37 738,994,472 68,960,680 44,871,519 24,089,161 0 - 38 754,181,712 68,992,784 44,890,663 24,102,121 0 - 39 769,543,480 69,023,128 44,909,075 24,114,053 0 -65.06% (44,909,075B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->12.58% (8,682,372B) 0x804F52E: new_generic_list (stack.c:18) -| ->11.96% (8,257,152B) 0x804CCFD: append_children (node.c:148) -| | ->11.96% (8,257,152B) 0x804B668: yyparse (parser.y:169) -| | ->11.96% (8,257,152B) 0x804AFCA: parse_file (parser.y:67) -| | ->11.96% (8,257,152B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->11.96% (8,257,152B) 0x8051749: main (main.c:30) -| | -| ->00.62% (425,220B) in 1+ places, all below ms_print's threshold (01.00%) -| -->10.29% (7,104,972B) 0x804CECF: new_attribute (node.c:192) -| ->10.29% (7,104,972B) 0x804B8C1: yyparse (parser.y:222) -| ->10.29% (7,104,972B) 0x804AFCA: parse_file (parser.y:67) -| ->10.29% (7,104,972B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->10.29% (7,104,972B) 0x8051749: main (main.c:30) -| -->07.52% (5,188,706B) 0x804CE69: new_text_node (node.c:183) -| ->07.52% (5,188,706B) 0x804B7BD: yyparse (parser.y:196) -| ->07.52% (5,188,706B) 0x804AFCA: parse_file (parser.y:67) -| ->07.52% (5,188,706B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.52% (5,188,706B) 0x8051749: main (main.c:30) -| -->07.35% (5,074,980B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->07.35% (5,074,980B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->07.35% (5,074,980B) 0x804CBDC: add_attribute (node.c:132) -| ->07.35% (5,074,980B) 0x804B89B: yyparse (parser.y:218) -| ->07.35% (5,074,980B) 0x804AFCA: parse_file (parser.y:67) -| ->07.35% (5,074,980B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.35% (5,074,980B) 0x8051749: main (main.c:30) -| -->05.26% (3,629,528B) 0x804CD8F: new_element_node (node.c:164) -| ->05.26% (3,629,528B) 0x804B874: yyparse (parser.y:215) -| | ->05.26% (3,629,528B) 0x804AFCA: parse_file (parser.y:67) -| | ->05.26% (3,629,528B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->05.26% (3,629,528B) 0x8051749: main (main.c:30) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.16% (3,563,448B) 0x804CE2F: new_text_node (node.c:178) -| ->05.16% (3,563,448B) 0x804B7BD: yyparse (parser.y:196) -| ->05.16% (3,563,448B) 0x804AFCA: parse_file (parser.y:67) -| ->05.16% (3,563,448B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->05.16% (3,563,448B) 0x8051749: main (main.c:30) -| -->04.21% (2,905,560B) 0x804FB2B: append_element (stack.c:147) -| ->02.98% (2,055,120B) 0x804CAD3: append_child (node.c:112) -| | ->02.98% (2,055,120B) 0x804CD2D: append_children (node.c:151) -| | | ->02.98% (2,055,120B) 0x804B668: yyparse (parser.y:169) -| | | ->02.98% (2,055,120B) 0x804AFCA: parse_file (parser.y:67) -| | | ->02.98% (2,055,120B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->02.98% (2,055,120B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.23% (850,440B) 0x804FC8C: add_element (stack.c:180) -| ->01.23% (850,440B) 0x804D2F8: get_descendants (node.c:294) -| | ->01.23% (845,848B) 0x804D2CE: get_descendants (node.c:292) -| | | ->01.21% (836,648B) 0x804D2CE: get_descendants (node.c:292) -| | | | ->01.21% (836,648B) 0x8051577: query (query_runner.c:207) -| | | | ->01.21% (836,648B) 0x8051767: main (main.c:39) -| | | | -| | | ->00.01% (9,200B) in 1+ places, all below ms_print's threshold (01.00%) -| | | -| | ->00.01% (4,592B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.00% (2,074,048B) 0x804F4F8: new_generic_list (stack.c:13) -| ->03.00% (2,074,000B) 0x804CCFD: append_children (node.c:148) -| | ->03.00% (2,074,000B) 0x804B668: yyparse (parser.y:169) -| | ->03.00% (2,074,000B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.00% (2,074,000B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.00% (2,074,000B) 0x8051749: main (main.c:30) -| | -| ->00.00% (48B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.39% (1,649,765B) 0x804CF10: new_attribute (node.c:197) -| ->02.39% (1,649,765B) 0x804B8C1: yyparse (parser.y:222) -| ->02.39% (1,649,765B) 0x804AFCA: parse_file (parser.y:67) -| ->02.39% (1,649,765B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.39% (1,649,765B) 0x8051749: main (main.c:30) -| -->02.20% (1,517,784B) 0x804E815: new_rbtree (rbtree.c:39) -| ->02.20% (1,517,784B) 0x804CBC1: add_attribute (node.c:131) -| ->02.20% (1,517,784B) 0x804B89B: yyparse (parser.y:218) -| ->02.20% (1,517,784B) 0x804AFCA: parse_file (parser.y:67) -| ->02.20% (1,517,784B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.20% (1,517,784B) 0x8051749: main (main.c:30) -| -->02.15% (1,483,582B) 0x804CF47: new_attribute (node.c:199) -| ->02.15% (1,483,582B) 0x804B8C1: yyparse (parser.y:222) -| ->02.15% (1,483,582B) 0x804AFCA: parse_file (parser.y:67) -| ->02.15% (1,483,582B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.15% (1,483,582B) 0x8051749: main (main.c:30) -| -->01.49% (1,031,498B) 0x40B14AE: strdup (strdup.c:43) -| ->01.49% (1,031,498B) 0x804C6EC: set_name (node.c:26) -| | ->01.49% (1,031,494B) 0x804B7FC: yyparse (parser.y:202) -| | | ->01.49% (1,031,494B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.49% (1,031,494B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.49% (1,031,494B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (4B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.38% (953,224B) 0x804F716: refactor_generic_list (stack.c:59) -| ->01.38% (953,224B) 0x804FB1F: append_element (stack.c:144) -| ->01.38% (952,576B) 0x804CAD3: append_child (node.c:112) -| | ->01.38% (952,576B) 0x804CD2D: append_children (node.c:151) -| | | ->01.38% (952,576B) 0x804B668: yyparse (parser.y:169) -| | | ->01.38% (952,576B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.38% (952,576B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.38% (952,576B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (648B) in 1+ places, all below ms_print's threshold (01.00%) -| -->00.07% (49,608B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 40 785,022,624 69,044,352 44,921,991 24,122,361 0 - 41 800,651,856 69,066,048 44,935,175 24,130,873 0 - 42 816,409,064 69,081,912 44,944,115 24,137,797 0 - 43 839,405,880 69,104,728 44,957,791 24,146,937 0 - 44 862,659,024 69,127,728 44,971,591 24,156,137 0 - 45 886,305,792 69,169,632 44,997,563 24,172,069 0 - 46 901,932,728 70,106,712 45,925,851 24,180,861 0 - 47 925,166,824 69,225,752 45,031,235 24,194,517 0 -65.05% (45,031,235B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->12.60% (8,722,604B) 0x804F52E: new_generic_list (stack.c:18) -| ->11.93% (8,257,152B) 0x804CCFD: append_children (node.c:148) -| | ->11.93% (8,257,152B) 0x804B668: yyparse (parser.y:169) -| | ->11.93% (8,257,152B) 0x804AFCA: parse_file (parser.y:67) -| | ->11.93% (8,257,152B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->11.93% (8,257,152B) 0x8051749: main (main.c:30) -| | -| ->00.67% (465,452B) in 1+ places, all below ms_print's threshold (01.00%) -| -->10.26% (7,104,972B) 0x804CECF: new_attribute (node.c:192) -| ->10.26% (7,104,972B) 0x804B8C1: yyparse (parser.y:222) -| ->10.26% (7,104,972B) 0x804AFCA: parse_file (parser.y:67) -| ->10.26% (7,104,972B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->10.26% (7,104,972B) 0x8051749: main (main.c:30) -| -->07.50% (5,188,706B) 0x804CE69: new_text_node (node.c:183) -| ->07.50% (5,188,706B) 0x804B7BD: yyparse (parser.y:196) -| ->07.50% (5,188,706B) 0x804AFCA: parse_file (parser.y:67) -| ->07.50% (5,188,706B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.50% (5,188,706B) 0x8051749: main (main.c:30) -| -->07.33% (5,074,980B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->07.33% (5,074,980B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->07.33% (5,074,980B) 0x804CBDC: add_attribute (node.c:132) -| ->07.33% (5,074,980B) 0x804B89B: yyparse (parser.y:218) -| ->07.33% (5,074,980B) 0x804AFCA: parse_file (parser.y:67) -| ->07.33% (5,074,980B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.33% (5,074,980B) 0x8051749: main (main.c:30) -| -->05.24% (3,629,528B) 0x804CD8F: new_element_node (node.c:164) -| ->05.24% (3,629,528B) 0x804B874: yyparse (parser.y:215) -| | ->05.24% (3,629,528B) 0x804AFCA: parse_file (parser.y:67) -| | ->05.24% (3,629,528B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->05.24% (3,629,528B) 0x8051749: main (main.c:30) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.15% (3,563,448B) 0x804CE2F: new_text_node (node.c:178) -| ->05.15% (3,563,448B) 0x804B7BD: yyparse (parser.y:196) -| ->05.15% (3,563,448B) 0x804AFCA: parse_file (parser.y:67) -| ->05.15% (3,563,448B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->05.15% (3,563,448B) 0x8051749: main (main.c:30) -| -->04.31% (2,986,024B) 0x804FB2B: append_element (stack.c:147) -| ->02.97% (2,055,120B) 0x804CAD3: append_child (node.c:112) -| | ->02.97% (2,055,120B) 0x804CD2D: append_children (node.c:151) -| | | ->02.97% (2,055,120B) 0x804B668: yyparse (parser.y:169) -| | | ->02.97% (2,055,120B) 0x804AFCA: parse_file (parser.y:67) -| | | ->02.97% (2,055,120B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->02.97% (2,055,120B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.34% (930,904B) 0x804FC8C: add_element (stack.c:180) -| ->01.34% (930,904B) 0x804D2F8: get_descendants (node.c:294) -| | ->01.34% (925,616B) 0x804D2CE: get_descendants (node.c:292) -| | | ->01.32% (915,024B) 0x804D2CE: get_descendants (node.c:292) -| | | | ->01.32% (915,024B) 0x8051577: query (query_runner.c:207) -| | | | ->01.32% (915,024B) 0x8051767: main (main.c:39) -| | | | -| | | ->00.02% (10,592B) in 1+ places, all below ms_print's threshold (01.00%) -| | | -| | ->00.01% (5,288B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.00% (2,074,048B) 0x804F4F8: new_generic_list (stack.c:13) -| ->03.00% (2,074,000B) 0x804CCFD: append_children (node.c:148) -| | ->03.00% (2,074,000B) 0x804B668: yyparse (parser.y:169) -| | ->03.00% (2,074,000B) 0x804AFCA: parse_file (parser.y:67) -| | ->03.00% (2,074,000B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->03.00% (2,074,000B) 0x8051749: main (main.c:30) -| | -| ->00.00% (48B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.38% (1,649,765B) 0x804CF10: new_attribute (node.c:197) -| ->02.38% (1,649,765B) 0x804B8C1: yyparse (parser.y:222) -| ->02.38% (1,649,765B) 0x804AFCA: parse_file (parser.y:67) -| ->02.38% (1,649,765B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.38% (1,649,765B) 0x8051749: main (main.c:30) -| -->02.19% (1,517,784B) 0x804E815: new_rbtree (rbtree.c:39) -| ->02.19% (1,517,784B) 0x804CBC1: add_attribute (node.c:131) -| ->02.19% (1,517,784B) 0x804B89B: yyparse (parser.y:218) -| ->02.19% (1,517,784B) 0x804AFCA: parse_file (parser.y:67) -| ->02.19% (1,517,784B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.19% (1,517,784B) 0x8051749: main (main.c:30) -| -->02.14% (1,483,582B) 0x804CF47: new_attribute (node.c:199) -| ->02.14% (1,483,582B) 0x804B8C1: yyparse (parser.y:222) -| ->02.14% (1,483,582B) 0x804AFCA: parse_file (parser.y:67) -| ->02.14% (1,483,582B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.14% (1,483,582B) 0x8051749: main (main.c:30) -| -->01.49% (1,031,498B) 0x40B14AE: strdup (strdup.c:43) -| ->01.49% (1,031,498B) 0x804C6EC: set_name (node.c:26) -| | ->01.49% (1,031,494B) 0x804B7FC: yyparse (parser.y:202) -| | | ->01.49% (1,031,494B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.49% (1,031,494B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.49% (1,031,494B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (4B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.38% (954,688B) 0x804F716: refactor_generic_list (stack.c:59) -| ->01.38% (954,688B) 0x804FB1F: append_element (stack.c:144) -| ->01.38% (952,576B) 0x804CAD3: append_child (node.c:112) -| | ->01.38% (952,576B) 0x804CD2D: append_children (node.c:151) -| | | ->01.38% (952,576B) 0x804B668: yyparse (parser.y:169) -| | | ->01.38% (952,576B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.38% (952,576B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.38% (952,576B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (2,112B) in 1+ places, all below ms_print's threshold (01.00%) -| -->00.07% (49,608B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 48 940,412,952 69,259,032 45,050,399 24,208,633 0 - 49 955,626,576 69,269,440 45,056,615 24,212,825 0 - 50 966,101,264 70,225,136 46,010,431 24,214,705 0 - 51 976,667,256 69,289,144 45,068,879 24,220,265 0 - 52 987,272,120 70,261,176 46,036,171 24,225,005 0 - 53 997,898,784 69,305,584 45,078,311 24,227,273 0 - 54 1,008,589,680 70,283,632 46,052,211 24,231,421 0 - 55 1,019,331,584 69,327,216 45,091,287 24,235,929 0 -65.04% (45,091,287B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->12.61% (8,743,304B) 0x804F52E: new_generic_list (stack.c:18) -| ->11.91% (8,257,152B) 0x804CCFD: append_children (node.c:148) -| | ->11.91% (8,257,152B) 0x804B668: yyparse (parser.y:169) -| | ->11.91% (8,257,152B) 0x804AFCA: parse_file (parser.y:67) -| | ->11.91% (8,257,152B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->11.91% (8,257,152B) 0x8051749: main (main.c:30) -| | -| ->00.70% (486,152B) in 1+ places, all below ms_print's threshold (01.00%) -| -->10.25% (7,104,972B) 0x804CECF: new_attribute (node.c:192) -| ->10.25% (7,104,972B) 0x804B8C1: yyparse (parser.y:222) -| ->10.25% (7,104,972B) 0x804AFCA: parse_file (parser.y:67) -| ->10.25% (7,104,972B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->10.25% (7,104,972B) 0x8051749: main (main.c:30) -| -->07.48% (5,188,706B) 0x804CE69: new_text_node (node.c:183) -| ->07.48% (5,188,706B) 0x804B7BD: yyparse (parser.y:196) -| ->07.48% (5,188,706B) 0x804AFCA: parse_file (parser.y:67) -| ->07.48% (5,188,706B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.48% (5,188,706B) 0x8051749: main (main.c:30) -| -->07.32% (5,074,980B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->07.32% (5,074,980B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->07.32% (5,074,980B) 0x804CBDC: add_attribute (node.c:132) -| ->07.32% (5,074,980B) 0x804B89B: yyparse (parser.y:218) -| ->07.32% (5,074,980B) 0x804AFCA: parse_file (parser.y:67) -| ->07.32% (5,074,980B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.32% (5,074,980B) 0x8051749: main (main.c:30) -| -->05.24% (3,629,528B) 0x804CD8F: new_element_node (node.c:164) -| ->05.24% (3,629,528B) 0x804B874: yyparse (parser.y:215) -| | ->05.24% (3,629,528B) 0x804AFCA: parse_file (parser.y:67) -| | ->05.24% (3,629,528B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->05.24% (3,629,528B) 0x8051749: main (main.c:30) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.14% (3,563,448B) 0x804CE2F: new_text_node (node.c:178) -| ->05.14% (3,563,448B) 0x804B7BD: yyparse (parser.y:196) -| ->05.14% (3,563,448B) 0x804AFCA: parse_file (parser.y:67) -| ->05.14% (3,563,448B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->05.14% (3,563,448B) 0x8051749: main (main.c:30) -| -->04.37% (3,027,424B) 0x804FB2B: append_element (stack.c:147) -| ->02.96% (2,055,120B) 0x804CAD3: append_child (node.c:112) -| | ->02.96% (2,055,120B) 0x804CD2D: append_children (node.c:151) -| | | ->02.96% (2,055,120B) 0x804B668: yyparse (parser.y:169) -| | | ->02.96% (2,055,120B) 0x804AFCA: parse_file (parser.y:67) -| | | ->02.96% (2,055,120B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->02.96% (2,055,120B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.40% (972,304B) 0x804FC8C: add_element (stack.c:180) -| ->01.40% (972,304B) 0x804D2F8: get_descendants (node.c:294) -| | ->01.39% (966,624B) 0x804D2CE: get_descendants (node.c:292) -| | | ->01.38% (955,248B) 0x804D2CE: get_descendants (node.c:292) -| | | | ->01.38% (955,248B) 0x8051577: query (query_runner.c:207) -| | | | ->01.38% (955,248B) 0x8051767: main (main.c:39) -| | | | -| | | ->00.02% (11,376B) in 1+ places, all below ms_print's threshold (01.00%) -| | | -| | ->00.01% (5,680B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.99% (2,074,048B) 0x804F4F8: new_generic_list (stack.c:13) -| ->02.99% (2,074,000B) 0x804CCFD: append_children (node.c:148) -| | ->02.99% (2,074,000B) 0x804B668: yyparse (parser.y:169) -| | ->02.99% (2,074,000B) 0x804AFCA: parse_file (parser.y:67) -| | ->02.99% (2,074,000B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->02.99% (2,074,000B) 0x8051749: main (main.c:30) -| | -| ->00.00% (48B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.38% (1,649,765B) 0x804CF10: new_attribute (node.c:197) -| ->02.38% (1,649,765B) 0x804B8C1: yyparse (parser.y:222) -| ->02.38% (1,649,765B) 0x804AFCA: parse_file (parser.y:67) -| ->02.38% (1,649,765B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.38% (1,649,765B) 0x8051749: main (main.c:30) -| -->02.19% (1,517,784B) 0x804E815: new_rbtree (rbtree.c:39) -| ->02.19% (1,517,784B) 0x804CBC1: add_attribute (node.c:131) -| ->02.19% (1,517,784B) 0x804B89B: yyparse (parser.y:218) -| ->02.19% (1,517,784B) 0x804AFCA: parse_file (parser.y:67) -| ->02.19% (1,517,784B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.19% (1,517,784B) 0x8051749: main (main.c:30) -| -->02.14% (1,483,582B) 0x804CF47: new_attribute (node.c:199) -| ->02.14% (1,483,582B) 0x804B8C1: yyparse (parser.y:222) -| ->02.14% (1,483,582B) 0x804AFCA: parse_file (parser.y:67) -| ->02.14% (1,483,582B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.14% (1,483,582B) 0x8051749: main (main.c:30) -| -->01.49% (1,031,498B) 0x40B14AE: strdup (strdup.c:43) -| ->01.49% (1,031,498B) 0x804C6EC: set_name (node.c:26) -| | ->01.49% (1,031,494B) 0x804B7FC: yyparse (parser.y:202) -| | | ->01.49% (1,031,494B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.49% (1,031,494B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.49% (1,031,494B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (4B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.37% (952,640B) 0x804F716: refactor_generic_list (stack.c:59) -| ->01.37% (952,640B) 0x804FB1F: append_element (stack.c:144) -| ->01.37% (952,576B) 0x804CAD3: append_child (node.c:112) -| | ->01.37% (952,576B) 0x804CD2D: append_children (node.c:151) -| | | ->01.37% (952,576B) 0x804B668: yyparse (parser.y:169) -| | | ->01.37% (952,576B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.37% (952,576B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.37% (952,576B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->00.07% (49,608B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 56 1,030,115,928 70,316,056 46,075,371 24,240,685 0 - 57 1,040,905,376 69,347,488 45,104,267 24,243,221 0 - 58 1,051,374,648 69,860,024 45,608,527 24,251,497 0 - 59 1,061,816,408 70,367,576 46,112,171 24,255,405 0 - 60 1,072,766,448 69,384,144 45,126,263 24,257,881 0 - 61 1,083,373,712 69,901,376 45,636,095 24,265,281 0 - 62 1,093,967,904 70,417,888 46,148,111 24,269,777 0 - 63 1,105,076,688 69,420,144 45,147,863 24,272,281 0 - 64 1,115,711,216 69,927,584 45,653,567 24,274,017 0 - 65 1,126,433,960 70,449,528 46,170,711 24,278,817 0 -65.54% (46,170,711B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->12.44% (8,764,744B) 0x804F52E: new_generic_list (stack.c:18) -| ->11.72% (8,257,152B) 0x804CCFD: append_children (node.c:148) -| | ->11.72% (8,257,152B) 0x804B668: yyparse (parser.y:169) -| | ->11.72% (8,257,152B) 0x804AFCA: parse_file (parser.y:67) -| | ->11.72% (8,257,152B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->11.72% (8,257,152B) 0x8051749: main (main.c:30) -| | -| ->00.72% (507,592B) in 1+ places, all below ms_print's threshold (01.00%) -| -->10.09% (7,104,972B) 0x804CECF: new_attribute (node.c:192) -| ->10.09% (7,104,972B) 0x804B8C1: yyparse (parser.y:222) -| ->10.09% (7,104,972B) 0x804AFCA: parse_file (parser.y:67) -| ->10.09% (7,104,972B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->10.09% (7,104,972B) 0x8051749: main (main.c:30) -| -->07.37% (5,188,706B) 0x804CE69: new_text_node (node.c:183) -| ->07.37% (5,188,706B) 0x804B7BD: yyparse (parser.y:196) -| ->07.37% (5,188,706B) 0x804AFCA: parse_file (parser.y:67) -| ->07.37% (5,188,706B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.37% (5,188,706B) 0x8051749: main (main.c:30) -| -->07.20% (5,074,980B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->07.20% (5,074,980B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->07.20% (5,074,980B) 0x804CBDC: add_attribute (node.c:132) -| ->07.20% (5,074,980B) 0x804B89B: yyparse (parser.y:218) -| ->07.20% (5,074,980B) 0x804AFCA: parse_file (parser.y:67) -| ->07.20% (5,074,980B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.20% (5,074,980B) 0x8051749: main (main.c:30) -| -->05.15% (3,629,528B) 0x804CD8F: new_element_node (node.c:164) -| ->05.15% (3,629,528B) 0x804B874: yyparse (parser.y:215) -| | ->05.15% (3,629,528B) 0x804AFCA: parse_file (parser.y:67) -| | ->05.15% (3,629,528B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->05.15% (3,629,528B) 0x8051749: main (main.c:30) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.06% (3,563,448B) 0x804CE2F: new_text_node (node.c:178) -| ->05.06% (3,563,448B) 0x804B7BD: yyparse (parser.y:196) -| ->05.06% (3,563,448B) 0x804AFCA: parse_file (parser.y:67) -| ->05.06% (3,563,448B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->05.06% (3,563,448B) 0x8051749: main (main.c:30) -| -->04.36% (3,070,304B) 0x804FB2B: append_element (stack.c:147) -| ->02.92% (2,055,120B) 0x804CAD3: append_child (node.c:112) -| | ->02.92% (2,055,120B) 0x804CD2D: append_children (node.c:151) -| | | ->02.92% (2,055,120B) 0x804B668: yyparse (parser.y:169) -| | | ->02.92% (2,055,120B) 0x804AFCA: parse_file (parser.y:67) -| | | ->02.92% (2,055,120B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->02.92% (2,055,120B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.44% (1,015,184B) 0x804FC8C: add_element (stack.c:180) -| ->01.44% (1,015,184B) 0x804D2F8: get_descendants (node.c:294) -| | ->01.43% (1,009,072B) 0x804D2CE: get_descendants (node.c:292) -| | | ->01.41% (996,832B) 0x804D2CE: get_descendants (node.c:292) -| | | | ->01.41% (996,832B) 0x8051577: query (query_runner.c:207) -| | | | ->01.41% (996,832B) 0x8051767: main (main.c:39) -| | | | -| | | ->00.02% (12,240B) in 1+ places, all below ms_print's threshold (01.00%) -| | | -| | ->00.01% (6,112B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.94% (2,074,048B) 0x804F4F8: new_generic_list (stack.c:13) -| ->02.94% (2,074,000B) 0x804CCFD: append_children (node.c:148) -| | ->02.94% (2,074,000B) 0x804B668: yyparse (parser.y:169) -| | ->02.94% (2,074,000B) 0x804AFCA: parse_file (parser.y:67) -| | ->02.94% (2,074,000B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->02.94% (2,074,000B) 0x8051749: main (main.c:30) -| | -| ->00.00% (48B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.79% (1,967,744B) 0x804F716: refactor_generic_list (stack.c:59) -| ->02.79% (1,967,744B) 0x804FB1F: append_element (stack.c:144) -| ->01.44% (1,015,168B) 0x804FC8C: add_element (stack.c:180) -| | ->01.44% (1,015,168B) 0x804D2F8: get_descendants (node.c:294) -| | | ->01.44% (1,015,008B) 0x8051577: query (query_runner.c:207) -| | | | ->01.44% (1,015,008B) 0x8051767: main (main.c:39) -| | | | -| | | ->00.00% (160B) in 1+ places, all below ms_print's threshold (01.00%) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.35% (952,576B) 0x804CAD3: append_child (node.c:112) -| ->01.35% (952,576B) 0x804CD2D: append_children (node.c:151) -| | ->01.35% (952,576B) 0x804B668: yyparse (parser.y:169) -| | ->01.35% (952,576B) 0x804AFCA: parse_file (parser.y:67) -| | ->01.35% (952,576B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->01.35% (952,576B) 0x8051749: main (main.c:30) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.34% (1,649,765B) 0x804CF10: new_attribute (node.c:197) -| ->02.34% (1,649,765B) 0x804B8C1: yyparse (parser.y:222) -| ->02.34% (1,649,765B) 0x804AFCA: parse_file (parser.y:67) -| ->02.34% (1,649,765B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.34% (1,649,765B) 0x8051749: main (main.c:30) -| -->02.15% (1,517,784B) 0x804E815: new_rbtree (rbtree.c:39) -| ->02.15% (1,517,784B) 0x804CBC1: add_attribute (node.c:131) -| ->02.15% (1,517,784B) 0x804B89B: yyparse (parser.y:218) -| ->02.15% (1,517,784B) 0x804AFCA: parse_file (parser.y:67) -| ->02.15% (1,517,784B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.15% (1,517,784B) 0x8051749: main (main.c:30) -| -->02.11% (1,483,582B) 0x804CF47: new_attribute (node.c:199) -| ->02.11% (1,483,582B) 0x804B8C1: yyparse (parser.y:222) -| ->02.11% (1,483,582B) 0x804AFCA: parse_file (parser.y:67) -| ->02.11% (1,483,582B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.11% (1,483,582B) 0x8051749: main (main.c:30) -| -->01.46% (1,031,498B) 0x40B14AE: strdup (strdup.c:43) -| ->01.46% (1,031,498B) 0x804C6EC: set_name (node.c:26) -| | ->01.46% (1,031,494B) 0x804B7FC: yyparse (parser.y:202) -| | | ->01.46% (1,031,494B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.46% (1,031,494B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.46% (1,031,494B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (4B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->00.07% (49,608B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 66 1,136,744,160 70,479,488 46,192,111 24,287,377 0 - 67 1,148,028,264 69,458,728 45,170,243 24,288,485 0 - 68 1,158,441,824 69,482,048 45,185,003 24,297,045 0 - 69 1,168,853,208 69,488,360 45,188,035 24,300,325 0 - 70 1,179,151,568 71,471,552 46,957,343 24,514,209 0 - 71 1,189,449,960 69,944,696 45,675,509 24,269,187 0 - 72 1,199,748,336 69,944,624 45,675,471 24,269,153 0 - 73 1,210,046,704 69,944,512 45,675,341 24,269,171 0 - 74 1,220,345,080 69,944,712 45,675,515 24,269,197 0 - 75 1,230,643,440 69,944,544 45,675,365 24,269,179 0 -65.30% (45,675,365B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->13.29% (9,294,136B) 0x804F52E: new_generic_list (stack.c:18) -| ->11.81% (8,257,152B) 0x804CCFD: append_children (node.c:148) -| | ->11.81% (8,257,152B) 0x804B668: yyparse (parser.y:169) -| | ->11.81% (8,257,152B) 0x804AFCA: parse_file (parser.y:67) -| | ->11.81% (8,257,152B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->11.81% (8,257,152B) 0x8051749: main (main.c:30) -| | -| ->01.48% (1,036,984B) 0x8050862: remove_duplicates (stack.c:439) -| | ->01.48% (1,036,984B) 0x80516C7: query (query_runner.c:247) -| | ->01.48% (1,036,984B) 0x8051767: main (main.c:39) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->10.16% (7,104,972B) 0x804CECF: new_attribute (node.c:192) -| ->10.16% (7,104,972B) 0x804B8C1: yyparse (parser.y:222) -| ->10.16% (7,104,972B) 0x804AFCA: parse_file (parser.y:67) -| ->10.16% (7,104,972B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->10.16% (7,104,972B) 0x8051749: main (main.c:30) -| -->07.42% (5,188,706B) 0x804CE69: new_text_node (node.c:183) -| ->07.42% (5,188,706B) 0x804B7BD: yyparse (parser.y:196) -| ->07.42% (5,188,706B) 0x804AFCA: parse_file (parser.y:67) -| ->07.42% (5,188,706B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.42% (5,188,706B) 0x8051749: main (main.c:30) -| -->07.26% (5,074,980B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->07.26% (5,074,980B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->07.26% (5,074,980B) 0x804CBDC: add_attribute (node.c:132) -| ->07.26% (5,074,980B) 0x804B89B: yyparse (parser.y:218) -| ->07.26% (5,074,980B) 0x804AFCA: parse_file (parser.y:67) -| ->07.26% (5,074,980B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.26% (5,074,980B) 0x8051749: main (main.c:30) -| -->05.19% (3,629,528B) 0x804CD8F: new_element_node (node.c:164) -| ->05.19% (3,629,528B) 0x804B874: yyparse (parser.y:215) -| | ->05.19% (3,629,528B) 0x804AFCA: parse_file (parser.y:67) -| | ->05.19% (3,629,528B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->05.19% (3,629,528B) 0x8051749: main (main.c:30) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.09% (3,563,448B) 0x804CE2F: new_text_node (node.c:178) -| ->05.09% (3,563,448B) 0x804B7BD: yyparse (parser.y:196) -| ->05.09% (3,563,448B) 0x804AFCA: parse_file (parser.y:67) -| ->05.09% (3,563,448B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->05.09% (3,563,448B) 0x8051749: main (main.c:30) -| -->04.38% (3,060,672B) 0x804FB2B: append_element (stack.c:147) -| ->02.94% (2,055,120B) 0x804CAD3: append_child (node.c:112) -| | ->02.94% (2,055,120B) 0x804CD2D: append_children (node.c:151) -| | | ->02.94% (2,055,120B) 0x804B668: yyparse (parser.y:169) -| | | ->02.94% (2,055,120B) 0x804AFCA: parse_file (parser.y:67) -| | | ->02.94% (2,055,120B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->02.94% (2,055,120B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.44% (1,005,552B) 0x804FC8C: add_element (stack.c:180) -| | ->01.44% (1,005,544B) 0x80508F4: remove_duplicates (stack.c:445) -| | | ->01.44% (1,005,544B) 0x80516C7: query (query_runner.c:247) -| | | ->01.44% (1,005,544B) 0x8051767: main (main.c:39) -| | | -| | ->00.00% (8B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.97% (2,074,016B) 0x804F4F8: new_generic_list (stack.c:13) -| ->02.97% (2,074,000B) 0x804CCFD: append_children (node.c:148) -| | ->02.97% (2,074,000B) 0x804B668: yyparse (parser.y:169) -| | ->02.97% (2,074,000B) 0x804AFCA: parse_file (parser.y:67) -| | ->02.97% (2,074,000B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->02.97% (2,074,000B) 0x8051749: main (main.c:30) -| | -| ->00.00% (16B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.36% (1,649,765B) 0x804CF10: new_attribute (node.c:197) -| ->02.36% (1,649,765B) 0x804B8C1: yyparse (parser.y:222) -| ->02.36% (1,649,765B) 0x804AFCA: parse_file (parser.y:67) -| ->02.36% (1,649,765B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.36% (1,649,765B) 0x8051749: main (main.c:30) -| -->02.17% (1,517,784B) 0x804E815: new_rbtree (rbtree.c:39) -| ->02.17% (1,517,784B) 0x804CBC1: add_attribute (node.c:131) -| ->02.17% (1,517,784B) 0x804B89B: yyparse (parser.y:218) -| ->02.17% (1,517,784B) 0x804AFCA: parse_file (parser.y:67) -| ->02.17% (1,517,784B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.17% (1,517,784B) 0x8051749: main (main.c:30) -| -->02.12% (1,483,582B) 0x804CF47: new_attribute (node.c:199) -| ->02.12% (1,483,582B) 0x804B8C1: yyparse (parser.y:222) -| ->02.12% (1,483,582B) 0x804AFCA: parse_file (parser.y:67) -| ->02.12% (1,483,582B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.12% (1,483,582B) 0x8051749: main (main.c:30) -| -->01.47% (1,031,498B) 0x40B14AE: strdup (strdup.c:43) -| ->01.47% (1,031,498B) 0x804C6EC: set_name (node.c:26) -| | ->01.47% (1,031,494B) 0x804B7FC: yyparse (parser.y:202) -| | | ->01.47% (1,031,494B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.47% (1,031,494B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.47% (1,031,494B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (4B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.36% (952,576B) 0x804F716: refactor_generic_list (stack.c:59) -| ->01.36% (952,576B) 0x804FB1F: append_element (stack.c:144) -| ->01.36% (952,576B) 0x804CAD3: append_child (node.c:112) -| | ->01.36% (952,576B) 0x804CD2D: append_children (node.c:151) -| | | ->01.36% (952,576B) 0x804B668: yyparse (parser.y:169) -| | | ->01.36% (952,576B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.36% (952,576B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.36% (952,576B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->00.07% (49,702B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 76 1,240,941,816 69,944,536 45,675,357 24,269,179 0 - 77 1,251,240,248 69,944,392 45,675,271 24,269,121 0 - 78 1,261,538,648 69,944,728 45,675,559 24,269,169 0 - 79 1,271,837,128 69,944,392 45,675,271 24,269,121 0 - 80 1,282,135,488 69,944,624 45,675,443 24,269,181 0 - 81 1,292,433,864 69,944,392 45,675,271 24,269,121 0 - 82 1,302,732,320 69,944,704 45,675,543 24,269,161 0 - 83 1,313,030,672 69,944,480 45,675,325 24,269,155 0 - 84 1,323,329,032 68,467,672 44,712,080 23,755,592 0 - 85 1,333,627,392 58,758,400 38,381,577 20,376,823 0 -65.32% (38,381,577B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->13.47% (7,912,760B) 0x804F52E: new_generic_list (stack.c:18) -| ->11.70% (6,875,776B) 0x804CCFD: append_children (node.c:148) -| | ->11.70% (6,875,776B) 0x804B668: yyparse (parser.y:169) -| | ->11.70% (6,875,776B) 0x804AFCA: parse_file (parser.y:67) -| | ->11.70% (6,875,776B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->11.70% (6,875,776B) 0x8051749: main (main.c:30) -| | -| ->01.76% (1,036,984B) 0x8050862: remove_duplicates (stack.c:439) -| | ->01.76% (1,036,984B) 0x80516C7: query (query_runner.c:247) -| | ->01.76% (1,036,984B) 0x8051767: main (main.c:39) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->10.06% (5,912,788B) 0x804CECF: new_attribute (node.c:192) -| ->10.06% (5,912,788B) 0x804B8C1: yyparse (parser.y:222) -| ->10.06% (5,912,788B) 0x804AFCA: parse_file (parser.y:67) -| ->10.06% (5,912,788B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->10.06% (5,912,788B) 0x8051749: main (main.c:30) -| -->07.36% (4,325,865B) 0x804CE69: new_text_node (node.c:183) -| ->07.36% (4,325,865B) 0x804B7BD: yyparse (parser.y:196) -| ->07.36% (4,325,865B) 0x804AFCA: parse_file (parser.y:67) -| ->07.36% (4,325,865B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.36% (4,325,865B) 0x8051749: main (main.c:30) -| -->07.19% (4,223,420B) 0x804E776: new_rbtree_node (rbtree.c:15) -| ->07.19% (4,223,420B) 0x804EB44: rb_tree_insert (rbtree.c:146) -| ->07.19% (4,223,420B) 0x804CBDC: add_attribute (node.c:132) -| ->07.19% (4,223,420B) 0x804B89B: yyparse (parser.y:218) -| ->07.19% (4,223,420B) 0x804AFCA: parse_file (parser.y:67) -| ->07.19% (4,223,420B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->07.19% (4,223,420B) 0x8051749: main (main.c:30) -| -->05.14% (3,022,460B) 0x804CD8F: new_element_node (node.c:164) -| ->05.14% (3,022,460B) 0x804B874: yyparse (parser.y:215) -| | ->05.14% (3,022,460B) 0x804AFCA: parse_file (parser.y:67) -| | ->05.14% (3,022,460B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->05.14% (3,022,460B) 0x8051749: main (main.c:30) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.05% (2,965,788B) 0x804CE2F: new_text_node (node.c:178) -| ->05.05% (2,965,788B) 0x804B7BD: yyparse (parser.y:196) -| ->05.05% (2,965,788B) 0x804AFCA: parse_file (parser.y:67) -| ->05.05% (2,965,788B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->05.05% (2,965,788B) 0x8051749: main (main.c:30) -| -->04.63% (2,717,624B) 0x804FB2B: append_element (stack.c:147) -| ->02.91% (1,712,072B) 0x804CAD3: append_child (node.c:112) -| | ->02.91% (1,712,072B) 0x804CD2D: append_children (node.c:151) -| | | ->02.91% (1,712,072B) 0x804B668: yyparse (parser.y:169) -| | | ->02.91% (1,712,072B) 0x804AFCA: parse_file (parser.y:67) -| | | ->02.91% (1,712,072B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->02.91% (1,712,072B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.71% (1,005,552B) 0x804FC8C: add_element (stack.c:180) -| | ->01.71% (1,005,544B) 0x80508F4: remove_duplicates (stack.c:445) -| | | ->01.71% (1,005,544B) 0x80516C7: query (query_runner.c:247) -| | | ->01.71% (1,005,544B) 0x8051767: main (main.c:39) -| | | -| | ->00.00% (8B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.94% (1,727,120B) 0x804F4F8: new_generic_list (stack.c:13) -| ->02.94% (1,727,104B) 0x804CCFD: append_children (node.c:148) -| | ->02.94% (1,727,104B) 0x804B668: yyparse (parser.y:169) -| | ->02.94% (1,727,104B) 0x804AFCA: parse_file (parser.y:67) -| | ->02.94% (1,727,104B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | ->02.94% (1,727,104B) 0x8051749: main (main.c:30) -| | -| ->00.00% (16B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.34% (1,372,952B) 0x804CF10: new_attribute (node.c:197) -| ->02.34% (1,372,952B) 0x804B8C1: yyparse (parser.y:222) -| ->02.34% (1,372,952B) 0x804AFCA: parse_file (parser.y:67) -| ->02.34% (1,372,952B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.34% (1,372,952B) 0x8051749: main (main.c:30) -| -->02.15% (1,262,988B) 0x804E815: new_rbtree (rbtree.c:39) -| ->02.15% (1,262,988B) 0x804CBC1: add_attribute (node.c:131) -| ->02.15% (1,262,988B) 0x804B89B: yyparse (parser.y:218) -| ->02.15% (1,262,988B) 0x804AFCA: parse_file (parser.y:67) -| ->02.15% (1,262,988B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.15% (1,262,988B) 0x8051749: main (main.c:30) -| -->02.11% (1,238,223B) 0x804CF47: new_attribute (node.c:199) -| ->02.11% (1,238,223B) 0x804B8C1: yyparse (parser.y:222) -| ->02.11% (1,238,223B) 0x804AFCA: parse_file (parser.y:67) -| ->02.11% (1,238,223B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| ->02.11% (1,238,223B) 0x8051749: main (main.c:30) -| -->01.46% (858,813B) 0x40B14AE: strdup (strdup.c:43) -| ->01.46% (858,813B) 0x804C6EC: set_name (node.c:26) -| | ->01.46% (858,809B) 0x804B7FC: yyparse (parser.y:202) -| | | ->01.46% (858,809B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.46% (858,809B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.46% (858,809B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (4B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.35% (791,168B) 0x804F716: refactor_generic_list (stack.c:59) -| ->01.35% (791,168B) 0x804FB1F: append_element (stack.c:144) -| ->01.35% (791,168B) 0x804CAD3: append_child (node.c:112) -| | ->01.35% (791,168B) 0x804CD2D: append_children (node.c:151) -| | | ->01.35% (791,168B) 0x804B668: yyparse (parser.y:169) -| | | ->01.35% (791,168B) 0x804AFCA: parse_file (parser.y:67) -| | | ->01.35% (791,168B) 0x8048CA6: parse_dom (lxq_parser.c:20) -| | | ->01.35% (791,168B) 0x8051749: main (main.c:30) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->00.08% (49,608B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 86 1,343,925,752 49,048,904 32,050,794 16,998,110 0 - 87 1,354,224,120 39,340,264 25,720,869 13,619,395 0 - 88 1,364,522,480 29,629,680 19,390,511 10,239,169 0 - 89 1,374,820,840 19,920,408 13,058,080 6,862,328 0 - 90 1,385,119,216 10,208,304 6,724,624 3,483,680 0 diff --git a/profiling/dom_size.c b/profiling/dom_size.c deleted file mode 100644 index 6250238..0000000 --- a/profiling/dom_size.c +++ /dev/null @@ -1,71 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include "../include/node.h" -#include "../include/lxq_parser.h" -#include "../include/stack.h" -#include "../include/query_runner.h" -#include "../include/node.h" - -void get_size(dom_node* n, int *size){ - int i; - *size += sizeof(n); - switch(n->type){ - case CDATA: - case TEXT_NODE: - *size += strlen(n->value)*sizeof(char); - break; - case ATTRIBUTE: - *size += strlen(n->name)*sizeof(char); - *size += strlen(n->value)*sizeof(char); - break; - case ELEMENT: - if(n->children != NULL) - for(i = 0; i < n->children->count; i++){ get_size(get_element_at(n->children, i), size); } - - if(n->attributes != NULL){ - struct siterator *it = new_tree_iterator(n->attributes); - while(tree_iterator_has_next(it)){ get_size(tree_iterator_next(it), size); } - destroy_iterator(it); - } - *size += strlen(n->name)*sizeof(char); - if(n->namespace != NULL) *size += strlen(n->namespace)*sizeof(char); - break; - } -} - -int main(int argc, char** argv){ - if(argc != 2){ - printf("usage: %s \"xml_file\"\n", argv[0]); - return 0; - } - - doc* document = parse_xml(argv[1]); - int i = 0; - get_size(document->root, &i); - printf("%d kB\n", i / 1024); -} - diff --git a/profiling/sem_remove_dups_e_quick_sort.gprof b/profiling/sem_remove_dups_e_quick_sort.gprof deleted file mode 100644 index 4187003..0000000 --- a/profiling/sem_remove_dups_e_quick_sort.gprof +++ /dev/null @@ -1,765 +0,0 @@ -Flat profile: - -Each sample counts as 0.01 seconds. - % cumulative self self total - time seconds seconds calls ms/call ms/call name - 35.82 0.24 0.24 129624 0.00 0.00 merge_lists - 14.93 0.34 0.10 894017 0.00 0.00 remove_element_at - 13.43 0.43 0.09 2303395 0.00 0.00 yylex - 11.94 0.51 0.08 1788810 0.00 0.00 append_element - 4.48 0.54 0.03 14448262 0.00 0.00 __pointer - 2.99 0.56 0.02 1403071 0.00 0.00 get_element_and_type_at - 2.99 0.58 0.02 126483 0.00 0.00 __destroy_rbtree - 1.49 0.59 0.01 7224131 0.00 0.00 __compare_by_pointer - 1.49 0.60 0.01 1403071 0.00 0.00 get_element_at - 1.49 0.61 0.01 513002 0.00 0.00 destroy_dom_node - 1.49 0.62 0.01 502776 0.00 0.00 destroy_byte_buffer - 1.49 0.63 0.01 390451 0.00 0.00 destroy_generic_list - 1.49 0.64 0.01 379443 0.00 0.00 rb_tree_insert - 1.49 0.65 0.01 252176 0.00 0.00 new_tree_iterator - 1.49 0.66 0.01 251388 0.00 0.00 __dom_node_to_xml - 1.49 0.67 0.01 1 10.00 10.00 new_simple_rbtree - 0.00 0.67 0.00 2569717 0.00 0.00 __alloc - 0.00 0.67 0.00 2560282 0.00 0.00 __alloc - 0.00 0.67 0.00 2513880 0.00 0.00 append_bytes_to_buffer - 0.00 0.67 0.00 2388186 0.00 0.00 append_string_to_buffer - 0.00 0.67 0.00 1275029 0.00 0.00 add_element - 0.00 0.67 0.00 1256940 0.00 0.00 __alloc - 0.00 0.67 0.00 894016 0.00 0.00 pop_stack - 0.00 0.67 0.00 894016 0.00 0.00 push_stack - 0.00 0.67 0.00 772251 0.00 0.00 new_element_node - 0.00 0.67 0.00 763602 0.00 0.00 key - 0.00 0.67 0.00 758102 0.00 0.00 __alloc - 0.00 0.67 0.00 757313 0.00 0.00 tree_iterator_has_next - 0.00 0.67 0.00 642626 0.00 0.00 get_name - 0.00 0.67 0.00 628470 0.00 0.00 new_byte_buffer - 0.00 0.67 0.00 513780 0.00 0.00 append_child - 0.00 0.67 0.00 505137 0.00 0.00 tree_iterator_next - 0.00 0.67 0.00 502776 0.00 0.00 append_buffer_to_buffer - 0.00 0.67 0.00 390453 0.00 0.00 new_generic_list - 0.00 0.67 0.00 383375 0.00 0.00 get_namespace - 0.00 0.67 0.00 383375 0.00 0.00 set_namespace - 0.00 0.67 0.00 381801 0.00 0.00 compare - 0.00 0.67 0.00 379443 0.00 0.00 new_rbtree_node - 0.00 0.67 0.00 379443 0.00 0.00 rb_tree_insert_fixup - 0.00 0.67 0.00 253749 0.00 0.00 add_attribute - 0.00 0.67 0.00 253749 0.00 0.00 new_attribute - 0.00 0.67 0.00 252176 0.00 0.00 destroy_iterator - 0.00 0.67 0.00 251388 0.00 0.00 __attribute_to_xml - 0.00 0.67 0.00 129626 0.00 0.00 set_name - 0.00 0.67 0.00 129625 0.00 0.00 append_children - 0.00 0.67 0.00 129625 0.00 0.00 get_children - 0.00 0.67 0.00 127266 0.00 0.00 new_text_node - 0.00 0.67 0.00 126483 0.00 0.00 destroy_rbtree - 0.00 0.67 0.00 126483 0.00 0.00 new_rbtree - 0.00 0.67 0.00 125695 0.00 0.00 generic_list_iterator_has_next - 0.00 0.67 0.00 125694 0.00 0.00 __node_list_to_xml - 0.00 0.67 0.00 125694 0.00 0.00 generic_list_iterator_next - 0.00 0.67 0.00 125694 0.00 0.00 node_to_string - 0.00 0.67 0.00 122708 0.00 0.00 left_rbrotate - 0.00 0.67 0.00 13629 0.00 0.00 refactor_generic_list - 0.00 0.67 0.00 935 0.00 0.00 right_rbrotate - 0.00 0.67 0.00 4 0.00 0.00 new_stack - 0.00 0.67 0.00 4 0.00 0.00 yy_load_buffer_state - 0.00 0.67 0.00 4 0.00 0.00 yyalloc - 0.00 0.67 0.00 4 0.00 0.00 yydestruct - 0.00 0.67 0.00 4 0.00 0.00 yyfree - 0.00 0.67 0.00 3 0.00 0.00 yy_get_next_buffer - 0.00 0.67 0.00 2 0.00 0.00 __alloc - 0.00 0.67 0.00 2 0.00 0.00 yy_delete_buffer - 0.00 0.67 0.00 2 0.00 0.00 yy_init_globals - 0.00 0.67 0.00 2 0.00 0.00 yy_scan_buffer - 0.00 0.67 0.00 2 0.00 0.00 yy_switch_to_buffer - 0.00 0.67 0.00 2 0.00 0.00 yyensure_buffer_stack - 0.00 0.67 0.00 2 0.00 0.00 yylex_destroy - 0.00 0.67 0.00 2 0.00 119.52 yyparse - 0.00 0.67 0.00 2 0.00 0.00 yywrap - 0.00 0.67 0.00 1 0.00 0.00 __alloc - 0.00 0.67 0.00 1 0.00 0.00 __alloc - 0.00 0.67 0.00 1 0.00 0.00 add_element_with_type - 0.00 0.67 0.00 1 0.00 0.00 dequeue - 0.00 0.67 0.00 1 0.00 0.00 destroy_dom_tree - 0.00 0.67 0.00 1 0.00 0.00 destroy_generic_list_iterator - 0.00 0.67 0.00 1 0.00 0.00 destroy_selector - 0.00 0.67 0.00 1 0.00 0.00 enqueue_with_type - 0.00 0.67 0.00 1 0.00 11.08 filter_nodes_by_name - 0.00 0.67 0.00 1 0.00 11.08 filter_nodes_by_selector - 0.00 0.67 0.00 1 0.00 254.65 get_descendants - 0.00 0.67 0.00 1 0.00 0.00 new_document - 0.00 0.67 0.00 1 0.00 0.00 new_generic_list_iterator - 0.00 0.67 0.00 1 0.00 0.00 new_queue - 0.00 0.67 0.00 1 0.00 0.00 new_selector - 0.00 0.67 0.00 1 0.00 219.52 parse_dom - 0.00 0.67 0.00 1 0.00 119.52 parse_file - 0.00 0.67 0.00 1 0.00 119.52 parse_query - 0.00 0.67 0.00 1 0.00 119.52 parse_string - 0.00 0.67 0.00 1 0.00 0.00 peek_queue_type - 0.00 0.67 0.00 1 0.00 420.12 query - 0.00 0.67 0.00 1 0.00 0.00 set_doc_root - 0.00 0.67 0.00 1 0.00 0.00 set_xml_declaration - 0.00 0.67 0.00 1 0.00 0.00 yy_get_previous_state - - % the percentage of the total running time of the -time program used by this function. - -cumulative a running sum of the number of seconds accounted - seconds for by this function and those listed above it. - - self the number of seconds accounted for by this -seconds function alone. This is the major sort for this - listing. - -calls the number of times this function was invoked, if - this function is profiled, else blank. - - self the average number of milliseconds spent in this -ms/call function per call, if this function is profiled, - else blank. - - total the average number of milliseconds spent in this -ms/call function and its descendents per call, if this - function is profiled, else blank. - -name the name of the function. This is the minor sort - for this listing. The index shows the location of - the function in the gprof listing. If the index is - in parenthesis it shows where it would appear in - the gprof listing if it were to be printed. - - Call graph (explanation follows) - - -granularity: each sample hit covers 4 byte(s) for 1.49% of 0.67 seconds - -index % time self children called name - -[1] 100.0 0.00 0.67 main [1] - 0.00 0.42 1/1 query [2] - 0.00 0.22 1/1 parse_dom [6] - 0.00 0.03 125694/125694 node_to_string [22] - 0.00 0.00 125694/1403071 get_element_at [19] - 0.00 0.00 1/1 destroy_dom_tree [38] ------------------------------------------------ - 0.00 0.42 1/1 main [1] -[2] 62.7 0.00 0.42 1 query [2] - 0.00 0.25 1/1 get_descendants [3] - 0.00 0.12 1/1 parse_query [8] - 0.00 0.01 125694/379443 rb_tree_insert [15] - 0.00 0.01 1/1 filter_nodes_by_selector [29] - 0.01 0.00 1/1 new_simple_rbtree [33] - 0.00 0.01 125695/1275029 add_element [14] - 0.00 0.00 125694/125694 generic_list_iterator_next [37] - 0.00 0.00 1/126483 destroy_rbtree [26] - 0.00 0.00 1/1 dequeue [39] - 0.00 0.00 1/1 destroy_selector [40] - 0.00 0.00 1/390451 destroy_generic_list [35] - 0.00 0.00 125695/125695 generic_list_iterator_has_next [64] - 0.00 0.00 1/390453 new_generic_list [52] - 0.00 0.00 1/1 peek_queue_type [86] - 0.00 0.00 1/1 new_generic_list_iterator [83] - 0.00 0.00 1/1 destroy_generic_list_iterator [81] ------------------------------------------------ - 129624 get_descendants [3] - 0.00 0.25 1/1 query [2] -[3] 38.0 0.00 0.25 1+129624 get_descendants [3] - 0.24 0.00 129624/129624 merge_lists [4] - 0.00 0.01 129624/1275029 add_element [14] - 0.00 0.00 256890/1403071 get_element_at [19] - 0.00 0.00 129625/129625 get_children [61] - 0.00 0.00 129625/390453 new_generic_list [52] - 129624 get_descendants [3] ------------------------------------------------ - 0.24 0.00 129624/129624 get_descendants [3] -[4] 36.3 0.24 0.00 129624 merge_lists [4] - 0.00 0.00 131195/390451 destroy_generic_list [35] - 0.00 0.00 1571/390453 new_generic_list [52] ------------------------------------------------ - 0.00 0.12 1/2 parse_file [9] - 0.00 0.12 1/2 parse_string [10] -[5] 35.7 0.00 0.24 2 yyparse [5] - 0.09 0.04 2303395/2303395 yylex [7] - 0.01 0.03 513000/513002 destroy_dom_node [16] - 0.00 0.03 253749/253749 add_attribute [18] - 0.00 0.02 129625/129625 append_children [28] - 0.00 0.01 256890/513780 append_child [23] - 0.00 0.00 129625/390451 destroy_generic_list [35] - 0.00 0.00 1/1 enqueue_with_type [42] - 0.00 0.00 772251/772251 new_element_node [45] - 0.00 0.00 642626/642626 get_name [48] - 0.00 0.00 383375/383375 get_namespace [53] - 0.00 0.00 383375/383375 set_namespace [54] - 0.00 0.00 253749/253749 new_attribute [58] - 0.00 0.00 129626/129626 set_name [60] - 0.00 0.00 127266/127266 new_text_node [62] - 0.00 0.00 4/4 yydestruct [71] - 0.00 0.00 2/4 new_stack [68] - 0.00 0.00 1/1 new_document [82] - 0.00 0.00 1/1 set_doc_root [87] - 0.00 0.00 1/1 new_queue [84] - 0.00 0.00 1/1 new_selector [85] ------------------------------------------------ - 0.00 0.22 1/1 main [1] -[6] 32.8 0.00 0.22 1 parse_dom [6] - 0.00 0.12 1/1 parse_file [9] - 0.00 0.10 894015/894016 pop_stack [12] - 0.00 0.00 1/390451 destroy_generic_list [35] - 0.00 0.00 1/4 new_stack [68] - 0.00 0.00 1/2 __alloc [178] ------------------------------------------------ - 0.09 0.04 2303395/2303395 yyparse [5] -[7] 19.4 0.09 0.04 2303395 yylex [7] - 0.00 0.04 894016/894016 push_stack [17] - 0.00 0.00 3/3 yy_get_next_buffer [73] - 0.00 0.00 2/4 yy_load_buffer_state [69] - 0.00 0.00 2/2 yywrap [80] - 0.00 0.00 1/1 yy_get_previous_state [89] ------------------------------------------------ - 0.00 0.12 1/1 query [2] -[8] 17.8 0.00 0.12 1 parse_query [8] - 0.00 0.12 1/1 parse_string [10] - 0.00 0.00 1/894016 pop_stack [12] - 0.00 0.00 1/390451 destroy_generic_list [35] - 0.00 0.00 1/4 new_stack [68] - 0.00 0.00 1/2 __alloc [178] ------------------------------------------------ - 0.00 0.12 1/1 parse_dom [6] -[9] 17.8 0.00 0.12 1 parse_file [9] - 0.00 0.12 1/2 yyparse [5] - 0.00 0.00 1/2 yy_scan_buffer [76] - 0.00 0.00 1/2 yy_delete_buffer [74] - 0.00 0.00 1/2 yylex_destroy [79] ------------------------------------------------ - 0.00 0.12 1/1 parse_query [8] -[10] 17.8 0.00 0.12 1 parse_string [10] - 0.00 0.12 1/2 yyparse [5] - 0.00 0.00 1/1 __alloc [179] - 0.00 0.00 1/2 yy_scan_buffer [76] - 0.00 0.00 1/2 yylex_destroy [79] - 0.00 0.00 1/2 yy_delete_buffer [74] ------------------------------------------------ - 0.00 0.00 1/894017 dequeue [39] - 0.10 0.00 894016/894017 pop_stack [12] -[11] 14.9 0.10 0.00 894017 remove_element_at [11] ------------------------------------------------ - 0.00 0.00 1/894016 parse_query [8] - 0.00 0.10 894015/894016 parse_dom [6] -[12] 14.9 0.00 0.10 894016 pop_stack [12] - 0.10 0.00 894016/894017 remove_element_at [11] ------------------------------------------------ - 0.00 0.00 1/1788810 add_element_with_type [41] - 0.02 0.00 513780/1788810 append_child [23] - 0.06 0.00 1275029/1788810 add_element [14] -[13] 11.9 0.08 0.00 1788810 append_element [13] - 0.00 0.00 1788810/2569717 __alloc [173] - 0.00 0.00 13629/13629 refactor_generic_list [66] ------------------------------------------------ - 0.00 0.01 125694/1275029 filter_nodes_by_name [30] - 0.00 0.01 125695/1275029 query [2] - 0.00 0.01 129624/1275029 get_descendants [3] - 0.00 0.04 894016/1275029 push_stack [17] -[14] 8.5 0.00 0.06 1275029 add_element [14] - 0.06 0.00 1275029/1788810 append_element [13] ------------------------------------------------ - 0.00 0.01 125694/379443 query [2] - 0.01 0.03 253749/379443 add_attribute [18] -[15] 7.5 0.01 0.04 379443 rb_tree_insert [15] - 0.03 0.00 14448262/14448262 __pointer [20] - 0.01 0.00 7224131/7224131 __compare_by_pointer [34] - 0.00 0.00 763602/763602 key [46] - 0.00 0.00 381801/381801 compare [55] - 0.00 0.00 379443/379443 new_rbtree_node [56] - 0.00 0.00 379443/379443 rb_tree_insert_fixup [57] ------------------------------------------------ - 510639 destroy_dom_node [16] - 0.00 0.00 2/513002 destroy_dom_tree [38] - 0.01 0.03 513000/513002 yyparse [5] -[16] 6.5 0.01 0.03 513002+510639 destroy_dom_node [16] - 0.00 0.02 126482/126483 destroy_rbtree [26] - 0.00 0.00 256890/1403071 get_element_at [19] - 0.01 0.00 126482/252176 new_tree_iterator [32] - 0.00 0.00 129625/390451 destroy_generic_list [35] - 0.00 0.00 380231/757313 tree_iterator_has_next [47] - 0.00 0.00 253749/505137 tree_iterator_next [50] - 0.00 0.00 126482/252176 destroy_iterator [59] - 510639 destroy_dom_node [16] ------------------------------------------------ - 0.00 0.04 894016/894016 yylex [7] -[17] 6.0 0.00 0.04 894016 push_stack [17] - 0.00 0.04 894016/1275029 add_element [14] ------------------------------------------------ - 0.00 0.03 253749/253749 yyparse [5] -[18] 5.0 0.00 0.03 253749 add_attribute [18] - 0.01 0.03 253749/379443 rb_tree_insert [15] - 0.00 0.00 126482/126483 new_rbtree [63] ------------------------------------------------ - 0.00 0.00 125694/1403071 __node_list_to_xml [36] - 0.00 0.00 125694/1403071 generic_list_iterator_next [37] - 0.00 0.00 125694/1403071 main [1] - 0.00 0.00 255319/1403071 filter_nodes_by_name [30] - 0.00 0.00 256890/1403071 append_children [28] - 0.00 0.00 256890/1403071 get_descendants [3] - 0.00 0.00 256890/1403071 destroy_dom_node [16] -[19] 4.5 0.01 0.02 1403071 get_element_at [19] - 0.02 0.00 1403071/1403071 get_element_and_type_at [25] ------------------------------------------------ - 0.03 0.00 14448262/14448262 rb_tree_insert [15] -[20] 4.5 0.03 0.00 14448262 __pointer [20] ------------------------------------------------ -[21] 4.1 0.01 0.02 125694+251388 [21] - 0.01 0.01 251388 __dom_node_to_xml [24] - 0.00 0.01 125694 __node_list_to_xml [36] ------------------------------------------------ - 0.00 0.03 125694/125694 main [1] -[22] 4.1 0.00 0.03 125694 node_to_string [22] - 0.01 0.02 125694/125694 __dom_node_to_xml [24] - 0.00 0.00 125694/2513880 append_bytes_to_buffer [43] ------------------------------------------------ - 0.00 0.01 256890/513780 yyparse [5] - 0.00 0.01 256890/513780 append_children [28] -[23] 3.4 0.00 0.02 513780 append_child [23] - 0.02 0.00 513780/1788810 append_element [13] - 0.00 0.00 129625/390453 new_generic_list [52] ------------------------------------------------ - 125694 __node_list_to_xml [36] - 0.01 0.02 125694/125694 node_to_string [22] -[24] 3.4 0.01 0.01 251388 __dom_node_to_xml [24] - 0.01 0.00 377082/502776 destroy_byte_buffer [31] - 0.00 0.00 125694/252176 new_tree_iterator [32] - 0.00 0.00 1131246/2388186 append_string_to_buffer [44] - 0.00 0.00 377082/502776 append_buffer_to_buffer [51] - 0.00 0.00 377082/757313 tree_iterator_has_next [47] - 0.00 0.00 251388/628470 new_byte_buffer [49] - 0.00 0.00 251388/505137 tree_iterator_next [50] - 0.00 0.00 251388/251388 __attribute_to_xml [177] - 0.00 0.00 125694/252176 destroy_iterator [59] - 125694 __node_list_to_xml [36] ------------------------------------------------ - 0.02 0.00 1403071/1403071 get_element_at [19] -[25] 3.0 0.02 0.00 1403071 get_element_and_type_at [25] ------------------------------------------------ - 0.00 0.00 1/126483 query [2] - 0.00 0.02 126482/126483 destroy_dom_node [16] -[26] 3.0 0.00 0.02 126483 destroy_rbtree [26] - 0.02 0.00 126483/126483 __destroy_rbtree [27] ------------------------------------------------ - 758886 __destroy_rbtree [27] - 0.02 0.00 126483/126483 destroy_rbtree [26] -[27] 3.0 0.02 0.00 126483+758886 __destroy_rbtree [27] - 758886 __destroy_rbtree [27] ------------------------------------------------ - 0.00 0.02 129625/129625 yyparse [5] -[28] 2.5 0.00 0.02 129625 append_children [28] - 0.00 0.01 256890/513780 append_child [23] - 0.00 0.00 256890/1403071 get_element_at [19] - 0.00 0.00 129625/390453 new_generic_list [52] ------------------------------------------------ - 0.00 0.01 1/1 query [2] -[29] 1.7 0.00 0.01 1 filter_nodes_by_selector [29] - 0.00 0.01 1/1 filter_nodes_by_name [30] - 0.00 0.00 1/390451 destroy_generic_list [35] ------------------------------------------------ - 0.00 0.01 1/1 filter_nodes_by_selector [29] -[30] 1.7 0.00 0.01 1 filter_nodes_by_name [30] - 0.00 0.01 125694/1275029 add_element [14] - 0.00 0.00 255319/1403071 get_element_at [19] - 0.00 0.00 1/390453 new_generic_list [52] ------------------------------------------------ - 0.00 0.00 125694/502776 __node_list_to_xml [36] - 0.01 0.00 377082/502776 __dom_node_to_xml [24] -[31] 1.5 0.01 0.00 502776 destroy_byte_buffer [31] ------------------------------------------------ - 0.00 0.00 125694/252176 __dom_node_to_xml [24] - 0.01 0.00 126482/252176 destroy_dom_node [16] -[32] 1.5 0.01 0.00 252176 new_tree_iterator [32] - 0.00 0.00 252176/758102 __alloc [176] ------------------------------------------------ - 0.01 0.00 1/1 query [2] -[33] 1.5 0.01 0.00 1 new_simple_rbtree [33] - 0.00 0.00 1/126483 new_rbtree [63] ------------------------------------------------ - 0.01 0.00 7224131/7224131 rb_tree_insert [15] -[34] 1.5 0.01 0.00 7224131 __compare_by_pointer [34] ------------------------------------------------ - 0.00 0.00 1/390451 parse_dom [6] - 0.00 0.00 1/390451 parse_query [8] - 0.00 0.00 1/390451 filter_nodes_by_selector [29] - 0.00 0.00 1/390451 query [2] - 0.00 0.00 2/390451 destroy_selector [40] - 0.00 0.00 129625/390451 yyparse [5] - 0.00 0.00 129625/390451 destroy_dom_node [16] - 0.00 0.00 131195/390451 merge_lists [4] -[35] 1.5 0.01 0.00 390451 destroy_generic_list [35] ------------------------------------------------ - 125694 __dom_node_to_xml [24] -[36] 0.8 0.00 0.01 125694 __node_list_to_xml [36] - 0.00 0.00 125694/1403071 get_element_at [19] - 0.00 0.00 125694/502776 destroy_byte_buffer [31] - 0.00 0.00 125694/628470 new_byte_buffer [49] - 0.00 0.00 125694/502776 append_buffer_to_buffer [51] - 125694 __dom_node_to_xml [24] ------------------------------------------------ - 0.00 0.00 125694/125694 query [2] -[37] 0.4 0.00 0.00 125694 generic_list_iterator_next [37] - 0.00 0.00 125694/1403071 get_element_at [19] ------------------------------------------------ - 0.00 0.00 1/1 main [1] -[38] 0.0 0.00 0.00 1 destroy_dom_tree [38] - 0.00 0.00 2/513002 destroy_dom_node [16] ------------------------------------------------ - 0.00 0.00 1/1 query [2] -[39] 0.0 0.00 0.00 1 dequeue [39] - 0.00 0.00 1/894017 remove_element_at [11] ------------------------------------------------ - 0.00 0.00 1/1 query [2] -[40] 0.0 0.00 0.00 1 destroy_selector [40] - 0.00 0.00 2/390451 destroy_generic_list [35] ------------------------------------------------ - 0.00 0.00 1/1 enqueue_with_type [42] -[41] 0.0 0.00 0.00 1 add_element_with_type [41] - 0.00 0.00 1/1788810 append_element [13] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [5] -[42] 0.0 0.00 0.00 1 enqueue_with_type [42] - 0.00 0.00 1/1 add_element_with_type [41] ------------------------------------------------ - 0.00 0.00 125694/2513880 node_to_string [22] - 0.00 0.00 2388186/2513880 append_string_to_buffer [44] -[43] 0.0 0.00 0.00 2513880 append_bytes_to_buffer [43] ------------------------------------------------ - 0.00 0.00 1131246/2388186 __dom_node_to_xml [24] - 0.00 0.00 1256940/2388186 __attribute_to_xml [177] -[44] 0.0 0.00 0.00 2388186 append_string_to_buffer [44] - 0.00 0.00 2388186/2513880 append_bytes_to_buffer [43] ------------------------------------------------ - 0.00 0.00 772251/772251 yyparse [5] -[45] 0.0 0.00 0.00 772251 new_element_node [45] - 0.00 0.00 1544502/2560282 __alloc [174] ------------------------------------------------ - 0.00 0.00 763602/763602 rb_tree_insert [15] -[46] 0.0 0.00 0.00 763602 key [46] ------------------------------------------------ - 0.00 0.00 377082/757313 __dom_node_to_xml [24] - 0.00 0.00 380231/757313 destroy_dom_node [16] -[47] 0.0 0.00 0.00 757313 tree_iterator_has_next [47] ------------------------------------------------ - 0.00 0.00 642626/642626 yyparse [5] -[48] 0.0 0.00 0.00 642626 get_name [48] ------------------------------------------------ - 0.00 0.00 125694/628470 __node_list_to_xml [36] - 0.00 0.00 251388/628470 __dom_node_to_xml [24] - 0.00 0.00 251388/628470 __attribute_to_xml [177] -[49] 0.0 0.00 0.00 628470 new_byte_buffer [49] - 0.00 0.00 1256940/1256940 __alloc [175] ------------------------------------------------ - 0.00 0.00 251388/505137 __dom_node_to_xml [24] - 0.00 0.00 253749/505137 destroy_dom_node [16] -[50] 0.0 0.00 0.00 505137 tree_iterator_next [50] ------------------------------------------------ - 0.00 0.00 125694/502776 __node_list_to_xml [36] - 0.00 0.00 377082/502776 __dom_node_to_xml [24] -[51] 0.0 0.00 0.00 502776 append_buffer_to_buffer [51] ------------------------------------------------ - 0.00 0.00 1/390453 new_queue [84] - 0.00 0.00 1/390453 filter_nodes_by_name [30] - 0.00 0.00 1/390453 query [2] - 0.00 0.00 4/390453 new_stack [68] - 0.00 0.00 1571/390453 merge_lists [4] - 0.00 0.00 129625/390453 append_child [23] - 0.00 0.00 129625/390453 append_children [28] - 0.00 0.00 129625/390453 get_descendants [3] -[52] 0.0 0.00 0.00 390453 new_generic_list [52] - 0.00 0.00 780906/2569717 __alloc [173] ------------------------------------------------ - 0.00 0.00 383375/383375 yyparse [5] -[53] 0.0 0.00 0.00 383375 get_namespace [53] ------------------------------------------------ - 0.00 0.00 383375/383375 yyparse [5] -[54] 0.0 0.00 0.00 383375 set_namespace [54] ------------------------------------------------ - 0.00 0.00 381801/381801 rb_tree_insert [15] -[55] 0.0 0.00 0.00 381801 compare [55] ------------------------------------------------ - 0.00 0.00 379443/379443 rb_tree_insert [15] -[56] 0.0 0.00 0.00 379443 new_rbtree_node [56] - 0.00 0.00 379443/758102 __alloc [176] ------------------------------------------------ - 0.00 0.00 379443/379443 rb_tree_insert [15] -[57] 0.0 0.00 0.00 379443 rb_tree_insert_fixup [57] - 0.00 0.00 122708/122708 left_rbrotate [65] - 0.00 0.00 935/935 right_rbrotate [67] ------------------------------------------------ - 0.00 0.00 253749/253749 yyparse [5] -[58] 0.0 0.00 0.00 253749 new_attribute [58] - 0.00 0.00 761247/2560282 __alloc [174] ------------------------------------------------ - 0.00 0.00 125694/252176 __dom_node_to_xml [24] - 0.00 0.00 126482/252176 destroy_dom_node [16] -[59] 0.0 0.00 0.00 252176 destroy_iterator [59] ------------------------------------------------ - 0.00 0.00 129626/129626 yyparse [5] -[60] 0.0 0.00 0.00 129626 set_name [60] ------------------------------------------------ - 0.00 0.00 129625/129625 get_descendants [3] -[61] 0.0 0.00 0.00 129625 get_children [61] ------------------------------------------------ - 0.00 0.00 127266/127266 yyparse [5] -[62] 0.0 0.00 0.00 127266 new_text_node [62] - 0.00 0.00 254532/2560282 __alloc [174] ------------------------------------------------ - 0.00 0.00 1/126483 new_simple_rbtree [33] - 0.00 0.00 126482/126483 add_attribute [18] -[63] 0.0 0.00 0.00 126483 new_rbtree [63] - 0.00 0.00 126483/758102 __alloc [176] ------------------------------------------------ - 0.00 0.00 125695/125695 query [2] -[64] 0.0 0.00 0.00 125695 generic_list_iterator_has_next [64] ------------------------------------------------ - 0.00 0.00 122708/122708 rb_tree_insert_fixup [57] -[65] 0.0 0.00 0.00 122708 left_rbrotate [65] ------------------------------------------------ - 0.00 0.00 13629/13629 append_element [13] -[66] 0.0 0.00 0.00 13629 refactor_generic_list [66] ------------------------------------------------ - 0.00 0.00 935/935 rb_tree_insert_fixup [57] -[67] 0.0 0.00 0.00 935 right_rbrotate [67] ------------------------------------------------ - 0.00 0.00 1/4 parse_dom [6] - 0.00 0.00 1/4 parse_query [8] - 0.00 0.00 2/4 yyparse [5] -[68] 0.0 0.00 0.00 4 new_stack [68] - 0.00 0.00 4/390453 new_generic_list [52] ------------------------------------------------ - 0.00 0.00 2/4 yylex [7] - 0.00 0.00 2/4 yy_switch_to_buffer [77] -[69] 0.0 0.00 0.00 4 yy_load_buffer_state [69] ------------------------------------------------ - 0.00 0.00 2/4 yyensure_buffer_stack [78] - 0.00 0.00 2/4 yy_scan_buffer [76] -[70] 0.0 0.00 0.00 4 yyalloc [70] ------------------------------------------------ - 0.00 0.00 4/4 yyparse [5] -[71] 0.0 0.00 0.00 4 yydestruct [71] ------------------------------------------------ - 0.00 0.00 2/4 yy_delete_buffer [74] - 0.00 0.00 2/4 yylex_destroy [79] -[72] 0.0 0.00 0.00 4 yyfree [72] ------------------------------------------------ - 0.00 0.00 3/3 yylex [7] -[73] 0.0 0.00 0.00 3 yy_get_next_buffer [73] ------------------------------------------------ - 0.00 0.00 1/2 parse_file [9] - 0.00 0.00 1/2 parse_string [10] -[74] 0.0 0.00 0.00 2 yy_delete_buffer [74] - 0.00 0.00 2/4 yyfree [72] ------------------------------------------------ - 0.00 0.00 2/2 yylex_destroy [79] -[75] 0.0 0.00 0.00 2 yy_init_globals [75] ------------------------------------------------ - 0.00 0.00 1/2 parse_file [9] - 0.00 0.00 1/2 parse_string [10] -[76] 0.0 0.00 0.00 2 yy_scan_buffer [76] - 0.00 0.00 2/4 yyalloc [70] - 0.00 0.00 2/2 yy_switch_to_buffer [77] ------------------------------------------------ - 0.00 0.00 2/2 yy_scan_buffer [76] -[77] 0.0 0.00 0.00 2 yy_switch_to_buffer [77] - 0.00 0.00 2/2 yyensure_buffer_stack [78] - 0.00 0.00 2/4 yy_load_buffer_state [69] ------------------------------------------------ - 0.00 0.00 2/2 yy_switch_to_buffer [77] -[78] 0.0 0.00 0.00 2 yyensure_buffer_stack [78] - 0.00 0.00 2/4 yyalloc [70] ------------------------------------------------ - 0.00 0.00 1/2 parse_file [9] - 0.00 0.00 1/2 parse_string [10] -[79] 0.0 0.00 0.00 2 yylex_destroy [79] - 0.00 0.00 2/4 yyfree [72] - 0.00 0.00 2/2 yy_init_globals [75] ------------------------------------------------ - 0.00 0.00 2/2 yylex [7] -[80] 0.0 0.00 0.00 2 yywrap [80] ------------------------------------------------ - 0.00 0.00 1/1 query [2] -[81] 0.0 0.00 0.00 1 destroy_generic_list_iterator [81] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [5] -[82] 0.0 0.00 0.00 1 new_document [82] - 0.00 0.00 1/2560282 __alloc [174] - 0.00 0.00 1/1 set_xml_declaration [88] ------------------------------------------------ - 0.00 0.00 1/1 query [2] -[83] 0.0 0.00 0.00 1 new_generic_list_iterator [83] - 0.00 0.00 1/2569717 __alloc [173] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [5] -[84] 0.0 0.00 0.00 1 new_queue [84] - 0.00 0.00 1/390453 new_generic_list [52] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [5] -[85] 0.0 0.00 0.00 1 new_selector [85] - 0.00 0.00 1/1 __alloc [180] ------------------------------------------------ - 0.00 0.00 1/1 query [2] -[86] 0.0 0.00 0.00 1 peek_queue_type [86] ------------------------------------------------ - 0.00 0.00 1/1 yyparse [5] -[87] 0.0 0.00 0.00 1 set_doc_root [87] ------------------------------------------------ - 0.00 0.00 1/1 new_document [82] -[88] 0.0 0.00 0.00 1 set_xml_declaration [88] ------------------------------------------------ - 0.00 0.00 1/1 yylex [7] -[89] 0.0 0.00 0.00 1 yy_get_previous_state [89] ------------------------------------------------ - 0.00 0.00 1/2569717 new_generic_list_iterator [83] - 0.00 0.00 780906/2569717 new_generic_list [52] - 0.00 0.00 1788810/2569717 append_element [13] -[173] 0.0 0.00 0.00 2569717 __alloc [173] ------------------------------------------------ - 0.00 0.00 1/2560282 new_document [82] - 0.00 0.00 254532/2560282 new_text_node [62] - 0.00 0.00 761247/2560282 new_attribute [58] - 0.00 0.00 1544502/2560282 new_element_node [45] -[174] 0.0 0.00 0.00 2560282 __alloc [174] ------------------------------------------------ - 0.00 0.00 1256940/1256940 new_byte_buffer [49] -[175] 0.0 0.00 0.00 1256940 __alloc [175] ------------------------------------------------ - 0.00 0.00 126483/758102 new_rbtree [63] - 0.00 0.00 252176/758102 new_tree_iterator [32] - 0.00 0.00 379443/758102 new_rbtree_node [56] -[176] 0.0 0.00 0.00 758102 __alloc [176] ------------------------------------------------ - 0.00 0.00 251388/251388 __dom_node_to_xml [24] -[177] 0.0 0.00 0.00 251388 __attribute_to_xml [177] - 0.00 0.00 1256940/2388186 append_string_to_buffer [44] - 0.00 0.00 251388/628470 new_byte_buffer [49] ------------------------------------------------ - 0.00 0.00 1/2 parse_dom [6] - 0.00 0.00 1/2 parse_query [8] -[178] 0.0 0.00 0.00 2 __alloc [178] ------------------------------------------------ - 0.00 0.00 1/1 parse_string [10] -[179] 0.0 0.00 0.00 1 __alloc [179] ------------------------------------------------ - 0.00 0.00 1/1 new_selector [85] -[180] 0.0 0.00 0.00 1 __alloc [180] ------------------------------------------------ - - This table describes the call tree of the program, and was sorted by - the total amount of time spent in each function and its children. - - Each entry in this table consists of several lines. The line with the - index number at the left hand margin lists the current function. - The lines above it list the functions that called this function, - and the lines below it list the functions this one called. - This line lists: - index A unique number given to each element of the table. - Index numbers are sorted numerically. - The index number is printed next to every function name so - it is easier to look up where the function in the table. - - % time This is the percentage of the `total' time that was spent - in this function and its children. Note that due to - different viewpoints, functions excluded by options, etc, - these numbers will NOT add up to 100%. - - self This is the total amount of time spent in this function. - - children This is the total amount of time propagated into this - function by its children. - - called This is the number of times the function was called. - If the function called itself recursively, the number - only includes non-recursive calls, and is followed by - a `+' and the number of recursive calls. - - name The name of the current function. The index number is - printed after it. If the function is a member of a - cycle, the cycle number is printed between the - function's name and the index number. - - - For the function's parents, the fields have the following meanings: - - self This is the amount of time that was propagated directly - from the function into this parent. - - children This is the amount of time that was propagated from - the function's children into this parent. - - called This is the number of times this parent called the - function `/' the total number of times the function - was called. Recursive calls to the function are not - included in the number after the `/'. - - name This is the name of the parent. The parent's index - number is printed after it. If the parent is a - member of a cycle, the cycle number is printed between - the name and the index number. - - If the parents of the function cannot be determined, the word - `' is printed in the `name' field, and all the other - fields are blank. - - For the function's children, the fields have the following meanings: - - self This is the amount of time that was propagated directly - from the child into the function. - - children This is the amount of time that was propagated from the - child's children to the function. - - called This is the number of times the function called - this child `/' the total number of times the child - was called. Recursive calls by the child are not - listed in the number after the `/'. - - name This is the name of the child. The child's index - number is printed after it. If the child is a - member of a cycle, the cycle number is printed - between the name and the index number. - - If there are any cycles (circles) in the call graph, there is an - entry for the cycle-as-a-whole. This entry shows who called the - cycle (as parents) and the members of the cycle (as children.) - The `+' recursive calls entry shows the number of function calls that - were internal to the cycle, and the calls entry for each member shows, - for that member, how many times it was called from other members of - the cycle. - - -Index by function name - - [178] __alloc (macros.h) [42] enqueue_with_type [10] parse_string - [179] __alloc (macros.h) [30] filter_nodes_by_name [86] peek_queue_type - [174] __alloc (macros.h) [29] filter_nodes_by_selector [12] pop_stack - [175] __alloc (macros.h) [64] generic_list_iterator_has_next [17] push_stack - [176] __alloc (macros.h) [37] generic_list_iterator_next [2] query - [173] __alloc (macros.h) [61] get_children [15] rb_tree_insert - [180] __alloc (macros.h) [3] get_descendants [57] rb_tree_insert_fixup (rbtree.c) - [177] __attribute_to_xml [25] get_element_and_type_at [66] refactor_generic_list (stack.c) - [34] __compare_by_pointer (rbtree.c) [19] get_element_at [11] remove_element_at - [27] __destroy_rbtree (rbtree.c) [48] get_name [67] right_rbrotate (rbtree.c) - [24] __dom_node_to_xml [53] get_namespace [87] set_doc_root - [36] __node_list_to_xml [46] key [60] set_name - [20] __pointer (rbtree.c) [65] left_rbrotate (rbtree.c) [54] set_namespace - [18] add_attribute [4] merge_lists [88] set_xml_declaration - [14] add_element [58] new_attribute [47] tree_iterator_has_next - [41] add_element_with_type [49] new_byte_buffer [50] tree_iterator_next - [51] append_buffer_to_buffer [82] new_document [74] yy_delete_buffer - [43] append_bytes_to_buffer [45] new_element_node [73] yy_get_next_buffer (lex.yy.c) - [23] append_child [52] new_generic_list [89] yy_get_previous_state (lex.yy.c) - [28] append_children [83] new_generic_list_iterator [75] yy_init_globals (lex.yy.c) - [13] append_element [84] new_queue [69] yy_load_buffer_state (lex.yy.c) - [44] append_string_to_buffer [63] new_rbtree [76] yy_scan_buffer - [55] compare [56] new_rbtree_node (rbtree.c) [77] yy_switch_to_buffer - [39] dequeue [85] new_selector [70] yyalloc - [31] destroy_byte_buffer [33] new_simple_rbtree [71] yydestruct (y.tab.c) - [16] destroy_dom_node [68] new_stack [78] yyensure_buffer_stack (lex.yy.c) - [38] destroy_dom_tree [62] new_text_node [72] yyfree - [35] destroy_generic_list [32] new_tree_iterator [7] yylex - [81] destroy_generic_list_iterator [22] node_to_string [79] yylex_destroy - [59] destroy_iterator [6] parse_dom [5] yyparse - [26] destroy_rbtree [9] parse_file [80] yywrap - [40] destroy_selector [8] parse_query [21] diff --git a/profiling/sem_remove_dups_e_quick_sort.massif b/profiling/sem_remove_dups_e_quick_sort.massif deleted file mode 100644 index 6ee9330..0000000 --- a/profiling/sem_remove_dups_e_quick_sort.massif +++ /dev/null @@ -1,1140 +0,0 @@ --------------------------------------------------------------------------------- -Command: ./dom_parser really_big.xml @segment -Massif arguments: --time-unit=B --massif-out-file=stats.massif -ms_print arguments: stats.massif --------------------------------------------------------------------------------- - - - MB -98.74^ ## - | # - | # - | # - | # - | ::# - | : # ::::@:: - | @: # : :::::::::::::::::::::::::::::::@:::::::::::::::::::@:: - | @: # :::::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@:: - | @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@:: - | @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@::: - | @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@::: - | @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@::: - | ::@@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@:::: - | : @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@:::: - | @: @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@:::: - | @: @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@:::: - | ::@: @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@::::: - | : @: @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@::::: - | : @: @@: # :: ::: ::::::::: ::: :: : :: :::::@: ::::::: :::: ::::@::::@ - 0 +----------------------------------------------------------------------->GB - 0 1.314 - -Number of snapshots: 69 - Detailed snapshots: [2, 4, 5, 7, 8 (peak), 36, 58, 68] - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 0 0 0 0 0 0 - 1 32,044,192 15,745,936 10,047,542 5,698,394 0 - 2 61,129,064 29,487,832 18,433,237 11,054,595 0 -62.51% (18,433,237B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->18.94% (5,583,969B) 0x40B14AE: strdup (strdup.c:43) -| ->04.98% (1,468,552B) 0x8049120: yylex (parser.l:24) -| | ->04.98% (1,468,552B) 0x804B340: yyparse (y.tab.c:1517) -| | ->04.98% (1,468,552B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.98% (1,468,552B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.98% (1,468,552B) 0x80517ED: main (main.c:29) -| | -| ->04.98% (1,468,552B) 0x804CDF3: new_text_node (node.c:180) -| | ->04.98% (1,468,552B) 0x804B78D: yyparse (parser.y:196) -| | ->04.98% (1,468,552B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.98% (1,468,552B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.98% (1,468,552B) 0x80517ED: main (main.c:29) -| | -| ->03.57% (1,053,887B) 0x80491B2: yylex (parser.l:32) -| | ->03.57% (1,053,887B) 0x804B340: yyparse (y.tab.c:1517) -| | ->03.57% (1,053,887B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.57% (1,053,887B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.57% (1,053,887B) 0x80517ED: main (main.c:29) -| | -| ->01.59% (468,867B) 0x804CE54: new_attribute (node.c:191) -| | ->01.59% (468,867B) 0x804B891: yyparse (parser.y:222) -| | ->01.59% (468,867B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.59% (468,867B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.59% (468,867B) 0x80517ED: main (main.c:29) -| | -| ->01.41% (415,789B) 0x8049208: yylex (parser.l:37) -| | ->01.41% (415,789B) 0x804B340: yyparse (y.tab.c:1517) -| | ->01.41% (415,789B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.41% (415,789B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.41% (415,789B) 0x80517ED: main (main.c:29) -| | -| ->01.41% (415,789B) 0x804CE67: new_attribute (node.c:192) -| | ->01.41% (415,789B) 0x804B891: yyparse (parser.y:222) -| | ->01.41% (415,789B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.41% (415,789B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.41% (415,789B) 0x80517ED: main (main.c:29) -| | -| ->00.99% (292,533B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.86% (2,613,928B) 0x804F9F3: append_element (stack.c:147) -| ->06.89% (2,030,848B) 0x804FB54: add_element (stack.c:180) -| | ->06.89% (2,030,848B) 0x80500E4: push_stack (stack.c:311) -| | ->03.95% (1,164,672B) 0x80491CE: yylex (parser.l:32) -| | | ->03.95% (1,164,672B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->03.95% (1,164,672B) 0x804AF9A: parse_file (parser.y:67) -| | | ->03.95% (1,164,672B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->03.95% (1,164,672B) 0x80517ED: main (main.c:29) -| | | -| | ->01.96% (576,944B) 0x8049224: yylex (parser.l:37) -| | | ->01.96% (576,944B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->01.96% (576,944B) 0x804AF9A: parse_file (parser.y:67) -| | | ->01.96% (576,944B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->01.96% (576,944B) 0x80517ED: main (main.c:29) -| | | -| | ->00.98% (289,232B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.98% (583,080B) 0x804CAA3: append_child (node.c:112) -| ->01.97% (581,248B) 0x804CCFD: append_children (node.c:151) -| | ->01.97% (581,248B) 0x804B638: yyparse (parser.y:169) -| | ->01.97% (581,248B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.97% (581,248B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.97% (581,248B) 0x80517ED: main (main.c:29) -| | -| ->00.01% (1,832B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.94% (2,340,288B) 0x804F3F6: new_generic_list (stack.c:18) -| ->07.94% (2,340,160B) 0x804CCCD: append_children (node.c:148) -| | ->07.94% (2,340,160B) 0x804B638: yyparse (parser.y:169) -| | ->07.94% (2,340,160B) 0x804AF9A: parse_file (parser.y:67) -| | ->07.94% (2,340,160B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->07.94% (2,340,160B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (128B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.85% (2,019,304B) 0x804CE35: new_attribute (node.c:188) -| ->06.85% (2,019,304B) 0x804B891: yyparse (parser.y:222) -| ->06.85% (2,019,304B) 0x804AF9A: parse_file (parser.y:67) -| ->06.85% (2,019,304B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->06.85% (2,019,304B) 0x80517ED: main (main.c:29) -| -->04.89% (1,442,360B) 0x804E63E: new_rbtree_node (rbtree.c:15) -| ->04.89% (1,442,360B) 0x804EA0C: rb_tree_insert (rbtree.c:146) -| ->04.89% (1,442,360B) 0x804CBAC: add_attribute (node.c:132) -| ->04.89% (1,442,360B) 0x804B86B: yyparse (parser.y:218) -| ->04.89% (1,442,360B) 0x804AF9A: parse_file (parser.y:67) -| ->04.89% (1,442,360B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->04.89% (1,442,360B) 0x80517ED: main (main.c:29) -| -->04.49% (1,323,136B) 0x804F5DE: refactor_generic_list (stack.c:59) -| ->04.49% (1,323,136B) 0x804F9E7: append_element (stack.c:144) -| ->03.56% (1,048,576B) 0x804FB54: add_element (stack.c:180) -| | ->03.56% (1,048,576B) 0x80500E4: push_stack (stack.c:311) -| | ->03.56% (1,048,576B) 0x8049224: yylex (parser.l:37) -| | | ->03.56% (1,048,576B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->03.56% (1,048,576B) 0x804AF9A: parse_file (parser.y:67) -| | | ->03.56% (1,048,576B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->03.56% (1,048,576B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.93% (274,560B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.49% (1,028,720B) 0x804CD5F: new_element_node (node.c:164) -| ->03.49% (1,028,580B) 0x804B844: yyparse (parser.y:215) -| | ->03.49% (1,028,580B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.49% (1,028,580B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.49% (1,028,580B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.43% (1,012,312B) 0x804CDCA: new_text_node (node.c:176) -| ->03.43% (1,012,312B) 0x804B78D: yyparse (parser.y:196) -| ->03.43% (1,012,312B) 0x804AF9A: parse_file (parser.y:67) -| ->03.43% (1,012,312B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->03.43% (1,012,312B) 0x80517ED: main (main.c:29) -| -->01.99% (587,776B) 0x804F3C0: new_generic_list (stack.c:13) -| ->01.99% (587,696B) 0x804CCCD: append_children (node.c:148) -| | ->01.99% (587,696B) 0x804B638: yyparse (parser.y:169) -| | ->01.99% (587,696B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.99% (587,696B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.99% (587,696B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (80B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.46% (431,556B) 0x804E6DD: new_rbtree (rbtree.c:39) -| ->01.46% (431,556B) 0x804CB91: add_attribute (node.c:131) -| ->01.46% (431,556B) 0x804B86B: yyparse (parser.y:218) -| ->01.46% (431,556B) 0x804AF9A: parse_file (parser.y:67) -| ->01.46% (431,556B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->01.46% (431,556B) 0x80517ED: main (main.c:29) -| -->00.17% (49,888B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 3 83,026,624 40,341,552 25,448,899 14,892,653 0 - 4 119,773,592 57,764,968 36,097,232 21,667,736 0 -62.49% (36,097,232B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->18.95% (10,946,412B) 0x40B14AE: strdup (strdup.c:43) -| ->04.99% (2,882,256B) 0x8049120: yylex (parser.l:24) -| | ->04.99% (2,882,256B) 0x804B340: yyparse (y.tab.c:1517) -| | ->04.99% (2,882,256B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.99% (2,882,256B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.99% (2,882,256B) 0x80517ED: main (main.c:29) -| | -| ->04.99% (2,882,256B) 0x804CDF3: new_text_node (node.c:180) -| | ->04.99% (2,882,256B) 0x804B78D: yyparse (parser.y:196) -| | ->04.99% (2,882,256B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.99% (2,882,256B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.99% (2,882,256B) 0x80517ED: main (main.c:29) -| | -| ->03.57% (2,063,279B) 0x80491B2: yylex (parser.l:32) -| | ->03.57% (2,063,279B) 0x804B340: yyparse (y.tab.c:1517) -| | ->03.57% (2,063,279B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.57% (2,063,279B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.57% (2,063,279B) 0x80517ED: main (main.c:29) -| | -| ->01.59% (917,921B) 0x804CE54: new_attribute (node.c:191) -| | ->01.59% (917,921B) 0x804B891: yyparse (parser.y:222) -| | ->01.59% (917,921B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.59% (917,921B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.59% (917,921B) 0x80517ED: main (main.c:29) -| | -| ->01.41% (813,999B) 0x8049208: yylex (parser.l:37) -| | ->01.41% (813,999B) 0x804B340: yyparse (y.tab.c:1517) -| | ->01.41% (813,999B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.41% (813,999B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.41% (813,999B) 0x80517ED: main (main.c:29) -| | -| ->01.41% (813,999B) 0x804CE67: new_attribute (node.c:192) -| | ->01.41% (813,999B) 0x804B891: yyparse (parser.y:222) -| | ->01.41% (813,999B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.41% (813,999B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.41% (813,999B) 0x80517ED: main (main.c:29) -| | -| ->00.99% (572,702B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.86% (5,117,504B) 0x804F9F3: append_element (stack.c:147) -| ->06.88% (3,975,936B) 0x804FB54: add_element (stack.c:180) -| | ->06.88% (3,975,936B) 0x80500E4: push_stack (stack.c:311) -| | ->03.95% (2,280,168B) 0x80491CE: yylex (parser.l:32) -| | | ->03.95% (2,280,168B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->03.95% (2,280,168B) 0x804AF9A: parse_file (parser.y:67) -| | | ->03.95% (2,280,168B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->03.95% (2,280,168B) 0x80517ED: main (main.c:29) -| | | -| | ->01.96% (1,129,512B) 0x8049224: yylex (parser.l:37) -| | | ->01.96% (1,129,512B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->01.96% (1,129,512B) 0x804AF9A: parse_file (parser.y:67) -| | | ->01.96% (1,129,512B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->01.96% (1,129,512B) 0x80517ED: main (main.c:29) -| | | -| | ->00.98% (566,256B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.98% (1,141,568B) 0x804CAA3: append_child (node.c:112) -| ->01.97% (1,136,504B) 0x804CCFD: append_children (node.c:151) -| | ->01.97% (1,136,504B) 0x804B638: yyparse (parser.y:169) -| | ->01.97% (1,136,504B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.97% (1,136,504B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.97% (1,136,504B) 0x80517ED: main (main.c:29) -| | -| ->00.01% (5,064B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.93% (4,581,824B) 0x804F3F6: new_generic_list (stack.c:18) -| ->07.93% (4,581,696B) 0x804CCCD: append_children (node.c:148) -| | ->07.93% (4,581,696B) 0x804B638: yyparse (parser.y:169) -| | ->07.93% (4,581,696B) 0x804AF9A: parse_file (parser.y:67) -| | ->07.93% (4,581,696B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->07.93% (4,581,696B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (128B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.84% (3,953,292B) 0x804CE35: new_attribute (node.c:188) -| ->06.84% (3,953,292B) 0x804B891: yyparse (parser.y:222) -| ->06.84% (3,953,292B) 0x804AF9A: parse_file (parser.y:67) -| ->06.84% (3,953,292B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->06.84% (3,953,292B) 0x80517ED: main (main.c:29) -| -->04.89% (2,823,780B) 0x804E63E: new_rbtree_node (rbtree.c:15) -| ->04.89% (2,823,780B) 0x804EA0C: rb_tree_insert (rbtree.c:146) -| ->04.89% (2,823,780B) 0x804CBAC: add_attribute (node.c:132) -| ->04.89% (2,823,780B) 0x804B86B: yyparse (parser.y:218) -| ->04.89% (2,823,780B) 0x804AF9A: parse_file (parser.y:67) -| ->04.89% (2,823,780B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->04.89% (2,823,780B) 0x80517ED: main (main.c:29) -| -->04.56% (2,633,216B) 0x804F5DE: refactor_generic_list (stack.c:59) -| ->04.56% (2,633,216B) 0x804F9E7: append_element (stack.c:144) -| ->03.63% (2,097,152B) 0x804FB54: add_element (stack.c:180) -| | ->03.63% (2,097,152B) 0x80500E4: push_stack (stack.c:311) -| | ->03.63% (2,097,152B) 0x804913C: yylex (parser.l:24) -| | | ->03.63% (2,097,152B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->03.63% (2,097,152B) 0x804AF9A: parse_file (parser.y:67) -| | | ->03.63% (2,097,152B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->03.63% (2,097,152B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.93% (536,064B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.49% (2,013,844B) 0x804CD5F: new_element_node (node.c:164) -| ->03.49% (2,013,704B) 0x804B844: yyparse (parser.y:215) -| | ->03.49% (2,013,704B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.49% (2,013,704B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.49% (2,013,704B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.43% (1,981,896B) 0x804CDCA: new_text_node (node.c:176) -| ->03.43% (1,981,896B) 0x804B78D: yyparse (parser.y:196) -| ->03.43% (1,981,896B) 0x804AF9A: parse_file (parser.y:67) -| ->03.43% (1,981,896B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->03.43% (1,981,896B) 0x80517ED: main (main.c:29) -| -->01.99% (1,150,704B) 0x804F3C0: new_generic_list (stack.c:13) -| ->01.99% (1,150,624B) 0x804CCCD: append_children (node.c:148) -| | ->01.99% (1,150,624B) 0x804B638: yyparse (parser.y:169) -| | ->01.99% (1,150,624B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.99% (1,150,624B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.99% (1,150,624B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (80B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.46% (844,872B) 0x804E6DD: new_rbtree (rbtree.c:39) -| ->01.46% (844,872B) 0x804CB91: add_attribute (node.c:131) -| ->01.46% (844,872B) 0x804B86B: yyparse (parser.y:218) -| ->01.46% (844,872B) 0x804AF9A: parse_file (parser.y:67) -| ->01.46% (844,872B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->01.46% (844,872B) 0x80517ED: main (main.c:29) -| -->00.09% (49,888B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 5 141,005,528 68,844,648 43,653,818 25,190,830 0 -63.41% (43,653,818B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->18.47% (12,714,498B) 0x40B14AE: strdup (strdup.c:43) -| ->04.87% (3,350,998B) 0x8049120: yylex (parser.l:24) -| | ->04.87% (3,350,998B) 0x804B340: yyparse (y.tab.c:1517) -| | ->04.87% (3,350,998B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.87% (3,350,998B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.87% (3,350,998B) 0x80517ED: main (main.c:29) -| | -| ->04.87% (3,350,998B) 0x804CDF3: new_text_node (node.c:180) -| | ->04.87% (3,350,998B) 0x804B78D: yyparse (parser.y:196) -| | ->04.87% (3,350,998B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.87% (3,350,998B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.87% (3,350,998B) 0x80517ED: main (main.c:29) -| | -| ->03.48% (2,393,972B) 0x80491B2: yylex (parser.l:32) -| | ->03.48% (2,393,972B) 0x804B340: yyparse (y.tab.c:1517) -| | ->03.48% (2,393,972B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.48% (2,393,972B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.48% (2,393,972B) 0x80517ED: main (main.c:29) -| | -| ->01.55% (1,065,027B) 0x804CE54: new_attribute (node.c:191) -| | ->01.55% (1,065,027B) 0x804B891: yyparse (parser.y:222) -| | ->01.55% (1,065,027B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.55% (1,065,027B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.55% (1,065,027B) 0x80517ED: main (main.c:29) -| | -| ->01.37% (944,506B) 0x8049208: yylex (parser.l:37) -| | ->01.37% (944,506B) 0x804B340: yyparse (y.tab.c:1517) -| | ->01.37% (944,506B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.37% (944,506B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.37% (944,506B) 0x80517ED: main (main.c:29) -| | -| ->01.37% (944,506B) 0x804CE67: new_attribute (node.c:192) -| | ->01.37% (944,506B) 0x804B891: yyparse (parser.y:222) -| | ->01.37% (944,506B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.37% (944,506B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.37% (944,506B) 0x80517ED: main (main.c:29) -| | -| ->00.97% (664,491B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.63% (5,939,784B) 0x804F9F3: append_element (stack.c:147) -| ->06.70% (4,613,160B) 0x804FB54: add_element (stack.c:180) -| | ->06.70% (4,613,160B) 0x80500E4: push_stack (stack.c:311) -| | ->03.84% (2,645,624B) 0x80491CE: yylex (parser.l:32) -| | | ->03.84% (2,645,624B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->03.84% (2,645,624B) 0x804AF9A: parse_file (parser.y:67) -| | | ->03.84% (2,645,624B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->03.84% (2,645,624B) 0x80517ED: main (main.c:29) -| | | -| | ->01.90% (1,310,528B) 0x8049224: yylex (parser.l:37) -| | | ->01.90% (1,310,528B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->01.90% (1,310,528B) 0x804AF9A: parse_file (parser.y:67) -| | | ->01.90% (1,310,528B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->01.90% (1,310,528B) 0x80517ED: main (main.c:29) -| | | -| | ->00.95% (657,008B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.93% (1,326,624B) 0x804CAA3: append_child (node.c:112) -| ->01.92% (1,321,024B) 0x804CCFD: append_children (node.c:151) -| | ->01.92% (1,321,024B) 0x804B638: yyparse (parser.y:169) -| | ->01.92% (1,321,024B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.92% (1,321,024B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.92% (1,321,024B) 0x80517ED: main (main.c:29) -| | -| ->00.01% (5,600B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.72% (5,316,160B) 0x804F3F6: new_generic_list (stack.c:18) -| ->07.72% (5,316,096B) 0x804CCCD: append_children (node.c:148) -| | ->07.72% (5,316,096B) 0x804B638: yyparse (parser.y:169) -| | ->07.72% (5,316,096B) 0x804AF9A: parse_file (parser.y:67) -| | ->07.72% (5,316,096B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->07.72% (5,316,096B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.00% (4,818,816B) 0x804F5DE: refactor_generic_list (stack.c:59) -| ->07.00% (4,818,816B) 0x804F9E7: append_element (stack.c:144) -| ->06.09% (4,194,304B) 0x804FB54: add_element (stack.c:180) -| | ->06.09% (4,194,304B) 0x80500E4: push_stack (stack.c:311) -| | ->06.09% (4,194,304B) 0x80491CE: yylex (parser.l:32) -| | | ->06.09% (4,194,304B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->06.09% (4,194,304B) 0x804AF9A: parse_file (parser.y:67) -| | | ->06.09% (4,194,304B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->06.09% (4,194,304B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.91% (624,512B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.66% (4,586,848B) 0x804CE35: new_attribute (node.c:188) -| ->06.66% (4,586,848B) 0x804B891: yyparse (parser.y:222) -| ->06.66% (4,586,848B) 0x804AF9A: parse_file (parser.y:67) -| ->06.66% (4,586,848B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->06.66% (4,586,848B) 0x80517ED: main (main.c:29) -| -->04.76% (3,276,320B) 0x804E63E: new_rbtree_node (rbtree.c:15) -| ->04.76% (3,276,320B) 0x804EA0C: rb_tree_insert (rbtree.c:146) -| ->04.76% (3,276,320B) 0x804CBAC: add_attribute (node.c:132) -| ->04.76% (3,276,320B) 0x804B86B: yyparse (parser.y:218) -| ->04.76% (3,276,320B) 0x804AF9A: parse_file (parser.y:67) -| ->04.76% (3,276,320B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->04.76% (3,276,320B) 0x80517ED: main (main.c:29) -| -->03.39% (2,336,572B) 0x804CD5F: new_element_node (node.c:164) -| ->03.39% (2,336,460B) 0x804B844: yyparse (parser.y:215) -| | ->03.39% (2,336,460B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.39% (2,336,460B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.39% (2,336,460B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (112B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.34% (2,299,528B) 0x804CDCA: new_text_node (node.c:176) -| ->03.34% (2,299,528B) 0x804B78D: yyparse (parser.y:196) -| ->03.34% (2,299,528B) 0x804AF9A: parse_file (parser.y:67) -| ->03.34% (2,299,528B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->03.34% (2,299,528B) 0x80517ED: main (main.c:29) -| -->01.94% (1,335,136B) 0x804F3C0: new_generic_list (stack.c:13) -| ->01.94% (1,335,072B) 0x804CCCD: append_children (node.c:148) -| | ->01.94% (1,335,072B) 0x804B638: yyparse (parser.y:169) -| | ->01.94% (1,335,072B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.94% (1,335,072B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.94% (1,335,072B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.42% (980,268B) 0x804E6DD: new_rbtree (rbtree.c:39) -| ->01.42% (980,268B) 0x804CB91: add_attribute (node.c:131) -| ->01.42% (980,268B) 0x804B86B: yyparse (parser.y:218) -| ->01.42% (980,268B) 0x804AF9A: parse_file (parser.y:67) -| ->01.42% (980,268B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->01.42% (980,268B) 0x80517ED: main (main.c:29) -| -->00.07% (49,888B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 6 167,685,128 81,473,736 51,372,897 30,100,839 0 - 7 197,525,416 95,611,704 60,016,593 35,595,111 0 -62.77% (60,016,593B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->18.83% (18,005,877B) 0x40B14AE: strdup (strdup.c:43) -| ->04.96% (4,739,416B) 0x8049120: yylex (parser.l:24) -| | ->04.96% (4,739,416B) 0x804B340: yyparse (y.tab.c:1517) -| | ->04.96% (4,739,416B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.96% (4,739,416B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.96% (4,739,416B) 0x80517ED: main (main.c:29) -| | -| ->04.96% (4,739,416B) 0x804CDF3: new_text_node (node.c:180) -| | ->04.96% (4,739,416B) 0x804B78D: yyparse (parser.y:196) -| | ->04.96% (4,739,416B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.96% (4,739,416B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.96% (4,739,416B) 0x80517ED: main (main.c:29) -| | -| ->03.54% (3,387,859B) 0x80491B2: yylex (parser.l:32) -| | ->03.54% (3,387,859B) 0x804B340: yyparse (y.tab.c:1517) -| | ->03.54% (3,387,859B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.54% (3,387,859B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.54% (3,387,859B) 0x80517ED: main (main.c:29) -| | -| ->01.58% (1,506,240B) 0x804CE54: new_attribute (node.c:191) -| | ->01.58% (1,506,240B) 0x804B891: yyparse (parser.y:222) -| | ->01.58% (1,506,240B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.58% (1,506,240B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.58% (1,506,240B) 0x80517ED: main (main.c:29) -| | -| ->01.41% (1,346,059B) 0x8049208: yylex (parser.l:37) -| | ->01.41% (1,346,059B) 0x804B340: yyparse (y.tab.c:1517) -| | ->01.41% (1,346,059B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.41% (1,346,059B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.41% (1,346,059B) 0x80517ED: main (main.c:29) -| | -| ->01.41% (1,346,059B) 0x804CE67: new_attribute (node.c:192) -| | ->01.41% (1,346,059B) 0x804B891: yyparse (parser.y:222) -| | ->01.41% (1,346,059B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.41% (1,346,059B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.41% (1,346,059B) 0x80517ED: main (main.c:29) -| | -| ->00.98% (940,828B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.79% (8,402,392B) 0x804F9F3: append_element (stack.c:147) -| ->06.83% (6,527,248B) 0x804FB54: add_element (stack.c:180) -| | ->06.83% (6,527,248B) 0x80500E4: push_stack (stack.c:311) -| | ->03.92% (3,744,448B) 0x80491CE: yylex (parser.l:32) -| | | ->03.92% (3,744,448B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->03.92% (3,744,448B) 0x804AF9A: parse_file (parser.y:67) -| | | ->03.92% (3,744,448B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->03.92% (3,744,448B) 0x80517ED: main (main.c:29) -| | | -| | ->01.94% (1,853,416B) 0x8049224: yylex (parser.l:37) -| | | ->01.94% (1,853,416B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->01.94% (1,853,416B) 0x804AF9A: parse_file (parser.y:67) -| | | ->01.94% (1,853,416B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->01.94% (1,853,416B) 0x80517ED: main (main.c:29) -| | | -| | ->00.97% (929,384B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.96% (1,875,144B) 0x804CAA3: append_child (node.c:112) -| ->01.96% (1,869,504B) 0x804CCFD: append_children (node.c:151) -| | ->01.96% (1,869,504B) 0x804B638: yyparse (parser.y:169) -| | ->01.96% (1,869,504B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.96% (1,869,504B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.96% (1,869,504B) 0x80517ED: main (main.c:29) -| | -| ->00.01% (5,640B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.87% (7,529,088B) 0x804F3F6: new_generic_list (stack.c:18) -| ->07.87% (7,529,024B) 0x804CCCD: append_children (node.c:148) -| | ->07.87% (7,529,024B) 0x804B638: yyparse (parser.y:169) -| | ->07.87% (7,529,024B) 0x804AF9A: parse_file (parser.y:67) -| | ->07.87% (7,529,024B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->07.87% (7,529,024B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.78% (6,486,956B) 0x804CE35: new_attribute (node.c:188) -| ->06.78% (6,486,956B) 0x804B891: yyparse (parser.y:222) -| ->06.78% (6,486,956B) 0x804AF9A: parse_file (parser.y:67) -| ->06.78% (6,486,956B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->06.78% (6,486,956B) 0x80517ED: main (main.c:29) -| -->05.30% (5,069,440B) 0x804F5DE: refactor_generic_list (stack.c:59) -| ->05.30% (5,069,440B) 0x804F9E7: append_element (stack.c:144) -| ->04.39% (4,194,304B) 0x804FB54: add_element (stack.c:180) -| | ->04.39% (4,194,304B) 0x80500E4: push_stack (stack.c:311) -| | ->04.39% (4,194,304B) 0x80491CE: yylex (parser.l:32) -| | | ->04.39% (4,194,304B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->04.39% (4,194,304B) 0x804AF9A: parse_file (parser.y:67) -| | | ->04.39% (4,194,304B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->04.39% (4,194,304B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.92% (875,136B) in 1+ places, all below ms_print's threshold (01.00%) -| -->04.85% (4,633,540B) 0x804E63E: new_rbtree_node (rbtree.c:15) -| ->04.85% (4,633,540B) 0x804EA0C: rb_tree_insert (rbtree.c:146) -| ->04.85% (4,633,540B) 0x804CBAC: add_attribute (node.c:132) -| ->04.85% (4,633,540B) 0x804B86B: yyparse (parser.y:218) -| ->04.85% (4,633,540B) 0x804AF9A: parse_file (parser.y:67) -| ->04.85% (4,633,540B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->04.85% (4,633,540B) 0x80517ED: main (main.c:29) -| -->03.46% (3,309,460B) 0x804CD5F: new_element_node (node.c:164) -| ->03.46% (3,309,348B) 0x804B844: yyparse (parser.y:215) -| | ->03.46% (3,309,348B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.46% (3,309,348B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.46% (3,309,348B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (112B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.40% (3,252,844B) 0x804CDCA: new_text_node (node.c:176) -| ->03.40% (3,252,844B) 0x804B78D: yyparse (parser.y:196) -| ->03.40% (3,252,844B) 0x804AF9A: parse_file (parser.y:67) -| ->03.40% (3,252,844B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->03.40% (3,252,844B) 0x80517ED: main (main.c:29) -| -->01.98% (1,891,072B) 0x804F3C0: new_generic_list (stack.c:13) -| ->01.98% (1,891,008B) 0x804CCCD: append_children (node.c:148) -| | ->01.98% (1,891,008B) 0x804B638: yyparse (parser.y:169) -| | ->01.98% (1,891,008B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.98% (1,891,008B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.98% (1,891,008B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (64B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.45% (1,386,036B) 0x804E6DD: new_rbtree (rbtree.c:39) -| ->01.45% (1,386,036B) 0x804CB91: add_attribute (node.c:131) -| ->01.45% (1,386,036B) 0x804B86B: yyparse (parser.y:218) -| ->01.45% (1,386,036B) 0x804AF9A: parse_file (parser.y:67) -| ->01.45% (1,386,036B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->01.45% (1,386,036B) 0x80517ED: main (main.c:29) -| -->00.05% (49,888B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 8 214,272,384 103,538,928 64,862,412 38,676,516 0 -62.65% (64,862,412B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->18.91% (19,578,572B) 0x40B14AE: strdup (strdup.c:43) -| ->04.97% (5,147,426B) 0x8049120: yylex (parser.l:24) -| | ->04.97% (5,147,426B) 0x804B340: yyparse (y.tab.c:1517) -| | ->04.97% (5,147,426B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.97% (5,147,426B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.97% (5,147,426B) 0x80517ED: main (main.c:29) -| | -| ->04.97% (5,147,426B) 0x804CDF3: new_text_node (node.c:180) -| | ->04.97% (5,147,426B) 0x804B78D: yyparse (parser.y:196) -| | ->04.97% (5,147,426B) 0x804AF9A: parse_file (parser.y:67) -| | ->04.97% (5,147,426B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->04.97% (5,147,426B) 0x80517ED: main (main.c:29) -| | -| ->03.56% (3,682,036B) 0x80491B2: yylex (parser.l:32) -| | ->03.56% (3,682,036B) 0x804B340: yyparse (y.tab.c:1517) -| | ->03.56% (3,682,036B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.56% (3,682,036B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.56% (3,682,036B) 0x80517ED: main (main.c:29) -| | -| ->01.58% (1,636,150B) 0x804CE54: new_attribute (node.c:191) -| | ->01.58% (1,636,150B) 0x804B891: yyparse (parser.y:222) -| | ->01.58% (1,636,150B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.58% (1,636,150B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.58% (1,636,150B) 0x80517ED: main (main.c:29) -| | -| ->01.42% (1,471,284B) 0x8049208: yylex (parser.l:37) -| | ->01.42% (1,471,284B) 0x804B340: yyparse (y.tab.c:1517) -| | ->01.42% (1,471,284B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.42% (1,471,284B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.42% (1,471,284B) 0x80517ED: main (main.c:29) -| | -| ->01.42% (1,471,284B) 0x804CE67: new_attribute (node.c:192) -| | ->01.42% (1,471,284B) 0x804B891: yyparse (parser.y:222) -| | ->01.42% (1,471,284B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.42% (1,471,284B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.42% (1,471,284B) 0x80517ED: main (main.c:29) -| | -| ->00.99% (1,022,966B) in 1+ places, all below ms_print's threshold (01.00%) -| -->08.82% (9,131,080B) 0x804F9F3: append_element (stack.c:147) -| ->06.85% (7,092,984B) 0x804FB54: add_element (stack.c:180) -| | ->06.85% (7,092,984B) 0x80500E4: push_stack (stack.c:311) -| | ->03.93% (4,070,024B) 0x80491CE: yylex (parser.l:32) -| | | ->03.93% (4,070,024B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->03.93% (4,070,024B) 0x804AF9A: parse_file (parser.y:67) -| | | ->03.93% (4,070,024B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->03.93% (4,070,024B) 0x80517ED: main (main.c:29) -| | | -| | ->01.94% (2,013,240B) 0x8049224: yylex (parser.l:37) -| | | ->01.94% (2,013,240B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->01.94% (2,013,240B) 0x804AF9A: parse_file (parser.y:67) -| | | ->01.94% (2,013,240B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->01.94% (2,013,240B) 0x80517ED: main (main.c:29) -| | | -| | ->00.98% (1,009,720B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.97% (2,038,096B) 0x804CAA3: append_child (node.c:112) -| ->01.96% (2,030,560B) 0x804CCFD: append_children (node.c:151) -| | ->01.96% (2,030,560B) 0x804B638: yyparse (parser.y:169) -| | ->01.96% (2,030,560B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.96% (2,030,560B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.96% (2,030,560B) 0x80517ED: main (main.c:29) -| | -| ->00.01% (7,536B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.91% (8,188,800B) 0x804F3F6: new_generic_list (stack.c:18) -| ->07.91% (8,188,672B) 0x804CCCD: append_children (node.c:148) -| | ->07.91% (8,188,672B) 0x804B638: yyparse (parser.y:169) -| | ->07.91% (8,188,672B) 0x804AF9A: parse_file (parser.y:67) -| | ->07.91% (8,188,672B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->07.91% (8,188,672B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (128B) in 1+ places, all below ms_print's threshold (01.00%) -| -->06.81% (7,046,340B) 0x804CE35: new_attribute (node.c:188) -| ->06.81% (7,046,340B) 0x804B891: yyparse (parser.y:222) -| ->06.81% (7,046,340B) 0x804AF9A: parse_file (parser.y:67) -| ->06.81% (7,046,340B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->06.81% (7,046,340B) 0x80517ED: main (main.c:29) -| -->04.96% (5,138,944B) 0x804F5DE: refactor_generic_list (stack.c:59) -| ->04.96% (5,138,944B) 0x804F9E7: append_element (stack.c:144) -| ->04.05% (4,194,304B) 0x804FB54: add_element (stack.c:180) -| | ->04.05% (4,194,304B) 0x80500E4: push_stack (stack.c:311) -| | ->04.05% (4,194,304B) 0x80491CE: yylex (parser.l:32) -| | | ->04.05% (4,194,304B) 0x804B340: yyparse (y.tab.c:1517) -| | | ->04.05% (4,194,304B) 0x804AF9A: parse_file (parser.y:67) -| | | ->04.05% (4,194,304B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->04.05% (4,194,304B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.91% (944,640B) in 1+ places, all below ms_print's threshold (01.00%) -| -->04.86% (5,033,100B) 0x804E63E: new_rbtree_node (rbtree.c:15) -| ->04.86% (5,033,100B) 0x804EA0C: rb_tree_insert (rbtree.c:146) -| ->04.86% (5,033,100B) 0x804CBAC: add_attribute (node.c:132) -| ->04.86% (5,033,100B) 0x804B86B: yyparse (parser.y:218) -| ->04.86% (5,033,100B) 0x804AF9A: parse_file (parser.y:67) -| ->04.86% (5,033,100B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->04.86% (5,033,100B) 0x80517ED: main (main.c:29) -| -->03.48% (3,599,568B) 0x804CD5F: new_element_node (node.c:164) -| ->03.48% (3,599,428B) 0x804B844: yyparse (parser.y:215) -| | ->03.48% (3,599,428B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.48% (3,599,428B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.48% (3,599,428B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (140B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.41% (3,534,020B) 0x804CDCA: new_text_node (node.c:176) -| ->03.41% (3,534,020B) 0x804B78D: yyparse (parser.y:196) -| ->03.41% (3,534,020B) 0x804AF9A: parse_file (parser.y:67) -| ->03.41% (3,534,020B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->03.41% (3,534,020B) 0x80517ED: main (main.c:29) -| -->01.99% (2,056,832B) 0x804F3C0: new_generic_list (stack.c:13) -| ->01.99% (2,056,752B) 0x804CCCD: append_children (node.c:148) -| | ->01.99% (2,056,752B) 0x804B638: yyparse (parser.y:169) -| | ->01.99% (2,056,752B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.99% (2,056,752B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.99% (2,056,752B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (80B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.45% (1,505,268B) 0x804E6DD: new_rbtree (rbtree.c:39) -| ->01.45% (1,505,268B) 0x804CB91: add_attribute (node.c:131) -| ->01.45% (1,505,268B) 0x804B86B: yyparse (parser.y:218) -| ->01.45% (1,505,268B) 0x804AF9A: parse_file (parser.y:67) -| ->01.45% (1,505,268B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->01.45% (1,505,268B) 0x80517ED: main (main.c:29) -| -->00.05% (49,888B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 9 248,122,592 72,294,912 48,468,352 23,826,560 0 - 10 269,602,272 67,243,920 43,846,519 23,397,401 0 - 11 299,478,448 67,656,528 44,139,627 23,516,901 0 - 12 316,693,008 67,931,408 44,372,127 23,559,281 0 - 13 343,583,184 68,142,000 44,522,567 23,619,433 0 - 14 377,221,664 68,371,936 44,686,807 23,685,129 0 - 15 394,715,592 68,020,232 44,307,379 23,712,853 0 - 16 418,783,912 68,117,928 44,366,647 23,751,281 0 - 17 435,131,688 68,171,864 44,399,011 23,772,853 0 - 18 458,881,328 68,257,168 44,450,191 23,806,977 0 - 19 476,128,080 68,584,336 44,758,171 23,826,165 0 - 20 499,522,216 68,379,864 44,523,811 23,856,053 0 - 21 518,089,624 68,435,992 44,556,835 23,879,157 0 - 22 547,093,624 69,165,928 45,253,947 23,911,981 0 - 23 576,557,360 68,937,664 44,993,723 23,943,941 0 - 24 594,509,480 68,644,712 44,682,067 23,962,645 0 - 25 623,558,072 68,715,912 44,724,807 23,991,105 0 - 26 653,770,160 68,784,864 44,765,979 24,018,885 0 - 27 685,184,968 68,862,184 44,813,203 24,048,981 0 - 28 709,323,344 68,912,384 44,843,323 24,069,061 0 - 29 745,716,088 68,978,664 44,883,091 24,095,573 0 - 30 766,101,248 69,017,824 44,906,587 24,111,237 0 - 31 804,125,888 69,065,408 44,934,335 24,131,073 0 - 32 823,411,920 69,083,264 44,945,019 24,138,245 0 - 33 852,380,568 69,570,520 45,415,627 24,154,893 0 - 34 862,658,904 69,127,944 44,971,827 24,156,117 0 - 35 891,794,784 69,172,544 44,998,623 24,173,921 0 - 36 911,122,000 70,109,904 45,928,207 24,181,697 0 -65.51% (45,928,207B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->13.34% (9,353,551B) 0x40B14AE: strdup (strdup.c:43) -| ->07.40% (5,188,706B) 0x804CDF3: new_text_node (node.c:180) -| | ->07.40% (5,188,706B) 0x804B78D: yyparse (parser.y:196) -| | ->07.40% (5,188,706B) 0x804AF9A: parse_file (parser.y:67) -| | ->07.40% (5,188,706B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->07.40% (5,188,706B) 0x80517ED: main (main.c:29) -| | -| ->02.35% (1,649,765B) 0x804CE54: new_attribute (node.c:191) -| | ->02.35% (1,649,765B) 0x804B891: yyparse (parser.y:222) -| | ->02.35% (1,649,765B) 0x804AF9A: parse_file (parser.y:67) -| | ->02.35% (1,649,765B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->02.35% (1,649,765B) 0x80517ED: main (main.c:29) -| | -| ->02.12% (1,483,582B) 0x804CE67: new_attribute (node.c:192) -| | ->02.12% (1,483,582B) 0x804B891: yyparse (parser.y:222) -| | ->02.12% (1,483,582B) 0x804AF9A: parse_file (parser.y:67) -| | ->02.12% (1,483,582B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->02.12% (1,483,582B) 0x80517ED: main (main.c:29) -| | -| ->01.47% (1,031,498B) 0x804C6BC: set_name (node.c:26) -| | ->01.47% (1,031,494B) 0x804B7CC: yyparse (parser.y:202) -| | | ->01.47% (1,031,494B) 0x804AF9A: parse_file (parser.y:67) -| | | ->01.47% (1,031,494B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->01.47% (1,031,494B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (4B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->12.43% (8,716,196B) 0x804F3F6: new_generic_list (stack.c:18) -| ->11.78% (8,257,152B) 0x804CCCD: append_children (node.c:148) -| | ->11.78% (8,257,152B) 0x804B638: yyparse (parser.y:169) -| | ->11.78% (8,257,152B) 0x804AF9A: parse_file (parser.y:67) -| | ->11.78% (8,257,152B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->11.78% (8,257,152B) 0x80517ED: main (main.c:29) -| | -| ->00.65% (459,044B) in 1+ places, all below ms_print's threshold (01.00%) -| -->10.13% (7,104,972B) 0x804CE35: new_attribute (node.c:188) -| ->10.13% (7,104,972B) 0x804B891: yyparse (parser.y:222) -| ->10.13% (7,104,972B) 0x804AF9A: parse_file (parser.y:67) -| ->10.13% (7,104,972B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->10.13% (7,104,972B) 0x80517ED: main (main.c:29) -| -->07.24% (5,074,980B) 0x804E63E: new_rbtree_node (rbtree.c:15) -| ->07.24% (5,074,980B) 0x804EA0C: rb_tree_insert (rbtree.c:146) -| ->07.24% (5,074,980B) 0x804CBAC: add_attribute (node.c:132) -| ->07.24% (5,074,980B) 0x804B86B: yyparse (parser.y:218) -| ->07.24% (5,074,980B) 0x804AF9A: parse_file (parser.y:67) -| ->07.24% (5,074,980B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->07.24% (5,074,980B) 0x80517ED: main (main.c:29) -| -->05.18% (3,629,528B) 0x804CD5F: new_element_node (node.c:164) -| ->05.18% (3,629,528B) 0x804B844: yyparse (parser.y:215) -| | ->05.18% (3,629,528B) 0x804AF9A: parse_file (parser.y:67) -| | ->05.18% (3,629,528B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->05.18% (3,629,528B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.08% (3,563,448B) 0x804CDCA: new_text_node (node.c:176) -| ->05.08% (3,563,448B) 0x804B78D: yyparse (parser.y:196) -| ->05.08% (3,563,448B) 0x804AF9A: parse_file (parser.y:67) -| ->05.08% (3,563,448B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->05.08% (3,563,448B) 0x80517ED: main (main.c:29) -| -->04.24% (2,973,208B) 0x804F9F3: append_element (stack.c:147) -| ->02.93% (2,055,120B) 0x804CAA3: append_child (node.c:112) -| | ->02.93% (2,055,120B) 0x804CCFD: append_children (node.c:151) -| | | ->02.93% (2,055,120B) 0x804B638: yyparse (parser.y:169) -| | | ->02.93% (2,055,120B) 0x804AF9A: parse_file (parser.y:67) -| | | ->02.93% (2,055,120B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->02.93% (2,055,120B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.31% (918,088B) 0x804FB54: add_element (stack.c:180) -| ->01.31% (918,088B) 0x804D1BF: get_descendants (node.c:284) -| | ->01.30% (912,856B) 0x804D195: get_descendants (node.c:282) -| | | ->01.29% (902,376B) 0x804D195: get_descendants (node.c:282) -| | | | ->01.29% (902,376B) 0x8051567: query (query_runner.c:248) -| | | | ->01.29% (902,376B) 0x805180B: main (main.c:37) -| | | | -| | | ->00.01% (10,480B) in 1+ places, all below ms_print's threshold (01.00%) -| | | -| | ->00.01% (5,232B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.96% (2,074,048B) 0x804F3C0: new_generic_list (stack.c:13) -| ->02.96% (2,074,000B) 0x804CCCD: append_children (node.c:148) -| | ->02.96% (2,074,000B) 0x804B638: yyparse (parser.y:169) -| | ->02.96% (2,074,000B) 0x804AF9A: parse_file (parser.y:67) -| | ->02.96% (2,074,000B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->02.96% (2,074,000B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (48B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.67% (1,870,648B) 0x804F5DE: refactor_generic_list (stack.c:59) -| ->02.67% (1,870,648B) 0x804F9E7: append_element (stack.c:144) -| ->01.36% (952,576B) 0x804CAA3: append_child (node.c:112) -| | ->01.36% (952,576B) 0x804CCFD: append_children (node.c:151) -| | | ->01.36% (952,576B) 0x804B638: yyparse (parser.y:169) -| | | ->01.36% (952,576B) 0x804AF9A: parse_file (parser.y:67) -| | | ->01.36% (952,576B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->01.36% (952,576B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->01.31% (918,072B) 0x804FB54: add_element (stack.c:180) -| ->01.31% (918,072B) 0x804D1BF: get_descendants (node.c:284) -| | ->01.31% (917,944B) 0x8051567: query (query_runner.c:248) -| | | ->01.31% (917,944B) 0x805180B: main (main.c:37) -| | | -| | ->00.00% (128B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.16% (1,517,784B) 0x804E6DD: new_rbtree (rbtree.c:39) -| ->02.16% (1,517,784B) 0x804CB91: add_attribute (node.c:131) -| ->02.16% (1,517,784B) 0x804B86B: yyparse (parser.y:218) -| ->02.16% (1,517,784B) 0x804AF9A: parse_file (parser.y:67) -| ->02.16% (1,517,784B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->02.16% (1,517,784B) 0x80517ED: main (main.c:29) -| -->00.07% (49,844B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 37 940,412,840 69,259,256 45,050,635 24,208,621 0 - 38 978,582,944 69,288,512 45,068,167 24,220,345 0 - 39 997,898,672 69,305,808 45,078,547 24,227,261 0 - 40 1,017,385,648 69,327,296 45,091,459 24,235,837 0 - 41 1,036,961,600 69,340,320 45,099,287 24,241,033 0 - 42 1,056,818,720 69,368,144 45,116,007 24,252,137 0 - 43 1,076,817,712 69,395,008 45,132,883 24,262,125 0 - 44 1,096,987,472 69,412,240 45,142,403 24,269,837 0 - 45 1,117,259,608 69,430,088 45,153,931 24,276,157 0 - 46 1,137,765,672 69,458,088 45,170,731 24,287,357 0 - 47 1,158,441,712 69,482,272 45,185,239 24,297,033 0 - 48 1,178,250,080 70,570,480 46,063,519 24,506,961 0 - 49 1,215,838,040 72,480,376 47,205,625 25,274,751 0 - 50 1,226,116,384 72,480,080 47,205,375 25,274,705 0 - 51 1,236,394,728 72,480,248 47,205,535 25,274,713 0 - 52 1,246,673,064 72,480,264 47,205,473 25,274,791 0 - 53 1,256,951,400 72,480,232 47,205,457 25,274,775 0 - 54 1,267,229,760 72,480,176 47,205,431 25,274,745 0 - 55 1,277,508,152 72,480,344 47,205,559 25,274,785 0 - 56 1,287,786,600 72,480,376 47,205,625 25,274,751 0 - 57 1,298,065,008 72,480,048 47,205,363 25,274,685 0 - 58 1,308,343,384 72,480,376 47,205,625 25,274,751 0 -65.13% (47,205,625B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->12.90% (9,353,551B) 0x40B14AE: strdup (strdup.c:43) -| ->07.16% (5,188,706B) 0x804CDF3: new_text_node (node.c:180) -| | ->07.16% (5,188,706B) 0x804B78D: yyparse (parser.y:196) -| | ->07.16% (5,188,706B) 0x804AF9A: parse_file (parser.y:67) -| | ->07.16% (5,188,706B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->07.16% (5,188,706B) 0x80517ED: main (main.c:29) -| | -| ->02.28% (1,649,765B) 0x804CE54: new_attribute (node.c:191) -| | ->02.28% (1,649,765B) 0x804B891: yyparse (parser.y:222) -| | ->02.28% (1,649,765B) 0x804AF9A: parse_file (parser.y:67) -| | ->02.28% (1,649,765B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->02.28% (1,649,765B) 0x80517ED: main (main.c:29) -| | -| ->02.05% (1,483,582B) 0x804CE67: new_attribute (node.c:192) -| | ->02.05% (1,483,582B) 0x804B891: yyparse (parser.y:222) -| | ->02.05% (1,483,582B) 0x804AF9A: parse_file (parser.y:67) -| | ->02.05% (1,483,582B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->02.05% (1,483,582B) 0x80517ED: main (main.c:29) -| | -| ->01.42% (1,031,498B) 0x804C6BC: set_name (node.c:26) -| | ->01.42% (1,031,494B) 0x804B7CC: yyparse (parser.y:202) -| | | ->01.42% (1,031,494B) 0x804AF9A: parse_file (parser.y:67) -| | | ->01.42% (1,031,494B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->01.42% (1,031,494B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (4B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->12.82% (9,294,136B) 0x804F3F6: new_generic_list (stack.c:18) -| ->11.39% (8,257,152B) 0x804CCCD: append_children (node.c:148) -| | ->11.39% (8,257,152B) 0x804B638: yyparse (parser.y:169) -| | ->11.39% (8,257,152B) 0x804AF9A: parse_file (parser.y:67) -| | ->11.39% (8,257,152B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->11.39% (8,257,152B) 0x80517ED: main (main.c:29) -| | -| ->01.43% (1,036,984B) 0x8051021: filter_nodes_by_name (query_runner.c:131) -| | ->01.43% (1,036,984B) 0x8051484: filter_nodes_by_selector (query_runner.c:224) -| | ->01.43% (1,036,984B) 0x80516D2: query (query_runner.c:290) -| | ->01.43% (1,036,984B) 0x805180B: main (main.c:37) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->09.80% (7,104,972B) 0x804CE35: new_attribute (node.c:188) -| ->09.80% (7,104,972B) 0x804B891: yyparse (parser.y:222) -| ->09.80% (7,104,972B) 0x804AF9A: parse_file (parser.y:67) -| ->09.80% (7,104,972B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->09.80% (7,104,972B) 0x80517ED: main (main.c:29) -| -->07.00% (5,074,980B) 0x804E63E: new_rbtree_node (rbtree.c:15) -| ->07.00% (5,074,980B) 0x804EA0C: rb_tree_insert (rbtree.c:146) -| ->07.00% (5,074,980B) 0x804CBAC: add_attribute (node.c:132) -| | ->07.00% (5,074,980B) 0x804B86B: yyparse (parser.y:218) -| | ->07.00% (5,074,980B) 0x804AF9A: parse_file (parser.y:67) -| | ->07.00% (5,074,980B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->07.00% (5,074,980B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.61% (4,066,224B) 0x804F9F3: append_element (stack.c:147) -| ->02.84% (2,055,120B) 0x804CAA3: append_child (node.c:112) -| | ->02.84% (2,055,120B) 0x804CCFD: append_children (node.c:151) -| | | ->02.84% (2,055,120B) 0x804B638: yyparse (parser.y:169) -| | | ->02.84% (2,055,120B) 0x804AF9A: parse_file (parser.y:67) -| | | ->02.84% (2,055,120B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->02.84% (2,055,120B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->02.77% (2,011,104B) 0x804FB54: add_element (stack.c:180) -| | ->01.39% (1,005,552B) 0x8051076: filter_nodes_by_name (query_runner.c:135) -| | | ->01.39% (1,005,552B) 0x8051484: filter_nodes_by_selector (query_runner.c:224) -| | | ->01.39% (1,005,552B) 0x80516D2: query (query_runner.c:290) -| | | ->01.39% (1,005,552B) 0x805180B: main (main.c:37) -| | | -| | ->01.39% (1,005,552B) 0x8051744: query (query_runner.c:303) -| | | ->01.39% (1,005,552B) 0x805180B: main (main.c:37) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->05.01% (3,629,528B) 0x804CD5F: new_element_node (node.c:164) -| ->05.01% (3,629,528B) 0x804B844: yyparse (parser.y:215) -| | ->05.01% (3,629,528B) 0x804AF9A: parse_file (parser.y:67) -| | ->05.01% (3,629,528B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->05.01% (3,629,528B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->04.92% (3,563,448B) 0x804CDCA: new_text_node (node.c:176) -| ->04.92% (3,563,448B) 0x804B78D: yyparse (parser.y:196) -| ->04.92% (3,563,448B) 0x804AF9A: parse_file (parser.y:67) -| ->04.92% (3,563,448B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->04.92% (3,563,448B) 0x80517ED: main (main.c:29) -| -->02.86% (2,074,032B) 0x804F3C0: new_generic_list (stack.c:13) -| ->02.86% (2,074,000B) 0x804CCCD: append_children (node.c:148) -| | ->02.86% (2,074,000B) 0x804B638: yyparse (parser.y:169) -| | ->02.86% (2,074,000B) 0x804AF9A: parse_file (parser.y:67) -| | ->02.86% (2,074,000B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->02.86% (2,074,000B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (32B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.09% (1,517,784B) 0x804E6DD: new_rbtree (rbtree.c:39) -| ->02.09% (1,517,784B) 0x804CB91: add_attribute (node.c:131) -| | ->02.09% (1,517,784B) 0x804B86B: yyparse (parser.y:218) -| | ->02.09% (1,517,784B) 0x804AF9A: parse_file (parser.y:67) -| | ->02.09% (1,517,784B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->02.09% (1,517,784B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->02.04% (1,476,864B) 0x804F5DE: refactor_generic_list (stack.c:59) -| ->02.04% (1,476,864B) 0x804F9E7: append_element (stack.c:144) -| ->01.31% (952,576B) 0x804CAA3: append_child (node.c:112) -| | ->01.31% (952,576B) 0x804CCFD: append_children (node.c:151) -| | | ->01.31% (952,576B) 0x804B638: yyparse (parser.y:169) -| | | ->01.31% (952,576B) 0x804AF9A: parse_file (parser.y:67) -| | | ->01.31% (952,576B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | | ->01.31% (952,576B) 0x80517ED: main (main.c:29) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.72% (524,288B) in 1+ places, all below ms_print's threshold (01.00%) -| -->00.07% (50,106B) in 1+ places, all below ms_print's threshold (01.00%) - --------------------------------------------------------------------------------- - n time(B) total(B) useful-heap(B) extra-heap(B) stacks(B) --------------------------------------------------------------------------------- - 59 1,318,621,728 72,480,256 47,205,513 25,274,743 0 - 60 1,328,900,064 72,480,144 47,205,419 25,274,725 0 - 61 1,339,178,496 72,480,400 47,205,651 25,274,749 0 - 62 1,349,456,840 65,619,464 42,731,791 22,887,673 0 - 63 1,359,735,184 55,928,992 36,414,236 19,514,756 0 - 64 1,370,013,520 46,238,848 30,095,515 16,143,333 0 - 65 1,380,291,856 36,547,904 23,777,649 12,770,255 0 - 66 1,390,570,232 26,856,664 17,457,757 9,398,907 0 - 67 1,400,848,608 17,166,000 11,138,966 6,027,034 0 - 68 1,411,126,952 7,470,536 4,815,354 2,655,182 0 -64.46% (4,815,354B) (heap allocation functions) malloc/new/new[], --alloc-fns, etc. -->27.77% (2,074,600B) 0x804F9F3: append_element (stack.c:147) -| ->26.92% (2,011,104B) 0x804FB54: add_element (stack.c:180) -| | ->13.46% (1,005,552B) 0x8051076: filter_nodes_by_name (query_runner.c:135) -| | | ->13.46% (1,005,552B) 0x8051484: filter_nodes_by_selector (query_runner.c:224) -| | | ->13.46% (1,005,552B) 0x80516D2: query (query_runner.c:290) -| | | ->13.46% (1,005,552B) 0x805180B: main (main.c:37) -| | | -| | ->13.46% (1,005,552B) 0x8051744: query (query_runner.c:303) -| | | ->13.46% (1,005,552B) 0x805180B: main (main.c:37) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.85% (63,496B) in 1+ places, all below ms_print's threshold (01.00%) -| -->16.90% (1,262,456B) 0x804F3F6: new_generic_list (stack.c:18) -| ->13.88% (1,036,984B) 0x8051021: filter_nodes_by_name (query_runner.c:131) -| | ->13.88% (1,036,984B) 0x8051484: filter_nodes_by_selector (query_runner.c:224) -| | ->13.88% (1,036,984B) 0x80516D2: query (query_runner.c:290) -| | ->13.88% (1,036,984B) 0x805180B: main (main.c:37) -| | -| ->03.02% (225,472B) 0x804CCCD: append_children (node.c:148) -| | ->03.02% (225,472B) 0x804B638: yyparse (parser.y:169) -| | ->03.02% (225,472B) 0x804AF9A: parse_file (parser.y:67) -| | ->03.02% (225,472B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->03.02% (225,472B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->07.43% (555,392B) 0x804F5DE: refactor_generic_list (stack.c:59) -| ->07.43% (555,392B) 0x804F9E7: append_element (stack.c:144) -| ->07.02% (524,288B) 0x804FB54: add_element (stack.c:180) -| | ->07.02% (524,288B) 0x8051744: query (query_runner.c:303) -| | | ->07.02% (524,288B) 0x805180B: main (main.c:37) -| | | -| | ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| | -| ->00.42% (31,104B) in 1+ places, all below ms_print's threshold (01.00%) -| -->03.35% (250,358B) 0x40B14AE: strdup (strdup.c:43) -| ->01.82% (136,099B) 0x804CDF3: new_text_node (node.c:180) -| | ->01.82% (136,099B) 0x804B78D: yyparse (parser.y:196) -| | ->01.82% (136,099B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.82% (136,099B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.82% (136,099B) 0x80517ED: main (main.c:29) -| | -| ->01.53% (114,259B) in 9 places, all below massif's threshold (01.00%) -| -->02.57% (192,080B) 0x804CE35: new_attribute (node.c:188) -| ->02.57% (192,080B) 0x804B891: yyparse (parser.y:222) -| ->02.57% (192,080B) 0x804AF9A: parse_file (parser.y:67) -| ->02.57% (192,080B) 0x8048C76: parse_dom (lxq_parser.c:20) -| ->02.57% (192,080B) 0x80517ED: main (main.c:29) -| -->01.98% (147,548B) in 15 places, all below massif's threshold (01.00%) -| -->01.84% (137,200B) 0x804E63E: new_rbtree_node (rbtree.c:15) -| ->01.84% (137,200B) 0x804EA0C: rb_tree_insert (rbtree.c:146) -| ->01.84% (137,200B) 0x804CBAC: add_attribute (node.c:132) -| | ->01.84% (137,200B) 0x804B86B: yyparse (parser.y:218) -| | ->01.84% (137,200B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.84% (137,200B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.84% (137,200B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.33% (99,260B) 0x804CD5F: new_element_node (node.c:164) -| ->01.33% (99,260B) 0x804B844: yyparse (parser.y:215) -| | ->01.33% (99,260B) 0x804AF9A: parse_file (parser.y:67) -| | ->01.33% (99,260B) 0x8048C76: parse_dom (lxq_parser.c:20) -| | ->01.33% (99,260B) 0x80517ED: main (main.c:29) -| | -| ->00.00% (0B) in 1+ places, all below ms_print's threshold (01.00%) -| -->01.29% (96,460B) 0x804CDCA: new_text_node (node.c:176) - ->01.29% (96,460B) 0x804B78D: yyparse (parser.y:196) - ->01.29% (96,460B) 0x804AF9A: parse_file (parser.y:67) - ->01.29% (96,460B) 0x8048C76: parse_dom (lxq_parser.c:20) - ->01.29% (96,460B) 0x80517ED: main (main.c:29) - diff --git a/querying.html b/querying.html new file mode 100644 index 0000000..7b3b672 --- /dev/null +++ b/querying.html @@ -0,0 +1,232 @@ + + + + + + + + Querying — libxmlquery v0.1.4 documentation + + + + + + + + + + + +
        +

        Navigation

        + +
        + +
        +
        +
        +
        + +
        +

        Querying

        +

        Querying xml nodes to provide quick random access to inner nodes is +implemented through CSS3 selectors.

        +
        +

        Note

        +

        CSS stands for +cascading style sheets, it is primarily used for styling (x)html documents +as method to separate content from presentation.

        +
        +

        The CSS3 selectors specification is a W3C proposed +recomendation widely implemented by most modern browsers, it has also been used, +in its current and earlier forms (CSS and CSS2), by web developers for over 13 +years.

        +

        The W3C recomendation does not tie CSS rules to the presentation of of (x)html +documents, in fact it does define it as a query language capable of selecting +xml/html nodes. With the rise in popularity of AJAX technologies several +javascript libraries became widely used, these libraries (most notabily +JQuery) first proposed the utilization of CSS rules +not only for presentation but also to help manipulation and transversion of the +DOM.

        +

        This library embraces CSS rules as a better/simpler alternative to manual +transversion as well as other W3C recomendations such as +XPath and +XQuery.

        +
        +

        Selectors

        +

        The function xmlquery_query is defined to help filter and match nodes in the +DOM tree:

        +
        +
        +generic_list* xmlquery_query(const char* pattern, dom_node* root)
        +

        pattern Query pattern to apply to XML document.

        +

        root A root of a DOM tree where to begin the query.

        +

        This function applies a query to a given DOM tree and returns a list of elements.

        +
        + +
        +

        Introduction

        +

        Node selection is implemented as a pattern string to be matched against a +DOM tree. The pattern string matches some number of nodes that are +then returned as a flat list.

        +

        A pattern example:

        +
        foo
+
        +
        +

        this simple pattern matches all nodes named foo. Upon matching the DOM tree +with this pattern, a reference to every node named foo would be returned. +Independent of their position in the tree. Returned references may be +manipulated, rearanged or deleted.

        +

        Pattern strings match dom nodes in three different realms, according to the node +name (as we’ve seen), according to the node attributes and according to +pseudo-filters, a special kind of selectors aware of the node context.

        +
        foo[attr='bar']:only-child
+
        +
        +

        A more complex selector, this selector will match nodes with the name foo, +with an attribute named attr with the value bar, and the node must also be +the only child of its parent node.

        +
        +
        +

        Custom filters

        +

        We’ve created some new features. We added the possibility of making custom filters. +Custom filters provide a way for the user to define their own filters, which can be +chained with other query operators.

        +

        To create a custom filter you just need to define a function with the one of the following signatures:

        +
        int simple_filter(dom_node* node);
+int complex_filter(dom_node* node, list* args);
+
        +
        +

        The first one creates a filter that doesn’t take any arguments. If you want to design a filter that takes arguments, you must use the second signature.

        +

        After defining your filter you need to register them. You do this by calling:

        +
        +
        +void register_simple_custom_filter(const char* name, int (*filter)(dom_node* node))
        +
        + +
        +
        +void register_custom_filter(const char* name, int (*filter)(dom_node* node, list* args))
        +
        + +

        The first function registers a simple filter, while the second registers a complex one.

        +

        When you’re done with this you can call your filters just like a CSS3 filter.

        +

        When your program finishes, we should call:

        +
        void destroy_custom_filters()
+
        +
        +
        +
        +

        Custom operators

        +

        Another feature we’ve added is the possibility to create your own operators.

        +

        Like custom filters, custom operators need to be registered in order to be used:

        +
        void register_simple_custom_operator(const char* name, list* (*operator)(list* nodes));
+
        +
        +

        The first argument is the name of the operator. This name will be used to call the operator. You can call your operator with an exclamation point. For example, if we register the operator second we can call it with ”!second”.

        +

        The second argument is a pointer to a function that applies the operator. This function must be defined and provided by the user.

        +

        We already provide two custom operators that we call extended operators. They have the following mean:

        +
          +
        • first - Returns the first occurrence of an element. If you write “device!first” it will return the first device element.
          • +
        • text-children - Returns the text below an element. If you write “device!text-children” it will return all the text nodes directly below elements with tag device.
          • +
        +

        However, in order to use them you need to call:

        +
        register_extended_operators()
+
        +
        +

        and when you’re done you should call:

        +
        destroy_custom_operators()
+
        +
        +
        +
        +
        + + +
        +
        +
        +
        +
        +

        Table Of Contents

        + + +

        Previous topic

        +

        Document Object Model

        +

        Next topic

        +

        Data Structures

        +

        This Page

        + + + +
        +
        +
        +
        +
        +

        Navigation

        + +
        +
        + © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
        + + \ No newline at end of file diff --git a/relatorio/arch.png b/relatorio/arch.png deleted file mode 100644 index 0025798..0000000 Binary files a/relatorio/arch.png and /dev/null differ diff --git a/relatorio/biblioteca xml.tex b/relatorio/biblioteca xml.tex deleted file mode 100644 index badd105..0000000 --- a/relatorio/biblioteca xml.tex +++ /dev/null @@ -1,480 +0,0 @@ -\documentclass[a4paper]{report} - -%============ Packages ================ -\usepackage{graphicx} -\usepackage{amsmath} -\usepackage{listings} -\usepackage{framed} -\usepackage[pdfborder={0 0 0}]{hyperref} -%============ End Packages ============= - -%============ Title ================ -\title{\textbf{\Huge{libxmlquery}}\\A lightweight library to query and manipulate XML files} -\author{ -Vasco Fernandes\\ -MEIC-T, 53801\\ -vasco.fernandes@ist.utl.pt \\ -\and -Frederico Gon\c{c}alves\\ -MEIC-T, 57843\\ -frederico.goncalves@ist.utl.pt\\ -} -%============ End Title ============= - -%============ Document ============ -\begin{document} - -\maketitle - -\tableofcontents - -%Intro% -\chapter{Introduction} - -\section{Motivation} %O google taduz domotica para Home Automation.....% - As computers tend to get smaller and powerful, ubiquitous environments begin to emerge as possible and reliable systems. One of the main characteristics of an ubiquitous environment is the fact that it's filled with - devices that interoperate in order to provide the user with different kind of services. Home Automation is part of the ubiquitous computing philosophy, in the sense that it fills a certain space with devices that work together in - order to provide users with services that are home oriented. Each device has its own characteristics, like a certain operating system, communication medium (Bluetooth, Wifi, ethernet, etc.), communication protocols and - computational capacity. This creates a problem in terms of communication between devices, because each one will communicate with different methods and rules for treating data. This problem stands even if the devices - are of equal characteristics, because there are several different software and hardware configurations that can have an effect on data transmission and handling. - - We need a system that provides communication between devices and lets us handle the transmitted data with great ease. - -\section{Problem description} - When targeting systems built for Home Automation and as said before, we expect a highly heterogeneous environment. One possible solution for this problem is to agree in a common representation and treating method - for transmitted data. - - Such can be achieved by using XML (e\textbf{X}tensible \textbf{M}arkup \textbf{L}anguage). There are several solutions that use this approach, however they tend to be implemented in languages not suitable for - embedded systems. Such solutions also provide a mechanism to query the XML documents, but yet again they're too heavy for embedded systems. We need a lightweight solution that parses and queries XML - documents with good degree of performance in embedded systems. - - Another concern is how easily is to develop some program that parses and manipulates XML. There are three different phases in this kind of program: - - \begin{enumerate} - \item \textbf{Parsing} - Reading an XML document and building a data structure to hold the parsed information. - \item \textbf{Getting the correct data} - Traverse the data structure and retrieve the correct portion of the XML that needs to be manipulated. - \item \textbf{Manipulating} - Alter the retrieved structure and save the changes. - \end{enumerate} - - Each of each phase has different levels of complexity but probably the second is the most tiresome. If the right querying engine is provided to gather the data from the data structure, then this phase can actually be - speed upped. Also, with the right techniques, parsing can be done efficiently without the need to write code to parse different XML documents. - -\section{Goal} - The goal is simple, build a lightweight mechanism to parse, query and manipulate XML documents. To achieve this goal, we've built a library called libxmlquery. - -\section{What is libxmlquery?} - Libxmlquery is a library designed to parse XML files and query them. It also allows manipulation of the xml elements. It is written in C and was tested in three different kind of operating systems - MS-Windows 7, Linux 2.6 - and MacOSx 10.4. It uses the flex library to implement the parser, but it is not compiled against it, which means that the end system doesn't need to have the flex library. However, it has a strong dependency on the C library - and won't work on systems that don't have it.\\ - - - The rest of this report is organized as follows: in chapter \ref{chap:arch} we outline the design of our architecture, present the main modules (sections \ref{sec:dom}, \ref{sec:parser} and \ref{sec:sels}) and explain the data - structure and macros used in them (section \ref{sec:helpers}); in chapter \ref{chap:eval} we present some profiling tests to the memory usage (section \ref{sec:mprof}) and time usage \ref{sec:tprof}; chapter - \ref{chap:concl} we present our main conclusions; in the appendix we shows how to compile against our lib (appendix \ref{chap:gcc}), some sample applications (appendix \ref{chap:app}) and the entire libxmlquery - documentation (appendix \ref{chap:doc}). -%END Intro% - -%Arch% -\chapter{Architecture}\label{chap:arch} -\section{Overview}\label{sec:overview} - We begin by describing the modules of our implementation. Figure \ref{fig:arch} shows the scheme of libxmlquery. - - %Figura da arquitectura - \begin{figure}[h!] - \centering - \label{fig:arch} - \includegraphics[width=0.5\textwidth] {arch} - \caption{libxmlquery module design. Three main modules - DOM module responsible for implementing the data structure that holds the xml contents; Parser module, which parses queries and xml documents; - Querying engine module, which enables querying to a dom structure.} - \end{figure} - - The DOM module defines structures and functions to manipulate a given XML document. As shown in figure \ref{fig:arch}, the DOM module doesn't depend on any other module so it doesn't have to change if any of the others changes. However, if modifications are made to it, then the other modules must change as well, unless the function signature stays exactly the same. - - The Parser module is responsible for parsing queries and XML documents. Due to implementation details (see section \ref{sec:parser}) we weren't able to separate query parsing from XML parsing. This means that the parser depends on both querying engine module and DOM module to work correctly. If any of them changes the parser has to be changed as well. However, if a new parser is needed instead of the one we use, the change wouldn't affect the DOM module and the querying engine module would only need one line changed (The line that calls the function, which parses a query). This new parser would only have to build each query and DOM according to each module's interface. - - Finally, the query engine module is responsible for evaluating query plans and querying XML documents. Each query returns a list of the selected elements. Notice that this module depends on both the DOM module and parser module, because it needs to parse queries and use the data structure provided by the DOM module to search the XML document. In a normal use, one would call the query engine module, which would call the parser module and then the DOM module. - - We've adopted this architecture in order to support flexibility and modularity. However, the user may need to interact directly with the DOM module, which can be achieve by calling the functions provided by its interface. This is also true for the parser module. - - In order to ease the continued development of the library, we've structured the files on disk according to figure \ref{fig:disk}. - - %Figura das pastas em disco. - \begin{figure}[h!] - \centering - \label{fig:disk} - \includegraphics[width=0.30\textwidth] {disk} - \caption{libxmlquery organization on disk.} - \end{figure} - - The first two folders are pretty much descriptive, the third one is where all the query engine source code is. The data\_structures folder has various data structures to help us (see section \ref{sec:helpers}) and the includes - folder has all the header files of our library. - - The next sections details each module's implementation. - -\section{The Document Object Model Module}\label{sec:dom} - This section describes how our implementation of DOM works. Although DOM is a standard from W3C\footnote{\url{http://www.w3.org/} - Official site of the World Wide Web consortium} our implementation does not compatibility with this recomendation, in order to keep it simple and smaller enough for embedded systems. We use DOM as it is the stardard nomenclature when refering to abstract document structures. The goal of our DOM implementation is to keep in memory the information stored in the XML file. The idea is to keep the same semantics offered by the - XML. In order to do this, the DOM creates a tree where every node is either an XML element, attribute, normal text, or CDATA element. Each time an XML document is parsed, the DOM module returns a pointer to its corresponding tree root. - - \pagebreak - A document root is just a structure that holds two pointers. The first one points to what we call XML declaration and the second points to the root element of the XML document. For the sake of better understanding to which structure we're referring to, we'll refer to a document root as a DOM tree. As an example consider the following XML document : - - \lstset{language=XML,caption=Sample XML file, captionpos=b} - \begin{lstlisting} - - - - - \end{lstlisting} - - The DOM tree returned by the module for this XML contains in its XML declaration pointer the tree corresponding to: - \lstset{language=XML,caption=Sample XML declaration, captionpos=b} - \begin{lstlisting} - - \end{lstlisting} - - and in its second pointer will have the tree corresponding to: - \label{lst:xml_example} - \lstset{language=XML,caption=Sample XML file without XML declaration, captionpos=b} - \begin{lstlisting} - - - - \end{lstlisting} - - Because some documents may not contain the XML declaration part, the DOM tree will have that pointer pointing to NULL in such cases. - - \subsection{Building the Document Object Module} - As explained before, the parser module is responsible for constructing the tree returned by the DOM module. It does this by calling upon functions provided by the DOM module. Currently, the simplest way of building a DOM tree is to create a new document with the appropriate function and iteratively add all the elements, attributes, normal text and CDATA present in the XML (These functions are described in appendix \ref{chap:doc}). - - As a simple example, suppose we would like to generate the DOM structure for the XML in listing \ref{lst:xml_example}. The following code shows how to do this: - - \begin{center} - \lstset{language=C,numbers=left, captionpos=b, caption=Sample code to build a DOM tree.} - \begin{tabular}{c} - \begin{lstlisting} -... -doc* document = new_document(NULL); -set_doc_root(document, new_element_node("a")); - -dom_node* root = get_doc_root(document); -append_child(root, new_element_node("b")); -... - \end{lstlisting} - \end{tabular} - \end{center} - - Line 2 creates a DOM tree with no XML declaration. On line 3 we make the root of this tree point to element \textbf{a}. Lines 5 and 6 add element \textbf{b} to the DOM tree and complete the building process. - - \subsection{Handling and viewing DOM trees} - The DOM module also provides functions to retrieve and manipulate the various DOM trees in memory (see appendix \ref{chap:doc}). We strongly recommend the use of \emph{getters} and \emph{setters} to do this, because they deal with implementation details that shouldn't be dealt by the user. - - As the DOM tree gets modified it might help the user if he or she could actually see how it looks like, or save it to disk. This is where serialization comes into play. Currently we support three kinds of serialization - XML; - JSON (\textbf{J}ava\textbf{S}cript \textbf{O}bject \textbf{N}otation); YAML (\textbf{Y}AML \textbf{A}in't \textbf{M}arkup \textbf{L}anguage). Serialization is the reverse of parsing, as in it transforms the DOM tree to a string. - - \subsection{Cleaning a document} - Since our implementation is done in C, there is no garbage collection mechanism. This means that the DOM tree must be freed manually. We provide two functions to do this. One destroys the entire DOM tree the other destroys a generic DOM node (a DOM tree node). However, the second function must be used with care, nodes are not independent of their positions in the DOM, destroying one node will also destroy its children. Freeing up memory space is crucial in an embedded system, but can have a great impact in the system's performance. We leave it to the user to decide where to call these functions. - -\section{The Parser Module}\label{sec:parser} - The parser module implements both the XML parser and the query parser. The implementation of both parsers uses flex lexical analyzer\footnote{\url{http://flex.sourceforge.net/} - Flex home page.} and the bison parser generator\footnote{\url{http://dinosaur.compilertools.net/bison/index.html} - Bison site} they provide a simple, flexible and extendable way to build very powerful parsers. Moreover, the outcome is a fully optimized parser.. One of the biggest disadvantages of flex and bison is that they rely heavily in global variables to build and run the parser, this means, for simplicity sake, we only have one parser in our library. - - Another disadvantage is the fact that we need global variables to temporally store the parsers result. In order to avoid name clashes, each parser global variable has the prefix \textbf{lxq\_} and shouldn't be used directly. The usage of global variables makes the parser particularly thread unsafe, concurrent threads that need to do parsing should be carefully thoughtout. The call to the actual parsing functions \textbf{must} be mutualy exclusive. - - Flex and Bison are tools that generate parsing code according to a configuration file, this code has no external dependencies. - - \subsection{XML parsing} - The XML parser implements most of XML features. It is able to parse declarations, elements, attributes, normal text and CDATA regions, at the moment of this paper there was no support for DTD declarations. However, it relies on the fact that the XML had to be validated before parsing began. Since the input is expected to be validated beforehand, the parser can afford to be liberal on what it accepts. Multiple independent xml nodes maybe parsed, there are no limitations on the characters used inside text elements and attributes (other than the obvious '<' character and the '\\0' character respectively). - - Currently we provide two ways of parsing an XML - from a file and from a string - both use the same parsing rules. In fact, there is no difference in them besides the input type. - - In order to build the DOM tree the parser needs to interact with it. For this reason, if the DOM module interface changes the parser will have to be modified as well. (Substituting the DOM module is possible without altering the Parser module if the current interface is respected.) - - \subsection{Query parsing} - The query parser implements a parser built for queries compliant to most of the CSS3\footnote{\url{http://www.w3.org/TR/css3-selectors/\#selectors} - CSS3 selector list.} standard selectors. We didn't implement every selector because their are HTML (\textbf{H}yper\textbf{T}ext \textbf{M}arkup \textbf{L}anguage) specific ones that make little sense in xml. For instance, the selector \emph{E:link} selects an element based on the fact that it is a source anchor, which can only happen in HTML files. - - Since querying and XML parsing had to be merge onto a single parser, we had to come up with some kind of distinction between a query and an XML file. We've chosen the character \textbf{@} to indicate that it is a query we're parsing. This means that each query is preceded by the character \textbf{@}, if it isn't our library will prepend it. During development we found it to be important as a quick distinctive characterist of query strings in the code. It is, however, not part of the CSS recomendation and it is not mandatory. As an example consider the following code, which retrieves every element named \textbf{room}. - -\begin{center} - \lstset{language=C,numbers=left, captionpos=b, caption=Sample query to a DOM tree.} - \begin{tabular}{c} - \begin{lstlisting} -... -doc* document = parse_xml_from_string(" "); -list* query_result = query("@room", get_doc_root(document)); -... - \end{lstlisting} - \end{tabular} - \end{center} - - Line 2 parses an XML document from the given string and line 3 queries that document. The result will be an empty element with the tag \textbf{room}. Notice how the query was preceded by \textbf{@}. However, we could simply write \textbf{"room"} as a query. - - Like in XML parsing, the query parser must know the interface of the querying engine module in order to construct the query plan. A query plan is just a sequence of filters and operators that the query engine will apply to the XML nodes. Current implementation applies the filters and operators in the order they were given. - -\section{The Querying Engine Module}\label{sec:sels} - This module is responsible for evaluation of the query plan returned by the parser module and its execution. The result of querying an XML document is always a list containing zero or more XML elements. Note that the list will contain only elements, it will not return text nodes, CDATA nodes or attributes. We'll have to access them through the returned nodes. - - The returned list can then be iterated with the proper functions (see section \ref{sec:helpers}). - - One major concern when querying a document is typing the query correctly. Don't forget that the whitespace character is valid in CSS3 and it means \emph{descendants}. For instance, if we want all elements B \emph{descendants} of A we need to write "A B" as a query, or "@A B". Since the whitespace character has special meaning, "@A" is different from "@ A" (this would remove the \emph{root} from the returned list). - - Cleaning up after querying an XML document is very easy. The generated plan is automatically freed by the library, so the user won't have to bother with this part. The only thing that needs to be freed is the returned list of results. This list contains pointers to the actual nodes in the DOM tree in order to reduce used memory and enable XML manipulation. This means that the user will only need to destroy the list, leaving the content intact (see appendix \ref{chap:doc}). - - \subsection{Implemented features} - As said before, our querying engine module is CSS3 compliant. However, not every feature of CSS3 was implemented since some of them are HTML specific. - - In our implementation it's possible to query by element name, attribute name and attribute value. As an example consider these five queries: - - \begin{enumerate} - \item \textbf{"A"} - All elements with name \textbf{A}.\\ - \item \textbf{"A[b]"} - All elements with name \textbf{A}, that have an attribute with name \textbf{b}.\\ - \item \textbf{"A[b='c']"} - All elements with name \textbf{A}, that have an attribute with name \textbf{b} and value \textbf{c}.\\ - \item \textbf{"A:empty"} - All elements with name \textbf{A} and that have no children.\\ - \item \textbf{"A:nth-child(odd)"} - The elements with name A that are in an odd position relative to their siblings (i.e. 1, 3, 5 ...)\ - \end{enumerate} - - Filter results can be modified through operators: - - \begin{enumerate} - \item \textbf{"A, B"} - All elements with name \textbf{A} and all elements with name \textbf{B}.\\ - \item \textbf{"A B"} - All elements with name \textbf{B} that are descendents of an element with name \textbf{A}.\\ - \item \textbf{"A $>$ B"} - All elements with name \textbf{B} that are children of an element with name \textbf{A}.\\ - \item \textbf{"A $~$ B"} - All elements with name \textbf{B} that are siblings of an element with name \textbf{A}.\\ - \item \textbf{"A + B"} - All elements with name \textbf{B} that are directly preceded by an element with name \textbf{A}.\\ - \end{enumerate} - - - These queries are pretty simple, but we've added some new features. It is possible to use regular expressions everywhere by putting the regular expression between slashes (\textbf{"/"}). - As an example consider these three queries: - - \begin{enumerate} - \item \textbf{"/A/"} - Query an XML document for all elements with a name containing \textbf{A}.\\ - \item \textbf{"/A/[/b./]"} - Query an XML document for all elements with a name containing \textbf{A} and have an attribute with name containing \textbf{b} followed by another character.\\ - \item \textbf{"/A/[b = /foo$|$bar/]"} - Query an XML document for all elements that begin by \textbf{A}, have an attribute with name \textbf{b} and its value contains either \textbf{foo} or \textbf{bar}.\\ - \end{enumerate} - - The implemented selectors also support the CSS3 \emph{filters} relative to document navigation. The only \emph{filters} that we didn't implement are relative to HTML specific markup language. - These \emph{filters} do not make sense for XML handling. Nevertheless, we added the possibility for the user to create its own \emph{filters}. - - Custom \emph{filters} are very easy to implement. The user defines a function which represents a filter, which means it will receive all XML nodes and should return true for nodes that match the filter. - Then, registers that function as a custom \emph{pseudo-filter} and that's it. Custom \emph{filters} can receive 0 or more arguments. Check appendix \ref{chap:doc} for more information on these filters. - - We've also provide a way to create custom operators. Custom operators are extensions to the CSS3 operators. In order to use custom operators the user should define them and register them. The user should use - then when CSS3 operators aren't enough his needs. A custom operator receives a list of nodes that it should operator on. - - We already provide two extended operators. The \emph{first} operator, which receives a list of nodes and returns the first node of that list and the \emph{text-children} operator, which returns all the text nodes that are - children of each node in the received list. - -\section{Data structures and macros}\label{sec:helpers} - - \subsection{Data structures} - In order to keep the implementation efficient both in time usage and memory usage, we've developed a couple of optimized structures. - - We've built a circular generic list backed up by an array. There are two great features about this list. First it is backed up by an array, which means that pointers to the elements in the list will be in contiguous memory thus speeding up the access. The second great feature is the circular part. Elements in a list can be added and removed as desired, maintaining $\Theta(1)$ for random access, appending, prepending, enqueing, dequeing, pushing and poping. In order to keep a good performance, the list will only grow if necessary. In other words, if the number of elements to keep in the list is, much smaller or, bigger than its capacity, the list will be resized accordingly. - - We've chosen to keep this data structure separated from the rest of the modules because it can hold any type of object, which means it can be used by any code. In particular, it can be used by the user to store its own program data. - - Since any kind of object can be stored in the list there is no way of type checking each element, so the user must know which elements are present in the list or use another feature of our implementation which is typed elements. Typed elements are just elements with an integer that indicates their type. For instance, if a list would contain three different types of elements we would encourage the use of typed elements in order to know which kind of data the user is dealing with, at access time an extra variable is set to the type of the element. - - However, they aren't generic only because they can store any kind of object, but because they implement different policies as well. The user may choose to use the list as a random access list, as a stack, or as a queue. This provides much greater flexibility. - - Whichever policy and type of elements the user chooses to use and store, he or she can always iterate over the results by using the appropriate functions (see appendix \ref{chap:doc}). After using an iterator it must be destroyed in order to prevent memory leaks. This is also true for our generic lists. However, in this case we can only free the containers of the list, because we can't possibly know which type of object is stored in each one. The user must iterate over the list and free each element one by one. Currently the DOM module and querying engine module use these lists. - - Another generic structure we've built is a red black tree. Red black trees are a very good structure when storing unique values that need to be searched. The height of a red black tree is always $\log_2(n)$, where $n$ is the number of nodes in the tree, thus the search is always done in $\Theta(\log_2(n))$. Currently we use this tree when storing attributes for an XML node. - - One concern when developing code that uses this structure is to be careful and don't use the word \emph{RBNIL} for a variable. The red black tree code defines a global variable called RBNIL and uses it with the goal of being efficient. - - If the need to iterate over a tree emerges, we've built iterators for this job. There is no guarantee about the order of the returned elements, because the iterator is designed to return every element in the tree with only one pass. When iteration is over, the user will have to destroy the iterator (see appendix \ref{chap:doc}. Also, like in the list implementation we provide functions to destroy the tree, but the user must free each element stored in each node. - - \subsection{Macros} - This section only describe two macros. The first one is a logging mechanism. We've developed a macro that logs messages with different kind of error levels and supports output formatting. This macro can be found almost in any source file we've written. However, it is compilation dependent and when compiled without certain flags it won't get into the binary file (see appendix \ref{chap:gcc}). This helps us debug the code when developing and keeps the binary smaller when a final version is created. - - The second macro is an allocation macro. The simplest way to describe this macro is to say that its a one line code \emph{malloc} with type cast that exits on allocation failure. In other words, it allocates space and returns a pointer to it, casted to a specific type. If allocation fails, a log message is printed and the program will exit (see appendix \ref{chap:doc}). - -%END Arch% - -%Eval% -\chapter{Evaluation}\label{chap:eval} - -\section{Test description}\label{sec:testdesc} - This section presents some tests made to our library. We present only two kinds of tests, that were made in different kinds of systems.\\ - - The first kind of test is done with a 131986 line XML with 12MB. We're parsing the XML and querying it for a total of 127266 elements. The test was performed on MS-Windows 7, Linux 2.6 and Mac OSx 10.4. Each - operating system was running on a 2.6GHz 32-bit intel core duo with 1GB of RAM memory. We've also performed this test on an 250MHz Cavium ARM9 CPU, with 64MB of RAM memory. For each configuration, we've ran - the test two times - One without querying engine optimization and other with querying engine optimization. \\ - - The second test was done with the same configurations, the only difference is that the XML has a total of 36 lines, 0.77KB and we're querying it for 6 elements.\\ - - Sections \ref{sec:mprof} and \ref{sec:tprof} show the results for these tests. It's important to know that every test was done with a cold cache. - -\section{Profiling memory usage}\label{sec:mprof} - This section shows the results for the memory usage on the different systems. The following table shows the result for the first kind of test. Each value is presented in Megabytes and represents the peak usage, that is the maximum amount of memory used. - - \begin{center} - \begin{tabular}{ | l | r | r | r | r | r | } - \hline - & Non-optimized (MB) & Optimized (MB)\\ \hline - MS-Windows 7 & 41 & 41 \\ \hline - Linux 2.6 (Intel core duo) & 34 & 34 \\ \hline - Linux 2.6 (ARM cpu) & 37 & 37 \\ \hline - Mac OSx 10.4 & 35 & 35 \\ - \hline - \end{tabular} - \end{center} - - From this first test we can already conclude that optimizing the query engine didn't do nothing to optimize space. In fact, further analyzes to our profiling output reveals that the peak memory usage is related to the XML parser. At this point we can't do anything because the parser has already been optimized and the parsed data doesn't have such an overhead. However, with the flag \emph{USE\_DICT} (see appendix \ref{chap:gcc}) the amount of memory usage drops about 6M. - - The next table shows the results for the second kind of test. - - \begin{center} - \begin{tabular}{ | l | r | r | r | r | r | } - \hline - & Non-optimized (MB) & Optimized (MB)\\ \hline - MS-Windows 7 & 0.026 & 0.026 \\ \hline - Linux 2.6 (Intel core duo) & 0.019 & 0.019 \\ \hline - Linux 2.6 (ARM cpu) & 0.022 & 0.022 \\ \hline - Mac OSx 10.4 & 0.020 & 0.020 \\ - \hline - \end{tabular} - \end{center} - - This test confirms that the memory usage peak isn't related with the querying engine. Yet again, a detailed analysis of our profiling output revealed that the peak usage was when data was being parsed. The results from both tests show that the memory usage depends heavily on the size of the XML and not so much on the number of elements to be queried. We believe that most of XML documents used in Home Automation systems are small, thus not occupying great amounts of memory. That said, the results shows that our solution is adequate for such systems. - -\section{Time usage}\label{sec:tprof} - This section shows the time results for each kind of test. The value units are given in seconds. The first table shows the results for the first kind of test. - - \begin{center} - \begin{tabular}{ | l | r | r | r | r | r | } - \hline - & Non-optimized (s) & Optimized (s)\\ \hline - MS-Windows 7 & 23.12 & 0.74 \\ \hline - Linux 2.6 (Intel core duo) & 18.82 & 0.67 \\ \hline - Linux 2.6 (ARM cpu) & 32.36 & 1.3 \\ \hline - Mac OSx 10.4 & 21.78 & 0.71 \\ - \hline - \end{tabular} - \end{center} - - This first test shows the impact of query plan evaluation in our design. When optimized the speedup gained is around: - - $$speedup = \frac{non-optimized}{optimized} = \frac{18.82}{0.67} = 28.09$$ - - In fact, a detailed analysis of our profiling output showed that the non-optimized version wasted to much time on evaluating each query plan. For this reason we've optimized it and show impressive results. The following table shows the results for the second kind of test. - - \begin{center} - \begin{tabular}{ | l | r | r | r | r | r | } - \hline - & Non-optimized (s) & Optimized (s)\\ \hline - MS-Windows 7 & 0.003 & $<$ 0.001 \\ \hline - Linux 2.6 (Intel core duo) & 0.002 & $<$ 0.001 \\ \hline - Linux 2.6 (ARM cpu) & 0.007 & $<$ 0.001 \\ \hline - Mac OSx 10.4 & 0.002 & $<$ 0.001 \\ - \hline - \end{tabular} - \end{center} - - This test confirms that the query engine optimization was successful. In fact, the optimized version is so fast that there isn't enough granularity to give the precise time it took the program to run. - - Another conclusion we take is that memory usage has little impact in time usage. In fact, our profiling output shows that the memory usage peak lasts only during parsing and them drops abruptly. -%END Eval% - -%Conclusion% -\chapter{Conclusion} \label{chap:concl} - We've presented a solution for an XML library designed for embedded systems. The main goal was to build it as light as possible, while giving the user a flexible and expandable way of parsing, querying and manipulating XML documents. - - We've built a library in three modules - A parser module; A DOM module; A querying engine module. Each has its own functionalities and can be modified almost effortlessly. - - We've shown that the performance depends heavily on the size of the XML being parsed. Our goal has been reach, as our library provides a flexible way to speedup development of applications that use XML documents - to store configuration properties. - -%END Conclusion% - -\appendix -\chapter{Compiling and using the code}\label{chap:gcc} - This section shows how to compile our library and compile other programs with our library. - - Compiling libxmlquery is very easy. The source code ships with a Makefile, so you just need to type in \emph{make}. On Unix based systems the \emph{make} command comes within the system, on MS-Windows we encourage the use of Mingw. - - When \emph{make} finishes you'll notice a file with the extension \textbf{.so} (Shared Object). You just need to pass this object to the compiler when linking and you're done. You have compiled your program against - libxmlquery. - - As an example consider the command using \emph{gcc}: - - \begin{center} - \lstset{language=bash,caption=Compiling a program against our library, captionpos=b} - \begin{tabular}{c} - \begin{lstlisting} - gcc -o outputname libxmlquery.so myapplication.c - \end{lstlisting} - \end{tabular} - \end{center} - - \section{Compilation flags} - If the flag \emph{DEBUG} is passed to the compiler when compiling our library, then more debug output will be generated. As an example: - - \begin{center} - \lstset{language=bash,caption=Compiling libxmlquery with debug output, captionpos=b} - \begin{tabular}{c} - \begin{lstlisting} - gcc -DDEBUG -c - \end{lstlisting} - \end{tabular} - \end{center} - - The flag \emph{USE\_DICT} optimizes memory usage in most of the cases. If used, a dictionary will be created and all node names, values, attributes will be stored in a global dictionary. Generaly, very big xml files have a great amount of repetition, by using a dictionary this repetition can be used to limit the amount of memory used to store the xml it self. However, if the XML is massively edited the dictionary will grow considerably and might become larger than the overhaed of the repetition. Another drawback is parsing speed, each string value in the xml will require $\Theta(\log_2(n))$ where $n$ is the size of the dictionary. Yet another problem is found when editing the xml nodes, inplace editing of string values would result in all nodes that share that string being edited. This flag provides a gain of around 20\% memory usage reduction in large files. As an example: - - \begin{center} - \lstset{language=bash,caption=Compiling libxmlquery with dictionary optimization, captionpos=b} - \begin{tabular}{c} - \begin{lstlisting} - gcc -DUSE_DICT -c - \end{lstlisting} - \end{tabular} - \end{center} - - -\chapter{Sample applications}\label{chap:app} %lol% - \section{Shell} - The application shell is just a simple shell that enables loading XML documents and querying them. Its purpose is just to demonstrate the use of queries. Consider this typical use: - -\begin{center} -\lstset{language=bash,caption=Typical usage of the shell application. The banner was intentionally removed., captionpos=b} -\begin{tabular}{c} -\begin{lstlisting} ->>> load ../test.xml doc -XML ../test.xml loaded and stored in doc ->>> query doc "@room device" -Node: - - -Node: - - -Node: - - - - 205 - - - 97 - - - 256 - - - - ->>> quit -exiting... -\end{lstlisting} -\end{tabular} -\end{center} - - In this example, the file \textbf{test.xml} gets loaded into the symbol \textbf{doc}. Then a query is performed on this symbol. It is possible to execute more commands. Type \emph{help} to get a description of them. - - The shell application comes with a Makefile, so it's easy to compile it. To compile in other systems see appendix \ref{chap:gcc}. - -\chapter{Documentation}\label{chap:doc} - This section provides all the documentation for the libxmlquery. The most recent version of the documentation is at \url{http://nullable.github.com/libxmlquery/}. - -\end{document} - diff --git a/relatorio/disk.png b/relatorio/disk.png deleted file mode 100644 index e791cc5..0000000 Binary files a/relatorio/disk.png and /dev/null differ diff --git a/search.html b/search.html new file mode 100644 index 0000000..fc05fe3 --- /dev/null +++ b/search.html @@ -0,0 +1,95 @@ + + + + + + + + Search — libxmlquery v0.1.4 documentation + + + + + + + + + + + + + +
        +

        Navigation

        + +
        + +
        +
        +
        +
        + +

        Search

        +
        + +

        + Please activate JavaScript to enable the search + functionality. +

        +
        +

        + From here you can search these documents. Enter your search + words into the box below and click "search". Note that the search + function will automatically search for all of the words. Pages + containing fewer words won't appear in the result list. +

        +
        + + + +
        + +
        + +
        + +
        +
        +
        +
        +
        +
        +
        +
        +
        +
        +

        Navigation

        + +
        +
        + © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
        + + \ No newline at end of file diff --git a/searchindex.js b/searchindex.js new file mode 100644 index 0000000..7ab9768 --- /dev/null +++ b/searchindex.js @@ -0,0 +1 @@ +Search.setIndex({objects:{"":{dequeue:[5,0,1],new_element_node:[3,0,1],new_queue:[5,0,1],remove_element_at:[5,0,1],get_children:[3,0,1],siterator:[5,1,1],new_stack:[5,0,1],parse_xml:[6,0,1],enqueue:[5,0,1],set_value:[3,0,1],list:[5,1,1],get_name:[3,0,1],sdoc:[3,1,1],search_rbtree:[5,0,1],rb_tree_insert:[5,0,1],get_element_pos:[5,0,1],tree_iterator_next:[5,0,1],parse_string:[6,0,1],get_element_at:[5,0,1],new_text_node:[3,0,1],duplicate_generic_list:[5,0,1],"__alloc":[2,0,1],register_custom_filter:[1,0,1],remove_node:[3,0,1],pop_stack:[5,0,1],insert_element_at:[5,0,1],generic_list_get_count:[5,0,1],append_element_with_type:[5,0,1],delete_attribute:[3,0,1],new_generic_list_iterator:[5,0,1],prepend_child:[3,0,1],snode:[3,1,1],new_cdata:[3,0,1],remove_element:[5,0,1],peek_element_type_at:[5,0,1],set_element_at:[5,0,1],xmlquery_query:[1,0,1],generic_list_s:[5,1,1],get_descendants:[3,0,1],push_stack:[5,0,1],set_namespace:[3,0,1],get_namespace:[3,0,1],remove_all:[5,0,1],destroy_generic_list:[5,0,1],set_element_with_type_at:[5,0,1],tree_iterator_has_next:[5,0,1],get_element_with_type_at:[5,0,1],node_to_string:[3,0,1],new_generic_list:[5,0,1],parse_file:[6,0,1],set_parent:[3,0,1],new_document:[3,0,1],get_child_at:[3,0,1],remove_duplicates:[5,0,1],get_attribute_by_name:[3,0,1],new_rbtree:[5,0,1],add_element_with_type:[5,0,1],add_element:[5,0,1],get_doc_root:[3,0,1],new_attribute:[3,0,1],merge_lists:[5,0,1],doc:[3,1,1],stree_node:[5,1,1],rb_tree_delete:[5,0,1],tree_root:[5,1,1],parse_xml_from_string:[6,0,1],add_attribute:[3,0,1],set_xml_declarations:[3,0,1],peek_stack_type:[5,0,1],node_type:[3,1,1],get_xml_declarations:[3,0,1],insert_element_with_type_at:[5,0,1],enqueue_with_type:[5,0,1],register_simple_custom_filter:[1,0,1],destroy_rbtree:[5,0,1],push_stack_type:[5,0,1],destroy_generic_list_iterator:[5,0,1],new_simple_rbtree:[5,0,1],get_elements_by_name:[3,0,1],get_value:[3,0,1],tree_node:[5,1,1],destroy_iterator:[5,0,1],generic_list_iterator_has_next:[5,0,1],destroy_dom_node:[3,0,1],get_text_nodes:[3,0,1],dom_node:[3,1,1],prepend_element_with_type:[5,0,1],tree_iterator:[5,1,1],generic_list_is_empty:[5,0,1],sroot:[5,1,1],new_tree_iterator:[5,0,1],set_name:[3,0,1],append_child:[3,0,1],list_bucket:[5,1,1],peek_queue_type:[5,0,1],append_children:[3,0,1],set_doc_root:[3,0,1],sorted_insert_element_with_type:[5,0,1],generic_list_iterator_next:[5,0,1],destroy_dom_tree:[3,0,1]}},terms:{all:[2,1,3,5,6,7],code:[5,2,7,6],chain:1,queri:[6,0,7,1,4],global:[6,3],follow:[5,2,1,6,3],children:[1,3],whose:3,"const":[5,6,1],uint8_t:5,mmmmmmm:4,program:[5,4,7,1,6],becam:1,sens:5,fatal:2,above_source_fil:[5,2,6,3],sourc:5,everi:[5,7,1],string:[6,2,1,3],fals:[5,7],"void":[2,1,3,5,6,7],rise:1,eeee:4,variable_nam:4,veri:4,retriev:7,relev:5,level:2,new_rbtre:5,list:[5,0,7,1,3],iter:5,"try":7,item:[7,4],stderr:2,small:5,freed:5,impli:5,smaller:[5,2],search_rbtre:5,colect:0,register_custom_filt:1,htm:7,eas:2,yacc:6,second:[5,1,3],design:1,pass:[5,2,7,3],append:[5,3],even:[5,2],index:[0,3],what:[2,4],compar:5,defin:[5,2,1,6,3],neg:5,section:[5,2,6,3],node_to_str:[6,7,3],abl:[2,7],access:[5,6,1,3],delet:[5,1,3],version:[2,7,3],get_element_po:5,"new":[5,0,7,1,3],insert_element_at:5,ever:2,method:[5,1],generic_list_iter:[5,7],remove_dupl:5,full:5,parse_xml_from_str:6,append_el:5,gener:[5,0,4],here:[5,4],behaviour:5,let:[5,2,7,3],free:[5,6,7,3],address:[5,2],path:[5,2,7,6,3],modifi:3,sinc:3,valu:[5,1,3],search:[5,7,3],aug:7,ahead:7,add_el:5,technolog:1,prepend_child:3,queue:5,behav:5,chang:[7,3],ddebug:[6,2],append_element_with_typ:5,binary_fil:4,sorted_insert_element_with_typ:5,appli:[5,1],transit:5,filenam:6,prepend_el:5,printf:[5,2,7,6,3],set_element_with_type_at:5,total:5,select:1,kei:[5,2],node_typ:3,from:[1,3,4,5,6,7],describ:[5,2],would:[4,1],memori:[5,6,3],regist:1,two:[5,6,1,3],next:[5,6],qqqq:4,call:[5,4,1,2,3],recommend:[6,3],text_nod:[7,3],black:[5,0],type:[5,2,4,3],more:[5,1],sort:5,flat:1,desir:3,get_nam:3,relat:2,notic:[5,2,7,3],warn:2,flag:2,parse_fil:6,worri:5,set_valu:[7,3],hold:5,iii:4,must:[5,7,1,3],dictat:5,word:3,get_doc_root:[6,7,3],destroy_custom_filt:1,attr_nam:3,alia:[5,2],peek_stack_typ:5,can:[2,1,3,4,5,6],learn:7,fprintf:2,purpos:[5,4],root:[5,6,1,3],tree_root:5,control:3,prompt:4,xml_declar:3,capciti:5,tag:[1,3],caution:3,want:[5,7,1,3],serial:[6,0,7,3],type1:5,occur:6,type2:5,read_fil:7,alwai:[5,2],gcc:[5,2,7,6,3],end:[5,6,3],divid:6,anoth:[5,6,1,3],compare_function_point:5,capabil:7,write:1,how:[2,3,4,5,6,7],simpl:[5,4,7,1,3],parse_xml:[6,7,3],css:1,map:6,generic_list_is_empti:5,earlier:1,get_xml_declar:3,befor:[5,7],embrac:1,mai:[0,1,2,3,5,6],multipl:5,associ:3,grow:5,demonstr:4,util:1,alloc:[5,0,2],list_bucket:5,stdio:[5,2,7,6,3],correspond:3,element:[5,7,1,3],caus:2,recompil:[6,2],generic_list_iterator_next:[5,7],order:[5,1,3],includ:[5,2,7,6,3],feed:7,help:[0,1,4,2],ouput:5,rearang:1,over:[5,2,1],becaus:[5,2,6,3],through:[6,7,1,3],"__va_args__":2,still:5,pointer:[5,1,3],entiti:3,typedef:[5,3],xml_file:[6,3],get_valu:3,better:1,yaml:3,html:1,complex_filt:1,main:[5,2,7,6,3],flex:6,them:[4,1,2],"return":[2,1,3,5,6,7],thei:[5,1],handl:3,encod:7,safe:6,initi:5,front:6,retreiv:5,now:7,bigger:5,introduct:1,generic_list_:[5,3],document:[0,1,3,4,6,7],grammar:6,name:[2,1,3,5,6,7],anyth:5,separ:1,each:[5,3],debug:2,found:[5,3],mean:[5,2,1],compil:[0,2,3,4,5,6,7],domain:7,destroy_custom_oper:1,replac:5,new_docu:3,stringli:6,realli:[7,3],notabili:1,"static":2,year:1,our:[5,2,7,4,6],happen:[5,2,3],special:[0,1,2],out:[5,7],variabl:[6,4,3],shown:[2,7],space:[5,3],get_descend:3,yyi:4,your:[6,2,1],content:[7,1],print:[2,4,3],pop_stack:5,occurr:[5,1],red:[5,0],rb_tree_insert:5,xmlquery_queri:1,after:[4,1,3],destroy_generic_list_iter:[5,7],advanc:5,manipul:[7,1],given:[5,4,1,3],argv:[7,3],mmm:4,nth:3,reason:6,base:5,"byte":5,argc:[7,3],acord:5,unpredict:5,care:5,symetr:5,thread:6,lexer:6,keep:[5,3],filter:[7,1],thing:[5,2,7,3],isn:3,duplicate_generic_list:5,onto:[5,6,3],first:[5,2,1,3],oper:[7,1],directli:[1,3],arrai:[5,2],independ:1,number:[5,2,1],yourself:3,datastructur:5,alreadi:[5,1,3],done:[5,2,1,6,3],stdlib:5,destroy_generic_list:5,tree_iterator_has_next:5,new_simple_rbtre:5,differ:[5,1,3],sheet:1,data:[5,0,3],interact:[0,4],capac:5,messag:[6,2,4],stack:[5,7],checker:3,source_fil:7,query_runn:7,conveni:4,"final":[5,3],store:[5,6,4,3],too:3,shell:[0,4],option:2,namespac:3,pubdat:7,copi:6,selector:[0,1],part:3,pars:[6,0,7,3],cdata:3,enqueu:5,exactli:[5,7,3],than:[5,2],rss:[7,4],wide:1,kind:[5,1,3],third:5,new_element_nod:3,provid:[5,1,3],new_queu:5,remov:[5,2,7,3],tree:[5,0,7,1,3],structur:[5,0,6,3],charact:2,project:2,compare_integ:5,were:[5,2],posit:[5,1],int16_t:5,other:[5,2,1,3],markup:3,browser:1,"function":[0,1,2,3,5,6],sai:5,get_namespac:3,modern:1,query_express:4,argument:[5,4,7,1,3],realm:1,have:[2,1,3,5,6,7],need:[2,1,4,5,6,7],seen:1,seem:5,"null":[5,6,7,3],engin:4,lib:6,uuuuuu:4,destroi:[5,3],note:[5,2,1],also:[5,0,1,3],without:[5,2,7,4,6],tree_iter:5,take:[5,1],which:[2,1,3,4,5,6,7],conclud:7,generic_list_iterator_has_next:[5,7],command:[5,4],noth:[5,3],singl:[5,6,3],serializarion:3,begin:[5,4,7,1],pain:2,"enum":3,though:5,buffer:2,object:[5,0,3],most:[4,1],regular:7,why:5,print_xml:4,append_child:3,don:5,file_to_load:4,dom:[0,7,1,3],doc:[6,7,4,3],doe:[5,1,3],declar:[6,3],clean:[7,3],left:5,"__alloc":2,fact:1,someattribut:6,pope:5,show:[2,3,4,5,6,7],text:[1,3],random:[5,1],rbtree:5,tree_nod:5,detroi:5,find:0,remove_element_at:5,enqueue_with_typ:5,xml:[0,1,3,4,6,7],current:[5,6,1,3],onli:[5,1,3],locat:[5,2,6],pretti:7,new_tree_iter:5,explain:[6,7,3],someel:6,suppos:3,folder:[5,2,6,3],destroy_iter:5,new_stack:5,set_par:3,count:5,get:[5,2,7],"__file__":2,express:7,bear:3,lxq_document:[6,3],register_extended_oper:1,report:6,banner:4,xmlstring:6,bar:1,sdoc:3,deduc:4,contain:[5,2,3],dequeu:5,where:[5,2,1,6,3],bother:2,desced:3,summari:5,set:[5,3],see:[5,7,4],stree_nod:5,result:[6,2,7],arg:1,fail:[5,2],get_elements_by_nam:3,awar:[6,1,3],flexibl:3,libxmlqueri:[6,0,7],parent:[5,1,3],pattern:1,siter:5,won:2,simplest:4,generic_list_get_count:5,attribut:[1,3],altern:1,signatur:1,accord:[5,2,1],str:[6,2],extend:[1,3],javascript:[1,3],style:1,entir:3,remove_el:5,exclam:1,tue:7,new_text_nod:3,both:5,set_element_at:5,howev:[5,2,7,1],prite:6,equal:5,against:1,tutori:[0,7],context:1,mani:6,com:7,get_attribute_by_nam:3,load:4,push_stack:5,point:[5,2,1,3],color:5,int32_t:5,push_stack_typ:5,pop:5,header:[6,7],peek_element_type_at:5,remove_nod:3,typic:4,alloch:5,duplic:5,quit:4,creat:[0,1,2,3,4,5,7],coupl:6,union:3,rrrr:4,three:[5,1,3],empti:5,whom:3,json:3,much:5,new_generic_list:5,reflex:5,recomend:1,new_cdata:3,mind:[5,3],xxx:4,ani:[2,1,3,4,5,6,7],llll:4,doesn:[5,2,1,3],child:[1,3],quick:1,careful:3,present:[5,4,1],input:[5,6,3],"char":[6,2,7,1,3],ident:5,look:[5,2,3],properti:5,cast:2,"while":[5,2,7,1],ain:3,abov:[5,7],error:[6,2],invoc:5,malloc:[5,2],applic:4,new_attribut:3,valgrind:5,eras:2,insert_element_with_type_at:5,get_text_nod:3,sever:[2,1],develop:[4,1],parse_queri:6,perform:5,make:[4,1],same:[5,7,3],binari:[2,4],complex:1,descend:3,key_address:5,finish:1,http:7,optim:5,register_simple_custom_oper:1,upon:1,snode:3,capabl:[5,7,1,3],jqueri:1,user:[5,1],destroy_dom_nod:3,keyb:5,keya:5,implement:[5,4,1,6],peek_queue_typ:5,travers:3,kept:[5,2,6,3],bewar:5,older:5,nevertheless:5,macro:[0,2],thu:2,well:[2,1],know:[5,3],exampl:[2,1,3,4,5,6,7],delete_attribut:3,thi:[2,1,3,4,5,6,7],endif:2,ispermalink:7,model:[0,3],propos:1,just:[5,4,7,1,2],obtain:5,rest:[7,3],gdb:4,ifdef:2,languag:[1,3],web:1,struct:[5,3],easi:4,extra:6,get_children:3,add:[5,2,7,3],cleanup:7,realloc:5,els:2,modul:[6,0,3],match:1,css3:1,css2:1,lxq_selected_el:6,format:[2,4,3],read:0,beggin:3,parse_dom:[6,3],mon:7,tire:2,lastbuildd:7,like:1,insert:[5,3],xqueri:1,resid:2,helpful:7,specif:[0,1],should:[5,6,1,3],serialization_typ:3,manual:1,integ:5,add_attribut:3,necessari:5,channel:7,transvers:1,popular:1,output:[2,7,3],resiz:5,page:2,depend:[2,3],www:7,right:[5,2],old:[5,7],lxq_parser:[6,7,3],some:[6,2,1,3],back:5,enumer:3,guaranti:5,proper:2,sizeof:[5,2],intact:[5,3],get_element_at:5,librari:1,remove_al:5,guid:7,bottom:2,leak:[5,3],definit:[5,2,3],exit:[5,2,4,6],foo:1,refer:1,peek:5,set_nam:3,run:[5,0,7,4,2],set_xml_declar:3,cascad:1,usag:[5,7,4],global_docu:7,how_mani:2,although:5,eventu:5,"throw":3,simpler:1,about:5,actual:[5,2,3],append_children:3,generic_list:1,destroy_rbtre:5,stand:1,act:5,ajax:1,produc:5,block:5,simple_filt:1,own:1,primarili:1,devic:1,eeeee:4,bbb:4,set_namespac:3,been:[2,1,3],tree_iterator_next:5,parse_str:6,mere:2,merg:[5,6],w3c:1,get_element_with_type_at:5,wai:[1,3],aren:[5,7],support:[4,3],get_desced:3,fast:5,custom:[7,1],start:[5,0],interfac:4,inner:1,xpath:1,get_child_at:[7,3],head:[5,3],rb_tree_delet:5,form:1,forc:6,dom_nod:[7,1,3],link:7,heap:5,add_element_with_typ:5,line:2,inlin:2,"true":5,denomin:3,info:2,notat:3,made:2,utf:7,attr:1,consist:5,possibl:[5,6,1],wish:5,bucket:5,below:[7,1,3],otherwis:[5,3],problem:2,prepend_element_with_typ:5,reachabl:5,featur:[5,4,7,1],pin:2,"int":[2,1,3,5,6,7],descript:[5,0,7,6,3],parser:[6,0,3],"__line__":2,repres:[5,3],strongli:6,exist:[5,4],file:[2,3,4,5,6,7],int64_t:5,check:[5,2,7],fill:[5,2],again:2,titl:[7,4],when:[5,2,1,3],prepend:[5,3],field:[5,3],valid:[2,3],rememb:5,test:[2,3,4,5,6,7],tie:1,you:[0,1,2,3,4,5,6,7],node:[5,4,7,1,3],new_generic_list_iter:[5,7],register_simple_custom_filt:1,destroy_dom_tre:[6,7,3],log:[5,0,2],consid:[5,2,3],merge_list:5,sroot:[5,3],stai:5,receiv:[5,2],cdata_text:3,set_doc_root:3,pseudo:1,rule:1,obj:5,time:6,push:5,key_function_point:5},objtypes:{"0":"c:function","1":"c:type"},titles:["libxmlquery documentation","Querying","Special Macros","Document Object Model","Shell","Data Structures","Parser Module","Tutorial"],objnames:{"0":"C function","1":"C type"},filenames:["index","querying","macros.h","dom","applications/shell","data_structures/datastructures","parser/parser","tutorial/tutorial"]}) \ No newline at end of file diff --git a/selectors/Makefile b/selectors/Makefile deleted file mode 100644 index 5befee4..0000000 --- a/selectors/Makefile +++ /dev/null @@ -1,13 +0,0 @@ -include ../Makefile.inc - -OBJS = query_parser.o query_runner.o eregex.o custom_selectors.o -includes = ../include/query_parser.h ../include/query_runner.h ../include/eregex.h - -all: $(OBJS) - -%.o: %.c $(includes) - $(CC) $(CFLAGS) -c $< - -clean: - rm -rf *~ *.out $(OBJS) - diff --git a/selectors/custom_selectors.c b/selectors/custom_selectors.c deleted file mode 100644 index edadb06..0000000 --- a/selectors/custom_selectors.c +++ /dev/null @@ -1,197 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include "../include/macros.h" -#include "../include/rbtree.h" -#include "../include/custom_selectors.h" - -/* rbtree functions */ - -const void* get_custom_filter_key(const struct stree_node* node){ - return ((custom_filter*)node->node)->name; -} - -const void* get_custom_operator_key(const struct stree_node* node){ - return ((custom_operator*)node->node)->name; -} - -/* static holders */ - -tree_root* get_custom_filters(){ - static tree_root* custom_filters = NULL; - - if(custom_filters == NULL) - custom_filters = new_rbtree(&get_custom_filter_key, &compare_string); - - return custom_filters; -} - -tree_root* get_custom_operators(){ - static tree_root* custom_operators = NULL; - - if(custom_operators == NULL) - custom_operators = new_rbtree(&get_custom_operator_key, &compare_string); - - return custom_operators; -} - -/* initializers */ - -custom_filter* new_custom_filter(const char* name){ - custom_filter* r = alloc(custom_filter, 1); - r->name = strdup(name); - r->function.simple = NULL; - r->function.complex = NULL; - return r; -} - -custom_operator* new_custom_operator(const char* name){ - custom_operator* r = alloc(custom_operator, 1); - r->name = strdup(name); - r->function.simple = NULL; - r->function.complex = NULL; - return r; -} - -/* registers */ - -void register_simple_custom_filter(const char* name, int (*filter)(dom_node* node)) { - tree_root* lxq_custom_filters = get_custom_filters(); - - custom_filter* r = new_custom_filter(name); - r->function.simple = filter; - rb_tree_insert(lxq_custom_filters, r); -} - -void register_custom_filter(const char* name, int (*filter)(dom_node* node, list* args)){ - tree_root* lxq_custom_filters = get_custom_filters(); - - custom_filter* r = new_custom_filter(name); - r->function.complex = filter; - rb_tree_insert(lxq_custom_filters, r); -} - -void register_simple_custom_operator(const char* name, list* (*operator)(list* nodes)) { - tree_root* lxq_custom_operators = get_custom_operators(); - - custom_operator* r = new_custom_operator(name); - r->function.simple = operator; - rb_tree_insert(lxq_custom_operators, r); -} - -void register_custom_operator(const char* name, list* (*operator)(list* nodes, list* args)){ - tree_root* lxq_custom_operators = get_custom_operators(); - - custom_operator* r = new_custom_operator(name); - r->function.complex = operator; - rb_tree_insert(lxq_custom_operators, r); -} - -/* getters */ - -int (*get_simple_custom_filter_by_name(const char* name))(dom_node*){ - custom_filter* cf = (custom_filter*)search_rbtree(get_custom_filters(), name); - return (cf != NULL)? cf->function.simple : NULL; -} - -int (*get_custom_filter_by_name(const char* name))(dom_node*, list* args){ - custom_filter* cf = (custom_filter*)search_rbtree(get_custom_filters(), name); - return (cf != NULL)? cf->function.complex : NULL; -} - -list* (*get_simple_custom_operator_by_name(const char* name))(list* nodes){ - custom_operator* cf = (custom_operator*)search_rbtree(get_custom_operators(), name); - return (cf != NULL)? cf->function.simple : NULL; -} - -list* (*get_custom_operator_by_name(const char* name))(list* nodes, list* args){ - custom_operator* cf = (custom_operator*)search_rbtree(get_custom_operators(), name); - return (cf != NULL)? cf->function.complex : NULL; -} - -/* destroys*/ - -void destroy_custom_filters(){ - tree_root* lxq_custom_filters = get_custom_filters(); - - tree_iterator* ti = new_tree_iterator(lxq_custom_filters); - - while(tree_iterator_has_next(ti)){ - custom_filter* cf = (custom_filter*)tree_iterator_next(ti); - free(cf->name); - free(cf); - } - destroy_iterator(ti); - destroy_rbtree(lxq_custom_filters); -} - -void destroy_custom_operators(){ - tree_root* lxq_custom_operators = get_custom_operators(); - - tree_iterator* ti = new_tree_iterator(lxq_custom_operators); - - while(tree_iterator_has_next(ti)){ - custom_operator* cf = (custom_operator*)tree_iterator_next(ti); - free(cf->name); - free(cf); - } - destroy_iterator(ti); - destroy_rbtree(lxq_custom_operators); -} - -/* custom operators */ - -list* eo_first(list* nodes){ - if(nodes == NULL || nodes->count < 1) return NULL; - - list* r = new_generic_list(1); - add_element(r, get_element_at(nodes, 0)); - return r; -} - -list* eo_text_children(list* nodes){ - if(nodes == NULL || nodes->count < 1) return NULL; - - list* r = new_generic_list(1); - int i, j; - for(i = 0; i < nodes->count; i++){ - dom_node* node = (dom_node*)get_element_at(nodes, i); - if(node->type != ELEMENT || node->children == NULL) continue; - - for(j = 0; j < node->children->count; j++){ - dom_node* child = (dom_node*)get_element_at(node->children, j); - if(child->type == TEXT_NODE) - add_element(r, child); - } - } - - return r; -} - -void register_extended_operators(){ - register_simple_custom_operator("first", &eo_first); - register_simple_custom_operator("text-children", &eo_text_children); -} - diff --git a/selectors/eregex.c b/selectors/eregex.c deleted file mode 100644 index f015e0e..0000000 --- a/selectors/eregex.c +++ /dev/null @@ -1,48 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include "../include/eregex.h" - -int match(const char *string, char *pattern, int ignore_case){ - int status; - regex_t re; - - if(ignore_case){ - if (regcomp(&re, pattern, REG_EXTENDED | REG_ICASE | REG_NOSUB) != 0) { - return 0; - } - }else - if (regcomp(&re, pattern, REG_EXTENDED | REG_NOSUB) != 0) { - return 0; - } - - status = regexec(&re, string, (size_t) 0, NULL, 0); - regfree(&re); - if (status != 0) { - return 0; - } - return 1; -} diff --git a/selectors/query_parser.c b/selectors/query_parser.c deleted file mode 100644 index eb5908e..0000000 --- a/selectors/query_parser.c +++ /dev/null @@ -1,187 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include "../include/query_parser.h" -#include "../include/macros.h" -#include "../include/y.tab.h" -#include "../include/byte_buffer.h" - -extern int yyparse(); - -selector* new_selector(match_value* id){ - selector* r = alloc(selector, 1); - r->id = id; - r->filters = NULL; - r->attrs = NULL; - return r; -} - -match_value* new_match_value(const char* value, int op){ - match_value* r = alloc(match_value, 1); - r->value = (value == NULL)? NULL : strdup(value); - r->op = op; - return r; -} - -match_value* new_match_value_no_strdup(char* value, int op){ - match_value* r = alloc(match_value, 1); - r->value = value; - r->op = op; - return r; -} - -attr_selector* new_attr_value_selector(match_value* name, match_value* value){ - attr_selector* r = alloc(attr_selector, 1); - r->name = name; - r->value = value; - return r; -} - -filter_selector* new_filter(int filter){ - filter_selector* r = alloc(filter_selector, 1); - r->op = filter; - r->name = NULL; - r->args = NULL; - return r; -} - -void destroy_selector(selector* s); - -void destroy_filter_selector(filter_selector* fs){ - switch(fs->op){ - /*case NOT_FILTER: - { - int i; - for(i = 0; i < fs->value.selector->count; i++) - destroy_selector((selector*) get_element_at(fs->value.selector, i)); - destroy_generic_list(fs->value.selector); - break; - }*/ - case NTH_CHILD_FILTER: - case NTH_LAST_CHILD_FILTER: - free(fs->value.s); - } - free(fs); -} - -void destroy_attr_selector(attr_selector* as){ - free(as->name->value); - free(as->name); - if(as->value && as->value->value) free(as->value->value); - if(as->value) free(as->value); - free(as); -} - -void destroy_selector(selector* s){ - if(s->id && s->id->value) free(s->id->value); - if(s->id) free(s->id); - - int i; - for(i = 0; i < s->attrs->count; i++) - destroy_attr_selector((attr_selector*) get_element_at(s->attrs, i)); - destroy_generic_list(s->attrs); - - for(i = 0; i < s->filters->count; i++) - destroy_filter_selector((filter_selector*) get_element_at(s->filters, i)); - destroy_generic_list(s->filters); - - free(s); -} - -match_value* make_operators(char* str, int op){ - byte_buffer* bb = NULL; - match_value* r = NULL; - switch(op){ - case STARTSW_OP: - bb = new_byte_buffer(strlen(str)+2); - append_string_to_buffer("^", bb); - append_string_to_buffer(str, bb); - append_bytes_to_buffer("\0", bb, 1); - r = new_match_value_no_strdup(bb->buffer, REGEX_OP); - free(str); - break; - case ENDSW_OP: - bb = new_byte_buffer(strlen(str)+2); - append_string_to_buffer(str, bb); - append_string_to_buffer("$", bb); - append_bytes_to_buffer("\0", bb, 1); - r = new_match_value_no_strdup(bb->buffer, REGEX_OP); - free(str); - break; - case WSSV_OP: - bb = new_byte_buffer((strlen(str)+5)*4); - append_string_to_buffer("(^", bb); - append_string_to_buffer(str, bb); - append_string_to_buffer("$)|", bb); - - append_string_to_buffer("(^", bb); - append_string_to_buffer(str, bb); - append_string_to_buffer(" )|", bb); - - append_string_to_buffer("( ", bb); - append_string_to_buffer(str, bb); - append_string_to_buffer("$)|", bb); - - append_string_to_buffer("( ", bb); - append_string_to_buffer(str, bb); - append_string_to_buffer(" )", bb); - - append_bytes_to_buffer("\0", bb, 1); - r = new_match_value_no_strdup(bb->buffer, REGEX_OP); - free(str); - break; - case DSV_OP: - bb = new_byte_buffer((strlen(str)+5)*4); - append_string_to_buffer("(^", bb); - append_string_to_buffer(str, bb); - append_string_to_buffer("$)|", bb); - - append_string_to_buffer("(^", bb); - append_string_to_buffer(str, bb); - append_string_to_buffer("-)|", bb); - - append_string_to_buffer("(-", bb); - append_string_to_buffer(str, bb); - append_string_to_buffer("$)|", bb); - - append_string_to_buffer("(-", bb); - append_string_to_buffer(str, bb); - append_string_to_buffer("-)", bb); - - append_bytes_to_buffer("\0", bb, 1); - r = new_match_value_no_strdup(bb->buffer, REGEX_OP); - free(str); - break; - case NO_OP: - r = NULL; - break; - default: - r = new_match_value_no_strdup(str, op); - } - free(bb); - return r; -} - diff --git a/selectors/query_runner.c b/selectors/query_runner.c deleted file mode 100644 index 004cdcf..0000000 --- a/selectors/query_runner.c +++ /dev/null @@ -1,501 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include - -#include "../include/query_runner.h" -#include "../include/stack.h" -#include "../include/node.h" -#include "../include/lxq_parser.h" -#include "../include/y.tab.h" -#include "../include/query_parser.h" -#include "../include/eregex.h" -#include "../include/byte_buffer.h" -#include "../include/custom_selectors.h" - -list* run_query(queue* query, const list* all_nodes); -int match_str(const char* str, const match_value* op); - -list* filter_nodes_by_type(list* nodes, enum node_type type){ - if(nodes == NULL) return NULL; - int i; - list* r = new_generic_list(nodes->capacity); - for(i = 0; i < nodes->count; i++){ - if( ((dom_node*)get_element_at(nodes, i))->type == type){ - add_element(r, get_element_at(nodes, i)); - } - } - - return r; -} - -list* get_xml_descendants(dom_node* n){ - list* nodes = get_descendants(n), *res; - res = filter_nodes_by_type(nodes, ELEMENT); - destroy_generic_list(nodes); - return res; -} - -list* get_xml_children(dom_node* n){ - list* nodes = get_children(n); - return filter_nodes_by_type(nodes, ELEMENT); -} - -list* get_xml_nodes_after(dom_node* n){ - list* r = new_generic_list(16); - int i; - - if(n->parent == NULL){ return r; } - list* siblings = get_children(n->parent); - - for(i = get_element_pos(siblings, n); i < siblings->count; i++){ - add_element(r, get_element_at(siblings, i)); - } - - return r; -} - -dom_node* get_xml_node_after(dom_node* n){ - - if(n->parent == NULL){ return NULL; } - list* siblings = get_children(n->parent); - - int p = get_element_pos(siblings, n) + 1; - if(siblings->count <= p) return NULL; - else return get_element_at(siblings, p); -} - -list* apply_custom_relation_operator(const list* nodes, char* op){ - list* (*operator)(list*) = get_simple_custom_operator_by_name(op); - - if(operator == NULL){ - log(W, "Custom operator %s is not registered", op); - return NULL; - } - - - list* r = operator((list*) nodes); - return r; -} - -list* apply_operator(const list* nodes, int op){ - int i; - dom_node* next_node; - list* result = new_generic_list(1); - tree_root* rbtree = new_simple_rbtree(); - - for(i = 0; i < nodes->count; i++){ - dom_node* node = get_element_at(nodes, i); - switch(op){ - case SPACE: - { - list* desc = get_xml_descendants(node); - generic_list_iterator* it = new_generic_list_iterator(desc); - while(generic_list_iterator_has_next(it)){ - void* aux = generic_list_iterator_next(it); - void* old = rb_tree_insert(rbtree, aux); - if(!old) - add_element(result, aux); - } - destroy_generic_list_iterator(it); - destroy_generic_list(desc); - break; - } - case '>': - { - list* c = get_xml_children(node); - generic_list_iterator* it = new_generic_list_iterator(c); - while(generic_list_iterator_has_next(it)){ - void* aux = generic_list_iterator_next(it); - void* old = rb_tree_insert(rbtree, aux); - if(!old) - add_element(result, aux); - } - destroy_generic_list_iterator(it); - destroy_generic_list(c); - break; - } - case '~': - { - list* a = get_xml_nodes_after(node); - generic_list_iterator* it = new_generic_list_iterator(a); - while(generic_list_iterator_has_next(it)){ - void* aux = generic_list_iterator_next(it); - void* old = rb_tree_insert(rbtree, aux); - if(!old) - add_element(result, aux); - } - destroy_generic_list_iterator(it); - destroy_generic_list(a); - break; - } - case '+': - { - next_node = get_xml_node_after(node); - if(next_node != NULL){ - void* old = rb_tree_insert(rbtree, next_node); - if(!old) - add_element(result, next_node); - } - break; - } - default: - log(W, "Relation operator %d, is not implemented.", op); - } - } - destroy_rbtree(rbtree); - return result; -} - -list* filter_nodes_by_name(const list* nodes, match_value* name){ - int i; - if(nodes == NULL) return NULL; - if(nodes->count == 0) return NULL; - - list* r = new_generic_list(nodes->capacity); - - for(i = 0; i < nodes->count; i++){ - if(match_str(((dom_node*)get_element_at(nodes, i))->name, name)){ - add_element(r, get_element_at(nodes, i)); - } - } - - return r; -} - -int match_str(const char* str, const match_value* op){ - if(str == NULL || op == NULL || op->value == NULL){ return 1; } - - switch(op->op){ - case CONTAINS_OP: - case REGEX_OP: - return match(str, op->value, 0); - break; - case REGEXI_OP: - return match(str, op->value, 1); - break; - case EQUAL_OP: - return !strcmp(str, op->value); - break; - case NOTEQUAL_OP: - return strcmp(str, op->value); - break; - default: - log(F, "Unknown, (unimplemented?) operator: %d.", op->op); - exit(1); - } -} - -list* get_matching_attr_by_name(dom_node* node, match_value* name){ - list* r = NULL; - dom_node* attr; - - if(name->op == EQUAL_OP){ - attr = get_attribute_by_name(node, name->value); - if(attr == NULL) return NULL; - else{ - r = new_generic_list(1); - add_element(r, attr); - } - } - else if(node->attributes != NULL){ - tree_iterator* ti = new_tree_iterator(node->attributes); - r = new_generic_list(1); - while(tree_iterator_has_next(ti)){ - dom_node* attr = (dom_node*)tree_iterator_next(ti); - if(match_str(attr->name, name)){ - add_element(r, attr); - } - } - destroy_iterator(ti); - } - - return r; -} - - -list* filter_nodes_by_attr(const list* nodes, attr_selector* attr_s){ - int i; - if(nodes == NULL) return NULL; - if(nodes->count == 0) return NULL; - - list* r = new_generic_list(nodes->capacity); - - for(i = 0; i < nodes->count; i++){ - dom_node* n = get_element_at(nodes, i); - - stack* matching_attr = get_matching_attr_by_name(n, attr_s->name); - if(matching_attr && matching_attr->count > 0){ - if(attr_s->value == NULL){ - add_element(r, n); - } - else{ - while(matching_attr->count > 0){ - dom_node* attr = (dom_node*)pop_stack(matching_attr); - - if(match_str(attr->value, attr_s->value)){ - add_element(r, n); - break; - } - } - } - } - destroy_generic_list(matching_attr); - } - - return r; -} - -list* filter_nodes_by_pseudo_filter(const list* nodes, filter_selector* filter_s, const list* all_nodes){ - int i, m, o, pos; - dom_node* n; - list* siblings = NULL; - list* children; - int (*s_filter)(dom_node*); - int (*filter)(dom_node*, list*); - - - if(nodes == NULL) return NULL; - if(nodes->count == 0) return NULL; - - list* r = new_generic_list(nodes->capacity); - list* not_nodes; - - if(filter_s->op == NOT_FILTER) not_nodes = run_query(filter_s->value.selector, all_nodes); - - for(i = 0; i < nodes->count; i++){ - n = get_element_at(nodes, i); - switch(filter_s->op){ - case FIRST_CHILD_FILTER: - case LAST_CHILD_FILTER: - case ONLY_CHILD_FILTER: - case NTH_CHILD_FILTER: - case NTH_LAST_CHILD_FILTER: - if(n->parent == NULL) continue; - siblings = filter_nodes_by_type(get_children(n->parent), ELEMENT); - } - - switch(filter_s->op){ - case FIRST_CHILD_FILTER: - if(get_element_pos(siblings, n) == 0) - add_element(r, n); - break; - case LAST_CHILD_FILTER: - if(get_element_pos(siblings, n) == siblings->count-1) - add_element(r, n); - break; - case ONLY_CHILD_FILTER: - if(siblings->count == 1) - add_element(r, n); - break; - case NTH_CHILD_FILTER: - m = (filter_s->value).s->multiplier; - o = (filter_s->value).s->offset; - pos = get_element_pos(siblings, n) + 1; - - if(m == 0 && o == 0) break; - else if (m == 0 && o == pos) add_element(r, n); - else if (m != 0 && (pos - o) % m == 0 && (pos - o) / m >= 0) add_element(r, n); - break; - - case NTH_LAST_CHILD_FILTER: - m = filter_s->value.s->multiplier; - o = filter_s->value.s->offset; - pos = siblings->count - get_element_pos(siblings, n); - - if(m == 0 && o == 0) break; - else if (m == 0 && o == pos) add_element(r, n); - else if (m != 0 && (pos - o) % m == 0 && (pos - o) / m >= 0) add_element(r, n); - break; - - case EMPTY_FILTER: - children = filter_nodes_by_type(get_children(n), ELEMENT); - if(children == NULL || children->count == 0) - add_element(r, n); - destroy_generic_list(children); - break; - case NOT_FILTER: - if(get_element_pos(not_nodes, n) < 0) add_element(r, n); - break; - case SCUSTOM_FILTER: - s_filter = get_simple_custom_filter_by_name(filter_s->name); - if(s_filter != NULL){ - if(s_filter(n)) add_element(r, n); - } - else{ - log(W, "The filter '%s' is not registered as a simple filter.", filter_s->name); - i = nodes->count; - } - break; - case CUSTOM_FILTER: - filter = get_custom_filter_by_name(filter_s->name); - if(filter != NULL){ - if(filter(n, filter_s->args)) add_element(r, n); - } - else{ - log(W, "The filter '%s' is not registered as a full filter.", filter_s->name); - i = nodes->count; - } - break; - default: - log(F, "The filter is not implemented."); - } - - destroy_generic_list(siblings); - siblings = NULL; - } - - - return r; -} - -list* filter_nodes_by_selector(const list* nodes, selector* s, const list* all_nodes){ - list* r = duplicate_generic_list(nodes), *old; - int i; - - if(s->id != NULL){ - old = r; - r = filter_nodes_by_name(r, s->id); - destroy_generic_list(old); - } - - if(s->attrs != NULL){ - for(i = 0; i < s->attrs->count; i++){ - old = r; - r = filter_nodes_by_attr(r, get_element_at(s->attrs, i)); - destroy_generic_list(old); - } - } - - if(s->filters != NULL){ - for(i = 0; i < s->filters->count; i++){ - old = r; - r = filter_nodes_by_pseudo_filter(r, get_element_at(s->filters, i), all_nodes); - destroy_generic_list(old); - } - } - - return r; -} - -list* run_query(queue* query, const list* all_nodes){ - selector* s; - list* nodes = duplicate_generic_list(all_nodes), *old; - list* result = new_generic_list(1); - tree_root* rbtree = new_simple_rbtree(); - - int op, *holder; - - while(query->count > 0){ - int type = peek_queue_type(query); - switch(type){ - case CUSTOM_RELATION_OPERATOR: - case LXQ_RELATION_TYPE: - holder = ((int*)dequeue(query)); - op = *holder; - if(op == ','){ - generic_list_iterator* it = new_generic_list_iterator(nodes); - while(generic_list_iterator_has_next(it)){ - void* aux = generic_list_iterator_next(it); - void* old = rb_tree_insert(rbtree, aux); - if(!old) - add_element(result, aux); - } - destroy_generic_list_iterator(it); - destroy_generic_list(nodes); - nodes = duplicate_generic_list(all_nodes); - } - else if(type == CUSTOM_RELATION_OPERATOR){ - old = nodes; - nodes = apply_custom_relation_operator(nodes, (char*)holder); - destroy_generic_list(old); - } - else{ - old = nodes; - nodes = apply_operator(nodes, op); - destroy_generic_list(old); - } - free(holder); - break; - case LXQ_SELECTOR_TYPE: - s =(selector*)dequeue(query); - list* old = nodes; - nodes = filter_nodes_by_selector(nodes, s, all_nodes); - destroy_generic_list(old); - destroy_selector(s); - break; - } - } - - destroy_generic_list(query); - // return remove_duplicates(merge_lists(result, nodes)); - generic_list_iterator* it = new_generic_list_iterator(nodes); - while(generic_list_iterator_has_next(it)){ - void* aux = generic_list_iterator_next(it); - void* old = rb_tree_insert(rbtree, aux); - if(!old) - add_element(result, aux); - } - destroy_generic_list_iterator(it); - destroy_generic_list(nodes); - destroy_rbtree(rbtree); - return result; - -} - -list* query(const char* query_string, dom_node* node){ - char* new_query; - - if(!match(query_string, "^@", 0)){ - byte_buffer* bb = new_byte_buffer(strlen(query_string) + 1); - append_string_to_buffer("@", bb); - append_string_to_buffer(query_string, bb); - append_bytes_to_buffer("\0", bb, 1); - new_query = bb->buffer; - free(bb); - } - else{ - new_query = strdup(query_string); - } - - queue* query = parse_query(new_query); - - if(!query){ - log(W, "Query '%s' is not a valid query.", query_string); - free(new_query); - return NULL; - } - - list* all_nodes = get_descendants(node); - if(!all_nodes) - all_nodes = new_generic_list(1); - - prepend_element_with_type(all_nodes, node, 0); - - list* r = run_query(query, all_nodes); - destroy_generic_list(all_nodes); - free(new_query); - return r; -} - diff --git a/selectors/test.xml b/selectors/test.xml deleted file mode 100644 index 60f7156..0000000 --- a/selectors/test.xml +++ /dev/null @@ -1,20 +0,0 @@ - - - - - - diff --git a/shell/Makefile b/shell/Makefile deleted file mode 100644 index 289f292..0000000 --- a/shell/Makefile +++ /dev/null @@ -1,15 +0,0 @@ -include ../Makefile.inc - -EXEC = shell - -all: command.o - $(CC) -o $(EXEC) $(CFLAGS) ../libxmlquery.so command.o symbol_table.o shell.c - -command.o: symbol_table.o command.h command.c - $(CC) $(CFLAGS) -c command.c - -symbol_table.o: symbol_table.h symbol_table.c - $(CC) $(CFLAGS) -c symbol_table.c - -clean: - rm -rf *.o $(EXEC) *~ \ No newline at end of file diff --git a/shell/command.c b/shell/command.c deleted file mode 100644 index 9dc1029..0000000 --- a/shell/command.c +++ /dev/null @@ -1,198 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include -#include -#include "symbol_table.h" -#include "command.h" -#include "../include/lxq_parser.h" -#include "../include/node.h" -#include "../include/serialize.h" -#include "../include/query_runner.h" - -#define COMMAND_ERROR(command_desc, reason, ...) \ - do{ \ - printf(reason, ## __VA_ARGS__); \ - if(!strcmp(command_desc, "")) \ - printf("%s\n", command_desc); \ - }while(0) - -#define COMMAND(name, desc, n_args) \ - new_command(#name, desc, n_args, COMMAND_FUNCTION_NAME(name)); - -static command* new_command(char* name, char* desc, int n_args, int (*exec)(command* , char**)){ - command* c = alloc(command, 1); - c->name = name; - c->description = desc; - c->n_args = n_args; - c->exec = exec; - return c; -} - -static void destroy_command(command* c){ - free(c); -} - -tree_root* command_table = NULL; - -void* command_key(tree_node* node){ - command *c = (command*) node->node; - return c->name; -} - -int64_t command_compare(void* keyA, void* keyB){ - return strcmp( (char*) keyA, (char*) keyB); -} - -void init_command_table(){ - command_table = new_rbtree(command_key, command_compare); - - command* c = COMMAND(load, "Load an xml file into a variable.\n\tUsage: load \n", 2); - rb_tree_insert(command_table, c); - - c = COMMAND(print_xml, "Print a loaded document into xml format\n\tUsage: print_xml ", 1); - rb_tree_insert(command_table, c); - - c = COMMAND(quit, "Exit from shell\n", 0); - rb_tree_insert(command_table, c); - - c = COMMAND(help, "Print this help message\n", 0); - rb_tree_insert(command_table, c); - - c = COMMAND(query, "Query an existing xml document\n\tUsage:query \"\"\n", 2); - rb_tree_insert(command_table, c); - - c = COMMAND(gdb, "Call gdb for a given program\n\tUsage:gdb ", 1); - rb_tree_insert(command_table, c); -} - -int exec_command(char* name, int n_args, char** args){ - command* c = (command*) search_rbtree(command_table, name); - if(!c){ - COMMAND_ERROR("", "Command %s not found\n", name); - return -1; - } - - if(c->n_args != n_args){ - COMMAND_ERROR(c->description, "Invalid number of arguments for command %s\n", name); - return -1; - } - - return c->exec(c, args); -} - -COMMAND_FUNCTION_HEADER(quit){ - printf("exiting...\n"); - - destroy_symbol_table(); - - tree_iterator* it = new_tree_iterator(command_table); - while(tree_iterator_has_next(it)) - destroy_command((command*) tree_iterator_next(it)); - destroy_iterator(it); - - exit(0); - return 0; -} - -COMMAND_FUNCTION_HEADER(query){ - doc* document = (doc*) get_symbol(argp[0]); - - if(!document){ - COMMAND_ERROR(self->description, "There is no symbol with name %s loaded\n", argp[0]); - return 1; - } - - list* result = query(argp[1], document->root); - int i; - char* str; - for(i = 0; i < result->count; i++){ - str = node_to_string(get_element_at(result, i), XML); - printf("Node:\n"); - printf("%s\n", str); - free(str); - } - - return 0; -} - - -COMMAND_FUNCTION_HEADER(help){ - tree_iterator* it = new_tree_iterator(command_table); - while(tree_iterator_has_next(it)){ - command *c = (command*) tree_iterator_next(it); - printf("%s:\n", c->name); - printf("%s", c->description); - printf("\n"); - } - destroy_iterator(it); - return 0; -} - -void destroy_dom_symbol(void* d){ - doc* dom = (doc*) d; - destroy_dom_tree(dom); -} - -COMMAND_FUNCTION_HEADER(load){ - char *filename, *id; - doc* document; - - filename = argp[0]; - document = parse_xml(filename); - id = argp[1]; - set_symbol(id, document, destroy_dom_symbol); - - printf("XML %s loaded and stored in %s\n", filename, id); - return 0; -} - -COMMAND_FUNCTION_HEADER(print_xml){ - doc* document = (doc*) get_symbol(argp[0]); - - if(!document){ - COMMAND_ERROR(self->description, "There is no symbol with name %s loaded\n", argp[0]); - return 1; - } - - char* str = node_to_string(get_doc_root(document), XML); - printf("%s\n", str); - free(str); - return 0; -} - -COMMAND_FUNCTION_HEADER(gdb){ - char* exec; - char command[64] = {0}; - - exec = argp[0]; - - strcpy(command, "gdb "); - strcpy(command + 4, exec); - - system(command); - return 0; -} diff --git a/shell/command.h b/shell/command.h deleted file mode 100644 index 850889f..0000000 --- a/shell/command.h +++ /dev/null @@ -1,53 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __COMMAND_H__ -#define __COMMAND_H__ - -#include -#include "../include/macros.h" -#include "../include/stack.h" -#include "../include/rbtree.h" - -typedef struct command_s{ - char* name; - char* description; - int n_args; - int (*exec)(struct command_s* self, char** args); -} command; - -#define COMMAND_FUNCTION_NAME(command_name) command_name ## _exec - -#define COMMAND_FUNCTION_HEADER(command_name) int COMMAND_FUNCTION_NAME(command_name)(struct command_s* self, char** argp) - -extern COMMAND_FUNCTION_HEADER(load); -extern COMMAND_FUNCTION_HEADER(print_xml); -extern COMMAND_FUNCTION_HEADER(quit); -extern COMMAND_FUNCTION_HEADER(help); -extern COMMAND_FUNCTION_HEADER(query); -extern COMMAND_FUNCTION_HEADER(gdb); - -extern void init_command_table(); -extern int exec_command(char* name, int n_args, char** args); -#endif diff --git a/shell/shell.c b/shell/shell.c deleted file mode 100644 index 537a09d..0000000 --- a/shell/shell.c +++ /dev/null @@ -1,115 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include -#include "../include/macros.h" -#include "symbol_table.h" -#include "command.h" - -#define MAX_OPTS 20 -#define LINE_SIZE 128 - -void print_banner(){ - printf("############################################################################\n"); - printf("# #\n"); - printf("# ll iii bbb xx xx mm mm ll qqqq uu uu eeeee rrrr yy yy #\n"); - printf("# ll i bb b xx xx mmm mmm ll qq qq uu uu ee rr rr yy yy #\n"); - printf("# ll i bbb xxx mmmmmmm ll qq qq uu uu eeee rrrr yyy #\n"); - printf("# ll i bb b xx xx mm m mm ll qq qq uu uu ee rr rr yyy #\n"); - printf("# llll iii bbb xx xx mm mm llll qqqq q uuuuuu eeeee rr rr yyy #\n"); - printf("# #\n"); - printf("############################################################################\n"); - printf("\n"); -} - -typedef struct parsed_line_s{ - int n_args; - char* command; - char* options[MAX_OPTS]; -}parsed_line; - -parsed_line* parse_command_line(char* line){ - char *start, *end; - int option = 0; - parsed_line* pl = alloc(parsed_line, 1); - - memset(pl, 0, sizeof(parsed_line)); - - //find command - start = end = line; - for(; *end != ' ' && *end != '\n'; end++); - pl->command = alloc(char, end - start + 1); - memset(pl->command, 0, end - start + 1); - strncpy(pl->command, start, end - start); - - //find options treating double quotes - for(; *end != '\n';){ - for(; *end == ' '; end++); - - if(*end == '"'){ - for(end++, start = end; *end != '"'; end++); - (pl->options)[option] = alloc(char, end - start + 1); - memset((pl->options)[option], 0, end - start + 1); - strncpy((pl->options)[option++], start, end - start); - end++; //consume double quote - start = end; - }else{ - for(start = end; *end != ' ' && *end != '\n'; end++); - (pl->options)[option] = alloc(char, end - start + 1); - memset((pl->options)[option], 0, end - start + 1); - strncpy((pl->options)[option++], start, end - start); - start = end; - } - } - - pl->n_args = option; - return pl; -} - -void destroy_parsed_line(parsed_line* pl){ - free(pl->command); - int i; - for(i = 0; i < pl->n_args; i++) - free((pl->options)[i]); - free(pl); -} - -int main(){ - char line[LINE_SIZE] = {0}; - init_command_table(); - init_symbol_table(); - - print_banner(); - while(1){ - printf(">>> "); - fgets(line, LINE_SIZE, stdin); - parsed_line* pl = parse_command_line(line); - exec_command(pl->command, pl->n_args, pl->options); - destroy_parsed_line(pl); - memset(line, 0, LINE_SIZE); - } - return 0; -} diff --git a/shell/symbol_table.c b/shell/symbol_table.c deleted file mode 100644 index 65c5a88..0000000 --- a/shell/symbol_table.c +++ /dev/null @@ -1,72 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include "../include/rbtree.h" -#include "../include/macros.h" -#include "symbol_table.h" - -void* symbol_key(tree_node* node){ - return ((symbol*) node->node)->id; -} - -int64_t symbol_compare(void* keyA, void* keyB){ - return strcmp((char*) keyA, (char*) keyB); -} - -tree_root* symbol_table = NULL; - -void* get_symbol(char* id){ - symbol* n = (symbol*) search_rbtree(symbol_table, id); - - if(!n) - return n; - - return n->value; -} - -void set_symbol(char* id, void* value, void (*destruct_symbol)(void*symbol)){ - symbol* s = alloc(symbol, 1); - s->id = strdup(id); - s->value = strdup(value); - s->destruct_symbol = destruct_symbol; - rb_tree_insert(symbol_table, s); -} - -void init_symbol_table(){ - symbol_table = new_rbtree(symbol_key, symbol_compare); -} - -void destroy_symbol_table(){ - tree_iterator* it = new_tree_iterator(symbol_table); - while(tree_iterator_has_next(it)){ - symbol *s = (symbol*) tree_iterator_next(it); - s->destruct_symbol(s->value); - free(s->id); - free(s); - } - destroy_iterator(it); - destroy_rbtree(symbol_table); -} diff --git a/shell/symbol_table.h b/shell/symbol_table.h deleted file mode 100644 index 7eea357..0000000 --- a/shell/symbol_table.h +++ /dev/null @@ -1,39 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#ifndef __SYMBOL_TABLE_H__ -#define __SYMBOL_TABLE_H__ - -typedef struct symbol_s{ - char* id; - void* value; - - void (*destruct_symbol)(void* symbol); -}symbol; - -extern void* get_symbol(char* id); -extern void set_symbol(char* id, void* value, void (*destruct_symbol)(void*symbol)); -extern void init_symbol_table(); -extern void destroy_symbol_table(); -#endif diff --git a/test.xml b/test.xml deleted file mode 100644 index 19879e7..0000000 --- a/test.xml +++ /dev/null @@ -1,37 +0,0 @@ - - - - - - - - - - 205 - 97 - 256 - - - - - - - Empty çãáèñ²龥 room!!!! - - - - - - - - - - - - - off -20101101235257::off->on -20101101235534::on->off]]> - - - diff --git a/tests/Makefile b/tests/Makefile deleted file mode 100644 index d5bb9ee..0000000 --- a/tests/Makefile +++ /dev/null @@ -1,10 +0,0 @@ -include ../Makefile.inc - -all: exec tests - -exec: - $(CC) -o dom_parser $(CFLAGS) ../libxmlquery.so -I../include test.c - -tests: exec - ./tests - diff --git a/tests/out b/tests/out deleted file mode 100644 index b91b5d5..0000000 --- a/tests/out +++ /dev/null @@ -1 +0,0 @@ - diff --git a/tests/test.c b/tests/test.c deleted file mode 100644 index 82d89b6..0000000 --- a/tests/test.c +++ /dev/null @@ -1,78 +0,0 @@ -/* -Copyright (c) 2010 Frederico Gonçalves, Vasco Fernandes - -Permission is hereby granted, free of charge, to any person obtaining -a copy of this software and associated documentation files (the -"Software"), to deal in the Software without restriction, including -without limitation the rights to use, copy, modify, merge, publish, -distribute, sublicense, and/or sell copies of the Software, and to -permit persons to whom the Software is furnished to do so, subject to -the following conditions: - -The above copyright notice and this permission notice shall be -included in all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, -EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND -NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE -LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION -OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - -*/ - -#include -#include -#include "node.h" -#include "serialize.h" -#include "lxq_parser.h" -#include "stack.h" -#include "query_runner.h" -#include "custom_selectors.h" -#include "node.h" - -void dump(char* array, int offset, int size){ - for(; offset < size; offset++) - printf("%c", array[offset]); - putchar('\n'); -} - -int filter(dom_node* filter, list* l){ - return 1; -} - -int main(int argc, char** argv){ - - if(argc != 3){ - printf("usage: %s \"xml_file\" \"query\"\n", argv[0]); - return 0; - } - register_custom_filter("filter", &filter); - doc* document = parse_xml(argv[1]); - - register_extended_operators(); - - list* result = query(argv[2],document->root); - - int i; - char* cha; - - for(i=0; i < result->count; i++){ - dom_node* t = (dom_node*)get_element_at(result, i); - cha = node_to_string(t, XML); - printf("%s", cha); - free(cha); - } - - if(result) - destroy_generic_list(result); - if(document != NULL) - destroy_dom_tree(document); - - destroy_dictionary(); - destroy_custom_filters(); - destroy_custom_operators(); - return 0; -} - diff --git a/tests/test.sh b/tests/test.sh deleted file mode 100644 index 8e0cd28..0000000 --- a/tests/test.sh +++ /dev/null @@ -1,68 +0,0 @@ -#!/bin/bash - -echo $@ - -while getopts :vs opt; do - if [ $opt == 'v' ] - then - v='-v' - shift $((OPTIND-1)) - elif [ $opt == 's' ] - then - s='-s' - shift $((OPTIND-1)) - fi -done - -if [ $# -ne 3 ] -then - echo "usage: $0 xml_doc query expected_output" - exit 1 -fi - -echo "./dom_parser \"$1\" \"$2\"" -./dom_parser "$1" "$2" 2>&1 > __tmp.out -if [ $? -ne 0 ] -then - echo "FAILED" - exit 1 -fi - -echo -n "** Running diff..." -diff "$3" __tmp.out 2>&1 > /dev/null -if [ $? -ne 0 ] -then - echo " FAILED" - exit 1 -else - echo " PASS" -fi - -rm -f __tmp.out - -if [ -z $v ] -then - if [ -z $s ] - then - echo "valgrind --leak-check=full --show-reachable=yes ./dom_parser \"$1\" \"$2\"" - fi - - valgrind --leak-check=full --show-reachable=yes ./dom_parser "$1" "$2" 2>&1 | tee __res.out > /dev/null - grep "All heap blocks were freed -- no leaks are possible" __res.out 2>&1 > /dev/null -fi - -if [ $? -ne 0 ] -then - if [ -z $s ] - then - echo "This test has memory leaks" - fi - exit 1 -fi - -rm -f __res.out -if [ -z $s ] -then - echo "Success!" -fi - diff --git a/tests/test.xml b/tests/test.xml deleted file mode 100644 index d270c06..0000000 --- a/tests/test.xml +++ /dev/null @@ -1,37 +0,0 @@ - - - - - - - - - - 205 - 97 - 256 - - - - - - - Empty room!!!! - - - - - - - - - - - - - off -20101101235257::off->on -20101101235534::on->off]]> - - - diff --git a/tests/test_results/test0.0.out.res b/tests/test_results/test0.0.out.res deleted file mode 100644 index bb664fb..0000000 --- a/tests/test_results/test0.0.out.res +++ /dev/null @@ -1,28 +0,0 @@ - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - - Empty room!!!! - - - - - - diff --git a/tests/test_results/test0.1.out.res b/tests/test_results/test0.1.out.res deleted file mode 100644 index 9e4523b..0000000 --- a/tests/test_results/test0.1.out.res +++ /dev/null @@ -1,15 +0,0 @@ - - - - - - 205 - - - 97 - - - 256 - - - diff --git a/tests/test_results/test0.10.out.res b/tests/test_results/test0.10.out.res deleted file mode 100644 index ac96e8c..0000000 --- a/tests/test_results/test0.10.out.res +++ /dev/null @@ -1 +0,0 @@ - diff --git a/tests/test_results/test0.11.out.res b/tests/test_results/test0.11.out.res deleted file mode 100644 index ac96e8c..0000000 --- a/tests/test_results/test0.11.out.res +++ /dev/null @@ -1 +0,0 @@ - diff --git a/tests/test_results/test0.12.out.res b/tests/test_results/test0.12.out.res deleted file mode 100644 index e69de29..0000000 diff --git a/tests/test_results/test0.13.out.res b/tests/test_results/test0.13.out.res deleted file mode 100644 index b91b5d5..0000000 --- a/tests/test_results/test0.13.out.res +++ /dev/null @@ -1 +0,0 @@ - diff --git a/tests/test_results/test0.14.out.res b/tests/test_results/test0.14.out.res deleted file mode 100644 index c36194d..0000000 --- a/tests/test_results/test0.14.out.res +++ /dev/null @@ -1,19 +0,0 @@ - - - - - - - - 205 - - - 97 - - - 256 - - - - - diff --git a/tests/test_results/test0.15.out.res b/tests/test_results/test0.15.out.res deleted file mode 100644 index e69de29..0000000 diff --git a/tests/test_results/test0.16.out.res b/tests/test_results/test0.16.out.res deleted file mode 100644 index b91b5d5..0000000 --- a/tests/test_results/test0.16.out.res +++ /dev/null @@ -1 +0,0 @@ - diff --git a/tests/test_results/test0.17.out.res b/tests/test_results/test0.17.out.res deleted file mode 100644 index 8335c2d..0000000 --- a/tests/test_results/test0.17.out.res +++ /dev/null @@ -1,21 +0,0 @@ - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - diff --git a/tests/test_results/test0.18.out.res b/tests/test_results/test0.18.out.res deleted file mode 100644 index 1ab3ec1..0000000 --- a/tests/test_results/test0.18.out.res +++ /dev/null @@ -1,7 +0,0 @@ - - - Empty room!!!! - - - - diff --git a/tests/test_results/test0.19.out.res b/tests/test_results/test0.19.out.res deleted file mode 100644 index 8335c2d..0000000 --- a/tests/test_results/test0.19.out.res +++ /dev/null @@ -1,21 +0,0 @@ - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - diff --git a/tests/test_results/test0.2.out.res b/tests/test_results/test0.2.out.res deleted file mode 100644 index 8a1f695..0000000 --- a/tests/test_results/test0.2.out.res +++ /dev/null @@ -1,43 +0,0 @@ - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - - Empty room!!!! - - - - - - - - - - - - 205 - - - 97 - - - 256 - - - diff --git a/tests/test_results/test0.20.out.res b/tests/test_results/test0.20.out.res deleted file mode 100644 index 1ab3ec1..0000000 --- a/tests/test_results/test0.20.out.res +++ /dev/null @@ -1,7 +0,0 @@ - - - Empty room!!!! - - - - diff --git a/tests/test_results/test0.21.out.res b/tests/test_results/test0.21.out.res deleted file mode 100644 index 1ab3ec1..0000000 --- a/tests/test_results/test0.21.out.res +++ /dev/null @@ -1,7 +0,0 @@ - - - Empty room!!!! - - - - diff --git a/tests/test_results/test0.22.out.res b/tests/test_results/test0.22.out.res deleted file mode 100644 index 8335c2d..0000000 --- a/tests/test_results/test0.22.out.res +++ /dev/null @@ -1,21 +0,0 @@ - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - diff --git a/tests/test_results/test0.23.out.res b/tests/test_results/test0.23.out.res deleted file mode 100644 index 1ab3ec1..0000000 --- a/tests/test_results/test0.23.out.res +++ /dev/null @@ -1,7 +0,0 @@ - - - Empty room!!!! - - - - diff --git a/tests/test_results/test0.24.out.res b/tests/test_results/test0.24.out.res deleted file mode 100644 index 8335c2d..0000000 --- a/tests/test_results/test0.24.out.res +++ /dev/null @@ -1,21 +0,0 @@ - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - diff --git a/tests/test_results/test0.25.out.res b/tests/test_results/test0.25.out.res deleted file mode 100644 index 2702745..0000000 --- a/tests/test_results/test0.25.out.res +++ /dev/null @@ -1,162 +0,0 @@ - - - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - - Empty room!!!! - - - - - - - - - - - - off -20101101235257::off->on -20101101235534::on->off]]> - - - - - - 205 - - - 97 - - - 256 - - - - 205 - - - 97 - - - 256 - - - - - - 205 - - - 97 - - - 256 - - - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - Empty room!!!! - - - - Empty room!!!! - - - - - - - - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - - Empty room!!!! - - - - - - - - - - - - - off -20101101235257::off->on -20101101235534::on->off]]> - diff --git a/tests/test_results/test0.26.out.res b/tests/test_results/test0.26.out.res deleted file mode 100644 index e177d9d..0000000 --- a/tests/test_results/test0.26.out.res +++ /dev/null @@ -1 +0,0 @@ - diff --git a/tests/test_results/test0.27.out.res b/tests/test_results/test0.27.out.res deleted file mode 100644 index e177d9d..0000000 --- a/tests/test_results/test0.27.out.res +++ /dev/null @@ -1 +0,0 @@ - diff --git a/tests/test_results/test0.28.out.res b/tests/test_results/test0.28.out.res deleted file mode 100644 index e177d9d..0000000 --- a/tests/test_results/test0.28.out.res +++ /dev/null @@ -1 +0,0 @@ - diff --git a/tests/test_results/test0.29.out.res b/tests/test_results/test0.29.out.res deleted file mode 100644 index c4c2562..0000000 --- a/tests/test_results/test0.29.out.res +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/tests/test_results/test0.3.out.res b/tests/test_results/test0.3.out.res deleted file mode 100644 index 2702745..0000000 --- a/tests/test_results/test0.3.out.res +++ /dev/null @@ -1,162 +0,0 @@ - - - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - - Empty room!!!! - - - - - - - - - - - - off -20101101235257::off->on -20101101235534::on->off]]> - - - - - - 205 - - - 97 - - - 256 - - - - 205 - - - 97 - - - 256 - - - - - - 205 - - - 97 - - - 256 - - - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - Empty room!!!! - - - - Empty room!!!! - - - - - - - - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - - Empty room!!!! - - - - - - - - - - - - - off -20101101235257::off->on -20101101235534::on->off]]> - diff --git a/tests/test_results/test0.30.out.res b/tests/test_results/test0.30.out.res deleted file mode 100644 index b5ea446..0000000 --- a/tests/test_results/test0.30.out.res +++ /dev/null @@ -1,32 +0,0 @@ - - - - - - 205 - - - 97 - - - 256 - - - - - - - - - - 205 - - - 97 - - - 256 - - - - diff --git a/tests/test_results/test0.31.out.res b/tests/test_results/test0.31.out.res deleted file mode 100644 index b5ea446..0000000 --- a/tests/test_results/test0.31.out.res +++ /dev/null @@ -1,32 +0,0 @@ - - - - - - 205 - - - 97 - - - 256 - - - - - - - - - - 205 - - - 97 - - - 256 - - - - diff --git a/tests/test_results/test0.32.out.res b/tests/test_results/test0.32.out.res deleted file mode 100644 index d16e4ed..0000000 --- a/tests/test_results/test0.32.out.res +++ /dev/null @@ -1,17 +0,0 @@ - - - - - - - 205 - - - 97 - - - 256 - - - - diff --git a/tests/test_results/test0.33.out.res b/tests/test_results/test0.33.out.res deleted file mode 100644 index d16e4ed..0000000 --- a/tests/test_results/test0.33.out.res +++ /dev/null @@ -1,17 +0,0 @@ - - - - - - - 205 - - - 97 - - - 256 - - - - diff --git a/tests/test_results/test0.4.out.res b/tests/test_results/test0.4.out.res deleted file mode 100644 index e69de29..0000000 diff --git a/tests/test_results/test0.5.out.res b/tests/test_results/test0.5.out.res deleted file mode 100644 index bb664fb..0000000 --- a/tests/test_results/test0.5.out.res +++ /dev/null @@ -1,28 +0,0 @@ - - - - - - - - 205 - - - 97 - - - 256 - - - - - - - - Empty room!!!! - - - - - - diff --git a/tests/test_results/test0.6.out.res b/tests/test_results/test0.6.out.res deleted file mode 100644 index 462a1c9..0000000 --- a/tests/test_results/test0.6.out.res +++ /dev/null @@ -1,5 +0,0 @@ - - - Empty room!!!! - - diff --git a/tests/test_results/test0.7.out.res b/tests/test_results/test0.7.out.res deleted file mode 100644 index 9e4523b..0000000 --- a/tests/test_results/test0.7.out.res +++ /dev/null @@ -1,15 +0,0 @@ - - - - - - 205 - - - 97 - - - 256 - - - diff --git a/tests/test_results/test0.8.out.res b/tests/test_results/test0.8.out.res deleted file mode 100644 index ac96e8c..0000000 --- a/tests/test_results/test0.8.out.res +++ /dev/null @@ -1 +0,0 @@ - diff --git a/tests/test_results/test0.9.out.res b/tests/test_results/test0.9.out.res deleted file mode 100644 index e69de29..0000000 diff --git a/tests/tests b/tests/tests deleted file mode 100755 index 84a8b7b..0000000 --- a/tests/tests +++ /dev/null @@ -1,47 +0,0 @@ -#!/bin/bash - -OUTPUTS_DIR=./test_results - -FILES=( "test.xml" ) - -QUERIES=( "@room" "@room device" "@room,device" "@*" "@room>device" "@room[name]" '@room[name="r2"]' '@room device[type]' '@room device[type="blind"]' '@room>device[type="blind"]' '@room device[type="blind"][state]' '@room device[type="blind"][state="87"]' '@ola' '@room:last-child' '@room:nth-child(1)' '@room:nth-child(3000)' '@room:nth-last-child(1)' '@room:nth-last-child(2n)' '@room:nth-last-child(2n + 1)' '@room:nth-last-child(even)' '@room:nth-last-child(odd)' '@room:nth-child(2n)' '@room:nth-child(2n +1)' '@room:nth-child(even)' '@room:nth-child(odd)' '@' '@device[type^="sw"]' '@device[type$="ch"]' '@device[type*="it"]' '@room:empty' '/vice/' '/^dev/' '/ces$/' '/device[^\/]$/') - -iend=`echo "${#FILES[@]} - 1" | bc` -jend=`echo "${#QUERIES[@]} - 1" | bc` - - -while getopts :vs opt; do - if [ $opt == 'v' ] - then - v='-v' - shift $((OPTIND-1)) - elif [ $opt == 's' ] - then - s='-s' - shift $((OPTIND-1)) - fi -done - - -for i in `seq 0 $iend` -do - for j in `seq 0 $jend` - do - FILE=${FILES[i]} - QUERY=${QUERIES[j]} - - if [ -z $s ] - then - echo "======================================================================" - echo "== Running test $i.$j" - fi - - bash test.sh $v $s "$FILE" "$QUERY" "$OUTPUTS_DIR/test$i.$j.out.res" - - if [ -z $s ] - then - echo "======================================================================" - fi - done -done - diff --git a/tutorial.html b/tutorial.html new file mode 100644 index 0000000..a986515 --- /dev/null +++ b/tutorial.html @@ -0,0 +1,142 @@ + + + + + + + + Tutorial — libxmlquery v0.1.4 documentation + + + + + + + + + + + +
        +

        Navigation

        + +
        + +
        +
        +
        +
        + +
        +

        Tutorial

        +

        The following code shows how to use the library to rename a node in a xml file:

        +
        #include <stdio.h>
+#include <xmlquery/parse.h>
+#include <xmlquery/dom.h>
+#include <xmlquery/serialize.h>
+
+dom_node* node = xmlquery_parsefile("test.xml");
+node_list* q_result = xmlquery_query("@hi[foo=bar]");
+dom_node* n_result = xmlquery_pop_node(q_result);
+xmlquery_set_node_name(n_result, "bye");
+
+printf("%s\n", xmlquery_dom_node_to_string(node, XML);
+
        +
        +

        if test.xml contains:

        +
        <root>
+  <hi />
+  <hi foo="bar" />
+</root>
+
        +
        +

        the resulting output would change the node:

        +
        <hi foo="bar" />
+
        +
        +

        to:

        +
        <bye foo="bar" />
+
        +
        +

        this code will read an xml file in test.xml into our abstract representation +of the DOM (Document Object Model) tree:

        +
        dom_node* node = xmlquery_parsefile("test.xml");
+
        +
        +
        + + +
        +
        +
        +
        +
        +

        Previous topic

        +

        libxmlquery documentation

        +

        Next topic

        +

        Parser Module

        +

        This Page

        + + + +
        +
        +
        +
        +
        +

        Navigation

        + +
        +
        + © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
        + + \ No newline at end of file diff --git a/tutorial/tutorial.html b/tutorial/tutorial.html new file mode 100644 index 0000000..b50b963 --- /dev/null +++ b/tutorial/tutorial.html @@ -0,0 +1,296 @@ + + + + + + + + Tutorial — libxmlquery v0.1.4 documentation + + + + + + + + + + + +
        +

        Navigation

        + +
        + +
        +
        +
        +
        + +
        +

        Tutorial

        +

        In this tutorial you’ll learn how to parse, query and manipulate XML files. We’re going to use the test.xml document, which is an RSS Feed and has the content:

        +
        <?xml version="1.0" encoding="UTF-8" ?>
+<rss version="2.0">
+
+  <channel>
+   <title>RSS Example</title>
+   <description>This is an example of an RSS feed</description>
+   <link>http://www.domain.com/link.htm</link>
+   <lastBuildDate>Mon, 28 Aug 2006 11:12:55 -0400 </lastBuildDate>
+   <pubDate>Tue, 29 Aug 2006 09:00:00 -0400</pubDate>
+
+   <item>
+     <title>Item Example</title>
+     <description>This is an example of an Item</description>
+     <link>http://www.domain.com/link.htm</link>
+     <guid isPermaLink="false"> 1102345</guid>
+     <pubDate>Tue, 29 Aug 2006 09:00:00 -0400</pubDate>
+   </item>
+
+  </channel>
+</rss>
+
        +
        +

        Every example in this tutorial must be compile as:

        +
        +
        gcc -I<path to our header files> ./libxmlquery.so <source_file>
+
        +
        +
        +

        Lets begin with parsing. The below code shows how to parse the above XML:

        +
        #include "node.h"
+#include "lxq_parser.h"
+
+doc* global_document = NULL;
+
+void read_file(){
+  global_document = parse_xml("test.xml");
+}
+
+void cleanup(){
+  if(global_document)
+    destroy_dom_tree(global_document);
+}
+
+int main(int argc, char** argv){
+  read_file();
+  cleanup();
+  return 0;
+}
+
        +
        +

        Ok so this is a pretty simple file. We’re creating a DOM tree of the above XML document and then cleaning it up. However, this is not a really helpfull example. Lets try to add +the capability of querying the document through the program arguments:

        +
        #include <stdio.h>
+#include "node.h"
+#include "lxq_parser.h"
+#include "query_runner.h"
+
+doc* global_document = NULL;
+
+void read_file(){
+  global_document = parse_xml("test.xml");
+}
+
+void cleanup(){
+  if(global_document)
+    destroy_dom_tree(global_document);
+}
+
+int main(int argc, char** argv){
+  //check if we have exactly 1 argument
+  if(argc != 2){
+    printf("Usage: %s \"query\"\n", argv[0]);
+    return -1;
+  }
+
+  read_file();
+
+  query(argv[1], get_doc_root(global_document));
+
+  cleanup();
+  return 0;
+}
+
        +
        +

        Go ahead and run it with

        +
        +
        ./a.out "@title/"
+
        +
        +
        +

        It will search the document for all elements named “title”.

        +

        However, we aren’t able to see the output. Lets add that feature:

        +
        #include <stdio.h>
+#include "node.h"
+#include "lxq_parser.h"
+#include "query_runner.h"
+#include "stack.h"
+#include "serialize.h"
+
+doc* global_document = NULL;
+
+void read_file(){
+  global_document = parse_xml("test.xml");
+}
+
+void cleanup(){
+  if(global_document)
+    destroy_dom_tree(global_document);
+}
+
+int main(int argc, char** argv){
+  //check if we have exactly 1 argument
+  if(argc != 2){
+    printf("Usage: %s \"query\"\n", argv[0]);
+    return -1;
+  }
+
+  read_file();
+
+  list *result = query(argv[1], get_doc_root(global_document));
+
+  generic_list_iterator* i = new_generic_list_iterator(result);
+  while(generic_list_iterator_has_next(i)){
+    dom_node* el = (dom_node*) generic_list_iterator_next(i);
+    char* output = node_to_string(el, XML);
+    printf("%s\n", output);
+    free(output);
+  }
+  destroy_generic_list_iterator(i);
+
+  cleanup();
+  return 0;
+}
+
        +
        +

        Try it with the same query as before and then try to retrieve the element “title” for the “item” with:

        +
        +
        ./a.out "@item>title"
+
        +
        +
        +

        Ok we’re able to retrieve any thing from our RSS Feed. But now, we want to change the title of the element “item” to “no-title”. Let’s do it:

        +
        #include <stdio.h>
+#include "node.h"
+#include "lxq_parser.h"
+#include "query_runner.h"
+#include "stack.h"
+#include "serialize.h"
+
+doc* global_document = NULL;
+
+void read_file(){
+  global_document = parse_xml("test.xml");
+}
+
+void cleanup(){
+  if(global_document)
+    destroy_dom_tree(global_document);
+}
+
+int main(int argc, char** argv){
+  read_file();
+
+  list *result = query("@item>title", get_doc_root(global_document));
+
+  generic_list_iterator* i = new_generic_list_iterator(result);
+  while(generic_list_iterator_has_next(i)){
+    dom_node* el = (dom_node*) generic_list_iterator_next(i);
+    //get the node which has the title
+    dom_node* text_node = get_child_at(el, 0);
+    char* old = set_value(text_node, "no-title");
+    if(old)
+      free(old);
+  }
+  destroy_generic_list_iterator(i);
+
+  char* output = node_to_string(get_doc_root(global_document), XML);
+  printf("%s\n", output);
+  free(output);
+
+  cleanup();
+  return 0;
+}
+
        +
        +

        Notice that we’ve removed the capabillity of using the arguments passed to the program. To run this example you just need to run the program without arguments.

        +

        This concludes the tutorial. We’ve shown how to parse, query and manipulate XML documents. The rest of the documentation explains how to add new features such as custom filters, custom operators and regular expressions.

        +
        + + +
        +
        +
        +
        +
        +

        Previous topic

        +

        libxmlquery documentation

        +

        Next topic

        +

        Parser Module

        +

        This Page

        + + + +
        +
        +
        +
        +
        +

        Navigation

        + +
        +
        + © Copyright 2010, Frederico Gonçalves, Vasco Fernandes. + Created using Sphinx 1.0.4. +
        + + \ No newline at end of file