Home | History | Annotate | Download | only in bfd

Lines Matching refs:pdr

363   struct shuffle *pdr;
482 ainfo->pdr = NULL;
924 to adjust the PDR addresses, so simply copying the
932 if (!add_file_shuffle (ainfo, &ainfo->pdr, &ainfo->pdr_end,
969 if (!add_memory_shuffle (ainfo, &ainfo->pdr, &ainfo->pdr_end, out,
974 PDR pdr;
976 (*input_swap->swap_pdr_in) (input_bfd, in, &pdr);
977 (*output_swap->swap_pdr_out) (output_bfd, &pdr, out);
1595 || ! ecoff_write_shuffle (abfd, swap, ainfo->pdr, space)
1785 address of the first PDR is the address of the FDR, which will
1787 2) Once in a wacky while, the Compaq compiler generated PDR
1788 addresses do not equal the FDR vma, but they (the PDR address)
1791 /* The address of the first PDR is the offset of that
1896 y < 'offset' < z. It is possible at times that the PDR for 'offset' is
1903 PDR [5] for File [2]: LoopTest__Xv <0x1200020a0> (a)
1904 PDR [7] for File [2]: foo__Xv <0x120002168>
1906 PDR [3] for File [1]: <0x120001ad0> (b)
1914 (b) It is also possible for a PDR to have a *lower* vma than its associated
1926 associated with a PDR from this FDR, specifically the PDR with the
1928 PDR. (Yes, this problem could be eliminated if we kept the size of the
1929 last PDR around, but things are already getting ugly).
1931 Probably, a better solution would be to have a sorted PDR table. Each
1932 PDR would have a pointer to its FDR so file information could still be
1935 the PDR table would be searched to locate debugging info.
1942 PDR [a] for File [3]: 0000000120001b50
1943 PDR [b] for File [3]: 0000000120001cf0
1944 PDR [c] for File [3]: 0000000120001dc8
1945 PDR [d] for File [3]: 0000000120001e40
1946 PDR [e] for File [3]: 0000000120001eb8
1947 PDR [f] for File [3]: 0000000120001f4c
1988 PDR pdr;
1993 list of procedure descriptors (PDR). The address in the FDR
1995 in the first PDR gives the offset of that procedure relative
1999 whenever the PROF bit in the PDR is set, the real entry point
2005 each procedure and set the "prof" bit in the PDR to indicate
2021 FDR/PDR). Similarly, PDRs are sometimes out of order
2037 list of FDRs that may contain the PDR for ADDR. Next, we
2040 ADDR and the PDR's entry point is positive and minimal).
2041 Once, the right FDR and PDR are located, we simply walk
2058 /* Search FDR list starting at tab[i] for the PDR that best matches
2075 (*debug_swap->swap_pdr_in) (abfd, pdr_ptr, &pdr);
2076 /* Find PDR that is closest to OFFSET. If pdr.prof is set,
2077 pdr.adr. We
2078 simply pretend that pdr.prof *implies* a lower entry-point.
2084 (*debug_swap->swap_pdr_in) (abfd, pdr_ptr, &pdr)))
2086 if (offset >= (pdr.adr - 0x10 * pdr.prof))
2088 dist = offset - (pdr.adr - 0x10 * pdr.prof);
2118 (*debug_swap->swap_pdr_in) (abfd, pdr_ptr, &pdr);
2126 offset -= pdr.adr - 0x10 * pdr.prof;
2127 lineno = pdr.lnLow;
2128 line_ptr = debug_info->line + fdr_ptr->cbLineOffset + pdr.cbLineOffset;
2160 if (pdr.isym == -1)
2169 + pdr.isym * debug_swap->external_ext_size),
2185 + ((fdr_ptr->isymBase + pdr.isym)
2432 /* Copy PDR information into a memory buffer. */
2440 return ecoff_collect_shuffle (ainfo->pdr, buff);