Index: src/OFHashes.m
==================================================================
--- src/OFHashes.m
+++ src/OFHashes.m
@@ -29,11 +29,11 @@
 
 /* This is the central step in the MD5 algorithm. */
 #define MD5STEP(f, w, x, y, z, data, s) \
 	(w += f(x, y, z) + data, w = w << s | w >> (32 - s), w += x)
 
-inline void
+static inline void
 md5_transform(uint32_t buf[4], const uint32_t in[16])
 {
 	register uint32_t a, b, c, d;
 
 	a = buf[0];
@@ -280,11 +280,11 @@
 typedef union {
 	uint8_t	 c[64];
 	uint32_t l[16];
 } sha1_c64l16_t;
 
-inline void
+static inline void
 sha1_transform(uint32_t state[5], const uint8_t buffer[64])
 {
 	uint32_t      a, b, c, d, e;
 	uint8_t	      workspace[64];
 	sha1_c64l16_t *block;

Index: src/OFMacros.h
==================================================================
--- src/OFMacros.h
+++ src/OFMacros.h
@@ -13,11 +13,11 @@
 	[[OFNotImplementedException newWithObject: self			\
 				      andSelector: _cmd] raise];	\
 	return ret;
 
 #ifdef OF_BIG_ENDIAN
-inline void
+static inline void
 OF_BSWAP_V(uint8_t *buf, size_t len)
 {
 	uint32_t t;
 
 	while (len--) {

Index: src/OFXMLFactory.m
==================================================================
--- src/OFXMLFactory.m
+++ src/OFXMLFactory.m
@@ -23,11 +23,11 @@
  * We already have a clue about how big the resulting string will get, so we
  * can prealloc and only resize when really necessary - OFString would always
  * resize when we append, which would be slow here.
  */
 
-inline BOOL
+static inline BOOL
 xmlfactory_resize(char **str, size_t *len, size_t add)
 {
 	char *str2;
 	size_t len2;
 
@@ -44,11 +44,11 @@
 	*len = len2;
 
 	return YES;
 }
 
-inline BOOL
+static inline BOOL
 xmlfactory_add2str(char **str, size_t *len, size_t *pos, const char *add)
 {
 	size_t add_len;
 
 	add_len = strlen(add);