| /external/fio/lib/ |
| rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
27 struct rb_node *right = node->rb_right;
28 struct rb_node *parent = rb_parent(node);
30 if ((node->rb_right = right->rb_left))
31 rb_set_parent(right->rb_left, node);
32 right->rb_left = node;
38 if (node == parent->rb_left)
45 rb_set_parent(node, right);
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root)
50 struct rb_node *left = node->rb_left
[all...] |
| /external/v8/src/compiler/ |
| effect-control-linearizer.h | 10 #include "src/compiler/node.h"
39 void ProcessNode(Node* node, Node** frame_state, Node** effect,
40 Node** control);
42 bool TryWireInStateEffect(Node* node, Node* frame_state, Node** effect
[all...] |
| js-intrinsic-lowering.h | 40 Reduction Reduce(Node* node) final;
43 Reduction ReduceCreateIterResultObject(Node* node);
44 Reduction ReduceDebugIsActive(Node* node);
45 Reduction ReduceDeoptimizeNow(Node* node);
46 Reduction ReduceGeneratorClose(Node* node);
[all...] |
| escape-analysis-reducer.cc | 34 Reduction EscapeAnalysisReducer::ReduceNode(Node* node) {
35 if (node->id() < static_cast<NodeId>(fully_reduced_.length()) &&
36 fully_reduced_.Contains(node->id())) {
40 switch (node->opcode()) {
43 return ReduceLoad(node);
46 return ReduceStore(node);
48 return ReduceAllocate(node);
50 return ReduceFinishRegion(node);
52 return ReduceReferenceEqual(node);
[all...] |
| js-intrinsic-lowering.cc | 13 #include "src/compiler/node-matchers.h"
14 #include "src/compiler/node-properties.h"
27 Reduction JSIntrinsicLowering::Reduce(Node* node) {
28 if (node->opcode() != IrOpcode::kJSCallRuntime) return NoChange();
30 Runtime::FunctionForId(CallRuntimeParametersOf(node->op()).id());
34 return ReduceCreateIterResultObject(node);
36 return ReduceDebugIsActive(node);
38 return ReduceDeoptimizeNow(node);
40 return ReduceGeneratorClose(node);
[all...] |
| simplified-lowering.h | 10 #include "src/compiler/node.h"
31 void DoMax(Node* node, Operator const* op, MachineRepresentation rep);
32 void DoMin(Node* node, Operator const* op, MachineRepresentation rep);
33 void DoJSToNumberTruncatesToFloat64(Node* node,
35 void DoJSToNumberTruncatesToWord32(Node* node,
38 // representation analysis is stored in the node bounds
[all...] |
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/ |
| AddressListParserVisitor.java | 7 public Object visit(SimpleNode node, Object data);
8 public Object visit(ASTaddress_list node, Object data);
9 public Object visit(ASTaddress node, Object data);
10 public Object visit(ASTmailbox node, Object data);
11 public Object visit(ASTname_addr node, Object data);
12 public Object visit(ASTgroup_body node, Object data);
13 public Object visit(ASTangle_addr node, Object data);
14 public Object visit(ASTroute node, Object data);
15 public Object visit(ASTphrase node, Object data);
16 public Object visit(ASTaddr_spec node, Object data)
[all...] |
| /system/core/liblog/ |
| config_read.h | 31 struct android_log_transport_read, node); \
33 struct android_log_transport_read, node)) && \
34 ((transp) != node_to_item((transp)->node.next, \
35 struct android_log_transport_read, node)); \
36 (transp) = node_to_item((transp)->node.next, \
37 struct android_log_transport_read, node))
41 struct android_log_transport_read, node), \
42 (n) = (transp)->node.next; \
44 struct android_log_transport_read, node)) && \
46 node_to_item((n), struct android_log_transport_read, node)); \
[all...] |
| config_write.h | 31 struct android_log_transport_write, node); \
33 struct android_log_transport_write, node)) && \
34 ((transp) != node_to_item((transp)->node.next, \
35 struct android_log_transport_write, node)); \
36 (transp) = node_to_item((transp)->node.next, \
37 struct android_log_transport_write, node))
41 struct android_log_transport_write, node), \
42 (n) = (transp)->node.next; \
44 struct android_log_transport_write, node)) && \
46 node_to_item((n), struct android_log_transport_write, node)); \
[all...] |
| /device/google/contexthub/firmware/os/core/ |
| heap.c | 67 static inline struct HeapNode* heapPrvGetNext(struct HeapNode* node)
69 return (gHeapTail == node) ? NULL : (struct HeapNode*)(node->data + node->size);
75 struct HeapNode* node; local
77 node = gHeapHead = (struct HeapNode*)ALIGNED_HEAP_START;
82 gHeapTail = node;
84 node->used = 0;
85 node->prev = NULL;
86 node->size = size - sizeof(struct HeapNode)
95 struct HeapNode *node = gHeapHead, *next; local
117 struct HeapNode *node, *best = NULL; local
170 struct HeapNode *node, *t; local
207 struct HeapNode *node; local
235 struct HeapNode *node; local
260 struct HeapNode *node; local
[all...] |
| /external/tensorflow/tensorflow/contrib/lite/toco/ |
| import_tensorflow.cc | 66 bool HasAttr(const NodeDef& node, const string& attr_name) {
67 return node.attr().count(attr_name) > 0;
70 const string& GetStringAttr(const NodeDef& node, const string& attr_name) {
71 CHECK(HasAttr(node, attr_name));
72 const auto& attr = node.attr().at(attr_name);
77 int GetIntAttr(const NodeDef& node, const string& attr_name) {
78 CHECK(HasAttr(node, attr_name)) << attr_name << " not found in:\n"
79 << node.DebugString();
80 const auto& attr = node.attr().at(attr_name);
85 float GetFloatAttr(const NodeDef& node, const string& attr_name)
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| TypeResolver.java | 20 import com.google.clearsilver.jsilver.syntax.node.AAddExpression;
21 import com.google.clearsilver.jsilver.syntax.node.ADecimalExpression;
22 import com.google.clearsilver.jsilver.syntax.node.ADivideExpression;
23 import com.google.clearsilver.jsilver.syntax.node.AEqExpression;
24 import com.google.clearsilver.jsilver.syntax.node.AFunctionExpression;
25 import com.google.clearsilver.jsilver.syntax.node.AHexExpression;
26 import com.google.clearsilver.jsilver.syntax.node.AModuloExpression;
27 import com.google.clearsilver.jsilver.syntax.node.AMultiplyExpression;
28 import com.google.clearsilver.jsilver.syntax.node.ANameVariable;
29 import com.google.clearsilver.jsilver.syntax.node.ANeExpression
[all...] |
| /external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/analysis/ |
| MethodCoverageImplTest.java | 27 MethodCoverageImpl node = new MethodCoverageImpl("emptySet", local
30 assertEquals(ICoverageNode.ElementType.METHOD, node.getElementType());
31 assertEquals("emptySet", node.getName());
32 assertEquals("()Ljava/util/Set;", node.getDesc());
34 node.getSignature());
39 ICoverageNode node = new MethodCoverageImpl("sample", "()V", null); local
41 assertEquals(CounterImpl.COUNTER_0_0, node.getInstructionCounter());
42 assertEquals(CounterImpl.COUNTER_0_0, node.getBranchCounter());
43 assertEquals(CounterImpl.COUNTER_0_0, node.getLineCounter());
44 assertEquals(CounterImpl.COUNTER_0_0, node.getComplexityCounter())
51 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
61 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
71 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
78 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
86 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
94 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
102 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
110 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
118 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
126 MethodCoverageImpl node = new MethodCoverageImpl("sample", "()V", null); local
[all...] |
| ClassCoverageImplTest.java | 31 private ClassCoverageImpl node; field in class:ClassCoverageImplTest
35 node = new ClassCoverageImpl("Sample", 12345, false);
40 assertEquals(ICoverageNode.ElementType.CLASS, node.getElementType());
41 assertEquals("Sample", node.getName());
42 assertEquals(12345, node.getId());
43 assertFalse(node.isNoMatch());
44 assertEquals(Collections.emptyList(), node.getMethods());
49 node.setSignature("LSample;");
50 assertEquals("LSample;", node.getSignature());
55 node.setSuperName("java/lang/Object")
73 ClassCoverageImpl node = new ClassCoverageImpl("Sample", 12345, true); local
79 ClassCoverageImpl node = new ClassCoverageImpl("ClassInDefaultPackage", local
[all...] |
| /external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/javaparsermodel/ |
| DefaultVisitorAdapter.java | 17 public ResolvedType visit(CompilationUnit node, Boolean aBoolean) {
18 throw new UnsupportedOperationException(node.getClass().getCanonicalName());
22 public ResolvedType visit(PackageDeclaration node, Boolean aBoolean) {
23 throw new UnsupportedOperationException(node.getClass().getCanonicalName());
27 public ResolvedType visit(TypeParameter node, Boolean aBoolean) {
28 throw new UnsupportedOperationException(node.getClass().getCanonicalName());
32 public ResolvedType visit(LineComment node, Boolean aBoolean) {
33 throw new UnsupportedOperationException(node.getClass().getCanonicalName());
37 public ResolvedType visit(BlockComment node, Boolean aBoolean) {
38 throw new UnsupportedOperationException(node.getClass().getCanonicalName())
[all...] |
| /external/jemalloc/include/jemalloc/internal/ |
| extent.h | 15 /* Pointer to the extent that this tree node is responsible for. */
87 arena_t *extent_node_arena_get(const extent_node_t *node);
88 void *extent_node_addr_get(const extent_node_t *node);
89 size_t extent_node_size_get(const extent_node_t *node);
90 size_t extent_node_sn_get(const extent_node_t *node);
91 bool extent_node_zeroed_get(const extent_node_t *node);
92 bool extent_node_committed_get(const extent_node_t *node);
93 bool extent_node_achunk_get(const extent_node_t *node);
94 prof_tctx_t *extent_node_prof_tctx_get(const extent_node_t *node);
95 void extent_node_arena_set(extent_node_t *node, arena_t *arena)
[all...] |
| /frameworks/av/services/audiopolicy/common/managerdefinitions/src/ |
| ConfigParsingUtils.cpp | 36 cnode *node = root->first_child; local
40 while (node) {
41 if (strcmp(node->name, GAIN_MODE) == 0) {
42 gain->setMode(GainModeConverter::maskFromString(node->value));
43 } else if (strcmp(node->name, GAIN_CHANNELS) == 0) {
46 if (InputChannelConverter::fromString(node->value, mask)) {
50 if (OutputChannelConverter::fromString(node->value, mask)) {
54 } else if (strcmp(node->name, GAIN_MIN_VALUE) == 0) {
55 gain->setMinValueInMb(atoi(node->value));
56 } else if (strcmp(node->name, GAIN_MAX_VALUE) == 0)
82 cnode *node = root->first_child; local
103 cnode *node = root->first_child; local
153 cnode *node = root->first_child; local
225 cnode *node = config_find(root, DEVICES_TAG); local
271 cnode *node = config_find(root, AUDIO_HW_MODULE_TAG); local
323 cnode *node = config_find(root, GLOBAL_CONFIG_TAG); local
370 cnode *node = config_find(root, GLOBAL_CONFIG_TAG); local
[all...] |
| /packages/apps/Dialer/java/com/android/dialer/searchfragment/cp2/ |
| ContactTernarySearchTree.java | 26 private Node root;
29 * Add {@code value} to all middle and end {@link Node#values} that correspond to {@code key}.
32 * "O". But if the traversal required visiting {@link Node#left} or {@link Node#right}, {@code
42 private Node put(Node node, String key, int value, int position) {
44 if (node == null) {
45 node = new Node();
[all...] |
| /system/core/libcutils/include/cutils/ |
| list.h | 32 #define node_to_item(node, container, member) \
33 (container *) (((char*) (node)) - offsetof(container, member))
41 #define list_for_each(node, list) \
42 for ((node) = (list)->next; (node) != (list); (node) = (node)->next)
44 #define list_for_each_reverse(node, list) \
45 for ((node) = (list)->prev; (node) != (list); (node) = (node)->prev
[all...] |
| /external/chromium-trace/catapult/devil/devil/utils/ |
| usb_hubs.py | 30 id_func: [USBNode -> bool] is a function that can be run on a node
31 to determine if the node represents this type of hub.
45 def IsType(self, node):
46 """Determines if the given Node is a hub of this type.
49 node: [USBNode] Node to check.
51 return self._id_func(node)
53 def GetPhysicalPortToNodeTuples(self, node):
57 node: [USBNode] Node representing a hub of this type
[all...] |
| /system/bt/btif/src/ |
| btif_uid.cc | 48 uid_set_node_t* node = set->head; local
49 while (node) {
50 uid_set_node_t* temp = node;
51 node = node->next;
61 uid_set_node_t* node = set->head; local
62 while (node && node->data.app_uid != app_uid) {
63 node = node->next
79 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); local
87 uid_set_node_t* node = uid_set_find_or_create_node(set, app_uid); local
96 uid_set_node_t* node = set->head; local
[all...] |
| /external/v8/src/ast/ |
| prettyprinter.cc | 37 void CallPrinter::Find(AstNode* node, bool print) {
42 Visit(node);
47 Visit(node);
63 void CallPrinter::VisitBlock(Block* node) {
64 FindStatements(node->statements());
68 void CallPrinter::VisitVariableDeclaration(VariableDeclaration* node) {}
71 void CallPrinter::VisitFunctionDeclaration(FunctionDeclaration* node) {}
74 void CallPrinter::VisitExpressionStatement(ExpressionStatement* node) {
75 Find(node->expression());
79 void CallPrinter::VisitEmptyStatement(EmptyStatement* node) {}
[all...] |
| /external/blktrace/ |
| rbtree.c | 25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
27 struct rb_node *right = node->rb_right;
28 struct rb_node *parent = rb_parent(node);
30 if ((node->rb_right = right->rb_left))
31 rb_set_parent(right->rb_left, node);
32 right->rb_left = node;
38 if (node == parent->rb_left)
45 rb_set_parent(node, right);
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root)
50 struct rb_node *left = node->rb_left
[all...] |
| /external/python/cpython3/Lib/ |
| ast.py | 32 Parse the source into an AST node.
42 Safely evaluate an expression node or a string containing a Python
43 expression. The string or node provided may only consist of the following
51 def _convert(node):
52 if isinstance(node, Constant):
53 return node.value
54 elif isinstance(node, (Str, Bytes)):
55 return node.s
56 elif isinstance(node, Num):
57 return node.
[all...] |
| /external/mesa3d/src/compiler/nir/ |
| nir_loop_analyze.h | 32 contains_other_jump(nir_cf_node *node, nir_instr *expected_jump)
34 switch (node->type) {
36 nir_instr *lst_instr = nir_block_last_instr(nir_cf_node_as_block(node));
40 nir_foreach_instr(instr, nir_cf_node_as_block(node))
50 nir_if *if_stmt = nir_cf_node_as_if(node);
52 foreach_list_typed_safe(nir_cf_node, node, node, &if_stmt->then_list) {
53 if (contains_other_jump(node, expected_jump))
57 foreach_list_typed_safe(nir_cf_node, node, node, &if_stmt->else_list)
[all...] |
