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_bix_alloc: allocate a matrix to hold a given number of entries
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// Does not modify A->p or A->h (unless an error occurs). 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 this method fails, all content of A is freed (including A->p and A->h).
#include "GB.h"
GB_PUBLIC
GrB_Info GB_bix_alloc // allocate A->b, A->i, and A->x space in a matrix
(
GrB_Matrix A, // matrix to allocate space for
const GrB_Index 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, otherwise use malloc
const bool numeric, // if true, allocate A->x, otherwise A->x is NULL
const bool A_iso, // if true, allocate A as iso
GB_Context Context
)
{
//--------------------------------------------------------------------------
// check inputs
//--------------------------------------------------------------------------
ASSERT (A != NULL) ;
//--------------------------------------------------------------------------
// 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 ; // OK: see caller for iso burble
bool ok = true ;
if (sparsity == GxB_BITMAP)
{
if (bitmap_calloc)
{
// content is fully defined
A->b = GB_CALLOC (nzmax, 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 (nzmax, int8_t, &(A->b_size)) ;
}
ok = (A->b != NULL) ;
}
else if (sparsity != GxB_FULL)
{
// sparsity: sparse / hyper / auto
A->i = GB_MALLOC (nzmax, int64_t, &(A->i_size)) ;
ok = (A->i != NULL) ;
if (ok) A->i [0] = 0 ;
}
if (numeric)
{
// calloc the space if A is bitmap
A->x = GB_XALLOC (sparsity == GxB_BITMAP, A_iso, // x:OK
nzmax, A->type->size, &(A->x_size)) ;
ok = ok && (A->x != NULL) ;
}
if (!ok)
{
// out of memory
GB_phybix_free (A) ;
return (GrB_OUT_OF_MEMORY) ;
}
return (GrB_SUCCESS) ;
}
|
