Merge pull request #1324 from donaldsharp/bgp_aspath

[mirror_frr.git] / lib / vector.h

diff --git a/lib/vector.h b/lib/vector.h
index deaf6a87ed3124043ff5c5c47e513139e5fd7af7..91f7d997da4fa43ee337cfb3b5abc8c180171083 100644 (file)
--- a/lib/vector.h
+++ b/lib/vector.h
@@ -14,21 +14,21 @@
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  * General Public License for more details.
  *
- * You should have received a copy of the GNU General Public License
- * along with GNU Zebra; see the file COPYING.  If not, write to the Free
- * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
- * 02111-1307, USA.  
+ * You should have received a copy of the GNU General Public License along
+ * with this program; see the file COPYING; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  */
 
 #ifndef _ZEBRA_VECTOR_H
 #define _ZEBRA_VECTOR_H
 
+#include "memory.h"
+
 /* struct for vector */
-struct _vector 
-{
-  unsigned int active;         /* number of active slots */
-  unsigned int alloced;                /* number of allocated slot */
-  void **index;                        /* index to data */
+struct _vector {
+       unsigned int active;  /* number of active slots */
+       unsigned int alloced; /* number of allocated slot */
+       void **index;    /* index to data */
 };
 typedef struct _vector *vector;
 
@@ -38,26 +38,26 @@ typedef struct _vector *vector;
  array expression. */
 /* Reference slot at given index, caller must ensure slot is active */
 #define vector_slot(V,I)  ((V)->index[(I)])
-/* Number of active slots. 
+/* Number of active slots.
  * Note that this differs from vector_count() as it the count returned
  * will include any empty slots
  */
 #define vector_active(V) ((V)->active)
 
 /* Prototypes. */
-vector vector_init (unsigned int size);
-void vector_ensure (vector v, unsigned int num);
-int vector_empty_slot (vector v);
-int vector_set (vector v, void *val);
-int vector_set_index (vector v, unsigned int i, void *val);
-void vector_unset (vector v, unsigned int i);
-unsigned int vector_count (vector v);
-void vector_only_wrapper_free (vector v);
-void vector_only_index_free (void *index);
-void vector_free (vector v);
-vector vector_copy (vector v);
-
-void *vector_lookup (vector, unsigned int);
-void *vector_lookup_ensure (vector, unsigned int);
+extern vector vector_init(unsigned int size);
+extern void vector_ensure(vector v, unsigned int num);
+extern int vector_empty_slot(vector v);
+extern int vector_set(vector v, void *val);
+extern int vector_set_index(vector v, unsigned int i, void *val);
+extern void vector_unset(vector v, unsigned int i);
+extern void vector_unset_value(vector v, void *val);
+
+extern unsigned int vector_count(vector v);
+extern void vector_free(vector v);
+extern vector vector_copy(vector v);
+
+extern void *vector_lookup(vector, unsigned int);
+extern void *vector_lookup_ensure(vector, unsigned int);
 
 #endif /* _ZEBRA_VECTOR_H */