HomeSort by relevance Sort by last modified time
    Searched refs:node (Results 101 - 125 of 1195) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/webkit/WebCore/page/
HaltablePlugin.h 31 class Node;
39 virtual Node* node() const = 0;
FocusController.cpp 61 // If we have a focused node we should dispatch blur on it before we blur the window.
62 // If we have a focused node we should dispatch focus on it after we focus the window.
125 static Node* deepFocusableNode(FocusDirection direction, Node* node, KeyboardEvent* event)
127 // The node we found might be a HTMLFrameOwnerElement, so descend down the frame tree until we find either:
128 // 1) a focusable node, or
130 while (node && node->isFrameOwnerElement()) {
131 HTMLFrameOwnerElement* owner = static_cast<HTMLFrameOwnerElement*>(node);
169 Node* node = (direction == FocusDirectionForward) local
    [all...]
  /external/webkit/WebKit/chromium/src/
WebEventListener.cpp 54 EventListenerWrapper* WebEventListener::createEventListenerWrapper(const WebString& eventType, bool useCapture, Node* node)
56 return m_private->createEventListenerWrapper(eventType, useCapture, node);
59 EventListenerWrapper* WebEventListener::getEventListenerWrapper(const WebString& eventType, bool useCapture, Node* node)
61 return m_private->getEventListenerWrapper(eventType, useCapture, node);
  /libcore/luni/src/main/java/org/apache/xalan/transformer/
TreeWalker2Result.java 43 /** Node where to start the tree walk */
65 * @param pos Start node for traversal
78 * End processing of given node
81 * @param node Node we just finished processing
85 protected void endNode(int node) throws org.xml.sax.SAXException
87 super.endNode(node);
88 if(DTM.ELEMENT_NODE == m_dtm.getNodeType(node))
95 * Start traversal of the tree at the given node
98 * @param node Starting node for traversa
    [all...]
  /external/bluetooth/glib/gio/fen/
fen-node.h 28 typedef struct node node_t;
30 struct node struct
36 /* the parent and children of node */
49 void (*hit) (node_t* node, gpointer user_data);
52 gboolean (*pre_del) (node_t* node, gpointer user_data);
58 void remove_node (node_t* node, node_op_t* op);
59 void pending_remove_node (node_t* node, node_op_t* op);
61 void travel_nodes (node_t* node, node_op_t* op);
68 gpointer node_get_data (node_t* node);
69 gpointer node_set_data (node_t* node, gpointer user_data)
    [all...]
fen-dump.c 28 #include "fen-node.h"
36 /*-------------------- node ------------------*/
38 dump_node (node_t* node, gpointer data)
40 if (data && node->user_data) {
43 g_printf ("[%s] < 0x%p : 0x%p > %s\n", __func__, node, node->user_data, NODE_NAME(node));
47 dump_node_tree (node_t* node, gpointer user_data)
53 if (node) {
54 travel_nodes (node, &op)
    [all...]
  /external/skia/src/ports/
SkXMLParser_tinyxml.cpp 39 const TiXmlNode* node = elem->FirstChild(); local
40 while (node)
42 if (node->ToElement())
43 walk_elem(parser, node->ToElement());
44 else if (node->ToText())
45 parser->text(node->Value(), strlen(node->Value()));
46 node = node->NextSibling();
  /external/kernel-headers/original/linux/
nodemask.h 6 * set of Node's in a system, one bit position per Node number.
20 * void node_set(node, mask) turn on bit 'node' in mask
21 * void node_clear(node, mask) turn off bit 'node' in mask
24 * int node_isset(node, mask) true iff bit 'node' set in mask
25 * int node_test_and_set(node, mask) test and set bit 'node' in mas
    [all...]
rbtree.h 56 struct rb_node * node)
75 rb_link_node(node, parent, p);
82 struct rb_node * node)
85 if ((ret = __rb_insert_page_cache(inode, offset, node)))
87 rb_insert_color(node, &inode->i_rb_page_cache);
136 #define RB_EMPTY_NODE(node) (rb_parent(node) != node)
137 #define RB_CLEAR_NODE(node) (rb_set_parent(node, node)
    [all...]
  /external/bluetooth/glib/gio/xdgmime/
xdgmimeglob.c 173 XdgGlobHashNode *node; local
181 node = _xdg_glob_hash_node_new ();
182 node->character = character;
183 node->next = glob_hash_node;
184 glob_hash_node = node;
188 node = glob_hash_node;
198 node = prev_node->next;
200 while (node != NULL)
202 if (character < node->character)
204 node = _xdg_glob_hash_node_new ()
283 XdgGlobHashNode *node; local
308 XdgGlobHashNode *node; local
    [all...]
  /external/chromium/base/third_party/xdg_mime/
xdgmimeglob.c 173 XdgGlobHashNode *node; local
181 node = _xdg_glob_hash_node_new ();
182 node->character = character;
183 node->next = glob_hash_node;
184 glob_hash_node = node;
188 node = glob_hash_node;
198 node = prev_node->next;
200 while (node != NULL)
202 if (character < node->character)
204 node = _xdg_glob_hash_node_new ()
283 XdgGlobHashNode *node; local
308 XdgGlobHashNode *node; local
    [all...]
  /external/webkit/WebCore/inspector/
InspectorDOMAgent.h 53 class Node;
57 EventListenerInfo(Node* node, const AtomicString& eventType, const EventListenerVector& eventListenerVector)
58 : node(node)
64 Node* node; member in struct:WebCore::EventListenerInfo
101 void didInsertDOMNode(Node*);
102 void didRemoveDOMNode(Node*);
105 Node* nodeForId(long nodeId)
    [all...]
  /frameworks/base/core/java/android/content/
UriMatcher.java 121 * Creates the root node of the URI tree.
160 UriMatcher node = this; local
163 ArrayList<UriMatcher> children = node.mChildren;
170 node = child;
185 node.mChildren.add(child);
186 node = child;
189 node.mCode = code;
199 * @return The code for the matched node (added using addURI),
200 * or -1 if there is no matched node.
207 UriMatcher node = this
    [all...]
  /external/gtest/samples/
sample3-inl.h 46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
86 // 1. Deletes every node.
87 QueueNode<E> * node = head_; local
88 QueueNode<E> * next = node->next();
90 delete node;
91 node = next
    [all...]
  /external/protobuf/gtest/samples/
sample3-inl.h 46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
86 // 1. Deletes every node.
87 QueueNode<E> * node = head_; local
88 QueueNode<E> * next = node->next();
90 delete node;
91 node = next
    [all...]
  /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/internal/repository/
XmlParserUtils.java 19 import org.w3c.dom.Node;
30 public static Node getFirstChild(Node node, String xmlLocalName) {
32 String nsUri = node.getNamespaceURI();
33 for(Node child = node.getFirstChild(); child != null; child = child.getNextSibling()) {
34 if (child.getNodeType() == Node.ELEMENT_NODE &&
50 * Note: use {@link #getOptionalXmlString(Node, String)} if you need to know when the
53 * @param node The XML <em>parent</em> node to parse.
    [all...]
  /external/libxml2/
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, xmlNsPtr ns
2681 xmlNodePtr node; local
    [all...]
  /external/webkit/WebCore/editing/
InsertLineBreakCommand.cpp 55 void InsertLineBreakCommand::insertNodeAfterPosition(Node* node, const Position& pos)
60 Element* cb = pos.node()->enclosingBlockFlowElement();
61 if (cb == pos.node())
62 appendNode(node, cb);
64 insertNodeAfter(node, pos.node());
67 void InsertLineBreakCommand::insertNodeBeforePosition(Node* node, const Position& pos)
72 Element* cb = pos.node()->enclosingBlockFlowElement()
    [all...]
ReplaceSelectionCommand.cpp 67 Node* firstChild() const;
68 Node* lastChild() const;
75 void removeNode(PassRefPtr<Node>);
76 void removeNodePreservingChildren(Node*);
79 PassRefPtr<Node> insertFragmentForTestRendering(Node* context);
80 void removeUnrenderedNodes(Node*);
81 void restoreTestRenderingNodesToFragment(Node*);
82 void removeInterchangeNodes(Node*);
84 void insertNodeBefore(PassRefPtr<Node> node, Node* refNode)
284 Node* node = container->firstChild(); local
513 Node* node = m_firstNodeInserted.get(); local
869 RefPtr<Node> node = refNode->nextSibling(); local
1011 RefPtr<Node> node = document()->createEditingTextNode(collapseWhiteSpace ? nonBreakingSpaceString() : " "); local
1026 RefPtr<Node> node = document()->createEditingTextNode(collapseWhiteSpace ? nonBreakingSpaceString() : " "); local
    [all...]
RemoveNodeCommand.h 35 static PassRefPtr<RemoveNodeCommand> create(PassRefPtr<Node> node)
37 return adoptRef(new RemoveNodeCommand(node));
41 RemoveNodeCommand(PassRefPtr<Node>);
46 RefPtr<Node> m_node;
47 RefPtr<Node> m_parent;
48 RefPtr<Node> m_refChild;
RemoveNodePreservingChildrenCommand.h 35 static PassRefPtr<RemoveNodePreservingChildrenCommand> create(PassRefPtr<Node> node)
37 return adoptRef(new RemoveNodePreservingChildrenCommand(node));
41 RemoveNodePreservingChildrenCommand(PassRefPtr<Node>);
45 RefPtr<Node> m_node;
ReplaceNodeWithSpanCommand.h 43 static PassRefPtr<ReplaceNodeWithSpanCommand> create(PassRefPtr<Node> node)
45 return adoptRef(new ReplaceNodeWithSpanCommand(node));
51 ReplaceNodeWithSpanCommand(PassRefPtr<Node>);
56 RefPtr<Node> m_node;
  /frameworks/base/media/libstagefright/include/
OMX.h 39 const char *name, const sp<IOMXObserver> &observer, node_id *node);
41 virtual status_t freeNode(node_id node);
44 node_id node, OMX_COMMANDTYPE cmd, OMX_S32 param);
47 node_id node, OMX_INDEXTYPE index,
51 node_id node, OMX_INDEXTYPE index,
55 node_id node, OMX_INDEXTYPE index,
59 node_id node, OMX_INDEXTYPE index,
63 node_id node, OMX_U32 port_index, const sp<IMemory> &params,
67 node_id node, OMX_U32 port_index, size_t size,
71 node_id node, OMX_U32 port_index, const sp<IMemory> &params
    [all...]
  /external/e2fsprogs/lib/e2p/
uuid.c 16 __u8 node[6]; member in struct:uuid
54 memcpy(uu->node, ptr, 6);
66 uuid.node[0], uuid.node[1], uuid.node[2],
67 uuid.node[3], uuid.node[4], uuid.node[5]);
  /external/skia/src/views/
SkBGViewArtist.cpp 20 void SkBGViewArtist::onInflate(const SkDOM& dom, const SkDOM::Node* node)
22 SkPaint_Inflate(&fPaint, dom, node);

Completed in 760 milliseconds

1 2 3 45 6 7 8 91011>>