/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | NodeSearch.h | 6 // NodeSearch.h: Utilities for searching translator node graphs 27 static bool search(TIntermNode *node) argument 30 node->traverse(&searchTraverser); 41 virtual bool visitBranch(Visit visit, TIntermBranch *node) argument 43 switch (node->getFlowOp()) 59 virtual bool visitBinary(Visit visit, TIntermBinary *node) argument 61 switch (node->getOp()) 65 if (node->getRight()->hasSideEffects())
|
H A D | OutputGLSL.cpp | 24 void TOutputGLSL::visitSymbol(TIntermSymbol* node) argument 28 if (node->getSymbol() == "gl_FragDepthEXT") 34 TOutputGLSLBase::visitSymbol(node);
|
H A D | RegenerateStructNames.cpp | 72 TIntermNode *node = sequence[ii]; local 73 ASSERT(node != NULL); 74 node->traverse(this);
|
H A D | UnfoldShortCircuit.cpp | 24 void UnfoldShortCircuit::traverse(TIntermNode *node) argument 27 node->traverse(this); 31 bool UnfoldShortCircuit::visitBinary(Visit visit, TIntermBinary *node) argument 35 // If our right node doesn't have side effects, we know we don't need to unfold this 37 // (note: unfolding doesn't depend on the left node -- it will always be evaluated) 38 if (!node->getRight()->hasSideEffects()) 43 switch (node->getOp()) 56 node->getLeft()->traverse(this); 59 node->getLeft()->traverse(mOutputHLSL); 64 node 112 visitSelection(Visit visit, TIntermSelection *node) argument 157 visitLoop(Visit visit, TIntermLoop *node) argument [all...] |
H A D | UnfoldShortCircuitAST.cpp | 36 bool UnfoldShortCircuitAST::visitBinary(Visit visit, TIntermBinary *node) argument 40 switch (node->getOp()) 43 replacement = UnfoldOR(node->getLeft(), node->getRight()); 46 replacement = UnfoldAND(node->getLeft(), node->getRight()); 54 NodeUpdateEntry(getParentNode(), node, replacement)); 70 // After we replace a node, if an immediate child is to 72 // node; instead, we update the replacement node [all...] |
H A D | VersionGLSL.cpp | 43 void TVersionGLSL::visitSymbol(TIntermSymbol *node) argument 45 if (node->getSymbol() == "gl_PointCoord") 49 bool TVersionGLSL::visitAggregate(Visit, TIntermAggregate *node) argument 53 switch (node->getOp()) 61 const TIntermSequence &sequence = *(node->getSequence()); 75 const TIntermSequence ¶ms = *(node->getSequence()); 98 const TIntermSequence &sequence = *(node->getSequence());
|
/external/chromium_org/third_party/boringssl/src/crypto/x509v3/ |
H A D | pcy_lib.c | 133 const ASN1_OBJECT *X509_policy_node_get0_policy(const X509_POLICY_NODE *node) argument 135 if (!node) 137 return node->data->valid_policy; 141 int X509_policy_node_get_critical(const X509_POLICY_NODE *node) 143 if (node_critical(node)) 150 X509_policy_node_get0_qualifiers(const X509_POLICY_NODE *node) 152 if (!node) 154 return node->data->qualifier_set; 158 X509_policy_node_get0_parent(const X509_POLICY_NODE *node) argument 160 if (!node) [all...] |
/external/chromium_org/third_party/libjingle/source/talk/xmpp/ |
H A D | discoitemsquerytask.cc | 37 const std::string& node) 38 : IqTask(parent, STR_GET, to, MakeRequest(node)) { 41 XmlElement* DiscoItemsQueryTask::MakeRequest(const std::string& node) { argument 43 if (!node.empty()) { 44 element->AddAttr(QN_NODE, node); 75 item->node = element->Attr(QN_NODE); 35 DiscoItemsQueryTask(XmppTaskParentInterface* parent, const Jid& to, const std::string& node) argument
|
H A D | jid.h | 38 // consists of three parts: the node, the domain and the resource, e.g.: 40 // node@domain/resource 42 // The node and resource are both optional. A valid jid is defined to have 54 const std::string & node() const { return node_name_; } function in class:buzz::Jid 79 static std::string PrepNode(const std::string& node, bool* valid);
|
H A D | pubsubclient.h | 51 // pubsub jid and node. All you have to do is RequestItems, listen 57 const std::string& node) 60 node_(node) {} 62 const std::string& node() const { return node_; } function in class:buzz::PubSubClient 55 PubSubClient(XmppTaskParentInterface* parent, const Jid& pubsubjid, const std::string& node) argument
|
/external/chromium_org/third_party/libxml/src/include/libxml/ |
H A D | debugXML.h | 41 xmlNodePtr node, 45 xmlNodePtr node, 49 xmlNodePtr node, 81 xmlLsOneNode (FILE *output, xmlNodePtr node); 83 xmlLsCountNode (xmlNodePtr node); 116 xmlNodePtr node; member in struct:_xmlShellCtxt 127 * @node: a first node 128 * @node2: a second node 136 xmlNodePtr node, [all...] |
/external/chromium_org/third_party/skia/include/xml/ |
H A D | SkDOM.h | 31 const Node* copy(const SkDOM& dom, const Node* node); 52 int countChildren(const Node* node, const char elem[] = NULL) const; 61 bool findScalar(const Node* node, const char name[], SkScalar value[]) const argument 63 return this->findScalars(node, name, value, 1); 81 SkDEBUGCODE(void dump(const Node* node = NULL, int tabLevel = 0) const;)
|
/external/chromium_org/third_party/skia/src/views/ |
H A D | SkParsePaint.cpp | 14 static SkShader* inflate_shader(const SkDOM& dom, const SkDOM::Node* node) argument 16 if ((node = dom.getFirstChild(node, "shader")) == NULL) 21 if (dom.hasAttr(node, "type", "linear-gradient")) 27 if ((str = dom.findAttr(node, "c0")) != NULL && 29 (str = dom.findAttr(node, "c1")) != NULL && 31 dom.findScalars(node, "p0", &pts[0].fX, 2) && 32 dom.findScalars(node, "p1", &pts[1].fX, 2)) 37 if ((index = dom.findList(node, "tile-mode", "clamp,repeat,mirror")) >= 0) 42 else if (dom.hasAttr(node, "typ 63 SkPaint_Inflate(SkPaint* paint, const SkDOM& dom, const SkDOM::Node* node) argument [all...] |
/external/chromium_org/tools/gn/ |
H A D | import_manager.cc | 20 const ParseNode* node = g_scheduler->input_file_manager()->SyncLoadFile( local 22 if (!node) 24 const BlockNode* block = node->AsBlock();
|
/external/chromium_org/tools/grit/grit/tool/ |
H A D | toolbar_postprocess.py | 14 import grit.node.empty namespace 15 from grit.node import misc 31 grdnode: the root node of the grd xml data generated by 35 The root node of the processed GRD tree. 41 identifiers = grit.node.empty.IdentifiersNode() 55 for node in messages.children[:]: 56 name_attr = node.attrs['name'] 98 previous_node = node 105 new_node = grit.node.empty.MessagesNode() 111 def AddIdentifiers(self, rctext, node) [all...] |
/external/chromium_org/ui/base/models/ |
H A D | tree_node_iterator.h | 16 // Iterator that iterates over the descendants of a node. The iteration does 17 // not include the node itself, only the descendants. The following illustrates 20 // Node* node = iterator.Next(); 21 // // do something with node. 30 // evaluated on each tree node and if it evaluates to true the node and all 32 TreeNodeIterator(NodeType* node, const PruneCallback& prune) argument 36 // Move forward through the children list until the first non prunable node. 38 // Position at the top of the _positions list must point to a node the 40 for (; index < node 48 TreeNodeIterator(NodeType* node) argument 92 Position(PositionNodeType* node, int index) argument 95 PositionNodeType* node; member in struct:ui::TreeNodeIterator::Position [all...] |
/external/chromium_org/v8/src/compiler/ |
H A D | generic-algorithm-inl.h | 12 #include "src/compiler/generic-node.h" 13 #include "src/compiler/generic-node-inl.h" 25 static Iterator begin(Node* node) { return node->inputs().begin(); } argument 26 static Iterator end(Node* node) { return node->inputs().end(); } argument 38 static Iterator begin(Node* node) { return node->uses().begin(); } argument 39 static Iterator end(Node* node) { return node argument [all...] |
H A D | node-aux-data-inl.h | 9 #include "src/compiler/node.h" 10 #include "src/compiler/node-aux-data.h" 22 void NodeAuxData<T>::Set(Node* node, const T& data) { argument 23 int id = node->id(); 32 T NodeAuxData<T>::Get(Node* node) { argument 33 int id = node->id();
|
H A D | schedule.cc | 5 #include "src/compiler/node.h" 6 #include "src/compiler/node-properties.h" 7 #include "src/compiler/node-properties-inl.h" 51 Node* node = *j; local 52 os << " " << *node; local 53 if (!NodeProperties::IsControl(node)) { 54 Bounds bounds = NodeProperties::GetBounds(node);
|
H A D | source-position.cc | 7 #include "src/compiler/node-aux-data-inl.h" 18 virtual void Decorate(Node* node) { argument 20 source_positions_->table_.Set(node, source_positions_->current_position_); 49 SourcePosition SourcePositionTable::GetSourcePosition(Node* node) { argument 50 return table_.Get(node);
|
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-node-cache.cc | 9 #include "src/compiler/node-cache.h" 40 Node* node = graph.NewNode(common.Int32Constant(k)); local 41 *cache.Find(graph.zone(), k) = nodes[i] = node;
|
/external/clang/test/CodeGenCXX/ |
H A D | constructor-template.cpp | 44 BinomialNode<int> *node = new BinomialNode<int>(1); local 45 delete node;
|
/external/clang/test/Modules/Inputs/ |
H A D | templates-top.h | 7 struct node {}; struct in class:List 8 node *head;
|
/external/clang/test/SemaTemplate/ |
H A D | overload-uneval.cpp | 22 static inline B *concrete(Foo *node) { argument 24 return reinterpret_cast<B *>(node);
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepot.h | 26 explicit StackDepotHandle(StackDepotNode *node) : node_(node) {} argument
|