/*
- * Copyright (c) 2008, 2009 Nicira Networks.
+ * Copyright (c) 2008, 2009, 2010, 2011, 2012 Nicira, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
#include <config.h>
#include "svec.h"
-#include <assert.h>
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
#include "dynamic-string.h"
#include "util.h"
-
-#define THIS_MODULE VLM_svec
#include "vlog.h"
+VLOG_DEFINE_THIS_MODULE(svec);
+
void
svec_init(struct svec *svec)
{
}
void
-svec_clear(struct svec *svec)
+svec_clear(struct svec *svec)
{
size_t i;
void
svec_unique(struct svec *svec)
{
- assert(svec_is_sorted(svec));
+ ovs_assert(svec_is_sorted(svec));
if (svec->n > 1) {
/* This algorithm is lazy and sub-optimal, but it's "obviously correct"
* and asymptotically optimal . */
{
size_t i, j;
- assert(svec_is_sorted(a));
- assert(svec_is_sorted(b));
+ ovs_assert(svec_is_sorted(a));
+ ovs_assert(svec_is_sorted(b));
if (a_only) {
svec_init(a_only);
}
{
char **p;
- assert(svec_is_sorted(svec));
+ ovs_assert(svec_is_sorted(svec));
p = bsearch(&name, svec->names, svec->n, sizeof *svec->names,
compare_strings);
return p ? p - svec->names : SIZE_MAX;
const char *
svec_get_duplicate(const struct svec *svec)
{
- assert(svec_is_sorted(svec));
+ ovs_assert(svec_is_sorted(svec));
if (svec->n > 1) {
size_t i;
for (i = 1; i < svec->n; i++) {
const char *
svec_back(const struct svec *svec)
{
- assert(svec->n);
+ ovs_assert(svec->n);
return svec->names[svec->n - 1];
}
void
svec_pop_back(struct svec *svec)
{
- assert(svec->n);
+ ovs_assert(svec->n);
free(svec->names[--svec->n]);
}