Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Compact asynchronous pooling #105

Open
vanrein opened this issue Mar 26, 2019 · 1 comment
Open

Compact asynchronous pooling #105

vanrein opened this issue Mar 26, 2019 · 1 comment

Comments

@vanrein
Copy link
Contributor

vanrein commented Mar 26, 2019

We're using a macro package, uthash.h, which expands to quite some code.

  1. We use a few routines twice. Perhaps turn them into functions.
  2. Internal macros that come back: HASH_VALUE, and probably a few of the _FIND_ operations; we can put them in a function and redefine the macro to that function right below its definition.

A matter of trying.

@vanrein
Copy link
Contributor Author

vanrein commented Mar 26, 2019

Another consideration: some applications might prefer utlist.h instead of uthash.h, with smaller storage but slower responses. This would not be ABI-compatible, but a local version (perhaps with other names, or not installable, or some kind of assert() to verify in time) might be considered.

@vanrein vanrein added this to the embedded-small-facilitation milestone Mar 26, 2019
@vanrein vanrein changed the title Optimise hash functions Optimise asynchronous pooling Mar 26, 2019
@vanrein vanrein changed the title Optimise asynchronous pooling Compact asynchronous pooling Mar 28, 2019
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant