debian/0000755000000000000000000000000011753157456007204 5ustar debian/changelog0000644000000000000000000000434311753155651011055 0ustar polygraph (4.3.2-1.1) unstable; urgency=low * Non-maintainer upload. * debian/patches/10-fix-ftbfs-gcc-4.7.patch: Fix ftbfs with GCC-4.7 (Closes: #667326). -- Mònica Ramírez Arceda Fri, 11 May 2012 11:27:05 +0200 polygraph (4.3.2-1) unstable; urgency=low * New upstream bugfix release. Changes include: - fix build with OpenSSL libraries with disabled SSLv2 protocol - cleanup copyright preamble in source code files * Switch from CDBS to debhelper: - debian/rules: based on rules.tiny from debhelper examples - debian/control: drop build-dependency on cdbs and update debhelper build-dependency to version 8 - debian/compat: set debhelper compatibility level to 8 -- Dmitry Kurochkin Tue, 05 Apr 2011 19:34:13 +0400 polygraph (4.3.1-1) unstable; urgency=low * Initial Debian release (Closes: #603627) * New upstream release. Most notable changes since v4.0.11: - SOCKS support - Content-driven robots - Transaction lifetime limits - PGL phase script access to live transaction stats - Better randomness and consistency in traffic generation models - Better support for trace replay - PGL-configurable custom transaction statistics - IPv6, DNS, and HTTP support fixes - Portability improvements and bug fixes * Add MD5 checksum and Fowler–Noll–Vo hash code copyright to debian/copyright * Mention SOCKS proxy support in long description -- Dmitry Kurochkin Tue, 16 Nov 2010 02:39:59 +0300 polygraph (4.0.11-0ubuntu1) natty; urgency=low * New upstream release (LP: #644813) * Bump standards to 3.9.1 No other changes -- Bhavani Shankar Sat, 13 Nov 2010 15:51:43 +0530 polygraph (4.0.10-0ubuntu1) lucid; urgency=low * New upstream bugfix release (LP: #562957) * Switch to dpkg-source 3.0 (quilt) format * Add FTP to protocol list in long description -- Dmitry Kurochkin Wed, 14 Apr 2010 14:03:48 +0400 polygraph (4.0.9-0ubuntu1) lucid; urgency=low * Initial release (LP: #415395) -- Dmitry Kurochkin Mon, 15 Feb 2010 01:14:11 +0300 debian/source/0000755000000000000000000000000011546633270010475 5ustar debian/source/format0000644000000000000000000000001411546633270011703 0ustar 3.0 (quilt) debian/compat0000644000000000000000000000000211546633270010373 0ustar 8 debian/watch0000644000000000000000000000013511546633270010225 0ustar version=3 http://www.web-polygraph.org/downloads/releases.html srcs/polygraph-(.*)-src\.tgz debian/rules0000755000000000000000000000022311546633270010252 0ustar #!/usr/bin/make -f %: dh $@ override_dh_installdocs: dh_installdocs -A README override_dh_installchangelogs: dh_installchangelogs change.log debian/control0000644000000000000000000000224311546633270010601 0ustar Source: polygraph Section: net Priority: optional Maintainer: Dmitry Kurochkin Build-Depends: debhelper (>= 8), autotools-dev, zlib1g-dev, libssl-dev, libncurses5-dev Standards-Version: 3.9.1 Homepage: http://www.web-polygraph.org Package: polygraph Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends}, ${perl:Depends} Recommends: gnuplot-x11 | gnuplot-nox Description: performance testing tool for caching proxies and more Web Polygraph is a performance testing tool for caching proxies, origin server accelerators, L4/7 switches, content filters, and other Web intermediaries. Polygraph's features include: * high-performance HTTP clients and servers * realistic HTTP, FTP, and SSL traffic generation * HTTP and SOCKS5 proxy support, with chaining * HTTP Basic, NTLM, and Negotiate proxy authentication * LDAP-friendly generation of user credentials * flexible content simulation * ready-to-use standard workloads for benchmarking * powerful domain-specific configuration language * portable open-source implementation . Documentation, test results, and support available at www.web-polygraph.org. debian/copyright0000644000000000000000000000705711546633270011141 0ustar This package was debianized by Dmitry Kurochkin on Sat, 11 Jul 2009 19:59:50 +0400. It was downloaded from http://www.web-polygraph.org/downloads Upstream Author: The Measurement Factory, Inc. Copyright: Copyright (C) 2003-2006 The Measurement Factory, Inc. License: Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. On Debian systems, the complete text of the Apache version 2.0 license can be found in `/usr/share/common-licenses/Apache-2.0'. Portions of NTLM authentication code (src/client/NtlmAuth.(h|cc) files) are derived from libcurl of cURL project, circa v7.16.0 (http://curl.haxx.se/): Copyright (c) 1996 - 2006, Daniel Stenberg, . All rights reserved. Permission to use, copy, modify, and distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. Except as contained in this notice, the name of a copyright holder shall not be used in advertising or otherwise to promote the sale, use or other dealings in this Software without prior written authorization of the copyright holder. MD5 checksum code (src/xstd/Checksum.cc) is derived from RFC 1321, Appendix 3: Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All rights reserved. License to copy and use this software is granted provided that it is identified as the "RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing this software or this function. License is also granted to make and use derivative works provided that such works are identified as "derived from the RSA Data Security, Inc. MD5 Message-Digest Algorithm" in all material mentioning or referencing the derived work. RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided "as is" without express or implied warranty of any kind. These notices must be retained in any copies of any part of this documentation and/or software. Fowler–Noll–Vo hash function implementation (src/xstd/gadgets.h file) is based on pseudo code from http://www.isthe.com/chongo/tech/comp/fnv/. FNV hash algorithms and source code are in public domain. Packaging: Copyright (C) 2009 The Measurement Factory, Inc. and is licensed under the Apache version 2.0, see `/usr/share/common-licenses/Apache-2.0'. debian/patches/0000755000000000000000000000000011753157322010623 5ustar debian/patches/series0000644000000000000000000000003311753151526012034 0ustar 10-fix-ftbfs-gcc-4.7.patch debian/patches/10-fix-ftbfs-gcc-4.7.patch0000644000000000000000000000573211753157322015021 0ustar Description: Fix ftbfs with GCC-4.7. Author: Mònica Ramírez Arceda Bug-Debian: http://bugs.debian.org/667326 Last-Update: 2012-05-11 --- a/src/xstd/Heap.h +++ b/src/xstd/Heap.h @@ -23,7 +23,7 @@ const Item &top() const { return this->theItems[1]; } Item &at(int idx) { return this->theItems[idx+1]; } - void add(Item v) { append(v); floatUp(++theCnt); } + void add(Item v) { this->append(v); floatUp(++theCnt); } void skip() { this->theItems[1] = this->theItems[theCnt--]; this->theCount--; sinkDown(1); } Item shift() { const Item v = this->theItems[1]; skip(); return v; } --- a/src/xstd/Ring.h +++ b/src/xstd/Ring.h @@ -22,11 +22,11 @@ int size() const { return Array::size(); } bool empty() const { return this->theInOff <= this->theOutOff; } bool full() const { return count() >= this->theCapacity; } - const Item &top(int off = 0) const { return item((this->theOutOff+off) % this->theCapacity); } + const Item &top(int off = 0) const { return this->item((this->theOutOff+off) % this->theCapacity); } - Item &top(int off = 0) { return item((this->theOutOff+off) % this->theCapacity); } - void enqueue(Item i) { Assert(!full()); item(this->theInOff++ % this->theCapacity) = i; check(); } - Item dequeue() { return item(this->theOutOff++ % this->theCapacity); } + Item &top(int off = 0) { return this->item((this->theOutOff+off) % this->theCapacity); } + void enqueue(Item i) { Assert(!full()); this->item(this->theInOff++ % this->theCapacity) = i; check(); } + Item dequeue() { return this->item(this->theOutOff++ % this->theCapacity); } void reset() { this->theInOff = this->theOutOff = 0; } inline void resize(int aCap); --- a/src/runtime/StatPhase.cc +++ b/src/runtime/StatPhase.cc @@ -413,12 +413,12 @@ break; } } else { - static CompoundXactInfo &compound = *CompoundXactInfo::Create(); - compound.exchanges = 1; - compound.reqSize = reqSize; - compound.repSize = repSize; - compound.lifeTime = repTime; - compound.record(rec.theIsolated); + static CompoundXactInfo &compound2 = *CompoundXactInfo::Create(); + compound2.exchanges = 1; + compound2.reqSize = reqSize; + compound2.repSize = repSize; + compound2.lifeTime = repTime; + compound2.record(rec.theIsolated); } if (x->cookiesSent() > 0) --- a/src/cache/CacheEntryHash.cc +++ b/src/cache/CacheEntryHash.cc @@ -14,7 +14,7 @@ CacheEntryHash::CacheEntryHash(int aCapacity): theCount(0) { theCapacity = (aCapacity + aCapacity/3 + 7) | 1; - theIndex = new (CacheEntry*[theCapacity]); + theIndex = new (CacheEntry*[this->theCapacity]); memset(theIndex, 0, sizeof(CacheEntry*)*theCapacity); } --- a/src/tools/IntIntHash.cc +++ b/src/tools/IntIntHash.cc @@ -13,7 +13,7 @@ IntIntHash::IntIntHash(int aCapacity): theHashCap(0) { theHashCap = (aCapacity + aCapacity/3 + 7) | 1; - theIndex = new (IntIntHashItem*[theHashCap]); + theIndex = new (IntIntHashItem*[this->theHashCap]); memset(theIndex, 0, sizeof(IntIntHashItem*)*theHashCap); }