Index: head/devel/libdatrie/Makefile
===================================================================
--- head/devel/libdatrie/Makefile	(revision 513210)
+++ head/devel/libdatrie/Makefile	(revision 513211)
@@ -1,26 +1,26 @@
 # Created by: Alexey Dokuchaev <danfe@FreeBSD.org>
 # $FreeBSD$
 
 PORTNAME=	libdatrie
 PORTVERSION=	0.2.12
 CATEGORIES=	devel
 MASTER_SITES=	http://linux.thai.net/pub/thailinux/software/libthai/
 
 MAINTAINER=	bofh@FreeBSD.org
 COMMENT=	Double-array trie implementation library
 
-LICENSE=	LGPL21
+LICENSE=	LGPL21+
+LICENSE_FILE=	${WRKSRC}/COPYING
 
-OPTIONS_DEFINE=	DOCS
-
+USES=		iconv libtool localbase:ldflags pathfix tar:xz
 GNU_CONFIGURE=	yes
-USES=		iconv libtool pathfix tar:xz
 USE_LDCONFIG=	yes
 
-CPPFLAGS+=	-I${LOCALBASE}/include
-LDFLAGS+=	-L${LOCALBASE}/lib ${ICONV_LIB}
+LDFLAGS+=	${ICONV_LIB}
 
 PORTDOCS=	README.migration
 INSTALL_TARGET=	install-strip
+
+OPTIONS_DEFINE=	DOCS
 
 .include <bsd.port.mk>
Index: head/devel/libdatrie/pkg-descr
===================================================================
--- head/devel/libdatrie/pkg-descr	(revision 513210)
+++ head/devel/libdatrie/pkg-descr	(revision 513211)
@@ -1,10 +1,10 @@
 This is an implementation of double-array structure for representing trie,
 as proposed by Junichi Aoe.
 
 Trie is a kind of digital search tree, an efficient indexing method with
 O(1) time complexity for searching.  Comparably as efficient as hashing,
 trie also provides flexibility on incremental matching and key spelling
 manipulation.  This makes it ideal for lexical analyzers, as well as
 spelling dictionaries.
 
-WWW: http://linux.thai.net/projects/datrie/
+WWW: https://linux.thai.net/projects/datrie/