arti/vt1200
1
0 Fork 1
mirror of https://git.k-space.ee/arti/vt1200.git synced 2026-11-03 12:33:16 +02:00
Code Wiki Activity
Files
17dfd24340fe3346433f90457cb48cb8786dff39
vt1200/xie/xc/programs/Xserver/XIE/dixie/process/ppoint.c
T
arti d8d54bb990 feat(xie): a client-chosen XIE image is displayed on the VT1200 
The XIE path now runs end to end: XieCreateImage -> XieCreatePhoto ->
XiePutTile -> XieExport(photomap -> depth-1 pixmap) -> XCopyArea(pixmap ->
window), and the client's tile appears on screen at the client's own window
position, pixel-exact.

TWO FAULTS BEHIND THE LONG DEAD END

1. Device model (harness/mame/vt1200.cpp, opt-in VT1200_ACCEL=1).  The
   accelerator's output port 0x5600200 returns the pixel stream the firmware
   pushed into the FIFO -- the firmware then stores it into the drawable itself
   (file 0x125528: MOVE *B6,*B1 ; ADDK 0x10,B1).  The FIFO read pointer was
   never reset between transfers, so consecutive exports read stale words and
   the same fill produced 759 then 516 set pixels.  Reset m_fifo_in/out on the
   data-register write; the export is now deterministic.

2. Measurement, not the device.
   - dwt/screenshot.py without --real reads 1024x1024 at a 128-byte row stride,
     but the VR319 default programs 1280x1024 at a 2048-bit (256-byte) pitch.
     That is the "shifted" picture; --real is the correct read.
   - The earlier "0 differing bytes over 128 KiB" VRAM comparison stepped peek
     by 1024 *bit* addresses, so it scanned rows 0..63 only -- never the window
     at rows 200..263.  Over the real raster the white/black diff is 576 bytes
     spanning exactly those rows.
   - New instrument: decclient does a server-side XGetImage readback of the
     pixmap and window and counts set pixels.  That separated "the server never
     drew it" from "the framebuffer view is wrong".

EVIDENCE (reproduced twice, the second time from a fresh machine)

  no export vs 0xFF : 4096 / 4096 pixels differ
  no export vs 0x00 :    0 / 4096   (the window background is black)
  0xFF      vs 0x00 : 4096 / 4096
  0xAA      vs 0x0F : 2048 / 4096   (the two stripe phases)

Tile byte 0xAA reproduces as 1-pixel vertical stripes, 0x0F as 4-pixel, with
no shear -- so the placement is right and the pixels are the client's.

Contents: xie/ holds DEC XIE 2.3 headers, 84 man pages and complete
client+server source; a libXie.a and decclient built from DEC's own code; the
XIE probes; and evidence/ with every measurement, including explicit
retractions of the earlier wrong readings (VRAM_IDENTICAL_FOR_BOTH_FILLS and
friends).  xie/evidence/XIE_IMAGE_DISPLAYED.md is the report; frames are in
xie/evidence/png/.

The accelerator model stays opt-in: it answers the status poll and relays the
pixel stream, but performs no compositing, so it is a stand-in and the verified
default configuration is unchanged (a no-env run still parks in the level-0
diagnostics menu at PC=3FDCE400).
2026-11-01 23:22:25 +02:00

316 lines
10 KiB
C
Raw Blame History

