| /device/google/contexthub/firmware/os/core/ |
| D | heap.c | 67 static inline struct HeapNode* heapPrvGetNext(struct HeapNode* node) in heapPrvGetNext() argument
69 return (gHeapTail == node) ? NULL : (struct HeapNode*)(node->data + node->size); in heapPrvGetNext()
75 struct HeapNode* node; in heapInit() local
77 node = gHeapHead = (struct HeapNode*)ALIGNED_HEAP_START; in heapInit()
82 gHeapTail = node; in heapInit()
84 node->used = 0; in heapInit()
85 node->prev = NULL; in heapInit()
86 node->size = size - sizeof(struct HeapNode); in heapInit()
95 struct HeapNode *node = gHeapHead, *next; in heapMergeFreeChunks() local
97 while (node) { in heapMergeFreeChunks()
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| D | ast.py | 52 def _convert(node): argument
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
59 elif isinstance(node, List):
60 return list(map(_convert, node.elts))
61 elif isinstance(node, Dict):
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| D | ast.py | 52 def _convert(node): argument
53 if isinstance(node, Str):
54 return node.s
55 elif isinstance(node, Num):
56 return node.n
57 elif isinstance(node, Tuple):
58 return tuple(map(_convert, node.elts))
59 elif isinstance(node, List):
60 return list(map(_convert, node.elts))
61 elif isinstance(node, Dict):
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/compiler/ |
| D | pycodegen.py | 150 def visitDict(self, node): argument
153 def visitGlobal(self, node): argument
154 for name in node.names:
157 def visitFunction(self, node): argument
158 self.names.add(node.name)
160 def visitLambda(self, node): argument
163 def visitImport(self, node): argument
164 for name, alias in node.names:
167 def visitFrom(self, node): argument
168 for name, alias in node.names:
[all …]
|
| D | transformer.py | 145 def compile_node(self, node): argument
147 n = node[0]
150 self.encoding = node[2]
151 node = node[1]
152 n = node[0]
155 return self.single_input(node[1:])
157 return self.file_input(node[1:])
159 return self.eval_input(node[1:])
161 return self.lambdef(node[1:])
163 return self.funcdef(node[1:])
[all …]
|
| D | visitor.py | 35 self.node = None
38 def default(self, node, *args): argument
39 for child in node.getChildNodes():
42 def dispatch(self, node, *args): argument
43 self.node = node
44 klass = node.__class__
57 return meth(node, *args)
74 def dispatch(self, node, *args): argument
75 self.node = node
76 meth = self._cache.get(node.__class__, None)
[all …]
|
| D | symbols.py | 219 def visitModule(self, node): argument
220 scope = self.module = self.scopes[node] = ModuleScope()
221 self.visit(node.node, scope)
225 def visitFunction(self, node, parent): argument
226 if node.decorators:
227 self.visit(node.decorators, parent)
228 parent.add_def(node.name)
229 for n in node.defaults:
231 scope = FunctionScope(node.name, self.module, self.klass)
234 self.scopes[node] = scope
[all …]
|
| D | future.py | 25 def visitModule(self, node): argument
26 stmt = node.node
50 def visitFrom(self, node): argument
51 if hasattr(node, 'valid_future'):
53 if node.modname != "__future__":
55 raise SyntaxError, "invalid future statement " + repr(node)
57 def find_futures(node): argument
60 walk(node, p1)
61 walk(node, p2)
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
| D | rotatingtree.c | 31 RotatingTree_Add(rotating_node_t **root, rotating_node_t *node) in RotatingTree_Add() argument
34 if (KEY_LOWER_THAN(node->key, (*root)->key)) in RotatingTree_Add()
39 node->left = NULL; in RotatingTree_Add()
40 node->right = NULL; in RotatingTree_Add()
41 *root = node; in RotatingTree_Add()
52 rotating_node_t *node = *root; in RotatingTree_Get() local
53 while (node != NULL) { in RotatingTree_Get()
54 if (node->key == key) in RotatingTree_Get()
55 return node; in RotatingTree_Get()
56 if (KEY_LOWER_THAN(key, node->key)) in RotatingTree_Get()
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/_sqlite/ |
| D | cache.c | 31 pysqlite_Node* node; in pysqlite_new_node() local
33 node = (pysqlite_Node*) (pysqlite_NodeType.tp_alloc(&pysqlite_NodeType, 0)); in pysqlite_new_node()
34 if (!node) { in pysqlite_new_node()
39 node->key = key; in pysqlite_new_node()
42 node->data = data; in pysqlite_new_node()
44 node->prev = NULL; in pysqlite_new_node()
45 node->next = NULL; in pysqlite_new_node()
47 return node; in pysqlite_new_node()
92 pysqlite_Node* node; in pysqlite_cache_dealloc() local
101 node = self->first; in pysqlite_cache_dealloc()
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/ |
| D | fixer_util.py | 56 node = Node(syms.trailer, [lparen.clone(), rparen.clone()])
58 node.insert_child(1, Node(syms.arglist, args))
59 return node
63 node = Node(syms.power, [func_name, ArgList(args)])
65 node.prefix = prefix
66 return node
137 def is_tuple(node): argument
139 if isinstance(node, Node) and node.children == [LParen(), RParen()]:
141 return (isinstance(node, Node)
142 and len(node.children) == 3
[all …]
|
| D | 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
49 node = node.parent
53 if node.type == TYPE_GROUP:
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/fixes/ |
| D | fix_metaclass.py | 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:
55 for i, node in enumerate(cls_node.children):
56 if node.type == token.COLON:
68 node = suite
[all …]
|
| D | fix_operator.py | 41 def transform(self, node, results): argument
42 method = self._check_method(node, results)
44 return method(node, results)
47 def _sequenceIncludes(self, node, results): argument
48 return self._handle_rename(node, results, u"contains")
51 def _isCallable(self, node, results): argument
54 return Call(Name(u"hasattr"), args, prefix=node.prefix)
57 def _repeat(self, node, results): argument
58 return self._handle_rename(node, results, u"mul")
61 def _irepeat(self, node, results): argument
[all …]
|
| D | fix_next.py | 46 def transform(self, node, results): argument
59 node.replace(Call(Name(u"next", prefix=node.prefix), base))
67 if is_assign_target(node):
70 self.warning(node, bind_warning)
74 self.warning(node, bind_warning)
81 def is_assign_target(node): argument
82 assign = find_assign(node)
89 elif is_subtree(child, node):
93 def find_assign(node): argument
94 if node.type == syms.expr_stmt:
[all …]
|
| D | fix_xrange.py | 27 def transform(self, node, results): argument
30 return self.transform_xrange(node, results)
32 return self.transform_range(node, results)
36 def transform_xrange(self, node, results): argument
40 self.transformed_xranges.add(id(node))
42 def transform_range(self, node, results): argument
43 if (id(node) not in self.transformed_xranges and
44 not self.in_special_context(node)):
48 prefix=node.prefix)
63 def in_special_context(self, node): argument
[all …]
|
| D | fix_import.py | 25 node = pending.pop()
26 if node.type == token.NAME:
27 yield node.value
28 elif node.type == syms.dotted_name:
29 yield "".join([ch.value for ch in node.children])
30 elif node.type == syms.dotted_as_name:
31 pending.append(node.children[0])
32 elif node.type == syms.dotted_as_names:
33 pending.extend(node.children[::-2])
51 def transform(self, node, results): argument
[all …]
|
| /device/google/marlin/camera/QCamera2/util/ |
| D | QCameraQueue.cpp | 147 camera_q_node *node = in enqueue() local
149 if (NULL == node) { in enqueue()
154 memset(node, 0, sizeof(camera_q_node)); in enqueue()
155 node->data = data; in enqueue()
159 cam_list_add_tail_node(&node->list, &m_head.list); in enqueue()
163 free(node); in enqueue()
184 camera_q_node *node = in enqueueWithPriority() local
186 if (NULL == node) { in enqueueWithPriority()
191 memset(node, 0, sizeof(camera_q_node)); in enqueueWithPriority()
192 node->data = data; in enqueueWithPriority()
[all …]
|
| D | QCameraCmdThread.cpp | 141 camera_cmd_t *node = (camera_cmd_t *)malloc(sizeof(camera_cmd_t)); in sendCmd() local
142 if (NULL == node) { in sendCmd()
146 memset(node, 0, sizeof(camera_cmd_t)); in sendCmd()
147 node->cmd = cmd; in sendCmd()
150 if (!cmd_queue.enqueueWithPriority((void *)node)) { in sendCmd()
151 free(node); in sendCmd()
152 node = NULL; in sendCmd()
155 if (!cmd_queue.enqueue((void *)node)) { in sendCmd()
156 free(node); in sendCmd()
157 node = NULL; in sendCmd()
[all …]
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/ |
| D | regparse.h | 68 #define NTYPE(node) ((node)->u.base.type) argument
69 #define SET_NTYPE(node, ntype) (node)->u.base.type = (ntype) argument
71 #define NSTR(node) (&((node)->u.str)) argument
72 #define NCCLASS(node) (&((node)->u.cclass)) argument
73 #define NCTYPE(node) (&((node)->u.ctype)) argument
74 #define NBREF(node) (&((node)->u.bref)) argument
75 #define NQTFR(node) (&((node)->u.qtfr)) argument
76 #define NENCLOSE(node) (&((node)->u.enclose)) argument
77 #define NANCHOR(node) (&((node)->u.anchor)) argument
78 #define NCONS(node) (&((node)->u.cons)) argument
[all …]
|
| D | regtrav.c | 35 capture_tree_traverse(OnigCaptureTreeNode* node, int at, in capture_tree_traverse() argument
41 if (node == (OnigCaptureTreeNode* )0) in capture_tree_traverse()
45 r = (*callback_func)(node->group, node->beg, node->end, in capture_tree_traverse()
50 for (i = 0; i < node->num_childs; i++) { in capture_tree_traverse()
51 r = capture_tree_traverse(node->childs[i], at, in capture_tree_traverse()
57 r = (*callback_func)(node->group, node->beg, node->end, in capture_tree_traverse()
|
| /device/google/marlin/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| D | mm_jpeg_queue.c | 47 mm_jpeg_q_node_t* node = in mm_jpeg_queue_enq() local
49 if (NULL == node) { in mm_jpeg_queue_enq()
54 memset(node, 0, sizeof(mm_jpeg_q_node_t)); in mm_jpeg_queue_enq()
55 node->data = data; in mm_jpeg_queue_enq()
58 cam_list_add_tail_node(&node->list, &queue->head.list); in mm_jpeg_queue_enq()
70 mm_jpeg_q_node_t* node = in mm_jpeg_queue_enq_head() local
72 if (NULL == node) { in mm_jpeg_queue_enq_head()
77 memset(node, 0, sizeof(mm_jpeg_q_node_t)); in mm_jpeg_queue_enq_head()
78 node->data = data; in mm_jpeg_queue_enq_head()
84 cam_list_insert_before_node(&node->list, pos); in mm_jpeg_queue_enq_head()
[all …]
|
| /device/google/marlin/camera/QCamera2/stack/common/ |
| D | cam_queue.h | 57 cam_node_t *node = in cam_queue_enq() local
59 if (NULL == node) { in cam_queue_enq()
63 memset(node, 0, sizeof(cam_node_t)); in cam_queue_enq()
64 node->data = data; in cam_queue_enq()
67 cam_list_add_tail_node(&node->list, &queue->head.list); in cam_queue_enq()
76 cam_node_t *node = NULL; in cam_queue_deq() local
85 node = member_of(pos, cam_node_t, list); in cam_queue_deq()
86 cam_list_del_node(&node->list); in cam_queue_deq()
91 if (NULL != node) { in cam_queue_deq()
92 data = node->data; in cam_queue_deq()
[all …]
|
| /device/google/marlin/camera/QCamera2/stack/mm-camera-test/src/ |
| D | mm_qcamera_queue.c | 85 camera_q_node *node = in mm_qcamera_queue_enqueue() local
87 if (NULL == node) { in mm_qcamera_queue_enqueue()
92 memset(node, 0, sizeof(camera_q_node)); in mm_qcamera_queue_enqueue()
93 node->data = data; in mm_qcamera_queue_enqueue()
96 cam_list_add_tail_node(&node->list, &queue->m_head.list); in mm_qcamera_queue_enqueue()
109 camera_q_node* node = NULL; in mm_qcamera_queue_dequeue() local
122 node = member_of(pos, camera_q_node, list); in mm_qcamera_queue_dequeue()
123 cam_list_del_node(&node->list); in mm_qcamera_queue_dequeue()
128 if (NULL != node) { in mm_qcamera_queue_dequeue()
129 data = node->data; in mm_qcamera_queue_dequeue()
[all …]
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Parser/ |
| D | node.c | 7 node *
10 node *n = (node *) PyObject_MALLOC(1 * sizeof(node)); in PyNode_New()
79 PyNode_AddChild(register node *n1, int type, char *str, int lineno, int col_offset) in PyNode_AddChild()
84 node *n; in PyNode_AddChild()
94 if (required_capacity > PY_SIZE_MAX / sizeof(node)) { in PyNode_AddChild()
98 n = (node *) PyObject_REALLOC(n, in PyNode_AddChild()
99 required_capacity * sizeof(node)); in PyNode_AddChild()
116 static void freechildren(node *);
117 static Py_ssize_t sizeofchildren(node *n);
121 PyNode_Free(node *n) in PyNode_Free()
[all …]
|