Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/intel/libaji_client

This is the client side library to access JTAG Server distributed with Quartus (jtagd/jtagserver.exe). The protocol is known as Advanced JTAG Interface (AJI). See src/h/aji.h for available API.
https://github.com/intel/libaji_client

Last synced: 2 months ago
JSON representation

This is the client side library to access JTAG Server distributed with Quartus (jtagd/jtagserver.exe). The protocol is known as Advanced JTAG Interface (AJI). See src/h/aji.h for available API.

Awesome Lists containing this project

README

        

====================================
Advanced JTAG Interface (AJI) Client
====================================

In this repository you will find a Client-side
API implementation for accessing the JTAG
server (jtagserv.exe or jtagd)
distributed by Quartus software from Intel.
Only JTAG interface supported.

By default, it will attempt to connect
to the JTAG server on port 1309. See
store/examples/QUARTUS_JTAG_CLIENT_CONFIG.conf
if you need to connect to a remote server

========
Building
========
```
./bootstrap
./configure
./make
./make install
```

=======
Example
=======
The following code, written with Arria10 in mind, will
printout the IDCODE for each TAP and show any SLD hierarchy
on the FPGA Tap(if available).

```
#include "aji.h"
void sld_node_printf(const AJI_HIER_ID* hier_id, const AJI_HUB_INFO* hub_infos);

void main() {
DWORD hardware_capacity = 10;
AJI_HARDWARE *hardware_list = (AJI_HARDWARE*) calloc(hardware_capacity, sizeof(AJI_HARDWARE));
char **server_version_info_list = (char**) calloc(hardware_capacity, sizeof(char*));
DWORD hardware_count = hardware_capacity;
aji_get_hardware2(&hardware_count, hardware_list, server_version_info_list, 1000);

for(unsigned int i=0; iidcode,
(unsigned long) hier_id->position_n
);
if (hub_infos) {
for (int m = 0; m <= hier_id->position_n; ++m) {
printf("%d ", hier_id->positions[m]);
} //end for m
printf(") hub_infos: ");
for (int m = 0; m <= hier_id->position_n; ++m) {
printf(" (Hub %d) bridge_idcode=%08lX, hub_id_code=%08lX",
m,
m == 0 ? 0 : (hub_infos->bridge_idcode[m]),
(hub_infos->hub_idcode[m])
);
} //end for m (bridge)
}
}
```

==========
CHANGE LOG
==========
- 0.4.0
- Bugfix: If you have 10 or more SLD nodes, then
previously opencod can segfault as the code
was trying to access memory beyond what was
allocated.

- 0.3.0
- Introduced aji_get_nodes_bi(...) which is a
workaround for aji_get_nodes_b(...) for C
program. It was noted that when as the
number of SLD nodes increases, hier_ids'
elements might not contain the correct idcode
when the function is called from a C program.
the "bi" version workaround this problem.