ide-tape.c 113 KB

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