| /dports/databases/grass7/grass-7.8.6/raster/r.walk/ |
| H A D | heap.c | 70 G_free(heap_index); in free_heap()
104 heap_index[child] = heap_index[parent]; in sift_up()
114 heap_index[child] = child_pnt; in sift_up()
140 heap_index = (struct cost **) G_realloc((void *)heap_index, heap_alloced * sizeof(struct cost *)); in insert()
143 heap_index[heap_size] = new_cell; in insert()
157 next_cell = heap_index[1]; in get_lowest()
158 heap_index[0] = next_cell; in get_lowest()
163 heap_index[1] = NULL; in get_lowest()
180 if (cmp_costs(heap_index[childr], heap_index[child])) { in get_lowest()
188 heap_index[parent] = heap_index[child]; in get_lowest()
[all …]
|
| /dports/databases/grass7/grass-7.8.6/raster/r.cost/ |
| H A D | heap.c | 70 G_free(heap_index); in free_heap()
104 heap_index[child] = heap_index[parent]; in sift_up()
114 heap_index[child] = child_pnt; in sift_up()
140 heap_index = (struct cost **) G_realloc((void *)heap_index, heap_alloced * sizeof(struct cost *)); in insert()
143 heap_index[heap_size] = new_cell; in insert()
157 next_cell = heap_index[1]; in get_lowest()
158 heap_index[0] = next_cell; in get_lowest()
163 heap_index[1] = NULL; in get_lowest()
180 if (cmp_costs(heap_index[childr], heap_index[child])) { in get_lowest()
188 heap_index[parent] = heap_index[child]; in get_lowest()
[all …]
|
| /dports/net/beanstalkd/beanstalkd-1.10/ |
| H A D | testheap.c | 24 assertf(j->heap_index == 0, "should match"); in cttestheap_insert_one()
46 printf("j->heap_index is %zu\n", j->heap_index); in cttestheap_insert_and_remove_one()
69 assertf(j2->heap_index == 0, "should match"); in cttestheap_priority()
73 assertf(j2->heap_index == 0, "should match"); in cttestheap_priority()
74 assertf(j3->heap_index == 1, "should match"); in cttestheap_priority()
78 assertf(j1->heap_index == 0, "should match"); in cttestheap_priority()
79 assertf(j2->heap_index == 2, "should match"); in cttestheap_priority()
80 assertf(j3->heap_index == 1, "should match"); in cttestheap_priority()
84 assertf(j2->heap_index == 0, "should match"); in cttestheap_priority()
85 assertf(j3->heap_index == 1, "should match"); in cttestheap_priority()
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/community/walktrap/ |
| H A D | walktrap_heap.cpp | 65 tmp->heap_index = index; in move_up()
106 H[N->heap_index] = last_N; in remove()
107 last_N->heap_index = N->heap_index; in remove()
108 move_up(last_N->heap_index); in remove()
110 N->heap_index = -1; in remove()
117 N->heap_index = size++; in add()
118 H[N->heap_index] = N; in add()
119 move_up(N->heap_index); in add()
123 if (N->heap_index == -1) { in update()
126 move_up(N->heap_index); in update()
[all …]
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | walktrap_heap.cpp | 65 tmp->heap_index = index; in move_up()
106 H[N->heap_index] = last_N; in remove()
107 last_N->heap_index = N->heap_index; in remove()
108 move_up(last_N->heap_index); in remove()
110 N->heap_index = -1; in remove()
117 N->heap_index = size++; in add()
118 H[N->heap_index] = N; in add()
119 move_up(N->heap_index); in add()
123 if (N->heap_index == -1) { in update()
126 move_up(N->heap_index); in update()
[all …]
|
| /dports/ftp/lftp/lftp-4.9.2/src/ |
| H A D | xheap.h | 37 int heap_index; variable
51 ptr(a)->heap_index=a; in swap()
52 ptr(b)->heap_index=b; in swap()
81 ptr(count())->heap_index=0; in chop()
101 if(n.heap_index) { in add()
102 int i=n.heap_index; in add()
108 siftup(n.heap_index=count()); in add()
112 fix(n.heap_index); in fix()
125 if(!x.heap_index) in remove()
128 remove(x.heap_index); in remove()
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/gfx-backend-dx12/src/ |
| H A D | descriptors_cpu.rs | 126 heap_index: usize, field
153 let heap_index = self in alloc_handle() localVariable
165 let heap = &mut self.heaps[heap_index]; in alloc_handle()
168 heap_index, in alloc_handle()
252 heap_index: usize, field
261 heap_index: 0, in new()
277 self.heap_index = 0; in reset()
290 if self.heaps[self.heap_index].is_full() { in alloc_handle()
291 self.heap_index += 1; in alloc_handle()
293 self.heap_index = 0; in alloc_handle()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/rust/gfx-backend-dx12/src/ |
| H A D | descriptors_cpu.rs | 126 heap_index: usize, field
153 let heap_index = self in alloc_handle() localVariable
165 let heap = &mut self.heaps[heap_index]; in alloc_handle()
168 heap_index, in alloc_handle()
252 heap_index: usize, field
261 heap_index: 0, in new()
277 self.heap_index = 0; in reset()
290 if self.heaps[self.heap_index].is_full() { in alloc_handle()
291 self.heap_index += 1; in alloc_handle()
293 self.heap_index = 0; in alloc_handle()
[all …]
|
| /dports/dns/yadifa/yadifa-2.5.3-10333/lib/dnscore/src/ |
| H A D | shared-heap.c | 72 u8 heap_index; member
83 u8 heap_index; member
211 assert(bloc->heap_index == id); in shared_heap_check_bloc()
484 next_bloc->heap_index = bloc->heap_index; in shared_heap_alloc_from_ctx()
581 next_bloc->heap_index = bloc->heap_index; in shared_heap_try_alloc_from_ctx()
687 next_bloc->heap_index = bloc->heap_index; in shared_heap_wait_alloc_from_ctx()
981 split_bloc->heap_index = next_bloc->heap_index; in shared_heap_realloc_from_ctx()
1096 assert(header->heap_index == id); in shared_heap_check()
1104 assert(footer->heap_index == id); in shared_heap_check()
1120 assert(bloc->heap_index == id); in shared_heap_check()
[all …]
|
| /dports/databases/grass7/grass-7.8.6/raster/r.watershed/ram/ |
| H A D | do_astar.c | 46 first_astar = heap_index[1]; in do_astar()
188 G_free(heap_index); in do_astar()
221 child_added = heap_index[child]; in sift_up()
229 if (cmp_pnt(ele, elep, child_added, heap_index[parent])) { in sift_up()
231 heap_index[child] = heap_index[parent]; in sift_up()
242 heap_index[child] = child_added; in sift_up()
260 heap_index[heap_size] = nxt_avail_pt++; in add_pt()
277 heap_index[1] = -1; in drop_pt()
294 if (cmp_pnt(eler, ele, heap_index[childr], heap_index[child])) { in drop_pt()
301 heap_index[parent] = heap_index[child]; in drop_pt()
[all …]
|
| /dports/devel/grpc/grpc-1.42.0/src/core/lib/iomgr/ |
| H A D | timer_heap.cc | 40 first[i]->heap_index = i; in adjust_upwards()
44 t->heap_index = i; in adjust_upwards()
62 first[i]->heap_index = i; in adjust_downwards()
66 t->heap_index = i; in adjust_downwards()
82 uint32_t i = timer->heap_index; in note_changed_priority()
104 timer->heap_index = heap->timer_count; in grpc_timer_heap_add()
107 return timer->heap_index == 0; in grpc_timer_heap_add()
111 uint32_t i = timer->heap_index; in grpc_timer_heap_remove()
118 heap->timers[i]->heap_index = i; in grpc_timer_heap_remove()
|
| /dports/devel/grpc130/grpc-1.30.2/src/core/lib/iomgr/ |
| H A D | timer_heap.cc | 41 first[i]->heap_index = i; in adjust_upwards()
45 t->heap_index = i; in adjust_upwards()
63 first[i]->heap_index = i; in adjust_downwards()
67 t->heap_index = i; in adjust_downwards()
83 uint32_t i = timer->heap_index; in note_changed_priority()
105 timer->heap_index = heap->timer_count; in grpc_timer_heap_add()
108 return timer->heap_index == 0; in grpc_timer_heap_add()
112 uint32_t i = timer->heap_index; in grpc_timer_heap_remove()
119 heap->timers[i]->heap_index = i; in grpc_timer_heap_remove()
|
| /dports/devel/grpc134/grpc-1.34.1/src/core/lib/iomgr/ |
| H A D | timer_heap.cc | 41 first[i]->heap_index = i; in adjust_upwards()
45 t->heap_index = i; in adjust_upwards()
63 first[i]->heap_index = i; in adjust_downwards()
67 t->heap_index = i; in adjust_downwards()
83 uint32_t i = timer->heap_index; in note_changed_priority()
105 timer->heap_index = heap->timer_count; in grpc_timer_heap_add()
108 return timer->heap_index == 0; in grpc_timer_heap_add()
112 uint32_t i = timer->heap_index; in grpc_timer_heap_remove()
119 heap->timers[i]->heap_index = i; in grpc_timer_heap_remove()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/grpc/src/src/core/lib/iomgr/ |
| H A D | timer_heap.cc | 41 first[i]->heap_index = i; in adjust_upwards()
45 t->heap_index = i; in adjust_upwards()
63 first[i]->heap_index = i; in adjust_downwards()
67 t->heap_index = i; in adjust_downwards()
83 uint32_t i = timer->heap_index; in note_changed_priority()
105 timer->heap_index = heap->timer_count; in grpc_timer_heap_add()
108 return timer->heap_index == 0; in grpc_timer_heap_add()
112 uint32_t i = timer->heap_index; in grpc_timer_heap_remove()
119 heap->timers[i]->heap_index = i; in grpc_timer_heap_remove()
|
| /dports/devel/pecl-grpc/grpc-1.42.0/src/core/lib/iomgr/ |
| H A D | timer_heap.cc | 40 first[i]->heap_index = i; in adjust_upwards()
44 t->heap_index = i; in adjust_upwards()
62 first[i]->heap_index = i; in adjust_downwards()
66 t->heap_index = i; in adjust_downwards()
82 uint32_t i = timer->heap_index; in note_changed_priority()
104 timer->heap_index = heap->timer_count; in grpc_timer_heap_add()
107 return timer->heap_index == 0; in grpc_timer_heap_add()
111 uint32_t i = timer->heap_index; in grpc_timer_heap_remove()
118 heap->timers[i]->heap_index = i; in grpc_timer_heap_remove()
|
| /dports/devel/py-grpcio/grpcio-1.43.0/src/core/lib/iomgr/ |
| H A D | timer_heap.cc | 40 first[i]->heap_index = i; in adjust_upwards()
44 t->heap_index = i; in adjust_upwards()
62 first[i]->heap_index = i; in adjust_downwards()
66 t->heap_index = i; in adjust_downwards()
82 uint32_t i = timer->heap_index; in note_changed_priority()
104 timer->heap_index = heap->timer_count; in grpc_timer_heap_add()
107 return timer->heap_index == 0; in grpc_timer_heap_add()
111 uint32_t i = timer->heap_index; in grpc_timer_heap_remove()
118 heap->timers[i]->heap_index = i; in grpc_timer_heap_remove()
|
| /dports/net/ntpsec/ntpsec-NTPsec_1_2_1/tests/unity/ |
| H A D | unity_memory.c | 44 static size_t heap_index; variable
84 if (heap_index + total_size > UNITY_INTERNAL_HEAP_SIZE_BYTES) in unity_malloc()
91 guard = (Guard*)(void*)(&unity_heap[heap_index]); in unity_malloc()
92 heap_index += total_size; in unity_malloc()
128 if (mem == unity_heap + heap_index - block_size) in release_memory()
130 heap_index -= (sizeof(Guard) + block_size); in release_memory()
189 if ((oldMem == unity_heap + heap_index - old_total_size) && in unity_realloc()
190 …((heap_index - old_total_size + unity_size_round_up(size + sizeof(end))) <= UNITY_INTERNAL_HEAP_SI… in unity_realloc()
|
| /dports/math/yices/yices-2.6.2/src/mcsat/ |
| H A D | variable_queue.c | 38 queue->heap_index = (int32_t *) safe_malloc(VAR_QUEUE_INITIAL_SIZE * sizeof(int32_t)); in var_queue_construct()
42 queue->heap_index[i] = -1; in var_queue_construct()
67 queue->heap_index = (int32_t *) safe_realloc(queue->heap_index, n * sizeof(int32_t)); in var_queue_extend()
72 queue->heap_index[i] = -1; in var_queue_extend()
79 safe_free(queue->heap_index); in var_queue_destruct()
91 index = queue->heap_index; in var_queue_update_up()
133 index = queue->heap_index; in var_queue_update_down()
182 if (queue->heap_index[x] < 0) { in var_queue_insert()
204 queue->heap_index[top] = -1; in var_queue_pop()
244 i = heap->heap_index[x]; in var_queue_bump_variable()
[all …]
|
| /dports/math/yices/yices-2.6.2/tests/unit/ |
| H A D | test_heap.c | 66 heap->heap_index[i] = -1; in init_heap()
91 heap->heap_index = (int32_t *) safe_realloc(heap->heap_index, n * sizeof(int32_t)); in extend_heap()
95 heap->heap_index[i] = -1; in extend_heap()
105 safe_free(heap->heap_index); in delete_heap()
118 heap->heap_index[i] = -1; in reset_heap()
135 index = heap->heap_index; in update_up()
172 index = heap->heap_index; in update_down()
255 i = heap->heap_index[x]; in heap_remove()
258 heap->heap_index[x] = -1; in heap_remove()
325 i = heap->heap_index[x]; in incr_bvar_activity()
[all …]
|
| /dports/x11-toolkits/libdazzle/libdazzle-3.42.0/src/util/ |
| H A D | dzl-heap.c | 103 #define heap_index(h,i) ((h)->data + (i * (h)->element_size)) macro
104 #define heap_compare(h,a,b) ((h)->compare(heap_index(h,a), heap_index(h,b)))
107 memcpy ((h)->tmp, heap_index (h, a), (h)->element_size); \
108 memcpy (heap_index (h, a), heap_index (h, b), (h)->element_size); \
109 memcpy (heap_index (h, b), (h)->tmp, (h)->element_size); \
282 memcpy (result, heap_index (real, 0), real->element_size); in dzl_heap_extract()
287 heap_index (real, real->len), in dzl_heap_extract()
340 memcpy (result, heap_index (real, index_), real->element_size); in dzl_heap_extract_index()
346 memcpy (heap_index (real, index_), in dzl_heap_extract_index()
347 heap_index (real, real->len), in dzl_heap_extract_index()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/gfx-memory/src/heaps/ |
| H A D | memory_type.rs | 28 heap_index: usize, field
46 heap_index: hal_memory_type.heap_index, in new()
74 pub(super) fn heap_index(&self) -> usize { in heap_index() method
75 self.heap_index in heap_index()
128 heap_index: self.heap_index, in utilization()
|
| /dports/graphics/urt/urt-3.1b1_12/cnv/rletogif/ |
| H A D | compgif.c | 76 int heap_index; local
84 heap_index = 0;
101 root[i] = heap[heap_index++];
127 cur_node->left = heap[heap_index++];
135 cur_node->right = heap[heap_index++];
150 cur_node->children = heap[heap_index++];
166 heap_index = num_colors; /* reinitialize string table */
|
| /dports/graphics/rx/rx-0.4.0/cargo-crates/rendy-memory-0.5.0/src/heaps/ |
| H A D | memory_type.rs | 9 heap_index: usize, field
25 heap_index: usize, in new()
31 heap_index, in new()
52 pub(super) fn heap_index(&self) -> usize { in heap_index() function
53 self.heap_index in heap_index()
154 heap_index: self.heap_index, in utilization()
|
| /dports/benchmarks/fio/fio-3.29/lib/ |
| H A D | prio_tree.c | 174 unsigned long radix_index, heap_index; in prio_tree_insert() local
178 get_index(node, &radix_index, &heap_index); in prio_tree_insert()
181 heap_index > prio_tree_maxindex(root->index_bits)) in prio_tree_insert()
182 return prio_tree_expand(root, node, heap_index); in prio_tree_insert()
190 if (r_index == radix_index && h_index == heap_index) in prio_tree_insert()
193 if (h_index < heap_index || in prio_tree_insert()
194 (h_index == heap_index && r_index > radix_index)) { in prio_tree_insert()
203 h_index = heap_index; in prio_tree_insert()
204 heap_index = index; in prio_tree_insert()
208 index = heap_index - radix_index; in prio_tree_insert()
|
| /dports/math/py-or-tools/or-tools-9.2/ortools/sat/ |
| H A D | simplification.h | 282 PQElement() : heap_index(-1), variable(-1), weight(0.0) {} in PQElement()
285 void SetHeapIndex(int h) { heap_index = h; } in SetHeapIndex()
286 int GetHeapIndex() const { return heap_index; } in GetHeapIndex()
294 int heap_index; member
307 BvaPqElement() : heap_index(-1), literal(-1), weight(0.0) {} in BvaPqElement()
310 void SetHeapIndex(int h) { heap_index = h; } in SetHeapIndex()
311 int GetHeapIndex() const { return heap_index; } in GetHeapIndex()
319 int heap_index; member
|