refactor: update packet get layer/tunnel API
This commit is contained in:
@@ -70,26 +70,24 @@ struct layer
|
||||
};
|
||||
|
||||
int packet_get_layer_count(const struct packet *pkt);
|
||||
// return 0: success
|
||||
// return -1: failed
|
||||
int packet_get_layer_by_idx(const struct packet *pkt, int idx, struct layer *out);
|
||||
const struct layer *packet_get_layer_by_idx(const struct packet *pkt, int idx);
|
||||
|
||||
#define PACKET_FOREACH_LAYER_INORDER(pkt, layer) \
|
||||
for (int i = 0; i < packet_get_layer_count(pkt) && packet_get_layer_by_idx(pkt, i, &layer) == 0; i++)
|
||||
|
||||
#define PACKET_FOREACH_LAYER_REVERSE(pkt, layer) \
|
||||
for (int i = packet_get_layer_count(pkt) - 1; i >= 0 && packet_get_layer_by_idx(pkt, i, &layer) == 0; i--)
|
||||
|
||||
#define PACKET_GETALL_LAYERS(pkt, layers) \
|
||||
({ \
|
||||
memset(layers, 0, sizeof(layers)); \
|
||||
int size = sizeof(layers) / sizeof(layers[0]); \
|
||||
int count = packet_get_layer_count(pkt); \
|
||||
int num = count > size ? size : count; \
|
||||
for (int i = 0; i < num && packet_get_layer_by_idx(pkt, i, &layers[i]) == 0; i++) \
|
||||
/* void */; \
|
||||
num; \
|
||||
})
|
||||
// // example: foreach layer in packet (inorder)
|
||||
// int count = packet_get_layer_count(pkt);
|
||||
// for (int i = 0; i < count; i++)
|
||||
// {
|
||||
// const struct layer *layer = packet_get_layer_by_idx(pkt, i);
|
||||
// // do something with layer
|
||||
// }
|
||||
//
|
||||
//
|
||||
// // example: foreach layer in packet (reverse)
|
||||
// int count = packet_get_layer_count(pkt);
|
||||
// for (int i = count - 1; i >= 0; i--)
|
||||
// {
|
||||
// const struct layer *layer = packet_get_layer_by_idx(pkt, i);
|
||||
// // do something with layer
|
||||
// }
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
|
||||
@@ -33,7 +33,7 @@ struct tunnel
|
||||
enum tunnel_type type;
|
||||
|
||||
int layer_count;
|
||||
struct layer layers[MAX_LAYERS_PER_TUNNEL];
|
||||
const struct layer *layers[MAX_LAYERS_PER_TUNNEL];
|
||||
};
|
||||
|
||||
int packet_get_tunnel_count(const struct packet *pkt);
|
||||
@@ -41,23 +41,6 @@ int packet_get_tunnel_count(const struct packet *pkt);
|
||||
// return -1: failed
|
||||
int packet_get_tunnel_by_idx(const struct packet *pkt, int idx, struct tunnel *out);
|
||||
|
||||
#define PACKET_FOREACH_TUNNEL_INORDER(pkt, tunnel) \
|
||||
for (int i = 0; i < packet_get_tunnel_count(pkt) && packet_get_tunnel_by_idx(pkt, i, &tunnel) == 0; i++)
|
||||
|
||||
#define PACKET_FOREACH_TUNNEL_REVERSE(pkt, tunnel) \
|
||||
for (int i = packet_get_tunnel_count(pkt) - 1; i >= 0 && packet_get_tunnel_by_idx(pkt, i, &tunnel) == 0; i--)
|
||||
|
||||
#define PACKET_GETALL_TUNNELS(pkt, tunnels) \
|
||||
({ \
|
||||
memset(tunnels, 0, sizeof(tunnels)); \
|
||||
int size = sizeof(tunnels) / sizeof(tunnels[0]); \
|
||||
int count = packet_get_tunnel_count(pkt); \
|
||||
int num = count > size ? size : count; \
|
||||
for (int i = 0; i < num && packet_get_tunnel_by_idx(pkt, i, &tunnels[i]) == 0; i++) \
|
||||
/* void */; \
|
||||
num; \
|
||||
})
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
Reference in New Issue
Block a user