proxmox-mirrors/mirror_frr
1
0
Fork 0
mirror of https://git.proxmox.com/git/mirror_frr synced 2025-07-26 04:54:44 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Merge branch 'master' of https://github.com/dwalton76/frr into zebra-debug-packet-detail

Browse Source 
Conflicts:
	zebra/debug.c
This commit is contained in:
Daniel Walton 2017-07-26 18:17:33 +00:00
commit 6f4d6a15a9
11 changed files with 929 additions and 837 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

450
COMMUNITY.md
View File

@ -1,4 +1,7 @@
# Developing for PROJECT (DRAFT) Developing for FRRouting
=========================
## Table of Contents
[TOC] [TOC]
@ -14,55 +17,57 @@ it's the document that needs to be updated, not reality.
## Git Structure ## Git Structure
The master Git for PROJECT resides on Github at The master Git for FRRouting resides on Github at
[https://github.com/PROJECT/XXX](https://github.com/PROJECT/XXX) [https://github.com/frrouting/frr](https://github.com/FRRouting/frr)
![git branches continually merging to the left from 3 lanes; float-right](doc/git_branches.svg ![git branches continually merging to the left from 3 lanes; float-right](doc/git_branches.svg
"git branch mechanics") "git branch mechanics")
There is one main branch for development and a release branch for each There is one main branch for development and a release branch for each major
major release. release.
New contributions are done against the head of the master branch. The CI New contributions are done against the head of the master branch. The CI
systems will pick up the Github Pull Requests or the new patch from systems will pick up the Github Pull Requests or the new patch from Patchwork,
Patchwork, run some basic build and functional tests. run some basic build and functional tests.
For each major release (1.0, 1.1 etc) a new release branch is created based For each major release (1.0, 1.1 etc) a new release branch is created based on
on the master. the master.
There was an attempt to use a "develop" branch automatically maintained by There was an attempt to use a "develop" branch automatically maintained by the
the CI system. This is not currently in active use, though the system is CI system. This is not currently in active use, though the system is
operational. If the "develop" branch is in active use and this paragraph operational. If the "develop" branch is in active use and this paragraph is
is still here, this document obviously wasn't updated. still here, this document obviously wasn't updated.
## Programming language, Tools and Libraries ## Programming language, Tools and Libraries
The core of PROJECT is written in C (gcc or clang supported). A few The core of FRRouting is written in C (gcc or clang supported) and makes use of
non-essential scripts are implemented in Perl and Python. PROJECT requires GNU compiler extensions. A few non-essential scripts are implemented in Perl
the following tools to build distribution packages: automake, autoconf, and Python. FRRouting requires the following tools to build distribution
texinfo, libtool and gawk and various libraries (i.e. libpam and libjson-c). packages: automake, autoconf, texinfo, libtool and gawk and various libraries
(i.e. libpam and libjson-c).
If your contribution requires a new library or other tool, then please If your contribution requires a new library or other tool, then please
highlight this in your description of the change. Also make sure it’s highlight this in your description of the change. Also make sure it’s supported
supported by all PROJECT platform OSes or provide a way to build without the by all FRRouting platform OSes or provide a way to build without the library
library (potentially without the new feature) on the other platforms. (potentially without the new feature) on the other platforms.
Documentation should be written in Tex (.texi) or Markdown (.md) format with Documentation should be written in Tex (.texi) or Markdown (.md) format with a
preference on Markdown. preference for Markdown.
## Before Submitting your changes ## Mailing lists
Italicized lists are private.
| Topic | List |
|--------------------------------|------------------------------|
| Development | dev@lists.frrouting.org |
| Users & Operators | frog@lists.frrouting.org |
| Announcements | announce@lists.frrouting.org |
| _Security_ | security@lists.frrouting.org |
| _Technical Steering Committee_ | tsc@lists.frrouting.org |
* Format code (see [Code Styling requirements](#code-styling-requirements))
* Verify and acknowledge license (see [License for contributions](#license-for-contributions))
* Test building with various configurations:
* `buildtest.sh`
* Verify building source distribution:
* `make dist` (and try rebuilding from the resulting tar file)
* Run DejaGNU unit tests:
* `make test`
* Document Regression Runs and plans for continued maintenance of the feature
### Changelog ### Changelog
@ -75,16 +80,45 @@ for the release notes.
## Submitting Patches and Enhancements ## Submitting Patches and Enhancements
### Pre-submission Checklist
* Format code (see [Coding style requirements](#coding-style-requirements))
* Verify and acknowledge license (see [License for contributions](#license-for-contributions))
* Ensure you have properly signed off (see [Signing Off](#signing-off))
* Test building with various configurations:
* `buildtest.sh`
* Verify building source distribution:
* `make dist` (and try rebuilding from the resulting tar file)
* Run unit tests:
* `make test`
* Document Regression Runs and plans for continued maintenance of the feature
### License for contributions ### License for contributions
PROJECT is under a “GPLv2 or later” license. Any code submitted must be FRRouting is under a “GPLv2 or later” license. Any code submitted must be
released under the same license (preferred) or any license which allows released under the same license (preferred) or any license which allows
redistribution under this GPLv2 license (eg MIT License). redistribution under this GPLv2 license (eg MIT License).
### Signed-off required ### Signing Off
Submissions to PROJECT require a “Signed-off” in the patch or git commit. Code submitted to FRRouting must be signed off. We have the same requirements
We follow the same standard as the Linux Kernel Development. for using the signed-off-by process as the Linux kernel. In short, you must
include a signed-off-by tag in every patch.
`Signed-off-by:` this is a developer's certification that he or she has the
right to submit the patch for inclusion into the project. It is an agreement to
the Developer's Certificate of Origin (below). Code without a proper signoff
can not and will not be merged.
If you are unfamiliar with this process, you should read the [official policy
at kernel.org](http://www.kernel.org/doc/Documentation/SubmittingPatches) and
you might find this article about [participating in the Linux community on the
Linux Foundation
website](http://www.linuxfoundation.org/content/how-participate-linux-community-0)
to be a helpful resource.
In short, when you sign off on a commit, you assert your agreement to all of
the following:
> Developer's Certificate of Origin 1.1 > Developer's Certificate of Origin 1.1
> >
@ -112,79 +146,46 @@ We follow the same standard as the Linux Kernel Development.
> maintained indefinitely and may be redistributed consistent with > maintained indefinitely and may be redistributed consistent with
> this project or the open source license(s) involved. > this project or the open source license(s) involved.
#### Using this Process ### What do I submit my changes against?
We have the same requirements for using the signed-off-by process as the Linux
kernel. In short, you need to include a signed-off-by tag in every patch:
* `Signed-off-by:` this is a developer's certification that he or she has the
right to submit the patch for inclusion into the project. It is an agreement to
the Developer's Certificate of Origin (above). Code without a proper signoff
cannot be merged into the mainline.
Please make sure to have a `Signed-off-by:` in each commit/patch or the patches
will be rejected until this is added.
If you are unfamiliar with this process, you should read the [official policy
at kernel.org](http://www.kernel.org/doc/Documentation/SubmittingPatches) and
you might find this article about [participating in the Linux community on the
Linux Foundation
website](http://www.linuxfoundation.org/content/how-participate-linux-community-0)
to be a helpful resource.
### Code submission - What do I submit my changes against?
We've documented where we would like to have the different fixes applied at We've documented where we would like to have the different fixes applied at
https://github.com/FRRouting/frr/wiki/Where-Do-I-create-a-Pull-Request-against%3F https://github.com/FRRouting/frr/wiki/Where-Do-I-create-a-Pull-Request-against%3F
If you are unsure where your submission goes, look at that document or ask If you are unsure where your submission goes, look at that document or ask a
the question of a maintainer. project maintainer.
### Code submission - Github Pull Request (Strongly Preferred) ### Github pull requests
Preferred submission of code is by using a Github Pull Request against the The preferred method of submitting changes is a Github pull request. Code
Develop branch. Code submitted by Pull Request will have an email generated to submitted by pull request will be automatically tested by one or more CI
the PROJECT-devel mailing list for review and the submission will be systems. Once the automated tests succeed, other developers will review your
automatically tested by one or more CI systems. Only after this test succeeds code for quality and correctness. After any concerns are resolved, your code
(and the submission is based on the head of the develop branch), then it will will be merged into the branch it was submitted against.
be automatically merged into the develop branch. In case of failed tests, it is
up to the submitter to either amend the request with further commits or close,
fix and create a new pull request.
Further (manual) code review and discussion happens after the merge into the ### Patch submission via mailing list
develop branch.
As an alternative submission method, a patch can be mailed to the development
### Code submission - Mailing Patch to PROJECT-Devel list mailing list. Patches received on the mailing list will be picked up by
Patchwork and tested against the latest development branch.
As an alternative submission, a patch can be mailed to the PROJECT-Devel
mailing list. Preferred way to send the patch is using git send-mail. Patches
received on the mailing list will be picked up by Patchwork and tested against
the latest develop branch. After a further ACK by someone on the mailing list,
the patch is then merged into the develop branch.
Further (manual) code review and discussion happens after the merge into the
develop branch.
#### Sending patch to mailing list
The recommended way to send the patch (or series of NN patches) to the list is The recommended way to send the patch (or series of NN patches) to the list is
by using ‘git send-email’ as follows (assuming they are the most recent NN by using `git send-email` as follows (assuming they are the N most recent
commit(s) in your git history: commit(s) in your git history:
``` ```
git send-email -NN --annotate --to=XXX-Devel@XXX.org git send-email -NN --annotate --to=dev@lists.frrouting.org
``` ```
If your commits do not already contain a `Signed-off-by` line, then use the If your commits do not already contain a `Signed-off-by` line, then use the
following version to add it (after making sure to be able to agree to the following command to add it (after making sure you agree to the Developer
Developer Certificate of Origin as outlined above): Certificate of Origin as outlined above):
``` ```
git send-email -NN --annotate --signoff --to=XXX-Devel@XXX.org git send-email -NN --annotate --signoff --to=dev@lists.frrouting.org
``` ```
Submitting multi-commit patches as a Github Pull Request is strongly encouraged Submitting multi-commit patches as a Github pull request is **strongly
and will allow your changes to merge faster encouraged** and increases the probability of your patch getting reviewed and
merged in a timely manner.
## After submitting your changes ## After submitting your changes
@ -194,35 +195,34 @@ and will allow your changes to merge faster
less than 2 hrs of the submission. If you don’t get the email, then check less than 2 hrs of the submission. If you don’t get the email, then check
status on the github pull request (if submitted by pull request) or on status on the github pull request (if submitted by pull request) or on
Patchwork at Patchwork at
[https://patchwork.PROJECT.org](https://patchwork.PROJECT.org) (if [https://patchwork.frrouting.org](https://patchwork.frrouting.org) (if
submitted as patch to mailing list). submitted as patch to mailing list).
* Please notify PROJECT-Devel mailing list if you think something doesn’t * Please notify the development mailing list if you think something doesn’t
work work.
* If the tests failed: * If the tests failed:
* In general, expect the community to ignore the submission until the tests * In general, expect the community to ignore the submission until the tests
pass. pass.
* It is up to you to fix and resubmit. * It is up to you to fix and resubmit.
* This includes fixing existing dejagnu (“make test”) tests if your * This includes fixing existing unit (“make test”) tests if your
changes broke or changed them. changes broke or changed them.
* It also includes fixing distribution packages for the failing * It also includes fixing distribution packages for the failing
platforms (ie if new libraries are required) platforms (ie if new libraries are required).
* Feel free to ask for help on PROJECT-Devel list * Feel free to ask for help on the development list.
* Go back to the submission process and repeat until the tests pass. * Go back to the submission process and repeat until the tests pass.
* If the tests pass: * If the tests pass:
* If the changes are done as a pull request, then they should be * Wait for reviewers. Someone will review your code or be assigned to
automatically merged to the develop branch. review your code.
* Changes sent to mailing list require a manual ACK to be merged and should * Respond to any comments or concerns the reviewer has.
be merged within 2 weeks. If you don’t see the merge or any * After all comments and concerns are addressed, expect your patch to be
reason/discussion on PROJECT-Devel, then please ask. merged.
* Watch out for questions on the mailing list. At this time there will be a * Watch out for questions on the mailing list. At this time there will be a
manual code review and further (longer) tests by various community members. manual code review and further (longer) tests by various community members.
* Your submission is done once it is merged to the master branch. (which should * Your submission is done once it is merged to the master branch.
happen every few weeks from the develop branch)
## Code Styling requirements ## Developer's Guidelines
### File header required for new files added ### Source file header
New files need to have a Copyright header (see [License for New files need to have a Copyright header (see [License for
contributions](#license-for-contributions) above) added to the file. Preferred contributions](#license-for-contributions) above) added to the file. Preferred
@ -251,7 +251,7 @@ form of the header is as follows:
#include <zebra.h> #include <zebra.h>
``` ```
### Adding Copyright claims to already existing file ### Adding copyright claims to existing files
When adding copyright claims for modifications to an existing file, please When adding copyright claims for modifications to an existing file, please
preface the claim with "Portions: " on a line before it and indent the preface the claim with "Portions: " on a line before it and indent the
@ -264,95 +264,147 @@ Portions:
Copyright (C) 2016 Your name [optional brief change description] Copyright (C) 2016 Your name [optional brief change description]
``` ```
### Code styling / format ### Code formatting
Coding style standards in FRR vary depending on location. Pre-existing FRR uses Linux kernel style except where noted below. Code which does not
code uses GNU coding standards. New code may use Linux kernel coding style. comply with these style guidelines will not be accepted.
GNU coding style apply to the following parts: To assist with compliance, in the project root there is a .clang-format
configuration file which can be used with the `clang-format` tool from the LLVM
* lib/ project. In the `tools/` directory there is a Python script named `indent.py`
* zebra/ that wraps clang-format and handles some edge cases specific to FRR. If you are
* bgpd/ submitting a new file, it is recommended to run that script over the new file
* ospfd/ after ensuring that the latest stable release of `clang-format` is in your
* ospf6d/ PATH.
* isisd/
* ripd/
* ripngd/
* vtysh/
Linux kernel coding style applies to:
* nhrpd/
* watchfrr/
* pimd/
* lib/{checksum,hook,imsg-buffer,imsg,libfrr,md5,module,monotime,queue}.[ch]
BSD coding style applies to:
* ldpd/
**Whitespace changes in untouched parts of the code are not acceptable in **Whitespace changes in untouched parts of the code are not acceptable in
patches that change actual code.** To change/fix formatting issues, please patches that change actual code.** To change/fix formatting issues, please
create a separate patch that only does formatting changes and nothing else. create a separate patch that only does formatting changes and nothing else.
It is acceptable to rewrap entire files to Linux kernel style, but this #### Style documentation
**MUST** come as a separate patch that does nothing other than this Kernel and BSD styles are documented externally:
reformatting.
* [https://www.kernel.org/doc/html/latest/process/coding-style.html](https://www.kernel.org/doc/html/latest/process/coding-style.html)
* [http://man.openbsd.org/style](http://man.openbsd.org/style)
#### GNU style For GNU coding style, use `indent` with the following invocation:
For GNU coding style, Indentation follows the result of invoking GNU indent:
``` ```
indent -nut -nfc1 file_for_submission.c indent -nut -nfc1 file_for_submission.c
``` ```
Originally, tabs were used instead of spaces, with tabs are every 8 columns. #### Exceptions
However, tab interoperability issues mean space characters are now preferred for
new changes. We generally only clean up whitespace when code is unmaintainable FRR project code comes from a variety of sources, so there are some stylistic
due to whitespace issues, to minimise merging conflicts. exceptions in place. They are organized here by branch.
**For `master`:**
BSD coding style applies to:
* `ldpd/`
`babeld` uses, approximately, the following style:
* K&R style braces
* Indents are 4 spaces
* Function return types are on their own line
#### Linux kernel & BSD style **For `stable/3.0` and `stable/2.0`:**
These styles are documented externally: GNU coding style apply to the following parts:
* [https://www.kernel.org/doc/Documentation/CodingStyle](https://www.kernel.org/doc/Documentation/CodingStyle). * `lib/`
* [http://man.openbsd.org/style](http://man.openbsd.org/style) * `zebra/`
* `bgpd/`
* `ospfd/`
* `ospf6d/`
* `isisd/`
* `ripd/`
* `ripngd/`
* `vtysh/`
They are relatively similar but differ in details. BSD coding style applies to:
pimd deviates from Linux kernel style in using 2 spaces for indentation, with * `ldpd/`
Tabs replacing 8 spaces, as well as adding a line break between `}` and `else`.
It is acceptable to convert indentation in pimd/ to Linux kernel style, but
please convert an entire file at a time. (Rationale: apart from 2-space
indentation, the styles are sufficiently close to not upset when mixed.)
Unlike GNU style, these styles use tabs, not spaces.
### Compile-Time conditional code ### Documentation
Many users access PROJECT via binary packages from 3rd party sources; FRRouting is a large and complex software project developed by many different
compile-time code puts inclusion/exclusion in the hands of the package people over a long period of time. Without adequate documentation, it can be
maintainer. Please think very carefully before making code conditional at exceedingly difficult to understand code segments, APIs and other interfaces.
compile time, as it increases regression testing, maintenance burdens, and user In the interest of keeping the project healthy and maintainable, you should
confusion. In particular, please avoid gratuitous --enable-… switches to the make every effort to document your code so that other people can understand
configure script - typically code should be good enough to be in PROJECT, or it what it does without needing to closely read the code itself.
shouldn’t be there at all.
Some specific guidelines that contributors should follow are:
* Functions exposed in header files should have descriptive comments above
their signatures in the header file. At a minimum, a function comment should
contain information about the return value, parameters, and a general summary
of the function's purpose. Documentation on parameter values can be omitted
if it is (very) obvious what they are used for.
Function comments must follow the style for multiline comments laid out in
the kernel style guide.
Example:
```
/*
* Determines whether or not a string is cool.
*
* @param text - the string to check for coolness
* @param is_clccfc - whether capslock is cruise control for cool
* @return 7 if the text is cool, 0 otherwise
*/
int check_coolness(const char *text, bool is_clccfc);
```
The Javadoc-style annotations are not required, but you should still strive to
make it equally clear what parameters and return values are used for.
* Static functions should have descriptive comments in the same form as above
if what they do is not immediately obvious. Use good engineering judgement
when deciding whether a comment is necessary. If you are unsure, document
your code.
* Global variables, static or not, should have a comment describing their use.
* **For new code in `lib/`, these guidelines are hard requirements.**
If you are contributing code that adds significant user-visible functionality
or introduces a new API, please document it in `doc/`. Markdown and LaTeX are
acceptable formats, although Markdown is currently preferred for new
documentation. This may change in the near future.
Finally, if you come across some code that is undocumented and feel like going
above and beyond, document it! We absolutely appreciate and accept patches that
document previously undocumented code.
### Compile-time conditional code
Many users access FRR via binary packages from 3rd party sources; compile-time
code puts inclusion/exclusion in the hands of the package maintainer. Please
think very carefully before making code conditional at compile time, as it
increases regression testing, maintenance burdens, and user confusion. In
particular, please avoid gratuitous `--enable-…` switches to the configure
script - in general, code should be of high quality and in working condition,
or it shouldn’t be in FRR at all.
When code must be compile-time conditional, try have the compiler make it When code must be compile-time conditional, try have the compiler make it
conditional rather than the C pre-processor - so that it will still be checked conditional rather than the C pre-processor so that it will still be checked by
by the compiler, even if disabled. I.e. this: the compiler, even if disabled. For example,
``` ```
if (SOME_SYMBOL) if (SOME_SYMBOL)
frobnicate(); frobnicate();
``` ```
rather than is preferred to
``` ```
#ifdef SOME_SYMBOL #ifdef SOME_SYMBOL
@ -363,53 +415,55 @@ frobnicate ();
Note that the former approach requires ensuring that `SOME_SYMBOL` will be Note that the former approach requires ensuring that `SOME_SYMBOL` will be
defined (watch your `AC_DEFINE`s). defined (watch your `AC_DEFINE`s).
### Debug-Guards in code ### Debug-guards in code
Debugs are an important methodology to allow developers to fix issues Debugging statements are an important methodology to allow developers to fix
found in the code after it has been released. The caveat here is issues found in the code after it has been released. The caveat here is that
that the developer must remember that people will be using the code the developer must remember that people will be using the code at scale and in
at scale and in ways that can be unexpected for the original implementor. ways that can be unexpected for the original implementor. As such debugs
As such debugs MUST be guarded in such a way that they can be turned off. **MUST** be guarded in such a way that they can be turned off. FRR has the
This PROJECT has the ability to turn on/off debugs from the CLI and it is ability to turn on/off debugs from the CLI and it is expected that the
expected that the developer will use this convention to allow control developer will use this convention to allow control of their debugs.
of their debugs.
### CLI-Changes ### CLI changes
CLI's are a complicated ugly beast. Additions or changes to the CLI CLI's are a complicated ugly beast. Additions or changes to the CLI should use
should use a DEFUN to encapsulate one setting as much as is possible. a DEFUN to encapsulate one setting as much as is possible. Additionally as new
Additionally as new DEFUN's are added to the system, documentation DEFUN's are added to the system, documentation should be provided for the new
should be provided for the new commands. commands.
### Backwards Compatibility ### Backwards Compatibility
As a general principle, changes to CLI and code in the lib/ directory As a general principle, changes to CLI and code in the lib/ directory should be
should be made in a backwards compatible fashion. This means that made in a backwards compatible fashion. This means that changes that are purely
changes that are purely stylistic in nature should be avoided, e.g., stylistic in nature should be avoided, e.g., renaming an existing macro or
renaming an existing macro or library function name without any library function name without any functional change. When adding new parameters
functional change. When adding new parameters to common functions, it is to common functions, it is also good to consider if this too should be done in
also good to consider if this too should be done in a backward a backward compatible fashion, e.g., by preserving the old form in addition to
compatible fashion, e.g., by preserving the old form in addition to
adding the new form. adding the new form.
This is not to say that minor or even major functional changes to CLI This is not to say that minor or even major functional changes to CLI and
and common code should be avoided, but rather that the benefit gained common code should be avoided, but rather that the benefit gained from a change
from a change should be weighed against the added cost/complexity to should be weighed against the added cost/complexity to existing code. Also,
existing code. Also, that when making such changes, it is good to that when making such changes, it is good to preserve compatibility when
preserve compatibility when possible to do so without introducing possible to do so without introducing maintenance overhead/cost. It is also
maintenance overhead/cost. It is also important to keep in mind, important to keep in mind, existing code includes code that may reside in
existing code includes code that may reside in private repositories (and private repositories (and is yet to be submitted) or code that has yet to be
is yet to be submitted) or code that has yet to be migrated from Quagga migrated from Quagga to FRR.
to FRR.
That said, compatibility measures can (and should) be removed when either: That said, compatibility measures can (and should) be removed when either:
* they become a significant burden, e.g. when data structures change and * they become a significant burden, e.g. when data structures change and the
the compatibility measure would need a complex adaptation layer or becomes compatibility measure would need a complex adaptation layer or becomes
flat-out impossible flat-out impossible
* some measure of time (dependent on the specific case) has passed, so that * some measure of time (dependent on the specific case) has passed, so that the
the compatibility grace period is considered expired. compatibility grace period is considered expired.
In all cases, compatibility pieces should be marked with compiler/preprocessor In all cases, compatibility pieces should be marked with compiler/preprocessor
annotations to print warnings at compile time, pointing to the appropriate annotations to print warnings at compile time, pointing to the appropriate
update path. A `-Werror` build should fail if compatibility bits are used. update path. A `-Werror` build should fail if compatibility bits are used.
### Miscellaneous
When in doubt, follow the guidelines in the Linux kernel style guide, or ask on
the development mailing list / public Slack instance.

7
eigrpd/eigrp_main.c
View File

@ -50,7 +50,7 @@
#include "keychain.h" #include "keychain.h"
#include "distribute.h" #include "distribute.h"
#include "libfrr.h" #include "libfrr.h"
//#include "routemap.h" #include "routemap.h"
//#include "if_rmap.h" //#include "if_rmap.h"
#include "eigrpd/eigrp_structs.h" #include "eigrpd/eigrp_structs.h"
@ -192,6 +192,11 @@ int main(int argc, char **argv, char **envp)
prefix_list_add_hook(eigrp_distribute_update_all); prefix_list_add_hook(eigrp_distribute_update_all);
prefix_list_delete_hook(eigrp_distribute_update_all); prefix_list_delete_hook(eigrp_distribute_update_all);
/*
* XXX: This is just to get the CLI installed to suppress VTYSH errors.
* Routemaps in EIGRP are not yet functional.
*/
route_map_init();
/*eigrp_route_map_init(); /*eigrp_route_map_init();
route_map_add_hook (eigrp_rmap_update); route_map_add_hook (eigrp_rmap_update);
route_map_delete_hook (eigrp_rmap_update);*/ route_map_delete_hook (eigrp_rmap_update);*/

105
lib/imsg-buffer.c
View File

@ -21,13 +21,14 @@
#include "openbsd-queue.h" #include "openbsd-queue.h"
#include "imsg.h" #include "imsg.h"
int ibuf_realloc(struct ibuf *, size_t); int ibuf_realloc(struct ibuf *, size_t);
void ibuf_enqueue(struct msgbuf *, struct ibuf *); void ibuf_enqueue(struct msgbuf *, struct ibuf *);
void ibuf_dequeue(struct msgbuf *, struct ibuf *); void ibuf_dequeue(struct msgbuf *, struct ibuf *);
struct ibuf *ibuf_open(size_t len) struct ibuf *
ibuf_open(size_t len)
{ {
struct ibuf *buf; struct ibuf *buf;
if ((buf = calloc(1, sizeof(struct ibuf))) == NULL) if ((buf = calloc(1, sizeof(struct ibuf))) == NULL)
return (NULL); return (NULL);
@ -41,9 +42,10 @@ struct ibuf *ibuf_open(size_t len)
return (buf); return (buf);
} }
struct ibuf *ibuf_dynamic(size_t len, size_t max) struct ibuf *
ibuf_dynamic(size_t len, size_t max)
{ {
struct ibuf *buf; struct ibuf *buf;
if (max < len) if (max < len)
return (NULL); return (NULL);
@ -57,9 +59,10 @@ struct ibuf *ibuf_dynamic(size_t len, size_t max)
return (buf); return (buf);
} }
int ibuf_realloc(struct ibuf *buf, size_t len) int
ibuf_realloc(struct ibuf *buf, size_t len)
{ {
u_char *b; u_char *b;
/* on static buffers max is eq size and so the following fails */ /* on static buffers max is eq size and so the following fails */
if (buf->wpos + len > buf->max) { if (buf->wpos + len > buf->max) {
@ -76,7 +79,8 @@ int ibuf_realloc(struct ibuf *buf, size_t len)
return (0); return (0);
} }
int ibuf_add(struct ibuf *buf, const void *data, size_t len) int
ibuf_add(struct ibuf *buf, const void *data, size_t len)
{ {
if (buf->wpos + len > buf->size) if (buf->wpos + len > buf->size)
if (ibuf_realloc(buf, len) == -1) if (ibuf_realloc(buf, len) == -1)
@ -87,9 +91,10 @@ int ibuf_add(struct ibuf *buf, const void *data, size_t len)
return (0); return (0);
} }
void *ibuf_reserve(struct ibuf *buf, size_t len) void *
ibuf_reserve(struct ibuf *buf, size_t len)
{ {
void *b; void *b;
if (buf->wpos + len > buf->size) if (buf->wpos + len > buf->size)
if (ibuf_realloc(buf, len) == -1) if (ibuf_realloc(buf, len) == -1)
@ -100,7 +105,8 @@ void *ibuf_reserve(struct ibuf *buf, size_t len)
return (b); return (b);
} }
void *ibuf_seek(struct ibuf *buf, size_t pos, size_t len) void *
ibuf_seek(struct ibuf *buf, size_t pos, size_t len)
{ {
/* only allowed to seek in already written parts */ /* only allowed to seek in already written parts */
if (pos + len > buf->wpos) if (pos + len > buf->wpos)
@ -109,31 +115,34 @@ void *ibuf_seek(struct ibuf *buf, size_t pos, size_t len)
return (buf->buf + pos); return (buf->buf + pos);
} }
size_t ibuf_size(struct ibuf *buf) size_t
ibuf_size(struct ibuf *buf)
{ {
return (buf->wpos); return (buf->wpos);
} }
size_t ibuf_left(struct ibuf *buf) size_t
ibuf_left(struct ibuf *buf)
{ {
return (buf->max - buf->wpos); return (buf->max - buf->wpos);
} }
void ibuf_close(struct msgbuf *msgbuf, struct ibuf *buf) void
ibuf_close(struct msgbuf *msgbuf, struct ibuf *buf)
{ {
ibuf_enqueue(msgbuf, buf); ibuf_enqueue(msgbuf, buf);
} }
int ibuf_write(struct msgbuf *msgbuf) int
ibuf_write(struct msgbuf *msgbuf)
{ {
struct iovec iov[IOV_MAX]; struct iovec iov[IOV_MAX];
struct ibuf *buf; struct ibuf *buf;
unsigned int i = 0; unsigned int i = 0;
ssize_t n; ssize_t n;
memset(&iov, 0, sizeof(iov)); memset(&iov, 0, sizeof(iov));
TAILQ_FOREACH(buf, &msgbuf->bufs, entry) TAILQ_FOREACH(buf, &msgbuf->bufs, entry) {
{
if (i >= IOV_MAX) if (i >= IOV_MAX)
break; break;
iov[i].iov_base = buf->buf + buf->rpos; iov[i].iov_base = buf->buf + buf->rpos;
@ -150,7 +159,7 @@ again:
return (-1); return (-1);
} }
if (n == 0) { /* connection closed */ if (n == 0) { /* connection closed */
errno = 0; errno = 0;
return (0); return (0);
} }
@ -160,7 +169,8 @@ again:
return (1); return (1);
} }
void ibuf_free(struct ibuf *buf) void
ibuf_free(struct ibuf *buf)
{ {
if (buf == NULL) if (buf == NULL)
return; return;
@ -168,19 +178,21 @@ void ibuf_free(struct ibuf *buf)
free(buf); free(buf);
} }
void msgbuf_init(struct msgbuf *msgbuf) void
msgbuf_init(struct msgbuf *msgbuf)
{ {
msgbuf->queued = 0; msgbuf->queued = 0;
msgbuf->fd = -1; msgbuf->fd = -1;
TAILQ_INIT(&msgbuf->bufs); TAILQ_INIT(&msgbuf->bufs);
} }
void msgbuf_drain(struct msgbuf *msgbuf, size_t n) void
msgbuf_drain(struct msgbuf *msgbuf, size_t n)
{ {
struct ibuf *buf, *next; struct ibuf *buf, *next;
for (buf = TAILQ_FIRST(&msgbuf->bufs); buf != NULL && n > 0; for (buf = TAILQ_FIRST(&msgbuf->bufs); buf != NULL && n > 0;
buf = next) { buf = next) {
next = TAILQ_NEXT(buf, entry); next = TAILQ_NEXT(buf, entry);
if (buf->rpos + n >= buf->wpos) { if (buf->rpos + n >= buf->wpos) {
n -= buf->wpos - buf->rpos; n -= buf->wpos - buf->rpos;
@ -192,32 +204,33 @@ void msgbuf_drain(struct msgbuf *msgbuf, size_t n)
} }
} }
void msgbuf_clear(struct msgbuf *msgbuf) void
msgbuf_clear(struct msgbuf *msgbuf)
{ {
struct ibuf *buf; struct ibuf *buf;
while ((buf = TAILQ_FIRST(&msgbuf->bufs)) != NULL) while ((buf = TAILQ_FIRST(&msgbuf->bufs)) != NULL)
ibuf_dequeue(msgbuf, buf); ibuf_dequeue(msgbuf, buf);
} }
int msgbuf_write(struct msgbuf *msgbuf) int
msgbuf_write(struct msgbuf *msgbuf)
{ {
struct iovec iov[IOV_MAX]; struct iovec iov[IOV_MAX];
struct ibuf *buf; struct ibuf *buf;
unsigned int i = 0; unsigned int i = 0;
ssize_t n; ssize_t n;
struct msghdr msg; struct msghdr msg;
struct cmsghdr *cmsg; struct cmsghdr *cmsg;
union { union {
struct cmsghdr hdr; struct cmsghdr hdr;
char buf[CMSG_SPACE(sizeof(int))]; char buf[CMSG_SPACE(sizeof(int))];
} cmsgbuf; } cmsgbuf;
memset(&iov, 0, sizeof(iov)); memset(&iov, 0, sizeof(iov));
memset(&msg, 0, sizeof(msg)); memset(&msg, 0, sizeof(msg));
memset(&cmsgbuf, 0, sizeof(cmsgbuf)); memset(&cmsgbuf, 0, sizeof(cmsgbuf));
TAILQ_FOREACH(buf, &msgbuf->bufs, entry) TAILQ_FOREACH(buf, &msgbuf->bufs, entry) {
{
if (i >= IOV_MAX) if (i >= IOV_MAX)
break; break;
iov[i].iov_base = buf->buf + buf->rpos; iov[i].iov_base = buf->buf + buf->rpos;
@ -249,7 +262,7 @@ again:
return (-1); return (-1);
} }
if (n == 0) { /* connection closed */ if (n == 0) { /* connection closed */
errno = 0; errno = 0;
return (0); return (0);
} }
@ -268,13 +281,15 @@ again:
return (1); return (1);
} }
void ibuf_enqueue(struct msgbuf *msgbuf, struct ibuf *buf) void
ibuf_enqueue(struct msgbuf *msgbuf, struct ibuf *buf)
{ {
TAILQ_INSERT_TAIL(&msgbuf->bufs, buf, entry); TAILQ_INSERT_TAIL(&msgbuf->bufs, buf, entry);
msgbuf->queued++; msgbuf->queued++;
} }
void ibuf_dequeue(struct msgbuf *msgbuf, struct ibuf *buf) void
ibuf_dequeue(struct msgbuf *msgbuf, struct ibuf *buf)
{ {
TAILQ_REMOVE(&msgbuf->bufs, buf, entry); TAILQ_REMOVE(&msgbuf->bufs, buf, entry);

117
lib/imsg.c
View File

@ -21,21 +21,22 @@
#include "openbsd-queue.h" #include "openbsd-queue.h"
#include "imsg.h" #include "imsg.h"
int imsg_fd_overhead = 0; int imsg_fd_overhead = 0;
int imsg_get_fd(struct imsgbuf *); int imsg_get_fd(struct imsgbuf *);
#ifndef __OpenBSD__ #ifndef __OpenBSD__
/* /*
* The original code calls getdtablecount() which is OpenBSD specific. Use * The original code calls getdtablecount() which is OpenBSD specific. Use
* available_fds() from OpenSMTPD instead. * available_fds() from OpenSMTPD instead.
*/ */
static int available_fds(unsigned int n) static int
available_fds(unsigned int n)
{ {
unsigned int i; unsigned int i;
int ret, fds[256]; int ret, fds[256];
if (n > (sizeof(fds) / sizeof(fds[0]))) if (n > (sizeof(fds)/sizeof(fds[0])))
return (1); return (1);
ret = 0; ret = 0;
@ -58,7 +59,8 @@ static int available_fds(unsigned int n)
} }
#endif #endif
void imsg_init(struct imsgbuf *ibuf, int fd) void
imsg_init(struct imsgbuf *ibuf, int fd)
{ {
msgbuf_init(&ibuf->w); msgbuf_init(&ibuf->w);
memset(&ibuf->r, 0, sizeof(ibuf->r)); memset(&ibuf->r, 0, sizeof(ibuf->r));
@ -68,18 +70,19 @@ void imsg_init(struct imsgbuf *ibuf, int fd)
TAILQ_INIT(&ibuf->fds); TAILQ_INIT(&ibuf->fds);
} }
ssize_t imsg_read(struct imsgbuf *ibuf) ssize_t
imsg_read(struct imsgbuf *ibuf)
{ {
struct msghdr msg; struct msghdr msg;
struct cmsghdr *cmsg; struct cmsghdr *cmsg;
union { union {
struct cmsghdr hdr; struct cmsghdr hdr;
char buf[CMSG_SPACE(sizeof(int) * 1)]; char buf[CMSG_SPACE(sizeof(int) * 1)];
} cmsgbuf; } cmsgbuf;
struct iovec iov; struct iovec iov;
ssize_t n = -1; ssize_t n = -1;
int fd; int fd;
struct imsg_fd *ifd; struct imsg_fd *ifd;
memset(&msg, 0, sizeof(msg)); memset(&msg, 0, sizeof(msg));
memset(&cmsgbuf, 0, sizeof(cmsgbuf)); memset(&cmsgbuf, 0, sizeof(cmsgbuf));
@ -96,14 +99,12 @@ ssize_t imsg_read(struct imsgbuf *ibuf)
again: again:
#ifdef __OpenBSD__ #ifdef __OpenBSD__
if (getdtablecount() + imsg_fd_overhead if (getdtablecount() + imsg_fd_overhead +
+ (int)((CMSG_SPACE(sizeof(int)) - CMSG_SPACE(0)) (int)((CMSG_SPACE(sizeof(int))-CMSG_SPACE(0))/sizeof(int))
/ sizeof(int))
>= getdtablesize()) { >= getdtablesize()) {
#else #else
if (available_fds(imsg_fd_overhead if (available_fds(imsg_fd_overhead +
+ (CMSG_SPACE(sizeof(int)) - CMSG_SPACE(0)) (CMSG_SPACE(sizeof(int))-CMSG_SPACE(0))/sizeof(int))) {
/ sizeof(int))) {
#endif #endif
errno = EAGAIN; errno = EAGAIN;
free(ifd); free(ifd);
@ -119,9 +120,9 @@ again:
ibuf->r.wpos += n; ibuf->r.wpos += n;
for (cmsg = CMSG_FIRSTHDR(&msg); cmsg != NULL; for (cmsg = CMSG_FIRSTHDR(&msg); cmsg != NULL;
cmsg = CMSG_NXTHDR(&msg, cmsg)) { cmsg = CMSG_NXTHDR(&msg, cmsg)) {
if (cmsg->cmsg_level == SOL_SOCKET if (cmsg->cmsg_level == SOL_SOCKET &&
&& cmsg->cmsg_type == SCM_RIGHTS) { cmsg->cmsg_type == SCM_RIGHTS) {
int i; int i;
int j; int j;
@ -130,15 +131,14 @@ again:
* padding rules, our control buffer might contain * padding rules, our control buffer might contain
* more than one fd, and we must close them. * more than one fd, and we must close them.
*/ */
j = ((char *)cmsg + cmsg->cmsg_len j = ((char *)cmsg + cmsg->cmsg_len -
- (char *)CMSG_DATA(cmsg)) (char *)CMSG_DATA(cmsg)) / sizeof(int);
/ sizeof(int);
for (i = 0; i < j; i++) { for (i = 0; i < j; i++) {
fd = ((int *)CMSG_DATA(cmsg))[i]; fd = ((int *)CMSG_DATA(cmsg))[i];
if (ifd != NULL) { if (ifd != NULL) {
ifd->fd = fd; ifd->fd = fd;
TAILQ_INSERT_TAIL(&ibuf->fds, ifd, TAILQ_INSERT_TAIL(&ibuf->fds, ifd,
entry); entry);
ifd = NULL; ifd = NULL;
} else } else
close(fd); close(fd);
@ -152,9 +152,10 @@ fail:
return (n); return (n);
} }
ssize_t imsg_get(struct imsgbuf *ibuf, struct imsg *imsg) ssize_t
imsg_get(struct imsgbuf *ibuf, struct imsg *imsg)
{ {
size_t av, left, datalen; size_t av, left, datalen;
av = ibuf->r.wpos; av = ibuf->r.wpos;
@ -162,7 +163,8 @@ ssize_t imsg_get(struct imsgbuf *ibuf, struct imsg *imsg)
return (0); return (0);
memcpy(&imsg->hdr, ibuf->r.buf, sizeof(imsg->hdr)); memcpy(&imsg->hdr, ibuf->r.buf, sizeof(imsg->hdr));
if (imsg->hdr.len < IMSG_HEADER_SIZE || imsg->hdr.len > MAX_IMSGSIZE) { if (imsg->hdr.len < IMSG_HEADER_SIZE ||
imsg->hdr.len > MAX_IMSGSIZE) {
errno = ERANGE; errno = ERANGE;
return (-1); return (-1);
} }
@ -181,7 +183,7 @@ ssize_t imsg_get(struct imsgbuf *ibuf, struct imsg *imsg)
imsg->fd = -1; imsg->fd = -1;
if (imsg->data) if (imsg->data)
memcpy(imsg->data, ibuf->r.rptr, datalen); memcpy(imsg->data, ibuf->r.rptr, datalen);
if (imsg->hdr.len < av) { if (imsg->hdr.len < av) {
left = av - imsg->hdr.len; left = av - imsg->hdr.len;
@ -193,10 +195,11 @@ ssize_t imsg_get(struct imsgbuf *ibuf, struct imsg *imsg)
return (datalen + IMSG_HEADER_SIZE); return (datalen + IMSG_HEADER_SIZE);
} }
int imsg_compose(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid, int
pid_t pid, int fd, const void *data, u_int16_t datalen) imsg_compose(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid,
pid_t pid, int fd, const void *data, u_int16_t datalen)
{ {
struct ibuf *wbuf; struct ibuf *wbuf;
if ((wbuf = imsg_create(ibuf, type, peerid, pid, datalen)) == NULL) if ((wbuf = imsg_create(ibuf, type, peerid, pid, datalen)) == NULL)
return (-1); return (-1);
@ -211,11 +214,12 @@ int imsg_compose(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid,
return (1); return (1);
} }
int imsg_composev(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid, int
pid_t pid, int fd, const struct iovec *iov, int iovcnt) imsg_composev(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid,
pid_t pid, int fd, const struct iovec *iov, int iovcnt)
{ {
struct ibuf *wbuf; struct ibuf *wbuf;
int i, datalen = 0; int i, datalen = 0;
for (i = 0; i < iovcnt; i++) for (i = 0; i < iovcnt; i++)
datalen += iov[i].iov_len; datalen += iov[i].iov_len;
@ -235,11 +239,12 @@ int imsg_composev(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid,
} }
/* ARGSUSED */ /* ARGSUSED */
struct ibuf *imsg_create(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid, struct ibuf *
pid_t pid, u_int16_t datalen) imsg_create(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid,
pid_t pid, u_int16_t datalen)
{ {
struct ibuf *wbuf; struct ibuf *wbuf;
struct imsg_hdr hdr; struct imsg_hdr hdr;
datalen += IMSG_HEADER_SIZE; datalen += IMSG_HEADER_SIZE;
if (datalen > MAX_IMSGSIZE) { if (datalen > MAX_IMSGSIZE) {
@ -261,7 +266,8 @@ struct ibuf *imsg_create(struct imsgbuf *ibuf, u_int32_t type, u_int32_t peerid,
return (wbuf); return (wbuf);
} }
int imsg_add(struct ibuf *msg, const void *data, u_int16_t datalen) int
imsg_add(struct ibuf *msg, const void *data, u_int16_t datalen)
{ {
if (datalen) if (datalen)
if (ibuf_add(msg, data, datalen) == -1) { if (ibuf_add(msg, data, datalen) == -1) {
@ -271,9 +277,10 @@ int imsg_add(struct ibuf *msg, const void *data, u_int16_t datalen)
return (datalen); return (datalen);
} }
void imsg_close(struct imsgbuf *ibuf, struct ibuf *msg) void
imsg_close(struct imsgbuf *ibuf, struct ibuf *msg)
{ {
struct imsg_hdr *hdr; struct imsg_hdr *hdr;
hdr = (struct imsg_hdr *)msg->buf; hdr = (struct imsg_hdr *)msg->buf;
@ -286,15 +293,17 @@ void imsg_close(struct imsgbuf *ibuf, struct ibuf *msg)
ibuf_close(&ibuf->w, msg); ibuf_close(&ibuf->w, msg);
} }
void imsg_free(struct imsg *imsg) void
imsg_free(struct imsg *imsg)
{ {
free(imsg->data); free(imsg->data);
} }
int imsg_get_fd(struct imsgbuf *ibuf) int
imsg_get_fd(struct imsgbuf *ibuf)
{ {
int fd; int fd;
struct imsg_fd *ifd; struct imsg_fd *ifd;
if ((ifd = TAILQ_FIRST(&ibuf->fds)) == NULL) if ((ifd = TAILQ_FIRST(&ibuf->fds)) == NULL)
return (-1); return (-1);
@ -306,7 +315,8 @@ int imsg_get_fd(struct imsgbuf *ibuf)
return (fd); return (fd);
} }
int imsg_flush(struct imsgbuf *ibuf) int
imsg_flush(struct imsgbuf *ibuf)
{ {
while (ibuf->w.queued) while (ibuf->w.queued)
if (msgbuf_write(&ibuf->w) <= 0) if (msgbuf_write(&ibuf->w) <= 0)
@ -314,9 +324,10 @@ int imsg_flush(struct imsgbuf *ibuf)
return (0); return (0);
} }
void imsg_clear(struct imsgbuf *ibuf) void
imsg_clear(struct imsgbuf *ibuf)
{ {
int fd; int fd;
msgbuf_clear(&ibuf->w); msgbuf_clear(&ibuf->w);
while ((fd = imsg_get_fd(ibuf)) != -1) while ((fd = imsg_get_fd(ibuf)) != -1)

110
lib/imsg.h
View File

@ -26,87 +26,87 @@
#define MAX_IMSGSIZE 16384 #define MAX_IMSGSIZE 16384
struct ibuf { struct ibuf {
TAILQ_ENTRY(ibuf) entry; TAILQ_ENTRY(ibuf) entry;
u_char *buf; u_char *buf;
size_t size; size_t size;
size_t max; size_t max;
size_t wpos; size_t wpos;
size_t rpos; size_t rpos;
int fd; int fd;
}; };
struct msgbuf { struct msgbuf {
TAILQ_HEAD(, ibuf) bufs; TAILQ_HEAD(, ibuf) bufs;
u_int32_t queued; u_int32_t queued;
int fd; int fd;
}; };
struct ibuf_read { struct ibuf_read {
u_char buf[IBUF_READ_SIZE]; u_char buf[IBUF_READ_SIZE];
u_char *rptr; u_char *rptr;
size_t wpos; size_t wpos;
}; };
struct imsg_fd { struct imsg_fd {
TAILQ_ENTRY(imsg_fd) entry; TAILQ_ENTRY(imsg_fd) entry;
int fd; int fd;
}; };
struct imsgbuf { struct imsgbuf {
TAILQ_HEAD(, imsg_fd) fds; TAILQ_HEAD(, imsg_fd) fds;
struct ibuf_read r; struct ibuf_read r;
struct msgbuf w; struct msgbuf w;
int fd; int fd;
pid_t pid; pid_t pid;
}; };
#define IMSGF_HASFD 1 #define IMSGF_HASFD 1
struct imsg_hdr { struct imsg_hdr {
u_int32_t type; u_int32_t type;
u_int16_t len; u_int16_t len;
u_int16_t flags; u_int16_t flags;
u_int32_t peerid; u_int32_t peerid;
u_int32_t pid; u_int32_t pid;
}; };
struct imsg { struct imsg {
struct imsg_hdr hdr; struct imsg_hdr hdr;
int fd; int fd;
void *data; void *data;
}; };
/* buffer.c */ /* buffer.c */
struct ibuf *ibuf_open(size_t); struct ibuf *ibuf_open(size_t);
struct ibuf *ibuf_dynamic(size_t, size_t); struct ibuf *ibuf_dynamic(size_t, size_t);
int ibuf_add(struct ibuf *, const void *, size_t); int ibuf_add(struct ibuf *, const void *, size_t);
void *ibuf_reserve(struct ibuf *, size_t); void *ibuf_reserve(struct ibuf *, size_t);
void *ibuf_seek(struct ibuf *, size_t, size_t); void *ibuf_seek(struct ibuf *, size_t, size_t);
size_t ibuf_size(struct ibuf *); size_t ibuf_size(struct ibuf *);
size_t ibuf_left(struct ibuf *); size_t ibuf_left(struct ibuf *);
void ibuf_close(struct msgbuf *, struct ibuf *); void ibuf_close(struct msgbuf *, struct ibuf *);
int ibuf_write(struct msgbuf *); int ibuf_write(struct msgbuf *);
void ibuf_free(struct ibuf *); void ibuf_free(struct ibuf *);
void msgbuf_init(struct msgbuf *); void msgbuf_init(struct msgbuf *);
void msgbuf_clear(struct msgbuf *); void msgbuf_clear(struct msgbuf *);
int msgbuf_write(struct msgbuf *); int msgbuf_write(struct msgbuf *);
void msgbuf_drain(struct msgbuf *, size_t); void msgbuf_drain(struct msgbuf *, size_t);
/* imsg.c */ /* imsg.c */
void imsg_init(struct imsgbuf *, int); void imsg_init(struct imsgbuf *, int);
ssize_t imsg_read(struct imsgbuf *); ssize_t imsg_read(struct imsgbuf *);
ssize_t imsg_get(struct imsgbuf *, struct imsg *); ssize_t imsg_get(struct imsgbuf *, struct imsg *);
int imsg_compose(struct imsgbuf *, u_int32_t, u_int32_t, pid_t, int, int imsg_compose(struct imsgbuf *, u_int32_t, u_int32_t, pid_t,
const void *, u_int16_t); int, const void *, u_int16_t);
int imsg_composev(struct imsgbuf *, u_int32_t, u_int32_t, pid_t, int, int imsg_composev(struct imsgbuf *, u_int32_t, u_int32_t, pid_t,
const struct iovec *, int); int, const struct iovec *, int);
struct ibuf *imsg_create(struct imsgbuf *, u_int32_t, u_int32_t, pid_t, struct ibuf *imsg_create(struct imsgbuf *, u_int32_t, u_int32_t, pid_t,
u_int16_t); u_int16_t);
int imsg_add(struct ibuf *, const void *, u_int16_t); int imsg_add(struct ibuf *, const void *, u_int16_t);
void imsg_close(struct imsgbuf *, struct ibuf *); void imsg_close(struct imsgbuf *, struct ibuf *);
void imsg_free(struct imsg *); void imsg_free(struct imsg *);
int imsg_flush(struct imsgbuf *); int imsg_flush(struct imsgbuf *);
void imsg_clear(struct imsgbuf *); void imsg_clear(struct imsgbuf *);
#endif #endif

20
lib/nexthop.c
View File

@ -133,17 +133,17 @@ void copy_nexthops(struct nexthop **tnh, struct nexthop *nh,
for (nh1 = nh; nh1; nh1 = nh1->next) { for (nh1 = nh; nh1; nh1 = nh1->next) {
nexthop = nexthop_new(); nexthop = nexthop_new();
nexthop->ifindex = nh->ifindex; nexthop->ifindex = nh1->ifindex;
nexthop->type = nh->type; nexthop->type = nh1->type;
nexthop->flags = nh->flags; nexthop->flags = nh1->flags;
memcpy(&nexthop->gate, &nh->gate, sizeof(nh->gate)); memcpy(&nexthop->gate, &nh1->gate, sizeof(nh1->gate));
memcpy(&nexthop->src, &nh->src, sizeof(nh->src)); memcpy(&nexthop->src, &nh1->src, sizeof(nh1->src));
memcpy(&nexthop->rmap_src, &nh->rmap_src, sizeof(nh->rmap_src)); memcpy(&nexthop->rmap_src, &nh1->rmap_src, sizeof(nh1->rmap_src));
nexthop->rparent = rparent; nexthop->rparent = rparent;
if (nh->nh_label) if (nh1->nh_label)
nexthop_add_labels(nexthop, nh->nh_label_type, nexthop_add_labels(nexthop, nh1->nh_label_type,
nh->nh_label->num_labels, nh1->nh_label->num_labels,
&nh->nh_label->label[0]); &nh1->nh_label->label[0]);
nexthop_add(tnh, nexthop); nexthop_add(tnh, nexthop);
if (CHECK_FLAG(nh1->flags, NEXTHOP_FLAG_RECURSIVE)) if (CHECK_FLAG(nh1->flags, NEXTHOP_FLAG_RECURSIVE))

150
lib/openbsd-tree.c
View File

@ -45,14 +45,16 @@
#include <lib/openbsd-tree.h> #include <lib/openbsd-tree.h>
static inline struct rb_entry *rb_n2e(const struct rb_type *t, void *node) static inline struct rb_entry *
rb_n2e(const struct rb_type *t, void *node)
{ {
unsigned long addr = (unsigned long)node; unsigned long addr = (unsigned long)node;
return ((struct rb_entry *)(addr + t->t_offset)); return ((struct rb_entry *)(addr + t->t_offset));
} }
static inline void *rb_e2n(const struct rb_type *t, struct rb_entry *rbe) static inline void *
rb_e2n(const struct rb_type *t, struct rb_entry *rbe)
{ {
unsigned long addr = (unsigned long)rbe; unsigned long addr = (unsigned long)rbe;
@ -66,33 +68,37 @@ static inline void *rb_e2n(const struct rb_type *t, struct rb_entry *rbe)
#define RBH_ROOT(_rbt) (_rbt)->rbt_root #define RBH_ROOT(_rbt) (_rbt)->rbt_root
static inline void rbe_set(struct rb_entry *rbe, struct rb_entry *parent) static inline void
rbe_set(struct rb_entry *rbe, struct rb_entry *parent)
{ {
RBE_PARENT(rbe) = parent; RBE_PARENT(rbe) = parent;
RBE_LEFT(rbe) = RBE_RIGHT(rbe) = NULL; RBE_LEFT(rbe) = RBE_RIGHT(rbe) = NULL;
RBE_COLOR(rbe) = RB_RED; RBE_COLOR(rbe) = RB_RED;
} }
static inline void rbe_set_blackred(struct rb_entry *black, static inline void
struct rb_entry *red) rbe_set_blackred(struct rb_entry *black, struct rb_entry *red)
{ {
RBE_COLOR(black) = RB_BLACK; RBE_COLOR(black) = RB_BLACK;
RBE_COLOR(red) = RB_RED; RBE_COLOR(red) = RB_RED;
} }
static inline void rbe_augment(const struct rb_type *t, struct rb_entry *rbe) static inline void
rbe_augment(const struct rb_type *t, struct rb_entry *rbe)
{ {
(*t->t_augment)(rb_e2n(t, rbe)); (*t->t_augment)(rb_e2n(t, rbe));
} }
static inline void rbe_if_augment(const struct rb_type *t, struct rb_entry *rbe) static inline void
rbe_if_augment(const struct rb_type *t, struct rb_entry *rbe)
{ {
if (t->t_augment != NULL) if (t->t_augment != NULL)
rbe_augment(t, rbe); rbe_augment(t, rbe);
} }
static inline void rbe_rotate_left(const struct rb_type *t, static inline void
struct rbt_tree *rbt, struct rb_entry *rbe) rbe_rotate_left(const struct rb_type *t, struct rbt_tree *rbt,
struct rb_entry *rbe)
{ {
struct rb_entry *parent; struct rb_entry *parent;
struct rb_entry *tmp; struct rb_entry *tmp;
@ -124,8 +130,9 @@ static inline void rbe_rotate_left(const struct rb_type *t,
} }
} }
static inline void rbe_rotate_right(const struct rb_type *t, static inline void
struct rbt_tree *rbt, struct rb_entry *rbe) rbe_rotate_right(const struct rb_type *t, struct rbt_tree *rbt,
struct rb_entry *rbe)
{ {
struct rb_entry *parent; struct rb_entry *parent;
struct rb_entry *tmp; struct rb_entry *tmp;
@ -157,13 +164,14 @@ static inline void rbe_rotate_right(const struct rb_type *t,
} }
} }
static inline void rbe_insert_color(const struct rb_type *t, static inline void
struct rbt_tree *rbt, struct rb_entry *rbe) rbe_insert_color(const struct rb_type *t, struct rbt_tree *rbt,
struct rb_entry *rbe)
{ {
struct rb_entry *parent, *gparent, *tmp; struct rb_entry *parent, *gparent, *tmp;
while ((parent = RBE_PARENT(rbe)) != NULL while ((parent = RBE_PARENT(rbe)) != NULL &&
&& RBE_COLOR(parent) == RB_RED) { RBE_COLOR(parent) == RB_RED) {
gparent = RBE_PARENT(parent); gparent = RBE_PARENT(parent);
if (parent == RBE_LEFT(gparent)) { if (parent == RBE_LEFT(gparent)) {
@ -208,19 +216,14 @@ static inline void rbe_insert_color(const struct rb_type *t,
RBE_COLOR(RBH_ROOT(rbt)) = RB_BLACK; RBE_COLOR(RBH_ROOT(rbt)) = RB_BLACK;
} }
static inline void rbe_remove_color(const struct rb_type *t, static inline void
struct rbt_tree *rbt, rbe_remove_color(const struct rb_type *t, struct rbt_tree *rbt,
struct rb_entry *parent, struct rb_entry *parent, struct rb_entry *rbe)
struct rb_entry *rbe)
{ {
struct rb_entry *tmp; struct rb_entry *tmp;
/* Silence clang possible NULL deference warning. */ while ((rbe == NULL || RBE_COLOR(rbe) == RB_BLACK) &&
if (parent == NULL) rbe != RBH_ROOT(rbt) && parent) {
return;
while ((rbe == NULL || RBE_COLOR(rbe) == RB_BLACK)
&& rbe != RBH_ROOT(rbt)) {
if (RBE_LEFT(parent) == rbe) { if (RBE_LEFT(parent) == rbe) {
tmp = RBE_RIGHT(parent); tmp = RBE_RIGHT(parent);
if (RBE_COLOR(tmp) == RB_RED) { if (RBE_COLOR(tmp) == RB_RED) {
@ -228,16 +231,16 @@ static inline void rbe_remove_color(const struct rb_type *t,
rbe_rotate_left(t, rbt, parent); rbe_rotate_left(t, rbt, parent);
tmp = RBE_RIGHT(parent); tmp = RBE_RIGHT(parent);
} }
if ((RBE_LEFT(tmp) == NULL if ((RBE_LEFT(tmp) == NULL ||
|| RBE_COLOR(RBE_LEFT(tmp)) == RB_BLACK) RBE_COLOR(RBE_LEFT(tmp)) == RB_BLACK) &&
&& (RBE_RIGHT(tmp) == NULL (RBE_RIGHT(tmp) == NULL ||
|| RBE_COLOR(RBE_RIGHT(tmp)) == RB_BLACK)) { RBE_COLOR(RBE_RIGHT(tmp)) == RB_BLACK)) {
RBE_COLOR(tmp) = RB_RED; RBE_COLOR(tmp) = RB_RED;
rbe = parent; rbe = parent;
parent = RBE_PARENT(rbe); parent = RBE_PARENT(rbe);
} else { } else {
if (RBE_RIGHT(tmp) == NULL if (RBE_RIGHT(tmp) == NULL ||
|| RBE_COLOR(RBE_RIGHT(tmp)) == RB_BLACK) { RBE_COLOR(RBE_RIGHT(tmp)) == RB_BLACK) {
struct rb_entry *oleft; struct rb_entry *oleft;
oleft = RBE_LEFT(tmp); oleft = RBE_LEFT(tmp);
@ -266,16 +269,16 @@ static inline void rbe_remove_color(const struct rb_type *t,
tmp = RBE_LEFT(parent); tmp = RBE_LEFT(parent);
} }
if ((RBE_LEFT(tmp) == NULL if ((RBE_LEFT(tmp) == NULL ||
|| RBE_COLOR(RBE_LEFT(tmp)) == RB_BLACK) RBE_COLOR(RBE_LEFT(tmp)) == RB_BLACK) &&
&& (RBE_RIGHT(tmp) == NULL (RBE_RIGHT(tmp) == NULL ||
|| RBE_COLOR(RBE_RIGHT(tmp)) == RB_BLACK)) { RBE_COLOR(RBE_RIGHT(tmp)) == RB_BLACK)) {
RBE_COLOR(tmp) = RB_RED; RBE_COLOR(tmp) = RB_RED;
rbe = parent; rbe = parent;
parent = RBE_PARENT(rbe); parent = RBE_PARENT(rbe);
} else { } else {
if (RBE_LEFT(tmp) == NULL if (RBE_LEFT(tmp) == NULL ||
|| RBE_COLOR(RBE_LEFT(tmp)) == RB_BLACK) { RBE_COLOR(RBE_LEFT(tmp)) == RB_BLACK) {
struct rb_entry *oright; struct rb_entry *oright;
oright = RBE_RIGHT(tmp); oright = RBE_RIGHT(tmp);
@ -385,7 +388,8 @@ color:
return (old); return (old);
} }
void *_rb_remove(const struct rb_type *t, struct rbt_tree *rbt, void *elm) void *
_rb_remove(const struct rb_type *t, struct rbt_tree *rbt, void *elm)
{ {
struct rb_entry *rbe = rb_n2e(t, elm); struct rb_entry *rbe = rb_n2e(t, elm);
struct rb_entry *old; struct rb_entry *old;
@ -395,7 +399,8 @@ void *_rb_remove(const struct rb_type *t, struct rbt_tree *rbt, void *elm)
return (old == NULL ? NULL : rb_e2n(t, old)); return (old == NULL ? NULL : rb_e2n(t, old));
} }
void *_rb_insert(const struct rb_type *t, struct rbt_tree *rbt, void *elm) void *
_rb_insert(const struct rb_type *t, struct rbt_tree *rbt, void *elm)
{ {
struct rb_entry *rbe = rb_n2e(t, elm); struct rb_entry *rbe = rb_n2e(t, elm);
struct rb_entry *tmp; struct rb_entry *tmp;
@ -435,7 +440,8 @@ void *_rb_insert(const struct rb_type *t, struct rbt_tree *rbt, void *elm)
} }
/* Finds the node with the same key as elm */ /* Finds the node with the same key as elm */
void *_rb_find(const struct rb_type *t, struct rbt_tree *rbt, const void *key) void *
_rb_find(const struct rb_type *t, struct rbt_tree *rbt, const void *key)
{ {
struct rb_entry *tmp = RBH_ROOT(rbt); struct rb_entry *tmp = RBH_ROOT(rbt);
void *node; void *node;
@ -456,7 +462,8 @@ void *_rb_find(const struct rb_type *t, struct rbt_tree *rbt, const void *key)
} }
/* Finds the first node greater than or equal to the search key */ /* Finds the first node greater than or equal to the search key */
void *_rb_nfind(const struct rb_type *t, struct rbt_tree *rbt, const void *key) void *
_rb_nfind(const struct rb_type *t, struct rbt_tree *rbt, const void *key)
{ {
struct rb_entry *tmp = RBH_ROOT(rbt); struct rb_entry *tmp = RBH_ROOT(rbt);
void *node; void *node;
@ -478,7 +485,8 @@ void *_rb_nfind(const struct rb_type *t, struct rbt_tree *rbt, const void *key)
return (res); return (res);
} }
void *_rb_next(const struct rb_type *t, void *elm) void *
_rb_next(const struct rb_type *t, void *elm)
{ {
struct rb_entry *rbe = rb_n2e(t, elm); struct rb_entry *rbe = rb_n2e(t, elm);
@ -487,11 +495,12 @@ void *_rb_next(const struct rb_type *t, void *elm)
while (RBE_LEFT(rbe) != NULL) while (RBE_LEFT(rbe) != NULL)
rbe = RBE_LEFT(rbe); rbe = RBE_LEFT(rbe);
} else { } else {
if (RBE_PARENT(rbe) && (rbe == RBE_LEFT(RBE_PARENT(rbe)))) if (RBE_PARENT(rbe) &&
(rbe == RBE_LEFT(RBE_PARENT(rbe))))
rbe = RBE_PARENT(rbe); rbe = RBE_PARENT(rbe);
else { else {
while (RBE_PARENT(rbe) while (RBE_PARENT(rbe) &&
&& (rbe == RBE_RIGHT(RBE_PARENT(rbe)))) (rbe == RBE_RIGHT(RBE_PARENT(rbe))))
rbe = RBE_PARENT(rbe); rbe = RBE_PARENT(rbe);
rbe = RBE_PARENT(rbe); rbe = RBE_PARENT(rbe);
} }
@ -500,7 +509,8 @@ void *_rb_next(const struct rb_type *t, void *elm)
return (rbe == NULL ? NULL : rb_e2n(t, rbe)); return (rbe == NULL ? NULL : rb_e2n(t, rbe));
} }
void *_rb_prev(const struct rb_type *t, void *elm) void *
_rb_prev(const struct rb_type *t, void *elm)
{ {
struct rb_entry *rbe = rb_n2e(t, elm); struct rb_entry *rbe = rb_n2e(t, elm);
@ -509,11 +519,12 @@ void *_rb_prev(const struct rb_type *t, void *elm)
while (RBE_RIGHT(rbe)) while (RBE_RIGHT(rbe))
rbe = RBE_RIGHT(rbe); rbe = RBE_RIGHT(rbe);
} else { } else {
if (RBE_PARENT(rbe) && (rbe == RBE_RIGHT(RBE_PARENT(rbe)))) if (RBE_PARENT(rbe) &&
(rbe == RBE_RIGHT(RBE_PARENT(rbe))))
rbe = RBE_PARENT(rbe); rbe = RBE_PARENT(rbe);
else { else {
while (RBE_PARENT(rbe) while (RBE_PARENT(rbe) &&
&& (rbe == RBE_LEFT(RBE_PARENT(rbe)))) (rbe == RBE_LEFT(RBE_PARENT(rbe))))
rbe = RBE_PARENT(rbe); rbe = RBE_PARENT(rbe);
rbe = RBE_PARENT(rbe); rbe = RBE_PARENT(rbe);
} }
@ -522,14 +533,16 @@ void *_rb_prev(const struct rb_type *t, void *elm)
return (rbe == NULL ? NULL : rb_e2n(t, rbe)); return (rbe == NULL ? NULL : rb_e2n(t, rbe));
} }
void *_rb_root(const struct rb_type *t, struct rbt_tree *rbt) void *
_rb_root(const struct rb_type *t, struct rbt_tree *rbt)
{ {
struct rb_entry *rbe = RBH_ROOT(rbt); struct rb_entry *rbe = RBH_ROOT(rbt);
return (rbe == NULL ? rbe : rb_e2n(t, rbe)); return (rbe == NULL ? rbe : rb_e2n(t, rbe));
} }
void *_rb_min(const struct rb_type *t, struct rbt_tree *rbt) void *
_rb_min(const struct rb_type *t, struct rbt_tree *rbt)
{ {
struct rb_entry *rbe = RBH_ROOT(rbt); struct rb_entry *rbe = RBH_ROOT(rbt);
struct rb_entry *parent = NULL; struct rb_entry *parent = NULL;
@ -542,7 +555,8 @@ void *_rb_min(const struct rb_type *t, struct rbt_tree *rbt)
return (parent == NULL ? NULL : rb_e2n(t, parent)); return (parent == NULL ? NULL : rb_e2n(t, parent));
} }
void *_rb_max(const struct rb_type *t, struct rbt_tree *rbt) void *
_rb_max(const struct rb_type *t, struct rbt_tree *rbt)
{ {
struct rb_entry *rbe = RBH_ROOT(rbt); struct rb_entry *rbe = RBH_ROOT(rbt);
struct rb_entry *parent = NULL; struct rb_entry *parent = NULL;
@ -555,28 +569,32 @@ void *_rb_max(const struct rb_type *t, struct rbt_tree *rbt)
return (parent == NULL ? NULL : rb_e2n(t, parent)); return (parent == NULL ? NULL : rb_e2n(t, parent));
} }
void *_rb_left(const struct rb_type *t, void *node) void *
_rb_left(const struct rb_type *t, void *node)
{ {
struct rb_entry *rbe = rb_n2e(t, node); struct rb_entry *rbe = rb_n2e(t, node);
rbe = RBE_LEFT(rbe); rbe = RBE_LEFT(rbe);
return (rbe == NULL ? NULL : rb_e2n(t, rbe)); return (rbe == NULL ? NULL : rb_e2n(t, rbe));
} }
void *_rb_right(const struct rb_type *t, void *node) void *
_rb_right(const struct rb_type *t, void *node)
{ {
struct rb_entry *rbe = rb_n2e(t, node); struct rb_entry *rbe = rb_n2e(t, node);
rbe = RBE_RIGHT(rbe); rbe = RBE_RIGHT(rbe);
return (rbe == NULL ? NULL : rb_e2n(t, rbe)); return (rbe == NULL ? NULL : rb_e2n(t, rbe));
} }
void *_rb_parent(const struct rb_type *t, void *node) void *
_rb_parent(const struct rb_type *t, void *node)
{ {
struct rb_entry *rbe = rb_n2e(t, node); struct rb_entry *rbe = rb_n2e(t, node);
rbe = RBE_PARENT(rbe); rbe = RBE_PARENT(rbe);
return (rbe == NULL ? NULL : rb_e2n(t, rbe)); return (rbe == NULL ? NULL : rb_e2n(t, rbe));
} }
void _rb_set_left(const struct rb_type *t, void *node, void *left) void
_rb_set_left(const struct rb_type *t, void *node, void *left)
{ {
struct rb_entry *rbe = rb_n2e(t, node); struct rb_entry *rbe = rb_n2e(t, node);
struct rb_entry *rbl = (left == NULL) ? NULL : rb_n2e(t, left); struct rb_entry *rbl = (left == NULL) ? NULL : rb_n2e(t, left);
@ -584,7 +602,8 @@ void _rb_set_left(const struct rb_type *t, void *node, void *left)
RBE_LEFT(rbe) = rbl; RBE_LEFT(rbe) = rbl;
} }
void _rb_set_right(const struct rb_type *t, void *node, void *right) void
_rb_set_right(const struct rb_type *t, void *node, void *right)
{ {
struct rb_entry *rbe = rb_n2e(t, node); struct rb_entry *rbe = rb_n2e(t, node);
struct rb_entry *rbr = (right == NULL) ? NULL : rb_n2e(t, right); struct rb_entry *rbr = (right == NULL) ? NULL : rb_n2e(t, right);
@ -592,7 +611,8 @@ void _rb_set_right(const struct rb_type *t, void *node, void *right)
RBE_RIGHT(rbe) = rbr; RBE_RIGHT(rbe) = rbr;
} }
void _rb_set_parent(const struct rb_type *t, void *node, void *parent) void
_rb_set_parent(const struct rb_type *t, void *node, void *parent)
{ {
struct rb_entry *rbe = rb_n2e(t, node); struct rb_entry *rbe = rb_n2e(t, node);
struct rb_entry *rbp = (parent == NULL) ? NULL : rb_n2e(t, parent); struct rb_entry *rbp = (parent == NULL) ? NULL : rb_n2e(t, parent);
@ -600,19 +620,21 @@ void _rb_set_parent(const struct rb_type *t, void *node, void *parent)
RBE_PARENT(rbe) = rbp; RBE_PARENT(rbe) = rbp;
} }
void _rb_poison(const struct rb_type *t, void *node, unsigned long poison) void
_rb_poison(const struct rb_type *t, void *node, unsigned long poison)
{ {
struct rb_entry *rbe = rb_n2e(t, node); struct rb_entry *rbe = rb_n2e(t, node);
RBE_PARENT(rbe) = RBE_LEFT(rbe) = RBE_RIGHT(rbe) = RBE_PARENT(rbe) = RBE_LEFT(rbe) = RBE_RIGHT(rbe) =
(struct rb_entry *)poison; (struct rb_entry *)poison;
} }
int _rb_check(const struct rb_type *t, void *node, unsigned long poison) int
_rb_check(const struct rb_type *t, void *node, unsigned long poison)
{ {
struct rb_entry *rbe = rb_n2e(t, node); struct rb_entry *rbe = rb_n2e(t, node);
return ((unsigned long)RBE_PARENT(rbe) == poison return ((unsigned long)RBE_PARENT(rbe) == poison &&
&& (unsigned long)RBE_LEFT(rbe) == poison (unsigned long)RBE_LEFT(rbe) == poison &&
&& (unsigned long)RBE_RIGHT(rbe) == poison); (unsigned long)RBE_RIGHT(rbe) == poison);
} }

793
lib/openbsd-tree.h
View File

@ -24,7 +24,7 @@
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/ */
#ifndef _SYS_TREE_H_ #ifndef _SYS_TREE_H_
#define _SYS_TREE_H_ #define _SYS_TREE_H_
/* /*
@ -54,26 +54,23 @@
* The maximum height of a red-black tree is 2lg (n+1). * The maximum height of a red-black tree is 2lg (n+1).
*/ */
#define SPLAY_HEAD(name, type) \ #define SPLAY_HEAD(name, type) \
struct name { \ struct name { \
struct type *sph_root; /* root of the tree */ \ struct type *sph_root; /* root of the tree */ \
} }
#define SPLAY_INITIALIZER(root) \ #define SPLAY_INITIALIZER(root) \
{ \ { NULL }
NULL \
}
#define SPLAY_INIT(root) \ #define SPLAY_INIT(root) do { \
do { \ (root)->sph_root = NULL; \
(root)->sph_root = NULL; \ } while (0)
} while (0)
#define SPLAY_ENTRY(type) \ #define SPLAY_ENTRY(type) \
struct { \ struct { \
struct type *spe_left; /* left element */ \ struct type *spe_left; /* left element */ \
struct type *spe_right; /* right element */ \ struct type *spe_right; /* right element */ \
} }
#define SPLAY_LEFT(elm, field) (elm)->field.spe_left #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
#define SPLAY_RIGHT(elm, field) (elm)->field.spe_right #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
@ -81,220 +78,197 @@
#define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
/* SPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold SPLAY_{RIGHT,LEFT} */ /* SPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold SPLAY_{RIGHT,LEFT} */
#define SPLAY_ROTATE_RIGHT(head, tmp, field) \ #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
do { \ SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ (head)->sph_root = tmp; \
(head)->sph_root = tmp; \ } while (0)
} while (0)
#define SPLAY_ROTATE_LEFT(head, tmp, field) \ #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
do { \ SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \ SPLAY_LEFT(tmp, field) = (head)->sph_root; \
SPLAY_LEFT(tmp, field) = (head)->sph_root; \ (head)->sph_root = tmp; \
(head)->sph_root = tmp; \ } while (0)
} while (0)
#define SPLAY_LINKLEFT(head, tmp, field) \ #define SPLAY_LINKLEFT(head, tmp, field) do { \
do { \ SPLAY_LEFT(tmp, field) = (head)->sph_root; \
SPLAY_LEFT(tmp, field) = (head)->sph_root; \ tmp = (head)->sph_root; \
tmp = (head)->sph_root; \ (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
(head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \ } while (0)
} while (0)
#define SPLAY_LINKRIGHT(head, tmp, field) \ #define SPLAY_LINKRIGHT(head, tmp, field) do { \
do { \ SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ tmp = (head)->sph_root; \
tmp = (head)->sph_root; \ (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
(head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \ } while (0)
} while (0)
#define SPLAY_ASSEMBLE(head, node, left, right, field) \ #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
do { \ SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
SPLAY_RIGHT(left, field) = \ SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
SPLAY_LEFT((head)->sph_root, field); \ SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
SPLAY_LEFT(right, field) = \ SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
SPLAY_RIGHT((head)->sph_root, field); \ } while (0)
SPLAY_LEFT((head)->sph_root, field) = \
SPLAY_RIGHT(node, field); \
SPLAY_RIGHT((head)->sph_root, field) = \
SPLAY_LEFT(node, field); \
} while (0)
/* Generates prototypes and inline functions */ /* Generates prototypes and inline functions */
#define SPLAY_PROTOTYPE(name, type, field, cmp) \ #define SPLAY_PROTOTYPE(name, type, field, cmp) \
void name##_SPLAY(struct name *, struct type *); \ void name##_SPLAY(struct name *, struct type *); \
void name##_SPLAY_MINMAX(struct name *, int); \ void name##_SPLAY_MINMAX(struct name *, int); \
struct type *name##_SPLAY_INSERT(struct name *, struct type *); \ struct type *name##_SPLAY_INSERT(struct name *, struct type *); \
struct type *name##_SPLAY_REMOVE(struct name *, struct type *); \ struct type *name##_SPLAY_REMOVE(struct name *, struct type *); \
\ \
/* Finds the node with the same key as elm */ \ /* Finds the node with the same key as elm */ \
static __inline struct type *name##_SPLAY_FIND(struct name *head, \ static __inline struct type * \
struct type *elm) \ name##_SPLAY_FIND(struct name *head, struct type *elm) \
{ \ { \
if (SPLAY_EMPTY(head)) \ if (SPLAY_EMPTY(head)) \
return (NULL); \ return(NULL); \
name##_SPLAY(head, elm); \ name##_SPLAY(head, elm); \
if ((cmp)(elm, (head)->sph_root) == 0) \ if ((cmp)(elm, (head)->sph_root) == 0) \
return (head->sph_root); \ return (head->sph_root); \
return (NULL); \ return (NULL); \
} \ } \
\ \
static __inline struct type *name##_SPLAY_NEXT(struct name *head, \ static __inline struct type * \
struct type *elm) \ name##_SPLAY_NEXT(struct name *head, struct type *elm) \
{ \ { \
name##_SPLAY(head, elm); \ name##_SPLAY(head, elm); \
if (SPLAY_RIGHT(elm, field) != NULL) { \ if (SPLAY_RIGHT(elm, field) != NULL) { \
elm = SPLAY_RIGHT(elm, field); \ elm = SPLAY_RIGHT(elm, field); \
while (SPLAY_LEFT(elm, field) != NULL) { \ while (SPLAY_LEFT(elm, field) != NULL) { \
elm = SPLAY_LEFT(elm, field); \ elm = SPLAY_LEFT(elm, field); \
} \ } \
} else \ } else \
elm = NULL; \ elm = NULL; \
return (elm); \ return (elm); \
} \ } \
\ \
static __inline struct type *name##_SPLAY_MIN_MAX(struct name *head, \ static __inline struct type * \
int val) \ name##_SPLAY_MIN_MAX(struct name *head, int val) \
{ \ { \
name##_SPLAY_MINMAX(head, val); \ name##_SPLAY_MINMAX(head, val); \
return (SPLAY_ROOT(head)); \ return (SPLAY_ROOT(head)); \
} }
/* Main splay operation. /* Main splay operation.
* Moves node close to the key of elm to top * Moves node close to the key of elm to top
*/ */
#define SPLAY_GENERATE(name, type, field, cmp) \ #define SPLAY_GENERATE(name, type, field, cmp) \
struct type *name##_SPLAY_INSERT(struct name *head, struct type *elm) \ struct type * \
{ \ name##_SPLAY_INSERT(struct name *head, struct type *elm) \
if (SPLAY_EMPTY(head)) { \ { \
SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = \ if (SPLAY_EMPTY(head)) { \
NULL; \ SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \
} else { \ } else { \
int __comp; \ int __comp; \
name##_SPLAY(head, elm); \ name##_SPLAY(head, elm); \
__comp = (cmp)(elm, (head)->sph_root); \ __comp = (cmp)(elm, (head)->sph_root); \
if (__comp < 0) { \ if(__comp < 0) { \
SPLAY_LEFT(elm, field) = \ SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
SPLAY_LEFT((head)->sph_root, field); \ SPLAY_RIGHT(elm, field) = (head)->sph_root; \
SPLAY_RIGHT(elm, field) = (head)->sph_root; \ SPLAY_LEFT((head)->sph_root, field) = NULL; \
SPLAY_LEFT((head)->sph_root, field) = NULL; \ } else if (__comp > 0) { \
} else if (__comp > 0) { \ SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
SPLAY_RIGHT(elm, field) = \ SPLAY_LEFT(elm, field) = (head)->sph_root; \
SPLAY_RIGHT((head)->sph_root, field); \ SPLAY_RIGHT((head)->sph_root, field) = NULL; \
SPLAY_LEFT(elm, field) = (head)->sph_root; \ } else \
SPLAY_RIGHT((head)->sph_root, field) = NULL; \ return ((head)->sph_root); \
} else \ } \
return ((head)->sph_root); \ (head)->sph_root = (elm); \
} \ return (NULL); \
(head)->sph_root = (elm); \ } \
return (NULL); \ \
} \ struct type * \
\ name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
struct type *name##_SPLAY_REMOVE(struct name *head, struct type *elm) \ { \
{ \ struct type *__tmp; \
struct type *__tmp; \ if (SPLAY_EMPTY(head)) \
if (SPLAY_EMPTY(head)) \ return (NULL); \
return (NULL); \ name##_SPLAY(head, elm); \
name##_SPLAY(head, elm); \ if ((cmp)(elm, (head)->sph_root) == 0) { \
if ((cmp)(elm, (head)->sph_root) == 0) { \ if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \ (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
(head)->sph_root = \ } else { \
SPLAY_RIGHT((head)->sph_root, field); \ __tmp = SPLAY_RIGHT((head)->sph_root, field); \
} else { \ (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
__tmp = SPLAY_RIGHT((head)->sph_root, field); \ name##_SPLAY(head, elm); \
(head)->sph_root = \ SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
SPLAY_LEFT((head)->sph_root, field); \ } \
name##_SPLAY(head, elm); \ return (elm); \
SPLAY_RIGHT((head)->sph_root, field) = __tmp; \ } \
} \ return (NULL); \
return (elm); \ } \
} \ \
return (NULL); \ void \
} \ name##_SPLAY(struct name *head, struct type *elm) \
\ { \
void name##_SPLAY(struct name *head, struct type *elm) \ struct type __node, *__left, *__right, *__tmp; \
{ \ int __comp; \
struct type __node, *__left, *__right, *__tmp; \ \
int __comp; \ SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
\ __left = __right = &__node; \
SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = \ \
NULL; \ while ((__comp = (cmp)(elm, (head)->sph_root))) { \
__left = __right = &__node; \ if (__comp < 0) { \
\ __tmp = SPLAY_LEFT((head)->sph_root, field); \
while ((__comp = (cmp)(elm, (head)->sph_root))) { \ if (__tmp == NULL) \
if (__comp < 0) { \ break; \
__tmp = SPLAY_LEFT((head)->sph_root, field); \ if ((cmp)(elm, __tmp) < 0){ \
if (__tmp == NULL) \ SPLAY_ROTATE_RIGHT(head, __tmp, field); \
break; \ if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
if ((cmp)(elm, __tmp) < 0) { \ break; \
SPLAY_ROTATE_RIGHT(head, __tmp, \ } \
field); \ SPLAY_LINKLEFT(head, __right, field); \
if (SPLAY_LEFT((head)->sph_root, \ } else if (__comp > 0) { \
field) \ __tmp = SPLAY_RIGHT((head)->sph_root, field); \
== NULL) \ if (__tmp == NULL) \
break; \ break; \
} \ if ((cmp)(elm, __tmp) > 0){ \
SPLAY_LINKLEFT(head, __right, field); \ SPLAY_ROTATE_LEFT(head, __tmp, field); \
} else if (__comp > 0) { \ if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
__tmp = SPLAY_RIGHT((head)->sph_root, field); \ break; \
if (__tmp == NULL) \ } \
break; \ SPLAY_LINKRIGHT(head, __left, field); \
if ((cmp)(elm, __tmp) > 0) { \ } \
SPLAY_ROTATE_LEFT(head, __tmp, field); \ } \
if (SPLAY_RIGHT((head)->sph_root, \ SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
field) \ } \
== NULL) \ \
break; \ /* Splay with either the minimum or the maximum element \
} \ * Used to find minimum or maximum element in tree. \
SPLAY_LINKRIGHT(head, __left, field); \ */ \
} \ void name##_SPLAY_MINMAX(struct name *head, int __comp) \
} \ { \
SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \ struct type __node, *__left, *__right, *__tmp; \
} \ \
\ SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
/* Splay with either the minimum or the maximum element \ __left = __right = &__node; \
* Used to find minimum or maximum element in tree. \ \
*/ \ while (1) { \
void name##_SPLAY_MINMAX(struct name *head, int __comp) \ if (__comp < 0) { \
{ \ __tmp = SPLAY_LEFT((head)->sph_root, field); \
struct type __node, *__left, *__right, *__tmp; \ if (__tmp == NULL) \
\ break; \
SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = \ if (__comp < 0){ \
NULL; \ SPLAY_ROTATE_RIGHT(head, __tmp, field); \
__left = __right = &__node; \ if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
\ break; \
while (1) { \ } \
if (__comp < 0) { \ SPLAY_LINKLEFT(head, __right, field); \
__tmp = SPLAY_LEFT((head)->sph_root, field); \ } else if (__comp > 0) { \
if (__tmp == NULL) \ __tmp = SPLAY_RIGHT((head)->sph_root, field); \
break; \ if (__tmp == NULL) \
if (__comp < 0) { \ break; \
SPLAY_ROTATE_RIGHT(head, __tmp, \ if (__comp > 0) { \
field); \ SPLAY_ROTATE_LEFT(head, __tmp, field); \
if (SPLAY_LEFT((head)->sph_root, \ if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
field) \ break; \
== NULL) \ } \
break; \ SPLAY_LINKRIGHT(head, __left, field); \
} \ } \
SPLAY_LINKLEFT(head, __right, field); \ } \
} else if (__comp > 0) { \ SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
__tmp = SPLAY_RIGHT((head)->sph_root, field); \ }
if (__tmp == NULL) \
break; \
if (__comp > 0) { \
SPLAY_ROTATE_LEFT(head, __tmp, field); \
if (SPLAY_RIGHT((head)->sph_root, \
field) \
== NULL) \
break; \
} \
SPLAY_LINKRIGHT(head, __left, field); \
} \
} \
SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
}
#define SPLAY_NEGINF -1 #define SPLAY_NEGINF -1
#define SPLAY_INF 1 #define SPLAY_INF 1
@ -303,13 +277,14 @@
#define SPLAY_REMOVE(name, x, y) name##_SPLAY_REMOVE(x, y) #define SPLAY_REMOVE(name, x, y) name##_SPLAY_REMOVE(x, y)
#define SPLAY_FIND(name, x, y) name##_SPLAY_FIND(x, y) #define SPLAY_FIND(name, x, y) name##_SPLAY_FIND(x, y)
#define SPLAY_NEXT(name, x, y) name##_SPLAY_NEXT(x, y) #define SPLAY_NEXT(name, x, y) name##_SPLAY_NEXT(x, y)
#define SPLAY_MIN(name, x) \ #define SPLAY_MIN(name, x) (SPLAY_EMPTY(x) ? NULL \
(SPLAY_EMPTY(x) ? NULL : name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF)) : name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF))
#define SPLAY_MAX(name, x) \ #define SPLAY_MAX(name, x) (SPLAY_EMPTY(x) ? NULL \
(SPLAY_EMPTY(x) ? NULL : name##_SPLAY_MIN_MAX(x, SPLAY_INF)) : name##_SPLAY_MIN_MAX(x, SPLAY_INF))
#define SPLAY_FOREACH(x, name, head) \ #define SPLAY_FOREACH(x, name, head) \
for ((x) = SPLAY_MIN(name, head); (x) != NULL; \ for ((x) = SPLAY_MIN(name, head); \
(x) != NULL; \
(x) = SPLAY_NEXT(name, head, x)) (x) = SPLAY_NEXT(name, head, x))
/* /*
@ -332,197 +307,203 @@
#define RB_RED 1 #define RB_RED 1
struct rb_type { struct rb_type {
int (*t_compare)(const void *, const void *); int (*t_compare)(const void *, const void *);
void (*t_augment)(void *); void (*t_augment)(void *);
unsigned int t_offset; /* offset of rb_entry in type */ unsigned int t_offset; /* offset of rb_entry in type */
}; };
struct rbt_tree { struct rbt_tree {
struct rb_entry *rbt_root; struct rb_entry *rbt_root;
}; };
struct rb_entry { struct rb_entry {
struct rb_entry *rbt_parent; struct rb_entry *rbt_parent;
struct rb_entry *rbt_left; struct rb_entry *rbt_left;
struct rb_entry *rbt_right; struct rb_entry *rbt_right;
unsigned int rbt_color; unsigned int rbt_color;
}; };
#define RB_HEAD(_name, _type) \ #define RB_HEAD(_name, _type) \
struct _name { \ struct _name { \
struct rbt_tree rbh_root; \ struct rbt_tree rbh_root; \
} }
#define RB_ENTRY(_type) struct rb_entry #define RB_ENTRY(_type) struct rb_entry
static inline void _rb_init(struct rbt_tree *rbt) static inline void
_rb_init(struct rbt_tree *rbt)
{ {
rbt->rbt_root = NULL; rbt->rbt_root = NULL;
} }
static inline int _rb_empty(struct rbt_tree *rbt) static inline int
_rb_empty(struct rbt_tree *rbt)
{ {
return (rbt->rbt_root == NULL); return (rbt->rbt_root == NULL);
} }
void *_rb_insert(const struct rb_type *, struct rbt_tree *, void *); void *_rb_insert(const struct rb_type *, struct rbt_tree *, void *);
void *_rb_remove(const struct rb_type *, struct rbt_tree *, void *); void *_rb_remove(const struct rb_type *, struct rbt_tree *, void *);
void *_rb_find(const struct rb_type *, struct rbt_tree *, const void *); void *_rb_find(const struct rb_type *, struct rbt_tree *, const void *);
void *_rb_nfind(const struct rb_type *, struct rbt_tree *, const void *); void *_rb_nfind(const struct rb_type *, struct rbt_tree *, const void *);
void *_rb_root(const struct rb_type *, struct rbt_tree *); void *_rb_root(const struct rb_type *, struct rbt_tree *);
void *_rb_min(const struct rb_type *, struct rbt_tree *); void *_rb_min(const struct rb_type *, struct rbt_tree *);
void *_rb_max(const struct rb_type *, struct rbt_tree *); void *_rb_max(const struct rb_type *, struct rbt_tree *);
void *_rb_next(const struct rb_type *, void *); void *_rb_next(const struct rb_type *, void *);
void *_rb_prev(const struct rb_type *, void *); void *_rb_prev(const struct rb_type *, void *);
void *_rb_left(const struct rb_type *, void *); void *_rb_left(const struct rb_type *, void *);
void *_rb_right(const struct rb_type *, void *); void *_rb_right(const struct rb_type *, void *);
void *_rb_parent(const struct rb_type *, void *); void *_rb_parent(const struct rb_type *, void *);
void _rb_set_left(const struct rb_type *, void *, void *); void _rb_set_left(const struct rb_type *, void *, void *);
void _rb_set_right(const struct rb_type *, void *, void *); void _rb_set_right(const struct rb_type *, void *, void *);
void _rb_set_parent(const struct rb_type *, void *, void *); void _rb_set_parent(const struct rb_type *, void *, void *);
void _rb_poison(const struct rb_type *, void *, unsigned long); void _rb_poison(const struct rb_type *, void *, unsigned long);
int _rb_check(const struct rb_type *, void *, unsigned long); int _rb_check(const struct rb_type *, void *, unsigned long);
#define RB_INITIALIZER(_head) { { NULL } } #define RB_INITIALIZER(_head) { { NULL } }
#define RB_PROTOTYPE(_name, _type, _field, _cmp) \ #define RB_PROTOTYPE(_name, _type, _field, _cmp) \
extern const struct rb_type *const _name##_RB_TYPE; \ extern const struct rb_type *const _name##_RB_TYPE; \
\ \
__attribute__((__unused__)) static inline void _name##_RB_INIT( \ __attribute__((__unused__)) static inline void \
struct _name *head) \ _name##_RB_INIT(struct _name *head) \
{ \ { \
_rb_init(&head->rbh_root); \ _rb_init(&head->rbh_root); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_INSERT(struct _name *head, struct _type *elm) \ _name##_RB_INSERT(struct _name *head, struct _type *elm) \
{ \ { \
return _rb_insert(_name##_RB_TYPE, &head->rbh_root, elm); \ return _rb_insert(_name##_RB_TYPE, &head->rbh_root, elm); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_REMOVE(struct _name *head, struct _type *elm) \ _name##_RB_REMOVE(struct _name *head, struct _type *elm) \
{ \ { \
return _rb_remove(_name##_RB_TYPE, &head->rbh_root, elm); \ return _rb_remove(_name##_RB_TYPE, &head->rbh_root, elm); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_FIND(struct _name *head, const struct _type *key) \ _name##_RB_FIND(struct _name *head, const struct _type *key) \
{ \ { \
return _rb_find(_name##_RB_TYPE, &head->rbh_root, key); \ return _rb_find(_name##_RB_TYPE, &head->rbh_root, key); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_NFIND(struct _name *head, const struct _type *key) \ _name##_RB_NFIND(struct _name *head, const struct _type *key) \
{ \ { \
return _rb_nfind(_name##_RB_TYPE, &head->rbh_root, key); \ return _rb_nfind(_name##_RB_TYPE, &head->rbh_root, key); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_ROOT(struct _name *head) \ _name##_RB_ROOT(struct _name *head) \
{ \ { \
return _rb_root(_name##_RB_TYPE, &head->rbh_root); \ return _rb_root(_name##_RB_TYPE, &head->rbh_root); \
} \ } \
\ \
__attribute__((__unused__)) static inline int _name##_RB_EMPTY( \ __attribute__((__unused__)) static inline int \
struct _name *head) \ _name##_RB_EMPTY(struct _name *head) \
{ \ { \
return _rb_empty(&head->rbh_root); \ return _rb_empty(&head->rbh_root); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_MIN(struct _name *head) \ _name##_RB_MIN(struct _name *head) \
{ \ { \
return _rb_min(_name##_RB_TYPE, &head->rbh_root); \ return _rb_min(_name##_RB_TYPE, &head->rbh_root); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_MAX(struct _name *head) \ _name##_RB_MAX(struct _name *head) \
{ \ { \
return _rb_max(_name##_RB_TYPE, &head->rbh_root); \ return _rb_max(_name##_RB_TYPE, &head->rbh_root); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_NEXT(struct _type *elm) \ _name##_RB_NEXT(struct _type *elm) \
{ \ { \
return _rb_next(_name##_RB_TYPE, elm); \ return _rb_next(_name##_RB_TYPE, elm); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_PREV(struct _type *elm) \ _name##_RB_PREV(struct _type *elm) \
{ \ { \
return _rb_prev(_name##_RB_TYPE, elm); \ return _rb_prev(_name##_RB_TYPE, elm); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_LEFT(struct _type *elm) \ _name##_RB_LEFT(struct _type *elm) \
{ \ { \
return _rb_left(_name##_RB_TYPE, elm); \ return _rb_left(_name##_RB_TYPE, elm); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_RIGHT(struct _type *elm) \ _name##_RB_RIGHT(struct _type *elm) \
{ \ { \
return _rb_right(_name##_RB_TYPE, elm); \ return _rb_right(_name##_RB_TYPE, elm); \
} \ } \
\ \
__attribute__((__unused__)) static inline struct _type \ __attribute__((__unused__)) static inline struct _type * \
*_name##_RB_PARENT(struct _type *elm) \ _name##_RB_PARENT(struct _type *elm) \
{ \ { \
return _rb_parent(_name##_RB_TYPE, elm); \ return _rb_parent(_name##_RB_TYPE, elm); \
} \ } \
\ \
__attribute__((__unused__)) static inline void _name##_RB_SET_LEFT( \ __attribute__((__unused__)) static inline void \
struct _type *elm, struct _type *left) \ _name##_RB_SET_LEFT(struct _type *elm, struct _type *left) \
{ \ { \
return _rb_set_left(_name##_RB_TYPE, elm, left); \ return _rb_set_left(_name##_RB_TYPE, elm, left); \
} \ } \
\ \
__attribute__((__unused__)) static inline void _name##_RB_SET_RIGHT( \ __attribute__((__unused__)) static inline void \
struct _type *elm, struct _type *right) \ _name##_RB_SET_RIGHT(struct _type *elm, struct _type *right) \
{ \ { \
return _rb_set_right(_name##_RB_TYPE, elm, right); \ return _rb_set_right(_name##_RB_TYPE, elm, right); \
} \ } \
\ \
__attribute__((__unused__)) static inline void _name##_RB_SET_PARENT( \ __attribute__((__unused__)) static inline void \
struct _type *elm, struct _type *parent) \ _name##_RB_SET_PARENT(struct _type *elm, struct _type *parent) \
{ \ { \
return _rb_set_parent(_name##_RB_TYPE, elm, parent); \ return _rb_set_parent(_name##_RB_TYPE, elm, parent); \
} \ } \
\ \
__attribute__((__unused__)) static inline void _name##_RB_POISON( \ __attribute__((__unused__)) static inline void \
struct _type *elm, unsigned long poison) \ _name##_RB_POISON(struct _type *elm, unsigned long poison) \
{ \ { \
return _rb_poison(_name##_RB_TYPE, elm, poison); \ return _rb_poison(_name##_RB_TYPE, elm, poison); \
} \ } \
\ \
__attribute__((__unused__)) static inline int _name##_RB_CHECK( \ __attribute__((__unused__)) static inline int \
struct _type *elm, unsigned long poison) \ _name##_RB_CHECK(struct _type *elm, unsigned long poison) \
{ \ { \
return _rb_check(_name##_RB_TYPE, elm, poison); \ return _rb_check(_name##_RB_TYPE, elm, poison); \
} }
#define RB_GENERATE_INTERNAL(_name, _type, _field, _cmp, _aug) \ #define RB_GENERATE_INTERNAL(_name, _type, _field, _cmp, _aug) \
static int _name##_RB_COMPARE(const void *lptr, const void *rptr) \ static int \
{ \ _name##_RB_COMPARE(const void *lptr, const void *rptr) \
const struct _type *l = lptr, *r = rptr; \ { \
return _cmp(l, r); \ const struct _type *l = lptr, *r = rptr; \
} \ return _cmp(l, r); \
static const struct rb_type _name##_RB_INFO = { \ } \
_name##_RB_COMPARE, _aug, offsetof(struct _type, _field), \ static const struct rb_type _name##_RB_INFO = { \
}; \ _name##_RB_COMPARE, \
const struct rb_type *const _name##_RB_TYPE = &_name##_RB_INFO; _aug, \
offsetof(struct _type, _field), \
}; \
const struct rb_type *const _name##_RB_TYPE = &_name##_RB_INFO;
#define RB_GENERATE_AUGMENT(_name, _type, _field, _cmp, _aug) \ #define RB_GENERATE_AUGMENT(_name, _type, _field, _cmp, _aug) \
static void _name##_RB_AUGMENT(void *ptr) \ static void \
{ \ _name##_RB_AUGMENT(void *ptr) \
struct _type *p = ptr; \ { \
return _aug(p); \ struct _type *p = ptr; \
} \ return _aug(p); \
RB_GENERATE_INTERNAL(_name, _type, _field, _cmp, _name##_RB_AUGMENT) } \
RB_GENERATE_INTERNAL(_name, _type, _field, _cmp, _name##_RB_AUGMENT)
#define RB_GENERATE(_name, _type, _field, _cmp) \ #define RB_GENERATE(_name, _type, _field, _cmp) \
RB_GENERATE_INTERNAL(_name, _type, _field, _cmp, NULL) RB_GENERATE_INTERNAL(_name, _type, _field, _cmp, NULL)
#define RB_INIT(_name, _head) _name##_RB_INIT(_head) #define RB_INIT(_name, _head) _name##_RB_INIT(_head)
#define RB_INSERT(_name, _head, _elm) _name##_RB_INSERT(_head, _elm) #define RB_INSERT(_name, _head, _elm) _name##_RB_INSERT(_head, _elm)
@ -544,20 +525,24 @@ int _rb_check(const struct rb_type *, void *, unsigned long);
#define RB_POISON(_name, _elm, _p) _name##_RB_POISON(_elm, _p) #define RB_POISON(_name, _elm, _p) _name##_RB_POISON(_elm, _p)
#define RB_CHECK(_name, _elm, _p) _name##_RB_CHECK(_elm, _p) #define RB_CHECK(_name, _elm, _p) _name##_RB_CHECK(_elm, _p)
#define RB_FOREACH(_e, _name, _head) \ #define RB_FOREACH(_e, _name, _head) \
for ((_e) = RB_MIN(_name, (_head)); (_e) != NULL; \ for ((_e) = RB_MIN(_name, (_head)); \
(_e) != NULL; \
(_e) = RB_NEXT(_name, (_e))) (_e) = RB_NEXT(_name, (_e)))
#define RB_FOREACH_SAFE(_e, _name, _head, _n) \ #define RB_FOREACH_SAFE(_e, _name, _head, _n) \
for ((_e) = RB_MIN(_name, (_head)); \ for ((_e) = RB_MIN(_name, (_head)); \
(_e) != NULL && ((_n) = RB_NEXT(_name, (_e)), 1); (_e) = (_n)) (_e) != NULL && ((_n) = RB_NEXT(_name, (_e)), 1); \
(_e) = (_n))
#define RB_FOREACH_REVERSE(_e, _name, _head) \ #define RB_FOREACH_REVERSE(_e, _name, _head) \
for ((_e) = RB_MAX(_name, (_head)); (_e) != NULL; \ for ((_e) = RB_MAX(_name, (_head)); \
(_e) != NULL; \
(_e) = RB_PREV(_name, (_e))) (_e) = RB_PREV(_name, (_e)))
#define RB_FOREACH_REVERSE_SAFE(_e, _name, _head, _n) \ #define RB_FOREACH_REVERSE_SAFE(_e, _name, _head, _n) \
for ((_e) = RB_MAX(_name, (_head)); \ for ((_e) = RB_MAX(_name, (_head)); \
(_e) != NULL && ((_n) = RB_PREV(_name, (_e)), 1); (_e) = (_n)) (_e) != NULL && ((_n) = RB_PREV(_name, (_e)), 1); \
(_e) = (_n))
#endif /* _SYS_TREE_H_ */ #endif /* _SYS_TREE_H_ */

6
ripd/rip_debug.c
View File

@ -66,7 +66,7 @@ DEFUN (debug_rip_events,
"RIP events\n") "RIP events\n")
{ {
rip_debug_event = RIP_DEBUG_EVENT; rip_debug_event = RIP_DEBUG_EVENT;
return CMD_WARNING_CONFIG_FAILED; return CMD_SUCCESS;
} }
DEFUN (debug_rip_packet, DEFUN (debug_rip_packet,
@ -112,7 +112,7 @@ DEFUN (debug_rip_zebra,
"RIP and ZEBRA communication\n") "RIP and ZEBRA communication\n")
{ {
rip_debug_zebra = RIP_DEBUG_ZEBRA; rip_debug_zebra = RIP_DEBUG_ZEBRA;
return CMD_WARNING_CONFIG_FAILED; return CMD_SUCCESS;
} }
DEFUN (no_debug_rip_events, DEFUN (no_debug_rip_events,
@ -177,7 +177,7 @@ DEFUN (no_debug_rip_zebra,
"RIP and ZEBRA communication\n") "RIP and ZEBRA communication\n")
{ {
rip_debug_zebra = 0; rip_debug_zebra = 0;
return CMD_WARNING_CONFIG_FAILED; return CMD_SUCCESS;
} }
/* Debug node. */ /* Debug node. */

6
ripngd/ripng_debug.c
View File

@ -67,7 +67,7 @@ DEFUN (debug_ripng_events,
"Debug option set for ripng events\n") "Debug option set for ripng events\n")
{ {
ripng_debug_event = RIPNG_DEBUG_EVENT; ripng_debug_event = RIPNG_DEBUG_EVENT;
return CMD_WARNING_CONFIG_FAILED; return CMD_SUCCESS;
} }
DEFUN (debug_ripng_packet, DEFUN (debug_ripng_packet,
@ -114,7 +114,7 @@ DEFUN (debug_ripng_zebra,
"Debug option set for ripng and zebra communication\n") "Debug option set for ripng and zebra communication\n")
{ {
ripng_debug_zebra = RIPNG_DEBUG_ZEBRA; ripng_debug_zebra = RIPNG_DEBUG_ZEBRA;
return CMD_WARNING_CONFIG_FAILED; return CMD_SUCCESS;
} }
DEFUN (no_debug_ripng_events, DEFUN (no_debug_ripng_events,
@ -179,7 +179,7 @@ DEFUN (no_debug_ripng_zebra,
"Debug option set for ripng and zebra communication\n") "Debug option set for ripng and zebra communication\n")
{ {
ripng_debug_zebra = 0; ripng_debug_zebra = 0;
return CMD_WARNING_CONFIG_FAILED; return CMD_SUCCESS;
} }
/* Debug node. */ /* Debug node. */

2
vtysh/vtysh.h
View File

@ -44,7 +44,7 @@ DECLARE_MGROUP(MVTYSH)
* run on it (logging & co. should stay in a fixed/frozen config, and * run on it (logging & co. should stay in a fixed/frozen config, and
* things like prefix lists are not even initialised) */ * things like prefix lists are not even initialised) */
#define VTYSH_ALL VTYSH_ZEBRA|VTYSH_RIPD|VTYSH_RIPNGD|VTYSH_OSPFD|VTYSH_OSPF6D|VTYSH_LDPD|VTYSH_BGPD|VTYSH_ISISD|VTYSH_PIMD|VTYSH_NHRPD|VTYSH_EIGRPD|VTYSH_BABELD #define VTYSH_ALL VTYSH_ZEBRA|VTYSH_RIPD|VTYSH_RIPNGD|VTYSH_OSPFD|VTYSH_OSPF6D|VTYSH_LDPD|VTYSH_BGPD|VTYSH_ISISD|VTYSH_PIMD|VTYSH_NHRPD|VTYSH_EIGRPD|VTYSH_BABELD
#define VTYSH_RMAP VTYSH_ZEBRA|VTYSH_RIPD|VTYSH_RIPNGD|VTYSH_OSPFD|VTYSH_OSPF6D|VTYSH_BGPD|VTYSH_PIMD #define VTYSH_RMAP VTYSH_ZEBRA|VTYSH_RIPD|VTYSH_RIPNGD|VTYSH_OSPFD|VTYSH_OSPF6D|VTYSH_BGPD|VTYSH_PIMD|VTYSH_EIGRPD
#define VTYSH_INTERFACE VTYSH_ZEBRA|VTYSH_RIPD|VTYSH_RIPNGD|VTYSH_OSPFD|VTYSH_OSPF6D|VTYSH_ISISD|VTYSH_PIMD|VTYSH_NHRPD|VTYSH_EIGRPD|VTYSH_BABELD #define VTYSH_INTERFACE VTYSH_ZEBRA|VTYSH_RIPD|VTYSH_RIPNGD|VTYSH_OSPFD|VTYSH_OSPF6D|VTYSH_ISISD|VTYSH_PIMD|VTYSH_NHRPD|VTYSH_EIGRPD|VTYSH_BABELD
#define VTYSH_NS VTYSH_ZEBRA #define VTYSH_NS VTYSH_ZEBRA
#define VTYSH_VRF VTYSH_ZEBRA #define VTYSH_VRF VTYSH_ZEBRA