Lines Matching defs:cur
25 TNode *cur = list->head;
26 while (cur != NULL) {
27 if (cur->uid != uid) {
28 cur = cur->next;
31 for (int i = 0; i < cur->permNum; i++) {
32 if (strcmp(cur->permList[i].name, permission) == 0) {
33 return (int)cur->permList[i].granted;
68 TNode *cur = list->head;
70 while (cur != NULL) {
71 if (cur->uid == uid) {
73 list->head = cur->next;
75 pre->next = cur->next;
77 HalFree(cur->permList);
78 HalFree(cur);
81 pre = cur;
82 cur = cur->next;
88 TNode *cur = list->head;
89 while (cur != NULL) {
90 if (cur->uid == uid) {
91 return cur;
93 cur = cur->next;
100 TNode *cur = list->head;
101 while (cur != NULL) {
102 if (strcmp(cur->pkgName, pkgName) == 0) {
103 return cur;
105 cur = cur->next;