mirror of
https://github.com/openvswitch/ovs
synced 2025-08-22 18:07:40 +00:00
e3648418c4
port_array_delete(pa, idx) is equivalent to port_array_set(pa, idx, NULL), but it never allocates memory and avoids conditionals.
97 lines
3.3 KiB
C
97 lines
3.3 KiB
C
/*
|
|
* Copyright (c) 2008, 2009, 2010 Nicira Networks.
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at:
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#ifndef PORT_ARRAY_H
|
|
#define PORT_ARRAY_H 1
|
|
|
|
#include <assert.h>
|
|
#include "openflow/openflow.h"
|
|
#include "util.h"
|
|
|
|
static inline uint16_t
|
|
port_array_extract_bits__(uint16_t data, int start, int count)
|
|
{
|
|
return (data >> start) & ((1u << count) - 1);
|
|
}
|
|
|
|
/* Level 1: most-significant bits. */
|
|
#define PORT_ARRAY_L1_BITS 5
|
|
#define PORT_ARRAY_L1_SHIFT (PORT_ARRAY_L3_BITS + PORT_ARRAY_L2_BITS)
|
|
#define PORT_ARRAY_L1_SIZE (1u << PORT_ARRAY_L1_BITS)
|
|
#define PORT_ARRAY_L1(IDX) \
|
|
port_array_extract_bits__(IDX, PORT_ARRAY_L1_SHIFT, PORT_ARRAY_L1_BITS)
|
|
|
|
/* Level 2: middle bits. */
|
|
#define PORT_ARRAY_L2_BITS 5
|
|
#define PORT_ARRAY_L2_SHIFT PORT_ARRAY_L3_BITS
|
|
#define PORT_ARRAY_L2_SIZE (1u << PORT_ARRAY_L2_BITS)
|
|
#define PORT_ARRAY_L2(IDX) \
|
|
port_array_extract_bits__(IDX, PORT_ARRAY_L2_SHIFT, PORT_ARRAY_L2_BITS)
|
|
|
|
/* Level 3: least-significant bits. */
|
|
#define PORT_ARRAY_L3_BITS 6
|
|
#define PORT_ARRAY_L3_SHIFT 0
|
|
#define PORT_ARRAY_L3_SIZE (1u << PORT_ARRAY_L3_BITS)
|
|
#define PORT_ARRAY_L3(IDX) \
|
|
port_array_extract_bits__(IDX, PORT_ARRAY_L3_SHIFT, PORT_ARRAY_L3_BITS)
|
|
|
|
#define PORT_ARRAY_SIZE (1u << (PORT_ARRAY_L1_BITS \
|
|
+ PORT_ARRAY_L2_BITS \
|
|
+ PORT_ARRAY_L3_BITS))
|
|
|
|
BUILD_ASSERT_DECL(PORT_ARRAY_SIZE > 0xffff);
|
|
|
|
/* A "sparse array" of up to 65536 elements (numbered 0...65535), implemented
|
|
* as a 3-level trie. Most efficient when the elements are clustered
|
|
* together. */
|
|
struct port_array {
|
|
struct port_array_l2 *l1[1u << PORT_ARRAY_L1_BITS];
|
|
};
|
|
|
|
struct port_array_l2 {
|
|
struct port_array_l3 *l2[1u << PORT_ARRAY_L2_BITS];
|
|
};
|
|
|
|
struct port_array_l3 {
|
|
void *l3[1u << PORT_ARRAY_L3_BITS];
|
|
};
|
|
|
|
/* Returns the value of the element numbered 'idx' in 'pa', or a null pointer
|
|
* if no element numbered 'idx' has been set. */
|
|
static inline void *
|
|
port_array_get(const struct port_array *pa, uint16_t idx)
|
|
{
|
|
unsigned int l1_idx = PORT_ARRAY_L1(idx);
|
|
unsigned int l2_idx = PORT_ARRAY_L2(idx);
|
|
unsigned int l3_idx = PORT_ARRAY_L3(idx);
|
|
return pa->l1[l1_idx]->l2[l2_idx]->l3[l3_idx];
|
|
}
|
|
|
|
void port_array_init(struct port_array *);
|
|
void port_array_destroy(struct port_array *);
|
|
void port_array_clear(struct port_array *);
|
|
void port_array_set(struct port_array *, uint16_t idx, void *);
|
|
void port_array_delete(struct port_array *, uint16_t idx);
|
|
void *port_array_first(const struct port_array *, unsigned int *);
|
|
void *port_array_next(const struct port_array *, unsigned int *);
|
|
unsigned int port_array_count(const struct port_array *);
|
|
|
|
#define PORT_ARRAY_FOR_EACH(DATA, ARRAY, PORT_NO) \
|
|
for ((DATA) = port_array_first(ARRAY, &(PORT_NO)); (DATA) != NULL; \
|
|
(DATA) = port_array_next(ARRAY, &(PORT_NO)))
|
|
|
|
#endif /* port-array.h */
|