Home
last modified time | relevance | path

Searched refs:prev_p (Results 1 – 8 of 8) sorted by relevance

/third_party/jerryscript/jerry-core/jmem/
Djmem-heap.c190 jmem_heap_free_t *prev_p = &JERRY_HEAP_CONTEXT (first); in jmem_heap_alloc() local
220 JMEM_VALGRIND_DEFINED_SPACE (prev_p, sizeof (jmem_heap_free_t)); in jmem_heap_alloc()
221 prev_p->next_offset = JMEM_HEAP_GET_OFFSET_FROM_ADDR (remaining_p); in jmem_heap_alloc()
222 JMEM_VALGRIND_NOACCESS_SPACE (prev_p, sizeof (jmem_heap_free_t)); in jmem_heap_alloc()
228 JMEM_VALGRIND_DEFINED_SPACE (prev_p, sizeof (jmem_heap_free_t)); in jmem_heap_alloc()
229 prev_p->next_offset = next_offset; in jmem_heap_alloc()
230 JMEM_VALGRIND_NOACCESS_SPACE (prev_p, sizeof (jmem_heap_free_t)); in jmem_heap_alloc()
233 JERRY_CONTEXT (jmem_heap_list_skip_p) = prev_p; in jmem_heap_alloc()
248 prev_p = current_p; in jmem_heap_alloc()
375 const jmem_heap_free_t *prev_p; in jmem_heap_find_prev() local
[all …]
/third_party/boost/boost/container/
Dslist.hpp836 iterator insert_after(const_iterator prev_p, const T &x);
851 iterator insert_after(const_iterator prev_p, T &&x);
869 iterator insert_after(const_iterator prev_p, size_type n, const value_type& x) in BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG()
872 return this->insert_after(prev_p, cvalue_iterator(x, n), cvalue_iterator()); in BOOST_MOVE_CONVERSION_AWARE_CATCH_1ARG()
889 iterator insert_after(const_iterator prev_p, InpIt first, InpIt last in insert_after() argument
900 iterator ret_it(prev_p.get()); in insert_after()
921 iterator insert_after(const_iterator prev_p, std::initializer_list<value_type> il) in insert_after() argument
923 return insert_after(prev_p, il.begin(), il.end()); in insert_after()
966 iterator erase_after(const_iterator prev_p) in erase_after() argument
968 …return iterator(this->icont().erase_after_and_dispose(prev_p.get(), Destroyer(this->node_alloc()))… in erase_after()
[all …]
/third_party/jerryscript/jerry-core/ecma/base/
Decma-helpers-external-pointers.c184 ecma_native_pointer_t *prev_p = NULL; in ecma_delete_native_pointer_property() local
192 if (prev_p == NULL) in ecma_delete_native_pointer_property()
216 prev_p->next_p = native_pointer_p->next_p; in ecma_delete_native_pointer_property()
222 prev_p = native_pointer_p; in ecma_delete_native_pointer_property()
/third_party/jerryscript/jerry-core/parser/js/
Djs-scanner-util.c340 scanner_info_t *prev_p; in scanner_seek() local
350 prev_p = context_p->skipped_scanner_info_end_p; in scanner_seek()
354 prev_p = context_p->skipped_scanner_info_p; in scanner_seek()
356 if (prev_p->source_p > source_p) in scanner_seek()
358 context_p->next_scanner_info_p = prev_p; in scanner_seek()
363 context_p->skipped_scanner_info_p = prev_p; in scanner_seek()
368 prev_p = context_p->next_scanner_info_p; in scanner_seek()
370 if (prev_p->source_p == NULL || prev_p->source_p > source_p) in scanner_seek()
375 context_p->skipped_scanner_info_p = prev_p; in scanner_seek()
378 while (prev_p->next_p->source_p != NULL && prev_p->next_p->source_p <= source_p) in scanner_seek()
[all …]
Djs-scanner-internal.h261 struct scanner_binding_list_t *prev_p; /**< prev list */ member
316 struct scanner_literal_pool_t *prev_p; /**< previous literal pool */ member
Djs-scanner.c3217 scanner_context.active_literal_pool_p = literal_pool_p->prev_p; in scanner_scan_all()
/third_party/boost/boost/intrusive/
Dcircular_list_algorithms.hpp258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer() local
265 NodeTraits::set_next(prev_p, b); in transfer()
266 NodeTraits::set_previous(b, prev_p); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer() local
286 NodeTraits::set_next(prev_p, i); in transfer()
287 NodeTraits::set_previous(i, prev_p); in transfer()
Dslist.hpp822 iterator insert_after(const_iterator prev_p, reference value) in insert_after() argument
826 node_ptr prev_n(prev_p.pointed_node()); in insert_after()
848 void insert_after(const_iterator prev_p, Iterator f, Iterator l) in insert_after() argument
852 node_ptr prev_n(prev_p.pointed_node()); in insert_after()
860 if(cache_last && (this->get_last_node() == prev_p.pointed_node())){ in insert_after()
1067 static iterator s_insert_after(const_iterator const prev_p, reference value) in s_insert_after() argument
1072 node_algorithms::link_after(prev_p.pointed_node(), n); in s_insert_after()