Searched refs:search (Results 1 – 6 of 6) sorted by relevance
8 from re import match, search49 match = search(pattern, line)
159 load_address_lines = [l for l in pm_f if re.search(r'load-address[^-]', l)]164 load_address_parsed = re.search("(0x[0-9a-f]+)", load_address_lines[0])
321 if re.search("_pk$", type_desc):629 if re.search("_pk$", name):631 elif re.search("_hash$", name):
25 #. The current arrangement of the power domain tree requires a binary search28 a 'start' to an 'end' power level. The binary search is required to find the232 populate the two arrays. It is essentially a breadth-first-search. The nodes for
264 matching_symbol = re.search("([0-9A-Fa-f]+) . \\.text", str(symbols))
645 …- use LDLIBS instead of LDFLAGS for library search paths ([d833129](https://review.trustedfirmware…6748 …- search pinctrl node by compatible ([b14d3e2](https://review.trustedfirmware.org/plugins/gitiles/…10097 - Fixed bug of binary search in RAS interrupt handler