Searched refs:newNode (Results 1 – 5 of 5) sorted by relevance
78 struct cbfs_cachenode *newNode, u32 *used) in file_cbfs_next_file() argument105 newNode->next = NULL; in file_cbfs_next_file()106 newNode->type = header.type; in file_cbfs_next_file()107 newNode->data = start + header.offset; in file_cbfs_next_file()108 newNode->data_length = header.len; in file_cbfs_next_file()110 newNode->name = (char *)fileHeader + in file_cbfs_next_file()112 newNode->name_length = name_len; in file_cbfs_next_file()113 newNode->checksum = header.checksum; in file_cbfs_next_file()129 struct cbfs_cachenode *newNode; in file_cbfs_fill_cache() local145 newNode = (struct cbfs_cachenode *) in file_cbfs_fill_cache()[all …]
2881 IntersectNode * newNode = new IntersectNode; in BuildIntersectList() local2882 newNode->Edge1 = e; in BuildIntersectList()2883 newNode->Edge2 = eNext; in BuildIntersectList()2884 newNode->Pt = Pt; in BuildIntersectList()2885 m_IntersectList.push_back(newNode); in BuildIntersectList()3806 PolyNode* newNode = new PolyNode(); in AddPath() local3807 newNode->m_jointype = joinType; in AddPath()3808 newNode->m_endtype = endType; in AddPath()3813 newNode->Contour.reserve(highI + 1); in AddPath()3814 newNode->Contour.push_back(path[0]); in AddPath()[all …]
2955 uchar* newNode(const int* idx, size_t hashval);