| /external/ImageMagick/MagickCore/ |
| D | splay-tree.c | 80 } NodeInfo; typedef
84 NodeInfo
118 IterateOverSplayTree(SplayTreeInfo *,int (*)(NodeInfo *,const void *),
159 register NodeInfo in AddValueToSplayTree()
165 if (splay_tree->root != (NodeInfo *) NULL) in AddValueToSplayTree()
188 node=(NodeInfo *) AcquireMagickMemory(sizeof(*node)); in AddValueToSplayTree()
189 if (node == (NodeInfo *) NULL) in AddValueToSplayTree()
196 if (splay_tree->root == (NodeInfo *) NULL) in AddValueToSplayTree()
198 node->left=(NodeInfo *) NULL; in AddValueToSplayTree()
199 node->right=(NodeInfo *) NULL; in AddValueToSplayTree()
[all …]
|
| D | histogram.c | 86 } NodeInfo; typedef
90 NodeInfo
99 NodeInfo
112 NodeInfo
125 static NodeInfo
129 DestroyColorCube(const Image *,NodeInfo *);
193 NodeInfo in ClassifyImageColors()
244 if (node_info->child[id] == (NodeInfo *) NULL) in ClassifyImageColors()
247 if (node_info->child[id] == (NodeInfo *) NULL) in ClassifyImageColors()
333 static void DefineImageHistogram(const Image *image,NodeInfo *node_info, in DefineImageHistogram()
[all …]
|
| D | quantize.c | 248 } NodeInfo; typedef
252 NodeInfo
261 NodeInfo
287 NodeInfo
331 static NodeInfo
332 *GetNodeInfo(CubeInfo *,const size_t,const size_t,NodeInfo *);
341 DefineImageColormap(Image *,CubeInfo *,NodeInfo *);
344 ClosestColor(const Image *,CubeInfo *,const NodeInfo *),
346 PruneLevel(CubeInfo *,const NodeInfo *),
347 PruneToCubeDepth(CubeInfo *,const NodeInfo *),
[all …]
|
| /external/v8/src/compiler/ |
| D | loop-analysis.cc | 22 struct NodeInfo { struct
24 NodeInfo* next; // link in chaining loop members argument
31 NodeInfo* header_list;
32 NodeInfo* exit_list;
33 NodeInfo* body_list;
76 for (NodeInfo& ni : info_) { in Print()
111 ZoneVector<NodeInfo> info_;
340 NodeInfo& info(Node* node) { in info()
341 NodeInfo& i = info_[node->id()]; in info()
353 void AddNodeToLoop(NodeInfo* node_info, LoopInfo* loop, int loop_num) { in AddNodeToLoop()
[all …]
|
| D | simplified-lowering.cc | 244 class NodeInfo final { class in v8::internal::compiler::RepresentationSelector
324 NodeInfo* input_info = GetInfo(input); in RunTypePropagationPhase()
338 NodeInfo* info = GetInfo(node); in RunTypePropagationPhase()
360 NodeInfo* info = GetInfo(node); in RunTypePropagationPhase()
381 for (NodeInfo& info : info_) { in ResetNodeInfoState()
413 NodeInfo* info = GetInfo(node); in UpdateFeedbackType()
566 NodeInfo* info = GetInfo(node); in RunTruncationPropagationPhase()
586 NodeInfo* info = GetInfo(node); in Run()
610 NodeInfo* info = GetInfo(node); in EnqueueInitial()
623 NodeInfo* info = GetInfo(node); in EnqueueInput()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | CFLGraph.h | 47 struct NodeInfo { struct
53 std::vector<NodeInfo> Levels; argument
64 NodeInfo &getNodeInfoAtLevel(unsigned Level) { in getNodeInfoAtLevel()
68 const NodeInfo &getNodeInfoAtLevel(unsigned Level) const { in getNodeInfoAtLevel()
80 const NodeInfo *getNode(Node N) const { in getNode()
86 NodeInfo *getNode(Node N) { in getNode()
|
| /external/tensorflow/tensorflow/core/kernels/hexagon/ |
| D | hexagon_control_wrapper.cc | 57 /* static */ GraphTransferInfo::NodeInfo* HexagonControlWrapper::FindNodeInfo( in FindNodeInfo()
59 for (GraphTransferInfo::NodeInfo& node_info : in FindNodeInfo()
143 GraphTransferInfo::NodeInfo* node_info = in SetupGraph()
157 GraphTransferInfo::NodeInfo& new_output_node_info = in SetupGraph()
172 const GraphTransferInfo::NodeInfo* node_info = in SetupGraph()
270 for (const GraphTransferInfo::NodeInfo& params : in SetupGraph()
|
| D | graph_transferer_test.cc | 205 static const GraphTransferInfo::NodeInfo* FindNodeInfo( in FindNodeInfo()
207 for (const GraphTransferInfo::NodeInfo& params : in FindNodeInfo()
239 for (const GraphTransferInfo::NodeInfo& params : in SanityCheckNodes()
331 const GraphTransferInfo::NodeInfo* params_conv = FindNodeInfo(gt_, "conv"); in TEST_F()
357 const GraphTransferInfo::NodeInfo* params_max_pool = in TEST_F()
|
| D | graph_transferer.h | 99 bool operator()(const GraphTransferInfo::NodeInfo& obj0,
100 const GraphTransferInfo::NodeInfo& obj1);
|
| D | hexagon_control_wrapper.h | 70 static GraphTransferInfo::NodeInfo* FindNodeInfo(
|
| D | graph_transferer.cc | 243 for (const GraphTransferInfo::NodeInfo& params : in SortParams()
852 GraphTransferInfo::NodeInfo& node_info = in AppendNodeParams()
1033 const GraphTransferInfo::NodeInfo& obj0, in operator ()()
1034 const GraphTransferInfo::NodeInfo& obj1) { in operator ()()
1134 for (const GraphTransferInfo::NodeInfo& params : in DumpNodeTransferParams()
1186 for (const GraphTransferInfo::NodeInfo& params : in DumpVerificationStringOfNodeTransferParams()
|
| D | hexagon_graph_execution_test.cc | 328 const GraphTransferInfo::NodeInfo& ni0 = gfi0.node_info(i); in CompareGraphTransferInfo()
329 const GraphTransferInfo::NodeInfo& ni1 = gfi1.node_info(i); in CompareGraphTransferInfo()
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | graph_rewriter.h | 80 struct NodeInfo { struct
89 std::unordered_map<string, std::unique_ptr<NodeInfo>> nodes_; argument
|
| D | graph_rewriter.cc | 34 NodeInfo* info = new NodeInfo(); in GraphRewriter()
140 NodeInfo* fanin_info = itr->second.get(); in RecordConnectivity()
|
| /external/tensorflow/tensorflow/core/framework/ |
| D | graph_transfer_info.proto | 23 message NodeInfo { message
59 repeated NodeInfo node_info = 1;
|
| D | function.cc | 344 NodeInfo& node_info = nodes_[i]; in AddNodeInputs()
433 struct NodeInfo { struct in tensorflow::__anon8e6ea3240111::FunctionInstantiationHelper
441 std::vector<NodeInfo> nodes_;
|
| /external/v8/src/regexp/ |
| D | jsregexp.h | 315 struct NodeInfo { struct
316 NodeInfo() in NodeInfo() function
328 bool Matches(NodeInfo* that) { in Matches() argument
337 void AddFromPreceding(NodeInfo* that) { in AddFromPreceding() argument
352 void AddFromFollowing(NodeInfo* that) { in AddFromFollowing() argument
526 NodeInfo* info() { return &info_; } in info()
548 NodeInfo info_;
|
| D | jsregexp.cc | 2757 explicit VisitMarker(NodeInfo* info) : info_(info) { in VisitMarker()
2765 NodeInfo* info_;
4572 NodeInfo* info = that->info(); in PrintAttributes()
5625 NodeInfo info; in ToNode()
6338 NodeInfo* info = that->info(); in VisitChoice()
6351 NodeInfo* info = that->info(); in VisitLoopChoice()
|
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| D | CodeGenDAGPatterns.cpp | 810 const SDNodeInfo &NodeInfo, in getOperandNum() argument
812 unsigned NumResults = NodeInfo.getNumResults(); in getOperandNum()
836 const SDNodeInfo &NodeInfo, in ApplyTypeConstraint() argument
839 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NodeInfo, ResNo); in ApplyTypeConstraint()
861 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NodeInfo, OResNo); in ApplyTypeConstraint()
880 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N, NodeInfo, in ApplyTypeConstraint()
888 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NodeInfo, in ApplyTypeConstraint()
896 getOperandNum(x.SDTCisEltOfVec_Info.OtherOperandNum, N, NodeInfo, in ApplyTypeConstraint()
907 getOperandNum(x.SDTCisSubVecOfVec_Info.OtherOperandNum, N, NodeInfo, in ApplyTypeConstraint()
1682 const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(getOperator()); in canPatternMatch() local
[all …]
|
| D | CodeGenDAGPatterns.h | 191 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenDAGPatterns.cpp | 962 const SDNodeInfo &NodeInfo, in getOperandNum() argument
964 unsigned NumResults = NodeInfo.getNumResults(); in getOperandNum()
988 const SDNodeInfo &NodeInfo, in ApplyTypeConstraint() argument
994 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NodeInfo, ResNo); in ApplyTypeConstraint()
1015 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NodeInfo, OResNo); in ApplyTypeConstraint()
1036 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N, NodeInfo, in ApplyTypeConstraint()
1044 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NodeInfo, in ApplyTypeConstraint()
1052 getOperandNum(x.SDTCisEltOfVec_Info.OtherOperandNum, N, NodeInfo, in ApplyTypeConstraint()
1063 getOperandNum(x.SDTCisSubVecOfVec_Info.OtherOperandNum, N, NodeInfo, in ApplyTypeConstraint()
1079 N, NodeInfo, OResNo); in ApplyTypeConstraint()
[all …]
|
| D | CodeGenDAGPatterns.h | 216 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | graph_constructor.cc | 256 struct NodeInfo { struct in tensorflow::__anone86fd2d90111::GraphConstructor
257 explicit NodeInfo(int i) : gdef_index(i), node(nullptr) {} in NodeInfo() argument
259 NodeInfo() : NodeInfo(-1) {} in NodeInfo() argument
265 std::unordered_map<StringPiece, NodeInfo, StringPieceHasher> gdef_nodes_;
421 .insert(std::make_pair(StringPiece(node_def.name()), NodeInfo(n))) in BuildNodeIndex()
|
| /external/python/cpython2/Tools/compiler/ |
| D | astgen.py | 41 class NodeInfo: class
214 classes[name] = NodeInfo(name, args)
|
| /external/llvm/lib/CodeGen/MIRParser/ |
| D | MIParser.cpp | 1264 auto NodeInfo = PFS.IRSlots.MetadataNodes.find(ID); in parseMDNode() local
1265 if (NodeInfo == PFS.IRSlots.MetadataNodes.end()) in parseMDNode()
1268 Node = NodeInfo->second.get(); in parseMDNode()
|