ide-tape.c 112 KB

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