return nseq;
 }
 
-/**
+/*
+ * nameseq_delete_empty - deletes a name sequence structure if now unused
+ */
+static void nameseq_delete_empty(struct name_seq *seq)
+{
+       if (!seq->first_free && list_empty(&seq->subscriptions)) {
+               hlist_del_init(&seq->ns_list);
+               kfree(seq->sseqs);
+               kfree(seq);
+       }
+}
+
+/*
  * nameseq_find_subseq - find sub-sequence (if any) matching a name instance
  *
  * Very time-critical, so binary searches through sub-sequence array.
                return NULL;
 
        publ = tipc_nameseq_remove_publ(seq, lower, node, ref, key);
-
-       if (!seq->first_free && list_empty(&seq->subscriptions)) {
-               hlist_del_init(&seq->ns_list);
-               kfree(seq->sseqs);
-               kfree(seq);
-       }
+       nameseq_delete_empty(seq);
        return publ;
 }
 
                spin_lock_bh(&seq->lock);
                list_del_init(&s->nameseq_list);
                spin_unlock_bh(&seq->lock);
-               if ((seq->first_free == 0) && list_empty(&seq->subscriptions)) {
-                       hlist_del_init(&seq->ns_list);
-                       kfree(seq->sseqs);
-                       kfree(seq);
-               }
+               nameseq_delete_empty(seq);
        }
        write_unlock_bh(&tipc_nametbl_lock);
 }