/* $XConsortium: ppoint.c,v 1.4 94/04/17 20:33:51 rws Exp $ */
/**** module ppoint.c ****/
/******************************************************************************
Copyright (c) 1993, 1994 X Consortium
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
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. IN NO EVENT SHALL THE
X CONSORTIUM 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 the X Consortium shall not be
used in advertising or otherwise to promote the sale, use or other dealings
in this Software without prior written authorization from the X Consortium.
NOTICE
This software is being provided by AGE Logic, Inc. under the
following license. By obtaining, using and/or copying this software,
you agree that you have read, understood, and will comply with these
terms and conditions:
Permission to use, copy, modify, distribute and sell this
software and its documentation for any purpose and without
fee or royalty and to grant others any or all rights granted
herein is hereby granted, provided that you agree to comply
with the following copyright notice and statements, including
the disclaimer, and that the same appears on all copies and
derivative works of the software and documentation you make.
"Copyright 1993, 1994 by AGE Logic, Inc."
THIS SOFTWARE IS PROVIDED "AS IS". AGE LOGIC MAKES NO
REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED. By way of
example, but not limitation, AGE LOGIC MAKE NO
REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS
FOR ANY PARTICULAR PURPOSE OR THAT THE SOFTWARE DOES NOT
INFRINGE THIRD-PARTY PROPRIETARY RIGHTS. AGE LOGIC
SHALL BEAR NO LIABILITY FOR ANY USE OF THIS SOFTWARE. IN NO
EVENT SHALL EITHER PARTY BE LIABLE FOR ANY INDIRECT,
INCIDENTAL, SPECIAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOSS
OF PROFITS, REVENUE, DATA OR USE, INCURRED BY EITHER PARTY OR
ANY THIRD PARTY, WHETHER IN AN ACTION IN CONTRACT OR TORT OR
BASED ON A WARRANTY, EVEN IF AGE LOGIC LICENSEES
HEREUNDER HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES.
The name of AGE Logic, Inc. may not be used in
advertising or publicity pertaining to this software without
specific, written prior permission from AGE Logic.
Title to this software shall at all times remain with AGE
Logic, Inc.
*****************************************************************************
ppoint.c -- DIXIE routines for managing the Point element
Robert NC Shelley -- AGE Logic, Inc. April 1993
Ben Fahy -- AGE Logic, Inc. May 1993
*****************************************************************************/
#define _XIEC_PPOINT
#define _XIEC_POINT
/*
* Include files
*/
#include <stdio.h>
/*
* Core X Includes
*/
#include <X.h>
#include <Xproto.h>
/*
* XIE Includes
*/
#include <XIE.h>
#include <XIEproto.h>
/*
* more X server includes.
*/
#include <misc.h>
#include <dixstruct.h>
/*
* Server XIE Includes
*/
#include <corex.h>
#include <macro.h>
#include <element.h>
#include <error.h>
/*
* routines referenced by other modules.
*/
peDefPtr MakePoint();
/*
* routines internal to this module
*/
static Bool PrepPoint();
/*
* dixie entry points
*/
static diElemVecRec pPointVec = {
PrepPoint /* prepare for analysis and execution */
};
/*------------------------------------------------------------------------
----------------------- routine: make a point element --------------------
------------------------------------------------------------------------*/
peDefPtr MakePoint(flo,tag,pe)
floDefPtr flo;
xieTypPhototag tag;
xieFlo *pe;
{
int inputs;
peDefPtr ped;
inFloPtr inFlo;
ELEMENT(xieFloPoint);
ELEMENT_SIZE_MATCH(xieFloPoint);
ELEMENT_NEEDS_2_INPUTS(src,lut);
inputs = stuff->domainPhototag ? 3 : 2;
if(!(ped = MakePEDef(inputs, (CARD32)stuff->elemLength<<2, 0)))
FloAllocError(flo,tag,xieElemPoint, return(NULL)) ;
ped->diVec = &pPointVec;
ped->phototag = tag;
ped->flags.process = TRUE;
raw = (xieFloPoint *)ped->elemRaw;
/*
* copy the client element parameters (swap if necessary)
*/
if( flo->reqClient->swapped ) {
raw->elemType = stuff->elemType;
raw->elemLength = stuff->elemLength;
cpswaps(stuff->src, raw->src);
cpswaps(stuff->lut, raw->lut);
cpswapl(stuff->domainOffsetX, raw->domainOffsetX);
cpswapl(stuff->domainOffsetY, raw->domainOffsetY);
cpswaps(stuff->domainPhototag,raw->domainPhototag);
raw->bandMask = stuff->bandMask;
}
else
memcpy((char *)raw, (char *)stuff, sizeof(xieFloPoint));
/*
* assign phototags to inFlos
*/
inFlo = ped->inFloLst;
inFlo[SRCtag].srcTag = raw->src;
inFlo[LUTtag].srcTag = raw->lut;
if(raw->domainPhototag)
#if XIE_FULL
inFlo[ped->inCnt-1].srcTag = raw->domainPhototag;
#else
DomainError(flo,ped,raw->domainPhototag, return(ped));
#endif
return(ped);
} /* end MakePoint */
/*------------------------------------------------------------------------
---------------- routine: prepare for analysis and execution -------------
------------------------------------------------------------------------*/
static Bool PrepPoint(flo,ped)
floDefPtr flo;
peDefPtr ped;
{
xieFloPoint *raw = (xieFloPoint *)ped->elemRaw;
inFloPtr indom,inlut= &ped->inFloLst[LUTtag],insrc = &ped->inFloLst[SRCtag];
outFloPtr outdom, outlut= &inlut->srcDef->outFlo,
outsrc= &insrc->srcDef->outFlo;
outFloPtr dst = &ped->outFlo;
int b;
/* propage band attributes */
insrc->bands = outsrc->bands;
inlut->bands = outlut->bands;
dst->bands = outlut->bands; /* see V4.12 spec, page 6-2 */
/* if process domain src and lut class must match */
if (raw->domainPhototag && insrc->bands != inlut->bands)
MatchError(flo,ped, return(FALSE));
/* check to make sure input image is constrained, and lut is a lut */
if(IsntConstrained(outsrc->format[0].class) ||
IsntLut(outlut->format[0].class) )
MatchError(flo,ped, return(FALSE));
/* propagate outflo format of src to our inflo for src */
for (b=0; b<outsrc->bands; ++b)
insrc->format[b] = outsrc->format[b];
/* propagate outflo format of lut to our inflo for lut */
for (b=0; b<inlut->bands; ++b)
inlut->format[b] = outlut->format[b];
/* do same with process domain, if it is specified */
if(raw->domainPhototag) {
indom = &ped->inFloLst[ped->inCnt-1];
outdom = &indom->srcDef->outFlo;
if(IsntDomain(outdom->format[0].class) ||
(indom->bands = outdom->bands) != 1)
DomainError(flo,ped,raw->domainPhototag, return(FALSE));
indom->format[0] = outdom->format[0];
} else
outdom = NULL;
/*** Painful enumeration of cases ***/
if (outlut->bands == 1 && outsrc->bands == 3) {
int level_product;
/* Width and heights of all bands must match */
if (insrc->format[0].width != insrc->format[1].width ||
insrc->format[1].width != insrc->format[2].width ||
insrc->format[0].height != insrc->format[1].height ||
insrc->format[1].height != insrc->format[2].height)
MatchError(flo,ped, return(FALSE));
/* make tripleband src into CRAZY PIXELS! produce singleband */
if ((raw->bandMask !=7) || (outdom != NULL))
MatchError(flo,ped, return(FALSE)); /* see p7-25 of v4.12 spec */
/* check to make sure length of lut is sufficient */
level_product = insrc->format[0].levels *
insrc->format[1].levels *
insrc->format[2].levels;
if (inlut->format[0].height < level_product)
MatchError(flo,ped, return(FALSE));
dst->format[0] = insrc->format[0];
dst->format[0].levels = inlut->format[0].levels;
if (!UpdateFormatfromLevels(ped))
MatchError(flo,ped, return(FALSE));
}
else if (outlut->bands == 3 && outsrc->bands == 1) {
/* apply lut for each band to src */
/* this variation does not support Domains. */
if (outdom != NULL)
MatchError(flo,ped, return(FALSE));
/* destination format will be close to insrc, but not same */
for(b = 0; b < dst->bands; b++) {
dst->format[b] = insrc->format[0];
dst->format[b].band = b;
if ((raw->bandMask & (1<<b)) == 0) continue;
dst->format[b].levels = inlut->format[b].levels;
if (inlut->format[b].height < insrc->format[0].levels)
MatchError(flo,ped, return(FALSE));
}
if (!UpdateFormatfromLevels(ped))
MatchError(flo,ped, return(FALSE));
}
else if (outlut->bands == outsrc->bands &&
(outlut->bands == 3 || outlut->bands == 1) ) {
/* apply lut for each band to src of each band */
for(b = 0; b < dst->bands; b++) {
dst->format[b] = insrc->format[b];
if ((raw->bandMask & (1<<b)) == 0) continue;
dst->format[b].levels = inlut->format[b].levels;
/* check to make sure length of lut is sufficient */
if (inlut->format[b].height < insrc->format[b].levels)
MatchError(flo,ped, return(FALSE));
/* if domain is used, lut levels must be == src levels */
/* (or else we don't know what to do with pass-thru data */
if (outdom != NULL)
if (inlut->format[b].levels != insrc->format[b].levels)
MatchError(flo,ped, return(FALSE));
}
if (!UpdateFormatfromLevels(ped))
MatchError(flo,ped, return(FALSE));
}
else {
/* is this possible? */
ImplementationError(flo,ped,return(FALSE));
}
return(TRUE);
} /* end PrepPoint */
/* end module ppoint.c */
View Git Blame Copy Permalink