/external/pigweed/pw_assert/ |
D | light_test.cc | 22 int evaluated = 1; in TEST() local 23 PW_ASSERT(++evaluated); in TEST() 24 EXPECT_EQ(evaluated, 2); in TEST() 29 int evaluated = 1; in TEST() local 30 PW_DASSERT(++evaluated); in TEST() 32 EXPECT_EQ(evaluated, 2); in TEST() 34 EXPECT_EQ(evaluated, 1); in TEST()
|
/external/tensorflow/tensorflow/core/common_runtime/ |
D | shape_refiner.cc | 395 const Node* node, int dst_idx, bool* evaluated, Tensor* result, in EvaluateConstantTensorForEdge() argument 397 *evaluated = false; in EvaluateConstantTensorForEdge() 402 tensor, *this, *ops_registry_, graph_def_version_, evaluated, result, in EvaluateConstantTensorForEdge() 408 const Node* node, int dst_idx, bool* evaluated, int64* result, in EvaluateConstantIntScalarEdge() argument 411 TF_RETURN_IF_ERROR(EvaluateConstantTensorForEdge(node, dst_idx, evaluated, in EvaluateConstantIntScalarEdge() 413 if (*evaluated) { in EvaluateConstantIntScalarEdge() 445 bool evaluated = false; in ConstantPartialShape() local 446 TF_RETURN_IF_ERROR(EvaluateConstantTensorForEdge(node, dst_idx, &evaluated, in ConstantPartialShape() 448 if (!evaluated) { in ConstantPartialShape() 479 bool evaluated = false; in ConstantPartialShape() local [all …]
|
D | eval_const_tensor.cc | 350 int32 graph_def_version, bool* evaluated, in EvaluateConstantTensor() argument 356 *evaluated = false; in EvaluateConstantTensor() 362 *evaluated = true; in EvaluateConstantTensor() 375 *evaluated = true; in EvaluateConstantTensor() 421 *evaluated = true; in EvaluateConstantTensor()
|
D | eval_const_tensor.h | 61 const OpRegistryInterface& ops, int32 graph_def_version, bool* evaluated,
|
D | shape_refiner.h | 222 const Node* node, int dst_idx, bool* evaluated, Tensor* result, 235 const Node* node, int dst_idx, bool* evaluated, int64* result,
|
/external/proguard/src/proguard/classfile/attribute/visitor/ |
D | StackSizeComputer.java | 51 private boolean[] evaluated = new boolean[ClassConstants.TYPICAL_CODE_LENGTH]; field in StackSizeComputer 66 return evaluated[instructionOffset]; in isReachable() 76 if (!evaluated[instructionOffset]) in getStackSize() 138 if (evaluated.length < codeLength) in visitCodeAttribute0() 140 evaluated = new boolean[codeLength]; in visitCodeAttribute0() 145 Arrays.fill(evaluated, 0, codeLength, false); in visitCodeAttribute0() 289 if (evaluated[instructionOffset]) in evaluateInstructionBlock() 309 while (!evaluated[instructionOffset]) in evaluateInstructionBlock() 312 evaluated[instructionOffset] = true; in evaluateInstructionBlock() 368 if (evaluated[instructionOffset]) in evaluateInstructionBlock()
|
/external/rust/crates/paste/src/ |
D | segment.rs | 142 let mut evaluated = Vec::new(); in paste() localVariable 148 evaluated.push(segment.value.clone()); in paste() 167 evaluated.push(resolved); in paste() 170 let last = match evaluated.pop() { in paste() 178 evaluated.push(last.to_lowercase()); in paste() 181 evaluated.push(last.to_uppercase()); in paste() 193 evaluated.push(acc.to_lowercase()); in paste() 214 evaluated.push(acc); in paste() 228 let mut pasted = evaluated.into_iter().collect::<String>(); in paste()
|
/external/llvm-project/llvm/test/MC/ARM/ |
D | error-location-post-layout.s | 4 @ CHECK: 3:12: error: expression could not be evaluated 11 @ CHECK-DAG: 10:13: error: symbol 'undef' could not be evaluated in a subtraction expression 14 @ CHECK-DAG: 13:24: error: expression could not be evaluated
|
/external/llvm-project/mlir/tools/mlir-reduce/ |
D | ReductionNode.cpp | 23 : module(module), evaluated(false) { in ReductionNode() 31 : module(module), evaluated(false), transformSpace(transformSpace) { in ReductionNode() 58 evaluated = true; in measureAndTest() 62 bool ReductionNode::isEvaluated() const { return evaluated; } in isEvaluated()
|
/external/libabigail/autoconf-archive/ |
D | ax_check_python_modules.m4 | 29 # evaluated. Otherwise the shell variable HAVE_PYMOD_MODNAME is set 30 # to 'no' and ACTION-IF-NOT-FOUND is evaluated. 83 # of the test stops and ACTION-IF-NOT-FOUND is evaluated. 84 # Otherwise, if all modules are found, ACTION-IF-FOUND is evaluated.
|
/external/one-true-awk/testdir/ |
D | T.builtin | 46 print "BAD: T.builtin (printf arg list not evaluated)" 52 print "BAD: T.builtin (substr arg list not evaluated)" 58 print "BAD: T.builtin (sub() arg list not evaluated)" 64 print "BAD: T.builtin (excess length args not evaluated)"
|
/external/llvm-project/clang-tools-extra/docs/clang-tidy/checks/ |
D | bugprone-macro-parentheses.rst | 10 unexpected behaviour; operators may be evaluated in unexpected order and 14 it with parentheses. This ensures that the macro result is evaluated
|
D | misc-static-assert.rst | 11 The condition of ``static_assert()`` is evaluated at compile time which is
|
/external/llvm/test/Transforms/IndVarSimplify/ |
D | const_phi.ll | 20 ; %phi0.pre and %phi1.pre are evaluated by SCEV to constant 0. 26 ; %phi0 and %phi1 are evaluated by SCEV to constant 0.
|
/external/llvm-project/llvm/test/Transforms/IndVarSimplify/ |
D | const_phi.ll | 20 ; %phi0.pre and %phi1.pre are evaluated by SCEV to constant 0. 26 ; %phi0 and %phi1 are evaluated by SCEV to constant 0.
|
/external/eigen/doc/ |
D | HiPerformance.dox | 34 negation and conjugation. Transpose and Block expressions are not evaluated and they only modify th… 35 and shape. All other expressions are immediately evaluated. 61 Otherwise the product m2 * m3 is evaluated into a temporary.</td> 71 Without this optimization, the matrix product would be evaluated into a 94 and so the matrix product will be immediately evaluated.</td> 106 m2*m3 will be evaluated anyway. However, note how this expression can be rewritten
|
D | TopicLazyEvaluation.dox | 21 …evaluated as late as possible, instead of immediately. However, most other expression-templates-ba… 55 the product <tt>matrix3 * matrix4</tt> gets evaluated immediately into a temporary matrix. Indeed, … 57 …that the total cost of an operation is reduced if a sub-expression gets evaluated into a temporary…
|
/external/llvm/test/MC/ARM/ |
D | error-location.s | 19 @ CHECK: <unknown>:0: error: expression could not be evaluated 26 @ CHECK: <unknown>:0: error: symbol 'undef' could not be evaluated in a subtraction expression
|
/external/hamcrest/hamcrest-library/src/main/java/org/hamcrest/xml/ |
D | HasXPath.java | 61 return evaluated(item, mismatch) in matchesSafely() 74 private Condition<Object> evaluated(Node item, Description mismatch) { in evaluated() method in HasXPath
|
/external/llvm/test/MC/ELF/ |
D | subtraction-error.s | 8 ; CHECK: symbol 'a' could not be evaluated in a subtraction expression
|
/external/llvm-project/llvm/test/MC/ELF/ |
D | subtraction-error.s | 8 ; CHECK: symbol 'a' could not be evaluated in a subtraction expression
|
/external/rust/crates/lazy_static/ |
D | METADATA | 2 description: "A macro for declaring lazily evaluated statics in Rust."
|
/external/llvm-project/clang/docs/ |
D | RefactoringEngine.rst | 152 describes how these requirements are evaluated and lists all the possible 162 ``createRefactoringActionRule``, that value is evaluated during the initiation 163 of the action rule. The evaluated result is then passed to the rule's 166 will be evaluated using the following steps: 177 succeeded (all requirements were evaluated successfully). 219 it's evaluated. The next section talks more about refactoring options and
|
/external/llvm/test/Transforms/Reassociate/ |
D | absorption.ll | 4 ; evaluated as the absorbing value.
|
/external/llvm-project/mlir/include/mlir/Reducer/ |
D | ReductionNode.h | 87 bool evaluated; variable
|