struct qHead *ahead)
{
ahead->count = 0;
- ahead->next = (struct aqueue *)0;
+ ahead->next = NULL;
}
/*add <elem> in front of queue <ahead> */
if(ahead->count == 0) {
ahead->count += 1;
ahead->next = elem;
- elem->next = (struct aqueue *)0;
+ elem->next = NULL;
}
else {
temp = ahead->next;
struct aqueue *cptr;
cptr = ahead->next;
- while(cptr != (struct aqueue *)0) {
+ while(cptr != NULL) {
if(cptr->ids[RWVOL] == id) {
*success = 1;
*elem = cptr;
elem->copyDate[i] = temp->copyDate[i];
elem->isValid[i] = temp->isValid[i];
}
- elem->next = (struct aqueue *)0;
+ elem->next = NULL;
*success = 1;
free(temp);
}