2 * Copyright (c) 2016 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
16 #include <vnet/fib/fib_walk.h>
17 #include <vnet/fib/fib_node_list.h>
22 typedef enum fib_walk_flags_t_
26 * This walk will run to completion, i.e. visit ALL the children.
27 * It is a depth first traversal of the graph.
29 FIB_WALK_FLAG_SYNC = (1 << 0),
31 * An asynchronous walk.
32 * This walk will be scheduled to run in the background. It will thus visits
33 * the children at a later point in time.
34 * It is a depth first traversal of the graph.
36 FIB_WALK_FLAG_ASYNC = (1 << 1),
38 * An indication that the walk is currently executing.
40 FIB_WALK_FLAG_EXECUTING = (1 << 2),
44 * A representation of a graph walk from a parent object to its children
46 typedef struct fib_walk_t_
49 * FIB node linkage. This object is not in the FIB object graph,
50 * but it is present in other node's dependency lists, so it needs to
58 fib_walk_flags_t fw_flags;
61 * Sibling index in the dependency list
66 * Sibling index in the list of all walks
71 * Pointer to the node whose dependants this walk is walking
73 fib_node_ptr_t fw_parent;
76 * Number of nodes visited by this walk. saved for debugging purposes.
81 * Time the walk started
86 * The reasons this walk is occuring.
87 * This is a vector ordered in time. The reasons and the front were started
88 * first, and so should be acted first when a node is visisted.
90 fib_node_back_walk_ctx_t *fw_ctx;
94 * @brief The pool of all walk objects
96 static fib_walk_t *fib_walk_pool;
99 * @brief There's only one event type sent to the walk process
101 #define FIB_WALK_EVENT 0
104 * Statistics maintained per-walk queue
106 typedef enum fib_walk_queue_stats_t_
110 } fib_walk_queue_stats_t;
111 #define FIB_WALK_QUEUE_STATS_NUM (FIB_WALK_COMPLETED+1)
113 #define FIB_WALK_QUEUE_STATS { \
114 [FIB_WALK_SCHEDULED] = "scheduled", \
115 [FIB_WALK_COMPLETED] = "completed", \
118 #define FOR_EACH_FIB_WALK_QUEUE_STATS(_wqs) \
119 for ((_wqs) = FIB_WALK_SCHEDULED; \
120 (_wqs) < FIB_WALK_QUEUE_STATS_NUM; \
124 * The names of the walk stats
126 static const char * const fib_walk_queue_stats_names[] = FIB_WALK_QUEUE_STATS;
129 * A represenation of one queue of walk
131 typedef struct fib_walk_queue_t_
136 u64 fwq_stats[FIB_WALK_QUEUE_STATS_NUM];
139 * The node list which acts as the queue
141 fib_node_list_t fwq_queue;
145 * A set of priority queues for outstanding walks
147 typedef struct fib_walk_queues_t_
149 fib_walk_queue_t fwqs_queues[FIB_WALK_PRIORITY_NUM];
153 * The global queues of outstanding walks
155 static fib_walk_queues_t fib_walk_queues;
158 * The names of the walk priorities
160 static const char * const fib_walk_priority_names[] = FIB_WALK_PRIORITIES;
163 * @brief Histogram stats on the lenths of each walk in elemenets visisted.
164 * Store upto 1<<23 elements in increments of 1<<10
166 #define HISTOGRAM_VISITS_PER_WALK_MAX (1<<23)
167 #define HISTOGRAM_VISITS_PER_WALK_INCR (1<<10)
168 #define HISTOGRAM_VISITS_PER_WALK_N_BUCKETS \
169 (HISTOGRAM_VISITS_PER_WALK_MAX/HISTOGRAM_VISITS_PER_WALK_INCR)
170 static u64 fib_walk_hist_vists_per_walk[HISTOGRAM_VISITS_PER_WALK_N_BUCKETS];
173 * @brief History of state for the last 128 walks
175 #define HISTORY_N_WALKS 128
176 static u32 history_last_walk_pos;
177 typedef struct fib_walk_history_t_ {
180 fib_node_ptr_t fwh_parent;
181 } fib_walk_history_t;
182 static fib_walk_history_t fib_walk_history[HISTORY_N_WALKS];
185 format_fib_walk_priority (u8 *s, va_list ap)
187 fib_walk_priority_t prio = va_arg(ap, fib_walk_priority_t);
189 ASSERT(prio < FIB_WALK_PRIORITY_NUM);
191 return (format(s, "%s", fib_walk_priority_names[prio]));
194 format_fib_walk_queue_stats (u8 *s, va_list ap)
196 fib_walk_queue_stats_t wqs = va_arg(ap, fib_walk_queue_stats_t);
198 ASSERT(wqs < FIB_WALK_QUEUE_STATS_NUM);
200 return (format(s, "%s", fib_walk_queue_stats_names[wqs]));
204 fib_walk_get_index (fib_walk_t *fwalk)
206 return (fwalk - fib_walk_pool);
210 fib_walk_get (index_t fwi)
212 return (pool_elt_at_index(fib_walk_pool, fwi));
216 * not static so it can be used in the unit tests
219 fib_walk_queue_get_size (fib_walk_priority_t prio)
221 return (fib_node_list_get_size(fib_walk_queues.fwqs_queues[prio].fwq_queue));
224 static fib_node_index_t
225 fib_walk_queue_get_front (fib_walk_priority_t prio)
229 fib_node_list_get_front(fib_walk_queues.fwqs_queues[prio].fwq_queue, &wp);
231 return (wp.fnp_index);
235 fib_walk_destroy (fib_walk_t *fwalk)
239 if (FIB_NODE_INDEX_INVALID != fwalk->fw_prio_sibling)
241 fib_node_list_elt_remove(fwalk->fw_prio_sibling);
243 fib_node_child_remove(fwalk->fw_parent.fnp_type,
244 fwalk->fw_parent.fnp_index,
245 fwalk->fw_dep_sibling);
248 * add the stats to the continuous histogram collection.
250 bucket = (fwalk->fw_n_visits / HISTOGRAM_VISITS_PER_WALK_INCR);
251 bucket = (bucket > HISTOGRAM_VISITS_PER_WALK_N_BUCKETS ?
252 HISTOGRAM_VISITS_PER_WALK_N_BUCKETS - 1 :
254 fib_walk_hist_vists_per_walk[bucket]++;
257 * save stats to the recent history
260 fib_walk_history[history_last_walk_pos].fwh_n_visits =
262 fib_walk_history[history_last_walk_pos].fwh_duration =
263 vlib_time_now(vlib_get_main()) - fwalk->fw_start_time;
264 fib_walk_history[history_last_walk_pos].fwh_parent =
267 history_last_walk_pos = (history_last_walk_pos + 1) % HISTORY_N_WALKS;
269 fib_node_deinit(&fwalk->fw_node);
270 pool_put(fib_walk_pool, fwalk);
274 * return code when advancing a walk
276 typedef enum fib_walk_advance_rc_t_
279 * The walk is complete
281 FIB_WALK_ADVANCE_DONE,
283 * the walk has more work
285 FIB_WALK_ADVANCE_MORE,
287 * The walk merged with the one in front
289 FIB_WALK_ADVANCE_MERGE,
290 } fib_walk_advance_rc_t;
293 * @brief Advance the walk one element in its work list
295 static fib_walk_advance_rc_t
296 fib_walk_advance (fib_node_index_t fwi)
298 fib_node_back_walk_ctx_t *ctx;
299 fib_node_back_walk_rc_t wrc;
300 fib_node_ptr_t sibling;
305 * this walk function is re-entrant - walks acan spawn walks.
306 * fib_walk_t objects come from a pool, so they can realloc. we need
307 * to retch from said pool at the appropriate times.
309 fwalk = fib_walk_get(fwi);
311 more_elts = fib_node_list_elt_get_next(fwalk->fw_dep_sibling, &sibling);
315 vec_foreach(ctx, fwalk->fw_ctx)
317 wrc = fib_node_back_walk_one(&sibling, ctx);
319 fwalk = fib_walk_get(fwi);
320 fwalk->fw_n_visits++;
322 if (FIB_NODE_BACK_WALK_MERGE == wrc)
325 * this walk has merged with the one further along the node's
328 return (FIB_WALK_ADVANCE_MERGE);
332 * move foward to the next node to visit
334 more_elts = fib_node_list_advance(fwalk->fw_dep_sibling);
339 return (FIB_WALK_ADVANCE_MORE);
342 return (FIB_WALK_ADVANCE_DONE);
346 * @breif Enurmerate the times of sleep between walks
348 typedef enum fib_walk_sleep_type_t_
350 FIB_WALK_SHORT_SLEEP,
352 } fib_walk_sleep_type_t;
354 #define FIB_WALK_N_SLEEP (FIB_WALK_LONG_SLEEP+1)
357 * @brief Durations for the sleep types
359 static f64 fib_walk_sleep_duration[] = {
360 [FIB_WALK_LONG_SLEEP] = 1e-3,
361 [FIB_WALK_SHORT_SLEEP] = 1e-8,
365 * @brief The time quota for a walk. When more than this amount of time is
366 * spent, the walk process will yield.
368 static f64 quota = 1e-4;
371 * Histogram on the amount of work done (in msecs) in each walk
373 #define N_TIME_BUCKETS 128
374 #define TIME_INCREMENTS (N_TIME_BUCKETS/2)
375 static u64 fib_walk_work_time_taken[N_TIME_BUCKETS];
378 * Histogram on the number of nodes visted in each quota
380 #define N_ELTS_BUCKETS 128
381 static u32 fib_walk_work_nodes_visisted_incr = 2;
382 static u64 fib_walk_work_nodes_visited[N_ELTS_BUCKETS];
385 * Histogram of the sleep lengths
387 static u64 fib_walk_sleep_lengths[2];
390 * @brief Service the queues
391 * This is not declared static so that it can be unit tested - i know i know...
394 fib_walk_process_queues (vlib_main_t * vm,
397 f64 start_time, consumed_time;
398 fib_walk_sleep_type_t sleep;
399 fib_walk_priority_t prio;
400 fib_walk_advance_rc_t rc;
401 fib_node_index_t fwi;
407 start_time = vlib_time_now(vm);
410 FOR_EACH_FIB_WALK_PRIORITY(prio)
412 while (0 != fib_walk_queue_get_size(prio))
414 fwi = fib_walk_queue_get_front(prio);
417 * set this walk as executing
419 fwalk = fib_walk_get(fwi);
420 fwalk->fw_flags |= FIB_WALK_FLAG_EXECUTING;
424 rc = fib_walk_advance(fwi);
426 consumed_time = (vlib_time_now(vm) - start_time);
427 } while ((consumed_time < quota) &&
428 (FIB_WALK_ADVANCE_MORE == rc));
431 * if this walk has no more work then pop it from the queue
432 * and move on to the next.
434 if (FIB_WALK_ADVANCE_MORE != rc)
436 fwalk = fib_walk_get(fwi);
437 fib_walk_destroy(fwalk);
438 fib_walk_queues.fwqs_queues[prio].fwq_stats[FIB_WALK_COMPLETED]++;
443 * passed our work quota. sleep time.
445 fwalk = fib_walk_get(fwi);
446 fwalk->fw_flags &= ~FIB_WALK_FLAG_EXECUTING;
447 sleep = FIB_WALK_SHORT_SLEEP;
448 goto that_will_do_for_now;
453 * got to the end of all the work
455 sleep = FIB_WALK_LONG_SLEEP;
457 that_will_do_for_now:
461 * - for the number of nodes visisted we store 128 increments
462 * - for the time consumed we store quota/TIME_INCREMENTS increments.
464 bucket = ((n_elts/fib_walk_work_nodes_visisted_incr) > N_ELTS_BUCKETS ?
466 n_elts/fib_walk_work_nodes_visisted_incr);
467 ++fib_walk_work_nodes_visited[bucket];
469 bucket = (consumed_time - quota) / (quota / TIME_INCREMENTS);
470 bucket += N_TIME_BUCKETS/2;
471 bucket = (bucket < 0 ? 0 : bucket);
472 bucket = (bucket > N_TIME_BUCKETS-1 ? N_TIME_BUCKETS-1 : bucket);
473 ++fib_walk_work_time_taken[bucket];
475 ++fib_walk_sleep_lengths[sleep];
477 return (fib_walk_sleep_duration[sleep]);
481 * @brief The 'fib-walk' process's main loop.
484 fib_walk_process (vlib_main_t * vm,
485 vlib_node_runtime_t * node,
490 sleep_time = fib_walk_sleep_duration[FIB_WALK_SHORT_SLEEP];
494 vlib_process_wait_for_event_or_clock(vm, sleep_time);
497 * there may be lots of event queued between the processes,
498 * but the walks we want to schedule are in the priority queues,
499 * so we ignore the process events.
501 vlib_process_get_events(vm, NULL);
503 sleep_time = fib_walk_process_queues(vm, quota);
514 VLIB_REGISTER_NODE (fib_walk_process_node,static) = {
515 .function = fib_walk_process,
516 .type = VLIB_NODE_TYPE_PROCESS,
522 * @brief Allocate a new walk object
525 fib_walk_alloc (fib_node_type_t parent_type,
526 fib_node_index_t parent_index,
527 fib_walk_flags_t flags,
528 fib_node_back_walk_ctx_t *ctx)
532 pool_get(fib_walk_pool, fwalk);
534 fib_node_init(&fwalk->fw_node, FIB_NODE_TYPE_WALK);
536 fwalk->fw_flags = flags;
537 fwalk->fw_dep_sibling = FIB_NODE_INDEX_INVALID;
538 fwalk->fw_prio_sibling = FIB_NODE_INDEX_INVALID;
539 fwalk->fw_parent.fnp_index = parent_index;
540 fwalk->fw_parent.fnp_type = parent_type;
541 fwalk->fw_ctx = NULL;
542 fwalk->fw_start_time = vlib_time_now(vlib_get_main());
543 fwalk->fw_n_visits = 0;
546 * make a copy of the backwalk context so the depth count remains
547 * the same for each sibling visitsed. This is important in the case
548 * where a parents has a loop via one child, but all the others are not.
549 * if the looped child were visited first, the depth count would exceed, the
550 * max and the walk would terminate before it reached the other siblings.
552 vec_add1(fwalk->fw_ctx, *ctx);
558 * @brief Enqueue a walk onto the appropriate priority queue. Then signal
559 * the background process there is work to do.
562 fib_walk_prio_queue_enquue (fib_walk_priority_t prio,
567 sibling = fib_node_list_push_front(fib_walk_queues.fwqs_queues[prio].fwq_queue,
570 fib_walk_get_index(fwalk));
571 fib_walk_queues.fwqs_queues[prio].fwq_stats[FIB_WALK_SCHEDULED]++;
574 * poke the fib-walk process to perform the async walk.
575 * we are not passing it specific data, hence the last two args,
576 * the process will drain the queues
578 vlib_process_signal_event(vlib_get_main(),
579 fib_walk_process_node.index,
587 fib_walk_async (fib_node_type_t parent_type,
588 fib_node_index_t parent_index,
589 fib_walk_priority_t prio,
590 fib_node_back_walk_ctx_t *ctx)
594 if (FIB_NODE_GRAPH_MAX_DEPTH < ++ctx->fnbw_depth)
597 * The walk has reached the maximum depth. there is a loop in the graph.
603 fwalk = fib_walk_alloc(parent_type,
608 fwalk->fw_dep_sibling = fib_node_child_add(parent_type,
611 fib_walk_get_index(fwalk));
613 fwalk->fw_prio_sibling = fib_walk_prio_queue_enquue(prio, fwalk);
617 * @brief Back walk all the children of a FIB node.
619 * note this is a synchronous depth first walk. Children visited may propagate
620 * the walk to thier children. Other children node types may not propagate,
621 * synchronously but instead queue the walk for later async completion.
624 fib_walk_sync (fib_node_type_t parent_type,
625 fib_node_index_t parent_index,
626 fib_node_back_walk_ctx_t *ctx)
628 fib_walk_advance_rc_t rc;
629 fib_node_index_t fwi;
632 if (FIB_NODE_GRAPH_MAX_DEPTH < ++ctx->fnbw_depth)
635 * The walk has reached the maximum depth. there is a loop in the graph.
641 fwalk = fib_walk_alloc(parent_type,
646 fwalk->fw_dep_sibling = fib_node_child_add(parent_type,
649 fib_walk_get_index(fwalk));
650 fwi = fib_walk_get_index(fwalk);
655 * set this walk as executing
657 fwalk->fw_flags |= FIB_WALK_FLAG_EXECUTING;
661 rc = fib_walk_advance(fwi);
662 } while (FIB_WALK_ADVANCE_MORE == rc);
666 * this walk function is re-entrant - walks can spawn walks.
667 * fib_walk_t objects come from a pool, so they can realloc. we need
668 * to re-fetch from said pool at the appropriate times.
670 fwalk = fib_walk_get(fwi);
672 if (FIB_WALK_ADVANCE_MERGE == rc)
675 * this sync walk merged with an walk in front.
676 * by reqeusting a sync walk the client wanted all children walked,
677 * so we ditch the walk object in hand and continue with the one
680 fib_node_ptr_t merged_walk;
682 fib_node_list_elt_get_next(fwalk->fw_dep_sibling, &merged_walk);
684 ASSERT(FIB_NODE_INDEX_INVALID != merged_walk.fnp_index);
685 ASSERT(FIB_NODE_TYPE_WALK == merged_walk.fnp_type);
687 fib_walk_destroy(fwalk);
689 fwi = merged_walk.fnp_index;
690 fwalk = fib_walk_get(fwi);
692 if (FIB_WALK_FLAG_EXECUTING & fwalk->fw_flags)
695 * we are executing a sync walk, and we have met with another
696 * walk that is also executing. since only one walk executs at once
697 * (there is no multi-threading) this implies we have met ourselves
698 * and hence the is a loop in the graph.
699 * This function is re-entrant, so the walk object we met is being
700 * acted on in a stack frame below this one. We must therefore not
701 * continue with it now, but let the stack unwind and along the
702 * appropriate frame to read the depth count and bail.
711 * the walk reached the end of the depdency list.
719 fib_walk_destroy(fwalk);
724 fib_walk_get_node (fib_node_index_t index)
728 fwalk = fib_walk_get(index);
730 return (&(fwalk->fw_node));
734 * Walk objects are not parents, nor are they locked.
738 fib_walk_last_lock_gone (fib_node_t *node)
744 fib_walk_get_from_node (fib_node_t *node)
746 return ((fib_walk_t*)(((char*)node) -
747 STRUCT_OFFSET_OF(fib_walk_t, fw_node)));
751 * @brief Another back walk has reach this walk.
752 * Megre them so there is only one left. It is this node being
753 * visited that will remain, so copy or merge the context onto it.
755 static fib_node_back_walk_rc_t
756 fib_walk_back_walk_notify (fib_node_t *node,
757 fib_node_back_walk_ctx_t *ctx)
759 fib_node_back_walk_ctx_t *old;
762 fwalk = fib_walk_get_from_node(node);
765 * check whether the walk context can be merge with another,
766 * or whether it needs to be appended.
768 vec_foreach(old, fwalk->fw_ctx)
771 * we can merge walks if the reason for the walk is the same.
773 if (old->fnbw_reason == ctx->fnbw_reason)
776 * copy the largest of the depth values. in the presence of a loop,
777 * the same walk will merge with itself. if we take the smaller depth
778 * then it will never end.
780 old->fnbw_depth = ((old->fnbw_depth >= ctx->fnbw_depth) ?
788 * walks could not be merged, this means that the walk infront needs to
789 * perform different action to this one that has caught up. the one in front
790 * was scheduled first so append the new walk context to the back of the list.
792 vec_add1(fwalk->fw_ctx, *ctx);
795 return (FIB_NODE_BACK_WALK_MERGE);
799 * The FIB walk's graph node virtual function table
801 static const fib_node_vft_t fib_walk_vft = {
802 .fnv_get = fib_walk_get_node,
803 .fnv_last_lock = fib_walk_last_lock_gone,
804 .fnv_back_walk = fib_walk_back_walk_notify,
808 fib_walk_module_init (void)
810 fib_walk_priority_t prio;
812 FOR_EACH_FIB_WALK_PRIORITY(prio)
814 fib_walk_queues.fwqs_queues[prio].fwq_queue = fib_node_list_create();
817 fib_node_register_type(FIB_NODE_TYPE_WALK, &fib_walk_vft);
821 format_fib_walk (u8* s, va_list ap)
823 fib_node_index_t fwi = va_arg(ap, fib_node_index_t);
826 fwalk = fib_walk_get(fwi);
828 return (format(s, " parent:{%s:%d} visits:%d flags:%d",
829 fib_node_type_get_name(fwalk->fw_parent.fnp_type),
830 fwalk->fw_parent.fnp_index,
835 static clib_error_t *
836 fib_walk_show (vlib_main_t * vm,
837 unformat_input_t * input,
838 vlib_cli_command_t * cmd)
840 fib_walk_queue_stats_t wqs;
841 fib_walk_priority_t prio;
842 fib_node_ptr_t sibling;
843 fib_node_index_t fwi;
849 vlib_cli_output(vm, "FIB Walk Quota = %.2fusec:", quota * USEC);
850 vlib_cli_output(vm, "FIB Walk queues:");
852 FOR_EACH_FIB_WALK_PRIORITY(prio)
854 vlib_cli_output(vm, " %U priority queue:",
855 format_fib_walk_priority, prio);
856 vlib_cli_output(vm, " Stats: ");
858 FOR_EACH_FIB_WALK_QUEUE_STATS(wqs)
860 vlib_cli_output(vm, " %U:%d",
861 format_fib_walk_queue_stats, wqs,
862 fib_walk_queues.fwqs_queues[prio].fwq_stats[wqs]);
864 vlib_cli_output(vm, " Occupancy:%d",
865 fib_node_list_get_size(
866 fib_walk_queues.fwqs_queues[prio].fwq_queue));
868 more_elts = fib_node_list_get_front(
869 fib_walk_queues.fwqs_queues[prio].fwq_queue,
874 ASSERT(FIB_NODE_INDEX_INVALID != sibling.fnp_index);
875 ASSERT(FIB_NODE_TYPE_WALK == sibling.fnp_type);
877 fwi = sibling.fnp_index;
878 fwalk = fib_walk_get(fwi);
880 vlib_cli_output(vm, " %U", format_fib_walk, fwi);
882 more_elts = fib_node_list_elt_get_next(fwalk->fw_prio_sibling,
887 vlib_cli_output(vm, "Histogram Statistics:");
888 vlib_cli_output(vm, " Number of Elements visit per-quota:");
889 for (ii = 0; ii < N_ELTS_BUCKETS; ii++)
891 if (0 != fib_walk_work_nodes_visited[ii])
892 s = format(s, "%d:%d ",
893 (ii * fib_walk_work_nodes_visisted_incr),
894 fib_walk_work_nodes_visited[ii]);
896 vlib_cli_output(vm, " %v", s);
899 vlib_cli_output(vm, " Time consumed per-quota (Quota=%f usec):", quota*USEC);
900 s = format(s, "0:%d ", fib_walk_work_time_taken[0]);
901 for (ii = 1; ii < N_TIME_BUCKETS; ii++)
903 if (0 != fib_walk_work_time_taken[ii])
904 s = format(s, "%d:%d ", (u32)((((ii - N_TIME_BUCKETS/2) *
905 (quota / TIME_INCREMENTS)) + quota) *
907 fib_walk_work_time_taken[ii]);
909 vlib_cli_output(vm, " %v", s);
912 vlib_cli_output(vm, " Sleep Types:");
913 vlib_cli_output(vm, " Short Long:");
914 vlib_cli_output(vm, " %d %d:",
915 fib_walk_sleep_lengths[FIB_WALK_SHORT_SLEEP],
916 fib_walk_sleep_lengths[FIB_WALK_LONG_SLEEP]);
918 vlib_cli_output(vm, " Number of Elements visited per-walk:");
919 for (ii = 0; ii < HISTOGRAM_VISITS_PER_WALK_N_BUCKETS; ii++)
921 if (0 != fib_walk_hist_vists_per_walk[ii])
922 s = format(s, "%d:%d ",
923 ii*HISTOGRAM_VISITS_PER_WALK_INCR,
924 fib_walk_hist_vists_per_walk[ii]);
926 vlib_cli_output(vm, " %v", s);
930 vlib_cli_output(vm, "Brief History (last %d walks):", HISTORY_N_WALKS);
931 ii = history_last_walk_pos;
934 if (0 != fib_walk_history[ii].fwh_n_visits)
937 vm, " %s:%d visits:%d duration:%.2f ",
938 fib_node_type_get_name(fib_walk_history[ii].fwh_parent.fnp_type),
939 fib_walk_history[ii].fwh_parent.fnp_index,
940 fib_walk_history[ii].fwh_n_visits,
941 fib_walk_history[ii].fwh_duration);
944 ii = (ii + 1) % HISTORY_N_WALKS;
945 } while (ii != history_last_walk_pos);
951 VLIB_CLI_COMMAND (fib_walk_show_command, static) = {
952 .path = "show fib walk",
953 .short_help = "show fib walk",
954 .function = fib_walk_show,
957 static clib_error_t *
958 fib_walk_set_quota (vlib_main_t * vm,
959 unformat_input_t * input,
960 vlib_cli_command_t * cmd)
962 clib_error_t * error = NULL;
965 if (unformat (input, "%f", &new_quota))
971 error = clib_error_return(0 , "Pass a float value");
977 VLIB_CLI_COMMAND (fib_walk_set_quota_command, static) = {
978 .path = "set fib walk quota",
979 .short_help = "set fib walk quota",
980 .function = fib_walk_set_quota,
983 static clib_error_t *
984 fib_walk_set_histogram_elements_size (vlib_main_t * vm,
985 unformat_input_t * input,
986 vlib_cli_command_t * cmd)
988 clib_error_t * error = NULL;
991 if (unformat (input, "%d", &new))
993 fib_walk_work_nodes_visisted_incr = new;
997 error = clib_error_return(0 , "Pass an int value");
1003 VLIB_CLI_COMMAND (fib_walk_set_histogram_elements_size_command, static) = {
1004 .path = "set fib walk histogram elements size",
1005 .short_help = "set fib walk histogram elements size",
1006 .function = fib_walk_set_histogram_elements_size,
1009 static clib_error_t *
1010 fib_walk_clear (vlib_main_t * vm,
1011 unformat_input_t * input,
1012 vlib_cli_command_t * cmd)
1014 memset(fib_walk_hist_vists_per_walk, 0, sizeof(fib_walk_hist_vists_per_walk));
1015 memset(fib_walk_history, 0, sizeof(fib_walk_history));
1016 memset(fib_walk_work_time_taken, 0, sizeof(fib_walk_work_time_taken));
1017 memset(fib_walk_work_nodes_visited, 0, sizeof(fib_walk_work_nodes_visited));
1018 memset(fib_walk_sleep_lengths, 0, sizeof(fib_walk_sleep_lengths));
1023 VLIB_CLI_COMMAND (fib_walk_clear_command, static) = {
1024 .path = "clear fib walk",
1025 .short_help = "clear fib walk",
1026 .function = fib_walk_clear,