• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Li Bin, He Yeping, Ma Hengtai, Rui Jianwu. Recommending Interface Patches for Forward Porting of Linux Device Drivers Based on Existing Instances[J]. Journal of Computer Research and Development, 2021, 58(1): 189-207. DOI: 10.7544/issn1000-1239.2021.20200284
Citation: Li Bin, He Yeping, Ma Hengtai, Rui Jianwu. Recommending Interface Patches for Forward Porting of Linux Device Drivers Based on Existing Instances[J]. Journal of Computer Research and Development, 2021, 58(1): 189-207. DOI: 10.7544/issn1000-1239.2021.20200284

Recommending Interface Patches for Forward Porting of Linux Device Drivers Based on Existing Instances

Funds: This work was supported by the CAS Strategic Priority Program (XDA-Y01-01, XDC02010600).
More Information
  • Published Date: December 31, 2020
  • The extent and scope of associated impact of Linux kernel version upgraded frequently on the drivers are very large. In order to repair the inconsistency error of the driver calling the kernel interface caused by this related impact, constantly modifying the old version drivers’ codes for forward porting is a continuing and urgent problem. There are existing researches on assistant understanding of driven evolution, assistant adaptation of driver porting middle lib and assistant information of driver porting. The efficiency of driver porting is improved by retrieving assistant information at the statement level. However, the existing methods only focus on retrieving assistant information itself without distinguishing the effective patch materials. Therefore, manual analysis and manual construction of adaptable patches are required. To overcome the above limitations, in this paper we propose a new method to recommend high quality patches for interface errors in drivers forward porting. We observe that: there are the same or similar kernel interfaces’ calls between multiple different drivers that rely on the same kernel interface services, and there may be existing instance codes in the development history of other drivers, which share the same interfaces reuse and interfaces changes after kernel version is upgraded. This paper uses the commonality of the error interface statements and similar existing instances in historical development information to analyze the characteristics of the error problem, and extracts targeted interface modification modes and contents of fine-grained materials to generate patches to be recommended. Specifically, the effective modification modes are determined by combining boundary point identification, similarity calculation, fine-grained difference comparison and frequency calculation. A classification algorithm based on the different characteristics of existing instances is proposed for the first time, by distinguishing the different types of modification contents, then content materials from two data sources are extracted respectively. Finally we use the editing script technology to generate the recommended patches using above materials. Experiment on 9 different types of real drivers shows that this method can recommend for 7 types of interface errors patches in driver porting, and the effective patches account for about 67.4%. Partly, it effectively supplements and expands existing assistant methods for driver porting.
  • Related Articles

    [1]Zhang Liping, Liu Lei, Hao Xiaohong, Li Song, Hao Zhongxiao. Voronoi-Based Group Reverse k Nearest Neighbor Query in Obstructed Space[J]. Journal of Computer Research and Development, 2017, 54(4): 861-871. DOI: 10.7544/issn1000-1239.2017.20151111
    [2]Zhu Huaijie, Wang Jiaying, Wang Bin, and Yang Xiaochun. Location Privacy Preserving Obstructed Nearest Neighbor Queries[J]. Journal of Computer Research and Development, 2014, 51(1): 115-125.
    [3]Yang Zexue, Hao Zhongxiao. Group Obstacle Nearest Neighbor Query in Spatial Database[J]. Journal of Computer Research and Development, 2013, 50(11): 2455-2462.
    [4]Liu Runtao, Hao Zhongxiao. Fast Algorithm of Nearest Neighbor Query for Line Segments of Spatial Database[J]. Journal of Computer Research and Development, 2011, 48(12): 2379-2384.
    [5]Zhang Xu, He Xiangnan, Jin Cheqing, and Zhou Aoying. Processing k-Nearest Neighbors Query over Uncertain Graphs[J]. Journal of Computer Research and Development, 2011, 48(10): 1871-1878.
    [6]Liao Haojun, Han Jizhong, Fang Jinyun. All-Nearest-Neighbor Queries Processing in Spatial Databases[J]. Journal of Computer Research and Development, 2011, 48(1): 86-93.
    [7]Sun Dongpu, Hao Zhongxiao. Group Nearest Neighbor Queries Based on Voronoi Diagrams[J]. Journal of Computer Research and Development, 2010, 47(7): 1244-1251.
    [8]Sun Dongpu, Hao Zhongxiao. Multi-Type Nearest Neighbor Queries with Partial Range Constrained[J]. Journal of Computer Research and Development, 2009, 46(6): 1036-1042.
    [9]Hao Zhongxiao, Wang Yudong, He Yunbin. Line Segment Nearest Neighbor Query of Spatial Database[J]. Journal of Computer Research and Development, 2008, 45(9): 1539-1545.
    [10]Dong Daoguo, Liu Zhenzhong, and Xue Xiangyang. VA-Trie: A New and Efficient High Dimensional Index Structure for Approximate k Nearest Neighbor Query[J]. Journal of Computer Research and Development, 2005, 42(12): 2213-2218.
  • Cited by

    Periodical cited type(6)

    1. 赵迪,赵祖高,何克勤,聂磊. 混杂条件下的三维点云目标识别. 组合机床与自动化加工技术. 2023(06): 58-62 .
    2. 赵迪,赵祖高,程煜林,聂磊. 多特征关键点的自适应尺度融合特征点云配准. 电子测量技术. 2023(10): 68-75 .
    3. 孙昊. 基于改进随机森林的海量高维数据最近邻检索. 自动化技术与应用. 2022(11): 73-76 .
    4. 孟祥福,王丹丹,张霄雁,贾江浩. Top-k集合空间关键字近似查询方法. 计算机工程与应用. 2022(23): 104-116 .
    5. 宋涛,曹利波,赵明富,刘帅,罗宇航,杨鑫. 三维点云中关键点的配准与优化算法. 激光与光电子学进展. 2021(04): 375-383 .
    6. 孟祥福,王丹丹,张峰. 空间关键字查询综述. 计算机工程与应用. 2021(20): 13-24 .

    Other cited types(10)

Catalog

    Article views (568) PDF downloads (365) Cited by(16)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return