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
|
//------------------------------------------------------------------------------
// GB_bix_alloc: allocate a matrix to hold a given number of entries
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// Does not modify A->p or A->h. Frees A->b, A->x, and A->i and reallocates
// them to the requested size. Frees any pending tuples and deletes all
// entries (including zombies, if any). If numeric is false, then A->x is
// freed but not reallocated.
// If A->p_is_32, A->j_is_32, or A->i_is_32 are invalid, GrB_INVALID_VALUE is
// returned and the allocation fails. If this method fails, A->b, A->i, and
// A->x are NULL (having been freed if already present), but A->p and A->h are
// not modified.
#include "GB.h"
// The prototype is in Source/callback:
//
// GrB_Info GB_bix_alloc // allocate A->b, A->i, and A->x in a matrix
// (
// GrB_Matrix A, // matrix to allocate space for
// const uint64_t nzmax, // number of entries the matrix can hold
// // ignored if A is iso and full
// const int sparsity, // sparse (=hyper/auto) / bitmap / full
// const bool bitmap_calloc, // if true, calloc A->b, else use malloc
// const bool numeric, // if true, allocate A->x, else A->x is NULL
// const bool A_iso // if true, allocate A as iso
// )
GB_CALLBACK_BIX_ALLOC_PROTO (GB_bix_alloc)
{
//--------------------------------------------------------------------------
// check inputs
//--------------------------------------------------------------------------
ASSERT (A != NULL) ;
ASSERT (GB_IMPLIES (sparsity == GxB_FULL || sparsity == GxB_BITMAP,
!(A->p_is_32) && !(A->j_is_32) && !(A->i_is_32))) ;
//--------------------------------------------------------------------------
// allocate the A->b, A->x, and A->i content of the matrix
//--------------------------------------------------------------------------
// Free the existing A->b, A->x, and A->i content, if any.
// Leave A->p and A->h unchanged.
GB_bix_free (A) ;
A->iso = A_iso ;
bool ok = true ;
if (sparsity == GxB_BITMAP)
{
if (bitmap_calloc)
{
// content is fully defined
A->b = GB_CALLOC_MEMORY (nzmax, sizeof (int8_t), &(A->b_size)) ;
A->magic = GB_MAGIC ;
}
else
{
// bitmap is not defined and will be computed by the caller
A->b = GB_MALLOC_MEMORY (nzmax, sizeof (int8_t), &(A->b_size)) ;
}
ok = (A->b != NULL) ;
}
else if (sparsity != GxB_FULL)
{
// sparsity: sparse or hypersparse
if (!GB_valid_pji_is_32 (A->p_is_32, A->j_is_32, A->i_is_32,
nzmax, A->vlen, A->vdim))
{
// matrix is too large for its requested integer settings
return (GrB_INVALID_VALUE) ;
}
size_t isize = A->i_is_32 ? sizeof (int32_t) : sizeof (int64_t) ;
A->i = GB_MALLOC_MEMORY (nzmax, isize, &(A->i_size)) ;
ok = (A->i != NULL) ;
}
if (numeric)
{
// calloc the space if A is bitmap
A->x = GB_XALLOC_MEMORY (sparsity == GxB_BITMAP, A_iso, nzmax,
A->type->size, &(A->x_size)) ;
ok = ok && (A->x != NULL) ;
}
if (!ok)
{
// out of memory
GB_bix_free (A) ;
return (GrB_OUT_OF_MEMORY) ;
}
return (GrB_SUCCESS) ;
}
|
