| /third_party/rust/rust/library/std/src/sys/sgx/waitqueue/unsafe_list/ |
| D | tests.rs | 42 let mut node1 = UnsafeListEntry::new(11); in push_remove_pop() localVariable
76 let mut node1 = UnsafeListEntry::new(1234); in complex_pushes_pops() localVariable
|
| /third_party/ltp/testcases/kernel/syscalls/migrate_pages/ |
| D | migrate_pages02.c | 136 static void test_migrate_current_process(int node1, int node2, int cap_sys_nice) in test_migrate_current_process()
194 static void test_migrate_other_process(int node1, int node2, int cap_sys_nice) in test_migrate_other_process()
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/backend/common/pass/ |
| D | eliminate_redundant_op.cc | 75 bool CastEliminateCondition(const CNodePtr &node1, const CNodePtr &node2) { in CastEliminateCondition()
84 bool TransDataOpEliminateCondition(const CNodePtr &node1, const CNodePtr &node2) { in TransDataOpEliminateCondition()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 173 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint() local
260 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint() local
|
| /third_party/rust/crates/cxx/tests/ui/ |
| D | struct_cycle.rs | 17 node1: Node1, field
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/utils/ |
| D | convert_utils.cc | 117 bool SameValueNode(const AnfNodePtr &node1, const AnfNodePtr &node2) { in SameValueNode()
128 bool SameNodeShallow(const AnfNodePtr &node1, const AnfNodePtr &node2, FuncGraphPairMapEquiv *equiv… in SameNodeShallow()
163 bool SameNode(const AnfNodePtr &node1, const AnfNodePtr &node2, FuncGraphPairMapEquiv *equiv_func_g… in SameNode()
187 AnfNodePtr node1 = todo.top().first; in SameSubgraph() local
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/plugin/device/ascend/optimizer/ir_fission/ |
| D | lamb_fission.cc | 64 …Ptr CreateNodeOfBinaryOp(const FuncGraphPtr &graph, const string &op_name, const AnfNodePtr &node1, in CreateNodeOfBinaryOp()
70 …pdateStateNode(const FuncGraphPtr &graph, const bool is_need_update_state, const AnfNodePtr &node1, in CreateUpdateStateNode()
|
| D | scale_grad_fission.cc | 34 …Ptr CreateNodeOfBinaryOp(const FuncGraphPtr &graph, const string &op_name, const AnfNodePtr &node1, in CreateNodeOfBinaryOp()
|
| D | adam_weight_decay_fission.cc | 43 …Ptr CreateNodeOfBinaryOp(const FuncGraphPtr &graph, const string &op_name, const AnfNodePtr &node1, in CreateNodeOfBinaryOp()
|
| D | dynamic_gru_v2_grad_fission.cc | 409 …r DynamicGRUV2GradFission::CreateDwxBatchMatMul(const FuncGraphPtr &graph, const AnfNodePtr &node1, in CreateDwxBatchMatMul()
|
| /third_party/openhitls/crypto/slh_dsa/src/ |
| D | slh_dsa_xmss.c | 120 uint8_t node1[SLH_DSA_MAX_N] = {0}; in XmssPkFromSig() local
|
| D | slh_dsa_fors.c | 96 uint8_t node1[SLH_DSA_MAX_N] = {0}; in ForsPkFromSig() local
|
| /third_party/PyYAML/tests/legacy_tests/ |
| D | test_structure.py | 110 def _compare_nodes(node1, node2): argument
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/plugin/device/ascend/optimizer/ge/ |
| D | lamb_fission.cc | 64 …Ptr CreateNodeOfBinaryOp(const FuncGraphPtr &graph, const string &op_name, const AnfNodePtr &node1, in CreateNodeOfBinaryOp()
70 …pdateStateNode(const FuncGraphPtr &graph, const bool is_need_update_state, const AnfNodePtr &node1, in CreateUpdateStateNode()
|
| /third_party/ltp/testcases/kernel/syscalls/move_pages/ |
| D | move_pages12.c | 99 static unsigned int node1, node2; variable
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/plugin/device/gpu/optimizer/trt_pass/ |
| D | graph_partitioner.cc | 255 …std::sort(segment.second.begin(), segment.second.end(), [this](const AnfNodePtr &node1, const AnfN… in CollectSegments()
|
| /third_party/mindspore/mindspore-src/source/tests/ut/cpp/parallel/ |
| D | step_parallel_test.cc | 158 CNodePtr node1 = func_graph->NewCNode(inputs); in Make_Manager() local
566 CNodePtr node1 = func_graph->NewCNode(inputs); in TEST_F() local
604 CNodePtr node1 = func_graph->NewCNode(inputs); in TEST_F() local
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/frontend/parallel/graph_util/ |
| D | fold_pipeline_split_utils.cc | 83 bool CompFuncBySegAscending(const AnfNodePtr &node1, const AnfNodePtr &node2) { in CompFuncBySegAscending()
102 bool CompFuncBySegDescending(const AnfNodePtr &node1, const AnfNodePtr &node2) { in CompFuncBySegDescending()
|
| /third_party/openhitls/pki/x509_common/src/ |
| D | hitls_x509_ctrl.c | 232 const NameNodePack *node1 = *(const NameNodePack **)(uintptr_t)pDnName1; in CmpDnNameByEncode() local
|
| /third_party/ninja/src/ |
| D | deps_log_test.cc | 77 Node* node1 = log1.nodes()[i]; in TEST_F() local
|
| /third_party/openhitls/testcode/sdv/testcase/bsl/list/ |
| D | test_suite_sdv_list.c | 154 LIST_NODE *node1 = (LIST_NODE *)BSL_SAL_Malloc(sizeof(LIST_NODE)); in SDV_BSL_LIST_FUNC_TC001() local
|
| /third_party/mindspore/mindspore-src/source/mindspore/core/utils/ |
| D | anf_utils.cc | 492 bool AnfUtils::IsCutomActorNodeSame(const AnfNodePtr &node1, const AnfNodePtr &node2) { in IsCutomActorNodeSame()
|
| /third_party/glslang/glslang/MachineIndependent/ |
| D | Intermediate.cpp | 880 TIntermediate::addPairConversion(TOperator op, TIntermTyped* node0, TIntermTyped* node1) in addPairConversion()
3972 bool TIntermediate::specConstantPropagates(const TIntermTyped& node1, const TIntermTyped& node2) in specConstantPropagates()
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/frontend/parallel/pass/ |
| D | overlap_recompute_and_grad_model_parallel.cc | 190 auto comp_func = [&topos](const auto &node1, const auto &node2) { in FindNodeLastInput()
|
| /third_party/ffmpeg/libavcodec/ |
| D | qdmc.c | 487 static void lin_calc(QDMCContext *s, float amplitude, int node1, int node2, int index) in lin_calc()
|