/macosx-10.10/JavaScriptCore-7600.1.17/offlineasm/ |
H A D | sh4.rb | 269 | node | 270 if node.is_a? Instruction 271 case node.opcode 273 if node.opcode[0, 1] == "u" 275 direction = node.opcode[1, 1] 278 direction = node.opcode[0, 1] 280 if node.operands[0].is_a? Immediate 281 maskedImm = Immediate.new(node.operands[0].codeOrigin, node.operands[0].value & 31) 285 newList << Instruction.new(node [all...] |
/macosx-10.10/WebCore-7600.1.25/accessibility/ |
H A D | AccessibilityList.cpp | 67 Node* node = m_renderer->node(); 75 return node && node->hasTagName(ulTag); 87 Node* node = m_renderer->node(); 88 return node && node->hasTagName(olTag); 96 Node* node = m_renderer->node(); [all...] |
H A D | AccessibilityNodeObject.cpp | 91 AccessibilityNodeObject::AccessibilityNodeObject(Node* node) argument 99 , m_node(node) 117 PassRefPtr<AccessibilityNodeObject> AccessibilityNodeObject::create(Node* node) argument 119 return adoptRef(new AccessibilityNodeObject(node)); 132 if (!node() && !renderer()) 172 if (!node()) 175 Node* firstChild = node()->firstChild(); 185 if (!node()) 188 Node* lastChild = node()->lastChild(); 197 if (!node()) 264 setNode(Node* node) argument 446 Node* node = this->node(); local 468 Node* node = this->node(); local 485 Node* node = this->node(); local 515 Node* node = this->node(); local 540 Node* node = this->node(); local 556 Node* node = this->node(); local 622 Node* node = this->node(); local 656 Node* node = this->node(); local 690 Node* node = this->node(); local 721 Node* node = this->node(); local 741 Node* node = this->node(); local 803 Node* node = this->node(); local 901 Node* node = this->node(); local 911 Node* node = this->node(); local 962 Node* node = this->node(); local 978 isNodeActionElement(Node* node) argument 1011 Node* node = this->node(); local 1046 Node* node = this->node(); local 1192 siblingWithAriaRole(String role, Node* node) argument 1254 Node* node = this->node(); local 1308 Node* node = this->node(); local 1331 Node* node = this->node(); local 1530 Node* node = this->node(); local 1570 Node* node = this->node(); local 1651 Node* node = this->node(); local 1690 Node* node = this->node(); local 1773 Node* node = this->node(); local 1837 accessibleNameForNode(Node* node) argument 1924 Node* node = this->node(); local [all...] |
H A D | AccessibilitySearchFieldButtons.cpp | 60 Node* node = this->node(); local 61 if (!node || !node->isElementNode()) 64 Element* element = toElement(node);
|
/macosx-10.10/WebCore-7600.1.25/bindings/gobject/ |
H A D | GObjectNodeFilterCondition.cpp | 29 g_object_set_data(G_OBJECT(m_filter.get()), "webkit-core-node-filter", nullptr); 32 short GObjectNodeFilterCondition::acceptNode(JSC::ExecState*, Node* node) const 34 if (!node) 36 return webkit_dom_node_filter_accept_node(m_filter.get(), WebKit::kit(node));
|
H A D | WebKitDOMPrivate.cpp | 80 WebKitDOMNode* wrap(Node* node) argument 82 ASSERT(node); 83 ASSERT(node->nodeType()); 85 switch (node->nodeType()) { 87 if (node->isHTMLElement()) 88 return WEBKIT_DOM_NODE(wrap(toHTMLElement(node))); 89 return WEBKIT_DOM_NODE(wrapElement(toElement(node))); 91 return WEBKIT_DOM_NODE(wrapAttr(static_cast<Attr*>(node))); 93 return WEBKIT_DOM_NODE(wrapText(toText(node))); 95 return WEBKIT_DOM_NODE(wrapCDATASection(static_cast<CDATASection*>(node))); [all...] |
/macosx-10.10/WebCore-7600.1.25/xml/ |
H A D | XMLSerializer.cpp | 30 String XMLSerializer::serializeToString(Node* node, ExceptionCode& ec) argument 32 if (!node) { 36 return createMarkup(*node, IncludeNode, 0, DoNotResolveURLs, 0, XMLFragmentSerialization);
|
/macosx-10.10/libxml2-26/libxml2/python/tests/ |
H A D | nsdel.py | 12 def namespaceDefs(node): 13 n = node.nsDefs() 18 def checkNamespaceDefs(node, count): 19 nsList = list(namespaceDefs(node)) 29 node = doc.getRootElement() variable 30 checkNamespaceDefs(node, 3) 31 ns = node.removeNsDef('urn:bar') 32 checkNamespaceDefs(node, 2) 38 node = doc.getRootElement() variable 39 checkNamespaceDefs(node, [all...] |
/macosx-10.10/libxslt-13/libxslt/tests/exslt/common/ |
H A D | Makefile.am | 7 node-set.1.xml node-set.1.xsl node-set.1.out \ 8 node-set.2.xml node-set.2.xsl node-set.2.out \ 9 node-set.3.xml node-set.3.xsl node-set.3.out \ 10 node [all...] |
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/python/tests/ |
H A D | nsdel.py | 12 def namespaceDefs(node): 13 n = node.nsDefs() 18 def checkNamespaceDefs(node, count): 19 nsList = list(namespaceDefs(node)) 29 node = doc.getRootElement() variable 30 checkNamespaceDefs(node, 3) 31 ns = node.removeNsDef('urn:bar') 32 checkNamespaceDefs(node, 2) 38 node = doc.getRootElement() variable 39 checkNamespaceDefs(node, [all...] |
/macosx-10.10/WebCore-7600.1.25/platform/graphics/texmap/coordinated/ |
H A D | AreaAllocator.cpp | 90 void GeneralAreaAllocator::freeNode(Node* node) argument 92 if (node) { 93 freeNode(node->left); 94 freeNode(node->right); 96 delete node; 174 IntPoint GeneralAreaAllocator::allocateFromNode(const IntSize& size, Node* node) argument 176 // Find the best node to insert into, which should be 177 // a node with the least amount of unused space that is 179 while (node) { 182 Node* left = node 242 splitNode(Node* node, Split split) argument 275 updateLargestFree(Node* node) argument 288 Node* node = m_root; local [all...] |
/macosx-10.10/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGSSAConversionPhase.cpp | 94 // figure out what node we should be referring to instead of that local. 112 Node* node = block->variablesAtHead[i]; local 113 if (!node) 117 dataLog("At block #", blockIndex, " for operand r", block->variablesAtHead.operandForIndex(i), " have node ", node, "\n"); 119 VariableAccessData* variable = node->variableAccessData(); 128 switch (node->op()) { 135 node = node->child1().node(); 261 Node* node = block->variablesAtHead[i]; local 311 Node* node = block->at(nodeIndex); local 411 forwardPhiChildren(Node* node) argument 421 forwardPhi(Node* node) argument 453 deduplicateChildren(Node* node) argument [all...] |
H A D | DFGArgumentsSimplificationPhase.cpp | 146 Node* node = block->at(indexInBlock); local 147 switch (node->op()) { 151 m_isLive.add(node->variableAccessData()); 168 Node* node = block->at(indexInBlock); local 169 switch (node->op()) { 189 Node* source = node->child1().node(); 190 VariableAccessData* variableAccessData = node->variableAccessData(); 192 m_graph.uncheckedArgumentsRegisterFor(node->origin.semantic); 222 m_createsArguments.add(node 359 Node* node = block->at(indexInBlock); local 388 Node* node = block->at(indexInBlock); local 590 Node* node = block->at(indexInBlock); local 614 Node* node = block->at(indexInBlock); local 647 observeBadArgumentsUse(Node* node) argument 682 observeBadArgumentsUses(Node* node) argument 688 observeProperArgumentsUse(Node* node, Edge edge) argument 761 detypeArgumentsReferencingPhantomChild(Node* node, unsigned edgeIndex) argument [all...] |
H A D | DFGValidate.cpp | 93 m_myRefCounts.add(block->node(i), 0); 100 Node* node = block->node(i); local 101 m_acceptableNodes.add(node); 102 if (!node->shouldGenerate()) 104 if (node->op() == Upsilon) { 105 VALIDATE((node), m_graph.m_form == SSA); 106 if (node->phi()->shouldGenerate()) 107 m_myRefCounts.find(node)->value++; 109 for (unsigned j = 0; j < m_graph.numChildren(node); 185 Node* node = block->node(i); local 193 Node* node = block->at(i); local 198 Node* node = block->at(i); local 243 Node* node = block->node(i); local 256 Node* node = block->phis[i]; local 354 Node* node = block->at(i); local 438 Node* node = block->at(nodeIndex); local 469 reportValidationContext(Node* node) argument 479 reportValidationContext(Node* node, Edge edge) argument 506 reportValidationContext(Node* node, BasicBlock* block) argument 511 reportValidationContext(Node* node, Node* node2, BasicBlock* block) argument 516 reportValidationContext( Node* node, BasicBlock* block, Node* expectedNode, Edge incomingEdge) argument [all...] |
/macosx-10.10/JavaScriptCore-7600.1.17/ftl/ |
H A D | FTLCapabilities.cpp | 40 inline CapabilityLevel canCompile(Node* node) argument 45 switch (node->op()) { 169 if (node->child1().useKind() == CellUse) 173 if (node->arrayMode().type() == Array::String) 175 if (isTypedView(node->arrayMode().typedArrayType())) 179 switch (node->arrayMode().type()) { 185 if (isTypedView(node->arrayMode().typedArrayType())) 191 switch (node->arrayMode().type()) { 198 if (isTypedView(node->arrayMode().typedArrayType())) 204 switch (node 353 Node* node = block->at(nodeIndex); local 390 graph.dump(WTF::dataFile(), " ", node); local 400 graph.dump(WTF::dataFile(), " ", node); local 407 graph.dump(WTF::dataFile(), " ", node); local [all...] |
/macosx-10.10/JavaScriptCore-7600.1.17/API/tests/ |
H A D | minidom.js | 47 node = new Node(); 48 print("node is " + node); 49 for (var p in node) 50 print(p + ": " + node[p]); 56 node.appendChild(child1); 57 node.appendChild(child2); 59 var childNodes = node.childNodes; 69 node.removeChild(child1); 70 node [all...] |
/macosx-10.10/WebCore-7600.1.25/html/ |
H A D | HTMLFrameOwnerElement.cpp | 60 for (ContainerNode* node = this; node; node = node->parentOrShadowHostNode()) 61 node->incrementConnectedSubframeCount(); 71 for (ContainerNode* node = this; node; node = node->parentOrShadowHostNode()) 72 node [all...] |
/macosx-10.10/WebCore-7600.1.25/editing/ |
H A D | htmlediting.cpp | 62 // Atomic means that the node has no children, or has children which are ignored for the 64 bool isAtomicNode(const Node *node) argument 66 return node && (!node->hasChildNodes() || editingIgnoresContent(node)); 107 Node* node = position.deprecatedNode(); local 108 if (!node) 115 node = highestEditableRoot; 116 while (!node->hasTagName(bodyTag)) { 117 node 127 lowestEditableAncestor(Node* node) argument 145 Node* node = p.deprecatedNode(); local 161 Node* node = pos.deprecatedNode(); local 168 Node* node = p.deprecatedNode(); local 180 Node* node = p.containerNode(); local 302 isBlock(const Node* node) argument 307 isInline(const Node* node) argument 316 enclosingBlock(Node* node, EditingBoundaryCrossingRule rule) argument 337 lastOffsetForEditing(const Node* node) argument 379 isTableStructureNode(const Node *node) argument 513 visiblePositionBeforeNode(Node* node) argument 524 visiblePositionAfterNode(Node* node) argument 602 hasARenderedDescendant(Node* node, Node* excludedNode) argument 616 highestNodeToRemoveInPruning(Node* node) argument 647 enclosingList(Node* node) argument 664 enclosingListChild(Node *node) argument 727 outermostEnclosingList(Node* node, Node* rootList) argument 754 highestAncestor(Node* node) argument 763 previousNodeConsideringAtomicNodes(const Node* node) argument 776 nextNodeConsideringAtomicNodes(const Node* node) argument 790 previousLeafNode(const Node* node) argument 801 nextLeafNode(const Node* node) argument 822 isTableCell(const Node* node) argument 831 isEmptyTableCell(const Node* node) argument 907 isTabSpanNode(const Node *node) argument 912 isTabSpanTextNode(const Node *node) argument 917 tabSpanNode(const Node *node) argument 924 Node* node = pos.containerNode(); local 964 isNodeRendered(const Node* node) argument 986 updatePositionForNodeRemoval(Position& position, Node* node) argument 1016 isMailBlockquote(const Node *node) argument 1119 indexForVisiblePosition(Node* node, const VisiblePosition& visiblePosition, bool forSelectionPreservation) argument 1136 visiblePositionForIndexUsingCharacterIterator(Node* node, int index) argument 1158 isNodeVisiblyContainedWithin(Node* node, const Range* selectedRange) argument 1177 isRenderedAsNonInlineTableImageOrHR(const Node* node) argument 1198 isNonTableCellHTMLBlockElement(const Node* node) argument 1243 isBlockFlowElement(const Node* node) argument 1251 deprecatedEnclosingBlockFlowElement(Node* node) argument 1264 caretRendersInsideNode(Node* node) argument 1269 rendererForCaretPainting(Node* node) argument [all...] |
/macosx-10.10/ruby-106/ruby/lib/xmlrpc/ |
H A D | parser.rb | 15 def removeChild(node) 16 @children.delete(node) 204 def removeWhitespacesAndComments(node) 206 childs = node.childNodes.to_a 211 unless %w(i4 i8 int boolean string double dateTime.iso8601 base64).include? node.nodeName 213 if node.nodeName == "value" 214 if not node.childNodes.to_a.detect {|n| _nodeType(n) == :ELEMENT}.nil? 228 remove.each { |i| node.removeChild(i) } 232 def nodeMustBe(node, name) 235 name.include?(node [all...] |
/macosx-10.10/tidy-15.15/tidy/src/ |
H A D | access.c | 150 static void CheckMapAccess( TidyDocImpl* doc, Node* node, Node* front); 151 static void GetMapLinks( TidyDocImpl* doc, Node* node, Node* front); 153 static void FindMissingLinks( TidyDocImpl* doc, Node* node, int counter); 155 static void CheckFormControls( TidyDocImpl* doc, Node* node ); 156 static void MetaDataPresent( TidyDocImpl* doc, Node* node ); 157 static void CheckEmbed( TidyDocImpl* doc, Node* node ); 158 static void CheckListUsage( TidyDocImpl* doc, Node* node ); 365 * text node. 368 static ctmbstr textFromOneNode( TidyDocImpl* doc, Node* node ) 374 if ( node ) 2746 CheckMetaData( TidyDocImpl* doc, Node* node, Bool HasMetaData ) argument 2892 FindLinkA( TidyDocImpl* doc, Node* node, ctmbstr url ) argument [all...] |
H A D | parser.h | 19 Bool TY_(CheckNodeIntegrity)(Node *node); 27 Bool TY_(IsNewNode)(Node *node); 29 void TY_(CoerceNode)(TidyDocImpl* doc, Node *node, TidyTagId tid, Bool obsolete, Bool expected); 31 /* extract a node and its children from a markup tree */ 32 Node *TY_(RemoveNode)(Node *node); 34 /* remove node from markup tree and discard it */ 37 /* insert node into markup tree as the firt element 39 void TY_(InsertNodeAtStart)(Node *element, Node *node); 41 /* insert node into markup tree as the last element 43 void TY_(InsertNodeAtEnd)(Node *element, Node *node); [all...] |
/macosx-10.10/OpenSSL098-52/src/crypto/x509v3/ |
H A D | pcy_lib.c | 135 const ASN1_OBJECT *X509_policy_node_get0_policy(const X509_POLICY_NODE *node) argument 137 if (!node) 139 return node->data->valid_policy; 143 int X509_policy_node_get_critical(const X509_POLICY_NODE *node) 145 if (node_critical(node)) 152 X509_policy_node_get0_qualifiers(const X509_POLICY_NODE *node) 154 if (!node) 156 return node->data->qualifier_set; 160 X509_policy_node_get0_parent(const X509_POLICY_NODE *node) argument 162 if (!node) [all...] |
/macosx-10.10/ruby-106/ruby/lib/rexml/formatters/ |
H A D | transitive.rb | 22 def write_element( node, output ) 23 output << "<#{node.expanded_name}" 25 node.attributes.each_attribute do |attr| 28 end unless node.attributes.empty? 32 if node.children.empty? 41 node.children.each { |child| 45 output << "</#{node.expanded_name}" 52 def write_text( node, output ) 53 output << node.to_s()
|
/macosx-10.10/xnu-2782.1.97/bsd/hfs/hfscommon/BTree/ |
H A D | BTreeNodeOps.c | 31 Contains: Single-node operations for the BTree Module. 62 macro. Only call CheckNode if the node came from disk. 67 <HFS3> 2/19/97 djb Changes to support big node cache. 76 that CheckNode failed if the node is all zeroes. This can happen 77 if the hint case if the fetched node has been deallocated 85 <16> 1/31/95 prp GetBlockProc interface uses a 64 bit node number. 95 <8> 5/21/93 gs Maintain statistical counters on Get/Release node routines. 115 // GetNode - Call FS Agent to get node 116 // GetNewNode - Call FS Agent to get a new node 117 // ReleaseNode - Call FS Agent to release node obtaine 263 NodeDescPtr node; local 435 PrintNode(const NodeDescPtr node, u_int16_t nodeSize, u_int32_t nodeNumber) argument 490 InsertRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, RecordPtr recPtr, u_int16_t recSize ) argument 560 InsertKeyRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, KeyPtr keyPtr, u_int16_t keyLength, RecordPtr recPtr, u_int16_t recSize ) argument 665 DeleteRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument 718 SearchNode( BTreeControlBlockPtr btreePtr, NodeDescPtr node, KeyPtr searchKey, u_int16_t *returnIndex ) argument 776 GetRecordByIndex(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, KeyPtr *keyPtr, u_int8_t * *dataPtr, u_int16_t *dataSize ) argument 933 GetRecordSize(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument 958 GetOffsetAddress(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument 1015 InsertOffset(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index, u_int16_t delta ) argument 1049 DeleteOffset(BTreeControlBlockPtr btreePtr, NodeDescPtr node, u_int16_t index ) argument [all...] |
/macosx-10.10/cxxfilt-11/cxxfilt/libiberty/ |
H A D | fibheap.c | 63 /* Create a new fibonacci heap node. */ 67 fibnode_t node; 69 node = (fibnode_t) xcalloc (1, sizeof *node); 70 node->left = node; 71 node->right = node; 73 return node; 101 fibnode_t node; 66 fibnode_t node; local 100 fibnode_t node; local 198 fibheap_replace_key_data(fibheap_t heap, fibnode_t node, fibheapkey_t key, void *data) argument 237 fibheap_replace_data(fibheap_t heap, fibnode_t node, void *data) argument 244 fibheap_replace_key(fibheap_t heap, fibnode_t node, fibheapkey_t key) argument 253 fibheap_delete_node(fibheap_t heap, fibnode_t node) argument 319 fibheap_ins_root(fibheap_t heap, fibnode_t node) argument 338 fibheap_rem_root(fibheap_t heap, fibnode_t node) argument 395 fibheap_link(fibheap_t heap ATTRIBUTE_UNUSED, fibnode_t node, fibnode_t parent) argument 409 fibheap_cut(fibheap_t heap, fibnode_t node, fibnode_t parent) argument 458 fibnode_remove(fibnode_t node) argument [all...] |