equal
deleted
inserted
replaced
598 return KErrOverflow; |
598 return KErrOverflow; |
599 } |
599 } |
600 |
600 |
601 TCEA861TEdidDescriptorBlockList* lastnode = iParsedInfo->iDescriptorBlocks; |
601 TCEA861TEdidDescriptorBlockList* lastnode = iParsedInfo->iDescriptorBlocks; |
602 |
602 |
603 for( TInt index = aIndex; index < KEdidParserSizeOfEdidBlock; index++ ) |
603 TInt index = aIndex; |
|
604 while( index < KEdidParserSizeOfEdidBlock ) |
604 { |
605 { |
605 // Offset. If this is a newer version of CEA-861, |
606 // Offset. If this is a newer version of CEA-861, |
606 // then this is skipped (we are already past the offset) |
607 // then this is skipped (we are already past the offset) |
607 if( index == 2 ) |
608 if( index == 2 ) |
608 { |
609 { |
633 lastnode->iData = tmp; |
634 lastnode->iData = tmp; |
634 } |
635 } |
635 else |
636 else |
636 { |
637 { |
637 // this is only padding, no need to do anything |
638 // this is only padding, no need to do anything |
|
639 index++; |
638 } |
640 } |
639 |
641 |
640 // after the descriptors there is padding to fill Extension block to 128 bytes. |
642 // after the descriptors there is padding to fill Extension block to 128 bytes. |
641 // beginning of padding | End of padding | Checksum |
643 // beginning of padding | End of padding | Checksum |
642 // d+(18*n) ..........................| 126 | 127 |
644 // d+(18*n) ..........................| 126 | 127 |