In legacy/trac#23577 (moved), we will create node_get_curve25519_onion_key().
We should use it to implement node_has_curve25519_onion_key(), so they give consistent results.
To upload designs, you'll need to enable LFS and have an admin enable hashed storage. More information
Child items ...
Show closed items
Linked items 0
Link issues together to show that they're related.
Learn more.
These functions have code that's almost identical.
We can implement node_has… by calling node_get… and checking the result.
The result is valid if it passes the existing check in node_has….
This might be a good ticket for you to focus on, because it is a small first-time change for you to learn C and learn our processes.
These functions have code that's almost identical.
We can implement node_has… by calling node_get… and checking the result.
The result is valid if it passes the existing check in node_has….
This might be a good ticket for you to focus on, because it is a small first-time change for you to learn C and learn our processes.
Does that mean that we can replace all calls to function node_has... by calling node_get... without any ambiguity i.e if it passes all tests.
In legacy/trac#23577 (moved), we will create node_get_curve25519_onion_key().
We should use it to implement node_has_curve25519_onion_key(), so they give consistent results.
Or as this says, we should create node_get_curve25519_onion_key() and then call node_has_curve25519_onion_key() from this function so they give consistent results?
All the calls to node_has.. will be replaced by node_get.. .Instead we will call node_get..() and check if the value that is returned is NULL or not. If it is not NULL then we'll call routerinfo_has_curve25519_onion_key() in routerlist.c, otherwise its zero.
I did run the make check command. It is failing at line 1638 that is the one with the first if condition that returns NULL. I tried running without the if condition, but it's still failing at the same line.