зеркало из https://github.com/mono/libgit2.git
Replace pqueue with code from hashsig heap
I accidentally wrote a separate priority queue implementation when I was working on file rename detection as part of the file hash signature calculation code. To simplify licensing terms, I just adapted that to a general purpose priority queue and replace the old priority queue implementation that was borrowed from elsewhere. This also removes parts of the COPYING document that no longer apply to libgit2.
This commit is contained in:
Russell Belfer
Родитель
40e10630cf
Коммит
4075e060b4
75
COPYING
75
COPYING
|
|
@ -388,19 +388,7 @@ Copyright (C) 1995-2010 Jean-loup Gailly and Mark Adler
|
|||
|
||||
----------------------------------------------------------------------
|
||||
|
||||
The priority queue implementation is based on code licensed under the
|
||||
Apache 2.0 license:
|
||||
|
||||
Copyright 2010 Volkan Yazıcı <volkan.yazici@gmail.com>
|
||||
Copyright 2006-2010 The Apache Software Foundation
|
||||
|
||||
The full text of the Apache 2.0 license is available at:
|
||||
|
||||
http://www.apache.org/licenses/LICENSE-2.0
|
||||
|
||||
----------------------------------------------------------------------
|
||||
|
||||
The Clay framework is licensed under the MIT license:
|
||||
The Clar framework is licensed under the MIT license:
|
||||
|
||||
Copyright (C) 2011 by Vicent Marti
|
||||
|
||||
|
|
@ -930,64 +918,3 @@ necessary. Here is a sample; alter the names:
|
|||
That's all there is to it!
|
||||
|
||||
----------------------------------------------------------------------
|
||||
|
||||
Portions of src/win32/posix_w32.c are derrived from link_win32.c in PHP:
|
||||
|
||||
--------------------------------------------------------------------
|
||||
The PHP License, version 3.01
|
||||
Copyright (c) 1999 - 2012 The PHP Group. All rights reserved.
|
||||
--------------------------------------------------------------------
|
||||
|
||||
Redistribution and use in source and binary forms, with or without
|
||||
modification, is permitted provided that the following conditions
|
||||
are met:
|
||||
|
||||
1. Redistributions of source code must retain the above copyright
|
||||
notice, this list of conditions and the following disclaimer.
|
||||
|
||||
2. Redistributions in binary form must reproduce the above copyright
|
||||
notice, this list of conditions and the following disclaimer in
|
||||
the documentation and/or other materials provided with the
|
||||
distribution.
|
||||
|
||||
3. The name "PHP" must not be used to endorse or promote products
|
||||
derived from this software without prior written permission. For
|
||||
written permission, please contact group@php.net.
|
||||
|
||||
4. Products derived from this software may not be called "PHP", nor
|
||||
may "PHP" appear in their name, without prior written permission
|
||||
from group@php.net. You may indicate that your software works in
|
||||
conjunction with PHP by saying "Foo for PHP" instead of calling
|
||||
it "PHP Foo" or "phpfoo"
|
||||
|
||||
5. The PHP Group may publish revised and/or new versions of the
|
||||
license from time to time. Each version will be given a
|
||||
distinguishing version number.
|
||||
Once covered code has been published under a particular version
|
||||
of the license, you may always continue to use it under the terms
|
||||
of that version. You may also choose to use such covered code
|
||||
under the terms of any subsequent version of the license
|
||||
published by the PHP Group. No one other than the PHP Group has
|
||||
the right to modify the terms applicable to covered code created
|
||||
under this License.
|
||||
|
||||
6. Redistributions of any form whatsoever must retain the following
|
||||
acknowledgment:
|
||||
"This product includes PHP software, freely available from
|
||||
<http://www.php.net/software/>".
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE PHP DEVELOPMENT TEAM ``AS IS'' AND
|
||||
ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
|
||||
PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE PHP
|
||||
DEVELOPMENT TEAM OR ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
|
||||
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
||||
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
||||
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
||||
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
||||
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
||||
OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
--------------------------------------------------------------------
|
||||
|
||||
|
|
|
|||
|
|
@ -11,10 +11,10 @@
|
|||
#include "pool.h"
|
||||
#include "odb.h"
|
||||
|
||||
int git_commit_list_time_cmp(void *a, void *b)
|
||||
int git_commit_list_time_cmp(const void *a, const void *b)
|
||||
{
|
||||
git_commit_list_node *commit_a = (git_commit_list_node *)a;
|
||||
git_commit_list_node *commit_b = (git_commit_list_node *)b;
|
||||
const git_commit_list_node *commit_a = a;
|
||||
const git_commit_list_node *commit_b = b;
|
||||
|
||||
return (commit_a->time < commit_b->time);
|
||||
}
|
||||
|
|
|
|||
|
|
@ -39,7 +39,7 @@ typedef struct git_commit_list {
|
|||
} git_commit_list;
|
||||
|
||||
git_commit_list_node *git_commit_list_alloc_node(git_revwalk *walk);
|
||||
int git_commit_list_time_cmp(void *a, void *b);
|
||||
int git_commit_list_time_cmp(const void *a, const void *b);
|
||||
void git_commit_list_free(git_commit_list **list_p);
|
||||
git_commit_list *git_commit_list_insert(git_commit_list_node *item, git_commit_list **list_p);
|
||||
git_commit_list *git_commit_list_insert_by_date(git_commit_list_node *item, git_commit_list **list_p);
|
||||
|
|
|
|||
35
src/graph.c
35
src/graph.c
|
|
@ -1,4 +1,3 @@
|
|||
|
||||
/*
|
||||
* Copyright (C) the libgit2 contributors. All rights reserved.
|
||||
*
|
||||
|
|
@ -13,9 +12,9 @@
|
|||
static int interesting(git_pqueue *list, git_commit_list *roots)
|
||||
{
|
||||
unsigned int i;
|
||||
/* element 0 isn't used - we need to start at 1 */
|
||||
for (i = 1; i < list->size; i++) {
|
||||
git_commit_list_node *commit = list->d[i];
|
||||
|
||||
for (i = 0; i < git_pqueue_size(list); i++) {
|
||||
git_commit_list_node *commit = git_pqueue_get(list, i);
|
||||
if ((commit->flags & STALE) == 0)
|
||||
return 1;
|
||||
}
|
||||
|
|
@ -42,7 +41,7 @@ static int mark_parents(git_revwalk *walk, git_commit_list_node *one,
|
|||
return 0;
|
||||
}
|
||||
|
||||
if (git_pqueue_init(&list, 2, git_commit_list_time_cmp) < 0)
|
||||
if (git_pqueue_init(&list, 0, 2, git_commit_list_time_cmp) < 0)
|
||||
return -1;
|
||||
|
||||
if (git_commit_list_parse(walk, one) < 0)
|
||||
|
|
@ -59,10 +58,9 @@ static int mark_parents(git_revwalk *walk, git_commit_list_node *one,
|
|||
|
||||
/* as long as there are non-STALE commits */
|
||||
while (interesting(&list, roots)) {
|
||||
git_commit_list_node *commit;
|
||||
git_commit_list_node *commit = git_pqueue_pop(&list);
|
||||
int flags;
|
||||
|
||||
commit = git_pqueue_pop(&list);
|
||||
if (commit == NULL)
|
||||
break;
|
||||
|
||||
|
|
@ -110,16 +108,16 @@ static int ahead_behind(git_commit_list_node *one, git_commit_list_node *two,
|
|||
{
|
||||
git_commit_list_node *commit;
|
||||
git_pqueue pq;
|
||||
int i;
|
||||
int error = 0, i;
|
||||
*ahead = 0;
|
||||
*behind = 0;
|
||||
|
||||
if (git_pqueue_init(&pq, 2, git_commit_list_time_cmp) < 0)
|
||||
if (git_pqueue_init(&pq, 0, 2, git_commit_list_time_cmp) < 0)
|
||||
return -1;
|
||||
if (git_pqueue_insert(&pq, one) < 0)
|
||||
goto on_error;
|
||||
if (git_pqueue_insert(&pq, two) < 0)
|
||||
goto on_error;
|
||||
|
||||
if ((error = git_pqueue_insert(&pq, one)) < 0 ||
|
||||
(error = git_pqueue_insert(&pq, two)) < 0)
|
||||
goto done;
|
||||
|
||||
while ((commit = git_pqueue_pop(&pq)) != NULL) {
|
||||
if (commit->flags & RESULT ||
|
||||
|
|
@ -132,18 +130,15 @@ static int ahead_behind(git_commit_list_node *one, git_commit_list_node *two,
|
|||
|
||||
for (i = 0; i < commit->out_degree; i++) {
|
||||
git_commit_list_node *p = commit->parents[i];
|
||||
if (git_pqueue_insert(&pq, p) < 0)
|
||||
return -1;
|
||||
if ((error = git_pqueue_insert(&pq, p)) < 0)
|
||||
goto done;
|
||||
}
|
||||
commit->flags |= RESULT;
|
||||
}
|
||||
|
||||
done:
|
||||
git_pqueue_free(&pq);
|
||||
return 0;
|
||||
|
||||
on_error:
|
||||
git_pqueue_free(&pq);
|
||||
return -1;
|
||||
return error;
|
||||
}
|
||||
|
||||
int git_graph_ahead_behind(size_t *ahead, size_t *behind, git_repository *repo,
|
||||
|
|
|
|||
15
src/merge.c
15
src/merge.c
|
|
@ -161,10 +161,10 @@ on_error:
|
|||
|
||||
static int interesting(git_pqueue *list)
|
||||
{
|
||||
unsigned int i;
|
||||
/* element 0 isn't used - we need to start at 1 */
|
||||
for (i = 1; i < list->size; i++) {
|
||||
git_commit_list_node *commit = list->d[i];
|
||||
size_t i;
|
||||
|
||||
for (i = 0; i < git_pqueue_size(list); i++) {
|
||||
git_commit_list_node *commit = git_pqueue_get(list, i);
|
||||
if ((commit->flags & STALE) == 0)
|
||||
return 1;
|
||||
}
|
||||
|
|
@ -186,7 +186,7 @@ int git_merge__bases_many(git_commit_list **out, git_revwalk *walk, git_commit_l
|
|||
return git_commit_list_insert(one, out) ? 0 : -1;
|
||||
}
|
||||
|
||||
if (git_pqueue_init(&list, twos->length * 2, git_commit_list_time_cmp) < 0)
|
||||
if (git_pqueue_init(&list, 0, twos->length * 2, git_commit_list_time_cmp) < 0)
|
||||
return -1;
|
||||
|
||||
if (git_commit_list_parse(walk, one) < 0)
|
||||
|
|
@ -205,10 +205,11 @@ int git_merge__bases_many(git_commit_list **out, git_revwalk *walk, git_commit_l
|
|||
|
||||
/* as long as there are non-STALE commits */
|
||||
while (interesting(&list)) {
|
||||
git_commit_list_node *commit;
|
||||
git_commit_list_node *commit = git_pqueue_pop(&list);
|
||||
int flags;
|
||||
|
||||
commit = git_pqueue_pop(&list);
|
||||
if (commit == NULL)
|
||||
break;
|
||||
|
||||
flags = commit->flags & (PARENT1 | PARENT2 | STALE);
|
||||
if (flags == (PARENT1 | PARENT2)) {
|
||||
|
|
|
|||
194
src/pqueue.c
194
src/pqueue.c
|
|
@ -3,161 +3,95 @@
|
|||
*
|
||||
* This file is part of libgit2, distributed under the GNU GPL v2 with
|
||||
* a Linking Exception. For full terms see the included COPYING file.
|
||||
*
|
||||
* This file is based on a modified version of the priority queue found
|
||||
* in the Apache project and libpqueue library.
|
||||
*
|
||||
* https://github.com/vy/libpqueue
|
||||
*
|
||||
* Original file notice:
|
||||
*
|
||||
* Copyright 2010 Volkan Yazici <volkan.yazici@gmail.com>
|
||||
* Copyright 2006-2010 The Apache Software Foundation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License"); you may not
|
||||
* use this file except in compliance with the License. You may obtain a copy of
|
||||
* the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
|
||||
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
|
||||
* License for the specific language governing permissions and limitations under
|
||||
* the License.
|
||||
*/
|
||||
|
||||
#include "common.h"
|
||||
#include "pqueue.h"
|
||||
#include "util.h"
|
||||
|
||||
#define left(i) ((i) << 1)
|
||||
#define right(i) (((i) << 1) + 1)
|
||||
#define parent(i) ((i) >> 1)
|
||||
#define PQUEUE_LCHILD_OF(I) (((I)<<1)+1)
|
||||
#define PQUEUE_RCHILD_OF(I) (((I)<<1)+2)
|
||||
#define PQUEUE_PARENT_OF(I) (((I)-1)>>1)
|
||||
|
||||
int git_pqueue_init(git_pqueue *q, size_t n, git_pqueue_cmp cmppri)
|
||||
int git_pqueue_init(
|
||||
git_pqueue *pq,
|
||||
uint32_t flags,
|
||||
size_t est_size,
|
||||
git_vector_cmp cmp)
|
||||
{
|
||||
assert(q);
|
||||
|
||||
/* Need to allocate n+1 elements since element 0 isn't used. */
|
||||
q->d = git__malloc((n + 1) * sizeof(void *));
|
||||
GITERR_CHECK_ALLOC(q->d);
|
||||
|
||||
q->size = 1;
|
||||
q->avail = q->step = (n + 1); /* see comment above about n+1 */
|
||||
q->cmppri = cmppri;
|
||||
|
||||
return 0;
|
||||
pq->flags = flags;
|
||||
pq->initial_size = est_size;
|
||||
return git_vector_init(&pq->values, est_size, cmp);
|
||||
}
|
||||
|
||||
|
||||
void git_pqueue_free(git_pqueue *q)
|
||||
void git_pqueue_free(git_pqueue *pq)
|
||||
{
|
||||
git__free(q->d);
|
||||
q->d = NULL;
|
||||
git_vector_free(&pq->values);
|
||||
}
|
||||
|
||||
void git_pqueue_clear(git_pqueue *q)
|
||||
static void pqueue_up(git_pqueue *pq, size_t el)
|
||||
{
|
||||
q->size = 1;
|
||||
size_t parent_el = PQUEUE_PARENT_OF(el);
|
||||
|
||||
while (el > 0 && git_vector_cmp_elements(&pq->values, parent_el, el) > 0) {
|
||||
git_vector_swap_elements(&pq->values, el, parent_el);
|
||||
|
||||
el = parent_el;
|
||||
parent_el = PQUEUE_PARENT_OF(el);
|
||||
}
|
||||
}
|
||||
|
||||
size_t git_pqueue_size(git_pqueue *q)
|
||||
static void pqueue_down(git_pqueue *pq, size_t el)
|
||||
{
|
||||
/* queue element 0 exists but doesn't count since it isn't used. */
|
||||
return (q->size - 1);
|
||||
size_t last = git_vector_length(&pq->values);
|
||||
|
||||
while (1) {
|
||||
size_t kid = PQUEUE_LCHILD_OF(el), rkid = PQUEUE_RCHILD_OF(el);
|
||||
if (kid >= last)
|
||||
break;
|
||||
if (rkid < last && git_vector_cmp_elements(&pq->values, kid, rkid) > 0)
|
||||
kid = rkid;
|
||||
|
||||
if (git_vector_cmp_elements(&pq->values, el, kid) < 0)
|
||||
break;
|
||||
|
||||
git_vector_swap_elements(&pq->values, el, kid);
|
||||
el = kid;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
static void bubble_up(git_pqueue *q, size_t i)
|
||||
int git_pqueue_insert(git_pqueue *pq, void *item)
|
||||
{
|
||||
size_t parent_node;
|
||||
void *moving_node = q->d[i];
|
||||
int error = 0;
|
||||
|
||||
for (parent_node = parent(i);
|
||||
((i > 1) && q->cmppri(q->d[parent_node], moving_node));
|
||||
i = parent_node, parent_node = parent(i)) {
|
||||
q->d[i] = q->d[parent_node];
|
||||
/* if heap is full, pop the top element if new one should replace it */
|
||||
if ((pq->flags & GIT_PQUEUE_FIXED_SIZE) != 0 &&
|
||||
pq->values.length >= pq->initial_size)
|
||||
{
|
||||
/* skip item if below min item in heap */
|
||||
if (pq->values._cmp(item, git_vector_get(&pq->values, 0)) <= 0)
|
||||
return 0;
|
||||
(void)git_pqueue_pop(pq);
|
||||
}
|
||||
|
||||
q->d[i] = moving_node;
|
||||
error = git_vector_insert(&pq->values, item);
|
||||
|
||||
if (!error)
|
||||
pqueue_up(pq, pq->values.length - 1);
|
||||
|
||||
return error;
|
||||
}
|
||||
|
||||
|
||||
static size_t maxchild(git_pqueue *q, size_t i)
|
||||
void *git_pqueue_pop(git_pqueue *pq)
|
||||
{
|
||||
size_t child_node = left(i);
|
||||
void *rval = git_vector_get(&pq->values, 0);
|
||||
|
||||
if (child_node >= q->size)
|
||||
return 0;
|
||||
|
||||
if ((child_node + 1) < q->size &&
|
||||
q->cmppri(q->d[child_node], q->d[child_node + 1]))
|
||||
child_node++; /* use right child instead of left */
|
||||
|
||||
return child_node;
|
||||
}
|
||||
|
||||
|
||||
static void percolate_down(git_pqueue *q, size_t i)
|
||||
{
|
||||
size_t child_node;
|
||||
void *moving_node = q->d[i];
|
||||
|
||||
while ((child_node = maxchild(q, i)) != 0 &&
|
||||
q->cmppri(moving_node, q->d[child_node])) {
|
||||
q->d[i] = q->d[child_node];
|
||||
i = child_node;
|
||||
if (git_vector_length(&pq->values) > 1) {
|
||||
pq->values.contents[0] = git_vector_last(&pq->values);
|
||||
git_vector_pop(&pq->values);
|
||||
pqueue_down(pq, 0);
|
||||
} else {
|
||||
git_vector_pop(&pq->values);
|
||||
}
|
||||
|
||||
q->d[i] = moving_node;
|
||||
}
|
||||
|
||||
|
||||
int git_pqueue_insert(git_pqueue *q, void *d)
|
||||
{
|
||||
void *tmp;
|
||||
size_t i;
|
||||
size_t newsize;
|
||||
|
||||
if (!q) return 1;
|
||||
|
||||
/* allocate more memory if necessary */
|
||||
if (q->size >= q->avail) {
|
||||
newsize = q->size + q->step;
|
||||
tmp = git__realloc(q->d, sizeof(void *) * newsize);
|
||||
GITERR_CHECK_ALLOC(tmp);
|
||||
|
||||
q->d = tmp;
|
||||
q->avail = newsize;
|
||||
}
|
||||
|
||||
/* insert item */
|
||||
i = q->size++;
|
||||
q->d[i] = d;
|
||||
bubble_up(q, i);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
void *git_pqueue_pop(git_pqueue *q)
|
||||
{
|
||||
void *head;
|
||||
|
||||
if (!q || q->size == 1)
|
||||
return NULL;
|
||||
|
||||
head = q->d[1];
|
||||
q->d[1] = q->d[--q->size];
|
||||
percolate_down(q, 1);
|
||||
|
||||
return head;
|
||||
}
|
||||
|
||||
|
||||
void *git_pqueue_peek(git_pqueue *q)
|
||||
{
|
||||
if (!q || q->size == 1)
|
||||
return NULL;
|
||||
return q->d[1];
|
||||
return rval;
|
||||
}
|
||||
|
|
|
|||
133
src/pqueue.h
133
src/pqueue.h
|
|
@ -3,99 +3,74 @@
|
|||
*
|
||||
* This file is part of libgit2, distributed under the GNU GPL v2 with
|
||||
* a Linking Exception. For full terms see the included COPYING file.
|
||||
*
|
||||
* This file is based on a modified version of the priority queue found
|
||||
* in the Apache project and libpqueue library.
|
||||
*
|
||||
* https://github.com/vy/libpqueue
|
||||
*
|
||||
* Original file notice:
|
||||
*
|
||||
* Copyright 2010 Volkan Yazici <volkan.yazici@gmail.com>
|
||||
* Copyright 2006-2010 The Apache Software Foundation
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License"); you may not
|
||||
* use this file except in compliance with the License. You may obtain a copy of
|
||||
* the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
|
||||
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
|
||||
* License for the specific language governing permissions and limitations under
|
||||
* the License.
|
||||
*/
|
||||
|
||||
#ifndef INCLUDE_pqueue_h__
|
||||
#define INCLUDE_pqueue_h__
|
||||
|
||||
/** callback functions to get/set/compare the priority of an element */
|
||||
typedef int (*git_pqueue_cmp)(void *a, void *b);
|
||||
#include "vector.h"
|
||||
|
||||
/** the priority queue handle */
|
||||
typedef struct {
|
||||
size_t size, avail, step;
|
||||
git_pqueue_cmp cmppri;
|
||||
void **d;
|
||||
git_vector values;
|
||||
size_t initial_size;
|
||||
uint32_t flags;
|
||||
} git_pqueue;
|
||||
|
||||
enum {
|
||||
GIT_PQUEUE_DEFAULT = 0,
|
||||
GIT_PQUEUE_FIXED_SIZE = (1 << 0), /* don't grow heap, keep highest */
|
||||
};
|
||||
|
||||
/**
|
||||
* initialize the queue
|
||||
* Initialize priority queue
|
||||
*
|
||||
* @param n the initial estimate of the number of queue items for which memory
|
||||
* should be preallocated
|
||||
* @param cmppri the callback function to compare two nodes of the queue
|
||||
* @param pq The priority queue struct to initialize
|
||||
* @param flags Flags (see above) to control queue behavior
|
||||
* @param est_size The estimated/initial queue size
|
||||
* @param cmp The entry priority comparison function
|
||||
* @return 0 on success, <0 on error
|
||||
*/
|
||||
extern int git_pqueue_init(
|
||||
git_pqueue *pq,
|
||||
uint32_t flags,
|
||||
size_t est_size,
|
||||
git_vector_cmp cmp);
|
||||
|
||||
/**
|
||||
* Free the queue memory
|
||||
*/
|
||||
extern void git_pqueue_free(git_pqueue *pq);
|
||||
|
||||
/**
|
||||
* Get the number of items in the queue
|
||||
*/
|
||||
GIT_INLINE(size_t) git_pqueue_size(const git_pqueue *pq)
|
||||
{
|
||||
return git_vector_length(&pq->values);
|
||||
}
|
||||
|
||||
/**
|
||||
* Get an item in the queue
|
||||
*/
|
||||
GIT_INLINE(void *) git_pqueue_get(const git_pqueue *pq, size_t pos)
|
||||
{
|
||||
return git_vector_get(&pq->values, pos);
|
||||
}
|
||||
|
||||
/**
|
||||
* Insert a new item into the queue
|
||||
*
|
||||
* @return the handle or NULL for insufficent memory
|
||||
* @param pq The priority queue
|
||||
* @param item Pointer to the item data
|
||||
* @return 0 on success, <0 on failure
|
||||
*/
|
||||
int git_pqueue_init(git_pqueue *q, size_t n, git_pqueue_cmp cmppri);
|
||||
|
||||
extern int git_pqueue_insert(git_pqueue *pq, void *item);
|
||||
|
||||
/**
|
||||
* free all memory used by the queue
|
||||
* @param q the queue
|
||||
* Remove the top item in the priority queue
|
||||
*
|
||||
* @param pq The priority queue
|
||||
* @return item from heap on success, NULL if queue is empty
|
||||
*/
|
||||
void git_pqueue_free(git_pqueue *q);
|
||||
|
||||
/**
|
||||
* clear all the elements in the queue
|
||||
* @param q the queue
|
||||
*/
|
||||
void git_pqueue_clear(git_pqueue *q);
|
||||
|
||||
/**
|
||||
* return the size of the queue.
|
||||
* @param q the queue
|
||||
*/
|
||||
size_t git_pqueue_size(git_pqueue *q);
|
||||
|
||||
|
||||
/**
|
||||
* insert an item into the queue.
|
||||
* @param q the queue
|
||||
* @param d the item
|
||||
* @return 0 on success
|
||||
*/
|
||||
int git_pqueue_insert(git_pqueue *q, void *d);
|
||||
|
||||
|
||||
/**
|
||||
* pop the highest-ranking item from the queue.
|
||||
* @param q the queue
|
||||
* @return NULL on error, otherwise the entry
|
||||
*/
|
||||
void *git_pqueue_pop(git_pqueue *q);
|
||||
|
||||
|
||||
/**
|
||||
* access highest-ranking item without removing it.
|
||||
* @param q the queue
|
||||
* @return NULL on error, otherwise the entry
|
||||
*/
|
||||
void *git_pqueue_peek(git_pqueue *q);
|
||||
|
||||
#endif /* PQUEUE_H */
|
||||
/** @} */
|
||||
extern void *git_pqueue_pop(git_pqueue *pq);
|
||||
|
||||
#endif
|
||||
|
|
|
|||
|
|
@ -439,7 +439,8 @@ int git_revwalk_new(git_revwalk **revwalk_out, git_repository *repo)
|
|||
walk->commits = git_oidmap_alloc();
|
||||
GITERR_CHECK_ALLOC(walk->commits);
|
||||
|
||||
if (git_pqueue_init(&walk->iterator_time, 8, git_commit_list_time_cmp) < 0 ||
|
||||
if (git_pqueue_init(
|
||||
&walk->iterator_time, 0, 8, git_commit_list_time_cmp) < 0 ||
|
||||
git_vector_init(&walk->twos, 4, NULL) < 0 ||
|
||||
git_pool_init(&walk->commit_pool, 1,
|
||||
git_pool__suggest_items_per_page(COMMIT_ALLOC) * COMMIT_ALLOC) < 0)
|
||||
|
|
@ -542,7 +543,7 @@ void git_revwalk_reset(git_revwalk *walk)
|
|||
commit->uninteresting = 0;
|
||||
});
|
||||
|
||||
git_pqueue_clear(&walk->iterator_time);
|
||||
git_pqueue_free(&walk->iterator_time);
|
||||
git_commit_list_free(&walk->iterator_topo);
|
||||
git_commit_list_free(&walk->iterator_rand);
|
||||
git_commit_list_free(&walk->iterator_reverse);
|
||||
|
|
|
|||
10
src/vector.h
10
src/vector.h
|
|
@ -95,4 +95,14 @@ GIT_INLINE(void) git_vector_set_cmp(git_vector *v, git_vector_cmp cmp)
|
|||
}
|
||||
}
|
||||
|
||||
/** Swap two elements */
|
||||
#define git_vector_swap_elements(V, P1, P2) do { \
|
||||
void *__t = (V)->contents[P1]; \
|
||||
(V)->contents[P1] = (V)->contents[P2]; \
|
||||
(V)->contents[P2] = __t; } while (0)
|
||||
|
||||
/** Compare two elements */
|
||||
#define git_vector_cmp_elements(V, P1, P2) \
|
||||
(V)->_cmp(git_vector_get(V,P1), git_vector_get(V,P2))
|
||||
|
||||
#endif
|
||||
|
|
|
|||
Загрузка…
Ссылка в новой задаче