mirror of
https://sourceware.org/git/binutils-gdb.git
synced 2024-12-27 04:52:05 +08:00
6f9b09edae
Currently GDB is not able to debug (Binary generated with Clang) variables present in shared/private clause of OpenMP Task construct. Please note that LLVM debugger LLDB is able to debug. In case of OpenMP, compilers generate artificial functions which are not present in actual program. This is done to apply parallelism to block of code. For non-artifical functions, DW_AT_name attribute should contains the name exactly as present in actual program. (Ref# http://wiki.dwarfstd.org/index.php?title=Best_Practices) Since artificial functions are not present in actual program they not having DW_AT_name and having DW_AT_linkage_name instead should be fine. Currently GDB is invalidating any function not havnig DW_AT_name which is why it is not able to debug OpenMP (Clang). It should be fair to fallback to check DW_AT_linkage_name in case DW_AT_name is absent.
50 lines
1.5 KiB
C
50 lines
1.5 KiB
C
/* This testcase is part of GDB, the GNU debugger.
|
|
|
|
Copyright 2022 Free Software Foundation, Inc.
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation; either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
Tests which verify (or not) that GDB can access shared and private
|
|
clauses of OpenMP task construct.
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <omp.h>
|
|
|
|
int foo(int n) {
|
|
int share1 = 9, share2 = 11, share3 = 13, priv1, priv2, fpriv;
|
|
fpriv = n + 4;
|
|
|
|
if (n < 2)
|
|
return n;
|
|
else {
|
|
#pragma omp task shared(share1, share2) private(priv1, priv2) firstprivate(fpriv) shared(share3)
|
|
{
|
|
priv1 = n;
|
|
priv2 = n + 2;
|
|
share2 += share3;
|
|
printf("share1 = %d, share2 = %d, share3 = %d\n", share1, share2, share3);
|
|
share1 = priv1 + priv2 + fpriv + foo(n - 1) + share2 + share3;
|
|
}
|
|
#pragma omp taskwait
|
|
return share1 + share2 + share3;
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
int n = 10;
|
|
printf("foo(%d) = %d\n", n, foo(n));
|
|
return 0;
|
|
}
|