export treeWalkCallback
(_root *C.char, entry *C.git_tree_entry, ptr unsafe.Pointer)
| 129 | |
| 130 | //export treeWalkCallback |
| 131 | func treeWalkCallback(_root *C.char, entry *C.git_tree_entry, ptr unsafe.Pointer) C.int { |
| 132 | data, ok := pointerHandles.Get(ptr).(*treeWalkCallbackData) |
| 133 | if !ok { |
| 134 | panic("invalid treewalk callback") |
| 135 | } |
| 136 | |
| 137 | err := data.callback(C.GoString(_root), newTreeEntry(entry)) |
| 138 | if err == TreeWalkSkip { |
| 139 | return C.int(1) |
| 140 | } else if err != nil { |
| 141 | *data.errorTarget = err |
| 142 | return C.int(ErrorCodeUser) |
| 143 | } |
| 144 | |
| 145 | return C.int(ErrorCodeOK) |
| 146 | } |
| 147 | |
| 148 | // TreeWalkSkip is an error that can be returned form TreeWalkCallback to skip |
| 149 | // a subtree from being expanded. |
nothing calls this directly
no test coverage detected
searching dependent graphs…