i915_gem_gtt.c 40 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703
  1. /*
  2. * Copyright © 2016 Intel Corporation
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a
  5. * copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8. * and/or sell copies of the Software, and to permit persons to whom the
  9. * Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice (including the next
  12. * paragraph) shall be included in all copies or substantial portions of the
  13. * Software.
  14. *
  15. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  16. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  17. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
  18. * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  19. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  20. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  21. * IN THE SOFTWARE.
  22. *
  23. */
  24. #include <linux/list_sort.h>
  25. #include <linux/prime_numbers.h>
  26. #include "../i915_selftest.h"
  27. #include "i915_random.h"
  28. #include "mock_context.h"
  29. #include "mock_drm.h"
  30. #include "mock_gem_device.h"
  31. static void cleanup_freed_objects(struct drm_i915_private *i915)
  32. {
  33. /*
  34. * As we may hold onto the struct_mutex for inordinate lengths of
  35. * time, the NMI khungtaskd detector may fire for the free objects
  36. * worker.
  37. */
  38. mutex_unlock(&i915->drm.struct_mutex);
  39. i915_gem_drain_freed_objects(i915);
  40. mutex_lock(&i915->drm.struct_mutex);
  41. }
  42. static void fake_free_pages(struct drm_i915_gem_object *obj,
  43. struct sg_table *pages)
  44. {
  45. sg_free_table(pages);
  46. kfree(pages);
  47. }
  48. static int fake_get_pages(struct drm_i915_gem_object *obj)
  49. {
  50. #define GFP (GFP_KERNEL | __GFP_NOWARN | __GFP_NORETRY)
  51. #define PFN_BIAS 0x1000
  52. struct sg_table *pages;
  53. struct scatterlist *sg;
  54. unsigned int sg_page_sizes;
  55. typeof(obj->base.size) rem;
  56. pages = kmalloc(sizeof(*pages), GFP);
  57. if (!pages)
  58. return -ENOMEM;
  59. rem = round_up(obj->base.size, BIT(31)) >> 31;
  60. if (sg_alloc_table(pages, rem, GFP)) {
  61. kfree(pages);
  62. return -ENOMEM;
  63. }
  64. sg_page_sizes = 0;
  65. rem = obj->base.size;
  66. for (sg = pages->sgl; sg; sg = sg_next(sg)) {
  67. unsigned long len = min_t(typeof(rem), rem, BIT(31));
  68. GEM_BUG_ON(!len);
  69. sg_set_page(sg, pfn_to_page(PFN_BIAS), len, 0);
  70. sg_dma_address(sg) = page_to_phys(sg_page(sg));
  71. sg_dma_len(sg) = len;
  72. sg_page_sizes |= len;
  73. rem -= len;
  74. }
  75. GEM_BUG_ON(rem);
  76. obj->mm.madv = I915_MADV_DONTNEED;
  77. __i915_gem_object_set_pages(obj, pages, sg_page_sizes);
  78. return 0;
  79. #undef GFP
  80. }
  81. static void fake_put_pages(struct drm_i915_gem_object *obj,
  82. struct sg_table *pages)
  83. {
  84. fake_free_pages(obj, pages);
  85. obj->mm.dirty = false;
  86. obj->mm.madv = I915_MADV_WILLNEED;
  87. }
  88. static const struct drm_i915_gem_object_ops fake_ops = {
  89. .flags = I915_GEM_OBJECT_IS_SHRINKABLE,
  90. .get_pages = fake_get_pages,
  91. .put_pages = fake_put_pages,
  92. };
  93. static struct drm_i915_gem_object *
  94. fake_dma_object(struct drm_i915_private *i915, u64 size)
  95. {
  96. struct drm_i915_gem_object *obj;
  97. GEM_BUG_ON(!size);
  98. GEM_BUG_ON(!IS_ALIGNED(size, I915_GTT_PAGE_SIZE));
  99. if (overflows_type(size, obj->base.size))
  100. return ERR_PTR(-E2BIG);
  101. obj = i915_gem_object_alloc(i915);
  102. if (!obj)
  103. goto err;
  104. drm_gem_private_object_init(&i915->drm, &obj->base, size);
  105. i915_gem_object_init(obj, &fake_ops);
  106. obj->write_domain = I915_GEM_DOMAIN_CPU;
  107. obj->read_domains = I915_GEM_DOMAIN_CPU;
  108. obj->cache_level = I915_CACHE_NONE;
  109. /* Preallocate the "backing storage" */
  110. if (i915_gem_object_pin_pages(obj))
  111. goto err_obj;
  112. i915_gem_object_unpin_pages(obj);
  113. return obj;
  114. err_obj:
  115. i915_gem_object_put(obj);
  116. err:
  117. return ERR_PTR(-ENOMEM);
  118. }
  119. static int igt_ppgtt_alloc(void *arg)
  120. {
  121. struct drm_i915_private *dev_priv = arg;
  122. struct i915_hw_ppgtt *ppgtt;
  123. u64 size, last, limit;
  124. int err = 0;
  125. /* Allocate a ppggt and try to fill the entire range */
  126. if (!USES_PPGTT(dev_priv))
  127. return 0;
  128. ppgtt = __hw_ppgtt_create(dev_priv);
  129. if (IS_ERR(ppgtt))
  130. return PTR_ERR(ppgtt);
  131. if (!ppgtt->vm.allocate_va_range)
  132. goto err_ppgtt_cleanup;
  133. /*
  134. * While we only allocate the page tables here and so we could
  135. * address a much larger GTT than we could actually fit into
  136. * RAM, a practical limit is the amount of physical pages in the system.
  137. * This should ensure that we do not run into the oomkiller during
  138. * the test and take down the machine wilfully.
  139. */
  140. limit = totalram_pages << PAGE_SHIFT;
  141. limit = min(ppgtt->vm.total, limit);
  142. /* Check we can allocate the entire range */
  143. for (size = 4096; size <= limit; size <<= 2) {
  144. err = ppgtt->vm.allocate_va_range(&ppgtt->vm, 0, size);
  145. if (err) {
  146. if (err == -ENOMEM) {
  147. pr_info("[1] Ran out of memory for va_range [0 + %llx] [bit %d]\n",
  148. size, ilog2(size));
  149. err = 0; /* virtual space too large! */
  150. }
  151. goto err_ppgtt_cleanup;
  152. }
  153. cond_resched();
  154. ppgtt->vm.clear_range(&ppgtt->vm, 0, size);
  155. }
  156. /* Check we can incrementally allocate the entire range */
  157. for (last = 0, size = 4096; size <= limit; last = size, size <<= 2) {
  158. err = ppgtt->vm.allocate_va_range(&ppgtt->vm,
  159. last, size - last);
  160. if (err) {
  161. if (err == -ENOMEM) {
  162. pr_info("[2] Ran out of memory for va_range [%llx + %llx] [bit %d]\n",
  163. last, size - last, ilog2(size));
  164. err = 0; /* virtual space too large! */
  165. }
  166. goto err_ppgtt_cleanup;
  167. }
  168. cond_resched();
  169. }
  170. err_ppgtt_cleanup:
  171. mutex_lock(&dev_priv->drm.struct_mutex);
  172. i915_ppgtt_put(ppgtt);
  173. mutex_unlock(&dev_priv->drm.struct_mutex);
  174. return err;
  175. }
  176. static int lowlevel_hole(struct drm_i915_private *i915,
  177. struct i915_address_space *vm,
  178. u64 hole_start, u64 hole_end,
  179. unsigned long end_time)
  180. {
  181. I915_RND_STATE(seed_prng);
  182. unsigned int size;
  183. struct i915_vma mock_vma;
  184. memset(&mock_vma, 0, sizeof(struct i915_vma));
  185. /* Keep creating larger objects until one cannot fit into the hole */
  186. for (size = 12; (hole_end - hole_start) >> size; size++) {
  187. I915_RND_SUBSTATE(prng, seed_prng);
  188. struct drm_i915_gem_object *obj;
  189. unsigned int *order, count, n;
  190. u64 hole_size;
  191. hole_size = (hole_end - hole_start) >> size;
  192. if (hole_size > KMALLOC_MAX_SIZE / sizeof(u32))
  193. hole_size = KMALLOC_MAX_SIZE / sizeof(u32);
  194. count = hole_size >> 1;
  195. if (!count) {
  196. pr_debug("%s: hole is too small [%llx - %llx] >> %d: %lld\n",
  197. __func__, hole_start, hole_end, size, hole_size);
  198. break;
  199. }
  200. do {
  201. order = i915_random_order(count, &prng);
  202. if (order)
  203. break;
  204. } while (count >>= 1);
  205. if (!count)
  206. return -ENOMEM;
  207. GEM_BUG_ON(!order);
  208. GEM_BUG_ON(count * BIT_ULL(size) > vm->total);
  209. GEM_BUG_ON(hole_start + count * BIT_ULL(size) > hole_end);
  210. /* Ignore allocation failures (i.e. don't report them as
  211. * a test failure) as we are purposefully allocating very
  212. * large objects without checking that we have sufficient
  213. * memory. We expect to hit -ENOMEM.
  214. */
  215. obj = fake_dma_object(i915, BIT_ULL(size));
  216. if (IS_ERR(obj)) {
  217. kfree(order);
  218. break;
  219. }
  220. GEM_BUG_ON(obj->base.size != BIT_ULL(size));
  221. if (i915_gem_object_pin_pages(obj)) {
  222. i915_gem_object_put(obj);
  223. kfree(order);
  224. break;
  225. }
  226. for (n = 0; n < count; n++) {
  227. u64 addr = hole_start + order[n] * BIT_ULL(size);
  228. GEM_BUG_ON(addr + BIT_ULL(size) > vm->total);
  229. if (igt_timeout(end_time,
  230. "%s timed out before %d/%d\n",
  231. __func__, n, count)) {
  232. hole_end = hole_start; /* quit */
  233. break;
  234. }
  235. if (vm->allocate_va_range &&
  236. vm->allocate_va_range(vm, addr, BIT_ULL(size)))
  237. break;
  238. mock_vma.pages = obj->mm.pages;
  239. mock_vma.node.size = BIT_ULL(size);
  240. mock_vma.node.start = addr;
  241. intel_runtime_pm_get(i915);
  242. vm->insert_entries(vm, &mock_vma, I915_CACHE_NONE, 0);
  243. intel_runtime_pm_put(i915);
  244. }
  245. count = n;
  246. i915_random_reorder(order, count, &prng);
  247. for (n = 0; n < count; n++) {
  248. u64 addr = hole_start + order[n] * BIT_ULL(size);
  249. GEM_BUG_ON(addr + BIT_ULL(size) > vm->total);
  250. vm->clear_range(vm, addr, BIT_ULL(size));
  251. }
  252. i915_gem_object_unpin_pages(obj);
  253. i915_gem_object_put(obj);
  254. kfree(order);
  255. cleanup_freed_objects(i915);
  256. }
  257. return 0;
  258. }
  259. static void close_object_list(struct list_head *objects,
  260. struct i915_address_space *vm)
  261. {
  262. struct drm_i915_gem_object *obj, *on;
  263. int ignored;
  264. list_for_each_entry_safe(obj, on, objects, st_link) {
  265. struct i915_vma *vma;
  266. vma = i915_vma_instance(obj, vm, NULL);
  267. if (!IS_ERR(vma))
  268. ignored = i915_vma_unbind(vma);
  269. /* Only ppgtt vma may be closed before the object is freed */
  270. if (!IS_ERR(vma) && !i915_vma_is_ggtt(vma))
  271. i915_vma_close(vma);
  272. list_del(&obj->st_link);
  273. i915_gem_object_put(obj);
  274. }
  275. }
  276. static int fill_hole(struct drm_i915_private *i915,
  277. struct i915_address_space *vm,
  278. u64 hole_start, u64 hole_end,
  279. unsigned long end_time)
  280. {
  281. const u64 hole_size = hole_end - hole_start;
  282. struct drm_i915_gem_object *obj;
  283. const unsigned long max_pages =
  284. min_t(u64, ULONG_MAX - 1, hole_size/2 >> PAGE_SHIFT);
  285. const unsigned long max_step = max(int_sqrt(max_pages), 2UL);
  286. unsigned long npages, prime, flags;
  287. struct i915_vma *vma;
  288. LIST_HEAD(objects);
  289. int err;
  290. /* Try binding many VMA working inwards from either edge */
  291. flags = PIN_OFFSET_FIXED | PIN_USER;
  292. if (i915_is_ggtt(vm))
  293. flags |= PIN_GLOBAL;
  294. for_each_prime_number_from(prime, 2, max_step) {
  295. for (npages = 1; npages <= max_pages; npages *= prime) {
  296. const u64 full_size = npages << PAGE_SHIFT;
  297. const struct {
  298. const char *name;
  299. u64 offset;
  300. int step;
  301. } phases[] = {
  302. { "top-down", hole_end, -1, },
  303. { "bottom-up", hole_start, 1, },
  304. { }
  305. }, *p;
  306. obj = fake_dma_object(i915, full_size);
  307. if (IS_ERR(obj))
  308. break;
  309. list_add(&obj->st_link, &objects);
  310. /* Align differing sized objects against the edges, and
  311. * check we don't walk off into the void when binding
  312. * them into the GTT.
  313. */
  314. for (p = phases; p->name; p++) {
  315. u64 offset;
  316. offset = p->offset;
  317. list_for_each_entry(obj, &objects, st_link) {
  318. vma = i915_vma_instance(obj, vm, NULL);
  319. if (IS_ERR(vma))
  320. continue;
  321. if (p->step < 0) {
  322. if (offset < hole_start + obj->base.size)
  323. break;
  324. offset -= obj->base.size;
  325. }
  326. err = i915_vma_pin(vma, 0, 0, offset | flags);
  327. if (err) {
  328. pr_err("%s(%s) pin (forward) failed with err=%d on size=%lu pages (prime=%lu), offset=%llx\n",
  329. __func__, p->name, err, npages, prime, offset);
  330. goto err;
  331. }
  332. if (!drm_mm_node_allocated(&vma->node) ||
  333. i915_vma_misplaced(vma, 0, 0, offset | flags)) {
  334. pr_err("%s(%s) (forward) insert failed: vma.node=%llx + %llx [allocated? %d], expected offset %llx\n",
  335. __func__, p->name, vma->node.start, vma->node.size, drm_mm_node_allocated(&vma->node),
  336. offset);
  337. err = -EINVAL;
  338. goto err;
  339. }
  340. i915_vma_unpin(vma);
  341. if (p->step > 0) {
  342. if (offset + obj->base.size > hole_end)
  343. break;
  344. offset += obj->base.size;
  345. }
  346. }
  347. offset = p->offset;
  348. list_for_each_entry(obj, &objects, st_link) {
  349. vma = i915_vma_instance(obj, vm, NULL);
  350. if (IS_ERR(vma))
  351. continue;
  352. if (p->step < 0) {
  353. if (offset < hole_start + obj->base.size)
  354. break;
  355. offset -= obj->base.size;
  356. }
  357. if (!drm_mm_node_allocated(&vma->node) ||
  358. i915_vma_misplaced(vma, 0, 0, offset | flags)) {
  359. pr_err("%s(%s) (forward) moved vma.node=%llx + %llx, expected offset %llx\n",
  360. __func__, p->name, vma->node.start, vma->node.size,
  361. offset);
  362. err = -EINVAL;
  363. goto err;
  364. }
  365. err = i915_vma_unbind(vma);
  366. if (err) {
  367. pr_err("%s(%s) (forward) unbind of vma.node=%llx + %llx failed with err=%d\n",
  368. __func__, p->name, vma->node.start, vma->node.size,
  369. err);
  370. goto err;
  371. }
  372. if (p->step > 0) {
  373. if (offset + obj->base.size > hole_end)
  374. break;
  375. offset += obj->base.size;
  376. }
  377. }
  378. offset = p->offset;
  379. list_for_each_entry_reverse(obj, &objects, st_link) {
  380. vma = i915_vma_instance(obj, vm, NULL);
  381. if (IS_ERR(vma))
  382. continue;
  383. if (p->step < 0) {
  384. if (offset < hole_start + obj->base.size)
  385. break;
  386. offset -= obj->base.size;
  387. }
  388. err = i915_vma_pin(vma, 0, 0, offset | flags);
  389. if (err) {
  390. pr_err("%s(%s) pin (backward) failed with err=%d on size=%lu pages (prime=%lu), offset=%llx\n",
  391. __func__, p->name, err, npages, prime, offset);
  392. goto err;
  393. }
  394. if (!drm_mm_node_allocated(&vma->node) ||
  395. i915_vma_misplaced(vma, 0, 0, offset | flags)) {
  396. pr_err("%s(%s) (backward) insert failed: vma.node=%llx + %llx [allocated? %d], expected offset %llx\n",
  397. __func__, p->name, vma->node.start, vma->node.size, drm_mm_node_allocated(&vma->node),
  398. offset);
  399. err = -EINVAL;
  400. goto err;
  401. }
  402. i915_vma_unpin(vma);
  403. if (p->step > 0) {
  404. if (offset + obj->base.size > hole_end)
  405. break;
  406. offset += obj->base.size;
  407. }
  408. }
  409. offset = p->offset;
  410. list_for_each_entry_reverse(obj, &objects, st_link) {
  411. vma = i915_vma_instance(obj, vm, NULL);
  412. if (IS_ERR(vma))
  413. continue;
  414. if (p->step < 0) {
  415. if (offset < hole_start + obj->base.size)
  416. break;
  417. offset -= obj->base.size;
  418. }
  419. if (!drm_mm_node_allocated(&vma->node) ||
  420. i915_vma_misplaced(vma, 0, 0, offset | flags)) {
  421. pr_err("%s(%s) (backward) moved vma.node=%llx + %llx [allocated? %d], expected offset %llx\n",
  422. __func__, p->name, vma->node.start, vma->node.size, drm_mm_node_allocated(&vma->node),
  423. offset);
  424. err = -EINVAL;
  425. goto err;
  426. }
  427. err = i915_vma_unbind(vma);
  428. if (err) {
  429. pr_err("%s(%s) (backward) unbind of vma.node=%llx + %llx failed with err=%d\n",
  430. __func__, p->name, vma->node.start, vma->node.size,
  431. err);
  432. goto err;
  433. }
  434. if (p->step > 0) {
  435. if (offset + obj->base.size > hole_end)
  436. break;
  437. offset += obj->base.size;
  438. }
  439. }
  440. }
  441. if (igt_timeout(end_time, "%s timed out (npages=%lu, prime=%lu)\n",
  442. __func__, npages, prime)) {
  443. err = -EINTR;
  444. goto err;
  445. }
  446. }
  447. close_object_list(&objects, vm);
  448. cleanup_freed_objects(i915);
  449. }
  450. return 0;
  451. err:
  452. close_object_list(&objects, vm);
  453. return err;
  454. }
  455. static int walk_hole(struct drm_i915_private *i915,
  456. struct i915_address_space *vm,
  457. u64 hole_start, u64 hole_end,
  458. unsigned long end_time)
  459. {
  460. const u64 hole_size = hole_end - hole_start;
  461. const unsigned long max_pages =
  462. min_t(u64, ULONG_MAX - 1, hole_size >> PAGE_SHIFT);
  463. unsigned long flags;
  464. u64 size;
  465. /* Try binding a single VMA in different positions within the hole */
  466. flags = PIN_OFFSET_FIXED | PIN_USER;
  467. if (i915_is_ggtt(vm))
  468. flags |= PIN_GLOBAL;
  469. for_each_prime_number_from(size, 1, max_pages) {
  470. struct drm_i915_gem_object *obj;
  471. struct i915_vma *vma;
  472. u64 addr;
  473. int err = 0;
  474. obj = fake_dma_object(i915, size << PAGE_SHIFT);
  475. if (IS_ERR(obj))
  476. break;
  477. vma = i915_vma_instance(obj, vm, NULL);
  478. if (IS_ERR(vma)) {
  479. err = PTR_ERR(vma);
  480. goto err_put;
  481. }
  482. for (addr = hole_start;
  483. addr + obj->base.size < hole_end;
  484. addr += obj->base.size) {
  485. err = i915_vma_pin(vma, 0, 0, addr | flags);
  486. if (err) {
  487. pr_err("%s bind failed at %llx + %llx [hole %llx- %llx] with err=%d\n",
  488. __func__, addr, vma->size,
  489. hole_start, hole_end, err);
  490. goto err_close;
  491. }
  492. i915_vma_unpin(vma);
  493. if (!drm_mm_node_allocated(&vma->node) ||
  494. i915_vma_misplaced(vma, 0, 0, addr | flags)) {
  495. pr_err("%s incorrect at %llx + %llx\n",
  496. __func__, addr, vma->size);
  497. err = -EINVAL;
  498. goto err_close;
  499. }
  500. err = i915_vma_unbind(vma);
  501. if (err) {
  502. pr_err("%s unbind failed at %llx + %llx with err=%d\n",
  503. __func__, addr, vma->size, err);
  504. goto err_close;
  505. }
  506. GEM_BUG_ON(drm_mm_node_allocated(&vma->node));
  507. if (igt_timeout(end_time,
  508. "%s timed out at %llx\n",
  509. __func__, addr)) {
  510. err = -EINTR;
  511. goto err_close;
  512. }
  513. }
  514. err_close:
  515. if (!i915_vma_is_ggtt(vma))
  516. i915_vma_close(vma);
  517. err_put:
  518. i915_gem_object_put(obj);
  519. if (err)
  520. return err;
  521. cleanup_freed_objects(i915);
  522. }
  523. return 0;
  524. }
  525. static int pot_hole(struct drm_i915_private *i915,
  526. struct i915_address_space *vm,
  527. u64 hole_start, u64 hole_end,
  528. unsigned long end_time)
  529. {
  530. struct drm_i915_gem_object *obj;
  531. struct i915_vma *vma;
  532. unsigned long flags;
  533. unsigned int pot;
  534. int err = 0;
  535. flags = PIN_OFFSET_FIXED | PIN_USER;
  536. if (i915_is_ggtt(vm))
  537. flags |= PIN_GLOBAL;
  538. obj = i915_gem_object_create_internal(i915, 2 * I915_GTT_PAGE_SIZE);
  539. if (IS_ERR(obj))
  540. return PTR_ERR(obj);
  541. vma = i915_vma_instance(obj, vm, NULL);
  542. if (IS_ERR(vma)) {
  543. err = PTR_ERR(vma);
  544. goto err_obj;
  545. }
  546. /* Insert a pair of pages across every pot boundary within the hole */
  547. for (pot = fls64(hole_end - 1) - 1;
  548. pot > ilog2(2 * I915_GTT_PAGE_SIZE);
  549. pot--) {
  550. u64 step = BIT_ULL(pot);
  551. u64 addr;
  552. for (addr = round_up(hole_start + I915_GTT_PAGE_SIZE, step) - I915_GTT_PAGE_SIZE;
  553. addr <= round_down(hole_end - 2*I915_GTT_PAGE_SIZE, step) - I915_GTT_PAGE_SIZE;
  554. addr += step) {
  555. err = i915_vma_pin(vma, 0, 0, addr | flags);
  556. if (err) {
  557. pr_err("%s failed to pin object at %llx in hole [%llx - %llx], with err=%d\n",
  558. __func__,
  559. addr,
  560. hole_start, hole_end,
  561. err);
  562. goto err;
  563. }
  564. if (!drm_mm_node_allocated(&vma->node) ||
  565. i915_vma_misplaced(vma, 0, 0, addr | flags)) {
  566. pr_err("%s incorrect at %llx + %llx\n",
  567. __func__, addr, vma->size);
  568. i915_vma_unpin(vma);
  569. err = i915_vma_unbind(vma);
  570. err = -EINVAL;
  571. goto err;
  572. }
  573. i915_vma_unpin(vma);
  574. err = i915_vma_unbind(vma);
  575. GEM_BUG_ON(err);
  576. }
  577. if (igt_timeout(end_time,
  578. "%s timed out after %d/%d\n",
  579. __func__, pot, fls64(hole_end - 1) - 1)) {
  580. err = -EINTR;
  581. goto err;
  582. }
  583. }
  584. err:
  585. if (!i915_vma_is_ggtt(vma))
  586. i915_vma_close(vma);
  587. err_obj:
  588. i915_gem_object_put(obj);
  589. return err;
  590. }
  591. static int drunk_hole(struct drm_i915_private *i915,
  592. struct i915_address_space *vm,
  593. u64 hole_start, u64 hole_end,
  594. unsigned long end_time)
  595. {
  596. I915_RND_STATE(prng);
  597. unsigned int size;
  598. unsigned long flags;
  599. flags = PIN_OFFSET_FIXED | PIN_USER;
  600. if (i915_is_ggtt(vm))
  601. flags |= PIN_GLOBAL;
  602. /* Keep creating larger objects until one cannot fit into the hole */
  603. for (size = 12; (hole_end - hole_start) >> size; size++) {
  604. struct drm_i915_gem_object *obj;
  605. unsigned int *order, count, n;
  606. struct i915_vma *vma;
  607. u64 hole_size;
  608. int err = -ENODEV;
  609. hole_size = (hole_end - hole_start) >> size;
  610. if (hole_size > KMALLOC_MAX_SIZE / sizeof(u32))
  611. hole_size = KMALLOC_MAX_SIZE / sizeof(u32);
  612. count = hole_size >> 1;
  613. if (!count) {
  614. pr_debug("%s: hole is too small [%llx - %llx] >> %d: %lld\n",
  615. __func__, hole_start, hole_end, size, hole_size);
  616. break;
  617. }
  618. do {
  619. order = i915_random_order(count, &prng);
  620. if (order)
  621. break;
  622. } while (count >>= 1);
  623. if (!count)
  624. return -ENOMEM;
  625. GEM_BUG_ON(!order);
  626. /* Ignore allocation failures (i.e. don't report them as
  627. * a test failure) as we are purposefully allocating very
  628. * large objects without checking that we have sufficient
  629. * memory. We expect to hit -ENOMEM.
  630. */
  631. obj = fake_dma_object(i915, BIT_ULL(size));
  632. if (IS_ERR(obj)) {
  633. kfree(order);
  634. break;
  635. }
  636. vma = i915_vma_instance(obj, vm, NULL);
  637. if (IS_ERR(vma)) {
  638. err = PTR_ERR(vma);
  639. goto err_obj;
  640. }
  641. GEM_BUG_ON(vma->size != BIT_ULL(size));
  642. for (n = 0; n < count; n++) {
  643. u64 addr = hole_start + order[n] * BIT_ULL(size);
  644. err = i915_vma_pin(vma, 0, 0, addr | flags);
  645. if (err) {
  646. pr_err("%s failed to pin object at %llx + %llx in hole [%llx - %llx], with err=%d\n",
  647. __func__,
  648. addr, BIT_ULL(size),
  649. hole_start, hole_end,
  650. err);
  651. goto err;
  652. }
  653. if (!drm_mm_node_allocated(&vma->node) ||
  654. i915_vma_misplaced(vma, 0, 0, addr | flags)) {
  655. pr_err("%s incorrect at %llx + %llx\n",
  656. __func__, addr, BIT_ULL(size));
  657. i915_vma_unpin(vma);
  658. err = i915_vma_unbind(vma);
  659. err = -EINVAL;
  660. goto err;
  661. }
  662. i915_vma_unpin(vma);
  663. err = i915_vma_unbind(vma);
  664. GEM_BUG_ON(err);
  665. if (igt_timeout(end_time,
  666. "%s timed out after %d/%d\n",
  667. __func__, n, count)) {
  668. err = -EINTR;
  669. goto err;
  670. }
  671. }
  672. err:
  673. if (!i915_vma_is_ggtt(vma))
  674. i915_vma_close(vma);
  675. err_obj:
  676. i915_gem_object_put(obj);
  677. kfree(order);
  678. if (err)
  679. return err;
  680. cleanup_freed_objects(i915);
  681. }
  682. return 0;
  683. }
  684. static int __shrink_hole(struct drm_i915_private *i915,
  685. struct i915_address_space *vm,
  686. u64 hole_start, u64 hole_end,
  687. unsigned long end_time)
  688. {
  689. struct drm_i915_gem_object *obj;
  690. unsigned long flags = PIN_OFFSET_FIXED | PIN_USER;
  691. unsigned int order = 12;
  692. LIST_HEAD(objects);
  693. int err = 0;
  694. u64 addr;
  695. /* Keep creating larger objects until one cannot fit into the hole */
  696. for (addr = hole_start; addr < hole_end; ) {
  697. struct i915_vma *vma;
  698. u64 size = BIT_ULL(order++);
  699. size = min(size, hole_end - addr);
  700. obj = fake_dma_object(i915, size);
  701. if (IS_ERR(obj)) {
  702. err = PTR_ERR(obj);
  703. break;
  704. }
  705. list_add(&obj->st_link, &objects);
  706. vma = i915_vma_instance(obj, vm, NULL);
  707. if (IS_ERR(vma)) {
  708. err = PTR_ERR(vma);
  709. break;
  710. }
  711. GEM_BUG_ON(vma->size != size);
  712. err = i915_vma_pin(vma, 0, 0, addr | flags);
  713. if (err) {
  714. pr_err("%s failed to pin object at %llx + %llx in hole [%llx - %llx], with err=%d\n",
  715. __func__, addr, size, hole_start, hole_end, err);
  716. break;
  717. }
  718. if (!drm_mm_node_allocated(&vma->node) ||
  719. i915_vma_misplaced(vma, 0, 0, addr | flags)) {
  720. pr_err("%s incorrect at %llx + %llx\n",
  721. __func__, addr, size);
  722. i915_vma_unpin(vma);
  723. err = i915_vma_unbind(vma);
  724. err = -EINVAL;
  725. break;
  726. }
  727. i915_vma_unpin(vma);
  728. addr += size;
  729. if (igt_timeout(end_time,
  730. "%s timed out at ofset %llx [%llx - %llx]\n",
  731. __func__, addr, hole_start, hole_end)) {
  732. err = -EINTR;
  733. break;
  734. }
  735. }
  736. close_object_list(&objects, vm);
  737. cleanup_freed_objects(i915);
  738. return err;
  739. }
  740. static int shrink_hole(struct drm_i915_private *i915,
  741. struct i915_address_space *vm,
  742. u64 hole_start, u64 hole_end,
  743. unsigned long end_time)
  744. {
  745. unsigned long prime;
  746. int err;
  747. vm->fault_attr.probability = 999;
  748. atomic_set(&vm->fault_attr.times, -1);
  749. for_each_prime_number_from(prime, 0, ULONG_MAX - 1) {
  750. vm->fault_attr.interval = prime;
  751. err = __shrink_hole(i915, vm, hole_start, hole_end, end_time);
  752. if (err)
  753. break;
  754. }
  755. memset(&vm->fault_attr, 0, sizeof(vm->fault_attr));
  756. return err;
  757. }
  758. static int shrink_boom(struct drm_i915_private *i915,
  759. struct i915_address_space *vm,
  760. u64 hole_start, u64 hole_end,
  761. unsigned long end_time)
  762. {
  763. unsigned int sizes[] = { SZ_2M, SZ_1G };
  764. struct drm_i915_gem_object *purge;
  765. struct drm_i915_gem_object *explode;
  766. int err;
  767. int i;
  768. /*
  769. * Catch the case which shrink_hole seems to miss. The setup here
  770. * requires invoking the shrinker as we do the alloc_pt/alloc_pd, while
  771. * ensuring that all vma assiocated with the respective pd/pdp are
  772. * unpinned at the time.
  773. */
  774. for (i = 0; i < ARRAY_SIZE(sizes); ++i) {
  775. unsigned int flags = PIN_USER | PIN_OFFSET_FIXED;
  776. unsigned int size = sizes[i];
  777. struct i915_vma *vma;
  778. purge = fake_dma_object(i915, size);
  779. if (IS_ERR(purge))
  780. return PTR_ERR(purge);
  781. vma = i915_vma_instance(purge, vm, NULL);
  782. if (IS_ERR(vma)) {
  783. err = PTR_ERR(vma);
  784. goto err_purge;
  785. }
  786. err = i915_vma_pin(vma, 0, 0, flags);
  787. if (err)
  788. goto err_purge;
  789. /* Should now be ripe for purging */
  790. i915_vma_unpin(vma);
  791. explode = fake_dma_object(i915, size);
  792. if (IS_ERR(explode)) {
  793. err = PTR_ERR(explode);
  794. goto err_purge;
  795. }
  796. vm->fault_attr.probability = 100;
  797. vm->fault_attr.interval = 1;
  798. atomic_set(&vm->fault_attr.times, -1);
  799. vma = i915_vma_instance(explode, vm, NULL);
  800. if (IS_ERR(vma)) {
  801. err = PTR_ERR(vma);
  802. goto err_explode;
  803. }
  804. err = i915_vma_pin(vma, 0, 0, flags | size);
  805. if (err)
  806. goto err_explode;
  807. i915_vma_unpin(vma);
  808. i915_gem_object_put(purge);
  809. i915_gem_object_put(explode);
  810. memset(&vm->fault_attr, 0, sizeof(vm->fault_attr));
  811. cleanup_freed_objects(i915);
  812. }
  813. return 0;
  814. err_explode:
  815. i915_gem_object_put(explode);
  816. err_purge:
  817. i915_gem_object_put(purge);
  818. memset(&vm->fault_attr, 0, sizeof(vm->fault_attr));
  819. return err;
  820. }
  821. static int exercise_ppgtt(struct drm_i915_private *dev_priv,
  822. int (*func)(struct drm_i915_private *i915,
  823. struct i915_address_space *vm,
  824. u64 hole_start, u64 hole_end,
  825. unsigned long end_time))
  826. {
  827. struct drm_file *file;
  828. struct i915_hw_ppgtt *ppgtt;
  829. IGT_TIMEOUT(end_time);
  830. int err;
  831. if (!USES_FULL_PPGTT(dev_priv))
  832. return 0;
  833. file = mock_file(dev_priv);
  834. if (IS_ERR(file))
  835. return PTR_ERR(file);
  836. mutex_lock(&dev_priv->drm.struct_mutex);
  837. ppgtt = i915_ppgtt_create(dev_priv, file->driver_priv);
  838. if (IS_ERR(ppgtt)) {
  839. err = PTR_ERR(ppgtt);
  840. goto out_unlock;
  841. }
  842. GEM_BUG_ON(offset_in_page(ppgtt->vm.total));
  843. GEM_BUG_ON(ppgtt->vm.closed);
  844. err = func(dev_priv, &ppgtt->vm, 0, ppgtt->vm.total, end_time);
  845. i915_ppgtt_close(&ppgtt->vm);
  846. i915_ppgtt_put(ppgtt);
  847. out_unlock:
  848. mutex_unlock(&dev_priv->drm.struct_mutex);
  849. mock_file_free(dev_priv, file);
  850. return err;
  851. }
  852. static int igt_ppgtt_fill(void *arg)
  853. {
  854. return exercise_ppgtt(arg, fill_hole);
  855. }
  856. static int igt_ppgtt_walk(void *arg)
  857. {
  858. return exercise_ppgtt(arg, walk_hole);
  859. }
  860. static int igt_ppgtt_pot(void *arg)
  861. {
  862. return exercise_ppgtt(arg, pot_hole);
  863. }
  864. static int igt_ppgtt_drunk(void *arg)
  865. {
  866. return exercise_ppgtt(arg, drunk_hole);
  867. }
  868. static int igt_ppgtt_lowlevel(void *arg)
  869. {
  870. return exercise_ppgtt(arg, lowlevel_hole);
  871. }
  872. static int igt_ppgtt_shrink(void *arg)
  873. {
  874. return exercise_ppgtt(arg, shrink_hole);
  875. }
  876. static int igt_ppgtt_shrink_boom(void *arg)
  877. {
  878. return exercise_ppgtt(arg, shrink_boom);
  879. }
  880. static int sort_holes(void *priv, struct list_head *A, struct list_head *B)
  881. {
  882. struct drm_mm_node *a = list_entry(A, typeof(*a), hole_stack);
  883. struct drm_mm_node *b = list_entry(B, typeof(*b), hole_stack);
  884. if (a->start < b->start)
  885. return -1;
  886. else
  887. return 1;
  888. }
  889. static int exercise_ggtt(struct drm_i915_private *i915,
  890. int (*func)(struct drm_i915_private *i915,
  891. struct i915_address_space *vm,
  892. u64 hole_start, u64 hole_end,
  893. unsigned long end_time))
  894. {
  895. struct i915_ggtt *ggtt = &i915->ggtt;
  896. u64 hole_start, hole_end, last = 0;
  897. struct drm_mm_node *node;
  898. IGT_TIMEOUT(end_time);
  899. int err = 0;
  900. mutex_lock(&i915->drm.struct_mutex);
  901. restart:
  902. list_sort(NULL, &ggtt->vm.mm.hole_stack, sort_holes);
  903. drm_mm_for_each_hole(node, &ggtt->vm.mm, hole_start, hole_end) {
  904. if (hole_start < last)
  905. continue;
  906. if (ggtt->vm.mm.color_adjust)
  907. ggtt->vm.mm.color_adjust(node, 0,
  908. &hole_start, &hole_end);
  909. if (hole_start >= hole_end)
  910. continue;
  911. err = func(i915, &ggtt->vm, hole_start, hole_end, end_time);
  912. if (err)
  913. break;
  914. /* As we have manipulated the drm_mm, the list may be corrupt */
  915. last = hole_end;
  916. goto restart;
  917. }
  918. mutex_unlock(&i915->drm.struct_mutex);
  919. return err;
  920. }
  921. static int igt_ggtt_fill(void *arg)
  922. {
  923. return exercise_ggtt(arg, fill_hole);
  924. }
  925. static int igt_ggtt_walk(void *arg)
  926. {
  927. return exercise_ggtt(arg, walk_hole);
  928. }
  929. static int igt_ggtt_pot(void *arg)
  930. {
  931. return exercise_ggtt(arg, pot_hole);
  932. }
  933. static int igt_ggtt_drunk(void *arg)
  934. {
  935. return exercise_ggtt(arg, drunk_hole);
  936. }
  937. static int igt_ggtt_lowlevel(void *arg)
  938. {
  939. return exercise_ggtt(arg, lowlevel_hole);
  940. }
  941. static int igt_ggtt_page(void *arg)
  942. {
  943. const unsigned int count = PAGE_SIZE/sizeof(u32);
  944. I915_RND_STATE(prng);
  945. struct drm_i915_private *i915 = arg;
  946. struct i915_ggtt *ggtt = &i915->ggtt;
  947. struct drm_i915_gem_object *obj;
  948. struct drm_mm_node tmp;
  949. unsigned int *order, n;
  950. int err;
  951. mutex_lock(&i915->drm.struct_mutex);
  952. obj = i915_gem_object_create_internal(i915, PAGE_SIZE);
  953. if (IS_ERR(obj)) {
  954. err = PTR_ERR(obj);
  955. goto out_unlock;
  956. }
  957. err = i915_gem_object_pin_pages(obj);
  958. if (err)
  959. goto out_free;
  960. memset(&tmp, 0, sizeof(tmp));
  961. err = drm_mm_insert_node_in_range(&ggtt->vm.mm, &tmp,
  962. count * PAGE_SIZE, 0,
  963. I915_COLOR_UNEVICTABLE,
  964. 0, ggtt->mappable_end,
  965. DRM_MM_INSERT_LOW);
  966. if (err)
  967. goto out_unpin;
  968. intel_runtime_pm_get(i915);
  969. for (n = 0; n < count; n++) {
  970. u64 offset = tmp.start + n * PAGE_SIZE;
  971. ggtt->vm.insert_page(&ggtt->vm,
  972. i915_gem_object_get_dma_address(obj, 0),
  973. offset, I915_CACHE_NONE, 0);
  974. }
  975. order = i915_random_order(count, &prng);
  976. if (!order) {
  977. err = -ENOMEM;
  978. goto out_remove;
  979. }
  980. for (n = 0; n < count; n++) {
  981. u64 offset = tmp.start + order[n] * PAGE_SIZE;
  982. u32 __iomem *vaddr;
  983. vaddr = io_mapping_map_atomic_wc(&ggtt->iomap, offset);
  984. iowrite32(n, vaddr + n);
  985. io_mapping_unmap_atomic(vaddr);
  986. }
  987. i915_gem_flush_ggtt_writes(i915);
  988. i915_random_reorder(order, count, &prng);
  989. for (n = 0; n < count; n++) {
  990. u64 offset = tmp.start + order[n] * PAGE_SIZE;
  991. u32 __iomem *vaddr;
  992. u32 val;
  993. vaddr = io_mapping_map_atomic_wc(&ggtt->iomap, offset);
  994. val = ioread32(vaddr + n);
  995. io_mapping_unmap_atomic(vaddr);
  996. if (val != n) {
  997. pr_err("insert page failed: found %d, expected %d\n",
  998. val, n);
  999. err = -EINVAL;
  1000. break;
  1001. }
  1002. }
  1003. kfree(order);
  1004. out_remove:
  1005. ggtt->vm.clear_range(&ggtt->vm, tmp.start, tmp.size);
  1006. intel_runtime_pm_put(i915);
  1007. drm_mm_remove_node(&tmp);
  1008. out_unpin:
  1009. i915_gem_object_unpin_pages(obj);
  1010. out_free:
  1011. i915_gem_object_put(obj);
  1012. out_unlock:
  1013. mutex_unlock(&i915->drm.struct_mutex);
  1014. return err;
  1015. }
  1016. static void track_vma_bind(struct i915_vma *vma)
  1017. {
  1018. struct drm_i915_gem_object *obj = vma->obj;
  1019. obj->bind_count++; /* track for eviction later */
  1020. __i915_gem_object_pin_pages(obj);
  1021. vma->pages = obj->mm.pages;
  1022. list_move_tail(&vma->vm_link, &vma->vm->inactive_list);
  1023. }
  1024. static int exercise_mock(struct drm_i915_private *i915,
  1025. int (*func)(struct drm_i915_private *i915,
  1026. struct i915_address_space *vm,
  1027. u64 hole_start, u64 hole_end,
  1028. unsigned long end_time))
  1029. {
  1030. const u64 limit = totalram_pages << PAGE_SHIFT;
  1031. struct i915_gem_context *ctx;
  1032. struct i915_hw_ppgtt *ppgtt;
  1033. IGT_TIMEOUT(end_time);
  1034. int err;
  1035. ctx = mock_context(i915, "mock");
  1036. if (!ctx)
  1037. return -ENOMEM;
  1038. ppgtt = ctx->ppgtt;
  1039. GEM_BUG_ON(!ppgtt);
  1040. err = func(i915, &ppgtt->vm, 0, min(ppgtt->vm.total, limit), end_time);
  1041. mock_context_close(ctx);
  1042. return err;
  1043. }
  1044. static int igt_mock_fill(void *arg)
  1045. {
  1046. return exercise_mock(arg, fill_hole);
  1047. }
  1048. static int igt_mock_walk(void *arg)
  1049. {
  1050. return exercise_mock(arg, walk_hole);
  1051. }
  1052. static int igt_mock_pot(void *arg)
  1053. {
  1054. return exercise_mock(arg, pot_hole);
  1055. }
  1056. static int igt_mock_drunk(void *arg)
  1057. {
  1058. return exercise_mock(arg, drunk_hole);
  1059. }
  1060. static int igt_gtt_reserve(void *arg)
  1061. {
  1062. struct drm_i915_private *i915 = arg;
  1063. struct drm_i915_gem_object *obj, *on;
  1064. LIST_HEAD(objects);
  1065. u64 total;
  1066. int err = -ENODEV;
  1067. /* i915_gem_gtt_reserve() tries to reserve the precise range
  1068. * for the node, and evicts if it has to. So our test checks that
  1069. * it can give us the requsted space and prevent overlaps.
  1070. */
  1071. /* Start by filling the GGTT */
  1072. for (total = 0;
  1073. total + 2*I915_GTT_PAGE_SIZE <= i915->ggtt.vm.total;
  1074. total += 2*I915_GTT_PAGE_SIZE) {
  1075. struct i915_vma *vma;
  1076. obj = i915_gem_object_create_internal(i915, 2*PAGE_SIZE);
  1077. if (IS_ERR(obj)) {
  1078. err = PTR_ERR(obj);
  1079. goto out;
  1080. }
  1081. err = i915_gem_object_pin_pages(obj);
  1082. if (err) {
  1083. i915_gem_object_put(obj);
  1084. goto out;
  1085. }
  1086. list_add(&obj->st_link, &objects);
  1087. vma = i915_vma_instance(obj, &i915->ggtt.vm, NULL);
  1088. if (IS_ERR(vma)) {
  1089. err = PTR_ERR(vma);
  1090. goto out;
  1091. }
  1092. err = i915_gem_gtt_reserve(&i915->ggtt.vm, &vma->node,
  1093. obj->base.size,
  1094. total,
  1095. obj->cache_level,
  1096. 0);
  1097. if (err) {
  1098. pr_err("i915_gem_gtt_reserve (pass 1) failed at %llu/%llu with err=%d\n",
  1099. total, i915->ggtt.vm.total, err);
  1100. goto out;
  1101. }
  1102. track_vma_bind(vma);
  1103. GEM_BUG_ON(!drm_mm_node_allocated(&vma->node));
  1104. if (vma->node.start != total ||
  1105. vma->node.size != 2*I915_GTT_PAGE_SIZE) {
  1106. pr_err("i915_gem_gtt_reserve (pass 1) placement failed, found (%llx + %llx), expected (%llx + %llx)\n",
  1107. vma->node.start, vma->node.size,
  1108. total, 2*I915_GTT_PAGE_SIZE);
  1109. err = -EINVAL;
  1110. goto out;
  1111. }
  1112. }
  1113. /* Now we start forcing evictions */
  1114. for (total = I915_GTT_PAGE_SIZE;
  1115. total + 2*I915_GTT_PAGE_SIZE <= i915->ggtt.vm.total;
  1116. total += 2*I915_GTT_PAGE_SIZE) {
  1117. struct i915_vma *vma;
  1118. obj = i915_gem_object_create_internal(i915, 2*PAGE_SIZE);
  1119. if (IS_ERR(obj)) {
  1120. err = PTR_ERR(obj);
  1121. goto out;
  1122. }
  1123. err = i915_gem_object_pin_pages(obj);
  1124. if (err) {
  1125. i915_gem_object_put(obj);
  1126. goto out;
  1127. }
  1128. list_add(&obj->st_link, &objects);
  1129. vma = i915_vma_instance(obj, &i915->ggtt.vm, NULL);
  1130. if (IS_ERR(vma)) {
  1131. err = PTR_ERR(vma);
  1132. goto out;
  1133. }
  1134. err = i915_gem_gtt_reserve(&i915->ggtt.vm, &vma->node,
  1135. obj->base.size,
  1136. total,
  1137. obj->cache_level,
  1138. 0);
  1139. if (err) {
  1140. pr_err("i915_gem_gtt_reserve (pass 2) failed at %llu/%llu with err=%d\n",
  1141. total, i915->ggtt.vm.total, err);
  1142. goto out;
  1143. }
  1144. track_vma_bind(vma);
  1145. GEM_BUG_ON(!drm_mm_node_allocated(&vma->node));
  1146. if (vma->node.start != total ||
  1147. vma->node.size != 2*I915_GTT_PAGE_SIZE) {
  1148. pr_err("i915_gem_gtt_reserve (pass 2) placement failed, found (%llx + %llx), expected (%llx + %llx)\n",
  1149. vma->node.start, vma->node.size,
  1150. total, 2*I915_GTT_PAGE_SIZE);
  1151. err = -EINVAL;
  1152. goto out;
  1153. }
  1154. }
  1155. /* And then try at random */
  1156. list_for_each_entry_safe(obj, on, &objects, st_link) {
  1157. struct i915_vma *vma;
  1158. u64 offset;
  1159. vma = i915_vma_instance(obj, &i915->ggtt.vm, NULL);
  1160. if (IS_ERR(vma)) {
  1161. err = PTR_ERR(vma);
  1162. goto out;
  1163. }
  1164. err = i915_vma_unbind(vma);
  1165. if (err) {
  1166. pr_err("i915_vma_unbind failed with err=%d!\n", err);
  1167. goto out;
  1168. }
  1169. offset = random_offset(0, i915->ggtt.vm.total,
  1170. 2*I915_GTT_PAGE_SIZE,
  1171. I915_GTT_MIN_ALIGNMENT);
  1172. err = i915_gem_gtt_reserve(&i915->ggtt.vm, &vma->node,
  1173. obj->base.size,
  1174. offset,
  1175. obj->cache_level,
  1176. 0);
  1177. if (err) {
  1178. pr_err("i915_gem_gtt_reserve (pass 3) failed at %llu/%llu with err=%d\n",
  1179. total, i915->ggtt.vm.total, err);
  1180. goto out;
  1181. }
  1182. track_vma_bind(vma);
  1183. GEM_BUG_ON(!drm_mm_node_allocated(&vma->node));
  1184. if (vma->node.start != offset ||
  1185. vma->node.size != 2*I915_GTT_PAGE_SIZE) {
  1186. pr_err("i915_gem_gtt_reserve (pass 3) placement failed, found (%llx + %llx), expected (%llx + %llx)\n",
  1187. vma->node.start, vma->node.size,
  1188. offset, 2*I915_GTT_PAGE_SIZE);
  1189. err = -EINVAL;
  1190. goto out;
  1191. }
  1192. }
  1193. out:
  1194. list_for_each_entry_safe(obj, on, &objects, st_link) {
  1195. i915_gem_object_unpin_pages(obj);
  1196. i915_gem_object_put(obj);
  1197. }
  1198. return err;
  1199. }
  1200. static int igt_gtt_insert(void *arg)
  1201. {
  1202. struct drm_i915_private *i915 = arg;
  1203. struct drm_i915_gem_object *obj, *on;
  1204. struct drm_mm_node tmp = {};
  1205. const struct invalid_insert {
  1206. u64 size;
  1207. u64 alignment;
  1208. u64 start, end;
  1209. } invalid_insert[] = {
  1210. {
  1211. i915->ggtt.vm.total + I915_GTT_PAGE_SIZE, 0,
  1212. 0, i915->ggtt.vm.total,
  1213. },
  1214. {
  1215. 2*I915_GTT_PAGE_SIZE, 0,
  1216. 0, I915_GTT_PAGE_SIZE,
  1217. },
  1218. {
  1219. -(u64)I915_GTT_PAGE_SIZE, 0,
  1220. 0, 4*I915_GTT_PAGE_SIZE,
  1221. },
  1222. {
  1223. -(u64)2*I915_GTT_PAGE_SIZE, 2*I915_GTT_PAGE_SIZE,
  1224. 0, 4*I915_GTT_PAGE_SIZE,
  1225. },
  1226. {
  1227. I915_GTT_PAGE_SIZE, I915_GTT_MIN_ALIGNMENT << 1,
  1228. I915_GTT_MIN_ALIGNMENT, I915_GTT_MIN_ALIGNMENT << 1,
  1229. },
  1230. {}
  1231. }, *ii;
  1232. LIST_HEAD(objects);
  1233. u64 total;
  1234. int err = -ENODEV;
  1235. /* i915_gem_gtt_insert() tries to allocate some free space in the GTT
  1236. * to the node, evicting if required.
  1237. */
  1238. /* Check a couple of obviously invalid requests */
  1239. for (ii = invalid_insert; ii->size; ii++) {
  1240. err = i915_gem_gtt_insert(&i915->ggtt.vm, &tmp,
  1241. ii->size, ii->alignment,
  1242. I915_COLOR_UNEVICTABLE,
  1243. ii->start, ii->end,
  1244. 0);
  1245. if (err != -ENOSPC) {
  1246. pr_err("Invalid i915_gem_gtt_insert(.size=%llx, .alignment=%llx, .start=%llx, .end=%llx) succeeded (err=%d)\n",
  1247. ii->size, ii->alignment, ii->start, ii->end,
  1248. err);
  1249. return -EINVAL;
  1250. }
  1251. }
  1252. /* Start by filling the GGTT */
  1253. for (total = 0;
  1254. total + I915_GTT_PAGE_SIZE <= i915->ggtt.vm.total;
  1255. total += I915_GTT_PAGE_SIZE) {
  1256. struct i915_vma *vma;
  1257. obj = i915_gem_object_create_internal(i915, I915_GTT_PAGE_SIZE);
  1258. if (IS_ERR(obj)) {
  1259. err = PTR_ERR(obj);
  1260. goto out;
  1261. }
  1262. err = i915_gem_object_pin_pages(obj);
  1263. if (err) {
  1264. i915_gem_object_put(obj);
  1265. goto out;
  1266. }
  1267. list_add(&obj->st_link, &objects);
  1268. vma = i915_vma_instance(obj, &i915->ggtt.vm, NULL);
  1269. if (IS_ERR(vma)) {
  1270. err = PTR_ERR(vma);
  1271. goto out;
  1272. }
  1273. err = i915_gem_gtt_insert(&i915->ggtt.vm, &vma->node,
  1274. obj->base.size, 0, obj->cache_level,
  1275. 0, i915->ggtt.vm.total,
  1276. 0);
  1277. if (err == -ENOSPC) {
  1278. /* maxed out the GGTT space */
  1279. i915_gem_object_put(obj);
  1280. break;
  1281. }
  1282. if (err) {
  1283. pr_err("i915_gem_gtt_insert (pass 1) failed at %llu/%llu with err=%d\n",
  1284. total, i915->ggtt.vm.total, err);
  1285. goto out;
  1286. }
  1287. track_vma_bind(vma);
  1288. __i915_vma_pin(vma);
  1289. GEM_BUG_ON(!drm_mm_node_allocated(&vma->node));
  1290. }
  1291. list_for_each_entry(obj, &objects, st_link) {
  1292. struct i915_vma *vma;
  1293. vma = i915_vma_instance(obj, &i915->ggtt.vm, NULL);
  1294. if (IS_ERR(vma)) {
  1295. err = PTR_ERR(vma);
  1296. goto out;
  1297. }
  1298. if (!drm_mm_node_allocated(&vma->node)) {
  1299. pr_err("VMA was unexpectedly evicted!\n");
  1300. err = -EINVAL;
  1301. goto out;
  1302. }
  1303. __i915_vma_unpin(vma);
  1304. }
  1305. /* If we then reinsert, we should find the same hole */
  1306. list_for_each_entry_safe(obj, on, &objects, st_link) {
  1307. struct i915_vma *vma;
  1308. u64 offset;
  1309. vma = i915_vma_instance(obj, &i915->ggtt.vm, NULL);
  1310. if (IS_ERR(vma)) {
  1311. err = PTR_ERR(vma);
  1312. goto out;
  1313. }
  1314. GEM_BUG_ON(!drm_mm_node_allocated(&vma->node));
  1315. offset = vma->node.start;
  1316. err = i915_vma_unbind(vma);
  1317. if (err) {
  1318. pr_err("i915_vma_unbind failed with err=%d!\n", err);
  1319. goto out;
  1320. }
  1321. err = i915_gem_gtt_insert(&i915->ggtt.vm, &vma->node,
  1322. obj->base.size, 0, obj->cache_level,
  1323. 0, i915->ggtt.vm.total,
  1324. 0);
  1325. if (err) {
  1326. pr_err("i915_gem_gtt_insert (pass 2) failed at %llu/%llu with err=%d\n",
  1327. total, i915->ggtt.vm.total, err);
  1328. goto out;
  1329. }
  1330. track_vma_bind(vma);
  1331. GEM_BUG_ON(!drm_mm_node_allocated(&vma->node));
  1332. if (vma->node.start != offset) {
  1333. pr_err("i915_gem_gtt_insert did not return node to its previous location (the only hole), expected address %llx, found %llx\n",
  1334. offset, vma->node.start);
  1335. err = -EINVAL;
  1336. goto out;
  1337. }
  1338. }
  1339. /* And then force evictions */
  1340. for (total = 0;
  1341. total + 2*I915_GTT_PAGE_SIZE <= i915->ggtt.vm.total;
  1342. total += 2*I915_GTT_PAGE_SIZE) {
  1343. struct i915_vma *vma;
  1344. obj = i915_gem_object_create_internal(i915, 2*I915_GTT_PAGE_SIZE);
  1345. if (IS_ERR(obj)) {
  1346. err = PTR_ERR(obj);
  1347. goto out;
  1348. }
  1349. err = i915_gem_object_pin_pages(obj);
  1350. if (err) {
  1351. i915_gem_object_put(obj);
  1352. goto out;
  1353. }
  1354. list_add(&obj->st_link, &objects);
  1355. vma = i915_vma_instance(obj, &i915->ggtt.vm, NULL);
  1356. if (IS_ERR(vma)) {
  1357. err = PTR_ERR(vma);
  1358. goto out;
  1359. }
  1360. err = i915_gem_gtt_insert(&i915->ggtt.vm, &vma->node,
  1361. obj->base.size, 0, obj->cache_level,
  1362. 0, i915->ggtt.vm.total,
  1363. 0);
  1364. if (err) {
  1365. pr_err("i915_gem_gtt_insert (pass 3) failed at %llu/%llu with err=%d\n",
  1366. total, i915->ggtt.vm.total, err);
  1367. goto out;
  1368. }
  1369. track_vma_bind(vma);
  1370. GEM_BUG_ON(!drm_mm_node_allocated(&vma->node));
  1371. }
  1372. out:
  1373. list_for_each_entry_safe(obj, on, &objects, st_link) {
  1374. i915_gem_object_unpin_pages(obj);
  1375. i915_gem_object_put(obj);
  1376. }
  1377. return err;
  1378. }
  1379. int i915_gem_gtt_mock_selftests(void)
  1380. {
  1381. static const struct i915_subtest tests[] = {
  1382. SUBTEST(igt_mock_drunk),
  1383. SUBTEST(igt_mock_walk),
  1384. SUBTEST(igt_mock_pot),
  1385. SUBTEST(igt_mock_fill),
  1386. SUBTEST(igt_gtt_reserve),
  1387. SUBTEST(igt_gtt_insert),
  1388. };
  1389. struct drm_i915_private *i915;
  1390. int err;
  1391. i915 = mock_gem_device();
  1392. if (!i915)
  1393. return -ENOMEM;
  1394. mutex_lock(&i915->drm.struct_mutex);
  1395. err = i915_subtests(tests, i915);
  1396. mutex_unlock(&i915->drm.struct_mutex);
  1397. drm_dev_put(&i915->drm);
  1398. return err;
  1399. }
  1400. int i915_gem_gtt_live_selftests(struct drm_i915_private *i915)
  1401. {
  1402. static const struct i915_subtest tests[] = {
  1403. SUBTEST(igt_ppgtt_alloc),
  1404. SUBTEST(igt_ppgtt_lowlevel),
  1405. SUBTEST(igt_ppgtt_drunk),
  1406. SUBTEST(igt_ppgtt_walk),
  1407. SUBTEST(igt_ppgtt_pot),
  1408. SUBTEST(igt_ppgtt_fill),
  1409. SUBTEST(igt_ppgtt_shrink),
  1410. SUBTEST(igt_ppgtt_shrink_boom),
  1411. SUBTEST(igt_ggtt_lowlevel),
  1412. SUBTEST(igt_ggtt_drunk),
  1413. SUBTEST(igt_ggtt_walk),
  1414. SUBTEST(igt_ggtt_pot),
  1415. SUBTEST(igt_ggtt_fill),
  1416. SUBTEST(igt_ggtt_page),
  1417. };
  1418. GEM_BUG_ON(offset_in_page(i915->ggtt.vm.total));
  1419. return i915_subtests(tests, i915);
  1420. }