ide-tape.c 119 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003
  1. /*
  2. * IDE ATAPI streaming tape driver.
  3. *
  4. * Copyright (C) 1995-1999 Gadi Oxman <gadio@netvision.net.il>
  5. * Copyright (C) 2003-2005 Bartlomiej Zolnierkiewicz
  6. *
  7. * This driver was constructed as a student project in the software laboratory
  8. * of the faculty of electrical engineering in the Technion - Israel's
  9. * Institute Of Technology, with the guide of Avner Lottem and Dr. Ilana David.
  10. *
  11. * It is hereby placed under the terms of the GNU general public license.
  12. * (See linux/COPYING).
  13. *
  14. * For a historical changelog see
  15. * Documentation/ide/ChangeLog.ide-tape.1995-2002
  16. */
  17. #define IDETAPE_VERSION "1.19"
  18. #include <linux/module.h>
  19. #include <linux/types.h>
  20. #include <linux/string.h>
  21. #include <linux/kernel.h>
  22. #include <linux/delay.h>
  23. #include <linux/timer.h>
  24. #include <linux/mm.h>
  25. #include <linux/interrupt.h>
  26. #include <linux/jiffies.h>
  27. #include <linux/major.h>
  28. #include <linux/errno.h>
  29. #include <linux/genhd.h>
  30. #include <linux/slab.h>
  31. #include <linux/pci.h>
  32. #include <linux/ide.h>
  33. #include <linux/smp_lock.h>
  34. #include <linux/completion.h>
  35. #include <linux/bitops.h>
  36. #include <linux/mutex.h>
  37. #include <scsi/scsi.h>
  38. #include <asm/byteorder.h>
  39. #include <asm/irq.h>
  40. #include <asm/uaccess.h>
  41. #include <asm/io.h>
  42. #include <asm/unaligned.h>
  43. #include <linux/mtio.h>
  44. /**************************** Tunable parameters *****************************/
  45. /*
  46. * Pipelined mode parameters.
  47. *
  48. * We try to use the minimum number of stages which is enough to
  49. * keep the tape constantly streaming. To accomplish that, we implement
  50. * a feedback loop around the maximum number of stages:
  51. *
  52. * We start from MIN maximum stages (we will not even use MIN stages
  53. * if we don't need them), increment it by RATE*(MAX-MIN)
  54. * whenever we sense that the pipeline is empty, until we reach
  55. * the optimum value or until we reach MAX.
  56. *
  57. * Setting the following parameter to 0 is illegal: the pipelined mode
  58. * cannot be disabled (calculate_speeds() divides by tape->max_stages.)
  59. */
  60. #define IDETAPE_MIN_PIPELINE_STAGES 1
  61. #define IDETAPE_MAX_PIPELINE_STAGES 400
  62. #define IDETAPE_INCREASE_STAGES_RATE 20
  63. /*
  64. * The following are used to debug the driver:
  65. *
  66. * Setting IDETAPE_DEBUG_LOG to 1 will log driver flow control.
  67. *
  68. * Setting them to 0 will restore normal operation mode:
  69. *
  70. * 1. Disable logging normal successful operations.
  71. * 2. Disable self-sanity checks.
  72. * 3. Errors will still be logged, of course.
  73. *
  74. * All the #if DEBUG code will be removed some day, when the driver
  75. * is verified to be stable enough. This will make it much more
  76. * esthetic.
  77. */
  78. #define IDETAPE_DEBUG_LOG 0
  79. /*
  80. * After each failed packet command we issue a request sense command
  81. * and retry the packet command IDETAPE_MAX_PC_RETRIES times.
  82. *
  83. * Setting IDETAPE_MAX_PC_RETRIES to 0 will disable retries.
  84. */
  85. #define IDETAPE_MAX_PC_RETRIES 3
  86. /*
  87. * With each packet command, we allocate a buffer of
  88. * IDETAPE_PC_BUFFER_SIZE bytes. This is used for several packet
  89. * commands (Not for READ/WRITE commands).
  90. */
  91. #define IDETAPE_PC_BUFFER_SIZE 256
  92. /*
  93. * In various places in the driver, we need to allocate storage
  94. * for packet commands and requests, which will remain valid while
  95. * we leave the driver to wait for an interrupt or a timeout event.
  96. */
  97. #define IDETAPE_PC_STACK (10 + IDETAPE_MAX_PC_RETRIES)
  98. /*
  99. * Some drives (for example, Seagate STT3401A Travan) require a very long
  100. * timeout, because they don't return an interrupt or clear their busy bit
  101. * until after the command completes (even retension commands).
  102. */
  103. #define IDETAPE_WAIT_CMD (900*HZ)
  104. /*
  105. * The following parameter is used to select the point in the internal
  106. * tape fifo in which we will start to refill the buffer. Decreasing
  107. * the following parameter will improve the system's latency and
  108. * interactive response, while using a high value might improve system
  109. * throughput.
  110. */
  111. #define IDETAPE_FIFO_THRESHOLD 2
  112. /*
  113. * DSC polling parameters.
  114. *
  115. * Polling for DSC (a single bit in the status register) is a very
  116. * important function in ide-tape. There are two cases in which we
  117. * poll for DSC:
  118. *
  119. * 1. Before a read/write packet command, to ensure that we
  120. * can transfer data from/to the tape's data buffers, without
  121. * causing an actual media access. In case the tape is not
  122. * ready yet, we take out our request from the device
  123. * request queue, so that ide.c will service requests from
  124. * the other device on the same interface meanwhile.
  125. *
  126. * 2. After the successful initialization of a "media access
  127. * packet command", which is a command which can take a long
  128. * time to complete (it can be several seconds or even an hour).
  129. *
  130. * Again, we postpone our request in the middle to free the bus
  131. * for the other device. The polling frequency here should be
  132. * lower than the read/write frequency since those media access
  133. * commands are slow. We start from a "fast" frequency -
  134. * IDETAPE_DSC_MA_FAST (one second), and if we don't receive DSC
  135. * after IDETAPE_DSC_MA_THRESHOLD (5 minutes), we switch it to a
  136. * lower frequency - IDETAPE_DSC_MA_SLOW (1 minute).
  137. *
  138. * We also set a timeout for the timer, in case something goes wrong.
  139. * The timeout should be longer then the maximum execution time of a
  140. * tape operation.
  141. */
  142. /*
  143. * DSC timings.
  144. */
  145. #define IDETAPE_DSC_RW_MIN 5*HZ/100 /* 50 msec */
  146. #define IDETAPE_DSC_RW_MAX 40*HZ/100 /* 400 msec */
  147. #define IDETAPE_DSC_RW_TIMEOUT 2*60*HZ /* 2 minutes */
  148. #define IDETAPE_DSC_MA_FAST 2*HZ /* 2 seconds */
  149. #define IDETAPE_DSC_MA_THRESHOLD 5*60*HZ /* 5 minutes */
  150. #define IDETAPE_DSC_MA_SLOW 30*HZ /* 30 seconds */
  151. #define IDETAPE_DSC_MA_TIMEOUT 2*60*60*HZ /* 2 hours */
  152. /*************************** End of tunable parameters ***********************/
  153. /*
  154. * Read/Write error simulation
  155. */
  156. #define SIMULATE_ERRORS 0
  157. /*
  158. * For general magnetic tape device compatibility.
  159. */
  160. typedef enum {
  161. idetape_direction_none,
  162. idetape_direction_read,
  163. idetape_direction_write
  164. } idetape_chrdev_direction_t;
  165. struct idetape_bh {
  166. u32 b_size;
  167. atomic_t b_count;
  168. struct idetape_bh *b_reqnext;
  169. char *b_data;
  170. };
  171. /*
  172. * Our view of a packet command.
  173. */
  174. typedef struct idetape_packet_command_s {
  175. u8 c[12]; /* Actual packet bytes */
  176. int retries; /* On each retry, we increment retries */
  177. int error; /* Error code */
  178. int request_transfer; /* Bytes to transfer */
  179. int actually_transferred; /* Bytes actually transferred */
  180. int buffer_size; /* Size of our data buffer */
  181. struct idetape_bh *bh;
  182. char *b_data;
  183. int b_count;
  184. u8 *buffer; /* Data buffer */
  185. u8 *current_position; /* Pointer into the above buffer */
  186. ide_startstop_t (*callback) (ide_drive_t *); /* Called when this packet command is completed */
  187. u8 pc_buffer[IDETAPE_PC_BUFFER_SIZE]; /* Temporary buffer */
  188. unsigned long flags; /* Status/Action bit flags: long for set_bit */
  189. } idetape_pc_t;
  190. /*
  191. * Packet command flag bits.
  192. */
  193. /* Set when an error is considered normal - We won't retry */
  194. #define PC_ABORT 0
  195. /* 1 When polling for DSC on a media access command */
  196. #define PC_WAIT_FOR_DSC 1
  197. /* 1 when we prefer to use DMA if possible */
  198. #define PC_DMA_RECOMMENDED 2
  199. /* 1 while DMA in progress */
  200. #define PC_DMA_IN_PROGRESS 3
  201. /* 1 when encountered problem during DMA */
  202. #define PC_DMA_ERROR 4
  203. /* Data direction */
  204. #define PC_WRITING 5
  205. /*
  206. * A pipeline stage.
  207. */
  208. typedef struct idetape_stage_s {
  209. struct request rq; /* The corresponding request */
  210. struct idetape_bh *bh; /* The data buffers */
  211. struct idetape_stage_s *next; /* Pointer to the next stage */
  212. } idetape_stage_t;
  213. /*
  214. * Most of our global data which we need to save even as we leave the
  215. * driver due to an interrupt or a timer event is stored in a variable
  216. * of type idetape_tape_t, defined below.
  217. */
  218. typedef struct ide_tape_obj {
  219. ide_drive_t *drive;
  220. ide_driver_t *driver;
  221. struct gendisk *disk;
  222. struct kref kref;
  223. /*
  224. * Since a typical character device operation requires more
  225. * than one packet command, we provide here enough memory
  226. * for the maximum of interconnected packet commands.
  227. * The packet commands are stored in the circular array pc_stack.
  228. * pc_stack_index points to the last used entry, and warps around
  229. * to the start when we get to the last array entry.
  230. *
  231. * pc points to the current processed packet command.
  232. *
  233. * failed_pc points to the last failed packet command, or contains
  234. * NULL if we do not need to retry any packet command. This is
  235. * required since an additional packet command is needed before the
  236. * retry, to get detailed information on what went wrong.
  237. */
  238. /* Current packet command */
  239. idetape_pc_t *pc;
  240. /* Last failed packet command */
  241. idetape_pc_t *failed_pc;
  242. /* Packet command stack */
  243. idetape_pc_t pc_stack[IDETAPE_PC_STACK];
  244. /* Next free packet command storage space */
  245. int pc_stack_index;
  246. struct request rq_stack[IDETAPE_PC_STACK];
  247. /* We implement a circular array */
  248. int rq_stack_index;
  249. /*
  250. * DSC polling variables.
  251. *
  252. * While polling for DSC we use postponed_rq to postpone the
  253. * current request so that ide.c will be able to service
  254. * pending requests on the other device. Note that at most
  255. * we will have only one DSC (usually data transfer) request
  256. * in the device request queue. Additional requests can be
  257. * queued in our internal pipeline, but they will be visible
  258. * to ide.c only one at a time.
  259. */
  260. struct request *postponed_rq;
  261. /* The time in which we started polling for DSC */
  262. unsigned long dsc_polling_start;
  263. /* Timer used to poll for dsc */
  264. struct timer_list dsc_timer;
  265. /* Read/Write dsc polling frequency */
  266. unsigned long best_dsc_rw_frequency;
  267. /* The current polling frequency */
  268. unsigned long dsc_polling_frequency;
  269. /* Maximum waiting time */
  270. unsigned long dsc_timeout;
  271. /*
  272. * Read position information
  273. */
  274. u8 partition;
  275. /* Current block */
  276. unsigned int first_frame_position;
  277. unsigned int last_frame_position;
  278. unsigned int blocks_in_buffer;
  279. /*
  280. * Last error information
  281. */
  282. u8 sense_key, asc, ascq;
  283. /*
  284. * Character device operation
  285. */
  286. unsigned int minor;
  287. /* device name */
  288. char name[4];
  289. /* Current character device data transfer direction */
  290. idetape_chrdev_direction_t chrdev_direction;
  291. /*
  292. * Device information
  293. */
  294. /* Usually 512 or 1024 bytes */
  295. unsigned short tape_block_size;
  296. int user_bs_factor;
  297. /* Copy of the tape's Capabilities and Mechanical Page */
  298. u8 caps[20];
  299. /*
  300. * Active data transfer request parameters.
  301. *
  302. * At most, there is only one ide-tape originated data transfer
  303. * request in the device request queue. This allows ide.c to
  304. * easily service requests from the other device when we
  305. * postpone our active request. In the pipelined operation
  306. * mode, we use our internal pipeline structure to hold
  307. * more data requests.
  308. *
  309. * The data buffer size is chosen based on the tape's
  310. * recommendation.
  311. */
  312. /* Pointer to the request which is waiting in the device request queue */
  313. struct request *active_data_request;
  314. /* Data buffer size (chosen based on the tape's recommendation */
  315. int stage_size;
  316. idetape_stage_t *merge_stage;
  317. int merge_stage_size;
  318. struct idetape_bh *bh;
  319. char *b_data;
  320. int b_count;
  321. /*
  322. * Pipeline parameters.
  323. *
  324. * To accomplish non-pipelined mode, we simply set the following
  325. * variables to zero (or NULL, where appropriate).
  326. */
  327. /* Number of currently used stages */
  328. int nr_stages;
  329. /* Number of pending stages */
  330. int nr_pending_stages;
  331. /* We will not allocate more than this number of stages */
  332. int max_stages, min_pipeline, max_pipeline;
  333. /* The first stage which will be removed from the pipeline */
  334. idetape_stage_t *first_stage;
  335. /* The currently active stage */
  336. idetape_stage_t *active_stage;
  337. /* Will be serviced after the currently active request */
  338. idetape_stage_t *next_stage;
  339. /* New requests will be added to the pipeline here */
  340. idetape_stage_t *last_stage;
  341. /* Optional free stage which we can use */
  342. idetape_stage_t *cache_stage;
  343. int pages_per_stage;
  344. /* Wasted space in each stage */
  345. int excess_bh_size;
  346. /* Status/Action flags: long for set_bit */
  347. unsigned long flags;
  348. /* protects the ide-tape queue */
  349. spinlock_t spinlock;
  350. /*
  351. * Measures average tape speed
  352. */
  353. unsigned long avg_time;
  354. int avg_size;
  355. int avg_speed;
  356. char vendor_id[10];
  357. char product_id[18];
  358. char firmware_revision[6];
  359. int firmware_revision_num;
  360. /* the door is currently locked */
  361. int door_locked;
  362. /* the tape hardware is write protected */
  363. char drv_write_prot;
  364. /* the tape is write protected (hardware or opened as read-only) */
  365. char write_prot;
  366. /*
  367. * Limit the number of times a request can
  368. * be postponed, to avoid an infinite postpone
  369. * deadlock.
  370. */
  371. /* request postpone count limit */
  372. int postpone_cnt;
  373. /*
  374. * Measures number of frames:
  375. *
  376. * 1. written/read to/from the driver pipeline (pipeline_head).
  377. * 2. written/read to/from the tape buffers (idetape_bh).
  378. * 3. written/read by the tape to/from the media (tape_head).
  379. */
  380. int pipeline_head;
  381. int buffer_head;
  382. int tape_head;
  383. int last_tape_head;
  384. /*
  385. * Speed control at the tape buffers input/output
  386. */
  387. unsigned long insert_time;
  388. int insert_size;
  389. int insert_speed;
  390. int max_insert_speed;
  391. int measure_insert_time;
  392. /*
  393. * Measure tape still time, in milliseconds
  394. */
  395. unsigned long tape_still_time_begin;
  396. int tape_still_time;
  397. /*
  398. * Speed regulation negative feedback loop
  399. */
  400. int speed_control;
  401. int pipeline_head_speed;
  402. int controlled_pipeline_head_speed;
  403. int uncontrolled_pipeline_head_speed;
  404. int controlled_last_pipeline_head;
  405. int uncontrolled_last_pipeline_head;
  406. unsigned long uncontrolled_pipeline_head_time;
  407. unsigned long controlled_pipeline_head_time;
  408. int controlled_previous_pipeline_head;
  409. int uncontrolled_previous_pipeline_head;
  410. unsigned long controlled_previous_head_time;
  411. unsigned long uncontrolled_previous_head_time;
  412. int restart_speed_control_req;
  413. /*
  414. * Debug_level determines amount of debugging output;
  415. * can be changed using /proc/ide/hdx/settings
  416. * 0 : almost no debugging output
  417. * 1 : 0+output errors only
  418. * 2 : 1+output all sensekey/asc
  419. * 3 : 2+follow all chrdev related procedures
  420. * 4 : 3+follow all procedures
  421. * 5 : 4+include pc_stack rq_stack info
  422. * 6 : 5+USE_COUNT updates
  423. */
  424. int debug_level;
  425. } idetape_tape_t;
  426. static DEFINE_MUTEX(idetape_ref_mutex);
  427. static struct class *idetape_sysfs_class;
  428. #define to_ide_tape(obj) container_of(obj, struct ide_tape_obj, kref)
  429. #define ide_tape_g(disk) \
  430. container_of((disk)->private_data, struct ide_tape_obj, driver)
  431. static struct ide_tape_obj *ide_tape_get(struct gendisk *disk)
  432. {
  433. struct ide_tape_obj *tape = NULL;
  434. mutex_lock(&idetape_ref_mutex);
  435. tape = ide_tape_g(disk);
  436. if (tape)
  437. kref_get(&tape->kref);
  438. mutex_unlock(&idetape_ref_mutex);
  439. return tape;
  440. }
  441. static void ide_tape_release(struct kref *);
  442. static void ide_tape_put(struct ide_tape_obj *tape)
  443. {
  444. mutex_lock(&idetape_ref_mutex);
  445. kref_put(&tape->kref, ide_tape_release);
  446. mutex_unlock(&idetape_ref_mutex);
  447. }
  448. /*
  449. * Tape door status
  450. */
  451. #define DOOR_UNLOCKED 0
  452. #define DOOR_LOCKED 1
  453. #define DOOR_EXPLICITLY_LOCKED 2
  454. /*
  455. * Tape flag bits values.
  456. */
  457. #define IDETAPE_IGNORE_DSC 0
  458. #define IDETAPE_ADDRESS_VALID 1 /* 0 When the tape position is unknown */
  459. #define IDETAPE_BUSY 2 /* Device already opened */
  460. #define IDETAPE_PIPELINE_ERROR 3 /* Error detected in a pipeline stage */
  461. #define IDETAPE_DETECT_BS 4 /* Attempt to auto-detect the current user block size */
  462. #define IDETAPE_FILEMARK 5 /* Currently on a filemark */
  463. #define IDETAPE_DRQ_INTERRUPT 6 /* DRQ interrupt device */
  464. #define IDETAPE_READ_ERROR 7
  465. #define IDETAPE_PIPELINE_ACTIVE 8 /* pipeline active */
  466. /* 0 = no tape is loaded, so we don't rewind after ejecting */
  467. #define IDETAPE_MEDIUM_PRESENT 9
  468. /*
  469. * Some defines for the READ BUFFER command
  470. */
  471. #define IDETAPE_RETRIEVE_FAULTY_BLOCK 6
  472. /*
  473. * Some defines for the SPACE command
  474. */
  475. #define IDETAPE_SPACE_OVER_FILEMARK 1
  476. #define IDETAPE_SPACE_TO_EOD 3
  477. /*
  478. * Some defines for the LOAD UNLOAD command
  479. */
  480. #define IDETAPE_LU_LOAD_MASK 1
  481. #define IDETAPE_LU_RETENSION_MASK 2
  482. #define IDETAPE_LU_EOT_MASK 4
  483. /*
  484. * Special requests for our block device strategy routine.
  485. *
  486. * In order to service a character device command, we add special
  487. * requests to the tail of our block device request queue and wait
  488. * for their completion.
  489. */
  490. enum {
  491. REQ_IDETAPE_PC1 = (1 << 0), /* packet command (first stage) */
  492. REQ_IDETAPE_PC2 = (1 << 1), /* packet command (second stage) */
  493. REQ_IDETAPE_READ = (1 << 2),
  494. REQ_IDETAPE_WRITE = (1 << 3),
  495. REQ_IDETAPE_READ_BUFFER = (1 << 4),
  496. };
  497. /*
  498. * Error codes which are returned in rq->errors to the higher part
  499. * of the driver.
  500. */
  501. #define IDETAPE_ERROR_GENERAL 101
  502. #define IDETAPE_ERROR_FILEMARK 102
  503. #define IDETAPE_ERROR_EOD 103
  504. /*
  505. * The following is used to format the general configuration word of
  506. * the ATAPI IDENTIFY DEVICE command.
  507. */
  508. struct idetape_id_gcw {
  509. unsigned packet_size :2; /* Packet Size */
  510. unsigned reserved234 :3; /* Reserved */
  511. unsigned drq_type :2; /* Command packet DRQ type */
  512. unsigned removable :1; /* Removable media */
  513. unsigned device_type :5; /* Device type */
  514. unsigned reserved13 :1; /* Reserved */
  515. unsigned protocol :2; /* Protocol type */
  516. };
  517. /*
  518. * READ POSITION packet command - Data Format (From Table 6-57)
  519. */
  520. typedef struct {
  521. unsigned reserved0_10 :2; /* Reserved */
  522. unsigned bpu :1; /* Block Position Unknown */
  523. unsigned reserved0_543 :3; /* Reserved */
  524. unsigned eop :1; /* End Of Partition */
  525. unsigned bop :1; /* Beginning Of Partition */
  526. u8 partition; /* Partition Number */
  527. u8 reserved2, reserved3; /* Reserved */
  528. u32 first_block; /* First Block Location */
  529. u32 last_block; /* Last Block Location (Optional) */
  530. u8 reserved12; /* Reserved */
  531. u8 blocks_in_buffer[3]; /* Blocks In Buffer - (Optional) */
  532. u32 bytes_in_buffer; /* Bytes In Buffer (Optional) */
  533. } idetape_read_position_result_t;
  534. /* Structures related to the SELECT SENSE / MODE SENSE packet commands. */
  535. #define IDETAPE_BLOCK_DESCRIPTOR 0
  536. #define IDETAPE_CAPABILITIES_PAGE 0x2a
  537. /*
  538. * The variables below are used for the character device interface.
  539. * Additional state variables are defined in our ide_drive_t structure.
  540. */
  541. static struct ide_tape_obj * idetape_devs[MAX_HWIFS * MAX_DRIVES];
  542. #define ide_tape_f(file) ((file)->private_data)
  543. static struct ide_tape_obj *ide_tape_chrdev_get(unsigned int i)
  544. {
  545. struct ide_tape_obj *tape = NULL;
  546. mutex_lock(&idetape_ref_mutex);
  547. tape = idetape_devs[i];
  548. if (tape)
  549. kref_get(&tape->kref);
  550. mutex_unlock(&idetape_ref_mutex);
  551. return tape;
  552. }
  553. /*
  554. * Function declarations
  555. *
  556. */
  557. static int idetape_chrdev_release (struct inode *inode, struct file *filp);
  558. static void idetape_write_release (ide_drive_t *drive, unsigned int minor);
  559. /*
  560. * Too bad. The drive wants to send us data which we are not ready to accept.
  561. * Just throw it away.
  562. */
  563. static void idetape_discard_data (ide_drive_t *drive, unsigned int bcount)
  564. {
  565. while (bcount--)
  566. (void) HWIF(drive)->INB(IDE_DATA_REG);
  567. }
  568. static void idetape_input_buffers (ide_drive_t *drive, idetape_pc_t *pc, unsigned int bcount)
  569. {
  570. struct idetape_bh *bh = pc->bh;
  571. int count;
  572. while (bcount) {
  573. if (bh == NULL) {
  574. printk(KERN_ERR "ide-tape: bh == NULL in "
  575. "idetape_input_buffers\n");
  576. idetape_discard_data(drive, bcount);
  577. return;
  578. }
  579. count = min((unsigned int)(bh->b_size - atomic_read(&bh->b_count)), bcount);
  580. HWIF(drive)->atapi_input_bytes(drive, bh->b_data + atomic_read(&bh->b_count), count);
  581. bcount -= count;
  582. atomic_add(count, &bh->b_count);
  583. if (atomic_read(&bh->b_count) == bh->b_size) {
  584. bh = bh->b_reqnext;
  585. if (bh)
  586. atomic_set(&bh->b_count, 0);
  587. }
  588. }
  589. pc->bh = bh;
  590. }
  591. static void idetape_output_buffers (ide_drive_t *drive, idetape_pc_t *pc, unsigned int bcount)
  592. {
  593. struct idetape_bh *bh = pc->bh;
  594. int count;
  595. while (bcount) {
  596. if (bh == NULL) {
  597. printk(KERN_ERR "ide-tape: bh == NULL in "
  598. "idetape_output_buffers\n");
  599. return;
  600. }
  601. count = min((unsigned int)pc->b_count, (unsigned int)bcount);
  602. HWIF(drive)->atapi_output_bytes(drive, pc->b_data, count);
  603. bcount -= count;
  604. pc->b_data += count;
  605. pc->b_count -= count;
  606. if (!pc->b_count) {
  607. pc->bh = bh = bh->b_reqnext;
  608. if (bh) {
  609. pc->b_data = bh->b_data;
  610. pc->b_count = atomic_read(&bh->b_count);
  611. }
  612. }
  613. }
  614. }
  615. static void idetape_update_buffers (idetape_pc_t *pc)
  616. {
  617. struct idetape_bh *bh = pc->bh;
  618. int count;
  619. unsigned int bcount = pc->actually_transferred;
  620. if (test_bit(PC_WRITING, &pc->flags))
  621. return;
  622. while (bcount) {
  623. if (bh == NULL) {
  624. printk(KERN_ERR "ide-tape: bh == NULL in "
  625. "idetape_update_buffers\n");
  626. return;
  627. }
  628. count = min((unsigned int)bh->b_size, (unsigned int)bcount);
  629. atomic_set(&bh->b_count, count);
  630. if (atomic_read(&bh->b_count) == bh->b_size)
  631. bh = bh->b_reqnext;
  632. bcount -= count;
  633. }
  634. pc->bh = bh;
  635. }
  636. /*
  637. * idetape_next_pc_storage returns a pointer to a place in which we can
  638. * safely store a packet command, even though we intend to leave the
  639. * driver. A storage space for a maximum of IDETAPE_PC_STACK packet
  640. * commands is allocated at initialization time.
  641. */
  642. static idetape_pc_t *idetape_next_pc_storage (ide_drive_t *drive)
  643. {
  644. idetape_tape_t *tape = drive->driver_data;
  645. #if IDETAPE_DEBUG_LOG
  646. if (tape->debug_level >= 5)
  647. printk(KERN_INFO "ide-tape: pc_stack_index=%d\n",
  648. tape->pc_stack_index);
  649. #endif /* IDETAPE_DEBUG_LOG */
  650. if (tape->pc_stack_index == IDETAPE_PC_STACK)
  651. tape->pc_stack_index=0;
  652. return (&tape->pc_stack[tape->pc_stack_index++]);
  653. }
  654. /*
  655. * idetape_next_rq_storage is used along with idetape_next_pc_storage.
  656. * Since we queue packet commands in the request queue, we need to
  657. * allocate a request, along with the allocation of a packet command.
  658. */
  659. /**************************************************************
  660. * *
  661. * This should get fixed to use kmalloc(.., GFP_ATOMIC) *
  662. * followed later on by kfree(). -ml *
  663. * *
  664. **************************************************************/
  665. static struct request *idetape_next_rq_storage (ide_drive_t *drive)
  666. {
  667. idetape_tape_t *tape = drive->driver_data;
  668. #if IDETAPE_DEBUG_LOG
  669. if (tape->debug_level >= 5)
  670. printk(KERN_INFO "ide-tape: rq_stack_index=%d\n",
  671. tape->rq_stack_index);
  672. #endif /* IDETAPE_DEBUG_LOG */
  673. if (tape->rq_stack_index == IDETAPE_PC_STACK)
  674. tape->rq_stack_index=0;
  675. return (&tape->rq_stack[tape->rq_stack_index++]);
  676. }
  677. /*
  678. * idetape_init_pc initializes a packet command.
  679. */
  680. static void idetape_init_pc (idetape_pc_t *pc)
  681. {
  682. memset(pc->c, 0, 12);
  683. pc->retries = 0;
  684. pc->flags = 0;
  685. pc->request_transfer = 0;
  686. pc->buffer = pc->pc_buffer;
  687. pc->buffer_size = IDETAPE_PC_BUFFER_SIZE;
  688. pc->bh = NULL;
  689. pc->b_data = NULL;
  690. }
  691. /*
  692. * called on each failed packet command retry to analyze the request sense. We
  693. * currently do not utilize this information.
  694. */
  695. static void idetape_analyze_error(ide_drive_t *drive, u8 *sense)
  696. {
  697. idetape_tape_t *tape = drive->driver_data;
  698. idetape_pc_t *pc = tape->failed_pc;
  699. tape->sense_key = sense[2] & 0xF;
  700. tape->asc = sense[12];
  701. tape->ascq = sense[13];
  702. #if IDETAPE_DEBUG_LOG
  703. /*
  704. * Without debugging, we only log an error if we decided to give up
  705. * retrying.
  706. */
  707. if (tape->debug_level >= 1)
  708. printk(KERN_INFO "ide-tape: pc = %x, sense key = %x, "
  709. "asc = %x, ascq = %x\n",
  710. pc->c[0], tape->sense_key,
  711. tape->asc, tape->ascq);
  712. #endif /* IDETAPE_DEBUG_LOG */
  713. /* Correct pc->actually_transferred by asking the tape. */
  714. if (test_bit(PC_DMA_ERROR, &pc->flags)) {
  715. pc->actually_transferred = pc->request_transfer -
  716. tape->tape_block_size *
  717. be32_to_cpu(get_unaligned((u32 *)&sense[3]));
  718. idetape_update_buffers(pc);
  719. }
  720. /*
  721. * If error was the result of a zero-length read or write command,
  722. * with sense key=5, asc=0x22, ascq=0, let it slide. Some drives
  723. * (i.e. Seagate STT3401A Travan) don't support 0-length read/writes.
  724. */
  725. if ((pc->c[0] == READ_6 || pc->c[0] == WRITE_6)
  726. /* length == 0 */
  727. && pc->c[4] == 0 && pc->c[3] == 0 && pc->c[2] == 0) {
  728. if (tape->sense_key == 5) {
  729. /* don't report an error, everything's ok */
  730. pc->error = 0;
  731. /* don't retry read/write */
  732. set_bit(PC_ABORT, &pc->flags);
  733. }
  734. }
  735. if (pc->c[0] == READ_6 && (sense[2] & 0x80)) {
  736. pc->error = IDETAPE_ERROR_FILEMARK;
  737. set_bit(PC_ABORT, &pc->flags);
  738. }
  739. if (pc->c[0] == WRITE_6) {
  740. if ((sense[2] & 0x40) || (tape->sense_key == 0xd
  741. && tape->asc == 0x0 && tape->ascq == 0x2)) {
  742. pc->error = IDETAPE_ERROR_EOD;
  743. set_bit(PC_ABORT, &pc->flags);
  744. }
  745. }
  746. if (pc->c[0] == READ_6 || pc->c[0] == WRITE_6) {
  747. if (tape->sense_key == 8) {
  748. pc->error = IDETAPE_ERROR_EOD;
  749. set_bit(PC_ABORT, &pc->flags);
  750. }
  751. if (!test_bit(PC_ABORT, &pc->flags) &&
  752. pc->actually_transferred)
  753. pc->retries = IDETAPE_MAX_PC_RETRIES + 1;
  754. }
  755. }
  756. static void idetape_activate_next_stage(ide_drive_t *drive)
  757. {
  758. idetape_tape_t *tape = drive->driver_data;
  759. idetape_stage_t *stage = tape->next_stage;
  760. struct request *rq = &stage->rq;
  761. #if IDETAPE_DEBUG_LOG
  762. if (tape->debug_level >= 4)
  763. printk(KERN_INFO "ide-tape: Reached idetape_active_next_stage\n");
  764. #endif /* IDETAPE_DEBUG_LOG */
  765. if (stage == NULL) {
  766. printk(KERN_ERR "ide-tape: bug: Trying to activate a non existing stage\n");
  767. return;
  768. }
  769. rq->rq_disk = tape->disk;
  770. rq->buffer = NULL;
  771. rq->special = (void *)stage->bh;
  772. tape->active_data_request = rq;
  773. tape->active_stage = stage;
  774. tape->next_stage = stage->next;
  775. }
  776. /*
  777. * idetape_increase_max_pipeline_stages is a part of the feedback
  778. * loop which tries to find the optimum number of stages. In the
  779. * feedback loop, we are starting from a minimum maximum number of
  780. * stages, and if we sense that the pipeline is empty, we try to
  781. * increase it, until we reach the user compile time memory limit.
  782. */
  783. static void idetape_increase_max_pipeline_stages (ide_drive_t *drive)
  784. {
  785. idetape_tape_t *tape = drive->driver_data;
  786. int increase = (tape->max_pipeline - tape->min_pipeline) / 10;
  787. #if IDETAPE_DEBUG_LOG
  788. if (tape->debug_level >= 4)
  789. printk (KERN_INFO "ide-tape: Reached idetape_increase_max_pipeline_stages\n");
  790. #endif /* IDETAPE_DEBUG_LOG */
  791. tape->max_stages += max(increase, 1);
  792. tape->max_stages = max(tape->max_stages, tape->min_pipeline);
  793. tape->max_stages = min(tape->max_stages, tape->max_pipeline);
  794. }
  795. /*
  796. * idetape_kfree_stage calls kfree to completely free a stage, along with
  797. * its related buffers.
  798. */
  799. static void __idetape_kfree_stage (idetape_stage_t *stage)
  800. {
  801. struct idetape_bh *prev_bh, *bh = stage->bh;
  802. int size;
  803. while (bh != NULL) {
  804. if (bh->b_data != NULL) {
  805. size = (int) bh->b_size;
  806. while (size > 0) {
  807. free_page((unsigned long) bh->b_data);
  808. size -= PAGE_SIZE;
  809. bh->b_data += PAGE_SIZE;
  810. }
  811. }
  812. prev_bh = bh;
  813. bh = bh->b_reqnext;
  814. kfree(prev_bh);
  815. }
  816. kfree(stage);
  817. }
  818. static void idetape_kfree_stage (idetape_tape_t *tape, idetape_stage_t *stage)
  819. {
  820. __idetape_kfree_stage(stage);
  821. }
  822. /*
  823. * idetape_remove_stage_head removes tape->first_stage from the pipeline.
  824. * The caller should avoid race conditions.
  825. */
  826. static void idetape_remove_stage_head (ide_drive_t *drive)
  827. {
  828. idetape_tape_t *tape = drive->driver_data;
  829. idetape_stage_t *stage;
  830. #if IDETAPE_DEBUG_LOG
  831. if (tape->debug_level >= 4)
  832. printk(KERN_INFO "ide-tape: Reached idetape_remove_stage_head\n");
  833. #endif /* IDETAPE_DEBUG_LOG */
  834. if (tape->first_stage == NULL) {
  835. printk(KERN_ERR "ide-tape: bug: tape->first_stage is NULL\n");
  836. return;
  837. }
  838. if (tape->active_stage == tape->first_stage) {
  839. printk(KERN_ERR "ide-tape: bug: Trying to free our active pipeline stage\n");
  840. return;
  841. }
  842. stage = tape->first_stage;
  843. tape->first_stage = stage->next;
  844. idetape_kfree_stage(tape, stage);
  845. tape->nr_stages--;
  846. if (tape->first_stage == NULL) {
  847. tape->last_stage = NULL;
  848. if (tape->next_stage != NULL)
  849. printk(KERN_ERR "ide-tape: bug: tape->next_stage != NULL\n");
  850. if (tape->nr_stages)
  851. printk(KERN_ERR "ide-tape: bug: nr_stages should be 0 now\n");
  852. }
  853. }
  854. /*
  855. * This will free all the pipeline stages starting from new_last_stage->next
  856. * to the end of the list, and point tape->last_stage to new_last_stage.
  857. */
  858. static void idetape_abort_pipeline(ide_drive_t *drive,
  859. idetape_stage_t *new_last_stage)
  860. {
  861. idetape_tape_t *tape = drive->driver_data;
  862. idetape_stage_t *stage = new_last_stage->next;
  863. idetape_stage_t *nstage;
  864. #if IDETAPE_DEBUG_LOG
  865. if (tape->debug_level >= 4)
  866. printk(KERN_INFO "ide-tape: %s: idetape_abort_pipeline called\n", tape->name);
  867. #endif
  868. while (stage) {
  869. nstage = stage->next;
  870. idetape_kfree_stage(tape, stage);
  871. --tape->nr_stages;
  872. --tape->nr_pending_stages;
  873. stage = nstage;
  874. }
  875. if (new_last_stage)
  876. new_last_stage->next = NULL;
  877. tape->last_stage = new_last_stage;
  878. tape->next_stage = NULL;
  879. }
  880. /*
  881. * idetape_end_request is used to finish servicing a request, and to
  882. * insert a pending pipeline request into the main device queue.
  883. */
  884. static int idetape_end_request(ide_drive_t *drive, int uptodate, int nr_sects)
  885. {
  886. struct request *rq = HWGROUP(drive)->rq;
  887. idetape_tape_t *tape = drive->driver_data;
  888. unsigned long flags;
  889. int error;
  890. int remove_stage = 0;
  891. idetape_stage_t *active_stage;
  892. #if IDETAPE_DEBUG_LOG
  893. if (tape->debug_level >= 4)
  894. printk(KERN_INFO "ide-tape: Reached idetape_end_request\n");
  895. #endif /* IDETAPE_DEBUG_LOG */
  896. switch (uptodate) {
  897. case 0: error = IDETAPE_ERROR_GENERAL; break;
  898. case 1: error = 0; break;
  899. default: error = uptodate;
  900. }
  901. rq->errors = error;
  902. if (error)
  903. tape->failed_pc = NULL;
  904. if (!blk_special_request(rq)) {
  905. ide_end_request(drive, uptodate, nr_sects);
  906. return 0;
  907. }
  908. spin_lock_irqsave(&tape->spinlock, flags);
  909. /* The request was a pipelined data transfer request */
  910. if (tape->active_data_request == rq) {
  911. active_stage = tape->active_stage;
  912. tape->active_stage = NULL;
  913. tape->active_data_request = NULL;
  914. tape->nr_pending_stages--;
  915. if (rq->cmd[0] & REQ_IDETAPE_WRITE) {
  916. remove_stage = 1;
  917. if (error) {
  918. set_bit(IDETAPE_PIPELINE_ERROR, &tape->flags);
  919. if (error == IDETAPE_ERROR_EOD)
  920. idetape_abort_pipeline(drive, active_stage);
  921. }
  922. } else if (rq->cmd[0] & REQ_IDETAPE_READ) {
  923. if (error == IDETAPE_ERROR_EOD) {
  924. set_bit(IDETAPE_PIPELINE_ERROR, &tape->flags);
  925. idetape_abort_pipeline(drive, active_stage);
  926. }
  927. }
  928. if (tape->next_stage != NULL) {
  929. idetape_activate_next_stage(drive);
  930. /*
  931. * Insert the next request into the request queue.
  932. */
  933. (void) ide_do_drive_cmd(drive, tape->active_data_request, ide_end);
  934. } else if (!error) {
  935. idetape_increase_max_pipeline_stages(drive);
  936. }
  937. }
  938. ide_end_drive_cmd(drive, 0, 0);
  939. // blkdev_dequeue_request(rq);
  940. // drive->rq = NULL;
  941. // end_that_request_last(rq);
  942. if (remove_stage)
  943. idetape_remove_stage_head(drive);
  944. if (tape->active_data_request == NULL)
  945. clear_bit(IDETAPE_PIPELINE_ACTIVE, &tape->flags);
  946. spin_unlock_irqrestore(&tape->spinlock, flags);
  947. return 0;
  948. }
  949. static ide_startstop_t idetape_request_sense_callback (ide_drive_t *drive)
  950. {
  951. idetape_tape_t *tape = drive->driver_data;
  952. #if IDETAPE_DEBUG_LOG
  953. if (tape->debug_level >= 4)
  954. printk(KERN_INFO "ide-tape: Reached idetape_request_sense_callback\n");
  955. #endif /* IDETAPE_DEBUG_LOG */
  956. if (!tape->pc->error) {
  957. idetape_analyze_error(drive, tape->pc->buffer);
  958. idetape_end_request(drive, 1, 0);
  959. } else {
  960. printk(KERN_ERR "ide-tape: Error in REQUEST SENSE itself - Aborting request!\n");
  961. idetape_end_request(drive, 0, 0);
  962. }
  963. return ide_stopped;
  964. }
  965. static void idetape_create_request_sense_cmd (idetape_pc_t *pc)
  966. {
  967. idetape_init_pc(pc);
  968. pc->c[0] = REQUEST_SENSE;
  969. pc->c[4] = 20;
  970. pc->request_transfer = 20;
  971. pc->callback = &idetape_request_sense_callback;
  972. }
  973. static void idetape_init_rq(struct request *rq, u8 cmd)
  974. {
  975. memset(rq, 0, sizeof(*rq));
  976. rq->cmd_type = REQ_TYPE_SPECIAL;
  977. rq->cmd[0] = cmd;
  978. }
  979. /*
  980. * idetape_queue_pc_head generates a new packet command request in front
  981. * of the request queue, before the current request, so that it will be
  982. * processed immediately, on the next pass through the driver.
  983. *
  984. * idetape_queue_pc_head is called from the request handling part of
  985. * the driver (the "bottom" part). Safe storage for the request should
  986. * be allocated with idetape_next_pc_storage and idetape_next_rq_storage
  987. * before calling idetape_queue_pc_head.
  988. *
  989. * Memory for those requests is pre-allocated at initialization time, and
  990. * is limited to IDETAPE_PC_STACK requests. We assume that we have enough
  991. * space for the maximum possible number of inter-dependent packet commands.
  992. *
  993. * The higher level of the driver - The ioctl handler and the character
  994. * device handling functions should queue request to the lower level part
  995. * and wait for their completion using idetape_queue_pc_tail or
  996. * idetape_queue_rw_tail.
  997. */
  998. static void idetape_queue_pc_head (ide_drive_t *drive, idetape_pc_t *pc,struct request *rq)
  999. {
  1000. struct ide_tape_obj *tape = drive->driver_data;
  1001. idetape_init_rq(rq, REQ_IDETAPE_PC1);
  1002. rq->buffer = (char *) pc;
  1003. rq->rq_disk = tape->disk;
  1004. (void) ide_do_drive_cmd(drive, rq, ide_preempt);
  1005. }
  1006. /*
  1007. * idetape_retry_pc is called when an error was detected during the
  1008. * last packet command. We queue a request sense packet command in
  1009. * the head of the request list.
  1010. */
  1011. static ide_startstop_t idetape_retry_pc (ide_drive_t *drive)
  1012. {
  1013. idetape_tape_t *tape = drive->driver_data;
  1014. idetape_pc_t *pc;
  1015. struct request *rq;
  1016. (void)ide_read_error(drive);
  1017. pc = idetape_next_pc_storage(drive);
  1018. rq = idetape_next_rq_storage(drive);
  1019. idetape_create_request_sense_cmd(pc);
  1020. set_bit(IDETAPE_IGNORE_DSC, &tape->flags);
  1021. idetape_queue_pc_head(drive, pc, rq);
  1022. return ide_stopped;
  1023. }
  1024. /*
  1025. * idetape_postpone_request postpones the current request so that
  1026. * ide.c will be able to service requests from another device on
  1027. * the same hwgroup while we are polling for DSC.
  1028. */
  1029. static void idetape_postpone_request (ide_drive_t *drive)
  1030. {
  1031. idetape_tape_t *tape = drive->driver_data;
  1032. #if IDETAPE_DEBUG_LOG
  1033. if (tape->debug_level >= 4)
  1034. printk(KERN_INFO "ide-tape: idetape_postpone_request\n");
  1035. #endif
  1036. tape->postponed_rq = HWGROUP(drive)->rq;
  1037. ide_stall_queue(drive, tape->dsc_polling_frequency);
  1038. }
  1039. /*
  1040. * idetape_pc_intr is the usual interrupt handler which will be called
  1041. * during a packet command. We will transfer some of the data (as
  1042. * requested by the drive) and will re-point interrupt handler to us.
  1043. * When data transfer is finished, we will act according to the
  1044. * algorithm described before idetape_issue_packet_command.
  1045. *
  1046. */
  1047. static ide_startstop_t idetape_pc_intr (ide_drive_t *drive)
  1048. {
  1049. ide_hwif_t *hwif = drive->hwif;
  1050. idetape_tape_t *tape = drive->driver_data;
  1051. idetape_pc_t *pc = tape->pc;
  1052. unsigned int temp;
  1053. #if SIMULATE_ERRORS
  1054. static int error_sim_count = 0;
  1055. #endif
  1056. u16 bcount;
  1057. u8 stat, ireason;
  1058. #if IDETAPE_DEBUG_LOG
  1059. if (tape->debug_level >= 4)
  1060. printk(KERN_INFO "ide-tape: Reached idetape_pc_intr "
  1061. "interrupt handler\n");
  1062. #endif /* IDETAPE_DEBUG_LOG */
  1063. /* Clear the interrupt */
  1064. stat = ide_read_status(drive);
  1065. if (test_bit(PC_DMA_IN_PROGRESS, &pc->flags)) {
  1066. if (hwif->ide_dma_end(drive) || (stat & ERR_STAT)) {
  1067. /*
  1068. * A DMA error is sometimes expected. For example,
  1069. * if the tape is crossing a filemark during a
  1070. * READ command, it will issue an irq and position
  1071. * itself before the filemark, so that only a partial
  1072. * data transfer will occur (which causes the DMA
  1073. * error). In that case, we will later ask the tape
  1074. * how much bytes of the original request were
  1075. * actually transferred (we can't receive that
  1076. * information from the DMA engine on most chipsets).
  1077. */
  1078. /*
  1079. * On the contrary, a DMA error is never expected;
  1080. * it usually indicates a hardware error or abort.
  1081. * If the tape crosses a filemark during a READ
  1082. * command, it will issue an irq and position itself
  1083. * after the filemark (not before). Only a partial
  1084. * data transfer will occur, but no DMA error.
  1085. * (AS, 19 Apr 2001)
  1086. */
  1087. set_bit(PC_DMA_ERROR, &pc->flags);
  1088. } else {
  1089. pc->actually_transferred = pc->request_transfer;
  1090. idetape_update_buffers(pc);
  1091. }
  1092. #if IDETAPE_DEBUG_LOG
  1093. if (tape->debug_level >= 4)
  1094. printk(KERN_INFO "ide-tape: DMA finished\n");
  1095. #endif /* IDETAPE_DEBUG_LOG */
  1096. }
  1097. /* No more interrupts */
  1098. if ((stat & DRQ_STAT) == 0) {
  1099. #if IDETAPE_DEBUG_LOG
  1100. if (tape->debug_level >= 2)
  1101. printk(KERN_INFO "ide-tape: Packet command completed, %d bytes transferred\n", pc->actually_transferred);
  1102. #endif /* IDETAPE_DEBUG_LOG */
  1103. clear_bit(PC_DMA_IN_PROGRESS, &pc->flags);
  1104. local_irq_enable();
  1105. #if SIMULATE_ERRORS
  1106. if ((pc->c[0] == WRITE_6 || pc->c[0] == READ_6) &&
  1107. (++error_sim_count % 100) == 0) {
  1108. printk(KERN_INFO "ide-tape: %s: simulating error\n",
  1109. tape->name);
  1110. stat |= ERR_STAT;
  1111. }
  1112. #endif
  1113. if ((stat & ERR_STAT) && pc->c[0] == REQUEST_SENSE)
  1114. stat &= ~ERR_STAT;
  1115. if ((stat & ERR_STAT) || test_bit(PC_DMA_ERROR, &pc->flags)) {
  1116. /* Error detected */
  1117. #if IDETAPE_DEBUG_LOG
  1118. if (tape->debug_level >= 1)
  1119. printk(KERN_INFO "ide-tape: %s: I/O error\n",
  1120. tape->name);
  1121. #endif /* IDETAPE_DEBUG_LOG */
  1122. if (pc->c[0] == REQUEST_SENSE) {
  1123. printk(KERN_ERR "ide-tape: I/O error in request sense command\n");
  1124. return ide_do_reset(drive);
  1125. }
  1126. #if IDETAPE_DEBUG_LOG
  1127. if (tape->debug_level >= 1)
  1128. printk(KERN_INFO "ide-tape: [cmd %x]: check condition\n", pc->c[0]);
  1129. #endif
  1130. /* Retry operation */
  1131. return idetape_retry_pc(drive);
  1132. }
  1133. pc->error = 0;
  1134. if (test_bit(PC_WAIT_FOR_DSC, &pc->flags) &&
  1135. (stat & SEEK_STAT) == 0) {
  1136. /* Media access command */
  1137. tape->dsc_polling_start = jiffies;
  1138. tape->dsc_polling_frequency = IDETAPE_DSC_MA_FAST;
  1139. tape->dsc_timeout = jiffies + IDETAPE_DSC_MA_TIMEOUT;
  1140. /* Allow ide.c to handle other requests */
  1141. idetape_postpone_request(drive);
  1142. return ide_stopped;
  1143. }
  1144. if (tape->failed_pc == pc)
  1145. tape->failed_pc = NULL;
  1146. /* Command finished - Call the callback function */
  1147. return pc->callback(drive);
  1148. }
  1149. if (test_and_clear_bit(PC_DMA_IN_PROGRESS, &pc->flags)) {
  1150. printk(KERN_ERR "ide-tape: The tape wants to issue more "
  1151. "interrupts in DMA mode\n");
  1152. printk(KERN_ERR "ide-tape: DMA disabled, reverting to PIO\n");
  1153. ide_dma_off(drive);
  1154. return ide_do_reset(drive);
  1155. }
  1156. /* Get the number of bytes to transfer on this interrupt. */
  1157. bcount = (hwif->INB(IDE_BCOUNTH_REG) << 8) |
  1158. hwif->INB(IDE_BCOUNTL_REG);
  1159. ireason = hwif->INB(IDE_IREASON_REG);
  1160. if (ireason & CD) {
  1161. printk(KERN_ERR "ide-tape: CoD != 0 in idetape_pc_intr\n");
  1162. return ide_do_reset(drive);
  1163. }
  1164. if (((ireason & IO) == IO) == test_bit(PC_WRITING, &pc->flags)) {
  1165. /* Hopefully, we will never get here */
  1166. printk(KERN_ERR "ide-tape: We wanted to %s, ",
  1167. (ireason & IO) ? "Write" : "Read");
  1168. printk(KERN_ERR "ide-tape: but the tape wants us to %s !\n",
  1169. (ireason & IO) ? "Read" : "Write");
  1170. return ide_do_reset(drive);
  1171. }
  1172. if (!test_bit(PC_WRITING, &pc->flags)) {
  1173. /* Reading - Check that we have enough space */
  1174. temp = pc->actually_transferred + bcount;
  1175. if (temp > pc->request_transfer) {
  1176. if (temp > pc->buffer_size) {
  1177. printk(KERN_ERR "ide-tape: The tape wants to send us more data than expected - discarding data\n");
  1178. idetape_discard_data(drive, bcount);
  1179. ide_set_handler(drive, &idetape_pc_intr, IDETAPE_WAIT_CMD, NULL);
  1180. return ide_started;
  1181. }
  1182. #if IDETAPE_DEBUG_LOG
  1183. if (tape->debug_level >= 2)
  1184. printk(KERN_NOTICE "ide-tape: The tape wants to send us more data than expected - allowing transfer\n");
  1185. #endif /* IDETAPE_DEBUG_LOG */
  1186. }
  1187. }
  1188. if (test_bit(PC_WRITING, &pc->flags)) {
  1189. if (pc->bh != NULL)
  1190. idetape_output_buffers(drive, pc, bcount);
  1191. else
  1192. /* Write the current buffer */
  1193. hwif->atapi_output_bytes(drive, pc->current_position,
  1194. bcount);
  1195. } else {
  1196. if (pc->bh != NULL)
  1197. idetape_input_buffers(drive, pc, bcount);
  1198. else
  1199. /* Read the current buffer */
  1200. hwif->atapi_input_bytes(drive, pc->current_position,
  1201. bcount);
  1202. }
  1203. /* Update the current position */
  1204. pc->actually_transferred += bcount;
  1205. pc->current_position += bcount;
  1206. #if IDETAPE_DEBUG_LOG
  1207. if (tape->debug_level >= 2)
  1208. printk(KERN_INFO "ide-tape: [cmd %x] transferred %d bytes "
  1209. "on that interrupt\n", pc->c[0], bcount);
  1210. #endif
  1211. /* And set the interrupt handler again */
  1212. ide_set_handler(drive, &idetape_pc_intr, IDETAPE_WAIT_CMD, NULL);
  1213. return ide_started;
  1214. }
  1215. /*
  1216. * Packet Command Interface
  1217. *
  1218. * The current Packet Command is available in tape->pc, and will not
  1219. * change until we finish handling it. Each packet command is associated
  1220. * with a callback function that will be called when the command is
  1221. * finished.
  1222. *
  1223. * The handling will be done in three stages:
  1224. *
  1225. * 1. idetape_issue_packet_command will send the packet command to the
  1226. * drive, and will set the interrupt handler to idetape_pc_intr.
  1227. *
  1228. * 2. On each interrupt, idetape_pc_intr will be called. This step
  1229. * will be repeated until the device signals us that no more
  1230. * interrupts will be issued.
  1231. *
  1232. * 3. ATAPI Tape media access commands have immediate status with a
  1233. * delayed process. In case of a successful initiation of a
  1234. * media access packet command, the DSC bit will be set when the
  1235. * actual execution of the command is finished.
  1236. * Since the tape drive will not issue an interrupt, we have to
  1237. * poll for this event. In this case, we define the request as
  1238. * "low priority request" by setting rq_status to
  1239. * IDETAPE_RQ_POSTPONED, set a timer to poll for DSC and exit
  1240. * the driver.
  1241. *
  1242. * ide.c will then give higher priority to requests which
  1243. * originate from the other device, until will change rq_status
  1244. * to RQ_ACTIVE.
  1245. *
  1246. * 4. When the packet command is finished, it will be checked for errors.
  1247. *
  1248. * 5. In case an error was found, we queue a request sense packet
  1249. * command in front of the request queue and retry the operation
  1250. * up to IDETAPE_MAX_PC_RETRIES times.
  1251. *
  1252. * 6. In case no error was found, or we decided to give up and not
  1253. * to retry again, the callback function will be called and then
  1254. * we will handle the next request.
  1255. *
  1256. */
  1257. static ide_startstop_t idetape_transfer_pc(ide_drive_t *drive)
  1258. {
  1259. ide_hwif_t *hwif = drive->hwif;
  1260. idetape_tape_t *tape = drive->driver_data;
  1261. idetape_pc_t *pc = tape->pc;
  1262. int retries = 100;
  1263. ide_startstop_t startstop;
  1264. u8 ireason;
  1265. if (ide_wait_stat(&startstop,drive,DRQ_STAT,BUSY_STAT,WAIT_READY)) {
  1266. printk(KERN_ERR "ide-tape: Strange, packet command initiated yet DRQ isn't asserted\n");
  1267. return startstop;
  1268. }
  1269. ireason = hwif->INB(IDE_IREASON_REG);
  1270. while (retries-- && ((ireason & CD) == 0 || (ireason & IO))) {
  1271. printk(KERN_ERR "ide-tape: (IO,CoD != (0,1) while issuing "
  1272. "a packet command, retrying\n");
  1273. udelay(100);
  1274. ireason = hwif->INB(IDE_IREASON_REG);
  1275. if (retries == 0) {
  1276. printk(KERN_ERR "ide-tape: (IO,CoD != (0,1) while "
  1277. "issuing a packet command, ignoring\n");
  1278. ireason |= CD;
  1279. ireason &= ~IO;
  1280. }
  1281. }
  1282. if ((ireason & CD) == 0 || (ireason & IO)) {
  1283. printk(KERN_ERR "ide-tape: (IO,CoD) != (0,1) while issuing "
  1284. "a packet command\n");
  1285. return ide_do_reset(drive);
  1286. }
  1287. /* Set the interrupt routine */
  1288. ide_set_handler(drive, &idetape_pc_intr, IDETAPE_WAIT_CMD, NULL);
  1289. #ifdef CONFIG_BLK_DEV_IDEDMA
  1290. /* Begin DMA, if necessary */
  1291. if (test_bit(PC_DMA_IN_PROGRESS, &pc->flags))
  1292. hwif->dma_start(drive);
  1293. #endif
  1294. /* Send the actual packet */
  1295. HWIF(drive)->atapi_output_bytes(drive, pc->c, 12);
  1296. return ide_started;
  1297. }
  1298. static ide_startstop_t idetape_issue_packet_command (ide_drive_t *drive, idetape_pc_t *pc)
  1299. {
  1300. ide_hwif_t *hwif = drive->hwif;
  1301. idetape_tape_t *tape = drive->driver_data;
  1302. int dma_ok = 0;
  1303. u16 bcount;
  1304. if (tape->pc->c[0] == REQUEST_SENSE &&
  1305. pc->c[0] == REQUEST_SENSE) {
  1306. printk(KERN_ERR "ide-tape: possible ide-tape.c bug - "
  1307. "Two request sense in serial were issued\n");
  1308. }
  1309. if (tape->failed_pc == NULL && pc->c[0] != REQUEST_SENSE)
  1310. tape->failed_pc = pc;
  1311. /* Set the current packet command */
  1312. tape->pc = pc;
  1313. if (pc->retries > IDETAPE_MAX_PC_RETRIES ||
  1314. test_bit(PC_ABORT, &pc->flags)) {
  1315. /*
  1316. * We will "abort" retrying a packet command in case
  1317. * a legitimate error code was received (crossing a
  1318. * filemark, or end of the media, for example).
  1319. */
  1320. if (!test_bit(PC_ABORT, &pc->flags)) {
  1321. if (!(pc->c[0] == TEST_UNIT_READY &&
  1322. tape->sense_key == 2 && tape->asc == 4 &&
  1323. (tape->ascq == 1 || tape->ascq == 8))) {
  1324. printk(KERN_ERR "ide-tape: %s: I/O error, "
  1325. "pc = %2x, key = %2x, "
  1326. "asc = %2x, ascq = %2x\n",
  1327. tape->name, pc->c[0],
  1328. tape->sense_key, tape->asc,
  1329. tape->ascq);
  1330. }
  1331. /* Giving up */
  1332. pc->error = IDETAPE_ERROR_GENERAL;
  1333. }
  1334. tape->failed_pc = NULL;
  1335. return pc->callback(drive);
  1336. }
  1337. #if IDETAPE_DEBUG_LOG
  1338. if (tape->debug_level >= 2)
  1339. printk(KERN_INFO "ide-tape: Retry number - %d, cmd = %02X\n", pc->retries, pc->c[0]);
  1340. #endif /* IDETAPE_DEBUG_LOG */
  1341. pc->retries++;
  1342. /* We haven't transferred any data yet */
  1343. pc->actually_transferred = 0;
  1344. pc->current_position = pc->buffer;
  1345. /* Request to transfer the entire buffer at once */
  1346. bcount = pc->request_transfer;
  1347. if (test_and_clear_bit(PC_DMA_ERROR, &pc->flags)) {
  1348. printk(KERN_WARNING "ide-tape: DMA disabled, "
  1349. "reverting to PIO\n");
  1350. ide_dma_off(drive);
  1351. }
  1352. if (test_bit(PC_DMA_RECOMMENDED, &pc->flags) && drive->using_dma)
  1353. dma_ok = !hwif->dma_setup(drive);
  1354. ide_pktcmd_tf_load(drive, IDE_TFLAG_NO_SELECT_MASK |
  1355. IDE_TFLAG_OUT_DEVICE, bcount, dma_ok);
  1356. if (dma_ok) /* Will begin DMA later */
  1357. set_bit(PC_DMA_IN_PROGRESS, &pc->flags);
  1358. if (test_bit(IDETAPE_DRQ_INTERRUPT, &tape->flags)) {
  1359. ide_execute_command(drive, WIN_PACKETCMD, &idetape_transfer_pc,
  1360. IDETAPE_WAIT_CMD, NULL);
  1361. return ide_started;
  1362. } else {
  1363. hwif->OUTB(WIN_PACKETCMD, IDE_COMMAND_REG);
  1364. return idetape_transfer_pc(drive);
  1365. }
  1366. }
  1367. /*
  1368. * General packet command callback function.
  1369. */
  1370. static ide_startstop_t idetape_pc_callback (ide_drive_t *drive)
  1371. {
  1372. idetape_tape_t *tape = drive->driver_data;
  1373. #if IDETAPE_DEBUG_LOG
  1374. if (tape->debug_level >= 4)
  1375. printk(KERN_INFO "ide-tape: Reached idetape_pc_callback\n");
  1376. #endif /* IDETAPE_DEBUG_LOG */
  1377. idetape_end_request(drive, tape->pc->error ? 0 : 1, 0);
  1378. return ide_stopped;
  1379. }
  1380. /*
  1381. * A mode sense command is used to "sense" tape parameters.
  1382. */
  1383. static void idetape_create_mode_sense_cmd (idetape_pc_t *pc, u8 page_code)
  1384. {
  1385. idetape_init_pc(pc);
  1386. pc->c[0] = MODE_SENSE;
  1387. if (page_code != IDETAPE_BLOCK_DESCRIPTOR)
  1388. pc->c[1] = 8; /* DBD = 1 - Don't return block descriptors */
  1389. pc->c[2] = page_code;
  1390. /*
  1391. * Changed pc->c[3] to 0 (255 will at best return unused info).
  1392. *
  1393. * For SCSI this byte is defined as subpage instead of high byte
  1394. * of length and some IDE drives seem to interpret it this way
  1395. * and return an error when 255 is used.
  1396. */
  1397. pc->c[3] = 0;
  1398. pc->c[4] = 255; /* (We will just discard data in that case) */
  1399. if (page_code == IDETAPE_BLOCK_DESCRIPTOR)
  1400. pc->request_transfer = 12;
  1401. else if (page_code == IDETAPE_CAPABILITIES_PAGE)
  1402. pc->request_transfer = 24;
  1403. else
  1404. pc->request_transfer = 50;
  1405. pc->callback = &idetape_pc_callback;
  1406. }
  1407. static void calculate_speeds(ide_drive_t *drive)
  1408. {
  1409. idetape_tape_t *tape = drive->driver_data;
  1410. int full = 125, empty = 75;
  1411. if (time_after(jiffies, tape->controlled_pipeline_head_time + 120 * HZ)) {
  1412. tape->controlled_previous_pipeline_head = tape->controlled_last_pipeline_head;
  1413. tape->controlled_previous_head_time = tape->controlled_pipeline_head_time;
  1414. tape->controlled_last_pipeline_head = tape->pipeline_head;
  1415. tape->controlled_pipeline_head_time = jiffies;
  1416. }
  1417. if (time_after(jiffies, tape->controlled_pipeline_head_time + 60 * HZ))
  1418. tape->controlled_pipeline_head_speed = (tape->pipeline_head - tape->controlled_last_pipeline_head) * 32 * HZ / (jiffies - tape->controlled_pipeline_head_time);
  1419. else if (time_after(jiffies, tape->controlled_previous_head_time))
  1420. tape->controlled_pipeline_head_speed = (tape->pipeline_head - tape->controlled_previous_pipeline_head) * 32 * HZ / (jiffies - tape->controlled_previous_head_time);
  1421. if (tape->nr_pending_stages < tape->max_stages /*- 1 */) {
  1422. /* -1 for read mode error recovery */
  1423. if (time_after(jiffies, tape->uncontrolled_previous_head_time + 10 * HZ)) {
  1424. tape->uncontrolled_pipeline_head_time = jiffies;
  1425. tape->uncontrolled_pipeline_head_speed = (tape->pipeline_head - tape->uncontrolled_previous_pipeline_head) * 32 * HZ / (jiffies - tape->uncontrolled_previous_head_time);
  1426. }
  1427. } else {
  1428. tape->uncontrolled_previous_head_time = jiffies;
  1429. tape->uncontrolled_previous_pipeline_head = tape->pipeline_head;
  1430. if (time_after(jiffies, tape->uncontrolled_pipeline_head_time + 30 * HZ)) {
  1431. tape->uncontrolled_pipeline_head_time = jiffies;
  1432. }
  1433. }
  1434. tape->pipeline_head_speed = max(tape->uncontrolled_pipeline_head_speed, tape->controlled_pipeline_head_speed);
  1435. if (tape->speed_control == 0) {
  1436. tape->max_insert_speed = 5000;
  1437. } else if (tape->speed_control == 1) {
  1438. if (tape->nr_pending_stages >= tape->max_stages / 2)
  1439. tape->max_insert_speed = tape->pipeline_head_speed +
  1440. (1100 - tape->pipeline_head_speed) * 2 * (tape->nr_pending_stages - tape->max_stages / 2) / tape->max_stages;
  1441. else
  1442. tape->max_insert_speed = 500 +
  1443. (tape->pipeline_head_speed - 500) * 2 * tape->nr_pending_stages / tape->max_stages;
  1444. if (tape->nr_pending_stages >= tape->max_stages * 99 / 100)
  1445. tape->max_insert_speed = 5000;
  1446. } else if (tape->speed_control == 2) {
  1447. tape->max_insert_speed = tape->pipeline_head_speed * empty / 100 +
  1448. (tape->pipeline_head_speed * full / 100 - tape->pipeline_head_speed * empty / 100) * tape->nr_pending_stages / tape->max_stages;
  1449. } else
  1450. tape->max_insert_speed = tape->speed_control;
  1451. tape->max_insert_speed = max(tape->max_insert_speed, 500);
  1452. }
  1453. static ide_startstop_t idetape_media_access_finished (ide_drive_t *drive)
  1454. {
  1455. idetape_tape_t *tape = drive->driver_data;
  1456. idetape_pc_t *pc = tape->pc;
  1457. u8 stat;
  1458. stat = ide_read_status(drive);
  1459. if (stat & SEEK_STAT) {
  1460. if (stat & ERR_STAT) {
  1461. /* Error detected */
  1462. if (pc->c[0] != TEST_UNIT_READY)
  1463. printk(KERN_ERR "ide-tape: %s: I/O error, ",
  1464. tape->name);
  1465. /* Retry operation */
  1466. return idetape_retry_pc(drive);
  1467. }
  1468. pc->error = 0;
  1469. if (tape->failed_pc == pc)
  1470. tape->failed_pc = NULL;
  1471. } else {
  1472. pc->error = IDETAPE_ERROR_GENERAL;
  1473. tape->failed_pc = NULL;
  1474. }
  1475. return pc->callback(drive);
  1476. }
  1477. static ide_startstop_t idetape_rw_callback (ide_drive_t *drive)
  1478. {
  1479. idetape_tape_t *tape = drive->driver_data;
  1480. struct request *rq = HWGROUP(drive)->rq;
  1481. int blocks = tape->pc->actually_transferred / tape->tape_block_size;
  1482. tape->avg_size += blocks * tape->tape_block_size;
  1483. tape->insert_size += blocks * tape->tape_block_size;
  1484. if (tape->insert_size > 1024 * 1024)
  1485. tape->measure_insert_time = 1;
  1486. if (tape->measure_insert_time) {
  1487. tape->measure_insert_time = 0;
  1488. tape->insert_time = jiffies;
  1489. tape->insert_size = 0;
  1490. }
  1491. if (time_after(jiffies, tape->insert_time))
  1492. tape->insert_speed = tape->insert_size / 1024 * HZ / (jiffies - tape->insert_time);
  1493. if (time_after_eq(jiffies, tape->avg_time + HZ)) {
  1494. tape->avg_speed = tape->avg_size * HZ / (jiffies - tape->avg_time) / 1024;
  1495. tape->avg_size = 0;
  1496. tape->avg_time = jiffies;
  1497. }
  1498. #if IDETAPE_DEBUG_LOG
  1499. if (tape->debug_level >= 4)
  1500. printk(KERN_INFO "ide-tape: Reached idetape_rw_callback\n");
  1501. #endif /* IDETAPE_DEBUG_LOG */
  1502. tape->first_frame_position += blocks;
  1503. rq->current_nr_sectors -= blocks;
  1504. if (!tape->pc->error)
  1505. idetape_end_request(drive, 1, 0);
  1506. else
  1507. idetape_end_request(drive, tape->pc->error, 0);
  1508. return ide_stopped;
  1509. }
  1510. static void idetape_create_read_cmd(idetape_tape_t *tape, idetape_pc_t *pc, unsigned int length, struct idetape_bh *bh)
  1511. {
  1512. idetape_init_pc(pc);
  1513. pc->c[0] = READ_6;
  1514. put_unaligned(cpu_to_be32(length), (unsigned int *) &pc->c[1]);
  1515. pc->c[1] = 1;
  1516. pc->callback = &idetape_rw_callback;
  1517. pc->bh = bh;
  1518. atomic_set(&bh->b_count, 0);
  1519. pc->buffer = NULL;
  1520. pc->request_transfer = pc->buffer_size = length * tape->tape_block_size;
  1521. if (pc->request_transfer == tape->stage_size)
  1522. set_bit(PC_DMA_RECOMMENDED, &pc->flags);
  1523. }
  1524. static void idetape_create_read_buffer_cmd(idetape_tape_t *tape, idetape_pc_t *pc, unsigned int length, struct idetape_bh *bh)
  1525. {
  1526. int size = 32768;
  1527. struct idetape_bh *p = bh;
  1528. idetape_init_pc(pc);
  1529. pc->c[0] = READ_BUFFER;
  1530. pc->c[1] = IDETAPE_RETRIEVE_FAULTY_BLOCK;
  1531. pc->c[7] = size >> 8;
  1532. pc->c[8] = size & 0xff;
  1533. pc->callback = &idetape_pc_callback;
  1534. pc->bh = bh;
  1535. atomic_set(&bh->b_count, 0);
  1536. pc->buffer = NULL;
  1537. while (p) {
  1538. atomic_set(&p->b_count, 0);
  1539. p = p->b_reqnext;
  1540. }
  1541. pc->request_transfer = pc->buffer_size = size;
  1542. }
  1543. static void idetape_create_write_cmd(idetape_tape_t *tape, idetape_pc_t *pc, unsigned int length, struct idetape_bh *bh)
  1544. {
  1545. idetape_init_pc(pc);
  1546. pc->c[0] = WRITE_6;
  1547. put_unaligned(cpu_to_be32(length), (unsigned int *) &pc->c[1]);
  1548. pc->c[1] = 1;
  1549. pc->callback = &idetape_rw_callback;
  1550. set_bit(PC_WRITING, &pc->flags);
  1551. pc->bh = bh;
  1552. pc->b_data = bh->b_data;
  1553. pc->b_count = atomic_read(&bh->b_count);
  1554. pc->buffer = NULL;
  1555. pc->request_transfer = pc->buffer_size = length * tape->tape_block_size;
  1556. if (pc->request_transfer == tape->stage_size)
  1557. set_bit(PC_DMA_RECOMMENDED, &pc->flags);
  1558. }
  1559. /*
  1560. * idetape_do_request is our request handling function.
  1561. */
  1562. static ide_startstop_t idetape_do_request(ide_drive_t *drive,
  1563. struct request *rq, sector_t block)
  1564. {
  1565. idetape_tape_t *tape = drive->driver_data;
  1566. idetape_pc_t *pc = NULL;
  1567. struct request *postponed_rq = tape->postponed_rq;
  1568. u8 stat;
  1569. #if IDETAPE_DEBUG_LOG
  1570. if (tape->debug_level >= 2)
  1571. printk(KERN_INFO "ide-tape: sector: %ld, "
  1572. "nr_sectors: %ld, current_nr_sectors: %d\n",
  1573. rq->sector, rq->nr_sectors, rq->current_nr_sectors);
  1574. #endif /* IDETAPE_DEBUG_LOG */
  1575. if (!blk_special_request(rq)) {
  1576. /*
  1577. * We do not support buffer cache originated requests.
  1578. */
  1579. printk(KERN_NOTICE "ide-tape: %s: Unsupported request in "
  1580. "request queue (%d)\n", drive->name, rq->cmd_type);
  1581. ide_end_request(drive, 0, 0);
  1582. return ide_stopped;
  1583. }
  1584. /*
  1585. * Retry a failed packet command
  1586. */
  1587. if (tape->failed_pc != NULL &&
  1588. tape->pc->c[0] == REQUEST_SENSE) {
  1589. return idetape_issue_packet_command(drive, tape->failed_pc);
  1590. }
  1591. if (postponed_rq != NULL)
  1592. if (rq != postponed_rq) {
  1593. printk(KERN_ERR "ide-tape: ide-tape.c bug - "
  1594. "Two DSC requests were queued\n");
  1595. idetape_end_request(drive, 0, 0);
  1596. return ide_stopped;
  1597. }
  1598. tape->postponed_rq = NULL;
  1599. /*
  1600. * If the tape is still busy, postpone our request and service
  1601. * the other device meanwhile.
  1602. */
  1603. stat = ide_read_status(drive);
  1604. if (!drive->dsc_overlap && !(rq->cmd[0] & REQ_IDETAPE_PC2))
  1605. set_bit(IDETAPE_IGNORE_DSC, &tape->flags);
  1606. if (drive->post_reset == 1) {
  1607. set_bit(IDETAPE_IGNORE_DSC, &tape->flags);
  1608. drive->post_reset = 0;
  1609. }
  1610. if (tape->tape_still_time > 100 && tape->tape_still_time < 200)
  1611. tape->measure_insert_time = 1;
  1612. if (time_after(jiffies, tape->insert_time))
  1613. tape->insert_speed = tape->insert_size / 1024 * HZ / (jiffies - tape->insert_time);
  1614. calculate_speeds(drive);
  1615. if (!test_and_clear_bit(IDETAPE_IGNORE_DSC, &tape->flags) &&
  1616. (stat & SEEK_STAT) == 0) {
  1617. if (postponed_rq == NULL) {
  1618. tape->dsc_polling_start = jiffies;
  1619. tape->dsc_polling_frequency = tape->best_dsc_rw_frequency;
  1620. tape->dsc_timeout = jiffies + IDETAPE_DSC_RW_TIMEOUT;
  1621. } else if (time_after(jiffies, tape->dsc_timeout)) {
  1622. printk(KERN_ERR "ide-tape: %s: DSC timeout\n",
  1623. tape->name);
  1624. if (rq->cmd[0] & REQ_IDETAPE_PC2) {
  1625. idetape_media_access_finished(drive);
  1626. return ide_stopped;
  1627. } else {
  1628. return ide_do_reset(drive);
  1629. }
  1630. } else if (time_after(jiffies, tape->dsc_polling_start + IDETAPE_DSC_MA_THRESHOLD))
  1631. tape->dsc_polling_frequency = IDETAPE_DSC_MA_SLOW;
  1632. idetape_postpone_request(drive);
  1633. return ide_stopped;
  1634. }
  1635. if (rq->cmd[0] & REQ_IDETAPE_READ) {
  1636. tape->buffer_head++;
  1637. tape->postpone_cnt = 0;
  1638. pc = idetape_next_pc_storage(drive);
  1639. idetape_create_read_cmd(tape, pc, rq->current_nr_sectors, (struct idetape_bh *)rq->special);
  1640. goto out;
  1641. }
  1642. if (rq->cmd[0] & REQ_IDETAPE_WRITE) {
  1643. tape->buffer_head++;
  1644. tape->postpone_cnt = 0;
  1645. pc = idetape_next_pc_storage(drive);
  1646. idetape_create_write_cmd(tape, pc, rq->current_nr_sectors, (struct idetape_bh *)rq->special);
  1647. goto out;
  1648. }
  1649. if (rq->cmd[0] & REQ_IDETAPE_READ_BUFFER) {
  1650. tape->postpone_cnt = 0;
  1651. pc = idetape_next_pc_storage(drive);
  1652. idetape_create_read_buffer_cmd(tape, pc, rq->current_nr_sectors, (struct idetape_bh *)rq->special);
  1653. goto out;
  1654. }
  1655. if (rq->cmd[0] & REQ_IDETAPE_PC1) {
  1656. pc = (idetape_pc_t *) rq->buffer;
  1657. rq->cmd[0] &= ~(REQ_IDETAPE_PC1);
  1658. rq->cmd[0] |= REQ_IDETAPE_PC2;
  1659. goto out;
  1660. }
  1661. if (rq->cmd[0] & REQ_IDETAPE_PC2) {
  1662. idetape_media_access_finished(drive);
  1663. return ide_stopped;
  1664. }
  1665. BUG();
  1666. out:
  1667. return idetape_issue_packet_command(drive, pc);
  1668. }
  1669. /*
  1670. * Pipeline related functions
  1671. */
  1672. static inline int idetape_pipeline_active (idetape_tape_t *tape)
  1673. {
  1674. int rc1, rc2;
  1675. rc1 = test_bit(IDETAPE_PIPELINE_ACTIVE, &tape->flags);
  1676. rc2 = (tape->active_data_request != NULL);
  1677. return rc1;
  1678. }
  1679. /*
  1680. * idetape_kmalloc_stage uses __get_free_page to allocate a pipeline
  1681. * stage, along with all the necessary small buffers which together make
  1682. * a buffer of size tape->stage_size (or a bit more). We attempt to
  1683. * combine sequential pages as much as possible.
  1684. *
  1685. * Returns a pointer to the new allocated stage, or NULL if we
  1686. * can't (or don't want to) allocate a stage.
  1687. *
  1688. * Pipeline stages are optional and are used to increase performance.
  1689. * If we can't allocate them, we'll manage without them.
  1690. */
  1691. static idetape_stage_t *__idetape_kmalloc_stage (idetape_tape_t *tape, int full, int clear)
  1692. {
  1693. idetape_stage_t *stage;
  1694. struct idetape_bh *prev_bh, *bh;
  1695. int pages = tape->pages_per_stage;
  1696. char *b_data = NULL;
  1697. if ((stage = kmalloc(sizeof (idetape_stage_t),GFP_KERNEL)) == NULL)
  1698. return NULL;
  1699. stage->next = NULL;
  1700. bh = stage->bh = kmalloc(sizeof(struct idetape_bh), GFP_KERNEL);
  1701. if (bh == NULL)
  1702. goto abort;
  1703. bh->b_reqnext = NULL;
  1704. if ((bh->b_data = (char *) __get_free_page (GFP_KERNEL)) == NULL)
  1705. goto abort;
  1706. if (clear)
  1707. memset(bh->b_data, 0, PAGE_SIZE);
  1708. bh->b_size = PAGE_SIZE;
  1709. atomic_set(&bh->b_count, full ? bh->b_size : 0);
  1710. while (--pages) {
  1711. if ((b_data = (char *) __get_free_page (GFP_KERNEL)) == NULL)
  1712. goto abort;
  1713. if (clear)
  1714. memset(b_data, 0, PAGE_SIZE);
  1715. if (bh->b_data == b_data + PAGE_SIZE) {
  1716. bh->b_size += PAGE_SIZE;
  1717. bh->b_data -= PAGE_SIZE;
  1718. if (full)
  1719. atomic_add(PAGE_SIZE, &bh->b_count);
  1720. continue;
  1721. }
  1722. if (b_data == bh->b_data + bh->b_size) {
  1723. bh->b_size += PAGE_SIZE;
  1724. if (full)
  1725. atomic_add(PAGE_SIZE, &bh->b_count);
  1726. continue;
  1727. }
  1728. prev_bh = bh;
  1729. if ((bh = kmalloc(sizeof(struct idetape_bh), GFP_KERNEL)) == NULL) {
  1730. free_page((unsigned long) b_data);
  1731. goto abort;
  1732. }
  1733. bh->b_reqnext = NULL;
  1734. bh->b_data = b_data;
  1735. bh->b_size = PAGE_SIZE;
  1736. atomic_set(&bh->b_count, full ? bh->b_size : 0);
  1737. prev_bh->b_reqnext = bh;
  1738. }
  1739. bh->b_size -= tape->excess_bh_size;
  1740. if (full)
  1741. atomic_sub(tape->excess_bh_size, &bh->b_count);
  1742. return stage;
  1743. abort:
  1744. __idetape_kfree_stage(stage);
  1745. return NULL;
  1746. }
  1747. static idetape_stage_t *idetape_kmalloc_stage (idetape_tape_t *tape)
  1748. {
  1749. idetape_stage_t *cache_stage = tape->cache_stage;
  1750. #if IDETAPE_DEBUG_LOG
  1751. if (tape->debug_level >= 4)
  1752. printk(KERN_INFO "ide-tape: Reached idetape_kmalloc_stage\n");
  1753. #endif /* IDETAPE_DEBUG_LOG */
  1754. if (tape->nr_stages >= tape->max_stages)
  1755. return NULL;
  1756. if (cache_stage != NULL) {
  1757. tape->cache_stage = NULL;
  1758. return cache_stage;
  1759. }
  1760. return __idetape_kmalloc_stage(tape, 0, 0);
  1761. }
  1762. static int idetape_copy_stage_from_user (idetape_tape_t *tape, idetape_stage_t *stage, const char __user *buf, int n)
  1763. {
  1764. struct idetape_bh *bh = tape->bh;
  1765. int count;
  1766. int ret = 0;
  1767. while (n) {
  1768. if (bh == NULL) {
  1769. printk(KERN_ERR "ide-tape: bh == NULL in "
  1770. "idetape_copy_stage_from_user\n");
  1771. return 1;
  1772. }
  1773. count = min((unsigned int)(bh->b_size - atomic_read(&bh->b_count)), (unsigned int)n);
  1774. if (copy_from_user(bh->b_data + atomic_read(&bh->b_count), buf, count))
  1775. ret = 1;
  1776. n -= count;
  1777. atomic_add(count, &bh->b_count);
  1778. buf += count;
  1779. if (atomic_read(&bh->b_count) == bh->b_size) {
  1780. bh = bh->b_reqnext;
  1781. if (bh)
  1782. atomic_set(&bh->b_count, 0);
  1783. }
  1784. }
  1785. tape->bh = bh;
  1786. return ret;
  1787. }
  1788. static int idetape_copy_stage_to_user (idetape_tape_t *tape, char __user *buf, idetape_stage_t *stage, int n)
  1789. {
  1790. struct idetape_bh *bh = tape->bh;
  1791. int count;
  1792. int ret = 0;
  1793. while (n) {
  1794. if (bh == NULL) {
  1795. printk(KERN_ERR "ide-tape: bh == NULL in "
  1796. "idetape_copy_stage_to_user\n");
  1797. return 1;
  1798. }
  1799. count = min(tape->b_count, n);
  1800. if (copy_to_user(buf, tape->b_data, count))
  1801. ret = 1;
  1802. n -= count;
  1803. tape->b_data += count;
  1804. tape->b_count -= count;
  1805. buf += count;
  1806. if (!tape->b_count) {
  1807. tape->bh = bh = bh->b_reqnext;
  1808. if (bh) {
  1809. tape->b_data = bh->b_data;
  1810. tape->b_count = atomic_read(&bh->b_count);
  1811. }
  1812. }
  1813. }
  1814. return ret;
  1815. }
  1816. static void idetape_init_merge_stage (idetape_tape_t *tape)
  1817. {
  1818. struct idetape_bh *bh = tape->merge_stage->bh;
  1819. tape->bh = bh;
  1820. if (tape->chrdev_direction == idetape_direction_write)
  1821. atomic_set(&bh->b_count, 0);
  1822. else {
  1823. tape->b_data = bh->b_data;
  1824. tape->b_count = atomic_read(&bh->b_count);
  1825. }
  1826. }
  1827. static void idetape_switch_buffers (idetape_tape_t *tape, idetape_stage_t *stage)
  1828. {
  1829. struct idetape_bh *tmp;
  1830. tmp = stage->bh;
  1831. stage->bh = tape->merge_stage->bh;
  1832. tape->merge_stage->bh = tmp;
  1833. idetape_init_merge_stage(tape);
  1834. }
  1835. /*
  1836. * idetape_add_stage_tail adds a new stage at the end of the pipeline.
  1837. */
  1838. static void idetape_add_stage_tail (ide_drive_t *drive,idetape_stage_t *stage)
  1839. {
  1840. idetape_tape_t *tape = drive->driver_data;
  1841. unsigned long flags;
  1842. #if IDETAPE_DEBUG_LOG
  1843. if (tape->debug_level >= 4)
  1844. printk (KERN_INFO "ide-tape: Reached idetape_add_stage_tail\n");
  1845. #endif /* IDETAPE_DEBUG_LOG */
  1846. spin_lock_irqsave(&tape->spinlock, flags);
  1847. stage->next = NULL;
  1848. if (tape->last_stage != NULL)
  1849. tape->last_stage->next=stage;
  1850. else
  1851. tape->first_stage = tape->next_stage=stage;
  1852. tape->last_stage = stage;
  1853. if (tape->next_stage == NULL)
  1854. tape->next_stage = tape->last_stage;
  1855. tape->nr_stages++;
  1856. tape->nr_pending_stages++;
  1857. spin_unlock_irqrestore(&tape->spinlock, flags);
  1858. }
  1859. /*
  1860. * idetape_wait_for_request installs a completion in a pending request
  1861. * and sleeps until it is serviced.
  1862. *
  1863. * The caller should ensure that the request will not be serviced
  1864. * before we install the completion (usually by disabling interrupts).
  1865. */
  1866. static void idetape_wait_for_request (ide_drive_t *drive, struct request *rq)
  1867. {
  1868. DECLARE_COMPLETION_ONSTACK(wait);
  1869. idetape_tape_t *tape = drive->driver_data;
  1870. if (rq == NULL || !blk_special_request(rq)) {
  1871. printk (KERN_ERR "ide-tape: bug: Trying to sleep on non-valid request\n");
  1872. return;
  1873. }
  1874. rq->end_io_data = &wait;
  1875. rq->end_io = blk_end_sync_rq;
  1876. spin_unlock_irq(&tape->spinlock);
  1877. wait_for_completion(&wait);
  1878. /* The stage and its struct request have been deallocated */
  1879. spin_lock_irq(&tape->spinlock);
  1880. }
  1881. static ide_startstop_t idetape_read_position_callback (ide_drive_t *drive)
  1882. {
  1883. idetape_tape_t *tape = drive->driver_data;
  1884. idetape_read_position_result_t *result;
  1885. #if IDETAPE_DEBUG_LOG
  1886. if (tape->debug_level >= 4)
  1887. printk(KERN_INFO "ide-tape: Reached idetape_read_position_callback\n");
  1888. #endif /* IDETAPE_DEBUG_LOG */
  1889. if (!tape->pc->error) {
  1890. result = (idetape_read_position_result_t *) tape->pc->buffer;
  1891. #if IDETAPE_DEBUG_LOG
  1892. if (tape->debug_level >= 2)
  1893. printk(KERN_INFO "ide-tape: BOP - %s\n",result->bop ? "Yes":"No");
  1894. if (tape->debug_level >= 2)
  1895. printk(KERN_INFO "ide-tape: EOP - %s\n",result->eop ? "Yes":"No");
  1896. #endif /* IDETAPE_DEBUG_LOG */
  1897. if (result->bpu) {
  1898. printk(KERN_INFO "ide-tape: Block location is unknown to the tape\n");
  1899. clear_bit(IDETAPE_ADDRESS_VALID, &tape->flags);
  1900. idetape_end_request(drive, 0, 0);
  1901. } else {
  1902. #if IDETAPE_DEBUG_LOG
  1903. if (tape->debug_level >= 2)
  1904. printk(KERN_INFO "ide-tape: Block Location - %u\n", ntohl(result->first_block));
  1905. #endif /* IDETAPE_DEBUG_LOG */
  1906. tape->partition = result->partition;
  1907. tape->first_frame_position = ntohl(result->first_block);
  1908. tape->last_frame_position = ntohl(result->last_block);
  1909. tape->blocks_in_buffer = result->blocks_in_buffer[2];
  1910. set_bit(IDETAPE_ADDRESS_VALID, &tape->flags);
  1911. idetape_end_request(drive, 1, 0);
  1912. }
  1913. } else {
  1914. idetape_end_request(drive, 0, 0);
  1915. }
  1916. return ide_stopped;
  1917. }
  1918. /*
  1919. * idetape_create_write_filemark_cmd will:
  1920. *
  1921. * 1. Write a filemark if write_filemark=1.
  1922. * 2. Flush the device buffers without writing a filemark
  1923. * if write_filemark=0.
  1924. *
  1925. */
  1926. static void idetape_create_write_filemark_cmd (ide_drive_t *drive, idetape_pc_t *pc,int write_filemark)
  1927. {
  1928. idetape_init_pc(pc);
  1929. pc->c[0] = WRITE_FILEMARKS;
  1930. pc->c[4] = write_filemark;
  1931. set_bit(PC_WAIT_FOR_DSC, &pc->flags);
  1932. pc->callback = &idetape_pc_callback;
  1933. }
  1934. static void idetape_create_test_unit_ready_cmd(idetape_pc_t *pc)
  1935. {
  1936. idetape_init_pc(pc);
  1937. pc->c[0] = TEST_UNIT_READY;
  1938. pc->callback = &idetape_pc_callback;
  1939. }
  1940. /*
  1941. * idetape_queue_pc_tail is based on the following functions:
  1942. *
  1943. * ide_do_drive_cmd from ide.c
  1944. * cdrom_queue_request and cdrom_queue_packet_command from ide-cd.c
  1945. *
  1946. * We add a special packet command request to the tail of the request
  1947. * queue, and wait for it to be serviced.
  1948. *
  1949. * This is not to be called from within the request handling part
  1950. * of the driver ! We allocate here data in the stack, and it is valid
  1951. * until the request is finished. This is not the case for the bottom
  1952. * part of the driver, where we are always leaving the functions to wait
  1953. * for an interrupt or a timer event.
  1954. *
  1955. * From the bottom part of the driver, we should allocate safe memory
  1956. * using idetape_next_pc_storage and idetape_next_rq_storage, and add
  1957. * the request to the request list without waiting for it to be serviced !
  1958. * In that case, we usually use idetape_queue_pc_head.
  1959. */
  1960. static int __idetape_queue_pc_tail (ide_drive_t *drive, idetape_pc_t *pc)
  1961. {
  1962. struct ide_tape_obj *tape = drive->driver_data;
  1963. struct request rq;
  1964. idetape_init_rq(&rq, REQ_IDETAPE_PC1);
  1965. rq.buffer = (char *) pc;
  1966. rq.rq_disk = tape->disk;
  1967. return ide_do_drive_cmd(drive, &rq, ide_wait);
  1968. }
  1969. static void idetape_create_load_unload_cmd (ide_drive_t *drive, idetape_pc_t *pc,int cmd)
  1970. {
  1971. idetape_init_pc(pc);
  1972. pc->c[0] = START_STOP;
  1973. pc->c[4] = cmd;
  1974. set_bit(PC_WAIT_FOR_DSC, &pc->flags);
  1975. pc->callback = &idetape_pc_callback;
  1976. }
  1977. static int idetape_wait_ready(ide_drive_t *drive, unsigned long timeout)
  1978. {
  1979. idetape_tape_t *tape = drive->driver_data;
  1980. idetape_pc_t pc;
  1981. int load_attempted = 0;
  1982. /*
  1983. * Wait for the tape to become ready
  1984. */
  1985. set_bit(IDETAPE_MEDIUM_PRESENT, &tape->flags);
  1986. timeout += jiffies;
  1987. while (time_before(jiffies, timeout)) {
  1988. idetape_create_test_unit_ready_cmd(&pc);
  1989. if (!__idetape_queue_pc_tail(drive, &pc))
  1990. return 0;
  1991. if ((tape->sense_key == 2 && tape->asc == 4 && tape->ascq == 2)
  1992. || (tape->asc == 0x3A)) { /* no media */
  1993. if (load_attempted)
  1994. return -ENOMEDIUM;
  1995. idetape_create_load_unload_cmd(drive, &pc, IDETAPE_LU_LOAD_MASK);
  1996. __idetape_queue_pc_tail(drive, &pc);
  1997. load_attempted = 1;
  1998. /* not about to be ready */
  1999. } else if (!(tape->sense_key == 2 && tape->asc == 4 &&
  2000. (tape->ascq == 1 || tape->ascq == 8)))
  2001. return -EIO;
  2002. msleep(100);
  2003. }
  2004. return -EIO;
  2005. }
  2006. static int idetape_queue_pc_tail (ide_drive_t *drive,idetape_pc_t *pc)
  2007. {
  2008. return __idetape_queue_pc_tail(drive, pc);
  2009. }
  2010. static int idetape_flush_tape_buffers (ide_drive_t *drive)
  2011. {
  2012. idetape_pc_t pc;
  2013. int rc;
  2014. idetape_create_write_filemark_cmd(drive, &pc, 0);
  2015. if ((rc = idetape_queue_pc_tail(drive, &pc)))
  2016. return rc;
  2017. idetape_wait_ready(drive, 60 * 5 * HZ);
  2018. return 0;
  2019. }
  2020. static void idetape_create_read_position_cmd (idetape_pc_t *pc)
  2021. {
  2022. idetape_init_pc(pc);
  2023. pc->c[0] = READ_POSITION;
  2024. pc->request_transfer = 20;
  2025. pc->callback = &idetape_read_position_callback;
  2026. }
  2027. static int idetape_read_position (ide_drive_t *drive)
  2028. {
  2029. idetape_tape_t *tape = drive->driver_data;
  2030. idetape_pc_t pc;
  2031. int position;
  2032. #if IDETAPE_DEBUG_LOG
  2033. if (tape->debug_level >= 4)
  2034. printk(KERN_INFO "ide-tape: Reached idetape_read_position\n");
  2035. #endif /* IDETAPE_DEBUG_LOG */
  2036. idetape_create_read_position_cmd(&pc);
  2037. if (idetape_queue_pc_tail(drive, &pc))
  2038. return -1;
  2039. position = tape->first_frame_position;
  2040. return position;
  2041. }
  2042. static void idetape_create_locate_cmd (ide_drive_t *drive, idetape_pc_t *pc, unsigned int block, u8 partition, int skip)
  2043. {
  2044. idetape_init_pc(pc);
  2045. pc->c[0] = POSITION_TO_ELEMENT;
  2046. pc->c[1] = 2;
  2047. put_unaligned(cpu_to_be32(block), (unsigned int *) &pc->c[3]);
  2048. pc->c[8] = partition;
  2049. set_bit(PC_WAIT_FOR_DSC, &pc->flags);
  2050. pc->callback = &idetape_pc_callback;
  2051. }
  2052. static int idetape_create_prevent_cmd (ide_drive_t *drive, idetape_pc_t *pc, int prevent)
  2053. {
  2054. idetape_tape_t *tape = drive->driver_data;
  2055. /* device supports locking according to capabilities page */
  2056. if (!(tape->caps[6] & 0x01))
  2057. return 0;
  2058. idetape_init_pc(pc);
  2059. pc->c[0] = ALLOW_MEDIUM_REMOVAL;
  2060. pc->c[4] = prevent;
  2061. pc->callback = &idetape_pc_callback;
  2062. return 1;
  2063. }
  2064. static int __idetape_discard_read_pipeline (ide_drive_t *drive)
  2065. {
  2066. idetape_tape_t *tape = drive->driver_data;
  2067. unsigned long flags;
  2068. int cnt;
  2069. if (tape->chrdev_direction != idetape_direction_read)
  2070. return 0;
  2071. /* Remove merge stage. */
  2072. cnt = tape->merge_stage_size / tape->tape_block_size;
  2073. if (test_and_clear_bit(IDETAPE_FILEMARK, &tape->flags))
  2074. ++cnt; /* Filemarks count as 1 sector */
  2075. tape->merge_stage_size = 0;
  2076. if (tape->merge_stage != NULL) {
  2077. __idetape_kfree_stage(tape->merge_stage);
  2078. tape->merge_stage = NULL;
  2079. }
  2080. /* Clear pipeline flags. */
  2081. clear_bit(IDETAPE_PIPELINE_ERROR, &tape->flags);
  2082. tape->chrdev_direction = idetape_direction_none;
  2083. /* Remove pipeline stages. */
  2084. if (tape->first_stage == NULL)
  2085. return 0;
  2086. spin_lock_irqsave(&tape->spinlock, flags);
  2087. tape->next_stage = NULL;
  2088. if (idetape_pipeline_active(tape))
  2089. idetape_wait_for_request(drive, tape->active_data_request);
  2090. spin_unlock_irqrestore(&tape->spinlock, flags);
  2091. while (tape->first_stage != NULL) {
  2092. struct request *rq_ptr = &tape->first_stage->rq;
  2093. cnt += rq_ptr->nr_sectors - rq_ptr->current_nr_sectors;
  2094. if (rq_ptr->errors == IDETAPE_ERROR_FILEMARK)
  2095. ++cnt;
  2096. idetape_remove_stage_head(drive);
  2097. }
  2098. tape->nr_pending_stages = 0;
  2099. tape->max_stages = tape->min_pipeline;
  2100. return cnt;
  2101. }
  2102. /*
  2103. * idetape_position_tape positions the tape to the requested block
  2104. * using the LOCATE packet command. A READ POSITION command is then
  2105. * issued to check where we are positioned.
  2106. *
  2107. * Like all higher level operations, we queue the commands at the tail
  2108. * of the request queue and wait for their completion.
  2109. *
  2110. */
  2111. static int idetape_position_tape (ide_drive_t *drive, unsigned int block, u8 partition, int skip)
  2112. {
  2113. idetape_tape_t *tape = drive->driver_data;
  2114. int retval;
  2115. idetape_pc_t pc;
  2116. if (tape->chrdev_direction == idetape_direction_read)
  2117. __idetape_discard_read_pipeline(drive);
  2118. idetape_wait_ready(drive, 60 * 5 * HZ);
  2119. idetape_create_locate_cmd(drive, &pc, block, partition, skip);
  2120. retval = idetape_queue_pc_tail(drive, &pc);
  2121. if (retval)
  2122. return (retval);
  2123. idetape_create_read_position_cmd(&pc);
  2124. return (idetape_queue_pc_tail(drive, &pc));
  2125. }
  2126. static void idetape_discard_read_pipeline (ide_drive_t *drive, int restore_position)
  2127. {
  2128. idetape_tape_t *tape = drive->driver_data;
  2129. int cnt;
  2130. int seek, position;
  2131. cnt = __idetape_discard_read_pipeline(drive);
  2132. if (restore_position) {
  2133. position = idetape_read_position(drive);
  2134. seek = position > cnt ? position - cnt : 0;
  2135. if (idetape_position_tape(drive, seek, 0, 0)) {
  2136. printk(KERN_INFO "ide-tape: %s: position_tape failed in discard_pipeline()\n", tape->name);
  2137. return;
  2138. }
  2139. }
  2140. }
  2141. /*
  2142. * idetape_queue_rw_tail generates a read/write request for the block
  2143. * device interface and wait for it to be serviced.
  2144. */
  2145. static int idetape_queue_rw_tail(ide_drive_t *drive, int cmd, int blocks, struct idetape_bh *bh)
  2146. {
  2147. idetape_tape_t *tape = drive->driver_data;
  2148. struct request rq;
  2149. #if IDETAPE_DEBUG_LOG
  2150. if (tape->debug_level >= 2)
  2151. printk(KERN_INFO "ide-tape: idetape_queue_rw_tail: cmd=%d\n",cmd);
  2152. #endif /* IDETAPE_DEBUG_LOG */
  2153. if (idetape_pipeline_active(tape)) {
  2154. printk(KERN_ERR "ide-tape: bug: the pipeline is active in idetape_queue_rw_tail\n");
  2155. return (0);
  2156. }
  2157. idetape_init_rq(&rq, cmd);
  2158. rq.rq_disk = tape->disk;
  2159. rq.special = (void *)bh;
  2160. rq.sector = tape->first_frame_position;
  2161. rq.nr_sectors = rq.current_nr_sectors = blocks;
  2162. (void) ide_do_drive_cmd(drive, &rq, ide_wait);
  2163. if ((cmd & (REQ_IDETAPE_READ | REQ_IDETAPE_WRITE)) == 0)
  2164. return 0;
  2165. if (tape->merge_stage)
  2166. idetape_init_merge_stage(tape);
  2167. if (rq.errors == IDETAPE_ERROR_GENERAL)
  2168. return -EIO;
  2169. return (tape->tape_block_size * (blocks-rq.current_nr_sectors));
  2170. }
  2171. /*
  2172. * idetape_insert_pipeline_into_queue is used to start servicing the
  2173. * pipeline stages, starting from tape->next_stage.
  2174. */
  2175. static void idetape_insert_pipeline_into_queue (ide_drive_t *drive)
  2176. {
  2177. idetape_tape_t *tape = drive->driver_data;
  2178. if (tape->next_stage == NULL)
  2179. return;
  2180. if (!idetape_pipeline_active(tape)) {
  2181. set_bit(IDETAPE_PIPELINE_ACTIVE, &tape->flags);
  2182. idetape_activate_next_stage(drive);
  2183. (void) ide_do_drive_cmd(drive, tape->active_data_request, ide_end);
  2184. }
  2185. }
  2186. static void idetape_create_inquiry_cmd (idetape_pc_t *pc)
  2187. {
  2188. idetape_init_pc(pc);
  2189. pc->c[0] = INQUIRY;
  2190. pc->c[4] = pc->request_transfer = 254;
  2191. pc->callback = &idetape_pc_callback;
  2192. }
  2193. static void idetape_create_rewind_cmd (ide_drive_t *drive, idetape_pc_t *pc)
  2194. {
  2195. idetape_init_pc(pc);
  2196. pc->c[0] = REZERO_UNIT;
  2197. set_bit(PC_WAIT_FOR_DSC, &pc->flags);
  2198. pc->callback = &idetape_pc_callback;
  2199. }
  2200. static void idetape_create_erase_cmd (idetape_pc_t *pc)
  2201. {
  2202. idetape_init_pc(pc);
  2203. pc->c[0] = ERASE;
  2204. pc->c[1] = 1;
  2205. set_bit(PC_WAIT_FOR_DSC, &pc->flags);
  2206. pc->callback = &idetape_pc_callback;
  2207. }
  2208. static void idetape_create_space_cmd (idetape_pc_t *pc,int count, u8 cmd)
  2209. {
  2210. idetape_init_pc(pc);
  2211. pc->c[0] = SPACE;
  2212. put_unaligned(cpu_to_be32(count), (unsigned int *) &pc->c[1]);
  2213. pc->c[1] = cmd;
  2214. set_bit(PC_WAIT_FOR_DSC, &pc->flags);
  2215. pc->callback = &idetape_pc_callback;
  2216. }
  2217. static void idetape_wait_first_stage (ide_drive_t *drive)
  2218. {
  2219. idetape_tape_t *tape = drive->driver_data;
  2220. unsigned long flags;
  2221. if (tape->first_stage == NULL)
  2222. return;
  2223. spin_lock_irqsave(&tape->spinlock, flags);
  2224. if (tape->active_stage == tape->first_stage)
  2225. idetape_wait_for_request(drive, tape->active_data_request);
  2226. spin_unlock_irqrestore(&tape->spinlock, flags);
  2227. }
  2228. /*
  2229. * idetape_add_chrdev_write_request tries to add a character device
  2230. * originated write request to our pipeline. In case we don't succeed,
  2231. * we revert to non-pipelined operation mode for this request.
  2232. *
  2233. * 1. Try to allocate a new pipeline stage.
  2234. * 2. If we can't, wait for more and more requests to be serviced
  2235. * and try again each time.
  2236. * 3. If we still can't allocate a stage, fallback to
  2237. * non-pipelined operation mode for this request.
  2238. */
  2239. static int idetape_add_chrdev_write_request (ide_drive_t *drive, int blocks)
  2240. {
  2241. idetape_tape_t *tape = drive->driver_data;
  2242. idetape_stage_t *new_stage;
  2243. unsigned long flags;
  2244. struct request *rq;
  2245. #if IDETAPE_DEBUG_LOG
  2246. if (tape->debug_level >= 3)
  2247. printk(KERN_INFO "ide-tape: Reached idetape_add_chrdev_write_request\n");
  2248. #endif /* IDETAPE_DEBUG_LOG */
  2249. /*
  2250. * Attempt to allocate a new stage.
  2251. * Pay special attention to possible race conditions.
  2252. */
  2253. while ((new_stage = idetape_kmalloc_stage(tape)) == NULL) {
  2254. spin_lock_irqsave(&tape->spinlock, flags);
  2255. if (idetape_pipeline_active(tape)) {
  2256. idetape_wait_for_request(drive, tape->active_data_request);
  2257. spin_unlock_irqrestore(&tape->spinlock, flags);
  2258. } else {
  2259. spin_unlock_irqrestore(&tape->spinlock, flags);
  2260. idetape_insert_pipeline_into_queue(drive);
  2261. if (idetape_pipeline_active(tape))
  2262. continue;
  2263. /*
  2264. * Linux is short on memory. Fallback to
  2265. * non-pipelined operation mode for this request.
  2266. */
  2267. return idetape_queue_rw_tail(drive, REQ_IDETAPE_WRITE, blocks, tape->merge_stage->bh);
  2268. }
  2269. }
  2270. rq = &new_stage->rq;
  2271. idetape_init_rq(rq, REQ_IDETAPE_WRITE);
  2272. /* Doesn't actually matter - We always assume sequential access */
  2273. rq->sector = tape->first_frame_position;
  2274. rq->nr_sectors = rq->current_nr_sectors = blocks;
  2275. idetape_switch_buffers(tape, new_stage);
  2276. idetape_add_stage_tail(drive, new_stage);
  2277. tape->pipeline_head++;
  2278. calculate_speeds(drive);
  2279. /*
  2280. * Estimate whether the tape has stopped writing by checking
  2281. * if our write pipeline is currently empty. If we are not
  2282. * writing anymore, wait for the pipeline to be full enough
  2283. * (90%) before starting to service requests, so that we will
  2284. * be able to keep up with the higher speeds of the tape.
  2285. */
  2286. if (!idetape_pipeline_active(tape)) {
  2287. if (tape->nr_stages >= tape->max_stages * 9 / 10 ||
  2288. tape->nr_stages >= tape->max_stages - tape->uncontrolled_pipeline_head_speed * 3 * 1024 / tape->tape_block_size) {
  2289. tape->measure_insert_time = 1;
  2290. tape->insert_time = jiffies;
  2291. tape->insert_size = 0;
  2292. tape->insert_speed = 0;
  2293. idetape_insert_pipeline_into_queue(drive);
  2294. }
  2295. }
  2296. if (test_and_clear_bit(IDETAPE_PIPELINE_ERROR, &tape->flags))
  2297. /* Return a deferred error */
  2298. return -EIO;
  2299. return blocks;
  2300. }
  2301. /*
  2302. * idetape_wait_for_pipeline will wait until all pending pipeline
  2303. * requests are serviced. Typically called on device close.
  2304. */
  2305. static void idetape_wait_for_pipeline (ide_drive_t *drive)
  2306. {
  2307. idetape_tape_t *tape = drive->driver_data;
  2308. unsigned long flags;
  2309. while (tape->next_stage || idetape_pipeline_active(tape)) {
  2310. idetape_insert_pipeline_into_queue(drive);
  2311. spin_lock_irqsave(&tape->spinlock, flags);
  2312. if (idetape_pipeline_active(tape))
  2313. idetape_wait_for_request(drive, tape->active_data_request);
  2314. spin_unlock_irqrestore(&tape->spinlock, flags);
  2315. }
  2316. }
  2317. static void idetape_empty_write_pipeline (ide_drive_t *drive)
  2318. {
  2319. idetape_tape_t *tape = drive->driver_data;
  2320. int blocks, min;
  2321. struct idetape_bh *bh;
  2322. if (tape->chrdev_direction != idetape_direction_write) {
  2323. printk(KERN_ERR "ide-tape: bug: Trying to empty write pipeline, but we are not writing.\n");
  2324. return;
  2325. }
  2326. if (tape->merge_stage_size > tape->stage_size) {
  2327. printk(KERN_ERR "ide-tape: bug: merge_buffer too big\n");
  2328. tape->merge_stage_size = tape->stage_size;
  2329. }
  2330. if (tape->merge_stage_size) {
  2331. blocks = tape->merge_stage_size / tape->tape_block_size;
  2332. if (tape->merge_stage_size % tape->tape_block_size) {
  2333. unsigned int i;
  2334. blocks++;
  2335. i = tape->tape_block_size - tape->merge_stage_size % tape->tape_block_size;
  2336. bh = tape->bh->b_reqnext;
  2337. while (bh) {
  2338. atomic_set(&bh->b_count, 0);
  2339. bh = bh->b_reqnext;
  2340. }
  2341. bh = tape->bh;
  2342. while (i) {
  2343. if (bh == NULL) {
  2344. printk(KERN_INFO "ide-tape: bug, bh NULL\n");
  2345. break;
  2346. }
  2347. min = min(i, (unsigned int)(bh->b_size - atomic_read(&bh->b_count)));
  2348. memset(bh->b_data + atomic_read(&bh->b_count), 0, min);
  2349. atomic_add(min, &bh->b_count);
  2350. i -= min;
  2351. bh = bh->b_reqnext;
  2352. }
  2353. }
  2354. (void) idetape_add_chrdev_write_request(drive, blocks);
  2355. tape->merge_stage_size = 0;
  2356. }
  2357. idetape_wait_for_pipeline(drive);
  2358. if (tape->merge_stage != NULL) {
  2359. __idetape_kfree_stage(tape->merge_stage);
  2360. tape->merge_stage = NULL;
  2361. }
  2362. clear_bit(IDETAPE_PIPELINE_ERROR, &tape->flags);
  2363. tape->chrdev_direction = idetape_direction_none;
  2364. /*
  2365. * On the next backup, perform the feedback loop again.
  2366. * (I don't want to keep sense information between backups,
  2367. * as some systems are constantly on, and the system load
  2368. * can be totally different on the next backup).
  2369. */
  2370. tape->max_stages = tape->min_pipeline;
  2371. if (tape->first_stage != NULL ||
  2372. tape->next_stage != NULL ||
  2373. tape->last_stage != NULL ||
  2374. tape->nr_stages != 0) {
  2375. printk(KERN_ERR "ide-tape: ide-tape pipeline bug, "
  2376. "first_stage %p, next_stage %p, "
  2377. "last_stage %p, nr_stages %d\n",
  2378. tape->first_stage, tape->next_stage,
  2379. tape->last_stage, tape->nr_stages);
  2380. }
  2381. }
  2382. static void idetape_restart_speed_control (ide_drive_t *drive)
  2383. {
  2384. idetape_tape_t *tape = drive->driver_data;
  2385. tape->restart_speed_control_req = 0;
  2386. tape->pipeline_head = 0;
  2387. tape->controlled_last_pipeline_head = tape->uncontrolled_last_pipeline_head = 0;
  2388. tape->controlled_previous_pipeline_head = tape->uncontrolled_previous_pipeline_head = 0;
  2389. tape->pipeline_head_speed = tape->controlled_pipeline_head_speed = 5000;
  2390. tape->uncontrolled_pipeline_head_speed = 0;
  2391. tape->controlled_pipeline_head_time = tape->uncontrolled_pipeline_head_time = jiffies;
  2392. tape->controlled_previous_head_time = tape->uncontrolled_previous_head_time = jiffies;
  2393. }
  2394. static int idetape_initiate_read (ide_drive_t *drive, int max_stages)
  2395. {
  2396. idetape_tape_t *tape = drive->driver_data;
  2397. idetape_stage_t *new_stage;
  2398. struct request rq;
  2399. int bytes_read;
  2400. u16 blocks = *(u16 *)&tape->caps[12];
  2401. /* Initialize read operation */
  2402. if (tape->chrdev_direction != idetape_direction_read) {
  2403. if (tape->chrdev_direction == idetape_direction_write) {
  2404. idetape_empty_write_pipeline(drive);
  2405. idetape_flush_tape_buffers(drive);
  2406. }
  2407. if (tape->merge_stage || tape->merge_stage_size) {
  2408. printk (KERN_ERR "ide-tape: merge_stage_size should be 0 now\n");
  2409. tape->merge_stage_size = 0;
  2410. }
  2411. if ((tape->merge_stage = __idetape_kmalloc_stage(tape, 0, 0)) == NULL)
  2412. return -ENOMEM;
  2413. tape->chrdev_direction = idetape_direction_read;
  2414. /*
  2415. * Issue a read 0 command to ensure that DSC handshake
  2416. * is switched from completion mode to buffer available
  2417. * mode.
  2418. * No point in issuing this if DSC overlap isn't supported,
  2419. * some drives (Seagate STT3401A) will return an error.
  2420. */
  2421. if (drive->dsc_overlap) {
  2422. bytes_read = idetape_queue_rw_tail(drive, REQ_IDETAPE_READ, 0, tape->merge_stage->bh);
  2423. if (bytes_read < 0) {
  2424. __idetape_kfree_stage(tape->merge_stage);
  2425. tape->merge_stage = NULL;
  2426. tape->chrdev_direction = idetape_direction_none;
  2427. return bytes_read;
  2428. }
  2429. }
  2430. }
  2431. if (tape->restart_speed_control_req)
  2432. idetape_restart_speed_control(drive);
  2433. idetape_init_rq(&rq, REQ_IDETAPE_READ);
  2434. rq.sector = tape->first_frame_position;
  2435. rq.nr_sectors = rq.current_nr_sectors = blocks;
  2436. if (!test_bit(IDETAPE_PIPELINE_ERROR, &tape->flags) &&
  2437. tape->nr_stages < max_stages) {
  2438. new_stage = idetape_kmalloc_stage(tape);
  2439. while (new_stage != NULL) {
  2440. new_stage->rq = rq;
  2441. idetape_add_stage_tail(drive, new_stage);
  2442. if (tape->nr_stages >= max_stages)
  2443. break;
  2444. new_stage = idetape_kmalloc_stage(tape);
  2445. }
  2446. }
  2447. if (!idetape_pipeline_active(tape)) {
  2448. if (tape->nr_pending_stages >= 3 * max_stages / 4) {
  2449. tape->measure_insert_time = 1;
  2450. tape->insert_time = jiffies;
  2451. tape->insert_size = 0;
  2452. tape->insert_speed = 0;
  2453. idetape_insert_pipeline_into_queue(drive);
  2454. }
  2455. }
  2456. return 0;
  2457. }
  2458. /*
  2459. * idetape_add_chrdev_read_request is called from idetape_chrdev_read
  2460. * to service a character device read request and add read-ahead
  2461. * requests to our pipeline.
  2462. */
  2463. static int idetape_add_chrdev_read_request (ide_drive_t *drive,int blocks)
  2464. {
  2465. idetape_tape_t *tape = drive->driver_data;
  2466. unsigned long flags;
  2467. struct request *rq_ptr;
  2468. int bytes_read;
  2469. #if IDETAPE_DEBUG_LOG
  2470. if (tape->debug_level >= 4)
  2471. printk(KERN_INFO "ide-tape: Reached idetape_add_chrdev_read_request, %d blocks\n", blocks);
  2472. #endif /* IDETAPE_DEBUG_LOG */
  2473. /*
  2474. * If we are at a filemark, return a read length of 0
  2475. */
  2476. if (test_bit(IDETAPE_FILEMARK, &tape->flags))
  2477. return 0;
  2478. /*
  2479. * Wait for the next block to be available at the head
  2480. * of the pipeline
  2481. */
  2482. idetape_initiate_read(drive, tape->max_stages);
  2483. if (tape->first_stage == NULL) {
  2484. if (test_bit(IDETAPE_PIPELINE_ERROR, &tape->flags))
  2485. return 0;
  2486. return idetape_queue_rw_tail(drive, REQ_IDETAPE_READ, blocks, tape->merge_stage->bh);
  2487. }
  2488. idetape_wait_first_stage(drive);
  2489. rq_ptr = &tape->first_stage->rq;
  2490. bytes_read = tape->tape_block_size * (rq_ptr->nr_sectors - rq_ptr->current_nr_sectors);
  2491. rq_ptr->nr_sectors = rq_ptr->current_nr_sectors = 0;
  2492. if (rq_ptr->errors == IDETAPE_ERROR_EOD)
  2493. return 0;
  2494. else {
  2495. idetape_switch_buffers(tape, tape->first_stage);
  2496. if (rq_ptr->errors == IDETAPE_ERROR_FILEMARK)
  2497. set_bit(IDETAPE_FILEMARK, &tape->flags);
  2498. spin_lock_irqsave(&tape->spinlock, flags);
  2499. idetape_remove_stage_head(drive);
  2500. spin_unlock_irqrestore(&tape->spinlock, flags);
  2501. tape->pipeline_head++;
  2502. calculate_speeds(drive);
  2503. }
  2504. if (bytes_read > blocks * tape->tape_block_size) {
  2505. printk(KERN_ERR "ide-tape: bug: trying to return more bytes than requested\n");
  2506. bytes_read = blocks * tape->tape_block_size;
  2507. }
  2508. return (bytes_read);
  2509. }
  2510. static void idetape_pad_zeros (ide_drive_t *drive, int bcount)
  2511. {
  2512. idetape_tape_t *tape = drive->driver_data;
  2513. struct idetape_bh *bh;
  2514. int blocks;
  2515. while (bcount) {
  2516. unsigned int count;
  2517. bh = tape->merge_stage->bh;
  2518. count = min(tape->stage_size, bcount);
  2519. bcount -= count;
  2520. blocks = count / tape->tape_block_size;
  2521. while (count) {
  2522. atomic_set(&bh->b_count, min(count, (unsigned int)bh->b_size));
  2523. memset(bh->b_data, 0, atomic_read(&bh->b_count));
  2524. count -= atomic_read(&bh->b_count);
  2525. bh = bh->b_reqnext;
  2526. }
  2527. idetape_queue_rw_tail(drive, REQ_IDETAPE_WRITE, blocks, tape->merge_stage->bh);
  2528. }
  2529. }
  2530. static int idetape_pipeline_size (ide_drive_t *drive)
  2531. {
  2532. idetape_tape_t *tape = drive->driver_data;
  2533. idetape_stage_t *stage;
  2534. struct request *rq;
  2535. int size = 0;
  2536. idetape_wait_for_pipeline(drive);
  2537. stage = tape->first_stage;
  2538. while (stage != NULL) {
  2539. rq = &stage->rq;
  2540. size += tape->tape_block_size * (rq->nr_sectors-rq->current_nr_sectors);
  2541. if (rq->errors == IDETAPE_ERROR_FILEMARK)
  2542. size += tape->tape_block_size;
  2543. stage = stage->next;
  2544. }
  2545. size += tape->merge_stage_size;
  2546. return size;
  2547. }
  2548. /*
  2549. * Rewinds the tape to the Beginning Of the current Partition (BOP).
  2550. *
  2551. * We currently support only one partition.
  2552. */
  2553. static int idetape_rewind_tape (ide_drive_t *drive)
  2554. {
  2555. int retval;
  2556. idetape_pc_t pc;
  2557. #if IDETAPE_DEBUG_LOG
  2558. idetape_tape_t *tape = drive->driver_data;
  2559. if (tape->debug_level >= 2)
  2560. printk(KERN_INFO "ide-tape: Reached idetape_rewind_tape\n");
  2561. #endif /* IDETAPE_DEBUG_LOG */
  2562. idetape_create_rewind_cmd(drive, &pc);
  2563. retval = idetape_queue_pc_tail(drive, &pc);
  2564. if (retval)
  2565. return retval;
  2566. idetape_create_read_position_cmd(&pc);
  2567. retval = idetape_queue_pc_tail(drive, &pc);
  2568. if (retval)
  2569. return retval;
  2570. return 0;
  2571. }
  2572. /*
  2573. * Our special ide-tape ioctl's.
  2574. *
  2575. * Currently there aren't any ioctl's.
  2576. * mtio.h compatible commands should be issued to the character device
  2577. * interface.
  2578. */
  2579. static int idetape_blkdev_ioctl(ide_drive_t *drive, unsigned int cmd, unsigned long arg)
  2580. {
  2581. idetape_tape_t *tape = drive->driver_data;
  2582. void __user *argp = (void __user *)arg;
  2583. struct idetape_config {
  2584. int dsc_rw_frequency;
  2585. int dsc_media_access_frequency;
  2586. int nr_stages;
  2587. } config;
  2588. #if IDETAPE_DEBUG_LOG
  2589. if (tape->debug_level >= 4)
  2590. printk(KERN_INFO "ide-tape: Reached idetape_blkdev_ioctl\n");
  2591. #endif /* IDETAPE_DEBUG_LOG */
  2592. switch (cmd) {
  2593. case 0x0340:
  2594. if (copy_from_user(&config, argp, sizeof(config)))
  2595. return -EFAULT;
  2596. tape->best_dsc_rw_frequency = config.dsc_rw_frequency;
  2597. tape->max_stages = config.nr_stages;
  2598. break;
  2599. case 0x0350:
  2600. config.dsc_rw_frequency = (int) tape->best_dsc_rw_frequency;
  2601. config.nr_stages = tape->max_stages;
  2602. if (copy_to_user(argp, &config, sizeof(config)))
  2603. return -EFAULT;
  2604. break;
  2605. default:
  2606. return -EIO;
  2607. }
  2608. return 0;
  2609. }
  2610. /*
  2611. * idetape_space_over_filemarks is now a bit more complicated than just
  2612. * passing the command to the tape since we may have crossed some
  2613. * filemarks during our pipelined read-ahead mode.
  2614. *
  2615. * As a minor side effect, the pipeline enables us to support MTFSFM when
  2616. * the filemark is in our internal pipeline even if the tape doesn't
  2617. * support spacing over filemarks in the reverse direction.
  2618. */
  2619. static int idetape_space_over_filemarks (ide_drive_t *drive,short mt_op,int mt_count)
  2620. {
  2621. idetape_tape_t *tape = drive->driver_data;
  2622. idetape_pc_t pc;
  2623. unsigned long flags;
  2624. int retval,count=0;
  2625. int sprev = !!(tape->caps[4] & 0x20);
  2626. if (mt_count == 0)
  2627. return 0;
  2628. if (MTBSF == mt_op || MTBSFM == mt_op) {
  2629. if (!sprev)
  2630. return -EIO;
  2631. mt_count = - mt_count;
  2632. }
  2633. if (tape->chrdev_direction == idetape_direction_read) {
  2634. /*
  2635. * We have a read-ahead buffer. Scan it for crossed
  2636. * filemarks.
  2637. */
  2638. tape->merge_stage_size = 0;
  2639. if (test_and_clear_bit(IDETAPE_FILEMARK, &tape->flags))
  2640. ++count;
  2641. while (tape->first_stage != NULL) {
  2642. if (count == mt_count) {
  2643. if (mt_op == MTFSFM)
  2644. set_bit(IDETAPE_FILEMARK, &tape->flags);
  2645. return 0;
  2646. }
  2647. spin_lock_irqsave(&tape->spinlock, flags);
  2648. if (tape->first_stage == tape->active_stage) {
  2649. /*
  2650. * We have reached the active stage in the read pipeline.
  2651. * There is no point in allowing the drive to continue
  2652. * reading any farther, so we stop the pipeline.
  2653. *
  2654. * This section should be moved to a separate subroutine,
  2655. * because a similar function is performed in
  2656. * __idetape_discard_read_pipeline(), for example.
  2657. */
  2658. tape->next_stage = NULL;
  2659. spin_unlock_irqrestore(&tape->spinlock, flags);
  2660. idetape_wait_first_stage(drive);
  2661. tape->next_stage = tape->first_stage->next;
  2662. } else
  2663. spin_unlock_irqrestore(&tape->spinlock, flags);
  2664. if (tape->first_stage->rq.errors == IDETAPE_ERROR_FILEMARK)
  2665. ++count;
  2666. idetape_remove_stage_head(drive);
  2667. }
  2668. idetape_discard_read_pipeline(drive, 0);
  2669. }
  2670. /*
  2671. * The filemark was not found in our internal pipeline.
  2672. * Now we can issue the space command.
  2673. */
  2674. switch (mt_op) {
  2675. case MTFSF:
  2676. case MTBSF:
  2677. idetape_create_space_cmd(&pc,mt_count-count,IDETAPE_SPACE_OVER_FILEMARK);
  2678. return (idetape_queue_pc_tail(drive, &pc));
  2679. case MTFSFM:
  2680. case MTBSFM:
  2681. if (!sprev)
  2682. return (-EIO);
  2683. retval = idetape_space_over_filemarks(drive, MTFSF, mt_count-count);
  2684. if (retval) return (retval);
  2685. count = (MTBSFM == mt_op ? 1 : -1);
  2686. return (idetape_space_over_filemarks(drive, MTFSF, count));
  2687. default:
  2688. printk(KERN_ERR "ide-tape: MTIO operation %d not supported\n",mt_op);
  2689. return (-EIO);
  2690. }
  2691. }
  2692. /*
  2693. * Our character device read / write functions.
  2694. *
  2695. * The tape is optimized to maximize throughput when it is transferring
  2696. * an integral number of the "continuous transfer limit", which is
  2697. * a parameter of the specific tape (26 KB on my particular tape).
  2698. * (32 kB for Onstream)
  2699. *
  2700. * As of version 1.3 of the driver, the character device provides an
  2701. * abstract continuous view of the media - any mix of block sizes (even 1
  2702. * byte) on the same backup/restore procedure is supported. The driver
  2703. * will internally convert the requests to the recommended transfer unit,
  2704. * so that an unmatch between the user's block size to the recommended
  2705. * size will only result in a (slightly) increased driver overhead, but
  2706. * will no longer hit performance.
  2707. * This is not applicable to Onstream.
  2708. */
  2709. static ssize_t idetape_chrdev_read (struct file *file, char __user *buf,
  2710. size_t count, loff_t *ppos)
  2711. {
  2712. struct ide_tape_obj *tape = ide_tape_f(file);
  2713. ide_drive_t *drive = tape->drive;
  2714. ssize_t bytes_read,temp, actually_read = 0, rc;
  2715. ssize_t ret = 0;
  2716. u16 ctl = *(u16 *)&tape->caps[12];
  2717. #if IDETAPE_DEBUG_LOG
  2718. if (tape->debug_level >= 3)
  2719. printk(KERN_INFO "ide-tape: Reached idetape_chrdev_read, count %Zd\n", count);
  2720. #endif /* IDETAPE_DEBUG_LOG */
  2721. if (tape->chrdev_direction != idetape_direction_read) {
  2722. if (test_bit(IDETAPE_DETECT_BS, &tape->flags))
  2723. if (count > tape->tape_block_size &&
  2724. (count % tape->tape_block_size) == 0)
  2725. tape->user_bs_factor = count / tape->tape_block_size;
  2726. }
  2727. if ((rc = idetape_initiate_read(drive, tape->max_stages)) < 0)
  2728. return rc;
  2729. if (count == 0)
  2730. return (0);
  2731. if (tape->merge_stage_size) {
  2732. actually_read = min((unsigned int)(tape->merge_stage_size), (unsigned int)count);
  2733. if (idetape_copy_stage_to_user(tape, buf, tape->merge_stage, actually_read))
  2734. ret = -EFAULT;
  2735. buf += actually_read;
  2736. tape->merge_stage_size -= actually_read;
  2737. count -= actually_read;
  2738. }
  2739. while (count >= tape->stage_size) {
  2740. bytes_read = idetape_add_chrdev_read_request(drive, ctl);
  2741. if (bytes_read <= 0)
  2742. goto finish;
  2743. if (idetape_copy_stage_to_user(tape, buf, tape->merge_stage, bytes_read))
  2744. ret = -EFAULT;
  2745. buf += bytes_read;
  2746. count -= bytes_read;
  2747. actually_read += bytes_read;
  2748. }
  2749. if (count) {
  2750. bytes_read = idetape_add_chrdev_read_request(drive, ctl);
  2751. if (bytes_read <= 0)
  2752. goto finish;
  2753. temp = min((unsigned long)count, (unsigned long)bytes_read);
  2754. if (idetape_copy_stage_to_user(tape, buf, tape->merge_stage, temp))
  2755. ret = -EFAULT;
  2756. actually_read += temp;
  2757. tape->merge_stage_size = bytes_read-temp;
  2758. }
  2759. finish:
  2760. if (!actually_read && test_bit(IDETAPE_FILEMARK, &tape->flags)) {
  2761. #if IDETAPE_DEBUG_LOG
  2762. if (tape->debug_level >= 2)
  2763. printk(KERN_INFO "ide-tape: %s: spacing over filemark\n", tape->name);
  2764. #endif
  2765. idetape_space_over_filemarks(drive, MTFSF, 1);
  2766. return 0;
  2767. }
  2768. return (ret) ? ret : actually_read;
  2769. }
  2770. static ssize_t idetape_chrdev_write (struct file *file, const char __user *buf,
  2771. size_t count, loff_t *ppos)
  2772. {
  2773. struct ide_tape_obj *tape = ide_tape_f(file);
  2774. ide_drive_t *drive = tape->drive;
  2775. ssize_t actually_written = 0;
  2776. ssize_t ret = 0;
  2777. u16 ctl = *(u16 *)&tape->caps[12];
  2778. /* The drive is write protected. */
  2779. if (tape->write_prot)
  2780. return -EACCES;
  2781. #if IDETAPE_DEBUG_LOG
  2782. if (tape->debug_level >= 3)
  2783. printk(KERN_INFO "ide-tape: Reached idetape_chrdev_write, "
  2784. "count %Zd\n", count);
  2785. #endif /* IDETAPE_DEBUG_LOG */
  2786. /* Initialize write operation */
  2787. if (tape->chrdev_direction != idetape_direction_write) {
  2788. if (tape->chrdev_direction == idetape_direction_read)
  2789. idetape_discard_read_pipeline(drive, 1);
  2790. if (tape->merge_stage || tape->merge_stage_size) {
  2791. printk(KERN_ERR "ide-tape: merge_stage_size "
  2792. "should be 0 now\n");
  2793. tape->merge_stage_size = 0;
  2794. }
  2795. if ((tape->merge_stage = __idetape_kmalloc_stage(tape, 0, 0)) == NULL)
  2796. return -ENOMEM;
  2797. tape->chrdev_direction = idetape_direction_write;
  2798. idetape_init_merge_stage(tape);
  2799. /*
  2800. * Issue a write 0 command to ensure that DSC handshake
  2801. * is switched from completion mode to buffer available
  2802. * mode.
  2803. * No point in issuing this if DSC overlap isn't supported,
  2804. * some drives (Seagate STT3401A) will return an error.
  2805. */
  2806. if (drive->dsc_overlap) {
  2807. ssize_t retval = idetape_queue_rw_tail(drive, REQ_IDETAPE_WRITE, 0, tape->merge_stage->bh);
  2808. if (retval < 0) {
  2809. __idetape_kfree_stage(tape->merge_stage);
  2810. tape->merge_stage = NULL;
  2811. tape->chrdev_direction = idetape_direction_none;
  2812. return retval;
  2813. }
  2814. }
  2815. }
  2816. if (count == 0)
  2817. return (0);
  2818. if (tape->restart_speed_control_req)
  2819. idetape_restart_speed_control(drive);
  2820. if (tape->merge_stage_size) {
  2821. if (tape->merge_stage_size >= tape->stage_size) {
  2822. printk(KERN_ERR "ide-tape: bug: merge buffer too big\n");
  2823. tape->merge_stage_size = 0;
  2824. }
  2825. actually_written = min((unsigned int)(tape->stage_size - tape->merge_stage_size), (unsigned int)count);
  2826. if (idetape_copy_stage_from_user(tape, tape->merge_stage, buf, actually_written))
  2827. ret = -EFAULT;
  2828. buf += actually_written;
  2829. tape->merge_stage_size += actually_written;
  2830. count -= actually_written;
  2831. if (tape->merge_stage_size == tape->stage_size) {
  2832. ssize_t retval;
  2833. tape->merge_stage_size = 0;
  2834. retval = idetape_add_chrdev_write_request(drive, ctl);
  2835. if (retval <= 0)
  2836. return (retval);
  2837. }
  2838. }
  2839. while (count >= tape->stage_size) {
  2840. ssize_t retval;
  2841. if (idetape_copy_stage_from_user(tape, tape->merge_stage, buf, tape->stage_size))
  2842. ret = -EFAULT;
  2843. buf += tape->stage_size;
  2844. count -= tape->stage_size;
  2845. retval = idetape_add_chrdev_write_request(drive, ctl);
  2846. actually_written += tape->stage_size;
  2847. if (retval <= 0)
  2848. return (retval);
  2849. }
  2850. if (count) {
  2851. actually_written += count;
  2852. if (idetape_copy_stage_from_user(tape, tape->merge_stage, buf, count))
  2853. ret = -EFAULT;
  2854. tape->merge_stage_size += count;
  2855. }
  2856. return (ret) ? ret : actually_written;
  2857. }
  2858. static int idetape_write_filemark (ide_drive_t *drive)
  2859. {
  2860. idetape_pc_t pc;
  2861. /* Write a filemark */
  2862. idetape_create_write_filemark_cmd(drive, &pc, 1);
  2863. if (idetape_queue_pc_tail(drive, &pc)) {
  2864. printk(KERN_ERR "ide-tape: Couldn't write a filemark\n");
  2865. return -EIO;
  2866. }
  2867. return 0;
  2868. }
  2869. /*
  2870. * Called from idetape_chrdev_ioctl when the general mtio MTIOCTOP ioctl is
  2871. * requested.
  2872. *
  2873. * Note: MTBSF and MTBSFM are not supported when the tape doesn't support
  2874. * spacing over filemarks in the reverse direction. In this case, MTFSFM is also
  2875. * usually not supported (it is supported in the rare case in which we crossed
  2876. * the filemark during our read-ahead pipelined operation mode).
  2877. *
  2878. * The following commands are currently not supported:
  2879. *
  2880. * MTFSS, MTBSS, MTWSM, MTSETDENSITY, MTSETDRVBUFFER, MT_ST_BOOLEANS,
  2881. * MT_ST_WRITE_THRESHOLD.
  2882. */
  2883. static int idetape_mtioctop(ide_drive_t *drive, short mt_op, int mt_count)
  2884. {
  2885. idetape_tape_t *tape = drive->driver_data;
  2886. idetape_pc_t pc;
  2887. int i,retval;
  2888. #if IDETAPE_DEBUG_LOG
  2889. if (tape->debug_level >= 1)
  2890. printk(KERN_INFO "ide-tape: Handling MTIOCTOP ioctl: "
  2891. "mt_op=%d, mt_count=%d\n", mt_op, mt_count);
  2892. #endif /* IDETAPE_DEBUG_LOG */
  2893. /*
  2894. * Commands which need our pipelined read-ahead stages.
  2895. */
  2896. switch (mt_op) {
  2897. case MTFSF:
  2898. case MTFSFM:
  2899. case MTBSF:
  2900. case MTBSFM:
  2901. if (!mt_count)
  2902. return (0);
  2903. return (idetape_space_over_filemarks(drive,mt_op,mt_count));
  2904. default:
  2905. break;
  2906. }
  2907. switch (mt_op) {
  2908. case MTWEOF:
  2909. if (tape->write_prot)
  2910. return -EACCES;
  2911. idetape_discard_read_pipeline(drive, 1);
  2912. for (i = 0; i < mt_count; i++) {
  2913. retval = idetape_write_filemark(drive);
  2914. if (retval)
  2915. return retval;
  2916. }
  2917. return (0);
  2918. case MTREW:
  2919. idetape_discard_read_pipeline(drive, 0);
  2920. if (idetape_rewind_tape(drive))
  2921. return -EIO;
  2922. return 0;
  2923. case MTLOAD:
  2924. idetape_discard_read_pipeline(drive, 0);
  2925. idetape_create_load_unload_cmd(drive, &pc, IDETAPE_LU_LOAD_MASK);
  2926. return (idetape_queue_pc_tail(drive, &pc));
  2927. case MTUNLOAD:
  2928. case MTOFFL:
  2929. /*
  2930. * If door is locked, attempt to unlock before
  2931. * attempting to eject.
  2932. */
  2933. if (tape->door_locked) {
  2934. if (idetape_create_prevent_cmd(drive, &pc, 0))
  2935. if (!idetape_queue_pc_tail(drive, &pc))
  2936. tape->door_locked = DOOR_UNLOCKED;
  2937. }
  2938. idetape_discard_read_pipeline(drive, 0);
  2939. idetape_create_load_unload_cmd(drive, &pc,!IDETAPE_LU_LOAD_MASK);
  2940. retval = idetape_queue_pc_tail(drive, &pc);
  2941. if (!retval)
  2942. clear_bit(IDETAPE_MEDIUM_PRESENT, &tape->flags);
  2943. return retval;
  2944. case MTNOP:
  2945. idetape_discard_read_pipeline(drive, 0);
  2946. return (idetape_flush_tape_buffers(drive));
  2947. case MTRETEN:
  2948. idetape_discard_read_pipeline(drive, 0);
  2949. idetape_create_load_unload_cmd(drive, &pc,IDETAPE_LU_RETENSION_MASK | IDETAPE_LU_LOAD_MASK);
  2950. return (idetape_queue_pc_tail(drive, &pc));
  2951. case MTEOM:
  2952. idetape_create_space_cmd(&pc, 0, IDETAPE_SPACE_TO_EOD);
  2953. return (idetape_queue_pc_tail(drive, &pc));
  2954. case MTERASE:
  2955. (void) idetape_rewind_tape(drive);
  2956. idetape_create_erase_cmd(&pc);
  2957. return (idetape_queue_pc_tail(drive, &pc));
  2958. case MTSETBLK:
  2959. if (mt_count) {
  2960. if (mt_count < tape->tape_block_size || mt_count % tape->tape_block_size)
  2961. return -EIO;
  2962. tape->user_bs_factor = mt_count / tape->tape_block_size;
  2963. clear_bit(IDETAPE_DETECT_BS, &tape->flags);
  2964. } else
  2965. set_bit(IDETAPE_DETECT_BS, &tape->flags);
  2966. return 0;
  2967. case MTSEEK:
  2968. idetape_discard_read_pipeline(drive, 0);
  2969. return idetape_position_tape(drive, mt_count * tape->user_bs_factor, tape->partition, 0);
  2970. case MTSETPART:
  2971. idetape_discard_read_pipeline(drive, 0);
  2972. return (idetape_position_tape(drive, 0, mt_count, 0));
  2973. case MTFSR:
  2974. case MTBSR:
  2975. case MTLOCK:
  2976. if (!idetape_create_prevent_cmd(drive, &pc, 1))
  2977. return 0;
  2978. retval = idetape_queue_pc_tail(drive, &pc);
  2979. if (retval) return retval;
  2980. tape->door_locked = DOOR_EXPLICITLY_LOCKED;
  2981. return 0;
  2982. case MTUNLOCK:
  2983. if (!idetape_create_prevent_cmd(drive, &pc, 0))
  2984. return 0;
  2985. retval = idetape_queue_pc_tail(drive, &pc);
  2986. if (retval) return retval;
  2987. tape->door_locked = DOOR_UNLOCKED;
  2988. return 0;
  2989. default:
  2990. printk(KERN_ERR "ide-tape: MTIO operation %d not "
  2991. "supported\n", mt_op);
  2992. return (-EIO);
  2993. }
  2994. }
  2995. /*
  2996. * Our character device ioctls. General mtio.h magnetic io commands are
  2997. * supported here, and not in the corresponding block interface. Our own
  2998. * ide-tape ioctls are supported on both interfaces.
  2999. */
  3000. static int idetape_chrdev_ioctl(struct inode *inode, struct file *file,
  3001. unsigned int cmd, unsigned long arg)
  3002. {
  3003. struct ide_tape_obj *tape = ide_tape_f(file);
  3004. ide_drive_t *drive = tape->drive;
  3005. struct mtop mtop;
  3006. struct mtget mtget;
  3007. struct mtpos mtpos;
  3008. int block_offset = 0, position = tape->first_frame_position;
  3009. void __user *argp = (void __user *)arg;
  3010. #if IDETAPE_DEBUG_LOG
  3011. if (tape->debug_level >= 3)
  3012. printk(KERN_INFO "ide-tape: Reached idetape_chrdev_ioctl, "
  3013. "cmd=%u\n", cmd);
  3014. #endif /* IDETAPE_DEBUG_LOG */
  3015. tape->restart_speed_control_req = 1;
  3016. if (tape->chrdev_direction == idetape_direction_write) {
  3017. idetape_empty_write_pipeline(drive);
  3018. idetape_flush_tape_buffers(drive);
  3019. }
  3020. if (cmd == MTIOCGET || cmd == MTIOCPOS) {
  3021. block_offset = idetape_pipeline_size(drive) / (tape->tape_block_size * tape->user_bs_factor);
  3022. if ((position = idetape_read_position(drive)) < 0)
  3023. return -EIO;
  3024. }
  3025. switch (cmd) {
  3026. case MTIOCTOP:
  3027. if (copy_from_user(&mtop, argp, sizeof (struct mtop)))
  3028. return -EFAULT;
  3029. return (idetape_mtioctop(drive,mtop.mt_op,mtop.mt_count));
  3030. case MTIOCGET:
  3031. memset(&mtget, 0, sizeof (struct mtget));
  3032. mtget.mt_type = MT_ISSCSI2;
  3033. mtget.mt_blkno = position / tape->user_bs_factor - block_offset;
  3034. mtget.mt_dsreg = ((tape->tape_block_size * tape->user_bs_factor) << MT_ST_BLKSIZE_SHIFT) & MT_ST_BLKSIZE_MASK;
  3035. if (tape->drv_write_prot) {
  3036. mtget.mt_gstat |= GMT_WR_PROT(0xffffffff);
  3037. }
  3038. if (copy_to_user(argp, &mtget, sizeof(struct mtget)))
  3039. return -EFAULT;
  3040. return 0;
  3041. case MTIOCPOS:
  3042. mtpos.mt_blkno = position / tape->user_bs_factor - block_offset;
  3043. if (copy_to_user(argp, &mtpos, sizeof(struct mtpos)))
  3044. return -EFAULT;
  3045. return 0;
  3046. default:
  3047. if (tape->chrdev_direction == idetape_direction_read)
  3048. idetape_discard_read_pipeline(drive, 1);
  3049. return idetape_blkdev_ioctl(drive, cmd, arg);
  3050. }
  3051. }
  3052. /*
  3053. * Do a mode sense page 0 with block descriptor and if it succeeds set the tape
  3054. * block size with the reported value.
  3055. */
  3056. static void ide_tape_get_bsize_from_bdesc(ide_drive_t *drive)
  3057. {
  3058. idetape_tape_t *tape = drive->driver_data;
  3059. idetape_pc_t pc;
  3060. idetape_create_mode_sense_cmd(&pc, IDETAPE_BLOCK_DESCRIPTOR);
  3061. if (idetape_queue_pc_tail(drive, &pc)) {
  3062. printk(KERN_ERR "ide-tape: Can't get block descriptor\n");
  3063. if (tape->tape_block_size == 0) {
  3064. printk(KERN_WARNING "ide-tape: Cannot deal with zero "
  3065. "block size, assuming 32k\n");
  3066. tape->tape_block_size = 32768;
  3067. }
  3068. return;
  3069. }
  3070. tape->tape_block_size = (pc.buffer[4 + 5] << 16) +
  3071. (pc.buffer[4 + 6] << 8) +
  3072. pc.buffer[4 + 7];
  3073. tape->drv_write_prot = (pc.buffer[2] & 0x80) >> 7;
  3074. }
  3075. /*
  3076. * Our character device open function.
  3077. */
  3078. static int idetape_chrdev_open (struct inode *inode, struct file *filp)
  3079. {
  3080. unsigned int minor = iminor(inode), i = minor & ~0xc0;
  3081. ide_drive_t *drive;
  3082. idetape_tape_t *tape;
  3083. idetape_pc_t pc;
  3084. int retval;
  3085. /*
  3086. * We really want to do nonseekable_open(inode, filp); here, but some
  3087. * versions of tar incorrectly call lseek on tapes and bail out if that
  3088. * fails. So we disallow pread() and pwrite(), but permit lseeks.
  3089. */
  3090. filp->f_mode &= ~(FMODE_PREAD | FMODE_PWRITE);
  3091. #if IDETAPE_DEBUG_LOG
  3092. printk(KERN_INFO "ide-tape: Reached idetape_chrdev_open\n");
  3093. #endif /* IDETAPE_DEBUG_LOG */
  3094. if (i >= MAX_HWIFS * MAX_DRIVES)
  3095. return -ENXIO;
  3096. if (!(tape = ide_tape_chrdev_get(i)))
  3097. return -ENXIO;
  3098. drive = tape->drive;
  3099. filp->private_data = tape;
  3100. if (test_and_set_bit(IDETAPE_BUSY, &tape->flags)) {
  3101. retval = -EBUSY;
  3102. goto out_put_tape;
  3103. }
  3104. retval = idetape_wait_ready(drive, 60 * HZ);
  3105. if (retval) {
  3106. clear_bit(IDETAPE_BUSY, &tape->flags);
  3107. printk(KERN_ERR "ide-tape: %s: drive not ready\n", tape->name);
  3108. goto out_put_tape;
  3109. }
  3110. idetape_read_position(drive);
  3111. if (!test_bit(IDETAPE_ADDRESS_VALID, &tape->flags))
  3112. (void)idetape_rewind_tape(drive);
  3113. if (tape->chrdev_direction != idetape_direction_read)
  3114. clear_bit(IDETAPE_PIPELINE_ERROR, &tape->flags);
  3115. /* Read block size and write protect status from drive. */
  3116. ide_tape_get_bsize_from_bdesc(drive);
  3117. /* Set write protect flag if device is opened as read-only. */
  3118. if ((filp->f_flags & O_ACCMODE) == O_RDONLY)
  3119. tape->write_prot = 1;
  3120. else
  3121. tape->write_prot = tape->drv_write_prot;
  3122. /* Make sure drive isn't write protected if user wants to write. */
  3123. if (tape->write_prot) {
  3124. if ((filp->f_flags & O_ACCMODE) == O_WRONLY ||
  3125. (filp->f_flags & O_ACCMODE) == O_RDWR) {
  3126. clear_bit(IDETAPE_BUSY, &tape->flags);
  3127. retval = -EROFS;
  3128. goto out_put_tape;
  3129. }
  3130. }
  3131. /*
  3132. * Lock the tape drive door so user can't eject.
  3133. */
  3134. if (tape->chrdev_direction == idetape_direction_none) {
  3135. if (idetape_create_prevent_cmd(drive, &pc, 1)) {
  3136. if (!idetape_queue_pc_tail(drive, &pc)) {
  3137. if (tape->door_locked != DOOR_EXPLICITLY_LOCKED)
  3138. tape->door_locked = DOOR_LOCKED;
  3139. }
  3140. }
  3141. }
  3142. idetape_restart_speed_control(drive);
  3143. tape->restart_speed_control_req = 0;
  3144. return 0;
  3145. out_put_tape:
  3146. ide_tape_put(tape);
  3147. return retval;
  3148. }
  3149. static void idetape_write_release (ide_drive_t *drive, unsigned int minor)
  3150. {
  3151. idetape_tape_t *tape = drive->driver_data;
  3152. idetape_empty_write_pipeline(drive);
  3153. tape->merge_stage = __idetape_kmalloc_stage(tape, 1, 0);
  3154. if (tape->merge_stage != NULL) {
  3155. idetape_pad_zeros(drive, tape->tape_block_size * (tape->user_bs_factor - 1));
  3156. __idetape_kfree_stage(tape->merge_stage);
  3157. tape->merge_stage = NULL;
  3158. }
  3159. idetape_write_filemark(drive);
  3160. idetape_flush_tape_buffers(drive);
  3161. idetape_flush_tape_buffers(drive);
  3162. }
  3163. /*
  3164. * Our character device release function.
  3165. */
  3166. static int idetape_chrdev_release (struct inode *inode, struct file *filp)
  3167. {
  3168. struct ide_tape_obj *tape = ide_tape_f(filp);
  3169. ide_drive_t *drive = tape->drive;
  3170. idetape_pc_t pc;
  3171. unsigned int minor = iminor(inode);
  3172. lock_kernel();
  3173. tape = drive->driver_data;
  3174. #if IDETAPE_DEBUG_LOG
  3175. if (tape->debug_level >= 3)
  3176. printk(KERN_INFO "ide-tape: Reached idetape_chrdev_release\n");
  3177. #endif /* IDETAPE_DEBUG_LOG */
  3178. if (tape->chrdev_direction == idetape_direction_write)
  3179. idetape_write_release(drive, minor);
  3180. if (tape->chrdev_direction == idetape_direction_read) {
  3181. if (minor < 128)
  3182. idetape_discard_read_pipeline(drive, 1);
  3183. else
  3184. idetape_wait_for_pipeline(drive);
  3185. }
  3186. if (tape->cache_stage != NULL) {
  3187. __idetape_kfree_stage(tape->cache_stage);
  3188. tape->cache_stage = NULL;
  3189. }
  3190. if (minor < 128 && test_bit(IDETAPE_MEDIUM_PRESENT, &tape->flags))
  3191. (void) idetape_rewind_tape(drive);
  3192. if (tape->chrdev_direction == idetape_direction_none) {
  3193. if (tape->door_locked == DOOR_LOCKED) {
  3194. if (idetape_create_prevent_cmd(drive, &pc, 0)) {
  3195. if (!idetape_queue_pc_tail(drive, &pc))
  3196. tape->door_locked = DOOR_UNLOCKED;
  3197. }
  3198. }
  3199. }
  3200. clear_bit(IDETAPE_BUSY, &tape->flags);
  3201. ide_tape_put(tape);
  3202. unlock_kernel();
  3203. return 0;
  3204. }
  3205. /*
  3206. * idetape_identify_device is called to check the contents of the
  3207. * ATAPI IDENTIFY command results. We return:
  3208. *
  3209. * 1 If the tape can be supported by us, based on the information
  3210. * we have so far.
  3211. *
  3212. * 0 If this tape driver is not currently supported by us.
  3213. */
  3214. static int idetape_identify_device (ide_drive_t *drive)
  3215. {
  3216. struct idetape_id_gcw gcw;
  3217. struct hd_driveid *id = drive->id;
  3218. if (drive->id_read == 0)
  3219. return 1;
  3220. *((unsigned short *) &gcw) = id->config;
  3221. /* Check that we can support this device */
  3222. if (gcw.protocol != 2)
  3223. printk(KERN_ERR "ide-tape: Protocol (0x%02x) is not ATAPI\n",
  3224. gcw.protocol);
  3225. else if (gcw.device_type != 1)
  3226. printk(KERN_ERR "ide-tape: Device type (0x%02x) is not set "
  3227. "to tape\n", gcw.device_type);
  3228. else if (!gcw.removable)
  3229. printk(KERN_ERR "ide-tape: The removable flag is not set\n");
  3230. else if (gcw.packet_size != 0) {
  3231. printk(KERN_ERR "ide-tape: Packet size (0x%02x) is not 12 "
  3232. "bytes long\n", gcw.packet_size);
  3233. } else
  3234. return 1;
  3235. return 0;
  3236. }
  3237. static void idetape_get_inquiry_results(ide_drive_t *drive)
  3238. {
  3239. char *r;
  3240. idetape_tape_t *tape = drive->driver_data;
  3241. idetape_pc_t pc;
  3242. idetape_create_inquiry_cmd(&pc);
  3243. if (idetape_queue_pc_tail(drive, &pc)) {
  3244. printk(KERN_ERR "ide-tape: %s: can't get INQUIRY results\n",
  3245. tape->name);
  3246. return;
  3247. }
  3248. memcpy(tape->vendor_id, &pc.buffer[8], 8);
  3249. memcpy(tape->product_id, &pc.buffer[16], 16);
  3250. memcpy(tape->firmware_revision, &pc.buffer[32], 4);
  3251. ide_fixstring(tape->vendor_id, 10, 0);
  3252. ide_fixstring(tape->product_id, 18, 0);
  3253. ide_fixstring(tape->firmware_revision, 6, 0);
  3254. r = tape->firmware_revision;
  3255. if (*(r + 1) == '.')
  3256. tape->firmware_revision_num = (*r - '0') * 100 +
  3257. (*(r + 2) - '0') * 10 + *(r + 3) - '0';
  3258. printk(KERN_INFO "ide-tape: %s <-> %s: %s %s rev %s\n",
  3259. drive->name, tape->name, tape->vendor_id,
  3260. tape->product_id, tape->firmware_revision);
  3261. }
  3262. /*
  3263. * Ask the tape about its various parameters. In particular, we will adjust our
  3264. * data transfer buffer size to the recommended value as returned by the tape.
  3265. */
  3266. static void idetape_get_mode_sense_results (ide_drive_t *drive)
  3267. {
  3268. idetape_tape_t *tape = drive->driver_data;
  3269. idetape_pc_t pc;
  3270. u8 *caps;
  3271. u8 speed, max_speed;
  3272. idetape_create_mode_sense_cmd(&pc, IDETAPE_CAPABILITIES_PAGE);
  3273. if (idetape_queue_pc_tail(drive, &pc)) {
  3274. printk(KERN_ERR "ide-tape: Can't get tape parameters - assuming"
  3275. " some default values\n");
  3276. tape->tape_block_size = 512;
  3277. put_unaligned(52, (u16 *)&tape->caps[12]);
  3278. put_unaligned(540, (u16 *)&tape->caps[14]);
  3279. put_unaligned(6*52, (u16 *)&tape->caps[16]);
  3280. return;
  3281. }
  3282. caps = pc.buffer + 4 + pc.buffer[3];
  3283. /* convert to host order and save for later use */
  3284. speed = be16_to_cpu(*(u16 *)&caps[14]);
  3285. max_speed = be16_to_cpu(*(u16 *)&caps[8]);
  3286. put_unaligned(max_speed, (u16 *)&caps[8]);
  3287. put_unaligned(be16_to_cpu(*(u16 *)&caps[12]), (u16 *)&caps[12]);
  3288. put_unaligned(speed, (u16 *)&caps[14]);
  3289. put_unaligned(be16_to_cpu(*(u16 *)&caps[16]), (u16 *)&caps[16]);
  3290. if (!speed) {
  3291. printk(KERN_INFO "ide-tape: %s: invalid tape speed "
  3292. "(assuming 650KB/sec)\n", drive->name);
  3293. put_unaligned(650, (u16 *)&caps[14]);
  3294. }
  3295. if (!max_speed) {
  3296. printk(KERN_INFO "ide-tape: %s: invalid max_speed "
  3297. "(assuming 650KB/sec)\n", drive->name);
  3298. put_unaligned(650, (u16 *)&caps[8]);
  3299. }
  3300. memcpy(&tape->caps, caps, 20);
  3301. if (caps[7] & 0x02)
  3302. tape->tape_block_size = 512;
  3303. else if (caps[7] & 0x04)
  3304. tape->tape_block_size = 1024;
  3305. }
  3306. #ifdef CONFIG_IDE_PROC_FS
  3307. static void idetape_add_settings (ide_drive_t *drive)
  3308. {
  3309. idetape_tape_t *tape = drive->driver_data;
  3310. /*
  3311. * drive setting name read/write data type min max mul_factor div_factor data pointer set function
  3312. */
  3313. ide_add_setting(drive, "buffer", SETTING_READ, TYPE_SHORT, 0, 0xffff,
  3314. 1, 2, (u16 *)&tape->caps[16], NULL);
  3315. ide_add_setting(drive, "pipeline_min", SETTING_RW, TYPE_INT, 1, 0xffff, tape->stage_size / 1024, 1, &tape->min_pipeline, NULL);
  3316. ide_add_setting(drive, "pipeline", SETTING_RW, TYPE_INT, 1, 0xffff, tape->stage_size / 1024, 1, &tape->max_stages, NULL);
  3317. ide_add_setting(drive, "pipeline_max", SETTING_RW, TYPE_INT, 1, 0xffff, tape->stage_size / 1024, 1, &tape->max_pipeline, NULL);
  3318. ide_add_setting(drive, "pipeline_used", SETTING_READ, TYPE_INT, 0, 0xffff, tape->stage_size / 1024, 1, &tape->nr_stages, NULL);
  3319. ide_add_setting(drive, "pipeline_pending", SETTING_READ, TYPE_INT, 0, 0xffff, tape->stage_size / 1024, 1, &tape->nr_pending_stages, NULL);
  3320. ide_add_setting(drive, "speed", SETTING_READ, TYPE_SHORT, 0, 0xffff,
  3321. 1, 1, (u16 *)&tape->caps[14], NULL);
  3322. ide_add_setting(drive, "stage", SETTING_READ, TYPE_INT, 0, 0xffff, 1, 1024, &tape->stage_size, NULL);
  3323. ide_add_setting(drive, "tdsc", SETTING_RW, TYPE_INT, IDETAPE_DSC_RW_MIN, IDETAPE_DSC_RW_MAX, 1000, HZ, &tape->best_dsc_rw_frequency, NULL);
  3324. ide_add_setting(drive, "dsc_overlap", SETTING_RW, TYPE_BYTE, 0, 1, 1, 1, &drive->dsc_overlap, NULL);
  3325. ide_add_setting(drive, "pipeline_head_speed_c",SETTING_READ, TYPE_INT, 0, 0xffff, 1, 1, &tape->controlled_pipeline_head_speed, NULL);
  3326. ide_add_setting(drive, "pipeline_head_speed_u",SETTING_READ, TYPE_INT, 0, 0xffff, 1, 1, &tape->uncontrolled_pipeline_head_speed,NULL);
  3327. ide_add_setting(drive, "avg_speed", SETTING_READ, TYPE_INT, 0, 0xffff, 1, 1, &tape->avg_speed, NULL);
  3328. ide_add_setting(drive, "debug_level", SETTING_RW, TYPE_INT, 0, 0xffff, 1, 1, &tape->debug_level, NULL);
  3329. }
  3330. #else
  3331. static inline void idetape_add_settings(ide_drive_t *drive) { ; }
  3332. #endif
  3333. /*
  3334. * ide_setup is called to:
  3335. *
  3336. * 1. Initialize our various state variables.
  3337. * 2. Ask the tape for its capabilities.
  3338. * 3. Allocate a buffer which will be used for data
  3339. * transfer. The buffer size is chosen based on
  3340. * the recommendation which we received in step (2).
  3341. *
  3342. * Note that at this point ide.c already assigned us an irq, so that
  3343. * we can queue requests here and wait for their completion.
  3344. */
  3345. static void idetape_setup (ide_drive_t *drive, idetape_tape_t *tape, int minor)
  3346. {
  3347. unsigned long t1, tmid, tn, t;
  3348. int speed;
  3349. struct idetape_id_gcw gcw;
  3350. int stage_size;
  3351. struct sysinfo si;
  3352. u16 *ctl = (u16 *)&tape->caps[12];
  3353. spin_lock_init(&tape->spinlock);
  3354. drive->dsc_overlap = 1;
  3355. if (drive->hwif->host_flags & IDE_HFLAG_NO_DSC) {
  3356. printk(KERN_INFO "ide-tape: %s: disabling DSC overlap\n",
  3357. tape->name);
  3358. drive->dsc_overlap = 0;
  3359. }
  3360. /* Seagate Travan drives do not support DSC overlap. */
  3361. if (strstr(drive->id->model, "Seagate STT3401"))
  3362. drive->dsc_overlap = 0;
  3363. tape->minor = minor;
  3364. tape->name[0] = 'h';
  3365. tape->name[1] = 't';
  3366. tape->name[2] = '0' + minor;
  3367. tape->chrdev_direction = idetape_direction_none;
  3368. tape->pc = tape->pc_stack;
  3369. tape->max_insert_speed = 10000;
  3370. tape->speed_control = 1;
  3371. *((unsigned short *) &gcw) = drive->id->config;
  3372. if (gcw.drq_type == 1)
  3373. set_bit(IDETAPE_DRQ_INTERRUPT, &tape->flags);
  3374. tape->min_pipeline = tape->max_pipeline = tape->max_stages = 10;
  3375. idetape_get_inquiry_results(drive);
  3376. idetape_get_mode_sense_results(drive);
  3377. ide_tape_get_bsize_from_bdesc(drive);
  3378. tape->user_bs_factor = 1;
  3379. tape->stage_size = *ctl * tape->tape_block_size;
  3380. while (tape->stage_size > 0xffff) {
  3381. printk(KERN_NOTICE "ide-tape: decreasing stage size\n");
  3382. *ctl /= 2;
  3383. tape->stage_size = *ctl * tape->tape_block_size;
  3384. }
  3385. stage_size = tape->stage_size;
  3386. tape->pages_per_stage = stage_size / PAGE_SIZE;
  3387. if (stage_size % PAGE_SIZE) {
  3388. tape->pages_per_stage++;
  3389. tape->excess_bh_size = PAGE_SIZE - stage_size % PAGE_SIZE;
  3390. }
  3391. /* Select the "best" DSC read/write polling freq and pipeline size. */
  3392. speed = max(*(u16 *)&tape->caps[14], *(u16 *)&tape->caps[8]);
  3393. tape->max_stages = speed * 1000 * 10 / tape->stage_size;
  3394. /*
  3395. * Limit memory use for pipeline to 10% of physical memory
  3396. */
  3397. si_meminfo(&si);
  3398. if (tape->max_stages * tape->stage_size > si.totalram * si.mem_unit / 10)
  3399. tape->max_stages = si.totalram * si.mem_unit / (10 * tape->stage_size);
  3400. tape->max_stages = min(tape->max_stages, IDETAPE_MAX_PIPELINE_STAGES);
  3401. tape->min_pipeline = min(tape->max_stages, IDETAPE_MIN_PIPELINE_STAGES);
  3402. tape->max_pipeline = min(tape->max_stages * 2, IDETAPE_MAX_PIPELINE_STAGES);
  3403. if (tape->max_stages == 0)
  3404. tape->max_stages = tape->min_pipeline = tape->max_pipeline = 1;
  3405. t1 = (tape->stage_size * HZ) / (speed * 1000);
  3406. tmid = (*(u16 *)&tape->caps[16] * 32 * HZ) / (speed * 125);
  3407. tn = (IDETAPE_FIFO_THRESHOLD * tape->stage_size * HZ) / (speed * 1000);
  3408. if (tape->max_stages)
  3409. t = tn;
  3410. else
  3411. t = t1;
  3412. /*
  3413. * Ensure that the number we got makes sense; limit
  3414. * it within IDETAPE_DSC_RW_MIN and IDETAPE_DSC_RW_MAX.
  3415. */
  3416. tape->best_dsc_rw_frequency = max_t(unsigned long, min_t(unsigned long, t, IDETAPE_DSC_RW_MAX), IDETAPE_DSC_RW_MIN);
  3417. printk(KERN_INFO "ide-tape: %s <-> %s: %dKBps, %d*%dkB buffer, "
  3418. "%dkB pipeline, %lums tDSC%s\n",
  3419. drive->name, tape->name, *(u16 *)&tape->caps[14],
  3420. (*(u16 *)&tape->caps[16] * 512) / tape->stage_size,
  3421. tape->stage_size / 1024,
  3422. tape->max_stages * tape->stage_size / 1024,
  3423. tape->best_dsc_rw_frequency * 1000 / HZ,
  3424. drive->using_dma ? ", DMA":"");
  3425. idetape_add_settings(drive);
  3426. }
  3427. static void ide_tape_remove(ide_drive_t *drive)
  3428. {
  3429. idetape_tape_t *tape = drive->driver_data;
  3430. ide_proc_unregister_driver(drive, tape->driver);
  3431. ide_unregister_region(tape->disk);
  3432. ide_tape_put(tape);
  3433. }
  3434. static void ide_tape_release(struct kref *kref)
  3435. {
  3436. struct ide_tape_obj *tape = to_ide_tape(kref);
  3437. ide_drive_t *drive = tape->drive;
  3438. struct gendisk *g = tape->disk;
  3439. BUG_ON(tape->first_stage != NULL || tape->merge_stage_size);
  3440. drive->dsc_overlap = 0;
  3441. drive->driver_data = NULL;
  3442. device_destroy(idetape_sysfs_class, MKDEV(IDETAPE_MAJOR, tape->minor));
  3443. device_destroy(idetape_sysfs_class, MKDEV(IDETAPE_MAJOR, tape->minor + 128));
  3444. idetape_devs[tape->minor] = NULL;
  3445. g->private_data = NULL;
  3446. put_disk(g);
  3447. kfree(tape);
  3448. }
  3449. #ifdef CONFIG_IDE_PROC_FS
  3450. static int proc_idetape_read_name
  3451. (char *page, char **start, off_t off, int count, int *eof, void *data)
  3452. {
  3453. ide_drive_t *drive = (ide_drive_t *) data;
  3454. idetape_tape_t *tape = drive->driver_data;
  3455. char *out = page;
  3456. int len;
  3457. len = sprintf(out, "%s\n", tape->name);
  3458. PROC_IDE_READ_RETURN(page, start, off, count, eof, len);
  3459. }
  3460. static ide_proc_entry_t idetape_proc[] = {
  3461. { "capacity", S_IFREG|S_IRUGO, proc_ide_read_capacity, NULL },
  3462. { "name", S_IFREG|S_IRUGO, proc_idetape_read_name, NULL },
  3463. { NULL, 0, NULL, NULL }
  3464. };
  3465. #endif
  3466. static int ide_tape_probe(ide_drive_t *);
  3467. static ide_driver_t idetape_driver = {
  3468. .gen_driver = {
  3469. .owner = THIS_MODULE,
  3470. .name = "ide-tape",
  3471. .bus = &ide_bus_type,
  3472. },
  3473. .probe = ide_tape_probe,
  3474. .remove = ide_tape_remove,
  3475. .version = IDETAPE_VERSION,
  3476. .media = ide_tape,
  3477. .supports_dsc_overlap = 1,
  3478. .do_request = idetape_do_request,
  3479. .end_request = idetape_end_request,
  3480. .error = __ide_error,
  3481. .abort = __ide_abort,
  3482. #ifdef CONFIG_IDE_PROC_FS
  3483. .proc = idetape_proc,
  3484. #endif
  3485. };
  3486. /*
  3487. * Our character device supporting functions, passed to register_chrdev.
  3488. */
  3489. static const struct file_operations idetape_fops = {
  3490. .owner = THIS_MODULE,
  3491. .read = idetape_chrdev_read,
  3492. .write = idetape_chrdev_write,
  3493. .ioctl = idetape_chrdev_ioctl,
  3494. .open = idetape_chrdev_open,
  3495. .release = idetape_chrdev_release,
  3496. };
  3497. static int idetape_open(struct inode *inode, struct file *filp)
  3498. {
  3499. struct gendisk *disk = inode->i_bdev->bd_disk;
  3500. struct ide_tape_obj *tape;
  3501. if (!(tape = ide_tape_get(disk)))
  3502. return -ENXIO;
  3503. return 0;
  3504. }
  3505. static int idetape_release(struct inode *inode, struct file *filp)
  3506. {
  3507. struct gendisk *disk = inode->i_bdev->bd_disk;
  3508. struct ide_tape_obj *tape = ide_tape_g(disk);
  3509. ide_tape_put(tape);
  3510. return 0;
  3511. }
  3512. static int idetape_ioctl(struct inode *inode, struct file *file,
  3513. unsigned int cmd, unsigned long arg)
  3514. {
  3515. struct block_device *bdev = inode->i_bdev;
  3516. struct ide_tape_obj *tape = ide_tape_g(bdev->bd_disk);
  3517. ide_drive_t *drive = tape->drive;
  3518. int err = generic_ide_ioctl(drive, file, bdev, cmd, arg);
  3519. if (err == -EINVAL)
  3520. err = idetape_blkdev_ioctl(drive, cmd, arg);
  3521. return err;
  3522. }
  3523. static struct block_device_operations idetape_block_ops = {
  3524. .owner = THIS_MODULE,
  3525. .open = idetape_open,
  3526. .release = idetape_release,
  3527. .ioctl = idetape_ioctl,
  3528. };
  3529. static int ide_tape_probe(ide_drive_t *drive)
  3530. {
  3531. idetape_tape_t *tape;
  3532. struct gendisk *g;
  3533. int minor;
  3534. if (!strstr("ide-tape", drive->driver_req))
  3535. goto failed;
  3536. if (!drive->present)
  3537. goto failed;
  3538. if (drive->media != ide_tape)
  3539. goto failed;
  3540. if (!idetape_identify_device (drive)) {
  3541. printk(KERN_ERR "ide-tape: %s: not supported by this version of ide-tape\n", drive->name);
  3542. goto failed;
  3543. }
  3544. if (drive->scsi) {
  3545. printk("ide-tape: passing drive %s to ide-scsi emulation.\n", drive->name);
  3546. goto failed;
  3547. }
  3548. if (strstr(drive->id->model, "OnStream DI-")) {
  3549. printk(KERN_WARNING "ide-tape: Use drive %s with ide-scsi emulation and osst.\n", drive->name);
  3550. printk(KERN_WARNING "ide-tape: OnStream support will be removed soon from ide-tape!\n");
  3551. }
  3552. tape = kzalloc(sizeof (idetape_tape_t), GFP_KERNEL);
  3553. if (tape == NULL) {
  3554. printk(KERN_ERR "ide-tape: %s: Can't allocate a tape structure\n", drive->name);
  3555. goto failed;
  3556. }
  3557. g = alloc_disk(1 << PARTN_BITS);
  3558. if (!g)
  3559. goto out_free_tape;
  3560. ide_init_disk(g, drive);
  3561. ide_proc_register_driver(drive, &idetape_driver);
  3562. kref_init(&tape->kref);
  3563. tape->drive = drive;
  3564. tape->driver = &idetape_driver;
  3565. tape->disk = g;
  3566. g->private_data = &tape->driver;
  3567. drive->driver_data = tape;
  3568. mutex_lock(&idetape_ref_mutex);
  3569. for (minor = 0; idetape_devs[minor]; minor++)
  3570. ;
  3571. idetape_devs[minor] = tape;
  3572. mutex_unlock(&idetape_ref_mutex);
  3573. idetape_setup(drive, tape, minor);
  3574. device_create(idetape_sysfs_class, &drive->gendev,
  3575. MKDEV(IDETAPE_MAJOR, minor), "%s", tape->name);
  3576. device_create(idetape_sysfs_class, &drive->gendev,
  3577. MKDEV(IDETAPE_MAJOR, minor + 128), "n%s", tape->name);
  3578. g->fops = &idetape_block_ops;
  3579. ide_register_region(g);
  3580. return 0;
  3581. out_free_tape:
  3582. kfree(tape);
  3583. failed:
  3584. return -ENODEV;
  3585. }
  3586. MODULE_DESCRIPTION("ATAPI Streaming TAPE Driver");
  3587. MODULE_LICENSE("GPL");
  3588. static void __exit idetape_exit (void)
  3589. {
  3590. driver_unregister(&idetape_driver.gen_driver);
  3591. class_destroy(idetape_sysfs_class);
  3592. unregister_chrdev(IDETAPE_MAJOR, "ht");
  3593. }
  3594. static int __init idetape_init(void)
  3595. {
  3596. int error = 1;
  3597. idetape_sysfs_class = class_create(THIS_MODULE, "ide_tape");
  3598. if (IS_ERR(idetape_sysfs_class)) {
  3599. idetape_sysfs_class = NULL;
  3600. printk(KERN_ERR "Unable to create sysfs class for ide tapes\n");
  3601. error = -EBUSY;
  3602. goto out;
  3603. }
  3604. if (register_chrdev(IDETAPE_MAJOR, "ht", &idetape_fops)) {
  3605. printk(KERN_ERR "ide-tape: Failed to register character device interface\n");
  3606. error = -EBUSY;
  3607. goto out_free_class;
  3608. }
  3609. error = driver_register(&idetape_driver.gen_driver);
  3610. if (error)
  3611. goto out_free_driver;
  3612. return 0;
  3613. out_free_driver:
  3614. driver_unregister(&idetape_driver.gen_driver);
  3615. out_free_class:
  3616. class_destroy(idetape_sysfs_class);
  3617. out:
  3618. return error;
  3619. }
  3620. MODULE_ALIAS("ide:*m-tape*");
  3621. module_init(idetape_init);
  3622. module_exit(idetape_exit);
  3623. MODULE_ALIAS_CHARDEV_MAJOR(IDETAPE_MAJOR);