| Age | Commit message (Collapse) | Author |
|---|
|
priority: PARENT
Means that this priority group will adopt the priority value of the parent. And the behavior on deletion of this priority root node will be deleted before the parent. On
all other operations this node will be scheduled after the parent.
This should fix problems in scheduling creation/deletion orders for priority groups so long as they are located within the same hierarchy.
priority.pl has been updated as well.
|
|
definition.
type: ipv4,ipv6
Will now allow for the value to validated against both data types (or the first success). In the case of both failing the following message format will be returned:
vyatta@vyatta# set load-balancing wan rule 1
"1" is not a valid value of type "bool"
"1" is not a valid value of type "ipv4"
Note, that any combination of types with text being one of the types is not supported. The reason being is that with text any value is allowed, therefore it doesn't really
make sense to validate a datatype on text + ipv4 when text will always be successful.
|
|
Embedded leaf nodes can now be supported in the cli structure. In additional an arbritrary limit can be set on the number of multinode values allowed.
Format in the node.def is:
tag: [u32]
or
multi: [u32]
For the special case of a leaf node the value for u32 is 1. In this case the operation applied to the node is to replace the node with the set value. This generates a
delete of the old tree structure from the embedded leaf and a set of the new tree structure from the embedded leaf.
|
|
|
|
|
|
|
|
designition for single entry (FIRSTLAST).
|
|
|
|
|
|
|
|
Also change priority.pl script to display inline comments found in
"priority:" fields if they are present.
|
|
limited than this--at least tag node.def and multiple
configuration on commit.
tested fix with limited regression test.
also slightly modified break on priority values where embedded multinodes with priority values are treated as discrete transactions (which
isolates failures within the multinode and not the parent of the multinode).
|
|
references to old values.
|
|
and should be considered depricated.
|
|
diverges from the node.defs
commit behavior has not changed yet, but can be completely switched over to node.def priority system with simple change.
|
|
will now display both priorities:
interfaces (t: 0, p: 850,850)
the first value is from the old priority file and is the active value, the second value is the value retrieved from the node.def and is not used (yet).
|
|
|
|
-b
Breaks on each priority group before execution and waits for user keystroke to proceed. this allows for examination of system before and after each priority group has been applied
|
|
deleted leafs. Partial regression run on changes, results map to 10/10 build.
|
|
will improve performance by avoiding the piecewise priority based copy and just
copy the complete configuration once. On specific test configuration performance improvement brought commit boot time down from >15 minutes to less than 10
minutes.
|
|
* convert subshell invocations to library function calls.
* reduce boot time by ~40 seconds for "certain configuration".
|
|
with slash in
jenner.
|
|
corresponding changes made to node.defs
|
|
Use (void) rather than old K&R style.
Make some functions local.
|
|
|
|
|
|
available to the partial commit status api (bug fix 4919). this approach will
be revised in next
release.
|
|
accounting file.
|
|
from commit and via .changes
file used for commit active node set.
|
|
template tree and build the
priority file from "priority: val" tags found in node.def files. This
will now allow us to migrate the priority statements found to the specified nodes. Currently the
program does not order the priority nodes according to values (cosmetic
feature).
Finally once all the priority values have been migrated to the infected node.defs the priority
program can be added as a postinst hook on debian package install.
|
|
nodes are delimited by "/" rather than spaces.
|
|
deleted children. This change only affects
the commit check for nodes that are transactions and are not directly deleted, but have deleted children.
commit check is now being called.
|
|
missing the last 4 bytes on 64 bit copy.
|
|
|
|
functional without additional testing.
|
|
CREATE, DELETE, END, BEGIN) within a priority tree.
That means that all work (include the commit-check pass) will be
performed on a priority tree before proceeding to the next priority tree.
If a priority tree generates a failure in the commit-check pass
processing will halt on the priority tree and no further processing will
be performed on the priority tree. The failed priority tree will NOT be
copied to the active working directory.
All nodes in the priority tree will execute SYNTAX and COMMIT actions
except for nodes that have been deleted. Note this iteration is
performed on the working tree, so all commit-check nodes will either be
directly modified or have a node down the hierarchy that had been modified.
The working directory and active directory will not be modified until
after all priority trees have been processed.
|
|
Note that commit check only applies in the following cases:
1) On nodes or ancestors of nodes that have been set or modified
2) Does not applied to deleted nodes
Feature developers should:
1) locate commit checks at a common ancestor if checking across a hierarchy
2) expect that the commit check only enforces created behavior (therefore behaves more like a create check).
An additional flag is provided "-f" to allow for full syntax and commit checks. This allows a complete single pass on all syntax and
commit errors. The default behavior is to stop processing on the first error.
|
|
in the node.def. This change only affects display of nodes when -a option is used.
|
|
passes regression
|
|
Post unionfs directory magic until after all actions have been applied to node tree.
|
|
"ENV_SIBLING_POSITION". This value will either be "FIRST" or "LAST" or undefined.
"FIRST" means that the sibling is the first in the list of a common parent, provided that the sibling resides in the same priority group
"LAST" means that the sibling is the last in the list of a common parent, provided that the sibling resides in the same priority group
|
|
|
|
opaque directories are now handled corrected when a delete is followed by a set in a subsection of the deleted hierarchy.
|
|
end/begin transactions. now only end/begin are called on active nodes.
|
|
So,
100 load-balancing/wan/rule/node.tag/*
applies the priority of "100" to all children of the multinode "rule:value"
NEW TRANS
+ source (t: 0, p: 333)
+ address (t: 0, p: 1000)
+ 1.1.1.1/32 (t: 8, p: 1000) [VALUE]
NEW TRANS
+ protocol (t: 0, p: 333)
+ all (t: 8, p: 1000) [VALUE] [SYNTAX]
NEW TRANS
+ protocol (t: 0, p: 333)
+ all (t: 8, p: 1000) [VALUE] [SYNTAX]
NEW TRANS
+ load-balancing (t: 0, p: 1000)
+ wan (t: 0, p: 1000) [DELETE] [COMMIT]
+ rule (t: 0, p: 1000) [MULTI]
+ 1 (t: 1, p: 1000) [VALUE]
+ 2 (t: 1, p: 1000) [VALUE]
Where protocol is a child node of "rule:value"
This should allow us to compress some of the entries given the current state of the priority file.
|
|
|
|
now stops on failure within priority group (expected behavior).
|
|
|
|
action being applied.
|
|
|
