diff options
author | Rich Felker <dalias@aerifal.cx> | 2018-10-04 20:27:17 -0400 |
---|---|---|
committer | Rich Felker <dalias@aerifal.cx> | 2018-10-04 20:27:17 -0400 |
commit | d1395c43c019aec6b855cf3c656bf47c8a719e7f (patch) | |
tree | c7c070b4887d17832631c2868ea6f9a757194dab /src/linux/timerfd.c | |
parent | 7bf773a8f9b97875ba67b646c1681ac5ca22016f (diff) | |
download | musl-d1395c43c019aec6b855cf3c656bf47c8a719e7f.tar.gz musl-d1395c43c019aec6b855cf3c656bf47c8a719e7f.tar.bz2 musl-d1395c43c019aec6b855cf3c656bf47c8a719e7f.tar.xz musl-d1395c43c019aec6b855cf3c656bf47c8a719e7f.zip |
allow freeaddrinfo of arbitrary sublists of addrinfo list
the specification for freeaddrinfo allows it to be used to free
"arbitrary sublists" of the list returned by getaddrinfo. it's not
clearly stated how such sublists come into existence, but the
interpretation seems to be that the application can edit the ai_next
pointers to cut off a portion of the list and then free it.
actual freeing of individual list slots is contrary to the design of
our getaddrinfo implementation, which has no failure paths after
making a single allocation, so that light callers can avoid linking
realloc/free. freeing individual slots is also incompatible with
sharing the string for ai_canonname, which the current implementation
does despite no requirement that it be present except on the first
result. so, rather than actually freeing individual slots, provide a
way to find the start of the allocated array, and reference-count it,
freeing the memory all at once after the last slot has been freed.
since the language in the spec is "arbitrary sublists", no provision
for handling other constructs like multiple lists glued together,
circular links, etc. is made. presumably passing such a construct to
freeaddrinfo produces undefined behavior.
Diffstat (limited to 'src/linux/timerfd.c')
0 files changed, 0 insertions, 0 deletions