| /external/vboot_reference/firmware/stub/ |
| vboot_api_stub_sf.c | 46 struct alloc_node *node; local
54 node = malloc(sizeof(*node));
55 if (!node)
57 node->next = alloc_head;
58 node->ptr = p;
59 node->size = size;
60 node->bt_levels = backtrace(node->bt_buffer, MAX_STACK_LEVELS);
61 alloc_head = node;
107 struct alloc_node *node, *next; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| InlineRewriter.java | 22 import com.google.clearsilver.jsilver.syntax.node.ADataCommand;
23 import com.google.clearsilver.jsilver.syntax.node.AInlineCommand;
24 import com.google.clearsilver.jsilver.syntax.node.ANoopCommand;
25 import com.google.clearsilver.jsilver.syntax.node.PCommand;
26 import com.google.clearsilver.jsilver.syntax.node.TData;
64 public void caseADataCommand(ADataCommand node) {
65 TData data = node.getData();
67 node.replaceBy(new ANoopCommand());
77 public void caseAInlineCommand(AInlineCommand node) {
79 PCommand command = node.getCommand()
[all...] |
| /external/tensorflow/tensorflow/contrib/py2tf/pyct/ |
| anno.py | 41 'This node should be preserved as is and not processed any further.')
43 'When a node is annotated with this, the remainder of the block should '
49 def getanno(node, key, field_name='___pyct_anno'):
50 return getattr(node, field_name)[key]
53 def hasanno(node, key, field_name='___pyct_anno'):
54 return hasattr(node, field_name) and key in getattr(node, field_name)
57 def setanno(node, key, value, field_name='___pyct_anno'):
58 annotations = getattr(node, field_name, {})
59 setattr(node, field_name, annotations
[all...] |
| ast_util.py | 37 def generic_visit(self, node):
39 for f in node._fields:
42 if not hasattr(node, f):
44 v = getattr(node, f)
55 new_node = type(node)(**new_fields)
56 if anno.hasanno(node, anno.Basic.SKIP_PROCESSING):
61 def copy_clean(node):
63 if isinstance(node, list):
64 return [copier.visit(n) for n in node]
65 elif isinstance(node, tuple)
[all...] |
| anno_test.py | 30 node = ast.Name()
32 self.assertFalse(anno.hasanno(node, 'foo'))
34 anno.getanno(node, 'foo')
36 anno.setanno(node, 'foo', 3)
37 self.assertTrue(anno.hasanno(node, 'foo'))
38 self.assertEqual(3, anno.getanno(node, 'foo'))
40 anno.delanno(node, 'foo')
41 self.assertFalse(anno.hasanno(node, 'foo'))
43 anno.getanno(node, 'foo')
|
| /external/v8/src/compiler/ |
| js-typed-lowering.h | 45 Reduction Reduce(Node* node) final;
50 Reduction ReduceJSAdd(Node* node);
51 Reduction ReduceJSComparison(Node* node);
52 Reduction ReduceJSLoadNamed(Node* node);
53 Reduction ReduceJSLoadProperty(Node* node);
[all...] |
| js-builtin-reducer.h | 45 Reduction Reduce(Node* node) final;
48 Reduction ReduceArrayIterator(Node* node, IterationKind kind);
49 Reduction ReduceTypedArrayIterator(Node* node, IterationKind kind);
50 Reduction ReduceArrayIterator(Handle<Map> receiver_map, Node* node,
53 Reduction ReduceArrayIteratorNext(Node* node);
[all...] |
| graph-reducer.cc | 10 #include "src/compiler/node.h"
11 #include "src/compiler/node-properties.h"
28 GraphReducer::GraphReducer(Zone* zone, Graph* graph, Node* dead)
48 void GraphReducer::ReduceNode(Node* node) {
51 Push(node);
54 // Process the node on the top of the stack, potentially pushing more or
55 // popping the node off the stack.
59 Node* const node = revisit_.top() local
113 Node* node = entry.node; local
[all...] |
| checkpoint-elimination.cc | 7 #include "src/compiler/node-properties.h"
21 bool IsRedundantCheckpoint(Node* node) {
22 Node* effect = NodeProperties::GetEffectInput(node);
33 Reduction CheckpointElimination::ReduceCheckpoint(Node* node) {
34 DCHECK_EQ(IrOpcode::kCheckpoint, node->opcode());
35 if (IsRedundantCheckpoint(node)) {
36 return Replace(NodeProperties::GetEffectInput(node));
[all...] |
| /external/webrtc/webrtc/modules/audio_processing/transient/ |
| wpd_node_unittest.cc | 32 WPDNode node(kDataLength, kCoefficients, kCoefficientsLength);
33 EXPECT_EQ(0, node.set_data(kParentData, kDataLength));
34 EXPECT_EQ(0, memcmp(node.data(),
36 kDataLength * sizeof(node.data()[0])));
41 WPDNode node(kDataLength, &kIndentyCoefficient, 1);
42 EXPECT_EQ(0, node.Update(kParentData, kParentDataLength));
44 EXPECT_FLOAT_EQ(kParentData[i * 2 + 1], node.data()[i]);
49 WPDNode node(kDataLength, kCoefficients, kCoefficientsLength);
50 EXPECT_EQ(0, node.Update(kParentData, kParentDataLength));
51 EXPECT_NEAR(0.1f, node.data()[0], kTolerance)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseIterators.java | 39 * Construct a DTMDefaultBaseTraversers object from a DOM node.
61 * Construct a DTMDefaultBaseTraversers object from a DOM node.
72 * @param usePrevsib true if we want to build the previous sibling node array.
92 * with a start node (using iterator.setStartNode()).
174 * with a start node (using iterator.setStartNode()).
257 * returned (starting point for the next() search); for single-node
258 * iterators it may instead be initialized to point to that single node.
263 * Remembers the current node for the next call to gotoMark().
273 * Restores the current node remembered by setMark().
285 * Iterator that returns all immediate children of a given node
328 int node = _currentNode; local
473 int node = _currentNode; local
628 int node = _currentNode; local
666 int node; local
771 int node = _startNode; local
852 int node = _currentNode; local
936 int node = _currentNode; local
1005 final int node = _currentNode; local
1068 final int node = _currentNode; local
1159 final int node = _currentNode; local
1196 int node = _currentNode; local
1427 int node = _currentNode; local
1532 int node = _currentNode; local
1568 int node; local
1881 int node = _currentNode; local
1946 int node; local
2002 int node; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
| TokenIndex.java | 5 import com.google.clearsilver.jsilver.syntax.node.*;
13 public void caseTData(@SuppressWarnings("unused") TData node)
19 public void caseTComment(@SuppressWarnings("unused") TComment node)
25 public void caseTVar(@SuppressWarnings("unused") TVar node)
31 public void caseTLvar(@SuppressWarnings("unused") TLvar node)
37 public void caseTEvar(@SuppressWarnings("unused") TEvar node)
43 public void caseTUvar(@SuppressWarnings("unused") TUvar node)
49 public void caseTSet(@SuppressWarnings("unused") TSet node)
55 public void caseTIf(@SuppressWarnings("unused") TIf node)
61 public void caseTElseIf(@SuppressWarnings("unused") TElseIf node)
[all...] |
| /external/v8/src/interpreter/ |
| bytecode-peephole-optimizer.cc | 45 void BytecodePeepholeOptimizer::WriteJump(BytecodeNode* node,
47 // Handlers for jump bytecodes do not emit |node| as WriteJump()
50 ApplyPeepholeAction(node);
51 next_stage()->WriteJump(node, label);
55 void BytecodePeepholeOptimizer::Write(BytecodeNode* node) {
58 ApplyPeepholeAction(node);
76 void BytecodePeepholeOptimizer::SetLast(const BytecodeNode* const node) {
80 DCHECK(node->bytecode() != Bytecode::kNop || node->source_info().is_valid());
81 last_ = *node;
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| ALoopCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
62 public void setPosition(PPosition node)
69 if(node != null)
71 if(node.parent() != null)
73 node.parent().removeChild(node);
76 node.parent(this);
79 this._position_ = node;
87 public void setVariable(PVariable node)
94 if(node != null
[all...] |
| /external/oj-libjdwp/make/src/classes/build/tools/jdwpgen/ |
| RootNode.java | 33 void constrainComponent(Context ctx, Node node) {
34 if (node instanceof CommandSetNode ||
35 node instanceof ConstantSetNode) {
36 node.constrain(ctx);
38 error("Expected 'CommandSet' item, got: " + node);
45 for (Node node : components) {
46 node.documentIndex(writer);
48 for (Node node : components)
[all...] |
| /external/parameter-framework/upstream/tools/xmlGenerator/ |
| hostConfig.py | 43 for node in dom.getElementsByTagName("ParameterFrameworkConfiguration"):
45 node.setAttribute("ServerPort", serverPort)
46 node.setAttribute("TuningAllowed", "true")
49 for node in dom.getElementsByTagName(tag):
50 node.parentNode.removeChild(node)
55 for node in dom.getElementsByTagName("StructureDescriptionFileLocation"):
56 node.setAttribute("Path", structPath + "/" + node.getAttribute("Path"))
|
| /external/selinux/libsemanage/src/ |
| node_record.c | 28 int semanage_node_compare(const semanage_node_t * node,
32 return sepol_node_compare(node, key);
37 int semanage_node_compare2(const semanage_node_t * node,
41 return sepol_node_compare2(node, node2);
46 hidden int semanage_node_compare2_qsort(const semanage_node_t ** node,
50 return sepol_node_compare2(*node, *node2);
64 const semanage_node_t * node,
68 return sepol_node_key_extract(handle->sepolh, node, key_ptr);
83 const semanage_node_t * node, char **addr_ptr)
86 return sepol_node_get_addr(handle->sepolh, node, addr_ptr)
[all...] |
| /external/tensorflow/tensorflow/contrib/py2tf/converters/ |
| asserts.py | 32 def visit_Assert(self, node):
33 self.generic_visit(node)
41 if node.msg is None:
43 template, test=node.test, msg=gast.Str('Assertion error'))
44 elif isinstance(node.msg, gast.Str):
45 return templates.replace(template, test=node.test, msg=node.msg)
52 def transform(node, context):
53 return AssertsTransformer(context).visit(node)
|
| builtin_functions.py | 39 def _convert_len(self, node):
43 return templates.replace(template, args=node.args)[0].value
45 def _convert_print(self, node):
49 return templates.replace(template, args=node.args)[0].value
51 def visit_Call(self, node):
52 self.generic_visit(node)
54 if isinstance(node.func, gast.Name) and node.func.id == 'len':
55 return self._convert_len(node)
56 if isinstance(node.func, gast.Name) and node.func.id == 'print'
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/lexicalpreservation/ |
| PhantomNodeLogic.java | 24 import com.github.javaparser.ast.Node;
41 private static final Map<Node, Boolean> isPhantomNodeCache = synchronizedMap(new IdentityHashMap<>());
45 public void parentChange(Node observedNode, Node previousParent, Node newParent) {
50 static boolean isPhantomNode(Node node) {
51 if (isPhantomNodeCache.containsKey(node)) {
52 return isPhantomNodeCache.get(node);
54 if (node instanceof UnknownType)
[all...] |
| /external/icu/icu4c/source/common/ |
| ucharstrie.cpp | 37 int32_t node; local
38 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
39 valueResult(node) : USTRINGTRIE_NO_VALUE;
85 int32_t node=*pos; local
86 if(node&kValueIsFinal) {
92 // int32_t delta=readValue(pos, node);
94 if(node<kMinTwoUnitValueLead) {
95 delta=node;
96 } else if(node<kThreeUnitValueLead) {
97 delta=((node-kMinTwoUnitValueLead)<<16)|*pos++
115 int32_t node=*pos; local
125 int32_t node=*pos++; local
166 int32_t node; local
198 int32_t node; local
218 int32_t node; local
236 int32_t node=*pos++; local
299 int32_t node=*pos++; local
325 int32_t node=*pos++; local
376 int32_t node=*pos++; local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/compiler/ |
| ExpressionTranslator.java | 28 import com.google.clearsilver.jsilver.syntax.node.AAddExpression;
29 import com.google.clearsilver.jsilver.syntax.node.AAndExpression;
30 import com.google.clearsilver.jsilver.syntax.node.ADecimalExpression;
31 import com.google.clearsilver.jsilver.syntax.node.ADescendVariable;
32 import com.google.clearsilver.jsilver.syntax.node.ADivideExpression;
33 import com.google.clearsilver.jsilver.syntax.node.AEqExpression;
34 import com.google.clearsilver.jsilver.syntax.node.AExistsExpression;
35 import com.google.clearsilver.jsilver.syntax.node.AFunctionExpression;
36 import com.google.clearsilver.jsilver.syntax.node.AGtExpression;
37 import com.google.clearsilver.jsilver.syntax.node.AGteExpression
[all...] |
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/util/ |
| huffman_codec.h | 42 // Huffman tree node.
43 struct Node {
44 Node() {}
46 // Creates Node from serialization leaving weight and id undefined.
47 Node(const Val& in_value, uint32_t in_left, uint32_t in_right)
72 // The queue is sorted in ascending order by weight (or by node id if
84 const uint32_t node = CreateNode(); local
85 MutableValueOf(node) = pair.first;
86 MutableWeightOf(node) = pair.second;
87 assert(WeightOf(node));
186 const uint32_t node = queue.front().first; local
229 uint32_t node = root_; local
351 uint32_t node; member in struct:spvutils::HuffmanCodec::Context
364 const uint32_t node = context.node; local
[all...] |
| /device/google/marlin/camera/QCamera2/util/ |
| QCameraQueue.cpp | 68 * @data_rel_fn : function ptr to release node data internal resource
147 camera_q_node *node = local
149 if (NULL == node) {
154 memset(node, 0, sizeof(camera_q_node));
155 node->data = data;
159 cam_list_add_tail_node(&node->list, &m_head.list);
163 free(node);
184 camera_q_node *node = local
186 if (NULL == node) {
191 memset(node, 0, sizeof(camera_q_node))
224 camera_q_node* node = NULL; local
259 camera_q_node* node = NULL; local
300 camera_q_node* node = NULL; local
344 camera_q_node* node = NULL; local
386 camera_q_node* node = NULL; local
431 camera_q_node* node = NULL; local
[all...] |
| /hardware/qcom/camera/msm8998/QCamera2/util/ |
| QCameraQueue.cpp | 68 * @data_rel_fn : function ptr to release node data internal resource
147 camera_q_node *node = local
149 if (NULL == node) {
154 memset(node, 0, sizeof(camera_q_node));
155 node->data = data;
159 cam_list_add_tail_node(&node->list, &m_head.list);
163 free(node);
184 camera_q_node *node = local
186 if (NULL == node) {
191 memset(node, 0, sizeof(camera_q_node))
224 camera_q_node* node = NULL; local
259 camera_q_node* node = NULL; local
300 camera_q_node* node = NULL; local
344 camera_q_node* node = NULL; local
386 camera_q_node* node = NULL; local
431 camera_q_node* node = NULL; local
[all...] |
