| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| AEscapeCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
52 public void setPosition(PPosition node)
59 if(node != null)
61 if(node.parent() != null)
63 node.parent().removeChild(node);
66 node.parent(this);
69 this._position_ = node;
77 public void setExpression(PExpression node)
84 if(node != null
[all...] |
| ASetCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
52 public void setPosition(PPosition node)
59 if(node != null)
61 if(node.parent() != null)
63 node.parent().removeChild(node);
66 node.parent(this);
69 this._position_ = node;
77 public void setVariable(PVariable node)
84 if(node != null
[all...] |
| Switchable.java | 3 package com.google.clearsilver.jsilver.syntax.node;
|
| /external/v8/src/compiler/ |
| js-generic-lowering.cc | 11 #include "src/compiler/node-matchers.h"
12 #include "src/compiler/node-properties.h"
19 static CallDescriptor::Flags AdjustFrameStatesForCall(Node* node) {
20 int count = OperatorProperties::GetFrameStateInputCount(node->op());
22 int index = NodeProperties::FirstFrameStateIndex(node) + 1;
24 node->RemoveInput(index);
36 Reduction JSGenericLowering::Reduce(Node* node) {
37 switch (node->opcode())
[all...] |
| int64-lowering.cc | 11 #include "src/compiler/node-matchers.h"
12 #include "src/compiler/node-properties.h"
14 #include "src/compiler/node.h"
50 if (top.input_index == top.node->InputCount()) {
53 state_.Set(top.node, State::kVisited);
54 LowerNode(top.node);
57 Node* input = top.node->InputAt(top.input_index++);
103 void Int64Lowering::GetIndexNodes(Node* index, Node*& index_low
[all...] |
| instruction-selector.cc | 11 #include "src/compiler/node-matchers.h"
52 for (Node* const phi : *block) {
56 for (Node* const input : phi->inputs()) {
222 bool InstructionSelector::CanCover(Node* user, Node* node) const {
223 // 1. Both {user} and {node} must be in the same basic block.
224 if (schedule()->block(node) != schedule()->block(user)) {
227 // 2. Pure {node}s must be owned by the {user}.
228 if (node->op()->HasProperty(Operator::kPure))
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_metaclass.py | 23 from ..fixer_util import Name, syms, Node, Leaf
32 for node in parent.children:
33 if node.type == syms.suite:
34 return has_metaclass(node)
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
49 for node in cls_node.children:
50 if node.type == syms.suite:
54 # !%@#! oneliners have no suite node, we have to fake one u
[all...] |
| fix_ne.py | 17 def match(self, node):
19 return node.value == u"<>"
21 def transform(self, node, results):
22 new = pytree.Leaf(token.NOTEQUAL, u"!=", prefix=node.prefix)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_metaclass.py | 23 from ..fixer_util import Name, syms, Node, Leaf
32 for node in parent.children:
33 if node.type == syms.suite:
34 return has_metaclass(node)
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
49 for node in cls_node.children:
50 if node.type == syms.suite:
54 # !%@#! oneliners have no suite node, we have to fake one u
[all...] |
| fix_ne.py | 17 def match(self, node):
19 return node.value == u"<>"
21 def transform(self, node, results):
22 new = pytree.Leaf(token.NOTEQUAL, u"!=", prefix=node.prefix)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_metaclass.py | 23 from ..fixer_util import Name, syms, Node, Leaf
32 for node in parent.children:
33 if node.type == syms.suite:
34 return has_metaclass(node)
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
49 for node in cls_node.children:
50 if node.type == syms.suite:
54 # !%@#! oneliners have no suite node, we have to fake one u
[all...] |
| fix_ne.py | 17 def match(self, node):
19 return node.value == u"<>"
21 def transform(self, node, results):
22 new = pytree.Leaf(token.NOTEQUAL, u"!=", prefix=node.prefix)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_metaclass.py | 23 from ..fixer_util import Name, syms, Node, Leaf
32 for node in parent.children:
33 if node.type == syms.suite:
34 return has_metaclass(node)
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
49 for node in cls_node.children:
50 if node.type == syms.suite:
54 # !%@#! oneliners have no suite node, we have to fake one u
[all...] |
| fix_ne.py | 17 def match(self, node):
19 return node.value == u"<>"
21 def transform(self, node, results):
22 new = pytree.Leaf(token.NOTEQUAL, u"!=", prefix=node.prefix)
|
| /bionic/libc/upstream-openbsd/lib/libc/stdlib/ |
| tfind.c | 20 } node; typedef in typeref:struct:node_t
22 /* find a node, or return 0 */
28 node **rootp = (node **)vrootp;
40 return (node *)0;
|
| /external/ltrace/ |
| expr.h | 54 } node; member in union:expr_node::__anon18409
79 void expr_init_self(struct expr_node *node);
83 void expr_init_named(struct expr_node *node,
87 void expr_init_argno(struct expr_node *node, size_t num);
90 * copied into NODE and owned by it. */
91 void expr_init_const(struct expr_node *node, struct value *val);
92 void expr_init_const_word(struct expr_node *node, long l,
97 void expr_init_index(struct expr_node *node,
103 void expr_init_up(struct expr_node *node, struct expr_node *lhs, int own_lhs);
107 void expr_init_cb1(struct expr_node *node,
[all...] |
| /external/mesa3d/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/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
| debug.rb | 22 node = super
23 @debug_listener.create_node( node, payload )
24 return node
28 node = super
29 @debug_listener.create_node( node )
30 return node
34 node = super
35 @debug_listener.create_node( node )
36 return node
40 node = supe
[all...] |
| /external/chromium-trace/catapult/third_party/html5lib-python/html5lib/treewalkers/ |
| etree.py | 36 4. A flag "text", "tail" or None to indicate if the current node is a
37 text node; either the text or tail of the current element (1)
39 def getNodeDetails(self, node):
40 if isinstance(node, tuple): # It might be the root Element
41 elt, key, parents, flag = node
45 node = elt
47 if not(hasattr(node, "tag")):
48 node = node.getroot()
50 if node.tag in ("DOCUMENT_ROOT", "DOCUMENT_FRAGMENT")
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/interpreter/ |
| TemplateInterpreter.java | 27 import com.google.clearsilver.jsilver.syntax.node.AAltCommand;
28 import com.google.clearsilver.jsilver.syntax.node.AAutoescapeCommand;
29 import com.google.clearsilver.jsilver.syntax.node.ACallCommand;
30 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
31 import com.google.clearsilver.jsilver.syntax.node.ADefCommand;
32 import com.google.clearsilver.jsilver.syntax.node.AEachCommand;
33 import com.google.clearsilver.jsilver.syntax.node.AEscapeCommand;
34 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand;
35 import com.google.clearsilver.jsilver.syntax.node.AHardIncludeCommand;
36 import com.google.clearsilver.jsilver.syntax.node.AHardLincludeCommand
[all...] |
| /device/huawei/angler/camera/QCamera2/util/ |
| QCameraQueue.cpp | 61 * @data_rel_fn : function ptr to release node data internal resource
140 camera_q_node *node = local
142 if (NULL == node) {
147 memset(node, 0, sizeof(camera_q_node));
148 node->data = data;
152 cam_list_add_tail_node(&node->list, &m_head.list);
156 free(node);
177 camera_q_node *node = local
179 if (NULL == node) {
184 memset(node, 0, sizeof(camera_q_node))
217 camera_q_node* node = NULL; local
252 camera_q_node* node = NULL; local
292 camera_q_node* node = NULL; local
334 camera_q_node* node = NULL; local
379 camera_q_node* node = NULL; local
[all...] |
| /device/lge/bullhead/camera/QCamera2/util/ |
| QCameraQueue.cpp | 61 * @data_rel_fn : function ptr to release node data internal resource
140 camera_q_node *node = local
142 if (NULL == node) {
147 memset(node, 0, sizeof(camera_q_node));
148 node->data = data;
152 cam_list_add_tail_node(&node->list, &m_head.list);
156 free(node);
177 camera_q_node *node = local
179 if (NULL == node) {
184 memset(node, 0, sizeof(camera_q_node))
217 camera_q_node* node = NULL; local
252 camera_q_node* node = NULL; local
292 camera_q_node* node = NULL; local
334 camera_q_node* node = NULL; local
379 camera_q_node* node = NULL; local
[all...] |
| /external/c-ares/ |
| ares_llist.c | 26 /* Initialize a new head node */
33 /* Initialize a list node */
34 void ares__init_list_node(struct list_node* node, void* d) {
35 node->prev = NULL;
36 node->next = NULL;
37 node->data = d;
54 /* Removes the node from the list it's in, if any */
55 void ares__remove_from_list(struct list_node* node) {
56 if (node->next != NULL) {
57 node->prev->next = node->next
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| StructuralWhitespaceStripper.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.AEscapeCommand;
26 import com.google.clearsilver.jsilver.syntax.node.AEvarCommand;
27 import com.google.clearsilver.jsilver.syntax.node.AIfCommand;
28 import com.google.clearsilver.jsilver.syntax.node.ALoopCommand;
29 import com.google.clearsilver.jsilver.syntax.node.ALoopIncCommand
[all...] |
| /external/libselinux/src/ |
| stringrep.c | 34 struct discover_class_node *node = discover_class_cache; local
36 for (; node != NULL && strcmp(s,node->name) != 0; node = node->next);
38 return node;
43 struct discover_class_node *node = discover_class_cache; local
45 for (; node != NULL && c != node->value; node = node->next)
59 struct discover_class_node *node; local
163 struct discover_class_node *node; local
180 struct discover_class_node *node; local
197 struct discover_class_node *node; local
210 struct discover_class_node *node; local
[all...] |
