/* array_recov reads in an array struct saved to disk and inserts it into
the servers list of arrays */
int array_recov(
char *path,
job_array **new_pa)
{
extern tlist_head svr_jobarrays;
job_array *pa;
array_request_node *rn;
int fd;
int old_version;
int num_tokens;
int i;
int len;
int rc;
old_version = ARRAY_QS_STRUCT_VERSION;
/* allocate the storage for the struct */
pa = (job_array*)calloc(1,sizeof(job_array));
if (pa == NULL)
{
return PBSE_SYSTEM;
}
/* initialize the linked list nodes */
CLEAR_LINK(pa->all_arrays);
CLEAR_HEAD(pa->request_tokens);
fd = open(path, O_RDONLY, 0);
if ( array_259_upgrade )
{
rc = read_and_convert_259_array(fd, pa, path);
if(rc != PBSE_NONE)
{
free(pa);
close(fd);
return rc;
}
}
else
{
/* read the file into the struct previously allocated.
*/
len = read(fd, &(pa->ai_qs), sizeof(pa->ai_qs));
if ((len < 0) || ((len < (int)sizeof(pa->ai_qs)) && (pa->ai_qs.struct_version == ARRAY_QS_STRUCT_VERSION)))
{
sprintf(log_buffer, "error reading %s", path);
log_err(errno, "array_recov", log_buffer);
free(pa);
close(fd);
return PBSE_SYSTEM;
}
if (pa->ai_qs.struct_version != ARRAY_QS_STRUCT_VERSION)
{
rc = array_upgrade(pa, fd, pa->ai_qs.struct_version, &old_version);
if(rc)
{
sprintf(log_buffer, "Cannot upgrade array version %d to %d", pa->ai_qs.struct_version, ARRAY_QS_STRUCT_VERSION);
log_err(errno, "array_recov", log_buffer);
free(pa);
close(fd);
return rc;
}
}
}
pa->jobs = malloc(sizeof(job *) * pa->ai_qs.array_size);
memset(pa->jobs,0,sizeof(job *) * pa->ai_qs.array_size);
/* check to see if there is any additional info saved in the array file */
/* check if there are any array request tokens that haven't been fully
processed */
if (old_version > 1)
{
if (read(fd, &num_tokens, sizeof(int)) != sizeof(int))
{
sprintf(log_buffer, "error reading token count from %s", path);
log_err(errno, "array_recov", log_buffer);
free(pa);
close(fd);
return PBSE_SYSTEM;
}
for (i = 0; i < num_tokens; i++)
{
rn = (array_request_node*)malloc(sizeof(array_request_node));
if (read(fd, rn, sizeof(array_request_node)) != sizeof(array_request_node))
{
sprintf(log_buffer, "error reading array_request_node from %s", path);
log_err(errno, "array_recov", log_buffer);
free(rn);
for (rn = (array_request_node*)GET_NEXT(pa->request_tokens);
rn != NULL;
rn = (array_request_node*)GET_NEXT(pa->request_tokens))
{
delete_link(&rn->request_tokens_link);
free(rn);
}
free(pa);
close(fd);
return PBSE_SYSTEM;
}
CLEAR_LINK(rn->request_tokens_link);
append_link(&pa->request_tokens, &rn->request_tokens_link, (void*)rn);
}
}
close(fd);
CLEAR_HEAD(pa->ai_qs.deps);
if (old_version != ARRAY_QS_STRUCT_VERSION)
{
/* resave the array struct if the version on disk is older than the current */
array_save(pa);
}
/* link the struct into the servers list of job arrays */
append_link(&svr_jobarrays, &pa->all_arrays, (void*)pa);
*new_pa = pa;
return PBSE_NONE;
}
/* array_recov reads in an array struct saved to disk and inserts it into
the servers list of arrays */
int array_recov(
char *path,
job_array **new_pa)
{
job_array *pa;
array_request_node *rn;
char log_buf[LOCAL_LOG_BUF_SIZE];
int fd;
int old_version;
int num_tokens;
int i;
int len;
int rc;
*new_pa = NULL;
old_version = ARRAY_QS_STRUCT_VERSION;
/* allocate the storage for the struct */
pa = (job_array*)calloc(1,sizeof(job_array));
if (pa == NULL)
{
return(PBSE_SYSTEM);
}
/* initialize the linked list nodes */
CLEAR_HEAD(pa->request_tokens);
fd = open(path, O_RDONLY, 0);
if(fd < 0)
{
free(pa);
return(PBSE_SYSTEM);
}
if (array_259_upgrade)
{
rc = read_and_convert_259_array(fd, pa, path);
if (rc != PBSE_NONE)
{
free(pa);
close(fd);
return(rc);
}
}
else
{
/* read the file into the struct previously allocated.
*/
len = read_ac_socket(fd, &(pa->ai_qs), sizeof(pa->ai_qs));
if ((len < 0) || ((len < (int)sizeof(pa->ai_qs)) && (pa->ai_qs.struct_version == ARRAY_QS_STRUCT_VERSION)))
{
sprintf(log_buf, "error reading %s", path);
log_err(errno, __func__, log_buf);
free(pa);
close(fd);
return(PBSE_SYSTEM);
}
if (pa->ai_qs.struct_version != ARRAY_QS_STRUCT_VERSION)
{
rc = array_upgrade(pa, fd, pa->ai_qs.struct_version, &old_version);
if (rc)
{
sprintf(log_buf, "Cannot upgrade array version %d to %d", pa->ai_qs.struct_version, ARRAY_QS_STRUCT_VERSION);
log_err(errno, __func__, log_buf);
free(pa);
close(fd);
return(rc);
}
}
}
pa->job_ids = (char **)calloc(pa->ai_qs.array_size, sizeof(char *));
/* check to see if there is any additional info saved in the array file */
/* check if there are any array request tokens that haven't been fully
processed */
if (old_version > 1)
{
if (read_ac_socket(fd, &num_tokens, sizeof(int)) != sizeof(int))
{
sprintf(log_buf, "error reading token count from %s", path);
log_err(errno, __func__, log_buf);
free(pa);
close(fd);
return(PBSE_SYSTEM);
}
for (i = 0; i < num_tokens; i++)
{
rn = (array_request_node *)calloc(1, sizeof(array_request_node));
if (read_ac_socket(fd, rn, sizeof(array_request_node)) != sizeof(array_request_node))
{
sprintf(log_buf, "error reading array_request_node from %s", path);
log_err(errno, __func__, log_buf);
free(rn);
for (rn = (array_request_node*)GET_NEXT(pa->request_tokens);
rn != NULL;
rn = (array_request_node*)GET_NEXT(pa->request_tokens))
{
delete_link(&rn->request_tokens_link);
free(rn);
}
free(pa);
close(fd);
return(PBSE_SYSTEM);
}
CLEAR_LINK(rn->request_tokens_link);
append_link(&pa->request_tokens, &rn->request_tokens_link, (void*)rn);
}
}
close(fd);
CLEAR_HEAD(pa->ai_qs.deps);
if (old_version != ARRAY_QS_STRUCT_VERSION)
{
/* resave the array struct if the version on disk is older than the current */
array_save(pa);
}
pa->ai_mutex = (pthread_mutex_t *)calloc(1, sizeof(pthread_mutex_t));
pthread_mutex_init(pa->ai_mutex,NULL);
lock_ai_mutex(pa, __func__, NULL, LOGLEVEL);
/* link the struct into the servers list of job arrays */
insert_array(pa);
*new_pa = pa;
return(PBSE_NONE);
} /* END array_recov() */