HomeSort by: relevance | last modified time | path
    Searched refs:Stable (Results 1 - 11 of 11) sorted by relevancy

  /src/external/cddl/osnet/lib/libdtrace/
sched.d 68 #pragma D attributes Stable/Stable/Common curcpu
72 #pragma D attributes Stable/Stable/Common cpu
76 #pragma D attributes Stable/Stable/Common pset
80 #pragma D attributes Stable/Stable/Common chip
84 #pragma D attributes Stable/Stable/Common lgr
    [all...]
psinfo.d 91 #pragma D attributes Stable/Stable/Common curpsinfo
95 #pragma D attributes Stable/Stable/Common curlwpsinfo
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/
AppendingTypeTableBuilder.cpp 79 uint8_t *Stable = RecordStorage.Allocate<uint8_t>(Record.size());
80 memcpy(Stable, Record.data(), Record.size());
81 return ArrayRef<uint8_t>(Stable, Record.size());
GlobalTypeTableBuilder.cpp 89 uint8_t *Stable = Alloc.Allocate<uint8_t>(Data.size());
90 memcpy(Stable, Data.data(), Data.size());
91 return makeArrayRef(Stable, Data.size());
MergingTypeTableBuilder.cpp 85 uint8_t *Stable = Alloc.Allocate<uint8_t>(Data.size());
86 memcpy(Stable, Data.data(), Data.size());
87 return makeArrayRef(Stable, Data.size());
106 // Update the caller's copy of Record to point a stable copy.
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/CodeView/
GlobalTypeTableBuilder.h 82 uint8_t *Stable = RecordStorage.Allocate<uint8_t>(RecordSize);
83 MutableArrayRef<uint8_t> Data(Stable, RecordSize);
  /src/external/apache2/llvm/dist/llvm/lib/Demangle/
MicrosoftDemangle.cpp 248 char *Stable = Arena.allocUnalignedBuffer(Borrowed.size() + 1);
249 std::strcpy(Stable, Borrowed.begin());
251 return {Stable, Borrowed.size()};
  /src/sys/dev/ic/
ld_aac.c 187 bw->Stable = htole32(CUNSTABLE);
aacreg.h 715 u_int32_t Stable;
aac.c 1732 le32toh(bw->Stable) == CSTABLE ?
1733 "stable" : "unstable");
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/
sorting.d 380 r.length * log(r.length)) (if stable) evaluations of `less` and $(REF_ALTTEXT swap, swap, std,algorithm,mutation).
393 If `ss == SwapStrategy.stable`, `partition` preserves the relative
401 if (ss == SwapStrategy.stable && isRandomAccessRange!(Range) && hasLength!Range &&
424 if (ss != SwapStrategy.stable && isInputRange!Range && hasSwappableElements!Range)
545 // Now for a stable partition:
547 r = partition!(q{(a & 1) == 0}, SwapStrategy.stable)(arr);
830 BUGS: stable `partition3` has not been implemented yet.
1881 Stable sorting requires `hasAssignableElements!Range` to be true.
1911 $(HTTP en.wikipedia.org/wiki/Timsort, Timsort) is used for stable sorting.
1936 Stable sorting uses TimSort, which needs to copy elements into a buffer
    [all...]

Completed in 23 milliseconds