Searched refs:capacity (Results 1 - 25 of 26) sorted by relevance

12

/vbox/src/libs/zlib-1.2.6/contrib/dotzlib/DotZLib/
H A DCircularBuffer.cs27 public CircularBuffer(int capacity) argument
29 Debug.Assert( capacity > 0 );
30 _buffer = new byte[capacity];
31 _capacity = capacity;
/vbox/src/libs/xpcom18a4/xpcom/string/src/
H A DnsTSubstring.cpp51 * this function is called to prepare mData for writing. the given capacity
58 nsTSubstring_CharT::MutatePrep( size_type capacity, char_type** oldData, PRUint32* oldFlags ) argument
72 if (capacity <= curCapacity)
77 // use doubling algorithm when forced to increase available capacity,
80 while (temp < capacity)
82 capacity = temp;
98 size_type storageSize = (capacity + 1) * sizeof(char_type);
127 if ((mFlags & F_CLASS_FIXED) && (capacity < AsFixedString(this)->mFixedCapacity))
229 size_type capacity; local
232 // if the string is readonly, then we pretend that it has no capacity
[all...]
/vbox/src/VBox/Devices/PC/ipxe/src/include/ipxe/
H A Dblockdev.h17 /** Block device capacity */
49 struct block_device_capacity *capacity );
52 struct block_device_capacity *capacity ) )
/vbox/src/VBox/Devices/PC/ipxe/src/core/
H A Dblockdev.c94 * Read block device capacity
119 * Report block device capacity
122 * @v capacity Block device capacity
125 struct block_device_capacity *capacity ) {
132 op ( object, capacity );
/vbox/src/libs/xpcom18a4/xpcom/ds/
H A Dpldhash.c183 PRUint32 capacity)
194 if (!PL_DHashTableInit(table, ops, data, entrySize, capacity)) {
218 PRUint32 entrySize, PRUint32 capacity)
236 if (capacity < PL_DHASH_MIN_SIZE)
237 capacity = PL_DHASH_MIN_SIZE;
238 log2 = PR_CeilingLog2(capacity);
239 capacity = PR_BIT(log2);
240 if (capacity >= PL_DHASH_SIZE_LIMIT)
248 nbytes = capacity * entrySize;
646 PRUint32 i, capacity, entrySiz local
182 PL_NewDHashTable(const PLDHashTableOps *ops, void *data, PRUint32 entrySize, PRUint32 capacity) argument
[all...]
H A Dpldhash.h439 PRUint32 capacity);
449 * Initialize table with ops, data, entrySize, and capacity. Capacity is a
451 * than 75% loaded (the table will grow or shrink as needed; capacity serves
456 PRUint32 entrySize, PRUint32 capacity);
/vbox/src/VBox/Devices/PC/ipxe/src/drivers/block/
H A Dscsi.c552 } capacity; member in struct:scsi_read_capacity_private
566 struct scsi_capacity_16 *capacity16 = &priv->capacity.capacity16;
567 struct scsi_capacity_10 *capacity10 = &priv->capacity.capacity10;
594 struct scsi_capacity_16 *capacity16 = &priv->capacity.capacity16;
595 struct scsi_capacity_10 *capacity10 = &priv->capacity.capacity10;
596 struct block_device_capacity capacity; local
604 /* Extract capacity */
606 capacity.blocks = ( be64_to_cpu ( capacity16->lba ) + 1 );
607 capacity.blksize = be32_to_cpu ( capacity16->blksize );
609 capacity
[all...]
H A Data.c376 struct block_device_capacity capacity; local
384 /* Extract capacity */
387 capacity.blocks = le64_to_cpu ( identity->lba48_sectors );
389 capacity.blocks = le32_to_cpu ( identity->lba_sectors );
391 capacity.blksize = ATA_SECTOR_SIZE;
392 capacity.max_count = atadev->max_count;
395 atadev, capacity.blocks,
396 ( ( signed long ) ( capacity.blocks >> 11 ) ),
399 /* Return capacity to caller */
400 block_capacity ( &atacmd->block, &capacity );
[all...]
/vbox/src/VBox/Runtime/common/string/
H A Dministring.cpp85 AssertReleaseReturn(pThis->capacity() > cchBoth, 0);
116 AssertRelease(capacity() > cchBoth);
140 AssertRelease(capacity() > cchBoth);
162 AssertRelease(capacity() > m_cch + 1);
191 AssertRelease(capacity() > m_cch + 6);
293 AssertRelease(capacity() >= cbCopy + 1);
/vbox/src/VBox/Additions/x11/x11include/mesa-7.2/src/mesa/shader/slang/
H A Dslang_utility.h47 GLuint capacity; member in struct:__anon3734
/vbox/src/VBox/NetworkServices/NAT/
H A Dproxy_pollmgr.c48 nfds_t capacity; /* allocated size of the arrays */ member in struct:pollmgr
89 pollmgr.capacity = 0;
131 pollmgr.capacity = newcap;
137 for (i = 0; i < pollmgr.capacity; ++i) {
184 if (pollmgr.nfds == pollmgr.capacity) {
190 newcap = pollmgr.capacity * 2;
201 /* but don't update capacity yet! */
208 * new array, but we pretend we still has old capacity */
214 pollmgr.capacity = newcap;
/vbox/src/VBox/Devices/PC/ipxe/src/arch/i386/interface/pcbios/
H A Dint13.c92 /** Block device capacity */
93 struct block_device_capacity capacity; member in struct:int13_drive
191 return ( int13->capacity.blksize << int13->blksize_shift );
195 * Calculate INT 13 drive capacity
201 return ( int13->capacity.blocks >> int13->blksize_shift );
205 * Calculate INT 13 drive capacity (limited to 32 bits)
211 uint64_t capacity = int13_capacity ( int13 ); local
212 return ( ( capacity <= 0xffffffffUL ) ? capacity : 0xffffffff );
238 * Record INT 13 drive capacity
[all...]
/vbox/src/VBox/Runtime/testcase/
H A DtstIprtList.cpp172 RTTESTI_CHECK(testList.capacity() == defCap);
343 RTTESTI_CHECK(testList.capacity() == cTestItems * 5);
346 /* As the capacity just increased, we should still have all entries from
351 /* Decrease the capacity so it will be smaller than the count of items in
356 RTTESTI_CHECK(testList.capacity() == cTestItems / 4);
364 RTTESTI_CHECK(testList.capacity() == defCap);
371 RTTESTI_CHECK(testList5.capacity() == 0);
377 RTTESTI_CHECK(testList5.capacity() == 0);
H A DtstIprtMiniString.cpp79 CHECK(empty.capacity() == 0);
83 CHECK(sixbytes.capacity() == 6);
87 CHECK(sixbytes.capacity() >= 9);
91 CHECK(sixbytes.capacity() >= 11);
100 CHECK(sixbytes.capacity() == 7);
111 CHECK(third.capacity() == 100 * 1024);
/vbox/src/VBox/Devices/PC/ipxe/src/net/tcp/
H A Dhttpcore.c310 struct block_device_capacity capacity; local
337 /* Report block device capacity if applicable */
339 capacity.blocks = ( content_len / HTTP_BLKSIZE );
340 capacity.blksize = HTTP_BLKSIZE;
341 capacity.max_count = -1U;
342 block_capacity ( &http->partial, &capacity );
807 * Read HTTP block device capacity
/vbox/include/VBox/com/
H A Darray.h1098 * If the new size is greater than the current capacity, a new array is
1100 * the array doesn't change, only the capacity increases (which is always
1130 if (m.capacity != newCapacity)
1167 m.capacity = newCapacity;
1199 , capacity(0), size(0), arr(NULL)
1226 size = capacity = 0;
1255 PRUint32 capacity;
/vbox/src/libs/xpcom18a4/xpcom/string/public/
H A DnsTSubstring.h377 NS_COM void NS_FASTCALL SetCapacity( size_type capacity );
447 * @param capacity specifies the required capacity of mData
451 * if mData is already mutable and of sufficient capacity, then this
459 PRBool NS_FASTCALL MutatePrep( size_type capacity, char_type** old_data, PRUint32* old_flags );
/vbox/include/iprt/cpp/
H A Dministring.h227 size_t capacity() const function in class:RTCString
492 * capacity() to find out how large that buffer is.
H A Dlist.h61 * be known, calling the constructor with the necessary capacity will speed up
210 * @param cCapacitiy The initial capacity the list has.
225 * The other list will be fully copied and the capacity will be the same as
261 * Sets a new capacity within the list.
263 * If the new capacity is bigger than the old size, it will be simply
264 * preallocated more space for the new items. If the new capacity is
268 * @param cCapacity The new capacity within the list.
279 * Return the current capacity of the list.
281 * @return The actual capacity.
283 size_t capacity() cons function in class:RTCListBase
[all...]
/vbox/src/VBox/Main/webservice/jaxlibs/
H A Dmimepull.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/jvnet/ org/jvnet/mimepull/ org/jvnet/mimepull/FinalArrayList ...
H A Dsaaj-impl.jarMETA-INF/ META-INF/MANIFEST.MF META-INF/services/ com/ com/sun/ com/sun/xml/ ...
H A DFastInfoset.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/sun/ com/sun/xml/ com/sun/xml/fastinfoset/ ...
H A Dsjsxp.jarMETA-INF/ META-INF/MANIFEST.MF META-INF/services/ com/ com/sun/ com/sun/xml/ ...
/vbox/src/VBox/Main/webservice/
H A Dvboxweb.cpp1424 aStr.mutableRaw(), aStr.capacity(),
/vbox/src/VBox/Storage/
H A DVMDK.cpp120 uint64_t capacity; member in struct:SparseExtentHeader
138 /** VMDK capacity for a single chunk when 2G splitting is turned on. Should be
2589 pExtent->cSectors = RT_LE2H_U64(Header.capacity);
2737 Header.capacity = RT_H2LE_U64(pExtent->cSectors);

Completed in 127 milliseconds

12