| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| testclient.cc | 34 // DESIGN: Each packet received is put it into a list of packets.
40 packets_ = new std::vector<Packet*>();
69 TestClient::Packet* TestClient::NextPacket() {
71 // at most 1 second. If, during the loop, a packet arrives, then we can stop
74 // Note that the case where no packet arrives is important. We often want to
75 // test that a packet does not arrive.
85 // Return the first packet placed in the queue.
86 Packet* packet = NULL; local
89 packet = packets_->front()
99 Packet* packet = NextPacket(); local
111 Packet* packet = NextPacket(); local
[all...] |
| testclient.h | 41 // Records the contents of a packet that was received.
42 struct Packet {
43 Packet(const SocketAddress& a, const char* b, size_t s);
44 Packet(const Packet& p);
45 virtual ~Packet();
74 // Returns the next packet received by the client or 0 if none is received
75 // within a reasonable amount of time. The caller must delete the packet
77 Packet* NextPacket();
79 // Checks that the next packet has the given contents. Returns the remot
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Swap.h | 34 typedef typename internal::packet_traits<Scalar>::type Packet;
99 Packet tmp = m_expression.template packet<StoreMode>(row, col);
101 _other.template packet<LoadMode>(row, col)
111 Packet tmp = m_expression.template packet<StoreMode>(index);
113 _other.template packet<LoadMode>(index)
|
| SelfCwiseBinaryOp.h | 25 * aligned packet loads.
53 typedef typename internal::packet_traits<Scalar>::type Packet;
113 m_functor.packetOp(m_matrix.template packet<StoreMode>(row, col),_other.template packet<LoadMode>(row, col)) );
122 m_functor.packetOp(m_matrix.template packet<StoreMode>(index),_other.template packet<LoadMode>(index)) );
|
| Functors.h | 27 template<typename Packet>
28 EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a, const Packet& b) const
30 template<typename Packet>
31 EIGEN_STRONG_INLINE const Scalar predux(const Packet& a) const
55 template<typename Packet>
56 EIGEN_STRONG_INLINE const Packet packetOp(const Packet& a, const Packet& b) cons
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_packetmath.cpp | 45 typedef typename ei_packet_traits<Scalar>::type Packet;
51 EIGEN_ALIGN_128 Packet packets[PacketSize*2];
|
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| richards.js | 51 var queue = new Packet(null, ID_WORKER, KIND_WORK);
52 queue = new Packet(queue, ID_WORKER, KIND_WORK);
55 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
60 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
61 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
62 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
83 * These two constants specify how many times a packet is queued and
123 * @param {Packet} queue the queue of work to be processed by the tas
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-richards.js | 46 var queue = new Packet(null, ID_WORKER, KIND_WORK);
47 queue = new Packet(queue, ID_WORKER, KIND_WORK);
50 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
51 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
52 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
55 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
78 * These two constants specify how many times a packet is queued and
118 * @param {Packet} queue the queue of work to be processed by the tas
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-richards.js | 46 var queue = new Packet(null, ID_WORKER, KIND_WORK);
47 queue = new Packet(queue, ID_WORKER, KIND_WORK);
50 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
51 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
52 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
55 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
78 * These two constants specify how many times a packet is queued and
118 * @param {Packet} queue the queue of work to be processed by the tas
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-richards.js | 46 var queue = new Packet(null, ID_WORKER, KIND_WORK);
47 queue = new Packet(queue, ID_WORKER, KIND_WORK);
50 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
51 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
52 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
55 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
78 * These two constants specify how many times a packet is queued and
118 * @param {Packet} queue the queue of work to be processed by the tas
[all...] |
| /external/chromium_org/v8/benchmarks/ |
| richards.js | 51 var queue = new Packet(null, ID_WORKER, KIND_WORK);
52 queue = new Packet(queue, ID_WORKER, KIND_WORK);
55 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
60 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
61 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
62 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
83 * These two constants specify how many times a packet is queued and
123 * @param {Packet} queue the queue of work to be processed by the tas
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| ResourcePriorityQueue.h | 69 /// Resource model - packet/bundle model. Purely
71 std::vector<SUnit*> Packet;
|
| /external/v8/benchmarks/ |
| richards.js | 51 var queue = new Packet(null, ID_WORKER, KIND_WORK);
52 queue = new Packet(queue, ID_WORKER, KIND_WORK);
55 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE);
56 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
57 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE);
60 queue = new Packet(null, ID_DEVICE_B, KIND_DEVICE);
61 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
62 queue = new Packet(queue, ID_DEVICE_B, KIND_DEVICE);
83 * These two constants specify how many times a packet is queued and
123 * @param {Packet} queue the queue of work to be processed by the tas
[all...] |
| /external/eigen/test/ |
| packetmath.cpp | 56 internal::pstore(data2, POP(internal::pload<Packet>(data1), internal::pload<Packet>(data1+PacketSize))); \
63 internal::pstore(data2, POP(internal::pload<Packet>(data1))); \
67 template<bool Cond,typename Packet>
71 inline Packet load(const T* from) const { return internal::pload<Packet>(from); }
74 inline void store(T* to, const Packet& x) const { internal::pstore(to,x); }
77 template<typename Packet>
78 struct packet_helper<false,Packet>
88 packet_helper<COND,Packet> h;
[all...] |
| /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/sftp/ |
| Packet.java | 15 public class Packet
|
| /external/libvorbis/doc/ |
| 04-codec.tex | 5 \section{Codec Setup and Packet Decode} \label{vorbis:spec:codec}
22 end-of-packet condition during decoding the first or third header
23 packet renders the stream undecodable. End-of-packet decoding the
28 Each header packet begins with the same header fields.
36 Decode continues according to packet type; the identification header
38 (these types are all odd as a packet with a leading single bit of '0'
39 is an audio packet). The packets must occur in the order of
277 \subsection{Audio packet decode and synthesis}
280 are audio. The first step of audio packet decode is to read an
[all...] |
| 01-introduction.tex | 61 mechanism and decoder must allow that a packet may be any size, or
62 end before or after packet decode expects.
91 flag in each audio packet, or begin decode at any frame in the stream
96 Vorbis \emph{can} initiate decode at any arbitrary packet within a
168 low-level packet decode and synthesis.
267 specification. Once set up, decode may begin at any audio packet
294 \item decode packet type flag
317 \paragraph{Packet type decode}
319 Vorbis I uses four packet types. The first three packet types mark eac
[all...] |
| /external/eigen/Eigen/src/Core/products/ |
| CoeffBasedProduct.h | 26 * on the generic Assign mechanism to evaluate the product per coeff (or packet).
34 template<int StorageOrder, int UnrollingIndex, typename Lhs, typename Rhs, typename Packet, int LoadMode>
97 * of Product. If the Product itself is not a packet-access expression, there is still a chance that the inner
170 /* Allow index-based non-packet access. It is impossible though to allow index-based packed access,
183 EIGEN_STRONG_INLINE const PacketScalar packet(Index row, Index col) const function in class:Eigen::CoeffBasedProduct
276 template<int UnrollingIndex, typename Lhs, typename Rhs, typename Packet>
283 product_coeff_vectorized_unroller<UnrollingIndex-PacketSize, Lhs, Rhs, Packet>::run(row, col, lhs, rhs, pres);
284 pres = padd(pres, pmul( lhs.template packet<Aligned>(row, UnrollingIndex) , rhs.template packet<Aligned>(UnrollingIndex, col) ));
288 template<typename Lhs, typename Rhs, typename Packet>
[all...] |
| SelfadjointMatrixVector.h | 37 typedef typename packet_traits<Scalar>::type Packet;
39 const Index PacketSize = sizeof(Packet)/sizeof(Scalar);
51 conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, IsRowMajor), ConjugateRhs> pcj0;
52 conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && EIGEN_LOGICAL_XOR(ConjugateLhs, !IsRowMajor), ConjugateRhs> pcj1;
78 Packet ptmp0 = pset1<Packet>(t0);
80 Packet ptmp1 = pset1<Packet>(t1)
[all...] |
| GeneralBlockPanelKernel.h | 69 * - the number of scalars that fit into a packet (when vectorization is enabled).
81 // e.g., each coefficient is replicated to fit a packet. This small vertical panel has to
139 * storing each res packet into two packets (2x2),
[all...] |
| /external/eigen/bench/btl/libs/eigen3/ |
| eigen3_interface.hh | 116 typedef typename internal::packet_traits<Scalar>::type Packet;
117 const int PacketSize = sizeof(Packet)/sizeof(Scalar);
|
| /external/eigen/demos/mandelbrot/ |
| mandelbrot.cpp | 33 enum { packetSize = Eigen::internal::packet_traits<Real>::size }; // number of reals in a Packet
34 typedef Eigen::Array<Real, packetSize, 1> Packet; // wrap a Packet as a vector
56 Packet pzi_start, pci_start;
61 Packet pcr, pci = pci_start, pzr, pzi = pzi_start, pzr_buf;
68 Packeti pix_iter = Packeti::Zero(), // number of iteration per pixel in the packet
85 <= Packet::Constant(4))
158 : QString("vectorized (%1 per packet)").arg(packetSize)));
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.h | 50 /// Local packet/bundle model. Purely
52 std::vector<SUnit*> Packet;
66 Packet.resize(SchedModel->getIssueWidth());
67 Packet.clear();
76 Packet.clear();
84 Packet.clear();
|
| /external/smack/src/org/jivesoftware/smack/packet/ |
| Packet.java | 21 package org.jivesoftware.smack.packet;
41 * Base class for XMPP packets. Every packet has a unique ID (which is automatically
52 public abstract class Packet {
60 * Constant used as packetID to indicate that a packet has no id. To indicate that a packet
61 * has no id set this constant as the packet's id. When the packet is asked for its id the
116 public Packet() {
119 public Packet(Packet p)
[all...] |
| /external/eigen/Eigen/src/Core/util/ |
| Memory.h | 437 * packet size for the given scalar type is 1, then everything is considered well-aligned.
440 * power of 2, the packet size in bytes is also a power of 2, and is a multiple of sizeof(Scalar). On the
449 typedef typename packet_traits<Scalar>::type Packet;
456 // Either there is no vectorization, or a packet consists of exactly 1 scalar so that all elements
[all...] |
