Mock Version: 5.5
Mock Version: 5.5
Mock Version: 5.5
ENTER ['do_with_status'](['bash', '--login', '-c', '/usr/bin/rpmbuild -bs --noclean --target loongarch64 --nodeps /builddir/build/SPECS/ghc-fgl.spec'], chrootPath='/home/lib/ocmock/dist-oc9-epol-build-206764-80571/root'env={'TERM': 'vt100', 'SHELL': '/bin/bash', 'HOME': '/builddir', 'HOSTNAME': 'mock', 'PATH': '/usr/bin:/bin:/usr/sbin:/sbin', 'PROMPT_COMMAND': 'printf "\\033]0;<mock-chroot>\\007"', 'PS1': '<mock-chroot> \\s-\\v\\$ ', 'LANG': 'C.UTF-8'}shell=Falselogger=<mockbuild.trace_decorator.getLog object at 0x7fffe37844d0>timeout=86400uid=981gid=135user='mockbuild'nspawn_args=[]unshare_net=FalseprintOutput=False)
Executing command: ['bash', '--login', '-c', '/usr/bin/rpmbuild -bs --noclean --target loongarch64 --nodeps /builddir/build/SPECS/ghc-fgl.spec'] with env {'TERM': 'vt100', 'SHELL': '/bin/bash', 'HOME': '/builddir', 'HOSTNAME': 'mock', 'PATH': '/usr/bin:/bin:/usr/sbin:/sbin', 'PROMPT_COMMAND': 'printf "\\033]0;<mock-chroot>\\007"', 'PS1': '<mock-chroot> \\s-\\v\\$ ', 'LANG': 'C.UTF-8'} and shell False
Building target platforms: loongarch64
Building for target loongarch64
Wrote: /builddir/build/SRPMS/ghc-fgl-5.8.2.0-1.oc9.src.rpm
Child return code was: 0
ENTER ['do_with_status'](['bash', '--login', '-c', '/usr/bin/rpmbuild -bb --noclean --target loongarch64 --nodeps /builddir/build/SPECS/ghc-fgl.spec'], chrootPath='/home/lib/ocmock/dist-oc9-epol-build-206764-80571/root'env={'TERM': 'vt100', 'SHELL': '/bin/bash', 'HOME': '/builddir', 'HOSTNAME': 'mock', 'PATH': '/usr/bin:/bin:/usr/sbin:/sbin', 'PROMPT_COMMAND': 'printf "\\033]0;<mock-chroot>\\007"', 'PS1': '<mock-chroot> \\s-\\v\\$ ', 'LANG': 'C.UTF-8'}shell=Falselogger=<mockbuild.trace_decorator.getLog object at 0x7fffe37844d0>timeout=86400uid=981gid=135user='mockbuild'nspawn_args=[]unshare_net=FalseprintOutput=False)
Executing command: ['bash', '--login', '-c', '/usr/bin/rpmbuild -bb --noclean --target loongarch64 --nodeps /builddir/build/SPECS/ghc-fgl.spec'] with env {'TERM': 'vt100', 'SHELL': '/bin/bash', 'HOME': '/builddir', 'HOSTNAME': 'mock', 'PATH': '/usr/bin:/bin:/usr/sbin:/sbin', 'PROMPT_COMMAND': 'printf "\\033]0;<mock-chroot>\\007"', 'PS1': '<mock-chroot> \\s-\\v\\$ ', 'LANG': 'C.UTF-8'} and shell False
Building target platforms: loongarch64
Building for target loongarch64
Executing(%prep): /bin/sh -e /var/tmp/rpm-tmp.StW3Ht
+ umask 022
+ cd /builddir/build/BUILD
+ cd /builddir/build/BUILD
+ rm -rf fgl-5.8.2.0
+ /usr/lib/rpm/rpmuncompress -x /builddir/build/SOURCES/fgl-5.8.2.0.tar.gz
+ STATUS=0
+ '[' 0 -ne 0 ']'
+ cd fgl-5.8.2.0
+ /usr/bin/chmod -Rf a+rX,u+w,g-w,o-w .
+ RPM_EC=0
++ jobs -p
+ exit 0
Executing(%build): /bin/sh -e /var/tmp/rpm-tmp.8ctEcH
+ umask 022
+ cd /builddir/build/BUILD
+ CFLAGS='-O2  -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong  -fasynchronous-unwind-tables -fstack-clash-protection'
+ export CFLAGS
+ CXXFLAGS='-O2  -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong  -fasynchronous-unwind-tables -fstack-clash-protection'
+ export CXXFLAGS
+ FFLAGS='-O2  -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong  -fasynchronous-unwind-tables -fstack-clash-protection -I/usr/lib64/gfortran/modules'
+ export FFLAGS
+ FCFLAGS='-O2  -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong  -fasynchronous-unwind-tables -fstack-clash-protection -I/usr/lib64/gfortran/modules'
+ export FCFLAGS
+ LDFLAGS='-Wl,-z,relro -Wl,--as-needed    -Wl,--build-id=sha1'
+ export LDFLAGS
+ LT_SYS_LIBRARY_PATH=/usr/lib64:
+ export LT_SYS_LIBRARY_PATH
+ CC=gcc
+ export CC
+ CXX=g++
+ export CXX
+ cd fgl-5.8.2.0
++ ls
++ grep -i -e '^\(ANNOUNCE\|AUTHORS\|CHANGELOG\|CHANGES\|CONTRIBUTORS\|README\|TODO\)'
+ for f in $(ls | grep -i -e '^\(ANNOUNCE\|AUTHORS\|CHANGELOG\|CHANGES\|CONTRIBUTORS\|README\|TODO\)')
+ '[' -f ChangeLog -a -x ChangeLog ']'
+ CFLAGS='-O2  -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong  -fasynchronous-unwind-tables -fstack-clash-protection'
+ export CFLAGS
+ export 'LDFLAGS=-Wl,-z,relro -Wl,--as-needed    -Wl,--build-id=sha1'
+ LDFLAGS='-Wl,-z,relro -Wl,--as-needed    -Wl,--build-id=sha1'
+ '[' -f Setup.hs -o -f Setup.lhs ']'
+ '[' -d /usr/lib64/ghc-9.8.4/lib ']'
+ subsubdir=/lib
+ '[' -x Setup ']'
+ ghc --make -package Cabal -no-user-package-db -dynamic Setup
[1 of 2] Compiling Main             ( Setup.hs, Setup.o )
[2 of 2] Linking Setup
+ LANG=C.utf8
+ ./Setup --version
Cabal library version 3.10.3.0
+ '[' -x Setup ']'
+ LANG=C.utf8
++ echo ' -O2' -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong -fasynchronous-unwind-tables -fstack-clash-protection
++ sed -e 's/ / -optc/g'
++ echo ' -Wl,-z,relro' -Wl,--as-needed -Wl,--build-id=sha1
++ sed -e 's/ / -optl/g'
+ ./Setup configure --prefix=/usr --libdir=/usr/lib64 --docdir=/usr/share/licenses/ghc-fgl '--libsubdir=$compiler/lib/$pkgid' '--datasubdir=$pkgid' '--libexecsubdir=$pkgid' --ghc --dynlibdir=/usr/lib64/ghc-9.8.4/lib --global '--ghc-options= -optc-O2 -optc-fexceptions -optc-g -optc-grecord-gcc-switches -optc-pipe -optc-Wall -optc-Werror=format-security -optc-Wp,-D_FORTIFY_SOURCE=2 -optc-Wp,-D_GLIBCXX_ASSERTIONS -optc-specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -optc-fstack-protector-strong -optc-fasynchronous-unwind-tables -optc-fstack-clash-protection  -optl-Wl,-z,relro -optl-Wl,--as-needed -optl-Wl,--build-id=sha1 -fhide-source-paths' --enable-shared --htmldir=/usr/share/doc/ghc/html/libraries/fgl-5.8.2.0 --global
Configuring fgl-5.8.2.0...
+ '[' -x Setup ']'
+ LANG=C.utf8
+ ./Setup build -j32
Preprocessing library for fgl-5.8.2.0..
Building library for fgl-5.8.2.0..
[ 1 of 29] Compiling Data.Graph.Inductive.Graph
Data/Graph/Inductive/Graph.hs:522:40: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
    |
