/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/tensorflow/tensorflow/contrib/py2tf/impl/ |
conversion.py | 122 node, new_name = class_to_graph(o, conversion_map) 124 node, new_name = function_to_graph(o, conversion_map, arg_values, arg_types) 126 node, new_name = function_to_graph(o, conversion_map, arg_values, arg_types) 132 conversion_map.add_to_cache(o, node) 143 return node, new_name 155 node, _ = function_to_graph( 164 converted_members[m] = node 167 node = gast.ClassDef( 174 return node, class_name 198 node, source = parser.parse_entity(f [all...] |
/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/src/compiler/ |
js-call-reducer.cc | 12 #include "src/compiler/node-matchers.h" 21 Reduction JSCallReducer::Reduce(Node* node) { 22 switch (node->opcode()) { 24 return ReduceJSConstruct(node); 26 return ReduceJSConstructWithSpread(node); 28 return ReduceJSCall(node); 30 return ReduceJSCallWithSpread(node); 39 Reduction JSCallReducer::ReduceArrayConstructor(Node* node) { [all...] |
verifier.cc | 18 #include "src/compiler/node-properties.h" 19 #include "src/compiler/node.h" 37 void Check(Node* node); 44 void CheckNotTyped(Node* node) { 45 if (NodeProperties::IsTyped(node)) { 47 str << "TypeError: node #" << node->id() << ":" << *node->op( 1410 Node* node = proj->InputAt(0); local 1653 Node* node = block->NodeAt(i); local [all...] |
branch-elimination.cc | 8 #include "src/compiler/node-properties.h" 28 Reduction BranchElimination::Reduce(Node* node) { 29 switch (node->opcode()) { 34 return ReduceDeoptimizeConditional(node); 36 return ReduceMerge(node); 38 return ReduceLoop(node); 40 return ReduceBranch(node); 42 return ReduceIf(node, false); 44 return ReduceIf(node, true) [all...] |
/external/tensorflow/tensorflow/core/grappler/optimizers/ |
static_schedule.cc | 32 const VirtualPlacer& placer, const NodeDef& node) { 34 op_context.op_info.set_op(node.op()); 35 *op_context.op_info.mutable_attr() = node.attr(); 38 properties.GetInputProperties(node.name()); 43 DeviceProperties device = placer.get_device(node); 49 // Make sure our estimates are at least one nanosecond per node. 59 for (const NodeDef& node : item.graph.node()) { 60 name_map[node.name()] = &node; 94 const NodeDef* node = ready_nodes.front(); local 162 const NodeDef* node = ready_nodes.front(); local [all...] |
/system/libufdt/ |
ufdt_node.c | 44 void ufdt_node_destruct(struct ufdt_node *node, struct ufdt_node_pool *pool) { 45 if (node == NULL) return; 47 if (ufdt_node_tag(node) == FDT_BEGIN_NODE) { 48 struct ufdt_node *it = ((struct ufdt_node_fdt_node *)node)->child; 56 ufdt_node_pool_free(pool, node); 68 // Append the child node to the last child of parant node 85 struct ufdt_node *ufdt_node_get_subnode_by_name_len(const struct ufdt_node *node, 88 for_each_node(it, node) { 94 struct ufdt_node *ufdt_node_get_subnode_by_name(const struct ufdt_node *node, [all...] |
/device/google/marlin/camera/QCamera2/util/ |
QCameraCmdThread.cpp | 141 camera_cmd_t *node = (camera_cmd_t *)malloc(sizeof(camera_cmd_t)); local 142 if (NULL == node) { 146 memset(node, 0, sizeof(camera_cmd_t)); 147 node->cmd = cmd; 150 if (!cmd_queue.enqueueWithPriority((void *)node)) { 151 free(node); 152 node = NULL; 155 if (!cmd_queue.enqueue((void *)node)) { 156 free(node); 157 node = NULL 181 camera_cmd_t *node = (camera_cmd_t *)cmd_queue.dequeue(); local [all...] |
/external/dtc/ |
dtc.h | 153 struct node { struct 157 struct node *children; 159 struct node *parent; 160 struct node *next_sibling; 201 struct node *build_node(struct property *proplist, struct node *children); 202 struct node *build_node_delete(void); 203 struct node *name_node(struct node *node, char *name) [all...] |
/external/javaparser/javaparser-testing/src/test/java/com/github/javaparser/printer/ |
ConcreteSyntaxModelTest.java | 25 import com.github.javaparser.ast.Node; 34 private String print(Node node) { 35 return ConcreteSyntaxModel.genericPrettyPrint(node); 58 Node node = JavaParser.parse("class A {}"); local 60 "}" + EOL, print(node)); 65 Node node = JavaParser.parse("class A { int a; }"); local 69 "}" + EOL, print(node)); 74 Node node = JavaParser.parseBodyDeclaration("int x(int y, int z) {}"); local 80 Node node = JavaParser.parseBodyDeclaration("int x(X A.B.this, int y, int z) {}"); local 86 Node node = JavaParser.parse("interface A {}"); local 93 Node node = JavaParser.parse("public interface A {}"); local [all...] |
/hardware/qcom/camera/msm8998/QCamera2/util/ |
QCameraCmdThread.cpp | 141 camera_cmd_t *node = (camera_cmd_t *)malloc(sizeof(camera_cmd_t)); local 142 if (NULL == node) { 146 memset(node, 0, sizeof(camera_cmd_t)); 147 node->cmd = cmd; 150 if (!cmd_queue.enqueueWithPriority((void *)node)) { 151 free(node); 152 node = NULL; 155 if (!cmd_queue.enqueue((void *)node)) { 156 free(node); 157 node = NULL 181 camera_cmd_t *node = (camera_cmd_t *)cmd_queue.dequeue(); local [all...] |
/external/boringssl/src/crypto/x509v3/ |
pcy_node.c | 97 X509_POLICY_NODE *node; local 100 node = sk_X509_POLICY_NODE_value(level->nodes, i); 101 if (node->parent == parent) { 102 if (!OBJ_cmp(node->data->valid_policy, id)) 103 return node; 114 X509_POLICY_NODE *node; local 115 node = OPENSSL_malloc(sizeof(X509_POLICY_NODE)); 116 if (!node) 118 node->data = data; 119 node->parent = parent [all...] |
/toolchain/binutils/binutils-2.27/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 262 xml_node_t *node; local 279 xml_node_t *node; local 428 xml_node_t *node; local [all...] |
/external/pdfium/third_party/libopenjpeg20/ |
tgt.c | 53 opj_tgt_node_t *node = 00; local 99 node = tree->nodes; 107 node->parent = l_parent_node; 108 ++node; 110 node->parent = l_parent_node; 111 ++node; 123 node->parent = 0; 256 opj_tgt_node_t *node; local 257 node = &tree->nodes[leafno]; 258 while (node && node->value > value) 269 opj_tgt_node_t *node; local 312 opj_tgt_node_t *node; local [all...] |
/external/robolectric-shadows/robolectric/src/test/java/org/robolectric/shadows/ |
ShadowAccessibilityNodeInfoTest.java | 25 private AccessibilityNodeInfo node; field in class:ShadowAccessibilityNodeInfoTest 33 node = AccessibilityNodeInfo.obtain(); 44 node.getBoundsInParent(outBounds); 50 node.setAccessibilityFocused(true); 51 node.setBoundsInParent(new Rect(0, 0, 100, 100)); 52 node.setContentDescription("test"); 53 AccessibilityNodeInfo anotherNode = AccessibilityNodeInfo.obtain(node); 54 assertThat(anotherNode).isEqualTo(node); 61 node.setContentDescription("test"); 62 node.writeToParcel(p, 0) [all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/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.parent [all...] |
/device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/ |
regparse.h | 36 /* node type */
49 /* node type bit */
68 #define NTYPE(node) ((node)->u.base.type)
69 #define SET_NTYPE(node, ntype) (node)->u.base.type = (ntype)
71 #define NSTR(node) (&((node)->u.str))
72 #define NCCLASS(node) (&((node)->u.cclass)) [all...] |
/external/python/cpython2/Lib/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...] |