/macosx-10.10/libxml2-26/libxml2/doc/examples/ |
H A D | tree2.c | 29 xmlNodePtr root_node = NULL, node = NULL, node1 = NULL;/* node pointers */ local 37 * Creates a new document, a node and set it as a root node 49 * xmlNewChild() creates a new node, which is "attached" as child node 50 * of root_node node. 53 BAD_CAST "content of node 1"); 55 * The same as above, but the new child node doesn't have a content 60 * xmlNewProp() creates attributes, which is "attached" to an node [all...] |
/macosx-10.10/ruby-106/ruby/test/rexml/ |
H A D | test_ticket_80.rb | 32 # tests the "prefix:*" node test syntax 36 { 'ns' => 'urn:some-xml-ns' } ) do |node| out.push node.value ; end 43 # tests a workaround for the "prefix:*" node test syntax 47 { 'ns' => 'urn:some-xml-ns' } ) do |node| out.push node.value ; end
|
/macosx-10.10/tcl-105/tcl_ext/tclxml/tcldom/examples/ |
H A D | cgi2dom.tcl | 35 set node [dom::DOMImplementation createNode $doc $path] 37 switch [dom::node cget $node -nodeType] { 39 dom::document createTextNode $node $value 42 dom::node configure $node -nodeValue $value
|
/macosx-10.10/tcl-105/tcl_ext/tdom/tdom/generic/ |
H A D | nodecmd.h | 42 domNode *node, 46 domNode *node,
|
/macosx-10.10/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGAbstractInterpreter.h | 44 AbstractValue& forNode(Node* node) argument 46 return m_state.forNode(node); 51 return forNode(edge.node()); 59 bool needsTypeCheck(Node* node, SpeculatedType typesPassedThrough) argument 61 return !forNode(node).isType(typesPassedThrough); 66 return needsTypeCheck(edge.node(), typesPassedThrough); 74 // Abstractly executes the given node. The new abstract state is stored into an 78 // if execution should continue past this node. Notably, it will return true 91 // Indicate the start of execution of the node. It resets any state in the node, 106 filterEdgeByUse(Node* node, Edge& edge) argument 120 filter(T node, const StructureSet& set) argument 126 filterArrayModes(T node, ArrayModes arrayModes) argument 132 filter(T node, SpeculatedType type) argument 138 filterByValue(T node, JSValue value) argument 160 setBuiltInConstant(Node* node, JSValue value) argument 167 setConstant(Node* node, JSValue value) argument 173 filterByType(Node* node, Edge& edge, SpeculatedType type) argument [all...] |
H A D | DFGGraph.h | 96 if (edge.node() != oldNode) 108 void performSubstitution(Node* node) argument 110 if (node->flags() & NodeHasVarArgs) { 111 for (unsigned childIdx = node->firstChild(); childIdx < node->firstChild() + node->numChildren(); childIdx++) 114 performSubstitutionForEdge(node->child1()); 115 performSubstitutionForEdge(node->child2()); 116 performSubstitutionForEdge(node->child3()); 141 Node* node local 148 convertToConstant(Node* node, unsigned constantNumber) argument 173 convertToConstant(Node* node, JSValue value) argument 194 getJSConstantSpeculation(Node* node) argument 315 isConstant(Node* node) argument 319 isJSConstant(Node* node) argument 323 isInt32Constant(Node* node) argument 327 isDoubleConstant(Node* node) argument 331 isNumberConstant(Node* node) argument 335 isMachineIntConstant(Node* node) argument 339 isBooleanConstant(Node* node) argument 343 isCellConstant(Node* node) argument 350 isFunctionConstant(Node* node) argument 358 isInternalFunctionConstant(Node* node) argument 371 valueOfJSConstant(Node* node) argument 375 valueOfInt32Constant(Node* node) argument 385 valueOfNumberConstant(Node* node) argument 389 valueOfBooleanConstant(Node* node) argument 393 valueOfFunctionConstant(Node* node) argument 479 hasExitSite(Node* node, ExitKind exitKind) argument 550 valueProfileFor(Node* node) argument 577 methodOfGettingAValueProfileFor(Node* node) argument 623 isPredictedNumerical(Node* node) argument 634 byValIsPure(Node* node) argument 659 clobbersWorld(Node* node) argument 694 varArgNumChildren(Node* node) argument 700 numChildren(Node* node) argument 707 varArgChild(Node* node, unsigned index) argument 713 child(Node* node, unsigned index) argument 720 voteNode(Node* node, unsigned ballot, float weight = 1) argument 740 voteChildren(Node* node, unsigned ballot, float weight = 1) argument 767 Node* node = block[indexInBlock]; local [all...] |
/macosx-10.10/apr-32/apr-util/apr-util/buckets/ |
H A D | apr_buckets_alloc.c | 127 node_header_t *node; local 134 node = list->freelist; 135 list->freelist = node->next; 149 node = (node_header_t *)active->first_avail; 150 node->alloc = list; 151 node->memnode = active; 152 node->size = SMALL_NODE_SIZE; 161 node = (node_header_t *)memnode->first_avail; 162 node->alloc = list; 163 node 173 check_not_already_free(node_header_t *node) argument 191 node_header_t *node = (node_header_t *)((char *)mem - SIZEOF_NODE_HEADER_T); local [all...] |
/macosx-10.10/libauto-186/ |
H A D | FreeList.h | 46 FreeListNode *_prev; // previous node or NULL for head 47 FreeListNode *_next; // next node or NULL for tail 55 static FreeListNode *flip(FreeListNode *node) { return (FreeListNode *)(uintptr_t(node) ^ all_ones); } argument 70 // reconstruct a free list node in place 102 // if the node is NULL. 144 // Returns the address range of this node that can be safely passed to uncommit_memory(). 180 // Pop the first node from the list. 183 // get first node 184 FreeListNode *node local 208 FreeListNode *node = new(address) FreeListNode(NULL, _head, size); local 225 append(FreeListNode *node) argument 241 remove(FreeListNode *node) argument 275 FreeListNode *node = new(address) FreeListNode(prevNode, nextNode, size); local [all...] |
/macosx-10.10/ruby-106/ruby/lib/rexml/light/ |
H A D | node.rb | 20 def initialize node=nil 21 @node = node 22 if node.kind_of? String 23 node = [ :text, node ] 24 elsif node.nil? 25 node = [ :document, nil, nil ] 26 elsif node[0] == :start_element 27 node[ [all...] |
/macosx-10.10/libxml2-26/libxml2/ |
H A D | debugXML.c | 46 xmlNodePtr node; /* current node */ member in struct:_xmlDebugCtxt 54 static void xmlCtxtDumpNodeList(xmlDebugCtxtPtr ctxt, xmlNodePtr node); 66 ctxt->node = NULL; 83 * @node: the node 84 * @ns: the namespace node 86 * Check that a given namespace is in scope on a node. 90 * an ancestor node. 93 xmlNsCheckScope(xmlNodePtr node, xmlNsPt argument 197 xmlCtxtNsCheckScope(xmlDebugCtxtPtr ctxt, xmlNodePtr node, xmlNsPtr ns) argument 273 xmlCtxtGenericNodeCheck(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 877 xmlCtxtDumpOneNode(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 1060 xmlCtxtDumpNode(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 1087 xmlCtxtDumpNodeList(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 1437 xmlDebugDumpOneNode(FILE * output, xmlNodePtr node, int depth) argument 1458 xmlDebugDumpNode(FILE * output, xmlNodePtr node, int depth) argument 1480 xmlDebugDumpNodeList(FILE * output, xmlNodePtr node, int depth) argument 1602 xmlLsCountNode(xmlNodePtr node) argument 1659 xmlLsOneNode(FILE *output, xmlNodePtr node) argument 1888 xmlShellPrintNodeCtxt(xmlShellCtxtPtr ctxt,xmlNodePtr node) argument 1916 xmlShellPrintNode(xmlNodePtr node) argument 2002 xmlShellList(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2045 xmlShellBase(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2082 xmlShellSetBase(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2195 xmlShellGrep(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *arg, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2273 xmlShellDir(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2307 xmlShellSetContent(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *value, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2409 xmlShellCat(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2510 xmlShellWrite(xmlShellCtxtPtr ctxt, char *filename, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2685 xmlNodePtr node; local 2766 xmlShellPwd(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *buffer, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument [all...] |
/macosx-10.10/WebCore-7600.1.25/dom/ |
H A D | ElementTraversal.h | 36 // First or last ElementType child of the node. 42 // First or last ElementType descendant of the node. For Elements firstWithin is always the same as first child. 93 // Utility function to traverse only the element and pseudo-element siblings of a node. 109 Node* node = NodeTraversal::last(current); local 110 while (node && !node->isElementNode()) 111 node = NodeTraversal::previous(node, current); 112 return toElement(node); 119 Node* node local 129 Node* node = NodeTraversal::next(current, stayWithin); local 139 Node* node = NodeTraversal::previous(current); local 149 Node* node = NodeTraversal::previous(current, stayWithin); local 160 Node* node = current->firstChild(); local 170 Node* node = current->lastChild(); local 240 Node* node = current->nextSibling(); local 250 Node* node = current->previousSibling(); local 260 Node* node = NodeTraversal::nextSkippingChildren(current); local 270 Node* node = NodeTraversal::nextSkippingChildren(current, stayWithin); local 336 Node* node = NodeTraversal::previousIncludingPseudo(current, stayWithin); local 344 Node* node = NodeTraversal::nextIncludingPseudo(current, stayWithin); local 352 Node* node = NodeTraversal::nextIncludingPseudoSkippingChildren(current, stayWithin); local 360 Node* node = current->pseudoAwarePreviousSibling(); local [all...] |
H A D | ContainerNodeAlgorithms.h | 139 static void dispatch(GenericNode& node, GenericNodeContainer& container) argument 143 containerDocument->adoptIfNeeded(&node); 144 if (node.inDocument()) 145 ChildNodeRemovalNotifier(container).notify(node); 178 // Add the node to the list of nodes to be deleted. 187 Ref<GenericNode> protect(*n); // removedFromDocument may remove remove all references to this node. 197 inline void ChildNodeInsertionNotifier::notifyNodeInsertedIntoDocument(Node& node) argument 200 if (Node::InsertionShouldCallDidNotifySubtreeInsertions == node.insertedInto(m_insertionPoint)) 201 m_postInsertionNotificationTargets.append(node); 202 if (node 206 notifyNodeInsertedIntoTree(ContainerNode& node) argument 216 notify(Node& node) argument 237 notifyNodeRemovedFromDocument(Node& node) argument 246 notifyNodeRemovedFromTree(ContainerNode& node) argument 255 notify(Node& node) argument [all...] |
/macosx-10.10/Libc-1044.1.2/regex/TRE/lib/ |
H A D | tre-ast.c | 20 tre_ast_node_t *node; local 22 node = tre_mem_calloc(mem, sizeof(*node)); 23 if (!node) 25 node->obj = tre_mem_calloc(mem, size); 26 if (!node->obj) 28 node->type = type; 29 node->nullable = -1; 30 node->submatch_id = -1; 32 return node; 38 tre_ast_node_t *node; local 56 tre_ast_node_t *node; local 75 tre_ast_node_t *node; local 91 tre_ast_node_t *node; local [all...] |
/macosx-10.10/shell_cmds-179/find/ |
H A D | operator.c | 60 PLAN *node; /* top node removed from the plan */ local 62 if ((node = (*planp)) == NULL) 65 node->next = NULL; 66 return (node); 73 * simple node or a f_expr node containing a list of simple nodes. 78 PLAN *next; /* temp node holding subexpression results */ 79 PLAN *node; /* pointer to returned node o local 168 PLAN *node; /* temporary node used in f_not processing */ local [all...] |
/macosx-10.10/tcl-105/tcl_ext/tclsoap/tclsoap/ |
H A D | xpath.tcl | 31 # Given Envelope/Body/Fault and a DOM node, see if we can find a matching 43 -node 0 51 -nod* { set opts(-node) 1 } 65 # split the path up and call find_node to get the new node or nodes. 69 if { $opts(-node) } { 75 foreach node $root { 76 append value [array get [dom::node cget $node -attributes]] 82 foreach node $root { 83 lappend value [dom::node cge [all...] |
/macosx-10.10/tidy-15.15/tidy/src/ |
H A D | istack.c | 39 static Bool IsNodePushable( Node *node ) 41 if (node->tag == NULL) 44 if (!(node->tag->model & CM_INLINE)) 47 if (node->tag->model & CM_OBJECT) 54 push a copy of an inline node onto stack 69 void TY_(PushInline)( TidyDocImpl* doc, Node *node ) 74 if (node->implicit) 77 if ( !IsNodePushable(node) ) 80 if ( !nodeIsFONT(node) && TY_(IsPushed)(doc, node) ) 239 Node *node; local [all...] |
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/ |
H A D | debugXML.c | 46 xmlNodePtr node; /* current node */ member in struct:_xmlDebugCtxt 54 static void xmlCtxtDumpNodeList(xmlDebugCtxtPtr ctxt, xmlNodePtr node); 66 ctxt->node = NULL; 83 * @node: the node 84 * @ns: the namespace node 86 * Check that a given namespace is in scope on a node. 90 * an ancestor node. 93 xmlNsCheckScope(xmlNodePtr node, xmlNsPt argument 197 xmlCtxtNsCheckScope(xmlDebugCtxtPtr ctxt, xmlNodePtr node, xmlNsPtr ns) argument 273 xmlCtxtGenericNodeCheck(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 878 xmlCtxtDumpOneNode(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 1061 xmlCtxtDumpNode(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 1088 xmlCtxtDumpNodeList(xmlDebugCtxtPtr ctxt, xmlNodePtr node) argument 1438 xmlDebugDumpOneNode(FILE * output, xmlNodePtr node, int depth) argument 1459 xmlDebugDumpNode(FILE * output, xmlNodePtr node, int depth) argument 1481 xmlDebugDumpNodeList(FILE * output, xmlNodePtr node, int depth) argument 1603 xmlLsCountNode(xmlNodePtr node) argument 1660 xmlLsOneNode(FILE *output, xmlNodePtr node) argument 1886 xmlShellPrintNodeCtxt(xmlShellCtxtPtr ctxt,xmlNodePtr node) argument 1914 xmlShellPrintNode(xmlNodePtr node) argument 2000 xmlShellList(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2043 xmlShellBase(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2080 xmlShellSetBase(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2193 xmlShellGrep(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *arg, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2271 xmlShellDir(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2305 xmlShellSetContent(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *value, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2407 xmlShellCat(xmlShellCtxtPtr ctxt, char *arg ATTRIBUTE_UNUSED, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2508 xmlShellWrite(xmlShellCtxtPtr ctxt, char *filename, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument 2683 xmlNodePtr node; local 2762 xmlShellPwd(xmlShellCtxtPtr ctxt ATTRIBUTE_UNUSED, char *buffer, xmlNodePtr node, xmlNodePtr node2 ATTRIBUTE_UNUSED) argument [all...] |
/macosx-10.10/WebKit2-7600.1.25/Shared/Scrolling/ |
H A D | RemoteScrollingCoordinatorTransaction.cpp | 85 void ArgumentCoder<ScrollingStateNode>::encode(ArgumentEncoder& encoder, const ScrollingStateNode& node) argument 87 encoder.encodeEnum(node.nodeType()); 88 encoder << node.scrollingNodeID(); 89 encoder << node.parentNodeID(); 90 encoder << node.changedProperties(); 92 if (node.hasChangedProperty(ScrollingStateNode::ScrollLayer)) 93 encoder << static_cast<GraphicsLayer::PlatformLayerID>(node.layer()); 96 bool ArgumentCoder<ScrollingStateNode>::decode(ArgumentDecoder& decoder, ScrollingStateNode& node) argument 98 // nodeType, scrollingNodeID and parentNodeID have already been decoded by the caller in order to create the node. 103 node 122 encode(ArgumentEncoder& encoder, const ScrollingStateScrollingNode& node) argument 136 encode(ArgumentEncoder& encoder, const ScrollingStateFrameScrollingNode& node) argument 162 encode(ArgumentEncoder& encoder, const ScrollingStateOverflowScrollingNode& node) argument 186 decode(ArgumentDecoder& decoder, ScrollingStateScrollingNode& node) argument 213 decode(ArgumentDecoder& decoder, ScrollingStateFrameScrollingNode& node) argument 259 decode(ArgumentDecoder& decoder, ScrollingStateOverflowScrollingNode& node) argument 274 encode(ArgumentEncoder& encoder, const ScrollingStateFixedNode& node) argument 282 decode(ArgumentDecoder& decoder, ScrollingStateFixedNode& node) argument 297 encode(ArgumentEncoder& encoder, const ScrollingStateStickyNode& node) argument 305 decode(ArgumentDecoder& decoder, ScrollingStateStickyNode& node) argument 538 dump(const ScrollingStateNode& node, bool changedPropertiesOnly) argument 565 dump(const ScrollingStateScrollingNode& node, bool changedPropertiesOnly) argument 590 dump(const ScrollingStateFrameScrollingNode& node, bool changedPropertiesOnly) argument 648 dump(const ScrollingStateOverflowScrollingNode& node, bool changedPropertiesOnly) argument 658 dump(const ScrollingStateFixedNode& node, bool changedPropertiesOnly) argument 666 dump(const ScrollingStateStickyNode& node, bool changedPropertiesOnly) argument 674 recursiveDumpNodes(const ScrollingStateNode& node, bool changedPropertiesOnly) argument [all...] |
/macosx-10.10/ruby-106/ruby/ext/tk/sample/tkextlib/bwidget/ |
H A D | tree.rb | 37 :opencmd=>proc{|node| 38 moddir(1, tree, node) 40 :closecmd=>proc{|node| 41 moddir(0, tree, node) 79 proc{|node, ev| select('tree', 1, tree, list, node)}) 81 proc{|node, ev| select('tree', 2, tree, list, node)}) 84 proc{|node, ev| select('list', 1, tree, list, node)}) [all...] |
/macosx-10.10/OpenSSL098-52/src/crypto/lhash/ |
H A D | num.pl | 3 #node 10 -> 4 7 next unless /^node/;
|
/macosx-10.10/Security-57031.1.35/Security/libsecurity_codesigning/antlr2/antlr/ |
H A D | ASTArray.hpp | 34 ASTArray* add(RefAST node) argument 36 array[size++] = node;
|
/macosx-10.10/WebCore-7600.1.25/editing/ |
H A D | SplitTextNodeContainingElementCommand.h | 35 static PassRefPtr<SplitTextNodeContainingElementCommand> create(PassRefPtr<Text> node, int offset) argument 37 return adoptRef(new SplitTextNodeContainingElementCommand(node, offset));
|
/macosx-10.10/WebCore-7600.1.25/xml/ |
H A D | NativeXPathNSResolver.cpp | 35 NativeXPathNSResolver::NativeXPathNSResolver(PassRefPtr<Node> node) argument 36 : m_node(node)
|
H A D | XMLSerializer.idl | 25 [RaisesException] DOMString serializeToString([Default=Undefined] optional Node node);
|
/macosx-10.10/ruby-106/ruby/lib/rexml/ |
H A D | xpath_parser.rb | 95 def first( path_stack, node ) 102 return first( path[1..-1], node ) 104 for c in node.children 113 if node.name == name 115 return node if path.size == 3 116 return first( path[3..-1], node ) 121 r = first( path[1..-1], node ) 123 for c in node.children 127 when :node 128 return first( path[1..-1], node ) [all...] |