522 |     groupLabels les = toLEdge (toEdge (head les)) (map edgeLabel les)
    |                                        ^^^^
[ 2 of 29] Compiling Data.Graph.Inductive.Internal.Heap
[ 3 of 29] Compiling Data.Graph.Inductive.Internal.Queue
[ 4 of 29] Compiling Data.Graph.Inductive.Internal.RootPath
Data/Graph/Inductive/Internal/RootPath.hs:32:38: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
32 | getPath v = reverse . first ((==v) . head)
   |                                      ^^^^
[ 5 of 29] Compiling Data.Graph.Inductive.Internal.Thread
[ 6 of 29] Compiling Data.Graph.Inductive.Basic
[ 7 of 29] Compiling Data.Graph.Inductive.Monad
[ 8 of 29] Compiling Data.Graph.Inductive.Monad.IOArray
[ 9 of 29] Compiling Data.Graph.Inductive.Monad.STArray
[10 of 29] Compiling Data.Graph.Inductive.NodeMap
[11 of 29] Compiling Data.Graph.Inductive.PatriciaTree
Data/Graph/Inductive/PatriciaTree.hs:30:1: warning: [GHC-66111] [-Wunused-imports]
    The import of ‘Control.Applicative’ is redundant
      except perhaps to import instances from ‘Control.Applicative’
    To import instances alone, use: import Control.Applicative()
   |
[12 of 29] Compiling Data.Graph.Inductive.Example
30 | import           Control.Applicative (liftA2)
   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[13 of 29] Compiling Data.Graph.Inductive.Query.ArtPoint
Data/Graph/Inductive/Query/ArtPoint.hs:30:27: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
30 | getBackEdges v ls   = map head (filter (elem (v,0)) (tail ls))
   |                           ^^^^
Data/Graph/Inductive/Query/ArtPoint.hs:30:54: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
30 | getBackEdges v ls   = map head (filter (elem (v,0)) (tail ls))
   |                                                      ^^^^
Data/Graph/Inductive/Query/ArtPoint.hs:81:27: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
81 | getLowTree g v = lowTree (head dfsf)
   |                           ^^^^
[14 of 29] Compiling Data.Graph.Inductive.Query.BFS
[15 of 29] Compiling Data.Graph.Inductive.Query.DFS
[16 of 29] Compiling Data.Graph.Inductive.Query.BCC
[17 of 29] Compiling Data.Graph.Inductive.Query.Dominators
Data/Graph/Inductive/Query/Dominators.hs:64:31: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
64 |         iD0 = array (1, s-1) (tail $ treeEdges (-1) ntree)
   |                               ^^^^
[18 of 29] Compiling Data.Graph.Inductive.Query.Indep
[19 of 29] Compiling Data.Graph.Inductive.Query.MST
Data/Graph/Inductive/Query/MST.hs:40:23: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
40 | joinPaths p = joinAt (head p) p
   |                       ^^^^
[20 of 29] Compiling Data.Graph.Inductive.Query.MaxFlow
Data/Graph/Inductive/Query/MaxFlow.hs:105:52: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
    |
105 |     minC        = minimum (map ((\(_,_,z)->z).snd)(tail augLPath))
    |                                                    ^^^^
[21 of 29] Compiling Data.Graph.Inductive.Query.MaxFlow2
Data/Graph/Inductive/Query/MaxFlow2.hs:80:27: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
80 |     filter ((==t) . fst . head) tree
   |                           ^^^^
Data/Graph/Inductive/Query/MaxFlow2.hs:152:61: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
    |
152 | augPath g s t = listToMaybe $ map reverse $ filter ((==t) . head) tree
    |                                                             ^^^^
Data/Graph/Inductive/Query/MaxFlow2.hs:255:42: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
    |
255 |               (S.fromList (zip justPath (tail justPath)))
[22 of 29] Compiling Data.Graph.Inductive.Query.Monad
[23 of     |                                          ^^^^
29] Compiling Data.Graph.Inductive.Query.SP
[24 of 29] Compiling Data.Graph.Inductive.Query.GVD
Data/Graph/Inductive/Query/GVD.hs:49:51: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
49 | maybePath v = listToMaybe . filter ((v==) . fst . head . unLPath)
   |                                                   ^^^^
Data/Graph/Inductive/Query/GVD.hs:59:29: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
59 | nearestDist v = fmap (snd . head . unLPath) . maybePath v
[25 of 29] Compiling Data.Graph.Inductive.Query.TransClos
[   |                             ^^^^
26 of 29] Compiling Data.Graph.Inductive.Query
[27 of 29] Compiling Data.Graph.Inductive.Tree
Data/Graph/Inductive/Tree.hs:16:1: warning: [GHC-66111] [-Wunused-imports]
    The import of ‘Control.Applicative’ is redundant
      except perhaps to import instances from ‘Control.Applicative’
    To import instances alone, use: import Control.Applicative()
   |
16 | import           Control.Applicative (liftA2)
   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[28 of 29] Compiling Paths_fgl
[29 of 29] Compiling Data.Graph.Inductive
+ '[' -n dist/build/libHSfgl-5.8.2.0-IU74IdcA2tG9od0R1o60rE-ghc9.8.4.so ']'
+ '[' -x Setup ']'
+ LANG=C.utf8
+ ./Setup haddock --html --hyperlink-source --hoogle
Preprocessing library for fgl-5.8.2.0..
Running Haddock on library for fgl-5.8.2.0..
Warning: The documentation for the following packages are not installed. No
links will be generated to these packages: array-0.5.8.0, base-4.19.2.0,
containers-0.6.8, deepseq-1.5.1.0, ghc-bignum-1.3, ghc-boot-th-9.8.4,
ghc-prim-0.11.0, pretty-1.1.3.6, template-haskell-2.21.0.0,
transformers-0.6.1.0
Warning: --source-* options are ignored when --hyperlinked-source is enabled.
[ 1 of 29] Compiling Data.Graph.Inductive.Graph ( Data/Graph/Inductive/Graph.hs, nothing )
Data/Graph/Inductive/Graph.hs:522:40: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
    |
522 |     groupLabels les = toLEdge (toEdge (head les)) (map edgeLabel les)
    |                                        ^^^^
[ 2 of 29] Compiling Data.Graph.Inductive.Internal.Heap ( Data/Graph/Inductive/Internal/Heap.hs, nothing )
[ 3 of 29] Compiling Data.Graph.Inductive.Internal.Queue ( Data/Graph/Inductive/Internal/Queue.hs, nothing )
[ 4 of 29] Compiling Data.Graph.Inductive.Internal.RootPath ( Data/Graph/Inductive/Internal/RootPath.hs, nothing )
Data/Graph/Inductive/Internal/RootPath.hs:32:38: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
32 | getPath v = reverse . first ((==v) . head)
   |                                      ^^^^
