Public bug reported:

when I compiled with ifort the example program provided with MUMPS
source code, linking to the MUMPS in the system, and when I execute it,
I get an error, also, solution should be 1 2 3 4 5.

I am not sure whether a program compiled with ifort should be able to
use libraries compiled with gfortran, as MUMPS is.

--------------------- compiling with ifort 12

rodr...@gutiva:~/tests/MUMPS_4.9.2-examples$ ifort -g -o ztesti12 zsimpletest.F 
-I/usr/include/openmpi -lzmumps
/usr/include/zmumps_root.h(40): warning #6379: The structure contains one or 
more misaligned fields.   [ZMUMPS_ROOT_STRUC]
      TYPE ZMUMPS_ROOT_STRUC
-----------^
/usr/include/zmumps_struc.h(41): warning #6379: The structure contains one or 
more misaligned fields.   [ZMUMPS_STRUC]
      TYPE ZMUMPS_STRUC
-----------^

-------------------------------- executing

rodr...@gutiva:~/tests/MUMPS_4.9.2-examples$ ./ztesti12 < 
input_simpletest_cmplx 
  Solution is  (20.0000000000000,0.000000000000000E+000)
 (24.0000000000000,0.000000000000000E+000)
 (9.00000000000000,0.000000000000000E+000)
 (6.00000000000000,0.000000000000000E+000)
 (13.0000000000000,0.000000000000000E+000)
forrtl: severe (174): SIGSEGV, segmentation fault occurred
Image              PC                Routine            Line        Source      
       
libc.so.6          00007F27E5923C2D  Unknown               Unknown  Unknown
libzmumps-4.9.2.s  00007F27E6166EF1  Unknown               Unknown  Unknown
libzmumps-4.9.2.s  00007F27E60F539E  Unknown               Unknown  Unknown
ztesti12           0000000000403C40  Unknown               Unknown  Unknown
ztesti12           00000000004031BC  Unknown               Unknown  Unknown
libc.so.6          00007F27E58C4D8E  Unknown               Unknown  Unknown
ztesti12           00000000004030B9  Unknown               Unknown  Unknown

----------------------- executing with gdb

rodr...@gutiva:~/tests/MUMPS_4.9.2-examples$ gdb ./ztesti12GNU gdb (GDB) 
7.2-ubuntu
Copyright (C) 2010 Free Software Foundation, Inc.
License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>
This is free software: you are free to change and redistribute it.
There is NO WARRANTY, to the extent permitted by law.  Type "show copying"
and "show warranty" for details.
This GDB was configured as "x86_64-linux-gnu".
For bug reporting instructions, please see:
<http://www.gnu.org/software/gdb/bugs/>...
Reading symbols from /home/rodrigo/tests/MUMPS_4.9.2-examples/ztesti12...done.
(gdb) run < input_simpletest_cmplx 
Starting program: /home/rodrigo/tests/MUMPS_4.9.2-examples/ztesti12 < 
input_simpletest_cmplx
[Thread debugging using libthread_db enabled]
  Solution is  (20.0000000000000,0.000000000000000E+000)
 (24.0000000000000,0.000000000000000E+000)
 (9.00000000000000,0.000000000000000E+000)
 (6.00000000000000,0.000000000000000E+000)
 (13.0000000000000,0.000000000000000E+000)

Program received signal SIGSEGV, Segmentation fault.
__libc_free (mem=0xc) at malloc.c:3709
3709    malloc.c: No such file or directory.
        in malloc.c
(gdb) bt
#0  __libc_free (mem=0xc) at malloc.c:3709
#1  0x00007ffff7b49ef1 in zmumps_136_ () from /usr/lib/libzmumps-4.9.2.so
#2  0x00007ffff7ad839e in zmumps_ () from /usr/lib/libzmumps-4.9.2.so
#3  0x0000000000403c40 in mumps_test () at zsimpletest.F:50
(gdb) 

---------------------------with gfortran works well:

rodr...@gutiva:~/tests/MUMPS_4.9.2-examples$ gfortran -o ztestgf44
zsimpletest.F -I/usr/include/openmpi -I/usr/include -lzmumps

-------------------------- executing

rodr...@gutiva:~/tests/MUMPS_4.9.2-examples$ ./ztestgf44 <
input_simpletest_cmplx

 ZMUMPS 4.9.2         
L U Solver for unsymmetric matrices
Type of parallelism: Working host

 ****** ANALYSIS STEP ********

 Resetting candidate strategy to 0 because NSLAVES=1
 
 ... Structural symmetry (in percent)=   92
 Density: NBdense, Average, Median   =    0    2    1
 ... No column permutation
 Ordering based on AMF 

Leaving analysis phase with  ...
INFOG(1)                                       =               0
INFOG(2)                                       =               0
 -- (20) Number of entries in factors (estim.) =              15
 --  (3) Storage of factors  (REAL, estimated) =              15
 --  (4) Storage of factors  (INT , estimated) =              50
 --  (5) Maximum frontal size      (estimated) =               3
 --  (6) Number of nodes in the tree           =               3
 -- (32) Type of analysis effectively used     =               1
 --  (7) Ordering option effectively used      =               2
