Searched defs:space (Results 101 - 125 of 152) sorted by relevance

1234567

/external/chromium_org/v8/src/
H A Dlog.cc256 // Extra space for the PID in the filename
1469 void Logger::HeapSampleBeginEvent(const char* space, const char* kind) { argument
1474 msg.Append("heap-sample-begin,\"%s\",\"%s\",%.0f", space, kind,
1480 void Logger::HeapSampleEndEvent(const char* space, const char* kind) { argument
1483 msg.Append("heap-sample-end,\"%s\",\"%s\"", space, kind);
H A Dfactory.cc18 Handle<T> Factory::New(Handle<Map> map, AllocationSpace space) { argument
21 isolate()->heap()->Allocate(*map, space),
28 AllocationSpace space,
32 isolate()->heap()->Allocate(*map, space, *allocation_site),
39 AllocationSpace space) {
42 isolate()->heap()->AllocateFillerObject(size, double_align, space),
168 // Internalized strings are created in the old generation (data space).
175 // Internalized strings are created in the old generation (data space).
344 // If the string is in new space it cannot be used as internalized.
1141 size_t space local
27 New(Handle<Map> map, AllocationSpace space, Handle<AllocationSite> allocation_site) argument
37 NewFillerObject(int size, bool double_align, AllocationSpace space) argument
1247 AllocationSpace space = pretenure == TENURED ? OLD_POINTER_SPACE : NEW_SPACE; local
[all...]
/external/chromium_org/v8/test/cctest/
H A Dtest-heap.cc942 // Allocate a large string (for large object space).
985 // Increase the chance of 'bump-the-pointer' allocation in old space.
990 // The plan: create JSObject which references objects in new space.
991 // Then clone this object (forcing it to go into old space) and check
1002 // Step 2: allocate a lot of objects so to almost fill new space: we need
1017 // Step 3: now allocate fixed array and JSObject to fill the whole new space.
1031 // Create a reference to object in new space in jsobject.
1039 // in old pointer space.
1292 // object is still located in new-space.
1622 // Allocate objects on several different old-space page
2069 PagedSpace* space = CcTest::heap()->old_pointer_space(); local
3577 AllocateAllButNBytes(v8::internal::NewSpace* space, int extra_bytes) argument
[all...]
/external/libcxx/src/
H A Dlocale.cpp758 const ctype_base::mask ctype_base::space; member in class:ctype_base
1185 if (m & space) result |= (iswspace_l(ch, __l) != 0);
1211 *vec |= space;
1243 if (m & space && iswspace_l(ch, __l)) break;
1268 if (m & space && iswspace_l(ch, __l)) continue;
4739 if (ct.is(ctype_base::space, *bb))
4742 for (++bb; bb != be && ct.is(ctype_base::space, *bb); ++bb)
4897 if (ct.is(ctype_base::space, *wbb))
4900 for (++wbb; wbb != wbe && ct.is(ctype_base::space, *wbb); ++wbb)
5438 const char space local
[all...]
/external/libxml2/include/libxml/
H A Dparser.h243 /* xml:space values */
244 int * space; /* Should the parser preserve spaces */ member in struct:_xmlParserCtxt
247 int * spaceTab; /* array of space infos */
/external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/
H A Dcmscgats.c1995 // gobble any space at the right
2232 int words = 1, space = 0, quot = 0; local
2249 if(!quot && !space)
2250 space = 1;
2258 words += space;
2259 space = 0;
/external/chromium_org/third_party/WebKit/Source/core/paint/
H A DBoxPainter.cpp614 int space = -1; local
617 space = lroundf((float)(areaSize - numberOfTiles * tileSize) / (numberOfTiles - 1));
619 return space;
732 int space = getSpace(positioningAreaSize.width(), geometry.tileSize().width()); local
733 int actualWidth = geometry.tileSize().width() + space;
735 if (space >= 0) {
737 geometry.setSpaceSize(IntSize(space, 0));
753 int space = getSpace(positioningAreaSize.height(), geometry.tileSize().height()); local
754 int actualHeight = geometry.tileSize().height() + space;
756 if (space >
[all...]
/external/chromium_org/third_party/libxml/src/
H A Dtree.c206 * Builds the QName @prefix:@ncname in @memory if there is enough space
356 * @space: allow spaces in front and end of the string
358 * Check that a value conforms to the lexical space of NCName
364 xmlValidateNCName(const xmlChar *value, int space) { argument
374 if (space)
386 if (space)
397 if (space) {
413 if (space) {
430 * @space: allow spaces in front and end of the string
432 * Check that a value conforms to the lexical space o
438 xmlValidateQName(const xmlChar *value, int space) argument
536 xmlValidateName(const xmlChar *value, int space) argument
605 xmlValidateNMToken(const xmlChar *value, int space) argument
4971 xmlChar *space; local
[all...]
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/preprocs/nasm/
H A Dnasm-pp.c388 * The number of macro parameters to allocate space for at a time.
4704 break; /* ... or a space then a comma */
5205 Token *inc, *space, *name; local
5209 space = new_Token(name, TOK_WHITESPACE, NULL, 0);
5210 inc = new_Token(space, TOK_PREPROC_ID, "%include", 0);
5222 Token *def, *space; local
5227 space = new_Token(NULL, TOK_WHITESPACE, NULL, 0);
5228 def = new_Token(space, TOK_PREPROC_ID, "%define", 0);
5231 space->next = tokenise(definition);
5245 Token *def, *space; local
5262 Token *def, *space; local
[all...]
/external/chromium_org/v8/src/ia32/
H A Dmacro-assembler-ia32.cc142 // If non-zero, the page belongs to new-space.
299 // Reserve space for 64 bit answer.
480 // relies on the fact that maps can never be in new space.
948 int space = XMMRegister::kMaxNumRegisters * kDoubleSize + local
950 sub(esp, Immediate(space));
980 // Reserve space for argc, argv and isolate.
1446 // safe in new-space because the limit of the heap is aligned there.
1463 // Calculate new top and bail out if space is exhausted.
1523 // safe in new-space because the limit of the heap is aligned there.
1540 // Calculate new top and bail out if space i
[all...]
/external/chromium_org/v8/src/x64/
H A Dmacro-assembler-x64.cc259 // case the size of the new space is different between the snapshot maker
416 // relies on the fact that maps can never be in new space.
4049 int space = XMMRegister::kMaxNumAllocatableRegisters * kDoubleSize + local
4051 subp(rsp, Immediate(space));
4367 // is safe in new-space because the limit of the heap is aligned there.
4443 // Calculate new top and bail out if new space is exhausted.
4519 // Calculate new top and bail out if new space is exhausted.
4560 // Allocate heap number in new space.
4592 // Allocate two byte string in new space.
4628 // Allocate one-byte string in new space
[all...]
/external/chromium_org/v8/src/x87/
H A Dmacro-assembler-x87.cc142 // If non-zero, the page belongs to new-space.
403 // relies on the fact that maps can never be in new space.
918 int space = 108 + argc * kPointerSize; local
919 sub(esp, Immediate(space));
946 // Reserve space for argc, argv and isolate.
1409 // safe in new-space because the limit of the heap is aligned there.
1426 // Calculate new top and bail out if space is exhausted.
1486 // safe in new-space because the limit of the heap is aligned there.
1503 // Calculate new top and bail out if space is exhausted.
1561 // safe in new-space becaus
[all...]
/external/libxml2/
H A Dtree.c209 * Builds the QName @prefix:@ncname in @memory if there is enough space
359 * @space: allow spaces in front and end of the string
361 * Check that a value conforms to the lexical space of NCName
367 xmlValidateNCName(const xmlChar *value, int space) { argument
377 if (space)
389 if (space)
400 if (space) {
416 if (space) {
433 * @space: allow spaces in front and end of the string
435 * Check that a value conforms to the lexical space o
441 xmlValidateQName(const xmlChar *value, int space) argument
539 xmlValidateName(const xmlChar *value, int space) argument
608 xmlValidateNMToken(const xmlChar *value, int space) argument
5058 xmlChar *space; local
[all...]
/external/mdnsresponder/mDNSCore/
H A DDNSCommon.c508 while (*cstr && ptr < lim) // While more characters, and space to put them...
880 // Having truncated characters off the end of our string, also cut off any residual white space
1583 if (!*np) // If just writing one-byte root label, make sure we have space for that
1609 if (ptr+2 > limit) return(mDNSNULL); // If we don't have two bytes of space left, give up
1618 // If we don't at least have enough space for this label *plus* a terminating zero on the end, give up
1727 if (ptr + len > limit) { LogMsg("ERROR: putOptRData - out of space"); return mDNSNULL; }
1731 const int space = DNSOpt_Data_Space(opt); local
1733 ptr = putVal16(ptr, (mDNSu16)space - 4);
1752 if (space >= DNSOpt_OwnerData_ID_Wake_Space)
1756 if (space > DNSOpt_OwnerData_ID_Wake_Spac
[all...]
/external/opencv/cxcore/src/
H A Dcxpersistence.cpp133 int space; member in struct:CvFileStorage
347 if( ptr > fs->buffer_start + fs->space )
357 if( fs->space != indent )
359 if( fs->space < indent )
360 memset( fs->buffer_start + fs->space, ' ', indent - fs->space );
361 fs->space = indent;
364 ptr = fs->buffer = fs->buffer_start + fs->space;
1876 CV_PARSE_ERROR( "There should be space between literals" );
2162 CV_PARSE_ERROR( "There should be space betwee
[all...]
/external/valgrind/main/helgrind/
H A Dhg_main.c392 static void space ( Int n ) function
408 space(d+0); VG_(printf)("Thread %p {\n", t);
410 space(d+3); VG_(printf)("admin %p\n", t->admin);
411 space(d+3); VG_(printf)("magic 0x%x\n", (UInt)t->magic);
413 space(d+3); VG_(printf)("locksetA %d\n", (Int)t->locksetA);
414 space(d+3); VG_(printf)("locksetW %d\n", (Int)t->locksetW);
415 space(d+0); VG_(printf)("}\n");
425 space(d); VG_(printf)("admin_threads (%d records) {\n", n);
428 space(n);
433 space(
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.core.expressions_3.4.200.v20100505.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/sdk/
H A DCSSMetadata.js111 "text-align", "text-indent", "text-transform", "text-shadow", "visibility", "voice-family", "volume", "white-space", "widows",
187 "repeat", "repeat-x", "repeat-y", "no-repeat", "space", "round"
493 "white-space": { values: [
540 "flex-start", "flex-end", "center", "space-between", "space-around", "stretch"
552 "flex-start", "flex-end", "center", "space-between", "space-around"
852 "white-space": 24,
/external/chromium_org/third_party/usrsctp/usrsctplib/netinet/
H A Dsctp_output.c2003 /* Need more space */
4008 /* no space, so free the entire chain */
5502 * pre-reserve space for ip and sctp
5515 /* If we have space */
5577 /* If we have space */
6478 /* Houston we have a problem, no space */
6492 /* Now append the cookie to the end and update the space/size */
6559 * the buffer space flag. If the one being sent is
6561 * and free some space.
6565 * This one is PR-SCTP AND buffer space
10917 unsigned int num_gap_blocks = 0, num_nr_gap_blocks = 0, space; local
[all...]
/external/chromium_org/v8/src/heap/
H A Dheap.cc236 GarbageCollector Heap::SelectGarbageCollector(AllocationSpace space, argument
239 if (space != NEW_SPACE) {
241 *reason = "GC in old space requested";
246 *reason = "GC in old space forced by flags";
266 // Is there enough space left in OLD to guarantee that a scavenge can
271 // allocator has not yet allocated from the OS and assigned to any space,
272 // and does not count available bytes already in the old space or code
273 // space. Undercounting is safe---we may get an unrequested full GC when
320 PrintPID("New space, used: %6" V8_PTR_PREFIX
335 PrintPID("Old data space, use
911 AbortIncrementalMarkingAndCollectGarbage( Heap* heap, AllocationSpace space, const char* gc_reason = NULL) argument
2324 AllocateFillerObject(int size, bool double_align, AllocationSpace space) argument
2626 AllocationSpace space = SelectSpace(size, OLD_DATA_SPACE, pretenure); local
3189 AllocationSpace space = (pretenure == TENURED) ? OLD_DATA_SPACE : NEW_SPACE; local
3203 AllocationSpace space = SelectSpace(size, OLD_DATA_SPACE, pretenure); local
3362 AllocationSpace space = SelectSpace(size, OLD_DATA_SPACE, pretenure); local
3408 AllocationSpace space = SelectSpace(size, OLD_DATA_SPACE, pretenure); local
3569 Allocate(Map* map, AllocationSpace space, AllocationSite* allocation_site) argument
3653 AllocationSpace space = SelectSpace(size, OLD_POINTER_SPACE, pretenure); local
3829 AllocationSpace space = SelectSpace(size, OLD_DATA_SPACE, TENURED); local
3872 AllocationSpace space = SelectSpace(size, OLD_DATA_SPACE, pretenure); local
3896 AllocationSpace space = SelectSpace(size, OLD_DATA_SPACE, pretenure); local
4040 AllocationSpace space = SelectSpace(size, OLD_POINTER_SPACE, pretenure); local
4111 AllocationSpace space = SelectSpace(size, OLD_DATA_SPACE, pretenure); local
4130 AllocationSpace space = SelectSpace(size, OLD_POINTER_SPACE, TENURED); local
4156 AllocationSpace space = SelectSpace(size, OLD_POINTER_SPACE, TENURED); local
4232 AllocationSpace space = SelectSpace(size, OLD_POINTER_SPACE, TENURED); local
4459 InSpace(HeapObject* value, AllocationSpace space) argument
4464 InSpace(Address addr, AllocationSpace space) argument
4657 OldSpace* space = old_pointer_space(); local
4680 MapSpace* space = map_space(); local
[all...]
H A Dmark-compact.cc109 static void VerifyMarking(NewSpace* space) { argument
110 Address end = space->top();
111 NewSpacePageIterator it(space->bottom(), end);
114 CHECK_EQ(space->bottom(),
115 NewSpacePage::FromAddress(space->bottom())->area_start());
120 VerifyMarking(space->heap(), page->area_start(), limit);
125 static void VerifyMarking(PagedSpace* space) { argument
126 PageIterator it(space);
130 VerifyMarking(space->heap(), p->area_start(), p->area_end());
175 // We skip free space object
183 VerifyEvacuation(NewSpace* space) argument
201 VerifyEvacuation(Heap* heap, PagedSpace* space) argument
343 TraceFragmentation(PagedSpace* space) argument
436 VerifyMarkbitsAreClean(PagedSpace* space) argument
447 VerifyMarkbitsAreClean(NewSpace* space) argument
498 ClearMarkbitsInPagedSpace(PagedSpace* space) argument
507 ClearMarkbitsInNewSpace(NewSpace* space) argument
538 SweeperTask(Heap* heap, PagedSpace* space) argument
627 RefillFreeList(PagedSpace* space) argument
691 AllocationSpaceName(AllocationSpace space) argument
720 FreeListFragmentation(PagedSpace* space, Page* p) argument
768 CollectEvacuationCandidates(PagedSpace* space) argument
2008 DiscoverGreyObjectsInSpace(Heap* heap, MarkingDeque* marking_deque, PagedSpace* space) argument
2021 NewSpace* space = heap->new_space(); local
3124 PagedSpace* space = static_cast<PagedSpace*>(p->owner()); local
3177 PagedSpace* space = static_cast<PagedSpace*>(p->owner()); local
3278 Free(PagedSpace* space, FreeList* free_list, Address start, int size) argument
3298 Sweep(PagedSpace* space, FreeList* free_list, Page* p, ObjectVisitor* v) argument
3613 PagedSpace* space = static_cast<PagedSpace*>(p->owner()); local
3700 PagedSpace* space = static_cast<PagedSpace*>(p->owner()); local
3711 PagedSpace* space = static_cast<PagedSpace*>(p->owner()); local
4103 DCHECK(byte < kStartTableLines); char* table = kStartTable + byte * kStartTableEntriesPerLine; int objects_in_these_8_words = table[0]; DCHECK(objects_in_these_8_words != kStartTableInvalidLine); DCHECK(objects_in_these_8_words < kStartTableEntriesPerLine); for (int i = 0; i < objects_in_these_8_words; i++) { starts[objects++] = offset + table[1 + i]; } } offset += 8; } return objects; } int MarkCompactCollector::SweepInParallel(PagedSpace* space, int required_freed_bytes) { int max_freed = 0; int max_freed_overall = 0; PageIterator it(space); while (it.has_next()) { Page* p = it.next(); max_freed = SweepInParallel(p, space); DCHECK(max_freed >= 0); if (required_freed_bytes > 0 && max_freed >= required_freed_bytes) argument
4137 SweepInParallel(Page* page, PagedSpace* space) argument
4152 SweepSpace(PagedSpace* space, SweeperType sweeper) argument
4337 ParallelSweepSpaceComplete(PagedSpace* space) argument
[all...]
H A Dspaces.h26 // object space. The young generation is divided into two semispaces. A
28 // separated into a map space and an old object space. The map space contains
29 // all (and only) map objects, the rest of old objects go into the old space.
36 // There is a separate large object space for objects larger than
38 // collection. The large object space is paged. Pages in large object space
46 // object maps so if the page belongs to old pointer space or large object
47 // space i
317 set_owner(Space* space) argument
1129 MemoryAllocationCallbackRegistration(MemoryAllocationCallback callback, ObjectSpace space, AllocationAction action) argument
1134 ObjectSpace space; member in struct:v8::internal::MemoryAllocator::MemoryAllocationCallbackRegistration
1636 AllocationResult(AllocationSpace space) argument
[all...]
/external/chromium_org/v8/src/mips/
H A Dmacro-assembler-mips.cc251 // relies on the fact that maps can never be in new space.
377 stop("Remembered set pointer is in new space");
3322 // safe in new-space because the limit of the heap is aligned there.
3337 // Calculate new top and bail out if new space is exhausted. Use result
3409 // safe in new-space because the limit of the heap is aligned there.
3424 // Calculate new top and bail out if new space is exhausted. Use result
3483 // Allocate two-byte string in new space.
3511 // Allocate one-byte string in new space.
3597 // Allocates a heap number or jumps to the label if the young space is full and
4880 nop(); // Pad the empty space
4957 int space = FPURegister::kMaxNumRegisters * kDoubleSize; local
[all...]
/external/icu/icu4c/source/test/cintltst/
H A Dcmsccoll.c1718 static const UChar space = 0x20; local
1728 varTop1 = ucol_setVariableTop(coll, &space, 1, &status);
1730 log_verbose("ucol_setVariableTop(space) -> %08x\n", varTop1);
1732 !ucol_equal(coll, &nul, 0, &space, 1) ||
1737 ucol_greaterOrEqual(coll, &space, 1, &dot, 1)) {
1738 log_err("ucol_setVariableTop(space) did not work - %s\n", u_errorName(status));
1745 !ucol_equal(coll, &nul, 0, &space, 1) ||
1758 !ucol_equal(coll, &nul, 0, &space, 1) ||
1771 !ucol_equal(coll, &nul, 0, &space, 1) ||
1807 varTop1 = ucol_setVariableTop(coll, &space,
1828 static const UChar space = 0x20; local
[all...]
/external/kernel-headers/original/uapi/sound/
H A Dasound.h774 unsigned char components[128]; /* card components / fine identification, delimited with one space (AC97 etc..) */
810 #define SNDRV_CTL_ELEM_ACCESS_USER (1<<29) /* user space element */
834 unsigned int space; /* W: count of element IDs to get */ member in struct:snd_ctl_elem_list

Completed in 1472 milliseconds

1234567