zoukankan      html  css  js  c++  java
  • 入口/修正信息 函数

    idc

    GetEntryPointQty():
    获取入口函数个数

    增加入口点
    AddEntryPoint(ordinal, ea, name, makecode)
    """ Add entry point @param ordinal: entry point number if entry point doesn't have an ordinal number, 'ordinal' should be equal to 'ea' @param ea: address of the entry point @param name: name of the entry point. If null string, the entry point won't be renamed. @param makecode: if 1 then this entry point is a start of a function. Otherwise it denotes data bytes. @return: 0 - entry point with the specifed ordinal already exists 1 - ok
    etEntryOrdinal(index):
        """
        Retrieve entry point ordinal number
    
        @param index: 0..GetEntryPointQty()-1
    
        @return: 0 if entry point doesn't exist
    GetEntryPoint(ordinal):
        """
        Retrieve entry point address
    
        @param ordinal: entry point number
            it is returned by GetEntryPointOrdinal()
    
        @return: BADADDR if entry point doesn't exist
                otherwise entry point address.
                If entry point address is equal to its ordinal
                number, then the entry point has no ordinal.
        """
    GetEntryName(ordinal):
        """
        Retrieve entry point name
    
        @param ordinal: entry point number, ass returned by GetEntryPointOrdinal()
    
        @return: entry point name or None
        """
    RenameEntryPoint(ordinal, name):
        """
        Rename entry point
    
        @param ordinal: entry point number
        @param name: new name
    
        @return: !=0 - ok

    fixups

    GetNextFixupEA(ea):
        """
        Find next address with fixup information
    
        @param ea: current address
    
        @return: BADADDR - no more fixups otherwise returns the next
                    address with fixup information
        """
    GetPrevFixupEA(ea):
        """
        Find previous address with fixup information
    
        @param ea: current address
    
        @return: BADADDR - no more fixups otherwise returns the
                    previous address with fixup information
        """
    GetFixupTgtType(ea):
        """
        Get fixup target type
    
        @param ea: address to get information about
    
        @return: -1 - no fixup at the specified address
                    otherwise returns fixup target type:
        """
    GetFixupTgtSel(ea):
        """
        Get fixup target selector
    
        @param ea: address to get information about
    
        @return: -1 - no fixup at the specified address
                        otherwise returns fixup target selector
        """
    GetFixupTgtOff(ea):
        """
        Get fixup target offset
    
        @param ea: address to get information about
    
        @return: -1 - no fixup at the specified address
                    otherwise returns fixup target offset
        """
    GetFixupTgtDispl(ea):
        """
        Get fixup target displacement
    
        @param ea: address to get information about
    
        @return: -1 - no fixup at the specified address
                    otherwise returns fixup target displacement
        """
    SetFixup(ea, fixuptype, targetsel, targetoff, displ):
        """
        Set fixup information
    
        @param ea: address to set fixup information about
        @param fixuptype: fixup type. see GetFixupTgtType()
                          for possible fixup types.
        @param targetsel: target selector
        @param targetoff: target offset
        @param displ: displacement
    
        @return:        none
    DelFixup(ea):
        """
        Delete fixup information
    
        @param ea: address to delete fixup information about
    
        @return: None
        """
  • 相关阅读:
    leetcode 746. 使用最小花费爬楼梯
    leetcode 474.一和零
    leetcode 221.最大正方形
    leetcode 525.连续数组
    leetcode 32.最长有效括号
    leetcode 46.全排列
    如何把word文档导入到数据库中——java POI
    leetcode 198.打家劫舍
    leetcode 581.最短无序连续子数组
    02需求工程-软件建模与分析阅读笔记之二
  • 原文地址:https://www.cnblogs.com/fply/p/8506364.html
Copyright © 2011-2022 走看看