[ 5 of 29] Compiling Data.Graph.Inductive.Internal.Thread ( Data/Graph/Inductive/Internal/Thread.hs, nothing )
[ 6 of 29] Compiling Data.Graph.Inductive.Basic ( Data/Graph/Inductive/Basic.hs, nothing )
[ 7 of 29] Compiling Data.Graph.Inductive.Monad ( Data/Graph/Inductive/Monad.hs, nothing )
[ 8 of 29] Compiling Data.Graph.Inductive.Monad.IOArray ( Data/Graph/Inductive/Monad/IOArray.hs, nothing )
[ 9 of 29] Compiling Data.Graph.Inductive.Monad.STArray ( Data/Graph/Inductive/Monad/STArray.hs, nothing )
[10 of 29] Compiling Data.Graph.Inductive.NodeMap ( Data/Graph/Inductive/NodeMap.hs, nothing )
[11 of 29] Compiling Data.Graph.Inductive.PatriciaTree ( Data/Graph/Inductive/PatriciaTree.hs, nothing )
Data/Graph/Inductive/PatriciaTree.hs:30:1: warning: [GHC-66111] [-Wunused-imports]
    The import of ‘Control.Applicative’ is redundant
      except perhaps to import instances from ‘Control.Applicative’
    To import instances alone, use: import Control.Applicative()
   |
30 | import           Control.Applicative (liftA2)
   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[12 of 29] Compiling Data.Graph.Inductive.Example ( Data/Graph/Inductive/Example.hs, nothing )
[13 of 29] Compiling Data.Graph.Inductive.Query.ArtPoint ( Data/Graph/Inductive/Query/ArtPoint.hs, nothing )
Data/Graph/Inductive/Query/ArtPoint.hs:30:27: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
30 | getBackEdges v ls   = map head (filter (elem (v,0)) (tail ls))
   |                           ^^^^
Data/Graph/Inductive/Query/ArtPoint.hs:30:54: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
30 | getBackEdges v ls   = map head (filter (elem (v,0)) (tail ls))
   |                                                      ^^^^
Data/Graph/Inductive/Query/ArtPoint.hs:81:27: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
81 | getLowTree g v = lowTree (head dfsf)
   |                           ^^^^
[14 of 29] Compiling Data.Graph.Inductive.Query.BFS ( Data/Graph/Inductive/Query/BFS.hs, nothing )
[15 of 29] Compiling Data.Graph.Inductive.Query.DFS ( Data/Graph/Inductive/Query/DFS.hs, nothing )
[16 of 29] Compiling Data.Graph.Inductive.Query.BCC ( Data/Graph/Inductive/Query/BCC.hs, nothing )
[17 of 29] Compiling Data.Graph.Inductive.Query.Dominators ( Data/Graph/Inductive/Query/Dominators.hs, nothing )
Data/Graph/Inductive/Query/Dominators.hs:64:31: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
64 |         iD0 = array (1, s-1) (tail $ treeEdges (-1) ntree)
   |                               ^^^^
[18 of 29] Compiling Data.Graph.Inductive.Query.Indep ( Data/Graph/Inductive/Query/Indep.hs, nothing )
[19 of 29] Compiling Data.Graph.Inductive.Query.MST ( Data/Graph/Inductive/Query/MST.hs, nothing )
Data/Graph/Inductive/Query/MST.hs:40:23: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
40 | joinPaths p = joinAt (head p) p
   |                       ^^^^
[20 of 29] Compiling Data.Graph.Inductive.Query.MaxFlow ( Data/Graph/Inductive/Query/MaxFlow.hs, nothing )
Data/Graph/Inductive/Query/MaxFlow.hs:105:52: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Data.List, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
    |
105 |     minC        = minimum (map ((\(_,_,z)->z).snd)(tail augLPath))
    |                                                    ^^^^
[21 of 29] Compiling Data.Graph.Inductive.Query.MaxFlow2 ( Data/Graph/Inductive/Query/MaxFlow2.hs, nothing )
Data/Graph/Inductive/Query/MaxFlow2.hs:80:27: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
80 |     filter ((==t) . fst . head) tree
   |                           ^^^^
Data/Graph/Inductive/Query/MaxFlow2.hs:152:61: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
    |
152 | augPath g s t = listToMaybe $ map reverse $ filter ((==t) . head) tree
    |                                                             ^^^^
Data/Graph/Inductive/Query/MaxFlow2.hs:255:42: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘tail’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
    |
255 |               (S.fromList (zip justPath (tail justPath)))
    |                                          ^^^^
[22 of 29] Compiling Data.Graph.Inductive.Query.Monad ( Data/Graph/Inductive/Query/Monad.hs, nothing )
[23 of 29] Compiling Data.Graph.Inductive.Query.SP ( Data/Graph/Inductive/Query/SP.hs, nothing )
[24 of 29] Compiling Data.Graph.Inductive.Query.GVD ( Data/Graph/Inductive/Query/GVD.hs, nothing )
Data/Graph/Inductive/Query/GVD.hs:49:51: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
49 | maybePath v = listToMaybe . filter ((v==) . fst . head . unLPath)
   |                                                   ^^^^
Data/Graph/Inductive/Query/GVD.hs:59:29: warning: [GHC-63394] [-Wx-partial]
    In the use of ‘head’
    (imported from Prelude, but defined in GHC.List):
    "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
   |
59 | nearestDist v = fmap (snd . head . unLPath) . maybePath v
   |                             ^^^^
[25 of 29] Compiling Data.Graph.Inductive.Query.TransClos ( Data/Graph/Inductive/Query/TransClos.hs, nothing )
[26 of 29] Compiling Data.Graph.Inductive.Query ( Data/Graph/Inductive/Query.hs, nothing )
[27 of 29] Compiling Data.Graph.Inductive.Tree ( Data/Graph/Inductive/Tree.hs, nothing )
Data/Graph/Inductive/Tree.hs:16:1: warning: [GHC-66111] [-Wunused-imports]
    The import of ‘Control.Applicative’ is redundant
      except perhaps to import instances from ‘Control.Applicative’
    To import instances alone, use: import Control.Applicative()
   |
16 | import           Control.Applicative (liftA2)
   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[28 of 29] Compiling Paths_fgl        ( dist/build/autogen/Paths_fgl.hs, nothing )