ICNTL(6) Maximum transversal option            =               0
ICNTL(7) Pivot order option                    =               7
Percentage of memory relaxation (effective)    =              20
Number of level 2 nodes                        =               0
Number of split nodes                          =               0
RINFOG(1) Operations during elimination (estim)=   1.900D+01
 ** Rank of proc needing largest memory in IC facto        :         0
 ** Estimated corresponding MBYTES for IC facto            :         1
 ** Estimated avg. MBYTES per work. proc at facto (IC)     :         1
 ** TOTAL     space in MBYTES for IC factorization         :         1
 ** Rank of proc needing largest memory for OOC facto      :         0
 ** Estimated corresponding MBYTES for OOC facto           :         1
 ** Estimated avg. MBYTES per work. proc at facto (OOC)    :         1
 ** TOTAL     space in MBYTES for OOC factorization        :         1

 ****** FACTORIZATION STEP ********


 GLOBAL STATISTICS PRIOR NUMERICAL FACTORIZATION ...
 NUMBER OF WORKING PROCESSES          =           1
 OUT-OF-CORE OPTION (ICNTL(22))       =           0
 REAL SPACE FOR FACTORS               =          15
 INTEGER SPACE FOR FACTORS            =          50
 MAXIMUM FRONTAL SIZE (ESTIMATED)     =           3
 NUMBER OF NODES IN THE TREE          =           3
 Convergence error after scaling for ONE-NORM (option 7/8)   = 0.38D+00
 Maximum effective relaxed size of S              =         151
 Average effective relaxed size of S              =         151
 GLOBAL TIME FOR MATRIX DISTRIBUTION  =      0.0000
 ** Memory relaxation parameter ( ICNTL(14)  )            :        20
 ** Rank of processor needing largest memory in facto     :         0
 ** Space in MBYTES used by this processor for facto      :         1
 ** Avg. Space in MBYTES per working proc during facto    :         1

 ELAPSED TIME FOR FACTORIZATION       =      0.0522
 Maximum effective space used in S   (KEEP8(67)   =          15
 Average effective space used in S   (KEEP8(67)   =          15
 ** EFF Min: Rank of processor needing largest memory :         0
 ** EFF Min: Space in MBYTES used by this processor   :         1
 ** EFF Min: Avg. Space in MBYTES per working proc    :         1

 GLOBAL STATISTICS 
 RINFOG(2)  OPERATIONS DURING NODE ASSEMBLY     = 2.000D+00
 ------(3)  OPERATIONS DURING NODE ELIMINATION  = 1.900D+01
 INFOG (9)  REAL SPACE FOR FACTORS              =          15
 INFOG(10)  INTEGER SPACE FOR FACTORS           =          50
 INFOG(11)  MAXIMUM FRONT SIZE                  =           3
 INFOG(29)  NUMBER OF ENTRIES IN FACTORS        =          15
 INFOG(13) NB OF OFF DIAGONAL PIVOTS      =           0
 INFOG(12)  NUMBER OF DELAYED PIVOTS      =           0
 INFOG(14)  NUMBER OF MEMORY COMPRESS           =           0
 KEEP8(108) Extra copies due to IP stacking     =           0


 ****** SOLVE & CHECK STEP ********


 STATISTICS PRIOR SOLVE PHASE     ...........
 NUMBER OF RIGHT-HAND-SIDES                    =           1
 BLOCKING FACTOR FOR MULTIPLE RHS              =           1
 ICNTL (9)                                     =           1
  --- (10)                                     =           0
  --- (11)                                     =           0
  --- (20)                                     =           0
  --- (21)                                     =           0
 ** Rank of processor needing largest memory in solve     :         0
 ** Space in MBYTES used by this processor for solve      :         0
 ** Avg. Space in MBYTES per working proc during solve    :         0


 LEAVING SOLVER WITH:  INFOG(1) ............ =           0
                       INFOG(2) ............ =           0
  Solution is  ( 0.99999999999999989     ,  0.0000000000000000     ) (  
2.0000000000000000     , -0.0000000000000000     ) (  3.0000000000000004     ,  
0.0000000000000000     ) (  3.9999999999999996     , -0.0000000000000000     ) 
(  4.9999999999999991     ,  0.0000000000000000     )

ProblemType: Bug
DistroRelease: Ubuntu 10.10
Package: libmumps-ptscotch-dev 4.9.2.dfsg-4
ProcVersionSignature: Ubuntu 2.6.35-22.35-generic 2.6.35.4
Uname: Linux 2.6.35-22-generic x86_64
NonfreeKernelModules: sep3_1 pax
Architecture: amd64
Date: Tue Nov 23 10:22:46 2010
InstallationMedia: Ubuntu 10.10 "Maverick Meerkat" - Release amd64 (20101007)
ProcEnviron:
 LANG=gl_ES.utf8
 SHELL=/bin/bash
SourcePackage: mumps

** Affects: mumps (Ubuntu)
     Importance: Undecided
         Status: New


** Tags: amd64 apport-bug maverick

-- 
does not work when called from a program compiled with ifort
https://bugs.launchpad.net/bugs/680413
You received this bug notification because you are a member of Ubuntu
Bugs, which is subscribed to Ubuntu.

-- 
ubuntu-bugs mailing list
[email protected]
https://lists.ubuntu.com/mailman/listinfo/ubuntu-bugs

Reply via email to