#include <linux/rcupdate.h>
 #include <linux/mutex.h>
 #include <linux/ftrace.h>
-#include <linux/refcount.h>
-#include <linux/freelist.h>
+#include <linux/objpool.h>
 #include <linux/rethook.h>
 #include <asm/kprobes.h>
 
  */
 struct kretprobe_holder {
        struct kretprobe        *rp;
-       refcount_t              ref;
+       struct objpool_head     pool;
 };
 
 struct kretprobe {
 #ifdef CONFIG_KRETPROBE_ON_RETHOOK
        struct rethook *rh;
 #else
-       struct freelist_head freelist;
        struct kretprobe_holder *rph;
 #endif
 };
 #ifdef CONFIG_KRETPROBE_ON_RETHOOK
        struct rethook_node node;
 #else
-       union {
-               struct freelist_node freelist;
-               struct rcu_head rcu;
-       };
+       struct rcu_head rcu;
        struct llist_node llist;
        struct kretprobe_holder *rph;
        kprobe_opcode_t *ret_addr;
 
 #define _LINUX_RETHOOK_H
 
 #include <linux/compiler.h>
-#include <linux/freelist.h>
+#include <linux/objpool.h>
 #include <linux/kallsyms.h>
 #include <linux/llist.h>
 #include <linux/rcupdate.h>
-#include <linux/refcount.h>
 
 struct rethook_node;
 
 struct rethook {
        void                    *data;
        rethook_handler_t       handler;
-       struct freelist_head    pool;
-       refcount_t              ref;
+       struct objpool_head     pool;
        struct rcu_head         rcu;
 };
 
 /**
  * struct rethook_node - The rethook shadow-stack entry node.
- * @freelist: The freelist, linked to struct rethook::pool.
  * @rcu: The rcu_head for deferred freeing.
  * @llist: The llist, linked to a struct task_struct::rethooks.
  * @rethook: The pointer to the struct rethook.
  * on each entry of the shadow stack.
  */
 struct rethook_node {
-       union {
-               struct freelist_node freelist;
-               struct rcu_head      rcu;
-       };
+       struct rcu_head         rcu;
        struct llist_node       llist;
        struct rethook          *rethook;
        unsigned long           ret_addr;
        unsigned long           frame;
 };
 
-struct rethook *rethook_alloc(void *data, rethook_handler_t handler);
+struct rethook *rethook_alloc(void *data, rethook_handler_t handler, int size, int num);
 void rethook_stop(struct rethook *rh);
 void rethook_free(struct rethook *rh);
-void rethook_add_node(struct rethook *rh, struct rethook_node *node);
 struct rethook_node *rethook_try_get(struct rethook *rh);
 void rethook_recycle(struct rethook_node *node);
 void rethook_hook(struct rethook_node *node, struct pt_regs *regs, bool mcount);
 #endif
 
 #endif
-
 
 #ifdef CONFIG_KRETPROBES
 
 #if !defined(CONFIG_KRETPROBE_ON_RETHOOK)
+
+/* callbacks for objpool of kretprobe instances */
+static int kretprobe_init_inst(void *nod, void *context)
+{
+       struct kretprobe_instance *ri = nod;
+
+       ri->rph = context;
+       return 0;
+}
+static int kretprobe_fini_pool(struct objpool_head *head, void *context)
+{
+       kfree(context);
+       return 0;
+}
+
 static void free_rp_inst_rcu(struct rcu_head *head)
 {
        struct kretprobe_instance *ri = container_of(head, struct kretprobe_instance, rcu);
+       struct kretprobe_holder *rph = ri->rph;
 
-       if (refcount_dec_and_test(&ri->rph->ref))
-               kfree(ri->rph);
-       kfree(ri);
+       objpool_drop(ri, &rph->pool);
 }
 NOKPROBE_SYMBOL(free_rp_inst_rcu);
 
        struct kretprobe *rp = get_kretprobe(ri);
 
        if (likely(rp))
