.\" This manpage has been automatically generated by docbook2man .\" from a DocBook document. This tool can be found at: .\" .\" Please send any bug reports, improvements, comments, patches, .\" etc. to Steve Cheng . .TH "W1_SEARCH" "9" "09 October 2005" "" "" .SH NAME w1_search \- .SH SYNOPSIS "SYNOPSIS" .sp \fB .sp void w1_search (struct w1_master * \fIdev\fB, w1_slave_found_callback \fIcb\fB); \fR .SH "ARGUMENTS" .TP \fB\fIdev\fB\fR -- undescribed -- .TP \fB\fIcb\fB\fR -- undescribed -- .SH "DESCRIPTION" .PP The 1-wire search is a simple binary tree search. For each bit of the address, we read two bits and write one bit. The bit written will put to sleep all devies that don't match that bit. When the two reads differ, the direction choice is obvious. When both bits are 0, we must choose a path to take. When we can scan all 64 bits without having to choose a path, we are done. .PP See ``Application note 187 1-wire search algorithm'' at www.maxim-ic.com .PP \fIdev\fR The master device to search \fIcb\fR Function to call when a device is found