Searched refs:NodeInfo (Results 1 - 25 of 27) sorted by relevance

12

/external/ImageMagick/MagickCore/
H A Dsplay-tree.c83 } NodeInfo;
87 NodeInfo
122 IterateOverSplayTree(SplayTreeInfo *,int (*)(NodeInfo *,const void *),
164 register NodeInfo
170 if (splay_tree->root != (NodeInfo *) NULL)
193 node=(NodeInfo *) AcquireMagickMemory(sizeof(*node));
194 if (node == (NodeInfo *) NULL)
201 if (splay_tree->root == (NodeInfo *) NULL)
203 node->left=(NodeInfo *) NULL;
204 node->right=(NodeInfo *) NUL
80 } NodeInfo; typedef in typeref:struct:_NodeInfo
[all...]
H A Dhistogram.c89 } NodeInfo;
93 NodeInfo
102 NodeInfo
115 NodeInfo
129 static NodeInfo
133 DestroyColorCube(const Image *,NodeInfo *);
198 NodeInfo
249 if (node_info->child[id] == (NodeInfo *) NULL)
252 if (node_info->child[id] == (NodeInfo *) NULL)
326 % DefineImageHistogram(const Image *image,NodeInfo *node_inf
86 } NodeInfo; typedef in typeref:struct:_NodeInfo
[all...]
H A Dquantize.c251 } NodeInfo;
255 NodeInfo
264 NodeInfo
290 NodeInfo
335 static NodeInfo
336 *GetNodeInfo(CubeInfo *,const size_t,const size_t,NodeInfo *);
345 DefineImageColormap(Image *,CubeInfo *,NodeInfo *);
348 ClosestColor(const Image *,CubeInfo *,const NodeInfo *),
350 PruneLevel(CubeInfo *,const NodeInfo *),
351 PruneToCubeDepth(CubeInfo *,const NodeInfo *),
248 } NodeInfo; typedef in typeref:struct:_NodeInfo
[all...]
/external/tensorflow/tensorflow/core/grappler/optimizers/
H A Dgraph_rewriter.h80 struct NodeInfo { struct in class:tensorflow::grappler::GraphRewriter
84 // These are filled in when the NodeInfo is built, but not that they
89 std::unordered_map<string, std::unique_ptr<NodeInfo>> nodes_;
H A Dgraph_rewriter.cc34 NodeInfo* info = new NodeInfo();
140 NodeInfo* fanin_info = itr->second.get();
/external/v8/src/compiler/
H A Dloop-analysis.cc22 struct NodeInfo { struct in namespace:v8::internal::compiler
24 NodeInfo* next; // link in chaining loop members
31 NodeInfo* header_list;
32 NodeInfo* exit_list;
33 NodeInfo* body_list;
76 for (NodeInfo& ni : info_) {
111 ZoneVector<NodeInfo> info_;
245 info(node); // create the NodeInfo
340 NodeInfo& info(Node* node) {
341 NodeInfo
[all...]
H A Dsimplified-lowering.cc244 class NodeInfo final {
324 NodeInfo* input_info = GetInfo(input);
338 NodeInfo* info = GetInfo(node);
360 NodeInfo* info = GetInfo(node);
381 for (NodeInfo& info : info_) {
413 NodeInfo* info = GetInfo(node);
566 NodeInfo* info = GetInfo(node);
586 NodeInfo* info = GetInfo(node);
610 NodeInfo* info = GetInfo(node);
623 NodeInfo* inf
[all...]
/external/tensorflow/tensorflow/core/kernels/hexagon/
H A Dhexagon_control_wrapper.h70 static GraphTransferInfo::NodeInfo* FindNodeInfo(
H A Dhexagon_control_wrapper.cc57 /* static */ GraphTransferInfo::NodeInfo* HexagonControlWrapper::FindNodeInfo(
59 for (GraphTransferInfo::NodeInfo& node_info :
143 GraphTransferInfo::NodeInfo* node_info =
157 GraphTransferInfo::NodeInfo& new_output_node_info =
172 const GraphTransferInfo::NodeInfo* node_info =
270 for (const GraphTransferInfo::NodeInfo& params :
H A Dgraph_transferer.h99 bool operator()(const GraphTransferInfo::NodeInfo& obj0,
100 const GraphTransferInfo::NodeInfo& obj1);
H A Dgraph_transferer_test.cc205 static const GraphTransferInfo::NodeInfo* FindNodeInfo(
207 for (const GraphTransferInfo::NodeInfo& params :
239 for (const GraphTransferInfo::NodeInfo& params :
331 const GraphTransferInfo::NodeInfo* params_conv = FindNodeInfo(gt_, "conv");
357 const GraphTransferInfo::NodeInfo* params_max_pool =
H A Dgraph_transferer.cc243 for (const GraphTransferInfo::NodeInfo& params :
852 GraphTransferInfo::NodeInfo& node_info =
1033 const GraphTransferInfo::NodeInfo& obj0,
1034 const GraphTransferInfo::NodeInfo& obj1) {
1134 for (const GraphTransferInfo::NodeInfo& params :
1186 for (const GraphTransferInfo::NodeInfo& params :
H A Dhexagon_graph_execution_test.cc328 const GraphTransferInfo::NodeInfo& ni0 = gfi0.node_info(i);
329 const GraphTransferInfo::NodeInfo& ni1 = gfi1.node_info(i);
/external/llvm/lib/Analysis/
H A DCFLGraph.h47 struct NodeInfo { struct in class:llvm::cflaa::CFLGraph
53 std::vector<NodeInfo> Levels;
64 NodeInfo &getNodeInfoAtLevel(unsigned Level) {
68 const NodeInfo &getNodeInfoAtLevel(unsigned Level) const {
80 const NodeInfo *getNode(Node N) const {
86 NodeInfo *getNode(Node N) {
/external/python/cpython2/Tools/compiler/
H A Dastgen.py41 class NodeInfo: class in inherits:
214 classes[name] = NodeInfo(name, args)
/external/v8/src/regexp/
H A Djsregexp.h315 struct NodeInfo { struct in namespace:v8::internal
316 NodeInfo() function in struct:v8::internal::NodeInfo
328 bool Matches(NodeInfo* that) {
337 void AddFromPreceding(NodeInfo* that) {
352 void AddFromFollowing(NodeInfo* that) {
526 NodeInfo* info() { return &info_; }
548 NodeInfo info_;
H A Djsregexp.cc2757 explicit VisitMarker(NodeInfo* info) : info_(info) {
2765 NodeInfo* info_;
4572 NodeInfo* info = that->info();
5625 NodeInfo info;
6338 NodeInfo* info = that->info();
6351 NodeInfo* info = that->info();
/external/tensorflow/tensorflow/core/graph/
H A Dgraph_constructor.cc256 struct NodeInfo { struct in class:tensorflow::__anon26296::GraphConstructor
257 explicit NodeInfo(int i) : gdef_index(i), node(nullptr) {} function in struct:tensorflow::__anon26296::GraphConstructor::NodeInfo
259 NodeInfo() : NodeInfo(-1) {} function in struct:tensorflow::__anon26296::GraphConstructor::NodeInfo
265 std::unordered_map<StringPiece, NodeInfo, StringPieceHasher> gdef_nodes_;
421 .insert(std::make_pair(StringPiece(node_def.name()), NodeInfo(n)))
1181 // TODO(irving): Copy will go away once NodeInfo exists
/external/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.cpp962 const SDNodeInfo &NodeInfo,
964 unsigned NumResults = NodeInfo.getNumResults();
988 const SDNodeInfo &NodeInfo,
994 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NodeInfo, ResNo);
1015 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NodeInfo, OResNo);
1036 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N, NodeInfo,
1044 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NodeInfo,
1052 getOperandNum(x.SDTCisEltOfVec_Info.OtherOperandNum, N, NodeInfo,
1063 getOperandNum(x.SDTCisSubVecOfVec_Info.OtherOperandNum, N, NodeInfo,
1079 N, NodeInfo, OResN
961 getOperandNum(unsigned OpNo, TreePatternNode *N, const SDNodeInfo &NodeInfo, unsigned &ResNo) argument
987 ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo, TreePattern &TP) const argument
2023 const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(getOperator()); local
3677 const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(N->getOperator()); local
[all...]
H A DCodeGenDAGPatterns.h216 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
/external/swiftshader/third_party/LLVM/utils/TableGen/
H A DCodeGenDAGPatterns.cpp810 const SDNodeInfo &NodeInfo,
812 unsigned NumResults = NodeInfo.getNumResults();
836 const SDNodeInfo &NodeInfo,
839 TreePatternNode *NodeToApply = getOperandNum(OperandNo, N, NodeInfo, ResNo);
861 getOperandNum(x.SDTCisSameAs_Info.OtherOperandNum, N, NodeInfo, OResNo);
880 getOperandNum(x.SDTCisVTSmallerThanOp_Info.OtherOperandNum, N, NodeInfo,
888 getOperandNum(x.SDTCisOpSmallerThanOp_Info.BigOperandNum, N, NodeInfo,
896 getOperandNum(x.SDTCisEltOfVec_Info.OtherOperandNum, N, NodeInfo,
907 getOperandNum(x.SDTCisSubVecOfVec_Info.OtherOperandNum, N, NodeInfo,
1682 const SDNodeInfo &NodeInfo local
809 getOperandNum(unsigned OpNo, TreePatternNode *N, const SDNodeInfo &NodeInfo, unsigned &ResNo) argument
835 ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo, TreePattern &TP) const argument
3120 const SDNodeInfo &NodeInfo = CDP.getSDNodeInfo(N->getOperator()); local
[all...]
H A DCodeGenDAGPatterns.h191 bool ApplyTypeConstraint(TreePatternNode *N, const SDNodeInfo &NodeInfo,
/external/tensorflow/tensorflow/core/framework/
H A Dfunction.cc344 NodeInfo& node_info = nodes_[i];
433 struct NodeInfo { struct in class:tensorflow::__anon26240::FunctionInstantiationHelper
441 std::vector<NodeInfo> nodes_;
/external/llvm/lib/CodeGen/MIRParser/
H A DMIParser.cpp1264 auto NodeInfo = PFS.IRSlots.MetadataNodes.find(ID);
1265 if (NodeInfo == PFS.IRSlots.MetadataNodes.end())
1268 Node = NodeInfo->second.get();
/external/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp210 struct NodeInfo { struct in class:__anon13933::SwingSchedulerDAG
213 NodeInfo() : ASAP(0), ALAP(0) {} function in struct:__anon13933::SwingSchedulerDAG::NodeInfo
216 std::vector<NodeInfo> ScheduleInfo;

Completed in 2085 milliseconds

12