Searched refs:node (Results 76 - 100 of 1513) sorted by relevance

1234567891011>>

/macosx-10.10/WebCore-7600.1.25/bindings/js/
H A DJSNodeCustom.cpp81 static inline bool isObservable(JSNode* jsNode, Node* node) argument
83 // The root node keeps the tree intact.
84 if (!node->parentNode())
90 // A node's JS wrapper is responsible for marking its JS event listeners.
91 if (node->hasEventListeners())
97 static inline bool isReachableFromDOM(JSNode* jsNode, Node* node, SlotVisitor& visitor) argument
99 if (!node->inDocument()) {
100 if (node->isElementNode()) {
101 auto& element = toElement(*node);
120 // If a node i
187 createWrapperInline(ExecState* exec, JSDOMGlobalObject* globalObject, Node* node) argument
242 createWrapper(ExecState* exec, JSDOMGlobalObject* globalObject, Node* node) argument
247 toJSNewlyCreated(ExecState* exec, JSDOMGlobalObject* globalObject, Node* node) argument
255 getOutOfLineCachedWrapper(JSDOMGlobalObject* globalObject, Node* node) argument
[all...]
/macosx-10.10/bind9-45.101/bind9/lib/dns/
H A Drbt.c79 #define PARENT(node) ((node)->parent)
80 #define LEFT(node) ((node)->left)
81 #define RIGHT(node) ((node)->right)
82 #define DOWN(node) ((node)->down)
83 #define DATA(node) ((node)
167 Name(dns_rbtnode_t *node) argument
181 find_up(dns_rbtnode_t *node) argument
342 move_chain_to_last(dns_rbtnodechain_t *chain, dns_rbtnode_t *node) argument
651 dns_rbtnode_t *node; local
679 dns_rbt_findnode(dns_rbt_t *rbt, dns_name_t *name, dns_name_t *foundname, dns_rbtnode_t **node, dns_rbtnodechain_t *chain, unsigned int options, dns_rbtfindcallback_t callback, void *callback_arg) argument
1184 dns_rbtnode_t *node = NULL; local
1206 dns_rbtnode_t *node = NULL; local
1278 dns_rbt_deletenode(dns_rbt_t *rbt, dns_rbtnode_t *node, isc_boolean_t recurse) argument
1362 dns_rbt_namefromnode(dns_rbtnode_t *node, dns_name_t *name) argument
1372 dns_rbt_fullnamefromnode(dns_rbtnode_t *node, dns_name_t *name) argument
1399 dns_rbt_formatnodename(dns_rbtnode_t *node, char *printname, unsigned int size) argument
1422 dns_rbtnode_t *node; local
1494 hash_add_node(dns_rbt_t *rbt, dns_rbtnode_t *node, dns_name_t *name) argument
1525 dns_rbtnode_t *node; local
1558 hash_node(dns_rbt_t *rbt, dns_rbtnode_t *node, dns_name_t *name) argument
1569 unhash_node(dns_rbt_t *rbt, dns_rbtnode_t *node) argument
1593 rotate_left(dns_rbtnode_t *node, dns_rbtnode_t **rootp) argument
1626 rotate_right(dns_rbtnode_t *node, dns_rbtnode_t **rootp) argument
1663 dns_rbt_addonlevel(dns_rbtnode_t *node, dns_rbtnode_t *current, int order, dns_rbtnode_t **rootp) argument
2017 dns_rbt_deletetree(dns_rbt_t *rbt, dns_rbtnode_t *node) argument
2064 dns_rbtnode_t *node = *nodep; local
2123 dns_rbt_printnodename(dns_rbtnode_t *node) argument
2222 dns_rbtnodechain_current(dns_rbtnodechain_t *chain, dns_name_t *name, dns_name_t *origin, dns_rbtnode_t **node) argument
[all...]
H A Diptable.c68 isc_radix_node_t *node = NULL; local
76 result = isc_radix_insert(tab->radix, &node, NULL, &pfx);
82 /* If a node already contains data, don't overwrite it */
88 if (node->data[0] == NULL)
89 node->data[0] = &dns_iptable_pos;
90 if (node->data[1] == NULL)
91 node->data[1] = &dns_iptable_pos;
93 if (node->data[0] == NULL)
94 node->data[0] = &dns_iptable_neg;
95 if (node
119 isc_radix_node_t *node, *new_node; local
[all...]
/macosx-10.10/webdavfs-367/mount.tproj/
H A Dwebdav_cache.h46 struct node_entry *parent; /* the parent node_entry, or NULL if this is the root node */
47 LIST_HEAD(, node_entry) children; /* this node's children (if any) */
58 opaque_id nodeid; /* opaque_id assigned to this node */
59 time_t node_time; /* local time - when node was validated on server */
80 * file_ref before you free the node.
110 boolean_t isRedirected; /* TRUE if this node has been redirected */
125 nodeDeletedBit = 0, /* the node is deleted and is on the deleted list */
127 nodeInFileListBit = 1, /* the node is cached and is on the file list */
129 nodeRecentBit = 2, /* the file node was recently created by this client or the directory was recently read */
141 #define NODE_IS_DELETED(node) (((nod
[all...]
/macosx-10.10/tcl-105/tcl_ext/tdom/tdom/generic/
H A Ddom.c68 #define MutationEvent2(type,node)
69 #define MutationEvent3(type,node,relatioNode)
470 * This helper procedure returns if node precedes other with regard
476 * 1 if node precedes other in document order, 0 otherwise.
486 domNode *node,
493 if (node == other) {
497 if (node->nodeType == ATTRIBUTE_NODE) {
498 attrN = (domAttrNode*)node;
511 node = attrN->parentNode;
518 node
484 domPrecedes( domNode *node, domNode *other ) argument
618 domLookupPrefixWithMappings( domNode *node, const char *prefix, char **prefixMappings ) argument
646 domLookupPrefix( domNode *node, const char *prefix ) argument
726 domLookupURI( domNode *node, char *uri ) argument
955 domGetAttributeNodeNS( domNode *node, const char *uri, const char *localname ) argument
1062 domNode *node, *parentNode; local
1422 domTextNode *node; local
1528 domTextNode *node; local
1611 domProcessingInstructionNode *node; local
2171 domGetLineColumn( domNode *node, int *line, int *column ) argument
2337 domNode *node; local
2405 domNode *node; local
2426 domFreeNode( domNode * node, domFreeCallback freeCB, void * clientData, int dontfree ) argument
2524 domDeleteNode( domNode * node, domFreeCallback freeCB, void * clientData ) argument
2612 domNode *node, *next; local
2776 domSetAttribute( domNode *node, const char *attributeName, const char *attributeValue ) argument
2847 domSetAttributeNS( domNode *node, const char *attributeName, const char *attributeValue, const char *uri, int createNSIfNeeded ) argument
3031 domRemoveAttribute( domNode *node, const char *attributeName ) argument
3077 domRemoveAttributeNS( domNode *node, const char *uri, const char *localName ) argument
3141 domSetDocument( domNode *node, domDocument *doc ) argument
3225 domSetNodeValue( domNode *node, const char *nodeValue, int valueLen ) argument
3272 domRemoveChild( domNode *node, domNode *child ) argument
3361 domAppendChild( domNode *node, domNode *childToAppend ) argument
3490 domInsertBefore( domNode *node, domNode *childToInsert, domNode *referenceChild ) argument
3668 domReplaceChild( domNode *node, domNode *newChild, domNode *oldChild ) argument
3813 domTextNode *node; local
3888 domTextNode *node; local
3950 domNode *node; local
4041 domAppendData( domTextNode *node, char *value, int length, int disableOutputEscaping ) argument
4132 domNormalize( domNode *node, int forXPath, domFreeCallback freeCB, void *clientData ) argument
4204 domAddNSToNode( domNode *node, domNS *nsToAdd ) argument
4286 domNode *node; local
4334 domProcessingInstructionNode *node; local
4375 domNode *node; local
4413 domNode *node; local
4450 domCloneNode( domNode *node, int deep ) argument
4582 domCopyTo( domNode *node, domNode *parent, int copyNS ) argument
4682 domXPointerChild( domNode * node, int all, int instance, domNodeType type, char * element, char * attrName, char * attrValue, int attrLen, domAddCallback addCallback, void * clientData ) argument
4760 domXPointerXSibling( domNode * node, int forward_mode, int all, int instance, domNodeType type, char * element, char * attrName, char * attrValue, int attrLen, domAddCallback addCallback, void * clientData ) argument
4855 domXPointerDescendant( domNode * node, int all, int instance, int * i, domNodeType type, char * element, char * attrName, char * attrValue, int attrLen, domAddCallback addCallback, void * clientData ) argument
4947 domXPointerAncestor( domNode * node, int all, int instance, int * i, domNodeType type, char * element, char * attrName, char * attrValue, int attrLen, domAddCallback addCallback, void * clientData ) argument
[all...]
/macosx-10.10/JavaScriptCore-7600.1.17/dfg/
H A DDFGPredictionPropagationPhase.cpp137 void propagate(Node* node) argument
139 NodeType op = node->op();
146 SpeculatedType type = speculationFromValue(m_graph.valueOfJSConstant(node));
154 VariableAccessData* variable = node->variableAccessData();
164 VariableAccessData* variableAccessData = node->variableAccessData();
165 changed |= variableAccessData->predict(node->child1()->prediction());
193 changed |= setPrediction(node->getHeapPrediction());
205 if (node->canSpeculateInt32(m_pass))
213 SpeculatedType left = node->child1()->prediction();
214 SpeculatedType right = node
676 doDoubleVoting(Node* node, float weight) argument
[all...]
H A DDFGCPSRethreadingPhase.cpp85 Node* node = block->at(fromIndex++); local
86 switch (node->op()) {
90 node->children.setChild1(Edge());
93 if (!node->child1())
95 switch (node->child1()->op()) {
99 node->convertToPhantomLocal();
102 ASSERT(node->child1()->hasResult());
109 block->at(toIndex++) = node;
154 void canonicalizeGetLocalFor(Node* node, VariableAccessData* variable, size_t idx) argument
156 ASSERT(!node
220 canonicalizeGetLocal(Node* node) argument
229 canonicalizeSetLocal(Node* node) argument
235 canonicalizeFlushOrPhantomLocalFor(Node* node, VariableAccessData* variable, size_t idx) argument
288 canonicalizeFlushOrPhantomLocal(Node* node) argument
297 canonicalizeSetArgument(Node* node) argument
322 Node* node = m_block->at(nodeIndex); local
495 Node* node = block->at(nodeIndex); local
502 Node* node = m_flushedLocalOpWorklist.takeLast(); local
508 addFlushedLocalOp(Node* node) argument
[all...]
H A DDFGEdge.h40 explicit Edge(Node* node = 0, UseKind useKind = UntypedUse, ProofStatus proofStatus = NeedsCheck, KillStatus killStatus = DoesNotKill)
42 : m_encodedWord(makeWord(node, useKind, proofStatus, killStatus))
44 : m_node(node)
51 Node* node() const { return bitwise_cast<Node*>(m_encodedWord >> shift()); } function in class:JSC::DFG::Edge
53 Node* node() const { return m_node; } function in class:JSC::DFG::Edge
56 Node& operator*() const { return *node(); }
57 Node* operator->() const { return node(); }
59 void setNode(Node* node) argument
62 m_encodedWord = makeWord(node, useKind(), proofStatus(), killStatus());
64 m_node = node;
225 operator ==(Edge edge, Node* node) argument
229 operator ==(Node* node, Edge edge) argument
233 operator !=(Edge edge, Node* node) argument
237 operator !=(Node* node, Edge edge) argument
[all...]
H A DDFGGraph.cpp134 int Graph::amountOfNodeWhiteSpace(Node* node) argument
136 return (node->origin.semantic.inlineDepth() - 1) * 2;
139 void Graph::printNodeWhiteSpace(PrintStream& out, Node* node) argument
141 printWhiteSpace(out, amountOfNodeWhiteSpace(node));
144 void Graph::dump(PrintStream& out, const char* prefix, Node* node, DumpContext* context) argument
146 NodeType op = node->op();
148 unsigned refCount = node->refCount();
150 bool mustGenerate = node->mustGenerate();
155 printNodeWhiteSpace(out, node);
164 // not including the 'mustGenerate' ref. If the node i
601 Node* node = block[indexInBlock]; local
779 tryGetActivation(Node* node) argument
786 tryGetRegisters(Node* node) argument
796 tryGetFoldableView(Node* node) argument
808 tryGetFoldableView(Node* node, ArrayMode arrayMode) argument
815 tryGetFoldableViewForChild1(Node* node) argument
828 Node* node = block->at(nodeIndex); local
[all...]
H A DDFGAtTailAbstractState.cpp42 void AtTailAbstractState::createValueForNode(Node* node) argument
44 m_block->ssa->valuesAtTail.add(node, AbstractValue());
47 AbstractValue& AtTailAbstractState::forNode(Node* node) argument
49 HashMap<Node*, AbstractValue>::iterator iter = m_block->ssa->valuesAtTail.find(node);
/macosx-10.10/Heimdal-398.1.2/lib/roken/
H A Dtsearch-test.c17 struct node { struct
39 return strcmp(((const struct node *) node1)->string,
40 ((const struct node *) node2)->string);
48 const struct node *p = *(const struct node **) ptr;
64 struct node *t, *p, tests[] = {
79 p = (struct node *)rk_tfind((void *)t, (void **)&rootnode,
87 /* Put node into the tree. */
88 p = (struct node *) rk_tsearch((void *)t, (void **)&rootnode,
101 p = (struct node *) rk_tfin
[all...]
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/fumagic/
H A Dcgen.tcl96 # Annotates the tree. In each node we store the path from the root
97 # to this node, as list of nodes, with the current node the last
98 # element. The root node is never stored in the path.
102 $tree walk $child -type dfs node {
103 set path [$tree get [$tree parent $node] path]
104 lappend path [$tree index $node]
105 $tree set $node path $path
113 # Recursively creates and annotates a node for the specified
116 set node [
[all...]
/macosx-10.10/hfs-285/fsck_hfs/dfalib/
H A DBTreeNodeOps.c26 Contains: Single-node operations for the BTree Module.
42 // GetNode - Call FS Agent to get node
43 // GetNewNode - Call FS Agent to get a new node
44 // ReleaseNode - Call FS Agent to release node obtained by GetNode.
45 // UpdateNode - Mark a node as dirty and call FS Agent to release it.
47 // ClearNode - Clear a node to all zeroes.
49 // InsertRecord - Inserts a record into a BTree node.
50 // InsertKeyRecord - Inserts a key and record pair into a BTree node.
51 // DeleteRecord - Deletes a record from a BTree node.
56 // GetNodeDataSize - Return the amount of space used for data in the node
190 NodeDescPtr node; local
408 InsertRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, UInt16 index, RecordPtr recPtr, UInt16 recSize ) argument
477 InsertKeyRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, UInt16 index, KeyPtr keyPtr, UInt16 keyLength, RecordPtr recPtr, UInt16 recSize ) argument
581 DeleteRecord(BTreeControlBlockPtr btreePtr, NodeDescPtr node, UInt16 index ) argument
628 SearchNode(BTreeControlBlockPtr btreePtr, NodeDescPtr node, KeyPtr searchKey, UInt16 *returnIndex ) argument
690 GetRecordByIndex(BTreeControlBlockPtr btreePtr, NodeDescPtr node, UInt16 index, KeyPtr *keyPtr, UInt8 * *dataPtr, UInt16 *dataSize ) argument
847 GetRecordSize(BTreeControlBlockPtr btreePtr, NodeDescPtr node, UInt16 index ) argument
872 GetOffsetAddress(BTreeControlBlockPtr btreePtr, NodeDescPtr node, UInt16 index ) argument
929 InsertOffset(BTreeControlBlockPtr btreePtr, NodeDescPtr node, UInt16 index, UInt16 delta ) argument
963 DeleteOffset(BTreeControlBlockPtr btreePtr, NodeDescPtr node, UInt16 index ) argument
[all...]
/macosx-10.10/WTF-7600.1.24/wtf/
H A DDoublyLinkedList.h106 for (T* node = m_head; node; node = node->next())
127 template<typename T> inline void DoublyLinkedList<T>::push(T* node) argument
131 m_head = node;
132 m_tail = node;
133 node->setPrev(0);
134 node->setNext(0);
139 m_head->setPrev(node);
145 append(T* node) argument
163 remove(T* node) argument
184 T* node = head(); local
[all...]
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/struct/
H A Dtree_tcl.tcl21 # node values
22 # node relationships
28 # parent array mapping nodes to their parent node
29 # node:$node array mapping keys to values for the node $node
109 # Set up root node's child list
113 # Set root node's parent
117 # Set up the node attribut
[all...]
H A Dtree1.tcl22 # node values
23 # node relationships
29 # parent array mapping nodes to their parent node
30 # node:$node array mapping keys to values for the node $node
75 # Set up root node's child list
79 # Set root node's parent
83 # Set up the node attribut
[all...]
/macosx-10.10/bind9-45.101/bind9/lib/isc/
H A Dradix.c161 * if func is supplied, it will be called as func(node->data)
162 * before deleting the node
221 * func will be called as func(node->prefix, node->data)
226 isc_radix_node_t *node; local
230 RADIX_WALK(radix->head, node) {
231 func(node->prefix, node->data);
240 isc_radix_node_t *node; local
258 node
305 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; local
614 isc_radix_remove(isc_radix_tree_t *radix, isc_radix_node_t *node) argument
[all...]
/macosx-10.10/ntp-92/lib/isc/
H A Dradix.c161 * if func is supplied, it will be called as func(node->data)
162 * before deleting the node
221 * func will be called as func(node->prefix, node->data)
226 isc_radix_node_t *node; local
230 RADIX_WALK(radix->head, node) {
231 func(node->prefix, node->data);
240 isc_radix_node_t *node; local
258 node
305 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; local
614 isc_radix_remove(isc_radix_tree_t *radix, isc_radix_node_t *node) argument
[all...]
/macosx-10.10/ruby-106/ruby/lib/rexml/formatters/
H A Dpretty.rb38 def write_element(node, output)
40 output << "<#{node.expanded_name}"
42 node.attributes.each_attribute do |attr|
45 end unless node.attributes.empty?
47 if node.children.empty?
59 if node.children.inject(true) {|s,c| s & c.kind_of?(Text)}
63 node.children.each { |child| write( child, string ) }
74 node.children.each { |child|
82 output << "</#{node.expanded_name}"
87 def write_text( node, outpu
[all...]
/macosx-10.10/WebCore-7600.1.25/Modules/webaudio/
H A DAudioNodeInput.cpp38 AudioNodeInput::AudioNodeInput(AudioNode* node) argument
39 : AudioSummingJunction(node->context())
40 , m_node(node)
50 ASSERT(output && node());
51 if (!output || !node())
62 node()->ref(AudioNode::RefTypeConnection);
69 ASSERT(output && node());
70 if (!output || !node())
77 node()->deref(AudioNode::RefTypeConnection); // Note: it's important to return immediately after all deref() calls since the node ma
[all...]
/macosx-10.10/WebCore-7600.1.25/inspector/
H A DPageConsoleAgent.cpp60 explicit InspectableNode(Node* node) : m_node(node) { } argument
71 Node* node = m_inspectorDOMAgent->nodeForId(nodeId); local
72 if (!node || node->isInShadowTree()) {
78 commandLineAPIHost->addInspectedObject(std::make_unique<InspectableNode>(node));
/macosx-10.10/OpenSSL098-52/src/crypto/x509v3/
H A Dpcy_node.c105 X509_POLICY_NODE *node; local
106 node = OPENSSL_malloc(sizeof(X509_POLICY_NODE));
107 if (!node)
109 node->data = data;
110 node->parent = parent;
111 node->nchild = 0;
118 level->anyPolicy = node;
127 if (!sk_X509_POLICY_NODE_push(level->nodes, node))
145 return node;
148 policy_node_free(node);
153 policy_node_free(X509_POLICY_NODE *node) argument
[all...]
/macosx-10.10/WebCore-7600.1.25/dom/
H A DTraversal.cpp41 short NodeIteratorBase::acceptNode(JSC::ExecState* state, Node* node) const
45 // The bit twiddling here is done to map DOM node types, which are given as integers from
47 if (!(((1 << (node->nodeType() - 1)) & m_whatToShow)))
51 return m_filter->acceptNode(state, node);
/macosx-10.10/Security-57031.1.35/Security/libsecurity_codesigning/antlr2/src/
H A DNoViableAltException.cpp19 token(0), node(t)
27 token(t), node(nullASTptr)
44 if (!node)
47 return string("unexpected AST node: ")+node->toString();
/macosx-10.10/bind9-45.101/bind9/lib/dns/include/dns/
H A Drbt.h66 * This is the structure that is used for each node in the red/black
75 DNS_RBT_NSEC_HAS_NSEC=1, /* also has node in nsec tree */
125 * node lock must be held before accessing them.
139 typedef isc_result_t (*dns_rbtfindcallback_t)(dns_rbtnode_t *node,
149 * node from the root of the tree. Originally nodes did not have parent
151 * the path back to the root from any given node. Now that nodes have parent
158 * tree when a node is added). The obvious implication of this is that for a
161 * change the path from the root to the node the chain has targeted.
166 * stored at the node (and thus it will be read-only), so it should be a
175 * with an origin of "." -- an empty name when the node i
[all...]

Completed in 273 milliseconds

1234567891011>>