mirror of
https://github.com/git/git
synced 2024-10-30 04:01:21 +00:00
66c0dabab5
This reduces the amount of glue code, because we don't need a void pointer or vtable within the structure. The only snag is that reftable_index_record contain a strbuf, so it cannot be zero-initialized. To address this, use reftable_new_record() to return fresh instance, given a record type. Since reftable_new_record() doesn't cause heap allocation anymore, it should be balanced with reftable_record_release() rather than reftable_record_destroy(). Thanks to Peff for the suggestion. Helped-by: Jeff King <peff@peff.net> Signed-off-by: Han-Wen Nienhuys <hanwen@google.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
106 lines
1.9 KiB
C
106 lines
1.9 KiB
C
/*
|
|
Copyright 2020 Google LLC
|
|
|
|
Use of this source code is governed by a BSD-style
|
|
license that can be found in the LICENSE file or at
|
|
https://developers.google.com/open-source/licenses/bsd
|
|
*/
|
|
|
|
#include "pq.h"
|
|
|
|
#include "reftable-record.h"
|
|
#include "system.h"
|
|
#include "basics.h"
|
|
|
|
int pq_less(struct pq_entry *a, struct pq_entry *b)
|
|
{
|
|
struct strbuf ak = STRBUF_INIT;
|
|
struct strbuf bk = STRBUF_INIT;
|
|
int cmp = 0;
|
|
reftable_record_key(&a->rec, &ak);
|
|
reftable_record_key(&b->rec, &bk);
|
|
|
|
cmp = strbuf_cmp(&ak, &bk);
|
|
|
|
strbuf_release(&ak);
|
|
strbuf_release(&bk);
|
|
|
|
if (cmp == 0)
|
|
return a->index > b->index;
|
|
|
|
return cmp < 0;
|
|
}
|
|
|
|
struct pq_entry merged_iter_pqueue_top(struct merged_iter_pqueue pq)
|
|
{
|
|
return pq.heap[0];
|
|
}
|
|
|
|
int merged_iter_pqueue_is_empty(struct merged_iter_pqueue pq)
|
|
{
|
|
return pq.len == 0;
|
|
}
|
|
|
|
struct pq_entry merged_iter_pqueue_remove(struct merged_iter_pqueue *pq)
|
|
{
|
|
int i = 0;
|
|
struct pq_entry e = pq->heap[0];
|
|
pq->heap[0] = pq->heap[pq->len - 1];
|
|
pq->len--;
|
|
|
|
i = 0;
|
|
while (i < pq->len) {
|
|
int min = i;
|
|
int j = 2 * i + 1;
|
|
int k = 2 * i + 2;
|
|
if (j < pq->len && pq_less(&pq->heap[j], &pq->heap[i])) {
|
|
min = j;
|
|
}
|
|
if (k < pq->len && pq_less(&pq->heap[k], &pq->heap[min])) {
|
|
min = k;
|
|
}
|
|
|
|
if (min == i) {
|
|
break;
|
|
}
|
|
|
|
SWAP(pq->heap[i], pq->heap[min]);
|
|
i = min;
|
|
}
|
|
|
|
return e;
|
|
}
|
|
|
|
void merged_iter_pqueue_add(struct merged_iter_pqueue *pq, struct pq_entry e)
|
|
{
|
|
int i = 0;
|
|
|
|
if (pq->len == pq->cap) {
|
|
pq->cap = 2 * pq->cap + 1;
|
|
pq->heap = reftable_realloc(pq->heap,
|
|
pq->cap * sizeof(struct pq_entry));
|
|
}
|
|
|
|
pq->heap[pq->len++] = e;
|
|
i = pq->len - 1;
|
|
while (i > 0) {
|
|
int j = (i - 1) / 2;
|
|
if (pq_less(&pq->heap[j], &pq->heap[i])) {
|
|
break;
|
|
}
|
|
|
|
SWAP(pq->heap[j], pq->heap[i]);
|
|
|
|
i = j;
|
|
}
|
|
}
|
|
|
|
void merged_iter_pqueue_release(struct merged_iter_pqueue *pq)
|
|
{
|
|
int i = 0;
|
|
for (i = 0; i < pq->len; i++) {
|
|
reftable_record_release(&pq->heap[i].rec);
|
|
}
|
|
FREE_AND_NULL(pq->heap);
|
|
pq->len = pq->cap = 0;
|
|
}
|