| /dalvik/vm/mterp/x86/ |
| stub.S | 2 SAVE_PC_FP_TO_SELF %ecx # leaves rSELF in %ecx
|
| /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
| t051treeRewriteASTtWalker.g | 11 | INT // leaves it alone, returning $a.start
|
| /external/elfutils/ |
| README | 4 This leaves byte ordering aside. While assuming this the code can be
|
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| 8bit.sed | 10 # The yellow leaves are so thick.
15 # As the yellow leaves are falling.
|
| /external/chromium_org/chrome/browser/sync_file_system/ |
| conflict_resolution_policy.h | 18 // The service does nothing and just leaves conflicting files in
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| ir_expression_flattening.h | 28 * Takes the leaves of expression trees and makes them dereferences of
29 * assignments of the leaves to temporaries, according to a predicate.
|
| ir_expression_flattening.cpp | 27 * Takes the leaves of expression trees and makes them dereferences of
28 * assignments of the leaves to temporaries, according to a predicate.
|
| linker.h | 55 * Leaves are, roughly speaking, the parts of the uniform that the application
60 * This class only provides the mechanism to iterate over the leaves. Derived
|
| /external/chromium_org/v8/test/mjsunit/compiler/ |
| expression-trees.js | 31 // strings, return an array of all binary tree strings with the leaves
33 function makeTrees(op, leaves) {
34 var len = leaves.length;
37 return leaves;
41 // Split the leaves into left and right subtrees in all possible
44 var leftTrees = makeTrees(op, leaves.slice(0, i));
45 var rightTrees = makeTrees(op, leaves.slice(i, len));
58 // All possible bitwise OR trees with six leaves, i.e. CatalanNumber[5] = 42,
|
| /external/mesa3d/src/glsl/ |
| ir_expression_flattening.h | 28 * Takes the leaves of expression trees and makes them dereferences of
29 * assignments of the leaves to temporaries, according to a predicate.
|
| ir_expression_flattening.cpp | 27 * Takes the leaves of expression trees and makes them dereferences of
28 * assignments of the leaves to temporaries, according to a predicate.
|
| linker.h | 55 * Leaves are, roughly speaking, the parts of the uniform that the application
60 * This class only provides the mechanism to iterate over the leaves. Derived
|
| /external/v8/test/mjsunit/compiler/ |
| expression-trees.js | 31 // strings, return an array of all binary tree strings with the leaves
33 function makeTrees(op, leaves) {
34 var len = leaves.length;
37 return leaves;
41 // Split the leaves into left and right subtrees in all possible
44 var leftTrees = makeTrees(op, leaves.slice(0, i));
45 var rightTrees = makeTrees(op, leaves.slice(i, len));
58 // All 429 possible bitwise OR trees with eight leaves.
|
| /external/chromium/net/disk_cache/ |
| cache_util.h | 19 // this moves the cache contents, and leaves the empty cache
|
| /external/chromium_org/base/android/java/src/org/chromium/base/ |
| ImportantFileWriterAndroid.java | 17 * This either writes all the data or leaves the file unchanged.
|
| /external/chromium_org/third_party/WebKit/ManualTests/ |
| drag_select_highlighting.html | 3 <title>Highlight leaves trails</title>
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Events/ |
| EventsDispatching.html | 28 // This makes a tree of depth 50 with 500 leaves.
|
| /external/chromium_org/ui/views/win/ |
| scoped_fullscreen_visibility.h | 17 // Scoping class that ensures a HWND remains hidden while it enters or leaves
|
| /external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.fct.default/ |
| p6.cpp | 31 // DR217 + DR205 (reading tea leaves)
|
| /external/llvm/test/CodeGen/ARM/ |
| peephole-bitcast.ll | 8 ; Peephole leaves a dead vmovsr instruction behind, and depends on linear scan
|
| /external/srtp/crypto/include/ |
| crypto.h | 19 * NULL_CIPHER is avaliable; this cipher leaves the data unchanged,
|
| /external/chromium_org/net/http/ |
| http_security_headers.h | 23 // Otherwise returns false and leaves the output parameters unchanged.
35 // values. Otherwise returns false and leaves the output parameters
|
| /external/junit/src/org/junit/experimental/max/ |
| MaxCore.java | 97 List<Description> leaves= findLeaves(request);
98 Collections.sort(leaves, fHistory.testComparator());
99 return constructLeafRequest(leaves);
102 private Request constructLeafRequest(List<Description> leaves) {
104 for (Description each : leaves)
|
| /external/chromium_org/v8/test/mjsunit/ |
| debug-constructor.js | 67 Debug.clearStepping(); // Clear stepping as the listener leaves it on.
74 Debug.clearStepping(); // Clear stepping as the listener leaves it on.
|
| /external/v8/test/mjsunit/ |
| debug-constructor.js | 67 Debug.clearStepping(); // Clear stepping as the listener leaves it on.
74 Debug.clearStepping(); // Clear stepping as the listener leaves it on.
|
