proxmox-mirrors/mirror_frr
1
0
Fork 0
mirror of https://git.proxmox.com/git/mirror_frr synced 2025-08-14 18:27:21 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

* pqueue.[ch]: Introduce "update" function to meet ospf spf needs. It

Browse Source 
will allow to update node when:
	  i) a node is inserted into the priority queue;
	  ii) a node position is modified in the priority queue;
	* pqueue.h: Export trickle_down() function.
This commit is contained in:
hasso 2005-02-21 18:17:52 +00:00
parent e40dcce1f5
commit c3c07f28dc
3 changed files with 24 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/ChangeLog
View File

@ -1,3 +1,11 @@
2005-02-21 Vincenzo Eramo <eramo at infocom.ing.uniroma1.it>
* pqueue.[ch]: Introduce "update" function to meet ospf spf needs. It
will allow to update node when:
i) a node is inserted into the priority queue;
ii) a node position is modified in the priority queue;
* pqueue.h: Export trickle_down() function.
2005-02-19 Paul Jakma <paul.jakma@sun.com> 2005-02-19 Paul Jakma <paul.jakma@sun.com>
* stream.c: (stream_new) fix dumb mistake. * stream.c: (stream_new) fix dumb mistake.

14
lib/pqueue.c
View File

@ -56,14 +56,18 @@ trickle_up (int index, struct pqueue *queue)
{ {
/* actually trickle up */ /* actually trickle up */
queue->array[index] = queue->array[PARENT_OF (index)]; queue->array[index] = queue->array[PARENT_OF (index)];
if (queue->update != NULL)
(*queue->update) (queue->array[index], index);
index = PARENT_OF (index); index = PARENT_OF (index);
} }
/* Restore the tmp node to appropriate place. */ /* Restore the tmp node to appropriate place. */
queue->array[index] = tmp; queue->array[index] = tmp;
if (queue->update != NULL)
(*queue->update) (tmp, index);
} }
static void void
trickle_down (int index, struct pqueue *queue) trickle_down (int index, struct pqueue *queue)
{ {
void *tmp; void *tmp;
@ -90,11 +94,15 @@ trickle_down (int index, struct pqueue *queue)
/* Actually trickle down the tmp node. */ /* Actually trickle down the tmp node. */
queue->array[index] = queue->array[which]; queue->array[index] = queue->array[which];
if (queue->update != NULL)
(*queue->update) (queue->array[index], index);
index = which; index = which;
} }
/* Restore the tmp node to appropriate place. */ /* Restore the tmp node to appropriate place. */
queue->array[index] = tmp; queue->array[index] = tmp;
if (queue->update != NULL)
(*queue->update) (tmp, index);
} }
struct pqueue * struct pqueue *
@ -110,6 +118,8 @@ pqueue_create ()
memset (queue->array, 0, DATA_SIZE * PQUEUE_INIT_ARRAYSIZE); memset (queue->array, 0, DATA_SIZE * PQUEUE_INIT_ARRAYSIZE);
queue->array_size = PQUEUE_INIT_ARRAYSIZE; queue->array_size = PQUEUE_INIT_ARRAYSIZE;
/* By default we want nothing to happen when a node changes. */
queue->update = NULL;
return queue; return queue;
} }
@ -146,6 +156,8 @@ pqueue_enqueue (void *data, struct pqueue *queue)
return; return;
queue->array[queue->size] = data; queue->array[queue->size] = data;
if (queue->update != NULL)
(*queue->update) (data, queue->size);
trickle_up (queue->size, queue); trickle_up (queue->size, queue);
queue->size ++; queue->size ++;
} }

3
lib/pqueue.h
View File

@ -28,6 +28,7 @@ struct pqueue
int size; int size;
int (*cmp) (void *, void *); int (*cmp) (void *, void *);
void (*update) (void * node, int actual_position);
}; };
#define PQUEUE_INIT_ARRAYSIZE 32 #define PQUEUE_INIT_ARRAYSIZE 32
@ -38,4 +39,6 @@ void pqueue_delete (struct pqueue *queue);
void pqueue_enqueue (void *data, struct pqueue *queue); void pqueue_enqueue (void *data, struct pqueue *queue);
void *pqueue_dequeue (struct pqueue *queue); void *pqueue_dequeue (struct pqueue *queue);
void trickle_down (int index, struct pqueue *queue);
#endif /* _ZEBRA_PQUEUE_H */ #endif /* _ZEBRA_PQUEUE_H */