HomeSort by relevance Sort by last modified time
    Searched defs:node (Results 1326 - 1350 of 2129) sorted by null

<<51525354555657585960>>

  /external/lzma/C/
Ppmd7.c 53 #define NODE(ptr) (ptr)
55 #define NODE(offs) ((CPpmd7_Node *)(p->Base + (offs)))
118 static void InsertNode(CPpmd7 *p, void *node, unsigned indx)
120 *((CPpmd_Void_Ref *)node) = p->FreeList[indx];
121 p->FreeList[indx] = REF(node);
126 CPpmd_Void_Ref *node = (CPpmd_Void_Ref *)Ppmd7_GetPtr(p, p->FreeList[indx]); local
127 p->FreeList[indx] = *node;
128 return node;
165 CPpmd7_Node *node = NODE(next); local
182 CPpmd7_Node *node = NODE(n); local
200 CPpmd7_Node *node = NODE(n); local
    [all...]
  /external/mesa3d/src/mesa/drivers/dri/i965/
brw_fs.h 73 void *node; local
75 node = ralloc_size(ctx, size);
76 assert(node != NULL);
78 return node;
133 void *node; local
135 node = rzalloc_size(ctx, size);
136 assert(node != NULL);
138 return node;
brw_vec4.h 86 void *node; local
88 node = ralloc_size(ctx, size);
89 assert(node != NULL);
91 return node;
124 void *node; local
126 node = ralloc_size(ctx, size);
127 assert(node != NULL);
129 return node;
153 void *node; local
155 node = rzalloc_size(ctx, size)
    [all...]
  /external/mesa3d/src/mesa/main/
