64     const int ndx = splaytree_djbhash(name, len);  in stat_cache_sptree_find()  local
65     *sptree = splaytree_splay(*sptree, ndx);  in stat_cache_sptree_find()
66     return (*sptree && (*sptree)->key == ndx) ? (*sptree)->data : NULL;  in stat_cache_sptree_find()
282 static void fam_dir_tag_refcnt(splay_tree *t, int *keys, int *ndx)  in fam_dir_tag_refcnt()  argument
284     if (*ndx == 512) return; /*(must match num array entries in keys[])*/  in fam_dir_tag_refcnt()
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()
287     if (*ndx == 512) return; /*(must match num array entries in keys[])*/  in fam_dir_tag_refcnt()
292         keys[(*ndx)++] = t->key;  in fam_dir_tag_refcnt()
309             const int ndx = keys[i];  in fam_dir_periodic_cleanup()  local
310             splay_tree *node = scf->dirs = splaytree_splay(scf->dirs, ndx);  in fam_dir_periodic_cleanup()
311             if (node && node->key == ndx) {  in fam_dir_periodic_cleanup()
313                 scf->dirs = splaytree_delete(scf->dirs, ndx);  in fam_dir_periodic_cleanup()
426             int ndx = (int)(intptr_t)kev->udata;  in stat_cache_handle_fdevent_in()
427             scf->dirs = splaytree_splay(scf->dirs, ndx);  in stat_cache_handle_fdevent_in()
428             if (!scf->dirs || scf->dirs->key != ndx)  in stat_cache_handle_fdevent_in()
453     for (int i = 0, ndx; i || (i = FAMPending(&scf->fam)) > 0; --i) {  in stat_cache_handle_fdevent_in()
459         ndx = (int)(intptr_t)fe.userdata;  in stat_cache_handle_fdevent_in()
460         scf->dirs = splaytree_splay(scf->dirs, ndx);  in stat_cache_handle_fdevent_in()
461         if (!scf->dirs || scf->dirs->key != ndx) {  in stat_cache_handle_fdevent_in()
1196                                     int *keys, int *ndx)  in stat_cache_tag_dir_tree()  argument
1198     if (*ndx == 8192) return; /*(must match num array entries in keys[])*/  in stat_cache_tag_dir_tree()
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()
1201     if (*ndx == 8192) return; /*(must match num array entries in keys[])*/  in stat_cache_tag_dir_tree()
1206         keys[(*ndx)++] = t->key;  in stat_cache_tag_dir_tree()
1220             const int ndx = keys[i];  in stat_cache_prune_dir_tree()  local
1221             splay_tree *node = sptree = splaytree_splay(sptree, ndx);  in stat_cache_prune_dir_tree()
1222             if (node && node->key == ndx) {  in stat_cache_prune_dir_tree()
1224                 sptree = splaytree_delete(sptree, ndx);  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
1486     if (*ndx == 8192) return; /*(must match num array entries in keys[])*/  in stat_cache_tag_old_entries()
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()
1491     if (*ndx == 8192) return; /*(must match num array entries in keys[])*/  in stat_cache_tag_old_entries()
1495         keys[(*ndx)++] = t->key;  in stat_cache_tag_old_entries()
1507             int ndx = keys[i];  in stat_cache_periodic_cleanup()  local
1508             sptree = splaytree_splay(sptree, ndx);  in stat_cache_periodic_cleanup()
1509             if (sptree && sptree->key == ndx) {  in stat_cache_periodic_cleanup()
1511                 sptree = splaytree_delete(sptree, ndx);  in stat_cache_periodic_cleanup()