Re: [U-Boot] [PATCH 2/2] spi: mxc_spi: Update pre and post divider algorithm

2013-05-10 Thread Troy Kisky
On 5/10/2013 12:08 PM, Dirk Behme wrote: Am 10.05.2013 20:44, schrieb Troy Kisky: On 5/9/2013 10:34 PM, Dirk Behme wrote: Am 09.05.2013 20:00, schrieb Troy Kisky: On 5/8/2013 10:19 PM, Dirk Behme wrote: The spi clock divisor is of the form x * (2**y), or x << y, where x is 1 to 16, and y i

Re: [U-Boot] [PATCH 2/2] spi: mxc_spi: Update pre and post divider algorithm

2013-05-10 Thread Dirk Behme
Am 10.05.2013 20:44, schrieb Troy Kisky: On 5/9/2013 10:34 PM, Dirk Behme wrote: Am 09.05.2013 20:00, schrieb Troy Kisky: On 5/8/2013 10:19 PM, Dirk Behme wrote: The spi clock divisor is of the form x * (2**y), or x << y, where x is 1 to 16, and y is 0 to 15. Note the similarity with floati

Re: [U-Boot] [PATCH 2/2] spi: mxc_spi: Update pre and post divider algorithm

2013-05-10 Thread Troy Kisky
On 5/9/2013 10:34 PM, Dirk Behme wrote: Am 09.05.2013 20:00, schrieb Troy Kisky: On 5/8/2013 10:19 PM, Dirk Behme wrote: The spi clock divisor is of the form x * (2**y), or x << y, where x is 1 to 16, and y is 0 to 15. Note the similarity with floating point numbers. Convert the desired divi

Re: [U-Boot] [PATCH 2/2] spi: mxc_spi: Update pre and post divider algorithm

2013-05-09 Thread Dirk Behme
Am 09.05.2013 20:00, schrieb Troy Kisky: On 5/8/2013 10:19 PM, Dirk Behme wrote: The spi clock divisor is of the form x * (2**y), or x << y, where x is 1 to 16, and y is 0 to 15. Note the similarity with floating point numbers. Convert the desired divisor to the smallest number which is >= de

Re: [U-Boot] [PATCH 2/2] spi: mxc_spi: Update pre and post divider algorithm

2013-05-09 Thread Troy Kisky
On 5/8/2013 10:19 PM, Dirk Behme wrote: The spi clock divisor is of the form x * (2**y), or x << y, where x is 1 to 16, and y is 0 to 15. Note the similarity with floating point numbers. Convert the desired divisor to the smallest number which is >= desired divisor, and can be represented in t

Re: [U-Boot] [PATCH 2/2] spi: mxc_spi: Update pre and post divider algorithm

2013-05-09 Thread Troy Kisky
On 5/9/2013 11:00 AM, Troy Kisky wrote: On 5/8/2013 10:19 PM, Dirk Behme wrote: The spi clock divisor is of the form x * (2**y), or x << y, where x is 1 to 16, and y is 0 to 15. Note the similarity with floating point numbers. Convert the desired divisor to the smallest number which is >= d

[U-Boot] [PATCH 2/2] spi: mxc_spi: Update pre and post divider algorithm

2013-05-08 Thread Dirk Behme
The spi clock divisor is of the form x * (2**y), or x << y, where x is 1 to 16, and y is 0 to 15. Note the similarity with floating point numbers. Convert the desired divisor to the smallest number which is >= desired divisor, and can be represented in this form. The previous algorithm chose a d