/external/tensorflow/tensorflow/contrib/distributions/python/ops/ |
D | normal_conjugate_posteriors.py | 25 def normal_conjugates_known_scale_posterior(prior, scale, s, n): argument 67 if not isinstance(prior, normal.Normal): 70 if s.dtype != prior.dtype: 73 % (s.dtype, prior.dtype)) 75 n = math_ops.cast(n, prior.dtype) 76 scale0_2 = math_ops.square(prior.scale) 80 loc=(prior.loc/scale0_2 + s/scale_2) * scalep_2, 84 def normal_conjugates_known_scale_predictive(prior, scale, s, n): argument 133 if not isinstance(prior, normal.Normal): 136 if s.dtype != prior.dtype: [all …]
|
/external/tensorflow/tensorflow/contrib/distributions/python/kernel_tests/ |
D | normal_conjugate_posteriors_test.py | 44 prior = distributions.Normal(loc=mu0, scale=sigma0) 46 prior=prior, scale=sigma, s=s, n=n) 65 prior = distributions.Normal(loc=mu0, scale=sigma0) 67 prior=prior, scale=sigma, s=s, n=n) 88 prior = distributions.Normal(loc=mu0, scale=sigma0) 90 prior=prior, scale=sigma, s=s, n=n) 109 prior = distributions.Normal(loc=mu0, scale=sigma0) 111 prior=prior, scale=sigma, s=s, n=n)
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
D | CodePlacementOpt.cpp | 139 MachineFunction::iterator OldBeginPrior = prior(Begin); in Splice() 140 MachineFunction::iterator OldEndPrior = prior(End); in Splice() 144 prior(Begin)->updateTerminator(); in Splice() 162 HasAnalyzableTerminator(prior(MachineFunction::iterator(TopMBB)))) { in EliminateUnconditionalJumpsToTop() 177 if (!HasAnalyzableTerminator(prior(MachineFunction::iterator(Pred)))) in EliminateUnconditionalJumpsToTop() 190 MachineFunction::iterator Prior = prior(Begin); in EliminateUnconditionalJumpsToTop() 212 if (!HasAnalyzableTerminator(prior(MachineFunction::iterator(Prior)))) in EliminateUnconditionalJumpsToTop() 264 !HasFallthrough(prior(MachineFunction::iterator(TopMBB))) && in MoveDiscontiguousLoopBlocks() 278 if (InsertPt != MF.begin() && HasAnalyzableTerminator(prior(InsertPt))) in MoveDiscontiguousLoopBlocks() 287 if (!HasAnalyzableTerminator(prior(MachineFunction::iterator(BB)))) in MoveDiscontiguousLoopBlocks() [all …]
|
D | MachineLoopInfo.cpp | 57 MachineBasicBlock *PriorMBB = prior(MachineFunction::iterator(TopMBB)); in getTopBlock() 61 PriorMBB = prior(MachineFunction::iterator(TopMBB)); in getTopBlock() 70 if (BotMBB != prior(End)) { in getBottomBlock()
|
D | VirtRegRewriter.cpp | 318 MachineBasicBlock::iterator Prev = prior(NewInsertLoc); in ComputeReloadLoc() 687 MachineInstr *NewMI = prior(MII); in ReMaterialize() 947 MachineInstr *LoadMI = prior(InsertLoc); in GetRegForReload() 961 UpdateKills(*prior(InsertLoc), TRI, RegKills, KillOps); in GetRegForReload() 962 DEBUG(dbgs() << '\t' << *prior(InsertLoc)); in GetRegForReload() 1035 MachineInstr *PrevMI = prior(MII); in FindFreeRegister() 1357 MachineInstr *StoreMI = prior(NextMII); in OptimizeByUnfold2() 1528 MachineBasicBlock::iterator DefMII = prior(MII); in CommuteToFoldReload() 1539 MachineInstr *ReloadMI = prior(DefMII); in CommuteToFoldReload() 1571 MII = prior(MII); in CommuteToFoldReload() [all …]
|
/external/skia/src/core/ |
D | SkClipStack.cpp | 473 void SkClipStack::Element::updateBoundAndGenID(const Element* prior) { in updateBoundAndGenID() argument 486 if (kReplace_SkClipOp == fOp || (kIntersect_SkClipOp == fOp && nullptr == prior) || in updateBoundAndGenID() 487 (kIntersect_SkClipOp == fOp && prior->fIsIntersectionOfRects && in updateBoundAndGenID() 488 prior->rectRectIntersectAllowed(this->getDeviceSpaceRect(), fDoAA))) { in updateBoundAndGenID() 515 if (nullptr == prior) { in updateBoundAndGenID() 520 prevFinite = prior->fFiniteBound; in updateBoundAndGenID() 521 prevType = prior->fFiniteBoundType; in updateBoundAndGenID() 783 Element* prior = (Element*) iter.prev(); in pushElement() local 785 if (prior) { in pushElement() 786 if (prior->canBeIntersectedInPlace(fSaveCount, element.getOp())) { in pushElement() [all …]
|
/external/skqp/src/core/ |
D | SkClipStack.cpp | 473 void SkClipStack::Element::updateBoundAndGenID(const Element* prior) { in updateBoundAndGenID() argument 486 if (kReplace_SkClipOp == fOp || (kIntersect_SkClipOp == fOp && nullptr == prior) || in updateBoundAndGenID() 487 (kIntersect_SkClipOp == fOp && prior->fIsIntersectionOfRects && in updateBoundAndGenID() 488 prior->rectRectIntersectAllowed(this->getDeviceSpaceRect(), fDoAA))) { in updateBoundAndGenID() 515 if (nullptr == prior) { in updateBoundAndGenID() 520 prevFinite = prior->fFiniteBound; in updateBoundAndGenID() 521 prevType = prior->fFiniteBoundType; in updateBoundAndGenID() 783 Element* prior = (Element*) iter.prev(); in pushElement() local 785 if (prior) { in pushElement() 786 if (prior->canBeIntersectedInPlace(fSaveCount, element.getOp())) { in pushElement() [all …]
|
/external/grpc-grpc/src/core/lib/gpr/ |
D | sync.cc | 92 gpr_atm prior = gpr_atm_no_barrier_fetch_add(&r->count, 1); in gpr_ref_non_zero() local 93 assert(prior > 0); in gpr_ref_non_zero() 104 gpr_atm prior = gpr_atm_full_fetch_add(&r->count, -1); in gpr_unref() local 105 GPR_ASSERT(prior > 0); in gpr_unref() 106 return prior == 1; in gpr_unref()
|
/external/minigbm/ |
D | drv.c | 417 struct mapping *prior = (struct mapping *)drv_array_at_idx(bo->drv->mappings, i); in drv_bo_map() local 418 if (prior->vma->handle != bo->handles[plane].u32 || in drv_bo_map() 419 prior->vma->map_flags != map_flags) in drv_bo_map() 422 if (rect->x != prior->rect.x || rect->y != prior->rect.y || in drv_bo_map() 423 rect->width != prior->rect.width || rect->height != prior->rect.height) in drv_bo_map() 426 prior->refcount++; in drv_bo_map() 427 *map_data = prior; in drv_bo_map() 432 struct mapping *prior = (struct mapping *)drv_array_at_idx(bo->drv->mappings, i); in drv_bo_map() local 433 if (prior->vma->handle != bo->handles[plane].u32 || in drv_bo_map() 434 prior->vma->map_flags != map_flags) in drv_bo_map() [all …]
|
/external/tensorflow/tensorflow/compiler/xla/ |
D | util.cc | 59 Status AddStatus(Status prior, absl::string_view context) { in AddStatus() argument 60 CHECK(!prior.ok()); in AddStatus() 61 return Status{prior.code(), in AddStatus() 62 absl::StrCat(context, ": ", prior.error_message())}; in AddStatus() 65 Status AppendStatus(Status prior, absl::string_view context) { in AppendStatus() argument 66 CHECK(!prior.ok()); in AppendStatus() 67 return Status{prior.code(), in AppendStatus() 68 absl::StrCat(prior.error_message(), ": ", context)}; in AppendStatus()
|
/external/skqp/src/pathops/ |
D | SkOpEdgeBuilder.cpp | 306 int prior = index; in walk() local 307 while (prior > 0 && !splits[prior - 1].fCanAdd) { in walk() 308 --prior; in walk() 310 if (prior < index) { in walk() 311 split->fT[0] = splits[prior].fT[0]; in walk() 312 split->fPts[0] = splits[prior].fPts[0]; in walk() 323 if (prior < index || next > index) { in walk()
|
D | SkOpSegment.cpp | 291 SkOpSpan* prior = &fHead; in calcAngles() local 296 priorAngle->set(spanBase, prior); in calcAngles() 308 prior = span; in calcAngles() 434 SkOpAngle* prior = angle; in computeSum() local 437 SkASSERT(prior->next() == angle); in computeSum() 439 if (prior->unorderable() || angle->unorderable() || next->unorderable()) { in computeSum() 460 SkOpAngle* prior = firstAngle; in computeSum() local 462 angle = prior; in computeSum() 463 prior = angle->previous(); in computeSum() 464 SkASSERT(prior->next() == angle); in computeSum() [all …]
|
D | SkOpContour.h | 137 const SkOpSegment* prior = nullptr; in debugValidate() local 140 SkASSERT(segment->prev() == prior); in debugValidate() 141 prior = segment; in debugValidate() 143 SkASSERT(prior == fTail); in debugValidate()
|
/external/skia/src/pathops/ |
D | SkOpEdgeBuilder.cpp | 306 int prior = index; in walk() local 307 while (prior > 0 && !splits[prior - 1].fCanAdd) { in walk() 308 --prior; in walk() 310 if (prior < index) { in walk() 311 split->fT[0] = splits[prior].fT[0]; in walk() 312 split->fPts[0] = splits[prior].fPts[0]; in walk() 323 if (prior < index || next > index) { in walk()
|
D | SkOpSegment.cpp | 291 SkOpSpan* prior = &fHead; in calcAngles() local 296 priorAngle->set(spanBase, prior); in calcAngles() 308 prior = span; in calcAngles() 434 SkOpAngle* prior = angle; in computeSum() local 437 SkASSERT(prior->next() == angle); in computeSum() 439 if (prior->unorderable() || angle->unorderable() || next->unorderable()) { in computeSum() 460 SkOpAngle* prior = firstAngle; in computeSum() local 462 angle = prior; in computeSum() 463 prior = angle->previous(); in computeSum() 464 SkASSERT(prior->next() == angle); in computeSum() [all …]
|
D | SkOpContour.h | 137 const SkOpSegment* prior = nullptr; in debugValidate() local 140 SkASSERT(segment->prev() == prior); in debugValidate() 141 prior = segment; in debugValidate() 143 SkASSERT(prior == fTail); in debugValidate()
|
/external/skia/tools/bookmaker/ |
D | mdOut.cpp | 737 const Definition* prior = nullptr; in buildRefFromFile() local 738 this->markTypeOut(topicDef, &prior); in buildRefFromFile() 868 const Definition* prior = nullptr; in childrenOut() local 880 this->markTypeOut(child, &prior); in childrenOut() 1124 static bool writeTableEnd(MarkType markType, Definition* def, const Definition** prior) { in writeTableEnd() argument 1125 return markType != def->fMarkType && *prior && markType == (*prior)->fMarkType; in writeTableEnd() 1134 const Definition* prior = last; in addCodeBlock() local 1136 if (prior) { in addCodeBlock() 1137 priorTerminator = prior->fTerminator ? prior->fTerminator : prior->fContentEnd; in addCodeBlock() 1198 if (Bracket::kParen == member->fBracket && prior) { in addCodeBlock() [all …]
|
/external/skqp/tools/bookmaker/ |
D | mdOut.cpp | 736 const Definition* prior = nullptr; in buildRefFromFile() local 737 this->markTypeOut(topicDef, &prior); in buildRefFromFile() 868 const Definition* prior = nullptr; in childrenOut() local 880 this->markTypeOut(child, &prior); in childrenOut() 1124 static bool writeTableEnd(MarkType markType, Definition* def, const Definition** prior) { in writeTableEnd() argument 1125 return markType != def->fMarkType && *prior && markType == (*prior)->fMarkType; in writeTableEnd() 1134 const Definition* prior = last; in addCodeBlock() local 1136 if (prior) { in addCodeBlock() 1137 priorTerminator = prior->fTerminator ? prior->fTerminator : prior->fContentEnd; in addCodeBlock() 1198 if (Bracket::kParen == member->fBracket && prior) { in addCodeBlock() [all …]
|
/external/speex/libspeexdsp/ |
D | preprocess.c | 211 spx_word16_t *prior; /**< A-priori SNR */ member 454 st->prior = (spx_word16_t*)speex_alloc((N+M)*sizeof(spx_word16_t)); in speex_preprocess_state_init() 488 st->prior[i]=SHL16(1, SNR_SHIFT); in speex_preprocess_state_init() 541 speex_free(st->prior); in speex_preprocess_state_destroy() 803 …st->prior[i] = EXTRACT16(PSHR32(ADD32(MULT16_16(gamma,MAX16(0,st->post[i])), MULT16_16(Q15_ONE-gam… in speex_preprocess_run() 804 st->prior[i]=MIN16(st->prior[i], QCONST16(100.f,SNR_SHIFT)); in speex_preprocess_run() 810 …SHR32(ADD32(MULT16_16(QCONST16(.7f,15),st->zeta[0]), MULT16_16(QCONST16(.3f,15),st->prior[0])),15); in speex_preprocess_run() 812 …32(ADD32(ADD32(MULT16_16(QCONST16(.7f,15),st->zeta[i]), MULT16_16(QCONST16(.15f,15),st->prior[i])), in speex_preprocess_run() 813 … MULT16_16(QCONST16(.075f,15),st->prior[i-1])), MULT16_16(QCONST16(.075f,15),st->prior[i+1])),15); in speex_preprocess_run() 815 …SHR32(ADD32(MULT16_16(QCONST16(.7f,15),st->zeta[i]), MULT16_16(QCONST16(.3f,15),st->prior[i])),15); in speex_preprocess_run() [all …]
|
/external/curl/docs/cmdline-opts/ |
D | http2-prior-knowledge.d | 1 Long: http2-prior-knowledge 10 Upgrade. It requires prior knowledge that the server supports HTTP/2 straight
|
/external/compiler-rt/lib/asan/ |
D | asan_activation_flags.inc | 14 # error "Define ASAN_ACTIVATION_FLAG prior to including this file!" 18 # error "Define COMMON_ACTIVATION_FLAG prior to including this file!"
|
/external/tensorflow/tensorflow/compiler/xla/service/ |
D | call_inliner_test.cc | 73 auto prior = computation->root_instruction()->control_predecessors()[0]; in TEST_F() local 74 EXPECT_THAT(prior, op::Constant()); in TEST_F() 75 EXPECT_EQ(prior->literal().GetFirstElement<float>(), 24); in TEST_F()
|
/external/tensorflow/tensorflow/core/api_def/base_api/ |
D | api_def_BoostedTreesCenterBias.pbtxt | 40 …summary: "Calculates the prior from the training data (the bias) and fills in the first node with …
|
/external/curl/lib/ |
D | config-win32.h | 549 # error VS2008 does not support Windows build targets prior to Windows 2000 563 # error VS2012 does not support Windows build targets prior to Windows XP 565 # error VS2012 does not support Windows build targets prior to Windows \
|
/external/ipsec-tools/src/racoon/ |
D | NOTICE | 14 without specific prior written permission. 43 without specific prior written permission. 72 without specific prior written permission. 101 without specific prior written permission. 129 without specific prior written permission. 158 without specific prior written permission. 188 without specific prior written permission. 217 without specific prior written permission. 248 or promote products derived from this software without specific prior 279 without specific prior written permission. [all …]
|