fde 227 arch/arc/kernel/unwind.c static const u32 *cie_for_fde(const u32 *fde, const struct unwind_table *); fde 228 arch/arc/kernel/unwind.c static const u32 *__cie_for_fde(const u32 *fde); fde 232 arch/arc/kernel/unwind.c unsigned long start, fde; fde 252 arch/arc/kernel/unwind.c v = e1->fde; fde 253 arch/arc/kernel/unwind.c e1->fde = e2->fde; fde 254 arch/arc/kernel/unwind.c e2->fde = v; fde 263 arch/arc/kernel/unwind.c const u32 *fde; fde 281 arch/arc/kernel/unwind.c if (tableSize & (sizeof(*fde) - 1)) fde 284 arch/arc/kernel/unwind.c for (fde = table->address, n = 0; fde 285 arch/arc/kernel/unwind.c tableSize > sizeof(*fde) && tableSize - sizeof(*fde) >= *fde; fde 286 arch/arc/kernel/unwind.c tableSize -= sizeof(*fde) + *fde, fde += 1 + *fde / sizeof(*fde)) { fde 287 arch/arc/kernel/unwind.c const u32 *cie = cie_for_fde(fde, table); fde 298 arch/arc/kernel/unwind.c ptr = (const u8 *)(fde + 2); fde 299 arch/arc/kernel/unwind.c if (!read_pointer(&ptr, (const u8 *)(fde + 1) + *fde, fde 306 arch/arc/kernel/unwind.c (const u8 *)(fde + 1) + *fde); fde 332 arch/arc/kernel/unwind.c for (fde = table->address, tableSize = table->size, n = 0; fde 334 arch/arc/kernel/unwind.c tableSize -= sizeof(*fde) + *fde, fde += 1 + *fde / sizeof(*fde)) { fde 335 arch/arc/kernel/unwind.c const u32 *cie = __cie_for_fde(fde); fde 337 arch/arc/kernel/unwind.c if (fde[1] == CIE_ID) fde 339 arch/arc/kernel/unwind.c ptr = (const u8 *)(fde + 2); fde 341 arch/arc/kernel/unwind.c (const u8 *)(fde + 1) + fde 342 arch/arc/kernel/unwind.c *fde, fde 344 arch/arc/kernel/unwind.c header->table[n].fde = (unsigned long)fde; fde 504 arch/arc/kernel/unwind.c static const u32 *__cie_for_fde(const u32 *fde) fde 508 arch/arc/kernel/unwind.c cie = fde + 1 - fde[1] / sizeof(*fde); fde 513 arch/arc/kernel/unwind.c static const u32 *cie_for_fde(const u32 *fde, const struct unwind_table *table) fde 517 arch/arc/kernel/unwind.c if (!*fde || (*fde & (sizeof(*fde) - 1))) fde 520 arch/arc/kernel/unwind.c if (fde[1] == CIE_ID) fde 523 arch/arc/kernel/unwind.c if ((fde[1] & (sizeof(*fde) - 1))) fde 527 arch/arc/kernel/unwind.c cie = __cie_for_fde(fde); fde 529 arch/arc/kernel/unwind.c if (*cie <= sizeof(*cie) + 4 || *cie >= fde[1] - sizeof(*fde) fde 902 arch/arc/kernel/unwind.c const u32 *fde = NULL, *cie = NULL; fde 934 arch/arc/kernel/unwind.c && !(table->size & (sizeof(*fde) - 1))) { fde 983 arch/arc/kernel/unwind.c fde = (void *)read_pointer(&ptr, fde 990 arch/arc/kernel/unwind.c if (fde != NULL) { fde 991 arch/arc/kernel/unwind.c cie = cie_for_fde(fde, table); fde 992 arch/arc/kernel/unwind.c ptr = (const u8 *)(fde + 2); fde 998 arch/arc/kernel/unwind.c (const u8 *)(fde + 1) + *fde, fde 1005 arch/arc/kernel/unwind.c (const u8 *)(fde + fde 1007 arch/arc/kernel/unwind.c *fde, ptrType); fde 1009 arch/arc/kernel/unwind.c fde = NULL; fde 1013 arch/arc/kernel/unwind.c fde = NULL; fde 1082 arch/arc/kernel/unwind.c end = (const u8 *)(fde + 1) + *fde; fde 1088 arch/arc/kernel/unwind.c fde = NULL; fde 1091 arch/arc/kernel/unwind.c if (cie == NULL || fde == NULL) { fde 350 arch/sh/kernel/dwarf.c struct dwarf_fde *fde = NULL; fde 369 arch/sh/kernel/dwarf.c fde = fde_tmp; fde 379 arch/sh/kernel/dwarf.c return fde; fde 399 arch/sh/kernel/dwarf.c struct dwarf_fde *fde, fde 579 arch/sh/kernel/dwarf.c struct dwarf_fde *fde; fde 634 arch/sh/kernel/dwarf.c fde = dwarf_lookup_fde(pc); fde 635 arch/sh/kernel/dwarf.c if (!fde) { fde 654 arch/sh/kernel/dwarf.c cie = dwarf_lookup_cie(fde->cie_pointer); fde 656 arch/sh/kernel/dwarf.c frame->pc = fde->initial_location; fde 660 arch/sh/kernel/dwarf.c cie->instructions_end, cie, fde, fde 664 arch/sh/kernel/dwarf.c dwarf_cfa_execute_insns(fde->instructions, fde->end, cie, fde 665 arch/sh/kernel/dwarf.c fde, frame, pc); fde 871 arch/sh/kernel/dwarf.c struct dwarf_fde *fde; fde 877 arch/sh/kernel/dwarf.c fde = kzalloc(sizeof(*fde), GFP_KERNEL); fde 878 arch/sh/kernel/dwarf.c if (!fde) fde 881 arch/sh/kernel/dwarf.c fde->length = len; fde 887 arch/sh/kernel/dwarf.c fde->cie_pointer = (unsigned long)(p - entry_type - 4); fde 889 arch/sh/kernel/dwarf.c cie = dwarf_lookup_cie(fde->cie_pointer); fde 890 arch/sh/kernel/dwarf.c fde->cie = cie; fde 893 arch/sh/kernel/dwarf.c count = dwarf_read_encoded_value(p, &fde->initial_location, fde 896 arch/sh/kernel/dwarf.c count = dwarf_read_addr(p, &fde->initial_location); fde 901 arch/sh/kernel/dwarf.c count = dwarf_read_encoded_value(p, &fde->address_range, fde 904 arch/sh/kernel/dwarf.c count = dwarf_read_addr(p, &fde->address_range); fde 908 arch/sh/kernel/dwarf.c if (fde->cie->flags & DWARF_CIE_Z_AUGMENTATION) { fde 915 arch/sh/kernel/dwarf.c fde->instructions = p; fde 916 arch/sh/kernel/dwarf.c fde->end = end; fde 928 arch/sh/kernel/dwarf.c start = fde->initial_location; fde 929 arch/sh/kernel/dwarf.c end = fde->initial_location + fde->address_range; fde 944 arch/sh/kernel/dwarf.c rb_link_node(&fde->node, parent, rb_node); fde 945 arch/sh/kernel/dwarf.c rb_insert_color(&fde->node, &fde_root); fde 949 arch/sh/kernel/dwarf.c list_add_tail(&fde->link, &mod->arch.fde_list); fde 996 arch/sh/kernel/dwarf.c struct dwarf_fde *fde, *next_fde; fde 1004 arch/sh/kernel/dwarf.c rbtree_postorder_for_each_entry_safe(fde, next_fde, &fde_root, node) fde 1005 arch/sh/kernel/dwarf.c kfree(fde); fde 1132 arch/sh/kernel/dwarf.c struct dwarf_fde *fde, *ftmp; fde 1148 arch/sh/kernel/dwarf.c list_for_each_entry_safe(fde, ftmp, &mod->arch.fde_list, link) { fde 1149 arch/sh/kernel/dwarf.c list_del(&fde->link); fde 1150 arch/sh/kernel/dwarf.c rb_erase(&fde->node, &fde_root); fde 1151 arch/sh/kernel/dwarf.c kfree(fde); fde 2051 fs/ext4/namei.c struct fake_dirent *fde; fde 2069 fs/ext4/namei.c fde = &root->dotdot; fde 2070 fs/ext4/namei.c de = (struct ext4_dir_entry_2 *)((char *)fde + fde 2071 fs/ext4/namei.c ext4_rec_len_from_disk(fde->rec_len, blocksize)); fde 12 fs/hpfs/dnode.c static loff_t get_pos(struct dnode *d, struct hpfs_dirent *fde) fde 18 fs/hpfs/dnode.c if (de == fde) return ((loff_t) le32_to_cpu(d->self) << 4) | (loff_t)i;