- May 15, 2013
-
-
Jan Včelák authored
Commands with parameters were not parsed correctly, as the name from knot_cmd_tbl is compared against the command line parameter. Change-Id: I588d12a6c7fbce428ea47924fe2d4cb841559a02
-
- May 14, 2013
-
-
Jan Kadlec authored
- RRSIGs without node are currently dropped in AXFR-in, added better message explaining what happened Change-Id: I74606fc583befcb71276921f4ca8b56298e31330
-
Daniel Salzman authored
Change-Id: Ia50e0caa9525c4bcb8f4e065d80043e4c9051e84
-
Daniel Salzman authored
Change-Id: I606de5b7c80ddc34048a64f157b96f734c5591df
-
Daniel Salzman authored
Change-Id: I9f34c66239ea58c0c4186535223099f874cc42c9
-
Daniel Salzman authored
Change-Id: I64026e0d73f334ac9e340deac7afcba6bf010c1d
-
Daniel Salzman authored
refs #2137 Change-Id: I8a4cddc92b30dc9b483c92f871e029c487a7c626
-
Daniel Salzman authored
Change-Id: Ifd9ed04eb5b4c4184f503897642a0a602f914745
-
Daniel Salzman authored
Uninitialized buffer caused problems during blank rrset processing. refs #2137 Change-Id: Iabc95f2561bb8a0215eddc67ba8121c54561454c
-
Jan Kadlec authored
- Wrong log message was printed Change-Id: I227b25704e254267350f0e565c630319b47360b2
-
Marek Vavrusa authored
Change-Id: Ib37d0574e00d2610d5cb2da7ebd59deedf1e8957
-
Marek Vavrusa authored
Change-Id: If10737ebb99ee7f656e28168d6f2b98825869713
-
- May 13, 2013
-
-
Marek Vavrusa authored
This solves problem when PID file needs to be created in a directory where only root can write, but the user can enter. Change-Id: I357ece2d36574931850e366573b10dcd64c9482a
-
Ondřej Surý authored
-
Daniel Salzman authored
Change-Id: Ic40747d9b5c5194b01e9ee66ccad54d26a1c8028
-
Daniel Salzman authored
Change-Id: I5e052d2e3c907563c1b9591ef89565e6ccaabb2f
-
Jan Kadlec authored
- Enabled saving of empty RRs - only header and 0 RDLENGTH are saved if there are no RDATA in RRSet - Moved code saving header to wire to an extra function. Change-Id: Ib1a923e0445a9f8b7fc36ac3f673c41aad53c9c7
-
- May 11, 2013
-
-
Daniel Salzman authored
Change-Id: Id5f453783728495e5e5494213bf4c1765d03310e
-
Daniel Salzman authored
Change-Id: I6d71395b77fa40715b41ac2eda380fa5030e8baa
-
Marek Vavrusa authored
Change-Id: I952c5ae76fc1dca9d7e824ef55e55e4393a27d7d
-
- May 10, 2013
-
-
Daniel Salzman authored
refs #2137 Change-Id: I43856d5f62836db2aff4c2349d186ccb5e3c68b7
-
Daniel Salzman authored
Change-Id: Ib3d748d070f3db7b37a7127f7ae54e83536bcf23
-
Marek Vavrusa authored
Change-Id: I610adff24d791bc04203c2453ec906e888d2d728
-
Daniel Salzman authored
Change-Id: I8f8932c6e610a5b24cd33c2329d7959c2d0aef7b
-
Marek Vavrusa authored
Change-Id: Ie86eb4df209143f5581d90f4dcd9f27f0330b68a
-
Marek Vavrusa authored
The idea was to use simplified tries, but it didn't work so well. Simplified and cleaned up label compression. The idea was to use simplified tries, but it didn't work so well. New approach is based on the fact, that only a small part of unique suffixes is reused in the packet (mostly qname and few related names), whilst rest of the names are mentioned scarcely. As a tradeoff, we will compres those most common names. Table is scanned in a linear fashion. Name suffix is aligned (end-to-end) to a current table pointer. Aligned labels are then compared and best coverage is reported. Matches that can't exceed current best coverage are ignored. Not/partially covered names are inserted (only index to wire). Covering matches are promoted to a lower index, this is because: - frequent matches are inspected earlier, performance increase - last 1/4 of the least-used names may be replaced randomly with new names Didn't change the currently used API to keep the patch nice and sweet, but there's a lot of legacy code to be removed. Change-Id: Id86bc7e3e56012182eebf148aad3ddc3b2649879
-
Marek Vavrusa authored
This allows us to reuse the memory without worry about freeing. Flush (sort of free) is done after packet processing is finished. Uses generic mm context and mempool from libucw. Change-Id: Ifcc74e745797eb7f6833c74dc9ebd89743ba4358
-
Marek Vavrusa authored
Change-Id: I2a5ed6c68aeee99f13c7e023e148e92e4965b838
-
Marek Vavrusa authored
Change-Id: I0f1db7e5acd90fa123639a4d8c66765be5882b1d
-
Marek Vavrusa authored
Mempool is a type of memory allocator that allows to free all allocated elements at once. Removed unnecessary string and state operations. Licensed under LGPL, same as lists and heap. Change-Id: I8b8f84f41dcc321f37e51894b5c121f463c4f111
-
Marek Vavrusa authored
Default is libc malloc/free. This will be used to supply to functions where a memory is allocated in some context (f.e. when building packet) so the API stays the same and we could switch the allocator as we see fit. Change-Id: Ia5956b6da38d9feb01c5bfb0a4cd4e9393db0589
-
- May 09, 2013
-
-
Daniel Salzman authored
Change-Id: I39d236a0d6594692597f2e66624f0b0d56928c34
-
Daniel Salzman authored
Change-Id: Ia8388c541fec44a17f284fc0e4c2aa83afa9b74f
-
Daniel Salzman authored
Change-Id: I436236bc78c45f576dfee3ff251ba7ca9c95d1b0
-
- May 07, 2013
-
-
Daniel Salzman authored
Change-Id: Ie3e7fab14198c6add9055c9f24eece9c7c123bd1
-
Daniel Salzman authored
refs #2137 Change-Id: I83a723cb07f482b886c588e6ec0f8910c2f97964
-
Daniel Salzman authored
refs #2137 Change-Id: I42c905d94858e90d87136117e7aaaaaf415854b1
-
Daniel Salzman authored
Coverity scan #1019150 Change-Id: I09e97249299856612bec953eb79f33b978d23580
-
Daniel Salzman authored
Coverity scan #1019149 Change-Id: I3beb8efced13d2bf5a5316ae02835739ffa54263
-
Daniel Salzman authored
Change-Id: If0df4f7947110b84b7c45dc909b3fbd5c5f048a6
-