[29 of 29] Compiling Data.Graph.Inductive ( Data/Graph/Inductive.hs, nothing )
Haddock coverage:
  97% ( 97 /100) in 'Data.Graph.Inductive.Graph'
  Missing documentation for:
    MContext (Data/Graph/Inductive/Graph.hs:119)
    DynGraph (Data/Graph/Inductive/Graph.hs:181)
    equal (Data/Graph/Inductive/Graph.hs:525)
  16% (  3 / 18) in 'Data.Graph.Inductive.Internal.Heap'
  Missing documentation for:
    Heap (Data/Graph/Inductive/Internal/Heap.hs:21)
    prettyHeap (Data/Graph/Inductive/Internal/Heap.hs:31)
    printPrettyHeap (Data/Graph/Inductive/Internal/Heap.hs:39)
    empty (Data/Graph/Inductive/Internal/Heap.hs:46)
    unit (Data/Graph/Inductive/Internal/Heap.hs:49)
    insert (Data/Graph/Inductive/Internal/Heap.hs:52)
    merge (Data/Graph/Inductive/Internal/Heap.hs:55)
    mergeAll (Data/Graph/Inductive/Internal/Heap.hs:62)
    isEmpty (Data/Graph/Inductive/Internal/Heap.hs:67)
    findMin (Data/Graph/Inductive/Internal/Heap.hs:71)
    deleteMin (Data/Graph/Inductive/Internal/Heap.hs:75)
    splitMin (Data/Graph/Inductive/Internal/Heap.hs:79)
    build (Data/Graph/Inductive/Internal/Heap.hs:89)
    toList (Data/Graph/Inductive/Internal/Heap.hs:92)
    heapsort (Data/Graph/Inductive/Internal/Heap.hs:97)
  22% (  2 /  9) in 'Data.Graph.Inductive.Internal.Queue'
  Missing documentation for:
    Module header
    Queue (Data/Graph/Inductive/Internal/Queue.hs:10)
    mkQueue (Data/Graph/Inductive/Internal/Queue.hs:13)
    queuePut (Data/Graph/Inductive/Internal/Queue.hs:16)
    queuePutList (Data/Graph/Inductive/Internal/Queue.hs:19)
    queueGet (Data/Graph/Inductive/Internal/Queue.hs:22)
    queueEmpty (Data/Graph/Inductive/Internal/Queue.hs:26)
  44% (  4 /  9) in 'Data.Graph.Inductive.Internal.RootPath'
  Missing documentation for:
    RTree (Data/Graph/Inductive/Internal/RootPath.hs:15)
    LRTree (Data/Graph/Inductive/Internal/RootPath.hs:14)
    getPath (Data/Graph/Inductive/Internal/RootPath.hs:32)
    getLPath (Data/Graph/Inductive/Internal/RootPath.hs:35)
    getLPathNodes (Data/Graph/Inductive/Internal/RootPath.hs:46)
  23% (  3 / 13) in 'Data.Graph.Inductive.Internal.Thread'
  Missing documentation for:
    Split (Data/Graph/Inductive/Internal/Thread.hs:73)
    SplitM (Data/Graph/Inductive/Internal/Thread.hs:106)
    Thread (Data/Graph/Inductive/Internal/Thread.hs:74)
    Collect (Data/Graph/Inductive/Internal/Thread.hs:75)
    threadList' (Data/Graph/Inductive/Internal/Thread.hs:80)
    threadList (Data/Graph/Inductive/Internal/Thread.hs:92)
    threadMaybe' (Data/Graph/Inductive/Internal/Thread.hs:109)
    threadMaybe (Data/Graph/Inductive/Internal/Thread.hs:120)
    splitPar (Data/Graph/Inductive/Internal/Thread.hs:131)
    splitParM (Data/Graph/Inductive/Internal/Thread.hs:136)
 100% ( 18 / 18) in 'Data.Graph.Inductive.Basic'
  47% (  8 / 17) in 'Data.Graph.Inductive.Monad'
  Missing documentation for:
    GraphM (Data/Graph/Inductive/Monad.hs:42)
    nodesM (Data/Graph/Inductive/Monad.hs:107)
    edgesM (Data/Graph/Inductive/Monad.hs:110)
    newNodesM (Data/Graph/Inductive/Monad.hs:113)
    delNodeM (Data/Graph/Inductive/Monad.hs:123)
    delNodesM (Data/Graph/Inductive/Monad.hs:126)
    mkUGraphM (Data/Graph/Inductive/Monad.hs:131)
    contextM (Data/Graph/Inductive/Monad.hs:147)
    labM (Data/Graph/Inductive/Monad.hs:150)
  40% (  4 / 10) in 'Data.Graph.Inductive.Monad.IOArray'
  Missing documentation for:
    SGr (Data/Graph/Inductive/Monad/IOArray.hs:27)
    GraphRep (Data/Graph/Inductive/Monad/IOArray.hs:29)
    Context' (Data/Graph/Inductive/Monad/IOArray.hs:30)
    USGr (Data/Graph/Inductive/Monad/IOArray.hs:32)
    defaultGraphSize (Data/Graph/Inductive/Monad/IOArray.hs:98)
    emptyN (Data/Graph/Inductive/Monad/IOArray.hs:101)
  40% (  4 / 10) in 'Data.Graph.Inductive.Monad.STArray'
  Missing documentation for:
    SGr (Data/Graph/Inductive/Monad/STArray.hs:28)
    GraphRep (Data/Graph/Inductive/Monad/STArray.hs:30)
    Context' (Data/Graph/Inductive/Monad/STArray.hs:31)
    USGr (Data/Graph/Inductive/Monad/STArray.hs:33)
    defaultGraphSize (Data/Graph/Inductive/Monad/STArray.hs:98)
    emptyN (Data/Graph/Inductive/Monad/STArray.hs:101)
Warning: 'NodeMap' is ambiguous. It is defined
    * at Data/Graph/Inductive/NodeMap.hs:42:5
    * at Data/Graph/Inductive/NodeMap.hs:41:1
    You may be able to disambiguate the identifier by qualifying it or
    by specifying the type/value namespace explicitly.
    Defaulting to the one defined at Data/Graph/Inductive/NodeMap.hs:41:1
  59% ( 26 / 44) in 'Data.Graph.Inductive.NodeMap'
  Missing documentation for:
    NodeMap (Data/Graph/Inductive/NodeMap.hs:41)
    insMapNode (Data/Graph/Inductive/NodeMap.hs:106)
    insMapNode_ (Data/Graph/Inductive/NodeMap.hs:111)
    delMapNode (Data/Graph/Inductive/NodeMap.hs:122)
    insMapNodes (Data/Graph/Inductive/NodeMap.hs:133)
    insMapNodes_ (Data/Graph/Inductive/NodeMap.hs:138)
    delMapNodes (Data/Graph/Inductive/NodeMap.hs:149)
    mkNodesM (Data/Graph/Inductive/NodeMap.hs:238)
    mkEdgeM (Data/Graph/Inductive/NodeMap.hs:241)
    mkEdgesM (Data/Graph/Inductive/NodeMap.hs:244)
    insMapNodeM (Data/Graph/Inductive/NodeMap.hs:247)
    insMapEdgeM (Data/Graph/Inductive/NodeMap.hs:250)
    delMapNodeM (Data/Graph/Inductive/NodeMap.hs:253)
    delMapEdgeM (Data/Graph/Inductive/NodeMap.hs:256)
    insMapNodesM (Data/Graph/Inductive/NodeMap.hs:259)
    insMapEdgesM (Data/Graph/Inductive/NodeMap.hs:262)
    delMapNodesM (Data/Graph/Inductive/NodeMap.hs:265)
    delMapEdgesM (Data/Graph/Inductive/NodeMap.hs:268)
  33% (  1 /  3) in 'Data.Graph.Inductive.PatriciaTree'
  Missing documentation for:
    Gr (Data/Graph/Inductive/PatriciaTree.hs:61)
    UGr (Data/Graph/Inductive/PatriciaTree.hs:69)
  22% ( 14 / 61) in 'Data.Graph.Inductive.Example'
  Missing documentation for:
    a (Data/Graph/Inductive/Example.hs:53)
    b (Data/Graph/Inductive/Example.hs:54)
    c (Data/Graph/Inductive/Example.hs:55)
    e (Data/Graph/Inductive/Example.hs:56)
    loop (Data/Graph/Inductive/Example.hs:59)
    ab (Data/Graph/Inductive/Example.hs:60)
    abb (Data/Graph/Inductive/Example.hs:61)
    dag3 (Data/Graph/Inductive/Example.hs:68)
    e3 (Data/Graph/Inductive/Example.hs:57)
    cyc3 (Data/Graph/Inductive/Example.hs:63)
    g3 (Data/Graph/Inductive/Example.hs:74)
    g3b (Data/Graph/Inductive/Example.hs:77)
    dag4 (Data/Graph/Inductive/Example.hs:69)
    d1 (Data/Graph/Inductive/Example.hs:71)
    d3 (Data/Graph/Inductive/Example.hs:72)
    a' (Data/Graph/Inductive/Example.hs:87)
    b' (Data/Graph/Inductive/Example.hs:88)
    c' (Data/Graph/Inductive/Example.hs:89)
    e' (Data/Graph/Inductive/Example.hs:90)
    loop' (Data/Graph/Inductive/Example.hs:93)
    ab' (Data/Graph/Inductive/Example.hs:94)
    abb' (Data/Graph/Inductive/Example.hs:96)
    dag3' (Data/Graph/Inductive/Example.hs:98)
    e3' (Data/Graph/Inductive/Example.hs:91)
    dag4' (Data/Graph/Inductive/Example.hs:99)
    d1' (Data/Graph/Inductive/Example.hs:101)
    d3' (Data/Graph/Inductive/Example.hs:102)
    ucycle (Data/Graph/Inductive/Example.hs:105)
    star (Data/Graph/Inductive/Example.hs:109)
    ucycleM (Data/Graph/Inductive/Example.hs:112)
    starM (Data/Graph/Inductive/Example.hs:116)
    clr479 (Data/Graph/Inductive/Example.hs:126)
    clr489 (Data/Graph/Inductive/Example.hs:131)
    clr486 (Data/Graph/Inductive/Example.hs:128)
    clr508 (Data/Graph/Inductive/Example.hs:134)
    clr528 (Data/Graph/Inductive/Example.hs:137)
    clr595 (Data/Graph/Inductive/Example.hs:140)
    gr1 (Data/Graph/Inductive/Example.hs:143)
    kin248 (Data/Graph/Inductive/Example.hs:147)
    vor (Data/Graph/Inductive/Example.hs:153)
    clr479' (Data/Graph/Inductive/Example.hs:165)
    clr489' (Data/Graph/Inductive/Example.hs:170)
    clr486' (Data/Graph/Inductive/Example.hs:167)
    clr508' (Data/Graph/Inductive/Example.hs:173)
    clr528' (Data/Graph/Inductive/Example.hs:176)
    kin248' (Data/Graph/Inductive/Example.hs:179)
    vor' (Data/Graph/Inductive/Example.hs:185)
  50% (  1 /  2) in 'Data.Graph.Inductive.Query.ArtPoint'
  Missing documentation for:
    Module header
  31% (  6 / 19) in 'Data.Graph.Inductive.Query.BFS'
  Missing documentation for:
    bfs (Data/Graph/Inductive/Query/BFS.hs:48)
    bfsn (Data/Graph/Inductive/Query/BFS.hs:42)
    bfsWith (Data/Graph/Inductive/Query/BFS.hs:45)
    bfsnWith (Data/Graph/Inductive/Query/BFS.hs:39)
    level (Data/Graph/Inductive/Query/BFS.hs:54)
    leveln (Data/Graph/Inductive/Query/BFS.hs:60)
    bfe (Data/Graph/Inductive/Query/BFS.hs:82)
    bfen (Data/Graph/Inductive/Query/BFS.hs:79)
    bft (Data/Graph/Inductive/Query/BFS.hs:105)
    lbft (Data/Graph/Inductive/Query/BFS.hs:126)
    RTree (Data/Graph/Inductive/Internal/RootPath.hs:15)
    esp (Data/Graph/Inductive/Query/BFS.hs:118)
    lesp (Data/Graph/Inductive/Query/BFS.hs:142)
