bffcc3bca0
Cisco wrote a bipartite graph solver to properly solve interface pair selection for usNIC. Using the reachable framework, the TCP BTL (and possibly the runtime network code) can use the graph solver to make more optimal pair selection. Jeff was happy to have the code more broadly used, but didn't have time to do the move, hence this commit. There are a couple of minor changes to the code compared to the usNIC version. Obviously, the functions have been renamed to match naming convention for their new home. Since it's easier to write unit tests for util/ code, the unit tests have been made first class tests run at "make check" time. This last bit required moving some of the definitions into a new header, bipartite_graph_internal.h, so that they could be included in both the library code and the test code. Signed-off-by: Brian Barrett <bbarrett@amazon.com>
136 строки
3.2 KiB
Makefile
136 строки
3.2 KiB
Makefile
#
|
|
# Copyright (c) 2004-2005 The Trustees of Indiana University and Indiana
|
|
# University Research and Technology
|
|
# Corporation. All rights reserved.
|
|
# Copyright (c) 2004-2005 The University of Tennessee and The University
|
|
# of Tennessee Research Foundation. All rights
|
|
# reserved.
|
|
# Copyright (c) 2004-2005 High Performance Computing Center Stuttgart,
|
|
# University of Stuttgart. All rights reserved.
|
|
# Copyright (c) 2004-2005 The Regents of the University of California.
|
|
# All rights reserved.
|
|
# Copyright (c) 2007-2015 Cisco Systems, Inc. All rights reserved.
|
|
# Copyright (c) 2013 NVIDIA Corporation. All rights reserved.
|
|
# Copyright (c) 2013 Intel, Inc. All rights reserved
|
|
# Copyright (c) 2016 Los Alamos National Security, LLC. All rights
|
|
# reserved.
|
|
# Copyright (c) 2016 Research Organization for Information Science
|
|
# and Technology (RIST). All rights reserved.
|
|
# Copyright (c) 2016-2017 IBM Corporation. All rights reserved.
|
|
# $COPYRIGHT$
|
|
#
|
|
# Additional copyrights may follow
|
|
#
|
|
# $HEADER$
|
|
#
|
|
|
|
SUBDIRS = keyval
|
|
|
|
dist_opaldata_DATA = help-opal-util.txt
|
|
|
|
AM_LFLAGS = -Popal_show_help_yy
|
|
LEX_OUTPUT_ROOT = lex.opal_show_help_yy
|
|
|
|
noinst_LTLIBRARIES = libopalutil.la
|
|
|
|
AM_CPPFLAGS = $(LTDLINCL)
|
|
|
|
# Source code files
|
|
|
|
headers = \
|
|
alfg.h \
|
|
arch.h \
|
|
argv.h \
|
|
basename.h \
|
|
bipartite_graph.h \
|
|
bipartite_graph_internal.h \
|
|
bit_ops.h \
|
|
cmd_line.h \
|
|
crc.h \
|
|
daemon_init.h \
|
|
ethtool.h \
|
|
error.h \
|
|
fd.h \
|
|
few.h \
|
|
if.h \
|
|
keyval_parse.h \
|
|
malloc.h \
|
|
net.h \
|
|
numtostr.h \
|
|
opal_environ.h \
|
|
opal_getcwd.h \
|
|
opal_pty.h \
|
|
os_dirpath.h \
|
|
os_path.h \
|
|
output.h \
|
|
path.h \
|
|
printf.h \
|
|
proc.h \
|
|
qsort.h \
|
|
show_help.h \
|
|
show_help_lex.h \
|
|
stacktrace.h \
|
|
strncpy.h \
|
|
sys_limits.h \
|
|
timings.h \
|
|
uri.h \
|
|
info_subscriber.h \
|
|
info.h
|
|
|
|
libopalutil_la_SOURCES = \
|
|
$(headers) \
|
|
alfg.c \
|
|
arch.c \
|
|
argv.c \
|
|
basename.c \
|
|
bipartite_graph.c \
|
|
cmd_line.c \
|
|
crc.c \
|
|
daemon_init.c \
|
|
ethtool.c \
|
|
error.c \
|
|
fd.c \
|
|
few.c \
|
|
if.c \
|
|
keyval_parse.c \
|
|
malloc.c \
|
|
net.c \
|
|
numtostr.c \
|
|
opal_environ.c \
|
|
opal_getcwd.c \
|
|
opal_pty.c \
|
|
os_dirpath.c \
|
|
os_path.c \
|
|
output.c \
|
|
path.c \
|
|
printf.c \
|
|
proc.c \
|
|
qsort.c \
|
|
show_help.c \
|
|
show_help_lex.l \
|
|
stacktrace.c \
|
|
strncpy.c \
|
|
sys_limits.c \
|
|
uri.c \
|
|
info_subscriber.c \
|
|
info.c
|
|
|
|
if OPAL_COMPILE_TIMING
|
|
libopalutil_la_SOURCES += timings.c
|
|
endif
|
|
|
|
libopalutil_la_LIBADD = \
|
|
keyval/libopalutilkeyval.la
|
|
libopalutil_la_DEPENDENCIES = \
|
|
keyval/libopalutilkeyval.la
|
|
|
|
# Conditionally install the header files
|
|
|
|
if WANT_INSTALL_HEADERS
|
|
opaldir = $(opalincludedir)/$(subdir)
|
|
opal_HEADERS = $(headers)
|
|
endif
|
|
|
|
maintainer-clean-local:
|
|
rm -f show_help_lex.c
|