diff options
| -rw-r--r-- | filter/filter.c | 14 | ||||
| -rw-r--r-- | filter/tree.c | 2 |
2 files changed, 8 insertions, 8 deletions
diff --git a/filter/filter.c b/filter/filter.c index d580b55d..40dbef48 100644 --- a/filter/filter.c +++ b/filter/filter.c @@ -10,10 +10,10 @@ /** * DOC: Filters * - * You can find sources of filters language in filter/ - * directory. filter/config.Y filter grammar, and basically translates + * You can find sources of filters language in |filter/| + * directory. |filter/config.Y| filter grammar, and basically translates * source from user into tree of &f_inst structures. These trees are - * later interpreted using code in filter/filter.c. Filters internally + * later interpreted using code in |filter/filter.c|. Filters internally * work with values/variables in struct f_val, which contains type of * value and value. * @@ -25,7 +25,7 @@ * * Filters use structure &f_val for its variables. Each &f_val * contains type and value. Types are constants prefixed with %T_. Few - * of types are special; %T_RETURN can be or--ed with type to indicate + * of types are special; %T_RETURN can be or-ed with type to indicate * that return from function/from whole filter should be * forced. Important thing about &f_val s is that they may be copied * with simple =. That's fine for all currently defined types: strings @@ -72,7 +72,7 @@ pm_path_compare(struct f_path_mask *m1, struct f_path_mask *m2) } /** - * val_compare + * val_compare - compare two values * @v1: first value * @v2: second value * @@ -147,12 +147,12 @@ val_simple_in_range(struct f_val v1, struct f_val v2) } /** - * val_in_range + * val_in_range - implement |~| operator * @v1: element * @v2: set * * Checks if @v1 is element (|~| operator) of @v2. Sets are internally represented as balanced trees, see - * tree.c module (this is not limited to sets, but for non-set cases, val_simple_in_range() is called early). + * |tree.c| module (this is not limited to sets, but for non-set cases, val_simple_in_range() is called early). */ int val_in_range(struct f_val v1, struct f_val v2) diff --git a/filter/tree.c b/filter/tree.c index cd8eef09..a67ddd09 100644 --- a/filter/tree.c +++ b/filter/tree.c @@ -70,7 +70,7 @@ find_median(struct f_tree *from) * by &f_val structures (that can be compared by val_compare()). In each node of tree, * either single value (then t->from==t->to) or range is present. * - * Both set matching and switch() { } construction is implemented using this function, + * Both set matching and |switch() { }| construction is implemented using this function, * thus both are as fast as they can be. */ struct f_tree * |