Warning: 'Node' is ambiguous. It is defined
    * in ‘Data.Tree’
    * at Data/Graph/Inductive/Graph.hs:78:1
    You may be able to disambiguate the identifier by qualifying it or
    by specifying the type/value namespace explicitly.
    Defaulting to the one defined at Data/Graph/Inductive/Graph.hs:78:1
  60% ( 23 / 38) in 'Data.Graph.Inductive.Query.DFS'
  Missing documentation for:
    CFun (Data/Graph/Inductive/Query/DFS.hs:63)
    dfs' (Data/Graph/Inductive/Query/DFS.hs:100)
    dff' (Data/Graph/Inductive/Query/DFS.hs:163)
    dfsWith (Data/Graph/Inductive/Query/DFS.hs:94)
    dfsWith' (Data/Graph/Inductive/Query/DFS.hs:97)
    dffWith (Data/Graph/Inductive/Query/DFS.hs:157)
    dffWith' (Data/Graph/Inductive/Query/DFS.hs:160)
    udfs' (Data/Graph/Inductive/Query/DFS.hs:109)
    udff' (Data/Graph/Inductive/Query/DFS.hs:179)
    udffWith (Data/Graph/Inductive/Query/DFS.hs:173)
    udffWith' (Data/Graph/Inductive/Query/DFS.hs:176)
    rdff' (Data/Graph/Inductive/Query/DFS.hs:193)
    rdfs' (Data/Graph/Inductive/Query/DFS.hs:117)
    rdffWith (Data/Graph/Inductive/Query/DFS.hs:187)
    rdffWith' (Data/Graph/Inductive/Query/DFS.hs:190)
  50% (  1 /  2) in 'Data.Graph.Inductive.Query.BCC'
  Missing documentation for:
    Module header
  66% (  2 /  3) in 'Data.Graph.Inductive.Query.Dominators'
  Missing documentation for:
    Module header
 100% (  3 /  3) in 'Data.Graph.Inductive.Query.Indep'
  42% (  3 /  7) in 'Data.Graph.Inductive.Query.MST'
  Missing documentation for:
    msTreeAt (Data/Graph/Inductive/Query/MST.hs:31)
    msTree (Data/Graph/Inductive/Query/MST.hs:34)
    msPath (Data/Graph/Inductive/Query/MST.hs:37)
    LRTree (Data/Graph/Inductive/Internal/RootPath.hs:14)
 100% (  9 /  9) in 'Data.Graph.Inductive.Query.MaxFlow'
  20% (  1 /  5) in 'Data.Graph.Inductive.Query.MaxFlow2'
  Missing documentation for:
    Network (Data/Graph/Inductive/Query/MaxFlow2.hs:24)
    ekSimple (Data/Graph/Inductive/Query/MaxFlow2.hs:227)
    ekFused (Data/Graph/Inductive/Query/MaxFlow2.hs:138)
    ekList (Data/Graph/Inductive/Query/MaxFlow2.hs:260)
  30% ( 13 / 43) in 'Data.Graph.Inductive.Query.Monad'
  Missing documentation for:
    mapFst (Data/Graph/Inductive/Query/Monad.hs:44)
    mapSnd (Data/Graph/Inductive/Query/Monad.hs:46)
    >< (Data/Graph/Inductive/Query/Monad.hs:50)
    orP (Data/Graph/Inductive/Query/Monad.hs:53)
    GT (Data/Graph/Inductive/Query/Monad.hs:60)
    apply (Data/Graph/Inductive/Query/Monad.hs:63)
    apply' (Data/Graph/Inductive/Query/Monad.hs:66)
    applyWith (Data/Graph/Inductive/Query/Monad.hs:69)
    applyWith' (Data/Graph/Inductive/Query/Monad.hs:72)
    runGT (Data/Graph/Inductive/Query/Monad.hs:75)
    condMGT' (Data/Graph/Inductive/Query/Monad.hs:89)
    recMGT' (Data/Graph/Inductive/Query/Monad.hs:92)
    condMGT (Data/Graph/Inductive/Query/Monad.hs:96)
    recMGT (Data/Graph/Inductive/Query/Monad.hs:99)
    getNode (Data/Graph/Inductive/Query/Monad.hs:111)
    getContext (Data/Graph/Inductive/Query/Monad.hs:114)
    getNodes' (Data/Graph/Inductive/Query/Monad.hs:120)
    getNodes (Data/Graph/Inductive/Query/Monad.hs:123)
    sucGT (Data/Graph/Inductive/Query/Monad.hs:129)
    sucM (Data/Graph/Inductive/Query/Monad.hs:136)
    graphRec' (Data/Graph/Inductive/Query/Monad.hs:158)
    graphUFold (Data/Graph/Inductive/Query/Monad.hs:161)
    graphNodesM0 (Data/Graph/Inductive/Query/Monad.hs:172)
    graphNodesM (Data/Graph/Inductive/Query/Monad.hs:175)
    graphNodes (Data/Graph/Inductive/Query/Monad.hs:178)
    graphFilterM (Data/Graph/Inductive/Query/Monad.hs:182)
    graphFilter (Data/Graph/Inductive/Query/Monad.hs:185)
    dfsM' (Data/Graph/Inductive/Query/Monad.hs:213)
    graphDff (Data/Graph/Inductive/Query/Monad.hs:233)
    graphDff' (Data/Graph/Inductive/Query/Monad.hs:236)
  71% (  5 /  7) in 'Data.Graph.Inductive.Query.SP'
  Missing documentation for:
    LRTree (Data/Graph/Inductive/Internal/RootPath.hs:14)
    Heap (Data/Graph/Inductive/Internal/Heap.hs:21)
  88% (  8 /  9) in 'Data.Graph.Inductive.Query.GVD'
  Missing documentation for:
    LRTree (Data/Graph/Inductive/Internal/RootPath.hs:14)
  75% (  3 /  4) in 'Data.Graph.Inductive.Query.TransClos'
  Missing documentation for:
    Module header
  92% ( 13 / 14) in 'Data.Graph.Inductive.Query'
  Missing documentation for:
    Module header
  33% (  1 /  3) in 'Data.Graph.Inductive.Tree'
  Missing documentation for:
    Gr (Data/Graph/Inductive/Tree.hs:40)
    UGr (Data/Graph/Inductive/Tree.hs:48)
  90% (  9 / 10) in 'Data.Graph.Inductive'
  Missing documentation for:
    Module header
