Lines Matching refs:node

28 static void FreePathMountNode(SandboxMountNode *node)
30     PathMountNode *sandboxNode = (PathMountNode *)node;
46 static void FreeSymbolLinkNode(SandboxMountNode *node)
48     SymbolLinkNode *sandboxNode = (SymbolLinkNode *)node;
60 static int SandboxNodeCompareProc(ListNode *node, ListNode *newNode)
62     SandboxMountNode *sandbox1 = (SandboxMountNode *)ListEntry(node, SandboxMountNode, node);
63     SandboxMountNode *sandbox2 = (SandboxMountNode *)ListEntry(newNode, SandboxMountNode, node);
71     SandboxMountNode *node = (SandboxMountNode *)calloc(1, dataLen);
72     APPSPAWN_CHECK(node != NULL, return NULL, "Failed to create mount node %{public}u", type);
73     OH_ListInit(&node->node);
74     node->type = type;
75     return node;
78 void AddSandboxMountNode(SandboxMountNode *node, SandboxSection *queue)
80     APPSPAWN_CHECK_ONLY_EXPER(node != NULL, return);
82     OH_ListAddWithOrder(&queue->front, &node->node, SandboxNodeCompareProc);
85 static int PathMountNodeCompare(ListNode *node, void *data)
87     PathMountNode *node1 = (PathMountNode *)ListEntry(node, SandboxMountNode, node);
94 static int SymbolLinkNodeCompare(ListNode *node, void *data)
96     SymbolLinkNode *node1 = (SymbolLinkNode *)ListEntry(node, SandboxMountNode, node);
111     ListNode *node = OH_ListFind(&section->front, (void *)&pathNode, PathMountNodeCompare);
112     if (node == NULL) {
115     return (PathMountNode *)ListEntry(node, SandboxMountNode, node);
126     ListNode *node = OH_ListFind(&section->front, (void *)&linkNode, SymbolLinkNodeCompare);
127     if (node == NULL) {
130     return (SymbolLinkNode *)ListEntry(node, SandboxMountNode, node);
136     OH_ListRemove(&sandboxNode->node);
137     OH_ListInit(&sandboxNode->node);
158     return (SandboxMountNode *)ListEntry(section->front.next, SandboxMountNode, node);
169             APPSPAPWN_DUMP("        sandbox node source: %{public}s", pathNode->source ? pathNode->source : "null");
170             APPSPAPWN_DUMP("        sandbox node target: %{public}s", pathNode->target ? pathNode->target : "null");
172             APPSPAPWN_DUMP("        sandbox node apl: %{public}s",
174             APPSPAPWN_DUMP("        sandbox node checkErrorFlag: %{public}s",
181             APPSPAPWN_DUMP("        sandbox node target: %{public}s", linkNode->target ? linkNode->target : "null");
182             APPSPAPWN_DUMP("        sandbox node linkName: %{public}s",
184             APPSPAPWN_DUMP("        sandbox node destMode: %{public}x", linkNode->destMode);
185             APPSPAPWN_DUMP("        sandbox node checkErrorFlag: %{public}s",
204     OH_ListInit(&section->sandboxNode.node);
230     ListNode *node = section->front.next;
231     while (node != &section->front) {
232         SandboxMountNode *sandboxNode = ListEntry(node, SandboxMountNode, node);
233         // delete node
234         OH_ListRemove(&sandboxNode->node);
235         OH_ListInit(&sandboxNode->node);
238         node = section->front.next;
243     void (*dumpSandboxMountNode)(const SandboxMountNode *node, uint32_t count))
246     ListNode *node = front->next;
247     while (node != front) {
248         SandboxMountNode *sandboxNode = (SandboxMountNode *)ListEntry(node, SandboxMountNode, node);
252         node = node->next;
283     APPSPAWN_CHECK(section != NULL, return NULL, "Failed to create base node");
294 static int SandboxConditionalNodeCompareName(ListNode *node, void *data)
296     SandboxSection *tmpNode = (SandboxSection *)ListEntry(node, SandboxMountNode, node);
300 static int SandboxConditionalNodeCompareNode(ListNode *node, ListNode *newNode)
302     SandboxSection *tmpNode = (SandboxSection *)ListEntry(node, SandboxMountNode, node);
303     SandboxSection *tmpNewNode = (SandboxSection *)ListEntry(newNode, SandboxMountNode, node);
310     ListNode *node = OH_ListFind(&queue->front, (void *)name, SandboxConditionalNodeCompareName);
311     if (node == NULL) {
314     return (SandboxSection *)ListEntry(node, SandboxMountNode, node);
317 void AddSandboxSection(SandboxSection *node, SandboxQueue *queue)
319     APPSPAWN_CHECK_ONLY_EXPER(node != NULL && queue != NULL, return);
320     if (ListEmpty(node->sandboxNode.node)) {
321         OH_ListAddWithOrder(&queue->front, &node->sandboxNode.node, SandboxConditionalNodeCompareNode);
328     // delete node
329     OH_ListRemove(&section->sandboxNode.node);
330     OH_ListInit(&section->sandboxNode.node);
337     ListNode *node = queue->front.next;
338     while (node != &queue->front) {
339         SandboxSection *sandboxNode = (SandboxSection *)ListEntry(node, SandboxMountNode, node);
342         node = queue->front.next;
346 static int AppSpawnExtDataCompareDataId(ListNode *node, void *data)
348     AppSpawnExtData *extData = (AppSpawnExtData *)ListEntry(node, AppSpawnExtData, node);
356     ListNode *node = OH_ListFind(&content->extData, (void *)&dataId, AppSpawnExtDataCompareDataId);
357     if (node == NULL) {
360     return (AppSpawnSandboxCfg *)ListEntry(node, AppSpawnSandboxCfg, extData);
367     OH_ListRemove(&sandbox->extData.node);
368     OH_ListInit(&sandbox->extData.node);
385 static void DumpSandboxPermission(const SandboxMountNode *node, uint32_t index)
387     SandboxPermissionNode *permissionNode = (SandboxPermissionNode *)node;
394 static void DumpSandboxSectionNode(const SandboxMountNode *node, uint32_t index)
396     SandboxSection *section = (SandboxSection *)node;
402 static void DumpSandboxNameGroupNode(const SandboxMountNode *node, uint32_t index)
404     SandboxNameGroupNode *nameGroupNode = (SandboxNameGroupNode *)node;
443     OH_ListInit(&sandbox->extData.node);
496     OH_ListAddTail(&content->extData, &sandbox->extData.node);
516     OH_ListAddTail(&content->extData, &sandbox->extData.node);
580     ListNode *node = sandbox->permissionQueue.front.next;
581     while (node != &sandbox->permissionQueue.front) {
582         SandboxPermissionNode *permissionNode = (SandboxPermissionNode *)ListEntry(node, SandboxMountNode, node);
584             node = node->next;
588             node = node->next;
605             node = node->next;
609         node = node->next;