d7samurai

Minimal D3D11 bonus material: extra minimal triangle

A quick side exercise to see how little code one can get away with to put that RGB triangle on screen using D3D11 (without bending over backwards with trickery). This is a complete app in < 40 LOC (including the HLSL).

For more.. elaborate.. D3D11 reference code, see the original Minimal D3D11, Minimal D3D11 pt2 and Minimal D3D11 pt3

vmartins

MAME Arcade Roms

Download all (torrent)

Next >

File	Name	Developer	Date
005.zip	005	Sega	1981
100lions.zip

thefranke

{
    "createdBy": "Redirector v3.5.3",
    "createdAt": "2023-05-24T14:38:35.748Z",
    "redirects": [
        {
            "description": "Wikipedia -> Wikiless",
            "exampleUrl": "https://en.wikipedia.org/wiki/XYZ",
            "exampleResult": "https://farside.link/wikiless/wiki/XYZ",
            "error": null,
            "includePattern": "*wikipedia.org/*",

pervognsen

// We have five kinds of nodes: literal, negate, not, add, xor.
// In this case we only need 3 bits for the tag but you can use as many as you need.

enum Tag {
    LIT,
    NEG,
    NOT,
    ADD,
    XOR,
};

pervognsen

struct Object {
    Key key; // The key is any piece of data that uniquely identifies the object.
    // ...
};

struct Handle {
    Key key;
    Index index; // This caches a speculative table index for an object with the corresponding key.
};

hagsteel

set background=dark 

highlight clear SignColumn
highlight ColorColumn  ctermbg=234
highlight LineNr       ctermbg=234 ctermfg=14
highlight CursorLineNr ctermbg=23 ctermfg=7
highlight CursorLine   ctermbg=236
highlight StatusLineNC ctermbg=238 ctermfg=0
highlight StatusLine   ctermbg=240 ctermfg=12
highlight IncSearch    ctermbg=3   ctermfg=1

DavidBuchanan314

          #define F\
          for(i=l;i\
          <l*4; i++)
          main(){int
          i,j,w=512,
                    n,l=w*w,o[
                    ]={~w,-w,-
                    w+1,-1,1,w
                    -1,w,w+1},
                    b[l*5];F b

the6p4c

#include <stdio.h>
#include <string.h>
#include <stdint.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <sys/io.h>
#include <sys/mman.h>
#include "elf.h"

pervognsen

Per,

Patching inline-caches is rare, so taking a lock & doing single-threaded updates is fine. No CAS needed for performance, nor is false-sharing an issue (this data is also code, so nearly always resides with other read-only code).

Patching typically covers a bunch of X86 ops, at least 2 but maybe 3 or 4, depending. If any of the updates to these words happens on partial instructions, a racing other CPU might see a partial update.

Patching covers a set of X86 instruction words, more than fits in an 8-byte CAS. 16-byte CAS's must be aligned properly.

Putting all this together, these constraints imply:

• Updates are done via CAS covering whole instructions. No CAS spans a partial instruction.

zwegner

from fractions import Fraction

ascii = range(0, 0x80)
cont = range(0x80, 0xC0)
cont_2_0 = range(0xA0, 0xC0)
cont_2_2 = range(0x80, 0xA0)
cont_3_0 = range(0x90, 0xC0)
cont_3_2 = range(0x80, 0x90)
leader2 = range(0xC2, 0xE0)
leader3_0 = range(0xE0, 0xE1)