Struct gimli::EntriesCursor [−] [src]

Get the entry that the cursor is currently pointing to.

Move the cursor to the next DIE in the tree in DFS order.

Upon success, return the delta traversal depth:

• If we moved down into the previous current entry's children, we get Ok(1).

• If we moved to the previous current entry's sibling, we get Ok(0).

• If the previous entry does not have any siblings and we move up to its parent's next sibling, then we get Ok(-1). Note that if the parent doesn't have a next sibling, then it could go up to the parent's parent's next sibling and return Ok(-2), etc.

Here is an example that finds the first entry in a compilation unit that does not have any children.

let unit = get_some_compilation_unit();
let abbrevs = get_abbrevs_for_compilation_unit(&unit);

let mut first_entry_with_no_children = None;
let mut cursor = unit.entries(&abbrevs);

// Keep looping while the cursor is moving deeper into the DIE tree.
while let Ok(delta_depth) = cursor.next_dfs() {
    // 0 means we moved to a sibling, a negative number means we went back
    // up to a parent's sibling. In either case, bail out of the loop because
    //  we aren't going deeper into the tree anymore.
    if delta_depth <= 0 {
        break;
    }

    let current = cursor.current()
        .expect("Should be at an entry")
        .expect("And we should parse the entry ok");
    first_entry_with_no_children = Some(current);
}

println!("The first entry with no children is {:?}",
         first_entry_with_no_children.unwrap());

Move the cursor to the next sibling DIE of the current one.

Formats the value using the given formatter.

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more