Mercurial > hg > nginx
view src/core/ngx_bpf.h @ 9167:3038bd4d7816
Core: changed ngx_queue_sort() to use merge sort.
This improves nginx startup times significantly when using very large number
of locations due to computational complexity of the sorting algorithm being
used: insertion sort is O(n*n) on average, while merge sort is O(n*log(n)).
In particular, in a test configuration with 20k locations total startup
time is reduced from 8 seconds to 0.9 seconds.
Prodded by Yusuke Nojima,
https://mailman.nginx.org/pipermail/nginx-devel/2023-September/NUL3Y2FPPFSHMPTFTL65KXSXNTX3NQMK.html
author | Maxim Dounin <mdounin@mdounin.ru> |
---|---|
date | Wed, 18 Oct 2023 04:30:11 +0300 |
parents | d3747ba486e7 |
children |
line wrap: on
line source
/* * Copyright (C) Nginx, Inc. */ #ifndef _NGX_BPF_H_INCLUDED_ #define _NGX_BPF_H_INCLUDED_ #include <ngx_config.h> #include <ngx_core.h> #include <linux/bpf.h> typedef struct { char *name; int offset; } ngx_bpf_reloc_t; typedef struct { char *license; enum bpf_prog_type type; struct bpf_insn *ins; size_t nins; ngx_bpf_reloc_t *relocs; size_t nrelocs; } ngx_bpf_program_t; void ngx_bpf_program_link(ngx_bpf_program_t *program, const char *symbol, int fd); int ngx_bpf_load_program(ngx_log_t *log, ngx_bpf_program_t *program); int ngx_bpf_map_create(ngx_log_t *log, enum bpf_map_type type, int key_size, int value_size, int max_entries, uint32_t map_flags); int ngx_bpf_map_update(int fd, const void *key, const void *value, uint64_t flags); int ngx_bpf_map_delete(int fd, const void *key); int ngx_bpf_map_lookup(int fd, const void *key, void *value); #endif /* _NGX_BPF_H_INCLUDED_ */