Home
last modified time | relevance | path

Searched refs:insertions (Results 1 - 17 of 17) sorted by relevance

/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/d3d/
H A DRewriteExpressionsWithShaderStorageBlock.cpp127 TIntermSequence *insertions);
140 TIntermSequence *insertions) in insertInitStatementAndReturnTempSymbol()
146 insertions->push_back(variableDeclaration); in insertInitStatementAndReturnTempSymbol()
188 TIntermSequence insertions; in visitBinary() local
190 insertInitStatementAndReturnTempSymbol(node->getRight(), &insertions); in visitBinary()
194 insertInitStatementAndReturnTempSymbol(node->getLeft()->deepCopy(), &insertions); in visitBinary()
197 insertions.push_back(tempCompoundOperate); in visitBinary()
198 insertStatementsInParentBlock(insertions); in visitBinary()
206 insertStatementsInParentBlock(insertions); in visitBinary()
225 TIntermSequence insertions; in visitBinary() local
138 insertInitStatementAndReturnTempSymbol( TIntermTyped *node, TIntermSequence *insertions) insertInitStatementAndReturnTempSymbol() argument
285 TIntermSequence insertions; visitAggregate() local
365 TIntermSequence insertions; visitUnary() local
384 TIntermSequence insertions; visitUnary() local
[all...]
H A DUnfoldShortCircuitToIf.cpp77 TIntermSequence insertions; in visitBinary() local
82 insertions.push_back(CreateTempInitDeclarationNode(resultVariable, node->getLeft())); in visitBinary()
92 insertions.push_back(ifNode); in visitBinary()
94 insertStatementsInParentBlock(insertions); in visitBinary()
104 TIntermSequence insertions; in visitBinary() local
109 insertions.push_back(CreateTempInitDeclarationNode(resultVariable, node->getLeft())); in visitBinary()
118 insertions.push_back(ifNode); in visitBinary()
120 insertStatementsInParentBlock(insertions); in visitBinary()
145 TIntermSequence insertions; in visitTernary() local
149 insertions in visitTernary()
[all...]
H A DSeparateExpressionsReturningArrays.cpp71 TIntermSequence insertions; in visitBinary() local
72 insertions.push_back(CopyAssignmentNode(node)); in visitBinary()
79 insertions.push_back(arrayVariableDeclaration); in visitBinary()
80 insertStatementsInParentBlock(insertions); in visitBinary()
/third_party/libabigail/include/
H A Dabg-diff-utils.h17 /// script (the set of insertions and deletions) for transforming a
623 /// It encapsulates the insertions and deletions for transforming A
636 insertions() const in insertions() function in abigail::diff_utils::edit_script
640 insertions() in insertions() function in abigail::diff_utils::edit_script
654 insertions().insert(insertions().end(), in append()
655 es.insertions().begin(), in append()
656 es.insertions().end()); in append()
665 insertions().insert(insertions() in prepend()
[all...]
/third_party/skia/third_party/externals/tint/tools/src/cmd/gerrit-stats/
H A Dmain.go113 insertions, deletions := 0, 0
118 insertions += change.Insertions
123 fmt.Printf(" Submitted %v changes (LOC: %v+, %v-) \n", len(submitted), insertions, deletions)
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/
H A DSplitSequenceOperator.cpp108 TIntermSequence insertions; in visitBinary() local
109 insertions.push_back(node->getLeft()); in visitBinary()
110 insertStatementsInParentBlock(insertions); in visitBinary()
H A DRemoveDynamicIndexing.cpp319 TIntermSequence insertions; in insertHelperDefinitions() local
322 insertions.push_back( in insertHelperDefinitions()
327 insertions.push_back( in insertHelperDefinitions()
330 rootBlock->insertChildNodes(0, insertions); in insertHelperDefinitions()
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermTraverse.cpp263 void TIntermTraverser::insertStatementsInParentBlock(const TIntermSequence &insertions) in insertStatementsInParentBlock() argument
266 insertStatementsInParentBlock(insertions, emptyInsertionsAfter); in insertStatementsInParentBlock()
288 TIntermSequence insertions; in insertStatementInParentBlock() local
289 insertions.push_back(statement); in insertStatementInParentBlock()
290 insertStatementsInParentBlock(insertions); in insertStatementInParentBlock()
514 // Sort the insertions so that insertion position is increasing and same position insertions are in updateTree()
515 // not reordered. The insertions are processed in reverse order so that multiple insertions to in updateTree()
520 // If two insertions ar in updateTree()
[all...]
H A DIntermTraverse.h199 // Note that two insertions to the same position in the same block are not supported.
200 void insertStatementsInParentBlock(const TIntermSequence &insertions);
212 // two insertions to the same position in the same block are not supported.
/third_party/protobuf/src/google/protobuf/compiler/
H A Dmock_code_generator.cc101 const std::string& insertions, const std::string& file, in ExpectGenerated()
121 if (!insertions.empty()) { in ExpectGenerated()
122 SplitStringUsing(insertions, ",", &insertion_list); in ExpectGenerated()
99 ExpectGenerated( const std::string& name, const std::string& parameter, const std::string& insertions, const std::string& file, const std::string& first_message_name, const std::string& first_parsed_file_name, const std::string& output_directory) ExpectGenerated() argument
H A Dmock_code_generator.h83 // |insertions| is a comma-separated list of names of MockCodeGenerators which
89 const std::string& insertions,
H A Dcommand_line_interface_unittest.cc188 const std::string& insertions,
465 const std::string& insertions, const std::string& proto_name, in ExpectGeneratedWithInsertions()
467 MockCodeGenerator::ExpectGenerated(generator_name, parameter, insertions, in ExpectGeneratedWithInsertions()
1186 // Check that annotation spans are updated after insertions. in TEST_F()
463 ExpectGeneratedWithInsertions( const std::string& generator_name, const std::string& parameter, const std::string& insertions, const std::string& proto_name, const std::string& message_name) ExpectGeneratedWithInsertions() argument
/third_party/libabigail/src/
H A Dabg-comparison.cc3938 for (vector<insertion>::const_iterator it = e.insertions().begin(); in ensure_lookup_tables_populated()
3939 it != e.insertions().end(); in ensure_lookup_tables_populated()
4347 /// Get the number of member functions insertions carried by the current
4350 /// @return the number of member functions insertions carried by the
4476 for (vector<insertion>::const_iterator it = e.insertions().begin(); in ensure_lookup_tables_populated()
4477 it != e.insertions().end(); in ensure_lookup_tables_populated()
4525 for (vector<insertion>::const_iterator it = e.insertions().begin(); in ensure_lookup_tables_populated()
4526 it != e.insertions().end(); in ensure_lookup_tables_populated()
4788 for (vector<insertion>::const_iterator it = e.insertions().begin(); in ensure_lookup_tables_populated()
4789 it != e.insertions() in ensure_lookup_tables_populated()
[all...]
H A Dabg-default-reporter.cc148 //report deletions/insertions/change of enumerators in report()
934 // report insertions; in report()
1012 //report insertions in report()
1120 // report insertions in report()
1130 for (vector<insertion>::const_iterator i = e.insertions().begin(); in report()
1131 i != e.insertions().end(); in report()
1174 // report insertions in report()
1179 for (vector<insertion>::const_iterator i = e.insertions().begin(); in report()
1180 i != e.insertions().end(); in report()
1217 // report insertions in report()
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A DIntermNode.cpp554 const TIntermSequence &insertions) in insertChildNodes()
561 getSequence()->insert(it, insertions.begin(), insertions.end()); in insertChildNodes()
553 insertChildNodes(TIntermSequence::size_type position, const TIntermSequence &insertions) insertChildNodes() argument
H A DIntermNode.h599 bool insertChildNodes(TIntermSequence::size_type position, const TIntermSequence &insertions);
/third_party/skia/third_party/externals/microhttpd/doc/
H A Dtexinfo.tex316 % does insertions, but you have to call it yourself.
8269 \message{insertions,}
8358 % Deeper inside, just make sure that the saved insertions are not spilled

Completed in 36 milliseconds