Fault storage method and apparatus and fault search method and apparatus

Abstract

The invention discloses a fault storage method and apparatus and a fault search method and apparatus, and belongs to the field of fault injection. The fault storage method comprises: obtaining descriptors of to-be-injected faults to perform Hash operation during fault injection, and extracting feature values of the to-be-injected faults from a result; determining a corresponding red black tree node according to a binary search tree insertion algorithm for each feature value in the feature values of the to-be-injected faults; storing the to-be-injected faults and obtaining a storage address; and forming a key value pair by the feature value of each to-be-injected fault and the storage address, and storing the key value pair in the red black tree node. The fault search method comprises: obtaining descriptors of to-be-searched faults to perform Hash operation during fault search, extracting feature values from a result, traversing red black tree nodes by taking the feature values as indexes, judging whether the feature values exist or not, if so, determining that the faults exist, and returning a storage address of fault information corresponding to the feature values; otherwise, determining that the faults do not exist. According to the fault storage method and apparatus and the fault search method and apparatus, the fault search efficiency of a fault injection system is effectively improved.

Description

technical field [0001] The invention relates to the field of fault injection, in particular to a fault storage method and device, and a fault finding method and device. Background technique [0002] Fault injection technology has developed from single fault injection to multiple fault injection. Usually, the fault injection system does not support injecting two identical faults. Therefore, before injecting a fault, it is necessary to traverse all the faults currently injected by the system to avoid repeated injection. In the process of traversal, fault query is a very critical step, which will directly affect the response time and processing time of each fault injection. [0003] At present, the faults in the fault injection system are generally stored in the form of a linked list. Since the linked list itself has the characteristic that one node points to another node, when performing fault finding, it can only start from the first node in the linked list in the form of tr...

AI Technical Summary

Problems solved by technology

[0003] At present, the faults in the fault injection system are generally stored in the form of a linked list. Since the linked list itself has the characteristic that one node points to another node, when performing fault finding, it can only start from the first node in the linked list in the form of traversing the linked list. Search one by one until the required fault is found. This method is slow and inefficient

Images