Home
last modified time | relevance | path

Searched refs:fiber_list (Results 1 – 3 of 3) sorted by relevance

/dports/security/yara/yara-4.1.1/libyara/
H A Dre.c1211 if (fiber_list->tail != NULL) in _yr_re_fiber_append()
1214 fiber_list->tail = fiber; in _yr_re_fiber_append()
1217 fiber_list->head = fiber; in _yr_re_fiber_append()
1230 RE_FIBER_LIST* fiber_list, in _yr_re_fiber_exists() argument
1279 RE_FIBER_LIST* fiber_list, in _yr_re_fiber_split() argument
1316 RE_FIBER_LIST* fiber_list, in _yr_re_fiber_kill() argument
1351 RE_FIBER_LIST* fiber_list, in _yr_re_fiber_kill_tail() argument
1369 fiber_list->head = NULL; in _yr_re_fiber_kill_tail()
1379 RE_FIBER_LIST* fiber_list, in _yr_re_fiber_kill_all() argument
1383 _yr_re_fiber_kill_tail(fiber_list, fiber_pool, fiber_list->head); in _yr_re_fiber_kill_all()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/C3/src/lib_linalg/
H A Dlinalg.h170 struct fiber_list{ struct
173 struct fiber_list * next; argument
177 struct fiber_list * head;
179 void AddFiber(struct fiber_list **, size_t, double *, size_t);
180 int IndexExists(struct fiber_list *, size_t);
181 double * getIndex(struct fiber_list *, size_t);
182 void DeleteFiberList(struct fiber_list **);
H A Dlinalg.c699 void AddFiber(struct fiber_list ** head, size_t index, double * vals, size_t nVals) in AddFiber()
701 struct fiber_list * newNode; in AddFiber()
702 if (NULL == (newNode = malloc(sizeof(struct fiber_list)))){ in AddFiber()
726 int IndexExists(struct fiber_list * head, size_t index){ in IndexExists()
728 struct fiber_list * current = head; in IndexExists()
753 double * getIndex(struct fiber_list * head, size_t index){ in getIndex()
754 struct fiber_list * current = head; in getIndex()
772 void DeleteFiberList(struct fiber_list ** head){ in DeleteFiberList()
774 struct fiber_list * current = *head; in DeleteFiberList()
775 struct fiber_list * next; in DeleteFiberList()