Lines Matching defs:free
179 * filled or not (with free). If it is free, we return an error. Otherwise,
180 * we can free the structure pointed by fd_node.
188 bool_t free;
195 /* index to the first free elem */
206 #define is_free_id(id) (user_fd_mgt_array[(int)id].free)
215 * To free an Id, we set the cell as free and insert its address in the list
216 * of free cell.
223 user_fd_mgt_array[(int)id].free = TRUE;
229 * To get a free cell, we just have to take it from the free linked list and
230 * set the flag to "not free". This function also allocates new memory if
265 user_fd_mgt_array[selected_index].free = FALSE;
354 /* free everything concerning user fd */
371 free(node->lnk.previous);
375 free(user_fd_mgt_array);
379 free(svc_userfds);
402 free(one_node->lnk.previous);
535 free(node);
883 free(netid);
892 free(netid);
914 free(netid);
915 free(s);
952 free(s->sc_netid);
953 free(s);
992 free(netid);
1001 free(netid);
1015 free(netid);
1017 free(s);
1049 free(s->sc_netid);
1050 free(s);
1528 * svc_xprt_free() - free a service handle
1541 free(xprt);
1543 free(xt);
1545 free(my_xlist);
1547 free(msg);
1549 free(req);
1551 free(cred_area);
1556 * svc_xprt_destroy() - free parent and child xprt list
1732 free(dc);
1887 * The hash policy is to free up a bit of the hash
1897 /* clean and then free the entry */
1919 /* free buffers */
1921 free(dr->dr_resp.buf);
1925 free(dr->dr_addr.buf);
1944 free(dr);
1983 free(dr);