Home | Trees | Indices | Help |
|
---|
|
Base class for search patterns.
The following Pattern subclasses are provided by WinAppDbg:
See Also: Search.search_process
|
|||
|
|||
|
|||
|
|||
tuple( int, int ) |
|
||
tuple( int, int, str ) |
|
||
Inherited from |
|
|||
Inherited from |
|
Class constructor. The only mandatory argument should be the pattern string. This method MUST be reimplemented by subclasses of Pattern.
|
Returns the maximum expected length of the strings matched by this pattern. Exact behavior is implementation dependent. Ideally it should be an exact value, but in some cases it's not possible to calculate so an upper limit should be returned instead. If that's not possible either an exception must be raised. This value will be used to calculate the required buffer size when doing buffered searches. This method MUST be reimplemented by subclasses of Pattern. |
Reads the requested number of bytes from the process memory at the given address. Subclasses of Pattern tipically don't need to reimplement this method. |
Searches for the pattern in the given buffer, optionally starting at the given position within the buffer. This method MUST be reimplemented by subclasses of Pattern.
|
This method gets called when a match is found. This allows subclasses of Pattern to filter out unwanted results, or modify the results before giving them to the caller of Search.search_process. If the return value is Subclasses of Pattern don't need to reimplement this method unless filtering is needed.
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Fri Dec 20 17:54:54 2013 | http://epydoc.sourceforge.net |