/external/clang/lib/StaticAnalyzer/Checkers/ |
IdenticalExprChecker.cpp | 55 ArrayRef<SourceRange> Sr); 63 ArrayRef<SourceRange> Sr) { 75 Message, ELoc, Sr); 80 SourceRange Sr[2]; 93 Sr[0] = RHS->getSourceRange(); 94 Sr[1] = B2->getRHS()->getSourceRange(); 95 reportIdenticalExpr(B, CheckBitwise, Sr); 101 Sr[0] = RHS->getSourceRange(); 102 Sr[1] = LHS->getSourceRange(); 103 reportIdenticalExpr(B, CheckBitwise, Sr); [all...] |
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/mmix/ |
bspec-2.d | 1 #readelf: -Sr -x1 -x4
|
/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
DGMRES.h | 452 DenseMatrix Sr(it, nbrEig); 453 Sr.setZero(); 456 Sr.col(j) = schurofH.matrixU().col(perm(it-j-1)); 461 X = m_V.leftCols(it) * Sr;
|
/device/linaro/bootloader/edk2/MdeModulePkg/Bus/Pci/NvmExpressDxe/ |
NvmExpressHci.h | 157 UINT32 Sr:1; /* Sequential Request */
192 UINT32 Sr:1; /* Sequential Request */
|
/external/sl4a/ScriptingLayerForAndroid/src/de/mud/terminal/ |
vt320.java | 665 int Sc, Sr, Sa, Stm, Sbm; [all...] |
/external/webrtc/webrtc/modules/rtp_rtcp/source/ |
rtcp_packet_unittest.cc | 45 TEST(RtcpPacketTest, Sr) { 46 SenderReport sr; local 47 sr.From(kSenderSsrc); 48 sr.WithNtpSec(0x11111111); 49 sr.WithNtpFrac(0x22222222); 50 sr.WithRtpTimestamp(0x33333333); 51 sr.WithPacketCount(0x44444444); 52 sr.WithOctetCount(0x55555555); 54 rtc::scoped_ptr<RawPacket> packet(sr.Build()); 72 SenderReport sr; local 91 SenderReport sr; local 107 SenderReport sr; local [all...] |
/external/ImageMagick/www/api/ |
quantize.php | 86 <p>Sr, Sg, Sb: Sums of the red, green, and blue component values for all pixels not classified at a lower depth. The combination of these sums and n2 will ultimately characterize the mean color of a set of pixels represented by this node.</p> 99 <dd> When a node to be pruned has offspring, the pruning procedure invokes itself recursively in order to prune the tree from the leaves upward. n2, Sr, Sg, and Sb in a node being pruned are always added to the corresponding data in that node's parent. This retains the pruned node's color characteristics for later averaging. </dd> 110 <dd> First, the assignment phase makes one pass over the pruned color description tree to establish the image's color map. For each node with n2 > 0, it divides Sr, Sg, and Sb by n2 . This produces the mean color of all pixels that classify no lower than this node. Each of these colors becomes an entry in the color map. </dd>
|
/prebuilts/go/darwin-x86/src/encoding/json/ |
encode_test.go | 20 Sr string `json:"sr"` 47 "sr": "",
|
/prebuilts/go/linux-x86/src/encoding/json/ |
encode_test.go | 20 Sr string `json:"sr"` 47 "sr": "",
|
/external/webrtc/data/voice_engine/stereo_rtp_files/ |
stereo_g729.rtp | 15 ?%I??Xr^?AM??q??0??-?????V?? ?d?vR??? < |