Home
last modified time | relevance | path

Searched refs:cur_node (Results 1 - 19 of 19) sorted by relevance

/third_party/ffmpeg/libavcodec/
H A Dmvha.c89 int cur_node, i, j, pos = 0; in build_vlc() local
101 cur_node = s->nb_symbols; in build_vlc()
106 int first_node = cur_node; in build_vlc()
107 int second_node = cur_node; in build_vlc()
110 nodes[cur_node].count = -1; in build_vlc()
123 } while (new_node != cur_node); in build_vlc()
125 if (first_node == cur_node) in build_vlc()
136 nodes[cur_node].count = nd + st; in build_vlc()
137 nodes[cur_node].sym = -1; in build_vlc()
138 nodes[cur_node] in build_vlc()
[all...]
H A Dg722enc.c208 struct TrellisNode *cur_node = nodes[0][j]; in g722_encode_trellis() local
210 int ilow = encode_low(&cur_node->state, xlow); in g722_encode_trellis()
220 decoded = av_clip_intp2((cur_node->state.scale_factor * in g722_encode_trellis()
222 + cur_node->state.s_predictor, 14); in g722_encode_trellis()
226 ssd = cur_node->ssd + dec_diff*dec_diff;\ in g722_encode_trellis()
229 if (ssd < cur_node->ssd)\ in g722_encode_trellis()
246 node->state = cur_node->state;\ in g722_encode_trellis()
249 c->paths[index][node->path].prev = cur_node->path;\ in g722_encode_trellis()
266 struct TrellisNode *cur_node = nodes[1][j]; in g722_encode_trellis() local
277 dhigh = cur_node in g722_encode_trellis()
[all...]
H A Dylc.c92 int cur_node, i, j, pos = 0; in build_vlc() local
103 cur_node = 256; in build_vlc()
108 int first_node = cur_node; in build_vlc()
109 int second_node = cur_node; in build_vlc()
112 nodes[cur_node].count = -1; in build_vlc()
125 } while (new_node != cur_node); in build_vlc()
127 if (first_node == cur_node) in build_vlc()
138 nodes[cur_node].count = nd + st; in build_vlc()
139 nodes[cur_node].sym = -1; in build_vlc()
140 nodes[cur_node] in build_vlc()
[all...]
H A Dhuffman.c163 int cur_node; in ff_huff_build_tree() local
179 cur_node = nb_codes; in ff_huff_build_tree()
185 for(j = cur_node; j > i + 2; j--){ in ff_huff_build_tree()
195 cur_node++; in ff_huff_build_tree()
/third_party/node/deps/v8/src/utils/
H A Dlocked-queue-inl.h33 Node* cur_node = head_; in ~LockedQueue() local
34 while (cur_node != nullptr) { in ~LockedQueue()
35 old_node = cur_node; in ~LockedQueue()
36 cur_node = cur_node->next.Value(); in ~LockedQueue()
/third_party/node/deps/v8/src/heap/
H A Dfree-list.cc48 for (FreeSpace cur_node = top(); !cur_node.is_null(); in SearchForNodeInList()
49 cur_node = cur_node.next()) { in SearchForNodeInList()
50 DCHECK(Page::FromHeapObject(cur_node)->CanAllocate()); in SearchForNodeInList()
51 size_t size = cur_node.size(kRelaxedLoad); in SearchForNodeInList()
55 if (cur_node == top()) { in SearchForNodeInList()
56 set_top(cur_node.next()); in SearchForNodeInList()
64 prev_non_evac_node.set_next(cur_node.next()); in SearchForNodeInList()
67 return cur_node; in SearchForNodeInList()
[all...]
/third_party/NuttX/drivers/usbdev/gadget/
H A Dusbd_hid.c166 if (fhid_sc->cur_node != NULL) in hid_queue_free()
168 hid_queue_node_free(fhid_sc->cur_node); in hid_queue_free()
169 fhid_sc->cur_node = NULL; in hid_queue_free()
189 node = fhid->cur_node; in hid_send_data_sub()
326 hid->cur_node = node_temp; in hid_write()
H A Dusbd_audio.c193 struct uac_queue_node *node = fuac->cur_node; in uac_send_data_sub()
218 if (fuac_sc->cur_node != NULL) in uac_queue_free()
220 uac_queue_node_free(fuac_sc->cur_node); in uac_queue_free()
221 fuac_sc->cur_node = NULL; in uac_queue_free()
294 dev->cur_node = node_tx; in fuac_send_message()
H A Df_hid.c383 if (hid->cur_node != NULL) in fhid_input_req_complete()
385 node_temp = hid->cur_node; in fhid_input_req_complete()
389 hid->cur_node = NULL; in fhid_input_req_complete()
402 hid->cur_node = node_temp; in fhid_input_req_complete()
445 hid->cur_node = NULL; in usbclass_hid_bind()
H A Df_uac.c522 if (uac->cur_node != NULL) in fuac_input_req_complete()
524 node_tx = uac->cur_node; in fuac_input_req_complete()
528 uac->cur_node = NULL; in fuac_input_req_complete()
541 uac->cur_node = node_tx; in fuac_input_req_complete()
656 uac->cur_node = NULL; in usbclass_uac_bind()
H A Df_hid.h85 struct hid_queue_node *cur_node; member
H A Df_uac.h71 struct uac_queue_node *cur_node; member
/third_party/python/Lib/xml/dom/
H A Dpulldom.py232 token, cur_node = event
233 if cur_node is node:
236 parents[-1].appendChild(cur_node)
238 parents.append(cur_node)
/third_party/selinux/libsepol/src/
H A Dexpand.c2860 cond_node_t *cur_node; in discard_tunables() local
2889 for (cur_node = decl->cond_list; cur_node != NULL; in discard_tunables()
2890 cur_node = cur_node->next) { in discard_tunables()
2898 for (cur_expr = cur_node->expr; cur_expr != NULL; in discard_tunables()
2917 cur_node->flags &= ~COND_NODE_FLAGS_TUNABLE; in discard_tunables()
2923 cur_node->flags |= COND_NODE_FLAGS_TUNABLE; in discard_tunables()
2924 cur_state = cond_evaluate_expr(pol, cur_node->expr); in discard_tunables()
2933 cur_node in discard_tunables()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/
H A Dcord.cc1971 // Iterate over the tree. cur_node is never a leaf node and leaf nodes will in MemoryUsageAux()
1975 const CordRep* cur_node = rep; in MemoryUsageAux() local
1979 if (cur_node->IsConcat()) { in MemoryUsageAux()
1981 const CordRep* left = cur_node->concat()->left; in MemoryUsageAux()
1986 const CordRep* right = cur_node->concat()->right; in MemoryUsageAux()
1993 } else if (cur_node->IsBtree()) { in MemoryUsageAux()
1995 const CordRepBtree* node = cur_node->btree(); in MemoryUsageAux()
2006 // Since cur_node is not a leaf or a concat node it must be a substring. in MemoryUsageAux()
2007 assert(cur_node->IsSubstring()); in MemoryUsageAux()
2009 next_node = cur_node in MemoryUsageAux()
[all...]
/third_party/vulkan-loader/loader/
H A Dtrampoline.c492 VkLayerDbgFunctionNode *cur_node = ptr_instance->current_dbg_function_head; in loader_add_instance_only_debug_funcs() local
493 if (cur_node == NULL) { in loader_add_instance_only_debug_funcs()
496 while (cur_node != NULL) { in loader_add_instance_only_debug_funcs()
497 if (cur_node == ptr_instance->instance_only_dbg_function_head) { in loader_add_instance_only_debug_funcs()
502 else if (cur_node->pNext == NULL) { in loader_add_instance_only_debug_funcs()
503 cur_node->pNext = ptr_instance->instance_only_dbg_function_head; in loader_add_instance_only_debug_funcs()
505 cur_node = cur_node->pNext; in loader_add_instance_only_debug_funcs()
513 VkLayerDbgFunctionNode *cur_node = ptr_instance->current_dbg_function_head; in loader_remove_instance_only_debug_funcs() local
516 if (cur_node in loader_remove_instance_only_debug_funcs()
[all...]
/third_party/FreeBSD/sys/dev/usb/
H A Dusb_hub.c1540 usbd_bt_node *cur_node = NULL; in uhub_attach() local
1554 cur_node = usbd_create_bt_node(&cur_info); in uhub_attach()
1555 if (cur_node == NULL) in uhub_attach()
1575 (void)usbd_insert_bt_node(cur_node, hub_tree, &parent_info); in uhub_attach()
/third_party/FreeBSD/sys/dev/usb/storage/
H A Dumass.c3297 usbd_bt_node *cur_node; in umass_attach_dev_sub() local
3330 cur_node = usbd_create_bt_node(&cur_info); in umass_attach_dev_sub()
3331 if (cur_node == NULL) { in umass_attach_dev_sub()
3338 (void)usbd_insert_bt_node(cur_node, hub_tree, &parent_info); in umass_attach_dev_sub()
/third_party/rust/crates/memchr/bench/data/code/
H A Drust-library.rs29222 let mut cur_node = self.borrow_mut().last_leaf_edge().into_node(); in bulk_push() variables
29226 if cur_node.len() < node::CAPACITY { in bulk_push()
29227 cur_node.push(key, value); in bulk_push()
29231 let mut test_node = cur_node.forget_type(); in bulk_push()
29262 cur_node = open_node.forget_type().last_leaf_edge().into_node(); in bulk_push()
39828 let mut cur_node = self.borrow_mut(); fix_right_border_of_plentiful() variables
[all...]

Completed in 69 milliseconds