Searched refs:packets (Results 1 - 25 of 133) sorted by relevance

123456

/external/smack/src/org/jivesoftware/smackx/workgroup/packet/
H A DTranscript.java39 private List<Packet> packets; field in class:Transcript
48 this.packets = new ArrayList<Packet>();
52 * Creates a new transcript for the given sessionID and list of packets. The list of packets
56 * @param packets the list of messages and presences send to the room.
58 public Transcript(String sessionID, List<Packet> packets) { argument
60 this.packets = packets;
79 return Collections.unmodifiableList(packets);
89 for (Iterator<Packet> it=packets
[all...]
H A DTranscriptProvider.java44 List<Packet> packets = new ArrayList<Packet>();
51 packets.add(PacketParserUtils.parseMessage(parser));
54 packets.add(PacketParserUtils.parsePresence(parser));
64 return new Transcript(sessionID, packets);
/external/chromium_org/third_party/webrtc/modules/remote_bitrate_estimator/test/
H A Dbwe_test_framework_unittest.cc58 static bool IsSequenceNumberSorted(const Packets& packets) { argument
59 PacketsConstIt last_it = packets.begin();
60 for (PacketsConstIt it = last_it; it != packets.end(); ++it) {
71 Packets packets; local
72 // Insert some packets in order...
73 EXPECT_TRUE(IsTimeSorted(packets));
75 packets.push_back(Packet(100, 0));
76 EXPECT_TRUE(IsTimeSorted(packets));
78 packets.push_back(Packet(110, 0));
79 EXPECT_TRUE(IsTimeSorted(packets));
92 Packets packets; local
183 Packets packets; local
240 Packets packets; local
252 Packets packets; local
301 Packets packets; local
399 Packets packets; local
452 Packets packets; local
507 Packets packets; local
585 Packets packets; local
738 Packets packets; local
864 Packets packets; local
[all...]
H A Dbwe_test.cc313 Packets packets; local
316 it->RunFor(simulation_interval_ms_, time_now_ms_, &packets);
319 // Verify packets are in order between batches.
320 if (!packets.empty()) {
322 packets.splice(packets.begin(), previous_packets_,
324 ASSERT_TRUE(IsTimeSorted(packets));
325 packets.erase(packets.begin());
327 ASSERT_LE(packets
[all...]
/external/chromium_org/media/cast/net/pacing/
H A Dmock_paced_packet_sender.h19 MOCK_METHOD1(SendPackets, bool(const SendPacketVector& packets));
20 MOCK_METHOD2(ResendPackets, bool(const SendPacketVector& packets,
H A Dpaced_sender.cc20 // bursts of packets.
24 // "Impossible" upper-bound on the maximum number of packets that should ever be
96 bool PacedSender::SendPackets(const SendPacketVector& packets) { argument
97 if (packets.empty()) {
100 const bool high_priority = IsHighPriority(packets.begin()->first);
101 for (size_t i = 0; i < packets.size(); i++) {
102 DCHECK(IsHighPriority(packets[i].first) == high_priority);
104 priority_packet_list_[packets[i].first] =
105 make_pair(PacketType_Normal, packets[i].second);
107 packet_list_[packets[
144 ResendPackets(const SendPacketVector& packets, const DedupInfo& dedup_info) argument
[all...]
H A Dpaced_sender_unittest.cc90 SendPacketVector packets; local
109 packets.push_back(std::make_pair(key, packet));
111 return packets;
142 SendPacketVector packets = CreateSendPacketVector(kSize1, 1, true); local
144 EXPECT_TRUE(paced_sender_->SendPackets(packets));
145 EXPECT_TRUE(paced_sender_->ResendPackets(packets, DedupInfo()));
156 SendPacketVector packets = CreateSendPacketVector(kSize1, local
161 EXPECT_TRUE(paced_sender_->SendPackets(packets));
170 // If we call process too early make sure we don't send any packets.
180 // Check that we don't get any more packets
453 SendPacketVector packets = CreateSendPacketVector(kSize1, 1, true); local
[all...]
H A Dpaced_sender.h35 // to identify it so that we can de-duplicate packets in the queue.
36 // 2. The sort order of the PacketKey determines the order that packets
38 // means that older packets are sent first.
42 // Information used to deduplicate retransmission packets.
65 virtual bool SendPackets(const SendPacketVector& packets) = 0;
66 virtual bool ResendPackets(const SendPacketVector& packets,
94 // These must be called before non-RTCP packets are sent.
114 virtual bool SendPackets(const SendPacketVector& packets) OVERRIDE;
115 virtual bool ResendPackets(const SendPacketVector& packets,
121 // Actually sends the packets t
[all...]
/external/chromium_org/media/cast/net/rtp/
H A Dpacket_storage.cc26 const SendPacketVector& packets) {
27 if (packets.empty()) {
44 frames_.push_back(packets);
72 const SendPacketVector& packets = frames_[index_8bits]; local
73 return packets.empty() ? NULL : &packets;
25 StoreFrame(uint32 frame_id, const SendPacketVector& packets) argument
H A Dpacket_storage.h21 // Store all of the packets for a frame.
22 void StoreFrame(uint32 frame_id, const SendPacketVector& packets);
24 // Release all of the packets for a frame.
27 // Returns a list of packets for a frame indexed by a 8-bits ID.
39 // The number of frames whose packets have been released, but the entry in the
H A Drtp_packetizer.cc54 SendPacketVector packets; local
107 packets.push_back(make_pair(key, packet));
115 packet_storage_->StoreFrame(frame.frame_id, packets);
118 transport_->SendPackets(packets);
/external/speex/libspeex/
H A Djitter.c41 - Linked list structure for holding the packets instead of the current fixed-size array
67 #define SPEEX_JITTER_MAX_BUFFER_SIZE 200 /**< Maximum number of packets in jitter buffer */
82 /** Buffer that keeps the time of arrival of the latest packets */
86 spx_int32_t timing[MAX_TIMINGS]; /**< Sorted list of all timings ("latest" packets first) */
87 spx_int16_t counts[MAX_TIMINGS]; /**< Order the packets were put in (will be used for short-term estimate) */
145 JitterBufferPacket packets[SPEEX_JITTER_MAX_BUFFER_SIZE]; /**< Packets stored in the buffer */ member in struct:JitterBuffer_
162 int max_late_rate; /**< Absolute maximum amount of late packets tolerable (in percent) */
163 int latency_tradeoff; /**< Latency equivalent of losing one percent of packets */
164 int auto_tradeoff; /**< Latency equivalent of losing one percent of packets (automatic default) */
166 int lost_count; /**< Number of consecutive lost packets */
[all...]
/external/iproute2/include/linux/
H A Dgen_stats.h19 * @packets: number of seen packets
23 __u32 packets; member in struct:gnet_stats_basic
27 __u32 packets; member in struct:gnet_stats_basic_packed
44 * @drops: number of dropped packets
/external/kernel-headers/original/uapi/linux/
H A Dgen_stats.h20 * @packets: number of seen packets
24 __u32 packets; member in struct:gnet_stats_basic
28 __u32 packets; member in struct:gnet_stats_basic_packed
55 * @drops: number of dropped packets
/external/deqp/framework/referencerenderer/
H A DrrShaders.hpp96 * Vertex shaders execute shading for set of vertex packets. See VertexPacket
104 virtual void shadeVertices (const VertexAttrib* inputs, VertexPacket* const* packets, const int numPackets) const = 0;
119 * Fragment shader executes shading for list of fragment packets. See
130 virtual void shadeFragments (FragmentPacket* packets, const int numPackets, const FragmentShadingContext& context) const = 0; // \note numPackets must be greater than zero.
168 * Geometry shader executes a list of primitive packets and outputs
169 * a new set of vertex packets for new primitives.
181 virtual void shadePrimitives (GeometryEmitter& output, int verticesIn, const PrimitivePacket* packets, const int numPackets, int invocationID) const = 0;
208 void shadeVertices (const VertexAttrib* inputs, VertexPacket* packets, const int numPackets) const;
215 void VertexShaderLoop<Shader>::shadeVertices (const VertexAttrib* inputs, VertexPacket* packets, const int numPackets) const argument
218 m_shader.shadeVertex(inputs, packets[nd
234 shadeFragments(FragmentPacket* packets, const int numPackets) const argument
[all...]
/external/deqp/modules/gles3/functional/
H A Des3fFboTestUtil.hpp63 void shadeVertices (const rr::VertexAttrib* inputs, rr::VertexPacket* const* packets, const int numPackets) const;
64 void shadeFragments (rr::FragmentPacket* packets, const int numPackets, const rr::FragmentShadingContext& context) const;
78 void shadeVertices (const rr::VertexAttrib* inputs, rr::VertexPacket* const* packets, const int numPackets) const;
79 void shadeFragments (rr::FragmentPacket* packets, const int numPackets, const rr::FragmentShadingContext& context) const;
97 void shadeVertices (const rr::VertexAttrib* inputs, rr::VertexPacket* const* packets, const int numPackets) const;
98 void shadeFragments (rr::FragmentPacket* packets, const int numPackets, const rr::FragmentShadingContext& context) const;
126 void shadeVertices (const rr::VertexAttrib* inputs, rr::VertexPacket* const* packets, const int numPackets) const;
127 void shadeFragments (rr::FragmentPacket* packets, const int numPackets, const rr::FragmentShadingContext& context) const;
148 void shadeVertices (const rr::VertexAttrib* inputs, rr::VertexPacket* const* packets, const int numPackets) const;
149 void shadeFragments (rr::FragmentPacket* packets, cons
[all...]
/external/eigen/test/eigen2/
H A Deigen2_packetmath.cpp51 EIGEN_ALIGN_128 Packet packets[PacketSize*2]; local
76 packets[0] = ei_pload(data1);
77 packets[1] = ei_pload(data1+PacketSize);
78 if (offset==0) ei_palign<0>(packets[0], packets[1]);
79 else if (offset==1) ei_palign<1>(packets[0], packets[1]);
80 else if (offset==2) ei_palign<2>(packets[0], packets[1]);
81 else if (offset==3) ei_palign<3>(packets[
[all...]
/external/chromium_org/media/formats/mp2t/
H A Des_parser_test_base.cc91 void EsParserTestBase::ComputePacketSize(std::vector<Packet>* packets) { argument
92 DCHECK(packets);
93 if (packets->size() == 0u)
96 Packet* cur = &(*packets)[0];
97 for (size_t k = 0; k < packets->size() - 1; k++) {
98 Packet* next = &(*packets)[k + 1];
H A Des_parser_test_base.h50 // Process the PES packets using the given ES parser.
61 void ComputePacketSize(std::vector<Packet>* packets);
63 // Generate some fixed size PES packets of |stream_|.
/external/deqp/modules/glshared/
H A DglsRandomShaderProgram.hpp47 virtual void shadeVertices (const rr::VertexAttrib* inputs, rr::VertexPacket* const* packets, const int numPackets) const;
48 virtual void shadeFragments (rr::FragmentPacket* packets, const int numPackets, const rr::FragmentShadingContext& context) const;
/external/libnl/include/linux/
H A Dgen_stats.h16 * @packets: number of seen packets
21 __u32 packets; member in struct:gnet_stats_basic
37 * @drops: number of dropped packets
/external/qemu/android/
H A Dshaper.c99 QueuedPacket packets; /* list of queued packets, ordered by expiration date */ member in struct:NetShaperRec_
119 while (shaper->packets) {
120 QueuedPacket packet = shaper->packets;
121 shaper->packets = packet->next;
139 while ((packet = shaper->packets) != NULL) {
145 shaper->packets = packet->next;
152 if (shaper->packets) {
153 shaper->block_until = shaper->packets->expiration;
168 shaper->packets
[all...]
/external/chromium_org/third_party/libjingle/source/talk/media/base/
H A Dfakenetworkinterface.h46 // Fake NetworkInterface that sends/receives RTP/RTCP packets.
61 // Conference mode is a mode where instead of simply forwarding the packets,
93 int packets = 0; local
94 GetNumRtpBytesAndPackets(ssrc, NULL, &packets);
95 return packets;
215 void GetNumRtpBytesAndPackets(uint32 ssrc, int* bytes, int* packets) { argument
219 if (packets) {
220 *packets = 0;
232 if (packets) {
233 ++(*packets);
[all...]
/external/chromium_org/media/cast/logging/
H A Dlogging_impl.cc84 const PacketList& packets) {
86 for (PacketList::const_iterator it = packets.begin(); it != packets.end();
81 InsertPacketListEvent(const base::TimeTicks& time_of_event, CastLoggingEvent event, EventMediaType event_media_type, const PacketList& packets) argument
/external/deqp/modules/gles31/functional/
H A Des31fFboTestUtil.hpp67 void shadeVertices (const rr::VertexAttrib* inputs, rr::VertexPacket* const* packets, const int numPackets) const;
68 void shadeFragments (rr::FragmentPacket* packets, const int numPackets, const rr::FragmentShadingContext& context) const;
97 void shadeVertices (const rr::VertexAttrib* inputs, rr::VertexPacket* const* packets, const int numPackets) const;
98 void shadeFragments (rr::FragmentPacket* packets, const int numPackets, const rr::FragmentShadingContext& context) const;

Completed in 995 milliseconds

123456