JorgeVB/code_unlearning_dataset · Datasets at Hugging Face

text stringlengths 81 112k
Add a function implementation fo the library. :param name: The name of the function as a string :param proc_cls: The implementation of the function as a SimProcedure _class_, not instance :param kwargs: Any additional parameters to the procedure class constructor may be passed as...
Batch-add function implementations to the library. :param dictionary: A mapping from name to procedure class, i.e. the first two arguments to add() :param kwargs: Any additional kwargs will be passed to the constructors of _each_ procedure class def add_all_from_dict(self, dictionary, **kwargs):...
Add some duplicate names for a given function. The original function's implementation must already be registered. :param name: The name of the function for which an implementation is already present :param alt_names: Any number of alternate names may be passed as varargs def add_alias...
Get an implementation of the given function specialized for the given arch, or a stub procedure if none exists. :param name: The name of the function as a string :param arch: The architecure to use, as either a string or an archinfo.Arch instance :return: A SimProcedure instance re...
Get a stub procedure for the given function, regardless of if a real implementation is available. This will apply any metadata, such as a default calling convention or a function prototype. By stub, we pretty much always mean a ``ReturnUnconstrained`` SimProcedure with the appropriate display name ...
Check if a function has either an implementation or any metadata associated with it :param name: The name of the function as a string :return: A bool indicating if anything is known about the function def has_metadata(self, name): """ Check if a function has either an impleme...
:param abi: The abi to evaluate :return: The smallest syscall number known for the given abi def minimum_syscall_number(self, abi): """ :param abi: The abi to evaluate :return: The smallest syscall number known for the given abi """ if abi not in self.syscall_numbe...
:param abi: The abi to evaluate :return: The largest syscall number known for the given abi def maximum_syscall_number(self, abi): """ :param abi: The abi to evaluate :return: The largest syscall number known for the given abi """ if abi not in self.syscall_number_...
Associate a syscall number with the name of a function present in the underlying SimLibrary :param abi: The abi for which this mapping applies :param number: The syscall number :param name: The name of the function def add_number_mapping(self, abi, number, name): """ As...
Batch-associate syscall numbers with names of functions present in the underlying SimLibrary :param abi: The abi for which this mapping applies :param mapping: A dict mapping syscall numbers to function names def add_number_mapping_from_dict(self, abi, mapping): """ Batch-associate...
The get() function for SimSyscallLibrary looks a little different from its original version. Instead of providing a name, you provide a number, and you additionally provide a list of abi names that are applicable. The first abi for which the number is present in the mapping will be chosen. This allows ...
Pretty much the intersection of SimLibrary.get_stub() and SimSyscallLibrary.get(). :param number: The syscall number :param arch: The architecture being worked with, as either a string name or an archinfo.Arch :param abi_list: A list of ABI names that could be used :retur...
Pretty much the intersection of SimLibrary.has_implementation() and SimSyscallLibrary.get(). :param number: The syscall number :param arch: The architecture being worked with, as either a string name or an archinfo.Arch :param abi_list: A list of ABI names that could be used ...
Returns the Claripy expression of a VEX temp value. :param tmp: the number of the tmp :param simplify: simplify the tmp before returning it :returns: a Claripy expression of the tmp def tmp_expr(self, tmp): """ Returns the Claripy expression of a VEX temp value. :param...
Stores a Claripy expression in a VEX temp value. If in symbolic mode, this involves adding a constraint for the tmp's symbolic variable. :param tmp: the number of the tmp :param content: a Claripy expression of the content :param reg_deps: the register dependencies of the content ...
Takes a path and returns a simple absolute path as a list of directories from the root def _normalize_path(self, path): """ Takes a path and returns a simple absolute path as a list of directories from the root """ if type(path) is str: path = path.encode() path = pa...
Changes the current directory to the given path def chdir(self, path): """ Changes the current directory to the given path """ self.cwd = self._join_chunks(self._normalize_path(path))
Get a file from the filesystem. Returns a SimFile or None. def get(self, path): """ Get a file from the filesystem. Returns a SimFile or None. """ mountpoint, chunks = self.get_mountpoint(path) if mountpoint is None: return self._files.get(self._join_chunks(chunks))...
Insert a file into the filesystem. Returns whether the operation was successful. def insert(self, path, simfile): """ Insert a file into the filesystem. Returns whether the operation was successful. """ if self.state is not None: simfile.set_state(self.state) mountpo...
Remove a file from the filesystem. Returns whether the operation was successful. This will add a ``fs_unlink`` event with the path of the file and also the index into the `unlinks` list. def delete(self, path): """ Remove a file from the filesystem. Returns whether the operation was successful...
Add a mountpoint to the filesystem. def mount(self, path, mount): """ Add a mountpoint to the filesystem. """ self._mountpoints[self._join_chunks(self._normalize_path(path))] = mount
Remove a mountpoint from the filesystem. def unmount(self, path): """ Remove a mountpoint from the filesystem. """ del self._mountpoints[self._join_chunks(self._normalize_path(path))]
Look up the mountpoint servicing the given path. :return: A tuple of the mount and a list of path elements traversing from the mountpoint to the specified file. def get_mountpoint(self, path): """ Look up the mountpoint servicing the given path. :return: A tuple of the mount and a lis...
Store in native memory. :param data: Either a single value or a list. Lists get interpreted as an array. :param data_type: Java type of the element(s). :param addr: Native store address. If not set, native memory is allocated. ...
Load from native memory. :param addr: Native load address. :param data_type: Java type of elements. If set, all loaded elements are casted to this type. :param data_size: Size of each element. If not set, siz...
Load zero terminated UTF-8 string from native memory. :param addr_: Native load address. :return: Loaded string. def _load_string_from_native_memory(self, addr_): """ Load zero terminated UTF-8 string from native memory. :param addr_: Native load address. :return:...
Store given string UTF-8 encoded and zero terminated in native memory. :param str string: String :param addr: Native store address. If not set, native memory is allocated. :return: Native address of the string. def _store_string_in_native_memory(s...
In Java, all array indices are represented by a 32 bit integer and consequently we are using in the Soot engine a 32bit bitvector for this. This function normalize the given index to follow this "convention". :return: Index as a 32bit bitvector. def _normalize_array_idx(self, idx): """...
Given the target `target`, apply the hooks given as keyword arguments to it. If any targeted method has already been hooked, the hooks will not be overridden but will instead be pushed into a list of pending hooks. The final behavior should be that all hooks call each other in a nested stack. :...
Remove the given hooks from the given target. :param target: The object from which to remove hooks. If all hooks are removed from a given method, the HookedMethod object will be removed and replaced with the original function. :param hooks: Any keywords will be interpreted as...
Reset the internal node traversal state. Must be called prior to visiting future nodes. :return: None def reset(self): """ Reset the internal node traversal state. Must be called prior to visiting future nodes. :return: None """ self._sorted_nodes.clear() self...
Returns all successors to the specific node. :param node: A node in the graph. :return: A set of nodes that are all successors to the given node. :rtype: set def all_successors(self, node, skip_reached_fixedpoint=False): """ Returns all successors to the specific node....
Revisit a node in the future. As a result, the successors to this node will be revisited as well. :param node: The node to revisit in the future. :return: None def revisit(self, node, include_self=True): """ Revisit a node in the future. As a result, the successors to this node wil...
Appended a new job to this JobInfo node. :param job: The new job to append. :param bool merged: Whether it is a merged job or not. :param bool widened: Whether it is a widened job or not. def add_job(self, job, merged=False, widened=False): """ Appended a new job to this JobInfo...
Checks whether there exists another job which has the same job key. :param job: The job to check. :return: True if there exists another job with the same key, False otherwise. def has_job(self, job): """ Checks whether there exists another job which has the same job key. :pa...
The main analysis routine. :return: None def _analyze(self): """ The main analysis routine. :return: None """ self._pre_analysis() if self._graph_visitor is None: # There is no base graph that we can rely on. The analysis itself should generate su...
Add the input state to all successors of the given node. :param node: The node whose successors' input states will be touched. :param input_state: The state that will be added to successors of the node. :return: None def _add_input_state(self, node, input_state): """ ...
Get the input abstract state for this node, and remove it from the state map. :param node: The node in graph. :return: A merged state, or None if there is no input state for this node available. def _pop_input_state(self, node): """ Get the input abstract state for this node, and r...
Get abstract states for all predecessors of the node, merge them, and return the merged state. :param node: The node in graph. :return: A merged state, or None if no predecessor is available. def _merge_state_from_predecessors(self, node): """ Get abstract states for all predecesso...
Process a job, get all successors of this job, and call _handle_successor() to handle each successor. :param JobInfo job_info: The JobInfo instance :return: None def _process_job_and_get_successors(self, job_info): """ Process a job, get all successors of this job, and call _handle_suc...
Insert a new job into the job queue. If the job queue is ordered, this job will be inserted at the correct position. :param job: The job to insert :return: None def _insert_job(self, job): """ Insert a new job into the job queue. If the job queue is ordered, this job will be...
Return the job currently at position `pos`, but still keep it in the job queue. An IndexError will be raised if that position does not currently exist in the job list. :param int pos: Position of the job to get. :return: The job def _peek_job(self, pos): """ Return the j...
Insert an element into a sorted list, and keep the list sorted. The major difference from bisect.bisect_left is that this function supports a key method, so user doesn't have to create the key array for each insertion. :param list lst: The list. Must be pre-ordered. :param object eleme...
Merge this SimMemory with the other SimMemory def merge(self, others, merge_conditions, common_ancestor=None): # pylint: disable=unused-argument """ Merge this SimMemory with the other SimMemory """ changed_bytes = self._changes_to_merge(others) l.info("Merging %d bytes", len(...
Replaces `length` bytes starting at `addr` with a symbolic variable named name. Adds a constraint equaling that symbolic variable to the value previously at `addr`, and returns the variable. def make_symbolic(self, name, addr, length=None): """ Replaces `length` bytes starting at `addr` with a ...
Applies concretization strategies on the address until one of them succeeds. def _apply_concretization_strategies(self, addr, strategies, action): """ Applies concretization strategies on the address until one of them succeeds. """ # we try all the strategies in order for s in ...
Concretizes an address meant for writing. :param addr: An expression for the address. :param strategies: A list of concretization strategies (to override the default). :returns: A list of concrete addresses. def concretize_write_addr(self, addr, strate...
Concretizes an address meant for reading. :param addr: An expression for the address. :param strategies: A list of concretization strategies (to override the default). :returns: A list of concrete addresses. def concretize_read_addr(self, addr, strateg...
Print out debugging information. def dbg_print(self, indent=0): """ Print out debugging information. """ lst = [] more_data = False for i, addr in enumerate(self.mem.keys()): lst.append(addr) if i >= 20: more_data = True ...
Retrieve the permissions of the page at address `addr`. :param addr: address to get the page permissions :param permissions: Integer or BVV to optionally set page permissions to :return: AST representing the permissions on the page def permissions(self, addr, permissions=None...
Map a number of pages at address `addr` with permissions `permissions`. :param addr: address to map the pages at :param length: length in bytes of region to map, will be rounded upwards to the page size :param permissions: AST of permissions to map, will be a bitvalue representing flags ...
Perform execution using any applicable engine. Enumerate the current engines and use the first one that works. Return a SimSuccessors object classifying the results of the run. :param state: The state to analyze :param addr: optional, an address to execute at instead of the...
Returns a state object initialized to the start of a given function, as if it were called with given parameters. :param addr: The address the state should start at instead of the entry point. :param args: Any additional positional arguments will be used as arguments to the functio...
Constructs a new simulation manager. :param thing: Optional - What to put in the new SimulationManager's active stash (either a SimState or a list of SimStates). :param kwargs: Any additional keyword arguments will be passed to the SimulationManager constructor :returns: ...
A Callable is a representation of a function in the binary that can be interacted with like a native python function. :param addr: The address of the function to use :param concrete_only: Throw an exception if the execution splits into multiple states :param perform_merge: ...
Return a SimCC (calling convention) parametrized for this project and, optionally, a given function. :param args: A list of argument storage locations, as SimFunctionArguments. :param ret_val: The return value storage location, as a SimFunctionArgument. :param sp_delta: Does this ...
Get a SimCC (calling convention) that will extract floating-point/integral args correctly. :param arch: The Archinfo arch for this CC :param fp_args: A list, with one entry for each argument the function can take. True if the argument is fp, false if it is integra...
An iterator of all local blocks in the current function. :return: angr.lifter.Block instances. def blocks(self): """ An iterator of all local blocks in the current function. :return: angr.lifter.Block instances. """ for block_addr, block in self._local_blocks.items():...
All of the operations that are done by this functions. def operations(self): """ All of the operations that are done by this functions. """ return [op for block in self.blocks for op in block.vex.operations]
All of the constants that are used by this functions's code. def code_constants(self): """ All of the constants that are used by this functions's code. """ # TODO: remove link register values return [const.value for block in self.blocks for const in block.vex.constants]
All of the constant string references used by this function. :param minimum_length: The minimum length of strings to find (default is 1) :param vex_only: Only analyze VEX IR, don't interpret the entry state to detect additional constants. :return: A list of tuples of (add...
Tries to find all runtime values of this function which do not come from inputs. These values are generated by starting from a blank state and reanalyzing the basic blocks once each. Function calls are skipped, and back edges are never taken so these values are often unreliable, This function is...
All of the concrete values used by this function at runtime (i.e., including passed-in arguments and global values). def runtime_values(self): """ All of the concrete values used by this function at runtime (i.e., including passed-in arguments and global values). """ con...
Get the object this function belongs to. :return: The object this function belongs to. def binary(self): """ Get the object this function belongs to. :return: The object this function belongs to. """ return self._project.loader.find_object_containing(self.addr, membersh...
Add a custom jumpout site. :param node: The address of the basic block that control flow leaves during this transition. :return: None def add_jumpout_site(self, node): """ Add a custom jumpout site. :param node: The address of the basic block that control flow lea...
Add a custom retout site. Retout (returning to outside of the function) sites are very rare. It mostly occurs during CFG recovery when we incorrectly identify the beginning of a function in the first iteration, and then correctly identify that function later in the same iteration (function alig...
Determine the most suitable name of the function. :return: The initial function name. :rtype: string def _get_initial_name(self): """ Determine the most suitable name of the function. :return: The initial function name. :rtype: string """ ...
Determine the name of the binary where this function is. :return: None def _get_initial_binary_name(self): """ Determine the name of the binary where this function is. :return: None """ binary_name = None # if this function is a simprocedure but not a syscall...
Determine if this function returns or not if it is hooked by a SimProcedure or a user hook. :return: True if the hooker returns, False otherwise. :rtype: bool def _get_initial_returning(self): """ Determine if this function returns or not *if it is hooked by a SimProcedure or ...
Registers an edge between basic blocks in this function's transition graph. Arguments are CodeNode objects. :param from_node The address of the basic block that control flow leaves during this transition. :param to_node The address of ...
Registers an edge between the caller basic block and callee function. :param from_addr: The basic block that control flow leaves during the transition. :type from_addr: angr.knowledge.CodeNode :param to_func: The function that we are calling :type to_func: Function ...
Registers a basic block as a site for control flow to return from this function. :param CodeNode return_site: The block node that ends with a return. def _add_return_site(self, return_site): """ Registers a basic block as a site for control flow to return from this function. :para...
Registers a basic block as calling a function and returning somewhere. :param call_site_addr: The address of a basic block that ends in a call. :param call_target_addr: The address of the target of said call. :param retn_addr: The address that said call will return to. def...
Iterate through all call edges in transition graph. For each call a non-returning function, mark the source basic block as an endpoint. This method should only be executed once all functions are recovered and analyzed by CFG recovery, so we know whether each function returns or not. :r...
Return a local transition graph that only contain nodes in current function. def graph(self): """ Return a local transition graph that only contain nodes in current function. """ if self._local_transition_graph is not None: return self._local_transition_graph g = n...
Generate a sub control flow graph of instruction addresses based on self.graph :param iterable ins_addrs: A collection of instruction addresses that should be included in the subgraph. :return: A subgraph. :rtype: networkx.DiGraph def subgraph(self, ins_addrs): """ Generate a s...
Get the size of the instruction specified by `insn_addr`. :param int insn_addr: Address of the instruction :return: Size of the instruction in bytes, or None if the instruction is not found. :rtype: int def instruction_size(self, insn_addr): """ Get the size of the instruction ...
Draw the graph and save it to a PNG file. def dbg_draw(self, filename): """ Draw the graph and save it to a PNG file. """ import matplotlib.pyplot as pyplot # pylint: disable=import-error from networkx.drawing.nx_agraph import graphviz_layout # pylint: disable=import-error ...
Registers a register offset as being used as an argument to the function. :param reg_offset: The offset of the register to register. def _add_argument_register(self, reg_offset): """ Registers a register offset as being used as an argument to the function. :param reg_offset: ...
Make sure all basic blocks in the transition graph of this function do not overlap. You will end up with a CFG that IDA Pro generates. This method does not touch the CFG result. You may call CFG{Emulated, Fast}.normalize() for that matter. :return: None def normalize(self): """ ...
Find the most likely function declaration from the embedded collection of prototypes, set it to self.prototype, and update self.calling_convention with the declaration. :return: None def find_declaration(self): """ Find the most likely function declaration from the embedded collection ...
Reverse look-up. :param list lst: The list to look up in. :param item: The item to look for. :return: Offset of the item if found. A ValueError is raised if the item is not in the list. :rtype: int def _rfind(lst, item): """ Reverse look-up. :param list lst: Th...
Push the frame cf onto the stack. Return the new stack. def push(self, cf): """ Push the frame cf onto the stack. Return the new stack. """ cf.next = self if self.state is not None: self.state.register_plugin('callstack', cf) self.state.history.recent_sta...
Pop the top frame from the stack. Return the new stack. def pop(self): """ Pop the top frame from the stack. Return the new stack. """ if self.next is None: raise SimEmptyCallStackError("Cannot pop a frame from an empty call stack.") new_list = self.next.copy({}) ...
Push a stack frame into the call stack. This method is called when calling a function in CFG recovery. :param int callsite_addr: Address of the call site :param int addr: Address of the call target :param int or None retn_target: Address of the return target :param int stack_pointer: Va...
Pop one or many call frames from the stack. This method is called when returning from a function in CFG recovery. :param int retn_target: The target to return to. :return: None def ret(self, retn_target=None): """ Pop one or many call frames from the stack. This method is calle...
Debugging representation of this CallStack object. :return: Details of this CalLStack :rtype: str def dbg_repr(self): """ Debugging representation of this CallStack object. :return: Details of this CalLStack :rtype: str """ stack = [ ] for i, f...
Generate the stack suffix. A stack suffix can be used as the key to a SimRun in CFG recovery. :param int context_sensitivity_level: Level of context sensitivity. :return: A tuple of stack suffix. :rtype: tuple def stack_suffix(self, context_sensitivity_level): """ Generate the ...
Check if the return target exists in the stack, and return the index if exists. We always search from the most recent call stack frame since the most recent frame has a higher chance to be hit in normal CFG recovery. :param int target: Target of the return. :return: The index of the object ...
获取所有股票 ID 到 all_stock_code 目录下 def update_stock_codes(): """获取所有股票 ID 到 all_stock_code 目录下""" all_stock_codes_url = "http://www.shdjt.com/js/lib/astock.js" grep_stock_codes = re.compile(r"~(\d+)`") response = requests.get(all_stock_codes_url) all_stock_codes = grep_stock_codes.findall(response.text...
获取所有股票 ID 到 all_stock_code 目录下 def get_stock_codes(realtime=False): """获取所有股票 ID 到 all_stock_code 目录下""" if realtime: all_stock_codes_url = "http://www.shdjt.com/js/lib/astock.js" grep_stock_codes = re.compile(r"~(\d+)`") response = requests.get(all_stock_codes_url) stock_codes ...
return specific stocks real quotation :param stock_codes: stock code or list of stock code, when prefix is True, stock code must start with sh/sz :param prefix: if prefix i True, stock_codes must contain sh/sz market flag. If prefix is False, index quotation can't return ...
return all market quotation snapshot :param prefix: if prefix is True, return quotation dict's stock_code key start with sh/sz market flag def market_snapshot(self, prefix=False): """return all market quotation snapshot :param prefix: if prefix is True, return quotation dict's st...
获取并格式化股票信息 def get_stock_data(self, stock_list, kwargs): """获取并格式化股票信息""" res = self._fetch_stock_data(stock_list) return self.format_response_data(res, kwargs)
获取股票信息 def _fetch_stock_data(self, stock_list): """获取股票信息""" pool = multiprocessing.pool.ThreadPool(len(stock_list)) try: res = pool.map(self.get_stocks_by_range, stock_list) finally: pool.close() return [d for d in res if d is not None]
因为 timekline 的返回没有带对应的股票代码，所以要手动带上 def _fetch_stock_data(self, stock_list): """因为 timekline 的返回没有带对应的股票代码，所以要手动带上""" res = super()._fetch_stock_data(stock_list) with_stock = [] for stock, resp in zip(stock_list, res): if resp is not None: with_stock.append((...
格式化集思录返回的json数据,以字典形式保存 def formatfundajson(fundajson): """格式化集思录返回的json数据,以字典形式保存""" result = {} for row in fundajson["rows"]: funda_id = row["id"] cell = row["cell"] result[funda_id] = cell return result
格式化集思录返回的json数据,以字典形式保存 def formatfundbjson(fundbjson): """格式化集思录返回的json数据,以字典形式保存""" result = {} for row in fundbjson["rows"]: cell = row["cell"] fundb_id = cell["fundb_id"] result[fundb_id] = cell return result
格式化集思录返回指数ETF 的json数据,以字典形式保存 def formatetfindexjson(fundbjson): """格式化集思录返回指数ETF 的json数据,以字典形式保存""" result = {} for row in fundbjson["rows"]: cell = row["cell"] fundb_id = cell["fund_id"] result[fundb_id] = cell return result
以字典形式返回分级A数据 :param fields:利率范围，形如['+3.0%', '6.0%'] :param min_volume:最小交易量，单位万元 :param min_discount:最小折价率, 单位% :param ignore_nodown:是否忽略无下折品种,默认 False :param forever: 是否选择永续品种,默认 False def funda( self, fields=None, min_volume=0, min_discount=0, ...

Add a function implementation fo the library. :param name: The name of the function as a string :param proc_cls: The implementation of the function as a SimProcedure _class_, not instance :param kwargs: Any additional parameters to the procedure class constructor may be passed as...

Batch-add function implementations to the library. :param dictionary: A mapping from name to procedure class, i.e. the first two arguments to add() :param kwargs: Any additional kwargs will be passed to the constructors of _each_ procedure class def add_all_from_dict(self, dictionary, **kwargs):...

Add some duplicate names for a given function. The original function's implementation must already be registered. :param name: The name of the function for which an implementation is already present :param alt_names: Any number of alternate names may be passed as varargs def add_alias...

Get an implementation of the given function specialized for the given arch, or a stub procedure if none exists. :param name: The name of the function as a string :param arch: The architecure to use, as either a string or an archinfo.Arch instance :return: A SimProcedure instance re...

Get a stub procedure for the given function, regardless of if a real implementation is available. This will apply any metadata, such as a default calling convention or a function prototype. By stub, we pretty much always mean a ``ReturnUnconstrained`` SimProcedure with the appropriate display name ...

Check if a function has either an implementation or any metadata associated with it :param name: The name of the function as a string :return: A bool indicating if anything is known about the function def has_metadata(self, name): """ Check if a function has either an impleme...

:param abi: The abi to evaluate :return: The smallest syscall number known for the given abi def minimum_syscall_number(self, abi): """ :param abi: The abi to evaluate :return: The smallest syscall number known for the given abi """ if abi not in self.syscall_numbe...

:param abi: The abi to evaluate :return: The largest syscall number known for the given abi def maximum_syscall_number(self, abi): """ :param abi: The abi to evaluate :return: The largest syscall number known for the given abi """ if abi not in self.syscall_number_...

Associate a syscall number with the name of a function present in the underlying SimLibrary :param abi: The abi for which this mapping applies :param number: The syscall number :param name: The name of the function def add_number_mapping(self, abi, number, name): """ As...

Batch-associate syscall numbers with names of functions present in the underlying SimLibrary :param abi: The abi for which this mapping applies :param mapping: A dict mapping syscall numbers to function names def add_number_mapping_from_dict(self, abi, mapping): """ Batch-associate...

The get() function for SimSyscallLibrary looks a little different from its original version. Instead of providing a name, you provide a number, and you additionally provide a list of abi names that are applicable. The first abi for which the number is present in the mapping will be chosen. This allows ...

Pretty much the intersection of SimLibrary.get_stub() and SimSyscallLibrary.get(). :param number: The syscall number :param arch: The architecture being worked with, as either a string name or an archinfo.Arch :param abi_list: A list of ABI names that could be used :retur...

Pretty much the intersection of SimLibrary.has_implementation() and SimSyscallLibrary.get(). :param number: The syscall number :param arch: The architecture being worked with, as either a string name or an archinfo.Arch :param abi_list: A list of ABI names that could be used ...

Returns the Claripy expression of a VEX temp value. :param tmp: the number of the tmp :param simplify: simplify the tmp before returning it :returns: a Claripy expression of the tmp def tmp_expr(self, tmp): """ Returns the Claripy expression of a VEX temp value. :param...

Stores a Claripy expression in a VEX temp value. If in symbolic mode, this involves adding a constraint for the tmp's symbolic variable. :param tmp: the number of the tmp :param content: a Claripy expression of the content :param reg_deps: the register dependencies of the content ...

Takes a path and returns a simple absolute path as a list of directories from the root def _normalize_path(self, path): """ Takes a path and returns a simple absolute path as a list of directories from the root """ if type(path) is str: path = path.encode() path = pa...

Changes the current directory to the given path def chdir(self, path): """ Changes the current directory to the given path """ self.cwd = self._join_chunks(self._normalize_path(path))

Get a file from the filesystem. Returns a SimFile or None. def get(self, path): """ Get a file from the filesystem. Returns a SimFile or None. """ mountpoint, chunks = self.get_mountpoint(path) if mountpoint is None: return self._files.get(self._join_chunks(chunks))...

Insert a file into the filesystem. Returns whether the operation was successful. def insert(self, path, simfile): """ Insert a file into the filesystem. Returns whether the operation was successful. """ if self.state is not None: simfile.set_state(self.state) mountpo...

Remove a file from the filesystem. Returns whether the operation was successful. This will add a ``fs_unlink`` event with the path of the file and also the index into the `unlinks` list. def delete(self, path): """ Remove a file from the filesystem. Returns whether the operation was successful...

Add a mountpoint to the filesystem. def mount(self, path, mount): """ Add a mountpoint to the filesystem. """ self._mountpoints[self._join_chunks(self._normalize_path(path))] = mount

Remove a mountpoint from the filesystem. def unmount(self, path): """ Remove a mountpoint from the filesystem. """ del self._mountpoints[self._join_chunks(self._normalize_path(path))]

Look up the mountpoint servicing the given path. :return: A tuple of the mount and a list of path elements traversing from the mountpoint to the specified file. def get_mountpoint(self, path): """ Look up the mountpoint servicing the given path. :return: A tuple of the mount and a lis...

Store in native memory. :param data: Either a single value or a list. Lists get interpreted as an array. :param data_type: Java type of the element(s). :param addr: Native store address. If not set, native memory is allocated. ...

Load from native memory. :param addr: Native load address. :param data_type: Java type of elements. If set, all loaded elements are casted to this type. :param data_size: Size of each element. If not set, siz...

Load zero terminated UTF-8 string from native memory. :param addr_: Native load address. :return: Loaded string. def _load_string_from_native_memory(self, addr_): """ Load zero terminated UTF-8 string from native memory. :param addr_: Native load address. :return:...

Store given string UTF-8 encoded and zero terminated in native memory. :param str string: String :param addr: Native store address. If not set, native memory is allocated. :return: Native address of the string. def _store_string_in_native_memory(s...

In Java, all array indices are represented by a 32 bit integer and consequently we are using in the Soot engine a 32bit bitvector for this. This function normalize the given index to follow this "convention". :return: Index as a 32bit bitvector. def _normalize_array_idx(self, idx): """...

Given the target `target`, apply the hooks given as keyword arguments to it. If any targeted method has already been hooked, the hooks will not be overridden but will instead be pushed into a list of pending hooks. The final behavior should be that all hooks call each other in a nested stack. :...

Remove the given hooks from the given target. :param target: The object from which to remove hooks. If all hooks are removed from a given method, the HookedMethod object will be removed and replaced with the original function. :param hooks: Any keywords will be interpreted as...

Reset the internal node traversal state. Must be called prior to visiting future nodes. :return: None def reset(self): """ Reset the internal node traversal state. Must be called prior to visiting future nodes. :return: None """ self._sorted_nodes.clear() self...

Returns all successors to the specific node. :param node: A node in the graph. :return: A set of nodes that are all successors to the given node. :rtype: set def all_successors(self, node, skip_reached_fixedpoint=False): """ Returns all successors to the specific node....

Revisit a node in the future. As a result, the successors to this node will be revisited as well. :param node: The node to revisit in the future. :return: None def revisit(self, node, include_self=True): """ Revisit a node in the future. As a result, the successors to this node wil...

Appended a new job to this JobInfo node. :param job: The new job to append. :param bool merged: Whether it is a merged job or not. :param bool widened: Whether it is a widened job or not. def add_job(self, job, merged=False, widened=False): """ Appended a new job to this JobInfo...

Checks whether there exists another job which has the same job key. :param job: The job to check. :return: True if there exists another job with the same key, False otherwise. def has_job(self, job): """ Checks whether there exists another job which has the same job key. :pa...

The main analysis routine. :return: None def _analyze(self): """ The main analysis routine. :return: None """ self._pre_analysis() if self._graph_visitor is None: # There is no base graph that we can rely on. The analysis itself should generate su...

Add the input state to all successors of the given node. :param node: The node whose successors' input states will be touched. :param input_state: The state that will be added to successors of the node. :return: None def _add_input_state(self, node, input_state): """ ...

Get the input abstract state for this node, and remove it from the state map. :param node: The node in graph. :return: A merged state, or None if there is no input state for this node available. def _pop_input_state(self, node): """ Get the input abstract state for this node, and r...

Get abstract states for all predecessors of the node, merge them, and return the merged state. :param node: The node in graph. :return: A merged state, or None if no predecessor is available. def _merge_state_from_predecessors(self, node): """ Get abstract states for all predecesso...

Process a job, get all successors of this job, and call _handle_successor() to handle each successor. :param JobInfo job_info: The JobInfo instance :return: None def _process_job_and_get_successors(self, job_info): """ Process a job, get all successors of this job, and call _handle_suc...

Insert a new job into the job queue. If the job queue is ordered, this job will be inserted at the correct position. :param job: The job to insert :return: None def _insert_job(self, job): """ Insert a new job into the job queue. If the job queue is ordered, this job will be...

Return the job currently at position `pos`, but still keep it in the job queue. An IndexError will be raised if that position does not currently exist in the job list. :param int pos: Position of the job to get. :return: The job def _peek_job(self, pos): """ Return the j...

Insert an element into a sorted list, and keep the list sorted. The major difference from bisect.bisect_left is that this function supports a key method, so user doesn't have to create the key array for each insertion. :param list lst: The list. Must be pre-ordered. :param object eleme...

Merge this SimMemory with the other SimMemory def merge(self, others, merge_conditions, common_ancestor=None): # pylint: disable=unused-argument """ Merge this SimMemory with the other SimMemory """ changed_bytes = self._changes_to_merge(others) l.info("Merging %d bytes", len(...

Replaces `length` bytes starting at `addr` with a symbolic variable named name. Adds a constraint equaling that symbolic variable to the value previously at `addr`, and returns the variable. def make_symbolic(self, name, addr, length=None): """ Replaces `length` bytes starting at `addr` with a ...

Applies concretization strategies on the address until one of them succeeds. def _apply_concretization_strategies(self, addr, strategies, action): """ Applies concretization strategies on the address until one of them succeeds. """ # we try all the strategies in order for s in ...

Concretizes an address meant for writing. :param addr: An expression for the address. :param strategies: A list of concretization strategies (to override the default). :returns: A list of concrete addresses. def concretize_write_addr(self, addr, strate...

Concretizes an address meant for reading. :param addr: An expression for the address. :param strategies: A list of concretization strategies (to override the default). :returns: A list of concrete addresses. def concretize_read_addr(self, addr, strateg...

Print out debugging information. def dbg_print(self, indent=0): """ Print out debugging information. """ lst = [] more_data = False for i, addr in enumerate(self.mem.keys()): lst.append(addr) if i >= 20: more_data = True ...

Retrieve the permissions of the page at address `addr`. :param addr: address to get the page permissions :param permissions: Integer or BVV to optionally set page permissions to :return: AST representing the permissions on the page def permissions(self, addr, permissions=None...

Map a number of pages at address `addr` with permissions `permissions`. :param addr: address to map the pages at :param length: length in bytes of region to map, will be rounded upwards to the page size :param permissions: AST of permissions to map, will be a bitvalue representing flags ...

Perform execution using any applicable engine. Enumerate the current engines and use the first one that works. Return a SimSuccessors object classifying the results of the run. :param state: The state to analyze :param addr: optional, an address to execute at instead of the...

Returns a state object initialized to the start of a given function, as if it were called with given parameters. :param addr: The address the state should start at instead of the entry point. :param args: Any additional positional arguments will be used as arguments to the functio...

Constructs a new simulation manager. :param thing: Optional - What to put in the new SimulationManager's active stash (either a SimState or a list of SimStates). :param kwargs: Any additional keyword arguments will be passed to the SimulationManager constructor :returns: ...

A Callable is a representation of a function in the binary that can be interacted with like a native python function. :param addr: The address of the function to use :param concrete_only: Throw an exception if the execution splits into multiple states :param perform_merge: ...

Return a SimCC (calling convention) parametrized for this project and, optionally, a given function. :param args: A list of argument storage locations, as SimFunctionArguments. :param ret_val: The return value storage location, as a SimFunctionArgument. :param sp_delta: Does this ...

Get a SimCC (calling convention) that will extract floating-point/integral args correctly. :param arch: The Archinfo arch for this CC :param fp_args: A list, with one entry for each argument the function can take. True if the argument is fp, false if it is integra...

An iterator of all local blocks in the current function. :return: angr.lifter.Block instances. def blocks(self): """ An iterator of all local blocks in the current function. :return: angr.lifter.Block instances. """ for block_addr, block in self._local_blocks.items():...

All of the operations that are done by this functions. def operations(self): """ All of the operations that are done by this functions. """ return [op for block in self.blocks for op in block.vex.operations]

All of the constants that are used by this functions's code. def code_constants(self): """ All of the constants that are used by this functions's code. """ # TODO: remove link register values return [const.value for block in self.blocks for const in block.vex.constants]

All of the constant string references used by this function. :param minimum_length: The minimum length of strings to find (default is 1) :param vex_only: Only analyze VEX IR, don't interpret the entry state to detect additional constants. :return: A list of tuples of (add...

Tries to find all runtime values of this function which do not come from inputs. These values are generated by starting from a blank state and reanalyzing the basic blocks once each. Function calls are skipped, and back edges are never taken so these values are often unreliable, This function is...

All of the concrete values used by this function at runtime (i.e., including passed-in arguments and global values). def runtime_values(self): """ All of the concrete values used by this function at runtime (i.e., including passed-in arguments and global values). """ con...

Get the object this function belongs to. :return: The object this function belongs to. def binary(self): """ Get the object this function belongs to. :return: The object this function belongs to. """ return self._project.loader.find_object_containing(self.addr, membersh...

Add a custom jumpout site. :param node: The address of the basic block that control flow leaves during this transition. :return: None def add_jumpout_site(self, node): """ Add a custom jumpout site. :param node: The address of the basic block that control flow lea...

Add a custom retout site. Retout (returning to outside of the function) sites are very rare. It mostly occurs during CFG recovery when we incorrectly identify the beginning of a function in the first iteration, and then correctly identify that function later in the same iteration (function alig...

Determine the most suitable name of the function. :return: The initial function name. :rtype: string def _get_initial_name(self): """ Determine the most suitable name of the function. :return: The initial function name. :rtype: string """ ...

Determine the name of the binary where this function is. :return: None def _get_initial_binary_name(self): """ Determine the name of the binary where this function is. :return: None """ binary_name = None # if this function is a simprocedure but not a syscall...

Determine if this function returns or not *if it is hooked by a SimProcedure or a user hook*. :return: True if the hooker returns, False otherwise. :rtype: bool def _get_initial_returning(self): """ Determine if this function returns or not *if it is hooked by a SimProcedure or ...

Registers an edge between basic blocks in this function's transition graph. Arguments are CodeNode objects. :param from_node The address of the basic block that control flow leaves during this transition. :param to_node The address of ...

Registers an edge between the caller basic block and callee function. :param from_addr: The basic block that control flow leaves during the transition. :type from_addr: angr.knowledge.CodeNode :param to_func: The function that we are calling :type to_func: Function ...

Registers a basic block as a site for control flow to return from this function. :param CodeNode return_site: The block node that ends with a return. def _add_return_site(self, return_site): """ Registers a basic block as a site for control flow to return from this function. :para...

Registers a basic block as calling a function and returning somewhere. :param call_site_addr: The address of a basic block that ends in a call. :param call_target_addr: The address of the target of said call. :param retn_addr: The address that said call will return to. def...

Iterate through all call edges in transition graph. For each call a non-returning function, mark the source basic block as an endpoint. This method should only be executed once all functions are recovered and analyzed by CFG recovery, so we know whether each function returns or not. :r...

Return a local transition graph that only contain nodes in current function. def graph(self): """ Return a local transition graph that only contain nodes in current function. """ if self._local_transition_graph is not None: return self._local_transition_graph g = n...

Generate a sub control flow graph of instruction addresses based on self.graph :param iterable ins_addrs: A collection of instruction addresses that should be included in the subgraph. :return: A subgraph. :rtype: networkx.DiGraph def subgraph(self, ins_addrs): """ Generate a s...

Get the size of the instruction specified by `insn_addr`. :param int insn_addr: Address of the instruction :return: Size of the instruction in bytes, or None if the instruction is not found. :rtype: int def instruction_size(self, insn_addr): """ Get the size of the instruction ...

Draw the graph and save it to a PNG file. def dbg_draw(self, filename): """ Draw the graph and save it to a PNG file. """ import matplotlib.pyplot as pyplot # pylint: disable=import-error from networkx.drawing.nx_agraph import graphviz_layout # pylint: disable=import-error ...

Registers a register offset as being used as an argument to the function. :param reg_offset: The offset of the register to register. def _add_argument_register(self, reg_offset): """ Registers a register offset as being used as an argument to the function. :param reg_offset: ...

Make sure all basic blocks in the transition graph of this function do not overlap. You will end up with a CFG that IDA Pro generates. This method does not touch the CFG result. You may call CFG{Emulated, Fast}.normalize() for that matter. :return: None def normalize(self): """ ...

Find the most likely function declaration from the embedded collection of prototypes, set it to self.prototype, and update self.calling_convention with the declaration. :return: None def find_declaration(self): """ Find the most likely function declaration from the embedded collection ...

Reverse look-up. :param list lst: The list to look up in. :param item: The item to look for. :return: Offset of the item if found. A ValueError is raised if the item is not in the list. :rtype: int def _rfind(lst, item): """ Reverse look-up. :param list lst: Th...

Push the frame cf onto the stack. Return the new stack. def push(self, cf): """ Push the frame cf onto the stack. Return the new stack. """ cf.next = self if self.state is not None: self.state.register_plugin('callstack', cf) self.state.history.recent_sta...

Pop the top frame from the stack. Return the new stack. def pop(self): """ Pop the top frame from the stack. Return the new stack. """ if self.next is None: raise SimEmptyCallStackError("Cannot pop a frame from an empty call stack.") new_list = self.next.copy({}) ...

Push a stack frame into the call stack. This method is called when calling a function in CFG recovery. :param int callsite_addr: Address of the call site :param int addr: Address of the call target :param int or None retn_target: Address of the return target :param int stack_pointer: Va...

Pop one or many call frames from the stack. This method is called when returning from a function in CFG recovery. :param int retn_target: The target to return to. :return: None def ret(self, retn_target=None): """ Pop one or many call frames from the stack. This method is calle...

Debugging representation of this CallStack object. :return: Details of this CalLStack :rtype: str def dbg_repr(self): """ Debugging representation of this CallStack object. :return: Details of this CalLStack :rtype: str """ stack = [ ] for i, f...

Generate the stack suffix. A stack suffix can be used as the key to a SimRun in CFG recovery. :param int context_sensitivity_level: Level of context sensitivity. :return: A tuple of stack suffix. :rtype: tuple def stack_suffix(self, context_sensitivity_level): """ Generate the ...

Check if the return target exists in the stack, and return the index if exists. We always search from the most recent call stack frame since the most recent frame has a higher chance to be hit in normal CFG recovery. :param int target: Target of the return. :return: The index of the object ...

获取所有股票 ID 到 all_stock_code 目录下 def update_stock_codes(): """获取所有股票 ID 到 all_stock_code 目录下""" all_stock_codes_url = "http://www.shdjt.com/js/lib/astock.js" grep_stock_codes = re.compile(r"~(\d+)`") response = requests.get(all_stock_codes_url) all_stock_codes = grep_stock_codes.findall(response.text...

获取所有股票 ID 到 all_stock_code 目录下 def get_stock_codes(realtime=False): """获取所有股票 ID 到 all_stock_code 目录下""" if realtime: all_stock_codes_url = "http://www.shdjt.com/js/lib/astock.js" grep_stock_codes = re.compile(r"~(\d+)`") response = requests.get(all_stock_codes_url) stock_codes ...

return specific stocks real quotation :param stock_codes: stock code or list of stock code, when prefix is True, stock code must start with sh/sz :param prefix: if prefix i True, stock_codes must contain sh/sz market flag. If prefix is False, index quotation can't return ...

return all market quotation snapshot :param prefix: if prefix is True, return quotation dict's stock_code key start with sh/sz market flag def market_snapshot(self, prefix=False): """return all market quotation snapshot :param prefix: if prefix is True, return quotation dict's st...

获取并格式化股票信息 def get_stock_data(self, stock_list, **kwargs): """获取并格式化股票信息""" res = self._fetch_stock_data(stock_list) return self.format_response_data(res, **kwargs)

获取股票信息 def _fetch_stock_data(self, stock_list): """获取股票信息""" pool = multiprocessing.pool.ThreadPool(len(stock_list)) try: res = pool.map(self.get_stocks_by_range, stock_list) finally: pool.close() return [d for d in res if d is not None]

因为 timekline 的返回没有带对应的股票代码，所以要手动带上 def _fetch_stock_data(self, stock_list): """因为 timekline 的返回没有带对应的股票代码，所以要手动带上""" res = super()._fetch_stock_data(stock_list) with_stock = [] for stock, resp in zip(stock_list, res): if resp is not None: with_stock.append((...

格式化集思录返回的json数据,以字典形式保存 def formatfundajson(fundajson): """格式化集思录返回的json数据,以字典形式保存""" result = {} for row in fundajson["rows"]: funda_id = row["id"] cell = row["cell"] result[funda_id] = cell return result

格式化集思录返回的json数据,以字典形式保存 def formatfundbjson(fundbjson): """格式化集思录返回的json数据,以字典形式保存""" result = {} for row in fundbjson["rows"]: cell = row["cell"] fundb_id = cell["fundb_id"] result[fundb_id] = cell return result

格式化集思录返回指数ETF 的json数据,以字典形式保存 def formatetfindexjson(fundbjson): """格式化集思录返回指数ETF 的json数据,以字典形式保存""" result = {} for row in fundbjson["rows"]: cell = row["cell"] fundb_id = cell["fund_id"] result[fundb_id] = cell return result

以字典形式返回分级A数据 :param fields:利率范围，形如['+3.0%', '6.0%'] :param min_volume:最小交易量，单位万元 :param min_discount:最小折价率, 单位% :param ignore_nodown:是否忽略无下折品种,默认 False :param forever: 是否选择永续品种,默认 False def funda( self, fields=None, min_volume=0, min_discount=0, ...