Gjat\u00eb diskutimit mbi nj\u00eb grup t\u00eb ri korrigjimesh q\u00eb u propzuan p\u00ebr t'u p\u00ebrfshir\u00eb n\u00eb b\u00ebrtham\u00ebn 6.11-rc5 nga autori i Bcachefs, Linus Torvalds shkroi se fillon t\u00eb mbaj\u00eb mendje p\u00ebr pranimin e sistemit t\u00eb skedar\u00ebve Bcachefs n\u00eb b\u00ebrtham\u00eb. Paaft\u00ebsia e Torvalds lidhet me faktin se Kent Overstreet, autori i Bcachefs, n\u00eb faz\u00ebn p\u00ebrfundimtare t\u00eb kandidat\u00ebve p\u00ebr l\u00ebshim, d\u00ebrgon korrigjime shum\u00eb t\u00eb m\u00ebdha q\u00eb n\u00eb thelb jo vet\u00ebm q\u00eb korrigjojn\u00eb gabimet, por vazhdojn\u00eb t\u00eb zhvillojn\u00eb funksionalitetin, ndon\u00ebse ndryshimet funksionale lejohen vet\u00ebm n\u00eb faz\u00ebn fillestare t\u00eb zhvillimit t\u00eb nj\u00eb dege t\u00eb re, nd\u00ebrsa n\u00eb faz\u00ebn rc5 pranohen vet\u00ebm korrigjime t\u00eb vogla, t\u00eb cilat preferohet t\u00eb mos kalojn\u00eb 100 rreshta kodi. <\/p>\n
Patch-i i d\u00ebrguar p\u00ebr Bcachefs, n\u00eb t\u00eb cilin u shtuan 1309 rreshta dhe u hoq\u00ebn 671 rreshta n\u00eb 39 skedar\u00eb, p\u00ebrve\u00e7 korrigjimeve t\u00eb gabimeve p\u00ebrfshinte dy ndryshime t\u00eb r\u00ebnd\u00ebsishme: mb\u00ebshtetje p\u00ebr nj\u00eb struktur\u00eb t\u00eb re t\u00eb t\u00eb dh\u00ebnave p\u00ebr menaxhimin e list\u00ebs s\u00eb elementeve t\u00eb lira n\u00eb cache dhe mund\u00ebsin\u00eb p\u00ebr t\u00eb konvertuar tabela hash p\u00ebr cache. Struktura e re u shtua p\u00ebr t'u liruar nga bllokimet e panevojshme t\u00eb cache dhe p\u00ebr t\u00eb shmangur situatat q\u00eb mund t\u00eb \u00e7ojn\u00eb n\u00eb konflikte bllokimi gjat\u00eb ngarkesave shum\u00ebq\u00ebveritare. <\/p>\n
Ky nuk \u00ebsht\u00eb rasti i par\u00eb kur korrigjime t\u00eb m\u00ebdha p\u00ebr Bcachefs d\u00ebrgohen pas dritares s\u00eb pranimit t\u00eb ndryshimeve, dhe nuk \u00ebsht\u00eb rasti i par\u00eb kur n\u00eb vend t\u00eb thjesht korigjimeve t\u00eb gabimeve promovohen plot\u00ebsime funksionale m\u00eb t\u00eb r\u00ebnda, t\u00eb cilat b\u00ebhen p\u00ebrmes k\u00ebrkesave p\u00ebr ndihm\u00eb n\u00eb fazat p\u00ebrfundimtare t\u00eb zhvillimit t\u00eb nj\u00eb dege t\u00eb re. Linus Torvalds u p\u00ebrgjigj n\u00eb pull-request-in e d\u00ebrguar: <\/p>\n
\u00abMjaft. K\u00ebrkesa e fundit p\u00ebr t\u00ebrheqje gjithashtu ishte e madhe. Kjo k\u00ebrkes\u00eb gjithashtu \u00ebsht\u00eb shum\u00eb e gjer\u00eb, prek gj\u00ebra q\u00eb nuk i p\u00ebrkasin Bcachefs, dhe as q\u00eb \u00ebsht\u00eb ndonj\u00eb regresion edhe n\u00eb distanc\u00eb. N\u00eb nj\u00eb pik\u00eb, \u00abrregullimi i di\u00e7kaje\u00bb vet\u00ebm sa kthehet n\u00eb zhvillim, dhe kjo \u00ebsht\u00eb ajo pik\u00eb. Askush me mendje t\u00eb sh\u00ebndosh\u00eb nuk e p\u00ebrdor Bcachefs dhe nuk pret stabilitet prej tij, prandaj \u00e7do p\u00ebrdorues \u2013 \u00ebsht\u00eb nj\u00eb fush\u00eb eksperimentesh. Patch-et Bcachefs jan\u00eb b\u00ebr\u00eb nj\u00eb lloj \u00abzhvillimi t\u00eb madh gjat\u00eb ciklit t\u00eb p\u00ebrgatitjes s\u00eb l\u00ebshimit, e jo para tij\u00bb, deri n\u00eb at\u00eb pik\u00eb sa filloj t\u00eb m\u00eb vijn\u00eb keq p\u00ebr pranimet mbi Bcachefs. N\u00ebse Bcachefs nuk mund t\u00eb p\u00ebrfundoj\u00eb si\u00e7 duhet sipas orarit t\u00eb zhvillimit t\u00eb b\u00ebrtham\u00ebs kryesore (upstream), ndoshta nuk duhet t\u00eb jet\u00eb n\u00eb b\u00ebrtham\u00ebn kryesore. Kjo po del jasht\u00eb \u00e7do kufiri t\u00eb qesharake\u00bb. <\/p><\/blockquote>\n
Kent Overstreet u p\u00ebrgjigj se Bcachefs \u00ebsht\u00eb p\u00ebrcaktimisht m\u00eb e besueshme se Btrfs dhe po punon p\u00ebr ta b\u00ebr\u00eb at\u00eb m\u00eb t\u00eb q\u00ebndruesh\u00ebm dhe t\u00eb besuesh\u00ebm se XFS dhe EXT4, fal\u00eb realizimit t\u00eb mekanizmit t\u00eb integritetit t\u00eb t\u00eb dh\u00ebnave nga skaji n\u00eb skaj (end to end data Integrity). Kent gjithashtu theksoi se ndryshimet e propozuara lidhen drejtp\u00ebrdrejt me rritjen e besueshm\u00ebris\u00eb, dhe n\u00ebse nj\u00eb gabim n\u00eb n\u00ebn-sistemet e tjera t\u00eb b\u00ebrtham\u00ebs mund t\u00eb kufizohet n\u00eb nj\u00eb d\u00ebshtim dhe rivendosje, n\u00eb sistemet e skedar\u00ebve \u00e7mimi i gabimit \u00ebsht\u00eb shum\u00eb i lart\u00eb dhe mund t\u00eb \u00e7oj\u00eb n\u00eb d\u00ebmtime t\u00eb fshehura t\u00eb t\u00eb dh\u00ebnave, t\u00eb cilat mund t\u00eb vihen re vet\u00ebm jav\u00eb m\u00eb von\u00eb. <\/p>\n