Warning: Data.Graph.Inductive.Graph: could not find link destinations for: 
	- GHC.Classes.==
	- GHC.Classes.>=
	- GHC.Classes.Eq
	- GHC.Classes.Ord
	- GHC.Read.Read
	- GHC.Show.Show
	- GHC.Types.Bool
	- GHC.Base.String
	- GHC.Types.Int
	- GHC.Maybe.Maybe
	- GHC.Types.Ordering
	- GHC.Types.IO
	- GHC.Types.Type
	- GHC.Types.True
	- GHC.Read.readList
	- GHC.Read.readsPrec
	- GHC.Show.show
	- GHC.Show.showList
	- GHC.Show.showsPrec
	- GHC.Show.ShowS
	- Text.ParserCombinators.ReadP.ReadS
	- GHC.Classes./=
	- GHC.Classes.<
	- GHC.Classes.<=
	- GHC.Classes.>
	- GHC.Classes.compare
	- GHC.Classes.max
	- GHC.Classes.min
	- GHC.Read.readListPrec
	- GHC.Read.readPrec
	- Text.ParserCombinators.ReadPrec.ReadPrec
Warning: Data.Graph.Inductive.Internal.Heap: could not find link destinations for: 
	- GHC.Classes.==
	- GHC.Classes.Eq
	- GHC.Classes.Ord
	- GHC.Read.Read
	- GHC.Show.Show
	- GHC.Types.Bool
	- GHC.Base.String
	- GHC.Types.Int
	- GHC.Types.IO
	- GHC.Read.readList
	- GHC.Read.readsPrec
	- GHC.Show.show
	- GHC.Show.showList
	- GHC.Show.showsPrec
	- GHC.Show.ShowS
	- Text.ParserCombinators.ReadP.ReadS
	- GHC.Classes./=
	- GHC.Read.readListPrec
	- GHC.Read.readPrec
	- Text.ParserCombinators.ReadPrec.ReadPrec
	- Control.DeepSeq.NFData
	- Control.DeepSeq.rnf
Warning: Data.Graph.Inductive.Internal.Queue: could not find link destinations for: 
	- GHC.Types.Bool
Warning: Data.Graph.Inductive.Internal.RootPath: could not find link destinations for: 
	- GHC.Maybe.Maybe
	- GHC.Maybe.Nothing
Warning: Data.Graph.Inductive.Internal.Thread: could not find link destinations for: 
	- GHC.Maybe.Maybe
Warning: Data.Graph.Inductive.Basic: could not find link destinations for: 
	- GHC.Classes.Eq
	- GHC.Types.Bool
	- GHC.Maybe.Maybe
	- GHC.Types.True
	- Data.Tree.flatten
	- Data.Tree.Tree
Warning: Data.Graph.Inductive.Monad: could not find link destinations for: 
	- GHC.Base.Monad
	- GHC.Types.Bool
	- GHC.Types.Int
	- GHC.Maybe.Maybe
	- GHC.Types.IO
	- GHC.Types.Type
	- GHC.ST.ST
Warning: Data.Graph.Inductive.Monad.IOArray: could not find link destinations for: 
	- GHC.Show.Show
	- GHC.Types.Bool
	- GHC.Base.String
	- GHC.Types.Int
	- GHC.Maybe.Maybe
	- GHC.Types.IO
	- GHC.Types.Type
	- GHC.Show.show
	- GHC.Show.showList
	- GHC.Show.showsPrec
	- GHC.Show.ShowS
	- GHC.Arr.Array
	- GHC.IOArray.IOArray
Warning: Data.Graph.Inductive.Monad.STArray: could not find link destinations for: 
	- GHC.Show.Show
	- GHC.Types.Bool
	- GHC.Base.String
	- GHC.Types.Int
	- GHC.Maybe.Maybe
	- GHC.Prim.RealWorld
	- GHC.Types.Type
	- GHC.Show.show
	- GHC.Show.showList
	- GHC.Show.showsPrec
	- GHC.Show.ShowS
	- GHC.Arr.Array
	- GHC.Arr.STArray
	- GHC.ST.ST
Warning: Data.Graph.Inductive.NodeMap: could not find link destinations for: 
	- GHC.Classes.==
	- GHC.Classes.Eq
	- GHC.Classes.Ord
	- GHC.Read.Read
	- GHC.Show.Show
	- GHC.Types.Bool
	- GHC.Base.String
	- GHC.Types.Int
	- GHC.Maybe.Maybe
	- GHC.Types.Type
	- GHC.Read.readList
	- GHC.Read.readsPrec
	- GHC.Show.show
	- GHC.Show.showList
	- GHC.Show.showsPrec
	- GHC.Show.ShowS
	- Text.ParserCombinators.ReadP.ReadS
	- GHC.Classes./=
	- GHC.Read.readListPrec
	- GHC.Read.readPrec
	- Text.ParserCombinators.ReadPrec.ReadPrec
	- Control.DeepSeq.NFData
	- Control.DeepSeq.rnf
	- Control.Monad.Trans.State.Lazy.State
Warning: Data.Graph.Inductive.PatriciaTree: could not find link destinations for: 
	- GHC.Classes.==
	- GHC.Base.fmap
	- GHC.Classes.Eq
	- GHC.Base.Functor
	- GHC.Classes.Ord
	- GHC.Read.Read
	- GHC.Show.Show
	- GHC.Generics.Generic
	- GHC.Types.Bool
	- GHC.Base.String
	- GHC.Types.Int
	- GHC.Types.Type
	- GHC.Generics.Rep
	- GHC.Base.<$
	- GHC.Read.readList
	- GHC.Read.readsPrec
	- GHC.Show.show
	- GHC.Show.showList
	- GHC.Show.showsPrec
	- GHC.Show.ShowS
	- Text.ParserCombinators.ReadP.ReadS
	- GHC.Classes./=
	- GHC.Read.readListPrec
	- GHC.Read.readPrec
	- Text.ParserCombinators.ReadPrec.ReadPrec
	- Control.DeepSeq.NFData
	- Control.DeepSeq.rnf
	- GHC.Generics.from
	- Data.Bifunctor.Bifunctor
	- GHC.Generics.to
	- Data.Bifunctor.bimap
	- Data.Bifunctor.first
	- Data.Bifunctor.second
	- Data.Graph.Inductive.PatriciaTree.Rep_Gr
Warning: Data.Graph.Inductive.Example: could not find link destinations for: 
	- GHC.Enum.Enum
	- GHC.Base.String
	- GHC.Types.Char
	- GHC.Types.Int
	- GHC.Types.IO
