OpenSourceRouting / quagga-snap / 3bf1c917d10

Commits

paul authored 3bf1c917d10 29 Oct 2003

2003-10-29 Paul Jakma <paul@dishone.st>

        * lib/routemap.c: (route_map_apply_index) renamed to
          route_map_apply_match.
          (route_map_apply_match) Take rule list as argument rather than
          index. concentrate solely on match logic.
          (route_map_apply) Properly implement the route map statement
          logic, according to the table, especially the on-match exit
          policy.

lib/routemap.c

Modified

-627
+	/* Execute event hook. */
-628
+	if (route_map_master.event_hook)
-629
+	  (*route_map_master.event_hook) (RMAP_EVENT_SET_DELETED,
-630
+					  index->map->name);
-631
+        return 0;
-632
+      }
-633
+  /* Can't find matched rule. */
-634
+  return 1;
-635
+}
-636
--
+/* Apply route map's each index to the object. */
--
+/*
--
+** The matrix for a route-map looks like this:
--
+** (note, this includes the description for the "NEXT"
--
+** and "GOTO" frobs now
--
+**
--
+**            Match   |   No Match
--
+**                    |
--
+**  permit      a     |      c
--
+**                    |
--
+**  ------------------+---------------
--
+**                    |
--
+**  deny        b     |      d
--
+**                    |
--
+**
--
+** a)   Apply Set statements, accept route
--
+**      If NEXT is specified, goto NEXT statement
--
+**      If GOTO is specified, goto the first clause where pref > nextpref
--
+**      If nothing is specified, do as Cisco and finish
--
+** b)   Finish route-map processing, and deny route
--
+** c) & d)   Goto Next index
--
+**
--
+** If we get no matches after we've processed all updates, then the route
--
+** is dropped too.
--
+**
--
+** Some notes on the new "NEXT" and "GOTO"
--
+**   on-match next    - If this clause is matched, then the set statements
--
+**                      are executed and then we drop through to the next clause
--
+**   on-match goto n  - If this clause is matched, then the set statments
--
+**                      are executed and then we goto the nth clause, or the
--
+**                      first clause greater than this. In order to ensure
--
+**                      route-maps *always* exit, you cannot jump backwards.
--
+**                      Sorry ;)
--
+**
--
+** We need to make sure our route-map processing matches the above
-+
+/* Apply route map's each index to the object.
-+
-+
+   The matrix for a route-map looks like this:
-+
+   (note, this includes the description for the "NEXT"
-+
+   and "GOTO" frobs now
-+
-+
+              Match   |   No Match
-+
+                      |
-+
+    permit    action  |     cont
-+
+                      |
-+
+    ------------------+---------------
-+
+                      |
-+
+    deny      deny    |     cont
-+
+                      |
-+
-+
+   action) Apply Set statements, accept route
-+
+      If NEXT is specified, goto NEXT statement
-+
+      If GOTO is specified, goto the first clause where pref > nextpref
-+
+      If nothing is specified, do as Cisco and finish
-+
+   deny)   If NEXT is specified, goto NEXT statement
-+
+      If nothing is specified, finally will be denied by route-map.
-+
+   cont)   Goto Next index
-+
-+
+   If we get no matches after we've processed all updates, then the route
-+
+   is dropped too.
-+
-+
+   Some notes on the new "NEXT" and "GOTO"
-+
+     on-match next    - If this clause is matched, then the set statements
-+
+                        are executed and then we drop through to the next clause
-+
+     on-match goto n  - If this clause is matched, then the set statments
-+
+                        are executed and then we goto the nth clause, or the
-+
+                        first clause greater than this. In order to ensure
-+
+                        route-maps *always* exit, you cannot jump backwards.
-+
+                        Sorry ;)
-+
-+
+   We need to make sure our route-map processing matches the above
-673
+*/
-+
-675
+route_map_result_t
--
+route_map_apply_index (struct route_map_index *index, struct prefix *prefix,
--
+                       route_map_object_t type, void *object)
-+
+route_map_apply_match (struct route_map_rule_list *match_list,
-+
+                       struct prefix *prefix, route_map_object_t type,
-+
+                       void *object)
-679
+{
--
+  int ret;
-+
+  route_map_result_t ret = RMAP_NOMATCH;
-681
+  struct route_map_rule *match;
--
+  struct route_map_rule *set;
--
--
+  /* Check all match rule and if there is no match rule return 0. */
--
+  for (match = index->match_list.head; match; match = match->next)
--
+    {
--
+      /* Try each match statement in turn. If any return something
--
+       other than RM_MATCH then we don't need to check anymore and can
--
+       return */
--
+      ret = (*match->cmd->func_apply)(match->value, prefix, type, object);
--
+      if (ret != RMAP_MATCH)
--
+	return ret;
--
+    }
-682
--
+  /* We get here if all match statements matched From the matrix
--
+   above, if this is PERMIT we go on and apply the SET functions.  If
--
+   we're deny, we return indicating we matched a deny */
-683
--
+  /* Apply set statement to the object. */
--
+  if (index->type == RMAP_PERMIT)
--
+    {
--
+      for (set = index->set_list.head; set; set = set->next)
--
+	{
--
+	  ret = (*set->cmd->func_apply)(set->value, prefix, type, object);
--
+	}
--
+      return RMAP_MATCH;
--
+    }
--
+  else
-+
+  /* Check all match rule and if there is no match rule, go to the
-+
+     set statement. */
-+
+  if (!match_list->head)
-+
+    ret = RMAP_MATCH;
-+
+  else
-689
+    {
--
+      return RMAP_DENYMATCH;
-+
+      for (match = match_list->head; match; match = match->next)
-+
+        {
-+
+          /* Try each match statement in turn, If any do not return
-+
+             RMAP_MATCH, return, otherwise continue on to next match
-+
+             statement. All match statements must match for end-result
-+
+             to be a match. */
-+
+          ret = (*match->cmd->func_apply) (match->value, prefix,
-+
+                                           type, object);
-+
+          if (ret != RMAP_MATCH)
-+
+            return ret;
-+
+        }
-701
+    }
--
+  /* Should not get here! */
--
+  return RMAP_MATCH;
-+
+  return ret;
-703
+}
-704
-705
+/* Apply route map to the object. */
-706
+route_map_result_t
--
+route_map_apply (struct route_map *map, struct prefix *prefix,
--
+		 route_map_object_t type, void *object)
-+
+route_map_apply (struct route_map *map, struct prefix *prefix,
-+
+                 route_map_object_t type, void *object)
-709
+{
-710
+  int ret = 0;
-711
+  struct route_map_index *index;
-+
+  struct route_map_rule *set;
-713
-714
+  if (map == NULL)
-715
+    return RMAP_DENYMATCH;
-716
-717
+  for (index = map->head; index; index = index->next)
-718
+    {
--
+      /* Apply this index. End here if we get a RM_NOMATCH */
--
+      ret = route_map_apply_index (index, prefix, type, object);
--
--
+      if (ret != RMAP_NOMATCH)
--
+	{
--
+	  /* We now have to handle the NEXT and GOTO clauses */
--
+	  if(index->exitpolicy == RMAP_EXIT)
--
+	    return ret;
--
+	  if(index->exitpolicy == RMAP_GOTO)
--
+	    {
--
+	      /* Find the next clause to jump to */
--
+	      struct route_map_index *next;
--
--
+	      next = index->next;
--
+	      while (next && next->pref < index->nextpref)
--
+		{
--
+		  index = next;
--
+		  next = next->next;
--
+		}
--
+	      if (next == NULL)
--
+		{
--
+		  /* No clauses match! */
--
+		  return ret;
--
+		}
--
+	    }
--
+	  /* Otherwise, we fall through as it was a NEXT */
--
+	}
-+
+      /* Apply this index. */
-+
+      ret = route_map_apply_match (&index->match_list, prefix, type, object);
-+
-+
+      /* Now we apply the matrix from above */
-+
+      if (ret == RMAP_NOMATCH)
-+
+        /* 'cont' from matrix - continue to next route-map sequence */
-+
+        continue;
-+
+      else if (ret == RMAP_MATCH)
-+
+        {
-+
+          if (index->type == RMAP_PERMIT)
-+
+            /* 'action' */
-+
+            {
-+
+              /* permit+match must execute sets */
-+
+              for (set = index->set_list.head; set; set = set->next)
-+
+                ret = (*set->cmd->func_apply) (set->value, prefix,
-+
+                                               type, object);
-+
+              switch (index->exitpolicy)
-+
+                {
-+
+                  case RMAP_EXIT:
-+
+                    return ret;
-+
+                  case RMAP_NEXT:
-+
+                    continue;
-+
+                  case RMAP_GOTO:
-+
+                    {
-+
+                      /* Find the next clause to jump to */
-+
+                      struct route_map_index *next = index->next;
-+
-+
+                      while (next && next->pref < index->nextpref)
-+
+                        {
-+
+                          index = next;
-+
+                          next = next->next;
-+
+                        }
-+
+                      if (next == NULL)
-+
+                        {
-+
+                          /* No clauses match! */
-+
+                          return ret;
-+
+                        }
-+
+                    }
-+
+                }
-+
+            }
-+
+          else if (index->type == RMAP_DENY)
-+
+            /* 'deny' */
-+
+            {
-+
+              if (index->exitpolicy == RMAP_NEXT)
-+
+                continue;
-+
+              else
-+
+                return RMAP_DENYMATCH;
-+
+            }
-+
+        }
-768
+    }
-769
+  /* Finally route-map does not match at all. */
-770
+  return RMAP_DENYMATCH;
-771
+}
-772
-773
+void
-774
+route_map_add_hook (void (*func) (char *))
-775
+{
-776
+  route_map_master.add_hook = func;
-777
+}

quagga-snap

Commits

Jira Issues

Add shortcut