| Commit message (Collapse) | Author | Age | Files | Lines |
| ... | |
| | | |
| | |
| | |
| | |
| | | |
This is better because it is returned by
`ConsensusFlavor::Microdesc::name()`.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This commit fixes some parts in the extra-info related part of the
database schema.
Most notably, it changes the semantic to indicate that the sha1
represents the unsigned part of the extra-info document.
Likewise, it also ensures that the reference to an extra-info document
must not be null with a plain consensus but null with a microdescriptor
consensus.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This commit modifies the database schema to rename `sha1` and `sha2` to
`unsigned_sha1` and `unsigned_sha2`.
Network status consensuses refer to server descriptors by their unsigned
sha1.
Microdescriptor consensuses refer to microdescriptors by their sha2,
which is always unsigned, so we adapt that name for consistency.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This commit removes the foreign key constraints from the
`consensus_router_descriptor_member` in order to allow the insertion of
the router descriptors contained in a consensus before the respective
descriptors were fetched.
This also allows to directly compute the missing descriptors in SQL,
using a left join on this table on `router_descriptor` and obtaining the
entries that are NULL.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This commit modifies the database schema by tracking the sha1 of the
extra-info instead of the rowid. This makes generating queues and other
things easier.
It also removes the foreign key constraint in order to allow for an
asynchronous retrieval and storage. Otherwise it would not be possible
to store a router descriptor without having obtained the extra info
first.
|
| | | |
| | |
| | |
| | |
| | |
| | | |
This approach is better in order to guarantee that invariants are not
violated, such that the expiry timestamp not being earlier than the
valid after one for example.
|
| | | | |
|
| | | |
| | |
| | |
| | |
| | | |
This commit implements Sha1 for the database in order to use it for the
fingerprints in authority key certificates.
|
| | | |
| | |
| | |
| | |
| | | |
This commit implements Sha3_256 as a database type and uses it for
stroing `ConsensusMeta::unsigned_sha3_256`.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This commit moves the `DocumentId` implementation into a macro called
`impl_hash_wrapper` that implements a hash type in a database compatible
fashion.
In our case, we implement this for `sha2::Sha256` and then type alias
`DocumentId` to this new hash. Yes, we originally moved away from a
type alias here, but I think this is fine because for the foreseeable
future, we will continue to use a hash here, just maybe not Sha2, but
the flexibility remains.
The motivation for this is to support other hash algorithms similarly
too.
|
| | | | |
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This commit moves get_recent_auth_certs from operation to database by
introducing a new struct called `AuthCertMeta` containing the database
metadata alongside an accompanying data method returning the raw data.
For now, it leaves out the download, verify, and insert logic.
We will add that back later once we will need it.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | | |
This commit renames the database `Consensus` to `ConsensusMeta` in order
to not collide with the naming from tor-netdoc and to clearly indicate
that this data is just metadata about such a document, but not the
document itself.
|
| | | |
| | |
| | |
| | | |
Makes things more handy to write.
|
| | | |
| | |
| | |
| | |
| | | |
If is annoying to use, especially if we can avoid it by just avoid name
conflicts.
|
| | | | |
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | | |
Right now, it is a bit unfortunate that we have the very long schema
string between two code blocks. It is probably better to either have it
at the top or the bottom of the file, hence why this commit moves it to
the top.
|
| | | |
| | |
| | |
| | |
| | | |
This commit moves calculate_sync_timeout into the Consensus struct in
the database module, as it fits better there.
|
| | | |
| | |
| | |
| | |
| | | |
This commit removes the operation serve function because it no longer
fits into the new model of operation using a FSM.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This commit moves the get_recent_consensus logic to the database module,
which also introduces a struct querying all fields in it.
This not only simplifies the return type but also makes working with
this type more comfortable to work with.
|
| | | |
| | |
| | |
| | |
| | |
| | | |
This commit replaces occurrences of rowid with docid, particularly in
tables for N:M cardinalities. Purpose of this is, to achieve a greater
consistency with the overall database schema.
|
| | | |
| | |
| | |
| | |
| | | |
This is more useful and less boilerplate, removing a parameter for a
conversion we can do ourselves if required.
|
| | |/
|/|
| |
| |
| |
| |
| | |
This commit scratches out the FSM for the dirmirror operation.
Right now, there are still lots of TODO, lots of code warnigns, and
such. It should model the rough concept.
|
| |\ \
| | |
| | |
| | |
| | | |
rpc: API for event-driven IO.
See merge request tpo/core/arti!3652
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | | |
|
| | | |
| | |
| | |
| | |
| | |
| | | |
rustfmt doesn't like to touch things inside macros. These were
misformatted as a result, with long lines and in one case a missing
space.
|
| | | | |
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
Per discussion, it makes more sense to have the API be one
that gets called when our IO interests change.
Additionally, this commit removes the try_reading and try_writing
booleans, as previously discussed.
I've left a couple of XXXX comments where more documentation or
thought is likely needed.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | | |
This API provides the necessary functionality to use an RpcConn
inside a poll-like event loop.
This is part of #1856.
|
| | | | |
|
| | | | |
|
| | | |
| | |
| | | |
(from Diziet)
|
| | | | |
|
| | | |
| | |
| | |
| | | |
This is based on a pad with input from nickm and Diziet
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
This commit finally adds a `RpcConn::submit()` method to send a
request without having to wait on it specifically, and an
`RpcConn::wait()` method to wait for the next response from _any_
such request.
Thanks to the previous patches, this is relatively simple!
This is part of #1856.
|
| | | |
| | |
| | |
| | |
| | |
| | | |
In order to implement tagged pollable requests, we need a separate
response queue for them, and we need to dispatch requests to that
queue as appropriate.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | | |
For pollable requests, we'll want to associate each one with a tag.
But we'd rather not carry tags around for _every_ pending request:
it would waste space and lead to possible errors. So instead we
add a Tag type as a member of QueueId.
|
| | | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | |
In order to implement this part of #1856, we will internally divide
requests into two kinds: "Waitable" and "Pollable". Waitable
requests are the kind that we have now: They are created with an
"execute" method. They each have their own response queue and their
own condvar, and in order to see if they have any responses, the
caller needs to call some kind of request-specific method.
Pollable requests are the ones we will add. They are created with a
"submit" method, and associated with a user-provided tag.
They all share the same queue and the same condvar.
To see if any of them have a response, the caller will run a
function that returns tagged responses.
In order to support this division, this commit:
- turns `RequestState` into an enum,
- makes `ResponseQueue` into its own type,
- Adds a trait that will be implemented by every type that can
identify a response queue.
|
| |\ \ \
| |_|/
|/| |
| | |
| | |
| | |
| | | |
proto: Upgrade to latest polyval.
Closes #2390
See merge request tpo/core/arti!3747
|
| | | |
| | |
| | |
| | |
| | |
| | | |
This will improve performance for CGO.
Closes #2390.
|
| |\ \ \
| | | |
| | | |
| | | |
| | | | |
tor-netdoc parse2: Rename *Signed to *Unverified
See merge request tpo/core/arti!3742
|
| | | | | |
|
| | | | | |
|
| | | | | |
|