trunk/src/emu/debug/debugcpu.h
| r242114 | r242115 | |
|---|
| 514 | 514 | /* return the physical address corresponding to the given logical address */ |
| 515 | 515 | int debug_cpu_translate(address_space &space, int intention, offs_t *address); |
| 516 | 516 | |
| 517 | | /* return a byte from the the specified memory space */ |
| 517 | /* return a byte from the specified memory space */ |
| 518 | 518 | UINT8 debug_read_byte(address_space &space, offs_t address, int apply_translation); |
| 519 | 519 | |
| 520 | | /* return a word from the the specified memory space */ |
| 520 | /* return a word from the specified memory space */ |
| 521 | 521 | UINT16 debug_read_word(address_space &space, offs_t address, int apply_translation); |
| 522 | 522 | |
| 523 | | /* return a dword from the the specified memory space */ |
| 523 | /* return a dword from the specified memory space */ |
| 524 | 524 | UINT32 debug_read_dword(address_space &space, offs_t address, int apply_translation); |
| 525 | 525 | |
| 526 | | /* return a qword from the the specified memory space */ |
| 526 | /* return a qword from the specified memory space */ |
| 527 | 527 | UINT64 debug_read_qword(address_space &space, offs_t address, int apply_translation); |
| 528 | 528 | |
| 529 | 529 | /* return 1,2,4 or 8 bytes from the specified memory space */ |
trunk/src/emu/debug/debughlp.c
| r242114 | r242115 | |
|---|
| 237 | 237 | "\n" |
| 238 | 238 | " cheatinit [<address>,<length>[,<cpu>]] -- initialize the cheat search to the selected memory area\n" |
| 239 | 239 | " cheatrange <address>,<length> -- add to the cheat search the selected memory area\n" |
| 240 | | " cheatnext <condition>[,<comparisonvalue>] -- continue cheat search comparing with the the last value\n" |
| 241 | | " cheatnextf <condition>[,<comparisonvalue>] -- continue cheat search comparing with the the first value\n" |
| 240 | " cheatnext <condition>[,<comparisonvalue>] -- continue cheat search comparing with the last value\n" |
| 241 | " cheatnextf <condition>[,<comparisonvalue>] -- continue cheat search comparing with the first value\n" |
| 242 | 242 | " cheatlist [<filename>] -- show the list of cheat search matches or save them to <filename>\n" |
| 243 | 243 | " cheatundo -- undo the last cheat search (state only)\n" |
| 244 | 244 | }, |
trunk/src/emu/machine/wd_fdc.h
| r242114 | r242115 | |
|---|
| 238 | 238 | // Live states change continually depending on the disk contents |
| 239 | 239 | // until the next externally discernable event is found. They |
| 240 | 240 | // are checkpointing, run until an event is found, then they wait |
| 241 | | // for it. When an event eventually happen the the changes are |
| 241 | // for it. When an event eventually happens, the changes are |
| 242 | 242 | // either committed or replayed until the sync event time. |
| 243 | 243 | // |
| 244 | 244 | // The transition to IDLE is only done on a synced event. Some |
trunk/src/lib/libflac/include/FLAC/metadata.h
| r242114 | r242115 | |
|---|
| 665 | 665 | * |
| 666 | 666 | * - Create a new chain using FLAC__metadata_chain_new(). A chain is a |
| 667 | 667 | * linked list of FLAC metadata blocks. |
| 668 | | * - Read all metadata into the the chain from a FLAC file using |
| 668 | * - Read all metadata into the chain from a FLAC file using |
| 669 | 669 | * FLAC__metadata_chain_read() or FLAC__metadata_chain_read_ogg() and |
| 670 | 670 | * check the status. |
| 671 | 671 | * - Optionally, consolidate the padding using |
| r242114 | r242115 | |
|---|
| 1690 | 1690 | * For convenience, a trailing NUL is added to the entry if it doesn't have |
| 1691 | 1691 | * one already. |
| 1692 | 1692 | * |
| 1693 | | * Depending on the the value of \a all, either all or just the first comment |
| 1693 | * Depending on the value of \a all, either all or just the first comment |
| 1694 | 1694 | * whose field name(s) match the given entry's name will be replaced by the |
| 1695 | 1695 | * given entry. If no comments match, \a entry will simply be appended. |
| 1696 | 1696 | * |
trunk/src/lib/sqlite3/sqlite3.c
| r242114 | r242115 | |
|---|
| 64544 | 64544 | assert( mem1.zMalloc==0 ); |
| 64545 | 64545 | |
| 64546 | 64546 | /* rc==0 here means that one of the keys ran out of fields and |
| 64547 | | ** all the fields up to that point were equal. Return the the default_rc |
| 64547 | ** all the fields up to that point were equal. Return the default_rc |
| 64548 | 64548 | ** value. */ |
| 64549 | 64549 | return pPKey2->default_rc; |
| 64550 | 64550 | } |
| r242114 | r242115 | |
|---|
| 64907 | 64907 | assert( mem1.zMalloc==0 ); |
| 64908 | 64908 | |
| 64909 | 64909 | /* rc==0 here means that one or both of the keys ran out of fields and |
| 64910 | | ** all the fields up to that point were equal. Return the the default_rc |
| 64910 | ** all the fields up to that point were equal. Return the default_rc |
| 64911 | 64911 | ** value. */ |
| 64912 | 64912 | assert( CORRUPT_DB |
| 64913 | 64913 | || pPKey2->default_rc==vdbeRecordCompareDebug(nKey1, pKey1, pPKey2) |
| r242114 | r242115 | |
|---|
| 77813 | 77813 | ** Note that with flags==EXPRDUP_REDUCE, this routines works on full-size |
| 77814 | 77814 | ** (unreduced) Expr objects as they or originally constructed by the parser. |
| 77815 | 77815 | ** During expression analysis, extra information is computed and moved into |
| 77816 | | ** later parts of teh Expr object and that extra information might get chopped |
| 77816 | ** later parts of the Expr object and that extra information might get chopped |
| 77817 | 77817 | ** off if the expression is reduced. Note also that it does not work to |
| 77818 | 77818 | ** make a EXPRDUP_REDUCE copy of a reduced expression. It is only legal |
| 77819 | 77819 | ** to reduce a pristine expression tree from the parser. The implementation |
| r242114 | r242115 | |
|---|
| 82529 | 82529 | ** in the index (N). The second argument (C) is only used for STAT3 and STAT4. |
| 82530 | 82530 | ** |
| 82531 | 82531 | ** This routine allocates the Stat4Accum object in heap memory. The return |
| 82532 | | ** value is a pointer to the the Stat4Accum object encoded as a blob (i.e. |
| 82532 | ** value is a pointer to the Stat4Accum object encoded as a blob (i.e. |
| 82533 | 82533 | ** the size of the blob is sizeof(void*) bytes). |
| 82534 | 82534 | */ |
| 82535 | 82535 | static void statInit( |
| r242114 | r242115 | |
|---|
| 86366 | 86366 | ** no rowid btree for a WITHOUT ROWID. Instead, the canonical |
| 86367 | 86367 | ** data storage is a covering index btree. |
| 86368 | 86368 | ** (2) Bypass the creation of the sqlite_master table entry |
| 86369 | | ** for the PRIMARY KEY as the the primary key index is now |
| 86369 | ** for the PRIMARY KEY as the primary key index is now |
| 86370 | 86370 | ** identified by the sqlite_master table entry of the table itself. |
| 86371 | 86371 | ** (3) Set the Index.tnum of the PRIMARY KEY Index object in the |
| 86372 | 86372 | ** schema to the rootpage from the main table. |
trunk/src/lib/winpcap/Packet32.h
| r242114 | r242115 | |
|---|
| 135 | 135 | ///< from the beginning of the current capture. This value includes the packets |
| 136 | 136 | ///< lost by the driver. |
| 137 | 137 | UINT bs_drop; ///< number of packets that the driver lost from the beginning of a capture. |
| 138 | | ///< Basically, a packet is lost when the the buffer of the driver is full. |
| 138 | ///< Basically, a packet is lost when the buffer of the driver is full. |
| 139 | 139 | ///< In this situation the packet cannot be stored and the driver rejects it. |
| 140 | 140 | UINT ps_ifdrop; ///< drops by interface. XXX not yet supported |
| 141 | 141 | UINT bs_capt; ///< number of packets that pass the filter, find place in the kernel buffer and |
trunk/src/lib/zlib/deflate.c
| r242114 | r242115 | |
|---|
| 160 | 160 | |
| 161 | 161 | /* =========================================================================== |
| 162 | 162 | * Update a hash value with the given input byte |
| 163 | | * IN assertion: all calls to to UPDATE_HASH are made with consecutive |
| 163 | * IN assertion: all calls to UPDATE_HASH are made with consecutive |
| 164 | 164 | * input characters, so that a running hash key can be computed from the |
| 165 | 165 | * previous key instead of complete recalculation each time. |
| 166 | 166 | */ |
| r242114 | r242115 | |
|---|
| 173 | 173 | * the previous length of the hash chain. |
| 174 | 174 | * If this file is compiled with -DFASTEST, the compression level is forced |
| 175 | 175 | * to 1, and no hash chains are maintained. |
| 176 | | * IN assertion: all calls to to INSERT_STRING are made with consecutive |
| 176 | * IN assertion: all calls to INSERT_STRING are made with consecutive |
| 177 | 177 | * input characters and the first MIN_MATCH bytes of str are valid |
| 178 | 178 | * (except for the last MIN_MATCH-1 bytes of the input file). |
| 179 | 179 | */ |
trunk/src/mame/audio/bzone.c
| r242114 | r242115 | |
|---|
| 339 | 339 | 5.0 * RES_VOLTAGE_DIVIDER(BZ_R7, BZ_R6), /* INP0 */ |
| 340 | 340 | 5.0 * RES_VOLTAGE_DIVIDER(BZ_R7, RES_2_PARALLEL(CD4066_R_ON + BZ_R5, BZ_R6))) /* INP1 */ |
| 341 | 341 | /* R5, R6, R7 all affect the following circuit charge discharge rates */ |
| 342 | | /* they are not emulated as their effect is less the the 5% component tolerance */ |
| 342 | /* they are not emulated as their effect is less than the 5% component tolerance */ |
| 343 | 343 | DISCRETE_RCDISC3(NODE_62, /* IC K5, pin 7 */ |
| 344 | 344 | 1, NODE_61, BZ_R8, BZ_R9, BZ_C13, -0.5) |
| 345 | 345 | |
trunk/src/mame/drivers/halleys.c
| r242114 | r242115 | |
|---|
| 798 | 798 | Each star map is generated by two data sets pointed by the second source |
| 799 | 799 | address. The first 256-byte set has scattered bits to reflect the star |
| 800 | 800 | population while the second 256-byte set appears to have random values. |
| 801 | | When the game runs the the star fields are updated a small portion at a |
| 802 | | time by a third data set containing gradient patterns which may indicate |
| 803 | | gray shades or alpha levels. |
| 801 | When the game runs the star fields are updated a small portion at a time |
| 802 | by a third data set containing gradient patterns which may indicate gray |
| 803 | shades or alpha levels. |
| 804 | 804 | |
| 805 | 805 | Halley's Comet draws and clears the two star fields as if they are |
| 806 | 806 | independent from the backgrounds, making it a total of four scrollable |
trunk/src/mame/drivers/wheelfir.c
| r242114 | r242115 | |
|---|
| 13 | 13 | - various gfx size/pos glitches (gaps, extra rows of pixels here and there) |
| 14 | 14 | - real gfx zoom, based on the zoom params, not lookup table |
| 15 | 15 | - apply double buffering (sometimes gfx is displayed at y+256 every other frame (extra bits are currently masked out)) |
| 16 | | - fix road/sky (extra bits in teh scroll reg. are there two bitmap buffers? ) |
| 16 | - fix road/sky (extra bits in the scroll reg. are there two bitmap buffers? ) |
| 17 | 17 | - bitmap layer clearing |
| 18 | 18 | - fix wrong coords of sprites rendered into the bitmap layer (intro car) |
| 19 | 19 | - is toggle_bit really a vblank bit ? or somethign else (blitter status ?) |
trunk/src/mame/machine/decocass_tape.c
| r242114 | r242115 | |
|---|
| 25 | 25 | /* Note on a tapes leader-BOT-data-EOT-trailer format: |
| 26 | 26 | * A cassette has a transparent piece of tape on both ends, |
| 27 | 27 | * leader and trailer. And data tapes also have BOT and EOT |
| 28 | | * holes, shortly before the the leader and trailer. |
| 28 | * holes, shortly before the leader and trailer. |
| 29 | 29 | * The holes and clear tape are detected using a photo-resitor. |
| 30 | 30 | * When rewinding, the BOT/EOT signal will show a short |
| 31 | 31 | * pulse and if rewind continues a constant high signal later. |
trunk/src/mame/machine/fd1094.c
| r242114 | r242115 | |
|---|
| 63 | 63 | that changes at every address. To prevent that double use, the CPU fetches |
| 64 | 64 | the 8-bit key from a different place when decrypting words 0-3, but this only |
| 65 | 65 | happens after wrapping around at least once; when decrypting the first four |
| 66 | | words of memory, which correspond the the initial SP and initial PC vectors, |
| 66 | words of memory, which correspond to the initial SP and initial PC vectors, |
| 67 | 67 | the 8-bit key is taken from bytes 0-3 of RAM. Instead, when fetching the |
| 68 | 68 | vectors, the global key is handled differently, to prevent double use of |
| 69 | 69 | those bytes. But this special handling of the global key doesn't apply to |
trunk/src/mame/video/segag80r.c
| r242114 | r242115 | |
|---|
| 421 | 421 | |
| 422 | 422 | WRITE8_MEMBER(segag80r_state::monsterb_videoram_w) |
| 423 | 423 | { |
| 424 | | /* accesses to the the area $f040-$f07f go to background palette if */ |
| 424 | /* accesses to the area $f040-$f07f go to background palette if */ |
| 425 | 425 | /* the palette access enable bit is set */ |
| 426 | 426 | if ((offset & 0x1fc0) == 0x1040 && (m_video_control & 0x40)) |
| 427 | 427 | { |
| r242114 | r242115 | |
|---|
| 491 | 491 | |
| 492 | 492 | WRITE8_MEMBER(segag80r_state::pignewt_videoram_w) |
| 493 | 493 | { |
| 494 | | /* accesses to the the area $f040-$f07f go to background palette if */ |
| 494 | /* accesses to the area $f040-$f07f go to background palette if */ |
| 495 | 495 | /* the palette access enable bit is set */ |
| 496 | 496 | if ((offset & 0x1fc0) == 0x1040 && (m_video_control & 0x02)) |
| 497 | 497 | { |
| r242114 | r242115 | |
|---|
| 574 | 574 | |
| 575 | 575 | WRITE8_MEMBER(segag80r_state::sindbadm_videoram_w) |
| 576 | 576 | { |
| 577 | | /* accesses to the the area $f000-$f03f go to background palette if */ |
| 577 | /* accesses to the area $f000-$f03f go to background palette if */ |
| 578 | 578 | /* the palette access enable bit is set */ |
| 579 | 579 | if ((offset & 0x1fc0) == 0x1000 && (m_video_control & 0x02)) |
| 580 | 580 | { |