| /dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libslic3r/ |
| H A D | MutablePriorityQueue.hpp | 40 std::vector<T> m_heap; member in MutablePriorityQueue
64 m_heap.clear(); in clear()
88 assert(! m_heap.empty()); in pop()
97 if (m_heap.size() > 1) { in pop()
98 m_heap.front() = m_heap.back(); in pop()
99 m_heap.pop_back(); in pop()
103 m_heap.clear(); in pop()
119 m_heap.pop_back(); in remove()
122 m_heap[idx] = m_heap.back(); in remove()
124 m_heap.pop_back(); in remove()
[all …]
|
| /dports/devel/systemc/systemc-2.3.4_pub_rev_20190614/src/sysc/utils/ |
| H A D | sc_pq.cpp | 51 m_heap[i] = 0; in sc_ppq_base()
57 delete[] m_heap; in ~sc_ppq_base()
64 void* topelem = m_heap[1]; in extract_top()
65 m_heap[1] = m_heap[m_heap_size]; in extract_top()
84 delete[] m_heap; in insert()
85 m_heap = new_heap; in insert()
89 m_heap[i] = m_heap[parent( i )]; in insert()
92 m_heap[i] = elem; in insert()
100 int largest = (m_compar( m_heap[l], m_heap[i] ) > 0) ? l : i; in heapify()
104 (m_compar( m_heap[r], m_heap[largest] ) > 0) ) { in heapify()
[all …]
|
| /dports/lang/ypsilon/ypsilon-0.9.6-update3/src/ |
| H A D | vm2.cpp | 13 #define CONS(a, d) make_pair(m_heap, (a), (d))
32 m_heap->write_barrier(obj); in prebind_literal()
61 … scm_gloc_t gloc = make_gloc(m_heap, m_current_environment, make_symbol(m_heap, symbol->name)); in prebind_gloc()
64 m_heap->write_barrier(wmap); in prebind_gloc()
66 if (nsize) rehash_weakhashtable(m_heap, m_heap->m_hidden_variables, nsize); in prebind_gloc()
81 m_heap->write_barrier(symbol); in prebind_gloc()
82 m_heap->write_barrier(gloc); in prebind_gloc()
151 m_heap->write_barrier(gloc); in prebind_list()
158 m_heap->write_barrier(gloc); in prebind_list()
165 m_heap->write_barrier(gloc); in prebind_list()
[all …]
|
| H A D | violation.cpp | 89 …scm_port_t port = make_bytevector_port(vm->m_heap, make_symbol(vm->m_heap, "string"), SCM_PORT_DIR… in wrong_type_argument_violation()
114 …scm_port_t port = make_bytevector_port(vm->m_heap, make_symbol(vm->m_heap, "string"), SCM_PORT_DIR… in invalid_application_violation()
118 form = make_pair(vm->m_heap, value, form); in invalid_application_violation()
130 …scm_port_t port = make_bytevector_port(vm->m_heap, make_symbol(vm->m_heap, "string"), SCM_PORT_DIR… in invalid_object_violation()
149 …scm_port_t port = make_bytevector_port(vm->m_heap, make_symbol(vm->m_heap, "string"), SCM_PORT_DIR… in implementation_restriction_violation()
179 …scm_port_t port = make_bytevector_port(vm->m_heap, make_symbol(vm->m_heap, "string"), SCM_PORT_DIR… in wrong_number_of_arguments_violation()
210 …scm_port_t port = make_bytevector_port(vm->m_heap, make_symbol(vm->m_heap, "string"), SCM_PORT_DIR… in wrong_number_of_arguments_violation()
241 …scm_port_t port = make_bytevector_port(vm->m_heap, make_symbol(vm->m_heap, "string"), SCM_PORT_DIR… in invalid_argument_violation()
313 …irritants = make_list(vm->m_heap, 2, make_symbol(vm->m_heap, symbol->name, (uint8_t)symbol->name[l… in thread_lexical_access_violation()
318 irritants = make_list(vm->m_heap, 1, value); in thread_lexical_access_violation()
[all …]
|
| H A D | vm0.cpp | 32 scm_obj_t proc = m_heap->lookup_system_environment(make_symbol(m_heap, name)); in lookup_system_closure()
47 assert(m_heap->in_heap(obj)); in intern_current_environment()
51 m_heap->write_barrier(value); in intern_current_environment()
57 m_heap->write_barrier(symbol); in intern_current_environment()
58 m_heap->write_barrier(gloc); in intern_current_environment()
67 m_heap = heap; in init()
739 m_heap->enqueue_root(m_pc); in stop()
768 m_heap->m_collector_lock.lock(); in stop()
772 m_heap->m_mutator_wake.wait(m_heap->m_collector_lock); in stop()
788 if (d > m_heap->m_usage.m_pause3) m_heap->m_usage.m_pause3 = d; in stop()
[all …]
|
| H A D | object_set.cpp | 39 m_heap = NULL; in object_set_t()
46 assert(m_heap); in ~object_set_t()
66 m_heap = heap; in init()
76 assert(m_heap); in get()
105 assert(m_heap); in put()
128 assert(m_heap); in remove()
152 assert(m_heap); in rehash()
186 assert(m_heap); in inplace_rehash()
216 assert(m_heap); in sweep()
236 assert(m_heap); in resolve()
[all …]
|
| H A D | subr_base_arith.cpp | 550 acc = arith_add(vm->m_heap, acc, argv[i]); in subr_num_add()
586 acc = arith_sub(vm->m_heap, acc, argv[i]); in subr_num_sub()
600 return int128_to_bignum(vm->m_heap, n128); in subr_num_mul()
604 return int64_to_bignum(vm->m_heap, n64); in subr_num_mul()
624 acc = arith_mul(vm->m_heap, acc, argv[i]); in subr_num_mul()
648 return arith_div(vm->m_heap, argv[0], make_flonum(vm->m_heap, 0.0)); in subr_num_div()
684 acc = arith_div(vm->m_heap, acc, make_flonum(vm->m_heap, 0.0)); in subr_num_div()
687 acc = arith_div(vm->m_heap, acc, argv[i]); in subr_num_div()
860 … return arith_add(vm->m_heap, arith_quotient(vm->m_heap, rn->nume, rn->deno), MAKEFIXNUM(1)); in subr_ceiling()
976 return arith_log(vm->m_heap, argv[0]); in subr_log()
[all …]
|
| H A D | subr_hash.cpp | 50 return make_weakhashtable(vm->m_heap, nsize); in subr_make_weak_core_hashtable()
287 vm->m_heap->write_barrier(argv[1]); in subr_core_hashtable_set()
288 vm->m_heap->write_barrier(argv[2]); in subr_core_hashtable_set()
292 if (!vm->m_heap->in_heap(ht)) { in subr_core_hashtable_set()
319 if (!vm->m_heap->in_heap(ht)) { in subr_core_hashtable_set()
332 vm->m_heap->write_barrier(wmap); in subr_core_hashtable_set()
396 if (!vm->m_heap->in_heap(ht)) { in subr_core_hashtable_delete()
425 if (!vm->m_heap->in_heap(ht)) { in subr_core_hashtable_delete()
502 if (!vm->m_heap->in_heap(ht)) { in subr_core_hashtable_clear()
635 …ans = make_pair(vm->m_heap, make_pair(vm->m_heap, ht_datum->elts[i], ht_datum->elts[i + nsize]) , … in subr_core_hashtable_alist()
[all …]
|
| H A D | serialize.cpp | 31 m_heap = heap; in serializer_t()
45 m_heap->deallocate_private(m_stack); in ~serializer_t()
46 m_heap->deallocate_private(m_buf); in ~serializer_t()
112 m_heap->deallocate_private(prev); in expand()
126 m_heap->deallocate_private(prev); in push()
215 m_heap->deallocate_private(lites); in put_lites()
218 m_heap->deallocate_private(lites); in put_lites()
347 m_heap = heap; in deserializer_t()
464 return make_flonum(m_heap, n.f64); in get_datum()
503 m_heap->deallocate_private(buf); in get_lites()
[all …]
|
| H A D | object_slab.cpp | 23 m_heap = NULL; in object_slab_cache_t()
42 m_heap = object_heap; in init()
75 m_heap = NULL; in destroy()
116 assert(m_heap); in new_collectible_object()
118 bool synchronize = (m_heap->m_alloc_barrier != 0); in new_collectible_object()
178 assert(m_heap); in new_object()
208 assert(m_heap); in delete_object()
322 m_heap->deallocate(slab);
336 …if ((cache == &m_heap->m_cons) || (cache == &m_heap->m_flonums) || (cache == &m_heap->m_immutable_…
338 if ((cache == &m_heap->m_cons) || (cache == &m_heap->m_flonums)) {
[all …]
|
| /dports/net/gamenetworkingsockets/GameNetworkingSockets-1.3.0/src/public/tier1/ |
| H A D | utlpriorityqueue.h | 74 CUtlVector<T> m_heap;
99 SetIndexFunc::SetIndex( m_heap[ 0 ], m_heap.InvalidIndex() ); in RemoveAtHead()
100 m_heap.FastRemove( 0 ); in RemoveAtHead()
115 SetIndexFunc::SetIndex( m_heap[ index ], m_heap.InvalidIndex() ); in RemoveAt()
153 if ( m_LessFunc( m_heap[index], m_heap[child] ) ) in PercolateDown()
164 if ( m_LessFunc( m_heap[larger], m_heap[child] ) ) in PercolateDown()
188 if ( m_LessFunc( m_heap[index], m_heap[parent] ) ) in PercolateUp()
203 m_heap[index] = element; in Insert()
212 T tmp = m_heap[index1]; in Swap()
213 m_heap[index1] = m_heap[index2]; in Swap()
[all …]
|
| /dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/javascriptcore/JavaScriptCore/runtime/ |
| H A D | Collector.cpp | 257 m_heap.blocks[m_heap.usedBlocks++] = block; in allocateBlock()
273 m_heap.blocks[block] = m_heap.blocks[m_heap.usedBlocks - 1]; in freeBlock()
276 …if (m_heap.numBlocks > MIN_ARRAY_SIZE && m_heap.usedBlocks < m_heap.numBlocks / LOW_WATER_FACTOR) { in freeBlock()
277 m_heap.numBlocks = m_heap.numBlocks / GROWTH_FACTOR; in freeBlock()
314 DeadObjectIterator it(m_heap, m_heap.nextBlock, m_heap.nextCell); in freeBlocks()
315 DeadObjectIterator end(m_heap, m_heap.usedBlocks); in freeBlocks()
346 if (m_heap.extraCost > maxExtraCost && m_heap.extraCost > m_heap.usedBlocks * BLOCK_SIZE / 2) { in recordExtraCost()
378 ASSERT(m_heap.nextBlock < m_heap.usedBlocks); in allocate()
395 } while (++m_heap.nextBlock != m_heap.usedBlocks); in allocate()
1071 DeadObjectIterator it(m_heap, m_heap.nextBlock, m_heap.nextCell); in sweep()
[all …]
|
| H A D | CollectorHeapIterator.h | 43 CollectorHeap& m_heap; variable
67 : m_heap(heap) in CollectorHeapIterator()
80 return reinterpret_cast<JSCell*>(m_heap.blocks[m_block]->cells + m_cell);
101 if (m_block < m_heap.nextBlock || (m_block == m_heap.nextBlock && m_cell < m_heap.nextCell))
104 while (m_block < m_heap.usedBlocks && !m_heap.blocks[m_block]->marked.get(m_cell))
119 … ASSERT(m_block > m_heap.nextBlock || (m_block == m_heap.nextBlock && m_cell >= m_heap.nextCell));
120 } while (m_block < m_heap.usedBlocks && m_heap.blocks[m_block]->marked.get(m_cell));
|
| /dports/lang/mono/mono-5.10.1.57/mcs/tools/cil-strip/Mono.Cecil.Metadata/ |
| H A D | MetadataTableReader.cs | 41 TablesHeap m_heap; field in Mono.Cecil.Metadata.MetadataTableReader
50 m_heap = m_metadataRoot.Streams.TablesHeap; in MetadataTableReader()
173 return (FileTable) m_heap [FileTable.RId]; in GetFileTable()
293 if (m_heap.HasTable (ModuleTable.RId)) { in VisitTableCollection()
297 if (m_heap.HasTable (TypeRefTable.RId)) { in VisitTableCollection()
301 if (m_heap.HasTable (TypeDefTable.RId)) { in VisitTableCollection()
309 if (m_heap.HasTable (FieldTable.RId)) { in VisitTableCollection()
317 if (m_heap.HasTable (MethodTable.RId)) { in VisitTableCollection()
325 if (m_heap.HasTable (ParamTable.RId)) { in VisitTableCollection()
373 if (m_heap.HasTable (EventTable.RId)) { in VisitTableCollection()
[all …]
|
| H A D | MetadataTableWriter.cs | 42 TablesHeap m_heap; field in Mono.Cecil.Metadata.MetadataTableWriter
49 m_heap = m_root.Streams.TablesHeap; in MetadataTableWriter()
72 m_heap.Valid |= 1L << table.Id; in InitializeTable()
73 m_heap.Tables.Add (table); in InitializeTable()
78 if (m_heap.HasTable (rid)) in WriteCount()
79 m_binaryWriter.Write (m_heap [rid].Rows.Count); in WriteCount()
194 EventTable table = m_heap [EventTable.RId] as EventTable; in GetEventTable()
238 FieldTable table = m_heap [FieldTable.RId] as FieldTable; in GetFieldTable()
293 FileTable table = m_heap [FileTable.RId] as FileTable; in GetFileTable()
370 MethodTable table = m_heap [MethodTable.RId] as MethodTable; in GetMethodTable()
[all …]
|
| /dports/devel/qt5-scripttools/kde-qtscript-5.15.2p4/src/3rdparty/javascriptcore/JavaScriptCore/runtime/ |
| H A D | Collector.cpp | 263 m_heap.blocks[m_heap.usedBlocks++] = block; in allocateBlock()
279 m_heap.blocks[block] = m_heap.blocks[m_heap.usedBlocks - 1]; in freeBlock()
282 …if (m_heap.numBlocks > MIN_ARRAY_SIZE && m_heap.usedBlocks < m_heap.numBlocks / LOW_WATER_FACTOR) { in freeBlock()
283 m_heap.numBlocks = m_heap.numBlocks / GROWTH_FACTOR; in freeBlock()
320 DeadObjectIterator it(m_heap, m_heap.nextBlock, m_heap.nextCell); in freeBlocks()
321 DeadObjectIterator end(m_heap, m_heap.usedBlocks); in freeBlocks()
352 if (m_heap.extraCost > maxExtraCost && m_heap.extraCost > m_heap.usedBlocks * BLOCK_SIZE / 2) { in recordExtraCost()
384 ASSERT(m_heap.nextBlock < m_heap.usedBlocks); in allocate()
401 } while (++m_heap.nextBlock != m_heap.usedBlocks); in allocate()
1106 DeadObjectIterator it(m_heap, m_heap.nextBlock, m_heap.nextCell); in sweep()
[all …]
|
| H A D | CollectorHeapIterator.h | 43 CollectorHeap& m_heap; variable
67 : m_heap(heap) in CollectorHeapIterator()
80 return reinterpret_cast<JSCell*>(m_heap.blocks[m_block]->cells + m_cell);
101 if (m_block < m_heap.nextBlock || (m_block == m_heap.nextBlock && m_cell < m_heap.nextCell))
104 while (m_block < m_heap.usedBlocks && !m_heap.blocks[m_block]->marked.get(m_cell))
119 … ASSERT(m_block > m_heap.nextBlock || (m_block == m_heap.nextBlock && m_cell >= m_heap.nextCell));
120 } while (m_block < m_heap.usedBlocks && m_heap.blocks[m_block]->marked.get(m_cell));
|
| /dports/devel/qt5-script/kde-qtscript-5.15.2p4/src/3rdparty/javascriptcore/JavaScriptCore/runtime/ |
| H A D | Collector.cpp | 263 m_heap.blocks[m_heap.usedBlocks++] = block; in allocateBlock()
279 m_heap.blocks[block] = m_heap.blocks[m_heap.usedBlocks - 1]; in freeBlock()
282 …if (m_heap.numBlocks > MIN_ARRAY_SIZE && m_heap.usedBlocks < m_heap.numBlocks / LOW_WATER_FACTOR) { in freeBlock()
283 m_heap.numBlocks = m_heap.numBlocks / GROWTH_FACTOR; in freeBlock()
320 DeadObjectIterator it(m_heap, m_heap.nextBlock, m_heap.nextCell); in freeBlocks()
321 DeadObjectIterator end(m_heap, m_heap.usedBlocks); in freeBlocks()
352 if (m_heap.extraCost > maxExtraCost && m_heap.extraCost > m_heap.usedBlocks * BLOCK_SIZE / 2) { in recordExtraCost()
384 ASSERT(m_heap.nextBlock < m_heap.usedBlocks); in allocate()
401 } while (++m_heap.nextBlock != m_heap.usedBlocks); in allocate()
1106 DeadObjectIterator it(m_heap, m_heap.nextBlock, m_heap.nextCell); in sweep()
[all …]
|
| H A D | CollectorHeapIterator.h | 43 CollectorHeap& m_heap; variable
67 : m_heap(heap) in CollectorHeapIterator()
80 return reinterpret_cast<JSCell*>(m_heap.blocks[m_block]->cells + m_cell);
101 if (m_block < m_heap.nextBlock || (m_block == m_heap.nextBlock && m_cell < m_heap.nextCell))
104 while (m_block < m_heap.usedBlocks && !m_heap.blocks[m_block]->marked.get(m_cell))
119 … ASSERT(m_block > m_heap.nextBlock || (m_block == m_heap.nextBlock && m_cell >= m_heap.nextCell));
120 } while (m_block < m_heap.usedBlocks && m_heap.blocks[m_block]->marked.get(m_cell));
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/math/lp/ |
| H A D | binary_heap_priority_queue_def.h | 26 put_at(i >> 1, m_heap[i]); in swap_with_parent()
31 m_heap[i] = h; in put_at()
39 if (m_priorities[m_heap[i]] < m_priorities[m_heap[i >> 1]]) in decrease_priority()
58 if (!(m_priorities[m_heap[i]] <= m_priorities[m_heap[ch]])){ in is_consistent()
83 if (m_priorities[m_heap[i]] < m_priorities[m_heap[ip]]) in remove()
109 m_heap.resize(n + 1); in resize()
114 m_heap[i] = o; in put_to_heap()
158 int ret = m_heap[1]; in dequeue_and_get_priority()
168 if (l <= m_heap_size && m_priorities[m_heap[l]] < m_priorities[m_heap[i]]) in fix_heap_under()
171 if (r <= m_heap_size && m_priorities[m_heap[r]] < m_priorities[m_heap[smallest]]) in fix_heap_under()
[all …]
|
| /dports/math/z3/z3-z3-4.8.13/src/math/lp/ |
| H A D | binary_heap_priority_queue_def.h | 26 put_at(i >> 1, m_heap[i]); in swap_with_parent()
31 m_heap[i] = h; in put_at()
39 if (m_priorities[m_heap[i]] < m_priorities[m_heap[i >> 1]]) in decrease_priority()
58 if (!(m_priorities[m_heap[i]] <= m_priorities[m_heap[ch]])){ in is_consistent()
83 if (m_priorities[m_heap[i]] < m_priorities[m_heap[ip]]) in remove()
109 m_heap.resize(n + 1); in resize()
114 m_heap[i] = o; in put_to_heap()
158 int ret = m_heap[1]; in dequeue_and_get_priority()
168 if (l <= m_heap_size && m_priorities[m_heap[l]] < m_priorities[m_heap[i]]) in fix_heap_under()
171 if (r <= m_heap_size && m_priorities[m_heap[r]] < m_priorities[m_heap[smallest]]) in fix_heap_under()
[all …]
|
| /dports/net/ns3/ns-allinone-3.35/ns-3.35/src/core/model/ |
| H A D | heap-scheduler.cc | 58 m_heap.push_back (empty); in HeapScheduler()
109 return m_heap.size () - 1; in Last()
124 NS_ASSERT (b < m_heap.size () && a < m_heap.size ()); in Exch()
126 Event tmp (m_heap[a]); in Exch()
127 m_heap[a] = m_heap[b]; in Exch()
128 m_heap[b] = tmp; in Exch()
135 return m_heap[a] < m_heap[b]; in IsLessStrictly()
205 m_heap.push_back (ev); in Insert()
213 return m_heap[Root ()]; in PeekNext()
221 m_heap.pop_back (); in RemoveNext()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/pdfium/xfa/fxfa/fm2js/ |
| H A D | cxfa_fmparser.cpp | 196 m_heap->GetAllocationHandle()); in ParseExpression()
202 m_heap->GetAllocationHandle()); in ParseExpression()
271 m_heap->GetAllocationHandle(), pExp1); in ParseExpExpression()
298 m_heap->GetAllocationHandle(), TOKor, e1, e2); in ParseLogicalOrExpression()
548 m_heap->GetAllocationHandle(), expr); in ParseUnaryExpression()
557 m_heap->GetAllocationHandle(), expr); in ParseUnaryExpression()
566 m_heap->GetAllocationHandle(), expr); in ParseUnaryExpression()
602 m_heap->GetAllocationHandle(), wsIdentifier); in ParsePrimaryExpression()
629 m_heap->GetAllocationHandle()); in ParseLiteral()
968 m_heap->GetAllocationHandle(), pCondition, in ParseWhileExpression()
[all …]
|
| /dports/lang/gjs/gjs-1.70.0/gjs/ |
| H A D | jsapi-util-root.h | 103 JS::Heap<T> m_heap;
120 new (&m_heap) JS::Heap<T>();
151 return m_heap == other;
162 return m_heap.unbarrieredGet() == nullptr;
185 m_heap.~Heap();
195 m_heap = thing;
204 GjsHeapOperation<T>::expose_to_js(m_heap);
210 m_heap = JS::SafelyInitialized<T>();
223 JS::Rooted<T> thing(cx, m_heap);
239 m_heap = thing;
[all …]
|
| /dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Detour/source/ |
| H A D | DetourNode.cpp | 135 m_heap(0), in dtNodeQueue()
141 m_heap = (dtNode**)dtAlloc(sizeof(dtNode*)*(m_capacity+1), DT_ALLOC_PERM); in dtNodeQueue()
142 dtAssert(m_heap); in dtNodeQueue()
147 dtFree(m_heap); in ~dtNodeQueue()
154 while ((i > 0) && (m_heap[parent]->total > node->total)) in bubbleUp()
156 m_heap[i] = m_heap[parent]; in bubbleUp()
160 m_heap[i] = node; in bubbleUp()
169 (m_heap[child]->total > m_heap[child+1]->total)) in trickleDown()
173 m_heap[i] = m_heap[child]; in trickleDown()
|