HomeSort by relevance Sort by last modified time
    Searched full:unordered (Results 101 - 125 of 557) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/llvm/test/CodeGen/PowerPC/
atomics.ll 16 %val = load atomic i8, i8* %mem unordered, align 1
49 store atomic i8 42, i8* %mem unordered, align 1
  /external/selinux/secilc/docs/
cil_class_and_permission_statements.md 180 **Unordered Classorder Statement:**
182 If users do not have knowledge of the existing [`classorder`](#classorder), the `unordered` keyword may be used in a [`classorder`](#classorder) statement. The [classes](#class) in an unordered statement are appended to the existing [`classorder`](#classorder). A class in an ordered statement always supercedes the class redeclaration in an unordered statement. The `unordered` keyword must be the first item in the [`classorder`](#classorder) listing.
186 This will produce an unordered list of "`file dir foo a bar baz`"
196 (classorder (unordered a))
197 (classorder (unordered bar foo baz))
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/debug/
safe_unordered_base.h 107 * reference an unordered container.
110 * tracking iterators into an unordered container. Containers that track
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/debug/
safe_unordered_base.h 107 * reference an unordered container.
110 * tracking iterators into an unordered container. Containers that track
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/debug/
safe_unordered_base.h 107 * reference an unordered container.
110 * tracking iterators into an unordered container. Containers that track
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/
safe_unordered_base.h 107 * reference an unordered container.
110 * tracking iterators into an unordered container. Containers that track
  /external/webrtc/talk/app/webrtc/
datachannel_unittest.cc 245 // Tests that an unordered DataChannel sends data as ordered until the OPEN_ACK
270 // Sends another message and verifies it's unordered.
275 // Tests that an unordered DataChannel sends unordered data after any DATA
294 // Sends a message and verifies it's unordered.
  /dalvik/dexgen/src/com/android/dexgen/dex/code/
RopTranslator.java 322 * and then pick its first as-yet unordered successor to
326 * by finding an unordered chain containing the first as-yet
327 * unordered block, and adding it to the order, and so on.
335 * as-yet unordered predecessor which lists the chosen
337 * fail to find such an unordered predecessor. Start the
379 * unordered successors (hopefully the primary), and so
380 * on, until we run out of unordered successors.
  /dalvik/dx/src/com/android/dx/dex/code/
RopTranslator.java 328 * and then pick its first as-yet unordered successor to
332 * by finding an unordered chain containing the first as-yet
333 * unordered block, and adding it to the order, and so on.
341 * as-yet unordered predecessor which lists the chosen
343 * fail to find such an unordered predecessor. Start the
385 * unordered successors (hopefully the primary), and so
386 * on, until we run out of unordered successors.
  /external/dexmaker/src/dx/java/com/android/dx/dex/code/
RopTranslator.java 329 * and then pick its first as-yet unordered successor to
333 * by finding an unordered chain containing the first as-yet
334 * unordered block, and adding it to the order, and so on.
342 * as-yet unordered predecessor which lists the chosen
344 * fail to find such an unordered predecessor. Start the
386 * unordered successors (hopefully the primary), and so
387 * on, until we run out of unordered successors.
  /external/llvm/test/CodeGen/SystemZ/
cond-store-04.ll 161 ; the "unordered" case tested here, but since we don't try to handle atomic
173 %orig = load atomic i64 , i64 *%ptr unordered, align 8
191 store atomic i64 %res, i64 *%ptr unordered, align 8
  /external/llvm/lib/Target/X86/
X86IntrinsicsInfo.h     [all...]
  /art/runtime/gc/
reference_queue.h 47 // appropriate java.lang.ref.ReferenceQueue. The linked list is maintained as an unordered,
  /external/ceres-solver/cmake/
config.h.in 72 // Which version of unordered map was used when Ceres was compiled. Exactly
  /external/libgdx/gdx/src/com/badlogic/gdx/utils/
OrderedSet.java 22 * for put and remove. {@link #iterator() Iteration} is ordered and faster than an unordered set. Keys can also be accessed and
Select.java 21 /** This class is for selecting a ranked element (kth ordered statistic) from an unordered list in faster time than sorting the
  /external/valgrind/none/tests/mips32/
fpu_branches.c 211 printf("--- C.UN.S/D --- if unordered(fs, ft) then " \
225 printf("--- C.UEQ.S/D --- if (unordered(fs, ft) or (fs == ft)) then " \
239 printf("--- C.ULT.S/D --- if (unordered(fs, ft) or (fs < ft)) then " \
253 printf("--- C.ULE.S/D --- if (unordered(fs, ft) or (fs <= ft)) then " \
  /frameworks/base/libs/hwui/
TreeInfo.h 48 // Due to the unordered nature of tree pushes, once prepareTree
  /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/
struct.proto 53 // Unordered map of dynamically typed values.
  /system/update_engine/payload_generator/
extent_ranges.h 28 // An ExtentRanges object represents an unordered collection of extents (and
  /toolchain/binutils/binutils-2.25/include/opcode/
rl78.h 48 /* Unordered. */
  /external/clang/test/CodeGenCXX/
microsoft-abi-thread-safe-statics.cpp 54 // CHECK: %[[guard:.*]] = load atomic i32, i32* @"\01?$TSS0@?1??g@@YAAAUS@@XZ" unordered, align 4
61 // CHECK-NEXT: %[[guard2:.*]] = load atomic i32, i32* @"\01?$TSS0@?1??g@@YAAAUS@@XZ" unordered, align 4
  /external/selinux/secilc/test/
policy.cil 52 (classorder (unordered dir))
53 (classorder (unordered c a b d e f))
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/
unordered_set.h 162 * <a href="tables.html#xx">unordered associative container</a>
211 * <a href="tables.html#xx">unordered associative container</a>
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/
unordered_set.h 162 * <a href="tables.html#xx">unordered associative container</a>
211 * <a href="tables.html#xx">unordered associative container</a>

Completed in 1453 milliseconds

1 2 3 45 6 7 8 91011>>