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
//------------------------------------------------------------------------------
// LAGraph_Malloc: wrapper for malloc
//------------------------------------------------------------------------------
// LAGraph, (c) 2019-2022 by The LAGraph Contributors, All Rights Reserved.
// SPDX-License-Identifier: BSD-2-Clause
//
// For additional details (including references to third party source code and
// other files) see the LICENSE file or contact permission@sei.cmu.edu. See
// Contributors.txt for a full list of contributors. Created, in part, with
// funding and support from the U.S. Government (see Acknowledgments.txt file).
// DM22-0790
// Contributed by Timothy A. Davis, Texas A&M University
//------------------------------------------------------------------------------
#include "LG_internal.h"
int LAGraph_Malloc
(
// output:
void **p, // pointer to allocated block of memory
// input:
size_t nitems, // number of items
size_t size_of_item, // size of each item
char *msg
)
{
// check inputs
LG_CLEAR_MSG ;
LG_ASSERT (p != NULL, GrB_NULL_POINTER) ;
(*p) = NULL ;
// make sure at least one item is allocated
nitems = LAGRAPH_MAX (1, nitems) ;
// make sure at least one byte is allocated
size_of_item = LAGRAPH_MAX (1, size_of_item) ;
// compute the size and check for integer overflow
size_t size ;
if (!LG_Multiply_size_t (&size, nitems, size_of_item))
{
// overflow
return (GrB_OUT_OF_MEMORY) ;
}
// malloc the space
(*p) = LAGraph_Malloc_function (size) ;
return (((*p) == NULL) ? GrB_OUT_OF_MEMORY : GrB_SUCCESS) ;
}