| /external/chromium_org/mojo/services/view_manager/ |
| view.h | 18 class Node;
20 // Represents a view. A view may be associated with a single Node.
28 Node* node() { return node_; } function in class:mojo::view_manager::service::View
34 // Node is responsible for maintaining |node_|.
35 friend class Node;
37 void set_node(Node* node) { node_ = node; }
40 Node* node_
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/nacl_io/ |
| kernel_handle.h | 14 #include "nacl_io/node.h"
27 // HandleAttr struct is passed the Node in calls
39 // file information, such as it's filesystem, node, access type and offset.
44 KernelHandle(const ScopedFilesystem& fs, const ScopedNode& node);
73 const ScopedNode& node() { return node_; } function in class:nacl_io::KernelHandle
81 // Returns the SocketNode* if this node is a socket otherwise returns
|
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| SVGCSSComputedStyleDeclaration.cpp | 101 Node* node = m_node.get(); local
102 if (!node)
107 node->document().updateLayout();
109 RenderStyle* style = node->computedStyle();
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeChildRemovalTracker.h | 30 #include "core/dom/Node.h"
36 explicit NodeChildRemovalTracker(Node&);
39 static bool isBeingRemoved(Node*);
42 Node& node() const { return m_node; } function in class:WebCore::NodeChildRemovalTracker
45 Node& m_node;
50 inline NodeChildRemovalTracker::NodeChildRemovalTracker(Node& node)
51 : m_node(node)
62 inline bool NodeChildRemovalTracker::isBeingRemoved(Node* node
[all...] |
| NodeIterator.h | 42 static PassRefPtrWillBeRawPtr<NodeIterator> create(PassRefPtrWillBeRawPtr<Node> rootNode, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter> filter)
49 PassRefPtrWillBeRawPtr<Node> nextNode(ExceptionState&);
50 PassRefPtrWillBeRawPtr<Node> previousNode(ExceptionState&);
53 Node* referenceNode() const { return m_referenceNode.node.get(); }
56 // This function is called before any node is removed from the document tree.
57 void nodeWillBeRemoved(Node&);
62 NodeIterator(PassRefPtrWillBeRawPtr<Node>, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter>);
68 NodePointer(PassRefPtrWillBeRawPtr<Node>, bool);
71 bool moveToNext(Node* root)
74 RefPtrWillBeMember<Node> node; member in class:WebCore::FINAL::NodePointer
[all...] |
| ShadowTreeStyleSheetCollection.cpp | 52 Node* node = *it; local
56 if (!isHTMLStyleElement(*node))
59 HTMLStyleElement* element = toHTMLStyleElement(node);
|
| TreeWalker.cpp | 36 TreeWalker::TreeWalker(PassRefPtrWillBeRawPtr<Node> rootNode, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter> filter)
43 void TreeWalker::setCurrentNode(PassRefPtrWillBeRawPtr<Node> node, ExceptionState& exceptionState)
45 if (!node) {
46 exceptionState.throwDOMException(NotSupportedError, ExceptionMessages::argumentNullOrIncorrectType(1, "Node"));
49 m_current = node;
52 inline Node* TreeWalker::setCurrent(PassRefPtrWillBeRawPtr<Node> node)
54 m_current = node;
60 RefPtrWillBeRawPtr<Node> node = m_current; local
142 RefPtrWillBeRawPtr<Node> node = m_current; local
179 RefPtrWillBeRawPtr<Node> node = m_current; local
216 RefPtrWillBeRawPtr<Node> node = m_current; local
255 RefPtrWillBeRawPtr<Node> node = m_current; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/events/ |
| EventDispatcher.h | 39 class Node;
51 static bool dispatchEvent(Node*, PassRefPtrWillBeRawPtr<EventDispatchMediator>);
52 static void dispatchScopedEvent(Node*, PassRefPtrWillBeRawPtr<EventDispatchMediator>);
54 static void dispatchSimulatedClick(Node*, Event* underlyingEvent, SimulatedClickMouseEventOptions);
57 Node* node() const { return m_node.get(); } function in class:WebCore::EventDispatcher
61 EventDispatcher(Node*, PassRefPtrWillBeRawPtr<Event>);
70 RefPtrWillBeMember<Node> m_node;
|
| NodeEventContext.h | 37 class Node;
43 // FIXME: Use ContainerNode instead of Node.
44 NodeEventContext(PassRefPtrWillBeRawPtr<Node>, PassRefPtrWillBeRawPtr<EventTarget> currentTarget);
48 Node* node() const { return m_node.get(); } function in class:WebCore::NodeEventContext
61 RefPtrWillBeMember<Node> m_node;
|
| ScopedEventQueue.cpp | 82 Node* node = mediator->event()->target()->toNode(); local
83 EventDispatcher::dispatchEvent(node, mediator);
|
| /external/chromium_org/third_party/WebKit/Source/core/inspector/ |
| PageConsoleAgent.cpp | 34 #include "core/dom/Node.h"
61 explicit InspectableNode(Node* node) : m_node(node) { }
67 Node* m_node;
72 Node* node = m_inspectorDOMAgent->nodeForId(nodeId); local
73 if (!node) {
77 while (node->isInShadowTree()) {
78 Node& ancestor = node->highestAncestorOrSelf()
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderLayerModelObject.h | 67 ContainerNode* node() const { return toContainerNode(RenderObject::node()); } function in class:WebCore::RenderLayerModelObject
|
| /external/chromium_org/third_party/WebKit/Source/core/svg/graphics/ |
| SVGImageCache.cpp | 94 Node* node = renderer->node(); local
95 if (node && isHTMLImageElement(node)) {
96 const AtomicString& urlString = toHTMLImageElement(node)->imageSourceURL();
97 KURL url = node->document().completeURL(urlString);
|
| /external/chromium_org/third_party/WebKit/Source/web/ |
| ViewportAnchor.cpp | 35 #include "core/dom/Node.h"
53 Node* findNonEmptyAnchorNode(const IntPoint& point, const IntRect& viewRect, EventHandler* eventHandler)
55 Node* node = eventHandler->hitTestResultAtPoint(point, HitTestRequest::ReadOnly | HitTestRequest::Active | HitTestRequest::ConfusingAndOftenMisusedDisallowShadowContent).innerNode(); local
57 // If the node bounding box is sufficiently large, make a single attempt to
58 // find a smaller node; the larger the node bounds, the greater the
61 if (node && area(node->boundingBox()) > maxNodeArea) {
64 node = eventHandler->hitTestResultAtPoint(point + pointOffset, HitTestRequest::ReadOnly | HitTestReques (…)
97 Node* node = findNonEmptyAnchorNode(flooredIntPoint(anchorPoint), viewRect, m_eventHandler); local
[all...] |
| WebHitTestResult.cpp | 30 #include "core/dom/Node.h"
44 WebNode WebHitTestResult::node() const function in class:blink::WebHitTestResult
|
| /external/chromium_org/third_party/WebKit/Source/web/tests/ |
| ListenerLeakTest.cpp | 46 const v8::HeapGraphNode* GetProperty(const v8::HeapGraphNode* node, v8::HeapGraphEdge::Type type, const char* name)
48 for (int i = 0, count = node->GetChildrenCount(); i < count; ++i) {
49 const v8::HeapGraphEdge* prop = node->GetChild(i);
69 const v8::HeapGraphNode* node = snapshot->GetNode(i); local
70 if (node->GetType() != v8::HeapGraphNode::kObject)
72 v8::String::Utf8Value nodeName(node->GetName());
74 const v8::HeapGraphNode* constructorProp = GetProperty(node, v8::HeapGraphEdge::kProperty, "constructor");
109 // This test tries to create a reference cycle between node and its listener.
117 // This test sets node onclick many times to expose a possible memory
118 // leak where all listeners get referenced by the node
[all...] |
| /external/chromium_org/third_party/libjingle/source/talk/xmpp/ |
| jid.h | 38 // consists of three parts: the node, the domain and the resource, e.g.:
40 // node@domain/resource
42 // The node and resource are both optional. A valid jid is defined to have
54 const std::string & node() const { return node_name_; } function in class:buzz::Jid
79 static std::string PrepNode(const std::string& node, bool* valid);
|
| pubsubclient.h | 51 // pubsub jid and node. All you have to do is RequestItems, listen
57 const std::string& node)
60 node_(node) {}
62 const std::string& node() const { return node_; } function in class:buzz::PubSubClient
|
| /external/chromium_org/third_party/libxml/src/include/libxml/ |
| debugXML.h | 41 xmlNodePtr node,
45 xmlNodePtr node,
49 xmlNodePtr node,
81 xmlLsOneNode (FILE *output, xmlNodePtr node);
83 xmlLsCountNode (xmlNodePtr node);
116 xmlNodePtr node; member in struct:_xmlShellCtxt
127 * @node: a first node
128 * @node2: a second node
136 xmlNodePtr node,
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| brw_fs_live_variables.h | 57 void *node; local
59 node = rzalloc_size(ctx, size);
60 assert(node != NULL);
62 return node;
|
| /external/chromium_org/third_party/openssl/openssl/crypto/x509v3/ |
| pcy_node.c | 98 X509_POLICY_NODE *node; local
102 node = sk_X509_POLICY_NODE_value(level->nodes, i);
103 if (node->parent == parent)
105 if (!OBJ_cmp(node->data->valid_policy, id))
106 return node;
117 X509_POLICY_NODE *node; local
118 node = OPENSSL_malloc(sizeof(X509_POLICY_NODE));
119 if (!node)
121 node->data = data;
122 node->parent = parent
[all...] |
| /external/chromium_org/tools/grit/grit/tool/ |
| toolbar_postprocess.py | 14 import grit.node.empty namespace
15 from grit.node import misc
31 grdnode: the root node of the grd xml data generated by
35 The root node of the processed GRD tree.
41 identifiers = grit.node.empty.IdentifiersNode()
55 for node in messages.children[:]:
56 name_attr = node.attrs['name']
98 previous_node = node
105 new_node = grit.node.empty.MessagesNode()
111 def AddIdentifiers(self, rctext, node)
[all...] |
| /external/chromium_org/ui/base/models/ |
| tree_node_iterator.h | 15 // Iterator that iterates over the descendants of a node. The iteration does
16 // not include the node itself, only the descendants. The following illustrates
19 // Node* node = iterator.Next();
20 // // do something with node.
27 // evaluated on each tree node and if it evaluates to true the node and all
29 TreeNodeIterator(NodeType* node, bool (*prune)(NodeType*))
33 // Move forward through the children list until the first non prunable node.
35 // Position at the top of the _positions list must point to a node th
92 PositionNodeType* node; member in struct:ui::TreeNodeIterator::Position
[all...] |
| /external/clang/test/CodeGenCXX/ |
| constructor-template.cpp | 28 template <typename T> class Node {
31 Node(){ } // Node<BinomialNode<int>*>::Node() remains undefined.
32 ~Node() {}
36 template<typename T> class BinomialNode : Node<BinomialNode<T>*> {
44 BinomialNode<int> *node = new BinomialNode<int>(1); local
45 delete node;
|
| /external/clang/test/Modules/Inputs/ |
| templates-top.h | 7 struct node {}; struct in class:List
8 node *head;
|
