Lines Matching defs:li
440 struct leaf_info *li = kmalloc(sizeof(struct leaf_info), GFP_KERNEL);
441 if (li) {
442 li->plen = plen;
443 INIT_LIST_HEAD(&li->falh);
445 return li;
919 struct leaf_info *li;
921 hlist_for_each_entry_rcu(li, node, head, hlist)
922 if (li->plen == plen)
923 return li;
930 struct leaf_info *li = find_leaf_info(l, plen);
932 if (!li)
935 return &li->falh;
940 struct leaf_info *li = NULL, *last = NULL;
946 hlist_for_each_entry(li, node, head, hlist) {
947 if (new->plen > li->plen)
950 last = li;
955 hlist_add_before_rcu(&new->hlist, &li->hlist);
1039 struct leaf_info *li;
1093 li = leaf_info_new(plen);
1095 if (!li)
1098 fa_head = &li->falh;
1099 insert_leaf_info(&l->list, li);
1108 li = leaf_info_new(plen);
1110 if (!li) {
1115 fa_head = &li->falh;
1116 insert_leaf_info(&l->list, li);
1146 free_leaf_info(li);
1354 struct leaf_info *li;
1358 hlist_for_each_entry_rcu(li, node, hhead, hlist) {
1360 int plen = li->plen;
1366 err = fib_semantic_match(&li->falh, flp, res, plen);
1612 struct leaf_info *li;
1664 li = find_leaf_info(l, plen);
1669 hlist_del_rcu(&li->hlist);
1670 free_leaf_info(li);
1707 struct leaf_info *li = NULL;
1709 hlist_for_each_entry_safe(li, node, tmp, lih, hlist) {
1710 found += trie_flush_list(&li->falh);
1712 if (list_empty(&li->falh)) {
1713 hlist_del_rcu(&li->hlist);
1714 free_leaf_info(li);
1931 struct leaf_info *li;
1939 hlist_for_each_entry_rcu(li, node, &l->list, hlist) {
1948 if (list_empty(&li->falh))
1951 if (fn_trie_dump_fa(l->key, li->plen, &li->falh, tb, skb, cb) < 0) {
2131 struct leaf_info *li;
2139 hlist_for_each_entry_rcu(li, tmp, &l->list, hlist)
2419 struct leaf_info *li;
2426 hlist_for_each_entry_rcu(li, node, &l->list, hlist) {
2429 list_for_each_entry_rcu(fa, &li->falh, fa_list) {
2433 seq_printf(seq, " /%d %s %s", li->plen,
2571 struct leaf_info *li;
2581 hlist_for_each_entry_rcu(li, node, &l->list, hlist) {
2585 mask = inet_make_mask(li->plen);
2588 list_for_each_entry_rcu(fa, &li->falh, fa_list) {