errors.c 624 struct simple_node *node; local
631 foreach(node, &ClientIDs->Namespaces[s][t].Severity[sev]) {
632 entry = (struct gl_client_severity *)node;
784 struct simple_node *node, *tmp; local
787 foreach_s(node, tmp, &ClientIDs->Namespaces[s][t].Severity[sev]) {
788 entry = (struct gl_client_severity *)node;
  /external/mesa3d/src/mesa/vbo/
vbo_save_api.c 105 const struct vbo_save_vertex_list *node,
109 const struct _mesa_prim *prim = &node->prim[node->prim_count - 1];
316 struct vbo_save_vertex_list *node; local
321 node = (struct vbo_save_vertex_list *)
322 _mesa_dlist_alloc(ctx, save->opcode_vertex_list, sizeof(*node));
324 if (!node)
329 memcpy(node->attrsz, save->attrsz, sizeof(node->attrsz));
330 memcpy(node->attrtype, save->attrtype, sizeof(node->attrtype))
1575 struct vbo_save_vertex_list *node = (struct vbo_save_vertex_list *) data; local
1594 struct vbo_save_vertex_list *node = (struct vbo_save_vertex_list *) data; local
    [all...]
  /external/opencv/cv/src/
cvpyrsegmentation.cpp 1462 _CvListNode *node = (_CvListNode *) reader.ptr; local
1473 _CvListNode *node = prev->next; local
1645 _CvListNode *node = (_CvListNode *) reader.ptr; local
1656 _CvListNode *node = prev->next; local
    [all...]
cvsegmentation.cpp 100 CvWSNode* free_node = 0, *node; local
119 node = free_node; \
121 node->next = 0; \
122 node->mask_ofs = mofs; \
123 node->img_ofs = iofs; \
125 q[idx].last->next=node; \
127 q[idx].first = node; \
128 q[idx].last = node; \
133 node = q[idx].first; \
134 q[idx].first = node->next;
    [all...]
  /external/owasp/sanitizer/tools/findbugs/lib/
jaxen-1.1.6.jar 
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_trees.c 425 /* Index within the heap array of least frequent node in the Huffman tree */
448 * Restore the heap property by moving down the tree starting at node k,
449 * exchanging a node with the smallest of its two sons if necessary, stopping
456 int k) /* node to move down */
519 if (n > max_code) continue; /* not a leaf node */
626 int node; /* new node being created */ local
649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
650 tree[node].Freq = 1;
651 s->depth[node] = 0
    [all...]
  /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
ftdbgmem.c 277 FT_MemNode node, next, *pnode; local
281 node = table->buckets[i];
282 while ( node )
284 next = node->link;
285 hash = FT_MEM_VAL( node->address ) % new_size;
288 node->link = pnode[0];
289 pnode[0] = node;
291 node = next;
356 FT_MemNode *pnode = table->buckets + i, next, node = *pnode; local
359 while ( node )
429 FT_MemNode *pnode, node; local
454 FT_MemSource node, *pnode; local
509 FT_MemNode *pnode, node; local
609 FT_MemNode *pnode, node; local
741 FT_MemNode node, *pnode; local
    [all...]
  /external/qemu/android/
hw-sensors.c 194 HwSensorClient* node = *pnode; local
195 if (node == NULL)
197 if (node == cl) {
201 pnode = &node->next;
  /external/qemu/android/skin/
image.c 375 SkinImage* node; local
378 node = *pnode;
379 assert(node != NULL);
380 if (node == NULL) /* should not happen */
382 if (node == image) {
383 *pnode = node->link;
386 pnode = &node->link;
390 node->desc.path, node->desc.rotation, node->w*node->h )
454 SkinImage* node = *pnode; local
469 SkinImage* node; local
540 SkinImage* node = *pnode; local
    [all...]
  /external/qemu/distrib/libselinux/src/
avc.c 220 struct avc_node *node; local
227 node = avc_cache.slots[i];
228 if (node) {
231 while (node) {
233 node = node->next;
378 struct avc_node *node; local
382 node = avc_search_node(ssid, tsid, tclass, &probes);
384 if (node && ((node->ae.avd.decided & requested) == requested))
420 struct avc_node *node; local
454 struct avc_node *node, *tmp; local
498 struct avc_node *node, *tmp; local
889 struct avc_node *node; local
    [all...]
  /external/qemu/distrib/zlib-1.2.8/
trees.c 425 /* Index within the heap array of least frequent node in the Huffman tree */
448 * Restore the heap property by moving down the tree starting at node k,
449 * exchanging a node with the smallest of its two sons if necessary, stopping
456 int k; /* node to move down */
519 if (n > max_code) continue; /* not a leaf node */
626 int node; /* new node being created */ local
649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
650 tree[node].Freq = 1;
651 s->depth[node] = 0
    [all...]
  /external/qemu/telephony/
sysdeps_posix.c 153 SysChannel node = *pnode; local
154 assert( node != NULL );
155 if (node == channel)
157 pnode = &node->next;
357 SysTimer *pnode, node; local
360 node = *pnode;
361 if (node == NULL)
363 if (node == timer) {
364 *pnode = node->next;
367 pnode = &node->next
390 SysTimer *pnode, node; local
    [all...]
  /external/sepolicy/tools/
check_seapp.c 773 line_order_list *node = malloc(sizeof(line_order_list)); local
774 if (node == NULL)
777 node->next = NULL;
778 node->e = e;
781 list_head = list_tail = node;
783 list_tail->next = node;
  /external/smack/src/org/jivesoftware/smackx/commands/
AdHocCommandManager.java 112 * Map a command node with its AdHocCommandInfo. Note: Key=command node,
113 * Value=command. Command node matches the node attribute sent by command
135 * connection. The <tt>node</tt> is an unique identifier of that command for
141 * @param node the unique identifier of the command.
145 public void registerCommand(String node, String name, final Class<? extends LocalCommand> clazz) {
146 registerCommand(node, name, new LocalCommandFactory() {
155 * connection. The <tt>node</tt> is an unique identifier of that
160 * @param node the unique identifier of the command.
721 private String node; field in class:AdHocCommandManager.AdHocCommandInfo
    [all...]
  /external/tcpdump/
appletalk.h 117 u_int8_t node; member in struct:atNBPtuple
  /external/valgrind/main/coregrind/
m_oset.c 41 // Each node in the tree has two parts.
51 // AvlNode* node -> +---------------+ V
63 // - a "node", usually called "n", is a pointer to the metadata.
68 // arithmetic to switch between the node and the element. The node magic is
95 // The padding ensures that magic is right at the end of the node,
121 AvlNode* root; // root node
123 AvlNode* nodeStack[STACK_MAX]; // Iterator node stack
132 // Given a pointer to the node's element, return the pointer to the AvlNode
133 // structure. If the node has a bad magic number, it will die with a
567 Word* node = VG_(OSetGen_AllocNode)(t, sizeof(UWord)); local
    [all...]
m_wordfm.c 88 AvlNode* nodeStack[WFM_STKMAX]; // Iterator node stack
156 just copy a->val to existing node, first returning old ->val field
157 of existing node in *oldV, so that the caller can finalize it
251 incorporate the node in the tree */
623 AvlNode* node; local
624 node = fm->alloc_nofail( fm->cc, sizeof(AvlNode) );
625 node->key = k;
626 node->val = v;
629 avl_insert_wrk( &fm->root, &oldV, node, fm->kCmp );
633 fm->dealloc(node);
641 AvlNode* node = avl_find_node( fm->root, key, fm->kCmp ); local
659 AvlNode* node = avl_find_node( fm->root, key, fm->kCmp ); local
    [all...]
  /external/zlib/src/
trees.c 425 /* Index within the heap array of least frequent node in the Huffman tree */
448 * Restore the heap property by moving down the tree starting at node k,
449 * exchanging a node with the smallest of its two sons if necessary, stopping
456 int k; /* node to move down */
519 if (n > max_code) continue; /* not a leaf node */
626 int node; /* new node being created */ local
649 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
650 tree[node].Freq = 1;
651 s->depth[node] = 0
    [all...]
  /frameworks/av/media/libmedia/
IOMX.cpp 66 virtual bool livesLocally(node_id node, pid_t pid) {
69 data.writeInt32((int32_t)node);
99 const char *name, const sp<IOMXObserver> &observer, node_id *node) {
108 *node = (node_id)reply.readInt32();
110 *node = 0;
116 virtual status_t freeNode(node_id node) {
119 data.writeInt32((int32_t)node);
126 node_id node, OMX_COMMANDTYPE cmd, OMX_S32 param) {
129 data.writeInt32((int32_t)node);
138 node_id node, OMX_INDEXTYPE index
532 node_id node = (node_id)data.readInt32(); local
571 node_id node; local
586 node_id node = (node_id)data.readInt32(); local
597 node_id node = (node_id)data.readInt32(); local
616 node_id node = (node_id)data.readInt32(); local
667 node_id node = (node_id)data.readInt32(); local
681 node_id node = (node_id)data.readInt32(); local
695 node_id node = (node_id)data.readInt32(); local
710 node_id node = (node_id)data.readInt32(); local
730 node_id node = (node_id)data.readInt32(); local
751 node_id node = (node_id)data.readInt32(); local
768 node_id node = (node_id)data.readInt32(); local
788 node_id node = (node_id)data.readInt32(); local
800 node_id node = (node_id)data.readInt32(); local
814 node_id node = (node_id)data.readInt32(); local
831 node_id node = (node_id)data.readInt32(); local
849 node_id node = (node_id)data.readInt32(); local
871 node_id node = (node_id)data.readInt32(); local
893 node_id node = (node_id)data.readInt32(); local
905 node_id node = (node_id)data.readInt32(); local
916 node_id node = (node_id)data.readInt32(); local
935 node_id node = (node_id)data.readInt32(); local
    [all...]
  /frameworks/av/media/libstagefright/omx/tests/
OMXHarness.cpp 74 IOMX::node_id node, omx_message *msg, int64_t timeoutUs) {
76 node, NULL, NULL, msg, timeoutUs);
121 IOMX::node_id node,
131 if ((*it).node == node) {
159 IOMX::node_id node, OMX_U32 portIndex,
168 node, OMX_IndexParamPortDefinition, def, sizeof(*def));
181 IOMX::node_id node, OMX_U32 portIndex,
186 status_t err = getPortDefinition(node, portIndex, &def);
196 node, portIndex, buffer.mMemory, &buffer.mID)
288 IOMX::node_id node; local
    [all...]
  /frameworks/testing/uiautomator/library/core-src/com/android/uiautomator/core/
UiObject.java 148 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
149 if(node == null) {
152 return node.getChildCount();
164 AccessibilityNodeInfo node = null; local
168 node = getQueryController().findAccessibilityNodeInfo(getSelector());
169 if (node != null) {
180 return node;
332 * @param node
333 * @return null if node is null, else a Rect containing visible bounds
335 private Rect getVisibleBounds(AccessibilityNodeInfo node) {
390 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
430 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
448 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
465 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
482 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
499 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
516 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
533 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
551 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
569 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
621 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
645 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
661 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
677 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
693 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
709 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
725 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
741 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
757 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
773 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
789 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
809 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
825 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
925 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
963 AccessibilityNodeInfo node = findAccessibilityNodeInfo(mConfig.getWaitForSelectorTimeout()); local
    [all...]
  /hardware/intel/common/libmix/videoencoder/
VideoEncoderBase.cpp 1917 android::List<VASurfaceMap *>::iterator node; local
    [all...]

Completed in 2189 milliseconds

<<51525354555657585960>>