linux-imx

// SPDX-License-Identifier: GPL-2.0-or-later

/*

 * Derived from arch/ppc/mm/extable.c and arch/i386/mm/extable.c.

 *

 * Copyright (C) 2004 Paul Mackerras, IBM Corp.

 */

​

#include <linux/bsearch.h>

#include <linux/module.h>

#include <linux/init.h>

#include <linux/sort.h>

#include <linux/uaccess.h>

​

#ifndef ARCH_HAS_RELATIVE_EXTABLE

#define ex_to_insn(x)   ((x)->insn)

#else

static inline unsigned long ex_to_insn(const struct exception_table_entry *x)

{

    return (unsigned long)&x->insn + x->insn;

}

#endif

​

#ifndef ARCH_HAS_SORT_EXTABLE

#ifndef ARCH_HAS_RELATIVE_EXTABLE

#define swap_ex     NULL

#else

static void swap_ex(void *a, void *b, int size)

{

    struct exception_table_entry *x = a, *y = b, tmp;

    int delta = b - a;

​

    tmp = *x;

    x->insn = y->insn + delta;

    y->insn = tmp.insn - delta;

​

#ifdef swap_ex_entry_fixup

    swap_ex_entry_fixup(x, y, tmp, delta);

#else

    x->fixup = y->fixup + delta;

    y->fixup = tmp.fixup - delta;

#endif

}

#endif /* ARCH_HAS_RELATIVE_EXTABLE */

​

/*

 * The exception table needs to be sorted so that the binary

 * search that we use to find entries in it works properly.

 * This is used both for the kernel exception table and for

 * the exception tables of modules that get loaded.

 */

static int cmp_ex_sort(const void *a, const void *b)

{

    const struct exception_table_entry *x = a, *y = b;

​

    /* avoid overflow */

    if (ex_to_insn(x) > ex_to_insn(y))

        return 1;

    if (ex_to_insn(x) < ex_to_insn(y))

        return -1;

    return 0;

}

​

void sort_extable(struct exception_table_entry *start,