Warning: Data.Graph.Inductive.Query.BFS: could not find link destinations for: 
	- GHC.Types.Int
Warning: Data.Graph.Inductive.Query.DFS: could not find link destinations for: 
	- GHC.Types.Bool
	- GHC.Types.Int
	- Data.Tree.Tree
Warning: Data.Graph.Inductive.Query.Indep: could not find link destinations for: 
	- GHC.Types.Int
Warning: Data.Graph.Inductive.Query.MST: could not find link destinations for: 
	- GHC.Real.Real
Warning: Data.Graph.Inductive.Query.MaxFlow: could not find link destinations for: 
	- GHC.Num.Num
	- GHC.Classes.Ord
	- GHC.Types.Bool
Warning: Data.Graph.Inductive.Query.MaxFlow2: could not find link destinations for: 
	- GHC.Types.Double
Warning: Data.Graph.Inductive.Query.Monad: could not find link destinations for: 
	- GHC.Base.>>=
	- GHC.Base.>>
	- GHC.Base.fmap
	- GHC.Base.return
	- GHC.Base.<*>
	- GHC.Base.pure
	- GHC.Base.*>
	- GHC.Base.Monad
	- GHC.Base.Functor
	- GHC.Base.Applicative
	- GHC.Types.Bool
	- GHC.Maybe.Maybe
	- GHC.Types.Type
	- GHC.Base.<*
	- GHC.Base.liftA2
	- GHC.Base.<$
	- Data.Tree.Tree
Warning: Data.Graph.Inductive.Query.SP: could not find link destinations for: 
	- GHC.Classes.==
	- GHC.Classes.Eq
	- GHC.Read.Read
	- GHC.Real.Real
	- GHC.Show.Show
	- GHC.Types.Bool
	- GHC.Base.String
	- GHC.Types.Int
	- GHC.Maybe.Maybe
	- GHC.Maybe.Nothing
	- GHC.Maybe.Just
	- GHC.Read.readList
	- GHC.Read.readsPrec
	- GHC.Show.show
	- GHC.Show.showList
	- GHC.Show.showsPrec
	- GHC.Show.ShowS
	- Text.ParserCombinators.ReadP.ReadS
	- GHC.Classes./=
	- GHC.Read.readListPrec
	- GHC.Read.readPrec
	- Text.ParserCombinators.ReadPrec.ReadPrec
	- Control.DeepSeq.NFData
	- Control.DeepSeq.rnf
Warning: Data.Graph.Inductive.Query.GVD: could not find link destinations for: 
	- GHC.Real.Real
	- GHC.Maybe.Maybe
Warning: Data.Graph.Inductive.Tree: could not find link destinations for: 
	- GHC.Classes.==
	- GHC.Base.fmap
	- GHC.Classes.Eq
	- GHC.Base.Functor
	- GHC.Classes.Ord
	- GHC.Read.Read
	- GHC.Show.Show
	- GHC.Generics.Generic
	- GHC.Types.Bool
	- GHC.Base.String
	- GHC.Types.Int
	- GHC.Types.Type
	- GHC.Generics.Rep
	- GHC.Base.<$
	- GHC.Read.readList
	- GHC.Read.readsPrec
	- GHC.Show.show
	- GHC.Show.showList
	- GHC.Show.showsPrec
	- GHC.Show.ShowS
	- Text.ParserCombinators.ReadP.ReadS
	- GHC.Classes./=
	- GHC.Read.readListPrec
	- GHC.Read.readPrec
	- Text.ParserCombinators.ReadPrec.ReadPrec
	- Control.DeepSeq.NFData
	- Control.DeepSeq.rnf
	- GHC.Generics.from
	- Data.Bifunctor.Bifunctor
	- GHC.Generics.to
	- Data.Bifunctor.bimap
	- Data.Bifunctor.first
	- Data.Bifunctor.second
	- Data.Graph.Inductive.Tree.Rep_Gr
Warning: Data.Graph.Inductive: could not find link destinations for: 
	- GHC.Types.IO
