Merge pull request #266 from NeoRaider/batman-adv-build-dir

[lede-routing/.git] / poprouting / Makefile

diff --git a/poprouting/Makefile b/poprouting/Makefile
index 5df8cfebef7695e41153e9c27f5d85cfa04d278d..6a889057ba3ae0f9516d43173cb7e777e3504ac4 100644 (file)
--- a/poprouting/Makefile
+++ b/poprouting/Makefile
@@ -12,24 +12,35 @@ PKG_SOURCE_URL:=https://github.com/gabri94/poprouting.git
 PKG_SOURCE_VERSION:=v0.2
 PKG_SOURCE_SUBDIR:=prince-v0.2
 include $(INCLUDE_DIR)/package.mk
+
 define Package/prince
        SECTION :=net
        CATEGORY :=Network
        SUBMENU :=Routing and Redirection
        Mantainer :=Gabriele Gemmi <gabriel@autistici.org>
        TITLE :=PopRouting daemon
+       URL :=https://github.com/gabri94/poprouting
        MENU :=0
        DEPENDS := +libjson-c +libpthread
 endef
 
-define Package/poprouting/description
+define Package/prince/description
 Prince is an open source implementation of the PopRouting Algorithm.
 It has been developed as a Google Summer of Code Project in collaboration with Freifunk and the University of Trento.
 
-It fetches topology data from a Link State routing deamon(OONF, OLSR, OSPF, etc),
-uses the betweenness centrality to optimize the timer's value and pushes back the optimized timer.
+It work by fetching topology data from a Link State routing demon(OONF, OLSR, OSPF, etc),
+calculating the betweenness centrality using the topology, then using these data
+the timer's value are optimized. Finally the timers are pushed back to the routing demon.
 Currently it only supports OLSRd2 (aka OONF).
 endef
 
+define Package/prince/install
+       $(INSTALL_DIR) $(1)/usr/lib
+       $(INSTALL_DATA) $(PKG_BUILD_DIR)/graph-parser_c/build/lib/libgraphcparser.so $(1)/usr/lib/
+       $(INSTALL_DIR) $(1)/usr/sbin
+       $(INSTALL_BIN) $(PKG_BUILD_DIR)/prince/build/prince_c $(1)/usr/sbin/
+       $(INSTALL_DATA) $(PKG_BUILD_DIR)/prince/build/libprince_oonf.so $(1)/usr/lib/
+endef
+
 
-$(eval $(call BuildPackage,poprouting))
+$(eval $(call BuildPackage,prince))