1/*
2 * Copyright (c) 2006 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
--- 48 unchanged lines hidden (view full) ---
57 STATE_R12,
58 STATE_R13,
59 STATE_SP = STATE_R13,
60 STATE_R14,
61 STATE_LR = STATE_R14,
62 STATE_R15,
63 STATE_PC = STATE_R15,
64 STATE_CPSR,
65 STATE_NUMVALS
66 };
67
68 protected:
69 struct ThreadState {
70 bool changed[STATE_NUMVALS];
71 uint32_t state[2][STATE_NUMVALS];
72 uint32_t *newState;
73 uint32_t *oldState;
74 int current;
75 void update(NativeTrace *parent);
76 void update(ThreadContext *tc);
77
78 ThreadState()
79 {
80 for (int i = 0; i < STATE_NUMVALS; i++) {
81 changed[i] = false;
--- 31 unchanged lines hidden ---
2 * Copyright (c) 2006 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
--- 48 unchanged lines hidden (view full) ---
57 STATE_R12,
58 STATE_R13,
59 STATE_SP = STATE_R13,
60 STATE_R14,
61 STATE_LR = STATE_R14,
62 STATE_R15,
63 STATE_PC = STATE_R15,
64 STATE_CPSR,
65 STATE_NUMVALS
66 };
67
68 protected:
69 struct ThreadState {
70 bool changed[STATE_NUMVALS];
71 uint32_t state[2][STATE_NUMVALS];
72 uint32_t *newState;
73 uint32_t *oldState;
74 int current;
75 void update(NativeTrace *parent);
76 void update(ThreadContext *tc);
77
78 ThreadState()
79 {
80 for (int i = 0; i < STATE_NUMVALS; i++) {
81 changed[i] = false;
--- 31 unchanged lines hidden ---