Documentation created: dist/doc/html/fgl/, dist/doc/html/fgl/fgl.txt
+ RPM_EC=0
++ jobs -p
+ exit 0
Executing(%install): /bin/sh -e /var/tmp/rpm-tmp.Acwl5m
+ umask 022
+ cd /builddir/build/BUILD
+ '[' /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64 '!=' / ']'
+ rm -rf /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64
++ dirname /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64
+ mkdir -p /builddir/build/BUILDROOT
+ mkdir /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64
+ cd fgl-5.8.2.0
+ '[' -x Setup ']'
+ LANG=C.utf8
+ ./Setup copy --destdir=/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64
Installing library in /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/fgl-5.8.2.0
+ '[' -x Setup ']'
+ LANG=C.utf8
+ ./Setup register --gen-pkg-config
+ '[' -d /usr/lib64/ghc-9.8.4/lib ']'
+ subsubdir=/lib
+ '[' -d fgl-5.8.2.0.conf ']'
+ install -D --mode=0644 fgl-5.8.2.0.conf /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/package.conf.d/fgl-5.8.2.0.conf
+ '[' -d /usr/lib64/ghc-9.8.4/lib ']'
+ subsubdir=/lib
+ '[' '!' -f /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/package.conf.d/fgl-5.8.2.0.conf ']'
+ rm -f ghc-fgl.files ghc-fgl-doc.files
+ touch ghc-fgl.files ghc-fgl-doc.files
+ for i in /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4${subsubdir}/libHSfgl-5.8.2.0-*ghc9.8.4.so
+ '[' -x /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/libHSfgl-5.8.2.0-IU74IdcA2tG9od0R1o60rE-ghc9.8.4.so ']'
+ echo /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/libHSfgl-5.8.2.0-IU74IdcA2tG9od0R1o60rE-ghc9.8.4.so
+ pkgdir=/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/fgl-5.8.2.0
+ '[' '!' -d /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/fgl-5.8.2.0 ']'
+ '[' -d /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/fgl-5.8.2.0 ']'
+ find /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/fgl-5.8.2.0 -type d -fprintf ghc-fgl-devel.files '%%dir %p\n' -o '(' -name '*.p_hi' -o -name 'libHS*_p.a' ')' -fprint ghc-fgl-prof.files -o -fprint ghc-fgl-devel.files
+ ls /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/package.conf.d/fgl-5.8.2.0.conf
+ haddock_dir=/usr/share/doc/ghc/html/libraries/fgl-5.8.2.0
+ '[' -d /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/doc/ghc/html/libraries/fgl-5.8.2.0 ']'
+ echo /usr/share/doc/ghc/html/libraries/fgl-5.8.2.0
+ for i in ghc-fgl.files ghc-fgl-devel.files ghc-fgl-doc.files ghc-fgl-prof.files
+ '[' -f ghc-fgl.files ']'
+ sed -i -e 's!/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64!!g' ghc-fgl.files
+ for i in ghc-fgl.files ghc-fgl-devel.files ghc-fgl-doc.files ghc-fgl-prof.files
+ '[' -f ghc-fgl-devel.files ']'
+ sed -i -e 's!/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64!!g' ghc-fgl-devel.files
+ for i in ghc-fgl.files ghc-fgl-devel.files ghc-fgl-doc.files ghc-fgl-prof.files
+ '[' -f ghc-fgl-doc.files ']'
+ sed -i -e 's!/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64!!g' ghc-fgl-doc.files
+ for i in ghc-fgl.files ghc-fgl-devel.files ghc-fgl-doc.files ghc-fgl-prof.files
+ '[' -f ghc-fgl-prof.files ']'
+ sed -i -e 's!/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64!!g' ghc-fgl-prof.files
running ghc_delete_rpaths:
+ echo 'running ghc_delete_rpaths:'
+ type chrpath
++ find /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64 -type f -executable -exec sh -c 'file {} | grep -q '\''dynamically linked'\''' ';' -print
+ for i in $(find /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64 -type f -executable -exec sh -c "file {} | grep -q 'dynamically linked'" \; -print)
+ '[' -x /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/libHSfgl-5.8.2.0-IU74IdcA2tG9od0R1o60rE-ghc9.8.4.so ']'
++ chrpath /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/libHSfgl-5.8.2.0-IU74IdcA2tG9od0R1o60rE-ghc9.8.4.so
++ sed -e 's@^/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/lib64/ghc-9.8.4/lib/libHSfgl-5.8.2.0-IU74IdcA2tG9od0R1o60rE-ghc9.8.4.so: R.*PATH=@@'
+ rpath=/usr/lib64/ghc-9.8.4/lib/loongarch64-linux-ghc-9.8.4
+ case "$rpath" in
+ /usr/lib/rpm/check-buildroot
+ /usr/lib/rpm/OpenCloudOS/brp-ldconfig
+ /usr/lib/rpm/brp-compress
+ /usr/lib/rpm/brp-strip /usr/bin/strip
+ /usr/lib/rpm/brp-strip-comment-note /usr/bin/strip /usr/bin/objdump
+ /usr/lib/rpm/brp-strip-static-archive /usr/bin/strip
+ /usr/lib/rpm/check-rpaths
+ /usr/lib/rpm/OpenCloudOS/brp-mangle-shebangs
+ /usr/lib/rpm/OpenCloudOS/brp-python-bytecompile '' 1 0
+ /usr/lib/rpm/OpenCloudOS/brp-python-hardlink
Executing(%check): /bin/sh -e /var/tmp/rpm-tmp.2zKKCA
+ umask 022
+ cd /builddir/build/BUILD
+ CFLAGS='-O2  -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong  -fasynchronous-unwind-tables -fstack-clash-protection'
+ export CFLAGS
+ CXXFLAGS='-O2  -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong  -fasynchronous-unwind-tables -fstack-clash-protection'
+ export CXXFLAGS
+ FFLAGS='-O2  -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong  -fasynchronous-unwind-tables -fstack-clash-protection -I/usr/lib64/gfortran/modules'
+ export FFLAGS
+ FCFLAGS='-O2  -fexceptions -g -grecord-gcc-switches -pipe -Wall -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -Wp,-D_GLIBCXX_ASSERTIONS -specs=/usr/lib/rpm/OpenCloudOS/OpenCloudOS-hardened-cc1 -fstack-protector-strong  -fasynchronous-unwind-tables -fstack-clash-protection -I/usr/lib64/gfortran/modules'
+ export FCFLAGS
+ LDFLAGS='-Wl,-z,relro -Wl,--as-needed    -Wl,--build-id=sha1'
+ export LDFLAGS
+ LT_SYS_LIBRARY_PATH=/usr/lib64:
+ export LT_SYS_LIBRARY_PATH
+ CC=gcc
+ export CC
+ CXX=g++
+ export CXX
+ cd fgl-5.8.2.0
+ RPM_EC=0
++ jobs -p
+ exit 0
Processing files: ghc-fgl-5.8.2.0-1.oc9.loongarch64
Executing(%license): /bin/sh -e /var/tmp/rpm-tmp.cR2R2l
+ umask 022
+ cd /builddir/build/BUILD
+ cd fgl-5.8.2.0
+ LICENSEDIR=/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/licenses/ghc-fgl
+ export LC_ALL=C
+ LC_ALL=C
+ export LICENSEDIR
+ /usr/bin/mkdir -p /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/licenses/ghc-fgl
+ cp -pr LICENSE /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/licenses/ghc-fgl
+ RPM_EC=0
++ jobs -p
+ exit 0
Provides: ghc-fgl = 5.8.2.0-1.oc9 ghc-fgl(loongarch-64) = 5.8.2.0-1.oc9 libHSfgl-5.8.2.0-IU74IdcA2tG9od0R1o60rE-ghc9.8.4.so()(64bit)
Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1
Requires: libHSarray-0.5.8.0-inplace-ghc9.8.4.so()(64bit) libHSbase-4.19.2.0-inplace-ghc9.8.4.so()(64bit) libHScontainers-0.6.8-inplace-ghc9.8.4.so()(64bit) libHSdeepseq-1.5.1.0-inplace-ghc9.8.4.so()(64bit) libHSghc-bignum-1.3-inplace-ghc9.8.4.so()(64bit) libHSghc-boot-th-9.8.4-inplace-ghc9.8.4.so()(64bit) libHSghc-prim-0.11.0-inplace-ghc9.8.4.so()(64bit) libHSpretty-1.1.3.6-inplace-ghc9.8.4.so()(64bit) libHStemplate-haskell-2.21.0.0-inplace-ghc9.8.4.so()(64bit) libHStransformers-0.6.1.0-inplace-ghc9.8.4.so()(64bit) libc.so.6()(64bit) libc.so.6(GLIBC_2.36)(64bit) libgmp.so.10()(64bit) libm.so.6()(64bit) rtld(GNU_HASH)
Processing files: ghc-fgl-devel-5.8.2.0-1.oc9.loongarch64
Executing(%doc): /bin/sh -e /var/tmp/rpm-tmp.k4sq2i
+ umask 022
+ cd /builddir/build/BUILD
+ cd fgl-5.8.2.0
+ DOCDIR=/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/doc/ghc-fgl-devel
+ export LC_ALL=C
+ LC_ALL=C
+ export DOCDIR
+ /usr/bin/mkdir -p /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/doc/ghc-fgl-devel
+ cp -pr ChangeLog /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/doc/ghc-fgl-devel
+ RPM_EC=0
++ jobs -p
+ exit 0
Provides: ghc-devel(fgl-5.8.2.0-IU74IdcA2tG9od0R1o60rE) ghc-fgl-devel = 5.8.2.0-1.oc9 ghc-fgl-devel(loongarch-64) = 5.8.2.0-1.oc9 ghc-fgl-static = 5.8.2.0-1.oc9
Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1
Requires: ghc-devel(array-0.5.8.0-inplace) ghc-devel(base-4.19.2.0-inplace) ghc-devel(containers-0.6.8-inplace) ghc-devel(deepseq-1.5.1.0-inplace) ghc-devel(transformers-0.6.1.0-inplace)
Processing files: ghc-fgl-doc-5.8.2.0-1.oc9.noarch
Executing(%license): /bin/sh -e /var/tmp/rpm-tmp.eLBt8b
+ umask 022
+ cd /builddir/build/BUILD
+ cd fgl-5.8.2.0
+ LICENSEDIR=/builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/licenses/ghc-fgl-doc
+ export LC_ALL=C
+ LC_ALL=C
+ export LICENSEDIR
+ /usr/bin/mkdir -p /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/licenses/ghc-fgl-doc
+ cp -pr LICENSE /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64/usr/share/licenses/ghc-fgl-doc
+ RPM_EC=0
++ jobs -p
+ exit 0
Provides: ghc-fgl-doc = 5.8.2.0-1.oc9
Requires(rpmlib): rpmlib(CompressedFileNames) <= 3.0.4-1 rpmlib(FileDigests) <= 4.6.0-1 rpmlib(PayloadFilesHavePrefix) <= 4.0-1
Checking for unpackaged file(s): /usr/lib/rpm/check-files /builddir/build/BUILDROOT/ghc-fgl-5.8.2.0-1.oc9.loongarch64
Wrote: /builddir/build/RPMS/ghc-fgl-5.8.2.0-1.oc9.loongarch64.rpm
Wrote: /builddir/build/RPMS/ghc-fgl-doc-5.8.2.0-1.oc9.noarch.rpm
Wrote: /builddir/build/RPMS/ghc-fgl-devel-5.8.2.0-1.oc9.loongarch64.rpm
Child return code was: 0