| tst.ring3.d (178477) | tst.ring3.d (249367) |
|---|---|
| 1/* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE --- 9 unchanged lines hidden (view full) --- 18 * 19 * CDDL HEADER END 20 */ 21 22/* 23 * Copyright 2006 Sun Microsystems, Inc. All rights reserved. 24 * Use is subject to license terms. 25 */ | 1/* 2 * CDDL HEADER START 3 * 4 * The contents of this file are subject to the terms of the 5 * Common Development and Distribution License (the "License"). 6 * You may not use this file except in compliance with the License. 7 * 8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE --- 9 unchanged lines hidden (view full) --- 18 * 19 * CDDL HEADER END 20 */ 21 22/* 23 * Copyright 2006 Sun Microsystems, Inc. All rights reserved. 24 * Use is subject to license terms. 25 */ |
| 26/* 27 * Copyright (c) 2012 by Delphix. All rights reserved. 28 */ |
|
| 26 | 29 |
| 27#pragma ident "%Z%%M% %I% %E% SMI" 28 | |
| 29/* 30 * ASSERTION: 31 * Positive test for ring buffer policy. 32 * 33 * SECTION: Buffers and Buffering/ring Policy; 34 * Buffers and Buffering/Buffer Sizes; 35 * Options and Tunables/bufsize; 36 * Options and Tunables/bufpolicy 37 */ 38 39/* | 30/* 31 * ASSERTION: 32 * Positive test for ring buffer policy. 33 * 34 * SECTION: Buffers and Buffering/ring Policy; 35 * Buffers and Buffering/Buffer Sizes; 36 * Options and Tunables/bufsize; 37 * Options and Tunables/bufpolicy 38 */ 39 40/* |
| 40 * We make some regrettable assumptions about the implementation in this test. 41 * First, we assume that each entry for the printf() of an int takes _exactly_ 42 * eight bytes (four bytes for the EPID, four bytes for the payload). Second, 43 * we assume that by allocating storage for n + 1 records, we will get exactly 44 * n. Here is why: the final predicate that evaluates to false will reserve 45 * space that it won't use. This act of reservation will advance the wrapped 46 * offset. That record won't be subsequently used, but the wrapped offset has 47 * advanced. (And in this case, that old record is clobbered by the exit() 48 * anyway.) Thirdly: we rely on t_cpu/cpu_id. Finally: we rely on being 49 * able to run on the CPU that we first ran on. | 41 * We make some regrettable assumptions about the implementation in this 42 * test. First, we assume that each entry for the printf() of an int 43 * takes _exactly_ 16 bytes (4 bytes for the EPID, 8 bytes for the 44 * timestamp, 4 bytes for the payload). Second, we assume that by 45 * allocating storage for n + 1 records, we will get exactly n. Here is 46 * why: the final predicate that evaluates to false will reserve space 47 * that it won't use. This act of reservation will advance the wrapped 48 * offset. That record won't be subsequently used, but the wrapped 49 * offset has advanced. (And in this case, that old record is clobbered 50 * by the exit() anyway.) Thirdly: we rely on t_cpu/cpu_id. Finally: 51 * we rely on being able to run on the CPU that we first ran on. |
| 50 */ 51#pragma D option bufpolicy=ring | 52 */ 53#pragma D option bufpolicy=ring |
| 52#pragma D option bufsize=40 | 54#pragma D option bufsize=80 |
| 53#pragma D option quiet 54 55int n; 56 57BEGIN 58{ 59 cpuid = -1; 60} --- 18 unchanged lines hidden --- | 55#pragma D option quiet 56 57int n; 58 59BEGIN 60{ 61 cpuid = -1; 62} --- 18 unchanged lines hidden --- |