Searched refs:node (Results 1 - 25 of 1513) sorted by relevance

1234567891011>>

/macosx-10.10/WebCore-7600.1.25/dom/
H A DNodeRenderingTraversal.h52 inline ContainerNode* parent(const Node* node) argument
54 ASSERT(!node->isPseudoElement());
55 if (node->needsNodeRenderingTraversalSlowPath())
56 return parentSlow(node);
58 ASSERT(node->parentNode() == parentSlow(node));
59 return node->parentNodeGuaranteedHostFree();
62 inline Node* firstChild(const Node* node) argument
64 ASSERT(!node->isPseudoElement());
65 if (node
72 nextSibling(const Node* node) argument
82 previousSibling(const Node* node) argument
[all...]
H A DNodeRenderingTraversal.cpp45 static inline bool nodeCanBeDistributed(const Node* node) argument
47 ASSERT(node);
48 Node* parent = parentNodeForDistribution(node);
61 static Node* findFirstSiblingEnteringInsertionPoints(const Node* node) argument
63 for (const Node* sibling = node; sibling; sibling = sibling->nextSibling()) {
70 static Node* findFirstEnteringInsertionPoints(const Node* node) argument
72 ASSERT(node);
73 if (!isActiveInsertionPoint(node))
74 return const_cast<Node*>(node);
75 const InsertionPoint* insertionPoint = toInsertionPoint(node);
81 findFirstFromDistributedNode(const Node* node, const InsertionPoint* insertionPoint) argument
90 findLastSiblingEnteringInsertionPoints(const Node* node) argument
99 findLastEnteringInsertionPoints(const Node* node) argument
110 findLastFromDistributedNode(const Node* node, const InsertionPoint* insertionPoint) argument
121 traverseParent(const Node* node, ShadowRootCrossing shadowRootCrossing) argument
148 traverseFirstChild(const Node* node, ShadowRootCrossing shadowRootCrossing) argument
159 traverseLastChild(const Node* node, ShadowRootCrossing shadowRootCrossing) argument
170 traverseNextSibling(const Node* node) argument
192 traversePreviousSibling(const Node* node) argument
214 parentSlow(const Node* node) argument
221 firstChildSlow(const Node* node) argument
228 nextSiblingSlow(const Node* node) argument
235 previousSiblingSlow(const Node* node) argument
242 nextInScope(const Node* node) argument
256 previousInScope(const Node* node) argument
268 parentInScope(const Node* node) argument
275 lastChildInScope(const Node* node) argument
[all...]
H A DNodeIterator.cpp41 : node(n)
48 node.clear();
53 if (!node)
59 node = NodeTraversal::next(node.get(), root);
60 return node;
65 if (!node)
71 if (node == root) {
72 node = nullptr;
75 node
179 Node* node = NodeTraversal::next(removedNode, root()); local
206 Node* node = NodeTraversal::previous(removedNode); local
[all...]
H A DTreeWalker.cpp42 void TreeWalker::setCurrentNode(PassRefPtr<Node> node, ExceptionCode& ec) argument
44 if (!node) {
48 m_current = node;
51 inline Node* TreeWalker::setCurrent(PassRefPtr<Node> node) argument
53 m_current = node;
59 RefPtr<Node> node = m_current; local
60 while (node != root()) {
61 node = node->parentNode();
62 if (!node)
141 RefPtr<Node> node = m_current; local
178 RefPtr<Node> node = m_current; local
215 RefPtr<Node> node = m_current; local
254 RefPtr<Node> node = m_current; local
[all...]
H A DNodeFilter.cpp32 short NodeFilter::acceptNode(JSC::ExecState* state, Node* node) const
35 return m_condition ? m_condition->acceptNode(state, node) : static_cast<short>(FILTER_ACCEPT);
H A DTextNodeTraversal.h39 // First text child of the node.
43 // First text descendant of the node.
68 Node* node = current->firstChild(); local
69 while (node && !node->isTextNode())
70 node = node->nextSibling();
71 return toText(node);
79 Node* node = current->firstChild(); local
80 while (node
90 Node* node = NodeTraversal::next(current); local
101 Node* node = NodeTraversal::next(current, stayWithin); local
111 Node* node = current->nextSibling(); local
[all...]
H A DTreeScopeAdopter.cpp52 for (Node* node = root; node; node = NodeTraversal::next(node, root)) {
53 updateTreeScope(node);
56 moveNodeToNewDocument(node, &oldDocument, &newDocument);
57 else if (node->hasRareData()) {
58 NodeRareData* rareData = node->rareData();
63 if (!node->isElementNode())
66 if (node
111 moveNodeToNewDocument(Node* node, Document* oldDocument, Document* newDocument) const argument
[all...]
/macosx-10.10/tidy-15.15/tidy/src/
H A Dtags.h23 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 Dparser.c26 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.10/JavaScriptCore-7600.1.17/offlineasm/
H A Drisc.rb45 | node |
46 if node.is_a? Instruction
47 annotation = node.annotation
48 case node.opcode
64 newList << Instruction.new(node.codeOrigin, op, node.operands[0..-2], annotation)
65 newList << Instruction.new(node.codeOrigin, branch, [node.operands[-1]])
68 newList << Instruction.new(node.codeOrigin, "muli", node
[all...]
/macosx-10.10/WebInspectorUI-7600.1.17/UserInterface/Base/
H A DDOMUtilities.js32 WebInspector.displayNameForNode = function(node)
34 var title = node.nodeNameInCorrectCase();
36 var idAttribute = node.getAttribute("id");
45 var classAttribute = node.getAttribute("class");
62 WebInspector.roleSelectorForNode = function(node)
67 var role = node.computedRole();
73 WebInspector.linkifyAccessibilityNodeReference = function(node)
75 if (!node)
79 var link = WebInspector.linkifyNodeReference(node);
84 var roleSelector = WebInspector.roleSelectorForNode(node);
[all...]
/macosx-10.10/JavaScriptCore-7600.1.17/API/tests/
H A DNode.c32 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 DNode.h33 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.10/JavaScriptCore-7600.1.17/dfg/
H A DDFGFixupPhase.cpp89 void fixupNode(Node* node) argument
91 NodeType op = node->op();
105 fixIntConvertingEdge(node->child1());
106 fixIntConvertingEdge(node->child2());
111 fixIntConvertingEdge(node->child1());
112 fixIntConvertingEdge(node->child2());
113 node->setOp(ArithMul);
114 node->setArithMode(Arith::Unchecked);
115 node->child1().setUseKind(Int32Use);
116 node
1132 createToString(Node* node, Edge& edge) argument
1140 attemptToForceStringArrayModeByToStringConversion(ArrayMode& arrayMode, Node* node) argument
1164 convertStringAddUse(Node* node, Edge& edge) argument
1184 convertToMakeRope(Node* node) argument
1190 fixupMakeRope(Node* node) argument
1216 fixupToPrimitive(Node* node) argument
1245 fixupToString(Node* node) argument
1272 attemptToMakeFastStringAdd(Node* node, Edge& left, Edge& right) argument
1380 Node* node = m_currentNode = block->at(m_indexInBlock); local
1482 Node* node = m_currentNode; local
1521 observeUseKindOnNode(Node* node) argument
1533 observeUseKindOnNode(Node* node, UseKind useKind) argument
1594 Node* node = edge.node(); local
1618 Node* node = edge.node(); local
1640 Node* node = edge.node(); local
1687 truncateConstantsIfNecessary(Node* node, AddSpeculationMode mode) argument
1699 attemptToMakeIntegerAdd(Node* node) argument
1724 attemptToMakeGetArrayLength(Node* node) argument
1768 attemptToMakeGetTypedArrayByteLength(Node* node) argument
1800 convertToGetArrayLength(Node* node, ArrayMode arrayMode) argument
1822 attemptToMakeGetTypedArrayByteOffset(Node* node) argument
1857 tryToRelaxRepresentation(Node* node) argument
1917 injectTypeConversionsForEdge(Node* node, Edge& edge) argument
1999 addRequiredPhantom(Node* node) argument
2010 Node* node = m_requiredPhantoms[i]; local
[all...]
H A DDFGMinifiedNode.cpp36 MinifiedNode MinifiedNode::fromNode(Node* node) argument
38 ASSERT(belongsInMinifiedGraph(node->op()));
40 result.m_id = MinifiedID(node);
41 result.m_op = node->op();
42 if (hasConstantNumber(node->op()))
43 result.m_info = node->constantNumber();
44 else if (hasWeakConstant(node->op()))
45 result.m_info = bitwise_cast<uintptr_t>(node->weakConstant());
47 ASSERT(node->op() == PhantomArguments);
H A DDFGCSEPhase.cpp72 Node* node = block->at(i); local
74 switch (node->op()) {
77 node->mergeFlags(NodeRelevantToOSR);
80 node->clearFlags(NodeRelevantToOSR);
92 Node* node = block->at(i); local
93 if (!node->containsMovHint())
96 ASSERT(node->op() != ZombieHint);
97 node->child1()->mergeFlags(NodeRelevantToOSR);
127 Node* pureCSE(Node* node) argument
129 Edge child1 = node
164 constantCSE(Node* node) argument
179 weakConstantCSE(Node* node) argument
194 constantStoragePointerCSE(Node* node) argument
212 Node* node = m_currentBlock->at(i); local
226 Node* node = m_currentBlock->at(i); local
252 Node* node = m_currentBlock->at(i); local
274 Node* node = m_currentBlock->at(i); local
307 Node* node = m_currentBlock->at(i); local
319 Node* node = m_currentBlock->at(i); local
343 Node* node = m_currentBlock->at(i); local
381 Node* node = m_currentBlock->at(i); local
426 Node* node = m_currentBlock->at(i); local
439 Node* node = m_currentBlock->at(i); local
452 Node* node = m_currentBlock->at(i); local
515 Node* node = m_currentBlock->at(i); local
573 Node* node = m_currentBlock->at(i); local
640 Node* node = m_currentBlock->at(i); local
696 Node* node = m_currentBlock->at(i); local
745 Node* node = m_currentBlock->at(i); local
800 Node* node = m_currentBlock->at(i); local
828 Node* node = m_currentBlock->at(i); local
851 Node* node = m_currentBlock->at(i); local
874 Node* node = m_currentBlock->at(i); local
893 Node* node = m_currentBlock->at(i); local
934 Node* node = m_currentBlock->at(i); local
1008 Node* node = m_currentBlock->at(i); local
1056 Node* node = m_currentBlock->at(i); local
1065 eliminateIrrelevantPhantomChildren(Node* node) argument
1116 eliminate(Node* node, NodeType phantomType = Phantom) argument
1128 performNodeCSE(Node* node) argument
[all...]
H A DDFGStoreBarrierElisionPhase.cpp61 bool couldCauseGC(Node* node) argument
63 return writesOverlap(m_graph, node, GCState);
66 bool allocatesFreshObject(Node* node) argument
68 switch (node->op()) {
81 void noticeFreshObject(HashSet<Node*>& dontNeedBarriers, Node* node) argument
83 ASSERT(allocatesFreshObject(node));
84 dontNeedBarriers.add(node);
90 return barrierNode->child1().node();
93 bool shouldBeElided(HashSet<Node*>& dontNeedBarriers, Node* node) argument
95 ASSERT(node
99 elideBarrier(Node* node) argument
105 handleNode(HashSet<Node*>& dontNeedBarriers, Node* node) argument
135 Node* node = block->at(indexInBlock); local
[all...]
H A DDFGBackwardsPropagationPhase.cpp68 bool isNotNegZero(Node* node)
70 if (!m_graph.isNumberConstant(node))
72 double value = m_graph.valueOfNumberConstant(node);
76 bool isNotPosZero(Node* node) argument
78 if (!m_graph.isNumberConstant(node))
80 double value = m_graph.valueOfNumberConstant(node);
86 bool isWithinPowerOfTwoForConstant(Node* node) argument
88 JSValue immediateValue = node->valueOfJSConstant(codeBlock());
96 bool isWithinPowerOfTwoNonRecursive(Node* node) argument
98 if (node
104 isWithinPowerOfTwo(Node* node) argument
150 mergeDefaultFlags(Node* node) argument
174 propagate(Node* node) argument
[all...]
/macosx-10.10/WebCore-7600.1.25/xml/
H A DXPathUtil.cpp37 bool isRootDomNode(Node* node) argument
39 return node && !node->parentNode();
42 String stringValue(Node* node) argument
44 switch (node->nodeType()) {
51 return node->nodeValue();
53 if (isRootDomNode(node) || node->isElementNode())
54 return TextNodeTraversal::contentsAsString(node);
59 bool isValidContextNode(Node* node) argument
[all...]
/macosx-10.10/dcerpc-61/dcerpc/idl_compiler/
H A Dnamdump.c113 * 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.10/Security-57031.1.35/Security/sec/securityd/
H A Dpolicytree.c51 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.10/JavaScriptCore-7600.1.17/heap/
H A DHandleSet.cpp56 Node* node = newBlock->nodeAtIndex(i); local
57 new (NotNull, node) Node;
58 m_freeList.push(node);
65 for (Node* node = m_strongList.begin(); node != end; node = node->next()) {
67 RELEASE_ASSERT(isLiveNode(node));
69 heapRootVisitor.visit(node->slot());
78 Node* node
107 isLiveNode(Node* node) argument
[all...]
/macosx-10.10/WebCore-7600.1.25/bindings/objc/
H A DObjCNodeFilterCondition.mm40 short ObjCNodeFilterCondition::acceptNode(ExecState*, Node* node) const
42 if (!node)
44 return [m_filter.get() acceptNode:kit(node)];
/macosx-10.10/sudo-73/src/
H A Dredblack.c69 * 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.10/cups-408/cups/cgi-bin/
H A Dtesthi.c92 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...]

Completed in 435 milliseconds

1234567891011>>