282 static void fam_dir_tag_refcnt(splay_tree *t, int *keys, int *ndx)  in fam_dir_tag_refcnt()  argument
285     if (t->left)  fam_dir_tag_refcnt(t->left,  keys, ndx);  in fam_dir_tag_refcnt()
286     if (t->right) fam_dir_tag_refcnt(t->right, keys, ndx);  in fam_dir_tag_refcnt()
292         keys[(*ndx)++] = t->key;  in fam_dir_tag_refcnt()
300     int keys[512]; /* 2k size on stack */  in fam_dir_periodic_cleanup()  local
307         fam_dir_tag_refcnt(scf->dirs, keys, &max_ndx);  in fam_dir_periodic_cleanup()
309             const int ndx = keys[i];  in fam_dir_periodic_cleanup()
333     } while (max_ndx == sizeof(keys)/sizeof(int));  in fam_dir_periodic_cleanup()
1196                                     int *keys, int *ndx)  in stat_cache_tag_dir_tree()  argument
1199     if (t->left)  stat_cache_tag_dir_tree(t->left,  name, len, keys, ndx);  in stat_cache_tag_dir_tree()
1200     if (t->right) stat_cache_tag_dir_tree(t->right, name, len, keys, ndx);  in stat_cache_tag_dir_tree()
1206         keys[(*ndx)++] = t->key;  in stat_cache_tag_dir_tree()
1214     int keys[8192]; /* 32k size on stack */  in stat_cache_prune_dir_tree()  local
1218         stat_cache_tag_dir_tree(sptree, name, len, keys, &max_ndx);  in stat_cache_prune_dir_tree()
1220             const int ndx = keys[i];  in stat_cache_prune_dir_tree()
1227     } while (max_ndx == sizeof(keys)/sizeof(int));  in stat_cache_prune_dir_tree()
1485 static void stat_cache_tag_old_entries(splay_tree * const t, int * const keys, int * const ndx, con…  in stat_cache_tag_old_entries()  argument
1488         stat_cache_tag_old_entries(t->left, keys, ndx, max_age, cur_ts);  in stat_cache_tag_old_entries()
1490         stat_cache_tag_old_entries(t->right, keys, ndx, max_age, cur_ts);  in stat_cache_tag_old_entries()
1495         keys[(*ndx)++] = t->key;  in stat_cache_tag_old_entries()
1501     int keys[8192]; /* 32k size on stack */  in stat_cache_periodic_cleanup()  local
1505         stat_cache_tag_old_entries(sptree, keys, &max_ndx, max_age, cur_ts);  in stat_cache_periodic_cleanup()
1507             int ndx = keys[i];  in stat_cache_periodic_cleanup()
1514     } while (max_ndx == sizeof(keys)/sizeof(int));  in stat_cache_periodic_cleanup()