Searched refs:found (Results 26 - 33 of 33) sorted by relevance

12

/seL4-refos-master/apps/nethack/src/nethack-3.4.3/src/
H A Dhack.c710 * Returns TRUE if a path was found.
841 goto found;
855 found:
/seL4-refos-master/kernel/manual/parts/
H A Dipc.tex195 are found in the sending thread's IPC buffer \texttt{caps} array
H A Dio.tex176 More information about seL4's IOMMU abstractions can be found in \cite{Palande:M}.
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/doc/
H A DGuidebook.tex634 Prefix: Move until something interesting is found.
849 Ask for the type of a trap you found earlier.
1109 command. Once found they are in all ways equivalent to normal doors.
1943 found in the dungeon. Swallowing and digesting a monster while polymorphed
2130 the `Q' command instead. If no weapon is found or the option is
3026 Comment out all character graphics sets found near the bottom of the
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/doc/
H A DGuidebook.tex634 Prefix: Move until something interesting is found.
849 Ask for the type of a trap you found earlier.
1109 command. Once found they are in all ways equivalent to normal doors.
1943 found in the dungeon. Swallowing and digesting a monster while polymorphed
2130 the `Q' command instead. If no weapon is found or the option is
3026 Comment out all character graphics sets found near the bottom of the
/seL4-refos-master/libs/libutils/include/utils/
H A Dsglib.h156 #define SGLIB_ARRAY_BINARY_SEARCH(type, a, start_index, end_index, key, comparator, found, result_index) {\
174 /* not found, but set its resulting place in the array */\
177 (found) = _ff_;\
1679 assert(0 && "The element to delete not found in the tree, use 'delete_if_member'"!=NULL);\
/seL4-refos-master/projects/refos/design/
H A Dinterface.tex268 Return an anon capability if the server is found. This method resolves part of the path string returned as an offset into the path string that has been resolved. The rest of the path string may be resolved by other dataspaces until the system reaches the endpoint to the server that contains the file that it is searching for. This allows for a simple hierachical namespace with distributed naming.
/seL4-refos-master/projects/util_libs/libutils/include/utils/
H A Dsglib.h156 #define SGLIB_ARRAY_BINARY_SEARCH(type, a, start_index, end_index, key, comparator, found, result_index) {\
174 /* not found, but set its resulting place in the array */\
177 (found) = _ff_;\
1679 assert(0 && "The element to delete not found in the tree, use 'delete_if_member'"!=NULL);\

Completed in 121 milliseconds

12