1################################################################################################### 2# # 3# This file is part of HPIPM. # 4# # 5# HPIPM -- High-Performance Interior Point Method. # 6# Copyright (C) 2019 by Gianluca Frison. # 7# Developed at IMTEK (University of Freiburg) under the supervision of Moritz Diehl. # 8# All rights reserved. # 9# # 10# The 2-Clause BSD License # 11# # 12# Redistribution and use in source and binary forms, with or without # 13# modification, are permitted provided that the following conditions are met: # 14# # 15# 1. Redistributions of source code must retain the above copyright notice, this # 16# list of conditions and the following disclaimer. # 17# 2. Redistributions in binary form must reproduce the above copyright notice, # 18# this list of conditions and the following disclaimer in the documentation # 19# and/or other materials provided with the distribution. # 20# # 21# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND # 22# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED # 23# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE # 24# DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR # 25# ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES # 26# (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; # 27# LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND # 28# ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT # 29# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS # 30# SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. # 31# # 32# Author: Gianluca Frison, gianluca.frison (at) imtek.uni-freiburg.de # 33# # 34################################################################################################### 35 36 37include ../Makefile.rule 38 39OBJS = 40 41ifeq ($(TARGET), GENERIC) 42OBJS += 43endif 44 45# common 46OBJS += scenario_tree.o 47# double 48OBJS += d_tree_ocp_qp_dim.o 49OBJS += d_tree_ocp_qp.o 50OBJS += d_tree_ocp_qp_sol.o 51OBJS += d_tree_ocp_qp_res.o 52OBJS += d_tree_ocp_qp_kkt.o 53OBJS += d_tree_ocp_qp_ipm.o 54# single 55OBJS += s_tree_ocp_qp_dim.o 56OBJS += s_tree_ocp_qp.o 57OBJS += s_tree_ocp_qp_sol.o 58OBJS += s_tree_ocp_qp_res.o 59OBJS += s_tree_ocp_qp_kkt.o 60OBJS += s_tree_ocp_qp_ipm.o 61 62obj: $(OBJS) 63 64clean: 65 rm -f *.o 66 rm -f *.s 67 68d_tree_ocp_qp_dim.o: d_tree_ocp_qp_dim.c x_tree_ocp_qp_dim.c 69s_tree_ocp_qp_dim.o: s_tree_ocp_qp_dim.c x_tree_ocp_qp_dim.c 70d_tree_ocp_qp.o: d_tree_ocp_qp.c x_tree_ocp_qp.c 71s_tree_ocp_qp.o: s_tree_ocp_qp.c x_tree_ocp_qp.c 72d_tree_ocp_qp_sol.o: d_tree_ocp_qp_sol.c x_tree_ocp_qp_sol.c 73s_tree_ocp_qp_sol.o: s_tree_ocp_qp_sol.c x_tree_ocp_qp_sol.c 74d_tree_ocp_qp_res.o: d_tree_ocp_qp_res.c x_tree_ocp_qp_res.c 75s_tree_ocp_qp_res.o: s_tree_ocp_qp_res.c x_tree_ocp_qp_res.c 76d_tree_ocp_qp_kkt.o: d_tree_ocp_qp_kkt.c x_tree_ocp_qp_kkt.c 77s_tree_ocp_qp_kkt.o: s_tree_ocp_qp_kkt.c x_tree_ocp_qp_kkt.c 78d_tree_ocp_qp_ipm.o: d_tree_ocp_qp_ipm.c x_tree_ocp_qp_ipm.c 79s_tree_ocp_qp_ipm.o: s_tree_ocp_qp_ipm.c x_tree_ocp_qp_ipm.c 80