Crates.io | wtx-macros |
lib.rs | wtx-macros |
version | 0.3.0 |
source | src |
created_at | 2024-01-13 01:32:10.542413 |
updated_at | 2024-09-16 13:40:10.576837 |
description | Procedural macros for wtx |
homepage | |
repository | https://github.com/c410-f3r/wtx |
max_upload_size | |
id | 1098213 |
size | 93,869 |
A collection of different transport implementations and related tools focused primarily on web technologies. Contains the implementations of 5 IETF RFCs (RFC6265, RFC6455, RFC7541, RFC7692, RFC9113), 2 formal specifications (gRPC, PostgreSQL) and several other invented ideas.
Embedded devices with a working heap allocator can use this no_std
crate.
Many things that generally improve performance are used in the project, to name a few:
cargo tree -e normal --features postgres
.Since memory are usually held at the instance level instead of being created and dropped on the fly, it is worth noting that its usage can growth significantly depending on the use-case. If appropriated, try using a shared pool of resources or try limiting how much data can be exchanged between parties.
Checkout wtx-bench to see a variety of benchmarks or feel free to point any misunderstandings or misconfigurations.
There are mainly 2 things that impact performance, the chosen runtime and the number of pre-allocated bytes. Specially for servers that have to create a new instance for each handshake, pre-allocating a high number of bytes for short-lived or low-transfer connections can have a negative impact.
Anything marked with #[bench]
in the repository is considered a low-level benchmark in the sense that they measure very specific operations that generally serve as the basis for other parts.
Take a look at https://bencher.dev/perf/wtx to see all low-level benchmarks over different periods of time.
Demonstrations of different use-cases can be found in the wtx-instances
directory as well as in the documentation.
Does not support systems with 16bit memory addresses and expects the infallible addition of the sizes of 8 allocated chunks of memories, otherwise the program will overflow in certain arithmetic operations involving usize
potentially resulting in unexpected operations.
For example, in a 32bit system you can allocate a maximum of 2^29 bytes of memory for at most 8 elements. Such a scenario should be viable with little swap memory due to the likely triggering of the OOM killer or through specific limiters like ulimit
.