HomeSort by relevance Sort by last modified time
    Searched defs:Add (Results 301 - 325 of 624) sorted by null

<<11121314151617181920>>

  /prebuilts/go/linux-x86/test/chan/
powser1.go 250 func add(u, v rat) rat { func
269 return add(u, neg(v))
318 return add(y, mul(c, eval(c, U, n-1)))
333 // Add two power series
334 func Add(U, V PS) PS {
343 Z.dat <- add(uv[0], uv[1])
380 return Add(U, Cmul(neg(one), V))
470 W := Add(Cmul(uv[0], VV[0]), Cmul(uv[1], UU[0]))
473 copy(Add(W, Mul(UU[1], VV[1])), Z)
663 print("Add: "
    [all...]
powser2.go 260 func add(u, v *rat) *rat { func
279 return add(u, neg(v))
332 return add(y, mul(c, eval(c, U, n-1)))
347 // Add two power series
348 func Add(U, V PS) PS {
357 Z.dat <- add(uv[0].(*rat), uv[1].(*rat))
394 return Add(U, Cmul(neg(one), V))
484 W := Add(Cmul(uv[0].(*rat), VV[0]), Cmul(uv[1].(*rat), UU[0]))
487 copy(Add(W, Mul(UU[1], VV[1])), Z)
677 print("Add: "
    [all...]
  /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/
reflection.h 126 void Add(const T& value) const {
127 accessor_->template Add<T>(data_, value);
147 Add(*it);
258 void Add(const T& value) const {
259 accessor_->Add(data_, &value);
279 Add(*it);
353 virtual void Add(Field* data, const Value* value) const = 0;
406 void Add(Field* data, const ValueType& value) const {
416 Add(data, static_cast<const Value*>(&tmp));
  /system/tools/aidl/
ast_java.cpp 135 void StatementBlock::Add(Statement* statement) {
139 void StatementBlock::Add(Expression* expression) {
type_namespace.h 102 // Add a container type to this namespace. Returns false only
103 // on error. Silently discards requests to add non-container types.
176 bool Add(const T* type);
198 bool LanguageTypeNamespace<T>::Add(const T* type) {
  /art/compiler/optimizing/
gvn.cc 30 * through the `Add` method, and the `Kill` method. The `Kill` method removes
87 void Add(HInstruction* instruction) {
497 set->Add(current);
  /device/linaro/bootloader/edk2/MdePkg/Include/Protocol/
Smbios.h 7 This protocol provides an interface to add, remove or discover SMBIOS records. The driver which
91 Add an SMBIOS record.
93 This function allows any agent to add SMBIOS records. The caller is responsible for ensuring
101 but is fixed by the call to Add(). A string can be a place holder, but it must not be a NULL string as
106 @param[in, out] SmbiosHandle On entry, the handle of the SMBIOS record to add. If FFFEh, then a unique handle
131 SMBIOS record is defined by how many strings were present when Add() was called.
185 @param[out] ProducerHandle On exit, points to the ProducerHandle registered by Add(). If no
186 ProducerHandle was passed into Add() NULL is returned. If a NULL pointer is
203 EFI_SMBIOS_ADD Add;
  /external/boringssl/src/util/fipstools/
delocate.peg.go 195 func (t *tokens32) Add(rule pegRule, begin, end, index uint32) {
332 add := func(rule pegRule, begin uint32) {
333 tree.Add(rule, begin, position, tokenIndex)
390 add(ruleAsmFile, position1)
497 add(ruleStatement, position6)
695 add(ruleGlobalDirective, position25)
727 add(ruleDirective, position51)
826 add(ruleDirectiveName, position55)
1016 add(ruleLocationDirective, position71)
1065 add(ruleArgs, position97
    [all...]
  /external/clang/lib/Driver/
SanitizerArgs.cpp 131 SanitizerMask Add = parseArgValues(D, Arg, true);
132 Add &= ~TrapRemove;
133 if (SanitizerMask InvalidValues = Add & ~TrappingSupportedWithGroups) {
139 TrappingKinds |= expandSanitizerGroups(Add) & ~TrapRemove;
209 SanitizerMask Add = parseArgValues(D, Arg, true);
210 AllAddedKinds |= expandSanitizerGroups(Add);
213 Add &= ~AllRemove;
215 // sanitizers in Add are those which have been explicitly enabled.
218 Add & InvalidTrappingKinds & ~DiagnosedKinds) {
224 Add &= ~InvalidTrappingKinds
    [all...]
  /external/compiler-rt/lib/cfi/
cfi.cc 119 void Add(uptr begin, uptr end, uptr cfi_check);
137 void ShadowBuilder::Add(uptr begin, uptr end, uptr cfi_check) {
252 b->Add(cur_beg, cur_end, cfi_check);
  /external/gemmlowp/fixedpoint/
fixedpoint.h 91 tIntegerType Add(tIntegerType a, tIntegerType b) {
254 static IntegerType Run(IntegerType a, IntegerType b) { return Add(a, b); }
343 Add(ShiftRight(mask, 1), BitAnd(MaskIfLessThan(x, zero), one));
344 return Add(ShiftRight(x, exponent),
514 // raw integer values. The IntegerBits simply add up, as is obvious
563 MAKE_FIXEDPOINT_BINARY_FUNC(operator+, Add)
    [all...]
  /external/google-benchmark/test/
output_test_helper.cc 177 void Add(const std::string& entry_pattern, ResultsCheckFn fn);
197 // add a results checker for a benchmark
198 void ResultsChecker::Add(const std::string& entry_pattern, ResultsCheckFn fn) {
290 rc.Add(bm_name, fn);
  /external/libchrome/crypto/
p224.cc 77 // Add computes *out = a+b
80 void Add(FieldElement* out, const FieldElement& a, const FieldElement& b) {
435 // See http://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#addition-add-2007-bl
496 Add(&z1z1, z1z1, z2z2);
497 Add(&z2z2, a.z, b.z);
508 Add(&z1z1, j, z1z1);
539 Add(&t, a.x, delta);
549 Add(&out->z, a.y, a.z);
677 ::Add(&rhs, rhs, kB);
723 void Add(const Point& a, const Point& b, Point* out)
    [all...]
  /external/libcxx/utils/google-benchmark/test/
output_test_helper.cc 177 void Add(const std::string& entry_pattern, ResultsCheckFn fn);
197 // add a results checker for a benchmark
198 void ResultsChecker::Add(const std::string& entry_pattern, ResultsCheckFn fn) {
290 rc.Add(bm_name, fn);
  /external/libmojo/mojo/public/cpp/bindings/tests/
interface_ptr_unittest.cc 41 void Add(double value, const CalcCallback& callback) override {
67 void Add(double value, const base::Closure& closure) {
68 calculator_->Add(
102 calculator_->Add(
112 // Add some more and wait for re-entrant call to Output!
113 calculator_->Add(
233 calculator_ui.Add(2.0, run_loop.QuitClosure());
251 calculator_ui.Add(2.0, run_loop.QuitClosure());
320 calculator_ui.Add(2.0, run_loop.QuitClosure());
355 calculator_ui.Add(2.0, run_loop2.QuitClosure())
    [all...]
  /external/llvm/include/llvm/ADT/
FoldingSet.h 38 /// call one of the Add* functions defined in the FoldingSetImpl::NodeID class.
64 /// 1) If you have an existing node that you want add to the set but unsure
250 /// types. Combined with the FoldingSetNodeWrapper class, one can add objects
321 /// Add* - Add various data types to Bit data.
335 inline void Add(const T &x) { FoldingSetTrait<T>::Profile(x, *this); }
758 ID.Add(P.first);
759 ID.Add(P.second);
  /external/llvm/include/llvm/MC/
MCExpr.h 386 Add, ///< Addition.
426 return create(Add, LHS, RHS, Ctx);
  /external/llvm/lib/Target/WebAssembly/
WebAssemblyISelLowering.cpp 379 SDValue Add = DAG.getNode(ISD::ADD, DL, PtrVT, FINode,
382 Chain, DL, Arg, Add,
396 // Add all fixed arguments. Note that for non-varargs calls, NumFixedArgs
400 // Add a pointer to the vararg buffer.
663 // Add an operand for each case.
  /external/llvm/lib/Transforms/Scalar/
StraightLineStrengthReduce.cpp 42 // takes only one add starting from the second iteration.
86 Add, // B + i * S
160 // Allocate candidates and find bases for Add instructions.
258 if (C.CandidateKind == Candidate::Add)
277 if (C.CandidateKind == Candidate::Add) {
314 // In the above cases, we still add I to the candidate list so that I can be
339 case Instruction::Add:
357 assert(I->getNumOperands() == 2 && "isn't I an add?");
370 allocateCandidatesAndFindBasis(Candidate::Add, SE->getSCEV(LHS), Idx, S, I);
375 allocateCandidatesAndFindBasis(Candidate::Add, SE->getSCEV(LHS), Idx, S, I)
    [all...]
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 322 Instruction* Add = BinaryOperator::CreateAdd(Val, NegLo,
326 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Add, UpperBound,
520 // If the Default block has no more predecessors just add it to DeleteList.
  /external/llvm/unittests/Transforms/Utils/
Cloning.cpp 63 BinaryOperator *Add = BinaryOperator::Create(Instruction::Add, V, V);
67 BinaryOperator *AddClone = this->clone(Add);
80 Add->setHasNoUnsignedWrap();
84 AddClone = this->clone(Add);
97 Add->setHasNoSignedWrap();
101 AddClone = this->clone(Add);
114 Add->setHasNoUnsignedWrap(false);
118 AddClone = this->clone(Add);
  /external/lzma/CPP/Common/
MyVector.h 199 unsigned Add(const T item)
461 unsigned Add(const T& item) { return _v.Add(new T(item)); }
468 _v.Add(p);
  /external/skia/src/core/
SkResourceCache.cpp 134 void SkResourceCache::add(Rec* rec, void* payload) { function in class:SkResourceCache
160 SkDebugf("RC: add %5s %12p key %08x -- total %5s, count %d\n",
515 void SkResourceCache::Add(Rec* rec, void* payload) {
517 get_cache()->add(rec, payload);
  /external/skqp/src/core/
SkResourceCache.cpp 134 void SkResourceCache::add(Rec* rec, void* payload) { function in class:SkResourceCache
160 SkDebugf("RC: add %5s %12p key %08x -- total %5s, count %d\n",
515 void SkResourceCache::Add(Rec* rec, void* payload) {
517 get_cache()->add(rec, payload);
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
FoldingSet.h 42 /// call one of the Add* functions defined in the FoldingSetImpl::NodeID class.
68 /// 1) If you have an existing node that you want add to the set but unsure
238 /// types. Combined with the FoldingSetNodeWrapper class, one can add objects
302 /// Add* - Add various data types to Bit data.
316 inline void Add(const T &x) { FoldingSetTrait<T>::Profile(x, *this); }

Completed in 1909 milliseconds

<<11121314151617181920>>