bit bashing - meaning and definition. What is bit bashing
Online Dictionary

What (who) is bit bashing - definition

Bit twiddle; Bit bashing; Bit twiddling; Bit diddling; Bit twisting; Bit fiddling; Bit fiddle; Bit diddle; Bit twistle; Bit bash; Bit wrangling; Bit wrangle; Bit mangling; Bit mangle; Bit hustling; Bit hustle; Twiddling of bits; Wrangling of bits; Mangling of bits; Bashing of bits; Diddling of bits; Twisting of bits; Fiddling of bits; Hustling of bits; Twiddling bits; Wrangling bits; Mangling bits; Bashing bits; Diddling bits; Twisting bits; Fiddling bits; Hustling bits

bit bashing         
(Also "bit diddling" or bit twiddling). Any of several kinds of low-level programming characterised by manipulation of bit, flag, nibble, and other smaller-than-character-sized pieces of data. These include low-level device control, encryption algorithms, checksum and error-correcting codes, hash functions, some flavours of graphics programming (see bitblt), and assembler/compiler code generation. May connote either tedium or a real technical challenge (more usually the former). "The command decoding for the new tape driver looks pretty solid but the bit-bashing for the control registers still has bugs." See also bit bang, mode bit.
bit diddling         
bit twiddling         
1. (pejorative) An exercise in tuning (see tune) in which incredible amounts of time and effort go to produce little noticeable improvement, often with the result that the code becomes incomprehensible. 2. Aimless small modification to a program, especially for some pointless goal. 3. bit bashing, especially used for the act of frobbing the device control register of a peripheral in an attempt to get it back to a known state. [Jargon File]


Bit manipulation

Bit manipulation is the act of algorithmically manipulating bits or other pieces of data shorter than a word. Computer programming tasks that require bit manipulation include low-level device control, error detection and correction algorithms, data compression, encryption algorithms, and optimization. For most other tasks, modern programming languages allow the programmer to work directly with abstractions instead of bits that represent those abstractions. Source code that does bit manipulation makes use of the bitwise operations: AND, OR, XOR, NOT, and possibly other operations analogous to the boolean operators; there are also bit shifts and operations to count ones and zeros, find high and low one or zero, set, reset and test bits, extract and insert fields, mask and zero fields, gather and scatter bits to and from specified bit positions or fields. Integer arithmetic operators can also effect bit-operations in conjunction with the other operators.

Bit manipulation, in some cases, can obviate or reduce the need to loop over a data structure and can give many-fold speed ups, as bit manipulations are processed in parallel.