|
@@ -52,6 +52,102 @@
|
|
|
#define BREAKINST_THUMB 0xde01
|
|
|
#endif
|
|
|
|
|
|
+struct pt_regs_offset {
|
|
|
+ const char *name;
|
|
|
+ int offset;
|
|
|
+};
|
|
|
+
|
|
|
+#define REG_OFFSET_NAME(r) \
|
|
|
+ {.name = #r, .offset = offsetof(struct pt_regs, ARM_##r)}
|
|
|
+#define REG_OFFSET_END {.name = NULL, .offset = 0}
|
|
|
+
|
|
|
+static const struct pt_regs_offset regoffset_table[] = {
|
|
|
+ REG_OFFSET_NAME(r0),
|
|
|
+ REG_OFFSET_NAME(r1),
|
|
|
+ REG_OFFSET_NAME(r2),
|
|
|
+ REG_OFFSET_NAME(r3),
|
|
|
+ REG_OFFSET_NAME(r4),
|
|
|
+ REG_OFFSET_NAME(r5),
|
|
|
+ REG_OFFSET_NAME(r6),
|
|
|
+ REG_OFFSET_NAME(r7),
|
|
|
+ REG_OFFSET_NAME(r8),
|
|
|
+ REG_OFFSET_NAME(r9),
|
|
|
+ REG_OFFSET_NAME(r10),
|
|
|
+ REG_OFFSET_NAME(fp),
|
|
|
+ REG_OFFSET_NAME(ip),
|
|
|
+ REG_OFFSET_NAME(sp),
|
|
|
+ REG_OFFSET_NAME(lr),
|
|
|
+ REG_OFFSET_NAME(pc),
|
|
|
+ REG_OFFSET_NAME(cpsr),
|
|
|
+ REG_OFFSET_NAME(ORIG_r0),
|
|
|
+ REG_OFFSET_END,
|
|
|
+};
|
|
|
+
|
|
|
+/**
|
|
|
+ * regs_query_register_offset() - query register offset from its name
|
|
|
+ * @name: the name of a register
|
|
|
+ *
|
|
|
+ * regs_query_register_offset() returns the offset of a register in struct
|
|
|
+ * pt_regs from its name. If the name is invalid, this returns -EINVAL;
|
|
|
+ */
|
|
|
+int regs_query_register_offset(const char *name)
|
|
|
+{
|
|
|
+ const struct pt_regs_offset *roff;
|
|
|
+ for (roff = regoffset_table; roff->name != NULL; roff++)
|
|
|
+ if (!strcmp(roff->name, name))
|
|
|
+ return roff->offset;
|
|
|
+ return -EINVAL;
|
|
|
+}
|
|
|
+
|
|
|
+/**
|
|
|
+ * regs_query_register_name() - query register name from its offset
|
|
|
+ * @offset: the offset of a register in struct pt_regs.
|
|
|
+ *
|
|
|
+ * regs_query_register_name() returns the name of a register from its
|
|
|
+ * offset in struct pt_regs. If the @offset is invalid, this returns NULL;
|
|
|
+ */
|
|
|
+const char *regs_query_register_name(unsigned int offset)
|
|
|
+{
|
|
|
+ const struct pt_regs_offset *roff;
|
|
|
+ for (roff = regoffset_table; roff->name != NULL; roff++)
|
|
|
+ if (roff->offset == offset)
|
|
|
+ return roff->name;
|
|
|
+ return NULL;
|
|
|
+}
|
|
|
+
|
|
|
+/**
|
|
|
+ * regs_within_kernel_stack() - check the address in the stack
|
|
|
+ * @regs: pt_regs which contains kernel stack pointer.
|
|
|
+ * @addr: address which is checked.
|
|
|
+ *
|
|
|
+ * regs_within_kernel_stack() checks @addr is within the kernel stack page(s).
|
|
|
+ * If @addr is within the kernel stack, it returns true. If not, returns false.
|
|
|
+ */
|
|
|
+bool regs_within_kernel_stack(struct pt_regs *regs, unsigned long addr)
|
|
|
+{
|
|
|
+ return ((addr & ~(THREAD_SIZE - 1)) ==
|
|
|
+ (kernel_stack_pointer(regs) & ~(THREAD_SIZE - 1)));
|
|
|
+}
|
|
|
+
|
|
|
+/**
|
|
|
+ * regs_get_kernel_stack_nth() - get Nth entry of the stack
|
|
|
+ * @regs: pt_regs which contains kernel stack pointer.
|
|
|
+ * @n: stack entry number.
|
|
|
+ *
|
|
|
+ * regs_get_kernel_stack_nth() returns @n th entry of the kernel stack which
|
|
|
+ * is specified by @regs. If the @n th entry is NOT in the kernel stack,
|
|
|
+ * this returns 0.
|
|
|
+ */
|
|
|
+unsigned long regs_get_kernel_stack_nth(struct pt_regs *regs, unsigned int n)
|
|
|
+{
|
|
|
+ unsigned long *addr = (unsigned long *)kernel_stack_pointer(regs);
|
|
|
+ addr += n;
|
|
|
+ if (regs_within_kernel_stack(regs, (unsigned long)addr))
|
|
|
+ return *addr;
|
|
|
+ else
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
/*
|
|
|
* this routine will get a word off of the processes privileged stack.
|
|
|
* the offset is how far from the base addr as stored in the THREAD.
|