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
|
// Copyright (c) 2017-2023, University of Tennessee. All rights reserved.
// SPDX-License-Identifier: BSD-3-Clause
// This program is free software: you can redistribute it and/or modify it under
// the terms of the BSD 3-Clause license. See the accompanying LICENSE file.
#include <stdio.h>
#include <complex>
#include "config.h"
#define LAPACK_dpotrf_base FORTRAN_NAME( dpotrf, DPOTRF )
#ifdef __cplusplus
extern "C"
#endif
void LAPACK_dpotrf_base(
const char* uplo, const lapack_int* n,
double* A, const lapack_int* lda,
lapack_int* info
#ifdef LAPACK_FORTRAN_STRLEN_END
, size_t uplo_len
#endif
);
#ifdef LAPACK_FORTRAN_STRLEN_END
#define LAPACK_dpotrf( ... ) LAPACK_dpotrf_base( __VA_ARGS__, 1 )
#else
#define LAPACK_dpotrf( ... ) LAPACK_dpotrf_base( __VA_ARGS__ )
#endif
//------------------------------------------------------------------------------
int main()
{
// If lapack_int is 32-bit, but LAPACK actually interprets it as 64-bit,
// LAPACK will see n = 0x500000005 and segfault.
// If lapack_int is 64-bit, LAPACK can interpret it as 32-bit or 64-bit
// to see n = 5 and pass.
lapack_int n[] = { 5, 5 };
// symmetric positive definite A = L L^T, with exact L.
// -1 values in upper triangle (viewed column-major) are not referenced.
double A[] = {
4, 2, 0, 0, 0,
-1, 5, 2, 0, 0,
-1, -1, 5, 2, 0,
-1, -1, -1, 5, 2,
-1, -1, -1, -1, 5
};
double L[] = {
2, 1, 0, 0, 0,
-1, 2, 1, 0, 0,
-1, -1, 2, 1, 0,
-1, -1, -1, 2, 1,
-1, -1, -1, -1, 2
};
lapack_int info = -1;
LAPACK_dpotrf( "lower", n, A, n, &info );
bool okay = (info == 0);
for (int i = 0; i < 5*5; ++i) {
okay = okay && (A[i] == L[i]);
}
printf( "%s\n", okay ? "ok" : "failed" );
return ! okay;
}
|
