search for: nodetyp

Yesterday, I switched our node structure from using node basenode, node nodetype inherits basenode, to using node classes per the changes discussed recently on this list and as defined in the wiki:GlossaryOfTerms. In the manifest, we have a syslog module which sets up all the components of syslog-ng we''re using. The ''syslog'' class is used by default...

...the nodes and uses llvm::Inverse which forced me to implement my GraphTraits also for Inverse. This could be solved using a compile time abstraction of Graph instread of GraphTraits. the abstraction has to provide some typedefs and methods (and would be quite similar to GraphTraits): typedef XXX NodeType; typedef XXX ChildIteratorType; typedef XXX NodesIteratorType; getRoots(); // return all roots getRoot(); // return the root if it is only one, othewise NULL child_begin(NodeType* node); // iterators for children of a node child_end(NodeType* node); nodes_begin(); // iterators for the nodes of...

...LLVM 3.1 using clang in order to get a better idea of the error. Here is the build error output: /home/arhishee/work/llvm-3.1.src/include/llvm/Support/GraphWriter.h:143:8: note: candidate function not viable: no known conversion from 'IIty' (aka 'llvm::MachineInstr') to 'NodeType &' (aka 'llvm::Value &') for 1st argument; bool isNodeHidden(NodeType &Node) { ^ /home/arhishee/work/llvm-3.1.src/include/llvm/Support/GraphWriter.h:147:8: note: candidate function not viable: no known conversion from 'IIty' (aka 'llvm::MachineIns...

...to ‘llvm::GraphWriter<llvm::MCDFGraph<llvm::MachineFunction*> >::isNodeHidden(llvm::MachineInstr&)’* */home/abhi/work/llvm31/llvm/include/llvm/Support/GraphWriter.h:143: note: candidates are: bool llvm::GraphWriter<GraphType>::isNodeHidden(typename llvm::GraphTraits<T>::NodeType&) [with GraphType = llvm::MCDFGraph<llvm::MachineFunction*>]* */home/abhi/work/llvm31/llvm/include/llvm/Support/GraphWriter.h:147: note: bool llvm::GraphWriter<GraphType>::isNodeHidden(typename llvm::GraphTraits<T>::NodeType* const*) [with GraphType = llvm::MC...

...= diff -ur old/klibc-0.198/ash/Makefile klibc-0.198/ash/Makefile --- old/klibc-0.198/ash/Makefile 2005-01-27 22:21:29.000000000 +0100 +++ klibc-0.198/ash/Makefile 2005-02-06 15:56:36.478233705 +0100 @@ -111,8 +111,7 @@ $(OBJ_NODES): nodes.h $(OBJ_SYNTAX): syntax.h -nodes.c nodes.h: mknodes.sh nodetypes nodes.c.pat nodes -nodes: +nodes.c nodes.h nodes: mknodes.sh nodetypes nodes.c.pat sh mknodes.sh nodetypes nodes.c.pat . signames.c: mksignames diff -ur old/klibc-0.198/utils/Makefile klibc-0.198/utils/Makefile --- old/klibc-0.198/utils/Makefile 2004-10-26 04:32:13.000000000 +0200 +++ klibc-0...

...ced me to > implement my GraphTraits also for Inverse. > > This could be solved using a compile time abstraction of Graph > instread of GraphTraits. > > the abstraction has to provide some typedefs and methods > (and would be quite similar to GraphTraits): > > typedef XXX NodeType; > typedef XXX ChildIteratorType; > typedef XXX NodesIteratorType; > > getRoots(); // return all roots > getRoot(); // return the root if it is only one, othewise NULL > or just add these methods to GraphTraits? > > child_begin(NodeType* node); // iterators for children o...

...f GraphTraits. > > the abstraction has to provide some typedefs and methods > (and would be quite similar to GraphTraits): I definitely support adding multiple tree roots to the graph interface. This will allow the DOTGraphTraits based printers to not only print trees. > typedef XXX NodeType; > typedef XXX ChildIteratorType; > typedef XXX NodesIteratorType; > > getRoots(); // return all roots > getRoot(); // return the root if it is only one, othewise NULL > > child_begin(NodeType* node); // iterators for children of a node > child_end(NodeType* node); > &gt...

...ode *, llvm::DSNode &> >' requested here static nodes_iterator nodes_begin(DSGraph *G) { So, it looks to me like in DSGraph, the iterator needs to be dereferenced correctly. Right now the source reads: template <> struct GraphTraits<DSGraph*> { typedef DSNode NodeType; typedef DSNode::iterator ChildIteratorType; // not sure this is necessary anymore as NodeRef must be a pointer typedef std::pointer_to_unary_function&...

We have created a new alias -- llvmbugs at cs.uiuc.edu. Please use this for reporting bugs or turning in patches for LLVM. Any such feedback would be appreciated! Please continue to use llvmdev to post questions or have discussions about LLVM. --Vikram http://www.cs.uiuc.edu/~vadve

I''m trying to add a "node type" variable that can be interpolated into source values. In this, my latest attempt, $nodetype always ends up as "base": # manifests/nodes $nodetype = "base" node "base" { include postfix ...snip... } node "www01", "www02", ... , "www10" inherits "base" { $nodetype = "wwwnode" include postfi...

...g a self-cycle.*/ +template<class T> +bool is_in_cycle(T* bb) +{ + /*Return true iff we are in a nonsingular SCC.*/ + scc_iterator<T*> cur = scc_begin(bb); + while(cur!=scc_end(bb)) + { + for(typename std::vector<typename GraphTraits<T*>::NodeType*>::iterator i = (*cur).begin(); i!=(*cur).end(); i++) + if(*i==bb) + return cur.hasLoop(); + cur++; + } + + //We should never get here. + abort(); +} + } // End llvm namespace #endif Index: include/llvm/ADT/...

...undefined previousSibling: TAG(1): 'empty_element' childNodes: 0: --- -attributes: 1: entities%5Fattribute=%3C%20%3E%20%22%20%27%20%26 +attributes: 1: entities%5Fattribute=%3C%20%3E%20%22%20%27%20%26%20%C2%A0 localName: entities namespaceURI: nodeName: entities @@ -309,18 +309,18 @@ nodeType: 1 nodeValue: null prefix: parentNode: TAG(1): 'null' -firstChild: TEXT(3): '%0A%20%20%3C%20%3E%20%22%20%27%20%26%0A' -lastChild: TEXT(3): '%0A%20%20%3C%20%3E%20%22%20%27%20%26%0A' +firstChild: TEXT(3): '%0A%20%20%3C%20%3E%20%22%20%27%20%26%20%C2%A0%0A' +lastChi...

..._nodeToHash: function (node) { Element.cleanWhitespace(node); // // remove comments, firefox fix node = this._removeComments(node); if ((node.attributes && node.attributes.length > 0) || (node.hasChildNodes() && (node.childNodes[0].nodeType == 1 || node.childNodes[0].nodeType == 7))) { var localHash = {}; if (node.attributes && node.attributes.length >= 1) { $A(node.attributes).each(function (attr) { localHash[attr.nodeName] = [attr.nodeValue]; }...

Anyone know of a javascript function that will take an xml document and turn it into an associative array? Basically it would take something like this: <body> <item> <id>1</id> <name>Bob</name> </item> <item> <id>2</id> <name>John</name> </item> </body> And turn it into something like this: {

Greetings, We have purchased an IBM BladeCenter and I am in the process of testing Linux installation on these things (boot off SAN i.e. qla2300 driver, not using internal drives). My distro of choice is Debian, however, since I'm really not interested in trying to hand compile all the drivers, I decided to try CentOS (which I'm so far very impressed with). On boot, as with the

On Aug 6, 2009, at 4:19 PM, Patrick Alexander Simmons wrote: > Chris Lattner wrote: >> On Aug 4, 2009, at 3:48 PM, Patrick Alexander Simmons wrote: >> >> >>> Hi, >>> >>> I've been using scc_iterator, and I added the templates necessary to >>> make it work with inverse graphs. I also added a "bb_reachable" >>>

...;::end(G); +} + } // End llvm namespace #endif Index: include/llvm/ADT/GraphTraits.h =================================================================== --- include/llvm/ADT/GraphTraits.h (revision 88920) +++ include/llvm/ADT/GraphTraits.h (working copy) @@ -30,7 +30,7 @@ // typedef NodeType - Type of Node in the graph // typedef ChildIteratorType - Type used to iterate over children in graph - // static NodeType *getEntryNode(GraphType *) + // static NodeType *getEntryNode(const GraphType &) // Return the entry node of the graph // static ChildIteratorTy...

...> > +bool is_in_cycle(T* bb) > +{ > + /*Return true iff we are in a nonsingular SCC.*/ > + scc_iterator<T*> cur = scc_begin(bb); > + while(cur!=scc_end(bb)) > + { > + for(typename std::vector<typename > GraphTraits<T*>::NodeType*>::iterator i = (*cur).begin(); > i!=(*cur).end(); i++) > + if(*i==bb) > + return cur.hasLoop(); > + cur++; > + } > + > + //We should never get here. > + abort(); > +} > + > } //...

...ng: unused parameter ?argv? make[2]: *** [dash/cd.o] Error 1 make[2]: *** Waiting for unfinished jobs.... ... I'm pretty sure this is due to the rules of the following form ... # Generate nodes{.c + .h} quiet_cmd_mknodes = GEN $@ cmd_mknodes = cd $(obj); ./mknodes $(srctree)/$(src)/nodetypes \ $(srctree)/$(src)/nodes.c.pat $(obj)/nodes.c $(obj)/nodes.h: $(obj)/mknodes $(src)/nodetypes \ $(src)/nodes.c.pat $(call cmd,mknodes) ... which DO NOT do what one logically think they do. If executed in parallel that ru...

A have an observer watch for a click on a link. Inside the triggered function, I want to extract a piece of information from the URL. Currently I am able to do: alert(Event.element(el)); This displays the url string of the link, which is exactly what I need to work with. However, when I try: Event.element(el).match(//); I get a javascript error "selector.match is not a function". I