libglusterfs: Move devel headers under glusterfs directory

libglusterfs devel package headers are referenced in code using
include semantics for a program, this while it works can be better
especially when dealing with out of tree xlator builds or in
general out of tree devel package usage.

Towards this, the following changes are done,
- moved all devel headers under a glusterfs directory
- Included these headers using system header notation <> in all
code outside of libglusterfs
- Included these headers using own program notation "" within
libglusterfs

This change although big, is just moving around the headers and
making it correct when including these headers from other sources.

This helps us correctly include libglusterfs includes without
namespace conflicts.

Change-Id: Id2a98854e671a7ee5d73be44da5ba1a74252423b
Updates: bz#1193929
Signed-off-by: ShyamsundarR <srangana@redhat.com>

1 files changed, 0 insertions, 60 deletions

diff --git a/libglusterfs/src/gidcache.h b/libglusterfs/src/gidcache.h
deleted file mode 100644
index 3a7de47dec7..00000000000
--- a/libglusterfs/src/gidcache.h
+++ /dev/null
@@ -1,60 +0,0 @@
-/*
-  Copyright (c) 2008-2012 Red Hat, Inc. <http://www.redhat.com>
-  This file is part of GlusterFS.
-
-  This file is licensed to you under your choice of the GNU Lesser
-  General Public License, version 3 or any later version (LGPLv3 or
-  later), or the GNU General Public License, version 2 (GPLv2), in all
-  cases as published by the Free Software Foundation.
-*/
-
-#ifndef __GIDCACHE_H__
-#define __GIDCACHE_H__
-
-#include "glusterfs.h"
-#include "locking.h"
-
-/*
- * TBD: make the cache size tunable
- *
- * The current size represents a pretty trivial amount of memory, and should
- * provide good hit rates even for quite busy systems.  If we ever want to
- * support really large cache sizes, we'll need to do dynamic allocation
- * instead of just defining an array within a private structure. It doesn't make
- * a whole lot of sense to change the associativity, because it won't improve
- * hit rates all that much and will increase the maintenance cost as we have
- * to scan more entries with every lookup/update.
- */
-
-#define AUX_GID_CACHE_ASSOC 4
-#define AUX_GID_CACHE_BUCKETS 256
-#define AUX_GID_CACHE_SIZE (AUX_GID_CACHE_ASSOC * AUX_GID_CACHE_BUCKETS)
-
-typedef struct {
-    uint64_t gl_id;
-    uint64_t gl_uid;
-    uint64_t gl_gid;
-    int gl_count;
-    gid_t *gl_list;
-    time_t gl_deadline;
-} gid_list_t;
-
-typedef struct {
-    gf_lock_t gc_lock;
-    uint32_t gc_max_age;
-    unsigned int gc_nbuckets;
-    gid_list_t gc_cache[AUX_GID_CACHE_SIZE];
-} gid_cache_t;
-
-int
-gid_cache_init(gid_cache_t *, uint32_t);
-int
-gid_cache_reconf(gid_cache_t *, uint32_t);
-const gid_list_t *
-gid_cache_lookup(gid_cache_t *, uint64_t, uint64_t, uint64_t);
-void
-gid_cache_release(gid_cache_t *, const gid_list_t *);
-int
-gid_cache_add(gid_cache_t *, gid_list_t *);
-
-#endif /* __GIDCACHE_H__ */