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
|
//------------------------------------------------------------------------------
// GB_Pending_realloc: reallocate a list of pending tuples
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// Reallocate a list of pending tuples. If it fails, the list is freed.
#include "pending/GB_Pending.h"
bool GB_Pending_realloc // reallocate a list of pending tuples
(
GrB_Matrix C, // matrix to reallocate C->Pending for
int64_t nnew, // # of new tuples to accomodate
GB_Werk Werk
)
{
//--------------------------------------------------------------------------
// check inputs
//--------------------------------------------------------------------------
ASSERT (C != NULL) ;
GB_Pending Pending = C->Pending ;
ASSERT (Pending != NULL) ;
//--------------------------------------------------------------------------
// ensure the list can hold at least nnew more tuples
//--------------------------------------------------------------------------
int64_t newsize = nnew + Pending->n ;
if (newsize > Pending->nmax)
{
//----------------------------------------------------------------------
// double the size if the list is not large enough
//----------------------------------------------------------------------
newsize = GB_IMAX (newsize, 2 * Pending->nmax) ;
//----------------------------------------------------------------------
// reallocate the i,j,x arrays
//----------------------------------------------------------------------
size_t jsize = (C->j_is_32) ? sizeof (uint32_t) : sizeof (uint64_t) ;
size_t isize = (C->i_is_32) ? sizeof (uint32_t) : sizeof (uint64_t) ;
bool ok1 = true ;
bool ok2 = true ;
bool ok3 = true ;
GB_REALLOC_MEMORY (Pending->i, newsize, isize, &(Pending->i_size),
&ok1) ;
if (Pending->j != NULL)
{
GB_REALLOC_MEMORY (Pending->j, newsize, jsize, &(Pending->j_size),
&ok2) ;
}
size_t s = Pending->size ;
if (Pending->x != NULL)
{
GB_REALLOC_MEMORY (Pending->x, newsize, s, &(Pending->x_size),
&ok3) ;
}
if (!ok1 || !ok2 || !ok3)
{
// out of memory
GB_Pending_free (&(C->Pending)) ;
return (false) ;
}
//----------------------------------------------------------------------
// record the new size of the Pending tuple list
//----------------------------------------------------------------------
Pending->nmax = newsize ;
}
//--------------------------------------------------------------------------
// return result
//--------------------------------------------------------------------------
return (true) ;
}
|