-               freelist_add(&ri->freelist, &rp->freelist);
+               objpool_push(ri, &rp->rph->pool);
        else
                call_rcu(&ri->rcu, free_rp_inst_rcu);
 }
 
 static inline void free_rp_inst(struct kretprobe *rp)
 {
-       struct kretprobe_instance *ri;
-       struct freelist_node *node;
-       int count = 0;
-
-       node = rp->freelist.head;
-       while (node) {
-               ri = container_of(node, struct kretprobe_instance, freelist);
-               node = node->next;
-
-               kfree(ri);
-               count++;
-       }
+       struct kretprobe_holder *rph = rp->rph;
 
-       if (refcount_sub_and_test(count, &rp->rph->ref)) {
-               kfree(rp->rph);
-               rp->rph = NULL;
-       }
+       if (!rph)
+               return;
+       rp->rph = NULL;
+       objpool_fini(&rph->pool);
 }
 
 /* This assumes the 'tsk' is the current task or the is not running. */
 static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
 {
        struct kretprobe *rp = container_of(p, struct kretprobe, kp);
+       struct kretprobe_holder *rph = rp->rph;
        struct kretprobe_instance *ri;
-       struct freelist_node *fn;
 
-       fn = freelist_try_get(&rp->freelist);
-       if (!fn) {
+       ri = objpool_pop(&rph->pool);
+       if (!ri) {
                rp->nmissed++;
                return 0;
        }
 
-       ri = container_of(fn, struct kretprobe_instance, freelist);
-
        if (rp->entry_handler && rp->entry_handler(ri, regs)) {
-               freelist_add(&ri->freelist, &rp->freelist);
+               objpool_push(ri, &rph->pool);
                return 0;
        }
 
 int register_kretprobe(struct kretprobe *rp)
 {
        int ret;
-       struct kretprobe_instance *inst;
        int i;
        void *addr;
 
                rp->maxactive = max_t(unsigned int, 10, 2*num_possible_cpus());
 
 #ifdef CONFIG_KRETPROBE_ON_RETHOOK
-       rp->rh = rethook_alloc((void *)rp, kretprobe_rethook_handler);
-       if (!rp->rh)
-               return -ENOMEM;
+       rp->rh = rethook_alloc((void *)rp, kretprobe_rethook_handler,
+                               sizeof(struct kretprobe_instance) +
+                               rp->data_size, rp->maxactive);
+       if (IS_ERR(rp->rh))
+               return PTR_ERR(rp->rh);
 
-       for (i = 0; i < rp->maxactive; i++) {
-               inst = kzalloc(struct_size(inst, data, rp->data_size), GFP_KERNEL);
-               if (inst == NULL) {
-                       rethook_free(rp->rh);
-                       rp->rh = NULL;
-                       return -ENOMEM;
-               }
-               rethook_add_node(rp->rh, &inst->node);
-       }
        rp->nmissed = 0;
        /* Establish function entry probe point */
        ret = register_kprobe(&rp->kp);
                rp->rh = NULL;
        }
 #else  /* !CONFIG_KRETPROBE_ON_RETHOOK */
-       rp->freelist.head = NULL;
        rp->rph = kzalloc(sizeof(struct kretprobe_holder), GFP_KERNEL);
        if (!rp->rph)
                return -ENOMEM;
 
-       rp->rph->rp = rp;
-       for (i = 0; i < rp->maxactive; i++) {
-               inst = kzalloc(struct_size(inst, data, rp->data_size), GFP_KERNEL);
-               if (inst == NULL) {
-                       refcount_set(&rp->rph->ref, i);
-                       free_rp_inst(rp);
-                       return -ENOMEM;
-               }
-               inst->rph = rp->rph;
-               freelist_add(&inst->freelist, &rp->freelist);
+       if (objpool_init(&rp->rph->pool, rp->maxactive, rp->data_size +
+                       sizeof(struct kretprobe_instance), GFP_KERNEL,
+                       rp->rph, kretprobe_init_inst, kretprobe_fini_pool)) {
+               kfree(rp->rph);
+               rp->rph = NULL;
+               return -ENOMEM;
        }
-       refcount_set(&rp->rph->ref, i);
-
+       rp->rph->rp = rp;
        rp->nmissed = 0;
        /* Establish function entry probe point */
        ret = register_kprobe(&rp->kp);
 
 
 static int fprobe_init_rethook(struct fprobe *fp, int num)
 {
-       int i, size;
+       int size;
 
        if (num < 0)
                return -EINVAL;
        if (size < 0)
                return -E2BIG;
 
-       fp->rethook = rethook_alloc((void *)fp, fprobe_exit_handler);
-       if (!fp->rethook)
-               return -ENOMEM;
-       for (i = 0; i < size; i++) {
-               struct fprobe_rethook_node *node;
-
-               node = kzalloc(sizeof(*node) + fp->entry_data_size, GFP_KERNEL);
-               if (!node) {
-                       rethook_free(fp->rethook);
-                       fp->rethook = NULL;
-                       return -ENOMEM;
-               }
-               rethook_add_node(fp->rethook, &node->node);
-       }
+       /* Initialize rethook */
+       fp->rethook = rethook_alloc((void *)fp, fprobe_exit_handler,
+                               sizeof(struct fprobe_rethook_node), size);
+       if (IS_ERR(fp->rethook))
+               return PTR_ERR(fp->rethook);
+
        return 0;
 }
 
 static void fprobe_fail_cleanup(struct fprobe *fp)
 {
-       if (fp->rethook) {
+       if (!IS_ERR_OR_NULL(fp->rethook)) {
                /* Don't need to cleanup rethook->handler because this is not used. */
                rethook_free(fp->rethook);
                fp->rethook = NULL;
        if (!fprobe_is_registered(fp))
                return -EINVAL;
 
-       if (fp->rethook)
+       if (!IS_ERR_OR_NULL(fp->rethook))
                rethook_stop(fp->rethook);
 
        ret = unregister_ftrace_function(&fp->ops);
        if (ret < 0)
                return ret;
 
-       if (fp->rethook)
+       if (!IS_ERR_OR_NULL(fp->rethook))
                rethook_free(fp->rethook);
 
        ftrace_free_filter(&fp->ops);
 
 #include <linux/rethook.h>
 #include <linux/slab.h>
 #include <linux/sort.h>
+#include <linux/smp.h>
 
 /* Return hook list (shadow stack by list) */
 
 static void rethook_free_rcu(struct rcu_head *head)
 {
        struct rethook *rh = container_of(head, struct rethook, rcu);
-       struct rethook_node *rhn;
-       struct freelist_node *node;
-       int count = 1;
-
-       node = rh->pool.head;
-       while (node) {
-               rhn = container_of(node, struct rethook_node, freelist);
-               node = node->next;
-               kfree(rhn);
-               count++;
-       }
-
-       /* The rh->ref is the number of pooled node + 1 */
-       if (refcount_sub_and_test(count, &rh->ref))
-               kfree(rh);
+       objpool_fini(&rh->pool);
 }
 
 /**
        call_rcu(&rh->rcu, rethook_free_rcu);
 }
 
+static int rethook_init_node(void *nod, void *context)
+{
+       struct rethook_node *node = nod;
+
+       node->rethook = context;
+       return 0;
+}
+
+static int rethook_fini_pool(struct objpool_head *head, void *context)
+{
+       kfree(context);
+       return 0;
+}
+
 /**
  * rethook_alloc() - Allocate struct rethook.
  * @data: a data to pass the @handler when hooking the return.
- * @handler: the return hook callback function.
+ * @handler: the return hook callback function, must NOT be NULL
+ * @size: node size: rethook node and additional data
+ * @num: number of rethook nodes to be preallocated
  *
  * Allocate and initialize a new rethook with @data and @handler.
- * Return NULL if memory allocation fails or @handler is NULL.
+ * Return pointer of new rethook, or error codes for failures.
+ *
  * Note that @handler == NULL means this rethook is going to be freed.
  */
-struct rethook *rethook_alloc(void *data, rethook_handler_t handler)
+struct rethook *rethook_alloc(void *data, rethook_handler_t handler,
+                             int size, int num)
 {
-       struct rethook *rh = kzalloc(sizeof(struct rethook), GFP_KERNEL);
+       struct rethook *rh;
 
-       if (!rh || !handler) {
-               kfree(rh);
-               return NULL;
-       }
+       if (!handler || num <= 0 || size < sizeof(struct rethook_node))
+               return ERR_PTR(-EINVAL);
+
+       rh = kzalloc(sizeof(struct rethook), GFP_KERNEL);
+       if (!rh)
+               return ERR_PTR(-ENOMEM);
 
        rh->data = data;
        rh->handler = handler;
-       rh->pool.head = NULL;
-       refcount_set(&rh->ref, 1);
 
+       /* initialize the objpool for rethook nodes */
+       if (objpool_init(&rh->pool, num, size, GFP_KERNEL, rh,
+                        rethook_init_node, rethook_fini_pool)) {
+               kfree(rh);
+               return ERR_PTR(-ENOMEM);
+       }
        return rh;
 }
 
-/**
- * rethook_add_node() - Add a new node to the rethook.
- * @rh: the struct rethook.
- * @node: the struct rethook_node to be added.
- *
- * Add @node to @rh. User must allocate @node (as a part of user's
- * data structure.) The @node fields are initialized in this function.
- */
-void rethook_add_node(struct rethook *rh, struct rethook_node *node)
-{
-       node->rethook = rh;
-       freelist_add(&node->freelist, &rh->pool);
-       refcount_inc(&rh->ref);
-}
-
 static void free_rethook_node_rcu(struct rcu_head *head)
 {
        struct rethook_node *node = container_of(head, struct rethook_node, rcu);
+       struct rethook *rh = node->rethook;
 
-       if (refcount_dec_and_test(&node->rethook->ref))
-               kfree(node->rethook);
-       kfree(node);
+       objpool_drop(node, &rh->pool);
 }
 
 /**
        lockdep_assert_preemption_disabled();
 
        if (likely(READ_ONCE(node->rethook->handler)))
-               freelist_add(&node->freelist, &node->rethook->pool);
+               objpool_push(node, &node->rethook->pool);
        else
                call_rcu(&node->rcu, free_rethook_node_rcu);
 }
 struct rethook_node *rethook_try_get(struct rethook *rh)
 {
        rethook_handler_t handler = READ_ONCE(rh->handler);
-       struct freelist_node *fn;
 
        lockdep_assert_preemption_disabled();
 
        if (unlikely(!rcu_is_watching()))
                return NULL;
 
-       fn = freelist_try_get(&rh->pool);
-       if (!fn)
-               return NULL;
-
-       return container_of(fn, struct rethook_node, freelist);
+       return (struct rethook_node *)objpool_pop(&rh->pool);
 }
 NOKPROBE_SYMBOL(rethook_try_get);