Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!elroy.jpl.nasa.gov!decwrl!uunet!nih-csl!lhc!adm!smoke!gwyn
From: gwyn@smoke.brl.mil (Doug Gwyn)
Newsgroups: comp.lang.c
Subject: Re: memcpy()-like move to odd bit
Message-ID: <14449@smoke.brl.mil>
Date: 13 Nov 90 07:06:15 GMT
References: <1990Nov12.235038.16331@nntp-server.caltech.edu>
Organization: U.S. Army Ballistic Research Laboratory, APG, MD.
Lines: 11

In article <1990Nov12.235038.16331@nntp-server.caltech.edu> manning@nntp-server.caltech.edu (Evan Marshall Manning) writes:
>The title about says it.  I need to move data from point A to
>point B, where there may be a bit offset as well as a byte offset.
>Is there any reasonably portable and/or reasonably fast way to do
>this?

This is known as a "bit blit" (special case of "rasterop"), and
algorithms are described in the computer graphics literature.
For example, there was an article in "Software -- Practice and
Experience" by Locanthi and Pike on the method used in the Blit
terminal.