<Pali>
we have maybe chance to see working n900 (front) camera with upstream kernel...
Kabouik has quit [Read error: Connection reset by peer]
<jonwil>
Damn, my house is being invaded by flying beetles :(
<DocScrutinizer05>
Pali: on N900 the front camera is muxed with main camera to same interface
<Pali>
DocScrutinizer05: I know, but problem is with isp camera subsystem in kernel
<DocScrutinizer05>
aaah
<Pali>
it is broken since 3.5
<Pali>
we have patches for mux
<Pali>
but only green grass is visible :D
<DocScrutinizer05>
>> The status is now that images can be captured using the Nokia N9 camera, in which the sensor is connected to the CSI-2 interface.<< made me suspect different
<DocScrutinizer05>
patches for mux sounds good, it's not exactly simple thing to handle, since I guess several things that usually get done in module init now have to get done on switching mux, and one module needs to export *2* interfaces for two cameras
<DocScrutinizer05>
typical case for epic fail of DT handling real life complexity
<DocScrutinizer05>
well, maybe the module alrady was smart even for single cam, and dit whole cam power up and init only on open() to cam device
<DocScrutinizer05>
did*
<DocScrutinizer05>
so module_init would only expose the device nodes
<jonwil>
great to see kernel progress is being made :)
<Pali>
in DT should be description of that two GPIOs and (ISP) driver should handle it
che1 has quit [Ping timeout: 264 seconds]
<Pali>
anyway, tomorrow I'm in Krakow... at ACM ICPC (regional programming contest in algorithm)
che1 has joined #neo900
<DocScrutinizer05>
>>regional programming contest in algorithm<< oooooOOOOooohhhh! 8-)
<bencoh>
:)
<DocScrutinizer05>
will it be like "A competes B in chess played by minimax algos written by the combatants" ?
<Pali>
no, this is something other... there is no battle between teams like playing chess... each team will get set of problems and want to solve as most as possible in less time
<Pali>
you have problem description and you need to program algorithm which solve this problem for every possible input (= write correct output)
<Pali>
once you think you have working program you will sent it for testing and automatic system start it on set of input data and check if output of program is correct for tested input data
jonwil has quit [Quit: ChatZilla 0.9.91 [SeaMonkey 2.30/20141013232806]]
<Pali>
example of (easy) problem: you have N towns and on stdin is specified which two towns are directly connected (with distance). On stdout you should output minimal path cost between towns A and B (or write that there is no possible path between A and B)
freemangordon has quit [Ping timeout: 245 seconds]
freemangordon has joined #neo900
obsed has quit [Ping timeout: 245 seconds]
j4s0nmchr1st0s has quit [Quit: j4s0nmchr1st0s]
j4s0nmchr1st0s has joined #neo900
sparetire_ has joined #neo900
freemangordon_ has joined #neo900
<freemangordon_>
Pali: great, finally some progress on ISP
<Pali>
yes :-)
<freemangordon_>
which most probably means I will have to RE omap3camd after PA :(
che1 has quit [Ping timeout: 245 seconds]
j4s0nmchr1st0s has quit [Quit: j4s0nmchr1st0s]
Kabouik has joined #neo900
paulk-collins has joined #neo900
paulk-collins has quit [Ping timeout: 265 seconds]