Create a new channel of the passed size, returning its write and read ends.
The passed integer bounds will be rounded up to the next highest power of
two, n. The queue may grow up to size 2*n (see writeChan for details),
and the resulting chan pair requires O(n) space.