1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
//------------------------------------------------------------------------------
// Mongoose/Tests/Mongoose_UnitTest_Graph_exe.cpp
//------------------------------------------------------------------------------
// Mongoose Graph Partitioning Library, Copyright (C) 2017-2018,
// Scott P. Kolodziej, Nuri S. Yeralan, Timothy A. Davis, William W. Hager
// Mongoose is licensed under Version 3 of the GNU General Public License.
// Mongoose is also available under other licenses; contact authors for details.
// SPDX-License-Identifier: GPL-3.0-only
//------------------------------------------------------------------------------
#define LOG_ERROR 1
#define LOG_WARN 1
#define LOG_INFO 0
#define LOG_TEST 1
#include "Mongoose_Test.hpp"
#include "Mongoose_Internal.hpp"
#include "Mongoose_IO.hpp"
#include "Mongoose_EdgeCutProblem.hpp"
using namespace Mongoose;
/* Custom memory management functions allow for memory testing. */
int AllowedMallocs;
void *myMalloc(size_t size)
{
if(AllowedMallocs <= 0) return NULL;
AllowedMallocs--;
return malloc(size);
}
void *myCalloc(size_t count, size_t size)
{
if(AllowedMallocs <= 0) return NULL;
AllowedMallocs--;
return calloc(count, size);
}
void *myRealloc(void *ptr, size_t newSize)
{
if(AllowedMallocs <= 0) return NULL;
AllowedMallocs--;
return realloc(ptr, newSize);
}
void myFree(void *ptr)
{
if(ptr != NULL) free(ptr);
}
int main(int argn, char** argv)
{
(void)argn; // Unused variable
(void)argv; // Unused variable
SuiteSparse_start();
// Set Logger to report all messages and turn off timing info
Logger::setDebugLevel(All);
Logger::setTimingFlag(false);
// Test Graph(n, nz) static constructor
Graph *G2 = Graph::create(10, 20);
EdgeCutProblem *prob = EdgeCutProblem::create(G2);
prob->clearMarkArray(LONG_MAX);
Int markValue = prob->getMarkValue();
assert(markValue == 1);
prob->clearMarkArray(LONG_MAX-1);
prob->clearMarkArray();
markValue = prob->getMarkValue();
assert(markValue >= 1);
prob->~EdgeCutProblem();
MM_typecode matcode;
cs *M4 = read_matrix("../Matrix/bcspwr01.mtx", matcode);
M4->x = NULL;
Graph *G7 = Graph::create(M4);
assert(G7 != NULL);
// Tests to increase coverage
/* Override SuiteSparse memory management with custom testers. */
SuiteSparse_config_malloc_func_set (myMalloc) ;
SuiteSparse_config_calloc_func_set (myCalloc) ;
SuiteSparse_config_realloc_func_set (myRealloc) ;
SuiteSparse_config_free_func_set (myFree) ;
// Simulate failure to allocate return arrays
AllowedMallocs = 0;
EdgeCutProblem *G3 = EdgeCutProblem::create(G7);
assert(G3 == NULL);
AllowedMallocs = 1;
EdgeCutProblem *G4 = EdgeCutProblem::create(G7);
assert(G4 == NULL);
AllowedMallocs = 5;
EdgeCutProblem *G5 = EdgeCutProblem::create(G7);
assert(G5 == NULL);
AllowedMallocs = 10;
EdgeCutProblem *G6 = EdgeCutProblem::create(G7);
assert(G6 == NULL);
G7->~Graph();
SuiteSparse_finish();
return 0;
}
|
