HomeSort by relevance Sort by last modified time
    Searched refs:hole (Results 1 - 25 of 44) sorted by null

1 2

  /external/libdrm/amdgpu/
amdgpu_vamgr.c 60 struct amdgpu_bo_va_hole *hole, *tmp; local
61 LIST_FOR_EACH_ENTRY_SAFE(hole, tmp, &mgr->va_holes, list) {
62 list_del(&hole->list);
63 free(hole);
72 struct amdgpu_bo_va_hole *hole, *n; local
83 /* first look for a hole */
84 LIST_FOR_EACH_ENTRY_SAFE(hole, n, &mgr->va_holes, list) {
86 if(hole->offset > base_required ||
87 (hole->offset + hole->size) < (base_required + size)
160 struct amdgpu_bo_va_hole *hole; local
    [all...]
  /external/ltp/testcases/kernel/fs/dmapi/
runtest_on.sh 26 ./hole -loglevel 4 -termlevel 4 -logname hole.log
  /external/mesa3d/src/gallium/winsys/radeon/drm/
radeon_drm_bo.c 201 struct radeon_bo_va_hole *hole, *n; local
205 /* first look for a hole */
206 LIST_FOR_EACH_ENTRY_SAFE(hole, n, &mgr->va_holes, list) {
207 offset = hole->offset;
214 if (offset >= (hole->offset + hole->size)) {
217 if (!waste && hole->size == size) {
218 offset = hole->offset;
219 list_del(&hole->list);
220 FREE(hole);
266 struct radeon_bo_va_hole *hole; local
276 struct radeon_bo_va_hole *hole, *n; local
303 struct radeon_bo_va_hole *hole; local
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
IncludeOverlayTest.java 54 for (Rectangle hole : holes) {
55 if (hole.contains(x, y)) {
  /prebuilts/go/darwin-x86/test/
recover4.go 18 // unmapping a 16 kB hole in the middle of it. Running memcopy
19 // on the resulting slice will fault when it reaches the hole.
49 // Map 16 pages of data with a 4-page hole in the middle.
59 // We are trying to unmap just a hole in the middle.
68 log.Fatal("no error from memcopy across memory hole")
solitaire.go 35 // center is the position of the center hole if there is a single one;
48 center = -1 // no single hole
  /prebuilts/go/linux-x86/test/
recover4.go 18 // unmapping a 16 kB hole in the middle of it. Running memcopy
19 // on the resulting slice will fault when it reaches the hole.
49 // Map 16 pages of data with a 4-page hole in the middle.
59 // We are trying to unmap just a hole in the middle.
68 log.Fatal("no error from memcopy across memory hole")
solitaire.go 35 // center is the position of the center hole if there is a single one;
48 center = -1 // no single hole
  /external/skia/src/core/
SkTSort.h 30 * Sinks a hole from array[root] to leaf and then sifts the original array[root] element
126 T* hole = next; local
128 *hole = std::move(*(hole - 1));
129 --hole;
130 } while (left < hole && lessThan(insert, *(hole - 1)));
131 *hole = std::move(insert);
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
IncludeOverlay.java 95 * that the result is a list of rectangles that cover everything that is not a hole.
107 for (Rectangle hole : holes) {
110 if (hole.intersects(r)) {
111 // Clip the hole to fit the rectangle bounds
112 Rectangle h = hole.intersection(r);
  /prebuilts/go/darwin-x86/doc/play/
solitaire.go 31 // center is the position of the center hole if
44 center = -1 // no single hole
  /prebuilts/go/linux-x86/doc/play/
solitaire.go 31 // center is the position of the center hole if
44 center = -1 // no single hole
  /prebuilts/go/darwin-x86/src/go/doc/testdata/
a0.go 16 // SECBUG(uid): sec hole 0
  /prebuilts/go/darwin-x86/src/runtime/
lfstack_64bit.go 43 // amd64 systems can place the stack above the VA hole, so we need to sign extend
  /prebuilts/go/linux-x86/src/go/doc/testdata/
a0.go 16 // SECBUG(uid): sec hole 0
  /prebuilts/go/linux-x86/src/runtime/
lfstack_64bit.go 43 // amd64 systems can place the stack above the VA hole, so we need to sign extend
  /external/iproute2/tc/
f_flower.c 312 bool hole = false; local
319 if (hole)
323 hole = true;
  /external/v8/benchmarks/
earley-boyer.js 367 (peephole (hole 2 "parseInt(" x "/" y ")")))
586 (peephole (hole 2 "new sc_Pair(" car ", " cdr ")")))
615 (peephole (hole 2 p ".car = " val)))
622 (peephole (hole 2 p ".cdr = " val)))
1189 (peephole (hole 2 c1 ".val === " c2 ".val")))
1194 (peephole (hole 2 c1 ".val < " c2 ".val")))
1199 (peephole (hole 2 c1 ".val > " c2 ".val")))
1204 (peephole (hole 2 c1 ".val <= " c2 ".val")))
1209 (peephole (hole 2 c1 ".val >= " c2 ".val")))
1214 (peephole (hole 2 c1 ".val.toLowerCase() === " c2 ".val.toLowerCase()"))
    [all...]
  /external/squashfs-tools/squashfs-tools/
unsquashfs.c 880 int write_block(int file_fd, char *buffer, int size, long long hole, int sparse)
882 off_t off = hole;
884 if(hole) {
900 int blocks = (hole + block_size -1) / block_size;
902 for(i = 0; i < blocks; i++, hole -= avail_bytes) {
903 avail_bytes = hole > block_size ? block_size :
904 hole;
2007 long long hole = 0; local
    [all...]
  /external/e2fsprogs/debugfs/
create_inode.c 451 off_t data = 0, hole; local
463 hole = lseek(fd, data, SEEK_HOLE);
464 if (hole < 0)
468 hole_blk = (hole + (fs->blocksize - 1)) & ~(fs->blocksize - 1);
474 data = hole;
  /external/e2fsprogs/misc/
create_inode.c 451 off_t data = 0, hole; local
463 hole = lseek(fd, data, SEEK_HOLE);
464 if (hole < 0)
468 hole_blk = (hole + (fs->blocksize - 1)) & ~(fs->blocksize - 1);
474 data = hole;
  /external/syslinux/utils/
isohybrid.c 809 int hole = 0; local
814 hole = (apm_parts * 4) + 2;
827 header->firstUsableLBA = lendian_64(gptsize + hole);
831 header->partitionEntriesLBA = lendian_64(0x02 + hole);
839 gpt += sizeof(struct gpt_header) + hole * 512;
1124 * Unlike the primary, this doesn't need a hole for the APM. We still
  /prebuilts/go/darwin-x86/src/cmd/link/internal/ld/
pcln.go 448 Errorf(nil, "hole in findfunctab")
454 Errorf(nil, "hole in findfunctab")
  /prebuilts/go/linux-x86/src/cmd/link/internal/ld/
pcln.go 448 Errorf(nil, "hole in findfunctab")
454 Errorf(nil, "hole in findfunctab")
  /external/iproute2/doc/
api-ip6-flowlabels.tex 62 There is a hole in specs: some hop-by-hop options can be
102 hole in \verb|sockaddr_in6| in any case. Now it has no justification.
115 is followed by attempts to patch the hole and more mistakes...

Completed in 1999 milliseconds

1 2