| /external/v8/src/compiler/ |
| escape-analysis-reducer.h | 31 Reduction Reduce(Node* node) final;
34 Reduction ReduceLoad(Node* node);
35 Reduction ReduceStore(Node* node);
36 Reduction ReduceAllocate(Node* node);
37 Reduction ReduceFinishRegion(Node* node);
[all...] |
| graph.cc | 10 #include "src/compiler/node.h"
11 #include "src/compiler/node-properties.h"
27 void Graph::Decorate(Node* node) {
29 decorator->Decorate(node);
46 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs,
48 Node* node = NewNodeUnchecked(op, input_count, inputs, incomplete); local
49 Verifier::VerifyNode(node);
56 Node* const node = local
[all...] |
| graph-trimmer.h | 8 #include "src/compiler/node-marker.h"
18 // Trims dead nodes from the node graph.
36 V8_INLINE bool IsLive(Node* const node) { return is_live_.Get(node); }
37 V8_INLINE void MarkAsLive(Node* const node) {
38 if (!node->IsDead() && !IsLive(node)) {
39 is_live_.Set(node, true)
[all...] |
| simplified-operator-reducer.cc | 9 #include "src/compiler/node-matchers.h"
24 Reduction SimplifiedOperatorReducer::Reduce(Node* node) {
25 switch (node->opcode()) {
27 HeapObjectMatcher m(node->InputAt(0));
35 Int32Matcher m(node->InputAt(0));
42 HeapObjectMatcher m(node->InputAt(0));
48 Float64Matcher m(node->InputAt(0));
53 Int32Matcher m(node->InputAt(0));
58 NumberMatcher m(node->InputAt(0))
[all...] |
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/page/ |
| NodePage.java | 22 * Report page that represents a coverage node.
25 * type of the node represented by this page
30 private final NodeType node; field in class:NodePage
33 * Creates a new node page.
35 * @param node
36 * corresponding node
44 protected NodePage(final NodeType node, final ReportPage parent,
47 this.node = node;
56 return Resources.getElementStyle(node.getElementType())
[all...] |
| /external/selinux/libsepol/cil/src/ |
| cil_tree.h | 55 void cil_tree_subtree_destroy(struct cil_tree_node *node);
56 void cil_tree_children_destroy(struct cil_tree_node *node);
58 void cil_tree_node_init(struct cil_tree_node **node);
59 void cil_tree_node_destroy(struct cil_tree_node **node);
68 int cil_tree_walk(struct cil_tree_node *start_node, int (*process_node)(struct cil_tree_node *node, uint32_t *finished, void *extra_args), int (*first_child)(struct cil_tree_node *node, void *extra_args), int (*last_child)(struct cil_tree_node *node, void *extra_args), void *extra_args);
|
| /prebuilts/gdb/darwin-x86/include/python2.7/ |
| parsetok.h | 35 PyAPI_FUNC(node *) PyParser_ParseString(const char *, grammar *, int,
37 PyAPI_FUNC(node *) PyParser_ParseFile (FILE *, const char *, grammar *, int,
40 PyAPI_FUNC(node *) PyParser_ParseStringFlags(const char *, grammar *, int,
42 PyAPI_FUNC(node *) PyParser_ParseFileFlags(FILE *, const char *, grammar *,
45 PyAPI_FUNC(node *) PyParser_ParseFileFlagsEx(FILE *, const char *, grammar *,
49 PyAPI_FUNC(node *) PyParser_ParseStringFlagsFilename(const char *,
53 PyAPI_FUNC(node *) PyParser_ParseStringFlagsFilenameEx(const char *,
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/ |
| fix_unicode.py | 16 def transform(self, node, results):
17 if node.type == token.NAME:
18 new = node.clone()
19 new.value = _mapping[node.value]
21 elif node.type == token.STRING:
22 if _literal_re.match(node.value):
23 new = node.clone()
|
| /prebuilts/gdb/linux-x86/include/python2.7/ |
| parsetok.h | 35 PyAPI_FUNC(node *) PyParser_ParseString(const char *, grammar *, int,
37 PyAPI_FUNC(node *) PyParser_ParseFile (FILE *, const char *, grammar *, int,
40 PyAPI_FUNC(node *) PyParser_ParseStringFlags(const char *, grammar *, int,
42 PyAPI_FUNC(node *) PyParser_ParseFileFlags(FILE *, const char *, grammar *,
45 PyAPI_FUNC(node *) PyParser_ParseFileFlagsEx(FILE *, const char *, grammar *,
49 PyAPI_FUNC(node *) PyParser_ParseStringFlagsFilename(const char *,
53 PyAPI_FUNC(node *) PyParser_ParseStringFlagsFilenameEx(const char *,
|
| /prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/ |
| fix_unicode.py | 16 def transform(self, node, results):
17 if node.type == token.NAME:
18 new = node.clone()
19 new.value = _mapping[node.value]
21 elif node.type == token.STRING:
22 if _literal_re.match(node.value):
23 new = node.clone()
|
| /prebuilts/python/darwin-x86/2.7.5/include/python2.7/ |
| parsetok.h | 35 PyAPI_FUNC(node *) PyParser_ParseString(const char *, grammar *, int,
37 PyAPI_FUNC(node *) PyParser_ParseFile (FILE *, const char *, grammar *, int,
40 PyAPI_FUNC(node *) PyParser_ParseStringFlags(const char *, grammar *, int,
42 PyAPI_FUNC(node *) PyParser_ParseFileFlags(FILE *, const char *, grammar *,
45 PyAPI_FUNC(node *) PyParser_ParseFileFlagsEx(FILE *, const char *, grammar *,
49 PyAPI_FUNC(node *) PyParser_ParseStringFlagsFilename(const char *,
53 PyAPI_FUNC(node *) PyParser_ParseStringFlagsFilenameEx(const char *,
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_unicode.py | 16 def transform(self, node, results):
17 if node.type == token.NAME:
18 new = node.clone()
19 new.value = _mapping[node.value]
21 elif node.type == token.STRING:
22 if _literal_re.match(node.value):
23 new = node.clone()
|
| /prebuilts/python/linux-x86/2.7.5/include/python2.7/ |
| parsetok.h | 35 PyAPI_FUNC(node *) PyParser_ParseString(const char *, grammar *, int,
37 PyAPI_FUNC(node *) PyParser_ParseFile (FILE *, const char *, grammar *, int,
40 PyAPI_FUNC(node *) PyParser_ParseStringFlags(const char *, grammar *, int,
42 PyAPI_FUNC(node *) PyParser_ParseFileFlags(FILE *, const char *, grammar *,
45 PyAPI_FUNC(node *) PyParser_ParseFileFlagsEx(FILE *, const char *, grammar *,
49 PyAPI_FUNC(node *) PyParser_ParseStringFlagsFilename(const char *,
53 PyAPI_FUNC(node *) PyParser_ParseStringFlagsFilenameEx(const char *,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_unicode.py | 16 def transform(self, node, results):
17 if node.type == token.NAME:
18 new = node.clone()
19 new.value = _mapping[node.value]
21 elif node.type == token.STRING:
22 if _literal_re.match(node.value):
23 new = node.clone()
|
| /system/core/libmemunreachable/ |
| LinkedList.h | 28 void insert(LinkedList<T>& node) {
29 assert(node.empty());
30 node.next_ = this->next_;
31 node.next_->prev_ = &node;
32 this->next_ = &node;
33 node.prev_ = this;
|
| /external/freetype/src/cache/ |
| ftccache.c | 42 /***** CACHE NODE DEFINITIONS *****/
47 /* add a new node to the head of the manager's circular MRU list */
49 ftc_node_mru_link( FTC_Node node,
56 (FTC_MruNode)node );
61 /* remove a node from the manager's MRU list */
63 ftc_node_mru_unlink( FTC_Node node,
70 (FTC_MruNode)node );
77 /* move a node to the head of the manager's MRU list */
79 ftc_node_mru_up( FTC_Node node,
83 (FTC_MruNode)node );
117 FTC_Node node, *pnode; local
232 FTC_Node node = *pnode; local
364 FTC_Node *pnode = cache->buckets + i, next, node = *pnode; local
450 FTC_Node node; local
490 FTC_Node node; local
581 FTC_Node node = *pnode; local
603 FTC_Node node; local
[all...] |
| /external/v8/test/unittests/compiler/ |
| node-unittest.cc | 5 #include "src/compiler/node.h"
34 Node* const node = Node::New(zone(), 1, &kOp0, 0, nullptr, false); local
35 EXPECT_EQ(1U, node->id());
36 EXPECT_EQ(0, node->UseCount());
37 EXPECT_TRUE(node->uses().empty());
38 EXPECT_EQ(0, node->InputCount());
39 EXPECT_TRUE(node->inputs().empty());
40 EXPECT_EQ(&kOp0, node->op())
67 Node* node = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
89 Node* node = Node::New(zone(), 0, &kOp0, 0, nullptr, false); local
140 Node* node = Node::New(zone(), 42, &kOp0, 0, nullptr, false); local
154 Node* node = Node::New(zone(), 12345, &kOp0, 0, nullptr, true); local
181 Node* node = Node::New(zone(), 12345, &kOp0, 0, nullptr, true); local
249 Node* node = Node::New(zone(), 12345, &kOp0, size, inputs, false); local
[all...] |
| /device/huawei/angler/camera/QCamera2/util/ |
| QCameraCmdThread.cpp | 132 camera_cmd_t *node = (camera_cmd_t *)malloc(sizeof(camera_cmd_t)); local
133 if (NULL == node) {
137 memset(node, 0, sizeof(camera_cmd_t));
138 node->cmd = cmd;
141 if (!cmd_queue.enqueueWithPriority((void *)node)) {
142 free(node);
143 node = NULL;
146 if (!cmd_queue.enqueue((void *)node)) {
147 free(node);
148 node = NULL
172 camera_cmd_t *node = (camera_cmd_t *)cmd_queue.dequeue(); local
[all...] |
| /device/lge/bullhead/camera/QCamera2/util/ |
| QCameraCmdThread.cpp | 132 camera_cmd_t *node = (camera_cmd_t *)malloc(sizeof(camera_cmd_t)); local
133 if (NULL == node) {
137 memset(node, 0, sizeof(camera_cmd_t));
138 node->cmd = cmd;
141 if (!cmd_queue.enqueueWithPriority((void *)node)) {
142 free(node);
143 node = NULL;
146 if (!cmd_queue.enqueue((void *)node)) {
147 free(node);
148 node = NULL
172 camera_cmd_t *node = (camera_cmd_t *)cmd_queue.dequeue(); local
[all...] |
| /hardware/qcom/camera/QCamera2/util/ |
| QCameraCmdThread.cpp | 140 camera_cmd_t *node = (camera_cmd_t *)malloc(sizeof(camera_cmd_t)); local
141 if (NULL == node) {
145 memset(node, 0, sizeof(camera_cmd_t));
146 node->cmd = cmd;
149 if (!cmd_queue.enqueueWithPriority((void *)node)) {
150 free(node);
151 node = NULL;
154 if (!cmd_queue.enqueue((void *)node)) {
155 free(node);
156 node = NULL
180 camera_cmd_t *node = (camera_cmd_t *)cmd_queue.dequeue(); local
[all...] |
| /external/boringssl/src/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...] |
| /toolchain/binutils/binutils-2.25/libiberty/ |
| fibheap.c | 63 /* Create a new fibonacci heap node. */
67 fibnode_t node;
69 node = (fibnode_t) xcalloc (1, sizeof *node);
70 node->left = node;
71 node->right = node;
73 return node;
101 fibnode_t node;
66 fibnode_t node; local
100 fibnode_t node; local
[all...] |
| /external/wpa_supplicant_8/src/utils/ |
| xml-utils.c | 19 xml_node_t *node; local
26 node = root;
27 xml_node_for_each_sibling(ctx, node) {
28 xml_node_for_each_check(ctx, node);
29 name = xml_node_get_localname(ctx, node);
34 if (node == NULL)
38 return get_node_uri_iter(ctx, xml_node_first_child(ctx, node),
42 return node;
50 xml_node_t *node; local
56 node = get_node_uri_iter(ctx, root, search)
67 xml_node_t *node; local
93 xml_node_t *node; local
109 xml_node_t *node; local
125 xml_node_t *node; local
230 xml_node_t *node; local
264 xml_node_t *node; local
281 xml_node_t *node; local
430 xml_node_t *node; local
[all...] |
| /external/pdfium/third_party/libopenjpeg20/ |
| tgt.c | 51 opj_tgt_node_t *node = 00; local
96 node = tree->nodes;
104 node->parent = l_parent_node;
105 ++node;
107 node->parent = l_parent_node;
108 ++node;
120 node->parent = 0;
252 opj_tgt_node_t *node; local
253 node = &tree->nodes[leafno];
254 while (node && node->value > value)
263 opj_tgt_node_t *node; local
303 opj_tgt_node_t *node; local
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/ |
| btm_utils.py | 37 node = self
39 while node:
40 if node.type == TYPE_ALTERNATIVES:
41 node.alternatives.append(subp)
42 if len(node.alternatives) == len(node.children):
44 subp = [tuple(node.alternatives)]
45 node.alternatives = []
46 node = node.paren
[all...] |
