Merge remote-tracking branch 'origin/style' into riscv-compliance
This commit is contained in:
commit
d673062291
|
@ -50,5 +50,7 @@ matrix:
|
||||||
- binutils-mingw-w64-i686 gcc-mingw-w64-i686 g++-mingw-w64-i686
|
- binutils-mingw-w64-i686 gcc-mingw-w64-i686 g++-mingw-w64-i686
|
||||||
|
|
||||||
script:
|
script:
|
||||||
|
- set -o pipefail
|
||||||
|
- git diff `git merge-base master HEAD` | ./tools/scripts/checkpatch.pl -
|
||||||
- ./bootstrap && ./configure --enable-remote-bitbang --enable-jtag_vpi $CONFIGURE_ARGS && make
|
- ./bootstrap && ./configure --enable-remote-bitbang --enable-jtag_vpi $CONFIGURE_ARGS && make
|
||||||
- file src/$EXECUTABLE
|
- file src/$EXECUTABLE
|
||||||
|
|
|
@ -607,11 +607,11 @@ struct algorithm_steps {
|
||||||
uint8_t **steps;
|
uint8_t **steps;
|
||||||
};
|
};
|
||||||
|
|
||||||
static struct algorithm_steps *as_new(unsigned size)
|
static struct algorithm_steps *as_new(void)
|
||||||
{
|
{
|
||||||
struct algorithm_steps *as = calloc(1, sizeof(struct algorithm_steps));
|
struct algorithm_steps *as = calloc(1, sizeof(struct algorithm_steps));
|
||||||
as->size = size;
|
as->size = 8;
|
||||||
as->steps = calloc(size, sizeof(as->steps[0]));
|
as->steps = malloc(as->size * sizeof(as->steps[0]));
|
||||||
return as;
|
return as;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -701,17 +701,27 @@ static unsigned as_compile(struct algorithm_steps *as, uint8_t *target,
|
||||||
return offset;
|
return offset;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static void as_add_step(struct algorithm_steps *as, uint8_t *step)
|
||||||
|
{
|
||||||
|
if (as->used == as->size) {
|
||||||
|
as->size *= 2;
|
||||||
|
as->steps = realloc(as->steps, sizeof(as->steps[0]) * as->size);
|
||||||
|
LOG_DEBUG("Increased size to 0x%x", as->size);
|
||||||
|
}
|
||||||
|
as->steps[as->used] = step;
|
||||||
|
as->used++;
|
||||||
|
}
|
||||||
|
|
||||||
static void as_add_tx(struct algorithm_steps *as, unsigned count, const uint8_t *data)
|
static void as_add_tx(struct algorithm_steps *as, unsigned count, const uint8_t *data)
|
||||||
{
|
{
|
||||||
LOG_DEBUG("count=%d", count);
|
LOG_DEBUG("count=%d", count);
|
||||||
while (count > 0) {
|
while (count > 0) {
|
||||||
unsigned step_count = MIN(count, 255);
|
unsigned step_count = MIN(count, 255);
|
||||||
assert(as->used < as->size);
|
uint8_t *step = malloc(step_count + 2);
|
||||||
as->steps[as->used] = malloc(step_count + 2);
|
step[0] = STEP_TX;
|
||||||
as->steps[as->used][0] = STEP_TX;
|
step[1] = step_count;
|
||||||
as->steps[as->used][1] = step_count;
|
memcpy(step + 2, data, step_count);
|
||||||
memcpy(as->steps[as->used] + 2, data, step_count);
|
as_add_step(as, step);
|
||||||
as->used++;
|
|
||||||
data += step_count;
|
data += step_count;
|
||||||
count -= step_count;
|
count -= step_count;
|
||||||
}
|
}
|
||||||
|
@ -726,37 +736,33 @@ static void as_add_tx1(struct algorithm_steps *as, uint8_t byte)
|
||||||
|
|
||||||
static void as_add_write_reg(struct algorithm_steps *as, uint8_t offset, uint8_t data)
|
static void as_add_write_reg(struct algorithm_steps *as, uint8_t offset, uint8_t data)
|
||||||
{
|
{
|
||||||
assert(as->used < as->size);
|
uint8_t *step = malloc(3);
|
||||||
as->steps[as->used] = malloc(3);
|
step[0] = STEP_WRITE_REG;
|
||||||
as->steps[as->used][0] = STEP_WRITE_REG;
|
step[1] = offset;
|
||||||
as->steps[as->used][1] = offset;
|
step[2] = data;
|
||||||
as->steps[as->used][2] = data;
|
as_add_step(as, step);
|
||||||
as->used++;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
static void as_add_txwm_wait(struct algorithm_steps *as)
|
static void as_add_txwm_wait(struct algorithm_steps *as)
|
||||||
{
|
{
|
||||||
assert(as->used < as->size);
|
uint8_t *step = malloc(1);
|
||||||
as->steps[as->used] = malloc(1);
|
step[0] = STEP_TXWM_WAIT;
|
||||||
as->steps[as->used][0] = STEP_TXWM_WAIT;
|
as_add_step(as, step);
|
||||||
as->used++;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
static void as_add_wip_wait(struct algorithm_steps *as)
|
static void as_add_wip_wait(struct algorithm_steps *as)
|
||||||
{
|
{
|
||||||
assert(as->used < as->size);
|
uint8_t *step = malloc(1);
|
||||||
as->steps[as->used] = malloc(1);
|
step[0] = STEP_WIP_WAIT;
|
||||||
as->steps[as->used][0] = STEP_WIP_WAIT;
|
as_add_step(as, step);
|
||||||
as->used++;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
static void as_add_set_dir(struct algorithm_steps *as, bool dir)
|
static void as_add_set_dir(struct algorithm_steps *as, bool dir)
|
||||||
{
|
{
|
||||||
assert(as->used < as->size);
|
uint8_t *step = malloc(2);
|
||||||
as->steps[as->used] = malloc(2);
|
step[0] = STEP_SET_DIR;
|
||||||
as->steps[as->used][0] = STEP_SET_DIR;
|
step[1] = FESPI_FMT_DIR(dir);
|
||||||
as->steps[as->used][1] = FESPI_FMT_DIR(dir);
|
as_add_step(as, step);
|
||||||
as->used++;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/* This should write something less than or equal to a page.*/
|
/* This should write something less than or equal to a page.*/
|
||||||
|
@ -910,7 +916,7 @@ static int fespi_write(struct flash_bank *bank, const uint8_t *buffer,
|
||||||
if (retval != ERROR_OK)
|
if (retval != ERROR_OK)
|
||||||
return retval;
|
return retval;
|
||||||
|
|
||||||
struct algorithm_steps *as = as_new(count / 4);
|
struct algorithm_steps *as = as_new();
|
||||||
|
|
||||||
/* unaligned buffer head */
|
/* unaligned buffer head */
|
||||||
if (count > 0 && (offset & 3) != 0) {
|
if (count > 0 && (offset & 3) != 0) {
|
||||||
|
|
Loading…
Reference in New Issue