xfs_bmap_btree.c 74 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768
  1. /*
  2. * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
  3. * All Rights Reserved.
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU General Public License as
  7. * published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it would be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write the Free Software Foundation,
  16. * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #include "xfs.h"
  19. #include "xfs_fs.h"
  20. #include "xfs_types.h"
  21. #include "xfs_bit.h"
  22. #include "xfs_log.h"
  23. #include "xfs_inum.h"
  24. #include "xfs_trans.h"
  25. #include "xfs_sb.h"
  26. #include "xfs_ag.h"
  27. #include "xfs_dir2.h"
  28. #include "xfs_dmapi.h"
  29. #include "xfs_mount.h"
  30. #include "xfs_bmap_btree.h"
  31. #include "xfs_alloc_btree.h"
  32. #include "xfs_ialloc_btree.h"
  33. #include "xfs_dir2_sf.h"
  34. #include "xfs_attr_sf.h"
  35. #include "xfs_dinode.h"
  36. #include "xfs_inode.h"
  37. #include "xfs_inode_item.h"
  38. #include "xfs_alloc.h"
  39. #include "xfs_btree.h"
  40. #include "xfs_ialloc.h"
  41. #include "xfs_itable.h"
  42. #include "xfs_bmap.h"
  43. #include "xfs_error.h"
  44. #include "xfs_quota.h"
  45. #if defined(XFS_BMBT_TRACE)
  46. ktrace_t *xfs_bmbt_trace_buf;
  47. #endif
  48. /*
  49. * Prototypes for internal btree functions.
  50. */
  51. STATIC int xfs_bmbt_killroot(xfs_btree_cur_t *);
  52. STATIC void xfs_bmbt_log_keys(xfs_btree_cur_t *, xfs_buf_t *, int, int);
  53. STATIC void xfs_bmbt_log_ptrs(xfs_btree_cur_t *, xfs_buf_t *, int, int);
  54. STATIC int xfs_bmbt_lshift(xfs_btree_cur_t *, int, int *);
  55. STATIC int xfs_bmbt_rshift(xfs_btree_cur_t *, int, int *);
  56. STATIC int xfs_bmbt_split(xfs_btree_cur_t *, int, xfs_fsblock_t *,
  57. __uint64_t *, xfs_btree_cur_t **, int *);
  58. STATIC int xfs_bmbt_updkey(xfs_btree_cur_t *, xfs_bmbt_key_t *, int);
  59. #if defined(XFS_BMBT_TRACE)
  60. static char ARGS[] = "args";
  61. static char ENTRY[] = "entry";
  62. static char ERROR[] = "error";
  63. #undef EXIT
  64. static char EXIT[] = "exit";
  65. /*
  66. * Add a trace buffer entry for the arguments given to the routine,
  67. * generic form.
  68. */
  69. STATIC void
  70. xfs_bmbt_trace_enter(
  71. char *func,
  72. xfs_btree_cur_t *cur,
  73. char *s,
  74. int type,
  75. int line,
  76. __psunsigned_t a0,
  77. __psunsigned_t a1,
  78. __psunsigned_t a2,
  79. __psunsigned_t a3,
  80. __psunsigned_t a4,
  81. __psunsigned_t a5,
  82. __psunsigned_t a6,
  83. __psunsigned_t a7,
  84. __psunsigned_t a8,
  85. __psunsigned_t a9,
  86. __psunsigned_t a10)
  87. {
  88. xfs_inode_t *ip;
  89. int whichfork;
  90. ip = cur->bc_private.b.ip;
  91. whichfork = cur->bc_private.b.whichfork;
  92. ktrace_enter(xfs_bmbt_trace_buf,
  93. (void *)((__psint_t)type | (whichfork << 8) | (line << 16)),
  94. (void *)func, (void *)s, (void *)ip, (void *)cur,
  95. (void *)a0, (void *)a1, (void *)a2, (void *)a3,
  96. (void *)a4, (void *)a5, (void *)a6, (void *)a7,
  97. (void *)a8, (void *)a9, (void *)a10);
  98. ASSERT(ip->i_btrace);
  99. ktrace_enter(ip->i_btrace,
  100. (void *)((__psint_t)type | (whichfork << 8) | (line << 16)),
  101. (void *)func, (void *)s, (void *)ip, (void *)cur,
  102. (void *)a0, (void *)a1, (void *)a2, (void *)a3,
  103. (void *)a4, (void *)a5, (void *)a6, (void *)a7,
  104. (void *)a8, (void *)a9, (void *)a10);
  105. }
  106. /*
  107. * Add a trace buffer entry for arguments, for a buffer & 1 integer arg.
  108. */
  109. STATIC void
  110. xfs_bmbt_trace_argbi(
  111. char *func,
  112. xfs_btree_cur_t *cur,
  113. xfs_buf_t *b,
  114. int i,
  115. int line)
  116. {
  117. xfs_bmbt_trace_enter(func, cur, ARGS, XFS_BMBT_KTRACE_ARGBI, line,
  118. (__psunsigned_t)b, i, 0, 0,
  119. 0, 0, 0, 0,
  120. 0, 0, 0);
  121. }
  122. /*
  123. * Add a trace buffer entry for arguments, for a buffer & 2 integer args.
  124. */
  125. STATIC void
  126. xfs_bmbt_trace_argbii(
  127. char *func,
  128. xfs_btree_cur_t *cur,
  129. xfs_buf_t *b,
  130. int i0,
  131. int i1,
  132. int line)
  133. {
  134. xfs_bmbt_trace_enter(func, cur, ARGS, XFS_BMBT_KTRACE_ARGBII, line,
  135. (__psunsigned_t)b, i0, i1, 0,
  136. 0, 0, 0, 0,
  137. 0, 0, 0);
  138. }
  139. /*
  140. * Add a trace buffer entry for arguments, for 3 block-length args
  141. * and an integer arg.
  142. */
  143. STATIC void
  144. xfs_bmbt_trace_argfffi(
  145. char *func,
  146. xfs_btree_cur_t *cur,
  147. xfs_dfiloff_t o,
  148. xfs_dfsbno_t b,
  149. xfs_dfilblks_t i,
  150. int j,
  151. int line)
  152. {
  153. xfs_bmbt_trace_enter(func, cur, ARGS, XFS_BMBT_KTRACE_ARGFFFI, line,
  154. o >> 32, (int)o, b >> 32, (int)b,
  155. i >> 32, (int)i, (int)j, 0,
  156. 0, 0, 0);
  157. }
  158. /*
  159. * Add a trace buffer entry for arguments, for one integer arg.
  160. */
  161. STATIC void
  162. xfs_bmbt_trace_argi(
  163. char *func,
  164. xfs_btree_cur_t *cur,
  165. int i,
  166. int line)
  167. {
  168. xfs_bmbt_trace_enter(func, cur, ARGS, XFS_BMBT_KTRACE_ARGI, line,
  169. i, 0, 0, 0,
  170. 0, 0, 0, 0,
  171. 0, 0, 0);
  172. }
  173. /*
  174. * Add a trace buffer entry for arguments, for int, fsblock, key.
  175. */
  176. STATIC void
  177. xfs_bmbt_trace_argifk(
  178. char *func,
  179. xfs_btree_cur_t *cur,
  180. int i,
  181. xfs_fsblock_t f,
  182. xfs_dfiloff_t o,
  183. int line)
  184. {
  185. xfs_bmbt_trace_enter(func, cur, ARGS, XFS_BMBT_KTRACE_ARGIFK, line,
  186. i, (xfs_dfsbno_t)f >> 32, (int)f, o >> 32,
  187. (int)o, 0, 0, 0,
  188. 0, 0, 0);
  189. }
  190. /*
  191. * Add a trace buffer entry for arguments, for int, fsblock, rec.
  192. */
  193. STATIC void
  194. xfs_bmbt_trace_argifr(
  195. char *func,
  196. xfs_btree_cur_t *cur,
  197. int i,
  198. xfs_fsblock_t f,
  199. xfs_bmbt_rec_t *r,
  200. int line)
  201. {
  202. xfs_dfsbno_t b;
  203. xfs_dfilblks_t c;
  204. xfs_dfsbno_t d;
  205. xfs_dfiloff_t o;
  206. xfs_bmbt_irec_t s;
  207. d = (xfs_dfsbno_t)f;
  208. xfs_bmbt_disk_get_all(r, &s);
  209. o = (xfs_dfiloff_t)s.br_startoff;
  210. b = (xfs_dfsbno_t)s.br_startblock;
  211. c = s.br_blockcount;
  212. xfs_bmbt_trace_enter(func, cur, ARGS, XFS_BMBT_KTRACE_ARGIFR, line,
  213. i, d >> 32, (int)d, o >> 32,
  214. (int)o, b >> 32, (int)b, c >> 32,
  215. (int)c, 0, 0);
  216. }
  217. /*
  218. * Add a trace buffer entry for arguments, for int, key.
  219. */
  220. STATIC void
  221. xfs_bmbt_trace_argik(
  222. char *func,
  223. xfs_btree_cur_t *cur,
  224. int i,
  225. xfs_bmbt_key_t *k,
  226. int line)
  227. {
  228. xfs_dfiloff_t o;
  229. o = be64_to_cpu(k->br_startoff);
  230. xfs_bmbt_trace_enter(func, cur, ARGS, XFS_BMBT_KTRACE_ARGIFK, line,
  231. i, o >> 32, (int)o, 0,
  232. 0, 0, 0, 0,
  233. 0, 0, 0);
  234. }
  235. /*
  236. * Add a trace buffer entry for the cursor/operation.
  237. */
  238. STATIC void
  239. xfs_bmbt_trace_cursor(
  240. char *func,
  241. xfs_btree_cur_t *cur,
  242. char *s,
  243. int line)
  244. {
  245. xfs_bmbt_rec_t r;
  246. xfs_bmbt_set_all(&r, &cur->bc_rec.b);
  247. xfs_bmbt_trace_enter(func, cur, s, XFS_BMBT_KTRACE_CUR, line,
  248. (cur->bc_nlevels << 24) | (cur->bc_private.b.flags << 16) |
  249. cur->bc_private.b.allocated,
  250. INT_GET(r.l0, ARCH_CONVERT) >> 32, (int)INT_GET(r.l0, ARCH_CONVERT), INT_GET(r.l1, ARCH_CONVERT) >> 32, (int)INT_GET(r.l1, ARCH_CONVERT),
  251. (unsigned long)cur->bc_bufs[0], (unsigned long)cur->bc_bufs[1],
  252. (unsigned long)cur->bc_bufs[2], (unsigned long)cur->bc_bufs[3],
  253. (cur->bc_ptrs[0] << 16) | cur->bc_ptrs[1],
  254. (cur->bc_ptrs[2] << 16) | cur->bc_ptrs[3]);
  255. }
  256. #define XFS_BMBT_TRACE_ARGBI(c,b,i) \
  257. xfs_bmbt_trace_argbi(fname, c, b, i, __LINE__)
  258. #define XFS_BMBT_TRACE_ARGBII(c,b,i,j) \
  259. xfs_bmbt_trace_argbii(fname, c, b, i, j, __LINE__)
  260. #define XFS_BMBT_TRACE_ARGFFFI(c,o,b,i,j) \
  261. xfs_bmbt_trace_argfffi(fname, c, o, b, i, j, __LINE__)
  262. #define XFS_BMBT_TRACE_ARGI(c,i) \
  263. xfs_bmbt_trace_argi(fname, c, i, __LINE__)
  264. #define XFS_BMBT_TRACE_ARGIFK(c,i,f,s) \
  265. xfs_bmbt_trace_argifk(fname, c, i, f, s, __LINE__)
  266. #define XFS_BMBT_TRACE_ARGIFR(c,i,f,r) \
  267. xfs_bmbt_trace_argifr(fname, c, i, f, r, __LINE__)
  268. #define XFS_BMBT_TRACE_ARGIK(c,i,k) \
  269. xfs_bmbt_trace_argik(fname, c, i, k, __LINE__)
  270. #define XFS_BMBT_TRACE_CURSOR(c,s) \
  271. xfs_bmbt_trace_cursor(fname, c, s, __LINE__)
  272. #else
  273. #define XFS_BMBT_TRACE_ARGBI(c,b,i)
  274. #define XFS_BMBT_TRACE_ARGBII(c,b,i,j)
  275. #define XFS_BMBT_TRACE_ARGFFFI(c,o,b,i,j)
  276. #define XFS_BMBT_TRACE_ARGI(c,i)
  277. #define XFS_BMBT_TRACE_ARGIFK(c,i,f,s)
  278. #define XFS_BMBT_TRACE_ARGIFR(c,i,f,r)
  279. #define XFS_BMBT_TRACE_ARGIK(c,i,k)
  280. #define XFS_BMBT_TRACE_CURSOR(c,s)
  281. #endif /* XFS_BMBT_TRACE */
  282. /*
  283. * Internal functions.
  284. */
  285. /*
  286. * Delete record pointed to by cur/level.
  287. */
  288. STATIC int /* error */
  289. xfs_bmbt_delrec(
  290. xfs_btree_cur_t *cur,
  291. int level,
  292. int *stat) /* success/failure */
  293. {
  294. xfs_bmbt_block_t *block; /* bmap btree block */
  295. xfs_fsblock_t bno; /* fs-relative block number */
  296. xfs_buf_t *bp; /* buffer for block */
  297. int error; /* error return value */
  298. #ifdef XFS_BMBT_TRACE
  299. static char fname[] = "xfs_bmbt_delrec";
  300. #endif
  301. int i; /* loop counter */
  302. int j; /* temp state */
  303. xfs_bmbt_key_t key; /* bmap btree key */
  304. xfs_bmbt_key_t *kp=NULL; /* pointer to bmap btree key */
  305. xfs_fsblock_t lbno; /* left sibling block number */
  306. xfs_buf_t *lbp; /* left buffer pointer */
  307. xfs_bmbt_block_t *left; /* left btree block */
  308. xfs_bmbt_key_t *lkp; /* left btree key */
  309. xfs_bmbt_ptr_t *lpp; /* left address pointer */
  310. int lrecs=0; /* left record count */
  311. xfs_bmbt_rec_t *lrp; /* left record pointer */
  312. xfs_mount_t *mp; /* file system mount point */
  313. xfs_bmbt_ptr_t *pp; /* pointer to bmap block addr */
  314. int ptr; /* key/record index */
  315. xfs_fsblock_t rbno; /* right sibling block number */
  316. xfs_buf_t *rbp; /* right buffer pointer */
  317. xfs_bmbt_block_t *right; /* right btree block */
  318. xfs_bmbt_key_t *rkp; /* right btree key */
  319. xfs_bmbt_rec_t *rp; /* pointer to bmap btree rec */
  320. xfs_bmbt_ptr_t *rpp; /* right address pointer */
  321. xfs_bmbt_block_t *rrblock; /* right-right btree block */
  322. xfs_buf_t *rrbp; /* right-right buffer pointer */
  323. int rrecs=0; /* right record count */
  324. xfs_bmbt_rec_t *rrp; /* right record pointer */
  325. xfs_btree_cur_t *tcur; /* temporary btree cursor */
  326. int numrecs; /* temporary numrec count */
  327. int numlrecs, numrrecs;
  328. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  329. XFS_BMBT_TRACE_ARGI(cur, level);
  330. ptr = cur->bc_ptrs[level];
  331. tcur = NULL;
  332. if (ptr == 0) {
  333. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  334. *stat = 0;
  335. return 0;
  336. }
  337. block = xfs_bmbt_get_block(cur, level, &bp);
  338. numrecs = be16_to_cpu(block->bb_numrecs);
  339. #ifdef DEBUG
  340. if ((error = xfs_btree_check_lblock(cur, block, level, bp))) {
  341. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  342. goto error0;
  343. }
  344. #endif
  345. if (ptr > numrecs) {
  346. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  347. *stat = 0;
  348. return 0;
  349. }
  350. XFS_STATS_INC(xs_bmbt_delrec);
  351. if (level > 0) {
  352. kp = XFS_BMAP_KEY_IADDR(block, 1, cur);
  353. pp = XFS_BMAP_PTR_IADDR(block, 1, cur);
  354. #ifdef DEBUG
  355. for (i = ptr; i < numrecs; i++) {
  356. if ((error = xfs_btree_check_lptr_disk(cur, pp[i], level))) {
  357. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  358. goto error0;
  359. }
  360. }
  361. #endif
  362. if (ptr < numrecs) {
  363. memmove(&kp[ptr - 1], &kp[ptr],
  364. (numrecs - ptr) * sizeof(*kp));
  365. memmove(&pp[ptr - 1], &pp[ptr], /* INT_: direct copy */
  366. (numrecs - ptr) * sizeof(*pp));
  367. xfs_bmbt_log_ptrs(cur, bp, ptr, numrecs - 1);
  368. xfs_bmbt_log_keys(cur, bp, ptr, numrecs - 1);
  369. }
  370. } else {
  371. rp = XFS_BMAP_REC_IADDR(block, 1, cur);
  372. if (ptr < numrecs) {
  373. memmove(&rp[ptr - 1], &rp[ptr],
  374. (numrecs - ptr) * sizeof(*rp));
  375. xfs_bmbt_log_recs(cur, bp, ptr, numrecs - 1);
  376. }
  377. if (ptr == 1) {
  378. key.br_startoff =
  379. cpu_to_be64(xfs_bmbt_disk_get_startoff(rp));
  380. kp = &key;
  381. }
  382. }
  383. numrecs--;
  384. block->bb_numrecs = cpu_to_be16(numrecs);
  385. xfs_bmbt_log_block(cur, bp, XFS_BB_NUMRECS);
  386. /*
  387. * We're at the root level.
  388. * First, shrink the root block in-memory.
  389. * Try to get rid of the next level down.
  390. * If we can't then there's nothing left to do.
  391. */
  392. if (level == cur->bc_nlevels - 1) {
  393. xfs_iroot_realloc(cur->bc_private.b.ip, -1,
  394. cur->bc_private.b.whichfork);
  395. if ((error = xfs_bmbt_killroot(cur))) {
  396. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  397. goto error0;
  398. }
  399. if (level > 0 && (error = xfs_bmbt_decrement(cur, level, &j))) {
  400. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  401. goto error0;
  402. }
  403. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  404. *stat = 1;
  405. return 0;
  406. }
  407. if (ptr == 1 && (error = xfs_bmbt_updkey(cur, kp, level + 1))) {
  408. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  409. goto error0;
  410. }
  411. if (numrecs >= XFS_BMAP_BLOCK_IMINRECS(level, cur)) {
  412. if (level > 0 && (error = xfs_bmbt_decrement(cur, level, &j))) {
  413. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  414. goto error0;
  415. }
  416. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  417. *stat = 1;
  418. return 0;
  419. }
  420. rbno = be64_to_cpu(block->bb_rightsib);
  421. lbno = be64_to_cpu(block->bb_leftsib);
  422. /*
  423. * One child of root, need to get a chance to copy its contents
  424. * into the root and delete it. Can't go up to next level,
  425. * there's nothing to delete there.
  426. */
  427. if (lbno == NULLFSBLOCK && rbno == NULLFSBLOCK &&
  428. level == cur->bc_nlevels - 2) {
  429. if ((error = xfs_bmbt_killroot(cur))) {
  430. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  431. goto error0;
  432. }
  433. if (level > 0 && (error = xfs_bmbt_decrement(cur, level, &i))) {
  434. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  435. goto error0;
  436. }
  437. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  438. *stat = 1;
  439. return 0;
  440. }
  441. ASSERT(rbno != NULLFSBLOCK || lbno != NULLFSBLOCK);
  442. if ((error = xfs_btree_dup_cursor(cur, &tcur))) {
  443. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  444. goto error0;
  445. }
  446. bno = NULLFSBLOCK;
  447. if (rbno != NULLFSBLOCK) {
  448. i = xfs_btree_lastrec(tcur, level);
  449. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  450. if ((error = xfs_bmbt_increment(tcur, level, &i))) {
  451. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  452. goto error0;
  453. }
  454. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  455. i = xfs_btree_lastrec(tcur, level);
  456. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  457. rbp = tcur->bc_bufs[level];
  458. right = XFS_BUF_TO_BMBT_BLOCK(rbp);
  459. #ifdef DEBUG
  460. if ((error = xfs_btree_check_lblock(cur, right, level, rbp))) {
  461. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  462. goto error0;
  463. }
  464. #endif
  465. bno = be64_to_cpu(right->bb_leftsib);
  466. if (be16_to_cpu(right->bb_numrecs) - 1 >=
  467. XFS_BMAP_BLOCK_IMINRECS(level, cur)) {
  468. if ((error = xfs_bmbt_lshift(tcur, level, &i))) {
  469. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  470. goto error0;
  471. }
  472. if (i) {
  473. ASSERT(be16_to_cpu(block->bb_numrecs) >=
  474. XFS_BMAP_BLOCK_IMINRECS(level, tcur));
  475. xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
  476. tcur = NULL;
  477. if (level > 0) {
  478. if ((error = xfs_bmbt_decrement(cur,
  479. level, &i))) {
  480. XFS_BMBT_TRACE_CURSOR(cur,
  481. ERROR);
  482. goto error0;
  483. }
  484. }
  485. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  486. *stat = 1;
  487. return 0;
  488. }
  489. }
  490. rrecs = be16_to_cpu(right->bb_numrecs);
  491. if (lbno != NULLFSBLOCK) {
  492. i = xfs_btree_firstrec(tcur, level);
  493. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  494. if ((error = xfs_bmbt_decrement(tcur, level, &i))) {
  495. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  496. goto error0;
  497. }
  498. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  499. }
  500. }
  501. if (lbno != NULLFSBLOCK) {
  502. i = xfs_btree_firstrec(tcur, level);
  503. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  504. /*
  505. * decrement to last in block
  506. */
  507. if ((error = xfs_bmbt_decrement(tcur, level, &i))) {
  508. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  509. goto error0;
  510. }
  511. i = xfs_btree_firstrec(tcur, level);
  512. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  513. lbp = tcur->bc_bufs[level];
  514. left = XFS_BUF_TO_BMBT_BLOCK(lbp);
  515. #ifdef DEBUG
  516. if ((error = xfs_btree_check_lblock(cur, left, level, lbp))) {
  517. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  518. goto error0;
  519. }
  520. #endif
  521. bno = be64_to_cpu(left->bb_rightsib);
  522. if (be16_to_cpu(left->bb_numrecs) - 1 >=
  523. XFS_BMAP_BLOCK_IMINRECS(level, cur)) {
  524. if ((error = xfs_bmbt_rshift(tcur, level, &i))) {
  525. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  526. goto error0;
  527. }
  528. if (i) {
  529. ASSERT(be16_to_cpu(block->bb_numrecs) >=
  530. XFS_BMAP_BLOCK_IMINRECS(level, tcur));
  531. xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
  532. tcur = NULL;
  533. if (level == 0)
  534. cur->bc_ptrs[0]++;
  535. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  536. *stat = 1;
  537. return 0;
  538. }
  539. }
  540. lrecs = be16_to_cpu(left->bb_numrecs);
  541. }
  542. xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
  543. tcur = NULL;
  544. mp = cur->bc_mp;
  545. ASSERT(bno != NULLFSBLOCK);
  546. if (lbno != NULLFSBLOCK &&
  547. lrecs + be16_to_cpu(block->bb_numrecs) <= XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
  548. rbno = bno;
  549. right = block;
  550. rbp = bp;
  551. if ((error = xfs_btree_read_bufl(mp, cur->bc_tp, lbno, 0, &lbp,
  552. XFS_BMAP_BTREE_REF))) {
  553. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  554. goto error0;
  555. }
  556. left = XFS_BUF_TO_BMBT_BLOCK(lbp);
  557. if ((error = xfs_btree_check_lblock(cur, left, level, lbp))) {
  558. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  559. goto error0;
  560. }
  561. } else if (rbno != NULLFSBLOCK &&
  562. rrecs + be16_to_cpu(block->bb_numrecs) <=
  563. XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
  564. lbno = bno;
  565. left = block;
  566. lbp = bp;
  567. if ((error = xfs_btree_read_bufl(mp, cur->bc_tp, rbno, 0, &rbp,
  568. XFS_BMAP_BTREE_REF))) {
  569. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  570. goto error0;
  571. }
  572. right = XFS_BUF_TO_BMBT_BLOCK(rbp);
  573. if ((error = xfs_btree_check_lblock(cur, right, level, rbp))) {
  574. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  575. goto error0;
  576. }
  577. lrecs = be16_to_cpu(left->bb_numrecs);
  578. } else {
  579. if (level > 0 && (error = xfs_bmbt_decrement(cur, level, &i))) {
  580. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  581. goto error0;
  582. }
  583. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  584. *stat = 1;
  585. return 0;
  586. }
  587. numlrecs = be16_to_cpu(left->bb_numrecs);
  588. numrrecs = be16_to_cpu(right->bb_numrecs);
  589. if (level > 0) {
  590. lkp = XFS_BMAP_KEY_IADDR(left, numlrecs + 1, cur);
  591. lpp = XFS_BMAP_PTR_IADDR(left, numlrecs + 1, cur);
  592. rkp = XFS_BMAP_KEY_IADDR(right, 1, cur);
  593. rpp = XFS_BMAP_PTR_IADDR(right, 1, cur);
  594. #ifdef DEBUG
  595. for (i = 0; i < numrrecs; i++) {
  596. if ((error = xfs_btree_check_lptr_disk(cur, rpp[i], level))) {
  597. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  598. goto error0;
  599. }
  600. }
  601. #endif
  602. memcpy(lkp, rkp, numrrecs * sizeof(*lkp));
  603. memcpy(lpp, rpp, numrrecs * sizeof(*lpp));
  604. xfs_bmbt_log_keys(cur, lbp, numlrecs + 1, numlrecs + numrrecs);
  605. xfs_bmbt_log_ptrs(cur, lbp, numlrecs + 1, numlrecs + numrrecs);
  606. } else {
  607. lrp = XFS_BMAP_REC_IADDR(left, numlrecs + 1, cur);
  608. rrp = XFS_BMAP_REC_IADDR(right, 1, cur);
  609. memcpy(lrp, rrp, numrrecs * sizeof(*lrp));
  610. xfs_bmbt_log_recs(cur, lbp, numlrecs + 1, numlrecs + numrrecs);
  611. }
  612. be16_add(&left->bb_numrecs, numrrecs);
  613. left->bb_rightsib = right->bb_rightsib;
  614. xfs_bmbt_log_block(cur, lbp, XFS_BB_RIGHTSIB | XFS_BB_NUMRECS);
  615. if (be64_to_cpu(left->bb_rightsib) != NULLDFSBNO) {
  616. if ((error = xfs_btree_read_bufl(mp, cur->bc_tp,
  617. be64_to_cpu(left->bb_rightsib),
  618. 0, &rrbp, XFS_BMAP_BTREE_REF))) {
  619. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  620. goto error0;
  621. }
  622. rrblock = XFS_BUF_TO_BMBT_BLOCK(rrbp);
  623. if ((error = xfs_btree_check_lblock(cur, rrblock, level, rrbp))) {
  624. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  625. goto error0;
  626. }
  627. rrblock->bb_leftsib = cpu_to_be64(lbno);
  628. xfs_bmbt_log_block(cur, rrbp, XFS_BB_LEFTSIB);
  629. }
  630. xfs_bmap_add_free(XFS_DADDR_TO_FSB(mp, XFS_BUF_ADDR(rbp)), 1,
  631. cur->bc_private.b.flist, mp);
  632. cur->bc_private.b.ip->i_d.di_nblocks--;
  633. xfs_trans_log_inode(cur->bc_tp, cur->bc_private.b.ip, XFS_ILOG_CORE);
  634. XFS_TRANS_MOD_DQUOT_BYINO(mp, cur->bc_tp, cur->bc_private.b.ip,
  635. XFS_TRANS_DQ_BCOUNT, -1L);
  636. xfs_trans_binval(cur->bc_tp, rbp);
  637. if (bp != lbp) {
  638. cur->bc_bufs[level] = lbp;
  639. cur->bc_ptrs[level] += lrecs;
  640. cur->bc_ra[level] = 0;
  641. } else if ((error = xfs_bmbt_increment(cur, level + 1, &i))) {
  642. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  643. goto error0;
  644. }
  645. if (level > 0)
  646. cur->bc_ptrs[level]--;
  647. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  648. *stat = 2;
  649. return 0;
  650. error0:
  651. if (tcur)
  652. xfs_btree_del_cursor(tcur, XFS_BTREE_ERROR);
  653. return error;
  654. }
  655. #ifdef DEBUG
  656. /*
  657. * Get the data from the pointed-to record.
  658. */
  659. int
  660. xfs_bmbt_get_rec(
  661. xfs_btree_cur_t *cur,
  662. xfs_fileoff_t *off,
  663. xfs_fsblock_t *bno,
  664. xfs_filblks_t *len,
  665. xfs_exntst_t *state,
  666. int *stat)
  667. {
  668. xfs_bmbt_block_t *block;
  669. xfs_buf_t *bp;
  670. #ifdef DEBUG
  671. int error;
  672. #endif
  673. int ptr;
  674. xfs_bmbt_rec_t *rp;
  675. block = xfs_bmbt_get_block(cur, 0, &bp);
  676. ptr = cur->bc_ptrs[0];
  677. #ifdef DEBUG
  678. if ((error = xfs_btree_check_lblock(cur, block, 0, bp)))
  679. return error;
  680. #endif
  681. if (ptr > be16_to_cpu(block->bb_numrecs) || ptr <= 0) {
  682. *stat = 0;
  683. return 0;
  684. }
  685. rp = XFS_BMAP_REC_IADDR(block, ptr, cur);
  686. *off = xfs_bmbt_disk_get_startoff(rp);
  687. *bno = xfs_bmbt_disk_get_startblock(rp);
  688. *len = xfs_bmbt_disk_get_blockcount(rp);
  689. *state = xfs_bmbt_disk_get_state(rp);
  690. *stat = 1;
  691. return 0;
  692. }
  693. #endif
  694. /*
  695. * Insert one record/level. Return information to the caller
  696. * allowing the next level up to proceed if necessary.
  697. */
  698. STATIC int /* error */
  699. xfs_bmbt_insrec(
  700. xfs_btree_cur_t *cur,
  701. int level,
  702. xfs_fsblock_t *bnop,
  703. xfs_bmbt_rec_t *recp,
  704. xfs_btree_cur_t **curp,
  705. int *stat) /* no-go/done/continue */
  706. {
  707. xfs_bmbt_block_t *block; /* bmap btree block */
  708. xfs_buf_t *bp; /* buffer for block */
  709. int error; /* error return value */
  710. #ifdef XFS_BMBT_TRACE
  711. static char fname[] = "xfs_bmbt_insrec";
  712. #endif
  713. int i; /* loop index */
  714. xfs_bmbt_key_t key; /* bmap btree key */
  715. xfs_bmbt_key_t *kp=NULL; /* pointer to bmap btree key */
  716. int logflags; /* inode logging flags */
  717. xfs_fsblock_t nbno; /* new block number */
  718. struct xfs_btree_cur *ncur; /* new btree cursor */
  719. __uint64_t startoff; /* new btree key value */
  720. xfs_bmbt_rec_t nrec; /* new record count */
  721. int optr; /* old key/record index */
  722. xfs_bmbt_ptr_t *pp; /* pointer to bmap block addr */
  723. int ptr; /* key/record index */
  724. xfs_bmbt_rec_t *rp=NULL; /* pointer to bmap btree rec */
  725. int numrecs;
  726. ASSERT(level < cur->bc_nlevels);
  727. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  728. XFS_BMBT_TRACE_ARGIFR(cur, level, *bnop, recp);
  729. ncur = NULL;
  730. key.br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(recp));
  731. optr = ptr = cur->bc_ptrs[level];
  732. if (ptr == 0) {
  733. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  734. *stat = 0;
  735. return 0;
  736. }
  737. XFS_STATS_INC(xs_bmbt_insrec);
  738. block = xfs_bmbt_get_block(cur, level, &bp);
  739. numrecs = be16_to_cpu(block->bb_numrecs);
  740. #ifdef DEBUG
  741. if ((error = xfs_btree_check_lblock(cur, block, level, bp))) {
  742. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  743. return error;
  744. }
  745. if (ptr <= numrecs) {
  746. if (level == 0) {
  747. rp = XFS_BMAP_REC_IADDR(block, ptr, cur);
  748. xfs_btree_check_rec(XFS_BTNUM_BMAP, recp, rp);
  749. } else {
  750. kp = XFS_BMAP_KEY_IADDR(block, ptr, cur);
  751. xfs_btree_check_key(XFS_BTNUM_BMAP, &key, kp);
  752. }
  753. }
  754. #endif
  755. nbno = NULLFSBLOCK;
  756. if (numrecs == XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
  757. if (numrecs < XFS_BMAP_BLOCK_DMAXRECS(level, cur)) {
  758. /*
  759. * A root block, that can be made bigger.
  760. */
  761. xfs_iroot_realloc(cur->bc_private.b.ip, 1,
  762. cur->bc_private.b.whichfork);
  763. block = xfs_bmbt_get_block(cur, level, &bp);
  764. } else if (level == cur->bc_nlevels - 1) {
  765. if ((error = xfs_bmbt_newroot(cur, &logflags, stat)) ||
  766. *stat == 0) {
  767. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  768. return error;
  769. }
  770. xfs_trans_log_inode(cur->bc_tp, cur->bc_private.b.ip,
  771. logflags);
  772. block = xfs_bmbt_get_block(cur, level, &bp);
  773. } else {
  774. if ((error = xfs_bmbt_rshift(cur, level, &i))) {
  775. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  776. return error;
  777. }
  778. if (i) {
  779. /* nothing */
  780. } else {
  781. if ((error = xfs_bmbt_lshift(cur, level, &i))) {
  782. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  783. return error;
  784. }
  785. if (i) {
  786. optr = ptr = cur->bc_ptrs[level];
  787. } else {
  788. if ((error = xfs_bmbt_split(cur, level,
  789. &nbno, &startoff, &ncur,
  790. &i))) {
  791. XFS_BMBT_TRACE_CURSOR(cur,
  792. ERROR);
  793. return error;
  794. }
  795. if (i) {
  796. block = xfs_bmbt_get_block(
  797. cur, level, &bp);
  798. #ifdef DEBUG
  799. if ((error =
  800. xfs_btree_check_lblock(cur,
  801. block, level, bp))) {
  802. XFS_BMBT_TRACE_CURSOR(
  803. cur, ERROR);
  804. return error;
  805. }
  806. #endif
  807. ptr = cur->bc_ptrs[level];
  808. xfs_bmbt_disk_set_allf(&nrec,
  809. startoff, 0, 0,
  810. XFS_EXT_NORM);
  811. } else {
  812. XFS_BMBT_TRACE_CURSOR(cur,
  813. EXIT);
  814. *stat = 0;
  815. return 0;
  816. }
  817. }
  818. }
  819. }
  820. }
  821. numrecs = be16_to_cpu(block->bb_numrecs);
  822. if (level > 0) {
  823. kp = XFS_BMAP_KEY_IADDR(block, 1, cur);
  824. pp = XFS_BMAP_PTR_IADDR(block, 1, cur);
  825. #ifdef DEBUG
  826. for (i = numrecs; i >= ptr; i--) {
  827. if ((error = xfs_btree_check_lptr_disk(cur, pp[i - 1],
  828. level))) {
  829. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  830. return error;
  831. }
  832. }
  833. #endif
  834. memmove(&kp[ptr], &kp[ptr - 1],
  835. (numrecs - ptr + 1) * sizeof(*kp));
  836. memmove(&pp[ptr], &pp[ptr - 1], /* INT_: direct copy */
  837. (numrecs - ptr + 1) * sizeof(*pp));
  838. #ifdef DEBUG
  839. if ((error = xfs_btree_check_lptr(cur, *bnop, level))) {
  840. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  841. return error;
  842. }
  843. #endif
  844. kp[ptr - 1] = key;
  845. pp[ptr - 1] = cpu_to_be64(*bnop);
  846. numrecs++;
  847. block->bb_numrecs = cpu_to_be16(numrecs);
  848. xfs_bmbt_log_keys(cur, bp, ptr, numrecs);
  849. xfs_bmbt_log_ptrs(cur, bp, ptr, numrecs);
  850. } else {
  851. rp = XFS_BMAP_REC_IADDR(block, 1, cur);
  852. memmove(&rp[ptr], &rp[ptr - 1],
  853. (numrecs - ptr + 1) * sizeof(*rp));
  854. rp[ptr - 1] = *recp;
  855. numrecs++;
  856. block->bb_numrecs = cpu_to_be16(numrecs);
  857. xfs_bmbt_log_recs(cur, bp, ptr, numrecs);
  858. }
  859. xfs_bmbt_log_block(cur, bp, XFS_BB_NUMRECS);
  860. #ifdef DEBUG
  861. if (ptr < numrecs) {
  862. if (level == 0)
  863. xfs_btree_check_rec(XFS_BTNUM_BMAP, rp + ptr - 1,
  864. rp + ptr);
  865. else
  866. xfs_btree_check_key(XFS_BTNUM_BMAP, kp + ptr - 1,
  867. kp + ptr);
  868. }
  869. #endif
  870. if (optr == 1 && (error = xfs_bmbt_updkey(cur, &key, level + 1))) {
  871. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  872. return error;
  873. }
  874. *bnop = nbno;
  875. if (nbno != NULLFSBLOCK) {
  876. *recp = nrec;
  877. *curp = ncur;
  878. }
  879. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  880. *stat = 1;
  881. return 0;
  882. }
  883. STATIC int
  884. xfs_bmbt_killroot(
  885. xfs_btree_cur_t *cur)
  886. {
  887. xfs_bmbt_block_t *block;
  888. xfs_bmbt_block_t *cblock;
  889. xfs_buf_t *cbp;
  890. xfs_bmbt_key_t *ckp;
  891. xfs_bmbt_ptr_t *cpp;
  892. #ifdef DEBUG
  893. int error;
  894. #endif
  895. #ifdef XFS_BMBT_TRACE
  896. static char fname[] = "xfs_bmbt_killroot";
  897. #endif
  898. int i;
  899. xfs_bmbt_key_t *kp;
  900. xfs_inode_t *ip;
  901. xfs_ifork_t *ifp;
  902. int level;
  903. xfs_bmbt_ptr_t *pp;
  904. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  905. level = cur->bc_nlevels - 1;
  906. ASSERT(level >= 1);
  907. /*
  908. * Don't deal with the root block needs to be a leaf case.
  909. * We're just going to turn the thing back into extents anyway.
  910. */
  911. if (level == 1) {
  912. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  913. return 0;
  914. }
  915. block = xfs_bmbt_get_block(cur, level, &cbp);
  916. /*
  917. * Give up if the root has multiple children.
  918. */
  919. if (be16_to_cpu(block->bb_numrecs) != 1) {
  920. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  921. return 0;
  922. }
  923. /*
  924. * Only do this if the next level will fit.
  925. * Then the data must be copied up to the inode,
  926. * instead of freeing the root you free the next level.
  927. */
  928. cbp = cur->bc_bufs[level - 1];
  929. cblock = XFS_BUF_TO_BMBT_BLOCK(cbp);
  930. if (be16_to_cpu(cblock->bb_numrecs) > XFS_BMAP_BLOCK_DMAXRECS(level, cur)) {
  931. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  932. return 0;
  933. }
  934. ASSERT(be64_to_cpu(cblock->bb_leftsib) == NULLDFSBNO);
  935. ASSERT(be64_to_cpu(cblock->bb_rightsib) == NULLDFSBNO);
  936. ip = cur->bc_private.b.ip;
  937. ifp = XFS_IFORK_PTR(ip, cur->bc_private.b.whichfork);
  938. ASSERT(XFS_BMAP_BLOCK_IMAXRECS(level, cur) ==
  939. XFS_BMAP_BROOT_MAXRECS(ifp->if_broot_bytes));
  940. i = (int)(be16_to_cpu(cblock->bb_numrecs) - XFS_BMAP_BLOCK_IMAXRECS(level, cur));
  941. if (i) {
  942. xfs_iroot_realloc(ip, i, cur->bc_private.b.whichfork);
  943. block = ifp->if_broot;
  944. }
  945. be16_add(&block->bb_numrecs, i);
  946. ASSERT(block->bb_numrecs == cblock->bb_numrecs);
  947. kp = XFS_BMAP_KEY_IADDR(block, 1, cur);
  948. ckp = XFS_BMAP_KEY_IADDR(cblock, 1, cur);
  949. memcpy(kp, ckp, be16_to_cpu(block->bb_numrecs) * sizeof(*kp));
  950. pp = XFS_BMAP_PTR_IADDR(block, 1, cur);
  951. cpp = XFS_BMAP_PTR_IADDR(cblock, 1, cur);
  952. #ifdef DEBUG
  953. for (i = 0; i < be16_to_cpu(cblock->bb_numrecs); i++) {
  954. if ((error = xfs_btree_check_lptr_disk(cur, cpp[i], level - 1))) {
  955. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  956. return error;
  957. }
  958. }
  959. #endif
  960. memcpy(pp, cpp, be16_to_cpu(block->bb_numrecs) * sizeof(*pp));
  961. xfs_bmap_add_free(XFS_DADDR_TO_FSB(cur->bc_mp, XFS_BUF_ADDR(cbp)), 1,
  962. cur->bc_private.b.flist, cur->bc_mp);
  963. ip->i_d.di_nblocks--;
  964. XFS_TRANS_MOD_DQUOT_BYINO(cur->bc_mp, cur->bc_tp, ip,
  965. XFS_TRANS_DQ_BCOUNT, -1L);
  966. xfs_trans_binval(cur->bc_tp, cbp);
  967. cur->bc_bufs[level - 1] = NULL;
  968. be16_add(&block->bb_level, -1);
  969. xfs_trans_log_inode(cur->bc_tp, ip,
  970. XFS_ILOG_CORE | XFS_ILOG_FBROOT(cur->bc_private.b.whichfork));
  971. cur->bc_nlevels--;
  972. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  973. return 0;
  974. }
  975. /*
  976. * Log key values from the btree block.
  977. */
  978. STATIC void
  979. xfs_bmbt_log_keys(
  980. xfs_btree_cur_t *cur,
  981. xfs_buf_t *bp,
  982. int kfirst,
  983. int klast)
  984. {
  985. #ifdef XFS_BMBT_TRACE
  986. static char fname[] = "xfs_bmbt_log_keys";
  987. #endif
  988. xfs_trans_t *tp;
  989. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  990. XFS_BMBT_TRACE_ARGBII(cur, bp, kfirst, klast);
  991. tp = cur->bc_tp;
  992. if (bp) {
  993. xfs_bmbt_block_t *block;
  994. int first;
  995. xfs_bmbt_key_t *kp;
  996. int last;
  997. block = XFS_BUF_TO_BMBT_BLOCK(bp);
  998. kp = XFS_BMAP_KEY_DADDR(block, 1, cur);
  999. first = (int)((xfs_caddr_t)&kp[kfirst - 1] - (xfs_caddr_t)block);
  1000. last = (int)(((xfs_caddr_t)&kp[klast] - 1) - (xfs_caddr_t)block);
  1001. xfs_trans_log_buf(tp, bp, first, last);
  1002. } else {
  1003. xfs_inode_t *ip;
  1004. ip = cur->bc_private.b.ip;
  1005. xfs_trans_log_inode(tp, ip,
  1006. XFS_ILOG_FBROOT(cur->bc_private.b.whichfork));
  1007. }
  1008. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1009. }
  1010. /*
  1011. * Log pointer values from the btree block.
  1012. */
  1013. STATIC void
  1014. xfs_bmbt_log_ptrs(
  1015. xfs_btree_cur_t *cur,
  1016. xfs_buf_t *bp,
  1017. int pfirst,
  1018. int plast)
  1019. {
  1020. #ifdef XFS_BMBT_TRACE
  1021. static char fname[] = "xfs_bmbt_log_ptrs";
  1022. #endif
  1023. xfs_trans_t *tp;
  1024. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  1025. XFS_BMBT_TRACE_ARGBII(cur, bp, pfirst, plast);
  1026. tp = cur->bc_tp;
  1027. if (bp) {
  1028. xfs_bmbt_block_t *block;
  1029. int first;
  1030. int last;
  1031. xfs_bmbt_ptr_t *pp;
  1032. block = XFS_BUF_TO_BMBT_BLOCK(bp);
  1033. pp = XFS_BMAP_PTR_DADDR(block, 1, cur);
  1034. first = (int)((xfs_caddr_t)&pp[pfirst - 1] - (xfs_caddr_t)block);
  1035. last = (int)(((xfs_caddr_t)&pp[plast] - 1) - (xfs_caddr_t)block);
  1036. xfs_trans_log_buf(tp, bp, first, last);
  1037. } else {
  1038. xfs_inode_t *ip;
  1039. ip = cur->bc_private.b.ip;
  1040. xfs_trans_log_inode(tp, ip,
  1041. XFS_ILOG_FBROOT(cur->bc_private.b.whichfork));
  1042. }
  1043. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1044. }
  1045. /*
  1046. * Lookup the record. The cursor is made to point to it, based on dir.
  1047. */
  1048. STATIC int /* error */
  1049. xfs_bmbt_lookup(
  1050. xfs_btree_cur_t *cur,
  1051. xfs_lookup_t dir,
  1052. int *stat) /* success/failure */
  1053. {
  1054. xfs_bmbt_block_t *block=NULL;
  1055. xfs_buf_t *bp;
  1056. xfs_daddr_t d;
  1057. xfs_sfiloff_t diff;
  1058. int error; /* error return value */
  1059. #ifdef XFS_BMBT_TRACE
  1060. static char fname[] = "xfs_bmbt_lookup";
  1061. #endif
  1062. xfs_fsblock_t fsbno=0;
  1063. int high;
  1064. int i;
  1065. int keyno=0;
  1066. xfs_bmbt_key_t *kkbase=NULL;
  1067. xfs_bmbt_key_t *kkp;
  1068. xfs_bmbt_rec_t *krbase=NULL;
  1069. xfs_bmbt_rec_t *krp;
  1070. int level;
  1071. int low;
  1072. xfs_mount_t *mp;
  1073. xfs_bmbt_ptr_t *pp;
  1074. xfs_bmbt_irec_t *rp;
  1075. xfs_fileoff_t startoff;
  1076. xfs_trans_t *tp;
  1077. XFS_STATS_INC(xs_bmbt_lookup);
  1078. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  1079. XFS_BMBT_TRACE_ARGI(cur, (int)dir);
  1080. tp = cur->bc_tp;
  1081. mp = cur->bc_mp;
  1082. rp = &cur->bc_rec.b;
  1083. for (level = cur->bc_nlevels - 1, diff = 1; level >= 0; level--) {
  1084. if (level < cur->bc_nlevels - 1) {
  1085. d = XFS_FSB_TO_DADDR(mp, fsbno);
  1086. bp = cur->bc_bufs[level];
  1087. if (bp && XFS_BUF_ADDR(bp) != d)
  1088. bp = NULL;
  1089. if (!bp) {
  1090. if ((error = xfs_btree_read_bufl(mp, tp, fsbno,
  1091. 0, &bp, XFS_BMAP_BTREE_REF))) {
  1092. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1093. return error;
  1094. }
  1095. xfs_btree_setbuf(cur, level, bp);
  1096. block = XFS_BUF_TO_BMBT_BLOCK(bp);
  1097. if ((error = xfs_btree_check_lblock(cur, block,
  1098. level, bp))) {
  1099. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1100. return error;
  1101. }
  1102. } else
  1103. block = XFS_BUF_TO_BMBT_BLOCK(bp);
  1104. } else
  1105. block = xfs_bmbt_get_block(cur, level, &bp);
  1106. if (diff == 0)
  1107. keyno = 1;
  1108. else {
  1109. if (level > 0)
  1110. kkbase = XFS_BMAP_KEY_IADDR(block, 1, cur);
  1111. else
  1112. krbase = XFS_BMAP_REC_IADDR(block, 1, cur);
  1113. low = 1;
  1114. if (!(high = be16_to_cpu(block->bb_numrecs))) {
  1115. ASSERT(level == 0);
  1116. cur->bc_ptrs[0] = dir != XFS_LOOKUP_LE;
  1117. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1118. *stat = 0;
  1119. return 0;
  1120. }
  1121. while (low <= high) {
  1122. XFS_STATS_INC(xs_bmbt_compare);
  1123. keyno = (low + high) >> 1;
  1124. if (level > 0) {
  1125. kkp = kkbase + keyno - 1;
  1126. startoff = be64_to_cpu(kkp->br_startoff);
  1127. } else {
  1128. krp = krbase + keyno - 1;
  1129. startoff = xfs_bmbt_disk_get_startoff(krp);
  1130. }
  1131. diff = (xfs_sfiloff_t)
  1132. (startoff - rp->br_startoff);
  1133. if (diff < 0)
  1134. low = keyno + 1;
  1135. else if (diff > 0)
  1136. high = keyno - 1;
  1137. else
  1138. break;
  1139. }
  1140. }
  1141. if (level > 0) {
  1142. if (diff > 0 && --keyno < 1)
  1143. keyno = 1;
  1144. pp = XFS_BMAP_PTR_IADDR(block, keyno, cur);
  1145. fsbno = be64_to_cpu(*pp);
  1146. #ifdef DEBUG
  1147. if ((error = xfs_btree_check_lptr(cur, fsbno, level))) {
  1148. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1149. return error;
  1150. }
  1151. #endif
  1152. cur->bc_ptrs[level] = keyno;
  1153. }
  1154. }
  1155. if (dir != XFS_LOOKUP_LE && diff < 0) {
  1156. keyno++;
  1157. /*
  1158. * If ge search and we went off the end of the block, but it's
  1159. * not the last block, we're in the wrong block.
  1160. */
  1161. if (dir == XFS_LOOKUP_GE && keyno > be16_to_cpu(block->bb_numrecs) &&
  1162. be64_to_cpu(block->bb_rightsib) != NULLDFSBNO) {
  1163. cur->bc_ptrs[0] = keyno;
  1164. if ((error = xfs_bmbt_increment(cur, 0, &i))) {
  1165. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1166. return error;
  1167. }
  1168. XFS_WANT_CORRUPTED_RETURN(i == 1);
  1169. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1170. *stat = 1;
  1171. return 0;
  1172. }
  1173. }
  1174. else if (dir == XFS_LOOKUP_LE && diff > 0)
  1175. keyno--;
  1176. cur->bc_ptrs[0] = keyno;
  1177. if (keyno == 0 || keyno > be16_to_cpu(block->bb_numrecs)) {
  1178. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1179. *stat = 0;
  1180. } else {
  1181. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1182. *stat = ((dir != XFS_LOOKUP_EQ) || (diff == 0));
  1183. }
  1184. return 0;
  1185. }
  1186. /*
  1187. * Move 1 record left from cur/level if possible.
  1188. * Update cur to reflect the new path.
  1189. */
  1190. STATIC int /* error */
  1191. xfs_bmbt_lshift(
  1192. xfs_btree_cur_t *cur,
  1193. int level,
  1194. int *stat) /* success/failure */
  1195. {
  1196. int error; /* error return value */
  1197. #ifdef XFS_BMBT_TRACE
  1198. static char fname[] = "xfs_bmbt_lshift";
  1199. #endif
  1200. #ifdef DEBUG
  1201. int i; /* loop counter */
  1202. #endif
  1203. xfs_bmbt_key_t key; /* bmap btree key */
  1204. xfs_buf_t *lbp; /* left buffer pointer */
  1205. xfs_bmbt_block_t *left; /* left btree block */
  1206. xfs_bmbt_key_t *lkp=NULL; /* left btree key */
  1207. xfs_bmbt_ptr_t *lpp; /* left address pointer */
  1208. int lrecs; /* left record count */
  1209. xfs_bmbt_rec_t *lrp=NULL; /* left record pointer */
  1210. xfs_mount_t *mp; /* file system mount point */
  1211. xfs_buf_t *rbp; /* right buffer pointer */
  1212. xfs_bmbt_block_t *right; /* right btree block */
  1213. xfs_bmbt_key_t *rkp=NULL; /* right btree key */
  1214. xfs_bmbt_ptr_t *rpp=NULL; /* right address pointer */
  1215. xfs_bmbt_rec_t *rrp=NULL; /* right record pointer */
  1216. int rrecs; /* right record count */
  1217. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  1218. XFS_BMBT_TRACE_ARGI(cur, level);
  1219. if (level == cur->bc_nlevels - 1) {
  1220. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1221. *stat = 0;
  1222. return 0;
  1223. }
  1224. rbp = cur->bc_bufs[level];
  1225. right = XFS_BUF_TO_BMBT_BLOCK(rbp);
  1226. #ifdef DEBUG
  1227. if ((error = xfs_btree_check_lblock(cur, right, level, rbp))) {
  1228. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1229. return error;
  1230. }
  1231. #endif
  1232. if (be64_to_cpu(right->bb_leftsib) == NULLDFSBNO) {
  1233. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1234. *stat = 0;
  1235. return 0;
  1236. }
  1237. if (cur->bc_ptrs[level] <= 1) {
  1238. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1239. *stat = 0;
  1240. return 0;
  1241. }
  1242. mp = cur->bc_mp;
  1243. if ((error = xfs_btree_read_bufl(mp, cur->bc_tp, be64_to_cpu(right->bb_leftsib), 0,
  1244. &lbp, XFS_BMAP_BTREE_REF))) {
  1245. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1246. return error;
  1247. }
  1248. left = XFS_BUF_TO_BMBT_BLOCK(lbp);
  1249. if ((error = xfs_btree_check_lblock(cur, left, level, lbp))) {
  1250. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1251. return error;
  1252. }
  1253. if (be16_to_cpu(left->bb_numrecs) == XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
  1254. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1255. *stat = 0;
  1256. return 0;
  1257. }
  1258. lrecs = be16_to_cpu(left->bb_numrecs) + 1;
  1259. if (level > 0) {
  1260. lkp = XFS_BMAP_KEY_IADDR(left, lrecs, cur);
  1261. rkp = XFS_BMAP_KEY_IADDR(right, 1, cur);
  1262. *lkp = *rkp;
  1263. xfs_bmbt_log_keys(cur, lbp, lrecs, lrecs);
  1264. lpp = XFS_BMAP_PTR_IADDR(left, lrecs, cur);
  1265. rpp = XFS_BMAP_PTR_IADDR(right, 1, cur);
  1266. #ifdef DEBUG
  1267. if ((error = xfs_btree_check_lptr_disk(cur, *rpp, level))) {
  1268. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1269. return error;
  1270. }
  1271. #endif
  1272. *lpp = *rpp; /* INT_: direct copy */
  1273. xfs_bmbt_log_ptrs(cur, lbp, lrecs, lrecs);
  1274. } else {
  1275. lrp = XFS_BMAP_REC_IADDR(left, lrecs, cur);
  1276. rrp = XFS_BMAP_REC_IADDR(right, 1, cur);
  1277. *lrp = *rrp;
  1278. xfs_bmbt_log_recs(cur, lbp, lrecs, lrecs);
  1279. }
  1280. left->bb_numrecs = cpu_to_be16(lrecs);
  1281. xfs_bmbt_log_block(cur, lbp, XFS_BB_NUMRECS);
  1282. #ifdef DEBUG
  1283. if (level > 0)
  1284. xfs_btree_check_key(XFS_BTNUM_BMAP, lkp - 1, lkp);
  1285. else
  1286. xfs_btree_check_rec(XFS_BTNUM_BMAP, lrp - 1, lrp);
  1287. #endif
  1288. rrecs = be16_to_cpu(right->bb_numrecs) - 1;
  1289. right->bb_numrecs = cpu_to_be16(rrecs);
  1290. xfs_bmbt_log_block(cur, rbp, XFS_BB_NUMRECS);
  1291. if (level > 0) {
  1292. #ifdef DEBUG
  1293. for (i = 0; i < rrecs; i++) {
  1294. if ((error = xfs_btree_check_lptr_disk(cur, rpp[i + 1],
  1295. level))) {
  1296. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1297. return error;
  1298. }
  1299. }
  1300. #endif
  1301. memmove(rkp, rkp + 1, rrecs * sizeof(*rkp));
  1302. memmove(rpp, rpp + 1, rrecs * sizeof(*rpp));
  1303. xfs_bmbt_log_keys(cur, rbp, 1, rrecs);
  1304. xfs_bmbt_log_ptrs(cur, rbp, 1, rrecs);
  1305. } else {
  1306. memmove(rrp, rrp + 1, rrecs * sizeof(*rrp));
  1307. xfs_bmbt_log_recs(cur, rbp, 1, rrecs);
  1308. key.br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(rrp));
  1309. rkp = &key;
  1310. }
  1311. if ((error = xfs_bmbt_updkey(cur, rkp, level + 1))) {
  1312. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1313. return error;
  1314. }
  1315. cur->bc_ptrs[level]--;
  1316. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1317. *stat = 1;
  1318. return 0;
  1319. }
  1320. /*
  1321. * Move 1 record right from cur/level if possible.
  1322. * Update cur to reflect the new path.
  1323. */
  1324. STATIC int /* error */
  1325. xfs_bmbt_rshift(
  1326. xfs_btree_cur_t *cur,
  1327. int level,
  1328. int *stat) /* success/failure */
  1329. {
  1330. int error; /* error return value */
  1331. #ifdef XFS_BMBT_TRACE
  1332. static char fname[] = "xfs_bmbt_rshift";
  1333. #endif
  1334. int i; /* loop counter */
  1335. xfs_bmbt_key_t key; /* bmap btree key */
  1336. xfs_buf_t *lbp; /* left buffer pointer */
  1337. xfs_bmbt_block_t *left; /* left btree block */
  1338. xfs_bmbt_key_t *lkp; /* left btree key */
  1339. xfs_bmbt_ptr_t *lpp; /* left address pointer */
  1340. xfs_bmbt_rec_t *lrp; /* left record pointer */
  1341. xfs_mount_t *mp; /* file system mount point */
  1342. xfs_buf_t *rbp; /* right buffer pointer */
  1343. xfs_bmbt_block_t *right; /* right btree block */
  1344. xfs_bmbt_key_t *rkp; /* right btree key */
  1345. xfs_bmbt_ptr_t *rpp; /* right address pointer */
  1346. xfs_bmbt_rec_t *rrp=NULL; /* right record pointer */
  1347. struct xfs_btree_cur *tcur; /* temporary btree cursor */
  1348. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  1349. XFS_BMBT_TRACE_ARGI(cur, level);
  1350. if (level == cur->bc_nlevels - 1) {
  1351. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1352. *stat = 0;
  1353. return 0;
  1354. }
  1355. lbp = cur->bc_bufs[level];
  1356. left = XFS_BUF_TO_BMBT_BLOCK(lbp);
  1357. #ifdef DEBUG
  1358. if ((error = xfs_btree_check_lblock(cur, left, level, lbp))) {
  1359. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1360. return error;
  1361. }
  1362. #endif
  1363. if (be64_to_cpu(left->bb_rightsib) == NULLDFSBNO) {
  1364. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1365. *stat = 0;
  1366. return 0;
  1367. }
  1368. if (cur->bc_ptrs[level] >= be16_to_cpu(left->bb_numrecs)) {
  1369. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1370. *stat = 0;
  1371. return 0;
  1372. }
  1373. mp = cur->bc_mp;
  1374. if ((error = xfs_btree_read_bufl(mp, cur->bc_tp, be64_to_cpu(left->bb_rightsib), 0,
  1375. &rbp, XFS_BMAP_BTREE_REF))) {
  1376. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1377. return error;
  1378. }
  1379. right = XFS_BUF_TO_BMBT_BLOCK(rbp);
  1380. if ((error = xfs_btree_check_lblock(cur, right, level, rbp))) {
  1381. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1382. return error;
  1383. }
  1384. if (be16_to_cpu(right->bb_numrecs) == XFS_BMAP_BLOCK_IMAXRECS(level, cur)) {
  1385. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1386. *stat = 0;
  1387. return 0;
  1388. }
  1389. if (level > 0) {
  1390. lkp = XFS_BMAP_KEY_IADDR(left, be16_to_cpu(left->bb_numrecs), cur);
  1391. lpp = XFS_BMAP_PTR_IADDR(left, be16_to_cpu(left->bb_numrecs), cur);
  1392. rkp = XFS_BMAP_KEY_IADDR(right, 1, cur);
  1393. rpp = XFS_BMAP_PTR_IADDR(right, 1, cur);
  1394. #ifdef DEBUG
  1395. for (i = be16_to_cpu(right->bb_numrecs) - 1; i >= 0; i--) {
  1396. if ((error = xfs_btree_check_lptr_disk(cur, rpp[i], level))) {
  1397. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1398. return error;
  1399. }
  1400. }
  1401. #endif
  1402. memmove(rkp + 1, rkp, be16_to_cpu(right->bb_numrecs) * sizeof(*rkp));
  1403. memmove(rpp + 1, rpp, be16_to_cpu(right->bb_numrecs) * sizeof(*rpp));
  1404. #ifdef DEBUG
  1405. if ((error = xfs_btree_check_lptr_disk(cur, *lpp, level))) {
  1406. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1407. return error;
  1408. }
  1409. #endif
  1410. *rkp = *lkp;
  1411. *rpp = *lpp; /* INT_: direct copy */
  1412. xfs_bmbt_log_keys(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
  1413. xfs_bmbt_log_ptrs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
  1414. } else {
  1415. lrp = XFS_BMAP_REC_IADDR(left, be16_to_cpu(left->bb_numrecs), cur);
  1416. rrp = XFS_BMAP_REC_IADDR(right, 1, cur);
  1417. memmove(rrp + 1, rrp, be16_to_cpu(right->bb_numrecs) * sizeof(*rrp));
  1418. *rrp = *lrp;
  1419. xfs_bmbt_log_recs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs) + 1);
  1420. key.br_startoff = cpu_to_be64(xfs_bmbt_disk_get_startoff(rrp));
  1421. rkp = &key;
  1422. }
  1423. be16_add(&left->bb_numrecs, -1);
  1424. xfs_bmbt_log_block(cur, lbp, XFS_BB_NUMRECS);
  1425. be16_add(&right->bb_numrecs, 1);
  1426. #ifdef DEBUG
  1427. if (level > 0)
  1428. xfs_btree_check_key(XFS_BTNUM_BMAP, rkp, rkp + 1);
  1429. else
  1430. xfs_btree_check_rec(XFS_BTNUM_BMAP, rrp, rrp + 1);
  1431. #endif
  1432. xfs_bmbt_log_block(cur, rbp, XFS_BB_NUMRECS);
  1433. if ((error = xfs_btree_dup_cursor(cur, &tcur))) {
  1434. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1435. return error;
  1436. }
  1437. i = xfs_btree_lastrec(tcur, level);
  1438. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  1439. if ((error = xfs_bmbt_increment(tcur, level, &i))) {
  1440. XFS_BMBT_TRACE_CURSOR(tcur, ERROR);
  1441. goto error1;
  1442. }
  1443. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  1444. if ((error = xfs_bmbt_updkey(tcur, rkp, level + 1))) {
  1445. XFS_BMBT_TRACE_CURSOR(tcur, ERROR);
  1446. goto error1;
  1447. }
  1448. xfs_btree_del_cursor(tcur, XFS_BTREE_NOERROR);
  1449. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1450. *stat = 1;
  1451. return 0;
  1452. error0:
  1453. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1454. error1:
  1455. xfs_btree_del_cursor(tcur, XFS_BTREE_ERROR);
  1456. return error;
  1457. }
  1458. /*
  1459. * Determine the extent state.
  1460. */
  1461. /* ARGSUSED */
  1462. STATIC xfs_exntst_t
  1463. xfs_extent_state(
  1464. xfs_filblks_t blks,
  1465. int extent_flag)
  1466. {
  1467. if (extent_flag) {
  1468. ASSERT(blks != 0); /* saved for DMIG */
  1469. return XFS_EXT_UNWRITTEN;
  1470. }
  1471. return XFS_EXT_NORM;
  1472. }
  1473. /*
  1474. * Split cur/level block in half.
  1475. * Return new block number and its first record (to be inserted into parent).
  1476. */
  1477. STATIC int /* error */
  1478. xfs_bmbt_split(
  1479. xfs_btree_cur_t *cur,
  1480. int level,
  1481. xfs_fsblock_t *bnop,
  1482. __uint64_t *startoff,
  1483. xfs_btree_cur_t **curp,
  1484. int *stat) /* success/failure */
  1485. {
  1486. xfs_alloc_arg_t args; /* block allocation args */
  1487. int error; /* error return value */
  1488. #ifdef XFS_BMBT_TRACE
  1489. static char fname[] = "xfs_bmbt_split";
  1490. #endif
  1491. int i; /* loop counter */
  1492. xfs_fsblock_t lbno; /* left sibling block number */
  1493. xfs_buf_t *lbp; /* left buffer pointer */
  1494. xfs_bmbt_block_t *left; /* left btree block */
  1495. xfs_bmbt_key_t *lkp; /* left btree key */
  1496. xfs_bmbt_ptr_t *lpp; /* left address pointer */
  1497. xfs_bmbt_rec_t *lrp; /* left record pointer */
  1498. xfs_buf_t *rbp; /* right buffer pointer */
  1499. xfs_bmbt_block_t *right; /* right btree block */
  1500. xfs_bmbt_key_t *rkp; /* right btree key */
  1501. xfs_bmbt_ptr_t *rpp; /* right address pointer */
  1502. xfs_bmbt_block_t *rrblock; /* right-right btree block */
  1503. xfs_buf_t *rrbp; /* right-right buffer pointer */
  1504. xfs_bmbt_rec_t *rrp; /* right record pointer */
  1505. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  1506. XFS_BMBT_TRACE_ARGIFK(cur, level, *bnop, *startoff);
  1507. args.tp = cur->bc_tp;
  1508. args.mp = cur->bc_mp;
  1509. lbp = cur->bc_bufs[level];
  1510. lbno = XFS_DADDR_TO_FSB(args.mp, XFS_BUF_ADDR(lbp));
  1511. left = XFS_BUF_TO_BMBT_BLOCK(lbp);
  1512. args.fsbno = cur->bc_private.b.firstblock;
  1513. args.firstblock = args.fsbno;
  1514. if (args.fsbno == NULLFSBLOCK) {
  1515. args.fsbno = lbno;
  1516. args.type = XFS_ALLOCTYPE_START_BNO;
  1517. } else
  1518. args.type = XFS_ALLOCTYPE_NEAR_BNO;
  1519. args.mod = args.minleft = args.alignment = args.total = args.isfl =
  1520. args.userdata = args.minalignslop = 0;
  1521. args.minlen = args.maxlen = args.prod = 1;
  1522. args.wasdel = cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL;
  1523. if (!args.wasdel && xfs_trans_get_block_res(args.tp) == 0) {
  1524. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1525. return XFS_ERROR(ENOSPC);
  1526. }
  1527. if ((error = xfs_alloc_vextent(&args))) {
  1528. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1529. return error;
  1530. }
  1531. if (args.fsbno == NULLFSBLOCK) {
  1532. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1533. *stat = 0;
  1534. return 0;
  1535. }
  1536. ASSERT(args.len == 1);
  1537. cur->bc_private.b.firstblock = args.fsbno;
  1538. cur->bc_private.b.allocated++;
  1539. cur->bc_private.b.ip->i_d.di_nblocks++;
  1540. xfs_trans_log_inode(args.tp, cur->bc_private.b.ip, XFS_ILOG_CORE);
  1541. XFS_TRANS_MOD_DQUOT_BYINO(args.mp, args.tp, cur->bc_private.b.ip,
  1542. XFS_TRANS_DQ_BCOUNT, 1L);
  1543. rbp = xfs_btree_get_bufl(args.mp, args.tp, args.fsbno, 0);
  1544. right = XFS_BUF_TO_BMBT_BLOCK(rbp);
  1545. #ifdef DEBUG
  1546. if ((error = xfs_btree_check_lblock(cur, left, level, rbp))) {
  1547. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1548. return error;
  1549. }
  1550. #endif
  1551. right->bb_magic = cpu_to_be32(XFS_BMAP_MAGIC);
  1552. right->bb_level = left->bb_level;
  1553. right->bb_numrecs = cpu_to_be16(be16_to_cpu(left->bb_numrecs) / 2);
  1554. if ((be16_to_cpu(left->bb_numrecs) & 1) &&
  1555. cur->bc_ptrs[level] <= be16_to_cpu(right->bb_numrecs) + 1)
  1556. be16_add(&right->bb_numrecs, 1);
  1557. i = be16_to_cpu(left->bb_numrecs) - be16_to_cpu(right->bb_numrecs) + 1;
  1558. if (level > 0) {
  1559. lkp = XFS_BMAP_KEY_IADDR(left, i, cur);
  1560. lpp = XFS_BMAP_PTR_IADDR(left, i, cur);
  1561. rkp = XFS_BMAP_KEY_IADDR(right, 1, cur);
  1562. rpp = XFS_BMAP_PTR_IADDR(right, 1, cur);
  1563. #ifdef DEBUG
  1564. for (i = 0; i < be16_to_cpu(right->bb_numrecs); i++) {
  1565. if ((error = xfs_btree_check_lptr_disk(cur, lpp[i], level))) {
  1566. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1567. return error;
  1568. }
  1569. }
  1570. #endif
  1571. memcpy(rkp, lkp, be16_to_cpu(right->bb_numrecs) * sizeof(*rkp));
  1572. memcpy(rpp, lpp, be16_to_cpu(right->bb_numrecs) * sizeof(*rpp));
  1573. xfs_bmbt_log_keys(cur, rbp, 1, be16_to_cpu(right->bb_numrecs));
  1574. xfs_bmbt_log_ptrs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs));
  1575. *startoff = be64_to_cpu(rkp->br_startoff);
  1576. } else {
  1577. lrp = XFS_BMAP_REC_IADDR(left, i, cur);
  1578. rrp = XFS_BMAP_REC_IADDR(right, 1, cur);
  1579. memcpy(rrp, lrp, be16_to_cpu(right->bb_numrecs) * sizeof(*rrp));
  1580. xfs_bmbt_log_recs(cur, rbp, 1, be16_to_cpu(right->bb_numrecs));
  1581. *startoff = xfs_bmbt_disk_get_startoff(rrp);
  1582. }
  1583. be16_add(&left->bb_numrecs, -(be16_to_cpu(right->bb_numrecs)));
  1584. right->bb_rightsib = left->bb_rightsib;
  1585. left->bb_rightsib = cpu_to_be64(args.fsbno);
  1586. right->bb_leftsib = cpu_to_be64(lbno);
  1587. xfs_bmbt_log_block(cur, rbp, XFS_BB_ALL_BITS);
  1588. xfs_bmbt_log_block(cur, lbp, XFS_BB_NUMRECS | XFS_BB_RIGHTSIB);
  1589. if (be64_to_cpu(right->bb_rightsib) != NULLDFSBNO) {
  1590. if ((error = xfs_btree_read_bufl(args.mp, args.tp,
  1591. be64_to_cpu(right->bb_rightsib), 0, &rrbp,
  1592. XFS_BMAP_BTREE_REF))) {
  1593. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1594. return error;
  1595. }
  1596. rrblock = XFS_BUF_TO_BMBT_BLOCK(rrbp);
  1597. if ((error = xfs_btree_check_lblock(cur, rrblock, level, rrbp))) {
  1598. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1599. return error;
  1600. }
  1601. rrblock->bb_leftsib = cpu_to_be64(args.fsbno);
  1602. xfs_bmbt_log_block(cur, rrbp, XFS_BB_LEFTSIB);
  1603. }
  1604. if (cur->bc_ptrs[level] > be16_to_cpu(left->bb_numrecs) + 1) {
  1605. xfs_btree_setbuf(cur, level, rbp);
  1606. cur->bc_ptrs[level] -= be16_to_cpu(left->bb_numrecs);
  1607. }
  1608. if (level + 1 < cur->bc_nlevels) {
  1609. if ((error = xfs_btree_dup_cursor(cur, curp))) {
  1610. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1611. return error;
  1612. }
  1613. (*curp)->bc_ptrs[level + 1]++;
  1614. }
  1615. *bnop = args.fsbno;
  1616. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1617. *stat = 1;
  1618. return 0;
  1619. }
  1620. /*
  1621. * Update keys for the record.
  1622. */
  1623. STATIC int
  1624. xfs_bmbt_updkey(
  1625. xfs_btree_cur_t *cur,
  1626. xfs_bmbt_key_t *keyp, /* on-disk format */
  1627. int level)
  1628. {
  1629. xfs_bmbt_block_t *block;
  1630. xfs_buf_t *bp;
  1631. #ifdef DEBUG
  1632. int error;
  1633. #endif
  1634. #ifdef XFS_BMBT_TRACE
  1635. static char fname[] = "xfs_bmbt_updkey";
  1636. #endif
  1637. xfs_bmbt_key_t *kp;
  1638. int ptr;
  1639. ASSERT(level >= 1);
  1640. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  1641. XFS_BMBT_TRACE_ARGIK(cur, level, keyp);
  1642. for (ptr = 1; ptr == 1 && level < cur->bc_nlevels; level++) {
  1643. block = xfs_bmbt_get_block(cur, level, &bp);
  1644. #ifdef DEBUG
  1645. if ((error = xfs_btree_check_lblock(cur, block, level, bp))) {
  1646. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1647. return error;
  1648. }
  1649. #endif
  1650. ptr = cur->bc_ptrs[level];
  1651. kp = XFS_BMAP_KEY_IADDR(block, ptr, cur);
  1652. *kp = *keyp;
  1653. xfs_bmbt_log_keys(cur, bp, ptr, ptr);
  1654. }
  1655. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1656. return 0;
  1657. }
  1658. /*
  1659. * Convert on-disk form of btree root to in-memory form.
  1660. */
  1661. void
  1662. xfs_bmdr_to_bmbt(
  1663. xfs_bmdr_block_t *dblock,
  1664. int dblocklen,
  1665. xfs_bmbt_block_t *rblock,
  1666. int rblocklen)
  1667. {
  1668. int dmxr;
  1669. xfs_bmbt_key_t *fkp;
  1670. __be64 *fpp;
  1671. xfs_bmbt_key_t *tkp;
  1672. __be64 *tpp;
  1673. rblock->bb_magic = cpu_to_be32(XFS_BMAP_MAGIC);
  1674. rblock->bb_level = dblock->bb_level;
  1675. ASSERT(be16_to_cpu(rblock->bb_level) > 0);
  1676. rblock->bb_numrecs = dblock->bb_numrecs;
  1677. rblock->bb_leftsib = cpu_to_be64(NULLDFSBNO);
  1678. rblock->bb_rightsib = cpu_to_be64(NULLDFSBNO);
  1679. dmxr = (int)XFS_BTREE_BLOCK_MAXRECS(dblocklen, xfs_bmdr, 0);
  1680. fkp = XFS_BTREE_KEY_ADDR(dblocklen, xfs_bmdr, dblock, 1, dmxr);
  1681. tkp = XFS_BMAP_BROOT_KEY_ADDR(rblock, 1, rblocklen);
  1682. fpp = XFS_BTREE_PTR_ADDR(dblocklen, xfs_bmdr, dblock, 1, dmxr);
  1683. tpp = XFS_BMAP_BROOT_PTR_ADDR(rblock, 1, rblocklen);
  1684. dmxr = be16_to_cpu(dblock->bb_numrecs);
  1685. memcpy(tkp, fkp, sizeof(*fkp) * dmxr);
  1686. memcpy(tpp, fpp, sizeof(*fpp) * dmxr);
  1687. }
  1688. /*
  1689. * Decrement cursor by one record at the level.
  1690. * For nonzero levels the leaf-ward information is untouched.
  1691. */
  1692. int /* error */
  1693. xfs_bmbt_decrement(
  1694. xfs_btree_cur_t *cur,
  1695. int level,
  1696. int *stat) /* success/failure */
  1697. {
  1698. xfs_bmbt_block_t *block;
  1699. xfs_buf_t *bp;
  1700. int error; /* error return value */
  1701. #ifdef XFS_BMBT_TRACE
  1702. static char fname[] = "xfs_bmbt_decrement";
  1703. #endif
  1704. xfs_fsblock_t fsbno;
  1705. int lev;
  1706. xfs_mount_t *mp;
  1707. xfs_trans_t *tp;
  1708. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  1709. XFS_BMBT_TRACE_ARGI(cur, level);
  1710. ASSERT(level < cur->bc_nlevels);
  1711. if (level < cur->bc_nlevels - 1)
  1712. xfs_btree_readahead(cur, level, XFS_BTCUR_LEFTRA);
  1713. if (--cur->bc_ptrs[level] > 0) {
  1714. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1715. *stat = 1;
  1716. return 0;
  1717. }
  1718. block = xfs_bmbt_get_block(cur, level, &bp);
  1719. #ifdef DEBUG
  1720. if ((error = xfs_btree_check_lblock(cur, block, level, bp))) {
  1721. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1722. return error;
  1723. }
  1724. #endif
  1725. if (be64_to_cpu(block->bb_leftsib) == NULLDFSBNO) {
  1726. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1727. *stat = 0;
  1728. return 0;
  1729. }
  1730. for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
  1731. if (--cur->bc_ptrs[lev] > 0)
  1732. break;
  1733. if (lev < cur->bc_nlevels - 1)
  1734. xfs_btree_readahead(cur, lev, XFS_BTCUR_LEFTRA);
  1735. }
  1736. if (lev == cur->bc_nlevels) {
  1737. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1738. *stat = 0;
  1739. return 0;
  1740. }
  1741. tp = cur->bc_tp;
  1742. mp = cur->bc_mp;
  1743. for (block = xfs_bmbt_get_block(cur, lev, &bp); lev > level; ) {
  1744. fsbno = be64_to_cpu(*XFS_BMAP_PTR_IADDR(block, cur->bc_ptrs[lev], cur));
  1745. if ((error = xfs_btree_read_bufl(mp, tp, fsbno, 0, &bp,
  1746. XFS_BMAP_BTREE_REF))) {
  1747. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1748. return error;
  1749. }
  1750. lev--;
  1751. xfs_btree_setbuf(cur, lev, bp);
  1752. block = XFS_BUF_TO_BMBT_BLOCK(bp);
  1753. if ((error = xfs_btree_check_lblock(cur, block, lev, bp))) {
  1754. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1755. return error;
  1756. }
  1757. cur->bc_ptrs[lev] = be16_to_cpu(block->bb_numrecs);
  1758. }
  1759. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1760. *stat = 1;
  1761. return 0;
  1762. }
  1763. /*
  1764. * Delete the record pointed to by cur.
  1765. */
  1766. int /* error */
  1767. xfs_bmbt_delete(
  1768. xfs_btree_cur_t *cur,
  1769. int *stat) /* success/failure */
  1770. {
  1771. int error; /* error return value */
  1772. #ifdef XFS_BMBT_TRACE
  1773. static char fname[] = "xfs_bmbt_delete";
  1774. #endif
  1775. int i;
  1776. int level;
  1777. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  1778. for (level = 0, i = 2; i == 2; level++) {
  1779. if ((error = xfs_bmbt_delrec(cur, level, &i))) {
  1780. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1781. return error;
  1782. }
  1783. }
  1784. if (i == 0) {
  1785. for (level = 1; level < cur->bc_nlevels; level++) {
  1786. if (cur->bc_ptrs[level] == 0) {
  1787. if ((error = xfs_bmbt_decrement(cur, level,
  1788. &i))) {
  1789. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  1790. return error;
  1791. }
  1792. break;
  1793. }
  1794. }
  1795. }
  1796. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  1797. *stat = i;
  1798. return 0;
  1799. }
  1800. /*
  1801. * Convert a compressed bmap extent record to an uncompressed form.
  1802. * This code must be in sync with the routines xfs_bmbt_get_startoff,
  1803. * xfs_bmbt_get_startblock, xfs_bmbt_get_blockcount and xfs_bmbt_get_state.
  1804. */
  1805. STATIC __inline__ void
  1806. __xfs_bmbt_get_all(
  1807. __uint64_t l0,
  1808. __uint64_t l1,
  1809. xfs_bmbt_irec_t *s)
  1810. {
  1811. int ext_flag;
  1812. xfs_exntst_t st;
  1813. ext_flag = (int)(l0 >> (64 - BMBT_EXNTFLAG_BITLEN));
  1814. s->br_startoff = ((xfs_fileoff_t)l0 &
  1815. XFS_MASK64LO(64 - BMBT_EXNTFLAG_BITLEN)) >> 9;
  1816. #if XFS_BIG_BLKNOS
  1817. s->br_startblock = (((xfs_fsblock_t)l0 & XFS_MASK64LO(9)) << 43) |
  1818. (((xfs_fsblock_t)l1) >> 21);
  1819. #else
  1820. #ifdef DEBUG
  1821. {
  1822. xfs_dfsbno_t b;
  1823. b = (((xfs_dfsbno_t)l0 & XFS_MASK64LO(9)) << 43) |
  1824. (((xfs_dfsbno_t)l1) >> 21);
  1825. ASSERT((b >> 32) == 0 || ISNULLDSTARTBLOCK(b));
  1826. s->br_startblock = (xfs_fsblock_t)b;
  1827. }
  1828. #else /* !DEBUG */
  1829. s->br_startblock = (xfs_fsblock_t)(((xfs_dfsbno_t)l1) >> 21);
  1830. #endif /* DEBUG */
  1831. #endif /* XFS_BIG_BLKNOS */
  1832. s->br_blockcount = (xfs_filblks_t)(l1 & XFS_MASK64LO(21));
  1833. /* This is xfs_extent_state() in-line */
  1834. if (ext_flag) {
  1835. ASSERT(s->br_blockcount != 0); /* saved for DMIG */
  1836. st = XFS_EXT_UNWRITTEN;
  1837. } else
  1838. st = XFS_EXT_NORM;
  1839. s->br_state = st;
  1840. }
  1841. void
  1842. xfs_bmbt_get_all(
  1843. xfs_bmbt_rec_t *r,
  1844. xfs_bmbt_irec_t *s)
  1845. {
  1846. __xfs_bmbt_get_all(r->l0, r->l1, s);
  1847. }
  1848. /*
  1849. * Get the block pointer for the given level of the cursor.
  1850. * Fill in the buffer pointer, if applicable.
  1851. */
  1852. xfs_bmbt_block_t *
  1853. xfs_bmbt_get_block(
  1854. xfs_btree_cur_t *cur,
  1855. int level,
  1856. xfs_buf_t **bpp)
  1857. {
  1858. xfs_ifork_t *ifp;
  1859. xfs_bmbt_block_t *rval;
  1860. if (level < cur->bc_nlevels - 1) {
  1861. *bpp = cur->bc_bufs[level];
  1862. rval = XFS_BUF_TO_BMBT_BLOCK(*bpp);
  1863. } else {
  1864. *bpp = NULL;
  1865. ifp = XFS_IFORK_PTR(cur->bc_private.b.ip,
  1866. cur->bc_private.b.whichfork);
  1867. rval = ifp->if_broot;
  1868. }
  1869. return rval;
  1870. }
  1871. /*
  1872. * Extract the blockcount field from an in memory bmap extent record.
  1873. */
  1874. xfs_filblks_t
  1875. xfs_bmbt_get_blockcount(
  1876. xfs_bmbt_rec_t *r)
  1877. {
  1878. return (xfs_filblks_t)(r->l1 & XFS_MASK64LO(21));
  1879. }
  1880. /*
  1881. * Extract the startblock field from an in memory bmap extent record.
  1882. */
  1883. xfs_fsblock_t
  1884. xfs_bmbt_get_startblock(
  1885. xfs_bmbt_rec_t *r)
  1886. {
  1887. #if XFS_BIG_BLKNOS
  1888. return (((xfs_fsblock_t)r->l0 & XFS_MASK64LO(9)) << 43) |
  1889. (((xfs_fsblock_t)r->l1) >> 21);
  1890. #else
  1891. #ifdef DEBUG
  1892. xfs_dfsbno_t b;
  1893. b = (((xfs_dfsbno_t)r->l0 & XFS_MASK64LO(9)) << 43) |
  1894. (((xfs_dfsbno_t)r->l1) >> 21);
  1895. ASSERT((b >> 32) == 0 || ISNULLDSTARTBLOCK(b));
  1896. return (xfs_fsblock_t)b;
  1897. #else /* !DEBUG */
  1898. return (xfs_fsblock_t)(((xfs_dfsbno_t)r->l1) >> 21);
  1899. #endif /* DEBUG */
  1900. #endif /* XFS_BIG_BLKNOS */
  1901. }
  1902. /*
  1903. * Extract the startoff field from an in memory bmap extent record.
  1904. */
  1905. xfs_fileoff_t
  1906. xfs_bmbt_get_startoff(
  1907. xfs_bmbt_rec_t *r)
  1908. {
  1909. return ((xfs_fileoff_t)r->l0 &
  1910. XFS_MASK64LO(64 - BMBT_EXNTFLAG_BITLEN)) >> 9;
  1911. }
  1912. xfs_exntst_t
  1913. xfs_bmbt_get_state(
  1914. xfs_bmbt_rec_t *r)
  1915. {
  1916. int ext_flag;
  1917. ext_flag = (int)((r->l0) >> (64 - BMBT_EXNTFLAG_BITLEN));
  1918. return xfs_extent_state(xfs_bmbt_get_blockcount(r),
  1919. ext_flag);
  1920. }
  1921. #ifndef XFS_NATIVE_HOST
  1922. /* Endian flipping versions of the bmbt extraction functions */
  1923. void
  1924. xfs_bmbt_disk_get_all(
  1925. xfs_bmbt_rec_t *r,
  1926. xfs_bmbt_irec_t *s)
  1927. {
  1928. __uint64_t l0, l1;
  1929. l0 = INT_GET(r->l0, ARCH_CONVERT);
  1930. l1 = INT_GET(r->l1, ARCH_CONVERT);
  1931. __xfs_bmbt_get_all(l0, l1, s);
  1932. }
  1933. /*
  1934. * Extract the blockcount field from an on disk bmap extent record.
  1935. */
  1936. xfs_filblks_t
  1937. xfs_bmbt_disk_get_blockcount(
  1938. xfs_bmbt_rec_t *r)
  1939. {
  1940. return (xfs_filblks_t)(INT_GET(r->l1, ARCH_CONVERT) & XFS_MASK64LO(21));
  1941. }
  1942. /*
  1943. * Extract the startblock field from an on disk bmap extent record.
  1944. */
  1945. xfs_fsblock_t
  1946. xfs_bmbt_disk_get_startblock(
  1947. xfs_bmbt_rec_t *r)
  1948. {
  1949. #if XFS_BIG_BLKNOS
  1950. return (((xfs_fsblock_t)INT_GET(r->l0, ARCH_CONVERT) & XFS_MASK64LO(9)) << 43) |
  1951. (((xfs_fsblock_t)INT_GET(r->l1, ARCH_CONVERT)) >> 21);
  1952. #else
  1953. #ifdef DEBUG
  1954. xfs_dfsbno_t b;
  1955. b = (((xfs_dfsbno_t)INT_GET(r->l0, ARCH_CONVERT) & XFS_MASK64LO(9)) << 43) |
  1956. (((xfs_dfsbno_t)INT_GET(r->l1, ARCH_CONVERT)) >> 21);
  1957. ASSERT((b >> 32) == 0 || ISNULLDSTARTBLOCK(b));
  1958. return (xfs_fsblock_t)b;
  1959. #else /* !DEBUG */
  1960. return (xfs_fsblock_t)(((xfs_dfsbno_t)INT_GET(r->l1, ARCH_CONVERT)) >> 21);
  1961. #endif /* DEBUG */
  1962. #endif /* XFS_BIG_BLKNOS */
  1963. }
  1964. /*
  1965. * Extract the startoff field from a disk format bmap extent record.
  1966. */
  1967. xfs_fileoff_t
  1968. xfs_bmbt_disk_get_startoff(
  1969. xfs_bmbt_rec_t *r)
  1970. {
  1971. return ((xfs_fileoff_t)INT_GET(r->l0, ARCH_CONVERT) &
  1972. XFS_MASK64LO(64 - BMBT_EXNTFLAG_BITLEN)) >> 9;
  1973. }
  1974. xfs_exntst_t
  1975. xfs_bmbt_disk_get_state(
  1976. xfs_bmbt_rec_t *r)
  1977. {
  1978. int ext_flag;
  1979. ext_flag = (int)((INT_GET(r->l0, ARCH_CONVERT)) >> (64 - BMBT_EXNTFLAG_BITLEN));
  1980. return xfs_extent_state(xfs_bmbt_disk_get_blockcount(r),
  1981. ext_flag);
  1982. }
  1983. #endif /* XFS_NATIVE_HOST */
  1984. /*
  1985. * Increment cursor by one record at the level.
  1986. * For nonzero levels the leaf-ward information is untouched.
  1987. */
  1988. int /* error */
  1989. xfs_bmbt_increment(
  1990. xfs_btree_cur_t *cur,
  1991. int level,
  1992. int *stat) /* success/failure */
  1993. {
  1994. xfs_bmbt_block_t *block;
  1995. xfs_buf_t *bp;
  1996. int error; /* error return value */
  1997. #ifdef XFS_BMBT_TRACE
  1998. static char fname[] = "xfs_bmbt_increment";
  1999. #endif
  2000. xfs_fsblock_t fsbno;
  2001. int lev;
  2002. xfs_mount_t *mp;
  2003. xfs_trans_t *tp;
  2004. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  2005. XFS_BMBT_TRACE_ARGI(cur, level);
  2006. ASSERT(level < cur->bc_nlevels);
  2007. if (level < cur->bc_nlevels - 1)
  2008. xfs_btree_readahead(cur, level, XFS_BTCUR_RIGHTRA);
  2009. block = xfs_bmbt_get_block(cur, level, &bp);
  2010. #ifdef DEBUG
  2011. if ((error = xfs_btree_check_lblock(cur, block, level, bp))) {
  2012. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2013. return error;
  2014. }
  2015. #endif
  2016. if (++cur->bc_ptrs[level] <= be16_to_cpu(block->bb_numrecs)) {
  2017. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2018. *stat = 1;
  2019. return 0;
  2020. }
  2021. if (be64_to_cpu(block->bb_rightsib) == NULLDFSBNO) {
  2022. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2023. *stat = 0;
  2024. return 0;
  2025. }
  2026. for (lev = level + 1; lev < cur->bc_nlevels; lev++) {
  2027. block = xfs_bmbt_get_block(cur, lev, &bp);
  2028. #ifdef DEBUG
  2029. if ((error = xfs_btree_check_lblock(cur, block, lev, bp))) {
  2030. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2031. return error;
  2032. }
  2033. #endif
  2034. if (++cur->bc_ptrs[lev] <= be16_to_cpu(block->bb_numrecs))
  2035. break;
  2036. if (lev < cur->bc_nlevels - 1)
  2037. xfs_btree_readahead(cur, lev, XFS_BTCUR_RIGHTRA);
  2038. }
  2039. if (lev == cur->bc_nlevels) {
  2040. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2041. *stat = 0;
  2042. return 0;
  2043. }
  2044. tp = cur->bc_tp;
  2045. mp = cur->bc_mp;
  2046. for (block = xfs_bmbt_get_block(cur, lev, &bp); lev > level; ) {
  2047. fsbno = be64_to_cpu(*XFS_BMAP_PTR_IADDR(block, cur->bc_ptrs[lev], cur));
  2048. if ((error = xfs_btree_read_bufl(mp, tp, fsbno, 0, &bp,
  2049. XFS_BMAP_BTREE_REF))) {
  2050. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2051. return error;
  2052. }
  2053. lev--;
  2054. xfs_btree_setbuf(cur, lev, bp);
  2055. block = XFS_BUF_TO_BMBT_BLOCK(bp);
  2056. if ((error = xfs_btree_check_lblock(cur, block, lev, bp))) {
  2057. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2058. return error;
  2059. }
  2060. cur->bc_ptrs[lev] = 1;
  2061. }
  2062. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2063. *stat = 1;
  2064. return 0;
  2065. }
  2066. /*
  2067. * Insert the current record at the point referenced by cur.
  2068. */
  2069. int /* error */
  2070. xfs_bmbt_insert(
  2071. xfs_btree_cur_t *cur,
  2072. int *stat) /* success/failure */
  2073. {
  2074. int error; /* error return value */
  2075. #ifdef XFS_BMBT_TRACE
  2076. static char fname[] = "xfs_bmbt_insert";
  2077. #endif
  2078. int i;
  2079. int level;
  2080. xfs_fsblock_t nbno;
  2081. xfs_btree_cur_t *ncur;
  2082. xfs_bmbt_rec_t nrec;
  2083. xfs_btree_cur_t *pcur;
  2084. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  2085. level = 0;
  2086. nbno = NULLFSBLOCK;
  2087. xfs_bmbt_disk_set_all(&nrec, &cur->bc_rec.b);
  2088. ncur = NULL;
  2089. pcur = cur;
  2090. do {
  2091. if ((error = xfs_bmbt_insrec(pcur, level++, &nbno, &nrec, &ncur,
  2092. &i))) {
  2093. if (pcur != cur)
  2094. xfs_btree_del_cursor(pcur, XFS_BTREE_ERROR);
  2095. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2096. return error;
  2097. }
  2098. XFS_WANT_CORRUPTED_GOTO(i == 1, error0);
  2099. if (pcur != cur && (ncur || nbno == NULLFSBLOCK)) {
  2100. cur->bc_nlevels = pcur->bc_nlevels;
  2101. cur->bc_private.b.allocated +=
  2102. pcur->bc_private.b.allocated;
  2103. pcur->bc_private.b.allocated = 0;
  2104. ASSERT((cur->bc_private.b.firstblock != NULLFSBLOCK) ||
  2105. (cur->bc_private.b.ip->i_d.di_flags &
  2106. XFS_DIFLAG_REALTIME));
  2107. cur->bc_private.b.firstblock =
  2108. pcur->bc_private.b.firstblock;
  2109. ASSERT(cur->bc_private.b.flist ==
  2110. pcur->bc_private.b.flist);
  2111. xfs_btree_del_cursor(pcur, XFS_BTREE_NOERROR);
  2112. }
  2113. if (ncur) {
  2114. pcur = ncur;
  2115. ncur = NULL;
  2116. }
  2117. } while (nbno != NULLFSBLOCK);
  2118. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2119. *stat = i;
  2120. return 0;
  2121. error0:
  2122. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2123. return error;
  2124. }
  2125. /*
  2126. * Log fields from the btree block header.
  2127. */
  2128. void
  2129. xfs_bmbt_log_block(
  2130. xfs_btree_cur_t *cur,
  2131. xfs_buf_t *bp,
  2132. int fields)
  2133. {
  2134. int first;
  2135. #ifdef XFS_BMBT_TRACE
  2136. static char fname[] = "xfs_bmbt_log_block";
  2137. #endif
  2138. int last;
  2139. xfs_trans_t *tp;
  2140. static const short offsets[] = {
  2141. offsetof(xfs_bmbt_block_t, bb_magic),
  2142. offsetof(xfs_bmbt_block_t, bb_level),
  2143. offsetof(xfs_bmbt_block_t, bb_numrecs),
  2144. offsetof(xfs_bmbt_block_t, bb_leftsib),
  2145. offsetof(xfs_bmbt_block_t, bb_rightsib),
  2146. sizeof(xfs_bmbt_block_t)
  2147. };
  2148. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  2149. XFS_BMBT_TRACE_ARGBI(cur, bp, fields);
  2150. tp = cur->bc_tp;
  2151. if (bp) {
  2152. xfs_btree_offsets(fields, offsets, XFS_BB_NUM_BITS, &first,
  2153. &last);
  2154. xfs_trans_log_buf(tp, bp, first, last);
  2155. } else
  2156. xfs_trans_log_inode(tp, cur->bc_private.b.ip,
  2157. XFS_ILOG_FBROOT(cur->bc_private.b.whichfork));
  2158. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2159. }
  2160. /*
  2161. * Log record values from the btree block.
  2162. */
  2163. void
  2164. xfs_bmbt_log_recs(
  2165. xfs_btree_cur_t *cur,
  2166. xfs_buf_t *bp,
  2167. int rfirst,
  2168. int rlast)
  2169. {
  2170. xfs_bmbt_block_t *block;
  2171. int first;
  2172. #ifdef XFS_BMBT_TRACE
  2173. static char fname[] = "xfs_bmbt_log_recs";
  2174. #endif
  2175. int last;
  2176. xfs_bmbt_rec_t *rp;
  2177. xfs_trans_t *tp;
  2178. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  2179. XFS_BMBT_TRACE_ARGBII(cur, bp, rfirst, rlast);
  2180. ASSERT(bp);
  2181. tp = cur->bc_tp;
  2182. block = XFS_BUF_TO_BMBT_BLOCK(bp);
  2183. rp = XFS_BMAP_REC_DADDR(block, 1, cur);
  2184. first = (int)((xfs_caddr_t)&rp[rfirst - 1] - (xfs_caddr_t)block);
  2185. last = (int)(((xfs_caddr_t)&rp[rlast] - 1) - (xfs_caddr_t)block);
  2186. xfs_trans_log_buf(tp, bp, first, last);
  2187. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2188. }
  2189. int /* error */
  2190. xfs_bmbt_lookup_eq(
  2191. xfs_btree_cur_t *cur,
  2192. xfs_fileoff_t off,
  2193. xfs_fsblock_t bno,
  2194. xfs_filblks_t len,
  2195. int *stat) /* success/failure */
  2196. {
  2197. cur->bc_rec.b.br_startoff = off;
  2198. cur->bc_rec.b.br_startblock = bno;
  2199. cur->bc_rec.b.br_blockcount = len;
  2200. return xfs_bmbt_lookup(cur, XFS_LOOKUP_EQ, stat);
  2201. }
  2202. int /* error */
  2203. xfs_bmbt_lookup_ge(
  2204. xfs_btree_cur_t *cur,
  2205. xfs_fileoff_t off,
  2206. xfs_fsblock_t bno,
  2207. xfs_filblks_t len,
  2208. int *stat) /* success/failure */
  2209. {
  2210. cur->bc_rec.b.br_startoff = off;
  2211. cur->bc_rec.b.br_startblock = bno;
  2212. cur->bc_rec.b.br_blockcount = len;
  2213. return xfs_bmbt_lookup(cur, XFS_LOOKUP_GE, stat);
  2214. }
  2215. /*
  2216. * Give the bmap btree a new root block. Copy the old broot contents
  2217. * down into a real block and make the broot point to it.
  2218. */
  2219. int /* error */
  2220. xfs_bmbt_newroot(
  2221. xfs_btree_cur_t *cur, /* btree cursor */
  2222. int *logflags, /* logging flags for inode */
  2223. int *stat) /* return status - 0 fail */
  2224. {
  2225. xfs_alloc_arg_t args; /* allocation arguments */
  2226. xfs_bmbt_block_t *block; /* bmap btree block */
  2227. xfs_buf_t *bp; /* buffer for block */
  2228. xfs_bmbt_block_t *cblock; /* child btree block */
  2229. xfs_bmbt_key_t *ckp; /* child key pointer */
  2230. xfs_bmbt_ptr_t *cpp; /* child ptr pointer */
  2231. int error; /* error return code */
  2232. #ifdef XFS_BMBT_TRACE
  2233. static char fname[] = "xfs_bmbt_newroot";
  2234. #endif
  2235. #ifdef DEBUG
  2236. int i; /* loop counter */
  2237. #endif
  2238. xfs_bmbt_key_t *kp; /* pointer to bmap btree key */
  2239. int level; /* btree level */
  2240. xfs_bmbt_ptr_t *pp; /* pointer to bmap block addr */
  2241. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  2242. level = cur->bc_nlevels - 1;
  2243. block = xfs_bmbt_get_block(cur, level, &bp);
  2244. /*
  2245. * Copy the root into a real block.
  2246. */
  2247. args.mp = cur->bc_mp;
  2248. pp = XFS_BMAP_PTR_IADDR(block, 1, cur);
  2249. args.tp = cur->bc_tp;
  2250. args.fsbno = cur->bc_private.b.firstblock;
  2251. args.mod = args.minleft = args.alignment = args.total = args.isfl =
  2252. args.userdata = args.minalignslop = 0;
  2253. args.minlen = args.maxlen = args.prod = 1;
  2254. args.wasdel = cur->bc_private.b.flags & XFS_BTCUR_BPRV_WASDEL;
  2255. args.firstblock = args.fsbno;
  2256. if (args.fsbno == NULLFSBLOCK) {
  2257. #ifdef DEBUG
  2258. if ((error = xfs_btree_check_lptr_disk(cur, *pp, level))) {
  2259. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2260. return error;
  2261. }
  2262. #endif
  2263. args.fsbno = be64_to_cpu(*pp);
  2264. args.type = XFS_ALLOCTYPE_START_BNO;
  2265. } else
  2266. args.type = XFS_ALLOCTYPE_NEAR_BNO;
  2267. if ((error = xfs_alloc_vextent(&args))) {
  2268. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2269. return error;
  2270. }
  2271. if (args.fsbno == NULLFSBLOCK) {
  2272. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2273. *stat = 0;
  2274. return 0;
  2275. }
  2276. ASSERT(args.len == 1);
  2277. cur->bc_private.b.firstblock = args.fsbno;
  2278. cur->bc_private.b.allocated++;
  2279. cur->bc_private.b.ip->i_d.di_nblocks++;
  2280. XFS_TRANS_MOD_DQUOT_BYINO(args.mp, args.tp, cur->bc_private.b.ip,
  2281. XFS_TRANS_DQ_BCOUNT, 1L);
  2282. bp = xfs_btree_get_bufl(args.mp, cur->bc_tp, args.fsbno, 0);
  2283. cblock = XFS_BUF_TO_BMBT_BLOCK(bp);
  2284. *cblock = *block;
  2285. be16_add(&block->bb_level, 1);
  2286. block->bb_numrecs = cpu_to_be16(1);
  2287. cur->bc_nlevels++;
  2288. cur->bc_ptrs[level + 1] = 1;
  2289. kp = XFS_BMAP_KEY_IADDR(block, 1, cur);
  2290. ckp = XFS_BMAP_KEY_IADDR(cblock, 1, cur);
  2291. memcpy(ckp, kp, be16_to_cpu(cblock->bb_numrecs) * sizeof(*kp));
  2292. cpp = XFS_BMAP_PTR_IADDR(cblock, 1, cur);
  2293. #ifdef DEBUG
  2294. for (i = 0; i < be16_to_cpu(cblock->bb_numrecs); i++) {
  2295. if ((error = xfs_btree_check_lptr_disk(cur, pp[i], level))) {
  2296. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2297. return error;
  2298. }
  2299. }
  2300. #endif
  2301. memcpy(cpp, pp, be16_to_cpu(cblock->bb_numrecs) * sizeof(*pp));
  2302. #ifdef DEBUG
  2303. if ((error = xfs_btree_check_lptr(cur, args.fsbno, level))) {
  2304. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2305. return error;
  2306. }
  2307. #endif
  2308. *pp = cpu_to_be64(args.fsbno);
  2309. xfs_iroot_realloc(cur->bc_private.b.ip, 1 - be16_to_cpu(cblock->bb_numrecs),
  2310. cur->bc_private.b.whichfork);
  2311. xfs_btree_setbuf(cur, level, bp);
  2312. /*
  2313. * Do all this logging at the end so that
  2314. * the root is at the right level.
  2315. */
  2316. xfs_bmbt_log_block(cur, bp, XFS_BB_ALL_BITS);
  2317. xfs_bmbt_log_keys(cur, bp, 1, be16_to_cpu(cblock->bb_numrecs));
  2318. xfs_bmbt_log_ptrs(cur, bp, 1, be16_to_cpu(cblock->bb_numrecs));
  2319. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2320. *logflags |=
  2321. XFS_ILOG_CORE | XFS_ILOG_FBROOT(cur->bc_private.b.whichfork);
  2322. *stat = 1;
  2323. return 0;
  2324. }
  2325. /*
  2326. * Set all the fields in a bmap extent record from the uncompressed form.
  2327. */
  2328. void
  2329. xfs_bmbt_set_all(
  2330. xfs_bmbt_rec_t *r,
  2331. xfs_bmbt_irec_t *s)
  2332. {
  2333. int extent_flag;
  2334. ASSERT((s->br_state == XFS_EXT_NORM) ||
  2335. (s->br_state == XFS_EXT_UNWRITTEN));
  2336. extent_flag = (s->br_state == XFS_EXT_NORM) ? 0 : 1;
  2337. ASSERT((s->br_startoff & XFS_MASK64HI(9)) == 0);
  2338. ASSERT((s->br_blockcount & XFS_MASK64HI(43)) == 0);
  2339. #if XFS_BIG_BLKNOS
  2340. ASSERT((s->br_startblock & XFS_MASK64HI(12)) == 0);
  2341. r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2342. ((xfs_bmbt_rec_base_t)s->br_startoff << 9) |
  2343. ((xfs_bmbt_rec_base_t)s->br_startblock >> 43);
  2344. r->l1 = ((xfs_bmbt_rec_base_t)s->br_startblock << 21) |
  2345. ((xfs_bmbt_rec_base_t)s->br_blockcount &
  2346. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
  2347. #else /* !XFS_BIG_BLKNOS */
  2348. if (ISNULLSTARTBLOCK(s->br_startblock)) {
  2349. r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2350. ((xfs_bmbt_rec_base_t)s->br_startoff << 9) |
  2351. (xfs_bmbt_rec_base_t)XFS_MASK64LO(9);
  2352. r->l1 = XFS_MASK64HI(11) |
  2353. ((xfs_bmbt_rec_base_t)s->br_startblock << 21) |
  2354. ((xfs_bmbt_rec_base_t)s->br_blockcount &
  2355. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
  2356. } else {
  2357. r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2358. ((xfs_bmbt_rec_base_t)s->br_startoff << 9);
  2359. r->l1 = ((xfs_bmbt_rec_base_t)s->br_startblock << 21) |
  2360. ((xfs_bmbt_rec_base_t)s->br_blockcount &
  2361. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
  2362. }
  2363. #endif /* XFS_BIG_BLKNOS */
  2364. }
  2365. /*
  2366. * Set all the fields in a bmap extent record from the arguments.
  2367. */
  2368. void
  2369. xfs_bmbt_set_allf(
  2370. xfs_bmbt_rec_t *r,
  2371. xfs_fileoff_t o,
  2372. xfs_fsblock_t b,
  2373. xfs_filblks_t c,
  2374. xfs_exntst_t v)
  2375. {
  2376. int extent_flag;
  2377. ASSERT((v == XFS_EXT_NORM) || (v == XFS_EXT_UNWRITTEN));
  2378. extent_flag = (v == XFS_EXT_NORM) ? 0 : 1;
  2379. ASSERT((o & XFS_MASK64HI(64-BMBT_STARTOFF_BITLEN)) == 0);
  2380. ASSERT((c & XFS_MASK64HI(64-BMBT_BLOCKCOUNT_BITLEN)) == 0);
  2381. #if XFS_BIG_BLKNOS
  2382. ASSERT((b & XFS_MASK64HI(64-BMBT_STARTBLOCK_BITLEN)) == 0);
  2383. r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2384. ((xfs_bmbt_rec_base_t)o << 9) |
  2385. ((xfs_bmbt_rec_base_t)b >> 43);
  2386. r->l1 = ((xfs_bmbt_rec_base_t)b << 21) |
  2387. ((xfs_bmbt_rec_base_t)c &
  2388. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
  2389. #else /* !XFS_BIG_BLKNOS */
  2390. if (ISNULLSTARTBLOCK(b)) {
  2391. r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2392. ((xfs_bmbt_rec_base_t)o << 9) |
  2393. (xfs_bmbt_rec_base_t)XFS_MASK64LO(9);
  2394. r->l1 = XFS_MASK64HI(11) |
  2395. ((xfs_bmbt_rec_base_t)b << 21) |
  2396. ((xfs_bmbt_rec_base_t)c &
  2397. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
  2398. } else {
  2399. r->l0 = ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2400. ((xfs_bmbt_rec_base_t)o << 9);
  2401. r->l1 = ((xfs_bmbt_rec_base_t)b << 21) |
  2402. ((xfs_bmbt_rec_base_t)c &
  2403. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
  2404. }
  2405. #endif /* XFS_BIG_BLKNOS */
  2406. }
  2407. #ifndef XFS_NATIVE_HOST
  2408. /*
  2409. * Set all the fields in a bmap extent record from the uncompressed form.
  2410. */
  2411. void
  2412. xfs_bmbt_disk_set_all(
  2413. xfs_bmbt_rec_t *r,
  2414. xfs_bmbt_irec_t *s)
  2415. {
  2416. int extent_flag;
  2417. ASSERT((s->br_state == XFS_EXT_NORM) ||
  2418. (s->br_state == XFS_EXT_UNWRITTEN));
  2419. extent_flag = (s->br_state == XFS_EXT_NORM) ? 0 : 1;
  2420. ASSERT((s->br_startoff & XFS_MASK64HI(9)) == 0);
  2421. ASSERT((s->br_blockcount & XFS_MASK64HI(43)) == 0);
  2422. #if XFS_BIG_BLKNOS
  2423. ASSERT((s->br_startblock & XFS_MASK64HI(12)) == 0);
  2424. INT_SET(r->l0, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2425. ((xfs_bmbt_rec_base_t)s->br_startoff << 9) |
  2426. ((xfs_bmbt_rec_base_t)s->br_startblock >> 43));
  2427. INT_SET(r->l1, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)s->br_startblock << 21) |
  2428. ((xfs_bmbt_rec_base_t)s->br_blockcount &
  2429. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)));
  2430. #else /* !XFS_BIG_BLKNOS */
  2431. if (ISNULLSTARTBLOCK(s->br_startblock)) {
  2432. INT_SET(r->l0, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2433. ((xfs_bmbt_rec_base_t)s->br_startoff << 9) |
  2434. (xfs_bmbt_rec_base_t)XFS_MASK64LO(9));
  2435. INT_SET(r->l1, ARCH_CONVERT, XFS_MASK64HI(11) |
  2436. ((xfs_bmbt_rec_base_t)s->br_startblock << 21) |
  2437. ((xfs_bmbt_rec_base_t)s->br_blockcount &
  2438. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)));
  2439. } else {
  2440. INT_SET(r->l0, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2441. ((xfs_bmbt_rec_base_t)s->br_startoff << 9));
  2442. INT_SET(r->l1, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)s->br_startblock << 21) |
  2443. ((xfs_bmbt_rec_base_t)s->br_blockcount &
  2444. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)));
  2445. }
  2446. #endif /* XFS_BIG_BLKNOS */
  2447. }
  2448. /*
  2449. * Set all the fields in a disk format bmap extent record from the arguments.
  2450. */
  2451. void
  2452. xfs_bmbt_disk_set_allf(
  2453. xfs_bmbt_rec_t *r,
  2454. xfs_fileoff_t o,
  2455. xfs_fsblock_t b,
  2456. xfs_filblks_t c,
  2457. xfs_exntst_t v)
  2458. {
  2459. int extent_flag;
  2460. ASSERT((v == XFS_EXT_NORM) || (v == XFS_EXT_UNWRITTEN));
  2461. extent_flag = (v == XFS_EXT_NORM) ? 0 : 1;
  2462. ASSERT((o & XFS_MASK64HI(64-BMBT_STARTOFF_BITLEN)) == 0);
  2463. ASSERT((c & XFS_MASK64HI(64-BMBT_BLOCKCOUNT_BITLEN)) == 0);
  2464. #if XFS_BIG_BLKNOS
  2465. ASSERT((b & XFS_MASK64HI(64-BMBT_STARTBLOCK_BITLEN)) == 0);
  2466. INT_SET(r->l0, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2467. ((xfs_bmbt_rec_base_t)o << 9) |
  2468. ((xfs_bmbt_rec_base_t)b >> 43));
  2469. INT_SET(r->l1, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)b << 21) |
  2470. ((xfs_bmbt_rec_base_t)c &
  2471. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)));
  2472. #else /* !XFS_BIG_BLKNOS */
  2473. if (ISNULLSTARTBLOCK(b)) {
  2474. INT_SET(r->l0, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2475. ((xfs_bmbt_rec_base_t)o << 9) |
  2476. (xfs_bmbt_rec_base_t)XFS_MASK64LO(9));
  2477. INT_SET(r->l1, ARCH_CONVERT, XFS_MASK64HI(11) |
  2478. ((xfs_bmbt_rec_base_t)b << 21) |
  2479. ((xfs_bmbt_rec_base_t)c &
  2480. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)));
  2481. } else {
  2482. INT_SET(r->l0, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)extent_flag << 63) |
  2483. ((xfs_bmbt_rec_base_t)o << 9));
  2484. INT_SET(r->l1, ARCH_CONVERT, ((xfs_bmbt_rec_base_t)b << 21) |
  2485. ((xfs_bmbt_rec_base_t)c &
  2486. (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)));
  2487. }
  2488. #endif /* XFS_BIG_BLKNOS */
  2489. }
  2490. #endif /* XFS_NATIVE_HOST */
  2491. /*
  2492. * Set the blockcount field in a bmap extent record.
  2493. */
  2494. void
  2495. xfs_bmbt_set_blockcount(
  2496. xfs_bmbt_rec_t *r,
  2497. xfs_filblks_t v)
  2498. {
  2499. ASSERT((v & XFS_MASK64HI(43)) == 0);
  2500. r->l1 = (r->l1 & (xfs_bmbt_rec_base_t)XFS_MASK64HI(43)) |
  2501. (xfs_bmbt_rec_base_t)(v & XFS_MASK64LO(21));
  2502. }
  2503. /*
  2504. * Set the startblock field in a bmap extent record.
  2505. */
  2506. void
  2507. xfs_bmbt_set_startblock(
  2508. xfs_bmbt_rec_t *r,
  2509. xfs_fsblock_t v)
  2510. {
  2511. #if XFS_BIG_BLKNOS
  2512. ASSERT((v & XFS_MASK64HI(12)) == 0);
  2513. r->l0 = (r->l0 & (xfs_bmbt_rec_base_t)XFS_MASK64HI(55)) |
  2514. (xfs_bmbt_rec_base_t)(v >> 43);
  2515. r->l1 = (r->l1 & (xfs_bmbt_rec_base_t)XFS_MASK64LO(21)) |
  2516. (xfs_bmbt_rec_base_t)(v << 21);
  2517. #else /* !XFS_BIG_BLKNOS */
  2518. if (ISNULLSTARTBLOCK(v)) {
  2519. r->l0 |= (xfs_bmbt_rec_base_t)XFS_MASK64LO(9);
  2520. r->l1 = (xfs_bmbt_rec_base_t)XFS_MASK64HI(11) |
  2521. ((xfs_bmbt_rec_base_t)v << 21) |
  2522. (r->l1 & (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
  2523. } else {
  2524. r->l0 &= ~(xfs_bmbt_rec_base_t)XFS_MASK64LO(9);
  2525. r->l1 = ((xfs_bmbt_rec_base_t)v << 21) |
  2526. (r->l1 & (xfs_bmbt_rec_base_t)XFS_MASK64LO(21));
  2527. }
  2528. #endif /* XFS_BIG_BLKNOS */
  2529. }
  2530. /*
  2531. * Set the startoff field in a bmap extent record.
  2532. */
  2533. void
  2534. xfs_bmbt_set_startoff(
  2535. xfs_bmbt_rec_t *r,
  2536. xfs_fileoff_t v)
  2537. {
  2538. ASSERT((v & XFS_MASK64HI(9)) == 0);
  2539. r->l0 = (r->l0 & (xfs_bmbt_rec_base_t) XFS_MASK64HI(1)) |
  2540. ((xfs_bmbt_rec_base_t)v << 9) |
  2541. (r->l0 & (xfs_bmbt_rec_base_t)XFS_MASK64LO(9));
  2542. }
  2543. /*
  2544. * Set the extent state field in a bmap extent record.
  2545. */
  2546. void
  2547. xfs_bmbt_set_state(
  2548. xfs_bmbt_rec_t *r,
  2549. xfs_exntst_t v)
  2550. {
  2551. ASSERT(v == XFS_EXT_NORM || v == XFS_EXT_UNWRITTEN);
  2552. if (v == XFS_EXT_NORM)
  2553. r->l0 &= XFS_MASK64LO(64 - BMBT_EXNTFLAG_BITLEN);
  2554. else
  2555. r->l0 |= XFS_MASK64HI(BMBT_EXNTFLAG_BITLEN);
  2556. }
  2557. /*
  2558. * Convert in-memory form of btree root to on-disk form.
  2559. */
  2560. void
  2561. xfs_bmbt_to_bmdr(
  2562. xfs_bmbt_block_t *rblock,
  2563. int rblocklen,
  2564. xfs_bmdr_block_t *dblock,
  2565. int dblocklen)
  2566. {
  2567. int dmxr;
  2568. xfs_bmbt_key_t *fkp;
  2569. __be64 *fpp;
  2570. xfs_bmbt_key_t *tkp;
  2571. __be64 *tpp;
  2572. ASSERT(be32_to_cpu(rblock->bb_magic) == XFS_BMAP_MAGIC);
  2573. ASSERT(be64_to_cpu(rblock->bb_leftsib) == NULLDFSBNO);
  2574. ASSERT(be64_to_cpu(rblock->bb_rightsib) == NULLDFSBNO);
  2575. ASSERT(be16_to_cpu(rblock->bb_level) > 0);
  2576. dblock->bb_level = rblock->bb_level;
  2577. dblock->bb_numrecs = rblock->bb_numrecs;
  2578. dmxr = (int)XFS_BTREE_BLOCK_MAXRECS(dblocklen, xfs_bmdr, 0);
  2579. fkp = XFS_BMAP_BROOT_KEY_ADDR(rblock, 1, rblocklen);
  2580. tkp = XFS_BTREE_KEY_ADDR(dblocklen, xfs_bmdr, dblock, 1, dmxr);
  2581. fpp = XFS_BMAP_BROOT_PTR_ADDR(rblock, 1, rblocklen);
  2582. tpp = XFS_BTREE_PTR_ADDR(dblocklen, xfs_bmdr, dblock, 1, dmxr);
  2583. dmxr = be16_to_cpu(dblock->bb_numrecs);
  2584. memcpy(tkp, fkp, sizeof(*fkp) * dmxr);
  2585. memcpy(tpp, fpp, sizeof(*fpp) * dmxr);
  2586. }
  2587. /*
  2588. * Update the record to the passed values.
  2589. */
  2590. int
  2591. xfs_bmbt_update(
  2592. xfs_btree_cur_t *cur,
  2593. xfs_fileoff_t off,
  2594. xfs_fsblock_t bno,
  2595. xfs_filblks_t len,
  2596. xfs_exntst_t state)
  2597. {
  2598. xfs_bmbt_block_t *block;
  2599. xfs_buf_t *bp;
  2600. int error;
  2601. #ifdef XFS_BMBT_TRACE
  2602. static char fname[] = "xfs_bmbt_update";
  2603. #endif
  2604. xfs_bmbt_key_t key;
  2605. int ptr;
  2606. xfs_bmbt_rec_t *rp;
  2607. XFS_BMBT_TRACE_CURSOR(cur, ENTRY);
  2608. XFS_BMBT_TRACE_ARGFFFI(cur, (xfs_dfiloff_t)off, (xfs_dfsbno_t)bno,
  2609. (xfs_dfilblks_t)len, (int)state);
  2610. block = xfs_bmbt_get_block(cur, 0, &bp);
  2611. #ifdef DEBUG
  2612. if ((error = xfs_btree_check_lblock(cur, block, 0, bp))) {
  2613. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2614. return error;
  2615. }
  2616. #endif
  2617. ptr = cur->bc_ptrs[0];
  2618. rp = XFS_BMAP_REC_IADDR(block, ptr, cur);
  2619. xfs_bmbt_disk_set_allf(rp, off, bno, len, state);
  2620. xfs_bmbt_log_recs(cur, bp, ptr, ptr);
  2621. if (ptr > 1) {
  2622. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2623. return 0;
  2624. }
  2625. key.br_startoff = cpu_to_be64(off);
  2626. if ((error = xfs_bmbt_updkey(cur, &key, 1))) {
  2627. XFS_BMBT_TRACE_CURSOR(cur, ERROR);
  2628. return error;
  2629. }
  2630. XFS_BMBT_TRACE_CURSOR(cur, EXIT);
  2631. return 0;
  2632. }
  2633. /*
  2634. * Check extent records, which have just been read, for
  2635. * any bit in the extent flag field. ASSERT on debug
  2636. * kernels, as this condition should not occur.
  2637. * Return an error condition (1) if any flags found,
  2638. * otherwise return 0.
  2639. */
  2640. int
  2641. xfs_check_nostate_extents(
  2642. xfs_ifork_t *ifp,
  2643. xfs_extnum_t idx,
  2644. xfs_extnum_t num)
  2645. {
  2646. xfs_bmbt_rec_t *ep;
  2647. for (; num > 0; num--, idx++) {
  2648. ep = xfs_iext_get_ext(ifp, idx);
  2649. if ((ep->l0 >>
  2650. (64 - BMBT_EXNTFLAG_BITLEN)) != 0) {
  2651. ASSERT(0);
  2652. return 1;
  2653. }
  2654. }
  2655. return 0;
  2656. }