Searched refs:allocations (Results 1 - 8 of 8) sorted by relevance

/macosx-10.9.5/IOPCIFamily-224.92.1/tools/
H A Dpcirange.cpp26 struct IOPCIRange * allocations; member in struct:IOPCIRange
54 range->allocations = (IOPCIRange *) &range->end;
92 if (nextRange->allocations != (IOPCIRange *) &nextRange->end)
147 prev = &headRange->allocations;
203 prev = &headRange->allocations;
299 range = head->allocations;
/macosx-10.9.5/IOPCIFamily-224.92.1/
H A DIOPCIRange.cpp88 range->allocations = (IOPCIRange *) &range->end;
135 if (nextRange->allocations != (IOPCIRange *) &nextRange->end)
186 range = headRange->allocations;
241 range = headRange->allocations;
270 range = headRange->allocations;
372 prev = &headRange->allocations;
473 range = oldRange->allocations;
484 prev = &headRange->allocations;
527 range = head->allocations;
/macosx-10.9.5/IOPCIFamily-224.92.1/IOKit/pci/
H A DIOPCIConfigurator.h65 struct IOPCIRange * allocations; member in struct:IOPCIRange
/macosx-10.9.5/ntp-88/include/
H A Dntp_request.h533 u_int32 allocations; member in struct:info_mem_stats
/macosx-10.9.5/ruby-104/ruby/
H A Dgc.c214 size_t allocations; member in struct:rb_objspace::__anon12352
3235 * all memory and object allocations.
3501 ATOMIC_SIZE_INC(objspace->malloc_params.allocations);
3588 ATOMIC_SIZE_DEC(objspace->malloc_params.allocations);
3672 /* set 0 for consistency of allocated_size/allocations */
3699 * Returns the number of malloc() allocations.
3707 return UINT2NUM(rb_objspace.malloc_params.allocations);
/macosx-10.9.5/ntp-88/ntpd/
H A Dntp_request.c1199 ms->allocations = htonl((u_int32)peer_allocations);
/macosx-10.9.5/ntp-88/ntpdc/
H A Dntpdc_ops.c1215 (void) fprintf(fp, "new peer allocations: %ld\n",
1216 (u_long)ntohl(mem->allocations));
/macosx-10.9.5/Heimdal-323.92.1/lib/hcrypto/libtommath/
H A Dtommath.tex725 the initial integer will represent zero. If only a single digit were allocated quite a few subsequent re-allocations
727 and how many re-allocations are tolerable. Obviously allocating an excessive amount of digits initially will waste
910 It is ideal to prevent re-allocations from being performed if they are not required (step one). This is useful to
974 allocations from becoming a bottleneck in the rest of the algorithms.
978 correct no further memory re-allocations are required to work with the mp\_int.
1106 $\left [ 1 \right ]$ & Discuss the consequences of not using padding when performing allocations. \\
2616 $t$ (line 37) to the exact size of the output to avoid further re--allocations. At this point we now
5597 Unlike the full multiplication algorithms this algorithm does not require any significnat temporary storage or memory allocations.

Completed in 211 milliseconds