A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Enable generic_lmm_action to be lazily updated by refactoring the corresponding fields:
[simgrid.git]
/
testsuite
/
xbt
/
heap_bench.c
diff --git
a/testsuite/xbt/heap_bench.c
b/testsuite/xbt/heap_bench.c
index
b13d065
..
417f987
100644
(file)
--- a/
testsuite/xbt/heap_bench.c
+++ b/
testsuite/xbt/heap_bench.c
@@
-1,8
+1,7
@@
-/* $Id$ */
-
/* A few tests for the xbt_heap module */
/* A few tests for the xbt_heap module */
-/* Copyright (c) 2004 Arnaud Legrand. All rights reserved. */
+/* Copyright (c) 2004, 2005, 2006, 2007, 2008, 2009, 2010. The SimGrid Team.
+ * All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
@@
-30,7
+29,7
@@
int compare_double(const void *a, const void *b);
void test_heap_validity(int size);
void test_heap_mean_operation(int size);
void test_heap_validity(int size);
void test_heap_mean_operation(int size);
-void test_reset_heap(xbt_heap_t heap, int size);
+void test_reset_heap(xbt_heap_t
*
heap, int size);
int compare_double(const void *a, const void *b)
int compare_double(const void *a, const void *b)
@@
-92,7
+91,7
@@
void test_heap_mean_operation(int size)
for (j = 0; j < MAX_TEST; j++) {
if (!(j % size) && j)
for (j = 0; j < MAX_TEST; j++) {
if (!(j % size) && j)
- test_reset_heap(heap, size);
+ test_reset_heap(
&
heap, size);
val = xbt_heap_maxkey(heap);
xbt_heap_pop(heap);
val = xbt_heap_maxkey(heap);
xbt_heap_pop(heap);
@@
-105,14
+104,14
@@
void test_heap_mean_operation(int size)
xbt_heap_free(heap);
}
xbt_heap_free(heap);
}
-void test_reset_heap(xbt_heap_t heap, int size)
+void test_reset_heap(xbt_heap_t
*
heap, int size)
{
int i;
{
int i;
- xbt_heap_free(heap);
- heap = xbt_heap_new(size, NULL);
+ xbt_heap_free(
*
heap);
+
*
heap = xbt_heap_new(size, NULL);
for (i = 0; i < size; i++) {
for (i = 0; i < size; i++) {
- xbt_heap_push(heap, NULL, (10.0 * rand() / (RAND_MAX + 1.0)));
+ xbt_heap_push(
*
heap, NULL, (10.0 * rand() / (RAND_MAX + 1.0)));
}
}
}
}