Searched refs:waste (Results 1 - 7 of 7) sorted by relevance

/external/libdrm/amdgpu/
H A Damdgpu_vamgr.c73 uint64_t offset = 0, waste = 0; local
89 waste = base_required - hole->offset;
93 waste = offset % alignment;
94 waste = waste ? alignment - waste : 0;
95 offset += waste;
100 if (!waste && hole->size == size) {
107 if ((hole->size - waste) > size) {
108 if (waste) {
[all...]
/external/regex-re2/util/
H A Darena.cc55 const int waste = kDefaultAlignment - overage; local
56 freestart_ += waste;
57 remaining_ -= waste;
120 const int waste = align - overage; local
121 freestart_ += waste;
122 if (waste < remaining_) {
123 remaining_ -= waste;
/external/mesa3d/src/gallium/winsys/radeon/drm/
H A Dradeon_drm_bo.c202 uint64_t offset = 0, waste = 0; local
208 waste = 0;
210 waste = offset % alignment;
211 waste = waste ? alignment - waste : 0;
213 offset += waste;
217 if (!waste && hole->size == size) {
224 if ((hole->size - waste) > size) {
225 if (waste) {
[all...]
/external/v8/src/heap/
H A Dspaces.h758 void add_wasted_memory(size_t waste) { wasted_memory_.Increment(waste); } argument
1628 // divided up into rough categories to cut down on waste. Having finer
2004 // the free list or accounted as waste.
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.Tree.pas421 /// parsing, it's slow and a waste of memory to create unique
/external/bison/build-aux/
H A Dtexinfo.tex6360 % side, and for 6pt waste from
/external/libmicrohttpd/doc/
H A Dtexinfo.tex6361 % side, and for 6pt waste from

Completed in 366 milliseconds