/macosx-10.9.5/JavaScriptCore-7537.78.1/dfg/ |
H A D | DFGMinifiedNode.cpp | 35 MinifiedNode MinifiedNode::fromNode(Node* node) argument 37 ASSERT(belongsInMinifiedGraph(node->op())); 39 result.m_id = MinifiedID(node); 40 result.m_op = node->op(); 41 if (hasChild(node->op())) 42 result.m_childOrInfo = MinifiedID(node->child1().node()).m_id; 43 else if (hasConstantNumber(node->op())) 44 result.m_childOrInfo = node->constantNumber(); 45 else if (hasWeakConstant(node [all...] |
H A D | DFGBackwardsPropagationPhase.cpp | 64 bool isNotNegZero(Node* node) 66 if (!m_graph.isNumberConstant(node)) 68 double value = m_graph.valueOfNumberConstant(node); 72 bool isNotPosZero(Node* node) argument 74 if (!m_graph.isNumberConstant(node)) 76 double value = m_graph.valueOfNumberConstant(node); 82 bool isWithinPowerOfTwoForConstant(Node* node) argument 84 JSValue immediateValue = node->valueOfJSConstant(codeBlock()); 92 bool isWithinPowerOfTwoNonRecursive(Node* node) argument 94 if (node 100 isWithinPowerOfTwo(Node* node) argument 147 mergeDefaultFlags(Node* node) argument 171 propagate(Node* node) argument [all...] |
H A D | DFGFixupPhase.cpp | 84 void fixupNode(Node* node) argument 86 NodeType op = node->op(); 89 dataLogF(" %s @%u: ", Graph::opName(op), node->index()); 105 fixIntEdge(node->child1()); 106 fixIntEdge(node->child2()); 111 setUseKindAndUnboxIfProfitable<KnownInt32Use>(node->child1()); 121 if (node->child1()->shouldSpeculateInteger()) { 122 setUseKindAndUnboxIfProfitable<Int32Use>(node->child1()); 123 node->setOpAndDefaultFlags(Identity); 127 if (node 895 createToString(Node* node, Edge& edge) argument 903 attemptToForceStringArrayModeByToStringConversion(ArrayMode& arrayMode, Node* node) argument 927 convertStringAddUse(Node* node, Edge& edge) argument 947 convertToMakeRope(Node* node) argument 953 fixupMakeRope(Node* node) argument 979 fixupToPrimitive(Node* node) argument 1008 fixupToString(Node* node) argument 1035 attemptToMakeFastStringAdd(Node* node, Edge& left, Edge& right) argument 1143 Node* node = m_currentNode = block->at(m_indexInBlock); local 1239 Node* node = m_currentNode; local 1279 observeUseKindOnNode(Node* node) argument 1289 observeUseKindOnNode(Node* node, UseKind useKind) argument 1337 Node* node = edge.node(); local 1399 truncateConstantsIfNecessary(Node* node, AddSpeculationMode mode) argument 1411 attemptToMakeIntegerAdd(Node* node) argument [all...] |
H A D | DFGCSEPhase.cpp | 63 Node* canonicalize(Node* node) argument 65 if (!node) 68 if (node->op() == ValueToInt32) 69 node = node->child1().node(); 71 return node; 75 return canonicalize(edge.node()); 92 Node* pureCSE(Node* node) argument 94 Node* child1 = canonicalize(node 132 int32ToDoubleCSE(Node* node) argument 151 constantCSE(Node* node) argument 166 weakConstantCSE(Node* node) argument 184 Node* node = m_currentBlock->at(i); local 202 Node* node = m_currentBlock->at(i); local 227 Node* node = m_currentBlock->at(i); local 249 Node* node = m_currentBlock->at(i); local 282 Node* node = m_currentBlock->at(i); local 304 Node* node = m_currentBlock->at(i); local 329 Node* node = m_currentBlock->at(i); local 366 Node* node = m_currentBlock->at(i); local 409 Node* node = m_currentBlock->at(i); local 422 Node* node = m_currentBlock->at(i); local 435 Node* node = m_currentBlock->at(i); local 494 Node* node = m_currentBlock->at(i); local 548 Node* node = m_currentBlock->at(i); local 606 Node* node = m_currentBlock->at(i); local 651 Node* node = m_currentBlock->at(i); local 694 Node* node = m_currentBlock->at(i); local 749 Node* node = m_currentBlock->at(i); local 783 Node* node = m_currentBlock->at(i); local 812 Node* node = m_currentBlock->at(i); local 835 Node* node = m_currentBlock->at(i); local 889 Node* node = m_currentBlock->at(i); local 961 eliminateIrrelevantPhantomChildren(Node* node) argument 1014 eliminate(Node* node, NodeType phantomType = Phantom) argument 1026 performNodeCSE(Node* node) argument 1398 Node* node = block->at(i); local [all...] |
/macosx-10.9.5/tidy-15.12/tidy/src/ |
H A D | tags.h | 23 typedef void (Parser)( TidyDocImpl* doc, Node *node, GetTokenMode mode ); 24 typedef void (CheckAttribs)( TidyDocImpl* doc, Node *node ); 27 Tag dictionary node 84 Bool TY_(FindTag)( TidyDocImpl* doc, Node *node ); 85 Parser* TY_(FindParser)( TidyDocImpl* doc, Node *node ); 126 #define TagId(node) ((node) && (node)->tag ? (node)->tag->id : TidyTag_UNKNOWN) 127 #define TagIsId(node, ti [all...] |
H A D | parser.c | 26 Bool TY_(CheckNodeIntegrity)(Node *node) argument 31 if (node->prev) 33 if (node->prev->next != node) 37 if (node->next) 39 if (node->next->prev != node) 43 if (node->parent) 45 if (node->prev == NULL && node 66 IsNewNode(Node *node) argument 75 CoerceNode(TidyDocImpl* doc, Node *node, TidyTagId tid, Bool obsolete, Bool unexpected) argument 99 RemoveNode(Node *node) argument 139 InsertNodeAtStart(Node *element, Node *node) argument 157 InsertNodeAtEnd(Node *element, Node *node) argument 174 InsertNodeAsParent(Node *element, Node *node) argument 201 InsertNodeBeforeElement(Node *element, Node *node) argument 219 InsertNodeAfterElement(Node *element, Node *node) argument 321 DropEmptyElements(TidyDocImpl* doc, Node* node) argument 442 IsBlank(Lexer *lexer, Node *node) argument 465 Node *prev, *node; local 498 IsPreDescendant(Node* node) argument 513 CleanTrailingWhitespace(TidyDocImpl* doc, Node* node) argument 598 CleanSpaces(TidyDocImpl* doc, Node* node) argument 671 InsertMisc(Node *element, Node *node) argument 725 ParseTag( TidyDocImpl* doc, Node *node, GetTokenMode mode ) argument 832 Node *node; local 1304 Node *node, *parent; local 1813 Node *node = TY_(GetToken)( doc, mode); local 1832 Node *node, *parent; local 1985 Node *node, *parent; local 2126 Node *node; local 2277 Node *node, *parent; local 2422 Node *node, *parent; local 2502 Node *node, *parent; local 2638 Node *node; local 2792 Node *node; local 2831 Node *node; local 2871 Node *node; local 2938 Node *node; local 3003 Node *node; local 3036 IsJavaScript(Node *node) argument 3060 Node *node; local 3213 Node *node; local 3486 Node *node; local 3592 Node *node; local 3659 Node *node, *head; local 3892 Node* node; local 3924 EncloseBlockText(TidyDocImpl* doc, Node* node) argument 3967 ReplaceObsoleteElements(TidyDocImpl* doc, Node* node) argument 3989 AttributeChecks(TidyDocImpl* doc, Node* node) argument 4016 SanitizeNodesAgainstXSS(TidyDocImpl* doc, Node* node) argument 4076 Node *node, *html, *doctype = NULL; local 4249 Node *node; local 4325 Node *node, *doctype = NULL; local [all...] |
/macosx-10.9.5/JavaScriptCore-7537.78.1/API/tests/ |
H A D | Node.c | 32 Node* node = (Node*)malloc(sizeof(Node)); local 33 node->refCount = 0; 34 node->nodeType = "Node"; 35 node->childNodesTail = NULL; 37 return node; 40 void Node_appendChild(Node* node, Node* child) argument 44 nodeLink->node = child; 45 nodeLink->prev = node->childNodesTail; 46 node->childNodesTail = nodeLink; 49 void Node_removeChild(Node* node, Nod argument 64 Node_replaceChild(Node* node, Node* newChild, Node* oldChild) argument 76 Node_ref(Node* node) argument 81 Node_deref(Node* node) argument [all...] |
H A D | Node.h | 33 Node* node; member in struct:__NodeLink 44 extern void Node_ref(Node* node); 45 extern void Node_deref(Node* node); 46 extern void Node_appendChild(Node* node, Node* child); 47 extern void Node_removeChild(Node* node, Node* child); 48 extern void Node_replaceChild(Node* node, Node* newChild, Node* oldChild);
|
/macosx-10.9.5/dcerpc-58/dcerpc/idl_compiler/ |
H A D | namdump.c | 113 * Function: Dumps the binding information for a node of the nametable tree. 135 printf ("\tBinding node at: %p \n", p); 149 * Function: Dumps a node of the nametable tree. 163 NAMETABLE_id_t node 167 node->id, /* The id string */ 168 (char *) node ); /* The address of the node */ 170 if (node->parent != NULL) { 172 node->parent, /* The address of the parent */ 173 node [all...] |
/macosx-10.9.5/WebCore-7537.78.1/platform/network/blackberry/rss/ |
H A D | RSS20Parser.cpp | 42 xmlNode* node = xmlDocGetRootElement(doc); 43 if (!node) { 48 for (; node; node = node->next) { 49 String name(reinterpret_cast<const char*>(node->name)); 53 xmlNode* channel = node->children; 69 bool RSS20Parser::parseItemBaseAttribute(RSSItemBase* item, const String& name, xmlNode* node) argument 72 item->m_link = textFromXMLNode(node); 74 item->m_title = textFromXMLNode(node); 85 parseItem(xmlNode* node) argument 119 parseFeed(xmlNode* node) argument 143 parseEnclosure(xmlNode* node) argument [all...] |
H A D | RSS10Parser.cpp | 42 xmlNode* node = xmlDocGetRootElement(doc); 43 if (!node) { 48 for (; node; node = node->next) { 49 String name(reinterpret_cast<const char*>(node->name)); 52 xmlNode* childnode = node->children; 79 bool RSS10Parser::parseItemBaseAttribute(RSSItemBase* item, const String& name, xmlNode* node) argument 82 item->m_link = textFromXMLNode(node); 84 item->m_title = textFromXMLNode(node); 93 parseItem(xmlNode* node) argument 109 parseFeed(xmlNode* node) argument [all...] |
/macosx-10.9.5/Security-55471.14.18/sec/securityd/ |
H A D | policytree.c | 51 policy_set_t node = (policy_set_t)malloc(sizeof(*node)); local 52 node->oid_next = *policy_set; 53 node->oid = *p_oid; 54 *policy_set = node; 55 secdebug("policy-set", "%p -> %p", node, node->oid_next); 58 void policy_set_free(policy_set_t node) { argument 59 while (node) { 60 policy_set_t next = node 67 policy_set_contains(policy_set_t node, const oid_t *oid) argument 78 policy_set_t node = other_set; local 101 policy_set_t node = *pnode; local 114 policy_tree_t node = malloc(sizeof(*node)); local 130 policy_tree_t node; local 164 policy_tree_free_node(policy_tree_t node) argument 175 policy_tree_prune(policy_tree_t *node) argument 194 policy_tree_t *node; local 269 policy_tree_set_expected_policy(policy_tree_t node, policy_set_t p_expected) argument 278 policy_tree_dump4(policy_tree_t node, policy_tree_t parent, policy_tree_t prev_sibling, int depth) argument 294 policy_tree_dump(policy_tree_t node) argument [all...] |
/macosx-10.9.5/WebCore-7537.78.1/xml/ |
H A D | XMLSerializer.cpp | 30 String XMLSerializer::serializeToString(Node* node, ExceptionCode& ec) argument 32 if (!node) 35 if (!node->document()) { 38 // with it. It should be the only type of node where this is possible. 39 ASSERT(node->nodeType() == Node::DOCUMENT_TYPE_NODE); 45 return createMarkup(node);
|
/macosx-10.9.5/WebCore-7537.78.1/dom/ |
H A D | NodeIterator.cpp | 41 : node(n) 48 node.clear(); 53 if (!node) 59 node = NodeTraversal::next(node.get(), root); 60 return node; 65 if (!node) 71 node = NodeTraversal::previous(node.get(), root); 72 return node; 181 Node* node = NodeTraversal::next(removedNode, root()); local 208 Node* node = NodeTraversal::previous(removedNode, root()); local [all...] |
H A D | TreeWalker.cpp | 43 void TreeWalker::setCurrentNode(PassRefPtr<Node> node, ExceptionCode& ec) argument 45 if (!node) { 49 m_current = node; 52 inline Node* TreeWalker::setCurrent(PassRefPtr<Node> node) argument 54 m_current = node; 60 RefPtr<Node> node = m_current; local 61 while (node != root()) { 62 node = node->parentNode(); 63 if (!node) 142 RefPtr<Node> node = m_current; local 179 RefPtr<Node> node = m_current; local 216 RefPtr<Node> node = m_current; local 255 RefPtr<Node> node = m_current; local [all...] |
H A D | ContainerNodeAlgorithms.cpp | 35 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoDocument(ContainerNode* node) argument 37 ChildNodesLazySnapshot snapshot(node); 42 if (node->inDocument() && child->parentNode() == node) 46 if (!node->isElementNode()) 49 if (ElementShadow* shadow = toElement(node)->shadow()) { 51 if (node->inDocument() && root->host() == node) 57 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoTree(ContainerNode* node) argument 59 for (Node* child = node 68 notifyDescendantRemovedFromDocument(ContainerNode* node) argument 93 notifyDescendantRemovedFromTree(ContainerNode* node) argument 116 assertConnectedSubrameCountIsConsistent(Node* node) argument [all...] |
H A D | ComposedShadowTreeWalker.cpp | 40 static inline ElementShadow* shadowFor(const Node* node) argument 42 if (node && node->isElementNode()) 43 return toElement(node)->shadow(); 47 static inline bool nodeCanBeDistributed(const Node* node) argument 49 ASSERT(node); 50 Node* parent = parentNodeForDistribution(node); 63 ComposedShadowTreeWalker ComposedShadowTreeWalker::fromFirstChild(const Node* node, Policy policy) argument 65 ComposedShadowTreeWalker walker(node, policy); 77 Node* ComposedShadowTreeWalker::traverseFirstChild(const Node* node) cons 96 traverseChild(const Node* node, TraversalDirection direction) const argument 109 traverseLightChildren(const Node* node, TraversalDirection direction) argument 115 traverseSiblings(const Node* node, TraversalDirection direction) argument 124 traverseNode(const Node* node, TraversalDirection direction) argument 149 traverseDistributedNodes(const Node* node, const InsertionPoint* insertionPoint, TraversalDirection direction) argument 158 traverseSiblingOrBackToInsertionPoint(const Node* node, TraversalDirection direction) argument 174 traverseSiblingInCurrentTree(const Node* node, TraversalDirection direction) argument 182 escapeFallbackContentElement(const Node* node, TraversalDirection direction) argument 190 traverseNodeEscapingFallbackContents(const Node* node, ParentTraversalDetails* details) const argument 209 traverseParent(const Node* node, ParentTraversalDetails* details) const argument 231 traverseParentInCurrentTree(const Node* node, ParentTraversalDetails* details) const argument 251 traverseNextSibling(const Node* node) argument 257 traversePreviousSibling(const Node* node) argument [all...] |
H A D | NodeFilter.cpp | 32 short NodeFilter::acceptNode(ScriptState* state, Node* node) const 35 return m_condition ? m_condition->acceptNode(state, node) : static_cast<short>(FILTER_ACCEPT);
|
/macosx-10.9.5/JavaScriptCore-7537.78.1/heap/ |
H A D | HandleSet.cpp | 57 Node* node = newBlock->nodeAtIndex(i); local 58 new (NotNull, node) Node; 59 m_freeList.push(node); 66 for (Node* node = m_strongList.begin(); node != end; node = node->next()) { 68 RELEASE_ASSERT(isLiveNode(node)); 70 heapRootVisitor.visit(node->slot()); 83 Node* node 112 isLiveNode(Node* node) argument [all...] |
/macosx-10.9.5/WebCore-7537.78.1/accessibility/ |
H A D | AccessibilityList.cpp | 66 Node* node = m_renderer->node(); 74 return node && node->hasTagName(ulTag); 86 Node* node = m_renderer->node(); 87 return node && node->hasTagName(olTag); 95 Node* node = m_renderer->node(); [all...] |
/macosx-10.9.5/WebCore-7537.78.1/bindings/objc/ |
H A D | ObjCNodeFilterCondition.mm | 40 short ObjCNodeFilterCondition::acceptNode(ExecState*, Node* node) const 42 if (!node) 44 return [m_filter.get() acceptNode:kit(node)];
|
/macosx-10.9.5/sudo-72/src/ |
H A D | redblack.c | 69 * A red-black tree is a binary search tree where each node has a color 72 * the color indicates whether the node is part of a 3-node or a 4-node. 76 * 1) Every node is either red or black. 79 * 4) Both children of each red node are black. 98 * We use a self-referencing sentinel node called nil to simplify the 106 * Similarly, the fake root node keeps us from having to worry 117 * Perform a left rotation starting at node. 120 rotate_left(tree, node) 176 struct rbnode *node = rbfirst(tree); local 270 struct rbnode *node = rbfirst(tree); local [all...] |
/macosx-10.9.5/apache-786.1/httpd/modules/ldap/ |
H A D | util_ldap_cache.c | 36 util_url_node_t *node = n; local 37 return util_ald_hash_string(1, node->url); 51 util_url_node_t *node = util_ald_alloc(cache, sizeof *node); local 53 if (node) { 54 if (!(node->url = util_ald_strdup(cache, n->url))) { 55 util_ald_free(cache, node->url); 58 node->search_cache = n->search_cache; 59 node->compare_cache = n->compare_cache; 60 node 70 util_url_node_t *node = n; local 81 util_url_node_t *node = n; local 135 util_search_node_t *node = n; local 149 util_search_node_t *node = c; local 201 util_search_node_t *node = n; local 220 util_search_node_t *node = n; local 240 util_compare_node_t *node = n; local 257 util_compare_node_t *node = util_ald_alloc(cache, sizeof *node); local 277 util_compare_node_t *node = n; local 286 util_compare_node_t *node = n; local 321 util_dn_compare_node_t *node = n; local 336 util_dn_compare_node_t *node = util_ald_alloc(cache, sizeof *node); local 353 util_dn_compare_node_t *node = n; local 361 util_dn_compare_node_t *node = n; local [all...] |
/macosx-10.9.5/WebCore-7537.78.1/bindings/js/ |
H A D | JSNodeCustom.h | 37 inline JSC::JSValue toJS(JSC::ExecState* exec, JSDOMGlobalObject* globalObject, Node* node) argument 39 if (!node) 42 JSNode* wrapper = JSC::jsCast<JSNode*>(getCachedWrapper(currentWorld(exec), node)); 46 return createWrapper(exec, globalObject, node); 49 // In the C++ DOM, a node tree survives as long as there is a reference to its 50 // root. In the JavaScript DOM, a node tree survives as long as there is a 51 // reference to any node in the tree. To model the JavaScript DOM on top of 65 inline void* root(Node* node) argument 67 if (node->inDocument()) 68 return node [all...] |
/macosx-10.9.5/cups-372.4/cups/cgi-bin/ |
H A D | testhi.c | 92 help_node_t *node; /* Current node */ local 96 for (i = 1, node = (help_node_t *)cupsArrayFirst(nodes); 97 node; 98 i ++, node = (help_node_t *)cupsArrayNext(nodes)) 100 if (node->anchor) 101 printf(" %d: %s#%s \"%s\"", i, node->filename, node->anchor, 102 node->text); 104 printf(" %d: %s \"%s\"", i, node [all...] |