| /external/chromium_org/third_party/angle/src/compiler/translator/ |
| QualifierAlive.cpp | 33 bool QualifierWritten(TIntermNode* node, TQualifier qualifier)
37 if (node)
38 node->traverse(&it);
43 void TAliveTraverser::visitSymbol(TIntermSymbol* node)
48 if (node->getQualifier() == qualifier)
52 bool TAliveTraverser::visitSelection(Visit preVisit, TIntermSelection* node)
|
| /external/chromium_org/third_party/skia/src/views/ |
| SkParsePaint.cpp | 14 static SkShader* inflate_shader(const SkDOM& dom, const SkDOM::Node* node)
16 if ((node = dom.getFirstChild(node, "shader")) == NULL)
21 if (dom.hasAttr(node, "type", "linear-gradient"))
27 if ((str = dom.findAttr(node, "c0")) != NULL &&
29 (str = dom.findAttr(node, "c1")) != NULL &&
31 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
32 dom.findScalars(node, "p1", &pts[1].fX, 2))
37 if ((index = dom.findList(node, "tile-mode", "clamp,repeat,mirror")) >= 0
[all...] |
| /external/chromium_org/third_party/skia/src/xml/ |
| SkDOM.cpp | 16 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node)
18 const char* elemName = dom.getName(node);
23 SkDOM::AttrIter iter(dom, node);
30 if ((node = dom.getFirstChild(node)) != NULL)
32 if (!this->parse(dom, node))
34 } while ((node = dom.getNextSibling(node)) != NULL);
76 const SkDOM::Node* SkDOM::getRootNode() const
81 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) cons
217 SkDOM::Node* node = (SkDOM::Node*)fAlloc->alloc(sizeof(SkDOM::Node) + attrCount * sizeof(SkDOM::Attr), local
[all...] |
| /external/skia/src/views/ |
| SkParsePaint.cpp | 14 static SkShader* inflate_shader(const SkDOM& dom, const SkDOM::Node* node)
16 if ((node = dom.getFirstChild(node, "shader")) == NULL)
21 if (dom.hasAttr(node, "type", "linear-gradient"))
27 if ((str = dom.findAttr(node, "c0")) != NULL &&
29 (str = dom.findAttr(node, "c1")) != NULL &&
31 dom.findScalars(node, "p0", &pts[0].fX, 2) &&
32 dom.findScalars(node, "p1", &pts[1].fX, 2))
37 if ((index = dom.findList(node, "tile-mode", "clamp,repeat,mirror")) >= 0
[all...] |
| /external/skia/src/xml/ |
| SkDOM.cpp | 16 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node)
18 const char* elemName = dom.getName(node);
23 SkDOM::AttrIter iter(dom, node);
30 if ((node = dom.getFirstChild(node)) != NULL)
32 if (!this->parse(dom, node))
34 } while ((node = dom.getNextSibling(node)) != NULL);
76 const SkDOM::Node* SkDOM::getRootNode() const
81 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) cons
217 SkDOM::Node* node = (SkDOM::Node*)fAlloc->alloc(sizeof(SkDOM::Node) + attrCount * sizeof(SkDOM::Attr), local
[all...] |
| /external/chromium_org/content/browser/accessibility/ |
| browser_accessibility_manager.cc | 123 ui::AXNode* node) {
124 return GetFromID(node->id());
189 // Find the node corresponding to the id that's the target of the
191 ui::AXNode* node = tree_->GetFromId(param.id); local
192 if (!node)
198 SetFocus(node, false);
211 NotifyAccessibilityEvent(event_type, GetFromAXNode(node));
221 ui::AXNode* node = obj->node(); local
222 node->SetLocation(params[i].new_location)
229 BrowserAccessibility* node = BrowserAccessibilityManager::GetFocus(root); local
[all...] |
| /external/icu/icu4c/source/common/ |
| bytestrie.cpp | 72 int32_t node; local
73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
74 valueResult(node) : USTRINGTRIE_NO_VALUE;
102 int32_t node=*pos; local
103 U_ASSERT(node>=kMinValueLead);
104 if(node&kValueIsFinal) {
110 // int32_t delta=readValue(pos, node>>1);
111 node>>=1;
113 if(node<kMinTwoByteValueLead) {
114 delta=node-kMinOneByteValueLead
140 int32_t node=*pos; local
151 int32_t node=*pos++; local
395 int32_t node=*pos++; local
[all...] |
| /device/asus/flo/camera/QCamera2/util/ |
| QCameraQueue.cpp | 60 * @data_rel_fn : function ptr to release node data internal resource
121 camera_q_node *node = local
123 if (NULL == node) {
128 memset(node, 0, sizeof(camera_q_node));
129 node->data = data;
132 cam_list_add_tail_node(&node->list, &m_head.list);
151 camera_q_node *node = local
153 if (NULL == node) {
158 memset(node, 0, sizeof(camera_q_node));
159 node->data = data
187 camera_q_node* node = NULL; local
225 camera_q_node* node = NULL; local
264 camera_q_node* node = NULL; local
[all...] |
| /device/lge/hammerhead/camera/QCamera2/util/ |
| QCameraQueue.cpp | 60 * @data_rel_fn : function ptr to release node data internal resource
121 camera_q_node *node = local
123 if (NULL == node) {
128 memset(node, 0, sizeof(camera_q_node));
129 node->data = data;
132 cam_list_add_tail_node(&node->list, &m_head.list);
151 camera_q_node *node = local
153 if (NULL == node) {
158 memset(node, 0, sizeof(camera_q_node));
159 node->data = data
187 camera_q_node* node = NULL; local
225 camera_q_node* node = NULL; local
264 camera_q_node* node = NULL; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| DataCommandConsolidator.java | 20 import com.google.clearsilver.jsilver.syntax.node.AAltCommand;
21 import com.google.clearsilver.jsilver.syntax.node.ACallCommand;
22 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
23 import com.google.clearsilver.jsilver.syntax.node.ADefCommand;
24 import com.google.clearsilver.jsilver.syntax.node.AEachCommand;
25 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand;
26 import com.google.clearsilver.jsilver.syntax.node.AHardIncludeCommand;
27 import com.google.clearsilver.jsilver.syntax.node.AHardLincludeCommand;
28 import com.google.clearsilver.jsilver.syntax.node.AIfCommand;
29 import com.google.clearsilver.jsilver.syntax.node.AIncludeCommand
[all...] |
| /device/asus/flo/camera/QCamera2/stack/common/ |
| cam_queue.h | 53 cam_node_t *node = local
55 if (NULL == node) {
59 memset(node, 0, sizeof(cam_node_t));
60 node->data = data;
63 cam_list_add_tail_node(&node->list, &queue->head.list);
72 cam_node_t *node = NULL; local
81 node = member_of(pos, cam_node_t, list);
82 cam_list_del_node(&node->list);
87 if (NULL != node) {
88 data = node->data
97 cam_node_t *node = NULL; local
[all...] |
| /device/lge/hammerhead/camera/QCamera2/stack/common/ |
| cam_queue.h | 53 cam_node_t *node = local
55 if (NULL == node) {
59 memset(node, 0, sizeof(cam_node_t));
60 node->data = data;
63 cam_list_add_tail_node(&node->list, &queue->head.list);
72 cam_node_t *node = NULL; local
81 node = member_of(pos, cam_node_t, list);
82 cam_list_del_node(&node->list);
87 if (NULL != node) {
88 data = node->data
97 cam_node_t *node = NULL; local
[all...] |
| /device/moto/shamu/camera/QCamera2/stack/common/ |
| cam_queue.h | 53 cam_node_t *node = local
55 if (NULL == node) {
59 memset(node, 0, sizeof(cam_node_t));
60 node->data = data;
63 cam_list_add_tail_node(&node->list, &queue->head.list);
72 cam_node_t *node = NULL; local
81 node = member_of(pos, cam_node_t, list);
82 cam_list_del_node(&node->list);
87 if (NULL != node) {
88 data = node->data
97 cam_node_t *node = NULL; local
[all...] |
| /external/chromium_org/third_party/jinja2/ |
| visitor.py | 11 from jinja2.nodes import Node
16 node found. The visitor functions may return values which will be
20 class name of the node. So a `TryFinally` node visit function would
22 the `get_visitor` function. If no visitor function exists for a node
26 def get_visitor(self, node):
27 """Return the visitor function for this node or `None` if no visitor
28 exists for this node. In that case the generic visit function is
31 method = 'visit_' + node.__class__.__name__
34 def visit(self, node, *args, **kwargs)
[all...] |
| /external/libsepol/include/sepol/ |
| node_record.h | 17 extern int sepol_node_compare(const sepol_node_t * node,
20 extern int sepol_node_compare2(const sepol_node_t * node,
33 const sepol_node_t * node,
40 const sepol_node_t * node, char **addr);
43 const sepol_node_t * node,
47 sepol_node_t * node,
51 sepol_node_t * node,
56 const sepol_node_t * node, char **mask);
59 const sepol_node_t * node,
63 sepol_node_t * node,
[all...] |
| /hardware/intel/img/psb_video/src/ |
| psb_ws_driver.c | 51 struct _ValidateNode *node = malloc(sizeof(*node)); local
53 if (node == NULL) return NULL;
55 node->func = func;
56 node->type_id = 1;
57 return node;
62 * Free an allocated validate list node.
66 psb_free(struct _ValidateNode *node)
68 if (node->type_id == 0)
69 free(containerOf(node, struct _PsbDrmValidateNode, base))
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| LinkedNode.java | 28 public void insert(LinkedNode node) {
29 node.mNext = mNext;
30 mNext.mPrev = node;
31 node.mPrev = this;
32 mNext = node;
46 public void insertLast(T node) {
47 mHead.mPrev.insert(node);
58 public T nextOf(T node) {
59 return (T) (node.mNext == mHead ? null : node.mNext)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| WeakNodeMap.cpp | 8 #include "core/dom/Node.h"
14 bool addedToMap(Node*, WeakNodeMap*);
15 bool removedFromMap(Node*, WeakNodeMap*);
16 void nodeDestroyed(Node*);
26 typedef HashMap<Node*, OwnPtr<MapList> > NodeToMapList;
30 bool NodeToWeakNodeMaps::addedToMap(Node* node, WeakNodeMap* map)
32 NodeToMapList::AddResult result = m_nodeToMapList.add(node, nullptr);
39 bool NodeToWeakNodeMaps::removedFromMap(Node* node, WeakNodeMap* map
65 Node* node = it->key; local
87 Node* WeakNodeMap::node(int value) function in class:WebCore::WeakNodeMap
[all...] |
| ElementTraversal.h | 37 // First or last ElementType child of the node.
39 static ElementType* firstChild(const Node& current) { return firstChildTemplate(current); }
41 static ElementType* lastChild(const Node& current) { return lastChildTemplate(current); }
43 // First ElementType ancestor of the node.
44 static ElementType* firstAncestor(const Node& current);
45 static ElementType* firstAncestorOrSelf(Node& current) { return firstAncestorOrSelfTemplate(current); }
48 // First or last ElementType descendant of the node.
51 static ElementType* firstWithin(const Node& current) { return firstWithinTemplate(current); }
53 static ElementType* lastWithin(const Node& current) { return lastWithinTemplate(current); }
57 static ElementType* next(const Node& current) { return nextTemplate(current);
122 Node* node = NodeTraversal::lastWithin(current); local
132 Node* node = NodeTraversal::next(current); local
142 Node* node = NodeTraversal::next(current, stayWithin); local
152 Node* node = NodeTraversal::previous(current); local
162 Node* node = NodeTraversal::previous(current, stayWithin); local
173 Node* node = current.firstChild(); local
201 Node* node = current.lastChild(); local
271 Node* node = NodeTraversal::nextSkippingChildren(current); local
281 Node* node = NodeTraversal::nextSkippingChildren(current, stayWithin); local
290 Node* node = NodeTraversal::previousIncludingPseudo(current, stayWithin); local
299 Node* node = NodeTraversal::nextIncludingPseudo(current, stayWithin); local
308 Node* node = NodeTraversal::nextIncludingPseudoSkippingChildren(current, stayWithin); local
317 Node* node = current.pseudoAwarePreviousSibling(); local
326 Node* node = current.previousSibling(); local
335 Node* node = current.nextSibling(); local
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 15 tree: an instance of ast.Node
19 correct order. For each node, it checks the visitor argument for
21 node's class, e.g. Class. If the method exists, it is called
22 with the node as its sole argument.
24 The visitor method for a particular node type can control how
29 be used to visit a child node of arbitrary type.
35 self.node = None
38 def default(self, node, *args):
39 for child in node.getChildNodes():
42 def dispatch(self, node, *args)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_operator.py | 41 def transform(self, node, results):
42 method = self._check_method(node, results)
44 return method(node, results)
47 def _sequenceIncludes(self, node, results):
48 return self._handle_rename(node, results, u"contains")
51 def _isCallable(self, node, results):
54 return Call(Name(u"hasattr"), args, prefix=node.prefix)
57 def _repeat(self, node, results):
58 return self._handle_rename(node, results, u"mul")
61 def _irepeat(self, node, results)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| visitor.py | 15 tree: an instance of ast.Node
19 correct order. For each node, it checks the visitor argument for
21 node's class, e.g. Class. If the method exists, it is called
22 with the node as its sole argument.
24 The visitor method for a particular node type can control how
29 be used to visit a child node of arbitrary type.
35 self.node = None
38 def default(self, node, *args):
39 for child in node.getChildNodes():
42 def dispatch(self, node, *args)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_operator.py | 41 def transform(self, node, results):
42 method = self._check_method(node, results)
44 return method(node, results)
47 def _sequenceIncludes(self, node, results):
48 return self._handle_rename(node, results, u"contains")
51 def _isCallable(self, node, results):
54 return Call(Name(u"hasattr"), args, prefix=node.prefix)
57 def _repeat(self, node, results):
58 return self._handle_rename(node, results, u"mul")
61 def _irepeat(self, node, results)
[all...] |
| /development/ndk/platforms/android-3/include/linux/ |
| node.h | 18 struct node { struct
22 #define to_node(sys_device) container_of(sys_device, struct node, sysdev)
|
| /external/chromium_org/chrome/browser/extensions/api/bookmarks/ |
| bookmark_apitest.cc | 34 base::DictionaryValue* node = new base::DictionaryValue(); local
35 node->SetString("name", "Managed Bookmark");
36 node->SetString("url", "http://www.chromium.org");
37 list.Append(node);
38 node = new base::DictionaryValue();
39 node->SetString("name", "Managed Folder");
40 node->Set("children", new base::ListValue());
41 list.Append(node);
|
