IDAPython 9.0
|
Proxy of C++ dirtree_t class.
Public Member Functions | |
__init__ (self, "dirspec_t" ds) | |
init(self, ds) -> dirtree_t | |
"bool" | is_orderable (self) |
is_orderable(self) -> bool Is dirtree orderable? | |
"dterr_t" | chdir (self, "char const *" path) |
chdir(self, path) -> dterr_t Change current directory | |
"qstring" | getcwd (self) |
getcwd(self) -> qstring Get current directory | |
"qstring" | get_abspath (self, *args) |
get_abspath(self, cursor, name_flags=DTN_FULL_NAME) -> qstring Construct an absolute path from the specified relative path. | |
"direntry_t" | resolve_cursor (self, "dirtree_cursor_t" cursor) |
resolve_cursor(self, cursor) -> direntry_t Resolve cursor | |
"direntry_t" | resolve_path (self, "char const *" path) |
resolve_path(self, path) -> direntry_t Resolve path | |
"bool" | isdir (self, *args) |
isdir(self, de) -> bool | |
"bool" | isfile (self, *args) |
isfile(self, de) -> bool | |
"qstring" | get_entry_name (self, "direntry_t" de, "uint32" name_flags=DTN_FULL_NAME) |
get_entry_name(self, de, name_flags=DTN_FULL_NAME) -> qstring Get entry name | |
"bool" | is_dir_ordered (self, "diridx_t" diridx) |
is_dir_ordered(self, diridx) -> bool Is dir ordered? | |
"bool" | set_natural_order (self, "diridx_t" diridx, "bool" enable) |
set_natural_order(self, diridx, enable) -> bool Enable/disable natural inode order in a directory. | |
"ssize_t" | get_dir_size (self, "diridx_t" diridx) |
get_dir_size(self, diridx) -> ssize_t Get dir size | |
"qstring" | get_entry_attrs (self, "direntry_t" de) |
get_entry_attrs(self, de) -> qstring Get entry attributes | |
"bool" | findfirst (self, "dirtree_iterator_t" ff, "char const *" pattern) |
findfirst(self, ff, pattern) -> bool Start iterating over files in a directory | |
"bool" | findnext (self, "dirtree_iterator_t" ff) |
findnext(self, ff) -> bool Continue iterating over files in a directory | |
"dterr_t" | mkdir (self, "char const *" path) |
mkdir(self, path) -> dterr_t Create a directory. | |
"dterr_t" | rmdir (self, "char const *" path) |
rmdir(self, path) -> dterr_t Remove a directory. | |
"dterr_t" | link (self, *args) |
link(self, path) -> dterr_t Add an inode into the current directory | |
"dterr_t" | unlink (self, *args) |
unlink(self, path) -> dterr_t Remove an inode from the current directory | |
"dterr_t" | rename (self, "char const *" _from, "char const *" to) |
rename(self, _from, to) -> dterr_t Rename a directory entry. | |
"ssize_t" | get_rank (self, "diridx_t" diridx, "direntry_t" de) |
get_rank(self, diridx, de) -> ssize_t Get ordering rank of an item. | |
"dterr_t" | change_rank (self, "char const *" path, "ssize_t" rank_delta) |
change_rank(self, path, rank_delta) -> dterr_t Change ordering rank of an item. | |
"dirtree_cursor_t" | get_parent_cursor (self, "dirtree_cursor_t" cursor) |
get_parent_cursor(self, cursor) -> dirtree_cursor_t Get parent cursor. | |
"bool" | load (self) |
load(self) -> bool Load the tree structure from the netnode. | |
"bool" | save (self) |
save(self) -> bool Save the tree structure to the netnode. | |
"char const *" | get_id (self) |
get_id(self) -> char const * netnode name | |
"void" | set_id (self, "char const *" nm) |
set_id(self, nm) | |
"void" | notify_dirtree (self, "bool" added, "inode_t" inode) |
notify_dirtree(self, added, inode) Notify dirtree about a change of an inode. | |
"ssize_t" | traverse (self, "dirtree_visitor_t" v) |
traverse(self, v) -> ssize_t Traverse dirtree, and be notified at each entry If the the visitor returns anything other than 0, iteration will stop, and that value returned. | |
"dirtree_cursor_t" | find_entry (self, "direntry_t" de) |
find_entry(self, de) -> dirtree_cursor_t Find the cursor corresponding to an entry of a directory | |
Static Public Member Functions | |
"char const *" | errstr ("dterr_t" err) |
errstr(err) -> char const * Get textual representation of the error code. | |
Static Public Attributes | |
"char const *" | get_nodename = get_id |
"void" | set_nodename = set_id |
Properties | |
thisown = property(lambda x: x.this.own(), lambda x, v: x.this.own(v), doc="The membership flag") | |
__init__ | ( | self, | |
"dirspec_t" | ds ) |
ds | dirspec_t * |
"dterr_t" change_rank | ( | self, | |
"char const *" | path, | ||
"ssize_t" | rank_delta ) |
path | (C++: const char *) path to the item |
rank_delta | (C++: ssize_t) the amount of the change. positive numbers mean to move down in the list; negative numbers mean to move up. |
"dterr_t" chdir | ( | self, | |
"char const *" | path ) |
path | (C++: const char *) new current directory |
|
static |
err | (C++: dterr_t) enum dterr_t |
"dirtree_cursor_t" find_entry | ( | self, | |
"direntry_t" | de ) |
de | (C++: const direntry_t &) directory entry |
"bool" findfirst | ( | self, | |
"dirtree_iterator_t" | ff, | ||
"char const *" | pattern ) |
ff | (C++: dirtree_iterator_t *) directory iterator. it will be initialized by the function |
pattern | (C++: const char *) pattern to search for |
"bool" findnext | ( | self, | |
"dirtree_iterator_t" | ff ) |
ff | (C++: dirtree_iterator_t *) directory iterator |
"qstring" get_abspath | ( | self, | |
* | args ) |
This function verifies the directory part of the specified path. The last component of the specified path is not verified.
cursor | dirtree_cursor_t const & |
name_flags | uint32 |
relpath | char const * |
"ssize_t" get_dir_size | ( | self, | |
"diridx_t" | diridx ) |
diridx | (C++: diridx_t) directory index |
"qstring" get_entry_attrs | ( | self, | |
"direntry_t" | de ) |
de | (C++: const direntry_t &) directory entry |
"qstring" get_entry_name | ( | self, | |
"direntry_t" | de, | ||
"uint32" | name_flags = DTN_FULL_NAME ) |
de | (C++: const direntry_t &) directory entry |
name_flags | (C++: uint32) how exactly the name should be retrieved. combination of bits for get_...name() methods bits |
"char const *" get_id | ( | self | ) |
"dirtree_cursor_t" get_parent_cursor | ( | self, | |
"dirtree_cursor_t" | cursor ) |
cursor | (C++: const dirtree_cursor_t &) a valid ditree cursor |
"ssize_t" get_rank | ( | self, | |
"diridx_t" | diridx, | ||
"direntry_t" | de ) |
diridx | (C++: diridx_t) index of the parent directory |
de | (C++: const direntry_t &) directory entry |
"qstring" getcwd | ( | self | ) |
"bool" is_dir_ordered | ( | self, | |
"diridx_t" | diridx ) |
diridx | (C++: diridx_t) |
"bool" is_orderable | ( | self | ) |
"bool" isdir | ( | self, | |
* | args ) |
"bool" isfile | ( | self, | |
* | args ) |
"dterr_t" link | ( | self, | |
* | args ) |
path | char const * |
inode | inode_t |
"bool" load | ( | self | ) |
If dirspec_t.id is empty, the operation will be considered a success. In addition, calling load() more than once will not do anything, and will be considered a success.
"dterr_t" mkdir | ( | self, | |
"char const *" | path ) |
path | (C++: const char *) directory to create |
"void" notify_dirtree | ( | self, | |
"bool" | added, | ||
"inode_t" | inode ) |
added | (C++: bool) are we adding or deleting an inode? |
inode | (C++: inode_t) inode in question |
"dterr_t" rename | ( | self, | |
"char const *" | _from, | ||
"char const *" | to ) |
from | (C++: const char *) source path |
to | (C++: const char *) destination path |
"direntry_t" resolve_cursor | ( | self, | |
"dirtree_cursor_t" | cursor ) |
cursor | (C++: const dirtree_cursor_t &) to analyze |
"direntry_t" resolve_path | ( | self, | |
"char const *" | path ) |
path | (C++: const char *) to analyze |
"dterr_t" rmdir | ( | self, | |
"char const *" | path ) |
path | (C++: const char *) directory to delete |
"bool" save | ( | self | ) |
"void" set_id | ( | self, | |
"char const *" | nm ) |
nm | char const * |
"bool" set_natural_order | ( | self, | |
"diridx_t" | diridx, | ||
"bool" | enable ) |
diridx | (C++: diridx_t) directory index |
enable | (C++: bool) action to do TRUE - enable ordering: re-order existing entries so that all subdirs are at the to beginning of the list, file entries are sorted and placed after the subdirs FALSE - disable ordering, no changes to existing entries |
"ssize_t" traverse | ( | self, | |
"dirtree_visitor_t" | v ) |
The tree is traversed using a depth-first algorithm. It is forbidden to modify the dirtree_t during traversal; doing so will result in undefined behavior.
v | (C++: dirtree_visitor_t &) the callback |
"dterr_t" unlink | ( | self, | |
* | args ) |
path | char const * |
inode | inode_t |
|
static |
|
static |
|
static |