Searched refs:numEntries (Results 1 - 25 of 116) sorted by relevance

12345

/macosx-10.10/llvmCore-3425.0.34/include/llvm/Analysis/
H A DProfileInfoTypes.h37 unsigned numEntries; /* number of entries stored */ member in struct:__anon9988
/macosx-10.10/libarchive-30/libarchive/libarchive/test/
H A Dtest_read_extract.c36 int i, numEntries = 0; local
51 ++numEntries;
58 ++numEntries;
69 ++numEntries;
76 ++numEntries;
83 ++numEntries;
90 ++numEntries;
97 ++numEntries;
105 ++numEntries;
127 for (i = 1; i < numEntries;
[all...]
/macosx-10.10/xnu-2782.1.97/iokit/IOKit/
H A DIODataQueue.h97 * @discussion This method will create a new IODataQueue instance with enough capacity for numEntries of entrySize. It does account for the IODataQueueEntry overhead for each entry. Note that the numEntries and entrySize are simply used to determine the data region size. They do not actually restrict the size of number of entries that can be added to the queue.<br> This method allocates a new IODataQueue instance and then calls initWithEntries() with the given numEntries and entrySize parameters. If the initWithEntries() fails, the new instance is released and zero is returned.
98 * @param numEntries Number of entries to allocate space for.
102 static IODataQueue *withEntries(UInt32 numEntries, UInt32 entrySize);
116 * @discussion This method will initialize an IODataQueue instance with enough capacity for numEntries of entrySize. It does account for the IODataQueueEntry overhead for each entry. Note that the numEntries and entrySize are simply used to determine the data region size. They do not actually restrict the size of number of entries that can be added to the queue.<br> This method allocates a new IODataQueue instance and then calls initWithEntries() with the given numEntries and entrySize parameters.
117 * @param numEntries Number of entries to allocate space for.
121 virtual Boolean initWithEntries(UInt32 numEntries, UInt3
[all...]
H A DIOSharedDataQueue.h99 * @discussion This method will create a new IOSharedDataQueue instance with enough capacity for numEntries of entrySize. It does account for the IODataQueueEntry overhead for each entry. Note that the numEntries and entrySize are simply used to determine the data region size. They do not actually restrict the size of number of entries that can be added to the queue.<br> This method allocates a new IODataQueue instance and then calls initWithEntries() with the given numEntries and entrySize parameters. If the initWithEntries() fails, the new instance is released and zero is returned.
100 * @param numEntries Number of entries to allocate space for.
104 static IOSharedDataQueue *withEntries(UInt32 numEntries, UInt32 entrySize);
/macosx-10.10/xnu-2782.1.97/iokit/Kernel/
H A DIODataQueue.cpp66 IODataQueue *IODataQueue::withEntries(UInt32 numEntries, UInt32 entrySize) argument
71 if (!dataQueue->initWithEntries(numEntries, entrySize)) {
117 Boolean IODataQueue::initWithEntries(UInt32 numEntries, UInt32 entrySize) argument
119 // Checking overflow for (numEntries + 1)*(entrySize + DATA_QUEUE_ENTRY_HEADER_SIZE):
122 // check (numEntries + 1)
123 (numEntries > UINT32_MAX-1) ||
124 // check (numEntries + 1)*(entrySize + DATA_QUEUE_ENTRY_HEADER_SIZE)
125 (entrySize + DATA_QUEUE_ENTRY_HEADER_SIZE > UINT32_MAX/(numEntries+1))) {
129 return (initWithCapacity((numEntries + 1) * (DATA_QUEUE_ENTRY_HEADER_SIZE + entrySize)));
H A DIOCommandQueue.cpp258 int numEntries; local
273 for (numEntries = 0; consumerIndex != producerIndex; ) {
294 return numEntries;
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/struct/sets/
H A Ds.c89 int numElems = s->el.numEntries;
231 return a->el.numEntries;
237 return (a->el.numEntries == 0);
275 if (!b->el.numEntries) {
284 if (!a->el.numEntries) return s;
315 if (!a->el.numEntries) return s;
316 if (!b->el.numEntries) return s;
320 if (b->el.numEntries < a->el.numEntries) {
363 if (b->el.numEntries) {
[all...]
/macosx-10.10/IOHIDFamily-606.1.7/IOHIDFamily/
H A DIOHIDEventQueue.h71 static IOHIDEventQueue * withEntries( UInt32 numEntries,
74 virtual Boolean initWithEntries(UInt32 numEntries, UInt32 entrySize);
H A DIOHIDEventQueue.cpp59 IOHIDEventQueue * IOHIDEventQueue::withEntries( UInt32 numEntries, argument
63 UInt32 size = numEntries*entrySize;
71 queue->_numEntries = numEntries;
96 Boolean IOHIDEventQueue::initWithEntries(UInt32 numEntries, UInt32 entrySize) argument
98 UInt32 size = numEntries*entrySize;
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/struct/graph/
H A Dnacommon.c116 ASSERT (gx->map->numEntries == gx->n, "Inconsistent #elements in graph");
130 listc = 2 * gx->map->numEntries;
138 if (!iter->attr->numEntries) continue;
182 if (!iter->attr->numEntries) continue;
209 listc = 2 * gx->map->numEntries;
217 if (!iter->attr->numEntries) continue;
243 listc = 2 * gx->map->numEntries;
251 if (!iter->attr->numEntries) continue;
H A Dattr.c21 if ((attr == NULL) || (attr->numEntries == 0)) {
25 listc = 2 * attr->numEntries;
139 if ((attr == NULL) || (attr->numEntries == 0)) {
144 listc = attr->numEntries;
201 if ((attr == NULL) || (attr->numEntries == 0)) {
253 if ((attr == NULL) || (attr->numEntries == 0)) {
263 listc = 2 * attr->numEntries;
/macosx-10.10/tcl-105/tcl_ext/thread/thread/generic/
H A DtclXkeylist.c211 int numEntries; /* Number of actual entries in the array. */ member in struct:__anon13054
350 TclX_Assert (keylIntPtr->arraySize >= keylIntPtr->numEntries);
352 TclX_Assert (keylIntPtr->numEntries >= 0);
355 TclX_Assert ((keylIntPtr->numEntries > 0) ?
358 for (idx = 0; idx < keylIntPtr->numEntries; idx++) {
438 keylIntPtr->numEntries = 0;
459 for (idx = 0; idx < keylIntPtr->numEntries ; idx++) {
487 if ((keylIntPtr->arraySize - keylIntPtr->numEntries) < newNumEntries) {
524 for (idx = entryIdx; idx < keylIntPtr->numEntries - 1; idx++)
526 keylIntPtr->numEntries
[all...]
/macosx-10.10/IOFireWireFamily-456/IOFireWireFamily.kmodproj/
H A DIOLocalConfigDirectory.cpp179 unsigned int numEntries = fEntries->getCount(); local
182 for( i = 0; i < numEntries; i++ )
212 unsigned int numEntries; local
221 numEntries = fEntries->getCount();
230 rom->ensureCapacity(size + sizeof(UInt32)*(1+numEntries));
231 tmp = OSData::withCapacity(sizeof(UInt32)*(numEntries));
232 for( i = 0; i < numEntries; i++ )
253 val = numEntries-i+offset;
270 header = numEntries << kConfigLeafDirLengthPhase;
278 for(i=0; i<numEntries;
538 unsigned int i, numEntries; local
[all...]
/macosx-10.10/tcl-105/tcl_ext/tclx/tclx/generic/
H A DtclXkeylist.c57 int numEntries; /* Number of actual entries in the array. */ member in struct:__anon12977
194 TclX_Assert (keylIntPtr->arraySize >= keylIntPtr->numEntries);
196 TclX_Assert (keylIntPtr->numEntries >= 0);
199 TclX_Assert ((keylIntPtr->numEntries > 0) ?
202 for (idx = 0; idx < keylIntPtr->numEntries; idx++) {
284 for (idx = 0; idx < keylIntPtr->numEntries ; idx++) {
318 if ((keylIntPtr->arraySize - keylIntPtr->numEntries) < newNumEntries) {
383 for (idx = entryIdx; idx < keylIntPtr->numEntries - 1; idx++)
385 keylIntPtr->numEntries--;
445 for (findIdx = 0; findIdx < keylIntPtr->numEntries; findId
[all...]
H A DtclXhandles.c92 int numEntries));
121 * o numEntries (I) - The number of new entries.
125 LinkInNewEntries (tblHdrPtr, newIdx, numEntries)
128 int numEntries;
133 lastIdx = newIdx + numEntries - 1;
/macosx-10.10/tcl-105/tcl84/tcl/generic/
H A DtclLiteral.c75 tablePtr->numEntries = 0;
121 while (tablePtr->numEntries > 0) {
298 globalTablePtr->numEntries++;
305 if (globalTablePtr->numEntries >= globalTablePtr->rebuildSize) {
442 localTablePtr->numEntries--;
544 localTablePtr->numEntries++;
553 if (localTablePtr->numEntries >= localTablePtr->rebuildSize) {
721 globalTablePtr->numEntries--;
938 average += (tmp+1.0)*(tmp/tablePtr->numEntries)/2.0;
947 tablePtr->numEntries, tablePt
[all...]
/macosx-10.10/tcl-105/tcl/tcl/generic/
H A DtclLiteral.c73 tablePtr->numEntries = 0;
329 globalTablePtr->numEntries++;
336 if (globalTablePtr->numEntries >= globalTablePtr->rebuildSize) {
589 localTablePtr->numEntries--;
687 localTablePtr->numEntries++;
694 if (localTablePtr->numEntries >= localTablePtr->rebuildSize) {
862 globalTablePtr->numEntries--;
1056 average += (tmp+1.0)*(tmp/tablePtr->numEntries)/2.0;
1065 tablePtr->numEntries, tablePtr->numBuckets);
1130 if (count != localTablePtr->numEntries) {
[all...]
/macosx-10.10/WebCore-7600.1.25/html/canvas/
H A DWebGLBuffer.cpp177 size_t numEntries = WTF_ARRAY_LENGTH(m_maxIndexCache); local
178 for (size_t i = 0; i < numEntries; ++i)
185 m_nextAvailableCacheEntry = (m_nextAvailableCacheEntry + 1) % numEntries;
/macosx-10.10/IOGraphics-485/IOGraphicsFamily/
H A DIOBootFramebuffer.h66 UInt32 numEntries, IOOptionBits options );
/macosx-10.10/Security-57031.1.35/SecurityTests/clxutils/crlTool/
H A DcrlNetwork.cpp57 int numEntries; local
149 numEntries = ldap_count_entries(ldap, msg);
150 if(numEntries != 1) {
151 ocspdErrorLog("tpCrlViaLdap: numEntries %d\n", numEntries);
/macosx-10.10/tcl-105/tk/tk/generic/
H A DtkMacWinMenu.c72 for (index = 0; index < menuPtr->numEntries; index++) {
H A DtkMenu.c792 if (first >= menuPtr->numEntries) {
1100 * We check numEntries in addition to whether the menu entry has a command
1105 if ((menuPtr->numEntries != 0) && (result == TCL_OK)
1220 for (i = menuPtr->numEntries; --i >= 0; ) {
1223 * decrement menuPtr->numEntries. Otherwise, the act of deleting menu
1225 * for menu entries (i+1)...numEntries.
1229 menuPtr->numEntries = i;
1534 for (i = 0; i < menuPtr->numEntries; i++) {
1630 if ((menuListPtr->numEntries == 0)
1648 } else if ((menuListPtr->numEntries >
[all...]
/macosx-10.10/tcl-105/tk84/tk/generic/
H A DtkMacWinMenu.c75 for (index = 0; index < menuPtr->numEntries; index++) {
H A DtkMenu.c1114 * We check numEntries in addition to whether the menu entry
1118 if ((menuPtr->numEntries != 0) && (result == TCL_OK)
1233 for (i = menuPtr->numEntries; --i >= 0; ) {
1236 * entries, decrement menuPtr->numEntries. Otherwise, the act of
1238 * to queue a redraw for menu entries (i+1)...numEntries.
1242 menuPtr->numEntries = i;
1543 for (i = 0; i < menuPtr->numEntries; i++) {
1641 if ((menuListPtr->numEntries == 0)
1659 } else if ((menuListPtr->numEntries > 0)
1666 for (i = 0; i < menuListPtr->numEntries
[all...]
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/
H A DPathProfileInfo.cpp378 new PathProfileTableEntry[pathHeader.numEntries];
381 pathHeader.numEntries, _file) != pathHeader.numEntries) {
389 for (unsigned int j = 0; j < pathHeader.numEntries; j++) {

Completed in 237 milliseconds

12345