ebpf_test.h

/*
Copyright 2018 VMware, Inc.
 
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 BACKENDS_EBPF_RUNTIME_EBPF_USER_H_
#define BACKENDS_EBPF_RUNTIME_EBPF_USER_H_
 
#include "ebpf_registry.h"
#include "ebpf_common.h"
 
#include <endian.h>
#include <stdio.h>          // printf

#define htonll(x) htobe64(x)
#define ntohll(x) be64toh(x)
 
#define bpf_htons(x) htobe16(x)
#define bpf_ntohs(x) be16toh(x)
#define bpf_htonl(x) htobe32(x)
#define bpf_ntohl(x) be32toh(x)
#define bpf_cpu_to_be64(x) htobe64(x)
#define bpf_be64_to_cpu(x) be64toh(x)
 
#define load_byte(data, b) (*(((u8*)(data)) + (b)))
#define load_half(data, b) bpf_ntohs(*(u16 *)((u8*)(data) + (b)))
#define load_word(data, b) bpf_ntohl(*(u32 *)((u8*)(data) + (b)))
#define load_dword(data, b) bpf_be64_to_cpu(*(u64 *)((u8*)(data) + (b)))
 
 
 
#define bpf_printk(fmt, ...)                                            \
                ({                                                      \
                        char ____fmt[] = fmt;                           \
                        printf(____fmt, sizeof(____fmt),                \
                                     ##__VA_ARGS__);                    \
                })

#define SEC(NAME)

struct sk_buff {
    void *data;
    u16 len;
    u32 ifindex;
};

#define BPF_ANY     0 
#define BPF_NOEXIST 1 
#define BPF_EXIST   2 
#define BPF_F_LOCK  4 

enum bpf_map_type {
    BPF_MAP_TYPE_HASH,
    BPF_MAP_TYPE_ARRAY,
};
 
 
 
#define SK_BUFF struct sk_buff
#define REGISTER_START() \
struct bpf_table tables[] = {
#define REGISTER_TABLE(NAME, TYPE, KEY_SIZE, VALUE_SIZE, MAX_ENTRIES) \
    { MAP_PATH"/"#NAME, TYPE, KEY_SIZE, VALUE_SIZE, MAX_ENTRIES, NULL },
#define REGISTER_END() \
    { 0, 0, 0, 0, 0 } \
};
 
#define BPF_MAP_LOOKUP_ELEM(table, key) \
    registry_lookup_table_elem(MAP_PATH"/"#table, key)
#define BPF_MAP_UPDATE_ELEM(table, key, value, flags) \
    registry_update_table(MAP_PATH"/"#table, key, value, flags)
#define BPF_MAP_DELETE_ELEM(table, key) \
    registry_delete_table_elem(MAP_PATH"/"#table, key)
#define BPF_USER_MAP_UPDATE_ELEM(index, key, value, flags)\
    registry_update_table_id(index, key, value, flags)
#define BPF_OBJ_PIN(table, name) registry_add(table)
#define BPF_OBJ_GET(name) registry_get_id(name)
 

extern struct bpf_table tables[];
extern int ebpf_filter(struct sk_buff *skb);

static inline void print_n_bytes(void *receiveBuffer, int num) {
    for (int i = 0; i < num; i++)
        printf("%02x", ((unsigned char *)receiveBuffer)[i]);
    printf("\n");
}
 
#endif  // BACKENDS_EBPF_RUNTIME_EBPF_USER_H_