m_position);\n nLeftOver = s + len - end;\n if (nLeftOver) {\n if (parser->m_buffer == NULL\n || nLeftOver > parser->m_bufferLim - parser->m_buffer) {\n /* avoid _signed_ integer overflow */\n char *temp = NULL;\n const int bytesToAllocate = (int)((unsigned)len * 2U);\n if (bytesToAllocate > 0) {\n temp = (char *)REALLOC(parser, parser->m_buffer, bytesToAllocate);\n }\n if (temp == NULL) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n parser->m_eventPtr = parser->m_eventEndPtr = NULL;\n parser->m_processor = errorProcessor;\n return XML_STATUS_ERROR;\n }\n parser->m_buffer = temp;\n parser->m_bufferLim = parser->m_buffer + bytesToAllocate;\n }\n memcpy(parser->m_buffer, end, nLeftOver);\n }\n parser->m_bufferPtr = parser->m_buffer;\n parser->m_bufferEnd = parser->m_buffer + nLeftOver;\n parser->m_positionPtr = parser->m_bufferPtr;\n parser->m_parseEndPtr = parser->m_bufferEnd;\n parser->m_eventPtr = parser->m_bufferPtr;\n parser->m_eventEndPtr = parser->m_bufferPtr;\n return result;\n }\n#endif /* not defined XML_CONTEXT_BYTES */\n else {\n void *buff = XML_GetBuffer(parser, len);\n if (buff == NULL)\n return XML_STATUS_ERROR;\n else {\n memcpy(buff, s, len);\n return XML_ParseBuffer(parser, len, isFinal);\n }\n }\n}\n\nenum XML_Status XMLCALL\nXML_ParseBuffer(XML_Parser parser, int len, int isFinal) {\n const char *start;\n enum XML_Status result = XML_STATUS_OK;\n\n if (parser == NULL)\n return XML_STATUS_ERROR;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n parser->m_errorCode = XML_ERROR_SUSPENDED;\n return XML_STATUS_ERROR;\n case XML_FINISHED:\n parser->m_errorCode = XML_ERROR_FINISHED;\n return XML_STATUS_ERROR;\n case XML_INITIALIZED:\n if (parser->m_parentParser == NULL && ! startParsing(parser)) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return XML_STATUS_ERROR;\n }\n /* fall through */\n default:\n parser->m_parsingStatus.parsing = XML_PARSING;\n }\n\n start = parser->m_bufferPtr;\n parser->m_positionPtr = start;\n parser->m_bufferEnd += len;\n parser->m_parseEndPtr = parser->m_bufferEnd;\n parser->m_parseEndByteIndex += len;\n parser->m_parsingStatus.finalBuffer = (XML_Bool)isFinal;\n\n parser->m_errorCode = parser->m_processor(\n parser, start, parser->m_parseEndPtr, &parser->m_bufferPtr);\n\n if (parser->m_errorCode != XML_ERROR_NONE) {\n parser->m_eventEndPtr = parser->m_eventPtr;\n parser->m_processor = errorProcessor;\n return XML_STATUS_ERROR;\n } else {\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n result = XML_STATUS_SUSPENDED;\n break;\n case XML_INITIALIZED:\n case XML_PARSING:\n if (isFinal) {\n parser->m_parsingStatus.parsing = XML_FINISHED;\n return result;\n }\n default:; /* should not happen */\n }\n }\n\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,\n parser->m_bufferPtr, &parser->m_position);\n parser->m_positionPtr = parser->m_bufferPtr;\n return result;\n}\n\nvoid *XMLCALL\nXML_GetBuffer(XML_Parser parser, int len) {\n if (parser == NULL)\n return NULL;\n if (len < 0) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return NULL;\n }\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n parser->m_errorCode = XML_ERROR_SUSPENDED;\n return NULL;\n case XML_FINISHED:\n parser->m_errorCode = XML_ERROR_FINISHED;\n return NULL;\n default:;\n }\n\n if (len > EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_bufferEnd)) {\n#ifdef XML_CONTEXT_BYTES\n int keep;\n#endif /* defined XML_CONTEXT_BYTES */\n /* Do not invoke signed arithmetic overflow: */\n int neededSize = (int)((unsigned)len\n + (unsigned)EXPAT_SAFE_PTR_DIFF(\n parser->m_bufferEnd, parser->m_bufferPtr));\n if (neededSize < 0) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return NULL;\n }\n#ifdef XML_CONTEXT_BYTES\n keep = (int)EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer);\n if (keep > XML_CONTEXT_BYTES)\n keep = XML_CONTEXT_BYTES;\n neededSize += keep;\n#endif /* defined XML_CONTEXT_BYTES */\n if (neededSize\n <= EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_buffer)) {\n#ifdef XML_CONTEXT_BYTES\n if (keep < EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer)) {\n int offset\n = (int)EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer)\n - keep;\n /* The buffer pointers cannot be NULL here; we have at least some bytes\n * in the buffer */\n memmove(parser->m_buffer, &parser->m_buffer[offset],\n parser->m_bufferEnd - parser->m_bufferPtr + keep);\n parser->m_bufferEnd -= offset;\n parser->m_bufferPtr -= offset;\n }\n#else\n if (parser->m_buffer && parser->m_bufferPtr) {\n memmove(parser->m_buffer, parser->m_bufferPtr,\n EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr));\n parser->m_bufferEnd\n = parser->m_buffer\n + EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr);\n parser->m_bufferPtr = parser->m_buffer;\n }\n#endif /* not defined XML_CONTEXT_BYTES */\n } else {\n char *newBuf;\n int bufferSize\n = (int)EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_bufferPtr);\n if (bufferSize == 0)\n bufferSize = INIT_BUFFER_SIZE;\n do {\n /* Do not invoke signed arithmetic overflow: */\n bufferSize = (int)(2U * (unsigned)bufferSize);\n } while (bufferSize < neededSize && bufferSize > 0);\n if (bufferSize <= 0) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return NULL;\n }\n newBuf = (char *)MALLOC(parser, bufferSize);\n if (newBuf == 0) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return NULL;\n }\n parser->m_bufferLim = newBuf + bufferSize;\n#ifdef XML_CONTEXT_BYTES\n if (parser->m_bufferPtr) {\n memcpy(newBuf, &parser->m_bufferPtr[-keep],\n EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr)\n + keep);\n FREE(parser, parser->m_buffer);\n parser->m_buffer = newBuf;\n parser->m_bufferEnd\n = parser->m_buffer\n + EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr)\n + keep;\n parser->m_bufferPtr = parser->m_buffer + keep;\n } else {\n /* This must be a brand new buffer with no data in it yet */\n parser->m_bufferEnd = newBuf;\n parser->m_bufferPtr = parser->m_buffer = newBuf;\n }\n#else\n if (parser->m_bufferPtr) {\n memcpy(newBuf, parser->m_bufferPtr,\n EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr));\n FREE(parser, parser->m_buffer);\n parser->m_bufferEnd\n = newBuf\n + EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr);\n } else {\n /* This must be a brand new buffer with no data in it yet */\n parser->m_bufferEnd = newBuf;\n }\n parser->m_bufferPtr = parser->m_buffer = newBuf;\n#endif /* not defined XML_CONTEXT_BYTES */\n }\n parser->m_eventPtr = parser->m_eventEndPtr = NULL;\n parser->m_positionPtr = NULL;\n }\n return parser->m_bufferEnd;\n}\n\nenum XML_Status XMLCALL\nXML_StopParser(XML_Parser parser, XML_Bool resumable) {\n if (parser == NULL)\n return XML_STATUS_ERROR;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n if (resumable) {\n parser->m_errorCode = XML_ERROR_SUSPENDED;\n return XML_STATUS_ERROR;\n }\n parser->m_parsingStatus.parsing = XML_FINISHED;\n break;\n case XML_FINISHED:\n parser->m_errorCode = XML_ERROR_FINISHED;\n return XML_STATUS_ERROR;\n default:\n if (resumable) {\n#ifdef XML_DTD\n if (parser->m_isParamEntity) {\n parser->m_errorCode = XML_ERROR_SUSPEND_PE;\n return XML_STATUS_ERROR;\n }\n#endif\n parser->m_parsingStatus.parsing = XML_SUSPENDED;\n } else\n parser->m_parsingStatus.parsing = XML_FINISHED;\n }\n return XML_STATUS_OK;\n}\n\nenum XML_Status XMLCALL\nXML_ResumeParser(XML_Parser parser) {\n enum XML_Status result = XML_STATUS_OK;\n\n if (parser == NULL)\n return XML_STATUS_ERROR;\n if (parser->m_parsingStatus.parsing != XML_SUSPENDED) {\n parser->m_errorCode = XML_ERROR_NOT_SUSPENDED;\n return XML_STATUS_ERROR;\n }\n parser->m_parsingStatus.parsing = XML_PARSING;\n\n parser->m_errorCode = parser->m_processor(\n parser, parser->m_bufferPtr, parser->m_parseEndPtr, &parser->m_bufferPtr);\n\n if (parser->m_errorCode != XML_ERROR_NONE) {\n parser->m_eventEndPtr = parser->m_eventPtr;\n parser->m_processor = errorProcessor;\n return XML_STATUS_ERROR;\n } else {\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n result = XML_STATUS_SUSPENDED;\n break;\n case XML_INITIALIZED:\n case XML_PARSING:\n if (parser->m_parsingStatus.finalBuffer) {\n parser->m_parsingStatus.parsing = XML_FINISHED;\n return result;\n }\n default:;\n }\n }\n\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,\n parser->m_bufferPtr, &parser->m_position);\n parser->m_positionPtr = parser->m_bufferPtr;\n return result;\n}\n\nvoid XMLCALL\nXML_GetParsingStatus(XML_Parser parser, XML_ParsingStatus *status) {\n if (parser == NULL)\n return;\n assert(status != NULL);\n *status = parser->m_parsingStatus;\n}\n\nenum XML_Error XMLCALL\nXML_GetErrorCode(XML_Parser parser) {\n if (parser == NULL)\n return XML_ERROR_INVALID_ARGUMENT;\n return parser->m_errorCode;\n}\n\nXML_Index XMLCALL\nXML_GetCurrentByteIndex(XML_Parser parser) {\n if (parser == NULL)\n return -1;\n if (parser->m_eventPtr)\n return (XML_Index)(parser->m_parseEndByteIndex\n - (parser->m_parseEndPtr - parser->m_eventPtr));\n return -1;\n}\n\nint XMLCALL\nXML_GetCurrentByteCount(XML_Parser parser) {\n if (parser == NULL)\n return 0;\n if (parser->m_eventEndPtr && parser->m_eventPtr)\n return (int)(parser->m_eventEndPtr - parser->m_eventPtr);\n return 0;\n}\n\nconst char *XMLCALL\nXML_GetInputContext(XML_Parser parser, int *offset, int *size) {\n#ifdef XML_CONTEXT_BYTES\n if (parser == NULL)\n return NULL;\n if (parser->m_eventPtr && parser->m_buffer) {\n if (offset != NULL)\n *offset = (int)(parser->m_eventPtr - parser->m_buffer);\n if (size != NULL)\n *size = (int)(parser->m_bufferEnd - parser->m_buffer);\n return parser->m_buffer;\n }\n#else\n (void)parser;\n (void)offset;\n (void)size;\n#endif /* defined XML_CONTEXT_BYTES */\n return (char *)0;\n}\n\nXML_Size XMLCALL\nXML_GetCurrentLineNumber(XML_Parser parser) {\n if (parser == NULL)\n return 0;\n if (parser->m_eventPtr && parser->m_eventPtr >= parser->m_positionPtr) {\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,\n parser->m_eventPtr, &parser->m_position);\n parser->m_positionPtr = parser->m_eventPtr;\n }\n return parser->m_position.lineNumber + 1;\n}\n\nXML_Size XMLCALL\nXML_GetCurrentColumnNumber(XML_Parser parser) {\n if (parser == NULL)\n return 0;\n if (parser->m_eventPtr && parser->m_eventPtr >= parser->m_positionPtr) {\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,\n parser->m_eventPtr, &parser->m_position);\n parser->m_positionPtr = parser->m_eventPtr;\n }\n return parser->m_position.columnNumber;\n}\n\nvoid XMLCALL\nXML_FreeContentModel(XML_Parser parser, XML_Content *model) {\n if (parser != NULL)\n FREE(parser, model);\n}\n\nvoid *XMLCALL\nXML_MemMalloc(XML_Parser parser, size_t size) {\n if (parser == NULL)\n return NULL;\n return MALLOC(parser, size);\n}\n\nvoid *XMLCALL\nXML_MemRealloc(XML_Parser parser, void *ptr, size_t size) {\n if (parser == NULL)\n return NULL;\n return REALLOC(parser, ptr, size);\n}\n\nvoid XMLCALL\nXML_MemFree(XML_Parser parser, void *ptr) {\n if (parser != NULL)\n FREE(parser, ptr);\n}\n\nvoid XMLCALL\nXML_DefaultCurrent(XML_Parser parser) {\n if (parser == NULL)\n return;\n if (parser->m_defaultHandler) {\n if (parser->m_openInternalEntities)\n reportDefault(parser, parser->m_internalEncoding,\n parser->m_openInternalEntities->internalEventPtr,\n parser->m_openInternalEntities->internalEventEndPtr);\n else\n reportDefault(parser, parser->m_encoding, parser->m_eventPtr,\n parser->m_eventEndPtr);\n }\n}\n\nconst XML_LChar *XMLCALL\nXML_ErrorString(enum XML_Error code) {\n switch (code) {\n case XML_ERROR_NONE:\n return NULL;\n case XML_ERROR_NO_MEMORY:\n return XML_L(\"out of memory\");\n case XML_ERROR_SYNTAX:\n return XML_L(\"syntax error\");\n case XML_ERROR_NO_ELEMENTS:\n return XML_L(\"no element found\");\n case XML_ERROR_INVALID_TOKEN:\n return XML_L(\"not well-formed (invalid token)\");\n case XML_ERROR_UNCLOSED_TOKEN:\n return XML_L(\"unclosed token\");\n case XML_ERROR_PARTIAL_CHAR:\n return XML_L(\"partial character\");\n case XML_ERROR_TAG_MISMATCH:\n return XML_L(\"mismatched tag\");\n case XML_ERROR_DUPLICATE_ATTRIBUTE:\n return XML_L(\"duplicate attribute\");\n case XML_ERROR_JUNK_AFTER_DOC_ELEMENT:\n return XML_L(\"junk after document element\");\n case XML_ERROR_PARAM_ENTITY_REF:\n return XML_L(\"illegal parameter entity reference\");\n case XML_ERROR_UNDEFINED_ENTITY:\n return XML_L(\"undefined entity\");\n case XML_ERROR_RECURSIVE_ENTITY_REF:\n return XML_L(\"recursive entity reference\");\n case XML_ERROR_ASYNC_ENTITY:\n return XML_L(\"asynchronous entity\");\n case XML_ERROR_BAD_CHAR_REF:\n return XML_L(\"reference to invalid character number\");\n case XML_ERROR_BINARY_ENTITY_REF:\n return XML_L(\"reference to binary entity\");\n case XML_ERROR_ATTRIBUTE_EXTERNAL_ENTITY_REF:\n return XML_L(\"reference to external entity in attribute\");\n case XML_ERROR_MISPLACED_XML_PI:\n return XML_L(\"XML or text declaration not at start of entity\");\n case XML_ERROR_UNKNOWN_ENCODING:\n return XML_L(\"unknown encoding\");\n case XML_ERROR_INCORRECT_ENCODING:\n return XML_L(\"encoding specified in XML declaration is incorrect\");\n case XML_ERROR_UNCLOSED_CDATA_SECTION:\n return XML_L(\"unclosed CDATA section\");\n case XML_ERROR_EXTERNAL_ENTITY_HANDLING:\n return XML_L(\"error in processing external entity reference\");\n case XML_ERROR_NOT_STANDALONE:\n return XML_L(\"document is not standalone\");\n case XML_ERROR_UNEXPECTED_STATE:\n return XML_L(\"unexpected parser state - please send a bug report\");\n case XML_ERROR_ENTITY_DECLARED_IN_PE:\n return XML_L(\"entity declared in parameter entity\");\n case XML_ERROR_FEATURE_REQUIRES_XML_DTD:\n return XML_L(\"requested feature requires XML_DTD support in Expat\");\n case XML_ERROR_CANT_CHANGE_FEATURE_ONCE_PARSING:\n return XML_L(\"cannot change setting once parsing has begun\");\n /* Added in 1.95.7. */\n case XML_ERROR_UNBOUND_PREFIX:\n return XML_L(\"unbound prefix\");\n /* Added in 1.95.8. */\n case XML_ERROR_UNDECLARING_PREFIX:\n return XML_L(\"must not undeclare prefix\");\n case XML_ERROR_INCOMPLETE_PE:\n return XML_L(\"incomplete markup in parameter entity\");\n case XML_ERROR_XML_DECL:\n return XML_L(\"XML declaration not well-formed\");\n case XML_ERROR_TEXT_DECL:\n return XML_L(\"text declaration not well-formed\");\n case XML_ERROR_PUBLICID:\n return XML_L(\"illegal character(s) in public id\");\n case XML_ERROR_SUSPENDED:\n return XML_L(\"parser suspended\");\n case XML_ERROR_NOT_SUSPENDED:\n return XML_L(\"parser not suspended\");\n case XML_ERROR_ABORTED:\n return XML_L(\"parsing aborted\");\n case XML_ERROR_FINISHED:\n return XML_L(\"parsing finished\");\n case XML_ERROR_SUSPEND_PE:\n return XML_L(\"cannot suspend in external parameter entity\");\n /* Added in 2.0.0. */\n case XML_ERROR_RESERVED_PREFIX_XML:\n return XML_L(\n \"reserved prefix (xml) must not be undeclared or bound to another namespace name\");\n case XML_ERROR_RESERVED_PREFIX_XMLNS:\n return XML_L(\"reserved prefix (xmlns) must not be declared or undeclared\");\n case XML_ERROR_RESERVED_NAMESPACE_URI:\n return XML_L(\n \"prefix must not be bound to one of the reserved namespace names\");\n /* Added in 2.2.5. */\n case XML_ERROR_INVALID_ARGUMENT: /* Constant added in 2.2.1, already */\n return XML_L(\"invalid argument\");\n }\n return NULL;\n}\n\nconst XML_LChar *XMLCALL\nXML_ExpatVersion(void) {\n /* V1 is used to string-ize the version number. However, it would\n string-ize the actual version macro *names* unless we get them\n substituted before being passed to V1. CPP is defined to expand\n a macro, then rescan for more expansions. Thus, we use V2 to expand\n the version macros, then CPP will expand the resulting V1() macro\n with the correct numerals. */\n /* ### I'm assuming cpp is portable in this respect... */\n\n#define V1(a, b, c) XML_L(#a) XML_L(\".\") XML_L(#b) XML_L(\".\") XML_L(#c)\n#define V2(a, b, c) XML_L(\"expat_\") V1(a, b, c)\n\n return V2(XML_MAJOR_VERSION, XML_MINOR_VERSION, XML_MICRO_VERSION);\n\n#undef V1\n#undef V2\n}\n\nXML_Expat_Version XMLCALL\nXML_ExpatVersionInfo(void) {\n XML_Expat_Version version;\n\n version.major = XML_MAJOR_VERSION;\n version.minor = XML_MINOR_VERSION;\n version.micro = XML_MICRO_VERSION;\n\n return version;\n}\n\nconst XML_Feature *XMLCALL\nXML_GetFeatureList(void) {\n static const XML_Feature features[]\n = {{XML_FEATURE_SIZEOF_XML_CHAR, XML_L(\"sizeof(XML_Char)\"),\n sizeof(XML_Char)},\n {XML_FEATURE_SIZEOF_XML_LCHAR, XML_L(\"sizeof(XML_LChar)\"),\n sizeof(XML_LChar)},\n#ifdef XML_UNICODE\n {XML_FEATURE_UNICODE, XML_L(\"XML_UNICODE\"), 0},\n#endif\n#ifdef XML_UNICODE_WCHAR_T\n {XML_FEATURE_UNICODE_WCHAR_T, XML_L(\"XML_UNICODE_WCHAR_T\"), 0},\n#endif\n#ifdef XML_DTD\n {XML_FEATURE_DTD, XML_L(\"XML_DTD\"), 0},\n#endif\n#ifdef XML_CONTEXT_BYTES\n {XML_FEATURE_CONTEXT_BYTES, XML_L(\"XML_CONTEXT_BYTES\"),\n XML_CONTEXT_BYTES},\n#endif\n#ifdef XML_MIN_SIZE\n {XML_FEATURE_MIN_SIZE, XML_L(\"XML_MIN_SIZE\"), 0},\n#endif\n#ifdef XML_NS\n {XML_FEATURE_NS, XML_L(\"XML_NS\"), 0},\n#endif\n#ifdef XML_LARGE_SIZE\n {XML_FEATURE_LARGE_SIZE, XML_L(\"XML_LARGE_SIZE\"), 0},\n#endif\n#ifdef XML_ATTR_INFO\n {XML_FEATURE_ATTR_INFO, XML_L(\"XML_ATTR_INFO\"), 0},\n#endif\n {XML_FEATURE_END, NULL, 0}};\n\n return features;\n}\n\n/* Initially tag->rawName always points into the parse buffer;\n for those TAG instances opened while the current parse buffer was\n processed, and not yet closed, we need to store tag->rawName in a more\n permanent location, since the parse buffer is about to be discarded.\n*/\nstatic XML_Bool\nstoreRawNames(XML_Parser parser) {\n TAG *tag = parser->m_tagStack;\n while (tag) {\n int bufSize;\n int nameLen = sizeof(XML_Char) * (tag->name.strLen + 1);\n char *rawNameBuf = tag->buf + nameLen;\n /* Stop if already stored. Since m_tagStack is a stack, we can stop\n at the first entry that has already been copied; everything\n below it in the stack is already been accounted for in a\n previous call to this function.\n */\n if (tag->rawName == rawNameBuf)\n break;\n /* For re-use purposes we need to ensure that the\n size of tag->buf is a multiple of sizeof(XML_Char).\n */\n bufSize = nameLen + ROUND_UP(tag->rawNameLength, sizeof(XML_Char));\n if (bufSize > tag->bufEnd - tag->buf) {\n char *temp = (char *)REALLOC(parser, tag->buf, bufSize);\n if (temp == NULL)\n return XML_FALSE;\n /* if tag->name.str points to tag->buf (only when namespace\n processing is off) then we have to update it\n */\n if (tag->name.str == (XML_Char *)tag->buf)\n tag->name.str = (XML_Char *)temp;\n /* if tag->name.localPart is set (when namespace processing is on)\n then update it as well, since it will always point into tag->buf\n */\n if (tag->name.localPart)\n tag->name.localPart\n = (XML_Char *)temp + (tag->name.localPart - (XML_Char *)tag->buf);\n tag->buf = temp;\n tag->bufEnd = temp + bufSize;\n rawNameBuf = temp + nameLen;\n }\n memcpy(rawNameBuf, tag->rawName, tag->rawNameLength);\n tag->rawName = rawNameBuf;\n tag = tag->parent;\n }\n return XML_TRUE;\n}\n\nstatic enum XML_Error PTRCALL\ncontentProcessor(XML_Parser parser, const char *start, const char *end,\n const char **endPtr) {\n enum XML_Error result\n = doContent(parser, 0, parser->m_encoding, start, end, endPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n if (result == XML_ERROR_NONE) {\n if (! storeRawNames(parser))\n return XML_ERROR_NO_MEMORY;\n }\n return result;\n}\n\nstatic enum XML_Error PTRCALL\nexternalEntityInitProcessor(XML_Parser parser, const char *start,\n const char *end, const char **endPtr) {\n enum XML_Error result = initializeEncoding(parser);\n if (result != XML_ERROR_NONE)\n return result;\n parser->m_processor = externalEntityInitProcessor2;\n return externalEntityInitProcessor2(parser, start, end, endPtr);\n}\n\nstatic enum XML_Error PTRCALL\nexternalEntityInitProcessor2(XML_Parser parser, const char *start,\n const char *end, const char **endPtr) {\n const char *next = start; /* XmlContentTok doesn't always set the last arg */\n int tok = XmlContentTok(parser->m_encoding, start, end, &next);\n switch (tok) {\n case XML_TOK_BOM:\n /* If we are at the end of the buffer, this would cause the next stage,\n i.e. externalEntityInitProcessor3, to pass control directly to\n doContent (by detecting XML_TOK_NONE) without processing any xml text\n declaration - causing the error XML_ERROR_MISPLACED_XML_PI in doContent.\n */\n if (next == end && ! parser->m_parsingStatus.finalBuffer) {\n *endPtr = next;\n return XML_ERROR_NONE;\n }\n start = next;\n break;\n case XML_TOK_PARTIAL:\n if (! parser->m_parsingStatus.finalBuffer) {\n *endPtr = start;\n return XML_ERROR_NONE;\n }\n parser->m_eventPtr = start;\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (! parser->m_parsingStatus.finalBuffer) {\n *endPtr = start;\n return XML_ERROR_NONE;\n }\n parser->m_eventPtr = start;\n return XML_ERROR_PARTIAL_CHAR;\n }\n parser->m_processor = externalEntityInitProcessor3;\n return externalEntityInitProcessor3(parser, start, end, endPtr);\n}\n\nstatic enum XML_Error PTRCALL\nexternalEntityInitProcessor3(XML_Parser parser, const char *start,\n const char *end, const char **endPtr) {\n int tok;\n const char *next = start; /* XmlContentTok doesn't always set the last arg */\n parser->m_eventPtr = start;\n tok = XmlContentTok(parser->m_encoding, start, end, &next);\n parser->m_eventEndPtr = next;\n\n switch (tok) {\n case XML_TOK_XML_DECL: {\n enum XML_Error result;\n result = processXmlDecl(parser, 1, start, next);\n if (result != XML_ERROR_NONE)\n return result;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *endPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:\n start = next;\n }\n } break;\n case XML_TOK_PARTIAL:\n if (! parser->m_parsingStatus.finalBuffer) {\n *endPtr = start;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (! parser->m_parsingStatus.finalBuffer) {\n *endPtr = start;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n }\n parser->m_processor = externalEntityContentProcessor;\n parser->m_tagLevel = 1;\n return externalEntityContentProcessor(parser, start, end, endPtr);\n}\n\nstatic enum XML_Error PTRCALL\nexternalEntityContentProcessor(XML_Parser parser, const char *start,\n const char *end, const char **endPtr) {\n enum XML_Error result\n = doContent(parser, 1, parser->m_encoding, start, end, endPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n if (result == XML_ERROR_NONE) {\n if (! storeRawNames(parser))\n return XML_ERROR_NO_MEMORY;\n }\n return result;\n}\n\nstatic enum XML_Error\ndoContent(XML_Parser parser, int startTagLevel, const ENCODING *enc,\n const char *s, const char *end, const char **nextPtr,\n XML_Bool haveMore) {\n /* save one level of indirection */\n DTD *const dtd = parser->m_dtd;\n\n const char **eventPP;\n const char **eventEndPP;\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n }\n *eventPP = s;\n\n for (;;) {\n const char *next = s; /* XmlContentTok doesn't always set the last arg */\n int tok = XmlContentTok(enc, s, end, &next);\n *eventEndPP = next;\n switch (tok) {\n case XML_TOK_TRAILING_CR:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n *eventEndPP = end;\n if (parser->m_characterDataHandler) {\n XML_Char c = 0xA;\n parser->m_characterDataHandler(parser->m_handlerArg, &c, 1);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, end);\n /* We are at the end of the final buffer, should we check for\n XML_SUSPENDED, XML_FINISHED?\n */\n if (startTagLevel == 0)\n return XML_ERROR_NO_ELEMENTS;\n if (parser->m_tagLevel != startTagLevel)\n return XML_ERROR_ASYNC_ENTITY;\n *nextPtr = end;\n return XML_ERROR_NONE;\n case XML_TOK_NONE:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n if (startTagLevel > 0) {\n if (parser->m_tagLevel != startTagLevel)\n return XML_ERROR_ASYNC_ENTITY;\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_NO_ELEMENTS;\n case XML_TOK_INVALID:\n *eventPP = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_ENTITY_REF: {\n const XML_Char *name;\n ENTITY *entity;\n XML_Char ch = (XML_Char)XmlPredefinedEntityName(\n enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar);\n if (ch) {\n if (parser->m_characterDataHandler)\n parser->m_characterDataHandler(parser->m_handlerArg, &ch, 1);\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n }\n name = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n entity = (ENTITY *)lookup(parser, &dtd->generalEntities, name, 0);\n poolDiscard(&dtd->pool);\n /* First, determine if a check for an existing declaration is needed;\n if yes, check that the entity exists, and that it is internal,\n otherwise call the skipped entity or default handler.\n */\n if (! dtd->hasParamEntityRefs || dtd->standalone) {\n if (! entity)\n return XML_ERROR_UNDEFINED_ENTITY;\n else if (! entity->is_internal)\n return XML_ERROR_ENTITY_DECLARED_IN_PE;\n } else if (! entity) {\n if (parser->m_skippedEntityHandler)\n parser->m_skippedEntityHandler(parser->m_handlerArg, name, 0);\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n }\n if (entity->open)\n return XML_ERROR_RECURSIVE_ENTITY_REF;\n if (entity->notation)\n return XML_ERROR_BINARY_ENTITY_REF;\n if (entity->textPtr) {\n enum XML_Error result;\n if (! parser->m_defaultExpandInternalEntities) {\n if (parser->m_skippedEntityHandler)\n parser->m_skippedEntityHandler(parser->m_handlerArg, entity->name,\n 0);\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n }\n result = processInternalEntity(parser, entity, XML_FALSE);\n if (result != XML_ERROR_NONE)\n return result;\n } else if (parser->m_externalEntityRefHandler) {\n const XML_Char *context;\n entity->open = XML_TRUE;\n context = getContext(parser);\n entity->open = XML_FALSE;\n if (! context)\n return XML_ERROR_NO_MEMORY;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, context, entity->base,\n entity->systemId, entity->publicId))\n return XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n poolDiscard(&parser->m_tempPool);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n }\n case XML_TOK_START_TAG_NO_ATTS:\n /* fall through */\n case XML_TOK_START_TAG_WITH_ATTS: {\n TAG *tag;\n enum XML_Error result;\n XML_Char *toPtr;\n if (parser->m_freeTagList) {\n tag = parser->m_freeTagList;\n parser->m_freeTagList = parser->m_freeTagList->parent;\n } else {\n tag = (TAG *)MALLOC(parser, sizeof(TAG));\n if (! tag)\n return XML_ERROR_NO_MEMORY;\n tag->buf = (char *)MALLOC(parser, INIT_TAG_BUF_SIZE);\n if (! tag->buf) {\n FREE(parser, tag);\n return XML_ERROR_NO_MEMORY;\n }\n tag->bufEnd = tag->buf + INIT_TAG_BUF_SIZE;\n }\n tag->bindings = NULL;\n tag->parent = parser->m_tagStack;\n parser->m_tagStack = tag;\n tag->name.localPart = NULL;\n tag->name.prefix = NULL;\n tag->rawName = s + enc->minBytesPerChar;\n tag->rawNameLength = XmlNameLength(enc, tag->rawName);\n ++parser->m_tagLevel;\n {\n const char *rawNameEnd = tag->rawName + tag->rawNameLength;\n const char *fromPtr = tag->rawName;\n toPtr = (XML_Char *)tag->buf;\n for (;;) {\n int bufSize;\n int convLen;\n const enum XML_Convert_Result convert_res\n = XmlConvert(enc, &fromPtr, rawNameEnd, (ICHAR **)&toPtr,\n (ICHAR *)tag->bufEnd - 1);\n convLen = (int)(toPtr - (XML_Char *)tag->buf);\n if ((fromPtr >= rawNameEnd)\n || (convert_res == XML_CONVERT_INPUT_INCOMPLETE)) {\n tag->name.strLen = convLen;\n break;\n }\n bufSize = (int)(tag->bufEnd - tag->buf) << 1;\n {\n char *temp = (char *)REALLOC(parser, tag->buf, bufSize);\n if (temp == NULL)\n return XML_ERROR_NO_MEMORY;\n tag->buf = temp;\n tag->bufEnd = temp + bufSize;\n toPtr = (XML_Char *)temp + convLen;\n }\n }\n }\n tag->name.str = (XML_Char *)tag->buf;\n *toPtr = XML_T('\\0');\n result = storeAtts(parser, enc, s, &(tag->name), &(tag->bindings));\n if (result)\n return result;\n if (parser->m_startElementHandler)\n parser->m_startElementHandler(parser->m_handlerArg, tag->name.str,\n (const XML_Char **)parser->m_atts);\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n poolClear(&parser->m_tempPool);\n break;\n }\n case XML_TOK_EMPTY_ELEMENT_NO_ATTS:\n /* fall through */\n case XML_TOK_EMPTY_ELEMENT_WITH_ATTS: {\n const char *rawName = s + enc->minBytesPerChar;\n enum XML_Error result;\n BINDING *bindings = NULL;\n XML_Bool noElmHandlers = XML_TRUE;\n TAG_NAME name;\n name.str = poolStoreString(&parser->m_tempPool, enc, rawName,\n rawName + XmlNameLength(enc, rawName));\n if (! name.str)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n result = storeAtts(parser, enc, s, &name, &bindings);\n if (result != XML_ERROR_NONE) {\n freeBindings(parser, bindings);\n return result;\n }\n poolFinish(&parser->m_tempPool);\n if (parser->m_startElementHandler) {\n parser->m_startElementHandler(parser->m_handlerArg, name.str,\n (const XML_Char **)parser->m_atts);\n noElmHandlers = XML_FALSE;\n }\n if (parser->m_endElementHandler) {\n if (parser->m_startElementHandler)\n *eventPP = *eventEndPP;\n parser->m_endElementHandler(parser->m_handlerArg, name.str);\n noElmHandlers = XML_FALSE;\n }\n if (noElmHandlers && parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n poolClear(&parser->m_tempPool);\n freeBindings(parser, bindings);\n }\n if ((parser->m_tagLevel == 0)\n && (parser->m_parsingStatus.parsing != XML_FINISHED)) {\n if (parser->m_parsingStatus.parsing == XML_SUSPENDED)\n parser->m_processor = epilogProcessor;\n else\n return epilogProcessor(parser, next, end, nextPtr);\n }\n break;\n case XML_TOK_END_TAG:\n if (parser->m_tagLevel == startTagLevel)\n return XML_ERROR_ASYNC_ENTITY;\n else {\n int len;\n const char *rawName;\n TAG *tag = parser->m_tagStack;\n parser->m_tagStack = tag->parent;\n tag->parent = parser->m_freeTagList;\n parser->m_freeTagList = tag;\n rawName = s + enc->minBytesPerChar * 2;\n len = XmlNameLength(enc, rawName);\n if (len != tag->rawNameLength\n || memcmp(tag->rawName, rawName, len) != 0) {\n *eventPP = rawName;\n return XML_ERROR_TAG_MISMATCH;\n }\n --parser->m_tagLevel;\n if (parser->m_endElementHandler) {\n const XML_Char *localPart;\n const XML_Char *prefix;\n XML_Char *uri;\n localPart = tag->name.localPart;\n if (parser->m_ns && localPart) {\n /* localPart and prefix may have been overwritten in\n tag->name.str, since this points to the binding->uri\n buffer which gets re-used; so we have to add them again\n */\n uri = (XML_Char *)tag->name.str + tag->name.uriLen;\n /* don't need to check for space - already done in storeAtts() */\n while (*localPart)\n *uri++ = *localPart++;\n prefix = (XML_Char *)tag->name.prefix;\n if (parser->m_ns_triplets && prefix) {\n *uri++ = parser->m_namespaceSeparator;\n while (*prefix)\n *uri++ = *prefix++;\n }\n *uri = XML_T('\\0');\n }\n parser->m_endElementHandler(parser->m_handlerArg, tag->name.str);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n while (tag->bindings) {\n BINDING *b = tag->bindings;\n if (parser->m_endNamespaceDeclHandler)\n parser->m_endNamespaceDeclHandler(parser->m_handlerArg,\n b->prefix->name);\n tag->bindings = tag->bindings->nextTagBinding;\n b->nextTagBinding = parser->m_freeBindingList;\n parser->m_freeBindingList = b;\n b->prefix->binding = b->prevPrefixBinding;\n }\n if ((parser->m_tagLevel == 0)\n && (parser->m_parsingStatus.parsing != XML_FINISHED)) {\n if (parser->m_parsingStatus.parsing == XML_SUSPENDED)\n parser->m_processor = epilogProcessor;\n else\n return epilogProcessor(parser, next, end, nextPtr);\n }\n }\n break;\n case XML_TOK_CHAR_REF: {\n int n = XmlCharRefNumber(enc, s);\n if (n < 0)\n return XML_ERROR_BAD_CHAR_REF;\n if (parser->m_characterDataHandler) {\n XML_Char buf[XML_ENCODE_MAX];\n parser->m_characterDataHandler(parser->m_handlerArg, buf,\n XmlEncode(n, (ICHAR *)buf));\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n } break;\n case XML_TOK_XML_DECL:\n return XML_ERROR_MISPLACED_XML_PI;\n case XML_TOK_DATA_NEWLINE:\n if (parser->m_characterDataHandler) {\n XML_Char c = 0xA;\n parser->m_characterDataHandler(parser->m_handlerArg, &c, 1);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n case XML_TOK_CDATA_SECT_OPEN: {\n enum XML_Error result;\n if (parser->m_startCdataSectionHandler)\n parser->m_startCdataSectionHandler(parser->m_handlerArg);\n /* BEGIN disabled code */\n /* Suppose you doing a transformation on a document that involves\n changing only the character data. You set up a defaultHandler\n and a characterDataHandler. The defaultHandler simply copies\n characters through. The characterDataHandler does the\n transformation and writes the characters out escaping them as\n necessary. This case will fail to work if we leave out the\n following two lines (because & and < inside CDATA sections will\n be incorrectly escaped).\n\n However, now we have a start/endCdataSectionHandler, so it seems\n easier to let the user deal with this.\n */\n else if (0 && parser->m_characterDataHandler)\n parser->m_characterDataHandler(parser->m_handlerArg, parser->m_dataBuf,\n 0);\n /* END disabled code */\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n result = doCdataSection(parser, enc, &next, end, nextPtr, haveMore);\n if (result != XML_ERROR_NONE)\n return result;\n else if (! next) {\n parser->m_processor = cdataSectionProcessor;\n return result;\n }\n } break;\n case XML_TOK_TRAILING_RSQB:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n if (parser->m_characterDataHandler) {\n if (MUST_CONVERT(enc, s)) {\n ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;\n XmlConvert(enc, &s, end, &dataPtr, (ICHAR *)parser->m_dataBufEnd);\n parser->m_characterDataHandler(\n parser->m_handlerArg, parser->m_dataBuf,\n (int)(dataPtr - (ICHAR *)parser->m_dataBuf));\n } else\n parser->m_characterDataHandler(\n parser->m_handlerArg, (XML_Char *)s,\n (int)((XML_Char *)end - (XML_Char *)s));\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, end);\n /* We are at the end of the final buffer, should we check for\n XML_SUSPENDED, XML_FINISHED?\n */\n if (startTagLevel == 0) {\n *eventPP = end;\n return XML_ERROR_NO_ELEMENTS;\n }\n if (parser->m_tagLevel != startTagLevel) {\n *eventPP = end;\n return XML_ERROR_ASYNC_ENTITY;\n }\n *nextPtr = end;\n return XML_ERROR_NONE;\n case XML_TOK_DATA_CHARS: {\n XML_CharacterDataHandler charDataHandler = parser->m_characterDataHandler;\n if (charDataHandler) {\n if (MUST_CONVERT(enc, s)) {\n for (;;) {\n ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;\n const enum XML_Convert_Result convert_res = XmlConvert(\n enc, &s, next, &dataPtr, (ICHAR *)parser->m_dataBufEnd);\n *eventEndPP = s;\n charDataHandler(parser->m_handlerArg, parser->m_dataBuf,\n (int)(dataPtr - (ICHAR *)parser->m_dataBuf));\n if ((convert_res == XML_CONVERT_COMPLETED)\n || (convert_res == XML_CONVERT_INPUT_INCOMPLETE))\n break;\n *eventPP = s;\n }\n } else\n charDataHandler(parser->m_handlerArg, (XML_Char *)s,\n (int)((XML_Char *)next - (XML_Char *)s));\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n } break;\n case XML_TOK_PI:\n if (! reportProcessingInstruction(parser, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_COMMENT:\n if (! reportComment(parser, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n break;\n default:\n /* All of the tokens produced by XmlContentTok() have their own\n * explicit cases, so this default is not strictly necessary.\n * However it is a useful safety net, so we retain the code and\n * simply exclude it from the coverage tests.\n *\n * LCOV_EXCL_START\n */\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n /* LCOV_EXCL_STOP */\n }\n *eventPP = s = next;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:;\n }\n }\n /* not reached */\n}\n\n/* This function does not call free() on the allocated memory, merely\n * moving it to the parser's m_freeBindingList where it can be freed or\n * reused as appropriate.\n */\nstatic void\nfreeBindings(XML_Parser parser, BINDING *bindings) {\n while (bindings) {\n BINDING *b = bindings;\n\n /* m_startNamespaceDeclHandler will have been called for this\n * binding in addBindings(), so call the end handler now.\n */\n if (parser->m_endNamespaceDeclHandler)\n parser->m_endNamespaceDeclHandler(parser->m_handlerArg, b->prefix->name);\n\n bindings = bindings->nextTagBinding;\n b->nextTagBinding = parser->m_freeBindingList;\n parser->m_freeBindingList = b;\n b->prefix->binding = b->prevPrefixBinding;\n }\n}\n\n/* Precondition: all arguments must be non-NULL;\n Purpose:\n - normalize attributes\n - check attributes for well-formedness\n - generate namespace aware attribute names (URI, prefix)\n - build list of attributes for startElementHandler\n - default attributes\n - process namespace declarations (check and report them)\n - generate namespace aware element name (URI, prefix)\n*/\nstatic enum XML_Error\nstoreAtts(XML_Parser parser, const ENCODING *enc, const char *attStr,\n TAG_NAME *tagNamePtr, BINDING **bindingsPtr) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n ELEMENT_TYPE *elementType;\n int nDefaultAtts;\n const XML_Char **appAtts; /* the attribute list for the application */\n int attIndex = 0;\n int prefixLen;\n int i;\n int n;\n XML_Char *uri;\n int nPrefixes = 0;\n BINDING *binding;\n const XML_Char *localPart;\n\n /* lookup the element type name */\n elementType\n = (ELEMENT_TYPE *)lookup(parser, &dtd->elementTypes, tagNamePtr->str, 0);\n if (! elementType) {\n const XML_Char *name = poolCopyString(&dtd->pool, tagNamePtr->str);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n elementType = (ELEMENT_TYPE *)lookup(parser, &dtd->elementTypes, name,\n sizeof(ELEMENT_TYPE));\n if (! elementType)\n return XML_ERROR_NO_MEMORY;\n if (parser->m_ns && ! setElementTypePrefix(parser, elementType))\n return XML_ERROR_NO_MEMORY;\n }\n nDefaultAtts = elementType->nDefaultAtts;\n\n /* get the attributes from the tokenizer */\n n = XmlGetAttributes(enc, attStr, parser->m_attsSize, parser->m_atts);\n if (n + nDefaultAtts > parser->m_attsSize) {\n int oldAttsSize = parser->m_attsSize;\n ATTRIBUTE *temp;\n#ifdef XML_ATTR_INFO\n XML_AttrInfo *temp2;\n#endif\n parser->m_attsSize = n + nDefaultAtts + INIT_ATTS_SIZE;\n temp = (ATTRIBUTE *)REALLOC(parser, (void *)parser->m_atts,\n parser->m_attsSize * sizeof(ATTRIBUTE));\n if (temp == NULL) {\n parser->m_attsSize = oldAttsSize;\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_atts = temp;\n#ifdef XML_ATTR_INFO\n temp2 = (XML_AttrInfo *)REALLOC(parser, (void *)parser->m_attInfo,\n parser->m_attsSize * sizeof(XML_AttrInfo));\n if (temp2 == NULL) {\n parser->m_attsSize = oldAttsSize;\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_attInfo = temp2;\n#endif\n if (n > oldAttsSize)\n XmlGetAttributes(enc, attStr, n, parser->m_atts);\n }\n\n appAtts = (const XML_Char **)parser->m_atts;\n for (i = 0; i < n; i++) {\n ATTRIBUTE *currAtt = &parser->m_atts[i];\n#ifdef XML_ATTR_INFO\n XML_AttrInfo *currAttInfo = &parser->m_attInfo[i];\n#endif\n /* add the name and value to the attribute list */\n ATTRIBUTE_ID *attId\n = getAttributeId(parser, enc, currAtt->name,\n currAtt->name + XmlNameLength(enc, currAtt->name));\n if (! attId)\n return XML_ERROR_NO_MEMORY;\n#ifdef XML_ATTR_INFO\n currAttInfo->nameStart\n = parser->m_parseEndByteIndex - (parser->m_parseEndPtr - currAtt->name);\n currAttInfo->nameEnd\n = currAttInfo->nameStart + XmlNameLength(enc, currAtt->name);\n currAttInfo->valueStart = parser->m_parseEndByteIndex\n - (parser->m_parseEndPtr - currAtt->valuePtr);\n currAttInfo->valueEnd = parser->m_parseEndByteIndex\n - (parser->m_parseEndPtr - currAtt->valueEnd);\n#endif\n /* Detect duplicate attributes by their QNames. This does not work when\n namespace processing is turned on and different prefixes for the same\n namespace are used. For this case we have a check further down.\n */\n if ((attId->name)[-1]) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = parser->m_atts[i].name;\n return XML_ERROR_DUPLICATE_ATTRIBUTE;\n }\n (attId->name)[-1] = 1;\n appAtts[attIndex++] = attId->name;\n if (! parser->m_atts[i].normalized) {\n enum XML_Error result;\n XML_Bool isCdata = XML_TRUE;\n\n /* figure out whether declared as other than CDATA */\n if (attId->maybeTokenized) {\n int j;\n for (j = 0; j < nDefaultAtts; j++) {\n if (attId == elementType->defaultAtts[j].id) {\n isCdata = elementType->defaultAtts[j].isCdata;\n break;\n }\n }\n }\n\n /* normalize the attribute value */\n result = storeAttributeValue(\n parser, enc, isCdata, parser->m_atts[i].valuePtr,\n parser->m_atts[i].valueEnd, &parser->m_tempPool);\n if (result)\n return result;\n appAtts[attIndex] = poolStart(&parser->m_tempPool);\n poolFinish(&parser->m_tempPool);\n } else {\n /* the value did not need normalizing */\n appAtts[attIndex] = poolStoreString(&parser->m_tempPool, enc,\n parser->m_atts[i].valuePtr,\n parser->m_atts[i].valueEnd);\n if (appAtts[attIndex] == 0)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n }\n /* handle prefixed attribute names */\n if (attId->prefix) {\n if (attId->xmlns) {\n /* deal with namespace declarations here */\n enum XML_Error result = addBinding(parser, attId->prefix, attId,\n appAtts[attIndex], bindingsPtr);\n if (result)\n return result;\n --attIndex;\n } else {\n /* deal with other prefixed names later */\n attIndex++;\n nPrefixes++;\n (attId->name)[-1] = 2;\n }\n } else\n attIndex++;\n }\n\n /* set-up for XML_GetSpecifiedAttributeCount and XML_GetIdAttributeIndex */\n parser->m_nSpecifiedAtts = attIndex;\n if (elementType->idAtt && (elementType->idAtt->name)[-1]) {\n for (i = 0; i < attIndex; i += 2)\n if (appAtts[i] == elementType->idAtt->name) {\n parser->m_idAttIndex = i;\n break;\n }\n } else\n parser->m_idAttIndex = -1;\n\n /* do attribute defaulting */\n for (i = 0; i < nDefaultAtts; i++) {\n const DEFAULT_ATTRIBUTE *da = elementType->defaultAtts + i;\n if (! (da->id->name)[-1] && da->value) {\n if (da->id->prefix) {\n if (da->id->xmlns) {\n enum XML_Error result = addBinding(parser, da->id->prefix, da->id,\n da->value, bindingsPtr);\n if (result)\n return result;\n } else {\n (da->id->name)[-1] = 2;\n nPrefixes++;\n appAtts[attIndex++] = da->id->name;\n appAtts[attIndex++] = da->value;\n }\n } else {\n (da->id->name)[-1] = 1;\n appAtts[attIndex++] = da->id->name;\n appAtts[attIndex++] = da->value;\n }\n }\n }\n appAtts[attIndex] = 0;\n\n /* expand prefixed attribute names, check for duplicates,\n and clear flags that say whether attributes were specified */\n i = 0;\n if (nPrefixes) {\n int j; /* hash table index */\n unsigned long version = parser->m_nsAttsVersion;\n int nsAttsSize = (int)1 << parser->m_nsAttsPower;\n unsigned char oldNsAttsPower = parser->m_nsAttsPower;\n /* size of hash table must be at least 2 * (# of prefixed attributes) */\n if ((nPrefixes << 1)\n >> parser->m_nsAttsPower) { /* true for m_nsAttsPower = 0 */\n NS_ATT *temp;\n /* hash table size must also be a power of 2 and >= 8 */\n while (nPrefixes >> parser->m_nsAttsPower++)\n ;\n if (parser->m_nsAttsPower < 3)\n parser->m_nsAttsPower = 3;\n nsAttsSize = (int)1 << parser->m_nsAttsPower;\n temp = (NS_ATT *)REALLOC(parser, parser->m_nsAtts,\n nsAttsSize * sizeof(NS_ATT));\n if (! temp) {\n /* Restore actual size of memory in m_nsAtts */\n parser->m_nsAttsPower = oldNsAttsPower;\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_nsAtts = temp;\n version = 0; /* force re-initialization of m_nsAtts hash table */\n }\n /* using a version flag saves us from initializing m_nsAtts every time */\n if (! version) { /* initialize version flags when version wraps around */\n version = INIT_ATTS_VERSION;\n for (j = nsAttsSize; j != 0;)\n parser->m_nsAtts[--j].version = version;\n }\n parser->m_nsAttsVersion = --version;\n\n /* expand prefixed names and check for duplicates */\n for (; i < attIndex; i += 2) {\n const XML_Char *s = appAtts[i];\n if (s[-1] == 2) { /* prefixed */\n ATTRIBUTE_ID *id;\n const BINDING *b;\n unsigned long uriHash;\n struct siphash sip_state;\n struct sipkey sip_key;\n\n copy_salt_to_sipkey(parser, &sip_key);\n sip24_init(&sip_state, &sip_key);\n\n ((XML_Char *)s)[-1] = 0; /* clear flag */\n id = (ATTRIBUTE_ID *)lookup(parser, &dtd->attributeIds, s, 0);\n if (! id || ! id->prefix) {\n /* This code is walking through the appAtts array, dealing\n * with (in this case) a prefixed attribute name. To be in\n * the array, the attribute must have already been bound, so\n * has to have passed through the hash table lookup once\n * already. That implies that an entry for it already\n * exists, so the lookup above will return a pointer to\n * already allocated memory. There is no opportunaity for\n * the allocator to fail, so the condition above cannot be\n * fulfilled.\n *\n * Since it is difficult to be certain that the above\n * analysis is complete, we retain the test and merely\n * remove the code from coverage tests.\n */\n return XML_ERROR_NO_MEMORY; /* LCOV_EXCL_LINE */\n }\n b = id->prefix->binding;\n if (! b)\n return XML_ERROR_UNBOUND_PREFIX;\n\n for (j = 0; j < b->uriLen; j++) {\n const XML_Char c = b->uri[j];\n if (! poolAppendChar(&parser->m_tempPool, c))\n return XML_ERROR_NO_MEMORY;\n }\n\n sip24_update(&sip_state, b->uri, b->uriLen * sizeof(XML_Char));\n\n while (*s++ != XML_T(ASCII_COLON))\n ;\n\n sip24_update(&sip_state, s, keylen(s) * sizeof(XML_Char));\n\n do { /* copies null terminator */\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return XML_ERROR_NO_MEMORY;\n } while (*s++);\n\n uriHash = (unsigned long)sip24_final(&sip_state);\n\n { /* Check hash table for duplicate of expanded name (uriName).\n Derived from code in lookup(parser, HASH_TABLE *table, ...).\n */\n unsigned char step = 0;\n unsigned long mask = nsAttsSize - 1;\n j = uriHash & mask; /* index into hash table */\n while (parser->m_nsAtts[j].version == version) {\n /* for speed we compare stored hash values first */\n if (uriHash == parser->m_nsAtts[j].hash) {\n const XML_Char *s1 = poolStart(&parser->m_tempPool);\n const XML_Char *s2 = parser->m_nsAtts[j].uriName;\n /* s1 is null terminated, but not s2 */\n for (; *s1 == *s2 && *s1 != 0; s1++, s2++)\n ;\n if (*s1 == 0)\n return XML_ERROR_DUPLICATE_ATTRIBUTE;\n }\n if (! step)\n step = PROBE_STEP(uriHash, mask, parser->m_nsAttsPower);\n j < step ? (j += nsAttsSize - step) : (j -= step);\n }\n }\n\n if (parser->m_ns_triplets) { /* append namespace separator and prefix */\n parser->m_tempPool.ptr[-1] = parser->m_namespaceSeparator;\n s = b->prefix->name;\n do {\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return XML_ERROR_NO_MEMORY;\n } while (*s++);\n }\n\n /* store expanded name in attribute list */\n s = poolStart(&parser->m_tempPool);\n poolFinish(&parser->m_tempPool);\n appAtts[i] = s;\n\n /* fill empty slot with new version, uriName and hash value */\n parser->m_nsAtts[j].version = version;\n parser->m_nsAtts[j].hash = uriHash;\n parser->m_nsAtts[j].uriName = s;\n\n if (! --nPrefixes) {\n i += 2;\n break;\n }\n } else /* not prefixed */\n ((XML_Char *)s)[-1] = 0; /* clear flag */\n }\n }\n /* clear flags for the remaining attributes */\n for (; i < attIndex; i += 2)\n ((XML_Char *)(appAtts[i]))[-1] = 0;\n for (binding = *bindingsPtr; binding; binding = binding->nextTagBinding)\n binding->attId->name[-1] = 0;\n\n if (! parser->m_ns)\n return XML_ERROR_NONE;\n\n /* expand the element type name */\n if (elementType->prefix) {\n binding = elementType->prefix->binding;\n if (! binding)\n return XML_ERROR_UNBOUND_PREFIX;\n localPart = tagNamePtr->str;\n while (*localPart++ != XML_T(ASCII_COLON))\n ;\n } else if (dtd->defaultPrefix.binding) {\n binding = dtd->defaultPrefix.binding;\n localPart = tagNamePtr->str;\n } else\n return XML_ERROR_NONE;\n prefixLen = 0;\n if (parser->m_ns_triplets && binding->prefix->name) {\n for (; binding->prefix->name[prefixLen++];)\n ; /* prefixLen includes null terminator */\n }\n tagNamePtr->localPart = localPart;\n tagNamePtr->uriLen = binding->uriLen;\n tagNamePtr->prefix = binding->prefix->name;\n tagNamePtr->prefixLen = prefixLen;\n for (i = 0; localPart[i++];)\n ; /* i includes null terminator */\n n = i + binding->uriLen + prefixLen;\n if (n > binding->uriAlloc) {\n TAG *p;\n uri = (XML_Char *)MALLOC(parser, (n + EXPAND_SPARE) * sizeof(XML_Char));\n if (! uri)\n return XML_ERROR_NO_MEMORY;\n binding->uriAlloc = n + EXPAND_SPARE;\n memcpy(uri, binding->uri, binding->uriLen * sizeof(XML_Char));\n for (p = parser->m_tagStack; p; p = p->parent)\n if (p->name.str == binding->uri)\n p->name.str = uri;\n FREE(parser, binding->uri);\n binding->uri = uri;\n }\n /* if m_namespaceSeparator != '\\0' then uri includes it already */\n uri = binding->uri + binding->uriLen;\n memcpy(uri, localPart, i * sizeof(XML_Char));\n /* we always have a namespace separator between localPart and prefix */\n if (prefixLen) {\n uri += i - 1;\n *uri = parser->m_namespaceSeparator; /* replace null terminator */\n memcpy(uri + 1, binding->prefix->name, prefixLen * sizeof(XML_Char));\n }\n tagNamePtr->str = binding->uri;\n return XML_ERROR_NONE;\n}\n\n/* addBinding() overwrites the value of prefix->binding without checking.\n Therefore one must keep track of the old value outside of addBinding().\n*/\nstatic enum XML_Error\naddBinding(XML_Parser parser, PREFIX *prefix, const ATTRIBUTE_ID *attId,\n const XML_Char *uri, BINDING **bindingsPtr) {\n static const XML_Char xmlNamespace[]\n = {ASCII_h, ASCII_t, ASCII_t, ASCII_p, ASCII_COLON,\n ASCII_SLASH, ASCII_SLASH, ASCII_w, ASCII_w, ASCII_w,\n ASCII_PERIOD, ASCII_w, ASCII_3, ASCII_PERIOD, ASCII_o,\n ASCII_r, ASCII_g, ASCII_SLASH, ASCII_X, ASCII_M,\n ASCII_L, ASCII_SLASH, ASCII_1, ASCII_9, ASCII_9,\n ASCII_8, ASCII_SLASH, ASCII_n, ASCII_a, ASCII_m,\n ASCII_e, ASCII_s, ASCII_p, ASCII_a, ASCII_c,\n ASCII_e, '\\0'};\n static const int xmlLen = (int)sizeof(xmlNamespace) / sizeof(XML_Char) - 1;\n static const XML_Char xmlnsNamespace[]\n = {ASCII_h, ASCII_t, ASCII_t, ASCII_p, ASCII_COLON, ASCII_SLASH,\n ASCII_SLASH, ASCII_w, ASCII_w, ASCII_w, ASCII_PERIOD, ASCII_w,\n ASCII_3, ASCII_PERIOD, ASCII_o, ASCII_r, ASCII_g, ASCII_SLASH,\n ASCII_2, ASCII_0, ASCII_0, ASCII_0, ASCII_SLASH, ASCII_x,\n ASCII_m, ASCII_l, ASCII_n, ASCII_s, ASCII_SLASH, '\\0'};\n static const int xmlnsLen\n = (int)sizeof(xmlnsNamespace) / sizeof(XML_Char) - 1;\n\n XML_Bool mustBeXML = XML_FALSE;\n XML_Bool isXML = XML_TRUE;\n XML_Bool isXMLNS = XML_TRUE;\n\n BINDING *b;\n int len;\n\n /* empty URI is only valid for default namespace per XML NS 1.0 (not 1.1) */\n if (*uri == XML_T('\\0') && prefix->name)\n return XML_ERROR_UNDECLARING_PREFIX;\n\n if (prefix->name && prefix->name[0] == XML_T(ASCII_x)\n && prefix->name[1] == XML_T(ASCII_m)\n && prefix->name[2] == XML_T(ASCII_l)) {\n /* Not allowed to bind xmlns */\n if (prefix->name[3] == XML_T(ASCII_n) && prefix->name[4] == XML_T(ASCII_s)\n && prefix->name[5] == XML_T('\\0'))\n return XML_ERROR_RESERVED_PREFIX_XMLNS;\n\n if (prefix->name[3] == XML_T('\\0'))\n mustBeXML = XML_TRUE;\n }\n\n for (len = 0; uri[len]; len++) {\n if (isXML && (len > xmlLen || uri[len] != xmlNamespace[len]))\n isXML = XML_FALSE;\n\n if (! mustBeXML && isXMLNS\n && (len > xmlnsLen || uri[len] != xmlnsNamespace[len]))\n isXMLNS = XML_FALSE;\n }\n isXML = isXML && len == xmlLen;\n isXMLNS = isXMLNS && len == xmlnsLen;\n\n if (mustBeXML != isXML)\n return mustBeXML ? XML_ERROR_RESERVED_PREFIX_XML\n : XML_ERROR_RESERVED_NAMESPACE_URI;\n\n if (isXMLNS)\n return XML_ERROR_RESERVED_NAMESPACE_URI;\n\n if (parser->m_namespaceSeparator)\n len++;\n if (parser->m_freeBindingList) {\n b = parser->m_freeBindingList;\n if (len > b->uriAlloc) {\n XML_Char *temp = (XML_Char *)REALLOC(\n parser, b->uri, sizeof(XML_Char) * (len + EXPAND_SPARE));\n if (temp == NULL)\n return XML_ERROR_NO_MEMORY;\n b->uri = temp;\n b->uriAlloc = len + EXPAND_SPARE;\n }\n parser->m_freeBindingList = b->nextTagBinding;\n } else {\n b = (BINDING *)MALLOC(parser, sizeof(BINDING));\n if (! b)\n return XML_ERROR_NO_MEMORY;\n b->uri\n = (XML_Char *)MALLOC(parser, sizeof(XML_Char) * (len + EXPAND_SPARE));\n if (! b->uri) {\n FREE(parser, b);\n return XML_ERROR_NO_MEMORY;\n }\n b->uriAlloc = len + EXPAND_SPARE;\n }\n b->uriLen = len;\n memcpy(b->uri, uri, len * sizeof(XML_Char));\n if (parser->m_namespaceSeparator)\n b->uri[len - 1] = parser->m_namespaceSeparator;\n b->prefix = prefix;\n b->attId = attId;\n b->prevPrefixBinding = prefix->binding;\n /* NULL binding when default namespace undeclared */\n if (*uri == XML_T('\\0') && prefix == &parser->m_dtd->defaultPrefix)\n prefix->binding = NULL;\n else\n prefix->binding = b;\n b->nextTagBinding = *bindingsPtr;\n *bindingsPtr = b;\n /* if attId == NULL then we are not starting a namespace scope */\n if (attId && parser->m_startNamespaceDeclHandler)\n parser->m_startNamespaceDeclHandler(parser->m_handlerArg, prefix->name,\n prefix->binding ? uri : 0);\n return XML_ERROR_NONE;\n}\n\n/* The idea here is to avoid using stack for each CDATA section when\n the whole file is parsed with one call.\n*/\nstatic enum XML_Error PTRCALL\ncdataSectionProcessor(XML_Parser parser, const char *start, const char *end,\n const char **endPtr) {\n enum XML_Error result\n = doCdataSection(parser, parser->m_encoding, &start, end, endPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n if (result != XML_ERROR_NONE)\n return result;\n if (start) {\n if (parser->m_parentParser) { /* we are parsing an external entity */\n parser->m_processor = externalEntityContentProcessor;\n return externalEntityContentProcessor(parser, start, end, endPtr);\n } else {\n parser->m_processor = contentProcessor;\n return contentProcessor(parser, start, end, endPtr);\n }\n }\n return result;\n}\n\n/* startPtr gets set to non-null if the section is closed, and to null if\n the section is not yet closed.\n*/\nstatic enum XML_Error\ndoCdataSection(XML_Parser parser, const ENCODING *enc, const char **startPtr,\n const char *end, const char **nextPtr, XML_Bool haveMore) {\n const char *s = *startPtr;\n const char **eventPP;\n const char **eventEndPP;\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n *eventPP = s;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n }\n *eventPP = s;\n *startPtr = NULL;\n\n for (;;) {\n const char *next;\n int tok = XmlCdataSectionTok(enc, s, end, &next);\n *eventEndPP = next;\n switch (tok) {\n case XML_TOK_CDATA_SECT_CLOSE:\n if (parser->m_endCdataSectionHandler)\n parser->m_endCdataSectionHandler(parser->m_handlerArg);\n /* BEGIN disabled code */\n /* see comment under XML_TOK_CDATA_SECT_OPEN */\n else if (0 && parser->m_characterDataHandler)\n parser->m_characterDataHandler(parser->m_handlerArg, parser->m_dataBuf,\n 0);\n /* END disabled code */\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n *startPtr = next;\n *nextPtr = next;\n if (parser->m_parsingStatus.parsing == XML_FINISHED)\n return XML_ERROR_ABORTED;\n else\n return XML_ERROR_NONE;\n case XML_TOK_DATA_NEWLINE:\n if (parser->m_characterDataHandler) {\n XML_Char c = 0xA;\n parser->m_characterDataHandler(parser->m_handlerArg, &c, 1);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n case XML_TOK_DATA_CHARS: {\n XML_CharacterDataHandler charDataHandler = parser->m_characterDataHandler;\n if (charDataHandler) {\n if (MUST_CONVERT(enc, s)) {\n for (;;) {\n ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;\n const enum XML_Convert_Result convert_res = XmlConvert(\n enc, &s, next, &dataPtr, (ICHAR *)parser->m_dataBufEnd);\n *eventEndPP = next;\n charDataHandler(parser->m_handlerArg, parser->m_dataBuf,\n (int)(dataPtr - (ICHAR *)parser->m_dataBuf));\n if ((convert_res == XML_CONVERT_COMPLETED)\n || (convert_res == XML_CONVERT_INPUT_INCOMPLETE))\n break;\n *eventPP = s;\n }\n } else\n charDataHandler(parser->m_handlerArg, (XML_Char *)s,\n (int)((XML_Char *)next - (XML_Char *)s));\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n } break;\n case XML_TOK_INVALID:\n *eventPP = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_PARTIAL:\n case XML_TOK_NONE:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_UNCLOSED_CDATA_SECTION;\n default:\n /* Every token returned by XmlCdataSectionTok() has its own\n * explicit case, so this default case will never be executed.\n * We retain it as a safety net and exclude it from the coverage\n * statistics.\n *\n * LCOV_EXCL_START\n */\n *eventPP = next;\n return XML_ERROR_UNEXPECTED_STATE;\n /* LCOV_EXCL_STOP */\n }\n\n *eventPP = s = next;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:;\n }\n }\n /* not reached */\n}\n\n#ifdef XML_DTD\n\n/* The idea here is to avoid using stack for each IGNORE section when\n the whole file is parsed with one call.\n*/\nstatic enum XML_Error PTRCALL\nignoreSectionProcessor(XML_Parser parser, const char *start, const char *end,\n const char **endPtr) {\n enum XML_Error result\n = doIgnoreSection(parser, parser->m_encoding, &start, end, endPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n if (result != XML_ERROR_NONE)\n return result;\n if (start) {\n parser->m_processor = prologProcessor;\n return prologProcessor(parser, start, end, endPtr);\n }\n return result;\n}\n\n/* startPtr gets set to non-null is the section is closed, and to null\n if the section is not yet closed.\n*/\nstatic enum XML_Error\ndoIgnoreSection(XML_Parser parser, const ENCODING *enc, const char **startPtr,\n const char *end, const char **nextPtr, XML_Bool haveMore) {\n const char *next;\n int tok;\n const char *s = *startPtr;\n const char **eventPP;\n const char **eventEndPP;\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n *eventPP = s;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n /* It's not entirely clear, but it seems the following two lines\n * of code cannot be executed. The only occasions on which 'enc'\n * is not 'encoding' are when this function is called\n * from the internal entity processing, and IGNORE sections are an\n * error in internal entities.\n *\n * Since it really isn't clear that this is true, we keep the code\n * and just remove it from our coverage tests.\n *\n * LCOV_EXCL_START\n */\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n /* LCOV_EXCL_STOP */\n }\n *eventPP = s;\n *startPtr = NULL;\n tok = XmlIgnoreSectionTok(enc, s, end, &next);\n *eventEndPP = next;\n switch (tok) {\n case XML_TOK_IGNORE_SECT:\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n *startPtr = next;\n *nextPtr = next;\n if (parser->m_parsingStatus.parsing == XML_FINISHED)\n return XML_ERROR_ABORTED;\n else\n return XML_ERROR_NONE;\n case XML_TOK_INVALID:\n *eventPP = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_PARTIAL:\n case XML_TOK_NONE:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_SYNTAX; /* XML_ERROR_UNCLOSED_IGNORE_SECTION */\n default:\n /* All of the tokens that XmlIgnoreSectionTok() returns have\n * explicit cases to handle them, so this default case is never\n * executed. We keep it as a safety net anyway, and remove it\n * from our test coverage statistics.\n *\n * LCOV_EXCL_START\n */\n *eventPP = next;\n return XML_ERROR_UNEXPECTED_STATE;\n /* LCOV_EXCL_STOP */\n }\n /* not reached */\n}\n\n#endif /* XML_DTD */\n\nstatic enum XML_Error\ninitializeEncoding(XML_Parser parser) {\n const char *s;\n#ifdef XML_UNICODE\n char encodingBuf[128];\n /* See comments abount `protoclEncodingName` in parserInit() */\n if (! parser->m_protocolEncodingName)\n s = NULL;\n else {\n int i;\n for (i = 0; parser->m_protocolEncodingName[i]; i++) {\n if (i == sizeof(encodingBuf) - 1\n || (parser->m_protocolEncodingName[i] & ~0x7f) != 0) {\n encodingBuf[0] = '\\0';\n break;\n }\n encodingBuf[i] = (char)parser->m_protocolEncodingName[i];\n }\n encodingBuf[i] = '\\0';\n s = encodingBuf;\n }\n#else\n s = parser->m_protocolEncodingName;\n#endif\n if ((parser->m_ns ? XmlInitEncodingNS : XmlInitEncoding)(\n &parser->m_initEncoding, &parser->m_encoding, s))\n return XML_ERROR_NONE;\n return handleUnknownEncoding(parser, parser->m_protocolEncodingName);\n}\n\nstatic enum XML_Error\nprocessXmlDecl(XML_Parser parser, int isGeneralTextEntity, const char *s,\n const char *next) {\n const char *encodingName = NULL;\n const XML_Char *storedEncName = NULL;\n const ENCODING *newEncoding = NULL;\n const char *version = NULL;\n const char *versionend;\n const XML_Char *storedversion = NULL;\n int standalone = -1;\n if (! (parser->m_ns ? XmlParseXmlDeclNS : XmlParseXmlDecl)(\n isGeneralTextEntity, parser->m_encoding, s, next, &parser->m_eventPtr,\n &version, &versionend, &encodingName, &newEncoding, &standalone)) {\n if (isGeneralTextEntity)\n return XML_ERROR_TEXT_DECL;\n else\n return XML_ERROR_XML_DECL;\n }\n if (! isGeneralTextEntity && standalone == 1) {\n parser->m_dtd->standalone = XML_TRUE;\n#ifdef XML_DTD\n if (parser->m_paramEntityParsing\n == XML_PARAM_ENTITY_PARSING_UNLESS_STANDALONE)\n parser->m_paramEntityParsing = XML_PARAM_ENTITY_PARSING_NEVER;\n#endif /* XML_DTD */\n }\n if (parser->m_xmlDeclHandler) {\n if (encodingName != NULL) {\n storedEncName = poolStoreString(\n &parser->m_temp2Pool, parser->m_encoding, encodingName,\n encodingName + XmlNameLength(parser->m_encoding, encodingName));\n if (! storedEncName)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_temp2Pool);\n }\n if (version) {\n storedversion\n = poolStoreString(&parser->m_temp2Pool, parser->m_encoding, version,\n versionend - parser->m_encoding->minBytesPerChar);\n if (! storedversion)\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_xmlDeclHandler(parser->m_handlerArg, storedversion, storedEncName,\n standalone);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, parser->m_encoding, s, next);\n if (parser->m_protocolEncodingName == NULL) {\n if (newEncoding) {\n /* Check that the specified encoding does not conflict with what\n * the parser has already deduced. Do we have the same number\n * of bytes in the smallest representation of a character? If\n * this is UTF-16, is it the same endianness?\n */\n if (newEncoding->minBytesPerChar != parser->m_encoding->minBytesPerChar\n || (newEncoding->minBytesPerChar == 2\n && newEncoding != parser->m_encoding)) {\n parser->m_eventPtr = encodingName;\n return XML_ERROR_INCORRECT_ENCODING;\n }\n parser->m_encoding = newEncoding;\n } else if (encodingName) {\n enum XML_Error result;\n if (! storedEncName) {\n storedEncName = poolStoreString(\n &parser->m_temp2Pool, parser->m_encoding, encodingName,\n encodingName + XmlNameLength(parser->m_encoding, encodingName));\n if (! storedEncName)\n return XML_ERROR_NO_MEMORY;\n }\n result = handleUnknownEncoding(parser, storedEncName);\n poolClear(&parser->m_temp2Pool);\n if (result == XML_ERROR_UNKNOWN_ENCODING)\n parser->m_eventPtr = encodingName;\n return result;\n }\n }\n\n if (storedEncName || storedversion)\n poolClear(&parser->m_temp2Pool);\n\n return XML_ERROR_NONE;\n}\n\nstatic enum XML_Error\nhandleUnknownEncoding(XML_Parser parser, const XML_Char *encodingName) {\n if (parser->m_unknownEncodingHandler) {\n XML_Encoding info;\n int i;\n for (i = 0; i < 256; i++)\n info.map[i] = -1;\n info.convert = NULL;\n info.data = NULL;\n info.release = NULL;\n if (parser->m_unknownEncodingHandler(parser->m_unknownEncodingHandlerData,\n encodingName, &info)) {\n ENCODING *enc;\n parser->m_unknownEncodingMem = MALLOC(parser, XmlSizeOfUnknownEncoding());\n if (! parser->m_unknownEncodingMem) {\n if (info.release)\n info.release(info.data);\n return XML_ERROR_NO_MEMORY;\n }\n enc = (parser->m_ns ? XmlInitUnknownEncodingNS : XmlInitUnknownEncoding)(\n parser->m_unknownEncodingMem, info.map, info.convert, info.data);\n if (enc) {\n parser->m_unknownEncodingData = info.data;\n parser->m_unknownEncodingRelease = info.release;\n parser->m_encoding = enc;\n return XML_ERROR_NONE;\n }\n }\n if (info.release != NULL)\n info.release(info.data);\n }\n return XML_ERROR_UNKNOWN_ENCODING;\n}\n\nstatic enum XML_Error PTRCALL\nprologInitProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n enum XML_Error result = initializeEncoding(parser);\n if (result != XML_ERROR_NONE)\n return result;\n parser->m_processor = prologProcessor;\n return prologProcessor(parser, s, end, nextPtr);\n}\n\n#ifdef XML_DTD\n\nstatic enum XML_Error PTRCALL\nexternalParEntInitProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n enum XML_Error result = initializeEncoding(parser);\n if (result != XML_ERROR_NONE)\n return result;\n\n /* we know now that XML_Parse(Buffer) has been called,\n so we consider the external parameter entity read */\n parser->m_dtd->paramEntityRead = XML_TRUE;\n\n if (parser->m_prologState.inEntityValue) {\n parser->m_processor = entityValueInitProcessor;\n return entityValueInitProcessor(parser, s, end, nextPtr);\n } else {\n parser->m_processor = externalParEntProcessor;\n return externalParEntProcessor(parser, s, end, nextPtr);\n }\n}\n\nstatic enum XML_Error PTRCALL\nentityValueInitProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n int tok;\n const char *start = s;\n const char *next = start;\n parser->m_eventPtr = start;\n\n for (;;) {\n tok = XmlPrologTok(parser->m_encoding, start, end, &next);\n parser->m_eventEndPtr = next;\n if (tok <= 0) {\n if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_NONE: /* start == end */\n default:\n break;\n }\n /* found end of entity value - can store it now */\n return storeEntityValue(parser, parser->m_encoding, s, end);\n } else if (tok == XML_TOK_XML_DECL) {\n enum XML_Error result;\n result = processXmlDecl(parser, 0, start, next);\n if (result != XML_ERROR_NONE)\n return result;\n /* At this point, m_parsingStatus.parsing cannot be XML_SUSPENDED. For\n * that to happen, a parameter entity parsing handler must have attempted\n * to suspend the parser, which fails and raises an error. The parser can\n * be aborted, but can't be suspended.\n */\n if (parser->m_parsingStatus.parsing == XML_FINISHED)\n return XML_ERROR_ABORTED;\n *nextPtr = next;\n /* stop scanning for text declaration - we found one */\n parser->m_processor = entityValueProcessor;\n return entityValueProcessor(parser, next, end, nextPtr);\n }\n /* If we are at the end of the buffer, this would cause XmlPrologTok to\n return XML_TOK_NONE on the next call, which would then cause the\n function to exit with *nextPtr set to s - that is what we want for other\n tokens, but not for the BOM - we would rather like to skip it;\n then, when this routine is entered the next time, XmlPrologTok will\n return XML_TOK_INVALID, since the BOM is still in the buffer\n */\n else if (tok == XML_TOK_BOM && next == end\n && ! parser->m_parsingStatus.finalBuffer) {\n *nextPtr = next;\n return XML_ERROR_NONE;\n }\n /* If we get this token, we have the start of what might be a\n normal tag, but not a declaration (i.e. it doesn't begin with\n \"m_eventPtr = start;\n }\n}\n\nstatic enum XML_Error PTRCALL\nexternalParEntProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n const char *next = s;\n int tok;\n\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n if (tok <= 0) {\n if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_NONE: /* start == end */\n default:\n break;\n }\n }\n /* This would cause the next stage, i.e. doProlog to be passed XML_TOK_BOM.\n However, when parsing an external subset, doProlog will not accept a BOM\n as valid, and report a syntax error, so we have to skip the BOM\n */\n else if (tok == XML_TOK_BOM) {\n s = next;\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n }\n\n parser->m_processor = prologProcessor;\n return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n}\n\nstatic enum XML_Error PTRCALL\nentityValueProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n const char *start = s;\n const char *next = s;\n const ENCODING *enc = parser->m_encoding;\n int tok;\n\n for (;;) {\n tok = XmlPrologTok(enc, start, end, &next);\n if (tok <= 0) {\n if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_NONE: /* start == end */\n default:\n break;\n }\n /* found end of entity value - can store it now */\n return storeEntityValue(parser, enc, s, end);\n }\n start = next;\n }\n}\n\n#endif /* XML_DTD */\n\nstatic enum XML_Error PTRCALL\nprologProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n const char *next = s;\n int tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n}\n\nstatic enum XML_Error\ndoProlog(XML_Parser parser, const ENCODING *enc, const char *s, const char *end,\n int tok, const char *next, const char **nextPtr, XML_Bool haveMore) {\n#ifdef XML_DTD\n static const XML_Char externalSubsetName[] = {ASCII_HASH, '\\0'};\n#endif /* XML_DTD */\n static const XML_Char atypeCDATA[]\n = {ASCII_C, ASCII_D, ASCII_A, ASCII_T, ASCII_A, '\\0'};\n static const XML_Char atypeID[] = {ASCII_I, ASCII_D, '\\0'};\n static const XML_Char atypeIDREF[]\n = {ASCII_I, ASCII_D, ASCII_R, ASCII_E, ASCII_F, '\\0'};\n static const XML_Char atypeIDREFS[]\n = {ASCII_I, ASCII_D, ASCII_R, ASCII_E, ASCII_F, ASCII_S, '\\0'};\n static const XML_Char atypeENTITY[]\n = {ASCII_E, ASCII_N, ASCII_T, ASCII_I, ASCII_T, ASCII_Y, '\\0'};\n static const XML_Char atypeENTITIES[]\n = {ASCII_E, ASCII_N, ASCII_T, ASCII_I, ASCII_T,\n ASCII_I, ASCII_E, ASCII_S, '\\0'};\n static const XML_Char atypeNMTOKEN[]\n = {ASCII_N, ASCII_M, ASCII_T, ASCII_O, ASCII_K, ASCII_E, ASCII_N, '\\0'};\n static const XML_Char atypeNMTOKENS[]\n = {ASCII_N, ASCII_M, ASCII_T, ASCII_O, ASCII_K,\n ASCII_E, ASCII_N, ASCII_S, '\\0'};\n static const XML_Char notationPrefix[]\n = {ASCII_N, ASCII_O, ASCII_T, ASCII_A, ASCII_T,\n ASCII_I, ASCII_O, ASCII_N, ASCII_LPAREN, '\\0'};\n static const XML_Char enumValueSep[] = {ASCII_PIPE, '\\0'};\n static const XML_Char enumValueStart[] = {ASCII_LPAREN, '\\0'};\n\n /* save one level of indirection */\n DTD *const dtd = parser->m_dtd;\n\n const char **eventPP;\n const char **eventEndPP;\n enum XML_Content_Quant quant;\n\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n }\n\n for (;;) {\n int role;\n XML_Bool handleDefault = XML_TRUE;\n *eventPP = s;\n *eventEndPP = next;\n if (tok <= 0) {\n if (haveMore && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n *eventPP = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case -XML_TOK_PROLOG_S:\n tok = -tok;\n break;\n case XML_TOK_NONE:\n#ifdef XML_DTD\n /* for internal PE NOT referenced between declarations */\n if (enc != parser->m_encoding\n && ! parser->m_openInternalEntities->betweenDecl) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n /* WFC: PE Between Declarations - must check that PE contains\n complete markup, not only for external PEs, but also for\n internal PEs if the reference occurs between declarations.\n */\n if (parser->m_isParamEntity || enc != parser->m_encoding) {\n if (XmlTokenRole(&parser->m_prologState, XML_TOK_NONE, end, end, enc)\n == XML_ROLE_ERROR)\n return XML_ERROR_INCOMPLETE_PE;\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n#endif /* XML_DTD */\n return XML_ERROR_NO_ELEMENTS;\n default:\n tok = -tok;\n next = end;\n break;\n }\n }\n role = XmlTokenRole(&parser->m_prologState, tok, s, next, enc);\n switch (role) {\n case XML_ROLE_XML_DECL: {\n enum XML_Error result = processXmlDecl(parser, 0, s, next);\n if (result != XML_ERROR_NONE)\n return result;\n enc = parser->m_encoding;\n handleDefault = XML_FALSE;\n } break;\n case XML_ROLE_DOCTYPE_NAME:\n if (parser->m_startDoctypeDeclHandler) {\n parser->m_doctypeName\n = poolStoreString(&parser->m_tempPool, enc, s, next);\n if (! parser->m_doctypeName)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n parser->m_doctypePubid = NULL;\n handleDefault = XML_FALSE;\n }\n parser->m_doctypeSysid = NULL; /* always initialize to NULL */\n break;\n case XML_ROLE_DOCTYPE_INTERNAL_SUBSET:\n if (parser->m_startDoctypeDeclHandler) {\n parser->m_startDoctypeDeclHandler(\n parser->m_handlerArg, parser->m_doctypeName, parser->m_doctypeSysid,\n parser->m_doctypePubid, 1);\n parser->m_doctypeName = NULL;\n poolClear(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n break;\n#ifdef XML_DTD\n case XML_ROLE_TEXT_DECL: {\n enum XML_Error result = processXmlDecl(parser, 1, s, next);\n if (result != XML_ERROR_NONE)\n return result;\n enc = parser->m_encoding;\n handleDefault = XML_FALSE;\n } break;\n#endif /* XML_DTD */\n case XML_ROLE_DOCTYPE_PUBLIC_ID:\n#ifdef XML_DTD\n parser->m_useForeignDTD = XML_FALSE;\n parser->m_declEntity = (ENTITY *)lookup(\n parser, &dtd->paramEntities, externalSubsetName, sizeof(ENTITY));\n if (! parser->m_declEntity)\n return XML_ERROR_NO_MEMORY;\n#endif /* XML_DTD */\n dtd->hasParamEntityRefs = XML_TRUE;\n if (parser->m_startDoctypeDeclHandler) {\n XML_Char *pubId;\n if (! XmlIsPublicId(enc, s, next, eventPP))\n return XML_ERROR_PUBLICID;\n pubId = poolStoreString(&parser->m_tempPool, enc,\n s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! pubId)\n return XML_ERROR_NO_MEMORY;\n normalizePublicId(pubId);\n poolFinish(&parser->m_tempPool);\n parser->m_doctypePubid = pubId;\n handleDefault = XML_FALSE;\n goto alreadyChecked;\n }\n /* fall through */\n case XML_ROLE_ENTITY_PUBLIC_ID:\n if (! XmlIsPublicId(enc, s, next, eventPP))\n return XML_ERROR_PUBLICID;\n alreadyChecked:\n if (dtd->keepProcessing && parser->m_declEntity) {\n XML_Char *tem\n = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! tem)\n return XML_ERROR_NO_MEMORY;\n normalizePublicId(tem);\n parser->m_declEntity->publicId = tem;\n poolFinish(&dtd->pool);\n /* Don't suppress the default handler if we fell through from\n * the XML_ROLE_DOCTYPE_PUBLIC_ID case.\n */\n if (parser->m_entityDeclHandler && role == XML_ROLE_ENTITY_PUBLIC_ID)\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_DOCTYPE_CLOSE:\n if (parser->m_doctypeName) {\n parser->m_startDoctypeDeclHandler(\n parser->m_handlerArg, parser->m_doctypeName, parser->m_doctypeSysid,\n parser->m_doctypePubid, 0);\n poolClear(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n /* parser->m_doctypeSysid will be non-NULL in the case of a previous\n XML_ROLE_DOCTYPE_SYSTEM_ID, even if parser->m_startDoctypeDeclHandler\n was not set, indicating an external subset\n */\n#ifdef XML_DTD\n if (parser->m_doctypeSysid || parser->m_useForeignDTD) {\n XML_Bool hadParamEntityRefs = dtd->hasParamEntityRefs;\n dtd->hasParamEntityRefs = XML_TRUE;\n if (parser->m_paramEntityParsing\n && parser->m_externalEntityRefHandler) {\n ENTITY *entity = (ENTITY *)lookup(parser, &dtd->paramEntities,\n externalSubsetName, sizeof(ENTITY));\n if (! entity) {\n /* The external subset name \"#\" will have already been\n * inserted into the hash table at the start of the\n * external entity parsing, so no allocation will happen\n * and lookup() cannot fail.\n */\n return XML_ERROR_NO_MEMORY; /* LCOV_EXCL_LINE */\n }\n if (parser->m_useForeignDTD)\n entity->base = parser->m_curBase;\n dtd->paramEntityRead = XML_FALSE;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, 0, entity->base,\n entity->systemId, entity->publicId))\n return XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n if (dtd->paramEntityRead) {\n if (! dtd->standalone && parser->m_notStandaloneHandler\n && ! parser->m_notStandaloneHandler(parser->m_handlerArg))\n return XML_ERROR_NOT_STANDALONE;\n }\n /* if we didn't read the foreign DTD then this means that there\n is no external subset and we must reset dtd->hasParamEntityRefs\n */\n else if (! parser->m_doctypeSysid)\n dtd->hasParamEntityRefs = hadParamEntityRefs;\n /* end of DTD - no need to update dtd->keepProcessing */\n }\n parser->m_useForeignDTD = XML_FALSE;\n }\n#endif /* XML_DTD */\n if (parser->m_endDoctypeDeclHandler) {\n parser->m_endDoctypeDeclHandler(parser->m_handlerArg);\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_INSTANCE_START:\n#ifdef XML_DTD\n /* if there is no DOCTYPE declaration then now is the\n last chance to read the foreign DTD\n */\n if (parser->m_useForeignDTD) {\n XML_Bool hadParamEntityRefs = dtd->hasParamEntityRefs;\n dtd->hasParamEntityRefs = XML_TRUE;\n if (parser->m_paramEntityParsing\n && parser->m_externalEntityRefHandler) {\n ENTITY *entity = (ENTITY *)lookup(parser, &dtd->paramEntities,\n externalSubsetName, sizeof(ENTITY));\n if (! entity)\n return XML_ERROR_NO_MEMORY;\n entity->base = parser->m_curBase;\n dtd->paramEntityRead = XML_FALSE;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, 0, entity->base,\n entity->systemId, entity->publicId))\n return XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n if (dtd->paramEntityRead) {\n if (! dtd->standalone && parser->m_notStandaloneHandler\n && ! parser->m_notStandaloneHandler(parser->m_handlerArg))\n return XML_ERROR_NOT_STANDALONE;\n }\n /* if we didn't read the foreign DTD then this means that there\n is no external subset and we must reset dtd->hasParamEntityRefs\n */\n else\n dtd->hasParamEntityRefs = hadParamEntityRefs;\n /* end of DTD - no need to update dtd->keepProcessing */\n }\n }\n#endif /* XML_DTD */\n parser->m_processor = contentProcessor;\n return contentProcessor(parser, s, end, nextPtr);\n case XML_ROLE_ATTLIST_ELEMENT_NAME:\n parser->m_declElementType = getElementType(parser, enc, s, next);\n if (! parser->m_declElementType)\n return XML_ERROR_NO_MEMORY;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_NAME:\n parser->m_declAttributeId = getAttributeId(parser, enc, s, next);\n if (! parser->m_declAttributeId)\n return XML_ERROR_NO_MEMORY;\n parser->m_declAttributeIsCdata = XML_FALSE;\n parser->m_declAttributeType = NULL;\n parser->m_declAttributeIsId = XML_FALSE;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_CDATA:\n parser->m_declAttributeIsCdata = XML_TRUE;\n parser->m_declAttributeType = atypeCDATA;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_ID:\n parser->m_declAttributeIsId = XML_TRUE;\n parser->m_declAttributeType = atypeID;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_IDREF:\n parser->m_declAttributeType = atypeIDREF;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_IDREFS:\n parser->m_declAttributeType = atypeIDREFS;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_ENTITY:\n parser->m_declAttributeType = atypeENTITY;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_ENTITIES:\n parser->m_declAttributeType = atypeENTITIES;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_NMTOKEN:\n parser->m_declAttributeType = atypeNMTOKEN;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_NMTOKENS:\n parser->m_declAttributeType = atypeNMTOKENS;\n checkAttListDeclHandler:\n if (dtd->keepProcessing && parser->m_attlistDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_ATTRIBUTE_ENUM_VALUE:\n case XML_ROLE_ATTRIBUTE_NOTATION_VALUE:\n if (dtd->keepProcessing && parser->m_attlistDeclHandler) {\n const XML_Char *prefix;\n if (parser->m_declAttributeType) {\n prefix = enumValueSep;\n } else {\n prefix = (role == XML_ROLE_ATTRIBUTE_NOTATION_VALUE ? notationPrefix\n : enumValueStart);\n }\n if (! poolAppendString(&parser->m_tempPool, prefix))\n return XML_ERROR_NO_MEMORY;\n if (! poolAppend(&parser->m_tempPool, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n parser->m_declAttributeType = parser->m_tempPool.start;\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_IMPLIED_ATTRIBUTE_VALUE:\n case XML_ROLE_REQUIRED_ATTRIBUTE_VALUE:\n if (dtd->keepProcessing) {\n if (! defineAttribute(parser->m_declElementType,\n parser->m_declAttributeId,\n parser->m_declAttributeIsCdata,\n parser->m_declAttributeIsId, 0, parser))\n return XML_ERROR_NO_MEMORY;\n if (parser->m_attlistDeclHandler && parser->m_declAttributeType) {\n if (*parser->m_declAttributeType == XML_T(ASCII_LPAREN)\n || (*parser->m_declAttributeType == XML_T(ASCII_N)\n && parser->m_declAttributeType[1] == XML_T(ASCII_O))) {\n /* Enumerated or Notation type */\n if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_RPAREN))\n || ! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_ERROR_NO_MEMORY;\n parser->m_declAttributeType = parser->m_tempPool.start;\n poolFinish(&parser->m_tempPool);\n }\n *eventEndPP = s;\n parser->m_attlistDeclHandler(\n parser->m_handlerArg, parser->m_declElementType->name,\n parser->m_declAttributeId->name, parser->m_declAttributeType, 0,\n role == XML_ROLE_REQUIRED_ATTRIBUTE_VALUE);\n poolClear(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n }\n break;\n case XML_ROLE_DEFAULT_ATTRIBUTE_VALUE:\n case XML_ROLE_FIXED_ATTRIBUTE_VALUE:\n if (dtd->keepProcessing) {\n const XML_Char *attVal;\n enum XML_Error result = storeAttributeValue(\n parser, enc, parser->m_declAttributeIsCdata,\n s + enc->minBytesPerChar, next - enc->minBytesPerChar, &dtd->pool);\n if (result)\n return result;\n attVal = poolStart(&dtd->pool);\n poolFinish(&dtd->pool);\n /* ID attributes aren't allowed to have a default */\n if (! defineAttribute(\n parser->m_declElementType, parser->m_declAttributeId,\n parser->m_declAttributeIsCdata, XML_FALSE, attVal, parser))\n return XML_ERROR_NO_MEMORY;\n if (parser->m_attlistDeclHandler && parser->m_declAttributeType) {\n if (*parser->m_declAttributeType == XML_T(ASCII_LPAREN)\n || (*parser->m_declAttributeType == XML_T(ASCII_N)\n && parser->m_declAttributeType[1] == XML_T(ASCII_O))) {\n /* Enumerated or Notation type */\n if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_RPAREN))\n || ! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_ERROR_NO_MEMORY;\n parser->m_declAttributeType = parser->m_tempPool.start;\n poolFinish(&parser->m_tempPool);\n }\n *eventEndPP = s;\n parser->m_attlistDeclHandler(\n parser->m_handlerArg, parser->m_declElementType->name,\n parser->m_declAttributeId->name, parser->m_declAttributeType,\n attVal, role == XML_ROLE_FIXED_ATTRIBUTE_VALUE);\n poolClear(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n }\n break;\n case XML_ROLE_ENTITY_VALUE:\n if (dtd->keepProcessing) {\n enum XML_Error result = storeEntityValue(\n parser, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar);\n if (parser->m_declEntity) {\n parser->m_declEntity->textPtr = poolStart(&dtd->entityValuePool);\n parser->m_declEntity->textLen\n = (int)(poolLength(&dtd->entityValuePool));\n poolFinish(&dtd->entityValuePool);\n if (parser->m_entityDeclHandler) {\n *eventEndPP = s;\n parser->m_entityDeclHandler(\n parser->m_handlerArg, parser->m_declEntity->name,\n parser->m_declEntity->is_param, parser->m_declEntity->textPtr,\n parser->m_declEntity->textLen, parser->m_curBase, 0, 0, 0);\n handleDefault = XML_FALSE;\n }\n } else\n poolDiscard(&dtd->entityValuePool);\n if (result != XML_ERROR_NONE)\n return result;\n }\n break;\n case XML_ROLE_DOCTYPE_SYSTEM_ID:\n#ifdef XML_DTD\n parser->m_useForeignDTD = XML_FALSE;\n#endif /* XML_DTD */\n dtd->hasParamEntityRefs = XML_TRUE;\n if (parser->m_startDoctypeDeclHandler) {\n parser->m_doctypeSysid = poolStoreString(&parser->m_tempPool, enc,\n s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (parser->m_doctypeSysid == NULL)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n#ifdef XML_DTD\n else\n /* use externalSubsetName to make parser->m_doctypeSysid non-NULL\n for the case where no parser->m_startDoctypeDeclHandler is set */\n parser->m_doctypeSysid = externalSubsetName;\n#endif /* XML_DTD */\n if (! dtd->standalone\n#ifdef XML_DTD\n && ! parser->m_paramEntityParsing\n#endif /* XML_DTD */\n && parser->m_notStandaloneHandler\n && ! parser->m_notStandaloneHandler(parser->m_handlerArg))\n return XML_ERROR_NOT_STANDALONE;\n#ifndef XML_DTD\n break;\n#else /* XML_DTD */\n if (! parser->m_declEntity) {\n parser->m_declEntity = (ENTITY *)lookup(\n parser, &dtd->paramEntities, externalSubsetName, sizeof(ENTITY));\n if (! parser->m_declEntity)\n return XML_ERROR_NO_MEMORY;\n parser->m_declEntity->publicId = NULL;\n }\n#endif /* XML_DTD */\n /* fall through */\n case XML_ROLE_ENTITY_SYSTEM_ID:\n if (dtd->keepProcessing && parser->m_declEntity) {\n parser->m_declEntity->systemId\n = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! parser->m_declEntity->systemId)\n return XML_ERROR_NO_MEMORY;\n parser->m_declEntity->base = parser->m_curBase;\n poolFinish(&dtd->pool);\n /* Don't suppress the default handler if we fell through from\n * the XML_ROLE_DOCTYPE_SYSTEM_ID case.\n */\n if (parser->m_entityDeclHandler && role == XML_ROLE_ENTITY_SYSTEM_ID)\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_ENTITY_COMPLETE:\n if (dtd->keepProcessing && parser->m_declEntity\n && parser->m_entityDeclHandler) {\n *eventEndPP = s;\n parser->m_entityDeclHandler(\n parser->m_handlerArg, parser->m_declEntity->name,\n parser->m_declEntity->is_param, 0, 0, parser->m_declEntity->base,\n parser->m_declEntity->systemId, parser->m_declEntity->publicId, 0);\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_ENTITY_NOTATION_NAME:\n if (dtd->keepProcessing && parser->m_declEntity) {\n parser->m_declEntity->notation\n = poolStoreString(&dtd->pool, enc, s, next);\n if (! parser->m_declEntity->notation)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&dtd->pool);\n if (parser->m_unparsedEntityDeclHandler) {\n *eventEndPP = s;\n parser->m_unparsedEntityDeclHandler(\n parser->m_handlerArg, parser->m_declEntity->name,\n parser->m_declEntity->base, parser->m_declEntity->systemId,\n parser->m_declEntity->publicId, parser->m_declEntity->notation);\n handleDefault = XML_FALSE;\n } else if (parser->m_entityDeclHandler) {\n *eventEndPP = s;\n parser->m_entityDeclHandler(\n parser->m_handlerArg, parser->m_declEntity->name, 0, 0, 0,\n parser->m_declEntity->base, parser->m_declEntity->systemId,\n parser->m_declEntity->publicId, parser->m_declEntity->notation);\n handleDefault = XML_FALSE;\n }\n }\n break;\n case XML_ROLE_GENERAL_ENTITY_NAME: {\n if (XmlPredefinedEntityName(enc, s, next)) {\n parser->m_declEntity = NULL;\n break;\n }\n if (dtd->keepProcessing) {\n const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n parser->m_declEntity = (ENTITY *)lookup(parser, &dtd->generalEntities,\n name, sizeof(ENTITY));\n if (! parser->m_declEntity)\n return XML_ERROR_NO_MEMORY;\n if (parser->m_declEntity->name != name) {\n poolDiscard(&dtd->pool);\n parser->m_declEntity = NULL;\n } else {\n poolFinish(&dtd->pool);\n parser->m_declEntity->publicId = NULL;\n parser->m_declEntity->is_param = XML_FALSE;\n /* if we have a parent parser or are reading an internal parameter\n entity, then the entity declaration is not considered \"internal\"\n */\n parser->m_declEntity->is_internal\n = ! (parser->m_parentParser || parser->m_openInternalEntities);\n if (parser->m_entityDeclHandler)\n handleDefault = XML_FALSE;\n }\n } else {\n poolDiscard(&dtd->pool);\n parser->m_declEntity = NULL;\n }\n } break;\n case XML_ROLE_PARAM_ENTITY_NAME:\n#ifdef XML_DTD\n if (dtd->keepProcessing) {\n const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n parser->m_declEntity = (ENTITY *)lookup(parser, &dtd->paramEntities,\n name, sizeof(ENTITY));\n if (! parser->m_declEntity)\n return XML_ERROR_NO_MEMORY;\n if (parser->m_declEntity->name != name) {\n poolDiscard(&dtd->pool);\n parser->m_declEntity = NULL;\n } else {\n poolFinish(&dtd->pool);\n parser->m_declEntity->publicId = NULL;\n parser->m_declEntity->is_param = XML_TRUE;\n /* if we have a parent parser or are reading an internal parameter\n entity, then the entity declaration is not considered \"internal\"\n */\n parser->m_declEntity->is_internal\n = ! (parser->m_parentParser || parser->m_openInternalEntities);\n if (parser->m_entityDeclHandler)\n handleDefault = XML_FALSE;\n }\n } else {\n poolDiscard(&dtd->pool);\n parser->m_declEntity = NULL;\n }\n#else /* not XML_DTD */\n parser->m_declEntity = NULL;\n#endif /* XML_DTD */\n break;\n case XML_ROLE_NOTATION_NAME:\n parser->m_declNotationPublicId = NULL;\n parser->m_declNotationName = NULL;\n if (parser->m_notationDeclHandler) {\n parser->m_declNotationName\n = poolStoreString(&parser->m_tempPool, enc, s, next);\n if (! parser->m_declNotationName)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_NOTATION_PUBLIC_ID:\n if (! XmlIsPublicId(enc, s, next, eventPP))\n return XML_ERROR_PUBLICID;\n if (parser\n ->m_declNotationName) { /* means m_notationDeclHandler != NULL */\n XML_Char *tem = poolStoreString(&parser->m_tempPool, enc,\n s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! tem)\n return XML_ERROR_NO_MEMORY;\n normalizePublicId(tem);\n parser->m_declNotationPublicId = tem;\n poolFinish(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_NOTATION_SYSTEM_ID:\n if (parser->m_declNotationName && parser->m_notationDeclHandler) {\n const XML_Char *systemId = poolStoreString(&parser->m_tempPool, enc,\n s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! systemId)\n return XML_ERROR_NO_MEMORY;\n *eventEndPP = s;\n parser->m_notationDeclHandler(\n parser->m_handlerArg, parser->m_declNotationName, parser->m_curBase,\n systemId, parser->m_declNotationPublicId);\n handleDefault = XML_FALSE;\n }\n poolClear(&parser->m_tempPool);\n break;\n case XML_ROLE_NOTATION_NO_SYSTEM_ID:\n if (parser->m_declNotationPublicId && parser->m_notationDeclHandler) {\n *eventEndPP = s;\n parser->m_notationDeclHandler(\n parser->m_handlerArg, parser->m_declNotationName, parser->m_curBase,\n 0, parser->m_declNotationPublicId);\n handleDefault = XML_FALSE;\n }\n poolClear(&parser->m_tempPool);\n break;\n case XML_ROLE_ERROR:\n switch (tok) {\n case XML_TOK_PARAM_ENTITY_REF:\n /* PE references in internal subset are\n not allowed within declarations. */\n return XML_ERROR_PARAM_ENTITY_REF;\n case XML_TOK_XML_DECL:\n return XML_ERROR_MISPLACED_XML_PI;\n default:\n return XML_ERROR_SYNTAX;\n }\n#ifdef XML_DTD\n case XML_ROLE_IGNORE_SECT: {\n enum XML_Error result;\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n handleDefault = XML_FALSE;\n result = doIgnoreSection(parser, enc, &next, end, nextPtr, haveMore);\n if (result != XML_ERROR_NONE)\n return result;\n else if (! next) {\n parser->m_processor = ignoreSectionProcessor;\n return result;\n }\n } break;\n#endif /* XML_DTD */\n case XML_ROLE_GROUP_OPEN:\n if (parser->m_prologState.level >= parser->m_groupSize) {\n if (parser->m_groupSize) {\n {\n char *const new_connector = (char *)REALLOC(\n parser, parser->m_groupConnector, parser->m_groupSize *= 2);\n if (new_connector == NULL) {\n parser->m_groupSize /= 2;\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_groupConnector = new_connector;\n }\n\n if (dtd->scaffIndex) {\n int *const new_scaff_index = (int *)REALLOC(\n parser, dtd->scaffIndex, parser->m_groupSize * sizeof(int));\n if (new_scaff_index == NULL)\n return XML_ERROR_NO_MEMORY;\n dtd->scaffIndex = new_scaff_index;\n }\n } else {\n parser->m_groupConnector\n = (char *)MALLOC(parser, parser->m_groupSize = 32);\n if (! parser->m_groupConnector) {\n parser->m_groupSize = 0;\n return XML_ERROR_NO_MEMORY;\n }\n }\n }\n parser->m_groupConnector[parser->m_prologState.level] = 0;\n if (dtd->in_eldecl) {\n int myindex = nextScaffoldPart(parser);\n if (myindex < 0)\n return XML_ERROR_NO_MEMORY;\n assert(dtd->scaffIndex != NULL);\n dtd->scaffIndex[dtd->scaffLevel] = myindex;\n dtd->scaffLevel++;\n dtd->scaffold[myindex].type = XML_CTYPE_SEQ;\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_GROUP_SEQUENCE:\n if (parser->m_groupConnector[parser->m_prologState.level] == ASCII_PIPE)\n return XML_ERROR_SYNTAX;\n parser->m_groupConnector[parser->m_prologState.level] = ASCII_COMMA;\n if (dtd->in_eldecl && parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_GROUP_CHOICE:\n if (parser->m_groupConnector[parser->m_prologState.level] == ASCII_COMMA)\n return XML_ERROR_SYNTAX;\n if (dtd->in_eldecl\n && ! parser->m_groupConnector[parser->m_prologState.level]\n && (dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type\n != XML_CTYPE_MIXED)) {\n dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type\n = XML_CTYPE_CHOICE;\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n }\n parser->m_groupConnector[parser->m_prologState.level] = ASCII_PIPE;\n break;\n case XML_ROLE_PARAM_ENTITY_REF:\n#ifdef XML_DTD\n case XML_ROLE_INNER_PARAM_ENTITY_REF:\n dtd->hasParamEntityRefs = XML_TRUE;\n if (! parser->m_paramEntityParsing)\n dtd->keepProcessing = dtd->standalone;\n else {\n const XML_Char *name;\n ENTITY *entity;\n name = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n entity = (ENTITY *)lookup(parser, &dtd->paramEntities, name, 0);\n poolDiscard(&dtd->pool);\n /* first, determine if a check for an existing declaration is needed;\n if yes, check that the entity exists, and that it is internal,\n otherwise call the skipped entity handler\n */\n if (parser->m_prologState.documentEntity\n && (dtd->standalone ? ! parser->m_openInternalEntities\n : ! dtd->hasParamEntityRefs)) {\n if (! entity)\n return XML_ERROR_UNDEFINED_ENTITY;\n else if (! entity->is_internal) {\n /* It's hard to exhaustively search the code to be sure,\n * but there doesn't seem to be a way of executing the\n * following line. There are two cases:\n *\n * If 'standalone' is false, the DTD must have no\n * parameter entities or we wouldn't have passed the outer\n * 'if' statement. That measn the only entity in the hash\n * table is the external subset name \"#\" which cannot be\n * given as a parameter entity name in XML syntax, so the\n * lookup must have returned NULL and we don't even reach\n * the test for an internal entity.\n *\n * If 'standalone' is true, it does not seem to be\n * possible to create entities taking this code path that\n * are not internal entities, so fail the test above.\n *\n * Because this analysis is very uncertain, the code is\n * being left in place and merely removed from the\n * coverage test statistics.\n */\n return XML_ERROR_ENTITY_DECLARED_IN_PE; /* LCOV_EXCL_LINE */\n }\n } else if (! entity) {\n dtd->keepProcessing = dtd->standalone;\n /* cannot report skipped entities in declarations */\n if ((role == XML_ROLE_PARAM_ENTITY_REF)\n && parser->m_skippedEntityHandler) {\n parser->m_skippedEntityHandler(parser->m_handlerArg, name, 1);\n handleDefault = XML_FALSE;\n }\n break;\n }\n if (entity->open)\n return XML_ERROR_RECURSIVE_ENTITY_REF;\n if (entity->textPtr) {\n enum XML_Error result;\n XML_Bool betweenDecl\n = (role == XML_ROLE_PARAM_ENTITY_REF ? XML_TRUE : XML_FALSE);\n result = processInternalEntity(parser, entity, betweenDecl);\n if (result != XML_ERROR_NONE)\n return result;\n handleDefault = XML_FALSE;\n break;\n }\n if (parser->m_externalEntityRefHandler) {\n dtd->paramEntityRead = XML_FALSE;\n entity->open = XML_TRUE;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, 0, entity->base,\n entity->systemId, entity->publicId)) {\n entity->open = XML_FALSE;\n return XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n }\n entity->open = XML_FALSE;\n handleDefault = XML_FALSE;\n if (! dtd->paramEntityRead) {\n dtd->keepProcessing = dtd->standalone;\n break;\n }\n } else {\n dtd->keepProcessing = dtd->standalone;\n break;\n }\n }\n#endif /* XML_DTD */\n if (! dtd->standalone && parser->m_notStandaloneHandler\n && ! parser->m_notStandaloneHandler(parser->m_handlerArg))\n return XML_ERROR_NOT_STANDALONE;\n break;\n\n /* Element declaration stuff */\n\n case XML_ROLE_ELEMENT_NAME:\n if (parser->m_elementDeclHandler) {\n parser->m_declElementType = getElementType(parser, enc, s, next);\n if (! parser->m_declElementType)\n return XML_ERROR_NO_MEMORY;\n dtd->scaffLevel = 0;\n dtd->scaffCount = 0;\n dtd->in_eldecl = XML_TRUE;\n handleDefault = XML_FALSE;\n }\n break;\n\n case XML_ROLE_CONTENT_ANY:\n case XML_ROLE_CONTENT_EMPTY:\n if (dtd->in_eldecl) {\n if (parser->m_elementDeclHandler) {\n XML_Content *content\n = (XML_Content *)MALLOC(parser, sizeof(XML_Content));\n if (! content)\n return XML_ERROR_NO_MEMORY;\n content->quant = XML_CQUANT_NONE;\n content->name = NULL;\n content->numchildren = 0;\n content->children = NULL;\n content->type = ((role == XML_ROLE_CONTENT_ANY) ? XML_CTYPE_ANY\n : XML_CTYPE_EMPTY);\n *eventEndPP = s;\n parser->m_elementDeclHandler(\n parser->m_handlerArg, parser->m_declElementType->name, content);\n handleDefault = XML_FALSE;\n }\n dtd->in_eldecl = XML_FALSE;\n }\n break;\n\n case XML_ROLE_CONTENT_PCDATA:\n if (dtd->in_eldecl) {\n dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type\n = XML_CTYPE_MIXED;\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n }\n break;\n\n case XML_ROLE_CONTENT_ELEMENT:\n quant = XML_CQUANT_NONE;\n goto elementContent;\n case XML_ROLE_CONTENT_ELEMENT_OPT:\n quant = XML_CQUANT_OPT;\n goto elementContent;\n case XML_ROLE_CONTENT_ELEMENT_REP:\n quant = XML_CQUANT_REP;\n goto elementContent;\n case XML_ROLE_CONTENT_ELEMENT_PLUS:\n quant = XML_CQUANT_PLUS;\n elementContent:\n if (dtd->in_eldecl) {\n ELEMENT_TYPE *el;\n const XML_Char *name;\n int nameLen;\n const char *nxt\n = (quant == XML_CQUANT_NONE ? next : next - enc->minBytesPerChar);\n int myindex = nextScaffoldPart(parser);\n if (myindex < 0)\n return XML_ERROR_NO_MEMORY;\n dtd->scaffold[myindex].type = XML_CTYPE_NAME;\n dtd->scaffold[myindex].quant = quant;\n el = getElementType(parser, enc, s, nxt);\n if (! el)\n return XML_ERROR_NO_MEMORY;\n name = el->name;\n dtd->scaffold[myindex].name = name;\n nameLen = 0;\n for (; name[nameLen++];)\n ;\n dtd->contentStringLen += nameLen;\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n }\n break;\n\n case XML_ROLE_GROUP_CLOSE:\n quant = XML_CQUANT_NONE;\n goto closeGroup;\n case XML_ROLE_GROUP_CLOSE_OPT:\n quant = XML_CQUANT_OPT;\n goto closeGroup;\n case XML_ROLE_GROUP_CLOSE_REP:\n quant = XML_CQUANT_REP;\n goto closeGroup;\n case XML_ROLE_GROUP_CLOSE_PLUS:\n quant = XML_CQUANT_PLUS;\n closeGroup:\n if (dtd->in_eldecl) {\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n dtd->scaffLevel--;\n dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel]].quant = quant;\n if (dtd->scaffLevel == 0) {\n if (! handleDefault) {\n XML_Content *model = build_model(parser);\n if (! model)\n return XML_ERROR_NO_MEMORY;\n *eventEndPP = s;\n parser->m_elementDeclHandler(\n parser->m_handlerArg, parser->m_declElementType->name, model);\n }\n dtd->in_eldecl = XML_FALSE;\n dtd->contentStringLen = 0;\n }\n }\n break;\n /* End element declaration stuff */\n\n case XML_ROLE_PI:\n if (! reportProcessingInstruction(parser, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_COMMENT:\n if (! reportComment(parser, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_NONE:\n switch (tok) {\n case XML_TOK_BOM:\n handleDefault = XML_FALSE;\n break;\n }\n break;\n case XML_ROLE_DOCTYPE_NONE:\n if (parser->m_startDoctypeDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_ENTITY_NONE:\n if (dtd->keepProcessing && parser->m_entityDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_NOTATION_NONE:\n if (parser->m_notationDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_ATTLIST_NONE:\n if (dtd->keepProcessing && parser->m_attlistDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_ELEMENT_NONE:\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n break;\n } /* end of big switch */\n\n if (handleDefault && parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:\n s = next;\n tok = XmlPrologTok(enc, s, end, &next);\n }\n }\n /* not reached */\n}\n\nstatic enum XML_Error PTRCALL\nepilogProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n parser->m_processor = epilogProcessor;\n parser->m_eventPtr = s;\n for (;;) {\n const char *next = NULL;\n int tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n parser->m_eventEndPtr = next;\n switch (tok) {\n /* report partial linebreak - it might be the last token */\n case -XML_TOK_PROLOG_S:\n if (parser->m_defaultHandler) {\n reportDefault(parser, parser->m_encoding, s, next);\n if (parser->m_parsingStatus.parsing == XML_FINISHED)\n return XML_ERROR_ABORTED;\n }\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_TOK_NONE:\n *nextPtr = s;\n return XML_ERROR_NONE;\n case XML_TOK_PROLOG_S:\n if (parser->m_defaultHandler)\n reportDefault(parser, parser->m_encoding, s, next);\n break;\n case XML_TOK_PI:\n if (! reportProcessingInstruction(parser, parser->m_encoding, s, next))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_COMMENT:\n if (! reportComment(parser, parser->m_encoding, s, next))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_INVALID:\n parser->m_eventPtr = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n if (! parser->m_parsingStatus.finalBuffer) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (! parser->m_parsingStatus.finalBuffer) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n default:\n return XML_ERROR_JUNK_AFTER_DOC_ELEMENT;\n }\n parser->m_eventPtr = s = next;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:;\n }\n }\n}\n\nstatic enum XML_Error\nprocessInternalEntity(XML_Parser parser, ENTITY *entity, XML_Bool betweenDecl) {\n const char *textStart, *textEnd;\n const char *next;\n enum XML_Error result;\n OPEN_INTERNAL_ENTITY *openEntity;\n\n if (parser->m_freeInternalEntities) {\n openEntity = parser->m_freeInternalEntities;\n parser->m_freeInternalEntities = openEntity->next;\n } else {\n openEntity\n = (OPEN_INTERNAL_ENTITY *)MALLOC(parser, sizeof(OPEN_INTERNAL_ENTITY));\n if (! openEntity)\n return XML_ERROR_NO_MEMORY;\n }\n entity->open = XML_TRUE;\n entity->processed = 0;\n openEntity->next = parser->m_openInternalEntities;\n parser->m_openInternalEntities = openEntity;\n openEntity->entity = entity;\n openEntity->startTagLevel = parser->m_tagLevel;\n openEntity->betweenDecl = betweenDecl;\n openEntity->internalEventPtr = NULL;\n openEntity->internalEventEndPtr = NULL;\n textStart = (char *)entity->textPtr;\n textEnd = (char *)(entity->textPtr + entity->textLen);\n /* Set a safe default value in case 'next' does not get set */\n next = textStart;\n\n#ifdef XML_DTD\n if (entity->is_param) {\n int tok\n = XmlPrologTok(parser->m_internalEncoding, textStart, textEnd, &next);\n result = doProlog(parser, parser->m_internalEncoding, textStart, textEnd,\n tok, next, &next, XML_FALSE);\n } else\n#endif /* XML_DTD */\n result = doContent(parser, parser->m_tagLevel, parser->m_internalEncoding,\n textStart, textEnd, &next, XML_FALSE);\n\n if (result == XML_ERROR_NONE) {\n if (textEnd != next && parser->m_parsingStatus.parsing == XML_SUSPENDED) {\n entity->processed = (int)(next - textStart);\n parser->m_processor = internalEntityProcessor;\n } else {\n entity->open = XML_FALSE;\n parser->m_openInternalEntities = openEntity->next;\n /* put openEntity back in list of free instances */\n openEntity->next = parser->m_freeInternalEntities;\n parser->m_freeInternalEntities = openEntity;\n }\n }\n return result;\n}\n\nstatic enum XML_Error PTRCALL\ninternalEntityProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n ENTITY *entity;\n const char *textStart, *textEnd;\n const char *next;\n enum XML_Error result;\n OPEN_INTERNAL_ENTITY *openEntity = parser->m_openInternalEntities;\n if (! openEntity)\n return XML_ERROR_UNEXPECTED_STATE;\n\n entity = openEntity->entity;\n textStart = ((char *)entity->textPtr) + entity->processed;\n textEnd = (char *)(entity->textPtr + entity->textLen);\n /* Set a safe default value in case 'next' does not get set */\n next = textStart;\n\n#ifdef XML_DTD\n if (entity->is_param) {\n int tok\n = XmlPrologTok(parser->m_internalEncoding, textStart, textEnd, &next);\n result = doProlog(parser, parser->m_internalEncoding, textStart, textEnd,\n tok, next, &next, XML_FALSE);\n } else\n#endif /* XML_DTD */\n result = doContent(parser, openEntity->startTagLevel,\n parser->m_internalEncoding, textStart, textEnd, &next,\n XML_FALSE);\n\n if (result != XML_ERROR_NONE)\n return result;\n else if (textEnd != next\n && parser->m_parsingStatus.parsing == XML_SUSPENDED) {\n entity->processed = (int)(next - (char *)entity->textPtr);\n return result;\n } else {\n entity->open = XML_FALSE;\n parser->m_openInternalEntities = openEntity->next;\n /* put openEntity back in list of free instances */\n openEntity->next = parser->m_freeInternalEntities;\n parser->m_freeInternalEntities = openEntity;\n }\n\n#ifdef XML_DTD\n if (entity->is_param) {\n int tok;\n parser->m_processor = prologProcessor;\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n } else\n#endif /* XML_DTD */\n {\n parser->m_processor = contentProcessor;\n /* see externalEntityContentProcessor vs contentProcessor */\n return doContent(parser, parser->m_parentParser ? 1 : 0, parser->m_encoding,\n s, end, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n }\n}\n\nstatic enum XML_Error PTRCALL\nerrorProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n UNUSED_P(s);\n UNUSED_P(end);\n UNUSED_P(nextPtr);\n return parser->m_errorCode;\n}\n\nstatic enum XML_Error\nstoreAttributeValue(XML_Parser parser, const ENCODING *enc, XML_Bool isCdata,\n const char *ptr, const char *end, STRING_POOL *pool) {\n enum XML_Error result\n = appendAttributeValue(parser, enc, isCdata, ptr, end, pool);\n if (result)\n return result;\n if (! isCdata && poolLength(pool) && poolLastChar(pool) == 0x20)\n poolChop(pool);\n if (! poolAppendChar(pool, XML_T('\\0')))\n return XML_ERROR_NO_MEMORY;\n return XML_ERROR_NONE;\n}\n\nstatic enum XML_Error\nappendAttributeValue(XML_Parser parser, const ENCODING *enc, XML_Bool isCdata,\n const char *ptr, const char *end, STRING_POOL *pool) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n for (;;) {\n const char *next;\n int tok = XmlAttributeValueTok(enc, ptr, end, &next);\n switch (tok) {\n case XML_TOK_NONE:\n return XML_ERROR_NONE;\n case XML_TOK_INVALID:\n if (enc == parser->m_encoding)\n parser->m_eventPtr = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_CHAR_REF: {\n XML_Char buf[XML_ENCODE_MAX];\n int i;\n int n = XmlCharRefNumber(enc, ptr);\n if (n < 0) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_BAD_CHAR_REF;\n }\n if (! isCdata && n == 0x20 /* space */\n && (poolLength(pool) == 0 || poolLastChar(pool) == 0x20))\n break;\n n = XmlEncode(n, (ICHAR *)buf);\n /* The XmlEncode() functions can never return 0 here. That\n * error return happens if the code point passed in is either\n * negative or greater than or equal to 0x110000. The\n * XmlCharRefNumber() functions will all return a number\n * strictly less than 0x110000 or a negative value if an error\n * occurred. The negative value is intercepted above, so\n * XmlEncode() is never passed a value it might return an\n * error for.\n */\n for (i = 0; i < n; i++) {\n if (! poolAppendChar(pool, buf[i]))\n return XML_ERROR_NO_MEMORY;\n }\n } break;\n case XML_TOK_DATA_CHARS:\n if (! poolAppend(pool, enc, ptr, next))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_TRAILING_CR:\n next = ptr + enc->minBytesPerChar;\n /* fall through */\n case XML_TOK_ATTRIBUTE_VALUE_S:\n case XML_TOK_DATA_NEWLINE:\n if (! isCdata && (poolLength(pool) == 0 || poolLastChar(pool) == 0x20))\n break;\n if (! poolAppendChar(pool, 0x20))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_ENTITY_REF: {\n const XML_Char *name;\n ENTITY *entity;\n char checkEntityDecl;\n XML_Char ch = (XML_Char)XmlPredefinedEntityName(\n enc, ptr + enc->minBytesPerChar, next - enc->minBytesPerChar);\n if (ch) {\n if (! poolAppendChar(pool, ch))\n return XML_ERROR_NO_MEMORY;\n break;\n }\n name = poolStoreString(&parser->m_temp2Pool, enc,\n ptr + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n entity = (ENTITY *)lookup(parser, &dtd->generalEntities, name, 0);\n poolDiscard(&parser->m_temp2Pool);\n /* First, determine if a check for an existing declaration is needed;\n if yes, check that the entity exists, and that it is internal.\n */\n if (pool == &dtd->pool) /* are we called from prolog? */\n checkEntityDecl =\n#ifdef XML_DTD\n parser->m_prologState.documentEntity &&\n#endif /* XML_DTD */\n (dtd->standalone ? ! parser->m_openInternalEntities\n : ! dtd->hasParamEntityRefs);\n else /* if (pool == &parser->m_tempPool): we are called from content */\n checkEntityDecl = ! dtd->hasParamEntityRefs || dtd->standalone;\n if (checkEntityDecl) {\n if (! entity)\n return XML_ERROR_UNDEFINED_ENTITY;\n else if (! entity->is_internal)\n return XML_ERROR_ENTITY_DECLARED_IN_PE;\n } else if (! entity) {\n /* Cannot report skipped entity here - see comments on\n parser->m_skippedEntityHandler.\n if (parser->m_skippedEntityHandler)\n parser->m_skippedEntityHandler(parser->m_handlerArg, name, 0);\n */\n /* Cannot call the default handler because this would be\n out of sync with the call to the startElementHandler.\n if ((pool == &parser->m_tempPool) && parser->m_defaultHandler)\n reportDefault(parser, enc, ptr, next);\n */\n break;\n }\n if (entity->open) {\n if (enc == parser->m_encoding) {\n /* It does not appear that this line can be executed.\n *\n * The \"if (entity->open)\" check catches recursive entity\n * definitions. In order to be called with an open\n * entity, it must have gone through this code before and\n * been through the recursive call to\n * appendAttributeValue() some lines below. That call\n * sets the local encoding (\"enc\") to the parser's\n * internal encoding (internal_utf8 or internal_utf16),\n * which can never be the same as the principle encoding.\n * It doesn't appear there is another code path that gets\n * here with entity->open being TRUE.\n *\n * Since it is not certain that this logic is watertight,\n * we keep the line and merely exclude it from coverage\n * tests.\n */\n parser->m_eventPtr = ptr; /* LCOV_EXCL_LINE */\n }\n return XML_ERROR_RECURSIVE_ENTITY_REF;\n }\n if (entity->notation) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_BINARY_ENTITY_REF;\n }\n if (! entity->textPtr) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_ATTRIBUTE_EXTERNAL_ENTITY_REF;\n } else {\n enum XML_Error result;\n const XML_Char *textEnd = entity->textPtr + entity->textLen;\n entity->open = XML_TRUE;\n result = appendAttributeValue(parser, parser->m_internalEncoding,\n isCdata, (char *)entity->textPtr,\n (char *)textEnd, pool);\n entity->open = XML_FALSE;\n if (result)\n return result;\n }\n } break;\n default:\n /* The only token returned by XmlAttributeValueTok() that does\n * not have an explicit case here is XML_TOK_PARTIAL_CHAR.\n * Getting that would require an entity name to contain an\n * incomplete XML character (e.g. \\xE2\\x82); however previous\n * tokenisers will have already recognised and rejected such\n * names before XmlAttributeValueTok() gets a look-in. This\n * default case should be retained as a safety net, but the code\n * excluded from coverage tests.\n *\n * LCOV_EXCL_START\n */\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_UNEXPECTED_STATE;\n /* LCOV_EXCL_STOP */\n }\n ptr = next;\n }\n /* not reached */\n}\n\nstatic enum XML_Error\nstoreEntityValue(XML_Parser parser, const ENCODING *enc,\n const char *entityTextPtr, const char *entityTextEnd) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n STRING_POOL *pool = &(dtd->entityValuePool);\n enum XML_Error result = XML_ERROR_NONE;\n#ifdef XML_DTD\n int oldInEntityValue = parser->m_prologState.inEntityValue;\n parser->m_prologState.inEntityValue = 1;\n#endif /* XML_DTD */\n /* never return Null for the value argument in EntityDeclHandler,\n since this would indicate an external entity; therefore we\n have to make sure that entityValuePool.start is not null */\n if (! pool->blocks) {\n if (! poolGrow(pool))\n return XML_ERROR_NO_MEMORY;\n }\n\n for (;;) {\n const char *next;\n int tok = XmlEntityValueTok(enc, entityTextPtr, entityTextEnd, &next);\n switch (tok) {\n case XML_TOK_PARAM_ENTITY_REF:\n#ifdef XML_DTD\n if (parser->m_isParamEntity || enc != parser->m_encoding) {\n const XML_Char *name;\n ENTITY *entity;\n name = poolStoreString(&parser->m_tempPool, enc,\n entityTextPtr + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! name) {\n result = XML_ERROR_NO_MEMORY;\n goto endEntityValue;\n }\n entity = (ENTITY *)lookup(parser, &dtd->paramEntities, name, 0);\n poolDiscard(&parser->m_tempPool);\n if (! entity) {\n /* not a well-formedness error - see XML 1.0: WFC Entity Declared */\n /* cannot report skipped entity here - see comments on\n parser->m_skippedEntityHandler\n if (parser->m_skippedEntityHandler)\n parser->m_skippedEntityHandler(parser->m_handlerArg, name, 0);\n */\n dtd->keepProcessing = dtd->standalone;\n goto endEntityValue;\n }\n if (entity->open) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_RECURSIVE_ENTITY_REF;\n goto endEntityValue;\n }\n if (entity->systemId) {\n if (parser->m_externalEntityRefHandler) {\n dtd->paramEntityRead = XML_FALSE;\n entity->open = XML_TRUE;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, 0, entity->base,\n entity->systemId, entity->publicId)) {\n entity->open = XML_FALSE;\n result = XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n goto endEntityValue;\n }\n entity->open = XML_FALSE;\n if (! dtd->paramEntityRead)\n dtd->keepProcessing = dtd->standalone;\n } else\n dtd->keepProcessing = dtd->standalone;\n } else {\n entity->open = XML_TRUE;\n result = storeEntityValue(\n parser, parser->m_internalEncoding, (char *)entity->textPtr,\n (char *)(entity->textPtr + entity->textLen));\n entity->open = XML_FALSE;\n if (result)\n goto endEntityValue;\n }\n break;\n }\n#endif /* XML_DTD */\n /* In the internal subset, PE references are not legal\n within markup declarations, e.g entity values in this case. */\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_PARAM_ENTITY_REF;\n goto endEntityValue;\n case XML_TOK_NONE:\n result = XML_ERROR_NONE;\n goto endEntityValue;\n case XML_TOK_ENTITY_REF:\n case XML_TOK_DATA_CHARS:\n if (! poolAppend(pool, enc, entityTextPtr, next)) {\n result = XML_ERROR_NO_MEMORY;\n goto endEntityValue;\n }\n break;\n case XML_TOK_TRAILING_CR:\n next = entityTextPtr + enc->minBytesPerChar;\n /* fall through */\n case XML_TOK_DATA_NEWLINE:\n if (pool->end == pool->ptr && ! poolGrow(pool)) {\n result = XML_ERROR_NO_MEMORY;\n goto endEntityValue;\n }\n *(pool->ptr)++ = 0xA;\n break;\n case XML_TOK_CHAR_REF: {\n XML_Char buf[XML_ENCODE_MAX];\n int i;\n int n = XmlCharRefNumber(enc, entityTextPtr);\n if (n < 0) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_BAD_CHAR_REF;\n goto endEntityValue;\n }\n n = XmlEncode(n, (ICHAR *)buf);\n /* The XmlEncode() functions can never return 0 here. That\n * error return happens if the code point passed in is either\n * negative or greater than or equal to 0x110000. The\n * XmlCharRefNumber() functions will all return a number\n * strictly less than 0x110000 or a negative value if an error\n * occurred. The negative value is intercepted above, so\n * XmlEncode() is never passed a value it might return an\n * error for.\n */\n for (i = 0; i < n; i++) {\n if (pool->end == pool->ptr && ! poolGrow(pool)) {\n result = XML_ERROR_NO_MEMORY;\n goto endEntityValue;\n }\n *(pool->ptr)++ = buf[i];\n }\n } break;\n case XML_TOK_PARTIAL:\n if (enc == parser->m_encoding)\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_INVALID_TOKEN;\n goto endEntityValue;\n case XML_TOK_INVALID:\n if (enc == parser->m_encoding)\n parser->m_eventPtr = next;\n result = XML_ERROR_INVALID_TOKEN;\n goto endEntityValue;\n default:\n /* This default case should be unnecessary -- all the tokens\n * that XmlEntityValueTok() can return have their own explicit\n * cases -- but should be retained for safety. We do however\n * exclude it from the coverage statistics.\n *\n * LCOV_EXCL_START\n */\n if (enc == parser->m_encoding)\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_UNEXPECTED_STATE;\n goto endEntityValue;\n /* LCOV_EXCL_STOP */\n }\n entityTextPtr = next;\n }\nendEntityValue:\n#ifdef XML_DTD\n parser->m_prologState.inEntityValue = oldInEntityValue;\n#endif /* XML_DTD */\n return result;\n}\n\nstatic void FASTCALL\nnormalizeLines(XML_Char *s) {\n XML_Char *p;\n for (;; s++) {\n if (*s == XML_T('\\0'))\n return;\n if (*s == 0xD)\n break;\n }\n p = s;\n do {\n if (*s == 0xD) {\n *p++ = 0xA;\n if (*++s == 0xA)\n s++;\n } else\n *p++ = *s++;\n } while (*s);\n *p = XML_T('\\0');\n}\n\nstatic int\nreportProcessingInstruction(XML_Parser parser, const ENCODING *enc,\n const char *start, const char *end) {\n const XML_Char *target;\n XML_Char *data;\n const char *tem;\n if (! parser->m_processingInstructionHandler) {\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, start, end);\n return 1;\n }\n start += enc->minBytesPerChar * 2;\n tem = start + XmlNameLength(enc, start);\n target = poolStoreString(&parser->m_tempPool, enc, start, tem);\n if (! target)\n return 0;\n poolFinish(&parser->m_tempPool);\n data = poolStoreString(&parser->m_tempPool, enc, XmlSkipS(enc, tem),\n end - enc->minBytesPerChar * 2);\n if (! data)\n return 0;\n normalizeLines(data);\n parser->m_processingInstructionHandler(parser->m_handlerArg, target, data);\n poolClear(&parser->m_tempPool);\n return 1;\n}\n\nstatic int\nreportComment(XML_Parser parser, const ENCODING *enc, const char *start,\n const char *end) {\n XML_Char *data;\n if (! parser->m_commentHandler) {\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, start, end);\n return 1;\n }\n data = poolStoreString(&parser->m_tempPool, enc,\n start + enc->minBytesPerChar * 4,\n end - enc->minBytesPerChar * 3);\n if (! data)\n return 0;\n normalizeLines(data);\n parser->m_commentHandler(parser->m_handlerArg, data);\n poolClear(&parser->m_tempPool);\n return 1;\n}\n\nstatic void\nreportDefault(XML_Parser parser, const ENCODING *enc, const char *s,\n const char *end) {\n if (MUST_CONVERT(enc, s)) {\n enum XML_Convert_Result convert_res;\n const char **eventPP;\n const char **eventEndPP;\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n /* To get here, two things must be true; the parser must be\n * using a character encoding that is not the same as the\n * encoding passed in, and the encoding passed in must need\n * conversion to the internal format (UTF-8 unless XML_UNICODE\n * is defined). The only occasions on which the encoding passed\n * in is not the same as the parser's encoding are when it is\n * the internal encoding (e.g. a previously defined parameter\n * entity, already converted to internal format). This by\n * definition doesn't need conversion, so the whole branch never\n * gets executed.\n *\n * For safety's sake we don't delete these lines and merely\n * exclude them from coverage statistics.\n *\n * LCOV_EXCL_START\n */\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n /* LCOV_EXCL_STOP */\n }\n do {\n ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;\n convert_res\n = XmlConvert(enc, &s, end, &dataPtr, (ICHAR *)parser->m_dataBufEnd);\n *eventEndPP = s;\n parser->m_defaultHandler(parser->m_handlerArg, parser->m_dataBuf,\n (int)(dataPtr - (ICHAR *)parser->m_dataBuf));\n *eventPP = s;\n } while ((convert_res != XML_CONVERT_COMPLETED)\n && (convert_res != XML_CONVERT_INPUT_INCOMPLETE));\n } else\n parser->m_defaultHandler(parser->m_handlerArg, (XML_Char *)s,\n (int)((XML_Char *)end - (XML_Char *)s));\n}\n\nstatic int\ndefineAttribute(ELEMENT_TYPE *type, ATTRIBUTE_ID *attId, XML_Bool isCdata,\n XML_Bool isId, const XML_Char *value, XML_Parser parser) {\n DEFAULT_ATTRIBUTE *att;\n if (value || isId) {\n /* The handling of default attributes gets messed up if we have\n a default which duplicates a non-default. */\n int i;\n for (i = 0; i < type->nDefaultAtts; i++)\n if (attId == type->defaultAtts[i].id)\n return 1;\n if (isId && ! type->idAtt && ! attId->xmlns)\n type->idAtt = attId;\n }\n if (type->nDefaultAtts == type->allocDefaultAtts) {\n if (type->allocDefaultAtts == 0) {\n type->allocDefaultAtts = 8;\n type->defaultAtts = (DEFAULT_ATTRIBUTE *)MALLOC(\n parser, type->allocDefaultAtts * sizeof(DEFAULT_ATTRIBUTE));\n if (! type->defaultAtts) {\n type->allocDefaultAtts = 0;\n return 0;\n }\n } else {\n DEFAULT_ATTRIBUTE *temp;\n int count = type->allocDefaultAtts * 2;\n temp = (DEFAULT_ATTRIBUTE *)REALLOC(parser, type->defaultAtts,\n (count * sizeof(DEFAULT_ATTRIBUTE)));\n if (temp == NULL)\n return 0;\n type->allocDefaultAtts = count;\n type->defaultAtts = temp;\n }\n }\n att = type->defaultAtts + type->nDefaultAtts;\n att->id = attId;\n att->value = value;\n att->isCdata = isCdata;\n if (! isCdata)\n attId->maybeTokenized = XML_TRUE;\n type->nDefaultAtts += 1;\n return 1;\n}\n\nstatic int\nsetElementTypePrefix(XML_Parser parser, ELEMENT_TYPE *elementType) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n const XML_Char *name;\n for (name = elementType->name; *name; name++) {\n if (*name == XML_T(ASCII_COLON)) {\n PREFIX *prefix;\n const XML_Char *s;\n for (s = elementType->name; s != name; s++) {\n if (! poolAppendChar(&dtd->pool, *s))\n return 0;\n }\n if (! poolAppendChar(&dtd->pool, XML_T('\\0')))\n return 0;\n prefix = (PREFIX *)lookup(parser, &dtd->prefixes, poolStart(&dtd->pool),\n sizeof(PREFIX));\n if (! prefix)\n return 0;\n if (prefix->name == poolStart(&dtd->pool))\n poolFinish(&dtd->pool);\n else\n poolDiscard(&dtd->pool);\n elementType->prefix = prefix;\n break;\n }\n }\n return 1;\n}\n\nstatic ATTRIBUTE_ID *\ngetAttributeId(XML_Parser parser, const ENCODING *enc, const char *start,\n const char *end) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n ATTRIBUTE_ID *id;\n const XML_Char *name;\n if (! poolAppendChar(&dtd->pool, XML_T('\\0')))\n return NULL;\n name = poolStoreString(&dtd->pool, enc, start, end);\n if (! name)\n return NULL;\n /* skip quotation mark - its storage will be re-used (like in name[-1]) */\n ++name;\n id = (ATTRIBUTE_ID *)lookup(parser, &dtd->attributeIds, name,\n sizeof(ATTRIBUTE_ID));\n if (! id)\n return NULL;\n if (id->name != name)\n poolDiscard(&dtd->pool);\n else {\n poolFinish(&dtd->pool);\n if (! parser->m_ns)\n ;\n else if (name[0] == XML_T(ASCII_x) && name[1] == XML_T(ASCII_m)\n && name[2] == XML_T(ASCII_l) && name[3] == XML_T(ASCII_n)\n && name[4] == XML_T(ASCII_s)\n && (name[5] == XML_T('\\0') || name[5] == XML_T(ASCII_COLON))) {\n if (name[5] == XML_T('\\0'))\n id->prefix = &dtd->defaultPrefix;\n else\n id->prefix = (PREFIX *)lookup(parser, &dtd->prefixes, name + 6,\n sizeof(PREFIX));\n id->xmlns = XML_TRUE;\n } else {\n int i;\n for (i = 0; name[i]; i++) {\n /* attributes without prefix are *not* in the default namespace */\n if (name[i] == XML_T(ASCII_COLON)) {\n int j;\n for (j = 0; j < i; j++) {\n if (! poolAppendChar(&dtd->pool, name[j]))\n return NULL;\n }\n if (! poolAppendChar(&dtd->pool, XML_T('\\0')))\n return NULL;\n id->prefix = (PREFIX *)lookup(parser, &dtd->prefixes,\n poolStart(&dtd->pool), sizeof(PREFIX));\n if (! id->prefix)\n return NULL;\n if (id->prefix->name == poolStart(&dtd->pool))\n poolFinish(&dtd->pool);\n else\n poolDiscard(&dtd->pool);\n break;\n }\n }\n }\n }\n return id;\n}\n\n#define CONTEXT_SEP XML_T(ASCII_FF)\n\nstatic const XML_Char *\ngetContext(XML_Parser parser) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n HASH_TABLE_ITER iter;\n XML_Bool needSep = XML_FALSE;\n\n if (dtd->defaultPrefix.binding) {\n int i;\n int len;\n if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_EQUALS)))\n return NULL;\n len = dtd->defaultPrefix.binding->uriLen;\n if (parser->m_namespaceSeparator)\n len--;\n for (i = 0; i < len; i++) {\n if (! poolAppendChar(&parser->m_tempPool,\n dtd->defaultPrefix.binding->uri[i])) {\n /* Because of memory caching, I don't believe this line can be\n * executed.\n *\n * This is part of a loop copying the default prefix binding\n * URI into the parser's temporary string pool. Previously,\n * that URI was copied into the same string pool, with a\n * terminating NUL character, as part of setContext(). When\n * the pool was cleared, that leaves a block definitely big\n * enough to hold the URI on the free block list of the pool.\n * The URI copy in getContext() therefore cannot run out of\n * memory.\n *\n * If the pool is used between the setContext() and\n * getContext() calls, the worst it can do is leave a bigger\n * block on the front of the free list. Given that this is\n * all somewhat inobvious and program logic can be changed, we\n * don't delete the line but we do exclude it from the test\n * coverage statistics.\n */\n return NULL; /* LCOV_EXCL_LINE */\n }\n }\n needSep = XML_TRUE;\n }\n\n hashTableIterInit(&iter, &(dtd->prefixes));\n for (;;) {\n int i;\n int len;\n const XML_Char *s;\n PREFIX *prefix = (PREFIX *)hashTableIterNext(&iter);\n if (! prefix)\n break;\n if (! prefix->binding) {\n /* This test appears to be (justifiable) paranoia. There does\n * not seem to be a way of injecting a prefix without a binding\n * that doesn't get errored long before this function is called.\n * The test should remain for safety's sake, so we instead\n * exclude the following line from the coverage statistics.\n */\n continue; /* LCOV_EXCL_LINE */\n }\n if (needSep && ! poolAppendChar(&parser->m_tempPool, CONTEXT_SEP))\n return NULL;\n for (s = prefix->name; *s; s++)\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return NULL;\n if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_EQUALS)))\n return NULL;\n len = prefix->binding->uriLen;\n if (parser->m_namespaceSeparator)\n len--;\n for (i = 0; i < len; i++)\n if (! poolAppendChar(&parser->m_tempPool, prefix->binding->uri[i]))\n return NULL;\n needSep = XML_TRUE;\n }\n\n hashTableIterInit(&iter, &(dtd->generalEntities));\n for (;;) {\n const XML_Char *s;\n ENTITY *e = (ENTITY *)hashTableIterNext(&iter);\n if (! e)\n break;\n if (! e->open)\n continue;\n if (needSep && ! poolAppendChar(&parser->m_tempPool, CONTEXT_SEP))\n return NULL;\n for (s = e->name; *s; s++)\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return 0;\n needSep = XML_TRUE;\n }\n\n if (! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return NULL;\n return parser->m_tempPool.start;\n}\n\nstatic XML_Bool\nsetContext(XML_Parser parser, const XML_Char *context) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n const XML_Char *s = context;\n\n while (*context != XML_T('\\0')) {\n if (*s == CONTEXT_SEP || *s == XML_T('\\0')) {\n ENTITY *e;\n if (! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_FALSE;\n e = (ENTITY *)lookup(parser, &dtd->generalEntities,\n poolStart(&parser->m_tempPool), 0);\n if (e)\n e->open = XML_TRUE;\n if (*s != XML_T('\\0'))\n s++;\n context = s;\n poolDiscard(&parser->m_tempPool);\n } else if (*s == XML_T(ASCII_EQUALS)) {\n PREFIX *prefix;\n if (poolLength(&parser->m_tempPool) == 0)\n prefix = &dtd->defaultPrefix;\n else {\n if (! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_FALSE;\n prefix\n = (PREFIX *)lookup(parser, &dtd->prefixes,\n poolStart(&parser->m_tempPool), sizeof(PREFIX));\n if (! prefix)\n return XML_FALSE;\n if (prefix->name == poolStart(&parser->m_tempPool)) {\n prefix->name = poolCopyString(&dtd->pool, prefix->name);\n if (! prefix->name)\n return XML_FALSE;\n }\n poolDiscard(&parser->m_tempPool);\n }\n for (context = s + 1; *context != CONTEXT_SEP && *context != XML_T('\\0');\n context++)\n if (! poolAppendChar(&parser->m_tempPool, *context))\n return XML_FALSE;\n if (! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_FALSE;\n if (addBinding(parser, prefix, NULL, poolStart(&parser->m_tempPool),\n &parser->m_inheritedBindings)\n != XML_ERROR_NONE)\n return XML_FALSE;\n poolDiscard(&parser->m_tempPool);\n if (*context != XML_T('\\0'))\n ++context;\n s = context;\n } else {\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return XML_FALSE;\n s++;\n }\n }\n return XML_TRUE;\n}\n\nstatic void FASTCALL\nnormalizePublicId(XML_Char *publicId) {\n XML_Char *p = publicId;\n XML_Char *s;\n for (s = publicId; *s; s++) {\n switch (*s) {\n case 0x20:\n case 0xD:\n case 0xA:\n if (p != publicId && p[-1] != 0x20)\n *p++ = 0x20;\n break;\n default:\n *p++ = *s;\n }\n }\n if (p != publicId && p[-1] == 0x20)\n --p;\n *p = XML_T('\\0');\n}\n\nstatic DTD *\ndtdCreate(const XML_Memory_Handling_Suite *ms) {\n DTD *p = (DTD *)ms->malloc_fcn(sizeof(DTD));\n if (p == NULL)\n return p;\n poolInit(&(p->pool), ms);\n poolInit(&(p->entityValuePool), ms);\n hashTableInit(&(p->generalEntities), ms);\n hashTableInit(&(p->elementTypes), ms);\n hashTableInit(&(p->attributeIds), ms);\n hashTableInit(&(p->prefixes), ms);\n#ifdef XML_DTD\n p->paramEntityRead = XML_FALSE;\n hashTableInit(&(p->paramEntities), ms);\n#endif /* XML_DTD */\n p->defaultPrefix.name = NULL;\n p->defaultPrefix.binding = NULL;\n\n p->in_eldecl = XML_FALSE;\n p->scaffIndex = NULL;\n p->scaffold = NULL;\n p->scaffLevel = 0;\n p->scaffSize = 0;\n p->scaffCount = 0;\n p->contentStringLen = 0;\n\n p->keepProcessing = XML_TRUE;\n p->hasParamEntityRefs = XML_FALSE;\n p->standalone = XML_FALSE;\n return p;\n}\n\nstatic void\ndtdReset(DTD *p, const XML_Memory_Handling_Suite *ms) {\n HASH_TABLE_ITER iter;\n hashTableIterInit(&iter, &(p->elementTypes));\n for (;;) {\n ELEMENT_TYPE *e = (ELEMENT_TYPE *)hashTableIterNext(&iter);\n if (! e)\n break;\n if (e->allocDefaultAtts != 0)\n ms->free_fcn(e->defaultAtts);\n }\n hashTableClear(&(p->generalEntities));\n#ifdef XML_DTD\n p->paramEntityRead = XML_FALSE;\n hashTableClear(&(p->paramEntities));\n#endif /* XML_DTD */\n hashTableClear(&(p->elementTypes));\n hashTableClear(&(p->attributeIds));\n hashTableClear(&(p->prefixes));\n poolClear(&(p->pool));\n poolClear(&(p->entityValuePool));\n p->defaultPrefix.name = NULL;\n p->defaultPrefix.binding = NULL;\n\n p->in_eldecl = XML_FALSE;\n\n ms->free_fcn(p->scaffIndex);\n p->scaffIndex = NULL;\n ms->free_fcn(p->scaffold);\n p->scaffold = NULL;\n\n p->scaffLevel = 0;\n p->scaffSize = 0;\n p->scaffCount = 0;\n p->contentStringLen = 0;\n\n p->keepProcessing = XML_TRUE;\n p->hasParamEntityRefs = XML_FALSE;\n p->standalone = XML_FALSE;\n}\n\nstatic void\ndtdDestroy(DTD *p, XML_Bool isDocEntity, const XML_Memory_Handling_Suite *ms) {\n HASH_TABLE_ITER iter;\n hashTableIterInit(&iter, &(p->elementTypes));\n for (;;) {\n ELEMENT_TYPE *e = (ELEMENT_TYPE *)hashTableIterNext(&iter);\n if (! e)\n break;\n if (e->allocDefaultAtts != 0)\n ms->free_fcn(e->defaultAtts);\n }\n hashTableDestroy(&(p->generalEntities));\n#ifdef XML_DTD\n hashTableDestroy(&(p->paramEntities));\n#endif /* XML_DTD */\n hashTableDestroy(&(p->elementTypes));\n hashTableDestroy(&(p->attributeIds));\n hashTableDestroy(&(p->prefixes));\n poolDestroy(&(p->pool));\n poolDestroy(&(p->entityValuePool));\n if (isDocEntity) {\n ms->free_fcn(p->scaffIndex);\n ms->free_fcn(p->scaffold);\n }\n ms->free_fcn(p);\n}\n\n/* Do a deep copy of the DTD. Return 0 for out of memory, non-zero otherwise.\n The new DTD has already been initialized.\n*/\nstatic int\ndtdCopy(XML_Parser oldParser, DTD *newDtd, const DTD *oldDtd,\n const XML_Memory_Handling_Suite *ms) {\n HASH_TABLE_ITER iter;\n\n /* Copy the prefix table. */\n\n hashTableIterInit(&iter, &(oldDtd->prefixes));\n for (;;) {\n const XML_Char *name;\n const PREFIX *oldP = (PREFIX *)hashTableIterNext(&iter);\n if (! oldP)\n break;\n name = poolCopyString(&(newDtd->pool), oldP->name);\n if (! name)\n return 0;\n if (! lookup(oldParser, &(newDtd->prefixes), name, sizeof(PREFIX)))\n return 0;\n }\n\n hashTableIterInit(&iter, &(oldDtd->attributeIds));\n\n /* Copy the attribute id table. */\n\n for (;;) {\n ATTRIBUTE_ID *newA;\n const XML_Char *name;\n const ATTRIBUTE_ID *oldA = (ATTRIBUTE_ID *)hashTableIterNext(&iter);\n\n if (! oldA)\n break;\n /* Remember to allocate the scratch byte before the name. */\n if (! poolAppendChar(&(newDtd->pool), XML_T('\\0')))\n return 0;\n name = poolCopyString(&(newDtd->pool), oldA->name);\n if (! name)\n return 0;\n ++name;\n newA = (ATTRIBUTE_ID *)lookup(oldParser, &(newDtd->attributeIds), name,\n sizeof(ATTRIBUTE_ID));\n if (! newA)\n return 0;\n newA->maybeTokenized = oldA->maybeTokenized;\n if (oldA->prefix) {\n newA->xmlns = oldA->xmlns;\n if (oldA->prefix == &oldDtd->defaultPrefix)\n newA->prefix = &newDtd->defaultPrefix;\n else\n newA->prefix = (PREFIX *)lookup(oldParser, &(newDtd->prefixes),\n oldA->prefix->name, 0);\n }\n }\n\n /* Copy the element type table. */\n\n hashTableIterInit(&iter, &(oldDtd->elementTypes));\n\n for (;;) {\n int i;\n ELEMENT_TYPE *newE;\n const XML_Char *name;\n const ELEMENT_TYPE *oldE = (ELEMENT_TYPE *)hashTableIterNext(&iter);\n if (! oldE)\n break;\n name = poolCopyString(&(newDtd->pool), oldE->name);\n if (! name)\n return 0;\n newE = (ELEMENT_TYPE *)lookup(oldParser, &(newDtd->elementTypes), name,\n sizeof(ELEMENT_TYPE));\n if (! newE)\n return 0;\n if (oldE->nDefaultAtts) {\n newE->defaultAtts = (DEFAULT_ATTRIBUTE *)ms->malloc_fcn(\n oldE->nDefaultAtts * sizeof(DEFAULT_ATTRIBUTE));\n if (! newE->defaultAtts) {\n return 0;\n }\n }\n if (oldE->idAtt)\n newE->idAtt = (ATTRIBUTE_ID *)lookup(oldParser, &(newDtd->attributeIds),\n oldE->idAtt->name, 0);\n newE->allocDefaultAtts = newE->nDefaultAtts = oldE->nDefaultAtts;\n if (oldE->prefix)\n newE->prefix = (PREFIX *)lookup(oldParser, &(newDtd->prefixes),\n oldE->prefix->name, 0);\n for (i = 0; i < newE->nDefaultAtts; i++) {\n newE->defaultAtts[i].id = (ATTRIBUTE_ID *)lookup(\n oldParser, &(newDtd->attributeIds), oldE->defaultAtts[i].id->name, 0);\n newE->defaultAtts[i].isCdata = oldE->defaultAtts[i].isCdata;\n if (oldE->defaultAtts[i].value) {\n newE->defaultAtts[i].value\n = poolCopyString(&(newDtd->pool), oldE->defaultAtts[i].value);\n if (! newE->defaultAtts[i].value)\n return 0;\n } else\n newE->defaultAtts[i].value = NULL;\n }\n }\n\n /* Copy the entity tables. */\n if (! copyEntityTable(oldParser, &(newDtd->generalEntities), &(newDtd->pool),\n &(oldDtd->generalEntities)))\n return 0;\n\n#ifdef XML_DTD\n if (! copyEntityTable(oldParser, &(newDtd->paramEntities), &(newDtd->pool),\n &(oldDtd->paramEntities)))\n return 0;\n newDtd->paramEntityRead = oldDtd->paramEntityRead;\n#endif /* XML_DTD */\n\n newDtd->keepProcessing = oldDtd->keepProcessing;\n newDtd->hasParamEntityRefs = oldDtd->hasParamEntityRefs;\n newDtd->standalone = oldDtd->standalone;\n\n /* Don't want deep copying for scaffolding */\n newDtd->in_eldecl = oldDtd->in_eldecl;\n newDtd->scaffold = oldDtd->scaffold;\n newDtd->contentStringLen = oldDtd->contentStringLen;\n newDtd->scaffSize = oldDtd->scaffSize;\n newDtd->scaffLevel = oldDtd->scaffLevel;\n newDtd->scaffIndex = oldDtd->scaffIndex;\n\n return 1;\n} /* End dtdCopy */\n\nstatic int\ncopyEntityTable(XML_Parser oldParser, HASH_TABLE *newTable,\n STRING_POOL *newPool, const HASH_TABLE *oldTable) {\n HASH_TABLE_ITER iter;\n const XML_Char *cachedOldBase = NULL;\n const XML_Char *cachedNewBase = NULL;\n\n hashTableIterInit(&iter, oldTable);\n\n for (;;) {\n ENTITY *newE;\n const XML_Char *name;\n const ENTITY *oldE = (ENTITY *)hashTableIterNext(&iter);\n if (! oldE)\n break;\n name = poolCopyString(newPool, oldE->name);\n if (! name)\n return 0;\n newE = (ENTITY *)lookup(oldParser, newTable, name, sizeof(ENTITY));\n if (! newE)\n return 0;\n if (oldE->systemId) {\n const XML_Char *tem = poolCopyString(newPool, oldE->systemId);\n if (! tem)\n return 0;\n newE->systemId = tem;\n if (oldE->base) {\n if (oldE->base == cachedOldBase)\n newE->base = cachedNewBase;\n else {\n cachedOldBase = oldE->base;\n tem = poolCopyString(newPool, cachedOldBase);\n if (! tem)\n return 0;\n cachedNewBase = newE->base = tem;\n }\n }\n if (oldE->publicId) {\n tem = poolCopyString(newPool, oldE->publicId);\n if (! tem)\n return 0;\n newE->publicId = tem;\n }\n } else {\n const XML_Char *tem\n = poolCopyStringN(newPool, oldE->textPtr, oldE->textLen);\n if (! tem)\n return 0;\n newE->textPtr = tem;\n newE->textLen = oldE->textLen;\n }\n if (oldE->notation) {\n const XML_Char *tem = poolCopyString(newPool, oldE->notation);\n if (! tem)\n return 0;\n newE->notation = tem;\n }\n newE->is_param = oldE->is_param;\n newE->is_internal = oldE->is_internal;\n }\n return 1;\n}\n\n#define INIT_POWER 6\n\nstatic XML_Bool FASTCALL\nkeyeq(KEY s1, KEY s2) {\n for (; *s1 == *s2; s1++, s2++)\n if (*s1 == 0)\n return XML_TRUE;\n return XML_FALSE;\n}\n\nstatic size_t\nkeylen(KEY s) {\n size_t len = 0;\n for (; *s; s++, len++)\n ;\n return len;\n}\n\nstatic void\ncopy_salt_to_sipkey(XML_Parser parser, struct sipkey *key) {\n key->k[0] = 0;\n key->k[1] = get_hash_secret_salt(parser);\n}\n\nstatic unsigned long FASTCALL\nhash(XML_Parser parser, KEY s) {\n struct siphash state;\n struct sipkey key;\n (void)sip24_valid;\n copy_salt_to_sipkey(parser, &key);\n sip24_init(&state, &key);\n sip24_update(&state, s, keylen(s) * sizeof(XML_Char));\n return (unsigned long)sip24_final(&state);\n}\n\nstatic NAMED *\nlookup(XML_Parser parser, HASH_TABLE *table, KEY name, size_t createSize) {\n size_t i;\n if (table->size == 0) {\n size_t tsize;\n if (! createSize)\n return NULL;\n table->power = INIT_POWER;\n /* table->size is a power of 2 */\n table->size = (size_t)1 << INIT_POWER;\n tsize = table->size * sizeof(NAMED *);\n table->v = (NAMED **)table->mem->malloc_fcn(tsize);\n if (! table->v) {\n table->size = 0;\n return NULL;\n }\n memset(table->v, 0, tsize);\n i = hash(parser, name) & ((unsigned long)table->size - 1);\n } else {\n unsigned long h = hash(parser, name);\n unsigned long mask = (unsigned long)table->size - 1;\n unsigned char step = 0;\n i = h & mask;\n while (table->v[i]) {\n if (keyeq(name, table->v[i]->name))\n return table->v[i];\n if (! step)\n step = PROBE_STEP(h, mask, table->power);\n i < step ? (i += table->size - step) : (i -= step);\n }\n if (! createSize)\n return NULL;\n\n /* check for overflow (table is half full) */\n if (table->used >> (table->power - 1)) {\n unsigned char newPower = table->power + 1;\n size_t newSize = (size_t)1 << newPower;\n unsigned long newMask = (unsigned long)newSize - 1;\n size_t tsize = newSize * sizeof(NAMED *);\n NAMED **newV = (NAMED **)table->mem->malloc_fcn(tsize);\n if (! newV)\n return NULL;\n memset(newV, 0, tsize);\n for (i = 0; i < table->size; i++)\n if (table->v[i]) {\n unsigned long newHash = hash(parser, table->v[i]->name);\n size_t j = newHash & newMask;\n step = 0;\n while (newV[j]) {\n if (! step)\n step = PROBE_STEP(newHash, newMask, newPower);\n j < step ? (j += newSize - step) : (j -= step);\n }\n newV[j] = table->v[i];\n }\n table->mem->free_fcn(table->v);\n table->v = newV;\n table->power = newPower;\n table->size = newSize;\n i = h & newMask;\n step = 0;\n while (table->v[i]) {\n if (! step)\n step = PROBE_STEP(h, newMask, newPower);\n i < step ? (i += newSize - step) : (i -= step);\n }\n }\n }\n table->v[i] = (NAMED *)table->mem->malloc_fcn(createSize);\n if (! table->v[i])\n return NULL;\n memset(table->v[i], 0, createSize);\n table->v[i]->name = name;\n (table->used)++;\n return table->v[i];\n}\n\nstatic void FASTCALL\nhashTableClear(HASH_TABLE *table) {\n size_t i;\n for (i = 0; i < table->size; i++) {\n table->mem->free_fcn(table->v[i]);\n table->v[i] = NULL;\n }\n table->used = 0;\n}\n\nstatic void FASTCALL\nhashTableDestroy(HASH_TABLE *table) {\n size_t i;\n for (i = 0; i < table->size; i++)\n table->mem->free_fcn(table->v[i]);\n table->mem->free_fcn(table->v);\n}\n\nstatic void FASTCALL\nhashTableInit(HASH_TABLE *p, const XML_Memory_Handling_Suite *ms) {\n p->power = 0;\n p->size = 0;\n p->used = 0;\n p->v = NULL;\n p->mem = ms;\n}\n\nstatic void FASTCALL\nhashTableIterInit(HASH_TABLE_ITER *iter, const HASH_TABLE *table) {\n iter->p = table->v;\n iter->end = iter->p + table->size;\n}\n\nstatic NAMED *FASTCALL\nhashTableIterNext(HASH_TABLE_ITER *iter) {\n while (iter->p != iter->end) {\n NAMED *tem = *(iter->p)++;\n if (tem)\n return tem;\n }\n return NULL;\n}\n\nstatic void FASTCALL\npoolInit(STRING_POOL *pool, const XML_Memory_Handling_Suite *ms) {\n pool->blocks = NULL;\n pool->freeBlocks = NULL;\n pool->start = NULL;\n pool->ptr = NULL;\n pool->end = NULL;\n pool->mem = ms;\n}\n\nstatic void FASTCALL\npoolClear(STRING_POOL *pool) {\n if (! pool->freeBlocks)\n pool->freeBlocks = pool->blocks;\n else {\n BLOCK *p = pool->blocks;\n while (p) {\n BLOCK *tem = p->next;\n p->next = pool->freeBlocks;\n pool->freeBlocks = p;\n p = tem;\n }\n }\n pool->blocks = NULL;\n pool->start = NULL;\n pool->ptr = NULL;\n pool->end = NULL;\n}\n\nstatic void FASTCALL\npoolDestroy(STRING_POOL *pool) {\n BLOCK *p = pool->blocks;\n while (p) {\n BLOCK *tem = p->next;\n pool->mem->free_fcn(p);\n p = tem;\n }\n p = pool->freeBlocks;\n while (p) {\n BLOCK *tem = p->next;\n pool->mem->free_fcn(p);\n p = tem;\n }\n}\n\nstatic XML_Char *\npoolAppend(STRING_POOL *pool, const ENCODING *enc, const char *ptr,\n const char *end) {\n if (! pool->ptr && ! poolGrow(pool))\n return NULL;\n for (;;) {\n const enum XML_Convert_Result convert_res = XmlConvert(\n enc, &ptr, end, (ICHAR **)&(pool->ptr), (ICHAR *)pool->end);\n if ((convert_res == XML_CONVERT_COMPLETED)\n || (convert_res == XML_CONVERT_INPUT_INCOMPLETE))\n break;\n if (! poolGrow(pool))\n return NULL;\n }\n return pool->start;\n}\n\nstatic const XML_Char *FASTCALL\npoolCopyString(STRING_POOL *pool, const XML_Char *s) {\n do {\n if (! poolAppendChar(pool, *s))\n return NULL;\n } while (*s++);\n s = pool->start;\n poolFinish(pool);\n return s;\n}\n\nstatic const XML_Char *\npoolCopyStringN(STRING_POOL *pool, const XML_Char *s, int n) {\n if (! pool->ptr && ! poolGrow(pool)) {\n /* The following line is unreachable given the current usage of\n * poolCopyStringN(). Currently it is called from exactly one\n * place to copy the text of a simple general entity. By that\n * point, the name of the entity is already stored in the pool, so\n * pool->ptr cannot be NULL.\n *\n * If poolCopyStringN() is used elsewhere as it well might be,\n * this line may well become executable again. Regardless, this\n * sort of check shouldn't be removed lightly, so we just exclude\n * it from the coverage statistics.\n */\n return NULL; /* LCOV_EXCL_LINE */\n }\n for (; n > 0; --n, s++) {\n if (! poolAppendChar(pool, *s))\n return NULL;\n }\n s = pool->start;\n poolFinish(pool);\n return s;\n}\n\nstatic const XML_Char *FASTCALL\npoolAppendString(STRING_POOL *pool, const XML_Char *s) {\n while (*s) {\n if (! poolAppendChar(pool, *s))\n return NULL;\n s++;\n }\n return pool->start;\n}\n\nstatic XML_Char *\npoolStoreString(STRING_POOL *pool, const ENCODING *enc, const char *ptr,\n const char *end) {\n if (! poolAppend(pool, enc, ptr, end))\n return NULL;\n if (pool->ptr == pool->end && ! poolGrow(pool))\n return NULL;\n *(pool->ptr)++ = 0;\n return pool->start;\n}\n\nstatic size_t\npoolBytesToAllocateFor(int blockSize) {\n /* Unprotected math would be:\n ** return offsetof(BLOCK, s) + blockSize * sizeof(XML_Char);\n **\n ** Detect overflow, avoiding _signed_ overflow undefined behavior\n ** For a + b * c we check b * c in isolation first, so that addition of a\n ** on top has no chance of making us accept a small non-negative number\n */\n const size_t stretch = sizeof(XML_Char); /* can be 4 bytes */\n\n if (blockSize <= 0)\n return 0;\n\n if (blockSize > (int)(INT_MAX / stretch))\n return 0;\n\n {\n const int stretchedBlockSize = blockSize * (int)stretch;\n const int bytesToAllocate\n = (int)(offsetof(BLOCK, s) + (unsigned)stretchedBlockSize);\n if (bytesToAllocate < 0)\n return 0;\n\n return (size_t)bytesToAllocate;\n }\n}\n\nstatic XML_Bool FASTCALL\npoolGrow(STRING_POOL *pool) {\n if (pool->freeBlocks) {\n if (pool->start == 0) {\n pool->blocks = pool->freeBlocks;\n pool->freeBlocks = pool->freeBlocks->next;\n pool->blocks->next = NULL;\n pool->start = pool->blocks->s;\n pool->end = pool->start + pool->blocks->size;\n pool->ptr = pool->start;\n return XML_TRUE;\n }\n if (pool->end - pool->start < pool->freeBlocks->size) {\n BLOCK *tem = pool->freeBlocks->next;\n pool->freeBlocks->next = pool->blocks;\n pool->blocks = pool->freeBlocks;\n pool->freeBlocks = tem;\n memcpy(pool->blocks->s, pool->start,\n (pool->end - pool->start) * sizeof(XML_Char));\n pool->ptr = pool->blocks->s + (pool->ptr - pool->start);\n pool->start = pool->blocks->s;\n pool->end = pool->start + pool->blocks->size;\n return XML_TRUE;\n }\n }\n if (pool->blocks && pool->start == pool->blocks->s) {\n BLOCK *temp;\n int blockSize = (int)((unsigned)(pool->end - pool->start) * 2U);\n size_t bytesToAllocate;\n\n /* NOTE: Needs to be calculated prior to calling `realloc`\n to avoid dangling pointers: */\n const ptrdiff_t offsetInsideBlock = pool->ptr - pool->start;\n\n if (blockSize < 0) {\n /* This condition traps a situation where either more than\n * INT_MAX/2 bytes have already been allocated. This isn't\n * readily testable, since it is unlikely that an average\n * machine will have that much memory, so we exclude it from the\n * coverage statistics.\n */\n return XML_FALSE; /* LCOV_EXCL_LINE */\n }\n\n bytesToAllocate = poolBytesToAllocateFor(blockSize);\n if (bytesToAllocate == 0)\n return XML_FALSE;\n\n temp = (BLOCK *)pool->mem->realloc_fcn(pool->blocks,\n (unsigned)bytesToAllocate);\n if (temp == NULL)\n return XML_FALSE;\n pool->blocks = temp;\n pool->blocks->size = blockSize;\n pool->ptr = pool->blocks->s + offsetInsideBlock;\n pool->start = pool->blocks->s;\n pool->end = pool->start + blockSize;\n } else {\n BLOCK *tem;\n int blockSize = (int)(pool->end - pool->start);\n size_t bytesToAllocate;\n\n if (blockSize < 0) {\n /* This condition traps a situation where either more than\n * INT_MAX bytes have already been allocated (which is prevented\n * by various pieces of program logic, not least this one, never\n * mind the unlikelihood of actually having that much memory) or\n * the pool control fields have been corrupted (which could\n * conceivably happen in an extremely buggy user handler\n * function). Either way it isn't readily testable, so we\n * exclude it from the coverage statistics.\n */\n return XML_FALSE; /* LCOV_EXCL_LINE */\n }\n\n if (blockSize < INIT_BLOCK_SIZE)\n blockSize = INIT_BLOCK_SIZE;\n else {\n /* Detect overflow, avoiding _signed_ overflow undefined behavior */\n if ((int)((unsigned)blockSize * 2U) < 0) {\n return XML_FALSE;\n }\n blockSize *= 2;\n }\n\n bytesToAllocate = poolBytesToAllocateFor(blockSize);\n if (bytesToAllocate == 0)\n return XML_FALSE;\n\n tem = (BLOCK *)pool->mem->malloc_fcn(bytesToAllocate);\n if (! tem)\n return XML_FALSE;\n tem->size = blockSize;\n tem->next = pool->blocks;\n pool->blocks = tem;\n if (pool->ptr != pool->start)\n memcpy(tem->s, pool->start, (pool->ptr - pool->start) * sizeof(XML_Char));\n pool->ptr = tem->s + (pool->ptr - pool->start);\n pool->start = tem->s;\n pool->end = tem->s + blockSize;\n }\n return XML_TRUE;\n}\n\nstatic int FASTCALL\nnextScaffoldPart(XML_Parser parser) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n CONTENT_SCAFFOLD *me;\n int next;\n\n if (! dtd->scaffIndex) {\n dtd->scaffIndex = (int *)MALLOC(parser, parser->m_groupSize * sizeof(int));\n if (! dtd->scaffIndex)\n return -1;\n dtd->scaffIndex[0] = 0;\n }\n\n if (dtd->scaffCount >= dtd->scaffSize) {\n CONTENT_SCAFFOLD *temp;\n if (dtd->scaffold) {\n temp = (CONTENT_SCAFFOLD *)REALLOC(\n parser, dtd->scaffold, dtd->scaffSize * 2 * sizeof(CONTENT_SCAFFOLD));\n if (temp == NULL)\n return -1;\n dtd->scaffSize *= 2;\n } else {\n temp = (CONTENT_SCAFFOLD *)MALLOC(parser, INIT_SCAFFOLD_ELEMENTS\n * sizeof(CONTENT_SCAFFOLD));\n if (temp == NULL)\n return -1;\n dtd->scaffSize = INIT_SCAFFOLD_ELEMENTS;\n }\n dtd->scaffold = temp;\n }\n next = dtd->scaffCount++;\n me = &dtd->scaffold[next];\n if (dtd->scaffLevel) {\n CONTENT_SCAFFOLD *parent\n = &dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]];\n if (parent->lastchild) {\n dtd->scaffold[parent->lastchild].nextsib = next;\n }\n if (! parent->childcnt)\n parent->firstchild = next;\n parent->lastchild = next;\n parent->childcnt++;\n }\n me->firstchild = me->lastchild = me->childcnt = me->nextsib = 0;\n return next;\n}\n\nstatic void\nbuild_node(XML_Parser parser, int src_node, XML_Content *dest,\n XML_Content **contpos, XML_Char **strpos) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n dest->type = dtd->scaffold[src_node].type;\n dest->quant = dtd->scaffold[src_node].quant;\n if (dest->type == XML_CTYPE_NAME) {\n const XML_Char *src;\n dest->name = *strpos;\n src = dtd->scaffold[src_node].name;\n for (;;) {\n *(*strpos)++ = *src;\n if (! *src)\n break;\n src++;\n }\n dest->numchildren = 0;\n dest->children = NULL;\n } else {\n unsigned int i;\n int cn;\n dest->numchildren = dtd->scaffold[src_node].childcnt;\n dest->children = *contpos;\n *contpos += dest->numchildren;\n for (i = 0, cn = dtd->scaffold[src_node].firstchild; i < dest->numchildren;\n i++, cn = dtd->scaffold[cn].nextsib) {\n build_node(parser, cn, &(dest->children[i]), contpos, strpos);\n }\n dest->name = NULL;\n }\n}\n\nstatic XML_Content *\nbuild_model(XML_Parser parser) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n XML_Content *ret;\n XML_Content *cpos;\n XML_Char *str;\n int allocsize = (dtd->scaffCount * sizeof(XML_Content)\n + (dtd->contentStringLen * sizeof(XML_Char)));\n\n ret = (XML_Content *)MALLOC(parser, allocsize);\n if (! ret)\n return NULL;\n\n str = (XML_Char *)(&ret[dtd->scaffCount]);\n cpos = &ret[1];\n\n build_node(parser, 0, ret, &cpos, &str);\n return ret;\n}\n\nstatic ELEMENT_TYPE *\ngetElementType(XML_Parser parser, const ENCODING *enc, const char *ptr,\n const char *end) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n const XML_Char *name = poolStoreString(&dtd->pool, enc, ptr, end);\n ELEMENT_TYPE *ret;\n\n if (! name)\n return NULL;\n ret = (ELEMENT_TYPE *)lookup(parser, &dtd->elementTypes, name,\n sizeof(ELEMENT_TYPE));\n if (! ret)\n return NULL;\n if (ret->name != name)\n poolDiscard(&dtd->pool);\n else {\n poolFinish(&dtd->pool);\n if (! setElementTypePrefix(parser, ret))\n return NULL;\n }\n return ret;\n}\n\nstatic XML_Char *\ncopyString(const XML_Char *s, const XML_Memory_Handling_Suite *memsuite) {\n int charsRequired = 0;\n XML_Char *result;\n\n /* First determine how long the string is */\n while (s[charsRequired] != 0) {\n charsRequired++;\n }\n /* Include the terminator */\n charsRequired++;\n\n /* Now allocate space for the copy */\n result = memsuite->malloc_fcn(charsRequired * sizeof(XML_Char));\n if (result == NULL)\n return NULL;\n /* Copy the original into place */\n memcpy(result, s, charsRequired * sizeof(XML_Char));\n return result;\n}\n"},"code_after":{"kind":"string","value":"/* 69df5be70289a11fb834869ce4a91c23c1d9dd04baffcbd10e86742d149a080c (2.2.7+)\n __ __ _\n ___\\ \\/ /_ __ __ _| |_\n / _ \\\\ /| '_ \\ / _` | __|\n | __// \\| |_) | (_| | |_\n \\___/_/\\_\\ .__/ \\__,_|\\__|\n |_| XML parser\n\n Copyright (c) 1997-2000 Thai Open Source Software Center Ltd\n Copyright (c) 2000-2017 Expat development team\n Licensed under the MIT license:\n\n Permission is hereby granted, free of charge, to any person obtaining\n a copy of this software and associated documentation files (the\n \"Software\"), to deal in the Software without restriction, including\n without limitation the rights to use, copy, modify, merge, publish,\n distribute, sublicense, and/or sell copies of the Software, and to permit\n persons to whom the Software is furnished to do so, subject to the\n following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n USE OR OTHER DEALINGS IN THE SOFTWARE.\n*/\n\n#if ! defined(_GNU_SOURCE)\n# define _GNU_SOURCE 1 /* syscall prototype */\n#endif\n\n#ifdef _WIN32\n/* force stdlib to define rand_s() */\n# define _CRT_RAND_S\n#endif\n\n#include \n#include /* memset(), memcpy() */\n#include \n#include /* UINT_MAX */\n#include /* fprintf */\n#include /* getenv, rand_s */\n\n#ifdef _WIN32\n# define getpid GetCurrentProcessId\n#else\n# include /* gettimeofday() */\n# include /* getpid() */\n# include /* getpid() */\n# include /* O_RDONLY */\n# include \n#endif\n\n#define XML_BUILDING_EXPAT 1\n\n#ifdef _WIN32\n# include \"winconfig.h\"\n#elif defined(HAVE_EXPAT_CONFIG_H)\n# include \n#endif /* ndef _WIN32 */\n\n#include \"ascii.h\"\n#include \"expat.h\"\n#include \"siphash.h\"\n\n#if defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM)\n# if defined(HAVE_GETRANDOM)\n# include /* getrandom */\n# else\n# include /* syscall */\n# include /* SYS_getrandom */\n# endif\n# if ! defined(GRND_NONBLOCK)\n# define GRND_NONBLOCK 0x0001\n# endif /* defined(GRND_NONBLOCK) */\n#endif /* defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM) */\n\n#if defined(HAVE_LIBBSD) \\\n && (defined(HAVE_ARC4RANDOM_BUF) || defined(HAVE_ARC4RANDOM))\n# include \n#endif\n\n#if defined(_WIN32) && ! defined(LOAD_LIBRARY_SEARCH_SYSTEM32)\n# define LOAD_LIBRARY_SEARCH_SYSTEM32 0x00000800\n#endif\n\n#if ! defined(HAVE_GETRANDOM) && ! defined(HAVE_SYSCALL_GETRANDOM) \\\n && ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM) \\\n && ! defined(XML_DEV_URANDOM) && ! defined(_WIN32) \\\n && ! defined(XML_POOR_ENTROPY)\n# error You do not have support for any sources of high quality entropy \\\n enabled. For end user security, that is probably not what you want. \\\n \\\n Your options include: \\\n * Linux + glibc >=2.25 (getrandom): HAVE_GETRANDOM, \\\n * Linux + glibc <2.25 (syscall SYS_getrandom): HAVE_SYSCALL_GETRANDOM, \\\n * BSD / macOS >=10.7 (arc4random_buf): HAVE_ARC4RANDOM_BUF, \\\n * BSD / macOS <10.7 (arc4random): HAVE_ARC4RANDOM, \\\n * libbsd (arc4random_buf): HAVE_ARC4RANDOM_BUF + HAVE_LIBBSD, \\\n * libbsd (arc4random): HAVE_ARC4RANDOM + HAVE_LIBBSD, \\\n * Linux / BSD / macOS (/dev/urandom): XML_DEV_URANDOM \\\n * Windows (rand_s): _WIN32. \\\n \\\n If insist on not using any of these, bypass this error by defining \\\n XML_POOR_ENTROPY; you have been warned. \\\n \\\n If you have reasons to patch this detection code away or need changes \\\n to the build system, please open a bug. Thank you!\n#endif\n\n#ifdef XML_UNICODE\n# define XML_ENCODE_MAX XML_UTF16_ENCODE_MAX\n# define XmlConvert XmlUtf16Convert\n# define XmlGetInternalEncoding XmlGetUtf16InternalEncoding\n# define XmlGetInternalEncodingNS XmlGetUtf16InternalEncodingNS\n# define XmlEncode XmlUtf16Encode\n/* Using pointer subtraction to convert to integer type. */\n# define MUST_CONVERT(enc, s) \\\n (! (enc)->isUtf16 || (((char *)(s) - (char *)NULL) & 1))\ntypedef unsigned short ICHAR;\n#else\n# define XML_ENCODE_MAX XML_UTF8_ENCODE_MAX\n# define XmlConvert XmlUtf8Convert\n# define XmlGetInternalEncoding XmlGetUtf8InternalEncoding\n# define XmlGetInternalEncodingNS XmlGetUtf8InternalEncodingNS\n# define XmlEncode XmlUtf8Encode\n# define MUST_CONVERT(enc, s) (! (enc)->isUtf8)\ntypedef char ICHAR;\n#endif\n\n#ifndef XML_NS\n\n# define XmlInitEncodingNS XmlInitEncoding\n# define XmlInitUnknownEncodingNS XmlInitUnknownEncoding\n# undef XmlGetInternalEncodingNS\n# define XmlGetInternalEncodingNS XmlGetInternalEncoding\n# define XmlParseXmlDeclNS XmlParseXmlDecl\n\n#endif\n\n#ifdef XML_UNICODE\n\n# ifdef XML_UNICODE_WCHAR_T\n# define XML_T(x) (const wchar_t) x\n# define XML_L(x) L##x\n# else\n# define XML_T(x) (const unsigned short)x\n# define XML_L(x) x\n# endif\n\n#else\n\n# define XML_T(x) x\n# define XML_L(x) x\n\n#endif\n\n/* Round up n to be a multiple of sz, where sz is a power of 2. */\n#define ROUND_UP(n, sz) (((n) + ((sz)-1)) & ~((sz)-1))\n\n/* Do safe (NULL-aware) pointer arithmetic */\n#define EXPAT_SAFE_PTR_DIFF(p, q) (((p) && (q)) ? ((p) - (q)) : 0)\n\n#include \"internal.h\"\n#include \"xmltok.h\"\n#include \"xmlrole.h\"\n\ntypedef const XML_Char *KEY;\n\ntypedef struct {\n KEY name;\n} NAMED;\n\ntypedef struct {\n NAMED **v;\n unsigned char power;\n size_t size;\n size_t used;\n const XML_Memory_Handling_Suite *mem;\n} HASH_TABLE;\n\nstatic size_t keylen(KEY s);\n\nstatic void copy_salt_to_sipkey(XML_Parser parser, struct sipkey *key);\n\n/* For probing (after a collision) we need a step size relative prime\n to the hash table size, which is a power of 2. We use double-hashing,\n since we can calculate a second hash value cheaply by taking those bits\n of the first hash value that were discarded (masked out) when the table\n index was calculated: index = hash & mask, where mask = table->size - 1.\n We limit the maximum step size to table->size / 4 (mask >> 2) and make\n it odd, since odd numbers are always relative prime to a power of 2.\n*/\n#define SECOND_HASH(hash, mask, power) \\\n ((((hash) & ~(mask)) >> ((power)-1)) & ((mask) >> 2))\n#define PROBE_STEP(hash, mask, power) \\\n ((unsigned char)((SECOND_HASH(hash, mask, power)) | 1))\n\ntypedef struct {\n NAMED **p;\n NAMED **end;\n} HASH_TABLE_ITER;\n\n#define INIT_TAG_BUF_SIZE 32 /* must be a multiple of sizeof(XML_Char) */\n#define INIT_DATA_BUF_SIZE 1024\n#define INIT_ATTS_SIZE 16\n#define INIT_ATTS_VERSION 0xFFFFFFFF\n#define INIT_BLOCK_SIZE 1024\n#define INIT_BUFFER_SIZE 1024\n\n#define EXPAND_SPARE 24\n\ntypedef struct binding {\n struct prefix *prefix;\n struct binding *nextTagBinding;\n struct binding *prevPrefixBinding;\n const struct attribute_id *attId;\n XML_Char *uri;\n int uriLen;\n int uriAlloc;\n} BINDING;\n\ntypedef struct prefix {\n const XML_Char *name;\n BINDING *binding;\n} PREFIX;\n\ntypedef struct {\n const XML_Char *str;\n const XML_Char *localPart;\n const XML_Char *prefix;\n int strLen;\n int uriLen;\n int prefixLen;\n} TAG_NAME;\n\n/* TAG represents an open element.\n The name of the element is stored in both the document and API\n encodings. The memory buffer 'buf' is a separately-allocated\n memory area which stores the name. During the XML_Parse()/\n XMLParseBuffer() when the element is open, the memory for the 'raw'\n version of the name (in the document encoding) is shared with the\n document buffer. If the element is open across calls to\n XML_Parse()/XML_ParseBuffer(), the buffer is re-allocated to\n contain the 'raw' name as well.\n\n A parser re-uses these structures, maintaining a list of allocated\n TAG objects in a free list.\n*/\ntypedef struct tag {\n struct tag *parent; /* parent of this element */\n const char *rawName; /* tagName in the original encoding */\n int rawNameLength;\n TAG_NAME name; /* tagName in the API encoding */\n char *buf; /* buffer for name components */\n char *bufEnd; /* end of the buffer */\n BINDING *bindings;\n} TAG;\n\ntypedef struct {\n const XML_Char *name;\n const XML_Char *textPtr;\n int textLen; /* length in XML_Chars */\n int processed; /* # of processed bytes - when suspended */\n const XML_Char *systemId;\n const XML_Char *base;\n const XML_Char *publicId;\n const XML_Char *notation;\n XML_Bool open;\n XML_Bool is_param;\n XML_Bool is_internal; /* true if declared in internal subset outside PE */\n} ENTITY;\n\ntypedef struct {\n enum XML_Content_Type type;\n enum XML_Content_Quant quant;\n const XML_Char *name;\n int firstchild;\n int lastchild;\n int childcnt;\n int nextsib;\n} CONTENT_SCAFFOLD;\n\n#define INIT_SCAFFOLD_ELEMENTS 32\n\ntypedef struct block {\n struct block *next;\n int size;\n XML_Char s[1];\n} BLOCK;\n\ntypedef struct {\n BLOCK *blocks;\n BLOCK *freeBlocks;\n const XML_Char *end;\n XML_Char *ptr;\n XML_Char *start;\n const XML_Memory_Handling_Suite *mem;\n} STRING_POOL;\n\n/* The XML_Char before the name is used to determine whether\n an attribute has been specified. */\ntypedef struct attribute_id {\n XML_Char *name;\n PREFIX *prefix;\n XML_Bool maybeTokenized;\n XML_Bool xmlns;\n} ATTRIBUTE_ID;\n\ntypedef struct {\n const ATTRIBUTE_ID *id;\n XML_Bool isCdata;\n const XML_Char *value;\n} DEFAULT_ATTRIBUTE;\n\ntypedef struct {\n unsigned long version;\n unsigned long hash;\n const XML_Char *uriName;\n} NS_ATT;\n\ntypedef struct {\n const XML_Char *name;\n PREFIX *prefix;\n const ATTRIBUTE_ID *idAtt;\n int nDefaultAtts;\n int allocDefaultAtts;\n DEFAULT_ATTRIBUTE *defaultAtts;\n} ELEMENT_TYPE;\n\ntypedef struct {\n HASH_TABLE generalEntities;\n HASH_TABLE elementTypes;\n HASH_TABLE attributeIds;\n HASH_TABLE prefixes;\n STRING_POOL pool;\n STRING_POOL entityValuePool;\n /* false once a parameter entity reference has been skipped */\n XML_Bool keepProcessing;\n /* true once an internal or external PE reference has been encountered;\n this includes the reference to an external subset */\n XML_Bool hasParamEntityRefs;\n XML_Bool standalone;\n#ifdef XML_DTD\n /* indicates if external PE has been read */\n XML_Bool paramEntityRead;\n HASH_TABLE paramEntities;\n#endif /* XML_DTD */\n PREFIX defaultPrefix;\n /* === scaffolding for building content model === */\n XML_Bool in_eldecl;\n CONTENT_SCAFFOLD *scaffold;\n unsigned contentStringLen;\n unsigned scaffSize;\n unsigned scaffCount;\n int scaffLevel;\n int *scaffIndex;\n} DTD;\n\ntypedef struct open_internal_entity {\n const char *internalEventPtr;\n const char *internalEventEndPtr;\n struct open_internal_entity *next;\n ENTITY *entity;\n int startTagLevel;\n XML_Bool betweenDecl; /* WFC: PE Between Declarations */\n} OPEN_INTERNAL_ENTITY;\n\ntypedef enum XML_Error PTRCALL Processor(XML_Parser parser, const char *start,\n const char *end, const char **endPtr);\n\nstatic Processor prologProcessor;\nstatic Processor prologInitProcessor;\nstatic Processor contentProcessor;\nstatic Processor cdataSectionProcessor;\n#ifdef XML_DTD\nstatic Processor ignoreSectionProcessor;\nstatic Processor externalParEntProcessor;\nstatic Processor externalParEntInitProcessor;\nstatic Processor entityValueProcessor;\nstatic Processor entityValueInitProcessor;\n#endif /* XML_DTD */\nstatic Processor epilogProcessor;\nstatic Processor errorProcessor;\nstatic Processor externalEntityInitProcessor;\nstatic Processor externalEntityInitProcessor2;\nstatic Processor externalEntityInitProcessor3;\nstatic Processor externalEntityContentProcessor;\nstatic Processor internalEntityProcessor;\n\nstatic enum XML_Error handleUnknownEncoding(XML_Parser parser,\n const XML_Char *encodingName);\nstatic enum XML_Error processXmlDecl(XML_Parser parser, int isGeneralTextEntity,\n const char *s, const char *next);\nstatic enum XML_Error initializeEncoding(XML_Parser parser);\nstatic enum XML_Error doProlog(XML_Parser parser, const ENCODING *enc,\n const char *s, const char *end, int tok,\n const char *next, const char **nextPtr,\n XML_Bool haveMore, XML_Bool allowClosingDoctype);\nstatic enum XML_Error processInternalEntity(XML_Parser parser, ENTITY *entity,\n XML_Bool betweenDecl);\nstatic enum XML_Error doContent(XML_Parser parser, int startTagLevel,\n const ENCODING *enc, const char *start,\n const char *end, const char **endPtr,\n XML_Bool haveMore);\nstatic enum XML_Error doCdataSection(XML_Parser parser, const ENCODING *,\n const char **startPtr, const char *end,\n const char **nextPtr, XML_Bool haveMore);\n#ifdef XML_DTD\nstatic enum XML_Error doIgnoreSection(XML_Parser parser, const ENCODING *,\n const char **startPtr, const char *end,\n const char **nextPtr, XML_Bool haveMore);\n#endif /* XML_DTD */\n\nstatic void freeBindings(XML_Parser parser, BINDING *bindings);\nstatic enum XML_Error storeAtts(XML_Parser parser, const ENCODING *,\n const char *s, TAG_NAME *tagNamePtr,\n BINDING **bindingsPtr);\nstatic enum XML_Error addBinding(XML_Parser parser, PREFIX *prefix,\n const ATTRIBUTE_ID *attId, const XML_Char *uri,\n BINDING **bindingsPtr);\nstatic int defineAttribute(ELEMENT_TYPE *type, ATTRIBUTE_ID *, XML_Bool isCdata,\n XML_Bool isId, const XML_Char *dfltValue,\n XML_Parser parser);\nstatic enum XML_Error storeAttributeValue(XML_Parser parser, const ENCODING *,\n XML_Bool isCdata, const char *,\n const char *, STRING_POOL *);\nstatic enum XML_Error appendAttributeValue(XML_Parser parser, const ENCODING *,\n XML_Bool isCdata, const char *,\n const char *, STRING_POOL *);\nstatic ATTRIBUTE_ID *getAttributeId(XML_Parser parser, const ENCODING *enc,\n const char *start, const char *end);\nstatic int setElementTypePrefix(XML_Parser parser, ELEMENT_TYPE *);\nstatic enum XML_Error storeEntityValue(XML_Parser parser, const ENCODING *enc,\n const char *start, const char *end);\nstatic int reportProcessingInstruction(XML_Parser parser, const ENCODING *enc,\n const char *start, const char *end);\nstatic int reportComment(XML_Parser parser, const ENCODING *enc,\n const char *start, const char *end);\nstatic void reportDefault(XML_Parser parser, const ENCODING *enc,\n const char *start, const char *end);\n\nstatic const XML_Char *getContext(XML_Parser parser);\nstatic XML_Bool setContext(XML_Parser parser, const XML_Char *context);\n\nstatic void FASTCALL normalizePublicId(XML_Char *s);\n\nstatic DTD *dtdCreate(const XML_Memory_Handling_Suite *ms);\n/* do not call if m_parentParser != NULL */\nstatic void dtdReset(DTD *p, const XML_Memory_Handling_Suite *ms);\nstatic void dtdDestroy(DTD *p, XML_Bool isDocEntity,\n const XML_Memory_Handling_Suite *ms);\nstatic int dtdCopy(XML_Parser oldParser, DTD *newDtd, const DTD *oldDtd,\n const XML_Memory_Handling_Suite *ms);\nstatic int copyEntityTable(XML_Parser oldParser, HASH_TABLE *, STRING_POOL *,\n const HASH_TABLE *);\nstatic NAMED *lookup(XML_Parser parser, HASH_TABLE *table, KEY name,\n size_t createSize);\nstatic void FASTCALL hashTableInit(HASH_TABLE *,\n const XML_Memory_Handling_Suite *ms);\nstatic void FASTCALL hashTableClear(HASH_TABLE *);\nstatic void FASTCALL hashTableDestroy(HASH_TABLE *);\nstatic void FASTCALL hashTableIterInit(HASH_TABLE_ITER *, const HASH_TABLE *);\nstatic NAMED *FASTCALL hashTableIterNext(HASH_TABLE_ITER *);\n\nstatic void FASTCALL poolInit(STRING_POOL *,\n const XML_Memory_Handling_Suite *ms);\nstatic void FASTCALL poolClear(STRING_POOL *);\nstatic void FASTCALL poolDestroy(STRING_POOL *);\nstatic XML_Char *poolAppend(STRING_POOL *pool, const ENCODING *enc,\n const char *ptr, const char *end);\nstatic XML_Char *poolStoreString(STRING_POOL *pool, const ENCODING *enc,\n const char *ptr, const char *end);\nstatic XML_Bool FASTCALL poolGrow(STRING_POOL *pool);\nstatic const XML_Char *FASTCALL poolCopyString(STRING_POOL *pool,\n const XML_Char *s);\nstatic const XML_Char *poolCopyStringN(STRING_POOL *pool, const XML_Char *s,\n int n);\nstatic const XML_Char *FASTCALL poolAppendString(STRING_POOL *pool,\n const XML_Char *s);\n\nstatic int FASTCALL nextScaffoldPart(XML_Parser parser);\nstatic XML_Content *build_model(XML_Parser parser);\nstatic ELEMENT_TYPE *getElementType(XML_Parser parser, const ENCODING *enc,\n const char *ptr, const char *end);\n\nstatic XML_Char *copyString(const XML_Char *s,\n const XML_Memory_Handling_Suite *memsuite);\n\nstatic unsigned long generate_hash_secret_salt(XML_Parser parser);\nstatic XML_Bool startParsing(XML_Parser parser);\n\nstatic XML_Parser parserCreate(const XML_Char *encodingName,\n const XML_Memory_Handling_Suite *memsuite,\n const XML_Char *nameSep, DTD *dtd);\n\nstatic void parserInit(XML_Parser parser, const XML_Char *encodingName);\n\n#define poolStart(pool) ((pool)->start)\n#define poolEnd(pool) ((pool)->ptr)\n#define poolLength(pool) ((pool)->ptr - (pool)->start)\n#define poolChop(pool) ((void)--(pool->ptr))\n#define poolLastChar(pool) (((pool)->ptr)[-1])\n#define poolDiscard(pool) ((pool)->ptr = (pool)->start)\n#define poolFinish(pool) ((pool)->start = (pool)->ptr)\n#define poolAppendChar(pool, c) \\\n (((pool)->ptr == (pool)->end && ! poolGrow(pool)) \\\n ? 0 \\\n : ((*((pool)->ptr)++ = c), 1))\n\nstruct XML_ParserStruct {\n /* The first member must be m_userData so that the XML_GetUserData\n macro works. */\n void *m_userData;\n void *m_handlerArg;\n char *m_buffer;\n const XML_Memory_Handling_Suite m_mem;\n /* first character to be parsed */\n const char *m_bufferPtr;\n /* past last character to be parsed */\n char *m_bufferEnd;\n /* allocated end of m_buffer */\n const char *m_bufferLim;\n XML_Index m_parseEndByteIndex;\n const char *m_parseEndPtr;\n XML_Char *m_dataBuf;\n XML_Char *m_dataBufEnd;\n XML_StartElementHandler m_startElementHandler;\n XML_EndElementHandler m_endElementHandler;\n XML_CharacterDataHandler m_characterDataHandler;\n XML_ProcessingInstructionHandler m_processingInstructionHandler;\n XML_CommentHandler m_commentHandler;\n XML_StartCdataSectionHandler m_startCdataSectionHandler;\n XML_EndCdataSectionHandler m_endCdataSectionHandler;\n XML_DefaultHandler m_defaultHandler;\n XML_StartDoctypeDeclHandler m_startDoctypeDeclHandler;\n XML_EndDoctypeDeclHandler m_endDoctypeDeclHandler;\n XML_UnparsedEntityDeclHandler m_unparsedEntityDeclHandler;\n XML_NotationDeclHandler m_notationDeclHandler;\n XML_StartNamespaceDeclHandler m_startNamespaceDeclHandler;\n XML_EndNamespaceDeclHandler m_endNamespaceDeclHandler;\n XML_NotStandaloneHandler m_notStandaloneHandler;\n XML_ExternalEntityRefHandler m_externalEntityRefHandler;\n XML_Parser m_externalEntityRefHandlerArg;\n XML_SkippedEntityHandler m_skippedEntityHandler;\n XML_UnknownEncodingHandler m_unknownEncodingHandler;\n XML_ElementDeclHandler m_elementDeclHandler;\n XML_AttlistDeclHandler m_attlistDeclHandler;\n XML_EntityDeclHandler m_entityDeclHandler;\n XML_XmlDeclHandler m_xmlDeclHandler;\n const ENCODING *m_encoding;\n INIT_ENCODING m_initEncoding;\n const ENCODING *m_internalEncoding;\n const XML_Char *m_protocolEncodingName;\n XML_Bool m_ns;\n XML_Bool m_ns_triplets;\n void *m_unknownEncodingMem;\n void *m_unknownEncodingData;\n void *m_unknownEncodingHandlerData;\n void(XMLCALL *m_unknownEncodingRelease)(void *);\n PROLOG_STATE m_prologState;\n Processor *m_processor;\n enum XML_Error m_errorCode;\n const char *m_eventPtr;\n const char *m_eventEndPtr;\n const char *m_positionPtr;\n OPEN_INTERNAL_ENTITY *m_openInternalEntities;\n OPEN_INTERNAL_ENTITY *m_freeInternalEntities;\n XML_Bool m_defaultExpandInternalEntities;\n int m_tagLevel;\n ENTITY *m_declEntity;\n const XML_Char *m_doctypeName;\n const XML_Char *m_doctypeSysid;\n const XML_Char *m_doctypePubid;\n const XML_Char *m_declAttributeType;\n const XML_Char *m_declNotationName;\n const XML_Char *m_declNotationPublicId;\n ELEMENT_TYPE *m_declElementType;\n ATTRIBUTE_ID *m_declAttributeId;\n XML_Bool m_declAttributeIsCdata;\n XML_Bool m_declAttributeIsId;\n DTD *m_dtd;\n const XML_Char *m_curBase;\n TAG *m_tagStack;\n TAG *m_freeTagList;\n BINDING *m_inheritedBindings;\n BINDING *m_freeBindingList;\n int m_attsSize;\n int m_nSpecifiedAtts;\n int m_idAttIndex;\n ATTRIBUTE *m_atts;\n NS_ATT *m_nsAtts;\n unsigned long m_nsAttsVersion;\n unsigned char m_nsAttsPower;\n#ifdef XML_ATTR_INFO\n XML_AttrInfo *m_attInfo;\n#endif\n POSITION m_position;\n STRING_POOL m_tempPool;\n STRING_POOL m_temp2Pool;\n char *m_groupConnector;\n unsigned int m_groupSize;\n XML_Char m_namespaceSeparator;\n XML_Parser m_parentParser;\n XML_ParsingStatus m_parsingStatus;\n#ifdef XML_DTD\n XML_Bool m_isParamEntity;\n XML_Bool m_useForeignDTD;\n enum XML_ParamEntityParsing m_paramEntityParsing;\n#endif\n unsigned long m_hash_secret_salt;\n};\n\n#define MALLOC(parser, s) (parser->m_mem.malloc_fcn((s)))\n#define REALLOC(parser, p, s) (parser->m_mem.realloc_fcn((p), (s)))\n#define FREE(parser, p) (parser->m_mem.free_fcn((p)))\n\nXML_Parser XMLCALL\nXML_ParserCreate(const XML_Char *encodingName) {\n return XML_ParserCreate_MM(encodingName, NULL, NULL);\n}\n\nXML_Parser XMLCALL\nXML_ParserCreateNS(const XML_Char *encodingName, XML_Char nsSep) {\n XML_Char tmp[2];\n *tmp = nsSep;\n return XML_ParserCreate_MM(encodingName, NULL, tmp);\n}\n\nstatic const XML_Char implicitContext[]\n = {ASCII_x, ASCII_m, ASCII_l, ASCII_EQUALS, ASCII_h,\n ASCII_t, ASCII_t, ASCII_p, ASCII_COLON, ASCII_SLASH,\n ASCII_SLASH, ASCII_w, ASCII_w, ASCII_w, ASCII_PERIOD,\n ASCII_w, ASCII_3, ASCII_PERIOD, ASCII_o, ASCII_r,\n ASCII_g, ASCII_SLASH, ASCII_X, ASCII_M, ASCII_L,\n ASCII_SLASH, ASCII_1, ASCII_9, ASCII_9, ASCII_8,\n ASCII_SLASH, ASCII_n, ASCII_a, ASCII_m, ASCII_e,\n ASCII_s, ASCII_p, ASCII_a, ASCII_c, ASCII_e,\n '\\0'};\n\n/* To avoid warnings about unused functions: */\n#if ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM)\n\n# if defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM)\n\n/* Obtain entropy on Linux 3.17+ */\nstatic int\nwriteRandomBytes_getrandom_nonblock(void *target, size_t count) {\n int success = 0; /* full count bytes written? */\n size_t bytesWrittenTotal = 0;\n const unsigned int getrandomFlags = GRND_NONBLOCK;\n\n do {\n void *const currentTarget = (void *)((char *)target + bytesWrittenTotal);\n const size_t bytesToWrite = count - bytesWrittenTotal;\n\n const int bytesWrittenMore =\n# if defined(HAVE_GETRANDOM)\n getrandom(currentTarget, bytesToWrite, getrandomFlags);\n# else\n syscall(SYS_getrandom, currentTarget, bytesToWrite, getrandomFlags);\n# endif\n\n if (bytesWrittenMore > 0) {\n bytesWrittenTotal += bytesWrittenMore;\n if (bytesWrittenTotal >= count)\n success = 1;\n }\n } while (! success && (errno == EINTR));\n\n return success;\n}\n\n# endif /* defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM) */\n\n# if ! defined(_WIN32) && defined(XML_DEV_URANDOM)\n\n/* Extract entropy from /dev/urandom */\nstatic int\nwriteRandomBytes_dev_urandom(void *target, size_t count) {\n int success = 0; /* full count bytes written? */\n size_t bytesWrittenTotal = 0;\n\n const int fd = open(\"/dev/urandom\", O_RDONLY);\n if (fd < 0) {\n return 0;\n }\n\n do {\n void *const currentTarget = (void *)((char *)target + bytesWrittenTotal);\n const size_t bytesToWrite = count - bytesWrittenTotal;\n\n const ssize_t bytesWrittenMore = read(fd, currentTarget, bytesToWrite);\n\n if (bytesWrittenMore > 0) {\n bytesWrittenTotal += bytesWrittenMore;\n if (bytesWrittenTotal >= count)\n success = 1;\n }\n } while (! success && (errno == EINTR));\n\n close(fd);\n return success;\n}\n\n# endif /* ! defined(_WIN32) && defined(XML_DEV_URANDOM) */\n\n#endif /* ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM) */\n\n#if defined(HAVE_ARC4RANDOM) && ! defined(HAVE_ARC4RANDOM_BUF)\n\nstatic void\nwriteRandomBytes_arc4random(void *target, size_t count) {\n size_t bytesWrittenTotal = 0;\n\n while (bytesWrittenTotal < count) {\n const uint32_t random32 = arc4random();\n size_t i = 0;\n\n for (; (i < sizeof(random32)) && (bytesWrittenTotal < count);\n i++, bytesWrittenTotal++) {\n const uint8_t random8 = (uint8_t)(random32 >> (i * 8));\n ((uint8_t *)target)[bytesWrittenTotal] = random8;\n }\n }\n}\n\n#endif /* defined(HAVE_ARC4RANDOM) && ! defined(HAVE_ARC4RANDOM_BUF) */\n\n#ifdef _WIN32\n\n/* Obtain entropy on Windows using the rand_s() function which\n * generates cryptographically secure random numbers. Internally it\n * uses RtlGenRandom API which is present in Windows XP and later.\n */\nstatic int\nwriteRandomBytes_rand_s(void *target, size_t count) {\n size_t bytesWrittenTotal = 0;\n\n while (bytesWrittenTotal < count) {\n unsigned int random32 = 0;\n size_t i = 0;\n\n if (rand_s(&random32))\n return 0; /* failure */\n\n for (; (i < sizeof(random32)) && (bytesWrittenTotal < count);\n i++, bytesWrittenTotal++) {\n const uint8_t random8 = (uint8_t)(random32 >> (i * 8));\n ((uint8_t *)target)[bytesWrittenTotal] = random8;\n }\n }\n return 1; /* success */\n}\n\n#endif /* _WIN32 */\n\n#if ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM)\n\nstatic unsigned long\ngather_time_entropy(void) {\n# ifdef _WIN32\n FILETIME ft;\n GetSystemTimeAsFileTime(&ft); /* never fails */\n return ft.dwHighDateTime ^ ft.dwLowDateTime;\n# else\n struct timeval tv;\n int gettimeofday_res;\n\n gettimeofday_res = gettimeofday(&tv, NULL);\n\n# if defined(NDEBUG)\n (void)gettimeofday_res;\n# else\n assert(gettimeofday_res == 0);\n# endif /* defined(NDEBUG) */\n\n /* Microseconds time is <20 bits entropy */\n return tv.tv_usec;\n# endif\n}\n\n#endif /* ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM) */\n\nstatic unsigned long\nENTROPY_DEBUG(const char *label, unsigned long entropy) {\n const char *const EXPAT_ENTROPY_DEBUG = getenv(\"EXPAT_ENTROPY_DEBUG\");\n if (EXPAT_ENTROPY_DEBUG && ! strcmp(EXPAT_ENTROPY_DEBUG, \"1\")) {\n fprintf(stderr, \"Entropy: %s --> 0x%0*lx (%lu bytes)\\n\", label,\n (int)sizeof(entropy) * 2, entropy, (unsigned long)sizeof(entropy));\n }\n return entropy;\n}\n\nstatic unsigned long\ngenerate_hash_secret_salt(XML_Parser parser) {\n unsigned long entropy;\n (void)parser;\n\n /* \"Failproof\" high quality providers: */\n#if defined(HAVE_ARC4RANDOM_BUF)\n arc4random_buf(&entropy, sizeof(entropy));\n return ENTROPY_DEBUG(\"arc4random_buf\", entropy);\n#elif defined(HAVE_ARC4RANDOM)\n writeRandomBytes_arc4random((void *)&entropy, sizeof(entropy));\n return ENTROPY_DEBUG(\"arc4random\", entropy);\n#else\n /* Try high quality providers first .. */\n# ifdef _WIN32\n if (writeRandomBytes_rand_s((void *)&entropy, sizeof(entropy))) {\n return ENTROPY_DEBUG(\"rand_s\", entropy);\n }\n# elif defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM)\n if (writeRandomBytes_getrandom_nonblock((void *)&entropy, sizeof(entropy))) {\n return ENTROPY_DEBUG(\"getrandom\", entropy);\n }\n# endif\n# if ! defined(_WIN32) && defined(XML_DEV_URANDOM)\n if (writeRandomBytes_dev_urandom((void *)&entropy, sizeof(entropy))) {\n return ENTROPY_DEBUG(\"/dev/urandom\", entropy);\n }\n# endif /* ! defined(_WIN32) && defined(XML_DEV_URANDOM) */\n /* .. and self-made low quality for backup: */\n\n /* Process ID is 0 bits entropy if attacker has local access */\n entropy = gather_time_entropy() ^ getpid();\n\n /* Factors are 2^31-1 and 2^61-1 (Mersenne primes M31 and M61) */\n if (sizeof(unsigned long) == 4) {\n return ENTROPY_DEBUG(\"fallback(4)\", entropy * 2147483647);\n } else {\n return ENTROPY_DEBUG(\"fallback(8)\",\n entropy * (unsigned long)2305843009213693951ULL);\n }\n#endif\n}\n\nstatic unsigned long\nget_hash_secret_salt(XML_Parser parser) {\n if (parser->m_parentParser != NULL)\n return get_hash_secret_salt(parser->m_parentParser);\n return parser->m_hash_secret_salt;\n}\n\nstatic XML_Bool /* only valid for root parser */\nstartParsing(XML_Parser parser) {\n /* hash functions must be initialized before setContext() is called */\n if (parser->m_hash_secret_salt == 0)\n parser->m_hash_secret_salt = generate_hash_secret_salt(parser);\n if (parser->m_ns) {\n /* implicit context only set for root parser, since child\n parsers (i.e. external entity parsers) will inherit it\n */\n return setContext(parser, implicitContext);\n }\n return XML_TRUE;\n}\n\nXML_Parser XMLCALL\nXML_ParserCreate_MM(const XML_Char *encodingName,\n const XML_Memory_Handling_Suite *memsuite,\n const XML_Char *nameSep) {\n return parserCreate(encodingName, memsuite, nameSep, NULL);\n}\n\nstatic XML_Parser\nparserCreate(const XML_Char *encodingName,\n const XML_Memory_Handling_Suite *memsuite, const XML_Char *nameSep,\n DTD *dtd) {\n XML_Parser parser;\n\n if (memsuite) {\n XML_Memory_Handling_Suite *mtemp;\n parser = (XML_Parser)memsuite->malloc_fcn(sizeof(struct XML_ParserStruct));\n if (parser != NULL) {\n mtemp = (XML_Memory_Handling_Suite *)&(parser->m_mem);\n mtemp->malloc_fcn = memsuite->malloc_fcn;\n mtemp->realloc_fcn = memsuite->realloc_fcn;\n mtemp->free_fcn = memsuite->free_fcn;\n }\n } else {\n XML_Memory_Handling_Suite *mtemp;\n parser = (XML_Parser)malloc(sizeof(struct XML_ParserStruct));\n if (parser != NULL) {\n mtemp = (XML_Memory_Handling_Suite *)&(parser->m_mem);\n mtemp->malloc_fcn = malloc;\n mtemp->realloc_fcn = realloc;\n mtemp->free_fcn = free;\n }\n }\n\n if (! parser)\n return parser;\n\n parser->m_buffer = NULL;\n parser->m_bufferLim = NULL;\n\n parser->m_attsSize = INIT_ATTS_SIZE;\n parser->m_atts\n = (ATTRIBUTE *)MALLOC(parser, parser->m_attsSize * sizeof(ATTRIBUTE));\n if (parser->m_atts == NULL) {\n FREE(parser, parser);\n return NULL;\n }\n#ifdef XML_ATTR_INFO\n parser->m_attInfo = (XML_AttrInfo *)MALLOC(\n parser, parser->m_attsSize * sizeof(XML_AttrInfo));\n if (parser->m_attInfo == NULL) {\n FREE(parser, parser->m_atts);\n FREE(parser, parser);\n return NULL;\n }\n#endif\n parser->m_dataBuf\n = (XML_Char *)MALLOC(parser, INIT_DATA_BUF_SIZE * sizeof(XML_Char));\n if (parser->m_dataBuf == NULL) {\n FREE(parser, parser->m_atts);\n#ifdef XML_ATTR_INFO\n FREE(parser, parser->m_attInfo);\n#endif\n FREE(parser, parser);\n return NULL;\n }\n parser->m_dataBufEnd = parser->m_dataBuf + INIT_DATA_BUF_SIZE;\n\n if (dtd)\n parser->m_dtd = dtd;\n else {\n parser->m_dtd = dtdCreate(&parser->m_mem);\n if (parser->m_dtd == NULL) {\n FREE(parser, parser->m_dataBuf);\n FREE(parser, parser->m_atts);\n#ifdef XML_ATTR_INFO\n FREE(parser, parser->m_attInfo);\n#endif\n FREE(parser, parser);\n return NULL;\n }\n }\n\n parser->m_freeBindingList = NULL;\n parser->m_freeTagList = NULL;\n parser->m_freeInternalEntities = NULL;\n\n parser->m_groupSize = 0;\n parser->m_groupConnector = NULL;\n\n parser->m_unknownEncodingHandler = NULL;\n parser->m_unknownEncodingHandlerData = NULL;\n\n parser->m_namespaceSeparator = ASCII_EXCL;\n parser->m_ns = XML_FALSE;\n parser->m_ns_triplets = XML_FALSE;\n\n parser->m_nsAtts = NULL;\n parser->m_nsAttsVersion = 0;\n parser->m_nsAttsPower = 0;\n\n parser->m_protocolEncodingName = NULL;\n\n poolInit(&parser->m_tempPool, &(parser->m_mem));\n poolInit(&parser->m_temp2Pool, &(parser->m_mem));\n parserInit(parser, encodingName);\n\n if (encodingName && ! parser->m_protocolEncodingName) {\n XML_ParserFree(parser);\n return NULL;\n }\n\n if (nameSep) {\n parser->m_ns = XML_TRUE;\n parser->m_internalEncoding = XmlGetInternalEncodingNS();\n parser->m_namespaceSeparator = *nameSep;\n } else {\n parser->m_internalEncoding = XmlGetInternalEncoding();\n }\n\n return parser;\n}\n\nstatic void\nparserInit(XML_Parser parser, const XML_Char *encodingName) {\n parser->m_processor = prologInitProcessor;\n XmlPrologStateInit(&parser->m_prologState);\n if (encodingName != NULL) {\n parser->m_protocolEncodingName = copyString(encodingName, &(parser->m_mem));\n }\n parser->m_curBase = NULL;\n XmlInitEncoding(&parser->m_initEncoding, &parser->m_encoding, 0);\n parser->m_userData = NULL;\n parser->m_handlerArg = NULL;\n parser->m_startElementHandler = NULL;\n parser->m_endElementHandler = NULL;\n parser->m_characterDataHandler = NULL;\n parser->m_processingInstructionHandler = NULL;\n parser->m_commentHandler = NULL;\n parser->m_startCdataSectionHandler = NULL;\n parser->m_endCdataSectionHandler = NULL;\n parser->m_defaultHandler = NULL;\n parser->m_startDoctypeDeclHandler = NULL;\n parser->m_endDoctypeDeclHandler = NULL;\n parser->m_unparsedEntityDeclHandler = NULL;\n parser->m_notationDeclHandler = NULL;\n parser->m_startNamespaceDeclHandler = NULL;\n parser->m_endNamespaceDeclHandler = NULL;\n parser->m_notStandaloneHandler = NULL;\n parser->m_externalEntityRefHandler = NULL;\n parser->m_externalEntityRefHandlerArg = parser;\n parser->m_skippedEntityHandler = NULL;\n parser->m_elementDeclHandler = NULL;\n parser->m_attlistDeclHandler = NULL;\n parser->m_entityDeclHandler = NULL;\n parser->m_xmlDeclHandler = NULL;\n parser->m_bufferPtr = parser->m_buffer;\n parser->m_bufferEnd = parser->m_buffer;\n parser->m_parseEndByteIndex = 0;\n parser->m_parseEndPtr = NULL;\n parser->m_declElementType = NULL;\n parser->m_declAttributeId = NULL;\n parser->m_declEntity = NULL;\n parser->m_doctypeName = NULL;\n parser->m_doctypeSysid = NULL;\n parser->m_doctypePubid = NULL;\n parser->m_declAttributeType = NULL;\n parser->m_declNotationName = NULL;\n parser->m_declNotationPublicId = NULL;\n parser->m_declAttributeIsCdata = XML_FALSE;\n parser->m_declAttributeIsId = XML_FALSE;\n memset(&parser->m_position, 0, sizeof(POSITION));\n parser->m_errorCode = XML_ERROR_NONE;\n parser->m_eventPtr = NULL;\n parser->m_eventEndPtr = NULL;\n parser->m_positionPtr = NULL;\n parser->m_openInternalEntities = NULL;\n parser->m_defaultExpandInternalEntities = XML_TRUE;\n parser->m_tagLevel = 0;\n parser->m_tagStack = NULL;\n parser->m_inheritedBindings = NULL;\n parser->m_nSpecifiedAtts = 0;\n parser->m_unknownEncodingMem = NULL;\n parser->m_unknownEncodingRelease = NULL;\n parser->m_unknownEncodingData = NULL;\n parser->m_parentParser = NULL;\n parser->m_parsingStatus.parsing = XML_INITIALIZED;\n#ifdef XML_DTD\n parser->m_isParamEntity = XML_FALSE;\n parser->m_useForeignDTD = XML_FALSE;\n parser->m_paramEntityParsing = XML_PARAM_ENTITY_PARSING_NEVER;\n#endif\n parser->m_hash_secret_salt = 0;\n}\n\n/* moves list of bindings to m_freeBindingList */\nstatic void FASTCALL\nmoveToFreeBindingList(XML_Parser parser, BINDING *bindings) {\n while (bindings) {\n BINDING *b = bindings;\n bindings = bindings->nextTagBinding;\n b->nextTagBinding = parser->m_freeBindingList;\n parser->m_freeBindingList = b;\n }\n}\n\nXML_Bool XMLCALL\nXML_ParserReset(XML_Parser parser, const XML_Char *encodingName) {\n TAG *tStk;\n OPEN_INTERNAL_ENTITY *openEntityList;\n\n if (parser == NULL)\n return XML_FALSE;\n\n if (parser->m_parentParser)\n return XML_FALSE;\n /* move m_tagStack to m_freeTagList */\n tStk = parser->m_tagStack;\n while (tStk) {\n TAG *tag = tStk;\n tStk = tStk->parent;\n tag->parent = parser->m_freeTagList;\n moveToFreeBindingList(parser, tag->bindings);\n tag->bindings = NULL;\n parser->m_freeTagList = tag;\n }\n /* move m_openInternalEntities to m_freeInternalEntities */\n openEntityList = parser->m_openInternalEntities;\n while (openEntityList) {\n OPEN_INTERNAL_ENTITY *openEntity = openEntityList;\n openEntityList = openEntity->next;\n openEntity->next = parser->m_freeInternalEntities;\n parser->m_freeInternalEntities = openEntity;\n }\n moveToFreeBindingList(parser, parser->m_inheritedBindings);\n FREE(parser, parser->m_unknownEncodingMem);\n if (parser->m_unknownEncodingRelease)\n parser->m_unknownEncodingRelease(parser->m_unknownEncodingData);\n poolClear(&parser->m_tempPool);\n poolClear(&parser->m_temp2Pool);\n FREE(parser, (void *)parser->m_protocolEncodingName);\n parser->m_protocolEncodingName = NULL;\n parserInit(parser, encodingName);\n dtdReset(parser->m_dtd, &parser->m_mem);\n return XML_TRUE;\n}\n\nenum XML_Status XMLCALL\nXML_SetEncoding(XML_Parser parser, const XML_Char *encodingName) {\n if (parser == NULL)\n return XML_STATUS_ERROR;\n /* Block after XML_Parse()/XML_ParseBuffer() has been called.\n XXX There's no way for the caller to determine which of the\n XXX possible error cases caused the XML_STATUS_ERROR return.\n */\n if (parser->m_parsingStatus.parsing == XML_PARSING\n || parser->m_parsingStatus.parsing == XML_SUSPENDED)\n return XML_STATUS_ERROR;\n\n /* Get rid of any previous encoding name */\n FREE(parser, (void *)parser->m_protocolEncodingName);\n\n if (encodingName == NULL)\n /* No new encoding name */\n parser->m_protocolEncodingName = NULL;\n else {\n /* Copy the new encoding name into allocated memory */\n parser->m_protocolEncodingName = copyString(encodingName, &(parser->m_mem));\n if (! parser->m_protocolEncodingName)\n return XML_STATUS_ERROR;\n }\n return XML_STATUS_OK;\n}\n\nXML_Parser XMLCALL\nXML_ExternalEntityParserCreate(XML_Parser oldParser, const XML_Char *context,\n const XML_Char *encodingName) {\n XML_Parser parser = oldParser;\n DTD *newDtd = NULL;\n DTD *oldDtd;\n XML_StartElementHandler oldStartElementHandler;\n XML_EndElementHandler oldEndElementHandler;\n XML_CharacterDataHandler oldCharacterDataHandler;\n XML_ProcessingInstructionHandler oldProcessingInstructionHandler;\n XML_CommentHandler oldCommentHandler;\n XML_StartCdataSectionHandler oldStartCdataSectionHandler;\n XML_EndCdataSectionHandler oldEndCdataSectionHandler;\n XML_DefaultHandler oldDefaultHandler;\n XML_UnparsedEntityDeclHandler oldUnparsedEntityDeclHandler;\n XML_NotationDeclHandler oldNotationDeclHandler;\n XML_StartNamespaceDeclHandler oldStartNamespaceDeclHandler;\n XML_EndNamespaceDeclHandler oldEndNamespaceDeclHandler;\n XML_NotStandaloneHandler oldNotStandaloneHandler;\n XML_ExternalEntityRefHandler oldExternalEntityRefHandler;\n XML_SkippedEntityHandler oldSkippedEntityHandler;\n XML_UnknownEncodingHandler oldUnknownEncodingHandler;\n XML_ElementDeclHandler oldElementDeclHandler;\n XML_AttlistDeclHandler oldAttlistDeclHandler;\n XML_EntityDeclHandler oldEntityDeclHandler;\n XML_XmlDeclHandler oldXmlDeclHandler;\n ELEMENT_TYPE *oldDeclElementType;\n\n void *oldUserData;\n void *oldHandlerArg;\n XML_Bool oldDefaultExpandInternalEntities;\n XML_Parser oldExternalEntityRefHandlerArg;\n#ifdef XML_DTD\n enum XML_ParamEntityParsing oldParamEntityParsing;\n int oldInEntityValue;\n#endif\n XML_Bool oldns_triplets;\n /* Note that the new parser shares the same hash secret as the old\n parser, so that dtdCopy and copyEntityTable can lookup values\n from hash tables associated with either parser without us having\n to worry which hash secrets each table has.\n */\n unsigned long oldhash_secret_salt;\n\n /* Validate the oldParser parameter before we pull everything out of it */\n if (oldParser == NULL)\n return NULL;\n\n /* Stash the original parser contents on the stack */\n oldDtd = parser->m_dtd;\n oldStartElementHandler = parser->m_startElementHandler;\n oldEndElementHandler = parser->m_endElementHandler;\n oldCharacterDataHandler = parser->m_characterDataHandler;\n oldProcessingInstructionHandler = parser->m_processingInstructionHandler;\n oldCommentHandler = parser->m_commentHandler;\n oldStartCdataSectionHandler = parser->m_startCdataSectionHandler;\n oldEndCdataSectionHandler = parser->m_endCdataSectionHandler;\n oldDefaultHandler = parser->m_defaultHandler;\n oldUnparsedEntityDeclHandler = parser->m_unparsedEntityDeclHandler;\n oldNotationDeclHandler = parser->m_notationDeclHandler;\n oldStartNamespaceDeclHandler = parser->m_startNamespaceDeclHandler;\n oldEndNamespaceDeclHandler = parser->m_endNamespaceDeclHandler;\n oldNotStandaloneHandler = parser->m_notStandaloneHandler;\n oldExternalEntityRefHandler = parser->m_externalEntityRefHandler;\n oldSkippedEntityHandler = parser->m_skippedEntityHandler;\n oldUnknownEncodingHandler = parser->m_unknownEncodingHandler;\n oldElementDeclHandler = parser->m_elementDeclHandler;\n oldAttlistDeclHandler = parser->m_attlistDeclHandler;\n oldEntityDeclHandler = parser->m_entityDeclHandler;\n oldXmlDeclHandler = parser->m_xmlDeclHandler;\n oldDeclElementType = parser->m_declElementType;\n\n oldUserData = parser->m_userData;\n oldHandlerArg = parser->m_handlerArg;\n oldDefaultExpandInternalEntities = parser->m_defaultExpandInternalEntities;\n oldExternalEntityRefHandlerArg = parser->m_externalEntityRefHandlerArg;\n#ifdef XML_DTD\n oldParamEntityParsing = parser->m_paramEntityParsing;\n oldInEntityValue = parser->m_prologState.inEntityValue;\n#endif\n oldns_triplets = parser->m_ns_triplets;\n /* Note that the new parser shares the same hash secret as the old\n parser, so that dtdCopy and copyEntityTable can lookup values\n from hash tables associated with either parser without us having\n to worry which hash secrets each table has.\n */\n oldhash_secret_salt = parser->m_hash_secret_salt;\n\n#ifdef XML_DTD\n if (! context)\n newDtd = oldDtd;\n#endif /* XML_DTD */\n\n /* Note that the magical uses of the pre-processor to make field\n access look more like C++ require that `parser' be overwritten\n here. This makes this function more painful to follow than it\n would be otherwise.\n */\n if (parser->m_ns) {\n XML_Char tmp[2];\n *tmp = parser->m_namespaceSeparator;\n parser = parserCreate(encodingName, &parser->m_mem, tmp, newDtd);\n } else {\n parser = parserCreate(encodingName, &parser->m_mem, NULL, newDtd);\n }\n\n if (! parser)\n return NULL;\n\n parser->m_startElementHandler = oldStartElementHandler;\n parser->m_endElementHandler = oldEndElementHandler;\n parser->m_characterDataHandler = oldCharacterDataHandler;\n parser->m_processingInstructionHandler = oldProcessingInstructionHandler;\n parser->m_commentHandler = oldCommentHandler;\n parser->m_startCdataSectionHandler = oldStartCdataSectionHandler;\n parser->m_endCdataSectionHandler = oldEndCdataSectionHandler;\n parser->m_defaultHandler = oldDefaultHandler;\n parser->m_unparsedEntityDeclHandler = oldUnparsedEntityDeclHandler;\n parser->m_notationDeclHandler = oldNotationDeclHandler;\n parser->m_startNamespaceDeclHandler = oldStartNamespaceDeclHandler;\n parser->m_endNamespaceDeclHandler = oldEndNamespaceDeclHandler;\n parser->m_notStandaloneHandler = oldNotStandaloneHandler;\n parser->m_externalEntityRefHandler = oldExternalEntityRefHandler;\n parser->m_skippedEntityHandler = oldSkippedEntityHandler;\n parser->m_unknownEncodingHandler = oldUnknownEncodingHandler;\n parser->m_elementDeclHandler = oldElementDeclHandler;\n parser->m_attlistDeclHandler = oldAttlistDeclHandler;\n parser->m_entityDeclHandler = oldEntityDeclHandler;\n parser->m_xmlDeclHandler = oldXmlDeclHandler;\n parser->m_declElementType = oldDeclElementType;\n parser->m_userData = oldUserData;\n if (oldUserData == oldHandlerArg)\n parser->m_handlerArg = parser->m_userData;\n else\n parser->m_handlerArg = parser;\n if (oldExternalEntityRefHandlerArg != oldParser)\n parser->m_externalEntityRefHandlerArg = oldExternalEntityRefHandlerArg;\n parser->m_defaultExpandInternalEntities = oldDefaultExpandInternalEntities;\n parser->m_ns_triplets = oldns_triplets;\n parser->m_hash_secret_salt = oldhash_secret_salt;\n parser->m_parentParser = oldParser;\n#ifdef XML_DTD\n parser->m_paramEntityParsing = oldParamEntityParsing;\n parser->m_prologState.inEntityValue = oldInEntityValue;\n if (context) {\n#endif /* XML_DTD */\n if (! dtdCopy(oldParser, parser->m_dtd, oldDtd, &parser->m_mem)\n || ! setContext(parser, context)) {\n XML_ParserFree(parser);\n return NULL;\n }\n parser->m_processor = externalEntityInitProcessor;\n#ifdef XML_DTD\n } else {\n /* The DTD instance referenced by parser->m_dtd is shared between the\n document's root parser and external PE parsers, therefore one does not\n need to call setContext. In addition, one also *must* not call\n setContext, because this would overwrite existing prefix->binding\n pointers in parser->m_dtd with ones that get destroyed with the external\n PE parser. This would leave those prefixes with dangling pointers.\n */\n parser->m_isParamEntity = XML_TRUE;\n XmlPrologStateInitExternalEntity(&parser->m_prologState);\n parser->m_processor = externalParEntInitProcessor;\n }\n#endif /* XML_DTD */\n return parser;\n}\n\nstatic void FASTCALL\ndestroyBindings(BINDING *bindings, XML_Parser parser) {\n for (;;) {\n BINDING *b = bindings;\n if (! b)\n break;\n bindings = b->nextTagBinding;\n FREE(parser, b->uri);\n FREE(parser, b);\n }\n}\n\nvoid XMLCALL\nXML_ParserFree(XML_Parser parser) {\n TAG *tagList;\n OPEN_INTERNAL_ENTITY *entityList;\n if (parser == NULL)\n return;\n /* free m_tagStack and m_freeTagList */\n tagList = parser->m_tagStack;\n for (;;) {\n TAG *p;\n if (tagList == NULL) {\n if (parser->m_freeTagList == NULL)\n break;\n tagList = parser->m_freeTagList;\n parser->m_freeTagList = NULL;\n }\n p = tagList;\n tagList = tagList->parent;\n FREE(parser, p->buf);\n destroyBindings(p->bindings, parser);\n FREE(parser, p);\n }\n /* free m_openInternalEntities and m_freeInternalEntities */\n entityList = parser->m_openInternalEntities;\n for (;;) {\n OPEN_INTERNAL_ENTITY *openEntity;\n if (entityList == NULL) {\n if (parser->m_freeInternalEntities == NULL)\n break;\n entityList = parser->m_freeInternalEntities;\n parser->m_freeInternalEntities = NULL;\n }\n openEntity = entityList;\n entityList = entityList->next;\n FREE(parser, openEntity);\n }\n\n destroyBindings(parser->m_freeBindingList, parser);\n destroyBindings(parser->m_inheritedBindings, parser);\n poolDestroy(&parser->m_tempPool);\n poolDestroy(&parser->m_temp2Pool);\n FREE(parser, (void *)parser->m_protocolEncodingName);\n#ifdef XML_DTD\n /* external parameter entity parsers share the DTD structure\n parser->m_dtd with the root parser, so we must not destroy it\n */\n if (! parser->m_isParamEntity && parser->m_dtd)\n#else\n if (parser->m_dtd)\n#endif /* XML_DTD */\n dtdDestroy(parser->m_dtd, (XML_Bool)! parser->m_parentParser,\n &parser->m_mem);\n FREE(parser, (void *)parser->m_atts);\n#ifdef XML_ATTR_INFO\n FREE(parser, (void *)parser->m_attInfo);\n#endif\n FREE(parser, parser->m_groupConnector);\n FREE(parser, parser->m_buffer);\n FREE(parser, parser->m_dataBuf);\n FREE(parser, parser->m_nsAtts);\n FREE(parser, parser->m_unknownEncodingMem);\n if (parser->m_unknownEncodingRelease)\n parser->m_unknownEncodingRelease(parser->m_unknownEncodingData);\n FREE(parser, parser);\n}\n\nvoid XMLCALL\nXML_UseParserAsHandlerArg(XML_Parser parser) {\n if (parser != NULL)\n parser->m_handlerArg = parser;\n}\n\nenum XML_Error XMLCALL\nXML_UseForeignDTD(XML_Parser parser, XML_Bool useDTD) {\n if (parser == NULL)\n return XML_ERROR_INVALID_ARGUMENT;\n#ifdef XML_DTD\n /* block after XML_Parse()/XML_ParseBuffer() has been called */\n if (parser->m_parsingStatus.parsing == XML_PARSING\n || parser->m_parsingStatus.parsing == XML_SUSPENDED)\n return XML_ERROR_CANT_CHANGE_FEATURE_ONCE_PARSING;\n parser->m_useForeignDTD = useDTD;\n return XML_ERROR_NONE;\n#else\n return XML_ERROR_FEATURE_REQUIRES_XML_DTD;\n#endif\n}\n\nvoid XMLCALL\nXML_SetReturnNSTriplet(XML_Parser parser, int do_nst) {\n if (parser == NULL)\n return;\n /* block after XML_Parse()/XML_ParseBuffer() has been called */\n if (parser->m_parsingStatus.parsing == XML_PARSING\n || parser->m_parsingStatus.parsing == XML_SUSPENDED)\n return;\n parser->m_ns_triplets = do_nst ? XML_TRUE : XML_FALSE;\n}\n\nvoid XMLCALL\nXML_SetUserData(XML_Parser parser, void *p) {\n if (parser == NULL)\n return;\n if (parser->m_handlerArg == parser->m_userData)\n parser->m_handlerArg = parser->m_userData = p;\n else\n parser->m_userData = p;\n}\n\nenum XML_Status XMLCALL\nXML_SetBase(XML_Parser parser, const XML_Char *p) {\n if (parser == NULL)\n return XML_STATUS_ERROR;\n if (p) {\n p = poolCopyString(&parser->m_dtd->pool, p);\n if (! p)\n return XML_STATUS_ERROR;\n parser->m_curBase = p;\n } else\n parser->m_curBase = NULL;\n return XML_STATUS_OK;\n}\n\nconst XML_Char *XMLCALL\nXML_GetBase(XML_Parser parser) {\n if (parser == NULL)\n return NULL;\n return parser->m_curBase;\n}\n\nint XMLCALL\nXML_GetSpecifiedAttributeCount(XML_Parser parser) {\n if (parser == NULL)\n return -1;\n return parser->m_nSpecifiedAtts;\n}\n\nint XMLCALL\nXML_GetIdAttributeIndex(XML_Parser parser) {\n if (parser == NULL)\n return -1;\n return parser->m_idAttIndex;\n}\n\n#ifdef XML_ATTR_INFO\nconst XML_AttrInfo *XMLCALL\nXML_GetAttributeInfo(XML_Parser parser) {\n if (parser == NULL)\n return NULL;\n return parser->m_attInfo;\n}\n#endif\n\nvoid XMLCALL\nXML_SetElementHandler(XML_Parser parser, XML_StartElementHandler start,\n XML_EndElementHandler end) {\n if (parser == NULL)\n return;\n parser->m_startElementHandler = start;\n parser->m_endElementHandler = end;\n}\n\nvoid XMLCALL\nXML_SetStartElementHandler(XML_Parser parser, XML_StartElementHandler start) {\n if (parser != NULL)\n parser->m_startElementHandler = start;\n}\n\nvoid XMLCALL\nXML_SetEndElementHandler(XML_Parser parser, XML_EndElementHandler end) {\n if (parser != NULL)\n parser->m_endElementHandler = end;\n}\n\nvoid XMLCALL\nXML_SetCharacterDataHandler(XML_Parser parser,\n XML_CharacterDataHandler handler) {\n if (parser != NULL)\n parser->m_characterDataHandler = handler;\n}\n\nvoid XMLCALL\nXML_SetProcessingInstructionHandler(XML_Parser parser,\n XML_ProcessingInstructionHandler handler) {\n if (parser != NULL)\n parser->m_processingInstructionHandler = handler;\n}\n\nvoid XMLCALL\nXML_SetCommentHandler(XML_Parser parser, XML_CommentHandler handler) {\n if (parser != NULL)\n parser->m_commentHandler = handler;\n}\n\nvoid XMLCALL\nXML_SetCdataSectionHandler(XML_Parser parser,\n XML_StartCdataSectionHandler start,\n XML_EndCdataSectionHandler end) {\n if (parser == NULL)\n return;\n parser->m_startCdataSectionHandler = start;\n parser->m_endCdataSectionHandler = end;\n}\n\nvoid XMLCALL\nXML_SetStartCdataSectionHandler(XML_Parser parser,\n XML_StartCdataSectionHandler start) {\n if (parser != NULL)\n parser->m_startCdataSectionHandler = start;\n}\n\nvoid XMLCALL\nXML_SetEndCdataSectionHandler(XML_Parser parser,\n XML_EndCdataSectionHandler end) {\n if (parser != NULL)\n parser->m_endCdataSectionHandler = end;\n}\n\nvoid XMLCALL\nXML_SetDefaultHandler(XML_Parser parser, XML_DefaultHandler handler) {\n if (parser == NULL)\n return;\n parser->m_defaultHandler = handler;\n parser->m_defaultExpandInternalEntities = XML_FALSE;\n}\n\nvoid XMLCALL\nXML_SetDefaultHandlerExpand(XML_Parser parser, XML_DefaultHandler handler) {\n if (parser == NULL)\n return;\n parser->m_defaultHandler = handler;\n parser->m_defaultExpandInternalEntities = XML_TRUE;\n}\n\nvoid XMLCALL\nXML_SetDoctypeDeclHandler(XML_Parser parser, XML_StartDoctypeDeclHandler start,\n XML_EndDoctypeDeclHandler end) {\n if (parser == NULL)\n return;\n parser->m_startDoctypeDeclHandler = start;\n parser->m_endDoctypeDeclHandler = end;\n}\n\nvoid XMLCALL\nXML_SetStartDoctypeDeclHandler(XML_Parser parser,\n XML_StartDoctypeDeclHandler start) {\n if (parser != NULL)\n parser->m_startDoctypeDeclHandler = start;\n}\n\nvoid XMLCALL\nXML_SetEndDoctypeDeclHandler(XML_Parser parser, XML_EndDoctypeDeclHandler end) {\n if (parser != NULL)\n parser->m_endDoctypeDeclHandler = end;\n}\n\nvoid XMLCALL\nXML_SetUnparsedEntityDeclHandler(XML_Parser parser,\n XML_UnparsedEntityDeclHandler handler) {\n if (parser != NULL)\n parser->m_unparsedEntityDeclHandler = handler;\n}\n\nvoid XMLCALL\nXML_SetNotationDeclHandler(XML_Parser parser, XML_NotationDeclHandler handler) {\n if (parser != NULL)\n parser->m_notationDeclHandler = handler;\n}\n\nvoid XMLCALL\nXML_SetNamespaceDeclHandler(XML_Parser parser,\n XML_StartNamespaceDeclHandler start,\n XML_EndNamespaceDeclHandler end) {\n if (parser == NULL)\n return;\n parser->m_startNamespaceDeclHandler = start;\n parser->m_endNamespaceDeclHandler = end;\n}\n\nvoid XMLCALL\nXML_SetStartNamespaceDeclHandler(XML_Parser parser,\n XML_StartNamespaceDeclHandler start) {\n if (parser != NULL)\n parser->m_startNamespaceDeclHandler = start;\n}\n\nvoid XMLCALL\nXML_SetEndNamespaceDeclHandler(XML_Parser parser,\n XML_EndNamespaceDeclHandler end) {\n if (parser != NULL)\n parser->m_endNamespaceDeclHandler = end;\n}\n\nvoid XMLCALL\nXML_SetNotStandaloneHandler(XML_Parser parser,\n XML_NotStandaloneHandler handler) {\n if (parser != NULL)\n parser->m_notStandaloneHandler = handler;\n}\n\nvoid XMLCALL\nXML_SetExternalEntityRefHandler(XML_Parser parser,\n XML_ExternalEntityRefHandler handler) {\n if (parser != NULL)\n parser->m_externalEntityRefHandler = handler;\n}\n\nvoid XMLCALL\nXML_SetExternalEntityRefHandlerArg(XML_Parser parser, void *arg) {\n if (parser == NULL)\n return;\n if (arg)\n parser->m_externalEntityRefHandlerArg = (XML_Parser)arg;\n else\n parser->m_externalEntityRefHandlerArg = parser;\n}\n\nvoid XMLCALL\nXML_SetSkippedEntityHandler(XML_Parser parser,\n XML_SkippedEntityHandler handler) {\n if (parser != NULL)\n parser->m_skippedEntityHandler = handler;\n}\n\nvoid XMLCALL\nXML_SetUnknownEncodingHandler(XML_Parser parser,\n XML_UnknownEncodingHandler handler, void *data) {\n if (parser == NULL)\n return;\n parser->m_unknownEncodingHandler = handler;\n parser->m_unknownEncodingHandlerData = data;\n}\n\nvoid XMLCALL\nXML_SetElementDeclHandler(XML_Parser parser, XML_ElementDeclHandler eldecl) {\n if (parser != NULL)\n parser->m_elementDeclHandler = eldecl;\n}\n\nvoid XMLCALL\nXML_SetAttlistDeclHandler(XML_Parser parser, XML_AttlistDeclHandler attdecl) {\n if (parser != NULL)\n parser->m_attlistDeclHandler = attdecl;\n}\n\nvoid XMLCALL\nXML_SetEntityDeclHandler(XML_Parser parser, XML_EntityDeclHandler handler) {\n if (parser != NULL)\n parser->m_entityDeclHandler = handler;\n}\n\nvoid XMLCALL\nXML_SetXmlDeclHandler(XML_Parser parser, XML_XmlDeclHandler handler) {\n if (parser != NULL)\n parser->m_xmlDeclHandler = handler;\n}\n\nint XMLCALL\nXML_SetParamEntityParsing(XML_Parser parser,\n enum XML_ParamEntityParsing peParsing) {\n if (parser == NULL)\n return 0;\n /* block after XML_Parse()/XML_ParseBuffer() has been called */\n if (parser->m_parsingStatus.parsing == XML_PARSING\n || parser->m_parsingStatus.parsing == XML_SUSPENDED)\n return 0;\n#ifdef XML_DTD\n parser->m_paramEntityParsing = peParsing;\n return 1;\n#else\n return peParsing == XML_PARAM_ENTITY_PARSING_NEVER;\n#endif\n}\n\nint XMLCALL\nXML_SetHashSalt(XML_Parser parser, unsigned long hash_salt) {\n if (parser == NULL)\n return 0;\n if (parser->m_parentParser)\n return XML_SetHashSalt(parser->m_parentParser, hash_salt);\n /* block after XML_Parse()/XML_ParseBuffer() has been called */\n if (parser->m_parsingStatus.parsing == XML_PARSING\n || parser->m_parsingStatus.parsing == XML_SUSPENDED)\n return 0;\n parser->m_hash_secret_salt = hash_salt;\n return 1;\n}\n\nenum XML_Status XMLCALL\nXML_Parse(XML_Parser parser, const char *s, int len, int isFinal) {\n if ((parser == NULL) || (len < 0) || ((s == NULL) && (len != 0))) {\n if (parser != NULL)\n parser->m_errorCode = XML_ERROR_INVALID_ARGUMENT;\n return XML_STATUS_ERROR;\n }\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n parser->m_errorCode = XML_ERROR_SUSPENDED;\n return XML_STATUS_ERROR;\n case XML_FINISHED:\n parser->m_errorCode = XML_ERROR_FINISHED;\n return XML_STATUS_ERROR;\n case XML_INITIALIZED:\n if (parser->m_parentParser == NULL && ! startParsing(parser)) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return XML_STATUS_ERROR;\n }\n /* fall through */\n default:\n parser->m_parsingStatus.parsing = XML_PARSING;\n }\n\n if (len == 0) {\n parser->m_parsingStatus.finalBuffer = (XML_Bool)isFinal;\n if (! isFinal)\n return XML_STATUS_OK;\n parser->m_positionPtr = parser->m_bufferPtr;\n parser->m_parseEndPtr = parser->m_bufferEnd;\n\n /* If data are left over from last buffer, and we now know that these\n data are the final chunk of input, then we have to check them again\n to detect errors based on that fact.\n */\n parser->m_errorCode\n = parser->m_processor(parser, parser->m_bufferPtr,\n parser->m_parseEndPtr, &parser->m_bufferPtr);\n\n if (parser->m_errorCode == XML_ERROR_NONE) {\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n /* It is hard to be certain, but it seems that this case\n * cannot occur. This code is cleaning up a previous parse\n * with no new data (since len == 0). Changing the parsing\n * state requires getting to execute a handler function, and\n * there doesn't seem to be an opportunity for that while in\n * this circumstance.\n *\n * Given the uncertainty, we retain the code but exclude it\n * from coverage tests.\n *\n * LCOV_EXCL_START\n */\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,\n parser->m_bufferPtr, &parser->m_position);\n parser->m_positionPtr = parser->m_bufferPtr;\n return XML_STATUS_SUSPENDED;\n /* LCOV_EXCL_STOP */\n case XML_INITIALIZED:\n case XML_PARSING:\n parser->m_parsingStatus.parsing = XML_FINISHED;\n /* fall through */\n default:\n return XML_STATUS_OK;\n }\n }\n parser->m_eventEndPtr = parser->m_eventPtr;\n parser->m_processor = errorProcessor;\n return XML_STATUS_ERROR;\n }\n#ifndef XML_CONTEXT_BYTES\n else if (parser->m_bufferPtr == parser->m_bufferEnd) {\n const char *end;\n int nLeftOver;\n enum XML_Status result;\n /* Detect overflow (a+b > MAX <==> b > MAX-a) */\n if (len > ((XML_Size)-1) / 2 - parser->m_parseEndByteIndex) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n parser->m_eventPtr = parser->m_eventEndPtr = NULL;\n parser->m_processor = errorProcessor;\n return XML_STATUS_ERROR;\n }\n parser->m_parseEndByteIndex += len;\n parser->m_positionPtr = s;\n parser->m_parsingStatus.finalBuffer = (XML_Bool)isFinal;\n\n parser->m_errorCode\n = parser->m_processor(parser, s, parser->m_parseEndPtr = s + len, &end);\n\n if (parser->m_errorCode != XML_ERROR_NONE) {\n parser->m_eventEndPtr = parser->m_eventPtr;\n parser->m_processor = errorProcessor;\n return XML_STATUS_ERROR;\n } else {\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n result = XML_STATUS_SUSPENDED;\n break;\n case XML_INITIALIZED:\n case XML_PARSING:\n if (isFinal) {\n parser->m_parsingStatus.parsing = XML_FINISHED;\n return XML_STATUS_OK;\n }\n /* fall through */\n default:\n result = XML_STATUS_OK;\n }\n }\n\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr, end,\n &parser->m_position);\n nLeftOver = s + len - end;\n if (nLeftOver) {\n if (parser->m_buffer == NULL\n || nLeftOver > parser->m_bufferLim - parser->m_buffer) {\n /* avoid _signed_ integer overflow */\n char *temp = NULL;\n const int bytesToAllocate = (int)((unsigned)len * 2U);\n if (bytesToAllocate > 0) {\n temp = (char *)REALLOC(parser, parser->m_buffer, bytesToAllocate);\n }\n if (temp == NULL) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n parser->m_eventPtr = parser->m_eventEndPtr = NULL;\n parser->m_processor = errorProcessor;\n return XML_STATUS_ERROR;\n }\n parser->m_buffer = temp;\n parser->m_bufferLim = parser->m_buffer + bytesToAllocate;\n }\n memcpy(parser->m_buffer, end, nLeftOver);\n }\n parser->m_bufferPtr = parser->m_buffer;\n parser->m_bufferEnd = parser->m_buffer + nLeftOver;\n parser->m_positionPtr = parser->m_bufferPtr;\n parser->m_parseEndPtr = parser->m_bufferEnd;\n parser->m_eventPtr = parser->m_bufferPtr;\n parser->m_eventEndPtr = parser->m_bufferPtr;\n return result;\n }\n#endif /* not defined XML_CONTEXT_BYTES */\n else {\n void *buff = XML_GetBuffer(parser, len);\n if (buff == NULL)\n return XML_STATUS_ERROR;\n else {\n memcpy(buff, s, len);\n return XML_ParseBuffer(parser, len, isFinal);\n }\n }\n}\n\nenum XML_Status XMLCALL\nXML_ParseBuffer(XML_Parser parser, int len, int isFinal) {\n const char *start;\n enum XML_Status result = XML_STATUS_OK;\n\n if (parser == NULL)\n return XML_STATUS_ERROR;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n parser->m_errorCode = XML_ERROR_SUSPENDED;\n return XML_STATUS_ERROR;\n case XML_FINISHED:\n parser->m_errorCode = XML_ERROR_FINISHED;\n return XML_STATUS_ERROR;\n case XML_INITIALIZED:\n if (parser->m_parentParser == NULL && ! startParsing(parser)) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return XML_STATUS_ERROR;\n }\n /* fall through */\n default:\n parser->m_parsingStatus.parsing = XML_PARSING;\n }\n\n start = parser->m_bufferPtr;\n parser->m_positionPtr = start;\n parser->m_bufferEnd += len;\n parser->m_parseEndPtr = parser->m_bufferEnd;\n parser->m_parseEndByteIndex += len;\n parser->m_parsingStatus.finalBuffer = (XML_Bool)isFinal;\n\n parser->m_errorCode = parser->m_processor(\n parser, start, parser->m_parseEndPtr, &parser->m_bufferPtr);\n\n if (parser->m_errorCode != XML_ERROR_NONE) {\n parser->m_eventEndPtr = parser->m_eventPtr;\n parser->m_processor = errorProcessor;\n return XML_STATUS_ERROR;\n } else {\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n result = XML_STATUS_SUSPENDED;\n break;\n case XML_INITIALIZED:\n case XML_PARSING:\n if (isFinal) {\n parser->m_parsingStatus.parsing = XML_FINISHED;\n return result;\n }\n default:; /* should not happen */\n }\n }\n\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,\n parser->m_bufferPtr, &parser->m_position);\n parser->m_positionPtr = parser->m_bufferPtr;\n return result;\n}\n\nvoid *XMLCALL\nXML_GetBuffer(XML_Parser parser, int len) {\n if (parser == NULL)\n return NULL;\n if (len < 0) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return NULL;\n }\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n parser->m_errorCode = XML_ERROR_SUSPENDED;\n return NULL;\n case XML_FINISHED:\n parser->m_errorCode = XML_ERROR_FINISHED;\n return NULL;\n default:;\n }\n\n if (len > EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_bufferEnd)) {\n#ifdef XML_CONTEXT_BYTES\n int keep;\n#endif /* defined XML_CONTEXT_BYTES */\n /* Do not invoke signed arithmetic overflow: */\n int neededSize = (int)((unsigned)len\n + (unsigned)EXPAT_SAFE_PTR_DIFF(\n parser->m_bufferEnd, parser->m_bufferPtr));\n if (neededSize < 0) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return NULL;\n }\n#ifdef XML_CONTEXT_BYTES\n keep = (int)EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer);\n if (keep > XML_CONTEXT_BYTES)\n keep = XML_CONTEXT_BYTES;\n neededSize += keep;\n#endif /* defined XML_CONTEXT_BYTES */\n if (neededSize\n <= EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_buffer)) {\n#ifdef XML_CONTEXT_BYTES\n if (keep < EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer)) {\n int offset\n = (int)EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer)\n - keep;\n /* The buffer pointers cannot be NULL here; we have at least some bytes\n * in the buffer */\n memmove(parser->m_buffer, &parser->m_buffer[offset],\n parser->m_bufferEnd - parser->m_bufferPtr + keep);\n parser->m_bufferEnd -= offset;\n parser->m_bufferPtr -= offset;\n }\n#else\n if (parser->m_buffer && parser->m_bufferPtr) {\n memmove(parser->m_buffer, parser->m_bufferPtr,\n EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr));\n parser->m_bufferEnd\n = parser->m_buffer\n + EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr);\n parser->m_bufferPtr = parser->m_buffer;\n }\n#endif /* not defined XML_CONTEXT_BYTES */\n } else {\n char *newBuf;\n int bufferSize\n = (int)EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_bufferPtr);\n if (bufferSize == 0)\n bufferSize = INIT_BUFFER_SIZE;\n do {\n /* Do not invoke signed arithmetic overflow: */\n bufferSize = (int)(2U * (unsigned)bufferSize);\n } while (bufferSize < neededSize && bufferSize > 0);\n if (bufferSize <= 0) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return NULL;\n }\n newBuf = (char *)MALLOC(parser, bufferSize);\n if (newBuf == 0) {\n parser->m_errorCode = XML_ERROR_NO_MEMORY;\n return NULL;\n }\n parser->m_bufferLim = newBuf + bufferSize;\n#ifdef XML_CONTEXT_BYTES\n if (parser->m_bufferPtr) {\n memcpy(newBuf, &parser->m_bufferPtr[-keep],\n EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr)\n + keep);\n FREE(parser, parser->m_buffer);\n parser->m_buffer = newBuf;\n parser->m_bufferEnd\n = parser->m_buffer\n + EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr)\n + keep;\n parser->m_bufferPtr = parser->m_buffer + keep;\n } else {\n /* This must be a brand new buffer with no data in it yet */\n parser->m_bufferEnd = newBuf;\n parser->m_bufferPtr = parser->m_buffer = newBuf;\n }\n#else\n if (parser->m_bufferPtr) {\n memcpy(newBuf, parser->m_bufferPtr,\n EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr));\n FREE(parser, parser->m_buffer);\n parser->m_bufferEnd\n = newBuf\n + EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr);\n } else {\n /* This must be a brand new buffer with no data in it yet */\n parser->m_bufferEnd = newBuf;\n }\n parser->m_bufferPtr = parser->m_buffer = newBuf;\n#endif /* not defined XML_CONTEXT_BYTES */\n }\n parser->m_eventPtr = parser->m_eventEndPtr = NULL;\n parser->m_positionPtr = NULL;\n }\n return parser->m_bufferEnd;\n}\n\nenum XML_Status XMLCALL\nXML_StopParser(XML_Parser parser, XML_Bool resumable) {\n if (parser == NULL)\n return XML_STATUS_ERROR;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n if (resumable) {\n parser->m_errorCode = XML_ERROR_SUSPENDED;\n return XML_STATUS_ERROR;\n }\n parser->m_parsingStatus.parsing = XML_FINISHED;\n break;\n case XML_FINISHED:\n parser->m_errorCode = XML_ERROR_FINISHED;\n return XML_STATUS_ERROR;\n default:\n if (resumable) {\n#ifdef XML_DTD\n if (parser->m_isParamEntity) {\n parser->m_errorCode = XML_ERROR_SUSPEND_PE;\n return XML_STATUS_ERROR;\n }\n#endif\n parser->m_parsingStatus.parsing = XML_SUSPENDED;\n } else\n parser->m_parsingStatus.parsing = XML_FINISHED;\n }\n return XML_STATUS_OK;\n}\n\nenum XML_Status XMLCALL\nXML_ResumeParser(XML_Parser parser) {\n enum XML_Status result = XML_STATUS_OK;\n\n if (parser == NULL)\n return XML_STATUS_ERROR;\n if (parser->m_parsingStatus.parsing != XML_SUSPENDED) {\n parser->m_errorCode = XML_ERROR_NOT_SUSPENDED;\n return XML_STATUS_ERROR;\n }\n parser->m_parsingStatus.parsing = XML_PARSING;\n\n parser->m_errorCode = parser->m_processor(\n parser, parser->m_bufferPtr, parser->m_parseEndPtr, &parser->m_bufferPtr);\n\n if (parser->m_errorCode != XML_ERROR_NONE) {\n parser->m_eventEndPtr = parser->m_eventPtr;\n parser->m_processor = errorProcessor;\n return XML_STATUS_ERROR;\n } else {\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n result = XML_STATUS_SUSPENDED;\n break;\n case XML_INITIALIZED:\n case XML_PARSING:\n if (parser->m_parsingStatus.finalBuffer) {\n parser->m_parsingStatus.parsing = XML_FINISHED;\n return result;\n }\n default:;\n }\n }\n\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,\n parser->m_bufferPtr, &parser->m_position);\n parser->m_positionPtr = parser->m_bufferPtr;\n return result;\n}\n\nvoid XMLCALL\nXML_GetParsingStatus(XML_Parser parser, XML_ParsingStatus *status) {\n if (parser == NULL)\n return;\n assert(status != NULL);\n *status = parser->m_parsingStatus;\n}\n\nenum XML_Error XMLCALL\nXML_GetErrorCode(XML_Parser parser) {\n if (parser == NULL)\n return XML_ERROR_INVALID_ARGUMENT;\n return parser->m_errorCode;\n}\n\nXML_Index XMLCALL\nXML_GetCurrentByteIndex(XML_Parser parser) {\n if (parser == NULL)\n return -1;\n if (parser->m_eventPtr)\n return (XML_Index)(parser->m_parseEndByteIndex\n - (parser->m_parseEndPtr - parser->m_eventPtr));\n return -1;\n}\n\nint XMLCALL\nXML_GetCurrentByteCount(XML_Parser parser) {\n if (parser == NULL)\n return 0;\n if (parser->m_eventEndPtr && parser->m_eventPtr)\n return (int)(parser->m_eventEndPtr - parser->m_eventPtr);\n return 0;\n}\n\nconst char *XMLCALL\nXML_GetInputContext(XML_Parser parser, int *offset, int *size) {\n#ifdef XML_CONTEXT_BYTES\n if (parser == NULL)\n return NULL;\n if (parser->m_eventPtr && parser->m_buffer) {\n if (offset != NULL)\n *offset = (int)(parser->m_eventPtr - parser->m_buffer);\n if (size != NULL)\n *size = (int)(parser->m_bufferEnd - parser->m_buffer);\n return parser->m_buffer;\n }\n#else\n (void)parser;\n (void)offset;\n (void)size;\n#endif /* defined XML_CONTEXT_BYTES */\n return (char *)0;\n}\n\nXML_Size XMLCALL\nXML_GetCurrentLineNumber(XML_Parser parser) {\n if (parser == NULL)\n return 0;\n if (parser->m_eventPtr && parser->m_eventPtr >= parser->m_positionPtr) {\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,\n parser->m_eventPtr, &parser->m_position);\n parser->m_positionPtr = parser->m_eventPtr;\n }\n return parser->m_position.lineNumber + 1;\n}\n\nXML_Size XMLCALL\nXML_GetCurrentColumnNumber(XML_Parser parser) {\n if (parser == NULL)\n return 0;\n if (parser->m_eventPtr && parser->m_eventPtr >= parser->m_positionPtr) {\n XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,\n parser->m_eventPtr, &parser->m_position);\n parser->m_positionPtr = parser->m_eventPtr;\n }\n return parser->m_position.columnNumber;\n}\n\nvoid XMLCALL\nXML_FreeContentModel(XML_Parser parser, XML_Content *model) {\n if (parser != NULL)\n FREE(parser, model);\n}\n\nvoid *XMLCALL\nXML_MemMalloc(XML_Parser parser, size_t size) {\n if (parser == NULL)\n return NULL;\n return MALLOC(parser, size);\n}\n\nvoid *XMLCALL\nXML_MemRealloc(XML_Parser parser, void *ptr, size_t size) {\n if (parser == NULL)\n return NULL;\n return REALLOC(parser, ptr, size);\n}\n\nvoid XMLCALL\nXML_MemFree(XML_Parser parser, void *ptr) {\n if (parser != NULL)\n FREE(parser, ptr);\n}\n\nvoid XMLCALL\nXML_DefaultCurrent(XML_Parser parser) {\n if (parser == NULL)\n return;\n if (parser->m_defaultHandler) {\n if (parser->m_openInternalEntities)\n reportDefault(parser, parser->m_internalEncoding,\n parser->m_openInternalEntities->internalEventPtr,\n parser->m_openInternalEntities->internalEventEndPtr);\n else\n reportDefault(parser, parser->m_encoding, parser->m_eventPtr,\n parser->m_eventEndPtr);\n }\n}\n\nconst XML_LChar *XMLCALL\nXML_ErrorString(enum XML_Error code) {\n switch (code) {\n case XML_ERROR_NONE:\n return NULL;\n case XML_ERROR_NO_MEMORY:\n return XML_L(\"out of memory\");\n case XML_ERROR_SYNTAX:\n return XML_L(\"syntax error\");\n case XML_ERROR_NO_ELEMENTS:\n return XML_L(\"no element found\");\n case XML_ERROR_INVALID_TOKEN:\n return XML_L(\"not well-formed (invalid token)\");\n case XML_ERROR_UNCLOSED_TOKEN:\n return XML_L(\"unclosed token\");\n case XML_ERROR_PARTIAL_CHAR:\n return XML_L(\"partial character\");\n case XML_ERROR_TAG_MISMATCH:\n return XML_L(\"mismatched tag\");\n case XML_ERROR_DUPLICATE_ATTRIBUTE:\n return XML_L(\"duplicate attribute\");\n case XML_ERROR_JUNK_AFTER_DOC_ELEMENT:\n return XML_L(\"junk after document element\");\n case XML_ERROR_PARAM_ENTITY_REF:\n return XML_L(\"illegal parameter entity reference\");\n case XML_ERROR_UNDEFINED_ENTITY:\n return XML_L(\"undefined entity\");\n case XML_ERROR_RECURSIVE_ENTITY_REF:\n return XML_L(\"recursive entity reference\");\n case XML_ERROR_ASYNC_ENTITY:\n return XML_L(\"asynchronous entity\");\n case XML_ERROR_BAD_CHAR_REF:\n return XML_L(\"reference to invalid character number\");\n case XML_ERROR_BINARY_ENTITY_REF:\n return XML_L(\"reference to binary entity\");\n case XML_ERROR_ATTRIBUTE_EXTERNAL_ENTITY_REF:\n return XML_L(\"reference to external entity in attribute\");\n case XML_ERROR_MISPLACED_XML_PI:\n return XML_L(\"XML or text declaration not at start of entity\");\n case XML_ERROR_UNKNOWN_ENCODING:\n return XML_L(\"unknown encoding\");\n case XML_ERROR_INCORRECT_ENCODING:\n return XML_L(\"encoding specified in XML declaration is incorrect\");\n case XML_ERROR_UNCLOSED_CDATA_SECTION:\n return XML_L(\"unclosed CDATA section\");\n case XML_ERROR_EXTERNAL_ENTITY_HANDLING:\n return XML_L(\"error in processing external entity reference\");\n case XML_ERROR_NOT_STANDALONE:\n return XML_L(\"document is not standalone\");\n case XML_ERROR_UNEXPECTED_STATE:\n return XML_L(\"unexpected parser state - please send a bug report\");\n case XML_ERROR_ENTITY_DECLARED_IN_PE:\n return XML_L(\"entity declared in parameter entity\");\n case XML_ERROR_FEATURE_REQUIRES_XML_DTD:\n return XML_L(\"requested feature requires XML_DTD support in Expat\");\n case XML_ERROR_CANT_CHANGE_FEATURE_ONCE_PARSING:\n return XML_L(\"cannot change setting once parsing has begun\");\n /* Added in 1.95.7. */\n case XML_ERROR_UNBOUND_PREFIX:\n return XML_L(\"unbound prefix\");\n /* Added in 1.95.8. */\n case XML_ERROR_UNDECLARING_PREFIX:\n return XML_L(\"must not undeclare prefix\");\n case XML_ERROR_INCOMPLETE_PE:\n return XML_L(\"incomplete markup in parameter entity\");\n case XML_ERROR_XML_DECL:\n return XML_L(\"XML declaration not well-formed\");\n case XML_ERROR_TEXT_DECL:\n return XML_L(\"text declaration not well-formed\");\n case XML_ERROR_PUBLICID:\n return XML_L(\"illegal character(s) in public id\");\n case XML_ERROR_SUSPENDED:\n return XML_L(\"parser suspended\");\n case XML_ERROR_NOT_SUSPENDED:\n return XML_L(\"parser not suspended\");\n case XML_ERROR_ABORTED:\n return XML_L(\"parsing aborted\");\n case XML_ERROR_FINISHED:\n return XML_L(\"parsing finished\");\n case XML_ERROR_SUSPEND_PE:\n return XML_L(\"cannot suspend in external parameter entity\");\n /* Added in 2.0.0. */\n case XML_ERROR_RESERVED_PREFIX_XML:\n return XML_L(\n \"reserved prefix (xml) must not be undeclared or bound to another namespace name\");\n case XML_ERROR_RESERVED_PREFIX_XMLNS:\n return XML_L(\"reserved prefix (xmlns) must not be declared or undeclared\");\n case XML_ERROR_RESERVED_NAMESPACE_URI:\n return XML_L(\n \"prefix must not be bound to one of the reserved namespace names\");\n /* Added in 2.2.5. */\n case XML_ERROR_INVALID_ARGUMENT: /* Constant added in 2.2.1, already */\n return XML_L(\"invalid argument\");\n }\n return NULL;\n}\n\nconst XML_LChar *XMLCALL\nXML_ExpatVersion(void) {\n /* V1 is used to string-ize the version number. However, it would\n string-ize the actual version macro *names* unless we get them\n substituted before being passed to V1. CPP is defined to expand\n a macro, then rescan for more expansions. Thus, we use V2 to expand\n the version macros, then CPP will expand the resulting V1() macro\n with the correct numerals. */\n /* ### I'm assuming cpp is portable in this respect... */\n\n#define V1(a, b, c) XML_L(#a) XML_L(\".\") XML_L(#b) XML_L(\".\") XML_L(#c)\n#define V2(a, b, c) XML_L(\"expat_\") V1(a, b, c)\n\n return V2(XML_MAJOR_VERSION, XML_MINOR_VERSION, XML_MICRO_VERSION);\n\n#undef V1\n#undef V2\n}\n\nXML_Expat_Version XMLCALL\nXML_ExpatVersionInfo(void) {\n XML_Expat_Version version;\n\n version.major = XML_MAJOR_VERSION;\n version.minor = XML_MINOR_VERSION;\n version.micro = XML_MICRO_VERSION;\n\n return version;\n}\n\nconst XML_Feature *XMLCALL\nXML_GetFeatureList(void) {\n static const XML_Feature features[]\n = {{XML_FEATURE_SIZEOF_XML_CHAR, XML_L(\"sizeof(XML_Char)\"),\n sizeof(XML_Char)},\n {XML_FEATURE_SIZEOF_XML_LCHAR, XML_L(\"sizeof(XML_LChar)\"),\n sizeof(XML_LChar)},\n#ifdef XML_UNICODE\n {XML_FEATURE_UNICODE, XML_L(\"XML_UNICODE\"), 0},\n#endif\n#ifdef XML_UNICODE_WCHAR_T\n {XML_FEATURE_UNICODE_WCHAR_T, XML_L(\"XML_UNICODE_WCHAR_T\"), 0},\n#endif\n#ifdef XML_DTD\n {XML_FEATURE_DTD, XML_L(\"XML_DTD\"), 0},\n#endif\n#ifdef XML_CONTEXT_BYTES\n {XML_FEATURE_CONTEXT_BYTES, XML_L(\"XML_CONTEXT_BYTES\"),\n XML_CONTEXT_BYTES},\n#endif\n#ifdef XML_MIN_SIZE\n {XML_FEATURE_MIN_SIZE, XML_L(\"XML_MIN_SIZE\"), 0},\n#endif\n#ifdef XML_NS\n {XML_FEATURE_NS, XML_L(\"XML_NS\"), 0},\n#endif\n#ifdef XML_LARGE_SIZE\n {XML_FEATURE_LARGE_SIZE, XML_L(\"XML_LARGE_SIZE\"), 0},\n#endif\n#ifdef XML_ATTR_INFO\n {XML_FEATURE_ATTR_INFO, XML_L(\"XML_ATTR_INFO\"), 0},\n#endif\n {XML_FEATURE_END, NULL, 0}};\n\n return features;\n}\n\n/* Initially tag->rawName always points into the parse buffer;\n for those TAG instances opened while the current parse buffer was\n processed, and not yet closed, we need to store tag->rawName in a more\n permanent location, since the parse buffer is about to be discarded.\n*/\nstatic XML_Bool\nstoreRawNames(XML_Parser parser) {\n TAG *tag = parser->m_tagStack;\n while (tag) {\n int bufSize;\n int nameLen = sizeof(XML_Char) * (tag->name.strLen + 1);\n char *rawNameBuf = tag->buf + nameLen;\n /* Stop if already stored. Since m_tagStack is a stack, we can stop\n at the first entry that has already been copied; everything\n below it in the stack is already been accounted for in a\n previous call to this function.\n */\n if (tag->rawName == rawNameBuf)\n break;\n /* For re-use purposes we need to ensure that the\n size of tag->buf is a multiple of sizeof(XML_Char).\n */\n bufSize = nameLen + ROUND_UP(tag->rawNameLength, sizeof(XML_Char));\n if (bufSize > tag->bufEnd - tag->buf) {\n char *temp = (char *)REALLOC(parser, tag->buf, bufSize);\n if (temp == NULL)\n return XML_FALSE;\n /* if tag->name.str points to tag->buf (only when namespace\n processing is off) then we have to update it\n */\n if (tag->name.str == (XML_Char *)tag->buf)\n tag->name.str = (XML_Char *)temp;\n /* if tag->name.localPart is set (when namespace processing is on)\n then update it as well, since it will always point into tag->buf\n */\n if (tag->name.localPart)\n tag->name.localPart\n = (XML_Char *)temp + (tag->name.localPart - (XML_Char *)tag->buf);\n tag->buf = temp;\n tag->bufEnd = temp + bufSize;\n rawNameBuf = temp + nameLen;\n }\n memcpy(rawNameBuf, tag->rawName, tag->rawNameLength);\n tag->rawName = rawNameBuf;\n tag = tag->parent;\n }\n return XML_TRUE;\n}\n\nstatic enum XML_Error PTRCALL\ncontentProcessor(XML_Parser parser, const char *start, const char *end,\n const char **endPtr) {\n enum XML_Error result\n = doContent(parser, 0, parser->m_encoding, start, end, endPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n if (result == XML_ERROR_NONE) {\n if (! storeRawNames(parser))\n return XML_ERROR_NO_MEMORY;\n }\n return result;\n}\n\nstatic enum XML_Error PTRCALL\nexternalEntityInitProcessor(XML_Parser parser, const char *start,\n const char *end, const char **endPtr) {\n enum XML_Error result = initializeEncoding(parser);\n if (result != XML_ERROR_NONE)\n return result;\n parser->m_processor = externalEntityInitProcessor2;\n return externalEntityInitProcessor2(parser, start, end, endPtr);\n}\n\nstatic enum XML_Error PTRCALL\nexternalEntityInitProcessor2(XML_Parser parser, const char *start,\n const char *end, const char **endPtr) {\n const char *next = start; /* XmlContentTok doesn't always set the last arg */\n int tok = XmlContentTok(parser->m_encoding, start, end, &next);\n switch (tok) {\n case XML_TOK_BOM:\n /* If we are at the end of the buffer, this would cause the next stage,\n i.e. externalEntityInitProcessor3, to pass control directly to\n doContent (by detecting XML_TOK_NONE) without processing any xml text\n declaration - causing the error XML_ERROR_MISPLACED_XML_PI in doContent.\n */\n if (next == end && ! parser->m_parsingStatus.finalBuffer) {\n *endPtr = next;\n return XML_ERROR_NONE;\n }\n start = next;\n break;\n case XML_TOK_PARTIAL:\n if (! parser->m_parsingStatus.finalBuffer) {\n *endPtr = start;\n return XML_ERROR_NONE;\n }\n parser->m_eventPtr = start;\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (! parser->m_parsingStatus.finalBuffer) {\n *endPtr = start;\n return XML_ERROR_NONE;\n }\n parser->m_eventPtr = start;\n return XML_ERROR_PARTIAL_CHAR;\n }\n parser->m_processor = externalEntityInitProcessor3;\n return externalEntityInitProcessor3(parser, start, end, endPtr);\n}\n\nstatic enum XML_Error PTRCALL\nexternalEntityInitProcessor3(XML_Parser parser, const char *start,\n const char *end, const char **endPtr) {\n int tok;\n const char *next = start; /* XmlContentTok doesn't always set the last arg */\n parser->m_eventPtr = start;\n tok = XmlContentTok(parser->m_encoding, start, end, &next);\n parser->m_eventEndPtr = next;\n\n switch (tok) {\n case XML_TOK_XML_DECL: {\n enum XML_Error result;\n result = processXmlDecl(parser, 1, start, next);\n if (result != XML_ERROR_NONE)\n return result;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *endPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:\n start = next;\n }\n } break;\n case XML_TOK_PARTIAL:\n if (! parser->m_parsingStatus.finalBuffer) {\n *endPtr = start;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (! parser->m_parsingStatus.finalBuffer) {\n *endPtr = start;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n }\n parser->m_processor = externalEntityContentProcessor;\n parser->m_tagLevel = 1;\n return externalEntityContentProcessor(parser, start, end, endPtr);\n}\n\nstatic enum XML_Error PTRCALL\nexternalEntityContentProcessor(XML_Parser parser, const char *start,\n const char *end, const char **endPtr) {\n enum XML_Error result\n = doContent(parser, 1, parser->m_encoding, start, end, endPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n if (result == XML_ERROR_NONE) {\n if (! storeRawNames(parser))\n return XML_ERROR_NO_MEMORY;\n }\n return result;\n}\n\nstatic enum XML_Error\ndoContent(XML_Parser parser, int startTagLevel, const ENCODING *enc,\n const char *s, const char *end, const char **nextPtr,\n XML_Bool haveMore) {\n /* save one level of indirection */\n DTD *const dtd = parser->m_dtd;\n\n const char **eventPP;\n const char **eventEndPP;\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n }\n *eventPP = s;\n\n for (;;) {\n const char *next = s; /* XmlContentTok doesn't always set the last arg */\n int tok = XmlContentTok(enc, s, end, &next);\n *eventEndPP = next;\n switch (tok) {\n case XML_TOK_TRAILING_CR:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n *eventEndPP = end;\n if (parser->m_characterDataHandler) {\n XML_Char c = 0xA;\n parser->m_characterDataHandler(parser->m_handlerArg, &c, 1);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, end);\n /* We are at the end of the final buffer, should we check for\n XML_SUSPENDED, XML_FINISHED?\n */\n if (startTagLevel == 0)\n return XML_ERROR_NO_ELEMENTS;\n if (parser->m_tagLevel != startTagLevel)\n return XML_ERROR_ASYNC_ENTITY;\n *nextPtr = end;\n return XML_ERROR_NONE;\n case XML_TOK_NONE:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n if (startTagLevel > 0) {\n if (parser->m_tagLevel != startTagLevel)\n return XML_ERROR_ASYNC_ENTITY;\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_NO_ELEMENTS;\n case XML_TOK_INVALID:\n *eventPP = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_ENTITY_REF: {\n const XML_Char *name;\n ENTITY *entity;\n XML_Char ch = (XML_Char)XmlPredefinedEntityName(\n enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar);\n if (ch) {\n if (parser->m_characterDataHandler)\n parser->m_characterDataHandler(parser->m_handlerArg, &ch, 1);\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n }\n name = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n entity = (ENTITY *)lookup(parser, &dtd->generalEntities, name, 0);\n poolDiscard(&dtd->pool);\n /* First, determine if a check for an existing declaration is needed;\n if yes, check that the entity exists, and that it is internal,\n otherwise call the skipped entity or default handler.\n */\n if (! dtd->hasParamEntityRefs || dtd->standalone) {\n if (! entity)\n return XML_ERROR_UNDEFINED_ENTITY;\n else if (! entity->is_internal)\n return XML_ERROR_ENTITY_DECLARED_IN_PE;\n } else if (! entity) {\n if (parser->m_skippedEntityHandler)\n parser->m_skippedEntityHandler(parser->m_handlerArg, name, 0);\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n }\n if (entity->open)\n return XML_ERROR_RECURSIVE_ENTITY_REF;\n if (entity->notation)\n return XML_ERROR_BINARY_ENTITY_REF;\n if (entity->textPtr) {\n enum XML_Error result;\n if (! parser->m_defaultExpandInternalEntities) {\n if (parser->m_skippedEntityHandler)\n parser->m_skippedEntityHandler(parser->m_handlerArg, entity->name,\n 0);\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n }\n result = processInternalEntity(parser, entity, XML_FALSE);\n if (result != XML_ERROR_NONE)\n return result;\n } else if (parser->m_externalEntityRefHandler) {\n const XML_Char *context;\n entity->open = XML_TRUE;\n context = getContext(parser);\n entity->open = XML_FALSE;\n if (! context)\n return XML_ERROR_NO_MEMORY;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, context, entity->base,\n entity->systemId, entity->publicId))\n return XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n poolDiscard(&parser->m_tempPool);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n }\n case XML_TOK_START_TAG_NO_ATTS:\n /* fall through */\n case XML_TOK_START_TAG_WITH_ATTS: {\n TAG *tag;\n enum XML_Error result;\n XML_Char *toPtr;\n if (parser->m_freeTagList) {\n tag = parser->m_freeTagList;\n parser->m_freeTagList = parser->m_freeTagList->parent;\n } else {\n tag = (TAG *)MALLOC(parser, sizeof(TAG));\n if (! tag)\n return XML_ERROR_NO_MEMORY;\n tag->buf = (char *)MALLOC(parser, INIT_TAG_BUF_SIZE);\n if (! tag->buf) {\n FREE(parser, tag);\n return XML_ERROR_NO_MEMORY;\n }\n tag->bufEnd = tag->buf + INIT_TAG_BUF_SIZE;\n }\n tag->bindings = NULL;\n tag->parent = parser->m_tagStack;\n parser->m_tagStack = tag;\n tag->name.localPart = NULL;\n tag->name.prefix = NULL;\n tag->rawName = s + enc->minBytesPerChar;\n tag->rawNameLength = XmlNameLength(enc, tag->rawName);\n ++parser->m_tagLevel;\n {\n const char *rawNameEnd = tag->rawName + tag->rawNameLength;\n const char *fromPtr = tag->rawName;\n toPtr = (XML_Char *)tag->buf;\n for (;;) {\n int bufSize;\n int convLen;\n const enum XML_Convert_Result convert_res\n = XmlConvert(enc, &fromPtr, rawNameEnd, (ICHAR **)&toPtr,\n (ICHAR *)tag->bufEnd - 1);\n convLen = (int)(toPtr - (XML_Char *)tag->buf);\n if ((fromPtr >= rawNameEnd)\n || (convert_res == XML_CONVERT_INPUT_INCOMPLETE)) {\n tag->name.strLen = convLen;\n break;\n }\n bufSize = (int)(tag->bufEnd - tag->buf) << 1;\n {\n char *temp = (char *)REALLOC(parser, tag->buf, bufSize);\n if (temp == NULL)\n return XML_ERROR_NO_MEMORY;\n tag->buf = temp;\n tag->bufEnd = temp + bufSize;\n toPtr = (XML_Char *)temp + convLen;\n }\n }\n }\n tag->name.str = (XML_Char *)tag->buf;\n *toPtr = XML_T('\\0');\n result = storeAtts(parser, enc, s, &(tag->name), &(tag->bindings));\n if (result)\n return result;\n if (parser->m_startElementHandler)\n parser->m_startElementHandler(parser->m_handlerArg, tag->name.str,\n (const XML_Char **)parser->m_atts);\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n poolClear(&parser->m_tempPool);\n break;\n }\n case XML_TOK_EMPTY_ELEMENT_NO_ATTS:\n /* fall through */\n case XML_TOK_EMPTY_ELEMENT_WITH_ATTS: {\n const char *rawName = s + enc->minBytesPerChar;\n enum XML_Error result;\n BINDING *bindings = NULL;\n XML_Bool noElmHandlers = XML_TRUE;\n TAG_NAME name;\n name.str = poolStoreString(&parser->m_tempPool, enc, rawName,\n rawName + XmlNameLength(enc, rawName));\n if (! name.str)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n result = storeAtts(parser, enc, s, &name, &bindings);\n if (result != XML_ERROR_NONE) {\n freeBindings(parser, bindings);\n return result;\n }\n poolFinish(&parser->m_tempPool);\n if (parser->m_startElementHandler) {\n parser->m_startElementHandler(parser->m_handlerArg, name.str,\n (const XML_Char **)parser->m_atts);\n noElmHandlers = XML_FALSE;\n }\n if (parser->m_endElementHandler) {\n if (parser->m_startElementHandler)\n *eventPP = *eventEndPP;\n parser->m_endElementHandler(parser->m_handlerArg, name.str);\n noElmHandlers = XML_FALSE;\n }\n if (noElmHandlers && parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n poolClear(&parser->m_tempPool);\n freeBindings(parser, bindings);\n }\n if ((parser->m_tagLevel == 0)\n && (parser->m_parsingStatus.parsing != XML_FINISHED)) {\n if (parser->m_parsingStatus.parsing == XML_SUSPENDED)\n parser->m_processor = epilogProcessor;\n else\n return epilogProcessor(parser, next, end, nextPtr);\n }\n break;\n case XML_TOK_END_TAG:\n if (parser->m_tagLevel == startTagLevel)\n return XML_ERROR_ASYNC_ENTITY;\n else {\n int len;\n const char *rawName;\n TAG *tag = parser->m_tagStack;\n parser->m_tagStack = tag->parent;\n tag->parent = parser->m_freeTagList;\n parser->m_freeTagList = tag;\n rawName = s + enc->minBytesPerChar * 2;\n len = XmlNameLength(enc, rawName);\n if (len != tag->rawNameLength\n || memcmp(tag->rawName, rawName, len) != 0) {\n *eventPP = rawName;\n return XML_ERROR_TAG_MISMATCH;\n }\n --parser->m_tagLevel;\n if (parser->m_endElementHandler) {\n const XML_Char *localPart;\n const XML_Char *prefix;\n XML_Char *uri;\n localPart = tag->name.localPart;\n if (parser->m_ns && localPart) {\n /* localPart and prefix may have been overwritten in\n tag->name.str, since this points to the binding->uri\n buffer which gets re-used; so we have to add them again\n */\n uri = (XML_Char *)tag->name.str + tag->name.uriLen;\n /* don't need to check for space - already done in storeAtts() */\n while (*localPart)\n *uri++ = *localPart++;\n prefix = (XML_Char *)tag->name.prefix;\n if (parser->m_ns_triplets && prefix) {\n *uri++ = parser->m_namespaceSeparator;\n while (*prefix)\n *uri++ = *prefix++;\n }\n *uri = XML_T('\\0');\n }\n parser->m_endElementHandler(parser->m_handlerArg, tag->name.str);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n while (tag->bindings) {\n BINDING *b = tag->bindings;\n if (parser->m_endNamespaceDeclHandler)\n parser->m_endNamespaceDeclHandler(parser->m_handlerArg,\n b->prefix->name);\n tag->bindings = tag->bindings->nextTagBinding;\n b->nextTagBinding = parser->m_freeBindingList;\n parser->m_freeBindingList = b;\n b->prefix->binding = b->prevPrefixBinding;\n }\n if ((parser->m_tagLevel == 0)\n && (parser->m_parsingStatus.parsing != XML_FINISHED)) {\n if (parser->m_parsingStatus.parsing == XML_SUSPENDED)\n parser->m_processor = epilogProcessor;\n else\n return epilogProcessor(parser, next, end, nextPtr);\n }\n }\n break;\n case XML_TOK_CHAR_REF: {\n int n = XmlCharRefNumber(enc, s);\n if (n < 0)\n return XML_ERROR_BAD_CHAR_REF;\n if (parser->m_characterDataHandler) {\n XML_Char buf[XML_ENCODE_MAX];\n parser->m_characterDataHandler(parser->m_handlerArg, buf,\n XmlEncode(n, (ICHAR *)buf));\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n } break;\n case XML_TOK_XML_DECL:\n return XML_ERROR_MISPLACED_XML_PI;\n case XML_TOK_DATA_NEWLINE:\n if (parser->m_characterDataHandler) {\n XML_Char c = 0xA;\n parser->m_characterDataHandler(parser->m_handlerArg, &c, 1);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n case XML_TOK_CDATA_SECT_OPEN: {\n enum XML_Error result;\n if (parser->m_startCdataSectionHandler)\n parser->m_startCdataSectionHandler(parser->m_handlerArg);\n /* BEGIN disabled code */\n /* Suppose you doing a transformation on a document that involves\n changing only the character data. You set up a defaultHandler\n and a characterDataHandler. The defaultHandler simply copies\n characters through. The characterDataHandler does the\n transformation and writes the characters out escaping them as\n necessary. This case will fail to work if we leave out the\n following two lines (because & and < inside CDATA sections will\n be incorrectly escaped).\n\n However, now we have a start/endCdataSectionHandler, so it seems\n easier to let the user deal with this.\n */\n else if (0 && parser->m_characterDataHandler)\n parser->m_characterDataHandler(parser->m_handlerArg, parser->m_dataBuf,\n 0);\n /* END disabled code */\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n result = doCdataSection(parser, enc, &next, end, nextPtr, haveMore);\n if (result != XML_ERROR_NONE)\n return result;\n else if (! next) {\n parser->m_processor = cdataSectionProcessor;\n return result;\n }\n } break;\n case XML_TOK_TRAILING_RSQB:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n if (parser->m_characterDataHandler) {\n if (MUST_CONVERT(enc, s)) {\n ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;\n XmlConvert(enc, &s, end, &dataPtr, (ICHAR *)parser->m_dataBufEnd);\n parser->m_characterDataHandler(\n parser->m_handlerArg, parser->m_dataBuf,\n (int)(dataPtr - (ICHAR *)parser->m_dataBuf));\n } else\n parser->m_characterDataHandler(\n parser->m_handlerArg, (XML_Char *)s,\n (int)((XML_Char *)end - (XML_Char *)s));\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, end);\n /* We are at the end of the final buffer, should we check for\n XML_SUSPENDED, XML_FINISHED?\n */\n if (startTagLevel == 0) {\n *eventPP = end;\n return XML_ERROR_NO_ELEMENTS;\n }\n if (parser->m_tagLevel != startTagLevel) {\n *eventPP = end;\n return XML_ERROR_ASYNC_ENTITY;\n }\n *nextPtr = end;\n return XML_ERROR_NONE;\n case XML_TOK_DATA_CHARS: {\n XML_CharacterDataHandler charDataHandler = parser->m_characterDataHandler;\n if (charDataHandler) {\n if (MUST_CONVERT(enc, s)) {\n for (;;) {\n ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;\n const enum XML_Convert_Result convert_res = XmlConvert(\n enc, &s, next, &dataPtr, (ICHAR *)parser->m_dataBufEnd);\n *eventEndPP = s;\n charDataHandler(parser->m_handlerArg, parser->m_dataBuf,\n (int)(dataPtr - (ICHAR *)parser->m_dataBuf));\n if ((convert_res == XML_CONVERT_COMPLETED)\n || (convert_res == XML_CONVERT_INPUT_INCOMPLETE))\n break;\n *eventPP = s;\n }\n } else\n charDataHandler(parser->m_handlerArg, (XML_Char *)s,\n (int)((XML_Char *)next - (XML_Char *)s));\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n } break;\n case XML_TOK_PI:\n if (! reportProcessingInstruction(parser, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_COMMENT:\n if (! reportComment(parser, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n break;\n default:\n /* All of the tokens produced by XmlContentTok() have their own\n * explicit cases, so this default is not strictly necessary.\n * However it is a useful safety net, so we retain the code and\n * simply exclude it from the coverage tests.\n *\n * LCOV_EXCL_START\n */\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n /* LCOV_EXCL_STOP */\n }\n *eventPP = s = next;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:;\n }\n }\n /* not reached */\n}\n\n/* This function does not call free() on the allocated memory, merely\n * moving it to the parser's m_freeBindingList where it can be freed or\n * reused as appropriate.\n */\nstatic void\nfreeBindings(XML_Parser parser, BINDING *bindings) {\n while (bindings) {\n BINDING *b = bindings;\n\n /* m_startNamespaceDeclHandler will have been called for this\n * binding in addBindings(), so call the end handler now.\n */\n if (parser->m_endNamespaceDeclHandler)\n parser->m_endNamespaceDeclHandler(parser->m_handlerArg, b->prefix->name);\n\n bindings = bindings->nextTagBinding;\n b->nextTagBinding = parser->m_freeBindingList;\n parser->m_freeBindingList = b;\n b->prefix->binding = b->prevPrefixBinding;\n }\n}\n\n/* Precondition: all arguments must be non-NULL;\n Purpose:\n - normalize attributes\n - check attributes for well-formedness\n - generate namespace aware attribute names (URI, prefix)\n - build list of attributes for startElementHandler\n - default attributes\n - process namespace declarations (check and report them)\n - generate namespace aware element name (URI, prefix)\n*/\nstatic enum XML_Error\nstoreAtts(XML_Parser parser, const ENCODING *enc, const char *attStr,\n TAG_NAME *tagNamePtr, BINDING **bindingsPtr) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n ELEMENT_TYPE *elementType;\n int nDefaultAtts;\n const XML_Char **appAtts; /* the attribute list for the application */\n int attIndex = 0;\n int prefixLen;\n int i;\n int n;\n XML_Char *uri;\n int nPrefixes = 0;\n BINDING *binding;\n const XML_Char *localPart;\n\n /* lookup the element type name */\n elementType\n = (ELEMENT_TYPE *)lookup(parser, &dtd->elementTypes, tagNamePtr->str, 0);\n if (! elementType) {\n const XML_Char *name = poolCopyString(&dtd->pool, tagNamePtr->str);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n elementType = (ELEMENT_TYPE *)lookup(parser, &dtd->elementTypes, name,\n sizeof(ELEMENT_TYPE));\n if (! elementType)\n return XML_ERROR_NO_MEMORY;\n if (parser->m_ns && ! setElementTypePrefix(parser, elementType))\n return XML_ERROR_NO_MEMORY;\n }\n nDefaultAtts = elementType->nDefaultAtts;\n\n /* get the attributes from the tokenizer */\n n = XmlGetAttributes(enc, attStr, parser->m_attsSize, parser->m_atts);\n if (n + nDefaultAtts > parser->m_attsSize) {\n int oldAttsSize = parser->m_attsSize;\n ATTRIBUTE *temp;\n#ifdef XML_ATTR_INFO\n XML_AttrInfo *temp2;\n#endif\n parser->m_attsSize = n + nDefaultAtts + INIT_ATTS_SIZE;\n temp = (ATTRIBUTE *)REALLOC(parser, (void *)parser->m_atts,\n parser->m_attsSize * sizeof(ATTRIBUTE));\n if (temp == NULL) {\n parser->m_attsSize = oldAttsSize;\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_atts = temp;\n#ifdef XML_ATTR_INFO\n temp2 = (XML_AttrInfo *)REALLOC(parser, (void *)parser->m_attInfo,\n parser->m_attsSize * sizeof(XML_AttrInfo));\n if (temp2 == NULL) {\n parser->m_attsSize = oldAttsSize;\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_attInfo = temp2;\n#endif\n if (n > oldAttsSize)\n XmlGetAttributes(enc, attStr, n, parser->m_atts);\n }\n\n appAtts = (const XML_Char **)parser->m_atts;\n for (i = 0; i < n; i++) {\n ATTRIBUTE *currAtt = &parser->m_atts[i];\n#ifdef XML_ATTR_INFO\n XML_AttrInfo *currAttInfo = &parser->m_attInfo[i];\n#endif\n /* add the name and value to the attribute list */\n ATTRIBUTE_ID *attId\n = getAttributeId(parser, enc, currAtt->name,\n currAtt->name + XmlNameLength(enc, currAtt->name));\n if (! attId)\n return XML_ERROR_NO_MEMORY;\n#ifdef XML_ATTR_INFO\n currAttInfo->nameStart\n = parser->m_parseEndByteIndex - (parser->m_parseEndPtr - currAtt->name);\n currAttInfo->nameEnd\n = currAttInfo->nameStart + XmlNameLength(enc, currAtt->name);\n currAttInfo->valueStart = parser->m_parseEndByteIndex\n - (parser->m_parseEndPtr - currAtt->valuePtr);\n currAttInfo->valueEnd = parser->m_parseEndByteIndex\n - (parser->m_parseEndPtr - currAtt->valueEnd);\n#endif\n /* Detect duplicate attributes by their QNames. This does not work when\n namespace processing is turned on and different prefixes for the same\n namespace are used. For this case we have a check further down.\n */\n if ((attId->name)[-1]) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = parser->m_atts[i].name;\n return XML_ERROR_DUPLICATE_ATTRIBUTE;\n }\n (attId->name)[-1] = 1;\n appAtts[attIndex++] = attId->name;\n if (! parser->m_atts[i].normalized) {\n enum XML_Error result;\n XML_Bool isCdata = XML_TRUE;\n\n /* figure out whether declared as other than CDATA */\n if (attId->maybeTokenized) {\n int j;\n for (j = 0; j < nDefaultAtts; j++) {\n if (attId == elementType->defaultAtts[j].id) {\n isCdata = elementType->defaultAtts[j].isCdata;\n break;\n }\n }\n }\n\n /* normalize the attribute value */\n result = storeAttributeValue(\n parser, enc, isCdata, parser->m_atts[i].valuePtr,\n parser->m_atts[i].valueEnd, &parser->m_tempPool);\n if (result)\n return result;\n appAtts[attIndex] = poolStart(&parser->m_tempPool);\n poolFinish(&parser->m_tempPool);\n } else {\n /* the value did not need normalizing */\n appAtts[attIndex] = poolStoreString(&parser->m_tempPool, enc,\n parser->m_atts[i].valuePtr,\n parser->m_atts[i].valueEnd);\n if (appAtts[attIndex] == 0)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n }\n /* handle prefixed attribute names */\n if (attId->prefix) {\n if (attId->xmlns) {\n /* deal with namespace declarations here */\n enum XML_Error result = addBinding(parser, attId->prefix, attId,\n appAtts[attIndex], bindingsPtr);\n if (result)\n return result;\n --attIndex;\n } else {\n /* deal with other prefixed names later */\n attIndex++;\n nPrefixes++;\n (attId->name)[-1] = 2;\n }\n } else\n attIndex++;\n }\n\n /* set-up for XML_GetSpecifiedAttributeCount and XML_GetIdAttributeIndex */\n parser->m_nSpecifiedAtts = attIndex;\n if (elementType->idAtt && (elementType->idAtt->name)[-1]) {\n for (i = 0; i < attIndex; i += 2)\n if (appAtts[i] == elementType->idAtt->name) {\n parser->m_idAttIndex = i;\n break;\n }\n } else\n parser->m_idAttIndex = -1;\n\n /* do attribute defaulting */\n for (i = 0; i < nDefaultAtts; i++) {\n const DEFAULT_ATTRIBUTE *da = elementType->defaultAtts + i;\n if (! (da->id->name)[-1] && da->value) {\n if (da->id->prefix) {\n if (da->id->xmlns) {\n enum XML_Error result = addBinding(parser, da->id->prefix, da->id,\n da->value, bindingsPtr);\n if (result)\n return result;\n } else {\n (da->id->name)[-1] = 2;\n nPrefixes++;\n appAtts[attIndex++] = da->id->name;\n appAtts[attIndex++] = da->value;\n }\n } else {\n (da->id->name)[-1] = 1;\n appAtts[attIndex++] = da->id->name;\n appAtts[attIndex++] = da->value;\n }\n }\n }\n appAtts[attIndex] = 0;\n\n /* expand prefixed attribute names, check for duplicates,\n and clear flags that say whether attributes were specified */\n i = 0;\n if (nPrefixes) {\n int j; /* hash table index */\n unsigned long version = parser->m_nsAttsVersion;\n int nsAttsSize = (int)1 << parser->m_nsAttsPower;\n unsigned char oldNsAttsPower = parser->m_nsAttsPower;\n /* size of hash table must be at least 2 * (# of prefixed attributes) */\n if ((nPrefixes << 1)\n >> parser->m_nsAttsPower) { /* true for m_nsAttsPower = 0 */\n NS_ATT *temp;\n /* hash table size must also be a power of 2 and >= 8 */\n while (nPrefixes >> parser->m_nsAttsPower++)\n ;\n if (parser->m_nsAttsPower < 3)\n parser->m_nsAttsPower = 3;\n nsAttsSize = (int)1 << parser->m_nsAttsPower;\n temp = (NS_ATT *)REALLOC(parser, parser->m_nsAtts,\n nsAttsSize * sizeof(NS_ATT));\n if (! temp) {\n /* Restore actual size of memory in m_nsAtts */\n parser->m_nsAttsPower = oldNsAttsPower;\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_nsAtts = temp;\n version = 0; /* force re-initialization of m_nsAtts hash table */\n }\n /* using a version flag saves us from initializing m_nsAtts every time */\n if (! version) { /* initialize version flags when version wraps around */\n version = INIT_ATTS_VERSION;\n for (j = nsAttsSize; j != 0;)\n parser->m_nsAtts[--j].version = version;\n }\n parser->m_nsAttsVersion = --version;\n\n /* expand prefixed names and check for duplicates */\n for (; i < attIndex; i += 2) {\n const XML_Char *s = appAtts[i];\n if (s[-1] == 2) { /* prefixed */\n ATTRIBUTE_ID *id;\n const BINDING *b;\n unsigned long uriHash;\n struct siphash sip_state;\n struct sipkey sip_key;\n\n copy_salt_to_sipkey(parser, &sip_key);\n sip24_init(&sip_state, &sip_key);\n\n ((XML_Char *)s)[-1] = 0; /* clear flag */\n id = (ATTRIBUTE_ID *)lookup(parser, &dtd->attributeIds, s, 0);\n if (! id || ! id->prefix) {\n /* This code is walking through the appAtts array, dealing\n * with (in this case) a prefixed attribute name. To be in\n * the array, the attribute must have already been bound, so\n * has to have passed through the hash table lookup once\n * already. That implies that an entry for it already\n * exists, so the lookup above will return a pointer to\n * already allocated memory. There is no opportunaity for\n * the allocator to fail, so the condition above cannot be\n * fulfilled.\n *\n * Since it is difficult to be certain that the above\n * analysis is complete, we retain the test and merely\n * remove the code from coverage tests.\n */\n return XML_ERROR_NO_MEMORY; /* LCOV_EXCL_LINE */\n }\n b = id->prefix->binding;\n if (! b)\n return XML_ERROR_UNBOUND_PREFIX;\n\n for (j = 0; j < b->uriLen; j++) {\n const XML_Char c = b->uri[j];\n if (! poolAppendChar(&parser->m_tempPool, c))\n return XML_ERROR_NO_MEMORY;\n }\n\n sip24_update(&sip_state, b->uri, b->uriLen * sizeof(XML_Char));\n\n while (*s++ != XML_T(ASCII_COLON))\n ;\n\n sip24_update(&sip_state, s, keylen(s) * sizeof(XML_Char));\n\n do { /* copies null terminator */\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return XML_ERROR_NO_MEMORY;\n } while (*s++);\n\n uriHash = (unsigned long)sip24_final(&sip_state);\n\n { /* Check hash table for duplicate of expanded name (uriName).\n Derived from code in lookup(parser, HASH_TABLE *table, ...).\n */\n unsigned char step = 0;\n unsigned long mask = nsAttsSize - 1;\n j = uriHash & mask; /* index into hash table */\n while (parser->m_nsAtts[j].version == version) {\n /* for speed we compare stored hash values first */\n if (uriHash == parser->m_nsAtts[j].hash) {\n const XML_Char *s1 = poolStart(&parser->m_tempPool);\n const XML_Char *s2 = parser->m_nsAtts[j].uriName;\n /* s1 is null terminated, but not s2 */\n for (; *s1 == *s2 && *s1 != 0; s1++, s2++)\n ;\n if (*s1 == 0)\n return XML_ERROR_DUPLICATE_ATTRIBUTE;\n }\n if (! step)\n step = PROBE_STEP(uriHash, mask, parser->m_nsAttsPower);\n j < step ? (j += nsAttsSize - step) : (j -= step);\n }\n }\n\n if (parser->m_ns_triplets) { /* append namespace separator and prefix */\n parser->m_tempPool.ptr[-1] = parser->m_namespaceSeparator;\n s = b->prefix->name;\n do {\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return XML_ERROR_NO_MEMORY;\n } while (*s++);\n }\n\n /* store expanded name in attribute list */\n s = poolStart(&parser->m_tempPool);\n poolFinish(&parser->m_tempPool);\n appAtts[i] = s;\n\n /* fill empty slot with new version, uriName and hash value */\n parser->m_nsAtts[j].version = version;\n parser->m_nsAtts[j].hash = uriHash;\n parser->m_nsAtts[j].uriName = s;\n\n if (! --nPrefixes) {\n i += 2;\n break;\n }\n } else /* not prefixed */\n ((XML_Char *)s)[-1] = 0; /* clear flag */\n }\n }\n /* clear flags for the remaining attributes */\n for (; i < attIndex; i += 2)\n ((XML_Char *)(appAtts[i]))[-1] = 0;\n for (binding = *bindingsPtr; binding; binding = binding->nextTagBinding)\n binding->attId->name[-1] = 0;\n\n if (! parser->m_ns)\n return XML_ERROR_NONE;\n\n /* expand the element type name */\n if (elementType->prefix) {\n binding = elementType->prefix->binding;\n if (! binding)\n return XML_ERROR_UNBOUND_PREFIX;\n localPart = tagNamePtr->str;\n while (*localPart++ != XML_T(ASCII_COLON))\n ;\n } else if (dtd->defaultPrefix.binding) {\n binding = dtd->defaultPrefix.binding;\n localPart = tagNamePtr->str;\n } else\n return XML_ERROR_NONE;\n prefixLen = 0;\n if (parser->m_ns_triplets && binding->prefix->name) {\n for (; binding->prefix->name[prefixLen++];)\n ; /* prefixLen includes null terminator */\n }\n tagNamePtr->localPart = localPart;\n tagNamePtr->uriLen = binding->uriLen;\n tagNamePtr->prefix = binding->prefix->name;\n tagNamePtr->prefixLen = prefixLen;\n for (i = 0; localPart[i++];)\n ; /* i includes null terminator */\n n = i + binding->uriLen + prefixLen;\n if (n > binding->uriAlloc) {\n TAG *p;\n uri = (XML_Char *)MALLOC(parser, (n + EXPAND_SPARE) * sizeof(XML_Char));\n if (! uri)\n return XML_ERROR_NO_MEMORY;\n binding->uriAlloc = n + EXPAND_SPARE;\n memcpy(uri, binding->uri, binding->uriLen * sizeof(XML_Char));\n for (p = parser->m_tagStack; p; p = p->parent)\n if (p->name.str == binding->uri)\n p->name.str = uri;\n FREE(parser, binding->uri);\n binding->uri = uri;\n }\n /* if m_namespaceSeparator != '\\0' then uri includes it already */\n uri = binding->uri + binding->uriLen;\n memcpy(uri, localPart, i * sizeof(XML_Char));\n /* we always have a namespace separator between localPart and prefix */\n if (prefixLen) {\n uri += i - 1;\n *uri = parser->m_namespaceSeparator; /* replace null terminator */\n memcpy(uri + 1, binding->prefix->name, prefixLen * sizeof(XML_Char));\n }\n tagNamePtr->str = binding->uri;\n return XML_ERROR_NONE;\n}\n\n/* addBinding() overwrites the value of prefix->binding without checking.\n Therefore one must keep track of the old value outside of addBinding().\n*/\nstatic enum XML_Error\naddBinding(XML_Parser parser, PREFIX *prefix, const ATTRIBUTE_ID *attId,\n const XML_Char *uri, BINDING **bindingsPtr) {\n static const XML_Char xmlNamespace[]\n = {ASCII_h, ASCII_t, ASCII_t, ASCII_p, ASCII_COLON,\n ASCII_SLASH, ASCII_SLASH, ASCII_w, ASCII_w, ASCII_w,\n ASCII_PERIOD, ASCII_w, ASCII_3, ASCII_PERIOD, ASCII_o,\n ASCII_r, ASCII_g, ASCII_SLASH, ASCII_X, ASCII_M,\n ASCII_L, ASCII_SLASH, ASCII_1, ASCII_9, ASCII_9,\n ASCII_8, ASCII_SLASH, ASCII_n, ASCII_a, ASCII_m,\n ASCII_e, ASCII_s, ASCII_p, ASCII_a, ASCII_c,\n ASCII_e, '\\0'};\n static const int xmlLen = (int)sizeof(xmlNamespace) / sizeof(XML_Char) - 1;\n static const XML_Char xmlnsNamespace[]\n = {ASCII_h, ASCII_t, ASCII_t, ASCII_p, ASCII_COLON, ASCII_SLASH,\n ASCII_SLASH, ASCII_w, ASCII_w, ASCII_w, ASCII_PERIOD, ASCII_w,\n ASCII_3, ASCII_PERIOD, ASCII_o, ASCII_r, ASCII_g, ASCII_SLASH,\n ASCII_2, ASCII_0, ASCII_0, ASCII_0, ASCII_SLASH, ASCII_x,\n ASCII_m, ASCII_l, ASCII_n, ASCII_s, ASCII_SLASH, '\\0'};\n static const int xmlnsLen\n = (int)sizeof(xmlnsNamespace) / sizeof(XML_Char) - 1;\n\n XML_Bool mustBeXML = XML_FALSE;\n XML_Bool isXML = XML_TRUE;\n XML_Bool isXMLNS = XML_TRUE;\n\n BINDING *b;\n int len;\n\n /* empty URI is only valid for default namespace per XML NS 1.0 (not 1.1) */\n if (*uri == XML_T('\\0') && prefix->name)\n return XML_ERROR_UNDECLARING_PREFIX;\n\n if (prefix->name && prefix->name[0] == XML_T(ASCII_x)\n && prefix->name[1] == XML_T(ASCII_m)\n && prefix->name[2] == XML_T(ASCII_l)) {\n /* Not allowed to bind xmlns */\n if (prefix->name[3] == XML_T(ASCII_n) && prefix->name[4] == XML_T(ASCII_s)\n && prefix->name[5] == XML_T('\\0'))\n return XML_ERROR_RESERVED_PREFIX_XMLNS;\n\n if (prefix->name[3] == XML_T('\\0'))\n mustBeXML = XML_TRUE;\n }\n\n for (len = 0; uri[len]; len++) {\n if (isXML && (len > xmlLen || uri[len] != xmlNamespace[len]))\n isXML = XML_FALSE;\n\n if (! mustBeXML && isXMLNS\n && (len > xmlnsLen || uri[len] != xmlnsNamespace[len]))\n isXMLNS = XML_FALSE;\n }\n isXML = isXML && len == xmlLen;\n isXMLNS = isXMLNS && len == xmlnsLen;\n\n if (mustBeXML != isXML)\n return mustBeXML ? XML_ERROR_RESERVED_PREFIX_XML\n : XML_ERROR_RESERVED_NAMESPACE_URI;\n\n if (isXMLNS)\n return XML_ERROR_RESERVED_NAMESPACE_URI;\n\n if (parser->m_namespaceSeparator)\n len++;\n if (parser->m_freeBindingList) {\n b = parser->m_freeBindingList;\n if (len > b->uriAlloc) {\n XML_Char *temp = (XML_Char *)REALLOC(\n parser, b->uri, sizeof(XML_Char) * (len + EXPAND_SPARE));\n if (temp == NULL)\n return XML_ERROR_NO_MEMORY;\n b->uri = temp;\n b->uriAlloc = len + EXPAND_SPARE;\n }\n parser->m_freeBindingList = b->nextTagBinding;\n } else {\n b = (BINDING *)MALLOC(parser, sizeof(BINDING));\n if (! b)\n return XML_ERROR_NO_MEMORY;\n b->uri\n = (XML_Char *)MALLOC(parser, sizeof(XML_Char) * (len + EXPAND_SPARE));\n if (! b->uri) {\n FREE(parser, b);\n return XML_ERROR_NO_MEMORY;\n }\n b->uriAlloc = len + EXPAND_SPARE;\n }\n b->uriLen = len;\n memcpy(b->uri, uri, len * sizeof(XML_Char));\n if (parser->m_namespaceSeparator)\n b->uri[len - 1] = parser->m_namespaceSeparator;\n b->prefix = prefix;\n b->attId = attId;\n b->prevPrefixBinding = prefix->binding;\n /* NULL binding when default namespace undeclared */\n if (*uri == XML_T('\\0') && prefix == &parser->m_dtd->defaultPrefix)\n prefix->binding = NULL;\n else\n prefix->binding = b;\n b->nextTagBinding = *bindingsPtr;\n *bindingsPtr = b;\n /* if attId == NULL then we are not starting a namespace scope */\n if (attId && parser->m_startNamespaceDeclHandler)\n parser->m_startNamespaceDeclHandler(parser->m_handlerArg, prefix->name,\n prefix->binding ? uri : 0);\n return XML_ERROR_NONE;\n}\n\n/* The idea here is to avoid using stack for each CDATA section when\n the whole file is parsed with one call.\n*/\nstatic enum XML_Error PTRCALL\ncdataSectionProcessor(XML_Parser parser, const char *start, const char *end,\n const char **endPtr) {\n enum XML_Error result\n = doCdataSection(parser, parser->m_encoding, &start, end, endPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n if (result != XML_ERROR_NONE)\n return result;\n if (start) {\n if (parser->m_parentParser) { /* we are parsing an external entity */\n parser->m_processor = externalEntityContentProcessor;\n return externalEntityContentProcessor(parser, start, end, endPtr);\n } else {\n parser->m_processor = contentProcessor;\n return contentProcessor(parser, start, end, endPtr);\n }\n }\n return result;\n}\n\n/* startPtr gets set to non-null if the section is closed, and to null if\n the section is not yet closed.\n*/\nstatic enum XML_Error\ndoCdataSection(XML_Parser parser, const ENCODING *enc, const char **startPtr,\n const char *end, const char **nextPtr, XML_Bool haveMore) {\n const char *s = *startPtr;\n const char **eventPP;\n const char **eventEndPP;\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n *eventPP = s;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n }\n *eventPP = s;\n *startPtr = NULL;\n\n for (;;) {\n const char *next;\n int tok = XmlCdataSectionTok(enc, s, end, &next);\n *eventEndPP = next;\n switch (tok) {\n case XML_TOK_CDATA_SECT_CLOSE:\n if (parser->m_endCdataSectionHandler)\n parser->m_endCdataSectionHandler(parser->m_handlerArg);\n /* BEGIN disabled code */\n /* see comment under XML_TOK_CDATA_SECT_OPEN */\n else if (0 && parser->m_characterDataHandler)\n parser->m_characterDataHandler(parser->m_handlerArg, parser->m_dataBuf,\n 0);\n /* END disabled code */\n else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n *startPtr = next;\n *nextPtr = next;\n if (parser->m_parsingStatus.parsing == XML_FINISHED)\n return XML_ERROR_ABORTED;\n else\n return XML_ERROR_NONE;\n case XML_TOK_DATA_NEWLINE:\n if (parser->m_characterDataHandler) {\n XML_Char c = 0xA;\n parser->m_characterDataHandler(parser->m_handlerArg, &c, 1);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n break;\n case XML_TOK_DATA_CHARS: {\n XML_CharacterDataHandler charDataHandler = parser->m_characterDataHandler;\n if (charDataHandler) {\n if (MUST_CONVERT(enc, s)) {\n for (;;) {\n ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;\n const enum XML_Convert_Result convert_res = XmlConvert(\n enc, &s, next, &dataPtr, (ICHAR *)parser->m_dataBufEnd);\n *eventEndPP = next;\n charDataHandler(parser->m_handlerArg, parser->m_dataBuf,\n (int)(dataPtr - (ICHAR *)parser->m_dataBuf));\n if ((convert_res == XML_CONVERT_COMPLETED)\n || (convert_res == XML_CONVERT_INPUT_INCOMPLETE))\n break;\n *eventPP = s;\n }\n } else\n charDataHandler(parser->m_handlerArg, (XML_Char *)s,\n (int)((XML_Char *)next - (XML_Char *)s));\n } else if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n } break;\n case XML_TOK_INVALID:\n *eventPP = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_PARTIAL:\n case XML_TOK_NONE:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_UNCLOSED_CDATA_SECTION;\n default:\n /* Every token returned by XmlCdataSectionTok() has its own\n * explicit case, so this default case will never be executed.\n * We retain it as a safety net and exclude it from the coverage\n * statistics.\n *\n * LCOV_EXCL_START\n */\n *eventPP = next;\n return XML_ERROR_UNEXPECTED_STATE;\n /* LCOV_EXCL_STOP */\n }\n\n *eventPP = s = next;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:;\n }\n }\n /* not reached */\n}\n\n#ifdef XML_DTD\n\n/* The idea here is to avoid using stack for each IGNORE section when\n the whole file is parsed with one call.\n*/\nstatic enum XML_Error PTRCALL\nignoreSectionProcessor(XML_Parser parser, const char *start, const char *end,\n const char **endPtr) {\n enum XML_Error result\n = doIgnoreSection(parser, parser->m_encoding, &start, end, endPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n if (result != XML_ERROR_NONE)\n return result;\n if (start) {\n parser->m_processor = prologProcessor;\n return prologProcessor(parser, start, end, endPtr);\n }\n return result;\n}\n\n/* startPtr gets set to non-null is the section is closed, and to null\n if the section is not yet closed.\n*/\nstatic enum XML_Error\ndoIgnoreSection(XML_Parser parser, const ENCODING *enc, const char **startPtr,\n const char *end, const char **nextPtr, XML_Bool haveMore) {\n const char *next;\n int tok;\n const char *s = *startPtr;\n const char **eventPP;\n const char **eventEndPP;\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n *eventPP = s;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n /* It's not entirely clear, but it seems the following two lines\n * of code cannot be executed. The only occasions on which 'enc'\n * is not 'encoding' are when this function is called\n * from the internal entity processing, and IGNORE sections are an\n * error in internal entities.\n *\n * Since it really isn't clear that this is true, we keep the code\n * and just remove it from our coverage tests.\n *\n * LCOV_EXCL_START\n */\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n /* LCOV_EXCL_STOP */\n }\n *eventPP = s;\n *startPtr = NULL;\n tok = XmlIgnoreSectionTok(enc, s, end, &next);\n *eventEndPP = next;\n switch (tok) {\n case XML_TOK_IGNORE_SECT:\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n *startPtr = next;\n *nextPtr = next;\n if (parser->m_parsingStatus.parsing == XML_FINISHED)\n return XML_ERROR_ABORTED;\n else\n return XML_ERROR_NONE;\n case XML_TOK_INVALID:\n *eventPP = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_PARTIAL:\n case XML_TOK_NONE:\n if (haveMore) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_SYNTAX; /* XML_ERROR_UNCLOSED_IGNORE_SECTION */\n default:\n /* All of the tokens that XmlIgnoreSectionTok() returns have\n * explicit cases to handle them, so this default case is never\n * executed. We keep it as a safety net anyway, and remove it\n * from our test coverage statistics.\n *\n * LCOV_EXCL_START\n */\n *eventPP = next;\n return XML_ERROR_UNEXPECTED_STATE;\n /* LCOV_EXCL_STOP */\n }\n /* not reached */\n}\n\n#endif /* XML_DTD */\n\nstatic enum XML_Error\ninitializeEncoding(XML_Parser parser) {\n const char *s;\n#ifdef XML_UNICODE\n char encodingBuf[128];\n /* See comments abount `protoclEncodingName` in parserInit() */\n if (! parser->m_protocolEncodingName)\n s = NULL;\n else {\n int i;\n for (i = 0; parser->m_protocolEncodingName[i]; i++) {\n if (i == sizeof(encodingBuf) - 1\n || (parser->m_protocolEncodingName[i] & ~0x7f) != 0) {\n encodingBuf[0] = '\\0';\n break;\n }\n encodingBuf[i] = (char)parser->m_protocolEncodingName[i];\n }\n encodingBuf[i] = '\\0';\n s = encodingBuf;\n }\n#else\n s = parser->m_protocolEncodingName;\n#endif\n if ((parser->m_ns ? XmlInitEncodingNS : XmlInitEncoding)(\n &parser->m_initEncoding, &parser->m_encoding, s))\n return XML_ERROR_NONE;\n return handleUnknownEncoding(parser, parser->m_protocolEncodingName);\n}\n\nstatic enum XML_Error\nprocessXmlDecl(XML_Parser parser, int isGeneralTextEntity, const char *s,\n const char *next) {\n const char *encodingName = NULL;\n const XML_Char *storedEncName = NULL;\n const ENCODING *newEncoding = NULL;\n const char *version = NULL;\n const char *versionend;\n const XML_Char *storedversion = NULL;\n int standalone = -1;\n if (! (parser->m_ns ? XmlParseXmlDeclNS : XmlParseXmlDecl)(\n isGeneralTextEntity, parser->m_encoding, s, next, &parser->m_eventPtr,\n &version, &versionend, &encodingName, &newEncoding, &standalone)) {\n if (isGeneralTextEntity)\n return XML_ERROR_TEXT_DECL;\n else\n return XML_ERROR_XML_DECL;\n }\n if (! isGeneralTextEntity && standalone == 1) {\n parser->m_dtd->standalone = XML_TRUE;\n#ifdef XML_DTD\n if (parser->m_paramEntityParsing\n == XML_PARAM_ENTITY_PARSING_UNLESS_STANDALONE)\n parser->m_paramEntityParsing = XML_PARAM_ENTITY_PARSING_NEVER;\n#endif /* XML_DTD */\n }\n if (parser->m_xmlDeclHandler) {\n if (encodingName != NULL) {\n storedEncName = poolStoreString(\n &parser->m_temp2Pool, parser->m_encoding, encodingName,\n encodingName + XmlNameLength(parser->m_encoding, encodingName));\n if (! storedEncName)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_temp2Pool);\n }\n if (version) {\n storedversion\n = poolStoreString(&parser->m_temp2Pool, parser->m_encoding, version,\n versionend - parser->m_encoding->minBytesPerChar);\n if (! storedversion)\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_xmlDeclHandler(parser->m_handlerArg, storedversion, storedEncName,\n standalone);\n } else if (parser->m_defaultHandler)\n reportDefault(parser, parser->m_encoding, s, next);\n if (parser->m_protocolEncodingName == NULL) {\n if (newEncoding) {\n /* Check that the specified encoding does not conflict with what\n * the parser has already deduced. Do we have the same number\n * of bytes in the smallest representation of a character? If\n * this is UTF-16, is it the same endianness?\n */\n if (newEncoding->minBytesPerChar != parser->m_encoding->minBytesPerChar\n || (newEncoding->minBytesPerChar == 2\n && newEncoding != parser->m_encoding)) {\n parser->m_eventPtr = encodingName;\n return XML_ERROR_INCORRECT_ENCODING;\n }\n parser->m_encoding = newEncoding;\n } else if (encodingName) {\n enum XML_Error result;\n if (! storedEncName) {\n storedEncName = poolStoreString(\n &parser->m_temp2Pool, parser->m_encoding, encodingName,\n encodingName + XmlNameLength(parser->m_encoding, encodingName));\n if (! storedEncName)\n return XML_ERROR_NO_MEMORY;\n }\n result = handleUnknownEncoding(parser, storedEncName);\n poolClear(&parser->m_temp2Pool);\n if (result == XML_ERROR_UNKNOWN_ENCODING)\n parser->m_eventPtr = encodingName;\n return result;\n }\n }\n\n if (storedEncName || storedversion)\n poolClear(&parser->m_temp2Pool);\n\n return XML_ERROR_NONE;\n}\n\nstatic enum XML_Error\nhandleUnknownEncoding(XML_Parser parser, const XML_Char *encodingName) {\n if (parser->m_unknownEncodingHandler) {\n XML_Encoding info;\n int i;\n for (i = 0; i < 256; i++)\n info.map[i] = -1;\n info.convert = NULL;\n info.data = NULL;\n info.release = NULL;\n if (parser->m_unknownEncodingHandler(parser->m_unknownEncodingHandlerData,\n encodingName, &info)) {\n ENCODING *enc;\n parser->m_unknownEncodingMem = MALLOC(parser, XmlSizeOfUnknownEncoding());\n if (! parser->m_unknownEncodingMem) {\n if (info.release)\n info.release(info.data);\n return XML_ERROR_NO_MEMORY;\n }\n enc = (parser->m_ns ? XmlInitUnknownEncodingNS : XmlInitUnknownEncoding)(\n parser->m_unknownEncodingMem, info.map, info.convert, info.data);\n if (enc) {\n parser->m_unknownEncodingData = info.data;\n parser->m_unknownEncodingRelease = info.release;\n parser->m_encoding = enc;\n return XML_ERROR_NONE;\n }\n }\n if (info.release != NULL)\n info.release(info.data);\n }\n return XML_ERROR_UNKNOWN_ENCODING;\n}\n\nstatic enum XML_Error PTRCALL\nprologInitProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n enum XML_Error result = initializeEncoding(parser);\n if (result != XML_ERROR_NONE)\n return result;\n parser->m_processor = prologProcessor;\n return prologProcessor(parser, s, end, nextPtr);\n}\n\n#ifdef XML_DTD\n\nstatic enum XML_Error PTRCALL\nexternalParEntInitProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n enum XML_Error result = initializeEncoding(parser);\n if (result != XML_ERROR_NONE)\n return result;\n\n /* we know now that XML_Parse(Buffer) has been called,\n so we consider the external parameter entity read */\n parser->m_dtd->paramEntityRead = XML_TRUE;\n\n if (parser->m_prologState.inEntityValue) {\n parser->m_processor = entityValueInitProcessor;\n return entityValueInitProcessor(parser, s, end, nextPtr);\n } else {\n parser->m_processor = externalParEntProcessor;\n return externalParEntProcessor(parser, s, end, nextPtr);\n }\n}\n\nstatic enum XML_Error PTRCALL\nentityValueInitProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n int tok;\n const char *start = s;\n const char *next = start;\n parser->m_eventPtr = start;\n\n for (;;) {\n tok = XmlPrologTok(parser->m_encoding, start, end, &next);\n parser->m_eventEndPtr = next;\n if (tok <= 0) {\n if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_NONE: /* start == end */\n default:\n break;\n }\n /* found end of entity value - can store it now */\n return storeEntityValue(parser, parser->m_encoding, s, end);\n } else if (tok == XML_TOK_XML_DECL) {\n enum XML_Error result;\n result = processXmlDecl(parser, 0, start, next);\n if (result != XML_ERROR_NONE)\n return result;\n /* At this point, m_parsingStatus.parsing cannot be XML_SUSPENDED. For\n * that to happen, a parameter entity parsing handler must have attempted\n * to suspend the parser, which fails and raises an error. The parser can\n * be aborted, but can't be suspended.\n */\n if (parser->m_parsingStatus.parsing == XML_FINISHED)\n return XML_ERROR_ABORTED;\n *nextPtr = next;\n /* stop scanning for text declaration - we found one */\n parser->m_processor = entityValueProcessor;\n return entityValueProcessor(parser, next, end, nextPtr);\n }\n /* If we are at the end of the buffer, this would cause XmlPrologTok to\n return XML_TOK_NONE on the next call, which would then cause the\n function to exit with *nextPtr set to s - that is what we want for other\n tokens, but not for the BOM - we would rather like to skip it;\n then, when this routine is entered the next time, XmlPrologTok will\n return XML_TOK_INVALID, since the BOM is still in the buffer\n */\n else if (tok == XML_TOK_BOM && next == end\n && ! parser->m_parsingStatus.finalBuffer) {\n *nextPtr = next;\n return XML_ERROR_NONE;\n }\n /* If we get this token, we have the start of what might be a\n normal tag, but not a declaration (i.e. it doesn't begin with\n \"m_eventPtr = start;\n }\n}\n\nstatic enum XML_Error PTRCALL\nexternalParEntProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n const char *next = s;\n int tok;\n\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n if (tok <= 0) {\n if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_NONE: /* start == end */\n default:\n break;\n }\n }\n /* This would cause the next stage, i.e. doProlog to be passed XML_TOK_BOM.\n However, when parsing an external subset, doProlog will not accept a BOM\n as valid, and report a syntax error, so we have to skip the BOM\n */\n else if (tok == XML_TOK_BOM) {\n s = next;\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n }\n\n parser->m_processor = prologProcessor;\n return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE);\n}\n\nstatic enum XML_Error PTRCALL\nentityValueProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n const char *start = s;\n const char *next = s;\n const ENCODING *enc = parser->m_encoding;\n int tok;\n\n for (;;) {\n tok = XmlPrologTok(enc, start, end, &next);\n if (tok <= 0) {\n if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_NONE: /* start == end */\n default:\n break;\n }\n /* found end of entity value - can store it now */\n return storeEntityValue(parser, enc, s, end);\n }\n start = next;\n }\n}\n\n#endif /* XML_DTD */\n\nstatic enum XML_Error PTRCALL\nprologProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n const char *next = s;\n int tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE);\n}\n\nstatic enum XML_Error\ndoProlog(XML_Parser parser, const ENCODING *enc, const char *s, const char *end,\n int tok, const char *next, const char **nextPtr, XML_Bool haveMore,\n XML_Bool allowClosingDoctype) {\n#ifdef XML_DTD\n static const XML_Char externalSubsetName[] = {ASCII_HASH, '\\0'};\n#endif /* XML_DTD */\n static const XML_Char atypeCDATA[]\n = {ASCII_C, ASCII_D, ASCII_A, ASCII_T, ASCII_A, '\\0'};\n static const XML_Char atypeID[] = {ASCII_I, ASCII_D, '\\0'};\n static const XML_Char atypeIDREF[]\n = {ASCII_I, ASCII_D, ASCII_R, ASCII_E, ASCII_F, '\\0'};\n static const XML_Char atypeIDREFS[]\n = {ASCII_I, ASCII_D, ASCII_R, ASCII_E, ASCII_F, ASCII_S, '\\0'};\n static const XML_Char atypeENTITY[]\n = {ASCII_E, ASCII_N, ASCII_T, ASCII_I, ASCII_T, ASCII_Y, '\\0'};\n static const XML_Char atypeENTITIES[]\n = {ASCII_E, ASCII_N, ASCII_T, ASCII_I, ASCII_T,\n ASCII_I, ASCII_E, ASCII_S, '\\0'};\n static const XML_Char atypeNMTOKEN[]\n = {ASCII_N, ASCII_M, ASCII_T, ASCII_O, ASCII_K, ASCII_E, ASCII_N, '\\0'};\n static const XML_Char atypeNMTOKENS[]\n = {ASCII_N, ASCII_M, ASCII_T, ASCII_O, ASCII_K,\n ASCII_E, ASCII_N, ASCII_S, '\\0'};\n static const XML_Char notationPrefix[]\n = {ASCII_N, ASCII_O, ASCII_T, ASCII_A, ASCII_T,\n ASCII_I, ASCII_O, ASCII_N, ASCII_LPAREN, '\\0'};\n static const XML_Char enumValueSep[] = {ASCII_PIPE, '\\0'};\n static const XML_Char enumValueStart[] = {ASCII_LPAREN, '\\0'};\n\n /* save one level of indirection */\n DTD *const dtd = parser->m_dtd;\n\n const char **eventPP;\n const char **eventEndPP;\n enum XML_Content_Quant quant;\n\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n }\n\n for (;;) {\n int role;\n XML_Bool handleDefault = XML_TRUE;\n *eventPP = s;\n *eventEndPP = next;\n if (tok <= 0) {\n if (haveMore && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n *eventPP = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case -XML_TOK_PROLOG_S:\n tok = -tok;\n break;\n case XML_TOK_NONE:\n#ifdef XML_DTD\n /* for internal PE NOT referenced between declarations */\n if (enc != parser->m_encoding\n && ! parser->m_openInternalEntities->betweenDecl) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n /* WFC: PE Between Declarations - must check that PE contains\n complete markup, not only for external PEs, but also for\n internal PEs if the reference occurs between declarations.\n */\n if (parser->m_isParamEntity || enc != parser->m_encoding) {\n if (XmlTokenRole(&parser->m_prologState, XML_TOK_NONE, end, end, enc)\n == XML_ROLE_ERROR)\n return XML_ERROR_INCOMPLETE_PE;\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n#endif /* XML_DTD */\n return XML_ERROR_NO_ELEMENTS;\n default:\n tok = -tok;\n next = end;\n break;\n }\n }\n role = XmlTokenRole(&parser->m_prologState, tok, s, next, enc);\n switch (role) {\n case XML_ROLE_XML_DECL: {\n enum XML_Error result = processXmlDecl(parser, 0, s, next);\n if (result != XML_ERROR_NONE)\n return result;\n enc = parser->m_encoding;\n handleDefault = XML_FALSE;\n } break;\n case XML_ROLE_DOCTYPE_NAME:\n if (parser->m_startDoctypeDeclHandler) {\n parser->m_doctypeName\n = poolStoreString(&parser->m_tempPool, enc, s, next);\n if (! parser->m_doctypeName)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n parser->m_doctypePubid = NULL;\n handleDefault = XML_FALSE;\n }\n parser->m_doctypeSysid = NULL; /* always initialize to NULL */\n break;\n case XML_ROLE_DOCTYPE_INTERNAL_SUBSET:\n if (parser->m_startDoctypeDeclHandler) {\n parser->m_startDoctypeDeclHandler(\n parser->m_handlerArg, parser->m_doctypeName, parser->m_doctypeSysid,\n parser->m_doctypePubid, 1);\n parser->m_doctypeName = NULL;\n poolClear(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n break;\n#ifdef XML_DTD\n case XML_ROLE_TEXT_DECL: {\n enum XML_Error result = processXmlDecl(parser, 1, s, next);\n if (result != XML_ERROR_NONE)\n return result;\n enc = parser->m_encoding;\n handleDefault = XML_FALSE;\n } break;\n#endif /* XML_DTD */\n case XML_ROLE_DOCTYPE_PUBLIC_ID:\n#ifdef XML_DTD\n parser->m_useForeignDTD = XML_FALSE;\n parser->m_declEntity = (ENTITY *)lookup(\n parser, &dtd->paramEntities, externalSubsetName, sizeof(ENTITY));\n if (! parser->m_declEntity)\n return XML_ERROR_NO_MEMORY;\n#endif /* XML_DTD */\n dtd->hasParamEntityRefs = XML_TRUE;\n if (parser->m_startDoctypeDeclHandler) {\n XML_Char *pubId;\n if (! XmlIsPublicId(enc, s, next, eventPP))\n return XML_ERROR_PUBLICID;\n pubId = poolStoreString(&parser->m_tempPool, enc,\n s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! pubId)\n return XML_ERROR_NO_MEMORY;\n normalizePublicId(pubId);\n poolFinish(&parser->m_tempPool);\n parser->m_doctypePubid = pubId;\n handleDefault = XML_FALSE;\n goto alreadyChecked;\n }\n /* fall through */\n case XML_ROLE_ENTITY_PUBLIC_ID:\n if (! XmlIsPublicId(enc, s, next, eventPP))\n return XML_ERROR_PUBLICID;\n alreadyChecked:\n if (dtd->keepProcessing && parser->m_declEntity) {\n XML_Char *tem\n = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! tem)\n return XML_ERROR_NO_MEMORY;\n normalizePublicId(tem);\n parser->m_declEntity->publicId = tem;\n poolFinish(&dtd->pool);\n /* Don't suppress the default handler if we fell through from\n * the XML_ROLE_DOCTYPE_PUBLIC_ID case.\n */\n if (parser->m_entityDeclHandler && role == XML_ROLE_ENTITY_PUBLIC_ID)\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_DOCTYPE_CLOSE:\n if (allowClosingDoctype != XML_TRUE) {\n /* Must not close doctype from within expanded parameter entities */\n return XML_ERROR_INVALID_TOKEN;\n }\n\n if (parser->m_doctypeName) {\n parser->m_startDoctypeDeclHandler(\n parser->m_handlerArg, parser->m_doctypeName, parser->m_doctypeSysid,\n parser->m_doctypePubid, 0);\n poolClear(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n /* parser->m_doctypeSysid will be non-NULL in the case of a previous\n XML_ROLE_DOCTYPE_SYSTEM_ID, even if parser->m_startDoctypeDeclHandler\n was not set, indicating an external subset\n */\n#ifdef XML_DTD\n if (parser->m_doctypeSysid || parser->m_useForeignDTD) {\n XML_Bool hadParamEntityRefs = dtd->hasParamEntityRefs;\n dtd->hasParamEntityRefs = XML_TRUE;\n if (parser->m_paramEntityParsing\n && parser->m_externalEntityRefHandler) {\n ENTITY *entity = (ENTITY *)lookup(parser, &dtd->paramEntities,\n externalSubsetName, sizeof(ENTITY));\n if (! entity) {\n /* The external subset name \"#\" will have already been\n * inserted into the hash table at the start of the\n * external entity parsing, so no allocation will happen\n * and lookup() cannot fail.\n */\n return XML_ERROR_NO_MEMORY; /* LCOV_EXCL_LINE */\n }\n if (parser->m_useForeignDTD)\n entity->base = parser->m_curBase;\n dtd->paramEntityRead = XML_FALSE;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, 0, entity->base,\n entity->systemId, entity->publicId))\n return XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n if (dtd->paramEntityRead) {\n if (! dtd->standalone && parser->m_notStandaloneHandler\n && ! parser->m_notStandaloneHandler(parser->m_handlerArg))\n return XML_ERROR_NOT_STANDALONE;\n }\n /* if we didn't read the foreign DTD then this means that there\n is no external subset and we must reset dtd->hasParamEntityRefs\n */\n else if (! parser->m_doctypeSysid)\n dtd->hasParamEntityRefs = hadParamEntityRefs;\n /* end of DTD - no need to update dtd->keepProcessing */\n }\n parser->m_useForeignDTD = XML_FALSE;\n }\n#endif /* XML_DTD */\n if (parser->m_endDoctypeDeclHandler) {\n parser->m_endDoctypeDeclHandler(parser->m_handlerArg);\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_INSTANCE_START:\n#ifdef XML_DTD\n /* if there is no DOCTYPE declaration then now is the\n last chance to read the foreign DTD\n */\n if (parser->m_useForeignDTD) {\n XML_Bool hadParamEntityRefs = dtd->hasParamEntityRefs;\n dtd->hasParamEntityRefs = XML_TRUE;\n if (parser->m_paramEntityParsing\n && parser->m_externalEntityRefHandler) {\n ENTITY *entity = (ENTITY *)lookup(parser, &dtd->paramEntities,\n externalSubsetName, sizeof(ENTITY));\n if (! entity)\n return XML_ERROR_NO_MEMORY;\n entity->base = parser->m_curBase;\n dtd->paramEntityRead = XML_FALSE;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, 0, entity->base,\n entity->systemId, entity->publicId))\n return XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n if (dtd->paramEntityRead) {\n if (! dtd->standalone && parser->m_notStandaloneHandler\n && ! parser->m_notStandaloneHandler(parser->m_handlerArg))\n return XML_ERROR_NOT_STANDALONE;\n }\n /* if we didn't read the foreign DTD then this means that there\n is no external subset and we must reset dtd->hasParamEntityRefs\n */\n else\n dtd->hasParamEntityRefs = hadParamEntityRefs;\n /* end of DTD - no need to update dtd->keepProcessing */\n }\n }\n#endif /* XML_DTD */\n parser->m_processor = contentProcessor;\n return contentProcessor(parser, s, end, nextPtr);\n case XML_ROLE_ATTLIST_ELEMENT_NAME:\n parser->m_declElementType = getElementType(parser, enc, s, next);\n if (! parser->m_declElementType)\n return XML_ERROR_NO_MEMORY;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_NAME:\n parser->m_declAttributeId = getAttributeId(parser, enc, s, next);\n if (! parser->m_declAttributeId)\n return XML_ERROR_NO_MEMORY;\n parser->m_declAttributeIsCdata = XML_FALSE;\n parser->m_declAttributeType = NULL;\n parser->m_declAttributeIsId = XML_FALSE;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_CDATA:\n parser->m_declAttributeIsCdata = XML_TRUE;\n parser->m_declAttributeType = atypeCDATA;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_ID:\n parser->m_declAttributeIsId = XML_TRUE;\n parser->m_declAttributeType = atypeID;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_IDREF:\n parser->m_declAttributeType = atypeIDREF;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_IDREFS:\n parser->m_declAttributeType = atypeIDREFS;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_ENTITY:\n parser->m_declAttributeType = atypeENTITY;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_ENTITIES:\n parser->m_declAttributeType = atypeENTITIES;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_NMTOKEN:\n parser->m_declAttributeType = atypeNMTOKEN;\n goto checkAttListDeclHandler;\n case XML_ROLE_ATTRIBUTE_TYPE_NMTOKENS:\n parser->m_declAttributeType = atypeNMTOKENS;\n checkAttListDeclHandler:\n if (dtd->keepProcessing && parser->m_attlistDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_ATTRIBUTE_ENUM_VALUE:\n case XML_ROLE_ATTRIBUTE_NOTATION_VALUE:\n if (dtd->keepProcessing && parser->m_attlistDeclHandler) {\n const XML_Char *prefix;\n if (parser->m_declAttributeType) {\n prefix = enumValueSep;\n } else {\n prefix = (role == XML_ROLE_ATTRIBUTE_NOTATION_VALUE ? notationPrefix\n : enumValueStart);\n }\n if (! poolAppendString(&parser->m_tempPool, prefix))\n return XML_ERROR_NO_MEMORY;\n if (! poolAppend(&parser->m_tempPool, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n parser->m_declAttributeType = parser->m_tempPool.start;\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_IMPLIED_ATTRIBUTE_VALUE:\n case XML_ROLE_REQUIRED_ATTRIBUTE_VALUE:\n if (dtd->keepProcessing) {\n if (! defineAttribute(parser->m_declElementType,\n parser->m_declAttributeId,\n parser->m_declAttributeIsCdata,\n parser->m_declAttributeIsId, 0, parser))\n return XML_ERROR_NO_MEMORY;\n if (parser->m_attlistDeclHandler && parser->m_declAttributeType) {\n if (*parser->m_declAttributeType == XML_T(ASCII_LPAREN)\n || (*parser->m_declAttributeType == XML_T(ASCII_N)\n && parser->m_declAttributeType[1] == XML_T(ASCII_O))) {\n /* Enumerated or Notation type */\n if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_RPAREN))\n || ! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_ERROR_NO_MEMORY;\n parser->m_declAttributeType = parser->m_tempPool.start;\n poolFinish(&parser->m_tempPool);\n }\n *eventEndPP = s;\n parser->m_attlistDeclHandler(\n parser->m_handlerArg, parser->m_declElementType->name,\n parser->m_declAttributeId->name, parser->m_declAttributeType, 0,\n role == XML_ROLE_REQUIRED_ATTRIBUTE_VALUE);\n poolClear(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n }\n break;\n case XML_ROLE_DEFAULT_ATTRIBUTE_VALUE:\n case XML_ROLE_FIXED_ATTRIBUTE_VALUE:\n if (dtd->keepProcessing) {\n const XML_Char *attVal;\n enum XML_Error result = storeAttributeValue(\n parser, enc, parser->m_declAttributeIsCdata,\n s + enc->minBytesPerChar, next - enc->minBytesPerChar, &dtd->pool);\n if (result)\n return result;\n attVal = poolStart(&dtd->pool);\n poolFinish(&dtd->pool);\n /* ID attributes aren't allowed to have a default */\n if (! defineAttribute(\n parser->m_declElementType, parser->m_declAttributeId,\n parser->m_declAttributeIsCdata, XML_FALSE, attVal, parser))\n return XML_ERROR_NO_MEMORY;\n if (parser->m_attlistDeclHandler && parser->m_declAttributeType) {\n if (*parser->m_declAttributeType == XML_T(ASCII_LPAREN)\n || (*parser->m_declAttributeType == XML_T(ASCII_N)\n && parser->m_declAttributeType[1] == XML_T(ASCII_O))) {\n /* Enumerated or Notation type */\n if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_RPAREN))\n || ! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_ERROR_NO_MEMORY;\n parser->m_declAttributeType = parser->m_tempPool.start;\n poolFinish(&parser->m_tempPool);\n }\n *eventEndPP = s;\n parser->m_attlistDeclHandler(\n parser->m_handlerArg, parser->m_declElementType->name,\n parser->m_declAttributeId->name, parser->m_declAttributeType,\n attVal, role == XML_ROLE_FIXED_ATTRIBUTE_VALUE);\n poolClear(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n }\n break;\n case XML_ROLE_ENTITY_VALUE:\n if (dtd->keepProcessing) {\n enum XML_Error result = storeEntityValue(\n parser, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar);\n if (parser->m_declEntity) {\n parser->m_declEntity->textPtr = poolStart(&dtd->entityValuePool);\n parser->m_declEntity->textLen\n = (int)(poolLength(&dtd->entityValuePool));\n poolFinish(&dtd->entityValuePool);\n if (parser->m_entityDeclHandler) {\n *eventEndPP = s;\n parser->m_entityDeclHandler(\n parser->m_handlerArg, parser->m_declEntity->name,\n parser->m_declEntity->is_param, parser->m_declEntity->textPtr,\n parser->m_declEntity->textLen, parser->m_curBase, 0, 0, 0);\n handleDefault = XML_FALSE;\n }\n } else\n poolDiscard(&dtd->entityValuePool);\n if (result != XML_ERROR_NONE)\n return result;\n }\n break;\n case XML_ROLE_DOCTYPE_SYSTEM_ID:\n#ifdef XML_DTD\n parser->m_useForeignDTD = XML_FALSE;\n#endif /* XML_DTD */\n dtd->hasParamEntityRefs = XML_TRUE;\n if (parser->m_startDoctypeDeclHandler) {\n parser->m_doctypeSysid = poolStoreString(&parser->m_tempPool, enc,\n s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (parser->m_doctypeSysid == NULL)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n#ifdef XML_DTD\n else\n /* use externalSubsetName to make parser->m_doctypeSysid non-NULL\n for the case where no parser->m_startDoctypeDeclHandler is set */\n parser->m_doctypeSysid = externalSubsetName;\n#endif /* XML_DTD */\n if (! dtd->standalone\n#ifdef XML_DTD\n && ! parser->m_paramEntityParsing\n#endif /* XML_DTD */\n && parser->m_notStandaloneHandler\n && ! parser->m_notStandaloneHandler(parser->m_handlerArg))\n return XML_ERROR_NOT_STANDALONE;\n#ifndef XML_DTD\n break;\n#else /* XML_DTD */\n if (! parser->m_declEntity) {\n parser->m_declEntity = (ENTITY *)lookup(\n parser, &dtd->paramEntities, externalSubsetName, sizeof(ENTITY));\n if (! parser->m_declEntity)\n return XML_ERROR_NO_MEMORY;\n parser->m_declEntity->publicId = NULL;\n }\n#endif /* XML_DTD */\n /* fall through */\n case XML_ROLE_ENTITY_SYSTEM_ID:\n if (dtd->keepProcessing && parser->m_declEntity) {\n parser->m_declEntity->systemId\n = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! parser->m_declEntity->systemId)\n return XML_ERROR_NO_MEMORY;\n parser->m_declEntity->base = parser->m_curBase;\n poolFinish(&dtd->pool);\n /* Don't suppress the default handler if we fell through from\n * the XML_ROLE_DOCTYPE_SYSTEM_ID case.\n */\n if (parser->m_entityDeclHandler && role == XML_ROLE_ENTITY_SYSTEM_ID)\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_ENTITY_COMPLETE:\n if (dtd->keepProcessing && parser->m_declEntity\n && parser->m_entityDeclHandler) {\n *eventEndPP = s;\n parser->m_entityDeclHandler(\n parser->m_handlerArg, parser->m_declEntity->name,\n parser->m_declEntity->is_param, 0, 0, parser->m_declEntity->base,\n parser->m_declEntity->systemId, parser->m_declEntity->publicId, 0);\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_ENTITY_NOTATION_NAME:\n if (dtd->keepProcessing && parser->m_declEntity) {\n parser->m_declEntity->notation\n = poolStoreString(&dtd->pool, enc, s, next);\n if (! parser->m_declEntity->notation)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&dtd->pool);\n if (parser->m_unparsedEntityDeclHandler) {\n *eventEndPP = s;\n parser->m_unparsedEntityDeclHandler(\n parser->m_handlerArg, parser->m_declEntity->name,\n parser->m_declEntity->base, parser->m_declEntity->systemId,\n parser->m_declEntity->publicId, parser->m_declEntity->notation);\n handleDefault = XML_FALSE;\n } else if (parser->m_entityDeclHandler) {\n *eventEndPP = s;\n parser->m_entityDeclHandler(\n parser->m_handlerArg, parser->m_declEntity->name, 0, 0, 0,\n parser->m_declEntity->base, parser->m_declEntity->systemId,\n parser->m_declEntity->publicId, parser->m_declEntity->notation);\n handleDefault = XML_FALSE;\n }\n }\n break;\n case XML_ROLE_GENERAL_ENTITY_NAME: {\n if (XmlPredefinedEntityName(enc, s, next)) {\n parser->m_declEntity = NULL;\n break;\n }\n if (dtd->keepProcessing) {\n const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n parser->m_declEntity = (ENTITY *)lookup(parser, &dtd->generalEntities,\n name, sizeof(ENTITY));\n if (! parser->m_declEntity)\n return XML_ERROR_NO_MEMORY;\n if (parser->m_declEntity->name != name) {\n poolDiscard(&dtd->pool);\n parser->m_declEntity = NULL;\n } else {\n poolFinish(&dtd->pool);\n parser->m_declEntity->publicId = NULL;\n parser->m_declEntity->is_param = XML_FALSE;\n /* if we have a parent parser or are reading an internal parameter\n entity, then the entity declaration is not considered \"internal\"\n */\n parser->m_declEntity->is_internal\n = ! (parser->m_parentParser || parser->m_openInternalEntities);\n if (parser->m_entityDeclHandler)\n handleDefault = XML_FALSE;\n }\n } else {\n poolDiscard(&dtd->pool);\n parser->m_declEntity = NULL;\n }\n } break;\n case XML_ROLE_PARAM_ENTITY_NAME:\n#ifdef XML_DTD\n if (dtd->keepProcessing) {\n const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n parser->m_declEntity = (ENTITY *)lookup(parser, &dtd->paramEntities,\n name, sizeof(ENTITY));\n if (! parser->m_declEntity)\n return XML_ERROR_NO_MEMORY;\n if (parser->m_declEntity->name != name) {\n poolDiscard(&dtd->pool);\n parser->m_declEntity = NULL;\n } else {\n poolFinish(&dtd->pool);\n parser->m_declEntity->publicId = NULL;\n parser->m_declEntity->is_param = XML_TRUE;\n /* if we have a parent parser or are reading an internal parameter\n entity, then the entity declaration is not considered \"internal\"\n */\n parser->m_declEntity->is_internal\n = ! (parser->m_parentParser || parser->m_openInternalEntities);\n if (parser->m_entityDeclHandler)\n handleDefault = XML_FALSE;\n }\n } else {\n poolDiscard(&dtd->pool);\n parser->m_declEntity = NULL;\n }\n#else /* not XML_DTD */\n parser->m_declEntity = NULL;\n#endif /* XML_DTD */\n break;\n case XML_ROLE_NOTATION_NAME:\n parser->m_declNotationPublicId = NULL;\n parser->m_declNotationName = NULL;\n if (parser->m_notationDeclHandler) {\n parser->m_declNotationName\n = poolStoreString(&parser->m_tempPool, enc, s, next);\n if (! parser->m_declNotationName)\n return XML_ERROR_NO_MEMORY;\n poolFinish(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_NOTATION_PUBLIC_ID:\n if (! XmlIsPublicId(enc, s, next, eventPP))\n return XML_ERROR_PUBLICID;\n if (parser\n ->m_declNotationName) { /* means m_notationDeclHandler != NULL */\n XML_Char *tem = poolStoreString(&parser->m_tempPool, enc,\n s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! tem)\n return XML_ERROR_NO_MEMORY;\n normalizePublicId(tem);\n parser->m_declNotationPublicId = tem;\n poolFinish(&parser->m_tempPool);\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_NOTATION_SYSTEM_ID:\n if (parser->m_declNotationName && parser->m_notationDeclHandler) {\n const XML_Char *systemId = poolStoreString(&parser->m_tempPool, enc,\n s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! systemId)\n return XML_ERROR_NO_MEMORY;\n *eventEndPP = s;\n parser->m_notationDeclHandler(\n parser->m_handlerArg, parser->m_declNotationName, parser->m_curBase,\n systemId, parser->m_declNotationPublicId);\n handleDefault = XML_FALSE;\n }\n poolClear(&parser->m_tempPool);\n break;\n case XML_ROLE_NOTATION_NO_SYSTEM_ID:\n if (parser->m_declNotationPublicId && parser->m_notationDeclHandler) {\n *eventEndPP = s;\n parser->m_notationDeclHandler(\n parser->m_handlerArg, parser->m_declNotationName, parser->m_curBase,\n 0, parser->m_declNotationPublicId);\n handleDefault = XML_FALSE;\n }\n poolClear(&parser->m_tempPool);\n break;\n case XML_ROLE_ERROR:\n switch (tok) {\n case XML_TOK_PARAM_ENTITY_REF:\n /* PE references in internal subset are\n not allowed within declarations. */\n return XML_ERROR_PARAM_ENTITY_REF;\n case XML_TOK_XML_DECL:\n return XML_ERROR_MISPLACED_XML_PI;\n default:\n return XML_ERROR_SYNTAX;\n }\n#ifdef XML_DTD\n case XML_ROLE_IGNORE_SECT: {\n enum XML_Error result;\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n handleDefault = XML_FALSE;\n result = doIgnoreSection(parser, enc, &next, end, nextPtr, haveMore);\n if (result != XML_ERROR_NONE)\n return result;\n else if (! next) {\n parser->m_processor = ignoreSectionProcessor;\n return result;\n }\n } break;\n#endif /* XML_DTD */\n case XML_ROLE_GROUP_OPEN:\n if (parser->m_prologState.level >= parser->m_groupSize) {\n if (parser->m_groupSize) {\n {\n char *const new_connector = (char *)REALLOC(\n parser, parser->m_groupConnector, parser->m_groupSize *= 2);\n if (new_connector == NULL) {\n parser->m_groupSize /= 2;\n return XML_ERROR_NO_MEMORY;\n }\n parser->m_groupConnector = new_connector;\n }\n\n if (dtd->scaffIndex) {\n int *const new_scaff_index = (int *)REALLOC(\n parser, dtd->scaffIndex, parser->m_groupSize * sizeof(int));\n if (new_scaff_index == NULL)\n return XML_ERROR_NO_MEMORY;\n dtd->scaffIndex = new_scaff_index;\n }\n } else {\n parser->m_groupConnector\n = (char *)MALLOC(parser, parser->m_groupSize = 32);\n if (! parser->m_groupConnector) {\n parser->m_groupSize = 0;\n return XML_ERROR_NO_MEMORY;\n }\n }\n }\n parser->m_groupConnector[parser->m_prologState.level] = 0;\n if (dtd->in_eldecl) {\n int myindex = nextScaffoldPart(parser);\n if (myindex < 0)\n return XML_ERROR_NO_MEMORY;\n assert(dtd->scaffIndex != NULL);\n dtd->scaffIndex[dtd->scaffLevel] = myindex;\n dtd->scaffLevel++;\n dtd->scaffold[myindex].type = XML_CTYPE_SEQ;\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n }\n break;\n case XML_ROLE_GROUP_SEQUENCE:\n if (parser->m_groupConnector[parser->m_prologState.level] == ASCII_PIPE)\n return XML_ERROR_SYNTAX;\n parser->m_groupConnector[parser->m_prologState.level] = ASCII_COMMA;\n if (dtd->in_eldecl && parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_GROUP_CHOICE:\n if (parser->m_groupConnector[parser->m_prologState.level] == ASCII_COMMA)\n return XML_ERROR_SYNTAX;\n if (dtd->in_eldecl\n && ! parser->m_groupConnector[parser->m_prologState.level]\n && (dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type\n != XML_CTYPE_MIXED)) {\n dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type\n = XML_CTYPE_CHOICE;\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n }\n parser->m_groupConnector[parser->m_prologState.level] = ASCII_PIPE;\n break;\n case XML_ROLE_PARAM_ENTITY_REF:\n#ifdef XML_DTD\n case XML_ROLE_INNER_PARAM_ENTITY_REF:\n dtd->hasParamEntityRefs = XML_TRUE;\n if (! parser->m_paramEntityParsing)\n dtd->keepProcessing = dtd->standalone;\n else {\n const XML_Char *name;\n ENTITY *entity;\n name = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n entity = (ENTITY *)lookup(parser, &dtd->paramEntities, name, 0);\n poolDiscard(&dtd->pool);\n /* first, determine if a check for an existing declaration is needed;\n if yes, check that the entity exists, and that it is internal,\n otherwise call the skipped entity handler\n */\n if (parser->m_prologState.documentEntity\n && (dtd->standalone ? ! parser->m_openInternalEntities\n : ! dtd->hasParamEntityRefs)) {\n if (! entity)\n return XML_ERROR_UNDEFINED_ENTITY;\n else if (! entity->is_internal) {\n /* It's hard to exhaustively search the code to be sure,\n * but there doesn't seem to be a way of executing the\n * following line. There are two cases:\n *\n * If 'standalone' is false, the DTD must have no\n * parameter entities or we wouldn't have passed the outer\n * 'if' statement. That measn the only entity in the hash\n * table is the external subset name \"#\" which cannot be\n * given as a parameter entity name in XML syntax, so the\n * lookup must have returned NULL and we don't even reach\n * the test for an internal entity.\n *\n * If 'standalone' is true, it does not seem to be\n * possible to create entities taking this code path that\n * are not internal entities, so fail the test above.\n *\n * Because this analysis is very uncertain, the code is\n * being left in place and merely removed from the\n * coverage test statistics.\n */\n return XML_ERROR_ENTITY_DECLARED_IN_PE; /* LCOV_EXCL_LINE */\n }\n } else if (! entity) {\n dtd->keepProcessing = dtd->standalone;\n /* cannot report skipped entities in declarations */\n if ((role == XML_ROLE_PARAM_ENTITY_REF)\n && parser->m_skippedEntityHandler) {\n parser->m_skippedEntityHandler(parser->m_handlerArg, name, 1);\n handleDefault = XML_FALSE;\n }\n break;\n }\n if (entity->open)\n return XML_ERROR_RECURSIVE_ENTITY_REF;\n if (entity->textPtr) {\n enum XML_Error result;\n XML_Bool betweenDecl\n = (role == XML_ROLE_PARAM_ENTITY_REF ? XML_TRUE : XML_FALSE);\n result = processInternalEntity(parser, entity, betweenDecl);\n if (result != XML_ERROR_NONE)\n return result;\n handleDefault = XML_FALSE;\n break;\n }\n if (parser->m_externalEntityRefHandler) {\n dtd->paramEntityRead = XML_FALSE;\n entity->open = XML_TRUE;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, 0, entity->base,\n entity->systemId, entity->publicId)) {\n entity->open = XML_FALSE;\n return XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n }\n entity->open = XML_FALSE;\n handleDefault = XML_FALSE;\n if (! dtd->paramEntityRead) {\n dtd->keepProcessing = dtd->standalone;\n break;\n }\n } else {\n dtd->keepProcessing = dtd->standalone;\n break;\n }\n }\n#endif /* XML_DTD */\n if (! dtd->standalone && parser->m_notStandaloneHandler\n && ! parser->m_notStandaloneHandler(parser->m_handlerArg))\n return XML_ERROR_NOT_STANDALONE;\n break;\n\n /* Element declaration stuff */\n\n case XML_ROLE_ELEMENT_NAME:\n if (parser->m_elementDeclHandler) {\n parser->m_declElementType = getElementType(parser, enc, s, next);\n if (! parser->m_declElementType)\n return XML_ERROR_NO_MEMORY;\n dtd->scaffLevel = 0;\n dtd->scaffCount = 0;\n dtd->in_eldecl = XML_TRUE;\n handleDefault = XML_FALSE;\n }\n break;\n\n case XML_ROLE_CONTENT_ANY:\n case XML_ROLE_CONTENT_EMPTY:\n if (dtd->in_eldecl) {\n if (parser->m_elementDeclHandler) {\n XML_Content *content\n = (XML_Content *)MALLOC(parser, sizeof(XML_Content));\n if (! content)\n return XML_ERROR_NO_MEMORY;\n content->quant = XML_CQUANT_NONE;\n content->name = NULL;\n content->numchildren = 0;\n content->children = NULL;\n content->type = ((role == XML_ROLE_CONTENT_ANY) ? XML_CTYPE_ANY\n : XML_CTYPE_EMPTY);\n *eventEndPP = s;\n parser->m_elementDeclHandler(\n parser->m_handlerArg, parser->m_declElementType->name, content);\n handleDefault = XML_FALSE;\n }\n dtd->in_eldecl = XML_FALSE;\n }\n break;\n\n case XML_ROLE_CONTENT_PCDATA:\n if (dtd->in_eldecl) {\n dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type\n = XML_CTYPE_MIXED;\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n }\n break;\n\n case XML_ROLE_CONTENT_ELEMENT:\n quant = XML_CQUANT_NONE;\n goto elementContent;\n case XML_ROLE_CONTENT_ELEMENT_OPT:\n quant = XML_CQUANT_OPT;\n goto elementContent;\n case XML_ROLE_CONTENT_ELEMENT_REP:\n quant = XML_CQUANT_REP;\n goto elementContent;\n case XML_ROLE_CONTENT_ELEMENT_PLUS:\n quant = XML_CQUANT_PLUS;\n elementContent:\n if (dtd->in_eldecl) {\n ELEMENT_TYPE *el;\n const XML_Char *name;\n int nameLen;\n const char *nxt\n = (quant == XML_CQUANT_NONE ? next : next - enc->minBytesPerChar);\n int myindex = nextScaffoldPart(parser);\n if (myindex < 0)\n return XML_ERROR_NO_MEMORY;\n dtd->scaffold[myindex].type = XML_CTYPE_NAME;\n dtd->scaffold[myindex].quant = quant;\n el = getElementType(parser, enc, s, nxt);\n if (! el)\n return XML_ERROR_NO_MEMORY;\n name = el->name;\n dtd->scaffold[myindex].name = name;\n nameLen = 0;\n for (; name[nameLen++];)\n ;\n dtd->contentStringLen += nameLen;\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n }\n break;\n\n case XML_ROLE_GROUP_CLOSE:\n quant = XML_CQUANT_NONE;\n goto closeGroup;\n case XML_ROLE_GROUP_CLOSE_OPT:\n quant = XML_CQUANT_OPT;\n goto closeGroup;\n case XML_ROLE_GROUP_CLOSE_REP:\n quant = XML_CQUANT_REP;\n goto closeGroup;\n case XML_ROLE_GROUP_CLOSE_PLUS:\n quant = XML_CQUANT_PLUS;\n closeGroup:\n if (dtd->in_eldecl) {\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n dtd->scaffLevel--;\n dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel]].quant = quant;\n if (dtd->scaffLevel == 0) {\n if (! handleDefault) {\n XML_Content *model = build_model(parser);\n if (! model)\n return XML_ERROR_NO_MEMORY;\n *eventEndPP = s;\n parser->m_elementDeclHandler(\n parser->m_handlerArg, parser->m_declElementType->name, model);\n }\n dtd->in_eldecl = XML_FALSE;\n dtd->contentStringLen = 0;\n }\n }\n break;\n /* End element declaration stuff */\n\n case XML_ROLE_PI:\n if (! reportProcessingInstruction(parser, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_COMMENT:\n if (! reportComment(parser, enc, s, next))\n return XML_ERROR_NO_MEMORY;\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_NONE:\n switch (tok) {\n case XML_TOK_BOM:\n handleDefault = XML_FALSE;\n break;\n }\n break;\n case XML_ROLE_DOCTYPE_NONE:\n if (parser->m_startDoctypeDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_ENTITY_NONE:\n if (dtd->keepProcessing && parser->m_entityDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_NOTATION_NONE:\n if (parser->m_notationDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_ATTLIST_NONE:\n if (dtd->keepProcessing && parser->m_attlistDeclHandler)\n handleDefault = XML_FALSE;\n break;\n case XML_ROLE_ELEMENT_NONE:\n if (parser->m_elementDeclHandler)\n handleDefault = XML_FALSE;\n break;\n } /* end of big switch */\n\n if (handleDefault && parser->m_defaultHandler)\n reportDefault(parser, enc, s, next);\n\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:\n s = next;\n tok = XmlPrologTok(enc, s, end, &next);\n }\n }\n /* not reached */\n}\n\nstatic enum XML_Error PTRCALL\nepilogProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n parser->m_processor = epilogProcessor;\n parser->m_eventPtr = s;\n for (;;) {\n const char *next = NULL;\n int tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n parser->m_eventEndPtr = next;\n switch (tok) {\n /* report partial linebreak - it might be the last token */\n case -XML_TOK_PROLOG_S:\n if (parser->m_defaultHandler) {\n reportDefault(parser, parser->m_encoding, s, next);\n if (parser->m_parsingStatus.parsing == XML_FINISHED)\n return XML_ERROR_ABORTED;\n }\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_TOK_NONE:\n *nextPtr = s;\n return XML_ERROR_NONE;\n case XML_TOK_PROLOG_S:\n if (parser->m_defaultHandler)\n reportDefault(parser, parser->m_encoding, s, next);\n break;\n case XML_TOK_PI:\n if (! reportProcessingInstruction(parser, parser->m_encoding, s, next))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_COMMENT:\n if (! reportComment(parser, parser->m_encoding, s, next))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_INVALID:\n parser->m_eventPtr = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n if (! parser->m_parsingStatus.finalBuffer) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n if (! parser->m_parsingStatus.finalBuffer) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n return XML_ERROR_PARTIAL_CHAR;\n default:\n return XML_ERROR_JUNK_AFTER_DOC_ELEMENT;\n }\n parser->m_eventPtr = s = next;\n switch (parser->m_parsingStatus.parsing) {\n case XML_SUSPENDED:\n *nextPtr = next;\n return XML_ERROR_NONE;\n case XML_FINISHED:\n return XML_ERROR_ABORTED;\n default:;\n }\n }\n}\n\nstatic enum XML_Error\nprocessInternalEntity(XML_Parser parser, ENTITY *entity, XML_Bool betweenDecl) {\n const char *textStart, *textEnd;\n const char *next;\n enum XML_Error result;\n OPEN_INTERNAL_ENTITY *openEntity;\n\n if (parser->m_freeInternalEntities) {\n openEntity = parser->m_freeInternalEntities;\n parser->m_freeInternalEntities = openEntity->next;\n } else {\n openEntity\n = (OPEN_INTERNAL_ENTITY *)MALLOC(parser, sizeof(OPEN_INTERNAL_ENTITY));\n if (! openEntity)\n return XML_ERROR_NO_MEMORY;\n }\n entity->open = XML_TRUE;\n entity->processed = 0;\n openEntity->next = parser->m_openInternalEntities;\n parser->m_openInternalEntities = openEntity;\n openEntity->entity = entity;\n openEntity->startTagLevel = parser->m_tagLevel;\n openEntity->betweenDecl = betweenDecl;\n openEntity->internalEventPtr = NULL;\n openEntity->internalEventEndPtr = NULL;\n textStart = (char *)entity->textPtr;\n textEnd = (char *)(entity->textPtr + entity->textLen);\n /* Set a safe default value in case 'next' does not get set */\n next = textStart;\n\n#ifdef XML_DTD\n if (entity->is_param) {\n int tok\n = XmlPrologTok(parser->m_internalEncoding, textStart, textEnd, &next);\n result = doProlog(parser, parser->m_internalEncoding, textStart, textEnd,\n tok, next, &next, XML_FALSE, XML_FALSE);\n } else\n#endif /* XML_DTD */\n result = doContent(parser, parser->m_tagLevel, parser->m_internalEncoding,\n textStart, textEnd, &next, XML_FALSE);\n\n if (result == XML_ERROR_NONE) {\n if (textEnd != next && parser->m_parsingStatus.parsing == XML_SUSPENDED) {\n entity->processed = (int)(next - textStart);\n parser->m_processor = internalEntityProcessor;\n } else {\n entity->open = XML_FALSE;\n parser->m_openInternalEntities = openEntity->next;\n /* put openEntity back in list of free instances */\n openEntity->next = parser->m_freeInternalEntities;\n parser->m_freeInternalEntities = openEntity;\n }\n }\n return result;\n}\n\nstatic enum XML_Error PTRCALL\ninternalEntityProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n ENTITY *entity;\n const char *textStart, *textEnd;\n const char *next;\n enum XML_Error result;\n OPEN_INTERNAL_ENTITY *openEntity = parser->m_openInternalEntities;\n if (! openEntity)\n return XML_ERROR_UNEXPECTED_STATE;\n\n entity = openEntity->entity;\n textStart = ((char *)entity->textPtr) + entity->processed;\n textEnd = (char *)(entity->textPtr + entity->textLen);\n /* Set a safe default value in case 'next' does not get set */\n next = textStart;\n\n#ifdef XML_DTD\n if (entity->is_param) {\n int tok\n = XmlPrologTok(parser->m_internalEncoding, textStart, textEnd, &next);\n result = doProlog(parser, parser->m_internalEncoding, textStart, textEnd,\n tok, next, &next, XML_FALSE, XML_TRUE);\n } else\n#endif /* XML_DTD */\n result = doContent(parser, openEntity->startTagLevel,\n parser->m_internalEncoding, textStart, textEnd, &next,\n XML_FALSE);\n\n if (result != XML_ERROR_NONE)\n return result;\n else if (textEnd != next\n && parser->m_parsingStatus.parsing == XML_SUSPENDED) {\n entity->processed = (int)(next - (char *)entity->textPtr);\n return result;\n } else {\n entity->open = XML_FALSE;\n parser->m_openInternalEntities = openEntity->next;\n /* put openEntity back in list of free instances */\n openEntity->next = parser->m_freeInternalEntities;\n parser->m_freeInternalEntities = openEntity;\n }\n\n#ifdef XML_DTD\n if (entity->is_param) {\n int tok;\n parser->m_processor = prologProcessor;\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE);\n } else\n#endif /* XML_DTD */\n {\n parser->m_processor = contentProcessor;\n /* see externalEntityContentProcessor vs contentProcessor */\n return doContent(parser, parser->m_parentParser ? 1 : 0, parser->m_encoding,\n s, end, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n }\n}\n\nstatic enum XML_Error PTRCALL\nerrorProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n UNUSED_P(s);\n UNUSED_P(end);\n UNUSED_P(nextPtr);\n return parser->m_errorCode;\n}\n\nstatic enum XML_Error\nstoreAttributeValue(XML_Parser parser, const ENCODING *enc, XML_Bool isCdata,\n const char *ptr, const char *end, STRING_POOL *pool) {\n enum XML_Error result\n = appendAttributeValue(parser, enc, isCdata, ptr, end, pool);\n if (result)\n return result;\n if (! isCdata && poolLength(pool) && poolLastChar(pool) == 0x20)\n poolChop(pool);\n if (! poolAppendChar(pool, XML_T('\\0')))\n return XML_ERROR_NO_MEMORY;\n return XML_ERROR_NONE;\n}\n\nstatic enum XML_Error\nappendAttributeValue(XML_Parser parser, const ENCODING *enc, XML_Bool isCdata,\n const char *ptr, const char *end, STRING_POOL *pool) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n for (;;) {\n const char *next;\n int tok = XmlAttributeValueTok(enc, ptr, end, &next);\n switch (tok) {\n case XML_TOK_NONE:\n return XML_ERROR_NONE;\n case XML_TOK_INVALID:\n if (enc == parser->m_encoding)\n parser->m_eventPtr = next;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_CHAR_REF: {\n XML_Char buf[XML_ENCODE_MAX];\n int i;\n int n = XmlCharRefNumber(enc, ptr);\n if (n < 0) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_BAD_CHAR_REF;\n }\n if (! isCdata && n == 0x20 /* space */\n && (poolLength(pool) == 0 || poolLastChar(pool) == 0x20))\n break;\n n = XmlEncode(n, (ICHAR *)buf);\n /* The XmlEncode() functions can never return 0 here. That\n * error return happens if the code point passed in is either\n * negative or greater than or equal to 0x110000. The\n * XmlCharRefNumber() functions will all return a number\n * strictly less than 0x110000 or a negative value if an error\n * occurred. The negative value is intercepted above, so\n * XmlEncode() is never passed a value it might return an\n * error for.\n */\n for (i = 0; i < n; i++) {\n if (! poolAppendChar(pool, buf[i]))\n return XML_ERROR_NO_MEMORY;\n }\n } break;\n case XML_TOK_DATA_CHARS:\n if (! poolAppend(pool, enc, ptr, next))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_TRAILING_CR:\n next = ptr + enc->minBytesPerChar;\n /* fall through */\n case XML_TOK_ATTRIBUTE_VALUE_S:\n case XML_TOK_DATA_NEWLINE:\n if (! isCdata && (poolLength(pool) == 0 || poolLastChar(pool) == 0x20))\n break;\n if (! poolAppendChar(pool, 0x20))\n return XML_ERROR_NO_MEMORY;\n break;\n case XML_TOK_ENTITY_REF: {\n const XML_Char *name;\n ENTITY *entity;\n char checkEntityDecl;\n XML_Char ch = (XML_Char)XmlPredefinedEntityName(\n enc, ptr + enc->minBytesPerChar, next - enc->minBytesPerChar);\n if (ch) {\n if (! poolAppendChar(pool, ch))\n return XML_ERROR_NO_MEMORY;\n break;\n }\n name = poolStoreString(&parser->m_temp2Pool, enc,\n ptr + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! name)\n return XML_ERROR_NO_MEMORY;\n entity = (ENTITY *)lookup(parser, &dtd->generalEntities, name, 0);\n poolDiscard(&parser->m_temp2Pool);\n /* First, determine if a check for an existing declaration is needed;\n if yes, check that the entity exists, and that it is internal.\n */\n if (pool == &dtd->pool) /* are we called from prolog? */\n checkEntityDecl =\n#ifdef XML_DTD\n parser->m_prologState.documentEntity &&\n#endif /* XML_DTD */\n (dtd->standalone ? ! parser->m_openInternalEntities\n : ! dtd->hasParamEntityRefs);\n else /* if (pool == &parser->m_tempPool): we are called from content */\n checkEntityDecl = ! dtd->hasParamEntityRefs || dtd->standalone;\n if (checkEntityDecl) {\n if (! entity)\n return XML_ERROR_UNDEFINED_ENTITY;\n else if (! entity->is_internal)\n return XML_ERROR_ENTITY_DECLARED_IN_PE;\n } else if (! entity) {\n /* Cannot report skipped entity here - see comments on\n parser->m_skippedEntityHandler.\n if (parser->m_skippedEntityHandler)\n parser->m_skippedEntityHandler(parser->m_handlerArg, name, 0);\n */\n /* Cannot call the default handler because this would be\n out of sync with the call to the startElementHandler.\n if ((pool == &parser->m_tempPool) && parser->m_defaultHandler)\n reportDefault(parser, enc, ptr, next);\n */\n break;\n }\n if (entity->open) {\n if (enc == parser->m_encoding) {\n /* It does not appear that this line can be executed.\n *\n * The \"if (entity->open)\" check catches recursive entity\n * definitions. In order to be called with an open\n * entity, it must have gone through this code before and\n * been through the recursive call to\n * appendAttributeValue() some lines below. That call\n * sets the local encoding (\"enc\") to the parser's\n * internal encoding (internal_utf8 or internal_utf16),\n * which can never be the same as the principle encoding.\n * It doesn't appear there is another code path that gets\n * here with entity->open being TRUE.\n *\n * Since it is not certain that this logic is watertight,\n * we keep the line and merely exclude it from coverage\n * tests.\n */\n parser->m_eventPtr = ptr; /* LCOV_EXCL_LINE */\n }\n return XML_ERROR_RECURSIVE_ENTITY_REF;\n }\n if (entity->notation) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_BINARY_ENTITY_REF;\n }\n if (! entity->textPtr) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_ATTRIBUTE_EXTERNAL_ENTITY_REF;\n } else {\n enum XML_Error result;\n const XML_Char *textEnd = entity->textPtr + entity->textLen;\n entity->open = XML_TRUE;\n result = appendAttributeValue(parser, parser->m_internalEncoding,\n isCdata, (char *)entity->textPtr,\n (char *)textEnd, pool);\n entity->open = XML_FALSE;\n if (result)\n return result;\n }\n } break;\n default:\n /* The only token returned by XmlAttributeValueTok() that does\n * not have an explicit case here is XML_TOK_PARTIAL_CHAR.\n * Getting that would require an entity name to contain an\n * incomplete XML character (e.g. \\xE2\\x82); however previous\n * tokenisers will have already recognised and rejected such\n * names before XmlAttributeValueTok() gets a look-in. This\n * default case should be retained as a safety net, but the code\n * excluded from coverage tests.\n *\n * LCOV_EXCL_START\n */\n if (enc == parser->m_encoding)\n parser->m_eventPtr = ptr;\n return XML_ERROR_UNEXPECTED_STATE;\n /* LCOV_EXCL_STOP */\n }\n ptr = next;\n }\n /* not reached */\n}\n\nstatic enum XML_Error\nstoreEntityValue(XML_Parser parser, const ENCODING *enc,\n const char *entityTextPtr, const char *entityTextEnd) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n STRING_POOL *pool = &(dtd->entityValuePool);\n enum XML_Error result = XML_ERROR_NONE;\n#ifdef XML_DTD\n int oldInEntityValue = parser->m_prologState.inEntityValue;\n parser->m_prologState.inEntityValue = 1;\n#endif /* XML_DTD */\n /* never return Null for the value argument in EntityDeclHandler,\n since this would indicate an external entity; therefore we\n have to make sure that entityValuePool.start is not null */\n if (! pool->blocks) {\n if (! poolGrow(pool))\n return XML_ERROR_NO_MEMORY;\n }\n\n for (;;) {\n const char *next;\n int tok = XmlEntityValueTok(enc, entityTextPtr, entityTextEnd, &next);\n switch (tok) {\n case XML_TOK_PARAM_ENTITY_REF:\n#ifdef XML_DTD\n if (parser->m_isParamEntity || enc != parser->m_encoding) {\n const XML_Char *name;\n ENTITY *entity;\n name = poolStoreString(&parser->m_tempPool, enc,\n entityTextPtr + enc->minBytesPerChar,\n next - enc->minBytesPerChar);\n if (! name) {\n result = XML_ERROR_NO_MEMORY;\n goto endEntityValue;\n }\n entity = (ENTITY *)lookup(parser, &dtd->paramEntities, name, 0);\n poolDiscard(&parser->m_tempPool);\n if (! entity) {\n /* not a well-formedness error - see XML 1.0: WFC Entity Declared */\n /* cannot report skipped entity here - see comments on\n parser->m_skippedEntityHandler\n if (parser->m_skippedEntityHandler)\n parser->m_skippedEntityHandler(parser->m_handlerArg, name, 0);\n */\n dtd->keepProcessing = dtd->standalone;\n goto endEntityValue;\n }\n if (entity->open) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_RECURSIVE_ENTITY_REF;\n goto endEntityValue;\n }\n if (entity->systemId) {\n if (parser->m_externalEntityRefHandler) {\n dtd->paramEntityRead = XML_FALSE;\n entity->open = XML_TRUE;\n if (! parser->m_externalEntityRefHandler(\n parser->m_externalEntityRefHandlerArg, 0, entity->base,\n entity->systemId, entity->publicId)) {\n entity->open = XML_FALSE;\n result = XML_ERROR_EXTERNAL_ENTITY_HANDLING;\n goto endEntityValue;\n }\n entity->open = XML_FALSE;\n if (! dtd->paramEntityRead)\n dtd->keepProcessing = dtd->standalone;\n } else\n dtd->keepProcessing = dtd->standalone;\n } else {\n entity->open = XML_TRUE;\n result = storeEntityValue(\n parser, parser->m_internalEncoding, (char *)entity->textPtr,\n (char *)(entity->textPtr + entity->textLen));\n entity->open = XML_FALSE;\n if (result)\n goto endEntityValue;\n }\n break;\n }\n#endif /* XML_DTD */\n /* In the internal subset, PE references are not legal\n within markup declarations, e.g entity values in this case. */\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_PARAM_ENTITY_REF;\n goto endEntityValue;\n case XML_TOK_NONE:\n result = XML_ERROR_NONE;\n goto endEntityValue;\n case XML_TOK_ENTITY_REF:\n case XML_TOK_DATA_CHARS:\n if (! poolAppend(pool, enc, entityTextPtr, next)) {\n result = XML_ERROR_NO_MEMORY;\n goto endEntityValue;\n }\n break;\n case XML_TOK_TRAILING_CR:\n next = entityTextPtr + enc->minBytesPerChar;\n /* fall through */\n case XML_TOK_DATA_NEWLINE:\n if (pool->end == pool->ptr && ! poolGrow(pool)) {\n result = XML_ERROR_NO_MEMORY;\n goto endEntityValue;\n }\n *(pool->ptr)++ = 0xA;\n break;\n case XML_TOK_CHAR_REF: {\n XML_Char buf[XML_ENCODE_MAX];\n int i;\n int n = XmlCharRefNumber(enc, entityTextPtr);\n if (n < 0) {\n if (enc == parser->m_encoding)\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_BAD_CHAR_REF;\n goto endEntityValue;\n }\n n = XmlEncode(n, (ICHAR *)buf);\n /* The XmlEncode() functions can never return 0 here. That\n * error return happens if the code point passed in is either\n * negative or greater than or equal to 0x110000. The\n * XmlCharRefNumber() functions will all return a number\n * strictly less than 0x110000 or a negative value if an error\n * occurred. The negative value is intercepted above, so\n * XmlEncode() is never passed a value it might return an\n * error for.\n */\n for (i = 0; i < n; i++) {\n if (pool->end == pool->ptr && ! poolGrow(pool)) {\n result = XML_ERROR_NO_MEMORY;\n goto endEntityValue;\n }\n *(pool->ptr)++ = buf[i];\n }\n } break;\n case XML_TOK_PARTIAL:\n if (enc == parser->m_encoding)\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_INVALID_TOKEN;\n goto endEntityValue;\n case XML_TOK_INVALID:\n if (enc == parser->m_encoding)\n parser->m_eventPtr = next;\n result = XML_ERROR_INVALID_TOKEN;\n goto endEntityValue;\n default:\n /* This default case should be unnecessary -- all the tokens\n * that XmlEntityValueTok() can return have their own explicit\n * cases -- but should be retained for safety. We do however\n * exclude it from the coverage statistics.\n *\n * LCOV_EXCL_START\n */\n if (enc == parser->m_encoding)\n parser->m_eventPtr = entityTextPtr;\n result = XML_ERROR_UNEXPECTED_STATE;\n goto endEntityValue;\n /* LCOV_EXCL_STOP */\n }\n entityTextPtr = next;\n }\nendEntityValue:\n#ifdef XML_DTD\n parser->m_prologState.inEntityValue = oldInEntityValue;\n#endif /* XML_DTD */\n return result;\n}\n\nstatic void FASTCALL\nnormalizeLines(XML_Char *s) {\n XML_Char *p;\n for (;; s++) {\n if (*s == XML_T('\\0'))\n return;\n if (*s == 0xD)\n break;\n }\n p = s;\n do {\n if (*s == 0xD) {\n *p++ = 0xA;\n if (*++s == 0xA)\n s++;\n } else\n *p++ = *s++;\n } while (*s);\n *p = XML_T('\\0');\n}\n\nstatic int\nreportProcessingInstruction(XML_Parser parser, const ENCODING *enc,\n const char *start, const char *end) {\n const XML_Char *target;\n XML_Char *data;\n const char *tem;\n if (! parser->m_processingInstructionHandler) {\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, start, end);\n return 1;\n }\n start += enc->minBytesPerChar * 2;\n tem = start + XmlNameLength(enc, start);\n target = poolStoreString(&parser->m_tempPool, enc, start, tem);\n if (! target)\n return 0;\n poolFinish(&parser->m_tempPool);\n data = poolStoreString(&parser->m_tempPool, enc, XmlSkipS(enc, tem),\n end - enc->minBytesPerChar * 2);\n if (! data)\n return 0;\n normalizeLines(data);\n parser->m_processingInstructionHandler(parser->m_handlerArg, target, data);\n poolClear(&parser->m_tempPool);\n return 1;\n}\n\nstatic int\nreportComment(XML_Parser parser, const ENCODING *enc, const char *start,\n const char *end) {\n XML_Char *data;\n if (! parser->m_commentHandler) {\n if (parser->m_defaultHandler)\n reportDefault(parser, enc, start, end);\n return 1;\n }\n data = poolStoreString(&parser->m_tempPool, enc,\n start + enc->minBytesPerChar * 4,\n end - enc->minBytesPerChar * 3);\n if (! data)\n return 0;\n normalizeLines(data);\n parser->m_commentHandler(parser->m_handlerArg, data);\n poolClear(&parser->m_tempPool);\n return 1;\n}\n\nstatic void\nreportDefault(XML_Parser parser, const ENCODING *enc, const char *s,\n const char *end) {\n if (MUST_CONVERT(enc, s)) {\n enum XML_Convert_Result convert_res;\n const char **eventPP;\n const char **eventEndPP;\n if (enc == parser->m_encoding) {\n eventPP = &parser->m_eventPtr;\n eventEndPP = &parser->m_eventEndPtr;\n } else {\n /* To get here, two things must be true; the parser must be\n * using a character encoding that is not the same as the\n * encoding passed in, and the encoding passed in must need\n * conversion to the internal format (UTF-8 unless XML_UNICODE\n * is defined). The only occasions on which the encoding passed\n * in is not the same as the parser's encoding are when it is\n * the internal encoding (e.g. a previously defined parameter\n * entity, already converted to internal format). This by\n * definition doesn't need conversion, so the whole branch never\n * gets executed.\n *\n * For safety's sake we don't delete these lines and merely\n * exclude them from coverage statistics.\n *\n * LCOV_EXCL_START\n */\n eventPP = &(parser->m_openInternalEntities->internalEventPtr);\n eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);\n /* LCOV_EXCL_STOP */\n }\n do {\n ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;\n convert_res\n = XmlConvert(enc, &s, end, &dataPtr, (ICHAR *)parser->m_dataBufEnd);\n *eventEndPP = s;\n parser->m_defaultHandler(parser->m_handlerArg, parser->m_dataBuf,\n (int)(dataPtr - (ICHAR *)parser->m_dataBuf));\n *eventPP = s;\n } while ((convert_res != XML_CONVERT_COMPLETED)\n && (convert_res != XML_CONVERT_INPUT_INCOMPLETE));\n } else\n parser->m_defaultHandler(parser->m_handlerArg, (XML_Char *)s,\n (int)((XML_Char *)end - (XML_Char *)s));\n}\n\nstatic int\ndefineAttribute(ELEMENT_TYPE *type, ATTRIBUTE_ID *attId, XML_Bool isCdata,\n XML_Bool isId, const XML_Char *value, XML_Parser parser) {\n DEFAULT_ATTRIBUTE *att;\n if (value || isId) {\n /* The handling of default attributes gets messed up if we have\n a default which duplicates a non-default. */\n int i;\n for (i = 0; i < type->nDefaultAtts; i++)\n if (attId == type->defaultAtts[i].id)\n return 1;\n if (isId && ! type->idAtt && ! attId->xmlns)\n type->idAtt = attId;\n }\n if (type->nDefaultAtts == type->allocDefaultAtts) {\n if (type->allocDefaultAtts == 0) {\n type->allocDefaultAtts = 8;\n type->defaultAtts = (DEFAULT_ATTRIBUTE *)MALLOC(\n parser, type->allocDefaultAtts * sizeof(DEFAULT_ATTRIBUTE));\n if (! type->defaultAtts) {\n type->allocDefaultAtts = 0;\n return 0;\n }\n } else {\n DEFAULT_ATTRIBUTE *temp;\n int count = type->allocDefaultAtts * 2;\n temp = (DEFAULT_ATTRIBUTE *)REALLOC(parser, type->defaultAtts,\n (count * sizeof(DEFAULT_ATTRIBUTE)));\n if (temp == NULL)\n return 0;\n type->allocDefaultAtts = count;\n type->defaultAtts = temp;\n }\n }\n att = type->defaultAtts + type->nDefaultAtts;\n att->id = attId;\n att->value = value;\n att->isCdata = isCdata;\n if (! isCdata)\n attId->maybeTokenized = XML_TRUE;\n type->nDefaultAtts += 1;\n return 1;\n}\n\nstatic int\nsetElementTypePrefix(XML_Parser parser, ELEMENT_TYPE *elementType) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n const XML_Char *name;\n for (name = elementType->name; *name; name++) {\n if (*name == XML_T(ASCII_COLON)) {\n PREFIX *prefix;\n const XML_Char *s;\n for (s = elementType->name; s != name; s++) {\n if (! poolAppendChar(&dtd->pool, *s))\n return 0;\n }\n if (! poolAppendChar(&dtd->pool, XML_T('\\0')))\n return 0;\n prefix = (PREFIX *)lookup(parser, &dtd->prefixes, poolStart(&dtd->pool),\n sizeof(PREFIX));\n if (! prefix)\n return 0;\n if (prefix->name == poolStart(&dtd->pool))\n poolFinish(&dtd->pool);\n else\n poolDiscard(&dtd->pool);\n elementType->prefix = prefix;\n break;\n }\n }\n return 1;\n}\n\nstatic ATTRIBUTE_ID *\ngetAttributeId(XML_Parser parser, const ENCODING *enc, const char *start,\n const char *end) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n ATTRIBUTE_ID *id;\n const XML_Char *name;\n if (! poolAppendChar(&dtd->pool, XML_T('\\0')))\n return NULL;\n name = poolStoreString(&dtd->pool, enc, start, end);\n if (! name)\n return NULL;\n /* skip quotation mark - its storage will be re-used (like in name[-1]) */\n ++name;\n id = (ATTRIBUTE_ID *)lookup(parser, &dtd->attributeIds, name,\n sizeof(ATTRIBUTE_ID));\n if (! id)\n return NULL;\n if (id->name != name)\n poolDiscard(&dtd->pool);\n else {\n poolFinish(&dtd->pool);\n if (! parser->m_ns)\n ;\n else if (name[0] == XML_T(ASCII_x) && name[1] == XML_T(ASCII_m)\n && name[2] == XML_T(ASCII_l) && name[3] == XML_T(ASCII_n)\n && name[4] == XML_T(ASCII_s)\n && (name[5] == XML_T('\\0') || name[5] == XML_T(ASCII_COLON))) {\n if (name[5] == XML_T('\\0'))\n id->prefix = &dtd->defaultPrefix;\n else\n id->prefix = (PREFIX *)lookup(parser, &dtd->prefixes, name + 6,\n sizeof(PREFIX));\n id->xmlns = XML_TRUE;\n } else {\n int i;\n for (i = 0; name[i]; i++) {\n /* attributes without prefix are *not* in the default namespace */\n if (name[i] == XML_T(ASCII_COLON)) {\n int j;\n for (j = 0; j < i; j++) {\n if (! poolAppendChar(&dtd->pool, name[j]))\n return NULL;\n }\n if (! poolAppendChar(&dtd->pool, XML_T('\\0')))\n return NULL;\n id->prefix = (PREFIX *)lookup(parser, &dtd->prefixes,\n poolStart(&dtd->pool), sizeof(PREFIX));\n if (! id->prefix)\n return NULL;\n if (id->prefix->name == poolStart(&dtd->pool))\n poolFinish(&dtd->pool);\n else\n poolDiscard(&dtd->pool);\n break;\n }\n }\n }\n }\n return id;\n}\n\n#define CONTEXT_SEP XML_T(ASCII_FF)\n\nstatic const XML_Char *\ngetContext(XML_Parser parser) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n HASH_TABLE_ITER iter;\n XML_Bool needSep = XML_FALSE;\n\n if (dtd->defaultPrefix.binding) {\n int i;\n int len;\n if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_EQUALS)))\n return NULL;\n len = dtd->defaultPrefix.binding->uriLen;\n if (parser->m_namespaceSeparator)\n len--;\n for (i = 0; i < len; i++) {\n if (! poolAppendChar(&parser->m_tempPool,\n dtd->defaultPrefix.binding->uri[i])) {\n /* Because of memory caching, I don't believe this line can be\n * executed.\n *\n * This is part of a loop copying the default prefix binding\n * URI into the parser's temporary string pool. Previously,\n * that URI was copied into the same string pool, with a\n * terminating NUL character, as part of setContext(). When\n * the pool was cleared, that leaves a block definitely big\n * enough to hold the URI on the free block list of the pool.\n * The URI copy in getContext() therefore cannot run out of\n * memory.\n *\n * If the pool is used between the setContext() and\n * getContext() calls, the worst it can do is leave a bigger\n * block on the front of the free list. Given that this is\n * all somewhat inobvious and program logic can be changed, we\n * don't delete the line but we do exclude it from the test\n * coverage statistics.\n */\n return NULL; /* LCOV_EXCL_LINE */\n }\n }\n needSep = XML_TRUE;\n }\n\n hashTableIterInit(&iter, &(dtd->prefixes));\n for (;;) {\n int i;\n int len;\n const XML_Char *s;\n PREFIX *prefix = (PREFIX *)hashTableIterNext(&iter);\n if (! prefix)\n break;\n if (! prefix->binding) {\n /* This test appears to be (justifiable) paranoia. There does\n * not seem to be a way of injecting a prefix without a binding\n * that doesn't get errored long before this function is called.\n * The test should remain for safety's sake, so we instead\n * exclude the following line from the coverage statistics.\n */\n continue; /* LCOV_EXCL_LINE */\n }\n if (needSep && ! poolAppendChar(&parser->m_tempPool, CONTEXT_SEP))\n return NULL;\n for (s = prefix->name; *s; s++)\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return NULL;\n if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_EQUALS)))\n return NULL;\n len = prefix->binding->uriLen;\n if (parser->m_namespaceSeparator)\n len--;\n for (i = 0; i < len; i++)\n if (! poolAppendChar(&parser->m_tempPool, prefix->binding->uri[i]))\n return NULL;\n needSep = XML_TRUE;\n }\n\n hashTableIterInit(&iter, &(dtd->generalEntities));\n for (;;) {\n const XML_Char *s;\n ENTITY *e = (ENTITY *)hashTableIterNext(&iter);\n if (! e)\n break;\n if (! e->open)\n continue;\n if (needSep && ! poolAppendChar(&parser->m_tempPool, CONTEXT_SEP))\n return NULL;\n for (s = e->name; *s; s++)\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return 0;\n needSep = XML_TRUE;\n }\n\n if (! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return NULL;\n return parser->m_tempPool.start;\n}\n\nstatic XML_Bool\nsetContext(XML_Parser parser, const XML_Char *context) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n const XML_Char *s = context;\n\n while (*context != XML_T('\\0')) {\n if (*s == CONTEXT_SEP || *s == XML_T('\\0')) {\n ENTITY *e;\n if (! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_FALSE;\n e = (ENTITY *)lookup(parser, &dtd->generalEntities,\n poolStart(&parser->m_tempPool), 0);\n if (e)\n e->open = XML_TRUE;\n if (*s != XML_T('\\0'))\n s++;\n context = s;\n poolDiscard(&parser->m_tempPool);\n } else if (*s == XML_T(ASCII_EQUALS)) {\n PREFIX *prefix;\n if (poolLength(&parser->m_tempPool) == 0)\n prefix = &dtd->defaultPrefix;\n else {\n if (! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_FALSE;\n prefix\n = (PREFIX *)lookup(parser, &dtd->prefixes,\n poolStart(&parser->m_tempPool), sizeof(PREFIX));\n if (! prefix)\n return XML_FALSE;\n if (prefix->name == poolStart(&parser->m_tempPool)) {\n prefix->name = poolCopyString(&dtd->pool, prefix->name);\n if (! prefix->name)\n return XML_FALSE;\n }\n poolDiscard(&parser->m_tempPool);\n }\n for (context = s + 1; *context != CONTEXT_SEP && *context != XML_T('\\0');\n context++)\n if (! poolAppendChar(&parser->m_tempPool, *context))\n return XML_FALSE;\n if (! poolAppendChar(&parser->m_tempPool, XML_T('\\0')))\n return XML_FALSE;\n if (addBinding(parser, prefix, NULL, poolStart(&parser->m_tempPool),\n &parser->m_inheritedBindings)\n != XML_ERROR_NONE)\n return XML_FALSE;\n poolDiscard(&parser->m_tempPool);\n if (*context != XML_T('\\0'))\n ++context;\n s = context;\n } else {\n if (! poolAppendChar(&parser->m_tempPool, *s))\n return XML_FALSE;\n s++;\n }\n }\n return XML_TRUE;\n}\n\nstatic void FASTCALL\nnormalizePublicId(XML_Char *publicId) {\n XML_Char *p = publicId;\n XML_Char *s;\n for (s = publicId; *s; s++) {\n switch (*s) {\n case 0x20:\n case 0xD:\n case 0xA:\n if (p != publicId && p[-1] != 0x20)\n *p++ = 0x20;\n break;\n default:\n *p++ = *s;\n }\n }\n if (p != publicId && p[-1] == 0x20)\n --p;\n *p = XML_T('\\0');\n}\n\nstatic DTD *\ndtdCreate(const XML_Memory_Handling_Suite *ms) {\n DTD *p = (DTD *)ms->malloc_fcn(sizeof(DTD));\n if (p == NULL)\n return p;\n poolInit(&(p->pool), ms);\n poolInit(&(p->entityValuePool), ms);\n hashTableInit(&(p->generalEntities), ms);\n hashTableInit(&(p->elementTypes), ms);\n hashTableInit(&(p->attributeIds), ms);\n hashTableInit(&(p->prefixes), ms);\n#ifdef XML_DTD\n p->paramEntityRead = XML_FALSE;\n hashTableInit(&(p->paramEntities), ms);\n#endif /* XML_DTD */\n p->defaultPrefix.name = NULL;\n p->defaultPrefix.binding = NULL;\n\n p->in_eldecl = XML_FALSE;\n p->scaffIndex = NULL;\n p->scaffold = NULL;\n p->scaffLevel = 0;\n p->scaffSize = 0;\n p->scaffCount = 0;\n p->contentStringLen = 0;\n\n p->keepProcessing = XML_TRUE;\n p->hasParamEntityRefs = XML_FALSE;\n p->standalone = XML_FALSE;\n return p;\n}\n\nstatic void\ndtdReset(DTD *p, const XML_Memory_Handling_Suite *ms) {\n HASH_TABLE_ITER iter;\n hashTableIterInit(&iter, &(p->elementTypes));\n for (;;) {\n ELEMENT_TYPE *e = (ELEMENT_TYPE *)hashTableIterNext(&iter);\n if (! e)\n break;\n if (e->allocDefaultAtts != 0)\n ms->free_fcn(e->defaultAtts);\n }\n hashTableClear(&(p->generalEntities));\n#ifdef XML_DTD\n p->paramEntityRead = XML_FALSE;\n hashTableClear(&(p->paramEntities));\n#endif /* XML_DTD */\n hashTableClear(&(p->elementTypes));\n hashTableClear(&(p->attributeIds));\n hashTableClear(&(p->prefixes));\n poolClear(&(p->pool));\n poolClear(&(p->entityValuePool));\n p->defaultPrefix.name = NULL;\n p->defaultPrefix.binding = NULL;\n\n p->in_eldecl = XML_FALSE;\n\n ms->free_fcn(p->scaffIndex);\n p->scaffIndex = NULL;\n ms->free_fcn(p->scaffold);\n p->scaffold = NULL;\n\n p->scaffLevel = 0;\n p->scaffSize = 0;\n p->scaffCount = 0;\n p->contentStringLen = 0;\n\n p->keepProcessing = XML_TRUE;\n p->hasParamEntityRefs = XML_FALSE;\n p->standalone = XML_FALSE;\n}\n\nstatic void\ndtdDestroy(DTD *p, XML_Bool isDocEntity, const XML_Memory_Handling_Suite *ms) {\n HASH_TABLE_ITER iter;\n hashTableIterInit(&iter, &(p->elementTypes));\n for (;;) {\n ELEMENT_TYPE *e = (ELEMENT_TYPE *)hashTableIterNext(&iter);\n if (! e)\n break;\n if (e->allocDefaultAtts != 0)\n ms->free_fcn(e->defaultAtts);\n }\n hashTableDestroy(&(p->generalEntities));\n#ifdef XML_DTD\n hashTableDestroy(&(p->paramEntities));\n#endif /* XML_DTD */\n hashTableDestroy(&(p->elementTypes));\n hashTableDestroy(&(p->attributeIds));\n hashTableDestroy(&(p->prefixes));\n poolDestroy(&(p->pool));\n poolDestroy(&(p->entityValuePool));\n if (isDocEntity) {\n ms->free_fcn(p->scaffIndex);\n ms->free_fcn(p->scaffold);\n }\n ms->free_fcn(p);\n}\n\n/* Do a deep copy of the DTD. Return 0 for out of memory, non-zero otherwise.\n The new DTD has already been initialized.\n*/\nstatic int\ndtdCopy(XML_Parser oldParser, DTD *newDtd, const DTD *oldDtd,\n const XML_Memory_Handling_Suite *ms) {\n HASH_TABLE_ITER iter;\n\n /* Copy the prefix table. */\n\n hashTableIterInit(&iter, &(oldDtd->prefixes));\n for (;;) {\n const XML_Char *name;\n const PREFIX *oldP = (PREFIX *)hashTableIterNext(&iter);\n if (! oldP)\n break;\n name = poolCopyString(&(newDtd->pool), oldP->name);\n if (! name)\n return 0;\n if (! lookup(oldParser, &(newDtd->prefixes), name, sizeof(PREFIX)))\n return 0;\n }\n\n hashTableIterInit(&iter, &(oldDtd->attributeIds));\n\n /* Copy the attribute id table. */\n\n for (;;) {\n ATTRIBUTE_ID *newA;\n const XML_Char *name;\n const ATTRIBUTE_ID *oldA = (ATTRIBUTE_ID *)hashTableIterNext(&iter);\n\n if (! oldA)\n break;\n /* Remember to allocate the scratch byte before the name. */\n if (! poolAppendChar(&(newDtd->pool), XML_T('\\0')))\n return 0;\n name = poolCopyString(&(newDtd->pool), oldA->name);\n if (! name)\n return 0;\n ++name;\n newA = (ATTRIBUTE_ID *)lookup(oldParser, &(newDtd->attributeIds), name,\n sizeof(ATTRIBUTE_ID));\n if (! newA)\n return 0;\n newA->maybeTokenized = oldA->maybeTokenized;\n if (oldA->prefix) {\n newA->xmlns = oldA->xmlns;\n if (oldA->prefix == &oldDtd->defaultPrefix)\n newA->prefix = &newDtd->defaultPrefix;\n else\n newA->prefix = (PREFIX *)lookup(oldParser, &(newDtd->prefixes),\n oldA->prefix->name, 0);\n }\n }\n\n /* Copy the element type table. */\n\n hashTableIterInit(&iter, &(oldDtd->elementTypes));\n\n for (;;) {\n int i;\n ELEMENT_TYPE *newE;\n const XML_Char *name;\n const ELEMENT_TYPE *oldE = (ELEMENT_TYPE *)hashTableIterNext(&iter);\n if (! oldE)\n break;\n name = poolCopyString(&(newDtd->pool), oldE->name);\n if (! name)\n return 0;\n newE = (ELEMENT_TYPE *)lookup(oldParser, &(newDtd->elementTypes), name,\n sizeof(ELEMENT_TYPE));\n if (! newE)\n return 0;\n if (oldE->nDefaultAtts) {\n newE->defaultAtts = (DEFAULT_ATTRIBUTE *)ms->malloc_fcn(\n oldE->nDefaultAtts * sizeof(DEFAULT_ATTRIBUTE));\n if (! newE->defaultAtts) {\n return 0;\n }\n }\n if (oldE->idAtt)\n newE->idAtt = (ATTRIBUTE_ID *)lookup(oldParser, &(newDtd->attributeIds),\n oldE->idAtt->name, 0);\n newE->allocDefaultAtts = newE->nDefaultAtts = oldE->nDefaultAtts;\n if (oldE->prefix)\n newE->prefix = (PREFIX *)lookup(oldParser, &(newDtd->prefixes),\n oldE->prefix->name, 0);\n for (i = 0; i < newE->nDefaultAtts; i++) {\n newE->defaultAtts[i].id = (ATTRIBUTE_ID *)lookup(\n oldParser, &(newDtd->attributeIds), oldE->defaultAtts[i].id->name, 0);\n newE->defaultAtts[i].isCdata = oldE->defaultAtts[i].isCdata;\n if (oldE->defaultAtts[i].value) {\n newE->defaultAtts[i].value\n = poolCopyString(&(newDtd->pool), oldE->defaultAtts[i].value);\n if (! newE->defaultAtts[i].value)\n return 0;\n } else\n newE->defaultAtts[i].value = NULL;\n }\n }\n\n /* Copy the entity tables. */\n if (! copyEntityTable(oldParser, &(newDtd->generalEntities), &(newDtd->pool),\n &(oldDtd->generalEntities)))\n return 0;\n\n#ifdef XML_DTD\n if (! copyEntityTable(oldParser, &(newDtd->paramEntities), &(newDtd->pool),\n &(oldDtd->paramEntities)))\n return 0;\n newDtd->paramEntityRead = oldDtd->paramEntityRead;\n#endif /* XML_DTD */\n\n newDtd->keepProcessing = oldDtd->keepProcessing;\n newDtd->hasParamEntityRefs = oldDtd->hasParamEntityRefs;\n newDtd->standalone = oldDtd->standalone;\n\n /* Don't want deep copying for scaffolding */\n newDtd->in_eldecl = oldDtd->in_eldecl;\n newDtd->scaffold = oldDtd->scaffold;\n newDtd->contentStringLen = oldDtd->contentStringLen;\n newDtd->scaffSize = oldDtd->scaffSize;\n newDtd->scaffLevel = oldDtd->scaffLevel;\n newDtd->scaffIndex = oldDtd->scaffIndex;\n\n return 1;\n} /* End dtdCopy */\n\nstatic int\ncopyEntityTable(XML_Parser oldParser, HASH_TABLE *newTable,\n STRING_POOL *newPool, const HASH_TABLE *oldTable) {\n HASH_TABLE_ITER iter;\n const XML_Char *cachedOldBase = NULL;\n const XML_Char *cachedNewBase = NULL;\n\n hashTableIterInit(&iter, oldTable);\n\n for (;;) {\n ENTITY *newE;\n const XML_Char *name;\n const ENTITY *oldE = (ENTITY *)hashTableIterNext(&iter);\n if (! oldE)\n break;\n name = poolCopyString(newPool, oldE->name);\n if (! name)\n return 0;\n newE = (ENTITY *)lookup(oldParser, newTable, name, sizeof(ENTITY));\n if (! newE)\n return 0;\n if (oldE->systemId) {\n const XML_Char *tem = poolCopyString(newPool, oldE->systemId);\n if (! tem)\n return 0;\n newE->systemId = tem;\n if (oldE->base) {\n if (oldE->base == cachedOldBase)\n newE->base = cachedNewBase;\n else {\n cachedOldBase = oldE->base;\n tem = poolCopyString(newPool, cachedOldBase);\n if (! tem)\n return 0;\n cachedNewBase = newE->base = tem;\n }\n }\n if (oldE->publicId) {\n tem = poolCopyString(newPool, oldE->publicId);\n if (! tem)\n return 0;\n newE->publicId = tem;\n }\n } else {\n const XML_Char *tem\n = poolCopyStringN(newPool, oldE->textPtr, oldE->textLen);\n if (! tem)\n return 0;\n newE->textPtr = tem;\n newE->textLen = oldE->textLen;\n }\n if (oldE->notation) {\n const XML_Char *tem = poolCopyString(newPool, oldE->notation);\n if (! tem)\n return 0;\n newE->notation = tem;\n }\n newE->is_param = oldE->is_param;\n newE->is_internal = oldE->is_internal;\n }\n return 1;\n}\n\n#define INIT_POWER 6\n\nstatic XML_Bool FASTCALL\nkeyeq(KEY s1, KEY s2) {\n for (; *s1 == *s2; s1++, s2++)\n if (*s1 == 0)\n return XML_TRUE;\n return XML_FALSE;\n}\n\nstatic size_t\nkeylen(KEY s) {\n size_t len = 0;\n for (; *s; s++, len++)\n ;\n return len;\n}\n\nstatic void\ncopy_salt_to_sipkey(XML_Parser parser, struct sipkey *key) {\n key->k[0] = 0;\n key->k[1] = get_hash_secret_salt(parser);\n}\n\nstatic unsigned long FASTCALL\nhash(XML_Parser parser, KEY s) {\n struct siphash state;\n struct sipkey key;\n (void)sip24_valid;\n copy_salt_to_sipkey(parser, &key);\n sip24_init(&state, &key);\n sip24_update(&state, s, keylen(s) * sizeof(XML_Char));\n return (unsigned long)sip24_final(&state);\n}\n\nstatic NAMED *\nlookup(XML_Parser parser, HASH_TABLE *table, KEY name, size_t createSize) {\n size_t i;\n if (table->size == 0) {\n size_t tsize;\n if (! createSize)\n return NULL;\n table->power = INIT_POWER;\n /* table->size is a power of 2 */\n table->size = (size_t)1 << INIT_POWER;\n tsize = table->size * sizeof(NAMED *);\n table->v = (NAMED **)table->mem->malloc_fcn(tsize);\n if (! table->v) {\n table->size = 0;\n return NULL;\n }\n memset(table->v, 0, tsize);\n i = hash(parser, name) & ((unsigned long)table->size - 1);\n } else {\n unsigned long h = hash(parser, name);\n unsigned long mask = (unsigned long)table->size - 1;\n unsigned char step = 0;\n i = h & mask;\n while (table->v[i]) {\n if (keyeq(name, table->v[i]->name))\n return table->v[i];\n if (! step)\n step = PROBE_STEP(h, mask, table->power);\n i < step ? (i += table->size - step) : (i -= step);\n }\n if (! createSize)\n return NULL;\n\n /* check for overflow (table is half full) */\n if (table->used >> (table->power - 1)) {\n unsigned char newPower = table->power + 1;\n size_t newSize = (size_t)1 << newPower;\n unsigned long newMask = (unsigned long)newSize - 1;\n size_t tsize = newSize * sizeof(NAMED *);\n NAMED **newV = (NAMED **)table->mem->malloc_fcn(tsize);\n if (! newV)\n return NULL;\n memset(newV, 0, tsize);\n for (i = 0; i < table->size; i++)\n if (table->v[i]) {\n unsigned long newHash = hash(parser, table->v[i]->name);\n size_t j = newHash & newMask;\n step = 0;\n while (newV[j]) {\n if (! step)\n step = PROBE_STEP(newHash, newMask, newPower);\n j < step ? (j += newSize - step) : (j -= step);\n }\n newV[j] = table->v[i];\n }\n table->mem->free_fcn(table->v);\n table->v = newV;\n table->power = newPower;\n table->size = newSize;\n i = h & newMask;\n step = 0;\n while (table->v[i]) {\n if (! step)\n step = PROBE_STEP(h, newMask, newPower);\n i < step ? (i += newSize - step) : (i -= step);\n }\n }\n }\n table->v[i] = (NAMED *)table->mem->malloc_fcn(createSize);\n if (! table->v[i])\n return NULL;\n memset(table->v[i], 0, createSize);\n table->v[i]->name = name;\n (table->used)++;\n return table->v[i];\n}\n\nstatic void FASTCALL\nhashTableClear(HASH_TABLE *table) {\n size_t i;\n for (i = 0; i < table->size; i++) {\n table->mem->free_fcn(table->v[i]);\n table->v[i] = NULL;\n }\n table->used = 0;\n}\n\nstatic void FASTCALL\nhashTableDestroy(HASH_TABLE *table) {\n size_t i;\n for (i = 0; i < table->size; i++)\n table->mem->free_fcn(table->v[i]);\n table->mem->free_fcn(table->v);\n}\n\nstatic void FASTCALL\nhashTableInit(HASH_TABLE *p, const XML_Memory_Handling_Suite *ms) {\n p->power = 0;\n p->size = 0;\n p->used = 0;\n p->v = NULL;\n p->mem = ms;\n}\n\nstatic void FASTCALL\nhashTableIterInit(HASH_TABLE_ITER *iter, const HASH_TABLE *table) {\n iter->p = table->v;\n iter->end = iter->p + table->size;\n}\n\nstatic NAMED *FASTCALL\nhashTableIterNext(HASH_TABLE_ITER *iter) {\n while (iter->p != iter->end) {\n NAMED *tem = *(iter->p)++;\n if (tem)\n return tem;\n }\n return NULL;\n}\n\nstatic void FASTCALL\npoolInit(STRING_POOL *pool, const XML_Memory_Handling_Suite *ms) {\n pool->blocks = NULL;\n pool->freeBlocks = NULL;\n pool->start = NULL;\n pool->ptr = NULL;\n pool->end = NULL;\n pool->mem = ms;\n}\n\nstatic void FASTCALL\npoolClear(STRING_POOL *pool) {\n if (! pool->freeBlocks)\n pool->freeBlocks = pool->blocks;\n else {\n BLOCK *p = pool->blocks;\n while (p) {\n BLOCK *tem = p->next;\n p->next = pool->freeBlocks;\n pool->freeBlocks = p;\n p = tem;\n }\n }\n pool->blocks = NULL;\n pool->start = NULL;\n pool->ptr = NULL;\n pool->end = NULL;\n}\n\nstatic void FASTCALL\npoolDestroy(STRING_POOL *pool) {\n BLOCK *p = pool->blocks;\n while (p) {\n BLOCK *tem = p->next;\n pool->mem->free_fcn(p);\n p = tem;\n }\n p = pool->freeBlocks;\n while (p) {\n BLOCK *tem = p->next;\n pool->mem->free_fcn(p);\n p = tem;\n }\n}\n\nstatic XML_Char *\npoolAppend(STRING_POOL *pool, const ENCODING *enc, const char *ptr,\n const char *end) {\n if (! pool->ptr && ! poolGrow(pool))\n return NULL;\n for (;;) {\n const enum XML_Convert_Result convert_res = XmlConvert(\n enc, &ptr, end, (ICHAR **)&(pool->ptr), (ICHAR *)pool->end);\n if ((convert_res == XML_CONVERT_COMPLETED)\n || (convert_res == XML_CONVERT_INPUT_INCOMPLETE))\n break;\n if (! poolGrow(pool))\n return NULL;\n }\n return pool->start;\n}\n\nstatic const XML_Char *FASTCALL\npoolCopyString(STRING_POOL *pool, const XML_Char *s) {\n do {\n if (! poolAppendChar(pool, *s))\n return NULL;\n } while (*s++);\n s = pool->start;\n poolFinish(pool);\n return s;\n}\n\nstatic const XML_Char *\npoolCopyStringN(STRING_POOL *pool, const XML_Char *s, int n) {\n if (! pool->ptr && ! poolGrow(pool)) {\n /* The following line is unreachable given the current usage of\n * poolCopyStringN(). Currently it is called from exactly one\n * place to copy the text of a simple general entity. By that\n * point, the name of the entity is already stored in the pool, so\n * pool->ptr cannot be NULL.\n *\n * If poolCopyStringN() is used elsewhere as it well might be,\n * this line may well become executable again. Regardless, this\n * sort of check shouldn't be removed lightly, so we just exclude\n * it from the coverage statistics.\n */\n return NULL; /* LCOV_EXCL_LINE */\n }\n for (; n > 0; --n, s++) {\n if (! poolAppendChar(pool, *s))\n return NULL;\n }\n s = pool->start;\n poolFinish(pool);\n return s;\n}\n\nstatic const XML_Char *FASTCALL\npoolAppendString(STRING_POOL *pool, const XML_Char *s) {\n while (*s) {\n if (! poolAppendChar(pool, *s))\n return NULL;\n s++;\n }\n return pool->start;\n}\n\nstatic XML_Char *\npoolStoreString(STRING_POOL *pool, const ENCODING *enc, const char *ptr,\n const char *end) {\n if (! poolAppend(pool, enc, ptr, end))\n return NULL;\n if (pool->ptr == pool->end && ! poolGrow(pool))\n return NULL;\n *(pool->ptr)++ = 0;\n return pool->start;\n}\n\nstatic size_t\npoolBytesToAllocateFor(int blockSize) {\n /* Unprotected math would be:\n ** return offsetof(BLOCK, s) + blockSize * sizeof(XML_Char);\n **\n ** Detect overflow, avoiding _signed_ overflow undefined behavior\n ** For a + b * c we check b * c in isolation first, so that addition of a\n ** on top has no chance of making us accept a small non-negative number\n */\n const size_t stretch = sizeof(XML_Char); /* can be 4 bytes */\n\n if (blockSize <= 0)\n return 0;\n\n if (blockSize > (int)(INT_MAX / stretch))\n return 0;\n\n {\n const int stretchedBlockSize = blockSize * (int)stretch;\n const int bytesToAllocate\n = (int)(offsetof(BLOCK, s) + (unsigned)stretchedBlockSize);\n if (bytesToAllocate < 0)\n return 0;\n\n return (size_t)bytesToAllocate;\n }\n}\n\nstatic XML_Bool FASTCALL\npoolGrow(STRING_POOL *pool) {\n if (pool->freeBlocks) {\n if (pool->start == 0) {\n pool->blocks = pool->freeBlocks;\n pool->freeBlocks = pool->freeBlocks->next;\n pool->blocks->next = NULL;\n pool->start = pool->blocks->s;\n pool->end = pool->start + pool->blocks->size;\n pool->ptr = pool->start;\n return XML_TRUE;\n }\n if (pool->end - pool->start < pool->freeBlocks->size) {\n BLOCK *tem = pool->freeBlocks->next;\n pool->freeBlocks->next = pool->blocks;\n pool->blocks = pool->freeBlocks;\n pool->freeBlocks = tem;\n memcpy(pool->blocks->s, pool->start,\n (pool->end - pool->start) * sizeof(XML_Char));\n pool->ptr = pool->blocks->s + (pool->ptr - pool->start);\n pool->start = pool->blocks->s;\n pool->end = pool->start + pool->blocks->size;\n return XML_TRUE;\n }\n }\n if (pool->blocks && pool->start == pool->blocks->s) {\n BLOCK *temp;\n int blockSize = (int)((unsigned)(pool->end - pool->start) * 2U);\n size_t bytesToAllocate;\n\n /* NOTE: Needs to be calculated prior to calling `realloc`\n to avoid dangling pointers: */\n const ptrdiff_t offsetInsideBlock = pool->ptr - pool->start;\n\n if (blockSize < 0) {\n /* This condition traps a situation where either more than\n * INT_MAX/2 bytes have already been allocated. This isn't\n * readily testable, since it is unlikely that an average\n * machine will have that much memory, so we exclude it from the\n * coverage statistics.\n */\n return XML_FALSE; /* LCOV_EXCL_LINE */\n }\n\n bytesToAllocate = poolBytesToAllocateFor(blockSize);\n if (bytesToAllocate == 0)\n return XML_FALSE;\n\n temp = (BLOCK *)pool->mem->realloc_fcn(pool->blocks,\n (unsigned)bytesToAllocate);\n if (temp == NULL)\n return XML_FALSE;\n pool->blocks = temp;\n pool->blocks->size = blockSize;\n pool->ptr = pool->blocks->s + offsetInsideBlock;\n pool->start = pool->blocks->s;\n pool->end = pool->start + blockSize;\n } else {\n BLOCK *tem;\n int blockSize = (int)(pool->end - pool->start);\n size_t bytesToAllocate;\n\n if (blockSize < 0) {\n /* This condition traps a situation where either more than\n * INT_MAX bytes have already been allocated (which is prevented\n * by various pieces of program logic, not least this one, never\n * mind the unlikelihood of actually having that much memory) or\n * the pool control fields have been corrupted (which could\n * conceivably happen in an extremely buggy user handler\n * function). Either way it isn't readily testable, so we\n * exclude it from the coverage statistics.\n */\n return XML_FALSE; /* LCOV_EXCL_LINE */\n }\n\n if (blockSize < INIT_BLOCK_SIZE)\n blockSize = INIT_BLOCK_SIZE;\n else {\n /* Detect overflow, avoiding _signed_ overflow undefined behavior */\n if ((int)((unsigned)blockSize * 2U) < 0) {\n return XML_FALSE;\n }\n blockSize *= 2;\n }\n\n bytesToAllocate = poolBytesToAllocateFor(blockSize);\n if (bytesToAllocate == 0)\n return XML_FALSE;\n\n tem = (BLOCK *)pool->mem->malloc_fcn(bytesToAllocate);\n if (! tem)\n return XML_FALSE;\n tem->size = blockSize;\n tem->next = pool->blocks;\n pool->blocks = tem;\n if (pool->ptr != pool->start)\n memcpy(tem->s, pool->start, (pool->ptr - pool->start) * sizeof(XML_Char));\n pool->ptr = tem->s + (pool->ptr - pool->start);\n pool->start = tem->s;\n pool->end = tem->s + blockSize;\n }\n return XML_TRUE;\n}\n\nstatic int FASTCALL\nnextScaffoldPart(XML_Parser parser) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n CONTENT_SCAFFOLD *me;\n int next;\n\n if (! dtd->scaffIndex) {\n dtd->scaffIndex = (int *)MALLOC(parser, parser->m_groupSize * sizeof(int));\n if (! dtd->scaffIndex)\n return -1;\n dtd->scaffIndex[0] = 0;\n }\n\n if (dtd->scaffCount >= dtd->scaffSize) {\n CONTENT_SCAFFOLD *temp;\n if (dtd->scaffold) {\n temp = (CONTENT_SCAFFOLD *)REALLOC(\n parser, dtd->scaffold, dtd->scaffSize * 2 * sizeof(CONTENT_SCAFFOLD));\n if (temp == NULL)\n return -1;\n dtd->scaffSize *= 2;\n } else {\n temp = (CONTENT_SCAFFOLD *)MALLOC(parser, INIT_SCAFFOLD_ELEMENTS\n * sizeof(CONTENT_SCAFFOLD));\n if (temp == NULL)\n return -1;\n dtd->scaffSize = INIT_SCAFFOLD_ELEMENTS;\n }\n dtd->scaffold = temp;\n }\n next = dtd->scaffCount++;\n me = &dtd->scaffold[next];\n if (dtd->scaffLevel) {\n CONTENT_SCAFFOLD *parent\n = &dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]];\n if (parent->lastchild) {\n dtd->scaffold[parent->lastchild].nextsib = next;\n }\n if (! parent->childcnt)\n parent->firstchild = next;\n parent->lastchild = next;\n parent->childcnt++;\n }\n me->firstchild = me->lastchild = me->childcnt = me->nextsib = 0;\n return next;\n}\n\nstatic void\nbuild_node(XML_Parser parser, int src_node, XML_Content *dest,\n XML_Content **contpos, XML_Char **strpos) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n dest->type = dtd->scaffold[src_node].type;\n dest->quant = dtd->scaffold[src_node].quant;\n if (dest->type == XML_CTYPE_NAME) {\n const XML_Char *src;\n dest->name = *strpos;\n src = dtd->scaffold[src_node].name;\n for (;;) {\n *(*strpos)++ = *src;\n if (! *src)\n break;\n src++;\n }\n dest->numchildren = 0;\n dest->children = NULL;\n } else {\n unsigned int i;\n int cn;\n dest->numchildren = dtd->scaffold[src_node].childcnt;\n dest->children = *contpos;\n *contpos += dest->numchildren;\n for (i = 0, cn = dtd->scaffold[src_node].firstchild; i < dest->numchildren;\n i++, cn = dtd->scaffold[cn].nextsib) {\n build_node(parser, cn, &(dest->children[i]), contpos, strpos);\n }\n dest->name = NULL;\n }\n}\n\nstatic XML_Content *\nbuild_model(XML_Parser parser) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n XML_Content *ret;\n XML_Content *cpos;\n XML_Char *str;\n int allocsize = (dtd->scaffCount * sizeof(XML_Content)\n + (dtd->contentStringLen * sizeof(XML_Char)));\n\n ret = (XML_Content *)MALLOC(parser, allocsize);\n if (! ret)\n return NULL;\n\n str = (XML_Char *)(&ret[dtd->scaffCount]);\n cpos = &ret[1];\n\n build_node(parser, 0, ret, &cpos, &str);\n return ret;\n}\n\nstatic ELEMENT_TYPE *\ngetElementType(XML_Parser parser, const ENCODING *enc, const char *ptr,\n const char *end) {\n DTD *const dtd = parser->m_dtd; /* save one level of indirection */\n const XML_Char *name = poolStoreString(&dtd->pool, enc, ptr, end);\n ELEMENT_TYPE *ret;\n\n if (! name)\n return NULL;\n ret = (ELEMENT_TYPE *)lookup(parser, &dtd->elementTypes, name,\n sizeof(ELEMENT_TYPE));\n if (! ret)\n return NULL;\n if (ret->name != name)\n poolDiscard(&dtd->pool);\n else {\n poolFinish(&dtd->pool);\n if (! setElementTypePrefix(parser, ret))\n return NULL;\n }\n return ret;\n}\n\nstatic XML_Char *\ncopyString(const XML_Char *s, const XML_Memory_Handling_Suite *memsuite) {\n int charsRequired = 0;\n XML_Char *result;\n\n /* First determine how long the string is */\n while (s[charsRequired] != 0) {\n charsRequired++;\n }\n /* Include the terminator */\n charsRequired++;\n\n /* Now allocate space for the copy */\n result = memsuite->malloc_fcn(charsRequired * sizeof(XML_Char));\n if (result == NULL)\n return NULL;\n /* Copy the original into place */\n memcpy(result, s, charsRequired * sizeof(XML_Char));\n return result;\n}\n"},"func_before":{"kind":"string","value":"externalParEntProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n const char *next = s;\n int tok;\n\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n if (tok <= 0) {\n if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_NONE: /* start == end */\n default:\n break;\n }\n }\n /* This would cause the next stage, i.e. doProlog to be passed XML_TOK_BOM.\n However, when parsing an external subset, doProlog will not accept a BOM\n as valid, and report a syntax error, so we have to skip the BOM\n */\n else if (tok == XML_TOK_BOM) {\n s = next;\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n }\n\n parser->m_processor = prologProcessor;\n return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer);\n}"},"func_after":{"kind":"string","value":"externalParEntProcessor(XML_Parser parser, const char *s, const char *end,\n const char **nextPtr) {\n const char *next = s;\n int tok;\n\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n if (tok <= 0) {\n if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {\n *nextPtr = s;\n return XML_ERROR_NONE;\n }\n switch (tok) {\n case XML_TOK_INVALID:\n return XML_ERROR_INVALID_TOKEN;\n case XML_TOK_PARTIAL:\n return XML_ERROR_UNCLOSED_TOKEN;\n case XML_TOK_PARTIAL_CHAR:\n return XML_ERROR_PARTIAL_CHAR;\n case XML_TOK_NONE: /* start == end */\n default:\n break;\n }\n }\n /* This would cause the next stage, i.e. doProlog to be passed XML_TOK_BOM.\n However, when parsing an external subset, doProlog will not accept a BOM\n as valid, and report a syntax error, so we have to skip the BOM\n */\n else if (tok == XML_TOK_BOM) {\n s = next;\n tok = XmlPrologTok(parser->m_encoding, s, end, &next);\n }\n\n parser->m_processor = prologProcessor;\n return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,\n (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE);\n}"},"diff":{"kind":"string","value":"{'added': [(404, ' XML_Bool haveMore, XML_Bool allowClosingDoctype);'), (4049, ' (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE);'), (4093, ' (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE);'), (4098, ' int tok, const char *next, const char **nextPtr, XML_Bool haveMore,'), (4099, ' XML_Bool allowClosingDoctype) {'), (4275, ' if (allowClosingDoctype != XML_TRUE) {'), (4276, ' /* Must not close doctype from within expanded parameter entities */'), (4277, ' return XML_ERROR_INVALID_TOKEN;'), (4278, ' }'), (4279, ''), (5183, ' tok, next, &next, XML_FALSE, XML_FALSE);'), (5226, ' tok, next, &next, XML_FALSE, XML_TRUE);'), (5253, ' (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE);')], 'deleted': [(404, ' XML_Bool haveMore);'), (4049, ' (XML_Bool)! parser->m_parsingStatus.finalBuffer);'), (4093, ' (XML_Bool)! parser->m_parsingStatus.finalBuffer);'), (4098, ' int tok, const char *next, const char **nextPtr, XML_Bool haveMore) {'), (5177, ' tok, next, &next, XML_FALSE);'), (5220, ' tok, next, &next, XML_FALSE);'), (5247, ' (XML_Bool)! parser->m_parsingStatus.finalBuffer);')]}"},"num_lines_added":{"kind":"number","value":13,"string":"13"},"num_lines_deleted":{"kind":"number","value":7,"string":"7"},"num_lines_in_file":{"kind":"number","value":5538,"string":"5,538"},"num_tokens_in_file":{"kind":"number","value":34488,"string":"34,488"},"num_lines_in_method":{"kind":"number","value":30,"string":"30"},"num_tokens_in_method":{"kind":"number","value":175,"string":"175"},"method_complexity":{"kind":"number","value":9,"string":"9"},"repo":{"kind":"string","value":"https://github.com/libexpat/libexpat"},"cve_id":{"kind":"string","value":"CVE-2019-15903"},"cwe_id":{"kind":"string","value":"CWE-125"}}},{"rowIdx":387,"cells":{"id":{"kind":"number","value":3096,"string":"3,096"},"file_name":{"kind":"string","value":"terminal.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"create_pty_only"},"code_before":{"kind":"string","value":"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the Vim source code.\n */\n\n/*\n * Terminal window support, see \":help :terminal\".\n *\n * There are three parts:\n * 1. Generic code for all systems.\n * Uses libvterm for the terminal emulator.\n * 2. The MS-Windows implementation.\n * Uses winpty.\n * 3. The Unix-like implementation.\n * Uses pseudo-tty's (pty's).\n *\n * For each terminal one VTerm is constructed. This uses libvterm. A copy of\n * this library is in the libvterm directory.\n *\n * When a terminal window is opened, a job is started that will be connected to\n * the terminal emulator.\n *\n * If the terminal window has keyboard focus, typed keys are converted to the\n * terminal encoding and writing to the job over a channel.\n *\n * If the job produces output, it is written to the terminal emulator. The\n * terminal emulator invokes callbacks when its screen content changes. The\n * line range is stored in tl_dirty_row_start and tl_dirty_row_end. Once in a\n * while, if the terminal window is visible, the screen contents is drawn.\n *\n * When the job ends the text is put in a buffer. Redrawing then happens from\n * that buffer, attributes come from the scrollback buffer tl_scrollback.\n * When the buffer is changed it is turned into a normal buffer, the attributes\n * in tl_scrollback are no longer used.\n */\n\n#include \"vim.h\"\n\n#if defined(FEAT_TERMINAL) || defined(PROTO)\n\n#ifndef MIN\n# define MIN(x,y) ((x) < (y) ? (x) : (y))\n#endif\n#ifndef MAX\n# define MAX(x,y) ((x) > (y) ? (x) : (y))\n#endif\n\n#include \"libvterm/include/vterm.h\"\n\n/* This is VTermScreenCell without the characters, thus much smaller. */\ntypedef struct {\n VTermScreenCellAttrs\tattrs;\n char\t\t\twidth;\n VTermColor\t\tfg;\n VTermColor\t\tbg;\n} cellattr_T;\n\ntypedef struct sb_line_S {\n int\t\tsb_cols;\t/* can differ per line */\n cellattr_T\t*sb_cells;\t/* allocated */\n cellattr_T\tsb_fill_attr;\t/* for short line */\n} sb_line_T;\n\n/* typedef term_T in structs.h */\nstruct terminal_S {\n term_T\t*tl_next;\n\n VTerm\t*tl_vterm;\n job_T\t*tl_job;\n buf_T\t*tl_buffer;\n#if defined(FEAT_GUI)\n int\t\ttl_system;\t/* when non-zero used for :!cmd output */\n int\t\ttl_toprow;\t/* row with first line of system terminal */\n#endif\n\n /* Set when setting the size of a vterm, reset after redrawing. */\n int\t\ttl_vterm_size_changed;\n\n int\t\ttl_normal_mode; /* TRUE: Terminal-Normal mode */\n int\t\ttl_channel_closed;\n int\t\ttl_channel_recently_closed; // still need to handle tl_finish\n\n int\t\ttl_finish;\n#define TL_FINISH_UNSET\t NUL\n#define TL_FINISH_CLOSE\t 'c'\t/* ++close or :terminal without argument */\n#define TL_FINISH_NOCLOSE 'n'\t/* ++noclose */\n#define TL_FINISH_OPEN\t 'o'\t/* ++open */\n char_u\t*tl_opencmd;\n char_u\t*tl_eof_chars;\n\n#ifdef WIN3264\n void\t*tl_winpty_config;\n void\t*tl_winpty;\n\n FILE\t*tl_out_fd;\n#endif\n#if defined(FEAT_SESSION)\n char_u\t*tl_command;\n#endif\n char_u\t*tl_kill;\n\n /* last known vterm size */\n int\t\ttl_rows;\n int\t\ttl_cols;\n\n char_u\t*tl_title; /* NULL or allocated */\n char_u\t*tl_status_text; /* NULL or allocated */\n\n /* Range of screen rows to update. Zero based. */\n int\t\ttl_dirty_row_start; /* MAX_ROW if nothing dirty */\n int\t\ttl_dirty_row_end; /* row below last one to update */\n int\t\ttl_dirty_snapshot; /* text updated after making snapshot */\n#ifdef FEAT_TIMERS\n int\t\ttl_timer_set;\n proftime_T\ttl_timer_due;\n#endif\n int\t\ttl_postponed_scroll;\t/* to be scrolled up */\n\n garray_T\ttl_scrollback;\n int\t\ttl_scrollback_scrolled;\n cellattr_T\ttl_default_color;\n\n linenr_T\ttl_top_diff_rows; /* rows of top diff file or zero */\n linenr_T\ttl_bot_diff_rows; /* rows of bottom diff file */\n\n VTermPos\ttl_cursor_pos;\n int\t\ttl_cursor_visible;\n int\t\ttl_cursor_blink;\n int\t\ttl_cursor_shape; /* 1: block, 2: underline, 3: bar */\n char_u\t*tl_cursor_color; /* NULL or allocated */\n\n int\t\ttl_using_altscreen;\n};\n\n#define TMODE_ONCE 1\t /* CTRL-\\ CTRL-N used */\n#define TMODE_LOOP 2\t /* CTRL-W N used */\n\n/*\n * List of all active terminals.\n */\nstatic term_T *first_term = NULL;\n\n/* Terminal active in terminal_loop(). */\nstatic term_T *in_terminal_loop = NULL;\n\n#define MAX_ROW 999999\t /* used for tl_dirty_row_end to update all rows */\n#define KEY_BUF_LEN 200\n\n/*\n * Functions with separate implementation for MS-Windows and Unix-like systems.\n */\nstatic int term_and_job_init(term_T *term, typval_T *argvar, char **argv, jobopt_T *opt, jobopt_T *orig_opt);\nstatic int create_pty_only(term_T *term, jobopt_T *opt);\nstatic void term_report_winsize(term_T *term, int rows, int cols);\nstatic void term_free_vterm(term_T *term);\n#ifdef FEAT_GUI\nstatic void update_system_term(term_T *term);\n#endif\n\n/* The character that we know (or assume) that the terminal expects for the\n * backspace key. */\nstatic int term_backspace_char = BS;\n\n/* \"Terminal\" highlight group colors. */\nstatic int term_default_cterm_fg = -1;\nstatic int term_default_cterm_bg = -1;\n\n/* Store the last set and the desired cursor properties, so that we only update\n * them when needed. Doing it unnecessary may result in flicker. */\nstatic char_u\t*last_set_cursor_color = NULL;\nstatic char_u\t*desired_cursor_color = NULL;\nstatic int\tlast_set_cursor_shape = -1;\nstatic int\tdesired_cursor_shape = -1;\nstatic int\tlast_set_cursor_blink = -1;\nstatic int\tdesired_cursor_blink = -1;\n\n\n/**************************************\n * 1. Generic code for all systems.\n */\n\n static int\ncursor_color_equal(char_u *lhs_color, char_u *rhs_color)\n{\n if (lhs_color != NULL && rhs_color != NULL)\n\treturn STRCMP(lhs_color, rhs_color) == 0;\n return lhs_color == NULL && rhs_color == NULL;\n}\n\n static void\ncursor_color_copy(char_u **to_color, char_u *from_color)\n{\n // Avoid a free & alloc if the value is already right.\n if (cursor_color_equal(*to_color, from_color))\n\treturn;\n vim_free(*to_color);\n *to_color = (from_color == NULL) ? NULL : vim_strsave(from_color);\n}\n\n static char_u *\ncursor_color_get(char_u *color)\n{\n return (color == NULL) ? (char_u *)\"\" : color;\n}\n\n\n/*\n * Parse 'termwinsize' and set \"rows\" and \"cols\" for the terminal size in the\n * current window.\n * Sets \"rows\" and/or \"cols\" to zero when it should follow the window size.\n * Return TRUE if the size is the minimum size: \"24*80\".\n */\n static int\nparse_termwinsize(win_T *wp, int *rows, int *cols)\n{\n int\tminsize = FALSE;\n\n *rows = 0;\n *cols = 0;\n\n if (*wp->w_p_tws != NUL)\n {\n\tchar_u *p = vim_strchr(wp->w_p_tws, 'x');\n\n\t/* Syntax of value was already checked when it's set. */\n\tif (p == NULL)\n\t{\n\t minsize = TRUE;\n\t p = vim_strchr(wp->w_p_tws, '*');\n\t}\n\t*rows = atoi((char *)wp->w_p_tws);\n\t*cols = atoi((char *)p + 1);\n }\n return minsize;\n}\n\n/*\n * Determine the terminal size from 'termwinsize' and the current window.\n */\n static void\nset_term_and_win_size(term_T *term)\n{\n#ifdef FEAT_GUI\n if (term->tl_system)\n {\n\t/* Use the whole screen for the system command. However, it will start\n\t * at the command line and scroll up as needed, using tl_toprow. */\n\tterm->tl_rows = Rows;\n\tterm->tl_cols = Columns;\n\treturn;\n }\n#endif\n if (parse_termwinsize(curwin, &term->tl_rows, &term->tl_cols))\n {\n\tif (term->tl_rows != 0)\n\t term->tl_rows = MAX(term->tl_rows, curwin->w_height);\n\tif (term->tl_cols != 0)\n\t term->tl_cols = MAX(term->tl_cols, curwin->w_width);\n }\n if (term->tl_rows == 0)\n\tterm->tl_rows = curwin->w_height;\n else\n\twin_setheight_win(term->tl_rows, curwin);\n if (term->tl_cols == 0)\n\tterm->tl_cols = curwin->w_width;\n else\n\twin_setwidth_win(term->tl_cols, curwin);\n}\n\n/*\n * Initialize job options for a terminal job.\n * Caller may overrule some of them.\n */\n void\ninit_job_options(jobopt_T *opt)\n{\n clear_job_options(opt);\n\n opt->jo_mode = MODE_RAW;\n opt->jo_out_mode = MODE_RAW;\n opt->jo_err_mode = MODE_RAW;\n opt->jo_set = JO_MODE | JO_OUT_MODE | JO_ERR_MODE;\n}\n\n/*\n * Set job options mandatory for a terminal job.\n */\n static void\nsetup_job_options(jobopt_T *opt, int rows, int cols)\n{\n#ifndef WIN3264\n /* Win32: Redirecting the job output won't work, thus always connect stdout\n * here. */\n if (!(opt->jo_set & JO_OUT_IO))\n#endif\n {\n\t/* Connect stdout to the terminal. */\n\topt->jo_io[PART_OUT] = JIO_BUFFER;\n\topt->jo_io_buf[PART_OUT] = curbuf->b_fnum;\n\topt->jo_modifiable[PART_OUT] = 0;\n\topt->jo_set |= JO_OUT_IO + JO_OUT_BUF + JO_OUT_MODIFIABLE;\n }\n\n#ifndef WIN3264\n /* Win32: Redirecting the job output won't work, thus always connect stderr\n * here. */\n if (!(opt->jo_set & JO_ERR_IO))\n#endif\n {\n\t/* Connect stderr to the terminal. */\n\topt->jo_io[PART_ERR] = JIO_BUFFER;\n\topt->jo_io_buf[PART_ERR] = curbuf->b_fnum;\n\topt->jo_modifiable[PART_ERR] = 0;\n\topt->jo_set |= JO_ERR_IO + JO_ERR_BUF + JO_ERR_MODIFIABLE;\n }\n\n opt->jo_pty = TRUE;\n if ((opt->jo_set2 & JO2_TERM_ROWS) == 0)\n\topt->jo_term_rows = rows;\n if ((opt->jo_set2 & JO2_TERM_COLS) == 0)\n\topt->jo_term_cols = cols;\n}\n\n/*\n * Close a terminal buffer (and its window). Used when creating the terminal\n * fails.\n */\n static void\nterm_close_buffer(buf_T *buf, buf_T *old_curbuf)\n{\n free_terminal(buf);\n if (old_curbuf != NULL)\n {\n\t--curbuf->b_nwindows;\n\tcurbuf = old_curbuf;\n\tcurwin->w_buffer = curbuf;\n\t++curbuf->b_nwindows;\n }\n\n /* Wiping out the buffer will also close the window and call\n * free_terminal(). */\n do_buffer(DOBUF_WIPE, DOBUF_FIRST, FORWARD, buf->b_fnum, TRUE);\n}\n\n/*\n * Start a terminal window and return its buffer.\n * Use either \"argvar\" or \"argv\", the other must be NULL.\n * When \"flags\" has TERM_START_NOJOB only create the buffer, b_term and open\n * the window.\n * Returns NULL when failed.\n */\n buf_T *\nterm_start(\n\ttypval_T *argvar,\n\tchar\t **argv,\n\tjobopt_T *opt,\n\tint\t flags)\n{\n exarg_T\tsplit_ea;\n win_T\t*old_curwin = curwin;\n term_T\t*term;\n buf_T\t*old_curbuf = NULL;\n int\t\tres;\n buf_T\t*newbuf;\n int\t\tvertical = opt->jo_vertical || (cmdmod.split & WSP_VERT);\n jobopt_T\torig_opt; // only partly filled\n\n if (check_restricted() || check_secure())\n\treturn NULL;\n\n if ((opt->jo_set & (JO_IN_IO + JO_OUT_IO + JO_ERR_IO))\n\t\t\t\t\t == (JO_IN_IO + JO_OUT_IO + JO_ERR_IO)\n\t|| (!(opt->jo_set & JO_OUT_IO) && (opt->jo_set & JO_OUT_BUF))\n\t|| (!(opt->jo_set & JO_ERR_IO) && (opt->jo_set & JO_ERR_BUF)))\n {\n\tEMSG(_(e_invarg));\n\treturn NULL;\n }\n\n term = (term_T *)alloc_clear(sizeof(term_T));\n if (term == NULL)\n\treturn NULL;\n term->tl_dirty_row_end = MAX_ROW;\n term->tl_cursor_visible = TRUE;\n term->tl_cursor_shape = VTERM_PROP_CURSORSHAPE_BLOCK;\n term->tl_finish = opt->jo_term_finish;\n#ifdef FEAT_GUI\n term->tl_system = (flags & TERM_START_SYSTEM);\n#endif\n ga_init2(&term->tl_scrollback, sizeof(sb_line_T), 300);\n\n vim_memset(&split_ea, 0, sizeof(split_ea));\n if (opt->jo_curwin)\n {\n\t/* Create a new buffer in the current window. */\n\tif (!can_abandon(curbuf, flags & TERM_START_FORCEIT))\n\t{\n\t no_write_message();\n\t vim_free(term);\n\t return NULL;\n\t}\n\tif (do_ecmd(0, NULL, NULL, &split_ea, ECMD_ONE,\n\t\t ECMD_HIDE\n\t\t\t + ((flags & TERM_START_FORCEIT) ? ECMD_FORCEIT : 0),\n\t\t curwin) == FAIL)\n\t{\n\t vim_free(term);\n\t return NULL;\n\t}\n }\n else if (opt->jo_hidden || (flags & TERM_START_SYSTEM))\n {\n\tbuf_T *buf;\n\n\t/* Create a new buffer without a window. Make it the current buffer for\n\t * a moment to be able to do the initialisations. */\n\tbuf = buflist_new((char_u *)\"\", NULL, (linenr_T)0,\n\t\t\t\t\t\t\t BLN_NEW | BLN_LISTED);\n\tif (buf == NULL || ml_open(buf) == FAIL)\n\t{\n\t vim_free(term);\n\t return NULL;\n\t}\n\told_curbuf = curbuf;\n\t--curbuf->b_nwindows;\n\tcurbuf = buf;\n\tcurwin->w_buffer = buf;\n\t++curbuf->b_nwindows;\n }\n else\n {\n\t/* Open a new window or tab. */\n\tsplit_ea.cmdidx = CMD_new;\n\tsplit_ea.cmd = (char_u *)\"new\";\n\tsplit_ea.arg = (char_u *)\"\";\n\tif (opt->jo_term_rows > 0 && !vertical)\n\t{\n\t split_ea.line2 = opt->jo_term_rows;\n\t split_ea.addr_count = 1;\n\t}\n\tif (opt->jo_term_cols > 0 && vertical)\n\t{\n\t split_ea.line2 = opt->jo_term_cols;\n\t split_ea.addr_count = 1;\n\t}\n\n\tif (vertical)\n\t cmdmod.split |= WSP_VERT;\n\tex_splitview(&split_ea);\n\tif (curwin == old_curwin)\n\t{\n\t /* split failed */\n\t vim_free(term);\n\t return NULL;\n\t}\n }\n term->tl_buffer = curbuf;\n curbuf->b_term = term;\n\n if (!opt->jo_hidden)\n {\n\t/* Only one size was taken care of with :new, do the other one. With\n\t * \"curwin\" both need to be done. */\n\tif (opt->jo_term_rows > 0 && (opt->jo_curwin || vertical))\n\t win_setheight(opt->jo_term_rows);\n\tif (opt->jo_term_cols > 0 && (opt->jo_curwin || !vertical))\n\t win_setwidth(opt->jo_term_cols);\n }\n\n /* Link the new terminal in the list of active terminals. */\n term->tl_next = first_term;\n first_term = term;\n\n if (opt->jo_term_name != NULL)\n\tcurbuf->b_ffname = vim_strsave(opt->jo_term_name);\n else if (argv != NULL)\n\tcurbuf->b_ffname = vim_strsave((char_u *)\"!system\");\n else\n {\n\tint\ti;\n\tsize_t\tlen;\n\tchar_u\t*cmd, *p;\n\n\tif (argvar->v_type == VAR_STRING)\n\t{\n\t cmd = argvar->vval.v_string;\n\t if (cmd == NULL)\n\t\tcmd = (char_u *)\"\";\n\t else if (STRCMP(cmd, \"NONE\") == 0)\n\t\tcmd = (char_u *)\"pty\";\n\t}\n\telse if (argvar->v_type != VAR_LIST\n\t\t|| argvar->vval.v_list == NULL\n\t\t|| argvar->vval.v_list->lv_len < 1\n\t\t|| (cmd = tv_get_string_chk(\n\t\t\t &argvar->vval.v_list->lv_first->li_tv)) == NULL)\n\t cmd = (char_u*)\"\";\n\n\tlen = STRLEN(cmd) + 10;\n\tp = alloc((int)len);\n\n\tfor (i = 0; p != NULL; ++i)\n\t{\n\t /* Prepend a ! to the command name to avoid the buffer name equals\n\t * the executable, otherwise \":w!\" would overwrite it. */\n\t if (i == 0)\n\t\tvim_snprintf((char *)p, len, \"!%s\", cmd);\n\t else\n\t\tvim_snprintf((char *)p, len, \"!%s (%d)\", cmd, i);\n\t if (buflist_findname(p) == NULL)\n\t {\n\t\tvim_free(curbuf->b_ffname);\n\t\tcurbuf->b_ffname = p;\n\t\tbreak;\n\t }\n\t}\n }\n curbuf->b_fname = curbuf->b_ffname;\n\n if (opt->jo_term_opencmd != NULL)\n\tterm->tl_opencmd = vim_strsave(opt->jo_term_opencmd);\n\n if (opt->jo_eof_chars != NULL)\n\tterm->tl_eof_chars = vim_strsave(opt->jo_eof_chars);\n\n set_string_option_direct((char_u *)\"buftype\", -1,\n\t\t\t\t (char_u *)\"terminal\", OPT_FREE|OPT_LOCAL, 0);\n // Avoid that 'buftype' is reset when this buffer is entered.\n curbuf->b_p_initialized = TRUE;\n\n /* Mark the buffer as not modifiable. It can only be made modifiable after\n * the job finished. */\n curbuf->b_p_ma = FALSE;\n\n set_term_and_win_size(term);\n#ifdef WIN3264\n mch_memmove(orig_opt.jo_io, opt->jo_io, sizeof(orig_opt.jo_io));\n#endif\n setup_job_options(opt, term->tl_rows, term->tl_cols);\n\n if (flags & TERM_START_NOJOB)\n\treturn curbuf;\n\n#if defined(FEAT_SESSION)\n /* Remember the command for the session file. */\n if (opt->jo_term_norestore || argv != NULL)\n {\n\tterm->tl_command = vim_strsave((char_u *)\"NONE\");\n }\n else if (argvar->v_type == VAR_STRING)\n {\n\tchar_u\t*cmd = argvar->vval.v_string;\n\n\tif (cmd != NULL && STRCMP(cmd, p_sh) != 0)\n\t term->tl_command = vim_strsave(cmd);\n }\n else if (argvar->v_type == VAR_LIST\n\t && argvar->vval.v_list != NULL\n\t && argvar->vval.v_list->lv_len > 0)\n {\n\tgarray_T\tga;\n\tlistitem_T\t*item;\n\n\tga_init2(&ga, 1, 100);\n\tfor (item = argvar->vval.v_list->lv_first;\n\t\t\t\t\titem != NULL; item = item->li_next)\n\t{\n\t char_u *s = tv_get_string_chk(&item->li_tv);\n\t char_u *p;\n\n\t if (s == NULL)\n\t\tbreak;\n\t p = vim_strsave_fnameescape(s, FALSE);\n\t if (p == NULL)\n\t\tbreak;\n\t ga_concat(&ga, p);\n\t vim_free(p);\n\t ga_append(&ga, ' ');\n\t}\n\tif (item == NULL)\n\t{\n\t ga_append(&ga, NUL);\n\t term->tl_command = ga.ga_data;\n\t}\n\telse\n\t ga_clear(&ga);\n }\n#endif\n\n if (opt->jo_term_kill != NULL)\n {\n\tchar_u *p = skiptowhite(opt->jo_term_kill);\n\n\tterm->tl_kill = vim_strnsave(opt->jo_term_kill, p - opt->jo_term_kill);\n }\n\n /* System dependent: setup the vterm and maybe start the job in it. */\n if (argv == NULL\n\t && argvar->v_type == VAR_STRING\n\t && argvar->vval.v_string != NULL\n\t && STRCMP(argvar->vval.v_string, \"NONE\") == 0)\n\tres = create_pty_only(term, opt);\n else\n\tres = term_and_job_init(term, argvar, argv, opt, &orig_opt);\n\n newbuf = curbuf;\n if (res == OK)\n {\n\t/* Get and remember the size we ended up with. Update the pty. */\n\tvterm_get_size(term->tl_vterm, &term->tl_rows, &term->tl_cols);\n\tterm_report_winsize(term, term->tl_rows, term->tl_cols);\n#ifdef FEAT_GUI\n\tif (term->tl_system)\n\t{\n\t /* display first line below typed command */\n\t term->tl_toprow = msg_row + 1;\n\t term->tl_dirty_row_end = 0;\n\t}\n#endif\n\n\t/* Make sure we don't get stuck on sending keys to the job, it leads to\n\t * a deadlock if the job is waiting for Vim to read. */\n\tchannel_set_nonblock(term->tl_job->jv_channel, PART_IN);\n\n\tif (old_curbuf != NULL)\n\t{\n\t --curbuf->b_nwindows;\n\t curbuf = old_curbuf;\n\t curwin->w_buffer = curbuf;\n\t ++curbuf->b_nwindows;\n\t}\n }\n else\n {\n\tterm_close_buffer(curbuf, old_curbuf);\n\treturn NULL;\n }\n\n apply_autocmds(EVENT_TERMINALOPEN, NULL, NULL, FALSE, newbuf);\n return newbuf;\n}\n\n/*\n * \":terminal\": open a terminal window and execute a job in it.\n */\n void\nex_terminal(exarg_T *eap)\n{\n typval_T\targvar[2];\n jobopt_T\topt;\n char_u\t*cmd;\n char_u\t*tofree = NULL;\n\n init_job_options(&opt);\n\n cmd = eap->arg;\n while (*cmd == '+' && *(cmd + 1) == '+')\n {\n\tchar_u *p, *ep;\n\n\tcmd += 2;\n\tp = skiptowhite(cmd);\n\tep = vim_strchr(cmd, '=');\n\tif (ep != NULL && ep < p)\n\t p = ep;\n\n\tif ((int)(p - cmd) == 5 && STRNICMP(cmd, \"close\", 5) == 0)\n\t opt.jo_term_finish = 'c';\n\telse if ((int)(p - cmd) == 7 && STRNICMP(cmd, \"noclose\", 7) == 0)\n\t opt.jo_term_finish = 'n';\n\telse if ((int)(p - cmd) == 4 && STRNICMP(cmd, \"open\", 4) == 0)\n\t opt.jo_term_finish = 'o';\n\telse if ((int)(p - cmd) == 6 && STRNICMP(cmd, \"curwin\", 6) == 0)\n\t opt.jo_curwin = 1;\n\telse if ((int)(p - cmd) == 6 && STRNICMP(cmd, \"hidden\", 6) == 0)\n\t opt.jo_hidden = 1;\n\telse if ((int)(p - cmd) == 9 && STRNICMP(cmd, \"norestore\", 9) == 0)\n\t opt.jo_term_norestore = 1;\n\telse if ((int)(p - cmd) == 4 && STRNICMP(cmd, \"kill\", 4) == 0\n\t\t&& ep != NULL)\n\t{\n\t opt.jo_set2 |= JO2_TERM_KILL;\n\t opt.jo_term_kill = ep + 1;\n\t p = skiptowhite(cmd);\n\t}\n\telse if ((int)(p - cmd) == 4 && STRNICMP(cmd, \"rows\", 4) == 0\n\t\t&& ep != NULL && isdigit(ep[1]))\n\t{\n\t opt.jo_set2 |= JO2_TERM_ROWS;\n\t opt.jo_term_rows = atoi((char *)ep + 1);\n\t p = skiptowhite(cmd);\n\t}\n\telse if ((int)(p - cmd) == 4 && STRNICMP(cmd, \"cols\", 4) == 0\n\t\t&& ep != NULL && isdigit(ep[1]))\n\t{\n\t opt.jo_set2 |= JO2_TERM_COLS;\n\t opt.jo_term_cols = atoi((char *)ep + 1);\n\t p = skiptowhite(cmd);\n\t}\n\telse if ((int)(p - cmd) == 3 && STRNICMP(cmd, \"eof\", 3) == 0\n\t\t\t\t\t\t\t\t && ep != NULL)\n\t{\n\t char_u *buf = NULL;\n\t char_u *keys;\n\n\t p = skiptowhite(cmd);\n\t *p = NUL;\n\t keys = replace_termcodes(ep + 1, &buf, TRUE, TRUE, TRUE);\n\t opt.jo_set2 |= JO2_EOF_CHARS;\n\t opt.jo_eof_chars = vim_strsave(keys);\n\t vim_free(buf);\n\t *p = ' ';\n\t}\n\telse\n\t{\n\t if (*p)\n\t\t*p = NUL;\n\t EMSG2(_(\"E181: Invalid attribute: %s\"), cmd);\n\t goto theend;\n\t}\n\tcmd = skipwhite(p);\n }\n if (*cmd == NUL)\n {\n\t/* Make a copy of 'shell', an autocommand may change the option. */\n\ttofree = cmd = vim_strsave(p_sh);\n\n\t/* default to close when the shell exits */\n\tif (opt.jo_term_finish == NUL)\n\t opt.jo_term_finish = 'c';\n }\n\n if (eap->addr_count > 0)\n {\n\t/* Write lines from current buffer to the job. */\n\topt.jo_set |= JO_IN_IO | JO_IN_BUF | JO_IN_TOP | JO_IN_BOT;\n\topt.jo_io[PART_IN] = JIO_BUFFER;\n\topt.jo_io_buf[PART_IN] = curbuf->b_fnum;\n\topt.jo_in_top = eap->line1;\n\topt.jo_in_bot = eap->line2;\n }\n\n argvar[0].v_type = VAR_STRING;\n argvar[0].vval.v_string = cmd;\n argvar[1].v_type = VAR_UNKNOWN;\n term_start(argvar, NULL, &opt, eap->forceit ? TERM_START_FORCEIT : 0);\n vim_free(tofree);\n\ntheend:\n vim_free(opt.jo_eof_chars);\n}\n\n#if defined(FEAT_SESSION) || defined(PROTO)\n/*\n * Write a :terminal command to the session file to restore the terminal in\n * window \"wp\".\n * Return FAIL if writing fails.\n */\n int\nterm_write_session(FILE *fd, win_T *wp)\n{\n term_T *term = wp->w_buffer->b_term;\n\n /* Create the terminal and run the command. This is not without\n * risk, but let's assume the user only creates a session when this\n * will be OK. */\n if (fprintf(fd, \"terminal ++curwin ++cols=%d ++rows=%d \",\n\t\tterm->tl_cols, term->tl_rows) < 0)\n\treturn FAIL;\n if (term->tl_command != NULL && fputs((char *)term->tl_command, fd) < 0)\n\treturn FAIL;\n\n return put_eol(fd);\n}\n\n/*\n * Return TRUE if \"buf\" has a terminal that should be restored.\n */\n int\nterm_should_restore(buf_T *buf)\n{\n term_T\t*term = buf->b_term;\n\n return term != NULL && (term->tl_command == NULL\n\t\t\t\t || STRCMP(term->tl_command, \"NONE\") != 0);\n}\n#endif\n\n/*\n * Free the scrollback buffer for \"term\".\n */\n static void\nfree_scrollback(term_T *term)\n{\n int i;\n\n for (i = 0; i < term->tl_scrollback.ga_len; ++i)\n\tvim_free(((sb_line_T *)term->tl_scrollback.ga_data + i)->sb_cells);\n ga_clear(&term->tl_scrollback);\n}\n\n/*\n * Free a terminal and everything it refers to.\n * Kills the job if there is one.\n * Called when wiping out a buffer.\n */\n void\nfree_terminal(buf_T *buf)\n{\n term_T\t*term = buf->b_term;\n term_T\t*tp;\n\n if (term == NULL)\n\treturn;\n if (first_term == term)\n\tfirst_term = term->tl_next;\n else\n\tfor (tp = first_term; tp->tl_next != NULL; tp = tp->tl_next)\n\t if (tp->tl_next == term)\n\t {\n\t\ttp->tl_next = term->tl_next;\n\t\tbreak;\n\t }\n\n if (term->tl_job != NULL)\n {\n\tif (term->tl_job->jv_status != JOB_ENDED\n\t\t&& term->tl_job->jv_status != JOB_FINISHED\n\t\t&& term->tl_job->jv_status != JOB_FAILED)\n\t job_stop(term->tl_job, NULL, \"kill\");\n\tjob_unref(term->tl_job);\n }\n\n free_scrollback(term);\n\n term_free_vterm(term);\n vim_free(term->tl_title);\n#ifdef FEAT_SESSION\n vim_free(term->tl_command);\n#endif\n vim_free(term->tl_kill);\n vim_free(term->tl_status_text);\n vim_free(term->tl_opencmd);\n vim_free(term->tl_eof_chars);\n#ifdef WIN3264\n if (term->tl_out_fd != NULL)\n\tfclose(term->tl_out_fd);\n#endif\n vim_free(term->tl_cursor_color);\n vim_free(term);\n buf->b_term = NULL;\n if (in_terminal_loop == term)\n\tin_terminal_loop = NULL;\n}\n\n/*\n * Get the part that is connected to the tty. Normally this is PART_IN, but\n * when writing buffer lines to the job it can be another. This makes it\n * possible to do \"1,5term vim -\".\n */\n static ch_part_T\nget_tty_part(term_T *term)\n{\n#ifdef UNIX\n ch_part_T\tparts[3] = {PART_IN, PART_OUT, PART_ERR};\n int\t\ti;\n\n for (i = 0; i < 3; ++i)\n {\n\tint fd = term->tl_job->jv_channel->ch_part[parts[i]].ch_fd;\n\n\tif (isatty(fd))\n\t return parts[i];\n }\n#endif\n return PART_IN;\n}\n\n/*\n * Write job output \"msg[len]\" to the vterm.\n */\n static void\nterm_write_job_output(term_T *term, char_u *msg, size_t len)\n{\n VTerm\t*vterm = term->tl_vterm;\n size_t\tprevlen = vterm_output_get_buffer_current(vterm);\n\n vterm_input_write(vterm, (char *)msg, len);\n\n /* flush vterm buffer when vterm responded to control sequence */\n if (prevlen != vterm_output_get_buffer_current(vterm))\n {\n\tchar buf[KEY_BUF_LEN];\n\tsize_t curlen = vterm_output_read(vterm, buf, KEY_BUF_LEN);\n\n\tif (curlen > 0)\n\t channel_send(term->tl_job->jv_channel, get_tty_part(term),\n\t\t\t\t\t (char_u *)buf, (int)curlen, NULL);\n }\n\n /* this invokes the damage callbacks */\n vterm_screen_flush_damage(vterm_obtain_screen(vterm));\n}\n\n static void\nupdate_cursor(term_T *term, int redraw)\n{\n if (term->tl_normal_mode)\n\treturn;\n#ifdef FEAT_GUI\n if (term->tl_system)\n\twindgoto(term->tl_cursor_pos.row + term->tl_toprow,\n\t\t\t\t\t\t term->tl_cursor_pos.col);\n else\n#endif\n\tsetcursor();\n if (redraw)\n {\n\tif (term->tl_buffer == curbuf && term->tl_cursor_visible)\n\t cursor_on();\n\tout_flush();\n#ifdef FEAT_GUI\n\tif (gui.in_use)\n\t{\n\t gui_update_cursor(FALSE, FALSE);\n\t gui_mch_flush();\n\t}\n#endif\n }\n}\n\n/*\n * Invoked when \"msg\" output from a job was received. Write it to the terminal\n * of \"buffer\".\n */\n void\nwrite_to_term(buf_T *buffer, char_u *msg, channel_T *channel)\n{\n size_t\tlen = STRLEN(msg);\n term_T\t*term = buffer->b_term;\n\n#ifdef WIN3264\n /* Win32: Cannot redirect output of the job, intercept it here and write to\n * the file. */\n if (term->tl_out_fd != NULL)\n {\n\tch_log(channel, \"Writing %d bytes to output file\", (int)len);\n\tfwrite(msg, len, 1, term->tl_out_fd);\n\treturn;\n }\n#endif\n\n if (term->tl_vterm == NULL)\n {\n\tch_log(channel, \"NOT writing %d bytes to terminal\", (int)len);\n\treturn;\n }\n ch_log(channel, \"writing %d bytes to terminal\", (int)len);\n term_write_job_output(term, msg, len);\n\n#ifdef FEAT_GUI\n if (term->tl_system)\n {\n\t/* show system output, scrolling up the screen as needed */\n\tupdate_system_term(term);\n\tupdate_cursor(term, TRUE);\n }\n else\n#endif\n /* In Terminal-Normal mode we are displaying the buffer, not the terminal\n * contents, thus no screen update is needed. */\n if (!term->tl_normal_mode)\n {\n\t// Don't use update_screen() when editing the command line, it gets\n\t// cleared.\n\t// TODO: only update once in a while.\n\tch_log(term->tl_job->jv_channel, \"updating screen\");\n\tif (buffer == curbuf && (State & CMDLINE) == 0)\n\t{\n\t update_screen(VALID_NO_UPDATE);\n\t /* update_screen() can be slow, check the terminal wasn't closed\n\t * already */\n\t if (buffer == curbuf && curbuf->b_term != NULL)\n\t\tupdate_cursor(curbuf->b_term, TRUE);\n\t}\n\telse\n\t redraw_after_callback(TRUE);\n }\n}\n\n/*\n * Send a mouse position and click to the vterm\n */\n static int\nterm_send_mouse(VTerm *vterm, int button, int pressed)\n{\n VTermModifier mod = VTERM_MOD_NONE;\n\n vterm_mouse_move(vterm, mouse_row - W_WINROW(curwin),\n\t\t\t\t\t mouse_col - curwin->w_wincol, mod);\n if (button != 0)\n\tvterm_mouse_button(vterm, button, pressed, mod);\n return TRUE;\n}\n\nstatic int enter_mouse_col = -1;\nstatic int enter_mouse_row = -1;\n\n/*\n * Handle a mouse click, drag or release.\n * Return TRUE when a mouse event is sent to the terminal.\n */\n static int\nterm_mouse_click(VTerm *vterm, int key)\n{\n#if defined(FEAT_CLIPBOARD)\n /* For modeless selection mouse drag and release events are ignored, unless\n * they are preceded with a mouse down event */\n static int\t ignore_drag_release = TRUE;\n VTermMouseState mouse_state;\n\n vterm_state_get_mousestate(vterm_obtain_state(vterm), &mouse_state);\n if (mouse_state.flags == 0)\n {\n\t/* Terminal is not using the mouse, use modeless selection. */\n\tswitch (key)\n\t{\n\tcase K_LEFTDRAG:\n\tcase K_LEFTRELEASE:\n\tcase K_RIGHTDRAG:\n\tcase K_RIGHTRELEASE:\n\t\t/* Ignore drag and release events when the button-down wasn't\n\t\t * seen before. */\n\t\tif (ignore_drag_release)\n\t\t{\n\t\t int save_mouse_col, save_mouse_row;\n\n\t\t if (enter_mouse_col < 0)\n\t\t\tbreak;\n\n\t\t /* mouse click in the window gave us focus, handle that\n\t\t * click now */\n\t\t save_mouse_col = mouse_col;\n\t\t save_mouse_row = mouse_row;\n\t\t mouse_col = enter_mouse_col;\n\t\t mouse_row = enter_mouse_row;\n\t\t clip_modeless(MOUSE_LEFT, TRUE, FALSE);\n\t\t mouse_col = save_mouse_col;\n\t\t mouse_row = save_mouse_row;\n\t\t}\n\t\t/* FALLTHROUGH */\n\tcase K_LEFTMOUSE:\n\tcase K_RIGHTMOUSE:\n\t\tif (key == K_LEFTRELEASE || key == K_RIGHTRELEASE)\n\t\t ignore_drag_release = TRUE;\n\t\telse\n\t\t ignore_drag_release = FALSE;\n\t\t/* Should we call mouse_has() here? */\n\t\tif (clip_star.available)\n\t\t{\n\t\t int\t button, is_click, is_drag;\n\n\t\t button = get_mouse_button(KEY2TERMCAP1(key),\n\t\t\t\t\t\t\t &is_click, &is_drag);\n\t\t if (mouse_model_popup() && button == MOUSE_LEFT\n\t\t\t\t\t && (mod_mask & MOD_MASK_SHIFT))\n\t\t {\n\t\t\t/* Translate shift-left to right button. */\n\t\t\tbutton = MOUSE_RIGHT;\n\t\t\tmod_mask &= ~MOD_MASK_SHIFT;\n\t\t }\n\t\t clip_modeless(button, is_click, is_drag);\n\t\t}\n\t\tbreak;\n\n\tcase K_MIDDLEMOUSE:\n\t\tif (clip_star.available)\n\t\t insert_reg('*', TRUE);\n\t\tbreak;\n\t}\n\tenter_mouse_col = -1;\n\treturn FALSE;\n }\n#endif\n enter_mouse_col = -1;\n\n switch (key)\n {\n\tcase K_LEFTMOUSE:\n\tcase K_LEFTMOUSE_NM:\tterm_send_mouse(vterm, 1, 1); break;\n\tcase K_LEFTDRAG:\tterm_send_mouse(vterm, 1, 1); break;\n\tcase K_LEFTRELEASE:\n\tcase K_LEFTRELEASE_NM:\tterm_send_mouse(vterm, 1, 0); break;\n\tcase K_MOUSEMOVE:\tterm_send_mouse(vterm, 0, 0); break;\n\tcase K_MIDDLEMOUSE:\tterm_send_mouse(vterm, 2, 1); break;\n\tcase K_MIDDLEDRAG:\tterm_send_mouse(vterm, 2, 1); break;\n\tcase K_MIDDLERELEASE:\tterm_send_mouse(vterm, 2, 0); break;\n\tcase K_RIGHTMOUSE:\tterm_send_mouse(vterm, 3, 1); break;\n\tcase K_RIGHTDRAG:\tterm_send_mouse(vterm, 3, 1); break;\n\tcase K_RIGHTRELEASE:\tterm_send_mouse(vterm, 3, 0); break;\n }\n return TRUE;\n}\n\n/*\n * Convert typed key \"c\" into bytes to send to the job.\n * Return the number of bytes in \"buf\".\n */\n static int\nterm_convert_key(term_T *term, int c, char *buf)\n{\n VTerm\t *vterm = term->tl_vterm;\n VTermKey\t key = VTERM_KEY_NONE;\n VTermModifier mod = VTERM_MOD_NONE;\n int\t\t other = FALSE;\n\n switch (c)\n {\n\t/* don't use VTERM_KEY_ENTER, it may do an unwanted conversion */\n\n\t\t\t\t/* don't use VTERM_KEY_BACKSPACE, it always\n\t\t\t\t * becomes 0x7f DEL */\n\tcase K_BS:\t\tc = term_backspace_char; break;\n\n\tcase ESC:\t\tkey = VTERM_KEY_ESCAPE; break;\n\tcase K_DEL:\t\tkey = VTERM_KEY_DEL; break;\n\tcase K_DOWN:\t\tkey = VTERM_KEY_DOWN; break;\n\tcase K_S_DOWN:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_DOWN; break;\n\tcase K_END:\t\tkey = VTERM_KEY_END; break;\n\tcase K_S_END:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_END; break;\n\tcase K_C_END:\t\tmod = VTERM_MOD_CTRL;\n\t\t\t\tkey = VTERM_KEY_END; break;\n\tcase K_F10:\t\tkey = VTERM_KEY_FUNCTION(10); break;\n\tcase K_F11:\t\tkey = VTERM_KEY_FUNCTION(11); break;\n\tcase K_F12:\t\tkey = VTERM_KEY_FUNCTION(12); break;\n\tcase K_F1:\t\tkey = VTERM_KEY_FUNCTION(1); break;\n\tcase K_F2:\t\tkey = VTERM_KEY_FUNCTION(2); break;\n\tcase K_F3:\t\tkey = VTERM_KEY_FUNCTION(3); break;\n\tcase K_F4:\t\tkey = VTERM_KEY_FUNCTION(4); break;\n\tcase K_F5:\t\tkey = VTERM_KEY_FUNCTION(5); break;\n\tcase K_F6:\t\tkey = VTERM_KEY_FUNCTION(6); break;\n\tcase K_F7:\t\tkey = VTERM_KEY_FUNCTION(7); break;\n\tcase K_F8:\t\tkey = VTERM_KEY_FUNCTION(8); break;\n\tcase K_F9:\t\tkey = VTERM_KEY_FUNCTION(9); break;\n\tcase K_HOME:\t\tkey = VTERM_KEY_HOME; break;\n\tcase K_S_HOME:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_HOME; break;\n\tcase K_C_HOME:\t\tmod = VTERM_MOD_CTRL;\n\t\t\t\tkey = VTERM_KEY_HOME; break;\n\tcase K_INS:\t\tkey = VTERM_KEY_INS; break;\n\tcase K_K0:\t\tkey = VTERM_KEY_KP_0; break;\n\tcase K_K1:\t\tkey = VTERM_KEY_KP_1; break;\n\tcase K_K2:\t\tkey = VTERM_KEY_KP_2; break;\n\tcase K_K3:\t\tkey = VTERM_KEY_KP_3; break;\n\tcase K_K4:\t\tkey = VTERM_KEY_KP_4; break;\n\tcase K_K5:\t\tkey = VTERM_KEY_KP_5; break;\n\tcase K_K6:\t\tkey = VTERM_KEY_KP_6; break;\n\tcase K_K7:\t\tkey = VTERM_KEY_KP_7; break;\n\tcase K_K8:\t\tkey = VTERM_KEY_KP_8; break;\n\tcase K_K9:\t\tkey = VTERM_KEY_KP_9; break;\n\tcase K_KDEL:\t\tkey = VTERM_KEY_DEL; break; /* TODO */\n\tcase K_KDIVIDE:\t\tkey = VTERM_KEY_KP_DIVIDE; break;\n\tcase K_KEND:\t\tkey = VTERM_KEY_KP_1; break; /* TODO */\n\tcase K_KENTER:\t\tkey = VTERM_KEY_KP_ENTER; break;\n\tcase K_KHOME:\t\tkey = VTERM_KEY_KP_7; break; /* TODO */\n\tcase K_KINS:\t\tkey = VTERM_KEY_KP_0; break; /* TODO */\n\tcase K_KMINUS:\t\tkey = VTERM_KEY_KP_MINUS; break;\n\tcase K_KMULTIPLY:\tkey = VTERM_KEY_KP_MULT; break;\n\tcase K_KPAGEDOWN:\tkey = VTERM_KEY_KP_3; break; /* TODO */\n\tcase K_KPAGEUP:\t\tkey = VTERM_KEY_KP_9; break; /* TODO */\n\tcase K_KPLUS:\t\tkey = VTERM_KEY_KP_PLUS; break;\n\tcase K_KPOINT:\t\tkey = VTERM_KEY_KP_PERIOD; break;\n\tcase K_LEFT:\t\tkey = VTERM_KEY_LEFT; break;\n\tcase K_S_LEFT:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_LEFT; break;\n\tcase K_C_LEFT:\t\tmod = VTERM_MOD_CTRL;\n\t\t\t\tkey = VTERM_KEY_LEFT; break;\n\tcase K_PAGEDOWN:\tkey = VTERM_KEY_PAGEDOWN; break;\n\tcase K_PAGEUP:\t\tkey = VTERM_KEY_PAGEUP; break;\n\tcase K_RIGHT:\t\tkey = VTERM_KEY_RIGHT; break;\n\tcase K_S_RIGHT:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_RIGHT; break;\n\tcase K_C_RIGHT:\t\tmod = VTERM_MOD_CTRL;\n\t\t\t\tkey = VTERM_KEY_RIGHT; break;\n\tcase K_UP:\t\tkey = VTERM_KEY_UP; break;\n\tcase K_S_UP:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_UP; break;\n\tcase TAB:\t\tkey = VTERM_KEY_TAB; break;\n\tcase K_S_TAB:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_TAB; break;\n\n\tcase K_MOUSEUP:\t\tother = term_send_mouse(vterm, 5, 1); break;\n\tcase K_MOUSEDOWN:\tother = term_send_mouse(vterm, 4, 1); break;\n\tcase K_MOUSELEFT:\t/* TODO */ return 0;\n\tcase K_MOUSERIGHT:\t/* TODO */ return 0;\n\n\tcase K_LEFTMOUSE:\n\tcase K_LEFTMOUSE_NM:\n\tcase K_LEFTDRAG:\n\tcase K_LEFTRELEASE:\n\tcase K_LEFTRELEASE_NM:\n\tcase K_MOUSEMOVE:\n\tcase K_MIDDLEMOUSE:\n\tcase K_MIDDLEDRAG:\n\tcase K_MIDDLERELEASE:\n\tcase K_RIGHTMOUSE:\n\tcase K_RIGHTDRAG:\n\tcase K_RIGHTRELEASE:\tif (!term_mouse_click(vterm, c))\n\t\t\t\t return 0;\n\t\t\t\tother = TRUE;\n\t\t\t\tbreak;\n\n\tcase K_X1MOUSE:\t\t/* TODO */ return 0;\n\tcase K_X1DRAG:\t\t/* TODO */ return 0;\n\tcase K_X1RELEASE:\t/* TODO */ return 0;\n\tcase K_X2MOUSE:\t\t/* TODO */ return 0;\n\tcase K_X2DRAG:\t\t/* TODO */ return 0;\n\tcase K_X2RELEASE:\t/* TODO */ return 0;\n\n\tcase K_IGNORE:\t\treturn 0;\n\tcase K_NOP:\t\treturn 0;\n\tcase K_UNDO:\t\treturn 0;\n\tcase K_HELP:\t\treturn 0;\n\tcase K_XF1:\t\tkey = VTERM_KEY_FUNCTION(1); break;\n\tcase K_XF2:\t\tkey = VTERM_KEY_FUNCTION(2); break;\n\tcase K_XF3:\t\tkey = VTERM_KEY_FUNCTION(3); break;\n\tcase K_XF4:\t\tkey = VTERM_KEY_FUNCTION(4); break;\n\tcase K_SELECT:\t\treturn 0;\n#ifdef FEAT_GUI\n\tcase K_VER_SCROLLBAR:\treturn 0;\n\tcase K_HOR_SCROLLBAR:\treturn 0;\n#endif\n#ifdef FEAT_GUI_TABLINE\n\tcase K_TABLINE:\t\treturn 0;\n\tcase K_TABMENU:\t\treturn 0;\n#endif\n#ifdef FEAT_NETBEANS_INTG\n\tcase K_F21:\t\tkey = VTERM_KEY_FUNCTION(21); break;\n#endif\n#ifdef FEAT_DND\n\tcase K_DROP:\t\treturn 0;\n#endif\n\tcase K_CURSORHOLD:\treturn 0;\n\tcase K_PS:\t\tvterm_keyboard_start_paste(vterm);\n\t\t\t\tother = TRUE;\n\t\t\t\tbreak;\n\tcase K_PE:\t\tvterm_keyboard_end_paste(vterm);\n\t\t\t\tother = TRUE;\n\t\t\t\tbreak;\n }\n\n /*\n * Convert special keys to vterm keys:\n * - Write keys to vterm: vterm_keyboard_key()\n * - Write output to channel.\n * TODO: use mod_mask\n */\n if (key != VTERM_KEY_NONE)\n\t/* Special key, let vterm convert it. */\n\tvterm_keyboard_key(vterm, key, mod);\n else if (!other)\n\t/* Normal character, let vterm convert it. */\n\tvterm_keyboard_unichar(vterm, c, mod);\n\n /* Read back the converted escape sequence. */\n return (int)vterm_output_read(vterm, buf, KEY_BUF_LEN);\n}\n\n/*\n * Return TRUE if the job for \"term\" is still running.\n * If \"check_job_status\" is TRUE update the job status.\n */\n static int\nterm_job_running_check(term_T *term, int check_job_status)\n{\n /* Also consider the job finished when the channel is closed, to avoid a\n * race condition when updating the title. */\n if (term != NULL\n\t&& term->tl_job != NULL\n\t&& channel_is_open(term->tl_job->jv_channel))\n {\n\tif (check_job_status)\n\t job_status(term->tl_job);\n\treturn (term->tl_job->jv_status == JOB_STARTED\n\t\t|| term->tl_job->jv_channel->ch_keep_open);\n }\n return FALSE;\n}\n\n/*\n * Return TRUE if the job for \"term\" is still running.\n */\n int\nterm_job_running(term_T *term)\n{\n return term_job_running_check(term, FALSE);\n}\n\n/*\n * Return TRUE if \"term\" has an active channel and used \":term NONE\".\n */\n int\nterm_none_open(term_T *term)\n{\n /* Also consider the job finished when the channel is closed, to avoid a\n * race condition when updating the title. */\n return term != NULL\n\t&& term->tl_job != NULL\n\t&& channel_is_open(term->tl_job->jv_channel)\n\t&& term->tl_job->jv_channel->ch_keep_open;\n}\n\n/*\n * Used when exiting: kill the job in \"buf\" if so desired.\n * Return OK when the job finished.\n * Return FAIL when the job is still running.\n */\n int\nterm_try_stop_job(buf_T *buf)\n{\n int\t count;\n char *how = (char *)buf->b_term->tl_kill;\n\n#if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)\n if ((how == NULL || *how == NUL) && (p_confirm || cmdmod.confirm))\n {\n\tchar_u\tbuff[DIALOG_MSG_SIZE];\n\tint\tret;\n\n\tdialog_msg(buff, _(\"Kill job in \\\"%s\\\"?\"), buf->b_fname);\n\tret = vim_dialog_yesnocancel(VIM_QUESTION, NULL, buff, 1);\n\tif (ret == VIM_YES)\n\t how = \"kill\";\n\telse if (ret == VIM_CANCEL)\n\t return FAIL;\n }\n#endif\n if (how == NULL || *how == NUL)\n\treturn FAIL;\n\n job_stop(buf->b_term->tl_job, NULL, how);\n\n /* wait for up to a second for the job to die */\n for (count = 0; count < 100; ++count)\n {\n\t/* buffer, terminal and job may be cleaned up while waiting */\n\tif (!buf_valid(buf)\n\t\t|| buf->b_term == NULL\n\t\t|| buf->b_term->tl_job == NULL)\n\t return OK;\n\n\t/* call job_status() to update jv_status */\n\tjob_status(buf->b_term->tl_job);\n\tif (buf->b_term->tl_job->jv_status >= JOB_ENDED)\n\t return OK;\n\tui_delay(10L, FALSE);\n\tmch_check_messages();\n\tparse_queued_messages();\n }\n return FAIL;\n}\n\n/*\n * Add the last line of the scrollback buffer to the buffer in the window.\n */\n static void\nadd_scrollback_line_to_buffer(term_T *term, char_u *text, int len)\n{\n buf_T\t*buf = term->tl_buffer;\n int\t\tempty = (buf->b_ml.ml_flags & ML_EMPTY);\n linenr_T\tlnum = buf->b_ml.ml_line_count;\n\n#ifdef WIN3264\n if (!enc_utf8 && enc_codepage > 0)\n {\n\tWCHAR *ret = NULL;\n\tint\tlength = 0;\n\n\tMultiByteToWideChar_alloc(CP_UTF8, 0, (char*)text, len + 1,\n\t\t\t\t\t\t\t &ret, &length);\n\tif (ret != NULL)\n\t{\n\t WideCharToMultiByte_alloc(enc_codepage, 0,\n\t\t\t\t ret, length, (char **)&text, &len, 0, 0);\n\t vim_free(ret);\n\t ml_append_buf(term->tl_buffer, lnum, text, len, FALSE);\n\t vim_free(text);\n\t}\n }\n else\n#endif\n\tml_append_buf(term->tl_buffer, lnum, text, len + 1, FALSE);\n if (empty)\n {\n\t/* Delete the empty line that was in the empty buffer. */\n\tcurbuf = buf;\n\tml_delete(1, FALSE);\n\tcurbuf = curwin->w_buffer;\n }\n}\n\n static void\ncell2cellattr(const VTermScreenCell *cell, cellattr_T *attr)\n{\n attr->width = cell->width;\n attr->attrs = cell->attrs;\n attr->fg = cell->fg;\n attr->bg = cell->bg;\n}\n\n static int\nequal_celattr(cellattr_T *a, cellattr_T *b)\n{\n /* Comparing the colors should be sufficient. */\n return a->fg.red == b->fg.red\n\t&& a->fg.green == b->fg.green\n\t&& a->fg.blue == b->fg.blue\n\t&& a->bg.red == b->bg.red\n\t&& a->bg.green == b->bg.green\n\t&& a->bg.blue == b->bg.blue;\n}\n\n/*\n * Add an empty scrollback line to \"term\". When \"lnum\" is not zero, add the\n * line at this position. Otherwise at the end.\n */\n static int\nadd_empty_scrollback(term_T *term, cellattr_T *fill_attr, int lnum)\n{\n if (ga_grow(&term->tl_scrollback, 1) == OK)\n {\n\tsb_line_T *line = (sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t + term->tl_scrollback.ga_len;\n\n\tif (lnum > 0)\n\t{\n\t int i;\n\n\t for (i = 0; i < term->tl_scrollback.ga_len - lnum; ++i)\n\t {\n\t\t*line = *(line - 1);\n\t\t--line;\n\t }\n\t}\n\tline->sb_cols = 0;\n\tline->sb_cells = NULL;\n\tline->sb_fill_attr = *fill_attr;\n\t++term->tl_scrollback.ga_len;\n\treturn OK;\n }\n return FALSE;\n}\n\n/*\n * Remove the terminal contents from the scrollback and the buffer.\n * Used before adding a new scrollback line or updating the buffer for lines\n * displayed in the terminal.\n */\n static void\ncleanup_scrollback(term_T *term)\n{\n sb_line_T\t*line;\n garray_T\t*gap;\n\n curbuf = term->tl_buffer;\n gap = &term->tl_scrollback;\n while (curbuf->b_ml.ml_line_count > term->tl_scrollback_scrolled\n\t\t\t\t\t\t\t && gap->ga_len > 0)\n {\n\tml_delete(curbuf->b_ml.ml_line_count, FALSE);\n\tline = (sb_line_T *)gap->ga_data + gap->ga_len - 1;\n\tvim_free(line->sb_cells);\n\t--gap->ga_len;\n }\n curbuf = curwin->w_buffer;\n if (curbuf == term->tl_buffer)\n\tcheck_cursor();\n}\n\n/*\n * Add the current lines of the terminal to scrollback and to the buffer.\n */\n static void\nupdate_snapshot(term_T *term)\n{\n VTermScreen\t *screen;\n int\t\t len;\n int\t\t lines_skipped = 0;\n VTermPos\t pos;\n VTermScreenCell cell;\n cellattr_T\t fill_attr, new_fill_attr;\n cellattr_T\t *p;\n\n ch_log(term->tl_job == NULL ? NULL : term->tl_job->jv_channel,\n\t\t\t\t \"Adding terminal window snapshot to buffer\");\n\n /* First remove the lines that were appended before, they might be\n * outdated. */\n cleanup_scrollback(term);\n\n screen = vterm_obtain_screen(term->tl_vterm);\n fill_attr = new_fill_attr = term->tl_default_color;\n for (pos.row = 0; pos.row < term->tl_rows; ++pos.row)\n {\n\tlen = 0;\n\tfor (pos.col = 0; pos.col < term->tl_cols; ++pos.col)\n\t if (vterm_screen_get_cell(screen, pos, &cell) != 0\n\t\t\t\t\t\t && cell.chars[0] != NUL)\n\t {\n\t\tlen = pos.col + 1;\n\t\tnew_fill_attr = term->tl_default_color;\n\t }\n\t else\n\t\t/* Assume the last attr is the filler attr. */\n\t\tcell2cellattr(&cell, &new_fill_attr);\n\n\tif (len == 0 && equal_celattr(&new_fill_attr, &fill_attr))\n\t ++lines_skipped;\n\telse\n\t{\n\t while (lines_skipped > 0)\n\t {\n\t\t/* Line was skipped, add an empty line. */\n\t\t--lines_skipped;\n\t\tif (add_empty_scrollback(term, &fill_attr, 0) == OK)\n\t\t add_scrollback_line_to_buffer(term, (char_u *)\"\", 0);\n\t }\n\n\t if (len == 0)\n\t\tp = NULL;\n\t else\n\t\tp = (cellattr_T *)alloc((int)sizeof(cellattr_T) * len);\n\t if ((p != NULL || len == 0)\n\t\t\t\t && ga_grow(&term->tl_scrollback, 1) == OK)\n\t {\n\t\tgarray_T ga;\n\t\tint\t width;\n\t\tsb_line_T *line = (sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t\t\t + term->tl_scrollback.ga_len;\n\n\t\tga_init2(&ga, 1, 100);\n\t\tfor (pos.col = 0; pos.col < len; pos.col += width)\n\t\t{\n\t\t if (vterm_screen_get_cell(screen, pos, &cell) == 0)\n\t\t {\n\t\t\twidth = 1;\n\t\t\tvim_memset(p + pos.col, 0, sizeof(cellattr_T));\n\t\t\tif (ga_grow(&ga, 1) == OK)\n\t\t\t ga.ga_len += utf_char2bytes(' ',\n\t\t\t\t\t (char_u *)ga.ga_data + ga.ga_len);\n\t\t }\n\t\t else\n\t\t {\n\t\t\twidth = cell.width;\n\n\t\t\tcell2cellattr(&cell, &p[pos.col]);\n\n\t\t\t// Each character can be up to 6 bytes.\n\t\t\tif (ga_grow(&ga, VTERM_MAX_CHARS_PER_CELL * 6) == OK)\n\t\t\t{\n\t\t\t int\t i;\n\t\t\t int\t c;\n\n\t\t\t for (i = 0; (c = cell.chars[i]) > 0 || i == 0; ++i)\n\t\t\t\tga.ga_len += utf_char2bytes(c == NUL ? ' ' : c,\n\t\t\t\t\t (char_u *)ga.ga_data + ga.ga_len);\n\t\t\t}\n\t\t }\n\t\t}\n\t\tline->sb_cols = len;\n\t\tline->sb_cells = p;\n\t\tline->sb_fill_attr = new_fill_attr;\n\t\tfill_attr = new_fill_attr;\n\t\t++term->tl_scrollback.ga_len;\n\n\t\tif (ga_grow(&ga, 1) == FAIL)\n\t\t add_scrollback_line_to_buffer(term, (char_u *)\"\", 0);\n\t\telse\n\t\t{\n\t\t *((char_u *)ga.ga_data + ga.ga_len) = NUL;\n\t\t add_scrollback_line_to_buffer(term, ga.ga_data, ga.ga_len);\n\t\t}\n\t\tga_clear(&ga);\n\t }\n\t else\n\t\tvim_free(p);\n\t}\n }\n\n // Add trailing empty lines.\n for (pos.row = term->tl_scrollback.ga_len;\n\t pos.row < term->tl_scrollback_scrolled + term->tl_cursor_pos.row;\n\t ++pos.row)\n {\n\tif (add_empty_scrollback(term, &fill_attr, 0) == OK)\n\t add_scrollback_line_to_buffer(term, (char_u *)\"\", 0);\n }\n\n term->tl_dirty_snapshot = FALSE;\n#ifdef FEAT_TIMERS\n term->tl_timer_set = FALSE;\n#endif\n}\n\n/*\n * If needed, add the current lines of the terminal to scrollback and to the\n * buffer. Called after the job has ended and when switching to\n * Terminal-Normal mode.\n * When \"redraw\" is TRUE redraw the windows that show the terminal.\n */\n static void\nmay_move_terminal_to_buffer(term_T *term, int redraw)\n{\n win_T\t *wp;\n\n if (term->tl_vterm == NULL)\n\treturn;\n\n /* Update the snapshot only if something changes or the buffer does not\n * have all the lines. */\n if (term->tl_dirty_snapshot || term->tl_buffer->b_ml.ml_line_count\n\t\t\t\t\t <= term->tl_scrollback_scrolled)\n\tupdate_snapshot(term);\n\n /* Obtain the current background color. */\n vterm_state_get_default_colors(vterm_obtain_state(term->tl_vterm),\n\t\t &term->tl_default_color.fg, &term->tl_default_color.bg);\n\n if (redraw)\n\tFOR_ALL_WINDOWS(wp)\n\t{\n\t if (wp->w_buffer == term->tl_buffer)\n\t {\n\t\twp->w_cursor.lnum = term->tl_buffer->b_ml.ml_line_count;\n\t\twp->w_cursor.col = 0;\n\t\twp->w_valid = 0;\n\t\tif (wp->w_cursor.lnum >= wp->w_height)\n\t\t{\n\t\t linenr_T min_topline = wp->w_cursor.lnum - wp->w_height + 1;\n\n\t\t if (wp->w_topline < min_topline)\n\t\t\twp->w_topline = min_topline;\n\t\t}\n\t\tredraw_win_later(wp, NOT_VALID);\n\t }\n\t}\n}\n\n#if defined(FEAT_TIMERS) || defined(PROTO)\n/*\n * Check if any terminal timer expired. If so, copy text from the terminal to\n * the buffer.\n * Return the time until the next timer will expire.\n */\n int\nterm_check_timers(int next_due_arg, proftime_T *now)\n{\n term_T *term;\n int\t next_due = next_due_arg;\n\n for (term = first_term; term != NULL; term = term->tl_next)\n {\n\tif (term->tl_timer_set && !term->tl_normal_mode)\n\t{\n\t long this_due = proftime_time_left(&term->tl_timer_due, now);\n\n\t if (this_due <= 1)\n\t {\n\t\tterm->tl_timer_set = FALSE;\n\t\tmay_move_terminal_to_buffer(term, FALSE);\n\t }\n\t else if (next_due == -1 || next_due > this_due)\n\t\tnext_due = this_due;\n\t}\n }\n\n return next_due;\n}\n#endif\n\n static void\nset_terminal_mode(term_T *term, int normal_mode)\n{\n term->tl_normal_mode = normal_mode;\n VIM_CLEAR(term->tl_status_text);\n if (term->tl_buffer == curbuf)\n\tmaketitle();\n}\n\n/*\n * Called after the job if finished and Terminal mode is not active:\n * Move the vterm contents into the scrollback buffer and free the vterm.\n */\n static void\ncleanup_vterm(term_T *term)\n{\n if (term->tl_finish != TL_FINISH_CLOSE)\n\tmay_move_terminal_to_buffer(term, TRUE);\n term_free_vterm(term);\n set_terminal_mode(term, FALSE);\n}\n\n/*\n * Switch from Terminal-Job mode to Terminal-Normal mode.\n * Suspends updating the terminal window.\n */\n static void\nterm_enter_normal_mode(void)\n{\n term_T *term = curbuf->b_term;\n\n set_terminal_mode(term, TRUE);\n\n /* Append the current terminal contents to the buffer. */\n may_move_terminal_to_buffer(term, TRUE);\n\n /* Move the window cursor to the position of the cursor in the\n * terminal. */\n curwin->w_cursor.lnum = term->tl_scrollback_scrolled\n\t\t\t\t\t + term->tl_cursor_pos.row + 1;\n check_cursor();\n if (coladvance(term->tl_cursor_pos.col) == FAIL)\n\tcoladvance(MAXCOL);\n\n /* Display the same lines as in the terminal. */\n curwin->w_topline = term->tl_scrollback_scrolled + 1;\n}\n\n/*\n * Returns TRUE if the current window contains a terminal and we are in\n * Terminal-Normal mode.\n */\n int\nterm_in_normal_mode(void)\n{\n term_T *term = curbuf->b_term;\n\n return term != NULL && term->tl_normal_mode;\n}\n\n/*\n * Switch from Terminal-Normal mode to Terminal-Job mode.\n * Restores updating the terminal window.\n */\n void\nterm_enter_job_mode()\n{\n term_T\t*term = curbuf->b_term;\n\n set_terminal_mode(term, FALSE);\n\n if (term->tl_channel_closed)\n\tcleanup_vterm(term);\n redraw_buf_and_status_later(curbuf, NOT_VALID);\n}\n\n/*\n * Get a key from the user with terminal mode mappings.\n * Note: while waiting a terminal may be closed and freed if the channel is\n * closed and ++close was used.\n */\n static int\nterm_vgetc()\n{\n int c;\n int save_State = State;\n\n State = TERMINAL;\n got_int = FALSE;\n#ifdef WIN3264\n ctrl_break_was_pressed = FALSE;\n#endif\n c = vgetc();\n got_int = FALSE;\n State = save_State;\n return c;\n}\n\nstatic int\tmouse_was_outside = FALSE;\n\n/*\n * Send keys to terminal.\n * Return FAIL when the key needs to be handled in Normal mode.\n * Return OK when the key was dropped or sent to the terminal.\n */\n int\nsend_keys_to_term(term_T *term, int c, int typed)\n{\n char\tmsg[KEY_BUF_LEN];\n size_t\tlen;\n int\t\tdragging_outside = FALSE;\n\n /* Catch keys that need to be handled as in Normal mode. */\n switch (c)\n {\n\tcase NUL:\n\tcase K_ZERO:\n\t if (typed)\n\t\tstuffcharReadbuff(c);\n\t return FAIL;\n\n\tcase K_TABLINE:\n\t stuffcharReadbuff(c);\n\t return FAIL;\n\n\tcase K_IGNORE:\n\tcase K_CANCEL: // used for :normal when running out of chars\n\t return FAIL;\n\n\tcase K_LEFTDRAG:\n\tcase K_MIDDLEDRAG:\n\tcase K_RIGHTDRAG:\n\tcase K_X1DRAG:\n\tcase K_X2DRAG:\n\t dragging_outside = mouse_was_outside;\n\t /* FALLTHROUGH */\n\tcase K_LEFTMOUSE:\n\tcase K_LEFTMOUSE_NM:\n\tcase K_LEFTRELEASE:\n\tcase K_LEFTRELEASE_NM:\n\tcase K_MOUSEMOVE:\n\tcase K_MIDDLEMOUSE:\n\tcase K_MIDDLERELEASE:\n\tcase K_RIGHTMOUSE:\n\tcase K_RIGHTRELEASE:\n\tcase K_X1MOUSE:\n\tcase K_X1RELEASE:\n\tcase K_X2MOUSE:\n\tcase K_X2RELEASE:\n\n\tcase K_MOUSEUP:\n\tcase K_MOUSEDOWN:\n\tcase K_MOUSELEFT:\n\tcase K_MOUSERIGHT:\n\t if (mouse_row < W_WINROW(curwin)\n\t\t || mouse_row >= (W_WINROW(curwin) + curwin->w_height)\n\t\t || mouse_col < curwin->w_wincol\n\t\t || mouse_col >= W_ENDCOL(curwin)\n\t\t || dragging_outside)\n\t {\n\t\t/* click or scroll outside the current window or on status line\n\t\t * or vertical separator */\n\t\tif (typed)\n\t\t{\n\t\t stuffcharReadbuff(c);\n\t\t mouse_was_outside = TRUE;\n\t\t}\n\t\treturn FAIL;\n\t }\n }\n if (typed)\n\tmouse_was_outside = FALSE;\n\n /* Convert the typed key to a sequence of bytes for the job. */\n len = term_convert_key(term, c, msg);\n if (len > 0)\n\t/* TODO: if FAIL is returned, stop? */\n\tchannel_send(term->tl_job->jv_channel, get_tty_part(term),\n\t\t\t\t\t\t(char_u *)msg, (int)len, NULL);\n\n return OK;\n}\n\n static void\nposition_cursor(win_T *wp, VTermPos *pos)\n{\n wp->w_wrow = MIN(pos->row, MAX(0, wp->w_height - 1));\n wp->w_wcol = MIN(pos->col, MAX(0, wp->w_width - 1));\n wp->w_valid |= (VALID_WCOL|VALID_WROW);\n}\n\n/*\n * Handle CTRL-W \"\": send register contents to the job.\n */\n static void\nterm_paste_register(int prev_c UNUSED)\n{\n int\t\tc;\n list_T\t*l;\n listitem_T\t*item;\n long\treglen = 0;\n int\t\ttype;\n\n#ifdef FEAT_CMDL_INFO\n if (add_to_showcmd(prev_c))\n if (add_to_showcmd('\"'))\n\tout_flush();\n#endif\n c = term_vgetc();\n#ifdef FEAT_CMDL_INFO\n clear_showcmd();\n#endif\n if (!term_use_loop())\n\t/* job finished while waiting for a character */\n\treturn;\n\n /* CTRL-W \"= prompt for expression to evaluate. */\n if (c == '=' && get_expr_register() != '=')\n\treturn;\n if (!term_use_loop())\n\t/* job finished while waiting for a character */\n\treturn;\n\n l = (list_T *)get_reg_contents(c, GREG_LIST);\n if (l != NULL)\n {\n\ttype = get_reg_type(c, ®len);\n\tfor (item = l->lv_first; item != NULL; item = item->li_next)\n\t{\n\t char_u *s = tv_get_string(&item->li_tv);\n#ifdef WIN3264\n\t char_u *tmp = s;\n\n\t if (!enc_utf8 && enc_codepage > 0)\n\t {\n\t\tWCHAR *ret = NULL;\n\t\tint\tlength = 0;\n\n\t\tMultiByteToWideChar_alloc(enc_codepage, 0, (char *)s,\n\t\t\t\t\t\t(int)STRLEN(s), &ret, &length);\n\t\tif (ret != NULL)\n\t\t{\n\t\t WideCharToMultiByte_alloc(CP_UTF8, 0,\n\t\t\t\t ret, length, (char **)&s, &length, 0, 0);\n\t\t vim_free(ret);\n\t\t}\n\t }\n#endif\n\t channel_send(curbuf->b_term->tl_job->jv_channel, PART_IN,\n\t\t\t\t\t\t s, (int)STRLEN(s), NULL);\n#ifdef WIN3264\n\t if (tmp != s)\n\t\tvim_free(s);\n#endif\n\n\t if (item->li_next != NULL || type == MLINE)\n\t\tchannel_send(curbuf->b_term->tl_job->jv_channel, PART_IN,\n\t\t\t\t\t\t (char_u *)\"\\r\", 1, NULL);\n\t}\n\tlist_free(l);\n }\n}\n\n/*\n * Return TRUE when waiting for a character in the terminal, the cursor of the\n * terminal should be displayed.\n */\n int\nterminal_is_active()\n{\n return in_terminal_loop != NULL;\n}\n\n#if defined(FEAT_GUI) || defined(PROTO)\n cursorentry_T *\nterm_get_cursor_shape(guicolor_T *fg, guicolor_T *bg)\n{\n term_T\t\t *term = in_terminal_loop;\n static cursorentry_T entry;\n int\t\t\t id;\n guicolor_T\t\tterm_fg, term_bg;\n\n vim_memset(&entry, 0, sizeof(entry));\n entry.shape = entry.mshape =\n\tterm->tl_cursor_shape == VTERM_PROP_CURSORSHAPE_UNDERLINE ? SHAPE_HOR :\n\tterm->tl_cursor_shape == VTERM_PROP_CURSORSHAPE_BAR_LEFT ? SHAPE_VER :\n\tSHAPE_BLOCK;\n entry.percentage = 20;\n if (term->tl_cursor_blink)\n {\n\tentry.blinkwait = 700;\n\tentry.blinkon = 400;\n\tentry.blinkoff = 250;\n }\n\n /* The \"Terminal\" highlight group overrules the defaults. */\n id = syn_name2id((char_u *)\"Terminal\");\n if (id != 0)\n {\n\tsyn_id2colors(id, &term_fg, &term_bg);\n\t*fg = term_bg;\n }\n else\n\t*fg = gui.back_pixel;\n\n if (term->tl_cursor_color == NULL)\n {\n\tif (id != 0)\n\t *bg = term_fg;\n\telse\n\t *bg = gui.norm_pixel;\n }\n else\n\t*bg = color_name2handle(term->tl_cursor_color);\n entry.name = \"n\";\n entry.used_for = SHAPE_CURSOR;\n\n return &entry;\n}\n#endif\n\n static void\nmay_output_cursor_props(void)\n{\n if (!cursor_color_equal(last_set_cursor_color, desired_cursor_color)\n\t || last_set_cursor_shape != desired_cursor_shape\n\t || last_set_cursor_blink != desired_cursor_blink)\n {\n\tcursor_color_copy(&last_set_cursor_color, desired_cursor_color);\n\tlast_set_cursor_shape = desired_cursor_shape;\n\tlast_set_cursor_blink = desired_cursor_blink;\n\tterm_cursor_color(cursor_color_get(desired_cursor_color));\n\tif (desired_cursor_shape == -1 || desired_cursor_blink == -1)\n\t /* this will restore the initial cursor style, if possible */\n\t ui_cursor_shape_forced(TRUE);\n\telse\n\t term_cursor_shape(desired_cursor_shape, desired_cursor_blink);\n }\n}\n\n/*\n * Set the cursor color and shape, if not last set to these.\n */\n static void\nmay_set_cursor_props(term_T *term)\n{\n#ifdef FEAT_GUI\n /* For the GUI the cursor properties are obtained with\n * term_get_cursor_shape(). */\n if (gui.in_use)\n\treturn;\n#endif\n if (in_terminal_loop == term)\n {\n\tcursor_color_copy(&desired_cursor_color, term->tl_cursor_color);\n\tdesired_cursor_shape = term->tl_cursor_shape;\n\tdesired_cursor_blink = term->tl_cursor_blink;\n\tmay_output_cursor_props();\n }\n}\n\n/*\n * Reset the desired cursor properties and restore them when needed.\n */\n static void\nprepare_restore_cursor_props(void)\n{\n#ifdef FEAT_GUI\n if (gui.in_use)\n\treturn;\n#endif\n cursor_color_copy(&desired_cursor_color, NULL);\n desired_cursor_shape = -1;\n desired_cursor_blink = -1;\n may_output_cursor_props();\n}\n\n/*\n * Returns TRUE if the current window contains a terminal and we are sending\n * keys to the job.\n * If \"check_job_status\" is TRUE update the job status.\n */\n static int\nterm_use_loop_check(int check_job_status)\n{\n term_T *term = curbuf->b_term;\n\n return term != NULL\n\t&& !term->tl_normal_mode\n\t&& term->tl_vterm != NULL\n\t&& term_job_running_check(term, check_job_status);\n}\n\n/*\n * Returns TRUE if the current window contains a terminal and we are sending\n * keys to the job.\n */\n int\nterm_use_loop(void)\n{\n return term_use_loop_check(FALSE);\n}\n\n/*\n * Called when entering a window with the mouse. If this is a terminal window\n * we may want to change state.\n */\n void\nterm_win_entered()\n{\n term_T *term = curbuf->b_term;\n\n if (term != NULL)\n {\n\tif (term_use_loop_check(TRUE))\n\t{\n\t reset_VIsual_and_resel();\n\t if (State & INSERT)\n\t\tstop_insert_mode = TRUE;\n\t}\n\tmouse_was_outside = FALSE;\n\tenter_mouse_col = mouse_col;\n\tenter_mouse_row = mouse_row;\n }\n}\n\n/*\n * Wait for input and send it to the job.\n * When \"blocking\" is TRUE wait for a character to be typed. Otherwise return\n * when there is no more typahead.\n * Return when the start of a CTRL-W command is typed or anything else that\n * should be handled as a Normal mode command.\n * Returns OK if a typed character is to be handled in Normal mode, FAIL if\n * the terminal was closed.\n */\n int\nterminal_loop(int blocking)\n{\n int\t\tc;\n int\t\ttermwinkey = 0;\n int\t\tret;\n#ifdef UNIX\n int\t\ttty_fd = curbuf->b_term->tl_job->jv_channel\n\t\t\t\t ->ch_part[get_tty_part(curbuf->b_term)].ch_fd;\n#endif\n int\t\trestore_cursor = FALSE;\n\n /* Remember the terminal we are sending keys to. However, the terminal\n * might be closed while waiting for a character, e.g. typing \"exit\" in a\n * shell and ++close was used. Therefore use curbuf->b_term instead of a\n * stored reference. */\n in_terminal_loop = curbuf->b_term;\n\n if (*curwin->w_p_twk != NUL)\n {\n\ttermwinkey = string_to_key(curwin->w_p_twk, TRUE);\n\tif (termwinkey == Ctrl_W)\n\t termwinkey = 0;\n }\n position_cursor(curwin, &curbuf->b_term->tl_cursor_pos);\n may_set_cursor_props(curbuf->b_term);\n\n while (blocking || vpeekc_nomap() != NUL)\n {\n#ifdef FEAT_GUI\n\tif (!curbuf->b_term->tl_system)\n#endif\n\t /* TODO: skip screen update when handling a sequence of keys. */\n\t /* Repeat redrawing in case a message is received while redrawing.\n\t */\n\t while (must_redraw != 0)\n\t\tif (update_screen(0) == FAIL)\n\t\t break;\n\tif (!term_use_loop_check(TRUE) || in_terminal_loop != curbuf->b_term)\n\t /* job finished while redrawing */\n\t break;\n\n\tupdate_cursor(curbuf->b_term, FALSE);\n\trestore_cursor = TRUE;\n\n\tc = term_vgetc();\n\tif (!term_use_loop_check(TRUE) || in_terminal_loop != curbuf->b_term)\n\t{\n\t /* Job finished while waiting for a character. Push back the\n\t * received character. */\n\t if (c != K_IGNORE)\n\t\tvungetc(c);\n\t break;\n\t}\n\tif (c == K_IGNORE)\n\t continue;\n\n#ifdef UNIX\n\t/*\n\t * The shell or another program may change the tty settings. Getting\n\t * them for every typed character is a bit of overhead, but it's needed\n\t * for the first character typed, e.g. when Vim starts in a shell.\n\t */\n\tif (isatty(tty_fd))\n\t{\n\t ttyinfo_T info;\n\n\t /* Get the current backspace character of the pty. */\n\t if (get_tty_info(tty_fd, &info) == OK)\n\t\tterm_backspace_char = info.backspace;\n\t}\n#endif\n\n#ifdef WIN3264\n\t/* On Windows winpty handles CTRL-C, don't send a CTRL_C_EVENT.\n\t * Use CTRL-BREAK to kill the job. */\n\tif (ctrl_break_was_pressed)\n\t mch_signal_job(curbuf->b_term->tl_job, (char_u *)\"kill\");\n#endif\n\t/* Was either CTRL-W (termwinkey) or CTRL-\\ pressed?\n\t * Not in a system terminal. */\n\tif ((c == (termwinkey == 0 ? Ctrl_W : termwinkey) || c == Ctrl_BSL)\n#ifdef FEAT_GUI\n\t\t&& !curbuf->b_term->tl_system\n#endif\n\t\t)\n\t{\n\t int\t prev_c = c;\n\n#ifdef FEAT_CMDL_INFO\n\t if (add_to_showcmd(c))\n\t\tout_flush();\n#endif\n\t c = term_vgetc();\n#ifdef FEAT_CMDL_INFO\n\t clear_showcmd();\n#endif\n\t if (!term_use_loop_check(TRUE)\n\t\t\t\t\t || in_terminal_loop != curbuf->b_term)\n\t\t/* job finished while waiting for a character */\n\t\tbreak;\n\n\t if (prev_c == Ctrl_BSL)\n\t {\n\t\tif (c == Ctrl_N)\n\t\t{\n\t\t /* CTRL-\\ CTRL-N : go to Terminal-Normal mode. */\n\t\t term_enter_normal_mode();\n\t\t ret = FAIL;\n\t\t goto theend;\n\t\t}\n\t\t/* Send both keys to the terminal. */\n\t\tsend_keys_to_term(curbuf->b_term, prev_c, TRUE);\n\t }\n\t else if (c == Ctrl_C)\n\t {\n\t\t/* \"CTRL-W CTRL-C\" or 'termwinkey' CTRL-C: end the job */\n\t\tmch_signal_job(curbuf->b_term->tl_job, (char_u *)\"kill\");\n\t }\n\t else if (c == '.')\n\t {\n\t\t/* \"CTRL-W .\": send CTRL-W to the job */\n\t\t/* \"'termwinkey' .\": send 'termwinkey' to the job */\n\t\tc = termwinkey == 0 ? Ctrl_W : termwinkey;\n\t }\n\t else if (c == Ctrl_BSL)\n\t {\n\t\t/* \"CTRL-W CTRL-\\\": send CTRL-\\ to the job */\n\t\tc = Ctrl_BSL;\n\t }\n\t else if (c == 'N')\n\t {\n\t\t/* CTRL-W N : go to Terminal-Normal mode. */\n\t\tterm_enter_normal_mode();\n\t\tret = FAIL;\n\t\tgoto theend;\n\t }\n\t else if (c == '\"')\n\t {\n\t\tterm_paste_register(prev_c);\n\t\tcontinue;\n\t }\n\t else if (termwinkey == 0 || c != termwinkey)\n\t {\n\t\tstuffcharReadbuff(Ctrl_W);\n\t\tstuffcharReadbuff(c);\n\t\tret = OK;\n\t\tgoto theend;\n\t }\n\t}\n# ifdef WIN3264\n\tif (!enc_utf8 && has_mbyte && c >= 0x80)\n\t{\n\t WCHAR wc;\n\t char_u mb[3];\n\n\t mb[0] = (unsigned)c >> 8;\n\t mb[1] = c;\n\t if (MultiByteToWideChar(GetACP(), 0, (char*)mb, 2, &wc, 1) > 0)\n\t\tc = wc;\n\t}\n# endif\n\tif (send_keys_to_term(curbuf->b_term, c, TRUE) != OK)\n\t{\n\t if (c == K_MOUSEMOVE)\n\t\t/* We are sure to come back here, don't reset the cursor color\n\t\t * and shape to avoid flickering. */\n\t\trestore_cursor = FALSE;\n\n\t ret = OK;\n\t goto theend;\n\t}\n }\n ret = FAIL;\n\ntheend:\n in_terminal_loop = NULL;\n if (restore_cursor)\n\tprepare_restore_cursor_props();\n\n /* Move a snapshot of the screen contents to the buffer, so that completion\n * works in other buffers. */\n if (curbuf->b_term != NULL && !curbuf->b_term->tl_normal_mode)\n\tmay_move_terminal_to_buffer(curbuf->b_term, FALSE);\n\n return ret;\n}\n\n/*\n * Called when a job has finished.\n * This updates the title and status, but does not close the vterm, because\n * there might still be pending output in the channel.\n */\n void\nterm_job_ended(job_T *job)\n{\n term_T *term;\n int\t did_one = FALSE;\n\n for (term = first_term; term != NULL; term = term->tl_next)\n\tif (term->tl_job == job)\n\t{\n\t VIM_CLEAR(term->tl_title);\n\t VIM_CLEAR(term->tl_status_text);\n\t redraw_buf_and_status_later(term->tl_buffer, VALID);\n\t did_one = TRUE;\n\t}\n if (did_one)\n\tredraw_statuslines();\n if (curbuf->b_term != NULL)\n {\n\tif (curbuf->b_term->tl_job == job)\n\t maketitle();\n\tupdate_cursor(curbuf->b_term, TRUE);\n }\n}\n\n static void\nmay_toggle_cursor(term_T *term)\n{\n if (in_terminal_loop == term)\n {\n\tif (term->tl_cursor_visible)\n\t cursor_on();\n\telse\n\t cursor_off();\n }\n}\n\n/*\n * Reverse engineer the RGB value into a cterm color index.\n * First color is 1. Return 0 if no match found (default color).\n */\n static int\ncolor2index(VTermColor *color, int fg, int *boldp)\n{\n int red = color->red;\n int blue = color->blue;\n int green = color->green;\n\n if (color->ansi_index != VTERM_ANSI_INDEX_NONE)\n {\n\t/* First 16 colors and default: use the ANSI index, because these\n\t * colors can be redefined. */\n\tif (t_colors >= 16)\n\t return color->ansi_index;\n\tswitch (color->ansi_index)\n\t{\n\t case 0: return 0;\n\t case 1: return lookup_color( 0, fg, boldp) + 1; /* black */\n\t case 2: return lookup_color( 4, fg, boldp) + 1; /* dark red */\n\t case 3: return lookup_color( 2, fg, boldp) + 1; /* dark green */\n\t case 4: return lookup_color( 6, fg, boldp) + 1; /* brown */\n\t case 5: return lookup_color( 1, fg, boldp) + 1; /* dark blue */\n\t case 6: return lookup_color( 5, fg, boldp) + 1; /* dark magenta */\n\t case 7: return lookup_color( 3, fg, boldp) + 1; /* dark cyan */\n\t case 8: return lookup_color( 8, fg, boldp) + 1; /* light grey */\n\t case 9: return lookup_color(12, fg, boldp) + 1; /* dark grey */\n\t case 10: return lookup_color(20, fg, boldp) + 1; /* red */\n\t case 11: return lookup_color(16, fg, boldp) + 1; /* green */\n\t case 12: return lookup_color(24, fg, boldp) + 1; /* yellow */\n\t case 13: return lookup_color(14, fg, boldp) + 1; /* blue */\n\t case 14: return lookup_color(22, fg, boldp) + 1; /* magenta */\n\t case 15: return lookup_color(18, fg, boldp) + 1; /* cyan */\n\t case 16: return lookup_color(26, fg, boldp) + 1; /* white */\n\t}\n }\n\n if (t_colors >= 256)\n {\n\tif (red == blue && red == green)\n\t{\n\t /* 24-color greyscale plus white and black */\n\t static int cutoff[23] = {\n\t\t 0x0D, 0x17, 0x21, 0x2B, 0x35, 0x3F, 0x49, 0x53, 0x5D, 0x67,\n\t\t 0x71, 0x7B, 0x85, 0x8F, 0x99, 0xA3, 0xAD, 0xB7, 0xC1, 0xCB,\n\t\t 0xD5, 0xDF, 0xE9};\n\t int i;\n\n\t if (red < 5)\n\t\treturn 17; /* 00/00/00 */\n\t if (red > 245) /* ff/ff/ff */\n\t\treturn 232;\n\t for (i = 0; i < 23; ++i)\n\t\tif (red < cutoff[i])\n\t\t return i + 233;\n\t return 256;\n\t}\n\t{\n\t static int cutoff[5] = {0x2F, 0x73, 0x9B, 0xC3, 0xEB};\n\t int ri, gi, bi;\n\n\t /* 216-color cube */\n\t for (ri = 0; ri < 5; ++ri)\n\t\tif (red < cutoff[ri])\n\t\t break;\n\t for (gi = 0; gi < 5; ++gi)\n\t\tif (green < cutoff[gi])\n\t\t break;\n\t for (bi = 0; bi < 5; ++bi)\n\t\tif (blue < cutoff[bi])\n\t\t break;\n\t return 17 + ri * 36 + gi * 6 + bi;\n\t}\n }\n return 0;\n}\n\n/*\n * Convert Vterm attributes to highlight flags.\n */\n static int\nvtermAttr2hl(VTermScreenCellAttrs cellattrs)\n{\n int attr = 0;\n\n if (cellattrs.bold)\n\tattr |= HL_BOLD;\n if (cellattrs.underline)\n\tattr |= HL_UNDERLINE;\n if (cellattrs.italic)\n\tattr |= HL_ITALIC;\n if (cellattrs.strike)\n\tattr |= HL_STRIKETHROUGH;\n if (cellattrs.reverse)\n\tattr |= HL_INVERSE;\n return attr;\n}\n\n/*\n * Store Vterm attributes in \"cell\" from highlight flags.\n */\n static void\nhl2vtermAttr(int attr, cellattr_T *cell)\n{\n vim_memset(&cell->attrs, 0, sizeof(VTermScreenCellAttrs));\n if (attr & HL_BOLD)\n\tcell->attrs.bold = 1;\n if (attr & HL_UNDERLINE)\n\tcell->attrs.underline = 1;\n if (attr & HL_ITALIC)\n\tcell->attrs.italic = 1;\n if (attr & HL_STRIKETHROUGH)\n\tcell->attrs.strike = 1;\n if (attr & HL_INVERSE)\n\tcell->attrs.reverse = 1;\n}\n\n/*\n * Convert the attributes of a vterm cell into an attribute index.\n */\n static int\ncell2attr(VTermScreenCellAttrs cellattrs, VTermColor cellfg, VTermColor cellbg)\n{\n int attr = vtermAttr2hl(cellattrs);\n\n#ifdef FEAT_GUI\n if (gui.in_use)\n {\n\tguicolor_T fg, bg;\n\n\tfg = gui_mch_get_rgb_color(cellfg.red, cellfg.green, cellfg.blue);\n\tbg = gui_mch_get_rgb_color(cellbg.red, cellbg.green, cellbg.blue);\n\treturn get_gui_attr_idx(attr, fg, bg);\n }\n else\n#endif\n#ifdef FEAT_TERMGUICOLORS\n if (p_tgc)\n {\n\tguicolor_T fg, bg;\n\n\tfg = gui_get_rgb_color_cmn(cellfg.red, cellfg.green, cellfg.blue);\n\tbg = gui_get_rgb_color_cmn(cellbg.red, cellbg.green, cellbg.blue);\n\n\treturn get_tgc_attr_idx(attr, fg, bg);\n }\n else\n#endif\n {\n\tint bold = MAYBE;\n\tint fg = color2index(&cellfg, TRUE, &bold);\n\tint bg = color2index(&cellbg, FALSE, &bold);\n\n\t/* Use the \"Terminal\" highlighting for the default colors. */\n\tif ((fg == 0 || bg == 0) && t_colors >= 16)\n\t{\n\t if (fg == 0 && term_default_cterm_fg >= 0)\n\t\tfg = term_default_cterm_fg + 1;\n\t if (bg == 0 && term_default_cterm_bg >= 0)\n\t\tbg = term_default_cterm_bg + 1;\n\t}\n\n\t/* with 8 colors set the bold attribute to get a bright foreground */\n\tif (bold == TRUE)\n\t attr |= HL_BOLD;\n\treturn get_cterm_attr_idx(attr, fg, bg);\n }\n return 0;\n}\n\n static void\nset_dirty_snapshot(term_T *term)\n{\n term->tl_dirty_snapshot = TRUE;\n#ifdef FEAT_TIMERS\n if (!term->tl_normal_mode)\n {\n\t/* Update the snapshot after 100 msec of not getting updates. */\n\tprofile_setlimit(100L, &term->tl_timer_due);\n\tterm->tl_timer_set = TRUE;\n }\n#endif\n}\n\n static int\nhandle_damage(VTermRect rect, void *user)\n{\n term_T *term = (term_T *)user;\n\n term->tl_dirty_row_start = MIN(term->tl_dirty_row_start, rect.start_row);\n term->tl_dirty_row_end = MAX(term->tl_dirty_row_end, rect.end_row);\n set_dirty_snapshot(term);\n redraw_buf_later(term->tl_buffer, SOME_VALID);\n return 1;\n}\n\n static void\nterm_scroll_up(term_T *term, int start_row, int count)\n{\n win_T\t\t *wp;\n VTermColor\t\t fg, bg;\n VTermScreenCellAttrs attr;\n int\t\t\t clear_attr;\n\n /* Set the color to clear lines with. */\n vterm_state_get_default_colors(vterm_obtain_state(term->tl_vterm),\n\t\t\t\t\t\t\t\t &fg, &bg);\n vim_memset(&attr, 0, sizeof(attr));\n clear_attr = cell2attr(attr, fg, bg);\n\n FOR_ALL_WINDOWS(wp)\n {\n\tif (wp->w_buffer == term->tl_buffer)\n\t win_del_lines(wp, start_row, count, FALSE, FALSE, clear_attr);\n }\n}\n\n static int\nhandle_moverect(VTermRect dest, VTermRect src, void *user)\n{\n term_T\t*term = (term_T *)user;\n int\t\tcount = src.start_row - dest.start_row;\n\n /* Scrolling up is done much more efficiently by deleting lines instead of\n * redrawing the text. But avoid doing this multiple times, postpone until\n * the redraw happens. */\n if (dest.start_col == src.start_col\n\t && dest.end_col == src.end_col\n\t && dest.start_row < src.start_row)\n {\n\tif (dest.start_row == 0)\n\t term->tl_postponed_scroll += count;\n\telse\n\t term_scroll_up(term, dest.start_row, count);\n }\n\n term->tl_dirty_row_start = MIN(term->tl_dirty_row_start, dest.start_row);\n term->tl_dirty_row_end = MIN(term->tl_dirty_row_end, dest.end_row);\n set_dirty_snapshot(term);\n\n /* Note sure if the scrolling will work correctly, let's do a complete\n * redraw later. */\n redraw_buf_later(term->tl_buffer, NOT_VALID);\n return 1;\n}\n\n static int\nhandle_movecursor(\n\tVTermPos pos,\n\tVTermPos oldpos UNUSED,\n\tint visible,\n\tvoid *user)\n{\n term_T\t*term = (term_T *)user;\n win_T\t*wp;\n\n term->tl_cursor_pos = pos;\n term->tl_cursor_visible = visible;\n\n FOR_ALL_WINDOWS(wp)\n {\n\tif (wp->w_buffer == term->tl_buffer)\n\t position_cursor(wp, &pos);\n }\n if (term->tl_buffer == curbuf && !term->tl_normal_mode)\n {\n\tmay_toggle_cursor(term);\n\tupdate_cursor(term, term->tl_cursor_visible);\n }\n\n return 1;\n}\n\n static int\nhandle_settermprop(\n\tVTermProp prop,\n\tVTermValue *value,\n\tvoid *user)\n{\n term_T\t*term = (term_T *)user;\n\n switch (prop)\n {\n\tcase VTERM_PROP_TITLE:\n\t vim_free(term->tl_title);\n\t /* a blank title isn't useful, make it empty, so that \"running\" is\n\t * displayed */\n\t if (*skipwhite((char_u *)value->string) == NUL)\n\t\tterm->tl_title = NULL;\n#ifdef WIN3264\n\t else if (!enc_utf8 && enc_codepage > 0)\n\t {\n\t\tWCHAR *ret = NULL;\n\t\tint\tlength = 0;\n\n\t\tMultiByteToWideChar_alloc(CP_UTF8, 0,\n\t\t\t(char*)value->string, (int)STRLEN(value->string),\n\t\t\t\t\t\t\t\t&ret, &length);\n\t\tif (ret != NULL)\n\t\t{\n\t\t WideCharToMultiByte_alloc(enc_codepage, 0,\n\t\t\t\t\tret, length, (char**)&term->tl_title,\n\t\t\t\t\t&length, 0, 0);\n\t\t vim_free(ret);\n\t\t}\n\t }\n#endif\n\t else\n\t\tterm->tl_title = vim_strsave((char_u *)value->string);\n\t VIM_CLEAR(term->tl_status_text);\n\t if (term == curbuf->b_term)\n\t\tmaketitle();\n\t break;\n\n\tcase VTERM_PROP_CURSORVISIBLE:\n\t term->tl_cursor_visible = value->boolean;\n\t may_toggle_cursor(term);\n\t out_flush();\n\t break;\n\n\tcase VTERM_PROP_CURSORBLINK:\n\t term->tl_cursor_blink = value->boolean;\n\t may_set_cursor_props(term);\n\t break;\n\n\tcase VTERM_PROP_CURSORSHAPE:\n\t term->tl_cursor_shape = value->number;\n\t may_set_cursor_props(term);\n\t break;\n\n\tcase VTERM_PROP_CURSORCOLOR:\n\t cursor_color_copy(&term->tl_cursor_color, (char_u*)value->string);\n\t may_set_cursor_props(term);\n\t break;\n\n\tcase VTERM_PROP_ALTSCREEN:\n\t /* TODO: do anything else? */\n\t term->tl_using_altscreen = value->boolean;\n\t break;\n\n\tdefault:\n\t break;\n }\n /* Always return 1, otherwise vterm doesn't store the value internally. */\n return 1;\n}\n\n/*\n * The job running in the terminal resized the terminal.\n */\n static int\nhandle_resize(int rows, int cols, void *user)\n{\n term_T\t*term = (term_T *)user;\n win_T\t*wp;\n\n term->tl_rows = rows;\n term->tl_cols = cols;\n if (term->tl_vterm_size_changed)\n\t/* Size was set by vterm_set_size(), don't set the window size. */\n\tterm->tl_vterm_size_changed = FALSE;\n else\n {\n\tFOR_ALL_WINDOWS(wp)\n\t{\n\t if (wp->w_buffer == term->tl_buffer)\n\t {\n\t\twin_setheight_win(rows, wp);\n\t\twin_setwidth_win(cols, wp);\n\t }\n\t}\n\tredraw_buf_later(term->tl_buffer, NOT_VALID);\n }\n return 1;\n}\n\n/*\n * Handle a line that is pushed off the top of the screen.\n */\n static int\nhandle_pushline(int cols, const VTermScreenCell *cells, void *user)\n{\n term_T\t*term = (term_T *)user;\n\n /* First remove the lines that were appended before, the pushed line goes\n * above it. */\n cleanup_scrollback(term);\n\n /* If the number of lines that are stored goes over 'termscrollback' then\n * delete the first 10%. */\n if (term->tl_scrollback.ga_len >= term->tl_buffer->b_p_twsl)\n {\n\tint\ttodo = term->tl_buffer->b_p_twsl / 10;\n\tint\ti;\n\n\tcurbuf = term->tl_buffer;\n\tfor (i = 0; i < todo; ++i)\n\t{\n\t vim_free(((sb_line_T *)term->tl_scrollback.ga_data + i)->sb_cells);\n\t ml_delete(1, FALSE);\n\t}\n\tcurbuf = curwin->w_buffer;\n\n\tterm->tl_scrollback.ga_len -= todo;\n\tmch_memmove(term->tl_scrollback.ga_data,\n\t (sb_line_T *)term->tl_scrollback.ga_data + todo,\n\t sizeof(sb_line_T) * term->tl_scrollback.ga_len);\n\tterm->tl_scrollback_scrolled -= todo;\n }\n\n if (ga_grow(&term->tl_scrollback, 1) == OK)\n {\n\tcellattr_T\t*p = NULL;\n\tint\t\tlen = 0;\n\tint\t\ti;\n\tint\t\tc;\n\tint\t\tcol;\n\tsb_line_T\t*line;\n\tgarray_T\tga;\n\tcellattr_T\tfill_attr = term->tl_default_color;\n\n\t/* do not store empty cells at the end */\n\tfor (i = 0; i < cols; ++i)\n\t if (cells[i].chars[0] != 0)\n\t\tlen = i + 1;\n\t else\n\t\tcell2cellattr(&cells[i], &fill_attr);\n\n\tga_init2(&ga, 1, 100);\n\tif (len > 0)\n\t p = (cellattr_T *)alloc((int)sizeof(cellattr_T) * len);\n\tif (p != NULL)\n\t{\n\t for (col = 0; col < len; col += cells[col].width)\n\t {\n\t\tif (ga_grow(&ga, MB_MAXBYTES) == FAIL)\n\t\t{\n\t\t ga.ga_len = 0;\n\t\t break;\n\t\t}\n\t\tfor (i = 0; (c = cells[col].chars[i]) > 0 || i == 0; ++i)\n\t\t ga.ga_len += utf_char2bytes(c == NUL ? ' ' : c,\n\t\t\t\t\t (char_u *)ga.ga_data + ga.ga_len);\n\t\tcell2cellattr(&cells[col], &p[col]);\n\t }\n\t}\n\tif (ga_grow(&ga, 1) == FAIL)\n\t add_scrollback_line_to_buffer(term, (char_u *)\"\", 0);\n\telse\n\t{\n\t *((char_u *)ga.ga_data + ga.ga_len) = NUL;\n\t add_scrollback_line_to_buffer(term, ga.ga_data, ga.ga_len);\n\t}\n\tga_clear(&ga);\n\n\tline = (sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t\t\t + term->tl_scrollback.ga_len;\n\tline->sb_cols = len;\n\tline->sb_cells = p;\n\tline->sb_fill_attr = fill_attr;\n\t++term->tl_scrollback.ga_len;\n\t++term->tl_scrollback_scrolled;\n }\n return 0; /* ignored */\n}\n\nstatic VTermScreenCallbacks screen_callbacks = {\n handle_damage,\t/* damage */\n handle_moverect,\t/* moverect */\n handle_movecursor,\t/* movecursor */\n handle_settermprop,\t/* settermprop */\n NULL,\t\t\t/* bell */\n handle_resize,\t/* resize */\n handle_pushline,\t/* sb_pushline */\n NULL\t\t\t/* sb_popline */\n};\n\n/*\n * Do the work after the channel of a terminal was closed.\n * Must be called only when updating_screen is FALSE.\n * Returns TRUE when a buffer was closed (list of terminals may have changed).\n */\n static int\nterm_after_channel_closed(term_T *term)\n{\n /* Unless in Terminal-Normal mode: clear the vterm. */\n if (!term->tl_normal_mode)\n {\n\tint\tfnum = term->tl_buffer->b_fnum;\n\n\tcleanup_vterm(term);\n\n\tif (term->tl_finish == TL_FINISH_CLOSE)\n\t{\n\t aco_save_T\taco;\n\t int\t\tdo_set_w_closing = term->tl_buffer->b_nwindows == 0;\n\n\t // ++close or term_finish == \"close\"\n\t ch_log(NULL, \"terminal job finished, closing window\");\n\t aucmd_prepbuf(&aco, term->tl_buffer);\n\t // Avoid closing the window if we temporarily use it.\n\t if (do_set_w_closing)\n\t\tcurwin->w_closing = TRUE;\n\t do_bufdel(DOBUF_WIPE, (char_u *)\"\", 1, fnum, fnum, FALSE);\n\t if (do_set_w_closing)\n\t\tcurwin->w_closing = FALSE;\n\t aucmd_restbuf(&aco);\n\t return TRUE;\n\t}\n\tif (term->tl_finish == TL_FINISH_OPEN\n\t\t\t\t && term->tl_buffer->b_nwindows == 0)\n\t{\n\t char buf[50];\n\n\t /* TODO: use term_opencmd */\n\t ch_log(NULL, \"terminal job finished, opening window\");\n\t vim_snprintf(buf, sizeof(buf),\n\t\t term->tl_opencmd == NULL\n\t\t\t ? \"botright sbuf %d\"\n\t\t\t : (char *)term->tl_opencmd, fnum);\n\t do_cmdline_cmd((char_u *)buf);\n\t}\n\telse\n\t ch_log(NULL, \"terminal job finished\");\n }\n\n redraw_buf_and_status_later(term->tl_buffer, NOT_VALID);\n return FALSE;\n}\n\n/*\n * Called when a channel has been closed.\n * If this was a channel for a terminal window then finish it up.\n */\n void\nterm_channel_closed(channel_T *ch)\n{\n term_T *term;\n term_T *next_term;\n int\t did_one = FALSE;\n\n for (term = first_term; term != NULL; term = next_term)\n {\n\tnext_term = term->tl_next;\n\tif (term->tl_job == ch->ch_job)\n\t{\n\t term->tl_channel_closed = TRUE;\n\t did_one = TRUE;\n\n\t VIM_CLEAR(term->tl_title);\n\t VIM_CLEAR(term->tl_status_text);\n#ifdef WIN3264\n\t if (term->tl_out_fd != NULL)\n\t {\n\t\tfclose(term->tl_out_fd);\n\t\tterm->tl_out_fd = NULL;\n\t }\n#endif\n\n\t if (updating_screen)\n\t {\n\t\t/* Cannot open or close windows now. Can happen when\n\t\t * 'lazyredraw' is set. */\n\t\tterm->tl_channel_recently_closed = TRUE;\n\t\tcontinue;\n\t }\n\n\t if (term_after_channel_closed(term))\n\t\tnext_term = first_term;\n\t}\n }\n\n if (did_one)\n {\n\tredraw_statuslines();\n\n\t/* Need to break out of vgetc(). */\n\tins_char_typebuf(K_IGNORE);\n\ttypebuf_was_filled = TRUE;\n\n\tterm = curbuf->b_term;\n\tif (term != NULL)\n\t{\n\t if (term->tl_job == ch->ch_job)\n\t\tmaketitle();\n\t update_cursor(term, term->tl_cursor_visible);\n\t}\n }\n}\n\n/*\n * To be called after resetting updating_screen: handle any terminal where the\n * channel was closed.\n */\n void\nterm_check_channel_closed_recently()\n{\n term_T *term;\n term_T *next_term;\n\n for (term = first_term; term != NULL; term = next_term)\n {\n\tnext_term = term->tl_next;\n\tif (term->tl_channel_recently_closed)\n\t{\n\t term->tl_channel_recently_closed = FALSE;\n\t if (term_after_channel_closed(term))\n\t\t// start over, the list may have changed\n\t\tnext_term = first_term;\n\t}\n }\n}\n\n/*\n * Fill one screen line from a line of the terminal.\n * Advances \"pos\" to past the last column.\n */\n static void\nterm_line2screenline(VTermScreen *screen, VTermPos *pos, int max_col)\n{\n int off = screen_get_current_line_off();\n\n for (pos->col = 0; pos->col < max_col; )\n {\n\tVTermScreenCell cell;\n\tint\t\tc;\n\n\tif (vterm_screen_get_cell(screen, *pos, &cell) == 0)\n\t vim_memset(&cell, 0, sizeof(cell));\n\n\tc = cell.chars[0];\n\tif (c == NUL)\n\t{\n\t ScreenLines[off] = ' ';\n\t if (enc_utf8)\n\t\tScreenLinesUC[off] = NUL;\n\t}\n\telse\n\t{\n\t if (enc_utf8)\n\t {\n\t\tint i;\n\n\t\t/* composing chars */\n\t\tfor (i = 0; i < Screen_mco\n\t\t\t && i + 1 < VTERM_MAX_CHARS_PER_CELL; ++i)\n\t\t{\n\t\t ScreenLinesC[i][off] = cell.chars[i + 1];\n\t\t if (cell.chars[i + 1] == 0)\n\t\t\tbreak;\n\t\t}\n\t\tif (c >= 0x80 || (Screen_mco > 0\n\t\t\t\t\t && ScreenLinesC[0][off] != 0))\n\t\t{\n\t\t ScreenLines[off] = ' ';\n\t\t ScreenLinesUC[off] = c;\n\t\t}\n\t\telse\n\t\t{\n\t\t ScreenLines[off] = c;\n\t\t ScreenLinesUC[off] = NUL;\n\t\t}\n\t }\n#ifdef WIN3264\n\t else if (has_mbyte && c >= 0x80)\n\t {\n\t\tchar_u\tmb[MB_MAXBYTES+1];\n\t\tWCHAR\twc = c;\n\n\t\tif (WideCharToMultiByte(GetACP(), 0, &wc, 1,\n\t\t\t\t\t (char*)mb, 2, 0, 0) > 1)\n\t\t{\n\t\t ScreenLines[off] = mb[0];\n\t\t ScreenLines[off + 1] = mb[1];\n\t\t cell.width = mb_ptr2cells(mb);\n\t\t}\n\t\telse\n\t\t ScreenLines[off] = c;\n\t }\n#endif\n\t else\n\t\tScreenLines[off] = c;\n\t}\n\tScreenAttrs[off] = cell2attr(cell.attrs, cell.fg, cell.bg);\n\n\t++pos->col;\n\t++off;\n\tif (cell.width == 2)\n\t{\n\t if (enc_utf8)\n\t\tScreenLinesUC[off] = NUL;\n\n\t /* don't set the second byte to NUL for a DBCS encoding, it\n\t * has been set above */\n\t if (enc_utf8 || !has_mbyte)\n\t\tScreenLines[off] = NUL;\n\n\t ++pos->col;\n\t ++off;\n\t}\n }\n}\n\n#if defined(FEAT_GUI)\n static void\nupdate_system_term(term_T *term)\n{\n VTermPos\t pos;\n VTermScreen\t *screen;\n\n if (term->tl_vterm == NULL)\n\treturn;\n screen = vterm_obtain_screen(term->tl_vterm);\n\n /* Scroll up to make more room for terminal lines if needed. */\n while (term->tl_toprow > 0\n\t\t\t && (Rows - term->tl_toprow) < term->tl_dirty_row_end)\n {\n\tint save_p_more = p_more;\n\n\tp_more = FALSE;\n\tmsg_row = Rows - 1;\n\tmsg_puts((char_u *)\"\\n\");\n\tp_more = save_p_more;\n\t--term->tl_toprow;\n }\n\n for (pos.row = term->tl_dirty_row_start; pos.row < term->tl_dirty_row_end\n\t\t\t\t\t\t && pos.row < Rows; ++pos.row)\n {\n\tif (pos.row < term->tl_rows)\n\t{\n\t int max_col = MIN(Columns, term->tl_cols);\n\n\t term_line2screenline(screen, &pos, max_col);\n\t}\n\telse\n\t pos.col = 0;\n\n\tscreen_line(term->tl_toprow + pos.row, 0, pos.col, Columns, FALSE);\n }\n\n term->tl_dirty_row_start = MAX_ROW;\n term->tl_dirty_row_end = 0;\n update_cursor(term, TRUE);\n}\n#endif\n\n/*\n * Return TRUE if window \"wp\" is to be redrawn with term_update_window().\n * Returns FALSE when there is no terminal running in this window or it is in\n * Terminal-Normal mode.\n */\n int\nterm_do_update_window(win_T *wp)\n{\n term_T\t*term = wp->w_buffer->b_term;\n\n return term != NULL && term->tl_vterm != NULL && !term->tl_normal_mode;\n}\n\n/*\n * Called to update a window that contains an active terminal.\n */\n void\nterm_update_window(win_T *wp)\n{\n term_T\t*term = wp->w_buffer->b_term;\n VTerm\t*vterm;\n VTermScreen *screen;\n VTermState\t*state;\n VTermPos\tpos;\n int\t\trows, cols;\n int\t\tnewrows, newcols;\n int\t\tminsize;\n win_T\t*twp;\n\n vterm = term->tl_vterm;\n screen = vterm_obtain_screen(vterm);\n state = vterm_obtain_state(vterm);\n\n /* We use NOT_VALID on a resize or scroll, redraw everything then. With\n * SOME_VALID only redraw what was marked dirty. */\n if (wp->w_redr_type > SOME_VALID)\n {\n\tterm->tl_dirty_row_start = 0;\n\tterm->tl_dirty_row_end = MAX_ROW;\n\n\tif (term->tl_postponed_scroll > 0\n\t\t\t && term->tl_postponed_scroll < term->tl_rows / 3)\n\t /* Scrolling is usually faster than redrawing, when there are only\n\t * a few lines to scroll. */\n\t term_scroll_up(term, 0, term->tl_postponed_scroll);\n\tterm->tl_postponed_scroll = 0;\n }\n\n /*\n * If the window was resized a redraw will be triggered and we get here.\n * Adjust the size of the vterm unless 'termwinsize' specifies a fixed size.\n */\n minsize = parse_termwinsize(wp, &rows, &cols);\n\n newrows = 99999;\n newcols = 99999;\n FOR_ALL_WINDOWS(twp)\n {\n\t/* When more than one window shows the same terminal, use the\n\t * smallest size. */\n\tif (twp->w_buffer == term->tl_buffer)\n\t{\n\t newrows = MIN(newrows, twp->w_height);\n\t newcols = MIN(newcols, twp->w_width);\n\t}\n }\n newrows = rows == 0 ? newrows : minsize ? MAX(rows, newrows) : rows;\n newcols = cols == 0 ? newcols : minsize ? MAX(cols, newcols) : cols;\n\n if (term->tl_rows != newrows || term->tl_cols != newcols)\n {\n\tterm->tl_vterm_size_changed = TRUE;\n\tvterm_set_size(vterm, newrows, newcols);\n\tch_log(term->tl_job->jv_channel, \"Resizing terminal to %d lines\",\n\t\t\t\t\t\t\t\t newrows);\n\tterm_report_winsize(term, newrows, newcols);\n\n\t// Updating the terminal size will cause the snapshot to be cleared.\n\t// When not in terminal_loop() we need to restore it.\n\tif (term != in_terminal_loop)\n\t may_move_terminal_to_buffer(term, FALSE);\n }\n\n /* The cursor may have been moved when resizing. */\n vterm_state_get_cursorpos(state, &pos);\n position_cursor(wp, &pos);\n\n for (pos.row = term->tl_dirty_row_start; pos.row < term->tl_dirty_row_end\n\t\t\t\t\t && pos.row < wp->w_height; ++pos.row)\n {\n\tif (pos.row < term->tl_rows)\n\t{\n\t int max_col = MIN(wp->w_width, term->tl_cols);\n\n\t term_line2screenline(screen, &pos, max_col);\n\t}\n\telse\n\t pos.col = 0;\n\n\tscreen_line(wp->w_winrow + pos.row\n#ifdef FEAT_MENU\n\t\t\t\t+ winbar_height(wp)\n#endif\n\t\t\t\t, wp->w_wincol, pos.col, wp->w_width, FALSE);\n }\n term->tl_dirty_row_start = MAX_ROW;\n term->tl_dirty_row_end = 0;\n}\n\n/*\n * Return TRUE if \"wp\" is a terminal window where the job has finished.\n */\n int\nterm_is_finished(buf_T *buf)\n{\n return buf->b_term != NULL && buf->b_term->tl_vterm == NULL;\n}\n\n/*\n * Return TRUE if \"wp\" is a terminal window where the job has finished or we\n * are in Terminal-Normal mode, thus we show the buffer contents.\n */\n int\nterm_show_buffer(buf_T *buf)\n{\n term_T *term = buf->b_term;\n\n return term != NULL && (term->tl_vterm == NULL || term->tl_normal_mode);\n}\n\n/*\n * The current buffer is going to be changed. If there is terminal\n * highlighting remove it now.\n */\n void\nterm_change_in_curbuf(void)\n{\n term_T *term = curbuf->b_term;\n\n if (term_is_finished(curbuf) && term->tl_scrollback.ga_len > 0)\n {\n\tfree_scrollback(term);\n\tredraw_buf_later(term->tl_buffer, NOT_VALID);\n\n\t/* The buffer is now like a normal buffer, it cannot be easily\n\t * abandoned when changed. */\n\tset_string_option_direct((char_u *)\"buftype\", -1,\n\t\t\t\t\t (char_u *)\"\", OPT_FREE|OPT_LOCAL, 0);\n }\n}\n\n/*\n * Get the screen attribute for a position in the buffer.\n * Use a negative \"col\" to get the filler background color.\n */\n int\nterm_get_attr(buf_T *buf, linenr_T lnum, int col)\n{\n term_T\t*term = buf->b_term;\n sb_line_T\t*line;\n cellattr_T\t*cellattr;\n\n if (lnum > term->tl_scrollback.ga_len)\n\tcellattr = &term->tl_default_color;\n else\n {\n\tline = (sb_line_T *)term->tl_scrollback.ga_data + lnum - 1;\n\tif (col < 0 || col >= line->sb_cols)\n\t cellattr = &line->sb_fill_attr;\n\telse\n\t cellattr = line->sb_cells + col;\n }\n return cell2attr(cellattr->attrs, cellattr->fg, cellattr->bg);\n}\n\n/*\n * Convert a cterm color number 0 - 255 to RGB.\n * This is compatible with xterm.\n */\n static void\ncterm_color2vterm(int nr, VTermColor *rgb)\n{\n cterm_color2rgb(nr, &rgb->red, &rgb->green, &rgb->blue, &rgb->ansi_index);\n}\n\n/*\n * Initialize term->tl_default_color from the environment.\n */\n static void\ninit_default_colors(term_T *term)\n{\n VTermColor\t *fg, *bg;\n int\t\t fgval, bgval;\n int\t\t id;\n\n vim_memset(&term->tl_default_color.attrs, 0, sizeof(VTermScreenCellAttrs));\n term->tl_default_color.width = 1;\n fg = &term->tl_default_color.fg;\n bg = &term->tl_default_color.bg;\n\n /* Vterm uses a default black background. Set it to white when\n * 'background' is \"light\". */\n if (*p_bg == 'l')\n {\n\tfgval = 0;\n\tbgval = 255;\n }\n else\n {\n\tfgval = 255;\n\tbgval = 0;\n }\n fg->red = fg->green = fg->blue = fgval;\n bg->red = bg->green = bg->blue = bgval;\n fg->ansi_index = bg->ansi_index = VTERM_ANSI_INDEX_DEFAULT;\n\n /* The \"Terminal\" highlight group overrules the defaults. */\n id = syn_name2id((char_u *)\"Terminal\");\n\n /* Use the actual color for the GUI and when 'termguicolors' is set. */\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS)\n if (0\n# ifdef FEAT_GUI\n\t || gui.in_use\n# endif\n# ifdef FEAT_TERMGUICOLORS\n\t || p_tgc\n# ifdef FEAT_VTP\n\t /* Finally get INVALCOLOR on this execution path */\n\t || (!p_tgc && t_colors >= 256)\n# endif\n# endif\n )\n {\n\tguicolor_T\tfg_rgb = INVALCOLOR;\n\tguicolor_T\tbg_rgb = INVALCOLOR;\n\n\tif (id != 0)\n\t syn_id2colors(id, &fg_rgb, &bg_rgb);\n\n# ifdef FEAT_GUI\n\tif (gui.in_use)\n\t{\n\t if (fg_rgb == INVALCOLOR)\n\t\tfg_rgb = gui.norm_pixel;\n\t if (bg_rgb == INVALCOLOR)\n\t\tbg_rgb = gui.back_pixel;\n\t}\n# ifdef FEAT_TERMGUICOLORS\n\telse\n# endif\n# endif\n# ifdef FEAT_TERMGUICOLORS\n\t{\n\t if (fg_rgb == INVALCOLOR)\n\t\tfg_rgb = cterm_normal_fg_gui_color;\n\t if (bg_rgb == INVALCOLOR)\n\t\tbg_rgb = cterm_normal_bg_gui_color;\n\t}\n# endif\n\tif (fg_rgb != INVALCOLOR)\n\t{\n\t long_u rgb = GUI_MCH_GET_RGB(fg_rgb);\n\n\t fg->red = (unsigned)(rgb >> 16);\n\t fg->green = (unsigned)(rgb >> 8) & 255;\n\t fg->blue = (unsigned)rgb & 255;\n\t}\n\tif (bg_rgb != INVALCOLOR)\n\t{\n\t long_u rgb = GUI_MCH_GET_RGB(bg_rgb);\n\n\t bg->red = (unsigned)(rgb >> 16);\n\t bg->green = (unsigned)(rgb >> 8) & 255;\n\t bg->blue = (unsigned)rgb & 255;\n\t}\n }\n else\n#endif\n if (id != 0 && t_colors >= 16)\n {\n\tif (term_default_cterm_fg >= 0)\n\t cterm_color2vterm(term_default_cterm_fg, fg);\n\tif (term_default_cterm_bg >= 0)\n\t cterm_color2vterm(term_default_cterm_bg, bg);\n }\n else\n {\n#if defined(WIN3264) && !defined(FEAT_GUI_W32)\n\tint tmp;\n#endif\n\n\t/* In an MS-Windows console we know the normal colors. */\n\tif (cterm_normal_fg_color > 0)\n\t{\n\t cterm_color2vterm(cterm_normal_fg_color - 1, fg);\n# if defined(WIN3264) && !defined(FEAT_GUI_W32)\n\t tmp = fg->red;\n\t fg->red = fg->blue;\n\t fg->blue = tmp;\n# endif\n\t}\n# ifdef FEAT_TERMRESPONSE\n\telse\n\t term_get_fg_color(&fg->red, &fg->green, &fg->blue);\n# endif\n\n\tif (cterm_normal_bg_color > 0)\n\t{\n\t cterm_color2vterm(cterm_normal_bg_color - 1, bg);\n# if defined(WIN3264) && !defined(FEAT_GUI_W32)\n\t tmp = bg->red;\n\t bg->red = bg->blue;\n\t bg->blue = tmp;\n# endif\n\t}\n# ifdef FEAT_TERMRESPONSE\n\telse\n\t term_get_bg_color(&bg->red, &bg->green, &bg->blue);\n# endif\n }\n}\n\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS)\n/*\n * Set the 16 ANSI colors from array of RGB values\n */\n static void\nset_vterm_palette(VTerm *vterm, long_u *rgb)\n{\n int\t\tindex = 0;\n VTermState\t*state = vterm_obtain_state(vterm);\n for (; index < 16; index++)\n {\n\tVTermColor\tcolor;\n\tcolor.red = (unsigned)(rgb[index] >> 16);\n\tcolor.green = (unsigned)(rgb[index] >> 8) & 255;\n\tcolor.blue = (unsigned)rgb[index] & 255;\n\tvterm_state_set_palette_color(state, index, &color);\n }\n}\n\n/*\n * Set the ANSI color palette from a list of colors\n */\n static int\nset_ansi_colors_list(VTerm *vterm, list_T *list)\n{\n int\t\tn = 0;\n long_u\trgb[16];\n listitem_T\t*li = list->lv_first;\n\n for (; li != NULL && n < 16; li = li->li_next, n++)\n {\n\tchar_u\t\t*color_name;\n\tguicolor_T\tguicolor;\n\n\tcolor_name = tv_get_string_chk(&li->li_tv);\n\tif (color_name == NULL)\n\t return FAIL;\n\n\tguicolor = GUI_GET_COLOR(color_name);\n\tif (guicolor == INVALCOLOR)\n\t return FAIL;\n\n\trgb[n] = GUI_MCH_GET_RGB(guicolor);\n }\n\n if (n != 16 || li != NULL)\n\treturn FAIL;\n\n set_vterm_palette(vterm, rgb);\n\n return OK;\n}\n\n/*\n * Initialize the ANSI color palette from g:terminal_ansi_colors[0:15]\n */\n static void\ninit_vterm_ansi_colors(VTerm *vterm)\n{\n dictitem_T\t*var = find_var((char_u *)\"g:terminal_ansi_colors\", NULL, TRUE);\n\n if (var != NULL\n\t && (var->di_tv.v_type != VAR_LIST\n\t\t|| var->di_tv.vval.v_list == NULL\n\t\t|| set_ansi_colors_list(vterm, var->di_tv.vval.v_list) == FAIL))\n\tEMSG2(_(e_invarg2), \"g:terminal_ansi_colors\");\n}\n#endif\n\n/*\n * Handles a \"drop\" command from the job in the terminal.\n * \"item\" is the file name, \"item->li_next\" may have options.\n */\n static void\nhandle_drop_command(listitem_T *item)\n{\n char_u\t*fname = tv_get_string(&item->li_tv);\n listitem_T\t*opt_item = item->li_next;\n int\t\tbufnr;\n win_T\t*wp;\n tabpage_T *tp;\n exarg_T\tea;\n char_u\t*tofree = NULL;\n\n bufnr = buflist_add(fname, BLN_LISTED | BLN_NOOPT);\n FOR_ALL_TAB_WINDOWS(tp, wp)\n {\n\tif (wp->w_buffer->b_fnum == bufnr)\n\t{\n\t /* buffer is in a window already, go there */\n\t goto_tabpage_win(tp, wp);\n\t return;\n\t}\n }\n\n vim_memset(&ea, 0, sizeof(ea));\n\n if (opt_item != NULL && opt_item->li_tv.v_type == VAR_DICT\n\t\t\t\t\t&& opt_item->li_tv.vval.v_dict != NULL)\n {\n\tdict_T *dict = opt_item->li_tv.vval.v_dict;\n\tchar_u *p;\n\n\tp = dict_get_string(dict, (char_u *)\"ff\", FALSE);\n\tif (p == NULL)\n\t p = dict_get_string(dict, (char_u *)\"fileformat\", FALSE);\n\tif (p != NULL)\n\t{\n\t if (check_ff_value(p) == FAIL)\n\t\tch_log(NULL, \"Invalid ff argument to drop: %s\", p);\n\t else\n\t\tea.force_ff = *p;\n\t}\n\tp = dict_get_string(dict, (char_u *)\"enc\", FALSE);\n\tif (p == NULL)\n\t p = dict_get_string(dict, (char_u *)\"encoding\", FALSE);\n\tif (p != NULL)\n\t{\n\t ea.cmd = alloc((int)STRLEN(p) + 12);\n\t if (ea.cmd != NULL)\n\t {\n\t\tsprintf((char *)ea.cmd, \"sbuf ++enc=%s\", p);\n\t\tea.force_enc = 11;\n\t\ttofree = ea.cmd;\n\t }\n\t}\n\n\tp = dict_get_string(dict, (char_u *)\"bad\", FALSE);\n\tif (p != NULL)\n\t get_bad_opt(p, &ea);\n\n\tif (dict_find(dict, (char_u *)\"bin\", -1) != NULL)\n\t ea.force_bin = FORCE_BIN;\n\tif (dict_find(dict, (char_u *)\"binary\", -1) != NULL)\n\t ea.force_bin = FORCE_BIN;\n\tif (dict_find(dict, (char_u *)\"nobin\", -1) != NULL)\n\t ea.force_bin = FORCE_NOBIN;\n\tif (dict_find(dict, (char_u *)\"nobinary\", -1) != NULL)\n\t ea.force_bin = FORCE_NOBIN;\n }\n\n /* open in new window, like \":split fname\" */\n if (ea.cmd == NULL)\n\tea.cmd = (char_u *)\"split\";\n ea.arg = fname;\n ea.cmdidx = CMD_split;\n ex_splitview(&ea);\n\n vim_free(tofree);\n}\n\n/*\n * Handles a function call from the job running in a terminal.\n * \"item\" is the function name, \"item->li_next\" has the arguments.\n */\n static void\nhandle_call_command(term_T *term, channel_T *channel, listitem_T *item)\n{\n char_u\t*func;\n typval_T\targvars[2];\n typval_T\trettv;\n int\t\tdoesrange;\n\n if (item->li_next == NULL)\n {\n\tch_log(channel, \"Missing function arguments for call\");\n\treturn;\n }\n func = tv_get_string(&item->li_tv);\n\n if (STRNCMP(func, \"Tapi_\", 5) != 0)\n {\n\tch_log(channel, \"Invalid function name: %s\", func);\n\treturn;\n }\n\n argvars[0].v_type = VAR_NUMBER;\n argvars[0].vval.v_number = term->tl_buffer->b_fnum;\n argvars[1] = item->li_next->li_tv;\n if (call_func(func, (int)STRLEN(func), &rettv,\n\t\t2, argvars, /* argv_func */ NULL,\n\t\t/* firstline */ 1, /* lastline */ 1,\n\t\t&doesrange, /* evaluate */ TRUE,\n\t\t/* partial */ NULL, /* selfdict */ NULL) == OK)\n {\n\tclear_tv(&rettv);\n\tch_log(channel, \"Function %s called\", func);\n }\n else\n\tch_log(channel, \"Calling function %s failed\", func);\n}\n\n/*\n * Called by libvterm when it cannot recognize an OSC sequence.\n * We recognize a terminal API command.\n */\n static int\nparse_osc(const char *command, size_t cmdlen, void *user)\n{\n term_T\t*term = (term_T *)user;\n js_read_T\treader;\n typval_T\ttv;\n channel_T\t*channel = term->tl_job == NULL ? NULL\n\t\t\t\t\t\t : term->tl_job->jv_channel;\n\n /* We recognize only OSC 5 1 ; {command} */\n if (cmdlen < 3 || STRNCMP(command, \"51;\", 3) != 0)\n\treturn 0; /* not handled */\n\n reader.js_buf = vim_strnsave((char_u *)command + 3, (int)(cmdlen - 3));\n if (reader.js_buf == NULL)\n\treturn 1;\n reader.js_fill = NULL;\n reader.js_used = 0;\n if (json_decode(&reader, &tv, 0) == OK\n\t && tv.v_type == VAR_LIST\n\t && tv.vval.v_list != NULL)\n {\n\tlistitem_T *item = tv.vval.v_list->lv_first;\n\n\tif (item == NULL)\n\t ch_log(channel, \"Missing command\");\n\telse\n\t{\n\t char_u\t*cmd = tv_get_string(&item->li_tv);\n\n\t /* Make sure an invoked command doesn't delete the buffer (and the\n\t * terminal) under our fingers. */\n\t ++term->tl_buffer->b_locked;\n\n\t item = item->li_next;\n\t if (item == NULL)\n\t\tch_log(channel, \"Missing argument for %s\", cmd);\n\t else if (STRCMP(cmd, \"drop\") == 0)\n\t\thandle_drop_command(item);\n\t else if (STRCMP(cmd, \"call\") == 0)\n\t\thandle_call_command(term, channel, item);\n\t else\n\t\tch_log(channel, \"Invalid command received: %s\", cmd);\n\t --term->tl_buffer->b_locked;\n\t}\n }\n else\n\tch_log(channel, \"Invalid JSON received\");\n\n vim_free(reader.js_buf);\n clear_tv(&tv);\n return 1;\n}\n\nstatic VTermParserCallbacks parser_fallbacks = {\n NULL,\t\t/* text */\n NULL,\t\t/* control */\n NULL,\t\t/* escape */\n NULL,\t\t/* csi */\n parse_osc,\t/* osc */\n NULL,\t\t/* dcs */\n NULL\t\t/* resize */\n};\n\n/*\n * Use Vim's allocation functions for vterm so profiling works.\n */\n static void *\nvterm_malloc(size_t size, void *data UNUSED)\n{\n return alloc_clear((unsigned) size);\n}\n\n static void\nvterm_memfree(void *ptr, void *data UNUSED)\n{\n vim_free(ptr);\n}\n\nstatic VTermAllocatorFunctions vterm_allocator = {\n &vterm_malloc,\n &vterm_memfree\n};\n\n/*\n * Create a new vterm and initialize it.\n */\n static void\ncreate_vterm(term_T *term, int rows, int cols)\n{\n VTerm\t *vterm;\n VTermScreen\t *screen;\n VTermState\t *state;\n VTermValue\t value;\n\n vterm = vterm_new_with_allocator(rows, cols, &vterm_allocator, NULL);\n term->tl_vterm = vterm;\n screen = vterm_obtain_screen(vterm);\n vterm_screen_set_callbacks(screen, &screen_callbacks, term);\n /* TODO: depends on 'encoding'. */\n vterm_set_utf8(vterm, 1);\n\n init_default_colors(term);\n\n vterm_state_set_default_colors(\n\t vterm_obtain_state(vterm),\n\t &term->tl_default_color.fg,\n\t &term->tl_default_color.bg);\n\n if (t_colors >= 16)\n\tvterm_state_set_bold_highbright(vterm_obtain_state(vterm), 1);\n\n /* Required to initialize most things. */\n vterm_screen_reset(screen, 1 /* hard */);\n\n /* Allow using alternate screen. */\n vterm_screen_enable_altscreen(screen, 1);\n\n /* For unix do not use a blinking cursor. In an xterm this causes the\n * cursor to blink if it's blinking in the xterm.\n * For Windows we respect the system wide setting. */\n#ifdef WIN3264\n if (GetCaretBlinkTime() == INFINITE)\n\tvalue.boolean = 0;\n else\n\tvalue.boolean = 1;\n#else\n value.boolean = 0;\n#endif\n state = vterm_obtain_state(vterm);\n vterm_state_set_termprop(state, VTERM_PROP_CURSORBLINK, &value);\n vterm_state_set_unrecognised_fallbacks(state, &parser_fallbacks, term);\n}\n\n/*\n * Return the text to show for the buffer name and status.\n */\n char_u *\nterm_get_status_text(term_T *term)\n{\n if (term->tl_status_text == NULL)\n {\n\tchar_u *txt;\n\tsize_t len;\n\n\tif (term->tl_normal_mode)\n\t{\n\t if (term_job_running(term))\n\t\ttxt = (char_u *)_(\"Terminal\");\n\t else\n\t\ttxt = (char_u *)_(\"Terminal-finished\");\n\t}\n\telse if (term->tl_title != NULL)\n\t txt = term->tl_title;\n\telse if (term_none_open(term))\n\t txt = (char_u *)_(\"active\");\n\telse if (term_job_running(term))\n\t txt = (char_u *)_(\"running\");\n\telse\n\t txt = (char_u *)_(\"finished\");\n\tlen = 9 + STRLEN(term->tl_buffer->b_fname) + STRLEN(txt);\n\tterm->tl_status_text = alloc((int)len);\n\tif (term->tl_status_text != NULL)\n\t vim_snprintf((char *)term->tl_status_text, len, \"%s [%s]\",\n\t\t\t\t\t\tterm->tl_buffer->b_fname, txt);\n }\n return term->tl_status_text;\n}\n\n/*\n * Mark references in jobs of terminals.\n */\n int\nset_ref_in_term(int copyID)\n{\n int\t\tabort = FALSE;\n term_T\t*term;\n typval_T\ttv;\n\n for (term = first_term; term != NULL; term = term->tl_next)\n\tif (term->tl_job != NULL)\n\t{\n\t tv.v_type = VAR_JOB;\n\t tv.vval.v_job = term->tl_job;\n\t abort = abort || set_ref_in_item(&tv, copyID, NULL, NULL);\n\t}\n return abort;\n}\n\n/*\n * Cache \"Terminal\" highlight group colors.\n */\n void\nset_terminal_default_colors(int cterm_fg, int cterm_bg)\n{\n term_default_cterm_fg = cterm_fg - 1;\n term_default_cterm_bg = cterm_bg - 1;\n}\n\n/*\n * Get the buffer from the first argument in \"argvars\".\n * Returns NULL when the buffer is not for a terminal window and logs a message\n * with \"where\".\n */\n static buf_T *\nterm_get_buf(typval_T *argvars, char *where)\n{\n buf_T *buf;\n\n (void)tv_get_number(&argvars[0]);\t /* issue errmsg if type error */\n ++emsg_off;\n buf = get_buf_tv(&argvars[0], FALSE);\n --emsg_off;\n if (buf == NULL || buf->b_term == NULL)\n {\n\tch_log(NULL, \"%s: invalid buffer argument\", where);\n\treturn NULL;\n }\n return buf;\n}\n\n static int\nsame_color(VTermColor *a, VTermColor *b)\n{\n return a->red == b->red\n\t&& a->green == b->green\n\t&& a->blue == b->blue\n\t&& a->ansi_index == b->ansi_index;\n}\n\n static void\ndump_term_color(FILE *fd, VTermColor *color)\n{\n fprintf(fd, \"%02x%02x%02x%d\",\n\t (int)color->red, (int)color->green, (int)color->blue,\n\t (int)color->ansi_index);\n}\n\n/*\n * \"term_dumpwrite(buf, filename, options)\" function\n *\n * Each screen cell in full is:\n * |{characters}+{attributes}#{fg-color}{color-idx}#{bg-color}{color-idx}\n * {characters} is a space for an empty cell\n * For a double-width character \"+\" is changed to \"*\" and the next cell is\n * skipped.\n * {attributes} is the decimal value of HL_BOLD + HL_UNDERLINE, etc.\n *\t\t\t when \"&\" use the same as the previous cell.\n * {fg-color} is hex RGB, when \"&\" use the same as the previous cell.\n * {bg-color} is hex RGB, when \"&\" use the same as the previous cell.\n * {color-idx} is a number from 0 to 255\n *\n * Screen cell with same width, attributes and color as the previous one:\n * |{characters}\n *\n * To use the color of the previous cell, use \"&\" instead of {color}-{idx}.\n *\n * Repeating the previous screen cell:\n * @{count}\n */\n void\nf_term_dumpwrite(typval_T *argvars, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_dumpwrite()\");\n term_T\t*term;\n char_u\t*fname;\n int\t\tmax_height = 0;\n int\t\tmax_width = 0;\n stat_T\tst;\n FILE\t*fd;\n VTermPos\tpos;\n VTermScreen *screen;\n VTermScreenCell prev_cell;\n VTermState\t*state;\n VTermPos\tcursor_pos;\n\n if (check_restricted() || check_secure())\n\treturn;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n if (term->tl_vterm == NULL)\n {\n\tEMSG(_(\"E958: Job already finished\"));\n\treturn;\n }\n\n if (argvars[2].v_type != VAR_UNKNOWN)\n {\n\tdict_T *d;\n\n\tif (argvars[2].v_type != VAR_DICT)\n\t{\n\t EMSG(_(e_dictreq));\n\t return;\n\t}\n\td = argvars[2].vval.v_dict;\n\tif (d != NULL)\n\t{\n\t max_height = dict_get_number(d, (char_u *)\"rows\");\n\t max_width = dict_get_number(d, (char_u *)\"columns\");\n\t}\n }\n\n fname = tv_get_string_chk(&argvars[1]);\n if (fname == NULL)\n\treturn;\n if (mch_stat((char *)fname, &st) >= 0)\n {\n\tEMSG2(_(\"E953: File exists: %s\"), fname);\n\treturn;\n }\n\n if (*fname == NUL || (fd = mch_fopen((char *)fname, WRITEBIN)) == NULL)\n {\n\tEMSG2(_(e_notcreate), *fname == NUL ? (char_u *)_(\"\") : fname);\n\treturn;\n }\n\n vim_memset(&prev_cell, 0, sizeof(prev_cell));\n\n screen = vterm_obtain_screen(term->tl_vterm);\n state = vterm_obtain_state(term->tl_vterm);\n vterm_state_get_cursorpos(state, &cursor_pos);\n\n for (pos.row = 0; (max_height == 0 || pos.row < max_height)\n\t\t\t\t\t && pos.row < term->tl_rows; ++pos.row)\n {\n\tint\t\trepeat = 0;\n\n\tfor (pos.col = 0; (max_width == 0 || pos.col < max_width)\n\t\t\t\t\t && pos.col < term->tl_cols; ++pos.col)\n\t{\n\t VTermScreenCell cell;\n\t int\t\t same_attr;\n\t int\t\t same_chars = TRUE;\n\t int\t\t i;\n\t int\t\t is_cursor_pos = (pos.col == cursor_pos.col\n\t\t\t\t\t\t && pos.row == cursor_pos.row);\n\n\t if (vterm_screen_get_cell(screen, pos, &cell) == 0)\n\t\tvim_memset(&cell, 0, sizeof(cell));\n\n\t for (i = 0; i < VTERM_MAX_CHARS_PER_CELL; ++i)\n\t {\n\t\tint c = cell.chars[i];\n\t\tint pc = prev_cell.chars[i];\n\n\t\t/* For the first character NUL is the same as space. */\n\t\tif (i == 0)\n\t\t{\n\t\t c = (c == NUL) ? ' ' : c;\n\t\t pc = (pc == NUL) ? ' ' : pc;\n\t\t}\n\t\tif (c != pc)\n\t\t same_chars = FALSE;\n\t\tif (c == NUL || pc == NUL)\n\t\t break;\n\t }\n\t same_attr = vtermAttr2hl(cell.attrs)\n\t\t\t\t\t == vtermAttr2hl(prev_cell.attrs)\n\t\t\t&& same_color(&cell.fg, &prev_cell.fg)\n\t\t\t&& same_color(&cell.bg, &prev_cell.bg);\n\t if (same_chars && cell.width == prev_cell.width && same_attr\n\t\t\t\t\t\t\t && !is_cursor_pos)\n\t {\n\t\t++repeat;\n\t }\n\t else\n\t {\n\t\tif (repeat > 0)\n\t\t{\n\t\t fprintf(fd, \"@%d\", repeat);\n\t\t repeat = 0;\n\t\t}\n\t\tfputs(is_cursor_pos ? \">\" : \"|\", fd);\n\n\t\tif (cell.chars[0] == NUL)\n\t\t fputs(\" \", fd);\n\t\telse\n\t\t{\n\t\t char_u\tcharbuf[10];\n\t\t int\t\tlen;\n\n\t\t for (i = 0; i < VTERM_MAX_CHARS_PER_CELL\n\t\t\t\t\t\t && cell.chars[i] != NUL; ++i)\n\t\t {\n\t\t\tlen = utf_char2bytes(cell.chars[i], charbuf);\n\t\t\tfwrite(charbuf, len, 1, fd);\n\t\t }\n\t\t}\n\n\t\t/* When only the characters differ we don't write anything, the\n\t\t * following \"|\", \"@\" or NL will indicate using the same\n\t\t * attributes. */\n\t\tif (cell.width != prev_cell.width || !same_attr)\n\t\t{\n\t\t if (cell.width == 2)\n\t\t {\n\t\t\tfputs(\"*\", fd);\n\t\t\t++pos.col;\n\t\t }\n\t\t else\n\t\t\tfputs(\"+\", fd);\n\n\t\t if (same_attr)\n\t\t {\n\t\t\tfputs(\"&\", fd);\n\t\t }\n\t\t else\n\t\t {\n\t\t\tfprintf(fd, \"%d\", vtermAttr2hl(cell.attrs));\n\t\t\tif (same_color(&cell.fg, &prev_cell.fg))\n\t\t\t fputs(\"&\", fd);\n\t\t\telse\n\t\t\t{\n\t\t\t fputs(\"#\", fd);\n\t\t\t dump_term_color(fd, &cell.fg);\n\t\t\t}\n\t\t\tif (same_color(&cell.bg, &prev_cell.bg))\n\t\t\t fputs(\"&\", fd);\n\t\t\telse\n\t\t\t{\n\t\t\t fputs(\"#\", fd);\n\t\t\t dump_term_color(fd, &cell.bg);\n\t\t\t}\n\t\t }\n\t\t}\n\n\t\tprev_cell = cell;\n\t }\n\t}\n\tif (repeat > 0)\n\t fprintf(fd, \"@%d\", repeat);\n\tfputs(\"\\n\", fd);\n }\n\n fclose(fd);\n}\n\n/*\n * Called when a dump is corrupted. Put a breakpoint here when debugging.\n */\n static void\ndump_is_corrupt(garray_T *gap)\n{\n ga_concat(gap, (char_u *)\"CORRUPT\");\n}\n\n static void\nappend_cell(garray_T *gap, cellattr_T *cell)\n{\n if (ga_grow(gap, 1) == OK)\n {\n\t*(((cellattr_T *)gap->ga_data) + gap->ga_len) = *cell;\n\t++gap->ga_len;\n }\n}\n\n/*\n * Read the dump file from \"fd\" and append lines to the current buffer.\n * Return the cell width of the longest line.\n */\n static int\nread_dump_file(FILE *fd, VTermPos *cursor_pos)\n{\n int\t\t c;\n garray_T\t ga_text;\n garray_T\t ga_cell;\n char_u\t *prev_char = NULL;\n int\t\t attr = 0;\n cellattr_T\t cell;\n term_T\t *term = curbuf->b_term;\n int\t\t max_cells = 0;\n int\t\t start_row = term->tl_scrollback.ga_len;\n\n ga_init2(&ga_text, 1, 90);\n ga_init2(&ga_cell, sizeof(cellattr_T), 90);\n vim_memset(&cell, 0, sizeof(cell));\n cursor_pos->row = -1;\n cursor_pos->col = -1;\n\n c = fgetc(fd);\n for (;;)\n {\n\tif (c == EOF)\n\t break;\n\tif (c == '\\r')\n\t{\n\t // DOS line endings? Ignore.\n\t c = fgetc(fd);\n\t}\n\telse if (c == '\\n')\n\t{\n\t /* End of a line: append it to the buffer. */\n\t if (ga_text.ga_data == NULL)\n\t\tdump_is_corrupt(&ga_text);\n\t if (ga_grow(&term->tl_scrollback, 1) == OK)\n\t {\n\t\tsb_line_T *line = (sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t\t\t + term->tl_scrollback.ga_len;\n\n\t\tif (max_cells < ga_cell.ga_len)\n\t\t max_cells = ga_cell.ga_len;\n\t\tline->sb_cols = ga_cell.ga_len;\n\t\tline->sb_cells = ga_cell.ga_data;\n\t\tline->sb_fill_attr = term->tl_default_color;\n\t\t++term->tl_scrollback.ga_len;\n\t\tga_init(&ga_cell);\n\n\t\tga_append(&ga_text, NUL);\n\t\tml_append(curbuf->b_ml.ml_line_count, ga_text.ga_data,\n\t\t\t\t\t\t\tga_text.ga_len, FALSE);\n\t }\n\t else\n\t\tga_clear(&ga_cell);\n\t ga_text.ga_len = 0;\n\n\t c = fgetc(fd);\n\t}\n\telse if (c == '|' || c == '>')\n\t{\n\t int prev_len = ga_text.ga_len;\n\n\t if (c == '>')\n\t {\n\t\tif (cursor_pos->row != -1)\n\t\t dump_is_corrupt(&ga_text);\t/* duplicate cursor */\n\t\tcursor_pos->row = term->tl_scrollback.ga_len - start_row;\n\t\tcursor_pos->col = ga_cell.ga_len;\n\t }\n\n\t /* normal character(s) followed by \"+\", \"*\", \"|\", \"@\" or NL */\n\t c = fgetc(fd);\n\t if (c != EOF)\n\t\tga_append(&ga_text, c);\n\t for (;;)\n\t {\n\t\tc = fgetc(fd);\n\t\tif (c == '+' || c == '*' || c == '|' || c == '>' || c == '@'\n\t\t\t\t\t\t || c == EOF || c == '\\n')\n\t\t break;\n\t\tga_append(&ga_text, c);\n\t }\n\n\t /* save the character for repeating it */\n\t vim_free(prev_char);\n\t if (ga_text.ga_data != NULL)\n\t\tprev_char = vim_strnsave(((char_u *)ga_text.ga_data) + prev_len,\n\t\t\t\t\t\t ga_text.ga_len - prev_len);\n\n\t if (c == '@' || c == '|' || c == '>' || c == '\\n')\n\t {\n\t\t/* use all attributes from previous cell */\n\t }\n\t else if (c == '+' || c == '*')\n\t {\n\t\tint is_bg;\n\n\t\tcell.width = c == '+' ? 1 : 2;\n\n\t\tc = fgetc(fd);\n\t\tif (c == '&')\n\t\t{\n\t\t /* use same attr as previous cell */\n\t\t c = fgetc(fd);\n\t\t}\n\t\telse if (isdigit(c))\n\t\t{\n\t\t /* get the decimal attribute */\n\t\t attr = 0;\n\t\t while (isdigit(c))\n\t\t {\n\t\t\tattr = attr * 10 + (c - '0');\n\t\t\tc = fgetc(fd);\n\t\t }\n\t\t hl2vtermAttr(attr, &cell);\n\t\t}\n\t\telse\n\t\t dump_is_corrupt(&ga_text);\n\n\t\t/* is_bg == 0: fg, is_bg == 1: bg */\n\t\tfor (is_bg = 0; is_bg <= 1; ++is_bg)\n\t\t{\n\t\t if (c == '&')\n\t\t {\n\t\t\t/* use same color as previous cell */\n\t\t\tc = fgetc(fd);\n\t\t }\n\t\t else if (c == '#')\n\t\t {\n\t\t\tint red, green, blue, index = 0;\n\n\t\t\tc = fgetc(fd);\n\t\t\tred = hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tred = (red << 4) + hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tgreen = hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tgreen = (green << 4) + hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tblue = hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tblue = (blue << 4) + hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tif (!isdigit(c))\n\t\t\t dump_is_corrupt(&ga_text);\n\t\t\twhile (isdigit(c))\n\t\t\t{\n\t\t\t index = index * 10 + (c - '0');\n\t\t\t c = fgetc(fd);\n\t\t\t}\n\n\t\t\tif (is_bg)\n\t\t\t{\n\t\t\t cell.bg.red = red;\n\t\t\t cell.bg.green = green;\n\t\t\t cell.bg.blue = blue;\n\t\t\t cell.bg.ansi_index = index;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t cell.fg.red = red;\n\t\t\t cell.fg.green = green;\n\t\t\t cell.fg.blue = blue;\n\t\t\t cell.fg.ansi_index = index;\n\t\t\t}\n\t\t }\n\t\t else\n\t\t\tdump_is_corrupt(&ga_text);\n\t\t}\n\t }\n\t else\n\t\tdump_is_corrupt(&ga_text);\n\n\t append_cell(&ga_cell, &cell);\n\t}\n\telse if (c == '@')\n\t{\n\t if (prev_char == NULL)\n\t\tdump_is_corrupt(&ga_text);\n\t else\n\t {\n\t\tint count = 0;\n\n\t\t/* repeat previous character, get the count */\n\t\tfor (;;)\n\t\t{\n\t\t c = fgetc(fd);\n\t\t if (!isdigit(c))\n\t\t\tbreak;\n\t\t count = count * 10 + (c - '0');\n\t\t}\n\n\t\twhile (count-- > 0)\n\t\t{\n\t\t ga_concat(&ga_text, prev_char);\n\t\t append_cell(&ga_cell, &cell);\n\t\t}\n\t }\n\t}\n\telse\n\t{\n\t dump_is_corrupt(&ga_text);\n\t c = fgetc(fd);\n\t}\n }\n\n if (ga_text.ga_len > 0)\n {\n\t/* trailing characters after last NL */\n\tdump_is_corrupt(&ga_text);\n\tga_append(&ga_text, NUL);\n\tml_append(curbuf->b_ml.ml_line_count, ga_text.ga_data,\n\t\t\t\t\t\t\tga_text.ga_len, FALSE);\n }\n\n ga_clear(&ga_text);\n vim_free(prev_char);\n\n return max_cells;\n}\n\n/*\n * Return an allocated string with at least \"text_width\" \"=\" characters and\n * \"fname\" inserted in the middle.\n */\n static char_u *\nget_separator(int text_width, char_u *fname)\n{\n int\t width = MAX(text_width, curwin->w_width);\n char_u *textline;\n int\t fname_size;\n char_u *p = fname;\n int\t i;\n size_t off;\n\n textline = alloc(width + (int)STRLEN(fname) + 1);\n if (textline == NULL)\n\treturn NULL;\n\n fname_size = vim_strsize(fname);\n if (fname_size < width - 8)\n {\n\t/* enough room, don't use the full window width */\n\twidth = MAX(text_width, fname_size + 8);\n }\n else if (fname_size > width - 8)\n {\n\t/* full name doesn't fit, use only the tail */\n\tp = gettail(fname);\n\tfname_size = vim_strsize(p);\n }\n /* skip characters until the name fits */\n while (fname_size > width - 8)\n {\n\tp += (*mb_ptr2len)(p);\n\tfname_size = vim_strsize(p);\n }\n\n for (i = 0; i < (width - fname_size) / 2 - 1; ++i)\n\ttextline[i] = '=';\n textline[i++] = ' ';\n\n STRCPY(textline + i, p);\n off = STRLEN(textline);\n textline[off] = ' ';\n for (i = 1; i < (width - fname_size) / 2; ++i)\n\ttextline[off + i] = '=';\n textline[off + i] = NUL;\n\n return textline;\n}\n\n/*\n * Common for \"term_dumpdiff()\" and \"term_dumpload()\".\n */\n static void\nterm_load_dump(typval_T *argvars, typval_T *rettv, int do_diff)\n{\n jobopt_T\topt;\n buf_T\t*buf;\n char_u\tbuf1[NUMBUFLEN];\n char_u\tbuf2[NUMBUFLEN];\n char_u\t*fname1;\n char_u\t*fname2 = NULL;\n char_u\t*fname_tofree = NULL;\n FILE\t*fd1;\n FILE\t*fd2 = NULL;\n char_u\t*textline = NULL;\n\n /* First open the files. If this fails bail out. */\n fname1 = tv_get_string_buf_chk(&argvars[0], buf1);\n if (do_diff)\n\tfname2 = tv_get_string_buf_chk(&argvars[1], buf2);\n if (fname1 == NULL || (do_diff && fname2 == NULL))\n {\n\tEMSG(_(e_invarg));\n\treturn;\n }\n fd1 = mch_fopen((char *)fname1, READBIN);\n if (fd1 == NULL)\n {\n\tEMSG2(_(e_notread), fname1);\n\treturn;\n }\n if (do_diff)\n {\n\tfd2 = mch_fopen((char *)fname2, READBIN);\n\tif (fd2 == NULL)\n\t{\n\t fclose(fd1);\n\t EMSG2(_(e_notread), fname2);\n\t return;\n\t}\n }\n\n init_job_options(&opt);\n if (argvars[do_diff ? 2 : 1].v_type != VAR_UNKNOWN\n\t && get_job_options(&argvars[do_diff ? 2 : 1], &opt, 0,\n\t\t JO2_TERM_NAME + JO2_TERM_COLS + JO2_TERM_ROWS\n\t\t + JO2_VERTICAL + JO2_CURWIN + JO2_NORESTORE) == FAIL)\n\tgoto theend;\n\n if (opt.jo_term_name == NULL)\n {\n\tsize_t len = STRLEN(fname1) + 12;\n\n\tfname_tofree = alloc((int)len);\n\tif (fname_tofree != NULL)\n\t{\n\t vim_snprintf((char *)fname_tofree, len, \"dump diff %s\", fname1);\n\t opt.jo_term_name = fname_tofree;\n\t}\n }\n\n buf = term_start(&argvars[0], NULL, &opt, TERM_START_NOJOB);\n if (buf != NULL && buf->b_term != NULL)\n {\n\tint\t\ti;\n\tlinenr_T\tbot_lnum;\n\tlinenr_T\tlnum;\n\tterm_T\t\t*term = buf->b_term;\n\tint\t\twidth;\n\tint\t\twidth2;\n\tVTermPos\tcursor_pos1;\n\tVTermPos\tcursor_pos2;\n\n\tinit_default_colors(term);\n\n\trettv->vval.v_number = buf->b_fnum;\n\n\t/* read the files, fill the buffer with the diff */\n\twidth = read_dump_file(fd1, &cursor_pos1);\n\n\t/* position the cursor */\n\tif (cursor_pos1.row >= 0)\n\t{\n\t curwin->w_cursor.lnum = cursor_pos1.row + 1;\n\t coladvance(cursor_pos1.col);\n\t}\n\n\t/* Delete the empty line that was in the empty buffer. */\n\tml_delete(1, FALSE);\n\n\t/* For term_dumpload() we are done here. */\n\tif (!do_diff)\n\t goto theend;\n\n\tterm->tl_top_diff_rows = curbuf->b_ml.ml_line_count;\n\n\ttextline = get_separator(width, fname1);\n\tif (textline == NULL)\n\t goto theend;\n\tif (add_empty_scrollback(term, &term->tl_default_color, 0) == OK)\n\t ml_append(curbuf->b_ml.ml_line_count, textline, 0, FALSE);\n\tvim_free(textline);\n\n\ttextline = get_separator(width, fname2);\n\tif (textline == NULL)\n\t goto theend;\n\tif (add_empty_scrollback(term, &term->tl_default_color, 0) == OK)\n\t ml_append(curbuf->b_ml.ml_line_count, textline, 0, FALSE);\n\ttextline[width] = NUL;\n\n\tbot_lnum = curbuf->b_ml.ml_line_count;\n\twidth2 = read_dump_file(fd2, &cursor_pos2);\n\tif (width2 > width)\n\t{\n\t vim_free(textline);\n\t textline = alloc(width2 + 1);\n\t if (textline == NULL)\n\t\tgoto theend;\n\t width = width2;\n\t textline[width] = NUL;\n\t}\n\tterm->tl_bot_diff_rows = curbuf->b_ml.ml_line_count - bot_lnum;\n\n\tfor (lnum = 1; lnum <= term->tl_top_diff_rows; ++lnum)\n\t{\n\t if (lnum + bot_lnum > curbuf->b_ml.ml_line_count)\n\t {\n\t\t/* bottom part has fewer rows, fill with \"-\" */\n\t\tfor (i = 0; i < width; ++i)\n\t\t textline[i] = '-';\n\t }\n\t else\n\t {\n\t\tchar_u *line1;\n\t\tchar_u *line2;\n\t\tchar_u *p1;\n\t\tchar_u *p2;\n\t\tint\tcol;\n\t\tsb_line_T *sb_line = (sb_line_T *)term->tl_scrollback.ga_data;\n\t\tcellattr_T *cellattr1 = (sb_line + lnum - 1)->sb_cells;\n\t\tcellattr_T *cellattr2 = (sb_line + lnum + bot_lnum - 1)\n\t\t\t\t\t\t\t\t ->sb_cells;\n\n\t\t/* Make a copy, getting the second line will invalidate it. */\n\t\tline1 = vim_strsave(ml_get(lnum));\n\t\tif (line1 == NULL)\n\t\t break;\n\t\tp1 = line1;\n\n\t\tline2 = ml_get(lnum + bot_lnum);\n\t\tp2 = line2;\n\t\tfor (col = 0; col < width && *p1 != NUL && *p2 != NUL; ++col)\n\t\t{\n\t\t int len1 = utfc_ptr2len(p1);\n\t\t int len2 = utfc_ptr2len(p2);\n\n\t\t textline[col] = ' ';\n\t\t if (len1 != len2 || STRNCMP(p1, p2, len1) != 0)\n\t\t\t/* text differs */\n\t\t\ttextline[col] = 'X';\n\t\t else if (lnum == cursor_pos1.row + 1\n\t\t\t && col == cursor_pos1.col\n\t\t\t && (cursor_pos1.row != cursor_pos2.row\n\t\t\t\t\t|| cursor_pos1.col != cursor_pos2.col))\n\t\t\t/* cursor in first but not in second */\n\t\t\ttextline[col] = '>';\n\t\t else if (lnum == cursor_pos2.row + 1\n\t\t\t && col == cursor_pos2.col\n\t\t\t && (cursor_pos1.row != cursor_pos2.row\n\t\t\t\t\t|| cursor_pos1.col != cursor_pos2.col))\n\t\t\t/* cursor in second but not in first */\n\t\t\ttextline[col] = '<';\n\t\t else if (cellattr1 != NULL && cellattr2 != NULL)\n\t\t {\n\t\t\tif ((cellattr1 + col)->width\n\t\t\t\t\t\t != (cellattr2 + col)->width)\n\t\t\t textline[col] = 'w';\n\t\t\telse if (!same_color(&(cellattr1 + col)->fg,\n\t\t\t\t\t\t &(cellattr2 + col)->fg))\n\t\t\t textline[col] = 'f';\n\t\t\telse if (!same_color(&(cellattr1 + col)->bg,\n\t\t\t\t\t\t &(cellattr2 + col)->bg))\n\t\t\t textline[col] = 'b';\n\t\t\telse if (vtermAttr2hl((cellattr1 + col)->attrs)\n\t\t\t\t != vtermAttr2hl(((cellattr2 + col)->attrs)))\n\t\t\t textline[col] = 'a';\n\t\t }\n\t\t p1 += len1;\n\t\t p2 += len2;\n\t\t /* TODO: handle different width */\n\t\t}\n\t\tvim_free(line1);\n\n\t\twhile (col < width)\n\t\t{\n\t\t if (*p1 == NUL && *p2 == NUL)\n\t\t\ttextline[col] = '?';\n\t\t else if (*p1 == NUL)\n\t\t {\n\t\t\ttextline[col] = '+';\n\t\t\tp2 += utfc_ptr2len(p2);\n\t\t }\n\t\t else\n\t\t {\n\t\t\ttextline[col] = '-';\n\t\t\tp1 += utfc_ptr2len(p1);\n\t\t }\n\t\t ++col;\n\t\t}\n\t }\n\t if (add_empty_scrollback(term, &term->tl_default_color,\n\t\t\t\t\t\t term->tl_top_diff_rows) == OK)\n\t\tml_append(term->tl_top_diff_rows + lnum, textline, 0, FALSE);\n\t ++bot_lnum;\n\t}\n\n\twhile (lnum + bot_lnum <= curbuf->b_ml.ml_line_count)\n\t{\n\t /* bottom part has more rows, fill with \"+\" */\n\t for (i = 0; i < width; ++i)\n\t\ttextline[i] = '+';\n\t if (add_empty_scrollback(term, &term->tl_default_color,\n\t\t\t\t\t\t term->tl_top_diff_rows) == OK)\n\t\tml_append(term->tl_top_diff_rows + lnum, textline, 0, FALSE);\n\t ++lnum;\n\t ++bot_lnum;\n\t}\n\n\tterm->tl_cols = width;\n\n\t/* looks better without wrapping */\n\tcurwin->w_p_wrap = 0;\n }\n\ntheend:\n vim_free(textline);\n vim_free(fname_tofree);\n fclose(fd1);\n if (fd2 != NULL)\n\tfclose(fd2);\n}\n\n/*\n * If the current buffer shows the output of term_dumpdiff(), swap the top and\n * bottom files.\n * Return FAIL when this is not possible.\n */\n int\nterm_swap_diff()\n{\n term_T\t*term = curbuf->b_term;\n linenr_T\tline_count;\n linenr_T\ttop_rows;\n linenr_T\tbot_rows;\n linenr_T\tbot_start;\n linenr_T\tlnum;\n char_u\t*p;\n sb_line_T\t*sb_line;\n\n if (term == NULL\n\t || !term_is_finished(curbuf)\n\t || term->tl_top_diff_rows == 0\n\t || term->tl_scrollback.ga_len == 0)\n\treturn FAIL;\n\n line_count = curbuf->b_ml.ml_line_count;\n top_rows = term->tl_top_diff_rows;\n bot_rows = term->tl_bot_diff_rows;\n bot_start = line_count - bot_rows;\n sb_line = (sb_line_T *)term->tl_scrollback.ga_data;\n\n /* move lines from top to above the bottom part */\n for (lnum = 1; lnum <= top_rows; ++lnum)\n {\n\tp = vim_strsave(ml_get(1));\n\tif (p == NULL)\n\t return OK;\n\tml_append(bot_start, p, 0, FALSE);\n\tml_delete(1, FALSE);\n\tvim_free(p);\n }\n\n /* move lines from bottom to the top */\n for (lnum = 1; lnum <= bot_rows; ++lnum)\n {\n\tp = vim_strsave(ml_get(bot_start + lnum));\n\tif (p == NULL)\n\t return OK;\n\tml_delete(bot_start + lnum, FALSE);\n\tml_append(lnum - 1, p, 0, FALSE);\n\tvim_free(p);\n }\n\n if (top_rows == bot_rows)\n {\n\t/* rows counts are equal, can swap cell properties */\n\tfor (lnum = 0; lnum < top_rows; ++lnum)\n\t{\n\t sb_line_T\ttemp;\n\n\t temp = *(sb_line + lnum);\n\t *(sb_line + lnum) = *(sb_line + bot_start + lnum);\n\t *(sb_line + bot_start + lnum) = temp;\n\t}\n }\n else\n {\n\tsize_t\t\tsize = sizeof(sb_line_T) * term->tl_scrollback.ga_len;\n\tsb_line_T\t*temp = (sb_line_T *)alloc((int)size);\n\n\t/* need to copy cell properties into temp memory */\n\tif (temp != NULL)\n\t{\n\t mch_memmove(temp, term->tl_scrollback.ga_data, size);\n\t mch_memmove(term->tl_scrollback.ga_data,\n\t\t temp + bot_start,\n\t\t sizeof(sb_line_T) * bot_rows);\n\t mch_memmove((sb_line_T *)term->tl_scrollback.ga_data + bot_rows,\n\t\t temp + top_rows,\n\t\t sizeof(sb_line_T) * (line_count - top_rows - bot_rows));\n\t mch_memmove((sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t\t\t + line_count - top_rows,\n\t\t temp,\n\t\t sizeof(sb_line_T) * top_rows);\n\t vim_free(temp);\n\t}\n }\n\n term->tl_top_diff_rows = bot_rows;\n term->tl_bot_diff_rows = top_rows;\n\n update_screen(NOT_VALID);\n return OK;\n}\n\n/*\n * \"term_dumpdiff(filename, filename, options)\" function\n */\n void\nf_term_dumpdiff(typval_T *argvars, typval_T *rettv)\n{\n term_load_dump(argvars, rettv, TRUE);\n}\n\n/*\n * \"term_dumpload(filename, options)\" function\n */\n void\nf_term_dumpload(typval_T *argvars, typval_T *rettv)\n{\n term_load_dump(argvars, rettv, FALSE);\n}\n\n/*\n * \"term_getaltscreen(buf)\" function\n */\n void\nf_term_getaltscreen(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getaltscreen()\");\n\n if (buf == NULL)\n\treturn;\n rettv->vval.v_number = buf->b_term->tl_using_altscreen;\n}\n\n/*\n * \"term_getattr(attr, name)\" function\n */\n void\nf_term_getattr(typval_T *argvars, typval_T *rettv)\n{\n int\t attr;\n size_t i;\n char_u *name;\n\n static struct {\n\tchar\t *name;\n\tint\t attr;\n } attrs[] = {\n\t{\"bold\", HL_BOLD},\n\t{\"italic\", HL_ITALIC},\n\t{\"underline\", HL_UNDERLINE},\n\t{\"strike\", HL_STRIKETHROUGH},\n\t{\"reverse\", HL_INVERSE},\n };\n\n attr = tv_get_number(&argvars[0]);\n name = tv_get_string_chk(&argvars[1]);\n if (name == NULL)\n\treturn;\n\n for (i = 0; i < sizeof(attrs)/sizeof(attrs[0]); ++i)\n\tif (STRCMP(name, attrs[i].name) == 0)\n\t{\n\t rettv->vval.v_number = (attr & attrs[i].attr) != 0 ? 1 : 0;\n\t break;\n\t}\n}\n\n/*\n * \"term_getcursor(buf)\" function\n */\n void\nf_term_getcursor(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getcursor()\");\n term_T\t*term;\n list_T\t*l;\n dict_T\t*d;\n\n if (rettv_list_alloc(rettv) == FAIL)\n\treturn;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n\n l = rettv->vval.v_list;\n list_append_number(l, term->tl_cursor_pos.row + 1);\n list_append_number(l, term->tl_cursor_pos.col + 1);\n\n d = dict_alloc();\n if (d != NULL)\n {\n\tdict_add_number(d, \"visible\", term->tl_cursor_visible);\n\tdict_add_number(d, \"blink\", blink_state_is_inverted()\n\t\t\t ? !term->tl_cursor_blink : term->tl_cursor_blink);\n\tdict_add_number(d, \"shape\", term->tl_cursor_shape);\n\tdict_add_string(d, \"color\", cursor_color_get(term->tl_cursor_color));\n\tlist_append_dict(l, d);\n }\n}\n\n/*\n * \"term_getjob(buf)\" function\n */\n void\nf_term_getjob(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getjob()\");\n\n if (buf == NULL)\n {\n\trettv->v_type = VAR_SPECIAL;\n\trettv->vval.v_number = VVAL_NULL;\n\treturn;\n }\n\n rettv->v_type = VAR_JOB;\n rettv->vval.v_job = buf->b_term->tl_job;\n if (rettv->vval.v_job != NULL)\n\t++rettv->vval.v_job->jv_refcount;\n}\n\n static int\nget_row_number(typval_T *tv, term_T *term)\n{\n if (tv->v_type == VAR_STRING\n\t && tv->vval.v_string != NULL\n\t && STRCMP(tv->vval.v_string, \".\") == 0)\n\treturn term->tl_cursor_pos.row;\n return (int)tv_get_number(tv) - 1;\n}\n\n/*\n * \"term_getline(buf, row)\" function\n */\n void\nf_term_getline(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t *buf = term_get_buf(argvars, \"term_getline()\");\n term_T\t *term;\n int\t\t row;\n\n rettv->v_type = VAR_STRING;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n row = get_row_number(&argvars[1], term);\n\n if (term->tl_vterm == NULL)\n {\n\tlinenr_T lnum = row + term->tl_scrollback_scrolled + 1;\n\n\t/* vterm is finished, get the text from the buffer */\n\tif (lnum > 0 && lnum <= buf->b_ml.ml_line_count)\n\t rettv->vval.v_string = vim_strsave(ml_get_buf(buf, lnum, FALSE));\n }\n else\n {\n\tVTermScreen\t*screen = vterm_obtain_screen(term->tl_vterm);\n\tVTermRect\trect;\n\tint\t\tlen;\n\tchar_u\t\t*p;\n\n\tif (row < 0 || row >= term->tl_rows)\n\t return;\n\tlen = term->tl_cols * MB_MAXBYTES + 1;\n\tp = alloc(len);\n\tif (p == NULL)\n\t return;\n\trettv->vval.v_string = p;\n\n\trect.start_col = 0;\n\trect.end_col = term->tl_cols;\n\trect.start_row = row;\n\trect.end_row = row + 1;\n\tp[vterm_screen_get_text(screen, (char *)p, len, rect)] = NUL;\n }\n}\n\n/*\n * \"term_getscrolled(buf)\" function\n */\n void\nf_term_getscrolled(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getscrolled()\");\n\n if (buf == NULL)\n\treturn;\n rettv->vval.v_number = buf->b_term->tl_scrollback_scrolled;\n}\n\n/*\n * \"term_getsize(buf)\" function\n */\n void\nf_term_getsize(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getsize()\");\n list_T\t*l;\n\n if (rettv_list_alloc(rettv) == FAIL)\n\treturn;\n if (buf == NULL)\n\treturn;\n\n l = rettv->vval.v_list;\n list_append_number(l, buf->b_term->tl_rows);\n list_append_number(l, buf->b_term->tl_cols);\n}\n\n/*\n * \"term_setsize(buf, rows, cols)\" function\n */\n void\nf_term_setsize(typval_T *argvars UNUSED, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_setsize()\");\n term_T\t*term;\n varnumber_T rows, cols;\n\n if (buf == NULL)\n {\n\tEMSG(_(\"E955: Not a terminal buffer\"));\n\treturn;\n }\n if (buf->b_term->tl_vterm == NULL)\n\treturn;\n term = buf->b_term;\n rows = tv_get_number(&argvars[1]);\n rows = rows <= 0 ? term->tl_rows : rows;\n cols = tv_get_number(&argvars[2]);\n cols = cols <= 0 ? term->tl_cols : cols;\n vterm_set_size(term->tl_vterm, rows, cols);\n /* handle_resize() will resize the windows */\n\n /* Get and remember the size we ended up with. Update the pty. */\n vterm_get_size(term->tl_vterm, &term->tl_rows, &term->tl_cols);\n term_report_winsize(term, term->tl_rows, term->tl_cols);\n}\n\n/*\n * \"term_getstatus(buf)\" function\n */\n void\nf_term_getstatus(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getstatus()\");\n term_T\t*term;\n char_u\tval[100];\n\n rettv->v_type = VAR_STRING;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n\n if (term_job_running(term))\n\tSTRCPY(val, \"running\");\n else\n\tSTRCPY(val, \"finished\");\n if (term->tl_normal_mode)\n\tSTRCAT(val, \",normal\");\n rettv->vval.v_string = vim_strsave(val);\n}\n\n/*\n * \"term_gettitle(buf)\" function\n */\n void\nf_term_gettitle(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_gettitle()\");\n\n rettv->v_type = VAR_STRING;\n if (buf == NULL)\n\treturn;\n\n if (buf->b_term->tl_title != NULL)\n\trettv->vval.v_string = vim_strsave(buf->b_term->tl_title);\n}\n\n/*\n * \"term_gettty(buf)\" function\n */\n void\nf_term_gettty(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_gettty()\");\n char_u\t*p = NULL;\n int\t\tnum = 0;\n\n rettv->v_type = VAR_STRING;\n if (buf == NULL)\n\treturn;\n if (argvars[1].v_type != VAR_UNKNOWN)\n\tnum = tv_get_number(&argvars[1]);\n\n switch (num)\n {\n\tcase 0:\n\t if (buf->b_term->tl_job != NULL)\n\t\tp = buf->b_term->tl_job->jv_tty_out;\n\t break;\n\tcase 1:\n\t if (buf->b_term->tl_job != NULL)\n\t\tp = buf->b_term->tl_job->jv_tty_in;\n\t break;\n\tdefault:\n\t EMSG2(_(e_invarg2), tv_get_string(&argvars[1]));\n\t return;\n }\n if (p != NULL)\n\trettv->vval.v_string = vim_strsave(p);\n}\n\n/*\n * \"term_list()\" function\n */\n void\nf_term_list(typval_T *argvars UNUSED, typval_T *rettv)\n{\n term_T\t*tp;\n list_T\t*l;\n\n if (rettv_list_alloc(rettv) == FAIL || first_term == NULL)\n\treturn;\n\n l = rettv->vval.v_list;\n for (tp = first_term; tp != NULL; tp = tp->tl_next)\n\tif (tp != NULL && tp->tl_buffer != NULL)\n\t if (list_append_number(l,\n\t\t\t\t (varnumber_T)tp->tl_buffer->b_fnum) == FAIL)\n\t\treturn;\n}\n\n/*\n * \"term_scrape(buf, row)\" function\n */\n void\nf_term_scrape(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t *buf = term_get_buf(argvars, \"term_scrape()\");\n VTermScreen\t *screen = NULL;\n VTermPos\t pos;\n list_T\t *l;\n term_T\t *term;\n char_u\t *p;\n sb_line_T\t *line;\n\n if (rettv_list_alloc(rettv) == FAIL)\n\treturn;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n\n l = rettv->vval.v_list;\n pos.row = get_row_number(&argvars[1], term);\n\n if (term->tl_vterm != NULL)\n {\n\tscreen = vterm_obtain_screen(term->tl_vterm);\n\tp = NULL;\n\tline = NULL;\n }\n else\n {\n\tlinenr_T\tlnum = pos.row + term->tl_scrollback_scrolled;\n\n\tif (lnum < 0 || lnum >= term->tl_scrollback.ga_len)\n\t return;\n\tp = ml_get_buf(buf, lnum + 1, FALSE);\n\tline = (sb_line_T *)term->tl_scrollback.ga_data + lnum;\n }\n\n for (pos.col = 0; pos.col < term->tl_cols; )\n {\n\tdict_T\t\t*dcell;\n\tint\t\twidth;\n\tVTermScreenCellAttrs attrs;\n\tVTermColor\tfg, bg;\n\tchar_u\t\trgb[8];\n\tchar_u\t\tmbs[MB_MAXBYTES * VTERM_MAX_CHARS_PER_CELL + 1];\n\tint\t\toff = 0;\n\tint\t\ti;\n\n\tif (screen == NULL)\n\t{\n\t cellattr_T\t*cellattr;\n\t int\t\tlen;\n\n\t /* vterm has finished, get the cell from scrollback */\n\t if (pos.col >= line->sb_cols)\n\t\tbreak;\n\t cellattr = line->sb_cells + pos.col;\n\t width = cellattr->width;\n\t attrs = cellattr->attrs;\n\t fg = cellattr->fg;\n\t bg = cellattr->bg;\n\t len = MB_PTR2LEN(p);\n\t mch_memmove(mbs, p, len);\n\t mbs[len] = NUL;\n\t p += len;\n\t}\n\telse\n\t{\n\t VTermScreenCell cell;\n\t if (vterm_screen_get_cell(screen, pos, &cell) == 0)\n\t\tbreak;\n\t for (i = 0; i < VTERM_MAX_CHARS_PER_CELL; ++i)\n\t {\n\t\tif (cell.chars[i] == 0)\n\t\t break;\n\t\toff += (*utf_char2bytes)((int)cell.chars[i], mbs + off);\n\t }\n\t mbs[off] = NUL;\n\t width = cell.width;\n\t attrs = cell.attrs;\n\t fg = cell.fg;\n\t bg = cell.bg;\n\t}\n\tdcell = dict_alloc();\n\tif (dcell == NULL)\n\t break;\n\tlist_append_dict(l, dcell);\n\n\tdict_add_string(dcell, \"chars\", mbs);\n\n\tvim_snprintf((char *)rgb, 8, \"#%02x%02x%02x\",\n\t\t\t\t fg.red, fg.green, fg.blue);\n\tdict_add_string(dcell, \"fg\", rgb);\n\tvim_snprintf((char *)rgb, 8, \"#%02x%02x%02x\",\n\t\t\t\t bg.red, bg.green, bg.blue);\n\tdict_add_string(dcell, \"bg\", rgb);\n\n\tdict_add_number(dcell, \"attr\", cell2attr(attrs, fg, bg));\n\tdict_add_number(dcell, \"width\", width);\n\n\t++pos.col;\n\tif (width == 2)\n\t ++pos.col;\n }\n}\n\n/*\n * \"term_sendkeys(buf, keys)\" function\n */\n void\nf_term_sendkeys(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_sendkeys()\");\n char_u\t*msg;\n term_T\t*term;\n\n rettv->v_type = VAR_UNKNOWN;\n if (buf == NULL)\n\treturn;\n\n msg = tv_get_string_chk(&argvars[1]);\n if (msg == NULL)\n\treturn;\n term = buf->b_term;\n if (term->tl_vterm == NULL)\n\treturn;\n\n while (*msg != NUL)\n {\n\tint c;\n\n\tif (*msg == K_SPECIAL && msg[1] != NUL && msg[2] != NUL)\n\t{\n\t c = TO_SPECIAL(msg[1], msg[2]);\n\t msg += 3;\n\t}\n\telse\n\t{\n\t c = PTR2CHAR(msg);\n\t msg += MB_CPTR2LEN(msg);\n\t}\n\tsend_keys_to_term(term, c, FALSE);\n }\n}\n\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS) || defined(PROTO)\n/*\n * \"term_getansicolors(buf)\" function\n */\n void\nf_term_getansicolors(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getansicolors()\");\n term_T\t*term;\n VTermState\t*state;\n VTermColor color;\n char_u\thexbuf[10];\n int\t\tindex;\n list_T\t*list;\n\n if (rettv_list_alloc(rettv) == FAIL)\n\treturn;\n\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n if (term->tl_vterm == NULL)\n\treturn;\n\n list = rettv->vval.v_list;\n state = vterm_obtain_state(term->tl_vterm);\n for (index = 0; index < 16; index++)\n {\n\tvterm_state_get_palette_color(state, index, &color);\n\tsprintf((char *)hexbuf, \"#%02x%02x%02x\",\n\t\tcolor.red, color.green, color.blue);\n\tif (list_append_string(list, hexbuf, 7) == FAIL)\n\t return;\n }\n}\n\n/*\n * \"term_setansicolors(buf, list)\" function\n */\n void\nf_term_setansicolors(typval_T *argvars, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_setansicolors()\");\n term_T\t*term;\n\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n if (term->tl_vterm == NULL)\n\treturn;\n\n if (argvars[1].v_type != VAR_LIST || argvars[1].vval.v_list == NULL)\n {\n\tEMSG(_(e_listreq));\n\treturn;\n }\n\n if (set_ansi_colors_list(term->tl_vterm, argvars[1].vval.v_list) == FAIL)\n\tEMSG(_(e_invarg));\n}\n#endif\n\n/*\n * \"term_setrestore(buf, command)\" function\n */\n void\nf_term_setrestore(typval_T *argvars UNUSED, typval_T *rettv UNUSED)\n{\n#if defined(FEAT_SESSION)\n buf_T\t*buf = term_get_buf(argvars, \"term_setrestore()\");\n term_T\t*term;\n char_u\t*cmd;\n\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n vim_free(term->tl_command);\n cmd = tv_get_string_chk(&argvars[1]);\n if (cmd != NULL)\n\tterm->tl_command = vim_strsave(cmd);\n else\n\tterm->tl_command = NULL;\n#endif\n}\n\n/*\n * \"term_setkill(buf, how)\" function\n */\n void\nf_term_setkill(typval_T *argvars UNUSED, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_setkill()\");\n term_T\t*term;\n char_u\t*how;\n\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n vim_free(term->tl_kill);\n how = tv_get_string_chk(&argvars[1]);\n if (how != NULL)\n\tterm->tl_kill = vim_strsave(how);\n else\n\tterm->tl_kill = NULL;\n}\n\n/*\n * \"term_start(command, options)\" function\n */\n void\nf_term_start(typval_T *argvars, typval_T *rettv)\n{\n jobopt_T\topt;\n buf_T\t*buf;\n\n init_job_options(&opt);\n if (argvars[1].v_type != VAR_UNKNOWN\n\t && get_job_options(&argvars[1], &opt,\n\t\tJO_TIMEOUT_ALL + JO_STOPONEXIT\n\t\t + JO_CALLBACK + JO_OUT_CALLBACK + JO_ERR_CALLBACK\n\t\t + JO_EXIT_CB + JO_CLOSE_CALLBACK + JO_OUT_IO,\n\t\tJO2_TERM_NAME + JO2_TERM_FINISH + JO2_HIDDEN + JO2_TERM_OPENCMD\n\t\t + JO2_TERM_COLS + JO2_TERM_ROWS + JO2_VERTICAL + JO2_CURWIN\n\t\t + JO2_CWD + JO2_ENV + JO2_EOF_CHARS\n\t\t + JO2_NORESTORE + JO2_TERM_KILL\n\t\t + JO2_ANSI_COLORS) == FAIL)\n\treturn;\n\n buf = term_start(&argvars[0], NULL, &opt, 0);\n\n if (buf != NULL && buf->b_term != NULL)\n\trettv->vval.v_number = buf->b_fnum;\n}\n\n/*\n * \"term_wait\" function\n */\n void\nf_term_wait(typval_T *argvars, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_wait()\");\n\n if (buf == NULL)\n\treturn;\n if (buf->b_term->tl_job == NULL)\n {\n\tch_log(NULL, \"term_wait(): no job to wait for\");\n\treturn;\n }\n if (buf->b_term->tl_job->jv_channel == NULL)\n\t/* channel is closed, nothing to do */\n\treturn;\n\n /* Get the job status, this will detect a job that finished. */\n if (!buf->b_term->tl_job->jv_channel->ch_keep_open\n\t && STRCMP(job_status(buf->b_term->tl_job), \"dead\") == 0)\n {\n\t/* The job is dead, keep reading channel I/O until the channel is\n\t * closed. buf->b_term may become NULL if the terminal was closed while\n\t * waiting. */\n\tch_log(NULL, \"term_wait(): waiting for channel to close\");\n\twhile (buf->b_term != NULL && !buf->b_term->tl_channel_closed)\n\t{\n\t mch_check_messages();\n\t parse_queued_messages();\n\t ui_delay(10L, FALSE);\n\t if (!buf_valid(buf))\n\t\t/* If the terminal is closed when the channel is closed the\n\t\t * buffer disappears. */\n\t\tbreak;\n\t}\n\tmch_check_messages();\n\tparse_queued_messages();\n }\n else\n {\n\tlong wait = 10L;\n\n\tmch_check_messages();\n\tparse_queued_messages();\n\n\t/* Wait for some time for any channel I/O. */\n\tif (argvars[1].v_type != VAR_UNKNOWN)\n\t wait = tv_get_number(&argvars[1]);\n\tui_delay(wait, TRUE);\n\tmch_check_messages();\n\n\t/* Flushing messages on channels is hopefully sufficient.\n\t * TODO: is there a better way? */\n\tparse_queued_messages();\n }\n}\n\n/*\n * Called when a channel has sent all the lines to a terminal.\n * Send a CTRL-D to mark the end of the text.\n */\n void\nterm_send_eof(channel_T *ch)\n{\n term_T\t*term;\n\n for (term = first_term; term != NULL; term = term->tl_next)\n\tif (term->tl_job == ch->ch_job)\n\t{\n\t if (term->tl_eof_chars != NULL)\n\t {\n\t\tchannel_send(ch, PART_IN, term->tl_eof_chars,\n\t\t\t\t\t(int)STRLEN(term->tl_eof_chars), NULL);\n\t\tchannel_send(ch, PART_IN, (char_u *)\"\\r\", 1, NULL);\n\t }\n# ifdef WIN3264\n\t else\n\t\t/* Default: CTRL-D */\n\t\tchannel_send(ch, PART_IN, (char_u *)\"\\004\\r\", 2, NULL);\n# endif\n\t}\n}\n\n job_T *\nterm_getjob(term_T *term)\n{\n return term != NULL ? term->tl_job : NULL;\n}\n\n# if defined(WIN3264) || defined(PROTO)\n\n/**************************************\n * 2. MS-Windows implementation.\n */\n\n# ifndef PROTO\n\n#define WINPTY_SPAWN_FLAG_AUTO_SHUTDOWN 1ul\n#define WINPTY_SPAWN_FLAG_EXIT_AFTER_SHUTDOWN 2ull\n#define WINPTY_MOUSE_MODE_FORCE\t\t2\n\nvoid* (*winpty_config_new)(UINT64, void*);\nvoid* (*winpty_open)(void*, void*);\nvoid* (*winpty_spawn_config_new)(UINT64, void*, LPCWSTR, void*, void*, void*);\nBOOL (*winpty_spawn)(void*, void*, HANDLE*, HANDLE*, DWORD*, void*);\nvoid (*winpty_config_set_mouse_mode)(void*, int);\nvoid (*winpty_config_set_initial_size)(void*, int, int);\nLPCWSTR (*winpty_conin_name)(void*);\nLPCWSTR (*winpty_conout_name)(void*);\nLPCWSTR (*winpty_conerr_name)(void*);\nvoid (*winpty_free)(void*);\nvoid (*winpty_config_free)(void*);\nvoid (*winpty_spawn_config_free)(void*);\nvoid (*winpty_error_free)(void*);\nLPCWSTR (*winpty_error_msg)(void*);\nBOOL (*winpty_set_size)(void*, int, int, void*);\nHANDLE (*winpty_agent_process)(void*);\n\n#define WINPTY_DLL \"winpty.dll\"\n\nstatic HINSTANCE hWinPtyDLL = NULL;\n# endif\n\n static int\ndyn_winpty_init(int verbose)\n{\n int i;\n static struct\n {\n\tchar\t *name;\n\tFARPROC\t *ptr;\n } winpty_entry[] =\n {\n\t{\"winpty_conerr_name\", (FARPROC*)&winpty_conerr_name},\n\t{\"winpty_config_free\", (FARPROC*)&winpty_config_free},\n\t{\"winpty_config_new\", (FARPROC*)&winpty_config_new},\n\t{\"winpty_config_set_mouse_mode\",\n\t\t\t\t (FARPROC*)&winpty_config_set_mouse_mode},\n\t{\"winpty_config_set_initial_size\",\n\t\t\t\t (FARPROC*)&winpty_config_set_initial_size},\n\t{\"winpty_conin_name\", (FARPROC*)&winpty_conin_name},\n\t{\"winpty_conout_name\", (FARPROC*)&winpty_conout_name},\n\t{\"winpty_error_free\", (FARPROC*)&winpty_error_free},\n\t{\"winpty_free\", (FARPROC*)&winpty_free},\n\t{\"winpty_open\", (FARPROC*)&winpty_open},\n\t{\"winpty_spawn\", (FARPROC*)&winpty_spawn},\n\t{\"winpty_spawn_config_free\", (FARPROC*)&winpty_spawn_config_free},\n\t{\"winpty_spawn_config_new\", (FARPROC*)&winpty_spawn_config_new},\n\t{\"winpty_error_msg\", (FARPROC*)&winpty_error_msg},\n\t{\"winpty_set_size\", (FARPROC*)&winpty_set_size},\n\t{\"winpty_agent_process\", (FARPROC*)&winpty_agent_process},\n\t{NULL, NULL}\n };\n\n /* No need to initialize twice. */\n if (hWinPtyDLL)\n\treturn OK;\n /* Load winpty.dll, prefer using the 'winptydll' option, fall back to just\n * winpty.dll. */\n if (*p_winptydll != NUL)\n\thWinPtyDLL = vimLoadLib((char *)p_winptydll);\n if (!hWinPtyDLL)\n\thWinPtyDLL = vimLoadLib(WINPTY_DLL);\n if (!hWinPtyDLL)\n {\n\tif (verbose)\n\t EMSG2(_(e_loadlib), *p_winptydll != NUL ? p_winptydll\n\t\t\t\t\t\t : (char_u *)WINPTY_DLL);\n\treturn FAIL;\n }\n for (i = 0; winpty_entry[i].name != NULL\n\t\t\t\t\t && winpty_entry[i].ptr != NULL; ++i)\n {\n\tif ((*winpty_entry[i].ptr = (FARPROC)GetProcAddress(hWinPtyDLL,\n\t\t\t\t\t winpty_entry[i].name)) == NULL)\n\t{\n\t if (verbose)\n\t\tEMSG2(_(e_loadfunc), winpty_entry[i].name);\n\t return FAIL;\n\t}\n }\n\n return OK;\n}\n\n/*\n * Create a new terminal of \"rows\" by \"cols\" cells.\n * Store a reference in \"term\".\n * Return OK or FAIL.\n */\n static int\nterm_and_job_init(\n\tterm_T\t *term,\n\ttypval_T *argvar,\n\tchar\t **argv UNUSED,\n\tjobopt_T *opt,\n\tjobopt_T *orig_opt)\n{\n WCHAR\t *cmd_wchar = NULL;\n WCHAR\t *cwd_wchar = NULL;\n WCHAR\t *env_wchar = NULL;\n channel_T\t *channel = NULL;\n job_T\t *job = NULL;\n DWORD\t error;\n HANDLE\t jo = NULL;\n HANDLE\t child_process_handle;\n HANDLE\t child_thread_handle;\n void\t *winpty_err = NULL;\n void\t *spawn_config = NULL;\n garray_T\t ga_cmd, ga_env;\n char_u\t *cmd = NULL;\n\n if (dyn_winpty_init(TRUE) == FAIL)\n\treturn FAIL;\n ga_init2(&ga_cmd, (int)sizeof(char*), 20);\n ga_init2(&ga_env, (int)sizeof(char*), 20);\n\n if (argvar->v_type == VAR_STRING)\n {\n\tcmd = argvar->vval.v_string;\n }\n else if (argvar->v_type == VAR_LIST)\n {\n\tif (win32_build_cmd(argvar->vval.v_list, &ga_cmd) == FAIL)\n\t goto failed;\n\tcmd = ga_cmd.ga_data;\n }\n if (cmd == NULL || *cmd == NUL)\n {\n\tEMSG(_(e_invarg));\n\tgoto failed;\n }\n\n cmd_wchar = enc_to_utf16(cmd, NULL);\n ga_clear(&ga_cmd);\n if (cmd_wchar == NULL)\n\tgoto failed;\n if (opt->jo_cwd != NULL)\n\tcwd_wchar = enc_to_utf16(opt->jo_cwd, NULL);\n\n win32_build_env(opt->jo_env, &ga_env, TRUE);\n env_wchar = ga_env.ga_data;\n\n term->tl_winpty_config = winpty_config_new(0, &winpty_err);\n if (term->tl_winpty_config == NULL)\n\tgoto failed;\n\n winpty_config_set_mouse_mode(term->tl_winpty_config,\n\t\t\t\t\t\t WINPTY_MOUSE_MODE_FORCE);\n winpty_config_set_initial_size(term->tl_winpty_config,\n\t\t\t\t\t\t term->tl_cols, term->tl_rows);\n term->tl_winpty = winpty_open(term->tl_winpty_config, &winpty_err);\n if (term->tl_winpty == NULL)\n\tgoto failed;\n\n spawn_config = winpty_spawn_config_new(\n\t WINPTY_SPAWN_FLAG_AUTO_SHUTDOWN |\n\t\tWINPTY_SPAWN_FLAG_EXIT_AFTER_SHUTDOWN,\n\t NULL,\n\t cmd_wchar,\n\t cwd_wchar,\n\t env_wchar,\n\t &winpty_err);\n if (spawn_config == NULL)\n\tgoto failed;\n\n channel = add_channel();\n if (channel == NULL)\n\tgoto failed;\n\n job = job_alloc();\n if (job == NULL)\n\tgoto failed;\n if (argvar->v_type == VAR_STRING)\n {\n\tint argc;\n\n\tbuild_argv_from_string(cmd, &job->jv_argv, &argc);\n }\n else\n {\n\tint argc;\n\n\tbuild_argv_from_list(argvar->vval.v_list, &job->jv_argv, &argc);\n }\n\n if (opt->jo_set & JO_IN_BUF)\n\tjob->jv_in_buf = buflist_findnr(opt->jo_io_buf[PART_IN]);\n\n if (!winpty_spawn(term->tl_winpty, spawn_config, &child_process_handle,\n\t &child_thread_handle, &error, &winpty_err))\n\tgoto failed;\n\n channel_set_pipes(channel,\n\t(sock_T)CreateFileW(\n\t winpty_conin_name(term->tl_winpty),\n\t GENERIC_WRITE, 0, NULL,\n\t OPEN_EXISTING, 0, NULL),\n\t(sock_T)CreateFileW(\n\t winpty_conout_name(term->tl_winpty),\n\t GENERIC_READ, 0, NULL,\n\t OPEN_EXISTING, 0, NULL),\n\t(sock_T)CreateFileW(\n\t winpty_conerr_name(term->tl_winpty),\n\t GENERIC_READ, 0, NULL,\n\t OPEN_EXISTING, 0, NULL));\n\n /* Write lines with CR instead of NL. */\n channel->ch_write_text_mode = TRUE;\n\n jo = CreateJobObject(NULL, NULL);\n if (jo == NULL)\n\tgoto failed;\n\n if (!AssignProcessToJobObject(jo, child_process_handle))\n {\n\t/* Failed, switch the way to terminate process with TerminateProcess. */\n\tCloseHandle(jo);\n\tjo = NULL;\n }\n\n winpty_spawn_config_free(spawn_config);\n vim_free(cmd_wchar);\n vim_free(cwd_wchar);\n vim_free(env_wchar);\n\n create_vterm(term, term->tl_rows, term->tl_cols);\n\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS)\n if (opt->jo_set2 & JO2_ANSI_COLORS)\n\tset_vterm_palette(term->tl_vterm, opt->jo_ansi_colors);\n else\n\tinit_vterm_ansi_colors(term->tl_vterm);\n#endif\n\n channel_set_job(channel, job, opt);\n job_set_options(job, opt);\n\n job->jv_channel = channel;\n job->jv_proc_info.hProcess = child_process_handle;\n job->jv_proc_info.dwProcessId = GetProcessId(child_process_handle);\n job->jv_job_object = jo;\n job->jv_status = JOB_STARTED;\n job->jv_tty_in = utf16_to_enc(\n\t (short_u*)winpty_conin_name(term->tl_winpty), NULL);\n job->jv_tty_out = utf16_to_enc(\n\t (short_u*)winpty_conout_name(term->tl_winpty), NULL);\n ++job->jv_refcount;\n term->tl_job = job;\n\n /* Redirecting stdout and stderr doesn't work at the job level. Instead\n * open the file here and handle it in. opt->jo_io was changed in\n * setup_job_options(), use the original flags here. */\n if (orig_opt->jo_io[PART_OUT] == JIO_FILE)\n {\n\tchar_u *fname = opt->jo_io_name[PART_OUT];\n\n\tch_log(channel, \"Opening output file %s\", fname);\n\tterm->tl_out_fd = mch_fopen((char *)fname, WRITEBIN);\n\tif (term->tl_out_fd == NULL)\n\t EMSG2(_(e_notopen), fname);\n }\n\n return OK;\n\nfailed:\n ga_clear(&ga_cmd);\n ga_clear(&ga_env);\n vim_free(cmd_wchar);\n vim_free(cwd_wchar);\n if (spawn_config != NULL)\n\twinpty_spawn_config_free(spawn_config);\n if (channel != NULL)\n\tchannel_clear(channel);\n if (job != NULL)\n {\n\tjob->jv_channel = NULL;\n\tjob_cleanup(job);\n }\n term->tl_job = NULL;\n if (jo != NULL)\n\tCloseHandle(jo);\n if (term->tl_winpty != NULL)\n\twinpty_free(term->tl_winpty);\n term->tl_winpty = NULL;\n if (term->tl_winpty_config != NULL)\n\twinpty_config_free(term->tl_winpty_config);\n term->tl_winpty_config = NULL;\n if (winpty_err != NULL)\n {\n\tchar_u *msg = utf16_to_enc(\n\t\t\t\t(short_u *)winpty_error_msg(winpty_err), NULL);\n\n\tEMSG(msg);\n\twinpty_error_free(winpty_err);\n }\n return FAIL;\n}\n\n static int\ncreate_pty_only(term_T *term, jobopt_T *options)\n{\n HANDLE\t hPipeIn = INVALID_HANDLE_VALUE;\n HANDLE\t hPipeOut = INVALID_HANDLE_VALUE;\n char\t in_name[80], out_name[80];\n channel_T\t *channel = NULL;\n\n create_vterm(term, term->tl_rows, term->tl_cols);\n\n vim_snprintf(in_name, sizeof(in_name), \"\\\\\\\\.\\\\pipe\\\\vim-%d-in-%d\",\n\t GetCurrentProcessId(),\n\t curbuf->b_fnum);\n hPipeIn = CreateNamedPipe(in_name, PIPE_ACCESS_OUTBOUND,\n\t PIPE_TYPE_MESSAGE | PIPE_NOWAIT,\n\t PIPE_UNLIMITED_INSTANCES,\n\t 0, 0, NMPWAIT_NOWAIT, NULL);\n if (hPipeIn == INVALID_HANDLE_VALUE)\n\tgoto failed;\n\n vim_snprintf(out_name, sizeof(out_name), \"\\\\\\\\.\\\\pipe\\\\vim-%d-out-%d\",\n\t GetCurrentProcessId(),\n\t curbuf->b_fnum);\n hPipeOut = CreateNamedPipe(out_name, PIPE_ACCESS_INBOUND,\n\t PIPE_TYPE_MESSAGE | PIPE_NOWAIT,\n\t PIPE_UNLIMITED_INSTANCES,\n\t 0, 0, 0, NULL);\n if (hPipeOut == INVALID_HANDLE_VALUE)\n\tgoto failed;\n\n ConnectNamedPipe(hPipeIn, NULL);\n ConnectNamedPipe(hPipeOut, NULL);\n\n term->tl_job = job_alloc();\n if (term->tl_job == NULL)\n\tgoto failed;\n ++term->tl_job->jv_refcount;\n\n /* behave like the job is already finished */\n term->tl_job->jv_status = JOB_FINISHED;\n\n channel = add_channel();\n if (channel == NULL)\n\tgoto failed;\n term->tl_job->jv_channel = channel;\n channel->ch_keep_open = TRUE;\n channel->ch_named_pipe = TRUE;\n\n channel_set_pipes(channel,\n\t(sock_T)hPipeIn,\n\t(sock_T)hPipeOut,\n\t(sock_T)hPipeOut);\n channel_set_job(channel, term->tl_job, options);\n term->tl_job->jv_tty_in = vim_strsave((char_u*)in_name);\n term->tl_job->jv_tty_out = vim_strsave((char_u*)out_name);\n\n return OK;\n\nfailed:\n if (hPipeIn != NULL)\n\tCloseHandle(hPipeIn);\n if (hPipeOut != NULL)\n\tCloseHandle(hPipeOut);\n return FAIL;\n}\n\n/*\n * Free the terminal emulator part of \"term\".\n */\n static void\nterm_free_vterm(term_T *term)\n{\n if (term->tl_winpty != NULL)\n\twinpty_free(term->tl_winpty);\n term->tl_winpty = NULL;\n if (term->tl_winpty_config != NULL)\n\twinpty_config_free(term->tl_winpty_config);\n term->tl_winpty_config = NULL;\n if (term->tl_vterm != NULL)\n\tvterm_free(term->tl_vterm);\n term->tl_vterm = NULL;\n}\n\n/*\n * Report the size to the terminal.\n */\n static void\nterm_report_winsize(term_T *term, int rows, int cols)\n{\n if (term->tl_winpty)\n\twinpty_set_size(term->tl_winpty, cols, rows, NULL);\n}\n\n int\nterminal_enabled(void)\n{\n return dyn_winpty_init(FALSE) == OK;\n}\n\n# else\n\n/**************************************\n * 3. Unix-like implementation.\n */\n\n/*\n * Create a new terminal of \"rows\" by \"cols\" cells.\n * Start job for \"cmd\".\n * Store the pointers in \"term\".\n * When \"argv\" is not NULL then \"argvar\" is not used.\n * Return OK or FAIL.\n */\n static int\nterm_and_job_init(\n\tterm_T\t *term,\n\ttypval_T *argvar,\n\tchar\t **argv,\n\tjobopt_T *opt,\n\tjobopt_T *orig_opt UNUSED)\n{\n create_vterm(term, term->tl_rows, term->tl_cols);\n\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS)\n if (opt->jo_set2 & JO2_ANSI_COLORS)\n\tset_vterm_palette(term->tl_vterm, opt->jo_ansi_colors);\n else\n\tinit_vterm_ansi_colors(term->tl_vterm);\n#endif\n\n /* This may change a string in \"argvar\". */\n term->tl_job = job_start(argvar, argv, opt, TRUE);\n if (term->tl_job != NULL)\n\t++term->tl_job->jv_refcount;\n\n return term->tl_job != NULL\n\t&& term->tl_job->jv_channel != NULL\n\t&& term->tl_job->jv_status != JOB_FAILED ? OK : FAIL;\n}\n\n static int\ncreate_pty_only(term_T *term, jobopt_T *opt)\n{\n create_vterm(term, term->tl_rows, term->tl_cols);\n\n term->tl_job = job_alloc();\n if (term->tl_job == NULL)\n\treturn FAIL;\n ++term->tl_job->jv_refcount;\n\n /* behave like the job is already finished */\n term->tl_job->jv_status = JOB_FINISHED;\n\n return mch_create_pty_channel(term->tl_job, opt);\n}\n\n/*\n * Free the terminal emulator part of \"term\".\n */\n static void\nterm_free_vterm(term_T *term)\n{\n if (term->tl_vterm != NULL)\n\tvterm_free(term->tl_vterm);\n term->tl_vterm = NULL;\n}\n\n/*\n * Report the size to the terminal.\n */\n static void\nterm_report_winsize(term_T *term, int rows, int cols)\n{\n /* Use an ioctl() to report the new window size to the job. */\n if (term->tl_job != NULL && term->tl_job->jv_channel != NULL)\n {\n\tint fd = -1;\n\tint part;\n\n\tfor (part = PART_OUT; part < PART_COUNT; ++part)\n\t{\n\t fd = term->tl_job->jv_channel->ch_part[part].ch_fd;\n\t if (isatty(fd))\n\t\tbreak;\n\t}\n\tif (part < PART_COUNT && mch_report_winsize(fd, rows, cols) == OK)\n\t mch_signal_job(term->tl_job, (char_u *)\"winch\");\n }\n}\n\n# endif\n\n#endif /* FEAT_TERMINAL */\n"},"code_after":{"kind":"string","value":"/* vi:set ts=8 sts=4 sw=4 noet:\n *\n * VIM - Vi IMproved\tby Bram Moolenaar\n *\n * Do \":help uganda\" in Vim to read copying and usage conditions.\n * Do \":help credits\" in Vim to see a list of people who contributed.\n * See README.txt for an overview of the Vim source code.\n */\n\n/*\n * Terminal window support, see \":help :terminal\".\n *\n * There are three parts:\n * 1. Generic code for all systems.\n * Uses libvterm for the terminal emulator.\n * 2. The MS-Windows implementation.\n * Uses winpty.\n * 3. The Unix-like implementation.\n * Uses pseudo-tty's (pty's).\n *\n * For each terminal one VTerm is constructed. This uses libvterm. A copy of\n * this library is in the libvterm directory.\n *\n * When a terminal window is opened, a job is started that will be connected to\n * the terminal emulator.\n *\n * If the terminal window has keyboard focus, typed keys are converted to the\n * terminal encoding and writing to the job over a channel.\n *\n * If the job produces output, it is written to the terminal emulator. The\n * terminal emulator invokes callbacks when its screen content changes. The\n * line range is stored in tl_dirty_row_start and tl_dirty_row_end. Once in a\n * while, if the terminal window is visible, the screen contents is drawn.\n *\n * When the job ends the text is put in a buffer. Redrawing then happens from\n * that buffer, attributes come from the scrollback buffer tl_scrollback.\n * When the buffer is changed it is turned into a normal buffer, the attributes\n * in tl_scrollback are no longer used.\n */\n\n#include \"vim.h\"\n\n#if defined(FEAT_TERMINAL) || defined(PROTO)\n\n#ifndef MIN\n# define MIN(x,y) ((x) < (y) ? (x) : (y))\n#endif\n#ifndef MAX\n# define MAX(x,y) ((x) > (y) ? (x) : (y))\n#endif\n\n#include \"libvterm/include/vterm.h\"\n\n/* This is VTermScreenCell without the characters, thus much smaller. */\ntypedef struct {\n VTermScreenCellAttrs\tattrs;\n char\t\t\twidth;\n VTermColor\t\tfg;\n VTermColor\t\tbg;\n} cellattr_T;\n\ntypedef struct sb_line_S {\n int\t\tsb_cols;\t/* can differ per line */\n cellattr_T\t*sb_cells;\t/* allocated */\n cellattr_T\tsb_fill_attr;\t/* for short line */\n} sb_line_T;\n\n/* typedef term_T in structs.h */\nstruct terminal_S {\n term_T\t*tl_next;\n\n VTerm\t*tl_vterm;\n job_T\t*tl_job;\n buf_T\t*tl_buffer;\n#if defined(FEAT_GUI)\n int\t\ttl_system;\t/* when non-zero used for :!cmd output */\n int\t\ttl_toprow;\t/* row with first line of system terminal */\n#endif\n\n /* Set when setting the size of a vterm, reset after redrawing. */\n int\t\ttl_vterm_size_changed;\n\n int\t\ttl_normal_mode; /* TRUE: Terminal-Normal mode */\n int\t\ttl_channel_closed;\n int\t\ttl_channel_recently_closed; // still need to handle tl_finish\n\n int\t\ttl_finish;\n#define TL_FINISH_UNSET\t NUL\n#define TL_FINISH_CLOSE\t 'c'\t/* ++close or :terminal without argument */\n#define TL_FINISH_NOCLOSE 'n'\t/* ++noclose */\n#define TL_FINISH_OPEN\t 'o'\t/* ++open */\n char_u\t*tl_opencmd;\n char_u\t*tl_eof_chars;\n\n#ifdef WIN3264\n void\t*tl_winpty_config;\n void\t*tl_winpty;\n\n FILE\t*tl_out_fd;\n#endif\n#if defined(FEAT_SESSION)\n char_u\t*tl_command;\n#endif\n char_u\t*tl_kill;\n\n /* last known vterm size */\n int\t\ttl_rows;\n int\t\ttl_cols;\n\n char_u\t*tl_title; /* NULL or allocated */\n char_u\t*tl_status_text; /* NULL or allocated */\n\n /* Range of screen rows to update. Zero based. */\n int\t\ttl_dirty_row_start; /* MAX_ROW if nothing dirty */\n int\t\ttl_dirty_row_end; /* row below last one to update */\n int\t\ttl_dirty_snapshot; /* text updated after making snapshot */\n#ifdef FEAT_TIMERS\n int\t\ttl_timer_set;\n proftime_T\ttl_timer_due;\n#endif\n int\t\ttl_postponed_scroll;\t/* to be scrolled up */\n\n garray_T\ttl_scrollback;\n int\t\ttl_scrollback_scrolled;\n cellattr_T\ttl_default_color;\n\n linenr_T\ttl_top_diff_rows; /* rows of top diff file or zero */\n linenr_T\ttl_bot_diff_rows; /* rows of bottom diff file */\n\n VTermPos\ttl_cursor_pos;\n int\t\ttl_cursor_visible;\n int\t\ttl_cursor_blink;\n int\t\ttl_cursor_shape; /* 1: block, 2: underline, 3: bar */\n char_u\t*tl_cursor_color; /* NULL or allocated */\n\n int\t\ttl_using_altscreen;\n};\n\n#define TMODE_ONCE 1\t /* CTRL-\\ CTRL-N used */\n#define TMODE_LOOP 2\t /* CTRL-W N used */\n\n/*\n * List of all active terminals.\n */\nstatic term_T *first_term = NULL;\n\n/* Terminal active in terminal_loop(). */\nstatic term_T *in_terminal_loop = NULL;\n\n#define MAX_ROW 999999\t /* used for tl_dirty_row_end to update all rows */\n#define KEY_BUF_LEN 200\n\n/*\n * Functions with separate implementation for MS-Windows and Unix-like systems.\n */\nstatic int term_and_job_init(term_T *term, typval_T *argvar, char **argv, jobopt_T *opt, jobopt_T *orig_opt);\nstatic int create_pty_only(term_T *term, jobopt_T *opt);\nstatic void term_report_winsize(term_T *term, int rows, int cols);\nstatic void term_free_vterm(term_T *term);\n#ifdef FEAT_GUI\nstatic void update_system_term(term_T *term);\n#endif\n\n/* The character that we know (or assume) that the terminal expects for the\n * backspace key. */\nstatic int term_backspace_char = BS;\n\n/* \"Terminal\" highlight group colors. */\nstatic int term_default_cterm_fg = -1;\nstatic int term_default_cterm_bg = -1;\n\n/* Store the last set and the desired cursor properties, so that we only update\n * them when needed. Doing it unnecessary may result in flicker. */\nstatic char_u\t*last_set_cursor_color = NULL;\nstatic char_u\t*desired_cursor_color = NULL;\nstatic int\tlast_set_cursor_shape = -1;\nstatic int\tdesired_cursor_shape = -1;\nstatic int\tlast_set_cursor_blink = -1;\nstatic int\tdesired_cursor_blink = -1;\n\n\n/**************************************\n * 1. Generic code for all systems.\n */\n\n static int\ncursor_color_equal(char_u *lhs_color, char_u *rhs_color)\n{\n if (lhs_color != NULL && rhs_color != NULL)\n\treturn STRCMP(lhs_color, rhs_color) == 0;\n return lhs_color == NULL && rhs_color == NULL;\n}\n\n static void\ncursor_color_copy(char_u **to_color, char_u *from_color)\n{\n // Avoid a free & alloc if the value is already right.\n if (cursor_color_equal(*to_color, from_color))\n\treturn;\n vim_free(*to_color);\n *to_color = (from_color == NULL) ? NULL : vim_strsave(from_color);\n}\n\n static char_u *\ncursor_color_get(char_u *color)\n{\n return (color == NULL) ? (char_u *)\"\" : color;\n}\n\n\n/*\n * Parse 'termwinsize' and set \"rows\" and \"cols\" for the terminal size in the\n * current window.\n * Sets \"rows\" and/or \"cols\" to zero when it should follow the window size.\n * Return TRUE if the size is the minimum size: \"24*80\".\n */\n static int\nparse_termwinsize(win_T *wp, int *rows, int *cols)\n{\n int\tminsize = FALSE;\n\n *rows = 0;\n *cols = 0;\n\n if (*wp->w_p_tws != NUL)\n {\n\tchar_u *p = vim_strchr(wp->w_p_tws, 'x');\n\n\t/* Syntax of value was already checked when it's set. */\n\tif (p == NULL)\n\t{\n\t minsize = TRUE;\n\t p = vim_strchr(wp->w_p_tws, '*');\n\t}\n\t*rows = atoi((char *)wp->w_p_tws);\n\t*cols = atoi((char *)p + 1);\n }\n return minsize;\n}\n\n/*\n * Determine the terminal size from 'termwinsize' and the current window.\n */\n static void\nset_term_and_win_size(term_T *term)\n{\n#ifdef FEAT_GUI\n if (term->tl_system)\n {\n\t/* Use the whole screen for the system command. However, it will start\n\t * at the command line and scroll up as needed, using tl_toprow. */\n\tterm->tl_rows = Rows;\n\tterm->tl_cols = Columns;\n\treturn;\n }\n#endif\n if (parse_termwinsize(curwin, &term->tl_rows, &term->tl_cols))\n {\n\tif (term->tl_rows != 0)\n\t term->tl_rows = MAX(term->tl_rows, curwin->w_height);\n\tif (term->tl_cols != 0)\n\t term->tl_cols = MAX(term->tl_cols, curwin->w_width);\n }\n if (term->tl_rows == 0)\n\tterm->tl_rows = curwin->w_height;\n else\n\twin_setheight_win(term->tl_rows, curwin);\n if (term->tl_cols == 0)\n\tterm->tl_cols = curwin->w_width;\n else\n\twin_setwidth_win(term->tl_cols, curwin);\n}\n\n/*\n * Initialize job options for a terminal job.\n * Caller may overrule some of them.\n */\n void\ninit_job_options(jobopt_T *opt)\n{\n clear_job_options(opt);\n\n opt->jo_mode = MODE_RAW;\n opt->jo_out_mode = MODE_RAW;\n opt->jo_err_mode = MODE_RAW;\n opt->jo_set = JO_MODE | JO_OUT_MODE | JO_ERR_MODE;\n}\n\n/*\n * Set job options mandatory for a terminal job.\n */\n static void\nsetup_job_options(jobopt_T *opt, int rows, int cols)\n{\n#ifndef WIN3264\n /* Win32: Redirecting the job output won't work, thus always connect stdout\n * here. */\n if (!(opt->jo_set & JO_OUT_IO))\n#endif\n {\n\t/* Connect stdout to the terminal. */\n\topt->jo_io[PART_OUT] = JIO_BUFFER;\n\topt->jo_io_buf[PART_OUT] = curbuf->b_fnum;\n\topt->jo_modifiable[PART_OUT] = 0;\n\topt->jo_set |= JO_OUT_IO + JO_OUT_BUF + JO_OUT_MODIFIABLE;\n }\n\n#ifndef WIN3264\n /* Win32: Redirecting the job output won't work, thus always connect stderr\n * here. */\n if (!(opt->jo_set & JO_ERR_IO))\n#endif\n {\n\t/* Connect stderr to the terminal. */\n\topt->jo_io[PART_ERR] = JIO_BUFFER;\n\topt->jo_io_buf[PART_ERR] = curbuf->b_fnum;\n\topt->jo_modifiable[PART_ERR] = 0;\n\topt->jo_set |= JO_ERR_IO + JO_ERR_BUF + JO_ERR_MODIFIABLE;\n }\n\n opt->jo_pty = TRUE;\n if ((opt->jo_set2 & JO2_TERM_ROWS) == 0)\n\topt->jo_term_rows = rows;\n if ((opt->jo_set2 & JO2_TERM_COLS) == 0)\n\topt->jo_term_cols = cols;\n}\n\n/*\n * Close a terminal buffer (and its window). Used when creating the terminal\n * fails.\n */\n static void\nterm_close_buffer(buf_T *buf, buf_T *old_curbuf)\n{\n free_terminal(buf);\n if (old_curbuf != NULL)\n {\n\t--curbuf->b_nwindows;\n\tcurbuf = old_curbuf;\n\tcurwin->w_buffer = curbuf;\n\t++curbuf->b_nwindows;\n }\n\n /* Wiping out the buffer will also close the window and call\n * free_terminal(). */\n do_buffer(DOBUF_WIPE, DOBUF_FIRST, FORWARD, buf->b_fnum, TRUE);\n}\n\n/*\n * Start a terminal window and return its buffer.\n * Use either \"argvar\" or \"argv\", the other must be NULL.\n * When \"flags\" has TERM_START_NOJOB only create the buffer, b_term and open\n * the window.\n * Returns NULL when failed.\n */\n buf_T *\nterm_start(\n\ttypval_T *argvar,\n\tchar\t **argv,\n\tjobopt_T *opt,\n\tint\t flags)\n{\n exarg_T\tsplit_ea;\n win_T\t*old_curwin = curwin;\n term_T\t*term;\n buf_T\t*old_curbuf = NULL;\n int\t\tres;\n buf_T\t*newbuf;\n int\t\tvertical = opt->jo_vertical || (cmdmod.split & WSP_VERT);\n jobopt_T\torig_opt; // only partly filled\n\n if (check_restricted() || check_secure())\n\treturn NULL;\n\n if ((opt->jo_set & (JO_IN_IO + JO_OUT_IO + JO_ERR_IO))\n\t\t\t\t\t == (JO_IN_IO + JO_OUT_IO + JO_ERR_IO)\n\t|| (!(opt->jo_set & JO_OUT_IO) && (opt->jo_set & JO_OUT_BUF))\n\t|| (!(opt->jo_set & JO_ERR_IO) && (opt->jo_set & JO_ERR_BUF)))\n {\n\tEMSG(_(e_invarg));\n\treturn NULL;\n }\n\n term = (term_T *)alloc_clear(sizeof(term_T));\n if (term == NULL)\n\treturn NULL;\n term->tl_dirty_row_end = MAX_ROW;\n term->tl_cursor_visible = TRUE;\n term->tl_cursor_shape = VTERM_PROP_CURSORSHAPE_BLOCK;\n term->tl_finish = opt->jo_term_finish;\n#ifdef FEAT_GUI\n term->tl_system = (flags & TERM_START_SYSTEM);\n#endif\n ga_init2(&term->tl_scrollback, sizeof(sb_line_T), 300);\n\n vim_memset(&split_ea, 0, sizeof(split_ea));\n if (opt->jo_curwin)\n {\n\t/* Create a new buffer in the current window. */\n\tif (!can_abandon(curbuf, flags & TERM_START_FORCEIT))\n\t{\n\t no_write_message();\n\t vim_free(term);\n\t return NULL;\n\t}\n\tif (do_ecmd(0, NULL, NULL, &split_ea, ECMD_ONE,\n\t\t ECMD_HIDE\n\t\t\t + ((flags & TERM_START_FORCEIT) ? ECMD_FORCEIT : 0),\n\t\t curwin) == FAIL)\n\t{\n\t vim_free(term);\n\t return NULL;\n\t}\n }\n else if (opt->jo_hidden || (flags & TERM_START_SYSTEM))\n {\n\tbuf_T *buf;\n\n\t/* Create a new buffer without a window. Make it the current buffer for\n\t * a moment to be able to do the initialisations. */\n\tbuf = buflist_new((char_u *)\"\", NULL, (linenr_T)0,\n\t\t\t\t\t\t\t BLN_NEW | BLN_LISTED);\n\tif (buf == NULL || ml_open(buf) == FAIL)\n\t{\n\t vim_free(term);\n\t return NULL;\n\t}\n\told_curbuf = curbuf;\n\t--curbuf->b_nwindows;\n\tcurbuf = buf;\n\tcurwin->w_buffer = buf;\n\t++curbuf->b_nwindows;\n }\n else\n {\n\t/* Open a new window or tab. */\n\tsplit_ea.cmdidx = CMD_new;\n\tsplit_ea.cmd = (char_u *)\"new\";\n\tsplit_ea.arg = (char_u *)\"\";\n\tif (opt->jo_term_rows > 0 && !vertical)\n\t{\n\t split_ea.line2 = opt->jo_term_rows;\n\t split_ea.addr_count = 1;\n\t}\n\tif (opt->jo_term_cols > 0 && vertical)\n\t{\n\t split_ea.line2 = opt->jo_term_cols;\n\t split_ea.addr_count = 1;\n\t}\n\n\tif (vertical)\n\t cmdmod.split |= WSP_VERT;\n\tex_splitview(&split_ea);\n\tif (curwin == old_curwin)\n\t{\n\t /* split failed */\n\t vim_free(term);\n\t return NULL;\n\t}\n }\n term->tl_buffer = curbuf;\n curbuf->b_term = term;\n\n if (!opt->jo_hidden)\n {\n\t/* Only one size was taken care of with :new, do the other one. With\n\t * \"curwin\" both need to be done. */\n\tif (opt->jo_term_rows > 0 && (opt->jo_curwin || vertical))\n\t win_setheight(opt->jo_term_rows);\n\tif (opt->jo_term_cols > 0 && (opt->jo_curwin || !vertical))\n\t win_setwidth(opt->jo_term_cols);\n }\n\n /* Link the new terminal in the list of active terminals. */\n term->tl_next = first_term;\n first_term = term;\n\n if (opt->jo_term_name != NULL)\n\tcurbuf->b_ffname = vim_strsave(opt->jo_term_name);\n else if (argv != NULL)\n\tcurbuf->b_ffname = vim_strsave((char_u *)\"!system\");\n else\n {\n\tint\ti;\n\tsize_t\tlen;\n\tchar_u\t*cmd, *p;\n\n\tif (argvar->v_type == VAR_STRING)\n\t{\n\t cmd = argvar->vval.v_string;\n\t if (cmd == NULL)\n\t\tcmd = (char_u *)\"\";\n\t else if (STRCMP(cmd, \"NONE\") == 0)\n\t\tcmd = (char_u *)\"pty\";\n\t}\n\telse if (argvar->v_type != VAR_LIST\n\t\t|| argvar->vval.v_list == NULL\n\t\t|| argvar->vval.v_list->lv_len < 1\n\t\t|| (cmd = tv_get_string_chk(\n\t\t\t &argvar->vval.v_list->lv_first->li_tv)) == NULL)\n\t cmd = (char_u*)\"\";\n\n\tlen = STRLEN(cmd) + 10;\n\tp = alloc((int)len);\n\n\tfor (i = 0; p != NULL; ++i)\n\t{\n\t /* Prepend a ! to the command name to avoid the buffer name equals\n\t * the executable, otherwise \":w!\" would overwrite it. */\n\t if (i == 0)\n\t\tvim_snprintf((char *)p, len, \"!%s\", cmd);\n\t else\n\t\tvim_snprintf((char *)p, len, \"!%s (%d)\", cmd, i);\n\t if (buflist_findname(p) == NULL)\n\t {\n\t\tvim_free(curbuf->b_ffname);\n\t\tcurbuf->b_ffname = p;\n\t\tbreak;\n\t }\n\t}\n }\n curbuf->b_fname = curbuf->b_ffname;\n\n if (opt->jo_term_opencmd != NULL)\n\tterm->tl_opencmd = vim_strsave(opt->jo_term_opencmd);\n\n if (opt->jo_eof_chars != NULL)\n\tterm->tl_eof_chars = vim_strsave(opt->jo_eof_chars);\n\n set_string_option_direct((char_u *)\"buftype\", -1,\n\t\t\t\t (char_u *)\"terminal\", OPT_FREE|OPT_LOCAL, 0);\n // Avoid that 'buftype' is reset when this buffer is entered.\n curbuf->b_p_initialized = TRUE;\n\n /* Mark the buffer as not modifiable. It can only be made modifiable after\n * the job finished. */\n curbuf->b_p_ma = FALSE;\n\n set_term_and_win_size(term);\n#ifdef WIN3264\n mch_memmove(orig_opt.jo_io, opt->jo_io, sizeof(orig_opt.jo_io));\n#endif\n setup_job_options(opt, term->tl_rows, term->tl_cols);\n\n if (flags & TERM_START_NOJOB)\n\treturn curbuf;\n\n#if defined(FEAT_SESSION)\n /* Remember the command for the session file. */\n if (opt->jo_term_norestore || argv != NULL)\n {\n\tterm->tl_command = vim_strsave((char_u *)\"NONE\");\n }\n else if (argvar->v_type == VAR_STRING)\n {\n\tchar_u\t*cmd = argvar->vval.v_string;\n\n\tif (cmd != NULL && STRCMP(cmd, p_sh) != 0)\n\t term->tl_command = vim_strsave(cmd);\n }\n else if (argvar->v_type == VAR_LIST\n\t && argvar->vval.v_list != NULL\n\t && argvar->vval.v_list->lv_len > 0)\n {\n\tgarray_T\tga;\n\tlistitem_T\t*item;\n\n\tga_init2(&ga, 1, 100);\n\tfor (item = argvar->vval.v_list->lv_first;\n\t\t\t\t\titem != NULL; item = item->li_next)\n\t{\n\t char_u *s = tv_get_string_chk(&item->li_tv);\n\t char_u *p;\n\n\t if (s == NULL)\n\t\tbreak;\n\t p = vim_strsave_fnameescape(s, FALSE);\n\t if (p == NULL)\n\t\tbreak;\n\t ga_concat(&ga, p);\n\t vim_free(p);\n\t ga_append(&ga, ' ');\n\t}\n\tif (item == NULL)\n\t{\n\t ga_append(&ga, NUL);\n\t term->tl_command = ga.ga_data;\n\t}\n\telse\n\t ga_clear(&ga);\n }\n#endif\n\n if (opt->jo_term_kill != NULL)\n {\n\tchar_u *p = skiptowhite(opt->jo_term_kill);\n\n\tterm->tl_kill = vim_strnsave(opt->jo_term_kill, p - opt->jo_term_kill);\n }\n\n /* System dependent: setup the vterm and maybe start the job in it. */\n if (argv == NULL\n\t && argvar->v_type == VAR_STRING\n\t && argvar->vval.v_string != NULL\n\t && STRCMP(argvar->vval.v_string, \"NONE\") == 0)\n\tres = create_pty_only(term, opt);\n else\n\tres = term_and_job_init(term, argvar, argv, opt, &orig_opt);\n\n newbuf = curbuf;\n if (res == OK)\n {\n\t/* Get and remember the size we ended up with. Update the pty. */\n\tvterm_get_size(term->tl_vterm, &term->tl_rows, &term->tl_cols);\n\tterm_report_winsize(term, term->tl_rows, term->tl_cols);\n#ifdef FEAT_GUI\n\tif (term->tl_system)\n\t{\n\t /* display first line below typed command */\n\t term->tl_toprow = msg_row + 1;\n\t term->tl_dirty_row_end = 0;\n\t}\n#endif\n\n\t/* Make sure we don't get stuck on sending keys to the job, it leads to\n\t * a deadlock if the job is waiting for Vim to read. */\n\tchannel_set_nonblock(term->tl_job->jv_channel, PART_IN);\n\n\tif (old_curbuf != NULL)\n\t{\n\t --curbuf->b_nwindows;\n\t curbuf = old_curbuf;\n\t curwin->w_buffer = curbuf;\n\t ++curbuf->b_nwindows;\n\t}\n }\n else\n {\n\tterm_close_buffer(curbuf, old_curbuf);\n\treturn NULL;\n }\n\n apply_autocmds(EVENT_TERMINALOPEN, NULL, NULL, FALSE, newbuf);\n return newbuf;\n}\n\n/*\n * \":terminal\": open a terminal window and execute a job in it.\n */\n void\nex_terminal(exarg_T *eap)\n{\n typval_T\targvar[2];\n jobopt_T\topt;\n char_u\t*cmd;\n char_u\t*tofree = NULL;\n\n init_job_options(&opt);\n\n cmd = eap->arg;\n while (*cmd == '+' && *(cmd + 1) == '+')\n {\n\tchar_u *p, *ep;\n\n\tcmd += 2;\n\tp = skiptowhite(cmd);\n\tep = vim_strchr(cmd, '=');\n\tif (ep != NULL && ep < p)\n\t p = ep;\n\n\tif ((int)(p - cmd) == 5 && STRNICMP(cmd, \"close\", 5) == 0)\n\t opt.jo_term_finish = 'c';\n\telse if ((int)(p - cmd) == 7 && STRNICMP(cmd, \"noclose\", 7) == 0)\n\t opt.jo_term_finish = 'n';\n\telse if ((int)(p - cmd) == 4 && STRNICMP(cmd, \"open\", 4) == 0)\n\t opt.jo_term_finish = 'o';\n\telse if ((int)(p - cmd) == 6 && STRNICMP(cmd, \"curwin\", 6) == 0)\n\t opt.jo_curwin = 1;\n\telse if ((int)(p - cmd) == 6 && STRNICMP(cmd, \"hidden\", 6) == 0)\n\t opt.jo_hidden = 1;\n\telse if ((int)(p - cmd) == 9 && STRNICMP(cmd, \"norestore\", 9) == 0)\n\t opt.jo_term_norestore = 1;\n\telse if ((int)(p - cmd) == 4 && STRNICMP(cmd, \"kill\", 4) == 0\n\t\t&& ep != NULL)\n\t{\n\t opt.jo_set2 |= JO2_TERM_KILL;\n\t opt.jo_term_kill = ep + 1;\n\t p = skiptowhite(cmd);\n\t}\n\telse if ((int)(p - cmd) == 4 && STRNICMP(cmd, \"rows\", 4) == 0\n\t\t&& ep != NULL && isdigit(ep[1]))\n\t{\n\t opt.jo_set2 |= JO2_TERM_ROWS;\n\t opt.jo_term_rows = atoi((char *)ep + 1);\n\t p = skiptowhite(cmd);\n\t}\n\telse if ((int)(p - cmd) == 4 && STRNICMP(cmd, \"cols\", 4) == 0\n\t\t&& ep != NULL && isdigit(ep[1]))\n\t{\n\t opt.jo_set2 |= JO2_TERM_COLS;\n\t opt.jo_term_cols = atoi((char *)ep + 1);\n\t p = skiptowhite(cmd);\n\t}\n\telse if ((int)(p - cmd) == 3 && STRNICMP(cmd, \"eof\", 3) == 0\n\t\t\t\t\t\t\t\t && ep != NULL)\n\t{\n\t char_u *buf = NULL;\n\t char_u *keys;\n\n\t p = skiptowhite(cmd);\n\t *p = NUL;\n\t keys = replace_termcodes(ep + 1, &buf, TRUE, TRUE, TRUE);\n\t opt.jo_set2 |= JO2_EOF_CHARS;\n\t opt.jo_eof_chars = vim_strsave(keys);\n\t vim_free(buf);\n\t *p = ' ';\n\t}\n\telse\n\t{\n\t if (*p)\n\t\t*p = NUL;\n\t EMSG2(_(\"E181: Invalid attribute: %s\"), cmd);\n\t goto theend;\n\t}\n\tcmd = skipwhite(p);\n }\n if (*cmd == NUL)\n {\n\t/* Make a copy of 'shell', an autocommand may change the option. */\n\ttofree = cmd = vim_strsave(p_sh);\n\n\t/* default to close when the shell exits */\n\tif (opt.jo_term_finish == NUL)\n\t opt.jo_term_finish = 'c';\n }\n\n if (eap->addr_count > 0)\n {\n\t/* Write lines from current buffer to the job. */\n\topt.jo_set |= JO_IN_IO | JO_IN_BUF | JO_IN_TOP | JO_IN_BOT;\n\topt.jo_io[PART_IN] = JIO_BUFFER;\n\topt.jo_io_buf[PART_IN] = curbuf->b_fnum;\n\topt.jo_in_top = eap->line1;\n\topt.jo_in_bot = eap->line2;\n }\n\n argvar[0].v_type = VAR_STRING;\n argvar[0].vval.v_string = cmd;\n argvar[1].v_type = VAR_UNKNOWN;\n term_start(argvar, NULL, &opt, eap->forceit ? TERM_START_FORCEIT : 0);\n vim_free(tofree);\n\ntheend:\n vim_free(opt.jo_eof_chars);\n}\n\n#if defined(FEAT_SESSION) || defined(PROTO)\n/*\n * Write a :terminal command to the session file to restore the terminal in\n * window \"wp\".\n * Return FAIL if writing fails.\n */\n int\nterm_write_session(FILE *fd, win_T *wp)\n{\n term_T *term = wp->w_buffer->b_term;\n\n /* Create the terminal and run the command. This is not without\n * risk, but let's assume the user only creates a session when this\n * will be OK. */\n if (fprintf(fd, \"terminal ++curwin ++cols=%d ++rows=%d \",\n\t\tterm->tl_cols, term->tl_rows) < 0)\n\treturn FAIL;\n if (term->tl_command != NULL && fputs((char *)term->tl_command, fd) < 0)\n\treturn FAIL;\n\n return put_eol(fd);\n}\n\n/*\n * Return TRUE if \"buf\" has a terminal that should be restored.\n */\n int\nterm_should_restore(buf_T *buf)\n{\n term_T\t*term = buf->b_term;\n\n return term != NULL && (term->tl_command == NULL\n\t\t\t\t || STRCMP(term->tl_command, \"NONE\") != 0);\n}\n#endif\n\n/*\n * Free the scrollback buffer for \"term\".\n */\n static void\nfree_scrollback(term_T *term)\n{\n int i;\n\n for (i = 0; i < term->tl_scrollback.ga_len; ++i)\n\tvim_free(((sb_line_T *)term->tl_scrollback.ga_data + i)->sb_cells);\n ga_clear(&term->tl_scrollback);\n}\n\n/*\n * Free a terminal and everything it refers to.\n * Kills the job if there is one.\n * Called when wiping out a buffer.\n */\n void\nfree_terminal(buf_T *buf)\n{\n term_T\t*term = buf->b_term;\n term_T\t*tp;\n\n if (term == NULL)\n\treturn;\n if (first_term == term)\n\tfirst_term = term->tl_next;\n else\n\tfor (tp = first_term; tp->tl_next != NULL; tp = tp->tl_next)\n\t if (tp->tl_next == term)\n\t {\n\t\ttp->tl_next = term->tl_next;\n\t\tbreak;\n\t }\n\n if (term->tl_job != NULL)\n {\n\tif (term->tl_job->jv_status != JOB_ENDED\n\t\t&& term->tl_job->jv_status != JOB_FINISHED\n\t\t&& term->tl_job->jv_status != JOB_FAILED)\n\t job_stop(term->tl_job, NULL, \"kill\");\n\tjob_unref(term->tl_job);\n }\n\n free_scrollback(term);\n\n term_free_vterm(term);\n vim_free(term->tl_title);\n#ifdef FEAT_SESSION\n vim_free(term->tl_command);\n#endif\n vim_free(term->tl_kill);\n vim_free(term->tl_status_text);\n vim_free(term->tl_opencmd);\n vim_free(term->tl_eof_chars);\n#ifdef WIN3264\n if (term->tl_out_fd != NULL)\n\tfclose(term->tl_out_fd);\n#endif\n vim_free(term->tl_cursor_color);\n vim_free(term);\n buf->b_term = NULL;\n if (in_terminal_loop == term)\n\tin_terminal_loop = NULL;\n}\n\n/*\n * Get the part that is connected to the tty. Normally this is PART_IN, but\n * when writing buffer lines to the job it can be another. This makes it\n * possible to do \"1,5term vim -\".\n */\n static ch_part_T\nget_tty_part(term_T *term)\n{\n#ifdef UNIX\n ch_part_T\tparts[3] = {PART_IN, PART_OUT, PART_ERR};\n int\t\ti;\n\n for (i = 0; i < 3; ++i)\n {\n\tint fd = term->tl_job->jv_channel->ch_part[parts[i]].ch_fd;\n\n\tif (isatty(fd))\n\t return parts[i];\n }\n#endif\n return PART_IN;\n}\n\n/*\n * Write job output \"msg[len]\" to the vterm.\n */\n static void\nterm_write_job_output(term_T *term, char_u *msg, size_t len)\n{\n VTerm\t*vterm = term->tl_vterm;\n size_t\tprevlen = vterm_output_get_buffer_current(vterm);\n\n vterm_input_write(vterm, (char *)msg, len);\n\n /* flush vterm buffer when vterm responded to control sequence */\n if (prevlen != vterm_output_get_buffer_current(vterm))\n {\n\tchar buf[KEY_BUF_LEN];\n\tsize_t curlen = vterm_output_read(vterm, buf, KEY_BUF_LEN);\n\n\tif (curlen > 0)\n\t channel_send(term->tl_job->jv_channel, get_tty_part(term),\n\t\t\t\t\t (char_u *)buf, (int)curlen, NULL);\n }\n\n /* this invokes the damage callbacks */\n vterm_screen_flush_damage(vterm_obtain_screen(vterm));\n}\n\n static void\nupdate_cursor(term_T *term, int redraw)\n{\n if (term->tl_normal_mode)\n\treturn;\n#ifdef FEAT_GUI\n if (term->tl_system)\n\twindgoto(term->tl_cursor_pos.row + term->tl_toprow,\n\t\t\t\t\t\t term->tl_cursor_pos.col);\n else\n#endif\n\tsetcursor();\n if (redraw)\n {\n\tif (term->tl_buffer == curbuf && term->tl_cursor_visible)\n\t cursor_on();\n\tout_flush();\n#ifdef FEAT_GUI\n\tif (gui.in_use)\n\t{\n\t gui_update_cursor(FALSE, FALSE);\n\t gui_mch_flush();\n\t}\n#endif\n }\n}\n\n/*\n * Invoked when \"msg\" output from a job was received. Write it to the terminal\n * of \"buffer\".\n */\n void\nwrite_to_term(buf_T *buffer, char_u *msg, channel_T *channel)\n{\n size_t\tlen = STRLEN(msg);\n term_T\t*term = buffer->b_term;\n\n#ifdef WIN3264\n /* Win32: Cannot redirect output of the job, intercept it here and write to\n * the file. */\n if (term->tl_out_fd != NULL)\n {\n\tch_log(channel, \"Writing %d bytes to output file\", (int)len);\n\tfwrite(msg, len, 1, term->tl_out_fd);\n\treturn;\n }\n#endif\n\n if (term->tl_vterm == NULL)\n {\n\tch_log(channel, \"NOT writing %d bytes to terminal\", (int)len);\n\treturn;\n }\n ch_log(channel, \"writing %d bytes to terminal\", (int)len);\n term_write_job_output(term, msg, len);\n\n#ifdef FEAT_GUI\n if (term->tl_system)\n {\n\t/* show system output, scrolling up the screen as needed */\n\tupdate_system_term(term);\n\tupdate_cursor(term, TRUE);\n }\n else\n#endif\n /* In Terminal-Normal mode we are displaying the buffer, not the terminal\n * contents, thus no screen update is needed. */\n if (!term->tl_normal_mode)\n {\n\t// Don't use update_screen() when editing the command line, it gets\n\t// cleared.\n\t// TODO: only update once in a while.\n\tch_log(term->tl_job->jv_channel, \"updating screen\");\n\tif (buffer == curbuf && (State & CMDLINE) == 0)\n\t{\n\t update_screen(VALID_NO_UPDATE);\n\t /* update_screen() can be slow, check the terminal wasn't closed\n\t * already */\n\t if (buffer == curbuf && curbuf->b_term != NULL)\n\t\tupdate_cursor(curbuf->b_term, TRUE);\n\t}\n\telse\n\t redraw_after_callback(TRUE);\n }\n}\n\n/*\n * Send a mouse position and click to the vterm\n */\n static int\nterm_send_mouse(VTerm *vterm, int button, int pressed)\n{\n VTermModifier mod = VTERM_MOD_NONE;\n\n vterm_mouse_move(vterm, mouse_row - W_WINROW(curwin),\n\t\t\t\t\t mouse_col - curwin->w_wincol, mod);\n if (button != 0)\n\tvterm_mouse_button(vterm, button, pressed, mod);\n return TRUE;\n}\n\nstatic int enter_mouse_col = -1;\nstatic int enter_mouse_row = -1;\n\n/*\n * Handle a mouse click, drag or release.\n * Return TRUE when a mouse event is sent to the terminal.\n */\n static int\nterm_mouse_click(VTerm *vterm, int key)\n{\n#if defined(FEAT_CLIPBOARD)\n /* For modeless selection mouse drag and release events are ignored, unless\n * they are preceded with a mouse down event */\n static int\t ignore_drag_release = TRUE;\n VTermMouseState mouse_state;\n\n vterm_state_get_mousestate(vterm_obtain_state(vterm), &mouse_state);\n if (mouse_state.flags == 0)\n {\n\t/* Terminal is not using the mouse, use modeless selection. */\n\tswitch (key)\n\t{\n\tcase K_LEFTDRAG:\n\tcase K_LEFTRELEASE:\n\tcase K_RIGHTDRAG:\n\tcase K_RIGHTRELEASE:\n\t\t/* Ignore drag and release events when the button-down wasn't\n\t\t * seen before. */\n\t\tif (ignore_drag_release)\n\t\t{\n\t\t int save_mouse_col, save_mouse_row;\n\n\t\t if (enter_mouse_col < 0)\n\t\t\tbreak;\n\n\t\t /* mouse click in the window gave us focus, handle that\n\t\t * click now */\n\t\t save_mouse_col = mouse_col;\n\t\t save_mouse_row = mouse_row;\n\t\t mouse_col = enter_mouse_col;\n\t\t mouse_row = enter_mouse_row;\n\t\t clip_modeless(MOUSE_LEFT, TRUE, FALSE);\n\t\t mouse_col = save_mouse_col;\n\t\t mouse_row = save_mouse_row;\n\t\t}\n\t\t/* FALLTHROUGH */\n\tcase K_LEFTMOUSE:\n\tcase K_RIGHTMOUSE:\n\t\tif (key == K_LEFTRELEASE || key == K_RIGHTRELEASE)\n\t\t ignore_drag_release = TRUE;\n\t\telse\n\t\t ignore_drag_release = FALSE;\n\t\t/* Should we call mouse_has() here? */\n\t\tif (clip_star.available)\n\t\t{\n\t\t int\t button, is_click, is_drag;\n\n\t\t button = get_mouse_button(KEY2TERMCAP1(key),\n\t\t\t\t\t\t\t &is_click, &is_drag);\n\t\t if (mouse_model_popup() && button == MOUSE_LEFT\n\t\t\t\t\t && (mod_mask & MOD_MASK_SHIFT))\n\t\t {\n\t\t\t/* Translate shift-left to right button. */\n\t\t\tbutton = MOUSE_RIGHT;\n\t\t\tmod_mask &= ~MOD_MASK_SHIFT;\n\t\t }\n\t\t clip_modeless(button, is_click, is_drag);\n\t\t}\n\t\tbreak;\n\n\tcase K_MIDDLEMOUSE:\n\t\tif (clip_star.available)\n\t\t insert_reg('*', TRUE);\n\t\tbreak;\n\t}\n\tenter_mouse_col = -1;\n\treturn FALSE;\n }\n#endif\n enter_mouse_col = -1;\n\n switch (key)\n {\n\tcase K_LEFTMOUSE:\n\tcase K_LEFTMOUSE_NM:\tterm_send_mouse(vterm, 1, 1); break;\n\tcase K_LEFTDRAG:\tterm_send_mouse(vterm, 1, 1); break;\n\tcase K_LEFTRELEASE:\n\tcase K_LEFTRELEASE_NM:\tterm_send_mouse(vterm, 1, 0); break;\n\tcase K_MOUSEMOVE:\tterm_send_mouse(vterm, 0, 0); break;\n\tcase K_MIDDLEMOUSE:\tterm_send_mouse(vterm, 2, 1); break;\n\tcase K_MIDDLEDRAG:\tterm_send_mouse(vterm, 2, 1); break;\n\tcase K_MIDDLERELEASE:\tterm_send_mouse(vterm, 2, 0); break;\n\tcase K_RIGHTMOUSE:\tterm_send_mouse(vterm, 3, 1); break;\n\tcase K_RIGHTDRAG:\tterm_send_mouse(vterm, 3, 1); break;\n\tcase K_RIGHTRELEASE:\tterm_send_mouse(vterm, 3, 0); break;\n }\n return TRUE;\n}\n\n/*\n * Convert typed key \"c\" into bytes to send to the job.\n * Return the number of bytes in \"buf\".\n */\n static int\nterm_convert_key(term_T *term, int c, char *buf)\n{\n VTerm\t *vterm = term->tl_vterm;\n VTermKey\t key = VTERM_KEY_NONE;\n VTermModifier mod = VTERM_MOD_NONE;\n int\t\t other = FALSE;\n\n switch (c)\n {\n\t/* don't use VTERM_KEY_ENTER, it may do an unwanted conversion */\n\n\t\t\t\t/* don't use VTERM_KEY_BACKSPACE, it always\n\t\t\t\t * becomes 0x7f DEL */\n\tcase K_BS:\t\tc = term_backspace_char; break;\n\n\tcase ESC:\t\tkey = VTERM_KEY_ESCAPE; break;\n\tcase K_DEL:\t\tkey = VTERM_KEY_DEL; break;\n\tcase K_DOWN:\t\tkey = VTERM_KEY_DOWN; break;\n\tcase K_S_DOWN:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_DOWN; break;\n\tcase K_END:\t\tkey = VTERM_KEY_END; break;\n\tcase K_S_END:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_END; break;\n\tcase K_C_END:\t\tmod = VTERM_MOD_CTRL;\n\t\t\t\tkey = VTERM_KEY_END; break;\n\tcase K_F10:\t\tkey = VTERM_KEY_FUNCTION(10); break;\n\tcase K_F11:\t\tkey = VTERM_KEY_FUNCTION(11); break;\n\tcase K_F12:\t\tkey = VTERM_KEY_FUNCTION(12); break;\n\tcase K_F1:\t\tkey = VTERM_KEY_FUNCTION(1); break;\n\tcase K_F2:\t\tkey = VTERM_KEY_FUNCTION(2); break;\n\tcase K_F3:\t\tkey = VTERM_KEY_FUNCTION(3); break;\n\tcase K_F4:\t\tkey = VTERM_KEY_FUNCTION(4); break;\n\tcase K_F5:\t\tkey = VTERM_KEY_FUNCTION(5); break;\n\tcase K_F6:\t\tkey = VTERM_KEY_FUNCTION(6); break;\n\tcase K_F7:\t\tkey = VTERM_KEY_FUNCTION(7); break;\n\tcase K_F8:\t\tkey = VTERM_KEY_FUNCTION(8); break;\n\tcase K_F9:\t\tkey = VTERM_KEY_FUNCTION(9); break;\n\tcase K_HOME:\t\tkey = VTERM_KEY_HOME; break;\n\tcase K_S_HOME:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_HOME; break;\n\tcase K_C_HOME:\t\tmod = VTERM_MOD_CTRL;\n\t\t\t\tkey = VTERM_KEY_HOME; break;\n\tcase K_INS:\t\tkey = VTERM_KEY_INS; break;\n\tcase K_K0:\t\tkey = VTERM_KEY_KP_0; break;\n\tcase K_K1:\t\tkey = VTERM_KEY_KP_1; break;\n\tcase K_K2:\t\tkey = VTERM_KEY_KP_2; break;\n\tcase K_K3:\t\tkey = VTERM_KEY_KP_3; break;\n\tcase K_K4:\t\tkey = VTERM_KEY_KP_4; break;\n\tcase K_K5:\t\tkey = VTERM_KEY_KP_5; break;\n\tcase K_K6:\t\tkey = VTERM_KEY_KP_6; break;\n\tcase K_K7:\t\tkey = VTERM_KEY_KP_7; break;\n\tcase K_K8:\t\tkey = VTERM_KEY_KP_8; break;\n\tcase K_K9:\t\tkey = VTERM_KEY_KP_9; break;\n\tcase K_KDEL:\t\tkey = VTERM_KEY_DEL; break; /* TODO */\n\tcase K_KDIVIDE:\t\tkey = VTERM_KEY_KP_DIVIDE; break;\n\tcase K_KEND:\t\tkey = VTERM_KEY_KP_1; break; /* TODO */\n\tcase K_KENTER:\t\tkey = VTERM_KEY_KP_ENTER; break;\n\tcase K_KHOME:\t\tkey = VTERM_KEY_KP_7; break; /* TODO */\n\tcase K_KINS:\t\tkey = VTERM_KEY_KP_0; break; /* TODO */\n\tcase K_KMINUS:\t\tkey = VTERM_KEY_KP_MINUS; break;\n\tcase K_KMULTIPLY:\tkey = VTERM_KEY_KP_MULT; break;\n\tcase K_KPAGEDOWN:\tkey = VTERM_KEY_KP_3; break; /* TODO */\n\tcase K_KPAGEUP:\t\tkey = VTERM_KEY_KP_9; break; /* TODO */\n\tcase K_KPLUS:\t\tkey = VTERM_KEY_KP_PLUS; break;\n\tcase K_KPOINT:\t\tkey = VTERM_KEY_KP_PERIOD; break;\n\tcase K_LEFT:\t\tkey = VTERM_KEY_LEFT; break;\n\tcase K_S_LEFT:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_LEFT; break;\n\tcase K_C_LEFT:\t\tmod = VTERM_MOD_CTRL;\n\t\t\t\tkey = VTERM_KEY_LEFT; break;\n\tcase K_PAGEDOWN:\tkey = VTERM_KEY_PAGEDOWN; break;\n\tcase K_PAGEUP:\t\tkey = VTERM_KEY_PAGEUP; break;\n\tcase K_RIGHT:\t\tkey = VTERM_KEY_RIGHT; break;\n\tcase K_S_RIGHT:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_RIGHT; break;\n\tcase K_C_RIGHT:\t\tmod = VTERM_MOD_CTRL;\n\t\t\t\tkey = VTERM_KEY_RIGHT; break;\n\tcase K_UP:\t\tkey = VTERM_KEY_UP; break;\n\tcase K_S_UP:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_UP; break;\n\tcase TAB:\t\tkey = VTERM_KEY_TAB; break;\n\tcase K_S_TAB:\t\tmod = VTERM_MOD_SHIFT;\n\t\t\t\tkey = VTERM_KEY_TAB; break;\n\n\tcase K_MOUSEUP:\t\tother = term_send_mouse(vterm, 5, 1); break;\n\tcase K_MOUSEDOWN:\tother = term_send_mouse(vterm, 4, 1); break;\n\tcase K_MOUSELEFT:\t/* TODO */ return 0;\n\tcase K_MOUSERIGHT:\t/* TODO */ return 0;\n\n\tcase K_LEFTMOUSE:\n\tcase K_LEFTMOUSE_NM:\n\tcase K_LEFTDRAG:\n\tcase K_LEFTRELEASE:\n\tcase K_LEFTRELEASE_NM:\n\tcase K_MOUSEMOVE:\n\tcase K_MIDDLEMOUSE:\n\tcase K_MIDDLEDRAG:\n\tcase K_MIDDLERELEASE:\n\tcase K_RIGHTMOUSE:\n\tcase K_RIGHTDRAG:\n\tcase K_RIGHTRELEASE:\tif (!term_mouse_click(vterm, c))\n\t\t\t\t return 0;\n\t\t\t\tother = TRUE;\n\t\t\t\tbreak;\n\n\tcase K_X1MOUSE:\t\t/* TODO */ return 0;\n\tcase K_X1DRAG:\t\t/* TODO */ return 0;\n\tcase K_X1RELEASE:\t/* TODO */ return 0;\n\tcase K_X2MOUSE:\t\t/* TODO */ return 0;\n\tcase K_X2DRAG:\t\t/* TODO */ return 0;\n\tcase K_X2RELEASE:\t/* TODO */ return 0;\n\n\tcase K_IGNORE:\t\treturn 0;\n\tcase K_NOP:\t\treturn 0;\n\tcase K_UNDO:\t\treturn 0;\n\tcase K_HELP:\t\treturn 0;\n\tcase K_XF1:\t\tkey = VTERM_KEY_FUNCTION(1); break;\n\tcase K_XF2:\t\tkey = VTERM_KEY_FUNCTION(2); break;\n\tcase K_XF3:\t\tkey = VTERM_KEY_FUNCTION(3); break;\n\tcase K_XF4:\t\tkey = VTERM_KEY_FUNCTION(4); break;\n\tcase K_SELECT:\t\treturn 0;\n#ifdef FEAT_GUI\n\tcase K_VER_SCROLLBAR:\treturn 0;\n\tcase K_HOR_SCROLLBAR:\treturn 0;\n#endif\n#ifdef FEAT_GUI_TABLINE\n\tcase K_TABLINE:\t\treturn 0;\n\tcase K_TABMENU:\t\treturn 0;\n#endif\n#ifdef FEAT_NETBEANS_INTG\n\tcase K_F21:\t\tkey = VTERM_KEY_FUNCTION(21); break;\n#endif\n#ifdef FEAT_DND\n\tcase K_DROP:\t\treturn 0;\n#endif\n\tcase K_CURSORHOLD:\treturn 0;\n\tcase K_PS:\t\tvterm_keyboard_start_paste(vterm);\n\t\t\t\tother = TRUE;\n\t\t\t\tbreak;\n\tcase K_PE:\t\tvterm_keyboard_end_paste(vterm);\n\t\t\t\tother = TRUE;\n\t\t\t\tbreak;\n }\n\n /*\n * Convert special keys to vterm keys:\n * - Write keys to vterm: vterm_keyboard_key()\n * - Write output to channel.\n * TODO: use mod_mask\n */\n if (key != VTERM_KEY_NONE)\n\t/* Special key, let vterm convert it. */\n\tvterm_keyboard_key(vterm, key, mod);\n else if (!other)\n\t/* Normal character, let vterm convert it. */\n\tvterm_keyboard_unichar(vterm, c, mod);\n\n /* Read back the converted escape sequence. */\n return (int)vterm_output_read(vterm, buf, KEY_BUF_LEN);\n}\n\n/*\n * Return TRUE if the job for \"term\" is still running.\n * If \"check_job_status\" is TRUE update the job status.\n */\n static int\nterm_job_running_check(term_T *term, int check_job_status)\n{\n /* Also consider the job finished when the channel is closed, to avoid a\n * race condition when updating the title. */\n if (term != NULL\n\t&& term->tl_job != NULL\n\t&& channel_is_open(term->tl_job->jv_channel))\n {\n\tif (check_job_status)\n\t job_status(term->tl_job);\n\treturn (term->tl_job->jv_status == JOB_STARTED\n\t\t|| term->tl_job->jv_channel->ch_keep_open);\n }\n return FALSE;\n}\n\n/*\n * Return TRUE if the job for \"term\" is still running.\n */\n int\nterm_job_running(term_T *term)\n{\n return term_job_running_check(term, FALSE);\n}\n\n/*\n * Return TRUE if \"term\" has an active channel and used \":term NONE\".\n */\n int\nterm_none_open(term_T *term)\n{\n /* Also consider the job finished when the channel is closed, to avoid a\n * race condition when updating the title. */\n return term != NULL\n\t&& term->tl_job != NULL\n\t&& channel_is_open(term->tl_job->jv_channel)\n\t&& term->tl_job->jv_channel->ch_keep_open;\n}\n\n/*\n * Used when exiting: kill the job in \"buf\" if so desired.\n * Return OK when the job finished.\n * Return FAIL when the job is still running.\n */\n int\nterm_try_stop_job(buf_T *buf)\n{\n int\t count;\n char *how = (char *)buf->b_term->tl_kill;\n\n#if defined(FEAT_GUI_DIALOG) || defined(FEAT_CON_DIALOG)\n if ((how == NULL || *how == NUL) && (p_confirm || cmdmod.confirm))\n {\n\tchar_u\tbuff[DIALOG_MSG_SIZE];\n\tint\tret;\n\n\tdialog_msg(buff, _(\"Kill job in \\\"%s\\\"?\"), buf->b_fname);\n\tret = vim_dialog_yesnocancel(VIM_QUESTION, NULL, buff, 1);\n\tif (ret == VIM_YES)\n\t how = \"kill\";\n\telse if (ret == VIM_CANCEL)\n\t return FAIL;\n }\n#endif\n if (how == NULL || *how == NUL)\n\treturn FAIL;\n\n job_stop(buf->b_term->tl_job, NULL, how);\n\n /* wait for up to a second for the job to die */\n for (count = 0; count < 100; ++count)\n {\n\t/* buffer, terminal and job may be cleaned up while waiting */\n\tif (!buf_valid(buf)\n\t\t|| buf->b_term == NULL\n\t\t|| buf->b_term->tl_job == NULL)\n\t return OK;\n\n\t/* call job_status() to update jv_status */\n\tjob_status(buf->b_term->tl_job);\n\tif (buf->b_term->tl_job->jv_status >= JOB_ENDED)\n\t return OK;\n\tui_delay(10L, FALSE);\n\tmch_check_messages();\n\tparse_queued_messages();\n }\n return FAIL;\n}\n\n/*\n * Add the last line of the scrollback buffer to the buffer in the window.\n */\n static void\nadd_scrollback_line_to_buffer(term_T *term, char_u *text, int len)\n{\n buf_T\t*buf = term->tl_buffer;\n int\t\tempty = (buf->b_ml.ml_flags & ML_EMPTY);\n linenr_T\tlnum = buf->b_ml.ml_line_count;\n\n#ifdef WIN3264\n if (!enc_utf8 && enc_codepage > 0)\n {\n\tWCHAR *ret = NULL;\n\tint\tlength = 0;\n\n\tMultiByteToWideChar_alloc(CP_UTF8, 0, (char*)text, len + 1,\n\t\t\t\t\t\t\t &ret, &length);\n\tif (ret != NULL)\n\t{\n\t WideCharToMultiByte_alloc(enc_codepage, 0,\n\t\t\t\t ret, length, (char **)&text, &len, 0, 0);\n\t vim_free(ret);\n\t ml_append_buf(term->tl_buffer, lnum, text, len, FALSE);\n\t vim_free(text);\n\t}\n }\n else\n#endif\n\tml_append_buf(term->tl_buffer, lnum, text, len + 1, FALSE);\n if (empty)\n {\n\t/* Delete the empty line that was in the empty buffer. */\n\tcurbuf = buf;\n\tml_delete(1, FALSE);\n\tcurbuf = curwin->w_buffer;\n }\n}\n\n static void\ncell2cellattr(const VTermScreenCell *cell, cellattr_T *attr)\n{\n attr->width = cell->width;\n attr->attrs = cell->attrs;\n attr->fg = cell->fg;\n attr->bg = cell->bg;\n}\n\n static int\nequal_celattr(cellattr_T *a, cellattr_T *b)\n{\n /* Comparing the colors should be sufficient. */\n return a->fg.red == b->fg.red\n\t&& a->fg.green == b->fg.green\n\t&& a->fg.blue == b->fg.blue\n\t&& a->bg.red == b->bg.red\n\t&& a->bg.green == b->bg.green\n\t&& a->bg.blue == b->bg.blue;\n}\n\n/*\n * Add an empty scrollback line to \"term\". When \"lnum\" is not zero, add the\n * line at this position. Otherwise at the end.\n */\n static int\nadd_empty_scrollback(term_T *term, cellattr_T *fill_attr, int lnum)\n{\n if (ga_grow(&term->tl_scrollback, 1) == OK)\n {\n\tsb_line_T *line = (sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t + term->tl_scrollback.ga_len;\n\n\tif (lnum > 0)\n\t{\n\t int i;\n\n\t for (i = 0; i < term->tl_scrollback.ga_len - lnum; ++i)\n\t {\n\t\t*line = *(line - 1);\n\t\t--line;\n\t }\n\t}\n\tline->sb_cols = 0;\n\tline->sb_cells = NULL;\n\tline->sb_fill_attr = *fill_attr;\n\t++term->tl_scrollback.ga_len;\n\treturn OK;\n }\n return FALSE;\n}\n\n/*\n * Remove the terminal contents from the scrollback and the buffer.\n * Used before adding a new scrollback line or updating the buffer for lines\n * displayed in the terminal.\n */\n static void\ncleanup_scrollback(term_T *term)\n{\n sb_line_T\t*line;\n garray_T\t*gap;\n\n curbuf = term->tl_buffer;\n gap = &term->tl_scrollback;\n while (curbuf->b_ml.ml_line_count > term->tl_scrollback_scrolled\n\t\t\t\t\t\t\t && gap->ga_len > 0)\n {\n\tml_delete(curbuf->b_ml.ml_line_count, FALSE);\n\tline = (sb_line_T *)gap->ga_data + gap->ga_len - 1;\n\tvim_free(line->sb_cells);\n\t--gap->ga_len;\n }\n curbuf = curwin->w_buffer;\n if (curbuf == term->tl_buffer)\n\tcheck_cursor();\n}\n\n/*\n * Add the current lines of the terminal to scrollback and to the buffer.\n */\n static void\nupdate_snapshot(term_T *term)\n{\n VTermScreen\t *screen;\n int\t\t len;\n int\t\t lines_skipped = 0;\n VTermPos\t pos;\n VTermScreenCell cell;\n cellattr_T\t fill_attr, new_fill_attr;\n cellattr_T\t *p;\n\n ch_log(term->tl_job == NULL ? NULL : term->tl_job->jv_channel,\n\t\t\t\t \"Adding terminal window snapshot to buffer\");\n\n /* First remove the lines that were appended before, they might be\n * outdated. */\n cleanup_scrollback(term);\n\n screen = vterm_obtain_screen(term->tl_vterm);\n fill_attr = new_fill_attr = term->tl_default_color;\n for (pos.row = 0; pos.row < term->tl_rows; ++pos.row)\n {\n\tlen = 0;\n\tfor (pos.col = 0; pos.col < term->tl_cols; ++pos.col)\n\t if (vterm_screen_get_cell(screen, pos, &cell) != 0\n\t\t\t\t\t\t && cell.chars[0] != NUL)\n\t {\n\t\tlen = pos.col + 1;\n\t\tnew_fill_attr = term->tl_default_color;\n\t }\n\t else\n\t\t/* Assume the last attr is the filler attr. */\n\t\tcell2cellattr(&cell, &new_fill_attr);\n\n\tif (len == 0 && equal_celattr(&new_fill_attr, &fill_attr))\n\t ++lines_skipped;\n\telse\n\t{\n\t while (lines_skipped > 0)\n\t {\n\t\t/* Line was skipped, add an empty line. */\n\t\t--lines_skipped;\n\t\tif (add_empty_scrollback(term, &fill_attr, 0) == OK)\n\t\t add_scrollback_line_to_buffer(term, (char_u *)\"\", 0);\n\t }\n\n\t if (len == 0)\n\t\tp = NULL;\n\t else\n\t\tp = (cellattr_T *)alloc((int)sizeof(cellattr_T) * len);\n\t if ((p != NULL || len == 0)\n\t\t\t\t && ga_grow(&term->tl_scrollback, 1) == OK)\n\t {\n\t\tgarray_T ga;\n\t\tint\t width;\n\t\tsb_line_T *line = (sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t\t\t + term->tl_scrollback.ga_len;\n\n\t\tga_init2(&ga, 1, 100);\n\t\tfor (pos.col = 0; pos.col < len; pos.col += width)\n\t\t{\n\t\t if (vterm_screen_get_cell(screen, pos, &cell) == 0)\n\t\t {\n\t\t\twidth = 1;\n\t\t\tvim_memset(p + pos.col, 0, sizeof(cellattr_T));\n\t\t\tif (ga_grow(&ga, 1) == OK)\n\t\t\t ga.ga_len += utf_char2bytes(' ',\n\t\t\t\t\t (char_u *)ga.ga_data + ga.ga_len);\n\t\t }\n\t\t else\n\t\t {\n\t\t\twidth = cell.width;\n\n\t\t\tcell2cellattr(&cell, &p[pos.col]);\n\n\t\t\t// Each character can be up to 6 bytes.\n\t\t\tif (ga_grow(&ga, VTERM_MAX_CHARS_PER_CELL * 6) == OK)\n\t\t\t{\n\t\t\t int\t i;\n\t\t\t int\t c;\n\n\t\t\t for (i = 0; (c = cell.chars[i]) > 0 || i == 0; ++i)\n\t\t\t\tga.ga_len += utf_char2bytes(c == NUL ? ' ' : c,\n\t\t\t\t\t (char_u *)ga.ga_data + ga.ga_len);\n\t\t\t}\n\t\t }\n\t\t}\n\t\tline->sb_cols = len;\n\t\tline->sb_cells = p;\n\t\tline->sb_fill_attr = new_fill_attr;\n\t\tfill_attr = new_fill_attr;\n\t\t++term->tl_scrollback.ga_len;\n\n\t\tif (ga_grow(&ga, 1) == FAIL)\n\t\t add_scrollback_line_to_buffer(term, (char_u *)\"\", 0);\n\t\telse\n\t\t{\n\t\t *((char_u *)ga.ga_data + ga.ga_len) = NUL;\n\t\t add_scrollback_line_to_buffer(term, ga.ga_data, ga.ga_len);\n\t\t}\n\t\tga_clear(&ga);\n\t }\n\t else\n\t\tvim_free(p);\n\t}\n }\n\n // Add trailing empty lines.\n for (pos.row = term->tl_scrollback.ga_len;\n\t pos.row < term->tl_scrollback_scrolled + term->tl_cursor_pos.row;\n\t ++pos.row)\n {\n\tif (add_empty_scrollback(term, &fill_attr, 0) == OK)\n\t add_scrollback_line_to_buffer(term, (char_u *)\"\", 0);\n }\n\n term->tl_dirty_snapshot = FALSE;\n#ifdef FEAT_TIMERS\n term->tl_timer_set = FALSE;\n#endif\n}\n\n/*\n * If needed, add the current lines of the terminal to scrollback and to the\n * buffer. Called after the job has ended and when switching to\n * Terminal-Normal mode.\n * When \"redraw\" is TRUE redraw the windows that show the terminal.\n */\n static void\nmay_move_terminal_to_buffer(term_T *term, int redraw)\n{\n win_T\t *wp;\n\n if (term->tl_vterm == NULL)\n\treturn;\n\n /* Update the snapshot only if something changes or the buffer does not\n * have all the lines. */\n if (term->tl_dirty_snapshot || term->tl_buffer->b_ml.ml_line_count\n\t\t\t\t\t <= term->tl_scrollback_scrolled)\n\tupdate_snapshot(term);\n\n /* Obtain the current background color. */\n vterm_state_get_default_colors(vterm_obtain_state(term->tl_vterm),\n\t\t &term->tl_default_color.fg, &term->tl_default_color.bg);\n\n if (redraw)\n\tFOR_ALL_WINDOWS(wp)\n\t{\n\t if (wp->w_buffer == term->tl_buffer)\n\t {\n\t\twp->w_cursor.lnum = term->tl_buffer->b_ml.ml_line_count;\n\t\twp->w_cursor.col = 0;\n\t\twp->w_valid = 0;\n\t\tif (wp->w_cursor.lnum >= wp->w_height)\n\t\t{\n\t\t linenr_T min_topline = wp->w_cursor.lnum - wp->w_height + 1;\n\n\t\t if (wp->w_topline < min_topline)\n\t\t\twp->w_topline = min_topline;\n\t\t}\n\t\tredraw_win_later(wp, NOT_VALID);\n\t }\n\t}\n}\n\n#if defined(FEAT_TIMERS) || defined(PROTO)\n/*\n * Check if any terminal timer expired. If so, copy text from the terminal to\n * the buffer.\n * Return the time until the next timer will expire.\n */\n int\nterm_check_timers(int next_due_arg, proftime_T *now)\n{\n term_T *term;\n int\t next_due = next_due_arg;\n\n for (term = first_term; term != NULL; term = term->tl_next)\n {\n\tif (term->tl_timer_set && !term->tl_normal_mode)\n\t{\n\t long this_due = proftime_time_left(&term->tl_timer_due, now);\n\n\t if (this_due <= 1)\n\t {\n\t\tterm->tl_timer_set = FALSE;\n\t\tmay_move_terminal_to_buffer(term, FALSE);\n\t }\n\t else if (next_due == -1 || next_due > this_due)\n\t\tnext_due = this_due;\n\t}\n }\n\n return next_due;\n}\n#endif\n\n static void\nset_terminal_mode(term_T *term, int normal_mode)\n{\n term->tl_normal_mode = normal_mode;\n VIM_CLEAR(term->tl_status_text);\n if (term->tl_buffer == curbuf)\n\tmaketitle();\n}\n\n/*\n * Called after the job if finished and Terminal mode is not active:\n * Move the vterm contents into the scrollback buffer and free the vterm.\n */\n static void\ncleanup_vterm(term_T *term)\n{\n if (term->tl_finish != TL_FINISH_CLOSE)\n\tmay_move_terminal_to_buffer(term, TRUE);\n term_free_vterm(term);\n set_terminal_mode(term, FALSE);\n}\n\n/*\n * Switch from Terminal-Job mode to Terminal-Normal mode.\n * Suspends updating the terminal window.\n */\n static void\nterm_enter_normal_mode(void)\n{\n term_T *term = curbuf->b_term;\n\n set_terminal_mode(term, TRUE);\n\n /* Append the current terminal contents to the buffer. */\n may_move_terminal_to_buffer(term, TRUE);\n\n /* Move the window cursor to the position of the cursor in the\n * terminal. */\n curwin->w_cursor.lnum = term->tl_scrollback_scrolled\n\t\t\t\t\t + term->tl_cursor_pos.row + 1;\n check_cursor();\n if (coladvance(term->tl_cursor_pos.col) == FAIL)\n\tcoladvance(MAXCOL);\n\n /* Display the same lines as in the terminal. */\n curwin->w_topline = term->tl_scrollback_scrolled + 1;\n}\n\n/*\n * Returns TRUE if the current window contains a terminal and we are in\n * Terminal-Normal mode.\n */\n int\nterm_in_normal_mode(void)\n{\n term_T *term = curbuf->b_term;\n\n return term != NULL && term->tl_normal_mode;\n}\n\n/*\n * Switch from Terminal-Normal mode to Terminal-Job mode.\n * Restores updating the terminal window.\n */\n void\nterm_enter_job_mode()\n{\n term_T\t*term = curbuf->b_term;\n\n set_terminal_mode(term, FALSE);\n\n if (term->tl_channel_closed)\n\tcleanup_vterm(term);\n redraw_buf_and_status_later(curbuf, NOT_VALID);\n}\n\n/*\n * Get a key from the user with terminal mode mappings.\n * Note: while waiting a terminal may be closed and freed if the channel is\n * closed and ++close was used.\n */\n static int\nterm_vgetc()\n{\n int c;\n int save_State = State;\n\n State = TERMINAL;\n got_int = FALSE;\n#ifdef WIN3264\n ctrl_break_was_pressed = FALSE;\n#endif\n c = vgetc();\n got_int = FALSE;\n State = save_State;\n return c;\n}\n\nstatic int\tmouse_was_outside = FALSE;\n\n/*\n * Send keys to terminal.\n * Return FAIL when the key needs to be handled in Normal mode.\n * Return OK when the key was dropped or sent to the terminal.\n */\n int\nsend_keys_to_term(term_T *term, int c, int typed)\n{\n char\tmsg[KEY_BUF_LEN];\n size_t\tlen;\n int\t\tdragging_outside = FALSE;\n\n /* Catch keys that need to be handled as in Normal mode. */\n switch (c)\n {\n\tcase NUL:\n\tcase K_ZERO:\n\t if (typed)\n\t\tstuffcharReadbuff(c);\n\t return FAIL;\n\n\tcase K_TABLINE:\n\t stuffcharReadbuff(c);\n\t return FAIL;\n\n\tcase K_IGNORE:\n\tcase K_CANCEL: // used for :normal when running out of chars\n\t return FAIL;\n\n\tcase K_LEFTDRAG:\n\tcase K_MIDDLEDRAG:\n\tcase K_RIGHTDRAG:\n\tcase K_X1DRAG:\n\tcase K_X2DRAG:\n\t dragging_outside = mouse_was_outside;\n\t /* FALLTHROUGH */\n\tcase K_LEFTMOUSE:\n\tcase K_LEFTMOUSE_NM:\n\tcase K_LEFTRELEASE:\n\tcase K_LEFTRELEASE_NM:\n\tcase K_MOUSEMOVE:\n\tcase K_MIDDLEMOUSE:\n\tcase K_MIDDLERELEASE:\n\tcase K_RIGHTMOUSE:\n\tcase K_RIGHTRELEASE:\n\tcase K_X1MOUSE:\n\tcase K_X1RELEASE:\n\tcase K_X2MOUSE:\n\tcase K_X2RELEASE:\n\n\tcase K_MOUSEUP:\n\tcase K_MOUSEDOWN:\n\tcase K_MOUSELEFT:\n\tcase K_MOUSERIGHT:\n\t if (mouse_row < W_WINROW(curwin)\n\t\t || mouse_row >= (W_WINROW(curwin) + curwin->w_height)\n\t\t || mouse_col < curwin->w_wincol\n\t\t || mouse_col >= W_ENDCOL(curwin)\n\t\t || dragging_outside)\n\t {\n\t\t/* click or scroll outside the current window or on status line\n\t\t * or vertical separator */\n\t\tif (typed)\n\t\t{\n\t\t stuffcharReadbuff(c);\n\t\t mouse_was_outside = TRUE;\n\t\t}\n\t\treturn FAIL;\n\t }\n }\n if (typed)\n\tmouse_was_outside = FALSE;\n\n /* Convert the typed key to a sequence of bytes for the job. */\n len = term_convert_key(term, c, msg);\n if (len > 0)\n\t/* TODO: if FAIL is returned, stop? */\n\tchannel_send(term->tl_job->jv_channel, get_tty_part(term),\n\t\t\t\t\t\t(char_u *)msg, (int)len, NULL);\n\n return OK;\n}\n\n static void\nposition_cursor(win_T *wp, VTermPos *pos)\n{\n wp->w_wrow = MIN(pos->row, MAX(0, wp->w_height - 1));\n wp->w_wcol = MIN(pos->col, MAX(0, wp->w_width - 1));\n wp->w_valid |= (VALID_WCOL|VALID_WROW);\n}\n\n/*\n * Handle CTRL-W \"\": send register contents to the job.\n */\n static void\nterm_paste_register(int prev_c UNUSED)\n{\n int\t\tc;\n list_T\t*l;\n listitem_T\t*item;\n long\treglen = 0;\n int\t\ttype;\n\n#ifdef FEAT_CMDL_INFO\n if (add_to_showcmd(prev_c))\n if (add_to_showcmd('\"'))\n\tout_flush();\n#endif\n c = term_vgetc();\n#ifdef FEAT_CMDL_INFO\n clear_showcmd();\n#endif\n if (!term_use_loop())\n\t/* job finished while waiting for a character */\n\treturn;\n\n /* CTRL-W \"= prompt for expression to evaluate. */\n if (c == '=' && get_expr_register() != '=')\n\treturn;\n if (!term_use_loop())\n\t/* job finished while waiting for a character */\n\treturn;\n\n l = (list_T *)get_reg_contents(c, GREG_LIST);\n if (l != NULL)\n {\n\ttype = get_reg_type(c, ®len);\n\tfor (item = l->lv_first; item != NULL; item = item->li_next)\n\t{\n\t char_u *s = tv_get_string(&item->li_tv);\n#ifdef WIN3264\n\t char_u *tmp = s;\n\n\t if (!enc_utf8 && enc_codepage > 0)\n\t {\n\t\tWCHAR *ret = NULL;\n\t\tint\tlength = 0;\n\n\t\tMultiByteToWideChar_alloc(enc_codepage, 0, (char *)s,\n\t\t\t\t\t\t(int)STRLEN(s), &ret, &length);\n\t\tif (ret != NULL)\n\t\t{\n\t\t WideCharToMultiByte_alloc(CP_UTF8, 0,\n\t\t\t\t ret, length, (char **)&s, &length, 0, 0);\n\t\t vim_free(ret);\n\t\t}\n\t }\n#endif\n\t channel_send(curbuf->b_term->tl_job->jv_channel, PART_IN,\n\t\t\t\t\t\t s, (int)STRLEN(s), NULL);\n#ifdef WIN3264\n\t if (tmp != s)\n\t\tvim_free(s);\n#endif\n\n\t if (item->li_next != NULL || type == MLINE)\n\t\tchannel_send(curbuf->b_term->tl_job->jv_channel, PART_IN,\n\t\t\t\t\t\t (char_u *)\"\\r\", 1, NULL);\n\t}\n\tlist_free(l);\n }\n}\n\n/*\n * Return TRUE when waiting for a character in the terminal, the cursor of the\n * terminal should be displayed.\n */\n int\nterminal_is_active()\n{\n return in_terminal_loop != NULL;\n}\n\n#if defined(FEAT_GUI) || defined(PROTO)\n cursorentry_T *\nterm_get_cursor_shape(guicolor_T *fg, guicolor_T *bg)\n{\n term_T\t\t *term = in_terminal_loop;\n static cursorentry_T entry;\n int\t\t\t id;\n guicolor_T\t\tterm_fg, term_bg;\n\n vim_memset(&entry, 0, sizeof(entry));\n entry.shape = entry.mshape =\n\tterm->tl_cursor_shape == VTERM_PROP_CURSORSHAPE_UNDERLINE ? SHAPE_HOR :\n\tterm->tl_cursor_shape == VTERM_PROP_CURSORSHAPE_BAR_LEFT ? SHAPE_VER :\n\tSHAPE_BLOCK;\n entry.percentage = 20;\n if (term->tl_cursor_blink)\n {\n\tentry.blinkwait = 700;\n\tentry.blinkon = 400;\n\tentry.blinkoff = 250;\n }\n\n /* The \"Terminal\" highlight group overrules the defaults. */\n id = syn_name2id((char_u *)\"Terminal\");\n if (id != 0)\n {\n\tsyn_id2colors(id, &term_fg, &term_bg);\n\t*fg = term_bg;\n }\n else\n\t*fg = gui.back_pixel;\n\n if (term->tl_cursor_color == NULL)\n {\n\tif (id != 0)\n\t *bg = term_fg;\n\telse\n\t *bg = gui.norm_pixel;\n }\n else\n\t*bg = color_name2handle(term->tl_cursor_color);\n entry.name = \"n\";\n entry.used_for = SHAPE_CURSOR;\n\n return &entry;\n}\n#endif\n\n static void\nmay_output_cursor_props(void)\n{\n if (!cursor_color_equal(last_set_cursor_color, desired_cursor_color)\n\t || last_set_cursor_shape != desired_cursor_shape\n\t || last_set_cursor_blink != desired_cursor_blink)\n {\n\tcursor_color_copy(&last_set_cursor_color, desired_cursor_color);\n\tlast_set_cursor_shape = desired_cursor_shape;\n\tlast_set_cursor_blink = desired_cursor_blink;\n\tterm_cursor_color(cursor_color_get(desired_cursor_color));\n\tif (desired_cursor_shape == -1 || desired_cursor_blink == -1)\n\t /* this will restore the initial cursor style, if possible */\n\t ui_cursor_shape_forced(TRUE);\n\telse\n\t term_cursor_shape(desired_cursor_shape, desired_cursor_blink);\n }\n}\n\n/*\n * Set the cursor color and shape, if not last set to these.\n */\n static void\nmay_set_cursor_props(term_T *term)\n{\n#ifdef FEAT_GUI\n /* For the GUI the cursor properties are obtained with\n * term_get_cursor_shape(). */\n if (gui.in_use)\n\treturn;\n#endif\n if (in_terminal_loop == term)\n {\n\tcursor_color_copy(&desired_cursor_color, term->tl_cursor_color);\n\tdesired_cursor_shape = term->tl_cursor_shape;\n\tdesired_cursor_blink = term->tl_cursor_blink;\n\tmay_output_cursor_props();\n }\n}\n\n/*\n * Reset the desired cursor properties and restore them when needed.\n */\n static void\nprepare_restore_cursor_props(void)\n{\n#ifdef FEAT_GUI\n if (gui.in_use)\n\treturn;\n#endif\n cursor_color_copy(&desired_cursor_color, NULL);\n desired_cursor_shape = -1;\n desired_cursor_blink = -1;\n may_output_cursor_props();\n}\n\n/*\n * Returns TRUE if the current window contains a terminal and we are sending\n * keys to the job.\n * If \"check_job_status\" is TRUE update the job status.\n */\n static int\nterm_use_loop_check(int check_job_status)\n{\n term_T *term = curbuf->b_term;\n\n return term != NULL\n\t&& !term->tl_normal_mode\n\t&& term->tl_vterm != NULL\n\t&& term_job_running_check(term, check_job_status);\n}\n\n/*\n * Returns TRUE if the current window contains a terminal and we are sending\n * keys to the job.\n */\n int\nterm_use_loop(void)\n{\n return term_use_loop_check(FALSE);\n}\n\n/*\n * Called when entering a window with the mouse. If this is a terminal window\n * we may want to change state.\n */\n void\nterm_win_entered()\n{\n term_T *term = curbuf->b_term;\n\n if (term != NULL)\n {\n\tif (term_use_loop_check(TRUE))\n\t{\n\t reset_VIsual_and_resel();\n\t if (State & INSERT)\n\t\tstop_insert_mode = TRUE;\n\t}\n\tmouse_was_outside = FALSE;\n\tenter_mouse_col = mouse_col;\n\tenter_mouse_row = mouse_row;\n }\n}\n\n/*\n * Wait for input and send it to the job.\n * When \"blocking\" is TRUE wait for a character to be typed. Otherwise return\n * when there is no more typahead.\n * Return when the start of a CTRL-W command is typed or anything else that\n * should be handled as a Normal mode command.\n * Returns OK if a typed character is to be handled in Normal mode, FAIL if\n * the terminal was closed.\n */\n int\nterminal_loop(int blocking)\n{\n int\t\tc;\n int\t\ttermwinkey = 0;\n int\t\tret;\n#ifdef UNIX\n int\t\ttty_fd = curbuf->b_term->tl_job->jv_channel\n\t\t\t\t ->ch_part[get_tty_part(curbuf->b_term)].ch_fd;\n#endif\n int\t\trestore_cursor = FALSE;\n\n /* Remember the terminal we are sending keys to. However, the terminal\n * might be closed while waiting for a character, e.g. typing \"exit\" in a\n * shell and ++close was used. Therefore use curbuf->b_term instead of a\n * stored reference. */\n in_terminal_loop = curbuf->b_term;\n\n if (*curwin->w_p_twk != NUL)\n {\n\ttermwinkey = string_to_key(curwin->w_p_twk, TRUE);\n\tif (termwinkey == Ctrl_W)\n\t termwinkey = 0;\n }\n position_cursor(curwin, &curbuf->b_term->tl_cursor_pos);\n may_set_cursor_props(curbuf->b_term);\n\n while (blocking || vpeekc_nomap() != NUL)\n {\n#ifdef FEAT_GUI\n\tif (!curbuf->b_term->tl_system)\n#endif\n\t /* TODO: skip screen update when handling a sequence of keys. */\n\t /* Repeat redrawing in case a message is received while redrawing.\n\t */\n\t while (must_redraw != 0)\n\t\tif (update_screen(0) == FAIL)\n\t\t break;\n\tif (!term_use_loop_check(TRUE) || in_terminal_loop != curbuf->b_term)\n\t /* job finished while redrawing */\n\t break;\n\n\tupdate_cursor(curbuf->b_term, FALSE);\n\trestore_cursor = TRUE;\n\n\tc = term_vgetc();\n\tif (!term_use_loop_check(TRUE) || in_terminal_loop != curbuf->b_term)\n\t{\n\t /* Job finished while waiting for a character. Push back the\n\t * received character. */\n\t if (c != K_IGNORE)\n\t\tvungetc(c);\n\t break;\n\t}\n\tif (c == K_IGNORE)\n\t continue;\n\n#ifdef UNIX\n\t/*\n\t * The shell or another program may change the tty settings. Getting\n\t * them for every typed character is a bit of overhead, but it's needed\n\t * for the first character typed, e.g. when Vim starts in a shell.\n\t */\n\tif (isatty(tty_fd))\n\t{\n\t ttyinfo_T info;\n\n\t /* Get the current backspace character of the pty. */\n\t if (get_tty_info(tty_fd, &info) == OK)\n\t\tterm_backspace_char = info.backspace;\n\t}\n#endif\n\n#ifdef WIN3264\n\t/* On Windows winpty handles CTRL-C, don't send a CTRL_C_EVENT.\n\t * Use CTRL-BREAK to kill the job. */\n\tif (ctrl_break_was_pressed)\n\t mch_signal_job(curbuf->b_term->tl_job, (char_u *)\"kill\");\n#endif\n\t/* Was either CTRL-W (termwinkey) or CTRL-\\ pressed?\n\t * Not in a system terminal. */\n\tif ((c == (termwinkey == 0 ? Ctrl_W : termwinkey) || c == Ctrl_BSL)\n#ifdef FEAT_GUI\n\t\t&& !curbuf->b_term->tl_system\n#endif\n\t\t)\n\t{\n\t int\t prev_c = c;\n\n#ifdef FEAT_CMDL_INFO\n\t if (add_to_showcmd(c))\n\t\tout_flush();\n#endif\n\t c = term_vgetc();\n#ifdef FEAT_CMDL_INFO\n\t clear_showcmd();\n#endif\n\t if (!term_use_loop_check(TRUE)\n\t\t\t\t\t || in_terminal_loop != curbuf->b_term)\n\t\t/* job finished while waiting for a character */\n\t\tbreak;\n\n\t if (prev_c == Ctrl_BSL)\n\t {\n\t\tif (c == Ctrl_N)\n\t\t{\n\t\t /* CTRL-\\ CTRL-N : go to Terminal-Normal mode. */\n\t\t term_enter_normal_mode();\n\t\t ret = FAIL;\n\t\t goto theend;\n\t\t}\n\t\t/* Send both keys to the terminal. */\n\t\tsend_keys_to_term(curbuf->b_term, prev_c, TRUE);\n\t }\n\t else if (c == Ctrl_C)\n\t {\n\t\t/* \"CTRL-W CTRL-C\" or 'termwinkey' CTRL-C: end the job */\n\t\tmch_signal_job(curbuf->b_term->tl_job, (char_u *)\"kill\");\n\t }\n\t else if (c == '.')\n\t {\n\t\t/* \"CTRL-W .\": send CTRL-W to the job */\n\t\t/* \"'termwinkey' .\": send 'termwinkey' to the job */\n\t\tc = termwinkey == 0 ? Ctrl_W : termwinkey;\n\t }\n\t else if (c == Ctrl_BSL)\n\t {\n\t\t/* \"CTRL-W CTRL-\\\": send CTRL-\\ to the job */\n\t\tc = Ctrl_BSL;\n\t }\n\t else if (c == 'N')\n\t {\n\t\t/* CTRL-W N : go to Terminal-Normal mode. */\n\t\tterm_enter_normal_mode();\n\t\tret = FAIL;\n\t\tgoto theend;\n\t }\n\t else if (c == '\"')\n\t {\n\t\tterm_paste_register(prev_c);\n\t\tcontinue;\n\t }\n\t else if (termwinkey == 0 || c != termwinkey)\n\t {\n\t\tstuffcharReadbuff(Ctrl_W);\n\t\tstuffcharReadbuff(c);\n\t\tret = OK;\n\t\tgoto theend;\n\t }\n\t}\n# ifdef WIN3264\n\tif (!enc_utf8 && has_mbyte && c >= 0x80)\n\t{\n\t WCHAR wc;\n\t char_u mb[3];\n\n\t mb[0] = (unsigned)c >> 8;\n\t mb[1] = c;\n\t if (MultiByteToWideChar(GetACP(), 0, (char*)mb, 2, &wc, 1) > 0)\n\t\tc = wc;\n\t}\n# endif\n\tif (send_keys_to_term(curbuf->b_term, c, TRUE) != OK)\n\t{\n\t if (c == K_MOUSEMOVE)\n\t\t/* We are sure to come back here, don't reset the cursor color\n\t\t * and shape to avoid flickering. */\n\t\trestore_cursor = FALSE;\n\n\t ret = OK;\n\t goto theend;\n\t}\n }\n ret = FAIL;\n\ntheend:\n in_terminal_loop = NULL;\n if (restore_cursor)\n\tprepare_restore_cursor_props();\n\n /* Move a snapshot of the screen contents to the buffer, so that completion\n * works in other buffers. */\n if (curbuf->b_term != NULL && !curbuf->b_term->tl_normal_mode)\n\tmay_move_terminal_to_buffer(curbuf->b_term, FALSE);\n\n return ret;\n}\n\n/*\n * Called when a job has finished.\n * This updates the title and status, but does not close the vterm, because\n * there might still be pending output in the channel.\n */\n void\nterm_job_ended(job_T *job)\n{\n term_T *term;\n int\t did_one = FALSE;\n\n for (term = first_term; term != NULL; term = term->tl_next)\n\tif (term->tl_job == job)\n\t{\n\t VIM_CLEAR(term->tl_title);\n\t VIM_CLEAR(term->tl_status_text);\n\t redraw_buf_and_status_later(term->tl_buffer, VALID);\n\t did_one = TRUE;\n\t}\n if (did_one)\n\tredraw_statuslines();\n if (curbuf->b_term != NULL)\n {\n\tif (curbuf->b_term->tl_job == job)\n\t maketitle();\n\tupdate_cursor(curbuf->b_term, TRUE);\n }\n}\n\n static void\nmay_toggle_cursor(term_T *term)\n{\n if (in_terminal_loop == term)\n {\n\tif (term->tl_cursor_visible)\n\t cursor_on();\n\telse\n\t cursor_off();\n }\n}\n\n/*\n * Reverse engineer the RGB value into a cterm color index.\n * First color is 1. Return 0 if no match found (default color).\n */\n static int\ncolor2index(VTermColor *color, int fg, int *boldp)\n{\n int red = color->red;\n int blue = color->blue;\n int green = color->green;\n\n if (color->ansi_index != VTERM_ANSI_INDEX_NONE)\n {\n\t/* First 16 colors and default: use the ANSI index, because these\n\t * colors can be redefined. */\n\tif (t_colors >= 16)\n\t return color->ansi_index;\n\tswitch (color->ansi_index)\n\t{\n\t case 0: return 0;\n\t case 1: return lookup_color( 0, fg, boldp) + 1; /* black */\n\t case 2: return lookup_color( 4, fg, boldp) + 1; /* dark red */\n\t case 3: return lookup_color( 2, fg, boldp) + 1; /* dark green */\n\t case 4: return lookup_color( 6, fg, boldp) + 1; /* brown */\n\t case 5: return lookup_color( 1, fg, boldp) + 1; /* dark blue */\n\t case 6: return lookup_color( 5, fg, boldp) + 1; /* dark magenta */\n\t case 7: return lookup_color( 3, fg, boldp) + 1; /* dark cyan */\n\t case 8: return lookup_color( 8, fg, boldp) + 1; /* light grey */\n\t case 9: return lookup_color(12, fg, boldp) + 1; /* dark grey */\n\t case 10: return lookup_color(20, fg, boldp) + 1; /* red */\n\t case 11: return lookup_color(16, fg, boldp) + 1; /* green */\n\t case 12: return lookup_color(24, fg, boldp) + 1; /* yellow */\n\t case 13: return lookup_color(14, fg, boldp) + 1; /* blue */\n\t case 14: return lookup_color(22, fg, boldp) + 1; /* magenta */\n\t case 15: return lookup_color(18, fg, boldp) + 1; /* cyan */\n\t case 16: return lookup_color(26, fg, boldp) + 1; /* white */\n\t}\n }\n\n if (t_colors >= 256)\n {\n\tif (red == blue && red == green)\n\t{\n\t /* 24-color greyscale plus white and black */\n\t static int cutoff[23] = {\n\t\t 0x0D, 0x17, 0x21, 0x2B, 0x35, 0x3F, 0x49, 0x53, 0x5D, 0x67,\n\t\t 0x71, 0x7B, 0x85, 0x8F, 0x99, 0xA3, 0xAD, 0xB7, 0xC1, 0xCB,\n\t\t 0xD5, 0xDF, 0xE9};\n\t int i;\n\n\t if (red < 5)\n\t\treturn 17; /* 00/00/00 */\n\t if (red > 245) /* ff/ff/ff */\n\t\treturn 232;\n\t for (i = 0; i < 23; ++i)\n\t\tif (red < cutoff[i])\n\t\t return i + 233;\n\t return 256;\n\t}\n\t{\n\t static int cutoff[5] = {0x2F, 0x73, 0x9B, 0xC3, 0xEB};\n\t int ri, gi, bi;\n\n\t /* 216-color cube */\n\t for (ri = 0; ri < 5; ++ri)\n\t\tif (red < cutoff[ri])\n\t\t break;\n\t for (gi = 0; gi < 5; ++gi)\n\t\tif (green < cutoff[gi])\n\t\t break;\n\t for (bi = 0; bi < 5; ++bi)\n\t\tif (blue < cutoff[bi])\n\t\t break;\n\t return 17 + ri * 36 + gi * 6 + bi;\n\t}\n }\n return 0;\n}\n\n/*\n * Convert Vterm attributes to highlight flags.\n */\n static int\nvtermAttr2hl(VTermScreenCellAttrs cellattrs)\n{\n int attr = 0;\n\n if (cellattrs.bold)\n\tattr |= HL_BOLD;\n if (cellattrs.underline)\n\tattr |= HL_UNDERLINE;\n if (cellattrs.italic)\n\tattr |= HL_ITALIC;\n if (cellattrs.strike)\n\tattr |= HL_STRIKETHROUGH;\n if (cellattrs.reverse)\n\tattr |= HL_INVERSE;\n return attr;\n}\n\n/*\n * Store Vterm attributes in \"cell\" from highlight flags.\n */\n static void\nhl2vtermAttr(int attr, cellattr_T *cell)\n{\n vim_memset(&cell->attrs, 0, sizeof(VTermScreenCellAttrs));\n if (attr & HL_BOLD)\n\tcell->attrs.bold = 1;\n if (attr & HL_UNDERLINE)\n\tcell->attrs.underline = 1;\n if (attr & HL_ITALIC)\n\tcell->attrs.italic = 1;\n if (attr & HL_STRIKETHROUGH)\n\tcell->attrs.strike = 1;\n if (attr & HL_INVERSE)\n\tcell->attrs.reverse = 1;\n}\n\n/*\n * Convert the attributes of a vterm cell into an attribute index.\n */\n static int\ncell2attr(VTermScreenCellAttrs cellattrs, VTermColor cellfg, VTermColor cellbg)\n{\n int attr = vtermAttr2hl(cellattrs);\n\n#ifdef FEAT_GUI\n if (gui.in_use)\n {\n\tguicolor_T fg, bg;\n\n\tfg = gui_mch_get_rgb_color(cellfg.red, cellfg.green, cellfg.blue);\n\tbg = gui_mch_get_rgb_color(cellbg.red, cellbg.green, cellbg.blue);\n\treturn get_gui_attr_idx(attr, fg, bg);\n }\n else\n#endif\n#ifdef FEAT_TERMGUICOLORS\n if (p_tgc)\n {\n\tguicolor_T fg, bg;\n\n\tfg = gui_get_rgb_color_cmn(cellfg.red, cellfg.green, cellfg.blue);\n\tbg = gui_get_rgb_color_cmn(cellbg.red, cellbg.green, cellbg.blue);\n\n\treturn get_tgc_attr_idx(attr, fg, bg);\n }\n else\n#endif\n {\n\tint bold = MAYBE;\n\tint fg = color2index(&cellfg, TRUE, &bold);\n\tint bg = color2index(&cellbg, FALSE, &bold);\n\n\t/* Use the \"Terminal\" highlighting for the default colors. */\n\tif ((fg == 0 || bg == 0) && t_colors >= 16)\n\t{\n\t if (fg == 0 && term_default_cterm_fg >= 0)\n\t\tfg = term_default_cterm_fg + 1;\n\t if (bg == 0 && term_default_cterm_bg >= 0)\n\t\tbg = term_default_cterm_bg + 1;\n\t}\n\n\t/* with 8 colors set the bold attribute to get a bright foreground */\n\tif (bold == TRUE)\n\t attr |= HL_BOLD;\n\treturn get_cterm_attr_idx(attr, fg, bg);\n }\n return 0;\n}\n\n static void\nset_dirty_snapshot(term_T *term)\n{\n term->tl_dirty_snapshot = TRUE;\n#ifdef FEAT_TIMERS\n if (!term->tl_normal_mode)\n {\n\t/* Update the snapshot after 100 msec of not getting updates. */\n\tprofile_setlimit(100L, &term->tl_timer_due);\n\tterm->tl_timer_set = TRUE;\n }\n#endif\n}\n\n static int\nhandle_damage(VTermRect rect, void *user)\n{\n term_T *term = (term_T *)user;\n\n term->tl_dirty_row_start = MIN(term->tl_dirty_row_start, rect.start_row);\n term->tl_dirty_row_end = MAX(term->tl_dirty_row_end, rect.end_row);\n set_dirty_snapshot(term);\n redraw_buf_later(term->tl_buffer, SOME_VALID);\n return 1;\n}\n\n static void\nterm_scroll_up(term_T *term, int start_row, int count)\n{\n win_T\t\t *wp;\n VTermColor\t\t fg, bg;\n VTermScreenCellAttrs attr;\n int\t\t\t clear_attr;\n\n /* Set the color to clear lines with. */\n vterm_state_get_default_colors(vterm_obtain_state(term->tl_vterm),\n\t\t\t\t\t\t\t\t &fg, &bg);\n vim_memset(&attr, 0, sizeof(attr));\n clear_attr = cell2attr(attr, fg, bg);\n\n FOR_ALL_WINDOWS(wp)\n {\n\tif (wp->w_buffer == term->tl_buffer)\n\t win_del_lines(wp, start_row, count, FALSE, FALSE, clear_attr);\n }\n}\n\n static int\nhandle_moverect(VTermRect dest, VTermRect src, void *user)\n{\n term_T\t*term = (term_T *)user;\n int\t\tcount = src.start_row - dest.start_row;\n\n /* Scrolling up is done much more efficiently by deleting lines instead of\n * redrawing the text. But avoid doing this multiple times, postpone until\n * the redraw happens. */\n if (dest.start_col == src.start_col\n\t && dest.end_col == src.end_col\n\t && dest.start_row < src.start_row)\n {\n\tif (dest.start_row == 0)\n\t term->tl_postponed_scroll += count;\n\telse\n\t term_scroll_up(term, dest.start_row, count);\n }\n\n term->tl_dirty_row_start = MIN(term->tl_dirty_row_start, dest.start_row);\n term->tl_dirty_row_end = MIN(term->tl_dirty_row_end, dest.end_row);\n set_dirty_snapshot(term);\n\n /* Note sure if the scrolling will work correctly, let's do a complete\n * redraw later. */\n redraw_buf_later(term->tl_buffer, NOT_VALID);\n return 1;\n}\n\n static int\nhandle_movecursor(\n\tVTermPos pos,\n\tVTermPos oldpos UNUSED,\n\tint visible,\n\tvoid *user)\n{\n term_T\t*term = (term_T *)user;\n win_T\t*wp;\n\n term->tl_cursor_pos = pos;\n term->tl_cursor_visible = visible;\n\n FOR_ALL_WINDOWS(wp)\n {\n\tif (wp->w_buffer == term->tl_buffer)\n\t position_cursor(wp, &pos);\n }\n if (term->tl_buffer == curbuf && !term->tl_normal_mode)\n {\n\tmay_toggle_cursor(term);\n\tupdate_cursor(term, term->tl_cursor_visible);\n }\n\n return 1;\n}\n\n static int\nhandle_settermprop(\n\tVTermProp prop,\n\tVTermValue *value,\n\tvoid *user)\n{\n term_T\t*term = (term_T *)user;\n\n switch (prop)\n {\n\tcase VTERM_PROP_TITLE:\n\t vim_free(term->tl_title);\n\t /* a blank title isn't useful, make it empty, so that \"running\" is\n\t * displayed */\n\t if (*skipwhite((char_u *)value->string) == NUL)\n\t\tterm->tl_title = NULL;\n#ifdef WIN3264\n\t else if (!enc_utf8 && enc_codepage > 0)\n\t {\n\t\tWCHAR *ret = NULL;\n\t\tint\tlength = 0;\n\n\t\tMultiByteToWideChar_alloc(CP_UTF8, 0,\n\t\t\t(char*)value->string, (int)STRLEN(value->string),\n\t\t\t\t\t\t\t\t&ret, &length);\n\t\tif (ret != NULL)\n\t\t{\n\t\t WideCharToMultiByte_alloc(enc_codepage, 0,\n\t\t\t\t\tret, length, (char**)&term->tl_title,\n\t\t\t\t\t&length, 0, 0);\n\t\t vim_free(ret);\n\t\t}\n\t }\n#endif\n\t else\n\t\tterm->tl_title = vim_strsave((char_u *)value->string);\n\t VIM_CLEAR(term->tl_status_text);\n\t if (term == curbuf->b_term)\n\t\tmaketitle();\n\t break;\n\n\tcase VTERM_PROP_CURSORVISIBLE:\n\t term->tl_cursor_visible = value->boolean;\n\t may_toggle_cursor(term);\n\t out_flush();\n\t break;\n\n\tcase VTERM_PROP_CURSORBLINK:\n\t term->tl_cursor_blink = value->boolean;\n\t may_set_cursor_props(term);\n\t break;\n\n\tcase VTERM_PROP_CURSORSHAPE:\n\t term->tl_cursor_shape = value->number;\n\t may_set_cursor_props(term);\n\t break;\n\n\tcase VTERM_PROP_CURSORCOLOR:\n\t cursor_color_copy(&term->tl_cursor_color, (char_u*)value->string);\n\t may_set_cursor_props(term);\n\t break;\n\n\tcase VTERM_PROP_ALTSCREEN:\n\t /* TODO: do anything else? */\n\t term->tl_using_altscreen = value->boolean;\n\t break;\n\n\tdefault:\n\t break;\n }\n /* Always return 1, otherwise vterm doesn't store the value internally. */\n return 1;\n}\n\n/*\n * The job running in the terminal resized the terminal.\n */\n static int\nhandle_resize(int rows, int cols, void *user)\n{\n term_T\t*term = (term_T *)user;\n win_T\t*wp;\n\n term->tl_rows = rows;\n term->tl_cols = cols;\n if (term->tl_vterm_size_changed)\n\t/* Size was set by vterm_set_size(), don't set the window size. */\n\tterm->tl_vterm_size_changed = FALSE;\n else\n {\n\tFOR_ALL_WINDOWS(wp)\n\t{\n\t if (wp->w_buffer == term->tl_buffer)\n\t {\n\t\twin_setheight_win(rows, wp);\n\t\twin_setwidth_win(cols, wp);\n\t }\n\t}\n\tredraw_buf_later(term->tl_buffer, NOT_VALID);\n }\n return 1;\n}\n\n/*\n * Handle a line that is pushed off the top of the screen.\n */\n static int\nhandle_pushline(int cols, const VTermScreenCell *cells, void *user)\n{\n term_T\t*term = (term_T *)user;\n\n /* First remove the lines that were appended before, the pushed line goes\n * above it. */\n cleanup_scrollback(term);\n\n /* If the number of lines that are stored goes over 'termscrollback' then\n * delete the first 10%. */\n if (term->tl_scrollback.ga_len >= term->tl_buffer->b_p_twsl)\n {\n\tint\ttodo = term->tl_buffer->b_p_twsl / 10;\n\tint\ti;\n\n\tcurbuf = term->tl_buffer;\n\tfor (i = 0; i < todo; ++i)\n\t{\n\t vim_free(((sb_line_T *)term->tl_scrollback.ga_data + i)->sb_cells);\n\t ml_delete(1, FALSE);\n\t}\n\tcurbuf = curwin->w_buffer;\n\n\tterm->tl_scrollback.ga_len -= todo;\n\tmch_memmove(term->tl_scrollback.ga_data,\n\t (sb_line_T *)term->tl_scrollback.ga_data + todo,\n\t sizeof(sb_line_T) * term->tl_scrollback.ga_len);\n\tterm->tl_scrollback_scrolled -= todo;\n }\n\n if (ga_grow(&term->tl_scrollback, 1) == OK)\n {\n\tcellattr_T\t*p = NULL;\n\tint\t\tlen = 0;\n\tint\t\ti;\n\tint\t\tc;\n\tint\t\tcol;\n\tsb_line_T\t*line;\n\tgarray_T\tga;\n\tcellattr_T\tfill_attr = term->tl_default_color;\n\n\t/* do not store empty cells at the end */\n\tfor (i = 0; i < cols; ++i)\n\t if (cells[i].chars[0] != 0)\n\t\tlen = i + 1;\n\t else\n\t\tcell2cellattr(&cells[i], &fill_attr);\n\n\tga_init2(&ga, 1, 100);\n\tif (len > 0)\n\t p = (cellattr_T *)alloc((int)sizeof(cellattr_T) * len);\n\tif (p != NULL)\n\t{\n\t for (col = 0; col < len; col += cells[col].width)\n\t {\n\t\tif (ga_grow(&ga, MB_MAXBYTES) == FAIL)\n\t\t{\n\t\t ga.ga_len = 0;\n\t\t break;\n\t\t}\n\t\tfor (i = 0; (c = cells[col].chars[i]) > 0 || i == 0; ++i)\n\t\t ga.ga_len += utf_char2bytes(c == NUL ? ' ' : c,\n\t\t\t\t\t (char_u *)ga.ga_data + ga.ga_len);\n\t\tcell2cellattr(&cells[col], &p[col]);\n\t }\n\t}\n\tif (ga_grow(&ga, 1) == FAIL)\n\t add_scrollback_line_to_buffer(term, (char_u *)\"\", 0);\n\telse\n\t{\n\t *((char_u *)ga.ga_data + ga.ga_len) = NUL;\n\t add_scrollback_line_to_buffer(term, ga.ga_data, ga.ga_len);\n\t}\n\tga_clear(&ga);\n\n\tline = (sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t\t\t + term->tl_scrollback.ga_len;\n\tline->sb_cols = len;\n\tline->sb_cells = p;\n\tline->sb_fill_attr = fill_attr;\n\t++term->tl_scrollback.ga_len;\n\t++term->tl_scrollback_scrolled;\n }\n return 0; /* ignored */\n}\n\nstatic VTermScreenCallbacks screen_callbacks = {\n handle_damage,\t/* damage */\n handle_moverect,\t/* moverect */\n handle_movecursor,\t/* movecursor */\n handle_settermprop,\t/* settermprop */\n NULL,\t\t\t/* bell */\n handle_resize,\t/* resize */\n handle_pushline,\t/* sb_pushline */\n NULL\t\t\t/* sb_popline */\n};\n\n/*\n * Do the work after the channel of a terminal was closed.\n * Must be called only when updating_screen is FALSE.\n * Returns TRUE when a buffer was closed (list of terminals may have changed).\n */\n static int\nterm_after_channel_closed(term_T *term)\n{\n /* Unless in Terminal-Normal mode: clear the vterm. */\n if (!term->tl_normal_mode)\n {\n\tint\tfnum = term->tl_buffer->b_fnum;\n\n\tcleanup_vterm(term);\n\n\tif (term->tl_finish == TL_FINISH_CLOSE)\n\t{\n\t aco_save_T\taco;\n\t int\t\tdo_set_w_closing = term->tl_buffer->b_nwindows == 0;\n\n\t // ++close or term_finish == \"close\"\n\t ch_log(NULL, \"terminal job finished, closing window\");\n\t aucmd_prepbuf(&aco, term->tl_buffer);\n\t // Avoid closing the window if we temporarily use it.\n\t if (do_set_w_closing)\n\t\tcurwin->w_closing = TRUE;\n\t do_bufdel(DOBUF_WIPE, (char_u *)\"\", 1, fnum, fnum, FALSE);\n\t if (do_set_w_closing)\n\t\tcurwin->w_closing = FALSE;\n\t aucmd_restbuf(&aco);\n\t return TRUE;\n\t}\n\tif (term->tl_finish == TL_FINISH_OPEN\n\t\t\t\t && term->tl_buffer->b_nwindows == 0)\n\t{\n\t char buf[50];\n\n\t /* TODO: use term_opencmd */\n\t ch_log(NULL, \"terminal job finished, opening window\");\n\t vim_snprintf(buf, sizeof(buf),\n\t\t term->tl_opencmd == NULL\n\t\t\t ? \"botright sbuf %d\"\n\t\t\t : (char *)term->tl_opencmd, fnum);\n\t do_cmdline_cmd((char_u *)buf);\n\t}\n\telse\n\t ch_log(NULL, \"terminal job finished\");\n }\n\n redraw_buf_and_status_later(term->tl_buffer, NOT_VALID);\n return FALSE;\n}\n\n/*\n * Called when a channel has been closed.\n * If this was a channel for a terminal window then finish it up.\n */\n void\nterm_channel_closed(channel_T *ch)\n{\n term_T *term;\n term_T *next_term;\n int\t did_one = FALSE;\n\n for (term = first_term; term != NULL; term = next_term)\n {\n\tnext_term = term->tl_next;\n\tif (term->tl_job == ch->ch_job)\n\t{\n\t term->tl_channel_closed = TRUE;\n\t did_one = TRUE;\n\n\t VIM_CLEAR(term->tl_title);\n\t VIM_CLEAR(term->tl_status_text);\n#ifdef WIN3264\n\t if (term->tl_out_fd != NULL)\n\t {\n\t\tfclose(term->tl_out_fd);\n\t\tterm->tl_out_fd = NULL;\n\t }\n#endif\n\n\t if (updating_screen)\n\t {\n\t\t/* Cannot open or close windows now. Can happen when\n\t\t * 'lazyredraw' is set. */\n\t\tterm->tl_channel_recently_closed = TRUE;\n\t\tcontinue;\n\t }\n\n\t if (term_after_channel_closed(term))\n\t\tnext_term = first_term;\n\t}\n }\n\n if (did_one)\n {\n\tredraw_statuslines();\n\n\t/* Need to break out of vgetc(). */\n\tins_char_typebuf(K_IGNORE);\n\ttypebuf_was_filled = TRUE;\n\n\tterm = curbuf->b_term;\n\tif (term != NULL)\n\t{\n\t if (term->tl_job == ch->ch_job)\n\t\tmaketitle();\n\t update_cursor(term, term->tl_cursor_visible);\n\t}\n }\n}\n\n/*\n * To be called after resetting updating_screen: handle any terminal where the\n * channel was closed.\n */\n void\nterm_check_channel_closed_recently()\n{\n term_T *term;\n term_T *next_term;\n\n for (term = first_term; term != NULL; term = next_term)\n {\n\tnext_term = term->tl_next;\n\tif (term->tl_channel_recently_closed)\n\t{\n\t term->tl_channel_recently_closed = FALSE;\n\t if (term_after_channel_closed(term))\n\t\t// start over, the list may have changed\n\t\tnext_term = first_term;\n\t}\n }\n}\n\n/*\n * Fill one screen line from a line of the terminal.\n * Advances \"pos\" to past the last column.\n */\n static void\nterm_line2screenline(VTermScreen *screen, VTermPos *pos, int max_col)\n{\n int off = screen_get_current_line_off();\n\n for (pos->col = 0; pos->col < max_col; )\n {\n\tVTermScreenCell cell;\n\tint\t\tc;\n\n\tif (vterm_screen_get_cell(screen, *pos, &cell) == 0)\n\t vim_memset(&cell, 0, sizeof(cell));\n\n\tc = cell.chars[0];\n\tif (c == NUL)\n\t{\n\t ScreenLines[off] = ' ';\n\t if (enc_utf8)\n\t\tScreenLinesUC[off] = NUL;\n\t}\n\telse\n\t{\n\t if (enc_utf8)\n\t {\n\t\tint i;\n\n\t\t/* composing chars */\n\t\tfor (i = 0; i < Screen_mco\n\t\t\t && i + 1 < VTERM_MAX_CHARS_PER_CELL; ++i)\n\t\t{\n\t\t ScreenLinesC[i][off] = cell.chars[i + 1];\n\t\t if (cell.chars[i + 1] == 0)\n\t\t\tbreak;\n\t\t}\n\t\tif (c >= 0x80 || (Screen_mco > 0\n\t\t\t\t\t && ScreenLinesC[0][off] != 0))\n\t\t{\n\t\t ScreenLines[off] = ' ';\n\t\t ScreenLinesUC[off] = c;\n\t\t}\n\t\telse\n\t\t{\n\t\t ScreenLines[off] = c;\n\t\t ScreenLinesUC[off] = NUL;\n\t\t}\n\t }\n#ifdef WIN3264\n\t else if (has_mbyte && c >= 0x80)\n\t {\n\t\tchar_u\tmb[MB_MAXBYTES+1];\n\t\tWCHAR\twc = c;\n\n\t\tif (WideCharToMultiByte(GetACP(), 0, &wc, 1,\n\t\t\t\t\t (char*)mb, 2, 0, 0) > 1)\n\t\t{\n\t\t ScreenLines[off] = mb[0];\n\t\t ScreenLines[off + 1] = mb[1];\n\t\t cell.width = mb_ptr2cells(mb);\n\t\t}\n\t\telse\n\t\t ScreenLines[off] = c;\n\t }\n#endif\n\t else\n\t\tScreenLines[off] = c;\n\t}\n\tScreenAttrs[off] = cell2attr(cell.attrs, cell.fg, cell.bg);\n\n\t++pos->col;\n\t++off;\n\tif (cell.width == 2)\n\t{\n\t if (enc_utf8)\n\t\tScreenLinesUC[off] = NUL;\n\n\t /* don't set the second byte to NUL for a DBCS encoding, it\n\t * has been set above */\n\t if (enc_utf8 || !has_mbyte)\n\t\tScreenLines[off] = NUL;\n\n\t ++pos->col;\n\t ++off;\n\t}\n }\n}\n\n#if defined(FEAT_GUI)\n static void\nupdate_system_term(term_T *term)\n{\n VTermPos\t pos;\n VTermScreen\t *screen;\n\n if (term->tl_vterm == NULL)\n\treturn;\n screen = vterm_obtain_screen(term->tl_vterm);\n\n /* Scroll up to make more room for terminal lines if needed. */\n while (term->tl_toprow > 0\n\t\t\t && (Rows - term->tl_toprow) < term->tl_dirty_row_end)\n {\n\tint save_p_more = p_more;\n\n\tp_more = FALSE;\n\tmsg_row = Rows - 1;\n\tmsg_puts((char_u *)\"\\n\");\n\tp_more = save_p_more;\n\t--term->tl_toprow;\n }\n\n for (pos.row = term->tl_dirty_row_start; pos.row < term->tl_dirty_row_end\n\t\t\t\t\t\t && pos.row < Rows; ++pos.row)\n {\n\tif (pos.row < term->tl_rows)\n\t{\n\t int max_col = MIN(Columns, term->tl_cols);\n\n\t term_line2screenline(screen, &pos, max_col);\n\t}\n\telse\n\t pos.col = 0;\n\n\tscreen_line(term->tl_toprow + pos.row, 0, pos.col, Columns, FALSE);\n }\n\n term->tl_dirty_row_start = MAX_ROW;\n term->tl_dirty_row_end = 0;\n update_cursor(term, TRUE);\n}\n#endif\n\n/*\n * Return TRUE if window \"wp\" is to be redrawn with term_update_window().\n * Returns FALSE when there is no terminal running in this window or it is in\n * Terminal-Normal mode.\n */\n int\nterm_do_update_window(win_T *wp)\n{\n term_T\t*term = wp->w_buffer->b_term;\n\n return term != NULL && term->tl_vterm != NULL && !term->tl_normal_mode;\n}\n\n/*\n * Called to update a window that contains an active terminal.\n */\n void\nterm_update_window(win_T *wp)\n{\n term_T\t*term = wp->w_buffer->b_term;\n VTerm\t*vterm;\n VTermScreen *screen;\n VTermState\t*state;\n VTermPos\tpos;\n int\t\trows, cols;\n int\t\tnewrows, newcols;\n int\t\tminsize;\n win_T\t*twp;\n\n vterm = term->tl_vterm;\n screen = vterm_obtain_screen(vterm);\n state = vterm_obtain_state(vterm);\n\n /* We use NOT_VALID on a resize or scroll, redraw everything then. With\n * SOME_VALID only redraw what was marked dirty. */\n if (wp->w_redr_type > SOME_VALID)\n {\n\tterm->tl_dirty_row_start = 0;\n\tterm->tl_dirty_row_end = MAX_ROW;\n\n\tif (term->tl_postponed_scroll > 0\n\t\t\t && term->tl_postponed_scroll < term->tl_rows / 3)\n\t /* Scrolling is usually faster than redrawing, when there are only\n\t * a few lines to scroll. */\n\t term_scroll_up(term, 0, term->tl_postponed_scroll);\n\tterm->tl_postponed_scroll = 0;\n }\n\n /*\n * If the window was resized a redraw will be triggered and we get here.\n * Adjust the size of the vterm unless 'termwinsize' specifies a fixed size.\n */\n minsize = parse_termwinsize(wp, &rows, &cols);\n\n newrows = 99999;\n newcols = 99999;\n FOR_ALL_WINDOWS(twp)\n {\n\t/* When more than one window shows the same terminal, use the\n\t * smallest size. */\n\tif (twp->w_buffer == term->tl_buffer)\n\t{\n\t newrows = MIN(newrows, twp->w_height);\n\t newcols = MIN(newcols, twp->w_width);\n\t}\n }\n newrows = rows == 0 ? newrows : minsize ? MAX(rows, newrows) : rows;\n newcols = cols == 0 ? newcols : minsize ? MAX(cols, newcols) : cols;\n\n if (term->tl_rows != newrows || term->tl_cols != newcols)\n {\n\tterm->tl_vterm_size_changed = TRUE;\n\tvterm_set_size(vterm, newrows, newcols);\n\tch_log(term->tl_job->jv_channel, \"Resizing terminal to %d lines\",\n\t\t\t\t\t\t\t\t newrows);\n\tterm_report_winsize(term, newrows, newcols);\n\n\t// Updating the terminal size will cause the snapshot to be cleared.\n\t// When not in terminal_loop() we need to restore it.\n\tif (term != in_terminal_loop)\n\t may_move_terminal_to_buffer(term, FALSE);\n }\n\n /* The cursor may have been moved when resizing. */\n vterm_state_get_cursorpos(state, &pos);\n position_cursor(wp, &pos);\n\n for (pos.row = term->tl_dirty_row_start; pos.row < term->tl_dirty_row_end\n\t\t\t\t\t && pos.row < wp->w_height; ++pos.row)\n {\n\tif (pos.row < term->tl_rows)\n\t{\n\t int max_col = MIN(wp->w_width, term->tl_cols);\n\n\t term_line2screenline(screen, &pos, max_col);\n\t}\n\telse\n\t pos.col = 0;\n\n\tscreen_line(wp->w_winrow + pos.row\n#ifdef FEAT_MENU\n\t\t\t\t+ winbar_height(wp)\n#endif\n\t\t\t\t, wp->w_wincol, pos.col, wp->w_width, FALSE);\n }\n term->tl_dirty_row_start = MAX_ROW;\n term->tl_dirty_row_end = 0;\n}\n\n/*\n * Return TRUE if \"wp\" is a terminal window where the job has finished.\n */\n int\nterm_is_finished(buf_T *buf)\n{\n return buf->b_term != NULL && buf->b_term->tl_vterm == NULL;\n}\n\n/*\n * Return TRUE if \"wp\" is a terminal window where the job has finished or we\n * are in Terminal-Normal mode, thus we show the buffer contents.\n */\n int\nterm_show_buffer(buf_T *buf)\n{\n term_T *term = buf->b_term;\n\n return term != NULL && (term->tl_vterm == NULL || term->tl_normal_mode);\n}\n\n/*\n * The current buffer is going to be changed. If there is terminal\n * highlighting remove it now.\n */\n void\nterm_change_in_curbuf(void)\n{\n term_T *term = curbuf->b_term;\n\n if (term_is_finished(curbuf) && term->tl_scrollback.ga_len > 0)\n {\n\tfree_scrollback(term);\n\tredraw_buf_later(term->tl_buffer, NOT_VALID);\n\n\t/* The buffer is now like a normal buffer, it cannot be easily\n\t * abandoned when changed. */\n\tset_string_option_direct((char_u *)\"buftype\", -1,\n\t\t\t\t\t (char_u *)\"\", OPT_FREE|OPT_LOCAL, 0);\n }\n}\n\n/*\n * Get the screen attribute for a position in the buffer.\n * Use a negative \"col\" to get the filler background color.\n */\n int\nterm_get_attr(buf_T *buf, linenr_T lnum, int col)\n{\n term_T\t*term = buf->b_term;\n sb_line_T\t*line;\n cellattr_T\t*cellattr;\n\n if (lnum > term->tl_scrollback.ga_len)\n\tcellattr = &term->tl_default_color;\n else\n {\n\tline = (sb_line_T *)term->tl_scrollback.ga_data + lnum - 1;\n\tif (col < 0 || col >= line->sb_cols)\n\t cellattr = &line->sb_fill_attr;\n\telse\n\t cellattr = line->sb_cells + col;\n }\n return cell2attr(cellattr->attrs, cellattr->fg, cellattr->bg);\n}\n\n/*\n * Convert a cterm color number 0 - 255 to RGB.\n * This is compatible with xterm.\n */\n static void\ncterm_color2vterm(int nr, VTermColor *rgb)\n{\n cterm_color2rgb(nr, &rgb->red, &rgb->green, &rgb->blue, &rgb->ansi_index);\n}\n\n/*\n * Initialize term->tl_default_color from the environment.\n */\n static void\ninit_default_colors(term_T *term)\n{\n VTermColor\t *fg, *bg;\n int\t\t fgval, bgval;\n int\t\t id;\n\n vim_memset(&term->tl_default_color.attrs, 0, sizeof(VTermScreenCellAttrs));\n term->tl_default_color.width = 1;\n fg = &term->tl_default_color.fg;\n bg = &term->tl_default_color.bg;\n\n /* Vterm uses a default black background. Set it to white when\n * 'background' is \"light\". */\n if (*p_bg == 'l')\n {\n\tfgval = 0;\n\tbgval = 255;\n }\n else\n {\n\tfgval = 255;\n\tbgval = 0;\n }\n fg->red = fg->green = fg->blue = fgval;\n bg->red = bg->green = bg->blue = bgval;\n fg->ansi_index = bg->ansi_index = VTERM_ANSI_INDEX_DEFAULT;\n\n /* The \"Terminal\" highlight group overrules the defaults. */\n id = syn_name2id((char_u *)\"Terminal\");\n\n /* Use the actual color for the GUI and when 'termguicolors' is set. */\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS)\n if (0\n# ifdef FEAT_GUI\n\t || gui.in_use\n# endif\n# ifdef FEAT_TERMGUICOLORS\n\t || p_tgc\n# ifdef FEAT_VTP\n\t /* Finally get INVALCOLOR on this execution path */\n\t || (!p_tgc && t_colors >= 256)\n# endif\n# endif\n )\n {\n\tguicolor_T\tfg_rgb = INVALCOLOR;\n\tguicolor_T\tbg_rgb = INVALCOLOR;\n\n\tif (id != 0)\n\t syn_id2colors(id, &fg_rgb, &bg_rgb);\n\n# ifdef FEAT_GUI\n\tif (gui.in_use)\n\t{\n\t if (fg_rgb == INVALCOLOR)\n\t\tfg_rgb = gui.norm_pixel;\n\t if (bg_rgb == INVALCOLOR)\n\t\tbg_rgb = gui.back_pixel;\n\t}\n# ifdef FEAT_TERMGUICOLORS\n\telse\n# endif\n# endif\n# ifdef FEAT_TERMGUICOLORS\n\t{\n\t if (fg_rgb == INVALCOLOR)\n\t\tfg_rgb = cterm_normal_fg_gui_color;\n\t if (bg_rgb == INVALCOLOR)\n\t\tbg_rgb = cterm_normal_bg_gui_color;\n\t}\n# endif\n\tif (fg_rgb != INVALCOLOR)\n\t{\n\t long_u rgb = GUI_MCH_GET_RGB(fg_rgb);\n\n\t fg->red = (unsigned)(rgb >> 16);\n\t fg->green = (unsigned)(rgb >> 8) & 255;\n\t fg->blue = (unsigned)rgb & 255;\n\t}\n\tif (bg_rgb != INVALCOLOR)\n\t{\n\t long_u rgb = GUI_MCH_GET_RGB(bg_rgb);\n\n\t bg->red = (unsigned)(rgb >> 16);\n\t bg->green = (unsigned)(rgb >> 8) & 255;\n\t bg->blue = (unsigned)rgb & 255;\n\t}\n }\n else\n#endif\n if (id != 0 && t_colors >= 16)\n {\n\tif (term_default_cterm_fg >= 0)\n\t cterm_color2vterm(term_default_cterm_fg, fg);\n\tif (term_default_cterm_bg >= 0)\n\t cterm_color2vterm(term_default_cterm_bg, bg);\n }\n else\n {\n#if defined(WIN3264) && !defined(FEAT_GUI_W32)\n\tint tmp;\n#endif\n\n\t/* In an MS-Windows console we know the normal colors. */\n\tif (cterm_normal_fg_color > 0)\n\t{\n\t cterm_color2vterm(cterm_normal_fg_color - 1, fg);\n# if defined(WIN3264) && !defined(FEAT_GUI_W32)\n\t tmp = fg->red;\n\t fg->red = fg->blue;\n\t fg->blue = tmp;\n# endif\n\t}\n# ifdef FEAT_TERMRESPONSE\n\telse\n\t term_get_fg_color(&fg->red, &fg->green, &fg->blue);\n# endif\n\n\tif (cterm_normal_bg_color > 0)\n\t{\n\t cterm_color2vterm(cterm_normal_bg_color - 1, bg);\n# if defined(WIN3264) && !defined(FEAT_GUI_W32)\n\t tmp = bg->red;\n\t bg->red = bg->blue;\n\t bg->blue = tmp;\n# endif\n\t}\n# ifdef FEAT_TERMRESPONSE\n\telse\n\t term_get_bg_color(&bg->red, &bg->green, &bg->blue);\n# endif\n }\n}\n\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS)\n/*\n * Set the 16 ANSI colors from array of RGB values\n */\n static void\nset_vterm_palette(VTerm *vterm, long_u *rgb)\n{\n int\t\tindex = 0;\n VTermState\t*state = vterm_obtain_state(vterm);\n\n for (; index < 16; index++)\n {\n\tVTermColor\tcolor;\n\tcolor.red = (unsigned)(rgb[index] >> 16);\n\tcolor.green = (unsigned)(rgb[index] >> 8) & 255;\n\tcolor.blue = (unsigned)rgb[index] & 255;\n\tvterm_state_set_palette_color(state, index, &color);\n }\n}\n\n/*\n * Set the ANSI color palette from a list of colors\n */\n static int\nset_ansi_colors_list(VTerm *vterm, list_T *list)\n{\n int\t\tn = 0;\n long_u\trgb[16];\n listitem_T\t*li = list->lv_first;\n\n for (; li != NULL && n < 16; li = li->li_next, n++)\n {\n\tchar_u\t\t*color_name;\n\tguicolor_T\tguicolor;\n\n\tcolor_name = tv_get_string_chk(&li->li_tv);\n\tif (color_name == NULL)\n\t return FAIL;\n\n\tguicolor = GUI_GET_COLOR(color_name);\n\tif (guicolor == INVALCOLOR)\n\t return FAIL;\n\n\trgb[n] = GUI_MCH_GET_RGB(guicolor);\n }\n\n if (n != 16 || li != NULL)\n\treturn FAIL;\n\n set_vterm_palette(vterm, rgb);\n\n return OK;\n}\n\n/*\n * Initialize the ANSI color palette from g:terminal_ansi_colors[0:15]\n */\n static void\ninit_vterm_ansi_colors(VTerm *vterm)\n{\n dictitem_T\t*var = find_var((char_u *)\"g:terminal_ansi_colors\", NULL, TRUE);\n\n if (var != NULL\n\t && (var->di_tv.v_type != VAR_LIST\n\t\t|| var->di_tv.vval.v_list == NULL\n\t\t|| set_ansi_colors_list(vterm, var->di_tv.vval.v_list) == FAIL))\n\tEMSG2(_(e_invarg2), \"g:terminal_ansi_colors\");\n}\n#endif\n\n/*\n * Handles a \"drop\" command from the job in the terminal.\n * \"item\" is the file name, \"item->li_next\" may have options.\n */\n static void\nhandle_drop_command(listitem_T *item)\n{\n char_u\t*fname = tv_get_string(&item->li_tv);\n listitem_T\t*opt_item = item->li_next;\n int\t\tbufnr;\n win_T\t*wp;\n tabpage_T *tp;\n exarg_T\tea;\n char_u\t*tofree = NULL;\n\n bufnr = buflist_add(fname, BLN_LISTED | BLN_NOOPT);\n FOR_ALL_TAB_WINDOWS(tp, wp)\n {\n\tif (wp->w_buffer->b_fnum == bufnr)\n\t{\n\t /* buffer is in a window already, go there */\n\t goto_tabpage_win(tp, wp);\n\t return;\n\t}\n }\n\n vim_memset(&ea, 0, sizeof(ea));\n\n if (opt_item != NULL && opt_item->li_tv.v_type == VAR_DICT\n\t\t\t\t\t&& opt_item->li_tv.vval.v_dict != NULL)\n {\n\tdict_T *dict = opt_item->li_tv.vval.v_dict;\n\tchar_u *p;\n\n\tp = dict_get_string(dict, (char_u *)\"ff\", FALSE);\n\tif (p == NULL)\n\t p = dict_get_string(dict, (char_u *)\"fileformat\", FALSE);\n\tif (p != NULL)\n\t{\n\t if (check_ff_value(p) == FAIL)\n\t\tch_log(NULL, \"Invalid ff argument to drop: %s\", p);\n\t else\n\t\tea.force_ff = *p;\n\t}\n\tp = dict_get_string(dict, (char_u *)\"enc\", FALSE);\n\tif (p == NULL)\n\t p = dict_get_string(dict, (char_u *)\"encoding\", FALSE);\n\tif (p != NULL)\n\t{\n\t ea.cmd = alloc((int)STRLEN(p) + 12);\n\t if (ea.cmd != NULL)\n\t {\n\t\tsprintf((char *)ea.cmd, \"sbuf ++enc=%s\", p);\n\t\tea.force_enc = 11;\n\t\ttofree = ea.cmd;\n\t }\n\t}\n\n\tp = dict_get_string(dict, (char_u *)\"bad\", FALSE);\n\tif (p != NULL)\n\t get_bad_opt(p, &ea);\n\n\tif (dict_find(dict, (char_u *)\"bin\", -1) != NULL)\n\t ea.force_bin = FORCE_BIN;\n\tif (dict_find(dict, (char_u *)\"binary\", -1) != NULL)\n\t ea.force_bin = FORCE_BIN;\n\tif (dict_find(dict, (char_u *)\"nobin\", -1) != NULL)\n\t ea.force_bin = FORCE_NOBIN;\n\tif (dict_find(dict, (char_u *)\"nobinary\", -1) != NULL)\n\t ea.force_bin = FORCE_NOBIN;\n }\n\n /* open in new window, like \":split fname\" */\n if (ea.cmd == NULL)\n\tea.cmd = (char_u *)\"split\";\n ea.arg = fname;\n ea.cmdidx = CMD_split;\n ex_splitview(&ea);\n\n vim_free(tofree);\n}\n\n/*\n * Handles a function call from the job running in a terminal.\n * \"item\" is the function name, \"item->li_next\" has the arguments.\n */\n static void\nhandle_call_command(term_T *term, channel_T *channel, listitem_T *item)\n{\n char_u\t*func;\n typval_T\targvars[2];\n typval_T\trettv;\n int\t\tdoesrange;\n\n if (item->li_next == NULL)\n {\n\tch_log(channel, \"Missing function arguments for call\");\n\treturn;\n }\n func = tv_get_string(&item->li_tv);\n\n if (STRNCMP(func, \"Tapi_\", 5) != 0)\n {\n\tch_log(channel, \"Invalid function name: %s\", func);\n\treturn;\n }\n\n argvars[0].v_type = VAR_NUMBER;\n argvars[0].vval.v_number = term->tl_buffer->b_fnum;\n argvars[1] = item->li_next->li_tv;\n if (call_func(func, (int)STRLEN(func), &rettv,\n\t\t2, argvars, /* argv_func */ NULL,\n\t\t/* firstline */ 1, /* lastline */ 1,\n\t\t&doesrange, /* evaluate */ TRUE,\n\t\t/* partial */ NULL, /* selfdict */ NULL) == OK)\n {\n\tclear_tv(&rettv);\n\tch_log(channel, \"Function %s called\", func);\n }\n else\n\tch_log(channel, \"Calling function %s failed\", func);\n}\n\n/*\n * Called by libvterm when it cannot recognize an OSC sequence.\n * We recognize a terminal API command.\n */\n static int\nparse_osc(const char *command, size_t cmdlen, void *user)\n{\n term_T\t*term = (term_T *)user;\n js_read_T\treader;\n typval_T\ttv;\n channel_T\t*channel = term->tl_job == NULL ? NULL\n\t\t\t\t\t\t : term->tl_job->jv_channel;\n\n /* We recognize only OSC 5 1 ; {command} */\n if (cmdlen < 3 || STRNCMP(command, \"51;\", 3) != 0)\n\treturn 0; /* not handled */\n\n reader.js_buf = vim_strnsave((char_u *)command + 3, (int)(cmdlen - 3));\n if (reader.js_buf == NULL)\n\treturn 1;\n reader.js_fill = NULL;\n reader.js_used = 0;\n if (json_decode(&reader, &tv, 0) == OK\n\t && tv.v_type == VAR_LIST\n\t && tv.vval.v_list != NULL)\n {\n\tlistitem_T *item = tv.vval.v_list->lv_first;\n\n\tif (item == NULL)\n\t ch_log(channel, \"Missing command\");\n\telse\n\t{\n\t char_u\t*cmd = tv_get_string(&item->li_tv);\n\n\t /* Make sure an invoked command doesn't delete the buffer (and the\n\t * terminal) under our fingers. */\n\t ++term->tl_buffer->b_locked;\n\n\t item = item->li_next;\n\t if (item == NULL)\n\t\tch_log(channel, \"Missing argument for %s\", cmd);\n\t else if (STRCMP(cmd, \"drop\") == 0)\n\t\thandle_drop_command(item);\n\t else if (STRCMP(cmd, \"call\") == 0)\n\t\thandle_call_command(term, channel, item);\n\t else\n\t\tch_log(channel, \"Invalid command received: %s\", cmd);\n\t --term->tl_buffer->b_locked;\n\t}\n }\n else\n\tch_log(channel, \"Invalid JSON received\");\n\n vim_free(reader.js_buf);\n clear_tv(&tv);\n return 1;\n}\n\nstatic VTermParserCallbacks parser_fallbacks = {\n NULL,\t\t/* text */\n NULL,\t\t/* control */\n NULL,\t\t/* escape */\n NULL,\t\t/* csi */\n parse_osc,\t/* osc */\n NULL,\t\t/* dcs */\n NULL\t\t/* resize */\n};\n\n/*\n * Use Vim's allocation functions for vterm so profiling works.\n */\n static void *\nvterm_malloc(size_t size, void *data UNUSED)\n{\n return alloc_clear((unsigned) size);\n}\n\n static void\nvterm_memfree(void *ptr, void *data UNUSED)\n{\n vim_free(ptr);\n}\n\nstatic VTermAllocatorFunctions vterm_allocator = {\n &vterm_malloc,\n &vterm_memfree\n};\n\n/*\n * Create a new vterm and initialize it.\n * Return FAIL when out of memory.\n */\n static int\ncreate_vterm(term_T *term, int rows, int cols)\n{\n VTerm\t *vterm;\n VTermScreen\t *screen;\n VTermState\t *state;\n VTermValue\t value;\n\n vterm = vterm_new_with_allocator(rows, cols, &vterm_allocator, NULL);\n term->tl_vterm = vterm;\n if (vterm == NULL)\n\treturn FAIL;\n\n // Allocate screen and state here, so we can bail out if that fails.\n state = vterm_obtain_state(vterm);\n screen = vterm_obtain_screen(vterm);\n if (state == NULL || screen == NULL)\n {\n\tvterm_free(vterm);\n\treturn FAIL;\n }\n\n vterm_screen_set_callbacks(screen, &screen_callbacks, term);\n /* TODO: depends on 'encoding'. */\n vterm_set_utf8(vterm, 1);\n\n init_default_colors(term);\n\n vterm_state_set_default_colors(\n\t state,\n\t &term->tl_default_color.fg,\n\t &term->tl_default_color.bg);\n\n if (t_colors >= 16)\n\tvterm_state_set_bold_highbright(vterm_obtain_state(vterm), 1);\n\n /* Required to initialize most things. */\n vterm_screen_reset(screen, 1 /* hard */);\n\n /* Allow using alternate screen. */\n vterm_screen_enable_altscreen(screen, 1);\n\n /* For unix do not use a blinking cursor. In an xterm this causes the\n * cursor to blink if it's blinking in the xterm.\n * For Windows we respect the system wide setting. */\n#ifdef WIN3264\n if (GetCaretBlinkTime() == INFINITE)\n\tvalue.boolean = 0;\n else\n\tvalue.boolean = 1;\n#else\n value.boolean = 0;\n#endif\n vterm_state_set_termprop(state, VTERM_PROP_CURSORBLINK, &value);\n vterm_state_set_unrecognised_fallbacks(state, &parser_fallbacks, term);\n\n return OK;\n}\n\n/*\n * Return the text to show for the buffer name and status.\n */\n char_u *\nterm_get_status_text(term_T *term)\n{\n if (term->tl_status_text == NULL)\n {\n\tchar_u *txt;\n\tsize_t len;\n\n\tif (term->tl_normal_mode)\n\t{\n\t if (term_job_running(term))\n\t\ttxt = (char_u *)_(\"Terminal\");\n\t else\n\t\ttxt = (char_u *)_(\"Terminal-finished\");\n\t}\n\telse if (term->tl_title != NULL)\n\t txt = term->tl_title;\n\telse if (term_none_open(term))\n\t txt = (char_u *)_(\"active\");\n\telse if (term_job_running(term))\n\t txt = (char_u *)_(\"running\");\n\telse\n\t txt = (char_u *)_(\"finished\");\n\tlen = 9 + STRLEN(term->tl_buffer->b_fname) + STRLEN(txt);\n\tterm->tl_status_text = alloc((int)len);\n\tif (term->tl_status_text != NULL)\n\t vim_snprintf((char *)term->tl_status_text, len, \"%s [%s]\",\n\t\t\t\t\t\tterm->tl_buffer->b_fname, txt);\n }\n return term->tl_status_text;\n}\n\n/*\n * Mark references in jobs of terminals.\n */\n int\nset_ref_in_term(int copyID)\n{\n int\t\tabort = FALSE;\n term_T\t*term;\n typval_T\ttv;\n\n for (term = first_term; term != NULL; term = term->tl_next)\n\tif (term->tl_job != NULL)\n\t{\n\t tv.v_type = VAR_JOB;\n\t tv.vval.v_job = term->tl_job;\n\t abort = abort || set_ref_in_item(&tv, copyID, NULL, NULL);\n\t}\n return abort;\n}\n\n/*\n * Cache \"Terminal\" highlight group colors.\n */\n void\nset_terminal_default_colors(int cterm_fg, int cterm_bg)\n{\n term_default_cterm_fg = cterm_fg - 1;\n term_default_cterm_bg = cterm_bg - 1;\n}\n\n/*\n * Get the buffer from the first argument in \"argvars\".\n * Returns NULL when the buffer is not for a terminal window and logs a message\n * with \"where\".\n */\n static buf_T *\nterm_get_buf(typval_T *argvars, char *where)\n{\n buf_T *buf;\n\n (void)tv_get_number(&argvars[0]);\t /* issue errmsg if type error */\n ++emsg_off;\n buf = get_buf_tv(&argvars[0], FALSE);\n --emsg_off;\n if (buf == NULL || buf->b_term == NULL)\n {\n\tch_log(NULL, \"%s: invalid buffer argument\", where);\n\treturn NULL;\n }\n return buf;\n}\n\n static int\nsame_color(VTermColor *a, VTermColor *b)\n{\n return a->red == b->red\n\t&& a->green == b->green\n\t&& a->blue == b->blue\n\t&& a->ansi_index == b->ansi_index;\n}\n\n static void\ndump_term_color(FILE *fd, VTermColor *color)\n{\n fprintf(fd, \"%02x%02x%02x%d\",\n\t (int)color->red, (int)color->green, (int)color->blue,\n\t (int)color->ansi_index);\n}\n\n/*\n * \"term_dumpwrite(buf, filename, options)\" function\n *\n * Each screen cell in full is:\n * |{characters}+{attributes}#{fg-color}{color-idx}#{bg-color}{color-idx}\n * {characters} is a space for an empty cell\n * For a double-width character \"+\" is changed to \"*\" and the next cell is\n * skipped.\n * {attributes} is the decimal value of HL_BOLD + HL_UNDERLINE, etc.\n *\t\t\t when \"&\" use the same as the previous cell.\n * {fg-color} is hex RGB, when \"&\" use the same as the previous cell.\n * {bg-color} is hex RGB, when \"&\" use the same as the previous cell.\n * {color-idx} is a number from 0 to 255\n *\n * Screen cell with same width, attributes and color as the previous one:\n * |{characters}\n *\n * To use the color of the previous cell, use \"&\" instead of {color}-{idx}.\n *\n * Repeating the previous screen cell:\n * @{count}\n */\n void\nf_term_dumpwrite(typval_T *argvars, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_dumpwrite()\");\n term_T\t*term;\n char_u\t*fname;\n int\t\tmax_height = 0;\n int\t\tmax_width = 0;\n stat_T\tst;\n FILE\t*fd;\n VTermPos\tpos;\n VTermScreen *screen;\n VTermScreenCell prev_cell;\n VTermState\t*state;\n VTermPos\tcursor_pos;\n\n if (check_restricted() || check_secure())\n\treturn;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n if (term->tl_vterm == NULL)\n {\n\tEMSG(_(\"E958: Job already finished\"));\n\treturn;\n }\n\n if (argvars[2].v_type != VAR_UNKNOWN)\n {\n\tdict_T *d;\n\n\tif (argvars[2].v_type != VAR_DICT)\n\t{\n\t EMSG(_(e_dictreq));\n\t return;\n\t}\n\td = argvars[2].vval.v_dict;\n\tif (d != NULL)\n\t{\n\t max_height = dict_get_number(d, (char_u *)\"rows\");\n\t max_width = dict_get_number(d, (char_u *)\"columns\");\n\t}\n }\n\n fname = tv_get_string_chk(&argvars[1]);\n if (fname == NULL)\n\treturn;\n if (mch_stat((char *)fname, &st) >= 0)\n {\n\tEMSG2(_(\"E953: File exists: %s\"), fname);\n\treturn;\n }\n\n if (*fname == NUL || (fd = mch_fopen((char *)fname, WRITEBIN)) == NULL)\n {\n\tEMSG2(_(e_notcreate), *fname == NUL ? (char_u *)_(\"\") : fname);\n\treturn;\n }\n\n vim_memset(&prev_cell, 0, sizeof(prev_cell));\n\n screen = vterm_obtain_screen(term->tl_vterm);\n state = vterm_obtain_state(term->tl_vterm);\n vterm_state_get_cursorpos(state, &cursor_pos);\n\n for (pos.row = 0; (max_height == 0 || pos.row < max_height)\n\t\t\t\t\t && pos.row < term->tl_rows; ++pos.row)\n {\n\tint\t\trepeat = 0;\n\n\tfor (pos.col = 0; (max_width == 0 || pos.col < max_width)\n\t\t\t\t\t && pos.col < term->tl_cols; ++pos.col)\n\t{\n\t VTermScreenCell cell;\n\t int\t\t same_attr;\n\t int\t\t same_chars = TRUE;\n\t int\t\t i;\n\t int\t\t is_cursor_pos = (pos.col == cursor_pos.col\n\t\t\t\t\t\t && pos.row == cursor_pos.row);\n\n\t if (vterm_screen_get_cell(screen, pos, &cell) == 0)\n\t\tvim_memset(&cell, 0, sizeof(cell));\n\n\t for (i = 0; i < VTERM_MAX_CHARS_PER_CELL; ++i)\n\t {\n\t\tint c = cell.chars[i];\n\t\tint pc = prev_cell.chars[i];\n\n\t\t/* For the first character NUL is the same as space. */\n\t\tif (i == 0)\n\t\t{\n\t\t c = (c == NUL) ? ' ' : c;\n\t\t pc = (pc == NUL) ? ' ' : pc;\n\t\t}\n\t\tif (c != pc)\n\t\t same_chars = FALSE;\n\t\tif (c == NUL || pc == NUL)\n\t\t break;\n\t }\n\t same_attr = vtermAttr2hl(cell.attrs)\n\t\t\t\t\t == vtermAttr2hl(prev_cell.attrs)\n\t\t\t&& same_color(&cell.fg, &prev_cell.fg)\n\t\t\t&& same_color(&cell.bg, &prev_cell.bg);\n\t if (same_chars && cell.width == prev_cell.width && same_attr\n\t\t\t\t\t\t\t && !is_cursor_pos)\n\t {\n\t\t++repeat;\n\t }\n\t else\n\t {\n\t\tif (repeat > 0)\n\t\t{\n\t\t fprintf(fd, \"@%d\", repeat);\n\t\t repeat = 0;\n\t\t}\n\t\tfputs(is_cursor_pos ? \">\" : \"|\", fd);\n\n\t\tif (cell.chars[0] == NUL)\n\t\t fputs(\" \", fd);\n\t\telse\n\t\t{\n\t\t char_u\tcharbuf[10];\n\t\t int\t\tlen;\n\n\t\t for (i = 0; i < VTERM_MAX_CHARS_PER_CELL\n\t\t\t\t\t\t && cell.chars[i] != NUL; ++i)\n\t\t {\n\t\t\tlen = utf_char2bytes(cell.chars[i], charbuf);\n\t\t\tfwrite(charbuf, len, 1, fd);\n\t\t }\n\t\t}\n\n\t\t/* When only the characters differ we don't write anything, the\n\t\t * following \"|\", \"@\" or NL will indicate using the same\n\t\t * attributes. */\n\t\tif (cell.width != prev_cell.width || !same_attr)\n\t\t{\n\t\t if (cell.width == 2)\n\t\t {\n\t\t\tfputs(\"*\", fd);\n\t\t\t++pos.col;\n\t\t }\n\t\t else\n\t\t\tfputs(\"+\", fd);\n\n\t\t if (same_attr)\n\t\t {\n\t\t\tfputs(\"&\", fd);\n\t\t }\n\t\t else\n\t\t {\n\t\t\tfprintf(fd, \"%d\", vtermAttr2hl(cell.attrs));\n\t\t\tif (same_color(&cell.fg, &prev_cell.fg))\n\t\t\t fputs(\"&\", fd);\n\t\t\telse\n\t\t\t{\n\t\t\t fputs(\"#\", fd);\n\t\t\t dump_term_color(fd, &cell.fg);\n\t\t\t}\n\t\t\tif (same_color(&cell.bg, &prev_cell.bg))\n\t\t\t fputs(\"&\", fd);\n\t\t\telse\n\t\t\t{\n\t\t\t fputs(\"#\", fd);\n\t\t\t dump_term_color(fd, &cell.bg);\n\t\t\t}\n\t\t }\n\t\t}\n\n\t\tprev_cell = cell;\n\t }\n\t}\n\tif (repeat > 0)\n\t fprintf(fd, \"@%d\", repeat);\n\tfputs(\"\\n\", fd);\n }\n\n fclose(fd);\n}\n\n/*\n * Called when a dump is corrupted. Put a breakpoint here when debugging.\n */\n static void\ndump_is_corrupt(garray_T *gap)\n{\n ga_concat(gap, (char_u *)\"CORRUPT\");\n}\n\n static void\nappend_cell(garray_T *gap, cellattr_T *cell)\n{\n if (ga_grow(gap, 1) == OK)\n {\n\t*(((cellattr_T *)gap->ga_data) + gap->ga_len) = *cell;\n\t++gap->ga_len;\n }\n}\n\n/*\n * Read the dump file from \"fd\" and append lines to the current buffer.\n * Return the cell width of the longest line.\n */\n static int\nread_dump_file(FILE *fd, VTermPos *cursor_pos)\n{\n int\t\t c;\n garray_T\t ga_text;\n garray_T\t ga_cell;\n char_u\t *prev_char = NULL;\n int\t\t attr = 0;\n cellattr_T\t cell;\n term_T\t *term = curbuf->b_term;\n int\t\t max_cells = 0;\n int\t\t start_row = term->tl_scrollback.ga_len;\n\n ga_init2(&ga_text, 1, 90);\n ga_init2(&ga_cell, sizeof(cellattr_T), 90);\n vim_memset(&cell, 0, sizeof(cell));\n cursor_pos->row = -1;\n cursor_pos->col = -1;\n\n c = fgetc(fd);\n for (;;)\n {\n\tif (c == EOF)\n\t break;\n\tif (c == '\\r')\n\t{\n\t // DOS line endings? Ignore.\n\t c = fgetc(fd);\n\t}\n\telse if (c == '\\n')\n\t{\n\t /* End of a line: append it to the buffer. */\n\t if (ga_text.ga_data == NULL)\n\t\tdump_is_corrupt(&ga_text);\n\t if (ga_grow(&term->tl_scrollback, 1) == OK)\n\t {\n\t\tsb_line_T *line = (sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t\t\t + term->tl_scrollback.ga_len;\n\n\t\tif (max_cells < ga_cell.ga_len)\n\t\t max_cells = ga_cell.ga_len;\n\t\tline->sb_cols = ga_cell.ga_len;\n\t\tline->sb_cells = ga_cell.ga_data;\n\t\tline->sb_fill_attr = term->tl_default_color;\n\t\t++term->tl_scrollback.ga_len;\n\t\tga_init(&ga_cell);\n\n\t\tga_append(&ga_text, NUL);\n\t\tml_append(curbuf->b_ml.ml_line_count, ga_text.ga_data,\n\t\t\t\t\t\t\tga_text.ga_len, FALSE);\n\t }\n\t else\n\t\tga_clear(&ga_cell);\n\t ga_text.ga_len = 0;\n\n\t c = fgetc(fd);\n\t}\n\telse if (c == '|' || c == '>')\n\t{\n\t int prev_len = ga_text.ga_len;\n\n\t if (c == '>')\n\t {\n\t\tif (cursor_pos->row != -1)\n\t\t dump_is_corrupt(&ga_text);\t/* duplicate cursor */\n\t\tcursor_pos->row = term->tl_scrollback.ga_len - start_row;\n\t\tcursor_pos->col = ga_cell.ga_len;\n\t }\n\n\t /* normal character(s) followed by \"+\", \"*\", \"|\", \"@\" or NL */\n\t c = fgetc(fd);\n\t if (c != EOF)\n\t\tga_append(&ga_text, c);\n\t for (;;)\n\t {\n\t\tc = fgetc(fd);\n\t\tif (c == '+' || c == '*' || c == '|' || c == '>' || c == '@'\n\t\t\t\t\t\t || c == EOF || c == '\\n')\n\t\t break;\n\t\tga_append(&ga_text, c);\n\t }\n\n\t /* save the character for repeating it */\n\t vim_free(prev_char);\n\t if (ga_text.ga_data != NULL)\n\t\tprev_char = vim_strnsave(((char_u *)ga_text.ga_data) + prev_len,\n\t\t\t\t\t\t ga_text.ga_len - prev_len);\n\n\t if (c == '@' || c == '|' || c == '>' || c == '\\n')\n\t {\n\t\t/* use all attributes from previous cell */\n\t }\n\t else if (c == '+' || c == '*')\n\t {\n\t\tint is_bg;\n\n\t\tcell.width = c == '+' ? 1 : 2;\n\n\t\tc = fgetc(fd);\n\t\tif (c == '&')\n\t\t{\n\t\t /* use same attr as previous cell */\n\t\t c = fgetc(fd);\n\t\t}\n\t\telse if (isdigit(c))\n\t\t{\n\t\t /* get the decimal attribute */\n\t\t attr = 0;\n\t\t while (isdigit(c))\n\t\t {\n\t\t\tattr = attr * 10 + (c - '0');\n\t\t\tc = fgetc(fd);\n\t\t }\n\t\t hl2vtermAttr(attr, &cell);\n\t\t}\n\t\telse\n\t\t dump_is_corrupt(&ga_text);\n\n\t\t/* is_bg == 0: fg, is_bg == 1: bg */\n\t\tfor (is_bg = 0; is_bg <= 1; ++is_bg)\n\t\t{\n\t\t if (c == '&')\n\t\t {\n\t\t\t/* use same color as previous cell */\n\t\t\tc = fgetc(fd);\n\t\t }\n\t\t else if (c == '#')\n\t\t {\n\t\t\tint red, green, blue, index = 0;\n\n\t\t\tc = fgetc(fd);\n\t\t\tred = hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tred = (red << 4) + hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tgreen = hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tgreen = (green << 4) + hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tblue = hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tblue = (blue << 4) + hex2nr(c);\n\t\t\tc = fgetc(fd);\n\t\t\tif (!isdigit(c))\n\t\t\t dump_is_corrupt(&ga_text);\n\t\t\twhile (isdigit(c))\n\t\t\t{\n\t\t\t index = index * 10 + (c - '0');\n\t\t\t c = fgetc(fd);\n\t\t\t}\n\n\t\t\tif (is_bg)\n\t\t\t{\n\t\t\t cell.bg.red = red;\n\t\t\t cell.bg.green = green;\n\t\t\t cell.bg.blue = blue;\n\t\t\t cell.bg.ansi_index = index;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t cell.fg.red = red;\n\t\t\t cell.fg.green = green;\n\t\t\t cell.fg.blue = blue;\n\t\t\t cell.fg.ansi_index = index;\n\t\t\t}\n\t\t }\n\t\t else\n\t\t\tdump_is_corrupt(&ga_text);\n\t\t}\n\t }\n\t else\n\t\tdump_is_corrupt(&ga_text);\n\n\t append_cell(&ga_cell, &cell);\n\t}\n\telse if (c == '@')\n\t{\n\t if (prev_char == NULL)\n\t\tdump_is_corrupt(&ga_text);\n\t else\n\t {\n\t\tint count = 0;\n\n\t\t/* repeat previous character, get the count */\n\t\tfor (;;)\n\t\t{\n\t\t c = fgetc(fd);\n\t\t if (!isdigit(c))\n\t\t\tbreak;\n\t\t count = count * 10 + (c - '0');\n\t\t}\n\n\t\twhile (count-- > 0)\n\t\t{\n\t\t ga_concat(&ga_text, prev_char);\n\t\t append_cell(&ga_cell, &cell);\n\t\t}\n\t }\n\t}\n\telse\n\t{\n\t dump_is_corrupt(&ga_text);\n\t c = fgetc(fd);\n\t}\n }\n\n if (ga_text.ga_len > 0)\n {\n\t/* trailing characters after last NL */\n\tdump_is_corrupt(&ga_text);\n\tga_append(&ga_text, NUL);\n\tml_append(curbuf->b_ml.ml_line_count, ga_text.ga_data,\n\t\t\t\t\t\t\tga_text.ga_len, FALSE);\n }\n\n ga_clear(&ga_text);\n vim_free(prev_char);\n\n return max_cells;\n}\n\n/*\n * Return an allocated string with at least \"text_width\" \"=\" characters and\n * \"fname\" inserted in the middle.\n */\n static char_u *\nget_separator(int text_width, char_u *fname)\n{\n int\t width = MAX(text_width, curwin->w_width);\n char_u *textline;\n int\t fname_size;\n char_u *p = fname;\n int\t i;\n size_t off;\n\n textline = alloc(width + (int)STRLEN(fname) + 1);\n if (textline == NULL)\n\treturn NULL;\n\n fname_size = vim_strsize(fname);\n if (fname_size < width - 8)\n {\n\t/* enough room, don't use the full window width */\n\twidth = MAX(text_width, fname_size + 8);\n }\n else if (fname_size > width - 8)\n {\n\t/* full name doesn't fit, use only the tail */\n\tp = gettail(fname);\n\tfname_size = vim_strsize(p);\n }\n /* skip characters until the name fits */\n while (fname_size > width - 8)\n {\n\tp += (*mb_ptr2len)(p);\n\tfname_size = vim_strsize(p);\n }\n\n for (i = 0; i < (width - fname_size) / 2 - 1; ++i)\n\ttextline[i] = '=';\n textline[i++] = ' ';\n\n STRCPY(textline + i, p);\n off = STRLEN(textline);\n textline[off] = ' ';\n for (i = 1; i < (width - fname_size) / 2; ++i)\n\ttextline[off + i] = '=';\n textline[off + i] = NUL;\n\n return textline;\n}\n\n/*\n * Common for \"term_dumpdiff()\" and \"term_dumpload()\".\n */\n static void\nterm_load_dump(typval_T *argvars, typval_T *rettv, int do_diff)\n{\n jobopt_T\topt;\n buf_T\t*buf;\n char_u\tbuf1[NUMBUFLEN];\n char_u\tbuf2[NUMBUFLEN];\n char_u\t*fname1;\n char_u\t*fname2 = NULL;\n char_u\t*fname_tofree = NULL;\n FILE\t*fd1;\n FILE\t*fd2 = NULL;\n char_u\t*textline = NULL;\n\n /* First open the files. If this fails bail out. */\n fname1 = tv_get_string_buf_chk(&argvars[0], buf1);\n if (do_diff)\n\tfname2 = tv_get_string_buf_chk(&argvars[1], buf2);\n if (fname1 == NULL || (do_diff && fname2 == NULL))\n {\n\tEMSG(_(e_invarg));\n\treturn;\n }\n fd1 = mch_fopen((char *)fname1, READBIN);\n if (fd1 == NULL)\n {\n\tEMSG2(_(e_notread), fname1);\n\treturn;\n }\n if (do_diff)\n {\n\tfd2 = mch_fopen((char *)fname2, READBIN);\n\tif (fd2 == NULL)\n\t{\n\t fclose(fd1);\n\t EMSG2(_(e_notread), fname2);\n\t return;\n\t}\n }\n\n init_job_options(&opt);\n if (argvars[do_diff ? 2 : 1].v_type != VAR_UNKNOWN\n\t && get_job_options(&argvars[do_diff ? 2 : 1], &opt, 0,\n\t\t JO2_TERM_NAME + JO2_TERM_COLS + JO2_TERM_ROWS\n\t\t + JO2_VERTICAL + JO2_CURWIN + JO2_NORESTORE) == FAIL)\n\tgoto theend;\n\n if (opt.jo_term_name == NULL)\n {\n\tsize_t len = STRLEN(fname1) + 12;\n\n\tfname_tofree = alloc((int)len);\n\tif (fname_tofree != NULL)\n\t{\n\t vim_snprintf((char *)fname_tofree, len, \"dump diff %s\", fname1);\n\t opt.jo_term_name = fname_tofree;\n\t}\n }\n\n buf = term_start(&argvars[0], NULL, &opt, TERM_START_NOJOB);\n if (buf != NULL && buf->b_term != NULL)\n {\n\tint\t\ti;\n\tlinenr_T\tbot_lnum;\n\tlinenr_T\tlnum;\n\tterm_T\t\t*term = buf->b_term;\n\tint\t\twidth;\n\tint\t\twidth2;\n\tVTermPos\tcursor_pos1;\n\tVTermPos\tcursor_pos2;\n\n\tinit_default_colors(term);\n\n\trettv->vval.v_number = buf->b_fnum;\n\n\t/* read the files, fill the buffer with the diff */\n\twidth = read_dump_file(fd1, &cursor_pos1);\n\n\t/* position the cursor */\n\tif (cursor_pos1.row >= 0)\n\t{\n\t curwin->w_cursor.lnum = cursor_pos1.row + 1;\n\t coladvance(cursor_pos1.col);\n\t}\n\n\t/* Delete the empty line that was in the empty buffer. */\n\tml_delete(1, FALSE);\n\n\t/* For term_dumpload() we are done here. */\n\tif (!do_diff)\n\t goto theend;\n\n\tterm->tl_top_diff_rows = curbuf->b_ml.ml_line_count;\n\n\ttextline = get_separator(width, fname1);\n\tif (textline == NULL)\n\t goto theend;\n\tif (add_empty_scrollback(term, &term->tl_default_color, 0) == OK)\n\t ml_append(curbuf->b_ml.ml_line_count, textline, 0, FALSE);\n\tvim_free(textline);\n\n\ttextline = get_separator(width, fname2);\n\tif (textline == NULL)\n\t goto theend;\n\tif (add_empty_scrollback(term, &term->tl_default_color, 0) == OK)\n\t ml_append(curbuf->b_ml.ml_line_count, textline, 0, FALSE);\n\ttextline[width] = NUL;\n\n\tbot_lnum = curbuf->b_ml.ml_line_count;\n\twidth2 = read_dump_file(fd2, &cursor_pos2);\n\tif (width2 > width)\n\t{\n\t vim_free(textline);\n\t textline = alloc(width2 + 1);\n\t if (textline == NULL)\n\t\tgoto theend;\n\t width = width2;\n\t textline[width] = NUL;\n\t}\n\tterm->tl_bot_diff_rows = curbuf->b_ml.ml_line_count - bot_lnum;\n\n\tfor (lnum = 1; lnum <= term->tl_top_diff_rows; ++lnum)\n\t{\n\t if (lnum + bot_lnum > curbuf->b_ml.ml_line_count)\n\t {\n\t\t/* bottom part has fewer rows, fill with \"-\" */\n\t\tfor (i = 0; i < width; ++i)\n\t\t textline[i] = '-';\n\t }\n\t else\n\t {\n\t\tchar_u *line1;\n\t\tchar_u *line2;\n\t\tchar_u *p1;\n\t\tchar_u *p2;\n\t\tint\tcol;\n\t\tsb_line_T *sb_line = (sb_line_T *)term->tl_scrollback.ga_data;\n\t\tcellattr_T *cellattr1 = (sb_line + lnum - 1)->sb_cells;\n\t\tcellattr_T *cellattr2 = (sb_line + lnum + bot_lnum - 1)\n\t\t\t\t\t\t\t\t ->sb_cells;\n\n\t\t/* Make a copy, getting the second line will invalidate it. */\n\t\tline1 = vim_strsave(ml_get(lnum));\n\t\tif (line1 == NULL)\n\t\t break;\n\t\tp1 = line1;\n\n\t\tline2 = ml_get(lnum + bot_lnum);\n\t\tp2 = line2;\n\t\tfor (col = 0; col < width && *p1 != NUL && *p2 != NUL; ++col)\n\t\t{\n\t\t int len1 = utfc_ptr2len(p1);\n\t\t int len2 = utfc_ptr2len(p2);\n\n\t\t textline[col] = ' ';\n\t\t if (len1 != len2 || STRNCMP(p1, p2, len1) != 0)\n\t\t\t/* text differs */\n\t\t\ttextline[col] = 'X';\n\t\t else if (lnum == cursor_pos1.row + 1\n\t\t\t && col == cursor_pos1.col\n\t\t\t && (cursor_pos1.row != cursor_pos2.row\n\t\t\t\t\t|| cursor_pos1.col != cursor_pos2.col))\n\t\t\t/* cursor in first but not in second */\n\t\t\ttextline[col] = '>';\n\t\t else if (lnum == cursor_pos2.row + 1\n\t\t\t && col == cursor_pos2.col\n\t\t\t && (cursor_pos1.row != cursor_pos2.row\n\t\t\t\t\t|| cursor_pos1.col != cursor_pos2.col))\n\t\t\t/* cursor in second but not in first */\n\t\t\ttextline[col] = '<';\n\t\t else if (cellattr1 != NULL && cellattr2 != NULL)\n\t\t {\n\t\t\tif ((cellattr1 + col)->width\n\t\t\t\t\t\t != (cellattr2 + col)->width)\n\t\t\t textline[col] = 'w';\n\t\t\telse if (!same_color(&(cellattr1 + col)->fg,\n\t\t\t\t\t\t &(cellattr2 + col)->fg))\n\t\t\t textline[col] = 'f';\n\t\t\telse if (!same_color(&(cellattr1 + col)->bg,\n\t\t\t\t\t\t &(cellattr2 + col)->bg))\n\t\t\t textline[col] = 'b';\n\t\t\telse if (vtermAttr2hl((cellattr1 + col)->attrs)\n\t\t\t\t != vtermAttr2hl(((cellattr2 + col)->attrs)))\n\t\t\t textline[col] = 'a';\n\t\t }\n\t\t p1 += len1;\n\t\t p2 += len2;\n\t\t /* TODO: handle different width */\n\t\t}\n\t\tvim_free(line1);\n\n\t\twhile (col < width)\n\t\t{\n\t\t if (*p1 == NUL && *p2 == NUL)\n\t\t\ttextline[col] = '?';\n\t\t else if (*p1 == NUL)\n\t\t {\n\t\t\ttextline[col] = '+';\n\t\t\tp2 += utfc_ptr2len(p2);\n\t\t }\n\t\t else\n\t\t {\n\t\t\ttextline[col] = '-';\n\t\t\tp1 += utfc_ptr2len(p1);\n\t\t }\n\t\t ++col;\n\t\t}\n\t }\n\t if (add_empty_scrollback(term, &term->tl_default_color,\n\t\t\t\t\t\t term->tl_top_diff_rows) == OK)\n\t\tml_append(term->tl_top_diff_rows + lnum, textline, 0, FALSE);\n\t ++bot_lnum;\n\t}\n\n\twhile (lnum + bot_lnum <= curbuf->b_ml.ml_line_count)\n\t{\n\t /* bottom part has more rows, fill with \"+\" */\n\t for (i = 0; i < width; ++i)\n\t\ttextline[i] = '+';\n\t if (add_empty_scrollback(term, &term->tl_default_color,\n\t\t\t\t\t\t term->tl_top_diff_rows) == OK)\n\t\tml_append(term->tl_top_diff_rows + lnum, textline, 0, FALSE);\n\t ++lnum;\n\t ++bot_lnum;\n\t}\n\n\tterm->tl_cols = width;\n\n\t/* looks better without wrapping */\n\tcurwin->w_p_wrap = 0;\n }\n\ntheend:\n vim_free(textline);\n vim_free(fname_tofree);\n fclose(fd1);\n if (fd2 != NULL)\n\tfclose(fd2);\n}\n\n/*\n * If the current buffer shows the output of term_dumpdiff(), swap the top and\n * bottom files.\n * Return FAIL when this is not possible.\n */\n int\nterm_swap_diff()\n{\n term_T\t*term = curbuf->b_term;\n linenr_T\tline_count;\n linenr_T\ttop_rows;\n linenr_T\tbot_rows;\n linenr_T\tbot_start;\n linenr_T\tlnum;\n char_u\t*p;\n sb_line_T\t*sb_line;\n\n if (term == NULL\n\t || !term_is_finished(curbuf)\n\t || term->tl_top_diff_rows == 0\n\t || term->tl_scrollback.ga_len == 0)\n\treturn FAIL;\n\n line_count = curbuf->b_ml.ml_line_count;\n top_rows = term->tl_top_diff_rows;\n bot_rows = term->tl_bot_diff_rows;\n bot_start = line_count - bot_rows;\n sb_line = (sb_line_T *)term->tl_scrollback.ga_data;\n\n /* move lines from top to above the bottom part */\n for (lnum = 1; lnum <= top_rows; ++lnum)\n {\n\tp = vim_strsave(ml_get(1));\n\tif (p == NULL)\n\t return OK;\n\tml_append(bot_start, p, 0, FALSE);\n\tml_delete(1, FALSE);\n\tvim_free(p);\n }\n\n /* move lines from bottom to the top */\n for (lnum = 1; lnum <= bot_rows; ++lnum)\n {\n\tp = vim_strsave(ml_get(bot_start + lnum));\n\tif (p == NULL)\n\t return OK;\n\tml_delete(bot_start + lnum, FALSE);\n\tml_append(lnum - 1, p, 0, FALSE);\n\tvim_free(p);\n }\n\n if (top_rows == bot_rows)\n {\n\t/* rows counts are equal, can swap cell properties */\n\tfor (lnum = 0; lnum < top_rows; ++lnum)\n\t{\n\t sb_line_T\ttemp;\n\n\t temp = *(sb_line + lnum);\n\t *(sb_line + lnum) = *(sb_line + bot_start + lnum);\n\t *(sb_line + bot_start + lnum) = temp;\n\t}\n }\n else\n {\n\tsize_t\t\tsize = sizeof(sb_line_T) * term->tl_scrollback.ga_len;\n\tsb_line_T\t*temp = (sb_line_T *)alloc((int)size);\n\n\t/* need to copy cell properties into temp memory */\n\tif (temp != NULL)\n\t{\n\t mch_memmove(temp, term->tl_scrollback.ga_data, size);\n\t mch_memmove(term->tl_scrollback.ga_data,\n\t\t temp + bot_start,\n\t\t sizeof(sb_line_T) * bot_rows);\n\t mch_memmove((sb_line_T *)term->tl_scrollback.ga_data + bot_rows,\n\t\t temp + top_rows,\n\t\t sizeof(sb_line_T) * (line_count - top_rows - bot_rows));\n\t mch_memmove((sb_line_T *)term->tl_scrollback.ga_data\n\t\t\t\t\t\t + line_count - top_rows,\n\t\t temp,\n\t\t sizeof(sb_line_T) * top_rows);\n\t vim_free(temp);\n\t}\n }\n\n term->tl_top_diff_rows = bot_rows;\n term->tl_bot_diff_rows = top_rows;\n\n update_screen(NOT_VALID);\n return OK;\n}\n\n/*\n * \"term_dumpdiff(filename, filename, options)\" function\n */\n void\nf_term_dumpdiff(typval_T *argvars, typval_T *rettv)\n{\n term_load_dump(argvars, rettv, TRUE);\n}\n\n/*\n * \"term_dumpload(filename, options)\" function\n */\n void\nf_term_dumpload(typval_T *argvars, typval_T *rettv)\n{\n term_load_dump(argvars, rettv, FALSE);\n}\n\n/*\n * \"term_getaltscreen(buf)\" function\n */\n void\nf_term_getaltscreen(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getaltscreen()\");\n\n if (buf == NULL)\n\treturn;\n rettv->vval.v_number = buf->b_term->tl_using_altscreen;\n}\n\n/*\n * \"term_getattr(attr, name)\" function\n */\n void\nf_term_getattr(typval_T *argvars, typval_T *rettv)\n{\n int\t attr;\n size_t i;\n char_u *name;\n\n static struct {\n\tchar\t *name;\n\tint\t attr;\n } attrs[] = {\n\t{\"bold\", HL_BOLD},\n\t{\"italic\", HL_ITALIC},\n\t{\"underline\", HL_UNDERLINE},\n\t{\"strike\", HL_STRIKETHROUGH},\n\t{\"reverse\", HL_INVERSE},\n };\n\n attr = tv_get_number(&argvars[0]);\n name = tv_get_string_chk(&argvars[1]);\n if (name == NULL)\n\treturn;\n\n for (i = 0; i < sizeof(attrs)/sizeof(attrs[0]); ++i)\n\tif (STRCMP(name, attrs[i].name) == 0)\n\t{\n\t rettv->vval.v_number = (attr & attrs[i].attr) != 0 ? 1 : 0;\n\t break;\n\t}\n}\n\n/*\n * \"term_getcursor(buf)\" function\n */\n void\nf_term_getcursor(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getcursor()\");\n term_T\t*term;\n list_T\t*l;\n dict_T\t*d;\n\n if (rettv_list_alloc(rettv) == FAIL)\n\treturn;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n\n l = rettv->vval.v_list;\n list_append_number(l, term->tl_cursor_pos.row + 1);\n list_append_number(l, term->tl_cursor_pos.col + 1);\n\n d = dict_alloc();\n if (d != NULL)\n {\n\tdict_add_number(d, \"visible\", term->tl_cursor_visible);\n\tdict_add_number(d, \"blink\", blink_state_is_inverted()\n\t\t\t ? !term->tl_cursor_blink : term->tl_cursor_blink);\n\tdict_add_number(d, \"shape\", term->tl_cursor_shape);\n\tdict_add_string(d, \"color\", cursor_color_get(term->tl_cursor_color));\n\tlist_append_dict(l, d);\n }\n}\n\n/*\n * \"term_getjob(buf)\" function\n */\n void\nf_term_getjob(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getjob()\");\n\n if (buf == NULL)\n {\n\trettv->v_type = VAR_SPECIAL;\n\trettv->vval.v_number = VVAL_NULL;\n\treturn;\n }\n\n rettv->v_type = VAR_JOB;\n rettv->vval.v_job = buf->b_term->tl_job;\n if (rettv->vval.v_job != NULL)\n\t++rettv->vval.v_job->jv_refcount;\n}\n\n static int\nget_row_number(typval_T *tv, term_T *term)\n{\n if (tv->v_type == VAR_STRING\n\t && tv->vval.v_string != NULL\n\t && STRCMP(tv->vval.v_string, \".\") == 0)\n\treturn term->tl_cursor_pos.row;\n return (int)tv_get_number(tv) - 1;\n}\n\n/*\n * \"term_getline(buf, row)\" function\n */\n void\nf_term_getline(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t *buf = term_get_buf(argvars, \"term_getline()\");\n term_T\t *term;\n int\t\t row;\n\n rettv->v_type = VAR_STRING;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n row = get_row_number(&argvars[1], term);\n\n if (term->tl_vterm == NULL)\n {\n\tlinenr_T lnum = row + term->tl_scrollback_scrolled + 1;\n\n\t/* vterm is finished, get the text from the buffer */\n\tif (lnum > 0 && lnum <= buf->b_ml.ml_line_count)\n\t rettv->vval.v_string = vim_strsave(ml_get_buf(buf, lnum, FALSE));\n }\n else\n {\n\tVTermScreen\t*screen = vterm_obtain_screen(term->tl_vterm);\n\tVTermRect\trect;\n\tint\t\tlen;\n\tchar_u\t\t*p;\n\n\tif (row < 0 || row >= term->tl_rows)\n\t return;\n\tlen = term->tl_cols * MB_MAXBYTES + 1;\n\tp = alloc(len);\n\tif (p == NULL)\n\t return;\n\trettv->vval.v_string = p;\n\n\trect.start_col = 0;\n\trect.end_col = term->tl_cols;\n\trect.start_row = row;\n\trect.end_row = row + 1;\n\tp[vterm_screen_get_text(screen, (char *)p, len, rect)] = NUL;\n }\n}\n\n/*\n * \"term_getscrolled(buf)\" function\n */\n void\nf_term_getscrolled(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getscrolled()\");\n\n if (buf == NULL)\n\treturn;\n rettv->vval.v_number = buf->b_term->tl_scrollback_scrolled;\n}\n\n/*\n * \"term_getsize(buf)\" function\n */\n void\nf_term_getsize(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getsize()\");\n list_T\t*l;\n\n if (rettv_list_alloc(rettv) == FAIL)\n\treturn;\n if (buf == NULL)\n\treturn;\n\n l = rettv->vval.v_list;\n list_append_number(l, buf->b_term->tl_rows);\n list_append_number(l, buf->b_term->tl_cols);\n}\n\n/*\n * \"term_setsize(buf, rows, cols)\" function\n */\n void\nf_term_setsize(typval_T *argvars UNUSED, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_setsize()\");\n term_T\t*term;\n varnumber_T rows, cols;\n\n if (buf == NULL)\n {\n\tEMSG(_(\"E955: Not a terminal buffer\"));\n\treturn;\n }\n if (buf->b_term->tl_vterm == NULL)\n\treturn;\n term = buf->b_term;\n rows = tv_get_number(&argvars[1]);\n rows = rows <= 0 ? term->tl_rows : rows;\n cols = tv_get_number(&argvars[2]);\n cols = cols <= 0 ? term->tl_cols : cols;\n vterm_set_size(term->tl_vterm, rows, cols);\n /* handle_resize() will resize the windows */\n\n /* Get and remember the size we ended up with. Update the pty. */\n vterm_get_size(term->tl_vterm, &term->tl_rows, &term->tl_cols);\n term_report_winsize(term, term->tl_rows, term->tl_cols);\n}\n\n/*\n * \"term_getstatus(buf)\" function\n */\n void\nf_term_getstatus(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getstatus()\");\n term_T\t*term;\n char_u\tval[100];\n\n rettv->v_type = VAR_STRING;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n\n if (term_job_running(term))\n\tSTRCPY(val, \"running\");\n else\n\tSTRCPY(val, \"finished\");\n if (term->tl_normal_mode)\n\tSTRCAT(val, \",normal\");\n rettv->vval.v_string = vim_strsave(val);\n}\n\n/*\n * \"term_gettitle(buf)\" function\n */\n void\nf_term_gettitle(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_gettitle()\");\n\n rettv->v_type = VAR_STRING;\n if (buf == NULL)\n\treturn;\n\n if (buf->b_term->tl_title != NULL)\n\trettv->vval.v_string = vim_strsave(buf->b_term->tl_title);\n}\n\n/*\n * \"term_gettty(buf)\" function\n */\n void\nf_term_gettty(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_gettty()\");\n char_u\t*p = NULL;\n int\t\tnum = 0;\n\n rettv->v_type = VAR_STRING;\n if (buf == NULL)\n\treturn;\n if (argvars[1].v_type != VAR_UNKNOWN)\n\tnum = tv_get_number(&argvars[1]);\n\n switch (num)\n {\n\tcase 0:\n\t if (buf->b_term->tl_job != NULL)\n\t\tp = buf->b_term->tl_job->jv_tty_out;\n\t break;\n\tcase 1:\n\t if (buf->b_term->tl_job != NULL)\n\t\tp = buf->b_term->tl_job->jv_tty_in;\n\t break;\n\tdefault:\n\t EMSG2(_(e_invarg2), tv_get_string(&argvars[1]));\n\t return;\n }\n if (p != NULL)\n\trettv->vval.v_string = vim_strsave(p);\n}\n\n/*\n * \"term_list()\" function\n */\n void\nf_term_list(typval_T *argvars UNUSED, typval_T *rettv)\n{\n term_T\t*tp;\n list_T\t*l;\n\n if (rettv_list_alloc(rettv) == FAIL || first_term == NULL)\n\treturn;\n\n l = rettv->vval.v_list;\n for (tp = first_term; tp != NULL; tp = tp->tl_next)\n\tif (tp != NULL && tp->tl_buffer != NULL)\n\t if (list_append_number(l,\n\t\t\t\t (varnumber_T)tp->tl_buffer->b_fnum) == FAIL)\n\t\treturn;\n}\n\n/*\n * \"term_scrape(buf, row)\" function\n */\n void\nf_term_scrape(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t *buf = term_get_buf(argvars, \"term_scrape()\");\n VTermScreen\t *screen = NULL;\n VTermPos\t pos;\n list_T\t *l;\n term_T\t *term;\n char_u\t *p;\n sb_line_T\t *line;\n\n if (rettv_list_alloc(rettv) == FAIL)\n\treturn;\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n\n l = rettv->vval.v_list;\n pos.row = get_row_number(&argvars[1], term);\n\n if (term->tl_vterm != NULL)\n {\n\tscreen = vterm_obtain_screen(term->tl_vterm);\n\tp = NULL;\n\tline = NULL;\n }\n else\n {\n\tlinenr_T\tlnum = pos.row + term->tl_scrollback_scrolled;\n\n\tif (lnum < 0 || lnum >= term->tl_scrollback.ga_len)\n\t return;\n\tp = ml_get_buf(buf, lnum + 1, FALSE);\n\tline = (sb_line_T *)term->tl_scrollback.ga_data + lnum;\n }\n\n for (pos.col = 0; pos.col < term->tl_cols; )\n {\n\tdict_T\t\t*dcell;\n\tint\t\twidth;\n\tVTermScreenCellAttrs attrs;\n\tVTermColor\tfg, bg;\n\tchar_u\t\trgb[8];\n\tchar_u\t\tmbs[MB_MAXBYTES * VTERM_MAX_CHARS_PER_CELL + 1];\n\tint\t\toff = 0;\n\tint\t\ti;\n\n\tif (screen == NULL)\n\t{\n\t cellattr_T\t*cellattr;\n\t int\t\tlen;\n\n\t /* vterm has finished, get the cell from scrollback */\n\t if (pos.col >= line->sb_cols)\n\t\tbreak;\n\t cellattr = line->sb_cells + pos.col;\n\t width = cellattr->width;\n\t attrs = cellattr->attrs;\n\t fg = cellattr->fg;\n\t bg = cellattr->bg;\n\t len = MB_PTR2LEN(p);\n\t mch_memmove(mbs, p, len);\n\t mbs[len] = NUL;\n\t p += len;\n\t}\n\telse\n\t{\n\t VTermScreenCell cell;\n\t if (vterm_screen_get_cell(screen, pos, &cell) == 0)\n\t\tbreak;\n\t for (i = 0; i < VTERM_MAX_CHARS_PER_CELL; ++i)\n\t {\n\t\tif (cell.chars[i] == 0)\n\t\t break;\n\t\toff += (*utf_char2bytes)((int)cell.chars[i], mbs + off);\n\t }\n\t mbs[off] = NUL;\n\t width = cell.width;\n\t attrs = cell.attrs;\n\t fg = cell.fg;\n\t bg = cell.bg;\n\t}\n\tdcell = dict_alloc();\n\tif (dcell == NULL)\n\t break;\n\tlist_append_dict(l, dcell);\n\n\tdict_add_string(dcell, \"chars\", mbs);\n\n\tvim_snprintf((char *)rgb, 8, \"#%02x%02x%02x\",\n\t\t\t\t fg.red, fg.green, fg.blue);\n\tdict_add_string(dcell, \"fg\", rgb);\n\tvim_snprintf((char *)rgb, 8, \"#%02x%02x%02x\",\n\t\t\t\t bg.red, bg.green, bg.blue);\n\tdict_add_string(dcell, \"bg\", rgb);\n\n\tdict_add_number(dcell, \"attr\", cell2attr(attrs, fg, bg));\n\tdict_add_number(dcell, \"width\", width);\n\n\t++pos.col;\n\tif (width == 2)\n\t ++pos.col;\n }\n}\n\n/*\n * \"term_sendkeys(buf, keys)\" function\n */\n void\nf_term_sendkeys(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_sendkeys()\");\n char_u\t*msg;\n term_T\t*term;\n\n rettv->v_type = VAR_UNKNOWN;\n if (buf == NULL)\n\treturn;\n\n msg = tv_get_string_chk(&argvars[1]);\n if (msg == NULL)\n\treturn;\n term = buf->b_term;\n if (term->tl_vterm == NULL)\n\treturn;\n\n while (*msg != NUL)\n {\n\tint c;\n\n\tif (*msg == K_SPECIAL && msg[1] != NUL && msg[2] != NUL)\n\t{\n\t c = TO_SPECIAL(msg[1], msg[2]);\n\t msg += 3;\n\t}\n\telse\n\t{\n\t c = PTR2CHAR(msg);\n\t msg += MB_CPTR2LEN(msg);\n\t}\n\tsend_keys_to_term(term, c, FALSE);\n }\n}\n\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS) || defined(PROTO)\n/*\n * \"term_getansicolors(buf)\" function\n */\n void\nf_term_getansicolors(typval_T *argvars, typval_T *rettv)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_getansicolors()\");\n term_T\t*term;\n VTermState\t*state;\n VTermColor color;\n char_u\thexbuf[10];\n int\t\tindex;\n list_T\t*list;\n\n if (rettv_list_alloc(rettv) == FAIL)\n\treturn;\n\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n if (term->tl_vterm == NULL)\n\treturn;\n\n list = rettv->vval.v_list;\n state = vterm_obtain_state(term->tl_vterm);\n for (index = 0; index < 16; index++)\n {\n\tvterm_state_get_palette_color(state, index, &color);\n\tsprintf((char *)hexbuf, \"#%02x%02x%02x\",\n\t\tcolor.red, color.green, color.blue);\n\tif (list_append_string(list, hexbuf, 7) == FAIL)\n\t return;\n }\n}\n\n/*\n * \"term_setansicolors(buf, list)\" function\n */\n void\nf_term_setansicolors(typval_T *argvars, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_setansicolors()\");\n term_T\t*term;\n\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n if (term->tl_vterm == NULL)\n\treturn;\n\n if (argvars[1].v_type != VAR_LIST || argvars[1].vval.v_list == NULL)\n {\n\tEMSG(_(e_listreq));\n\treturn;\n }\n\n if (set_ansi_colors_list(term->tl_vterm, argvars[1].vval.v_list) == FAIL)\n\tEMSG(_(e_invarg));\n}\n#endif\n\n/*\n * \"term_setrestore(buf, command)\" function\n */\n void\nf_term_setrestore(typval_T *argvars UNUSED, typval_T *rettv UNUSED)\n{\n#if defined(FEAT_SESSION)\n buf_T\t*buf = term_get_buf(argvars, \"term_setrestore()\");\n term_T\t*term;\n char_u\t*cmd;\n\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n vim_free(term->tl_command);\n cmd = tv_get_string_chk(&argvars[1]);\n if (cmd != NULL)\n\tterm->tl_command = vim_strsave(cmd);\n else\n\tterm->tl_command = NULL;\n#endif\n}\n\n/*\n * \"term_setkill(buf, how)\" function\n */\n void\nf_term_setkill(typval_T *argvars UNUSED, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_setkill()\");\n term_T\t*term;\n char_u\t*how;\n\n if (buf == NULL)\n\treturn;\n term = buf->b_term;\n vim_free(term->tl_kill);\n how = tv_get_string_chk(&argvars[1]);\n if (how != NULL)\n\tterm->tl_kill = vim_strsave(how);\n else\n\tterm->tl_kill = NULL;\n}\n\n/*\n * \"term_start(command, options)\" function\n */\n void\nf_term_start(typval_T *argvars, typval_T *rettv)\n{\n jobopt_T\topt;\n buf_T\t*buf;\n\n init_job_options(&opt);\n if (argvars[1].v_type != VAR_UNKNOWN\n\t && get_job_options(&argvars[1], &opt,\n\t\tJO_TIMEOUT_ALL + JO_STOPONEXIT\n\t\t + JO_CALLBACK + JO_OUT_CALLBACK + JO_ERR_CALLBACK\n\t\t + JO_EXIT_CB + JO_CLOSE_CALLBACK + JO_OUT_IO,\n\t\tJO2_TERM_NAME + JO2_TERM_FINISH + JO2_HIDDEN + JO2_TERM_OPENCMD\n\t\t + JO2_TERM_COLS + JO2_TERM_ROWS + JO2_VERTICAL + JO2_CURWIN\n\t\t + JO2_CWD + JO2_ENV + JO2_EOF_CHARS\n\t\t + JO2_NORESTORE + JO2_TERM_KILL\n\t\t + JO2_ANSI_COLORS) == FAIL)\n\treturn;\n\n buf = term_start(&argvars[0], NULL, &opt, 0);\n\n if (buf != NULL && buf->b_term != NULL)\n\trettv->vval.v_number = buf->b_fnum;\n}\n\n/*\n * \"term_wait\" function\n */\n void\nf_term_wait(typval_T *argvars, typval_T *rettv UNUSED)\n{\n buf_T\t*buf = term_get_buf(argvars, \"term_wait()\");\n\n if (buf == NULL)\n\treturn;\n if (buf->b_term->tl_job == NULL)\n {\n\tch_log(NULL, \"term_wait(): no job to wait for\");\n\treturn;\n }\n if (buf->b_term->tl_job->jv_channel == NULL)\n\t/* channel is closed, nothing to do */\n\treturn;\n\n /* Get the job status, this will detect a job that finished. */\n if (!buf->b_term->tl_job->jv_channel->ch_keep_open\n\t && STRCMP(job_status(buf->b_term->tl_job), \"dead\") == 0)\n {\n\t/* The job is dead, keep reading channel I/O until the channel is\n\t * closed. buf->b_term may become NULL if the terminal was closed while\n\t * waiting. */\n\tch_log(NULL, \"term_wait(): waiting for channel to close\");\n\twhile (buf->b_term != NULL && !buf->b_term->tl_channel_closed)\n\t{\n\t mch_check_messages();\n\t parse_queued_messages();\n\t ui_delay(10L, FALSE);\n\t if (!buf_valid(buf))\n\t\t/* If the terminal is closed when the channel is closed the\n\t\t * buffer disappears. */\n\t\tbreak;\n\t}\n\tmch_check_messages();\n\tparse_queued_messages();\n }\n else\n {\n\tlong wait = 10L;\n\n\tmch_check_messages();\n\tparse_queued_messages();\n\n\t/* Wait for some time for any channel I/O. */\n\tif (argvars[1].v_type != VAR_UNKNOWN)\n\t wait = tv_get_number(&argvars[1]);\n\tui_delay(wait, TRUE);\n\tmch_check_messages();\n\n\t/* Flushing messages on channels is hopefully sufficient.\n\t * TODO: is there a better way? */\n\tparse_queued_messages();\n }\n}\n\n/*\n * Called when a channel has sent all the lines to a terminal.\n * Send a CTRL-D to mark the end of the text.\n */\n void\nterm_send_eof(channel_T *ch)\n{\n term_T\t*term;\n\n for (term = first_term; term != NULL; term = term->tl_next)\n\tif (term->tl_job == ch->ch_job)\n\t{\n\t if (term->tl_eof_chars != NULL)\n\t {\n\t\tchannel_send(ch, PART_IN, term->tl_eof_chars,\n\t\t\t\t\t(int)STRLEN(term->tl_eof_chars), NULL);\n\t\tchannel_send(ch, PART_IN, (char_u *)\"\\r\", 1, NULL);\n\t }\n# ifdef WIN3264\n\t else\n\t\t/* Default: CTRL-D */\n\t\tchannel_send(ch, PART_IN, (char_u *)\"\\004\\r\", 2, NULL);\n# endif\n\t}\n}\n\n job_T *\nterm_getjob(term_T *term)\n{\n return term != NULL ? term->tl_job : NULL;\n}\n\n# if defined(WIN3264) || defined(PROTO)\n\n/**************************************\n * 2. MS-Windows implementation.\n */\n\n# ifndef PROTO\n\n#define WINPTY_SPAWN_FLAG_AUTO_SHUTDOWN 1ul\n#define WINPTY_SPAWN_FLAG_EXIT_AFTER_SHUTDOWN 2ull\n#define WINPTY_MOUSE_MODE_FORCE\t\t2\n\nvoid* (*winpty_config_new)(UINT64, void*);\nvoid* (*winpty_open)(void*, void*);\nvoid* (*winpty_spawn_config_new)(UINT64, void*, LPCWSTR, void*, void*, void*);\nBOOL (*winpty_spawn)(void*, void*, HANDLE*, HANDLE*, DWORD*, void*);\nvoid (*winpty_config_set_mouse_mode)(void*, int);\nvoid (*winpty_config_set_initial_size)(void*, int, int);\nLPCWSTR (*winpty_conin_name)(void*);\nLPCWSTR (*winpty_conout_name)(void*);\nLPCWSTR (*winpty_conerr_name)(void*);\nvoid (*winpty_free)(void*);\nvoid (*winpty_config_free)(void*);\nvoid (*winpty_spawn_config_free)(void*);\nvoid (*winpty_error_free)(void*);\nLPCWSTR (*winpty_error_msg)(void*);\nBOOL (*winpty_set_size)(void*, int, int, void*);\nHANDLE (*winpty_agent_process)(void*);\n\n#define WINPTY_DLL \"winpty.dll\"\n\nstatic HINSTANCE hWinPtyDLL = NULL;\n# endif\n\n static int\ndyn_winpty_init(int verbose)\n{\n int i;\n static struct\n {\n\tchar\t *name;\n\tFARPROC\t *ptr;\n } winpty_entry[] =\n {\n\t{\"winpty_conerr_name\", (FARPROC*)&winpty_conerr_name},\n\t{\"winpty_config_free\", (FARPROC*)&winpty_config_free},\n\t{\"winpty_config_new\", (FARPROC*)&winpty_config_new},\n\t{\"winpty_config_set_mouse_mode\",\n\t\t\t\t (FARPROC*)&winpty_config_set_mouse_mode},\n\t{\"winpty_config_set_initial_size\",\n\t\t\t\t (FARPROC*)&winpty_config_set_initial_size},\n\t{\"winpty_conin_name\", (FARPROC*)&winpty_conin_name},\n\t{\"winpty_conout_name\", (FARPROC*)&winpty_conout_name},\n\t{\"winpty_error_free\", (FARPROC*)&winpty_error_free},\n\t{\"winpty_free\", (FARPROC*)&winpty_free},\n\t{\"winpty_open\", (FARPROC*)&winpty_open},\n\t{\"winpty_spawn\", (FARPROC*)&winpty_spawn},\n\t{\"winpty_spawn_config_free\", (FARPROC*)&winpty_spawn_config_free},\n\t{\"winpty_spawn_config_new\", (FARPROC*)&winpty_spawn_config_new},\n\t{\"winpty_error_msg\", (FARPROC*)&winpty_error_msg},\n\t{\"winpty_set_size\", (FARPROC*)&winpty_set_size},\n\t{\"winpty_agent_process\", (FARPROC*)&winpty_agent_process},\n\t{NULL, NULL}\n };\n\n /* No need to initialize twice. */\n if (hWinPtyDLL)\n\treturn OK;\n /* Load winpty.dll, prefer using the 'winptydll' option, fall back to just\n * winpty.dll. */\n if (*p_winptydll != NUL)\n\thWinPtyDLL = vimLoadLib((char *)p_winptydll);\n if (!hWinPtyDLL)\n\thWinPtyDLL = vimLoadLib(WINPTY_DLL);\n if (!hWinPtyDLL)\n {\n\tif (verbose)\n\t EMSG2(_(e_loadlib), *p_winptydll != NUL ? p_winptydll\n\t\t\t\t\t\t : (char_u *)WINPTY_DLL);\n\treturn FAIL;\n }\n for (i = 0; winpty_entry[i].name != NULL\n\t\t\t\t\t && winpty_entry[i].ptr != NULL; ++i)\n {\n\tif ((*winpty_entry[i].ptr = (FARPROC)GetProcAddress(hWinPtyDLL,\n\t\t\t\t\t winpty_entry[i].name)) == NULL)\n\t{\n\t if (verbose)\n\t\tEMSG2(_(e_loadfunc), winpty_entry[i].name);\n\t return FAIL;\n\t}\n }\n\n return OK;\n}\n\n/*\n * Create a new terminal of \"rows\" by \"cols\" cells.\n * Store a reference in \"term\".\n * Return OK or FAIL.\n */\n static int\nterm_and_job_init(\n\tterm_T\t *term,\n\ttypval_T *argvar,\n\tchar\t **argv UNUSED,\n\tjobopt_T *opt,\n\tjobopt_T *orig_opt)\n{\n WCHAR\t *cmd_wchar = NULL;\n WCHAR\t *cwd_wchar = NULL;\n WCHAR\t *env_wchar = NULL;\n channel_T\t *channel = NULL;\n job_T\t *job = NULL;\n DWORD\t error;\n HANDLE\t jo = NULL;\n HANDLE\t child_process_handle;\n HANDLE\t child_thread_handle;\n void\t *winpty_err = NULL;\n void\t *spawn_config = NULL;\n garray_T\t ga_cmd, ga_env;\n char_u\t *cmd = NULL;\n\n if (dyn_winpty_init(TRUE) == FAIL)\n\treturn FAIL;\n ga_init2(&ga_cmd, (int)sizeof(char*), 20);\n ga_init2(&ga_env, (int)sizeof(char*), 20);\n\n if (argvar->v_type == VAR_STRING)\n {\n\tcmd = argvar->vval.v_string;\n }\n else if (argvar->v_type == VAR_LIST)\n {\n\tif (win32_build_cmd(argvar->vval.v_list, &ga_cmd) == FAIL)\n\t goto failed;\n\tcmd = ga_cmd.ga_data;\n }\n if (cmd == NULL || *cmd == NUL)\n {\n\tEMSG(_(e_invarg));\n\tgoto failed;\n }\n\n cmd_wchar = enc_to_utf16(cmd, NULL);\n ga_clear(&ga_cmd);\n if (cmd_wchar == NULL)\n\tgoto failed;\n if (opt->jo_cwd != NULL)\n\tcwd_wchar = enc_to_utf16(opt->jo_cwd, NULL);\n\n win32_build_env(opt->jo_env, &ga_env, TRUE);\n env_wchar = ga_env.ga_data;\n\n term->tl_winpty_config = winpty_config_new(0, &winpty_err);\n if (term->tl_winpty_config == NULL)\n\tgoto failed;\n\n winpty_config_set_mouse_mode(term->tl_winpty_config,\n\t\t\t\t\t\t WINPTY_MOUSE_MODE_FORCE);\n winpty_config_set_initial_size(term->tl_winpty_config,\n\t\t\t\t\t\t term->tl_cols, term->tl_rows);\n term->tl_winpty = winpty_open(term->tl_winpty_config, &winpty_err);\n if (term->tl_winpty == NULL)\n\tgoto failed;\n\n spawn_config = winpty_spawn_config_new(\n\t WINPTY_SPAWN_FLAG_AUTO_SHUTDOWN |\n\t\tWINPTY_SPAWN_FLAG_EXIT_AFTER_SHUTDOWN,\n\t NULL,\n\t cmd_wchar,\n\t cwd_wchar,\n\t env_wchar,\n\t &winpty_err);\n if (spawn_config == NULL)\n\tgoto failed;\n\n channel = add_channel();\n if (channel == NULL)\n\tgoto failed;\n\n job = job_alloc();\n if (job == NULL)\n\tgoto failed;\n if (argvar->v_type == VAR_STRING)\n {\n\tint argc;\n\n\tbuild_argv_from_string(cmd, &job->jv_argv, &argc);\n }\n else\n {\n\tint argc;\n\n\tbuild_argv_from_list(argvar->vval.v_list, &job->jv_argv, &argc);\n }\n\n if (opt->jo_set & JO_IN_BUF)\n\tjob->jv_in_buf = buflist_findnr(opt->jo_io_buf[PART_IN]);\n\n if (!winpty_spawn(term->tl_winpty, spawn_config, &child_process_handle,\n\t &child_thread_handle, &error, &winpty_err))\n\tgoto failed;\n\n channel_set_pipes(channel,\n\t(sock_T)CreateFileW(\n\t winpty_conin_name(term->tl_winpty),\n\t GENERIC_WRITE, 0, NULL,\n\t OPEN_EXISTING, 0, NULL),\n\t(sock_T)CreateFileW(\n\t winpty_conout_name(term->tl_winpty),\n\t GENERIC_READ, 0, NULL,\n\t OPEN_EXISTING, 0, NULL),\n\t(sock_T)CreateFileW(\n\t winpty_conerr_name(term->tl_winpty),\n\t GENERIC_READ, 0, NULL,\n\t OPEN_EXISTING, 0, NULL));\n\n /* Write lines with CR instead of NL. */\n channel->ch_write_text_mode = TRUE;\n\n jo = CreateJobObject(NULL, NULL);\n if (jo == NULL)\n\tgoto failed;\n\n if (!AssignProcessToJobObject(jo, child_process_handle))\n {\n\t/* Failed, switch the way to terminate process with TerminateProcess. */\n\tCloseHandle(jo);\n\tjo = NULL;\n }\n\n winpty_spawn_config_free(spawn_config);\n vim_free(cmd_wchar);\n vim_free(cwd_wchar);\n vim_free(env_wchar);\n\n if (create_vterm(term, term->tl_rows, term->tl_cols) == FAIL)\n\tgoto failed;\n\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS)\n if (opt->jo_set2 & JO2_ANSI_COLORS)\n\tset_vterm_palette(term->tl_vterm, opt->jo_ansi_colors);\n else\n\tinit_vterm_ansi_colors(term->tl_vterm);\n#endif\n\n channel_set_job(channel, job, opt);\n job_set_options(job, opt);\n\n job->jv_channel = channel;\n job->jv_proc_info.hProcess = child_process_handle;\n job->jv_proc_info.dwProcessId = GetProcessId(child_process_handle);\n job->jv_job_object = jo;\n job->jv_status = JOB_STARTED;\n job->jv_tty_in = utf16_to_enc(\n\t (short_u*)winpty_conin_name(term->tl_winpty), NULL);\n job->jv_tty_out = utf16_to_enc(\n\t (short_u*)winpty_conout_name(term->tl_winpty), NULL);\n ++job->jv_refcount;\n term->tl_job = job;\n\n /* Redirecting stdout and stderr doesn't work at the job level. Instead\n * open the file here and handle it in. opt->jo_io was changed in\n * setup_job_options(), use the original flags here. */\n if (orig_opt->jo_io[PART_OUT] == JIO_FILE)\n {\n\tchar_u *fname = opt->jo_io_name[PART_OUT];\n\n\tch_log(channel, \"Opening output file %s\", fname);\n\tterm->tl_out_fd = mch_fopen((char *)fname, WRITEBIN);\n\tif (term->tl_out_fd == NULL)\n\t EMSG2(_(e_notopen), fname);\n }\n\n return OK;\n\nfailed:\n ga_clear(&ga_cmd);\n ga_clear(&ga_env);\n vim_free(cmd_wchar);\n vim_free(cwd_wchar);\n if (spawn_config != NULL)\n\twinpty_spawn_config_free(spawn_config);\n if (channel != NULL)\n\tchannel_clear(channel);\n if (job != NULL)\n {\n\tjob->jv_channel = NULL;\n\tjob_cleanup(job);\n }\n term->tl_job = NULL;\n if (jo != NULL)\n\tCloseHandle(jo);\n if (term->tl_winpty != NULL)\n\twinpty_free(term->tl_winpty);\n term->tl_winpty = NULL;\n if (term->tl_winpty_config != NULL)\n\twinpty_config_free(term->tl_winpty_config);\n term->tl_winpty_config = NULL;\n if (winpty_err != NULL)\n {\n\tchar_u *msg = utf16_to_enc(\n\t\t\t\t(short_u *)winpty_error_msg(winpty_err), NULL);\n\n\tEMSG(msg);\n\twinpty_error_free(winpty_err);\n }\n return FAIL;\n}\n\n static int\ncreate_pty_only(term_T *term, jobopt_T *options)\n{\n HANDLE\t hPipeIn = INVALID_HANDLE_VALUE;\n HANDLE\t hPipeOut = INVALID_HANDLE_VALUE;\n char\t in_name[80], out_name[80];\n channel_T\t *channel = NULL;\n\n if (create_vterm(term, term->tl_rows, term->tl_cols) == FAIL)\n\treturn FAIL;\n\n vim_snprintf(in_name, sizeof(in_name), \"\\\\\\\\.\\\\pipe\\\\vim-%d-in-%d\",\n\t GetCurrentProcessId(),\n\t curbuf->b_fnum);\n hPipeIn = CreateNamedPipe(in_name, PIPE_ACCESS_OUTBOUND,\n\t PIPE_TYPE_MESSAGE | PIPE_NOWAIT,\n\t PIPE_UNLIMITED_INSTANCES,\n\t 0, 0, NMPWAIT_NOWAIT, NULL);\n if (hPipeIn == INVALID_HANDLE_VALUE)\n\tgoto failed;\n\n vim_snprintf(out_name, sizeof(out_name), \"\\\\\\\\.\\\\pipe\\\\vim-%d-out-%d\",\n\t GetCurrentProcessId(),\n\t curbuf->b_fnum);\n hPipeOut = CreateNamedPipe(out_name, PIPE_ACCESS_INBOUND,\n\t PIPE_TYPE_MESSAGE | PIPE_NOWAIT,\n\t PIPE_UNLIMITED_INSTANCES,\n\t 0, 0, 0, NULL);\n if (hPipeOut == INVALID_HANDLE_VALUE)\n\tgoto failed;\n\n ConnectNamedPipe(hPipeIn, NULL);\n ConnectNamedPipe(hPipeOut, NULL);\n\n term->tl_job = job_alloc();\n if (term->tl_job == NULL)\n\tgoto failed;\n ++term->tl_job->jv_refcount;\n\n /* behave like the job is already finished */\n term->tl_job->jv_status = JOB_FINISHED;\n\n channel = add_channel();\n if (channel == NULL)\n\tgoto failed;\n term->tl_job->jv_channel = channel;\n channel->ch_keep_open = TRUE;\n channel->ch_named_pipe = TRUE;\n\n channel_set_pipes(channel,\n\t(sock_T)hPipeIn,\n\t(sock_T)hPipeOut,\n\t(sock_T)hPipeOut);\n channel_set_job(channel, term->tl_job, options);\n term->tl_job->jv_tty_in = vim_strsave((char_u*)in_name);\n term->tl_job->jv_tty_out = vim_strsave((char_u*)out_name);\n\n return OK;\n\nfailed:\n if (hPipeIn != NULL)\n\tCloseHandle(hPipeIn);\n if (hPipeOut != NULL)\n\tCloseHandle(hPipeOut);\n return FAIL;\n}\n\n/*\n * Free the terminal emulator part of \"term\".\n */\n static void\nterm_free_vterm(term_T *term)\n{\n if (term->tl_winpty != NULL)\n\twinpty_free(term->tl_winpty);\n term->tl_winpty = NULL;\n if (term->tl_winpty_config != NULL)\n\twinpty_config_free(term->tl_winpty_config);\n term->tl_winpty_config = NULL;\n if (term->tl_vterm != NULL)\n\tvterm_free(term->tl_vterm);\n term->tl_vterm = NULL;\n}\n\n/*\n * Report the size to the terminal.\n */\n static void\nterm_report_winsize(term_T *term, int rows, int cols)\n{\n if (term->tl_winpty)\n\twinpty_set_size(term->tl_winpty, cols, rows, NULL);\n}\n\n int\nterminal_enabled(void)\n{\n return dyn_winpty_init(FALSE) == OK;\n}\n\n# else\n\n/**************************************\n * 3. Unix-like implementation.\n */\n\n/*\n * Create a new terminal of \"rows\" by \"cols\" cells.\n * Start job for \"cmd\".\n * Store the pointers in \"term\".\n * When \"argv\" is not NULL then \"argvar\" is not used.\n * Return OK or FAIL.\n */\n static int\nterm_and_job_init(\n\tterm_T\t *term,\n\ttypval_T *argvar,\n\tchar\t **argv,\n\tjobopt_T *opt,\n\tjobopt_T *orig_opt UNUSED)\n{\n if (create_vterm(term, term->tl_rows, term->tl_cols) == FAIL)\n\treturn FAIL;\n\n#if defined(FEAT_GUI) || defined(FEAT_TERMGUICOLORS)\n if (opt->jo_set2 & JO2_ANSI_COLORS)\n\tset_vterm_palette(term->tl_vterm, opt->jo_ansi_colors);\n else\n\tinit_vterm_ansi_colors(term->tl_vterm);\n#endif\n\n /* This may change a string in \"argvar\". */\n term->tl_job = job_start(argvar, argv, opt, TRUE);\n if (term->tl_job != NULL)\n\t++term->tl_job->jv_refcount;\n\n return term->tl_job != NULL\n\t&& term->tl_job->jv_channel != NULL\n\t&& term->tl_job->jv_status != JOB_FAILED ? OK : FAIL;\n}\n\n static int\ncreate_pty_only(term_T *term, jobopt_T *opt)\n{\n if (create_vterm(term, term->tl_rows, term->tl_cols) == FAIL)\n\treturn FAIL;\n\n term->tl_job = job_alloc();\n if (term->tl_job == NULL)\n\treturn FAIL;\n ++term->tl_job->jv_refcount;\n\n /* behave like the job is already finished */\n term->tl_job->jv_status = JOB_FINISHED;\n\n return mch_create_pty_channel(term->tl_job, opt);\n}\n\n/*\n * Free the terminal emulator part of \"term\".\n */\n static void\nterm_free_vterm(term_T *term)\n{\n if (term->tl_vterm != NULL)\n\tvterm_free(term->tl_vterm);\n term->tl_vterm = NULL;\n}\n\n/*\n * Report the size to the terminal.\n */\n static void\nterm_report_winsize(term_T *term, int rows, int cols)\n{\n /* Use an ioctl() to report the new window size to the job. */\n if (term->tl_job != NULL && term->tl_job->jv_channel != NULL)\n {\n\tint fd = -1;\n\tint part;\n\n\tfor (part = PART_OUT; part < PART_COUNT; ++part)\n\t{\n\t fd = term->tl_job->jv_channel->ch_part[part].ch_fd;\n\t if (isatty(fd))\n\t\tbreak;\n\t}\n\tif (part < PART_COUNT && mch_report_winsize(fd, rows, cols) == OK)\n\t mch_signal_job(term->tl_job, (char_u *)\"winch\");\n }\n}\n\n# endif\n\n#endif /* FEAT_TERMINAL */\n"},"func_before":{"kind":"string","value":"create_pty_only(term_T *term, jobopt_T *options)\n{\n HANDLE\t hPipeIn = INVALID_HANDLE_VALUE;\n HANDLE\t hPipeOut = INVALID_HANDLE_VALUE;\n char\t in_name[80], out_name[80];\n channel_T\t *channel = NULL;\n\n create_vterm(term, term->tl_rows, term->tl_cols);\n\n vim_snprintf(in_name, sizeof(in_name), \"\\\\\\\\.\\\\pipe\\\\vim-%d-in-%d\",\n\t GetCurrentProcessId(),\n\t curbuf->b_fnum);\n hPipeIn = CreateNamedPipe(in_name, PIPE_ACCESS_OUTBOUND,\n\t PIPE_TYPE_MESSAGE | PIPE_NOWAIT,\n\t PIPE_UNLIMITED_INSTANCES,\n\t 0, 0, NMPWAIT_NOWAIT, NULL);\n if (hPipeIn == INVALID_HANDLE_VALUE)\n\tgoto failed;\n\n vim_snprintf(out_name, sizeof(out_name), \"\\\\\\\\.\\\\pipe\\\\vim-%d-out-%d\",\n\t GetCurrentProcessId(),\n\t curbuf->b_fnum);\n hPipeOut = CreateNamedPipe(out_name, PIPE_ACCESS_INBOUND,\n\t PIPE_TYPE_MESSAGE | PIPE_NOWAIT,\n\t PIPE_UNLIMITED_INSTANCES,\n\t 0, 0, 0, NULL);\n if (hPipeOut == INVALID_HANDLE_VALUE)\n\tgoto failed;\n\n ConnectNamedPipe(hPipeIn, NULL);\n ConnectNamedPipe(hPipeOut, NULL);\n\n term->tl_job = job_alloc();\n if (term->tl_job == NULL)\n\tgoto failed;\n ++term->tl_job->jv_refcount;\n\n /* behave like the job is already finished */\n term->tl_job->jv_status = JOB_FINISHED;\n\n channel = add_channel();\n if (channel == NULL)\n\tgoto failed;\n term->tl_job->jv_channel = channel;\n channel->ch_keep_open = TRUE;\n channel->ch_named_pipe = TRUE;\n\n channel_set_pipes(channel,\n\t(sock_T)hPipeIn,\n\t(sock_T)hPipeOut,\n\t(sock_T)hPipeOut);\n channel_set_job(channel, term->tl_job, options);\n term->tl_job->jv_tty_in = vim_strsave((char_u*)in_name);\n term->tl_job->jv_tty_out = vim_strsave((char_u*)out_name);\n\n return OK;\n\nfailed:\n if (hPipeIn != NULL)\n\tCloseHandle(hPipeIn);\n if (hPipeOut != NULL)\n\tCloseHandle(hPipeOut);\n return FAIL;\n}"},"func_after":{"kind":"string","value":"create_pty_only(term_T *term, jobopt_T *options)\n{\n HANDLE\t hPipeIn = INVALID_HANDLE_VALUE;\n HANDLE\t hPipeOut = INVALID_HANDLE_VALUE;\n char\t in_name[80], out_name[80];\n channel_T\t *channel = NULL;\n\n if (create_vterm(term, term->tl_rows, term->tl_cols) == FAIL)\n\treturn FAIL;\n\n vim_snprintf(in_name, sizeof(in_name), \"\\\\\\\\.\\\\pipe\\\\vim-%d-in-%d\",\n\t GetCurrentProcessId(),\n\t curbuf->b_fnum);\n hPipeIn = CreateNamedPipe(in_name, PIPE_ACCESS_OUTBOUND,\n\t PIPE_TYPE_MESSAGE | PIPE_NOWAIT,\n\t PIPE_UNLIMITED_INSTANCES,\n\t 0, 0, NMPWAIT_NOWAIT, NULL);\n if (hPipeIn == INVALID_HANDLE_VALUE)\n\tgoto failed;\n\n vim_snprintf(out_name, sizeof(out_name), \"\\\\\\\\.\\\\pipe\\\\vim-%d-out-%d\",\n\t GetCurrentProcessId(),\n\t curbuf->b_fnum);\n hPipeOut = CreateNamedPipe(out_name, PIPE_ACCESS_INBOUND,\n\t PIPE_TYPE_MESSAGE | PIPE_NOWAIT,\n\t PIPE_UNLIMITED_INSTANCES,\n\t 0, 0, 0, NULL);\n if (hPipeOut == INVALID_HANDLE_VALUE)\n\tgoto failed;\n\n ConnectNamedPipe(hPipeIn, NULL);\n ConnectNamedPipe(hPipeOut, NULL);\n\n term->tl_job = job_alloc();\n if (term->tl_job == NULL)\n\tgoto failed;\n ++term->tl_job->jv_refcount;\n\n /* behave like the job is already finished */\n term->tl_job->jv_status = JOB_FINISHED;\n\n channel = add_channel();\n if (channel == NULL)\n\tgoto failed;\n term->tl_job->jv_channel = channel;\n channel->ch_keep_open = TRUE;\n channel->ch_named_pipe = TRUE;\n\n channel_set_pipes(channel,\n\t(sock_T)hPipeIn,\n\t(sock_T)hPipeOut,\n\t(sock_T)hPipeOut);\n channel_set_job(channel, term->tl_job, options);\n term->tl_job->jv_tty_in = vim_strsave((char_u*)in_name);\n term->tl_job->jv_tty_out = vim_strsave((char_u*)out_name);\n\n return OK;\n\nfailed:\n if (hPipeIn != NULL)\n\tCloseHandle(hPipeIn);\n if (hPipeOut != NULL)\n\tCloseHandle(hPipeOut);\n return FAIL;\n}"},"diff":{"kind":"string","value":"{'added': [(3433, ''), (3707, ' * Return FAIL when out of memory.'), (3709, ' static int'), (3719, ' if (vterm == NULL)'), (3720, '\\treturn FAIL;'), (3721, ''), (3722, ' // Allocate screen and state here, so we can bail out if that fails.'), (3723, ' state = vterm_obtain_state(vterm);'), (3725, ' if (state == NULL || screen == NULL)'), (3726, ' {'), (3727, '\\tvterm_free(vterm);'), (3728, '\\treturn FAIL;'), (3729, ' }'), (3730, ''), (3738, '\\t state,'), (3764, ''), (3765, ' return OK;'), (5646, ' if (create_vterm(term, term->tl_rows, term->tl_cols) == FAIL)'), (5647, '\\tgoto failed;'), (5728, ' if (create_vterm(term, term->tl_rows, term->tl_cols) == FAIL)'), (5729, '\\treturn FAIL;'), (5841, ' if (create_vterm(term, term->tl_rows, term->tl_cols) == FAIL)'), (5842, '\\treturn FAIL;'), (5864, ' if (create_vterm(term, term->tl_rows, term->tl_cols) == FAIL)'), (5865, '\\treturn FAIL;')], 'deleted': [(3707, ' static void'), (3725, '\\t vterm_obtain_state(vterm),'), (3749, ' state = vterm_obtain_state(vterm);'), (5632, ' create_vterm(term, term->tl_rows, term->tl_cols);'), (5713, ' create_vterm(term, term->tl_rows, term->tl_cols);'), (5825, ' create_vterm(term, term->tl_rows, term->tl_cols);'), (5847, ' create_vterm(term, term->tl_rows, term->tl_cols);')]}"},"num_lines_added":{"kind":"number","value":25,"string":"25"},"num_lines_deleted":{"kind":"number","value":7,"string":"7"},"num_lines_in_file":{"kind":"number","value":4348,"string":"4,348"},"num_tokens_in_file":{"kind":"number","value":25983,"string":"25,983"},"num_lines_in_method":{"kind":"number","value":53,"string":"53"},"num_tokens_in_method":{"kind":"number","value":330,"string":"330"},"method_complexity":{"kind":"number","value":7,"string":"7"},"repo":{"kind":"string","value":"https://github.com/vim/vim"},"cve_id":{"kind":"string","value":"CVE-2018-20786"},"cwe_id":{"kind":"string","value":"CWE-476"}}},{"rowIdx":388,"cells":{"id":{"kind":"number","value":3149,"string":"3,149"},"file_name":{"kind":"string","value":"commonio.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"commonio_sort"},"code_before":{"kind":"string","value":"/*\n * Copyright (c) 1990 - 1994, Julianne Frances Haugh\n * Copyright (c) 1996 - 2001, Marek Michałkiewicz\n * Copyright (c) 2001 - 2006, Tomasz Kłoczko\n * Copyright (c) 2007 - 2011, Nicolas François\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. The name of the copyright holders or contributors may not be used to\n * endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \n\n#ident \"$Id$\"\n\n#include \"defines.h\"\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \"nscd.h\"\n#ifdef WITH_TCB\n#include \n#endif\t\t\t\t/* WITH_TCB */\n#include \"prototypes.h\"\n#include \"commonio.h\"\n\n/* local function prototypes */\nstatic int lrename (const char *, const char *);\nstatic int check_link_count (const char *file);\nstatic int do_lock_file (const char *file, const char *lock, bool log);\nstatic /*@null@*/ /*@dependent@*/FILE *fopen_set_perms (\n\tconst char *name,\n\tconst char *mode,\n\tconst struct stat *sb);\nstatic int create_backup (const char *, FILE *);\nstatic void free_linked_list (struct commonio_db *);\nstatic void add_one_entry (\n\tstruct commonio_db *db,\n\t/*@owned@*/struct commonio_entry *p);\nstatic bool name_is_nis (const char *name);\nstatic int write_all (const struct commonio_db *);\nstatic /*@dependent@*/ /*@null@*/struct commonio_entry *find_entry_by_name (\n\tstruct commonio_db *,\n\tconst char *);\nstatic /*@dependent@*/ /*@null@*/struct commonio_entry *next_entry_by_name (\n\tstruct commonio_db *,\n\t/*@null@*/struct commonio_entry *pos,\n\tconst char *);\n\nstatic int lock_count = 0;\nstatic bool nscd_need_reload = false;\n\n/*\n * Simple rename(P) alternative that attempts to rename to symlink\n * target.\n */\nint lrename (const char *old, const char *new)\n{\n\tint res;\n\tchar *r = NULL;\n\n#if defined(S_ISLNK)\n#ifndef __GLIBC__\n\tchar resolved_path[PATH_MAX];\n#endif\t\t\t\t/* !__GLIBC__ */\n\tstruct stat sb;\n\tif (lstat (new, &sb) == 0 && S_ISLNK (sb.st_mode)) {\n#ifdef __GLIBC__ /* now a POSIX.1-2008 feature */\n\t\tr = realpath (new, NULL);\n#else\t\t\t\t/* !__GLIBC__ */\n\t\tr = realpath (new, resolved_path);\n#endif\t\t\t\t/* !__GLIBC__ */\n\t\tif (NULL == r) {\n\t\t\tperror (\"realpath in lrename()\");\n\t\t} else {\n\t\t\tnew = r;\n\t\t}\n\t}\n#endif\t\t\t\t/* S_ISLNK */\n\n\tres = rename (old, new);\n\n#ifdef __GLIBC__\n\tif (NULL != r) {\n\t\tfree (r);\n\t}\n#endif\t\t\t\t/* __GLIBC__ */\n\n\treturn res;\n}\n\nstatic int check_link_count (const char *file)\n{\n\tstruct stat sb;\n\n\tif (stat (file, &sb) != 0) {\n\t\treturn 0;\n\t}\n\n\tif (sb.st_nlink != 2) {\n\t\treturn 0;\n\t}\n\n\treturn 1;\n}\n\n\nstatic int do_lock_file (const char *file, const char *lock, bool log)\n{\n\tint fd;\n\tpid_t pid;\n\tssize_t len;\n\tint retval;\n\tchar buf[32];\n\n\tfd = open (file, O_CREAT | O_EXCL | O_WRONLY, 0600);\n\tif (-1 == fd) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: %s\\n\",\n\t\t\t Prog, file, strerror (errno));\n\t\t}\n\t\treturn 0;\n\t}\n\n\tpid = getpid ();\n\tsnprintf (buf, sizeof buf, \"%lu\", (unsigned long) pid);\n\tlen = (ssize_t) strlen (buf) + 1;\n\tif (write (fd, buf, (size_t) len) != len) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: %s\\n\",\n\t\t\t Prog, file, strerror (errno));\n\t\t}\n\t\t(void) close (fd);\n\t\tunlink (file);\n\t\treturn 0;\n\t}\n\tclose (fd);\n\n\tif (link (file, lock) == 0) {\n\t\tretval = check_link_count (file);\n\t\tif ((0==retval) && log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: lock file already used\\n\",\n\t\t\t Prog, file);\n\t\t}\n\t\tunlink (file);\n\t\treturn retval;\n\t}\n\n\tfd = open (lock, O_RDWR);\n\tif (-1 == fd) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: %s\\n\",\n\t\t\t Prog, lock, strerror (errno));\n\t\t}\n\t\tunlink (file);\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tlen = read (fd, buf, sizeof (buf) - 1);\n\tclose (fd);\n\tif (len <= 0) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: existing lock file %s without a PID\\n\",\n\t\t\t Prog, lock);\n\t\t}\n\t\tunlink (file);\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tbuf[len] = '\\0';\n\tif (get_pid (buf, &pid) == 0) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: existing lock file %s with an invalid PID '%s'\\n\",\n\t\t\t Prog, lock, buf);\n\t\t}\n\t\tunlink (file);\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tif (kill (pid, 0) == 0) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: lock %s already used by PID %lu\\n\",\n\t\t\t Prog, lock, (unsigned long) pid);\n\t\t}\n\t\tunlink (file);\n\t\terrno = EEXIST;\n\t\treturn 0;\n\t}\n\tif (unlink (lock) != 0) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: cannot get lock %s: %s\\n\",\n\t\t\t Prog, lock, strerror (errno));\n\t\t}\n\t\tunlink (file);\n\t\treturn 0;\n\t}\n\n\tretval = 0;\n\tif (link (file, lock) == 0) {\n\t\tretval = check_link_count (file);\n\t\tif ((0==retval) && log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: lock file already used\\n\",\n\t\t\t Prog, file);\n\t\t}\n\t} else {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: cannot get lock %s: %s\\n\",\n\t\t\t Prog, lock, strerror (errno));\n\t\t}\n\t}\n\n\tunlink (file);\n\treturn retval;\n}\n\n\nstatic /*@null@*/ /*@dependent@*/FILE *fopen_set_perms (\n\tconst char *name,\n\tconst char *mode,\n\tconst struct stat *sb)\n{\n\tFILE *fp;\n\tmode_t mask;\n\n\tmask = umask (0777);\n\tfp = fopen (name, mode);\n\t(void) umask (mask);\n\tif (NULL == fp) {\n\t\treturn NULL;\n\t}\n\n#ifdef HAVE_FCHOWN\n\tif (fchown (fileno (fp), sb->st_uid, sb->st_gid) != 0) {\n\t\tgoto fail;\n\t}\n#else\t\t\t\t/* !HAVE_FCHOWN */\n\tif (chown (name, sb->st_mode) != 0) {\n\t\tgoto fail;\n\t}\n#endif\t\t\t\t/* !HAVE_FCHOWN */\n\n#ifdef HAVE_FCHMOD\n\tif (fchmod (fileno (fp), sb->st_mode & 0664) != 0) {\n\t\tgoto fail;\n\t}\n#else\t\t\t\t/* !HAVE_FCHMOD */\n\tif (chmod (name, sb->st_mode & 0664) != 0) {\n\t\tgoto fail;\n\t}\n#endif\t\t\t\t/* !HAVE_FCHMOD */\n\treturn fp;\n\n fail:\n\t(void) fclose (fp);\n\t/* fopen_set_perms is used for intermediate files */\n\t(void) unlink (name);\n\treturn NULL;\n}\n\n\nstatic int create_backup (const char *backup, FILE * fp)\n{\n\tstruct stat sb;\n\tstruct utimbuf ub;\n\tFILE *bkfp;\n\tint c;\n\n\tif (fstat (fileno (fp), &sb) != 0) {\n\t\treturn -1;\n\t}\n\n\tbkfp = fopen_set_perms (backup, \"w\", &sb);\n\tif (NULL == bkfp) {\n\t\treturn -1;\n\t}\n\n\t/* TODO: faster copy, not one-char-at-a-time. --marekm */\n\tc = 0;\n\tif (fseek (fp, 0, SEEK_SET) == 0) {\n\t\twhile ((c = getc (fp)) != EOF) {\n\t\t\tif (putc (c, bkfp) == EOF) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif ((c != EOF) || (ferror (fp) != 0) || (fflush (bkfp) != 0)) {\n\t\t(void) fclose (bkfp);\n\t\t/* FIXME: unlink the backup file? */\n\t\treturn -1;\n\t}\n\tif ( (fsync (fileno (bkfp)) != 0)\n\t || (fclose (bkfp) != 0)) {\n\t\t/* FIXME: unlink the backup file? */\n\t\treturn -1;\n\t}\n\n\tub.actime = sb.st_atime;\n\tub.modtime = sb.st_mtime;\n\t(void) utime (backup, &ub);\n\treturn 0;\n}\n\n\nstatic void free_linked_list (struct commonio_db *db)\n{\n\tstruct commonio_entry *p;\n\n\twhile (NULL != db->head) {\n\t\tp = db->head;\n\t\tdb->head = p->next;\n\n\t\tif (NULL != p->line) {\n\t\t\tfree (p->line);\n\t\t}\n\n\t\tif (NULL != p->eptr) {\n\t\t\tdb->ops->free (p->eptr);\n\t\t}\n\n\t\tfree (p);\n\t}\n\tdb->tail = NULL;\n}\n\n\nint commonio_setname (struct commonio_db *db, const char *name)\n{\n\tsnprintf (db->filename, sizeof (db->filename), \"%s\", name);\n\treturn 1;\n}\n\n\nbool commonio_present (const struct commonio_db *db)\n{\n\treturn (access (db->filename, F_OK) == 0);\n}\n\n\nint commonio_lock_nowait (struct commonio_db *db, bool log)\n{\n\tchar file[1024];\n\tchar lock[1024];\n\n\tif (db->locked) {\n\t\treturn 1;\n\t}\n\n\tsnprintf (file, sizeof file, \"%s.%lu\",\n\t db->filename, (unsigned long) getpid ());\n\tsnprintf (lock, sizeof lock, \"%s.lock\", db->filename);\n\tif (do_lock_file (file, lock, log) != 0) {\n\t\tdb->locked = true;\n\t\tlock_count++;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\n\nint commonio_lock (struct commonio_db *db)\n{\n#ifdef HAVE_LCKPWDF\n\t/*\n\t * only if the system libc has a real lckpwdf() - the one from\n\t * lockpw.c calls us and would cause infinite recursion!\n\t */\n\n\t/*\n\t * Call lckpwdf() on the first lock.\n\t * If it succeeds, call *_lock() only once\n\t * (no retries, it should always succeed).\n\t */\n\tif (0 == lock_count) {\n\t\tif (lckpwdf () == -1) {\n\t\t\tif (geteuid () != 0) {\n\t\t\t\t(void) fprintf (stderr,\n\t\t\t\t \"%s: Permission denied.\\n\",\n\t\t\t\t Prog);\n\t\t\t}\n\t\t\treturn 0;\t/* failure */\n\t\t}\n\t}\n\n\tif (commonio_lock_nowait (db, true) != 0) {\n\t\treturn 1;\t/* success */\n\t}\n\n\tulckpwdf ();\n\treturn 0;\t\t/* failure */\n#else\t\t\t\t/* !HAVE_LCKPWDF */\n\tint i;\n\n\t/*\n\t * lckpwdf() not used - do it the old way.\n\t */\n#ifndef LOCK_TRIES\n#define LOCK_TRIES 15\n#endif\n\n#ifndef LOCK_SLEEP\n#define LOCK_SLEEP 1\n#endif\n\tfor (i = 0; i < LOCK_TRIES; i++) {\n\t\tif (i > 0) {\n\t\t\tsleep (LOCK_SLEEP);\t/* delay between retries */\n\t\t}\n\t\tif (commonio_lock_nowait (db, i==LOCK_TRIES-1) != 0) {\n\t\t\treturn 1;\t/* success */\n\t\t}\n\t\t/* no unnecessary retries on \"permission denied\" errors */\n\t\tif (geteuid () != 0) {\n\t\t\t(void) fprintf (stderr, \"%s: Permission denied.\\n\",\n\t\t\t Prog);\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 0;\t\t/* failure */\n#endif\t\t\t\t/* !HAVE_LCKPWDF */\n}\n\nstatic void dec_lock_count (void)\n{\n\tif (lock_count > 0) {\n\t\tlock_count--;\n\t\tif (lock_count == 0) {\n\t\t\t/* Tell nscd when lock count goes to zero,\n\t\t\t if any of the files were changed. */\n\t\t\tif (nscd_need_reload) {\n\t\t\t\tnscd_flush_cache (\"passwd\");\n\t\t\t\tnscd_flush_cache (\"group\");\n\t\t\t\tnscd_need_reload = false;\n\t\t\t}\n#ifdef HAVE_LCKPWDF\n\t\t\tulckpwdf ();\n#endif\t\t\t\t/* HAVE_LCKPWDF */\n\t\t}\n\t}\n}\n\n\nint commonio_unlock (struct commonio_db *db)\n{\n\tchar lock[1024];\n\n\tif (db->isopen) {\n\t\tdb->readonly = true;\n\t\tif (commonio_close (db) == 0) {\n\t\t\tif (db->locked) {\n\t\t\t\tdec_lock_count ();\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n\tif (db->locked) {\n\t\t/*\n\t\t * Unlock in reverse order: remove the lock file,\n\t\t * then call ulckpwdf() (if used) on last unlock.\n\t\t */\n\t\tdb->locked = false;\n\t\tsnprintf (lock, sizeof lock, \"%s.lock\", db->filename);\n\t\tunlink (lock);\n\t\tdec_lock_count ();\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\n\n/*\n * Add an entry at the end.\n *\n * defines p->next, p->prev\n * (unfortunately, owned special are not supported)\n */\nstatic void add_one_entry (struct commonio_db *db,\n /*@owned@*/struct commonio_entry *p)\n{\n\t/*@-mustfreeonly@*/\n\tp->next = NULL;\n\tp->prev = db->tail;\n\t/*@=mustfreeonly@*/\n\tif (NULL == db->head) {\n\t\tdb->head = p;\n\t}\n\tif (NULL != db->tail) {\n\t\tdb->tail->next = p;\n\t}\n\tdb->tail = p;\n}\n\n\nstatic bool name_is_nis (const char *name)\n{\n\treturn (('+' == name[0]) || ('-' == name[0]));\n}\n\n\n/*\n * New entries are inserted before the first NIS entry. Order is preserved\n * when db is written out.\n */\n#ifndef KEEP_NIS_AT_END\n#define KEEP_NIS_AT_END 1\n#endif\n\n#if KEEP_NIS_AT_END\nstatic void add_one_entry_nis (struct commonio_db *db,\n /*@owned@*/struct commonio_entry *newp);\n\n/*\n * Insert an entry between the regular entries, and the NIS entries.\n *\n * defines newp->next, newp->prev\n * (unfortunately, owned special are not supported)\n */\nstatic void add_one_entry_nis (struct commonio_db *db,\n /*@owned@*/struct commonio_entry *newp)\n{\n\tstruct commonio_entry *p;\n\n\tfor (p = db->head; NULL != p; p = p->next) {\n\t\tif (name_is_nis (p->eptr ? db->ops->getname (p->eptr)\n\t\t : p->line)) {\n\t\t\t/*@-mustfreeonly@*/\n\t\t\tnewp->next = p;\n\t\t\tnewp->prev = p->prev;\n\t\t\t/*@=mustfreeonly@*/\n\t\t\tif (NULL != p->prev) {\n\t\t\t\tp->prev->next = newp;\n\t\t\t} else {\n\t\t\t\tdb->head = newp;\n\t\t\t}\n\t\t\tp->prev = newp;\n\t\t\treturn;\n\t\t}\n\t}\n\tadd_one_entry (db, newp);\n}\n#endif\t\t\t\t/* KEEP_NIS_AT_END */\n\n/* Initial buffer size, as well as increment if not sufficient\n (for reading very long lines in group files). */\n#define BUFLEN 4096\n\nint commonio_open (struct commonio_db *db, int mode)\n{\n\tchar *buf;\n\tchar *cp;\n\tchar *line;\n\tstruct commonio_entry *p;\n\tvoid *eptr = NULL;\n\tint flags = mode;\n\tsize_t buflen;\n\tint fd;\n\tint saved_errno;\n\n\tmode &= ~O_CREAT;\n\n\tif ( db->isopen\n\t || ( (O_RDONLY != mode)\n\t && (O_RDWR != mode))) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tdb->readonly = (mode == O_RDONLY);\n\tif (!db->readonly && !db->locked) {\n\t\terrno = EACCES;\n\t\treturn 0;\n\t}\n\n\tdb->head = NULL;\n\tdb->tail = NULL;\n\tdb->cursor = NULL;\n\tdb->changed = false;\n\n\tfd = open (db->filename,\n\t (db->readonly ? O_RDONLY : O_RDWR)\n\t | O_NOCTTY | O_NONBLOCK | O_NOFOLLOW);\n\tsaved_errno = errno;\n\tdb->fp = NULL;\n\tif (fd >= 0) {\n#ifdef WITH_TCB\n\t\tif (tcb_is_suspect (fd) != 0) {\n\t\t\t(void) close (fd);\n\t\t\terrno = EINVAL;\n\t\t\treturn 0;\n\t\t}\n#endif\t\t\t\t/* WITH_TCB */\n\t\tdb->fp = fdopen (fd, db->readonly ? \"r\" : \"r+\");\n\t\tsaved_errno = errno;\n\t\tif (NULL == db->fp) {\n\t\t\t(void) close (fd);\n\t\t}\n\t}\n\terrno = saved_errno;\n\n\t/*\n\t * If O_CREAT was specified and the file didn't exist, it will be\n\t * created by commonio_close(). We have no entries to read yet. --marekm\n\t */\n\tif (NULL == db->fp) {\n\t\tif (((flags & O_CREAT) != 0) && (ENOENT == errno)) {\n\t\t\tdb->isopen = true;\n\t\t\treturn 1;\n\t\t}\n\t\treturn 0;\n\t}\n\n\t/* Do not inherit fd in spawned processes (e.g. nscd) */\n\tfcntl (fileno (db->fp), F_SETFD, FD_CLOEXEC);\n\n\tbuflen = BUFLEN;\n\tbuf = (char *) malloc (buflen);\n\tif (NULL == buf) {\n\t\tgoto cleanup_ENOMEM;\n\t}\n\n\twhile (db->ops->fgets (buf, (int) buflen, db->fp) == buf) {\n\t\twhile ( ((cp = strrchr (buf, '\\n')) == NULL)\n\t\t && (feof (db->fp) == 0)) {\n\t\t\tsize_t len;\n\n\t\t\tbuflen += BUFLEN;\n\t\t\tcp = (char *) realloc (buf, buflen);\n\t\t\tif (NULL == cp) {\n\t\t\t\tgoto cleanup_buf;\n\t\t\t}\n\t\t\tbuf = cp;\n\t\t\tlen = strlen (buf);\n\t\t\tif (db->ops->fgets (buf + len,\n\t\t\t (int) (buflen - len),\n\t\t\t db->fp) == NULL) {\n\t\t\t\tgoto cleanup_buf;\n\t\t\t}\n\t\t}\n\t\tcp = strrchr (buf, '\\n');\n\t\tif (NULL != cp) {\n\t\t\t*cp = '\\0';\n\t\t}\n\n\t\tline = strdup (buf);\n\t\tif (NULL == line) {\n\t\t\tgoto cleanup_buf;\n\t\t}\n\n\t\tif (name_is_nis (line)) {\n\t\t\teptr = NULL;\n\t\t} else {\n\t\t\teptr = db->ops->parse (line);\n\t\t\tif (NULL != eptr) {\n\t\t\t\teptr = db->ops->dup (eptr);\n\t\t\t\tif (NULL == eptr) {\n\t\t\t\t\tgoto cleanup_line;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tp = (struct commonio_entry *) malloc (sizeof *p);\n\t\tif (NULL == p) {\n\t\t\tgoto cleanup_entry;\n\t\t}\n\n\t\tp->eptr = eptr;\n\t\tp->line = line;\n\t\tp->changed = false;\n\n\t\tadd_one_entry (db, p);\n\t}\n\n\tfree (buf);\n\n\tif (ferror (db->fp) != 0) {\n\t\tgoto cleanup_errno;\n\t}\n\n\tif ((NULL != db->ops->open_hook) && (db->ops->open_hook () == 0)) {\n\t\tgoto cleanup_errno;\n\t}\n\n\tdb->isopen = true;\n\treturn 1;\n\n cleanup_entry:\n\tif (NULL != eptr) {\n\t\tdb->ops->free (eptr);\n\t}\n cleanup_line:\n\tfree (line);\n cleanup_buf:\n\tfree (buf);\n cleanup_ENOMEM:\n\terrno = ENOMEM;\n cleanup_errno:\n\tsaved_errno = errno;\n\tfree_linked_list (db);\n\tfclose (db->fp);\n\tdb->fp = NULL;\n\terrno = saved_errno;\n\treturn 0;\n}\n\n/*\n * Sort given db according to cmp function (usually compares uids)\n */\nint\ncommonio_sort (struct commonio_db *db, int (*cmp) (const void *, const void *))\n{\n\tstruct commonio_entry **entries, *ptr;\n\tsize_t n = 0, i;\n#if KEEP_NIS_AT_END\n\tstruct commonio_entry *nis = NULL;\n#endif\n\n\tfor (ptr = db->head;\n\t (NULL != ptr)\n#if KEEP_NIS_AT_END\n\t && (NULL != ptr->line)\n\t && ( ('+' != ptr->line[0])\n\t && ('-' != ptr->line[0]))\n#endif\n\t ;\n\t ptr = ptr->next) {\n\t\tn++;\n\t}\n#if KEEP_NIS_AT_END\n\tif ((NULL != ptr) && (NULL != ptr->line)) {\n\t\tnis = ptr;\n\t}\n#endif\n\n\tif (n <= 1) {\n\t\treturn 0;\n\t}\n\n\tentries = malloc (n * sizeof (struct commonio_entry *));\n\tif (entries == NULL) {\n\t\treturn -1;\n\t}\n\n\tn = 0;\n\tfor (ptr = db->head;\n#if KEEP_NIS_AT_END\n\t nis != ptr;\n#else\n\t NULL != ptr;\n#endif\n/*@ -nullderef @*/\n\t ptr = ptr->next\n/*@ +nullderef @*/\n\t ) {\n\t\tentries[n] = ptr;\n\t\tn++;\n\t}\n\tqsort (entries, n, sizeof (struct commonio_entry *), cmp);\n\n\t/* Take care of the head and tail separately */\n\tdb->head = entries[0];\n\tn--;\n#if KEEP_NIS_AT_END\n\tif (NULL == nis)\n#endif\n\t{\n\t\tdb->tail = entries[n];\n\t}\n\tdb->head->prev = NULL;\n\tdb->head->next = entries[1];\n\tentries[n]->prev = entries[n - 1];\n#if KEEP_NIS_AT_END\n\tentries[n]->next = nis;\n#else\n\tentries[n]->next = NULL;\n#endif\n\n\t/* Now other elements have prev and next entries */\n\tfor (i = 1; i < n; i++) {\n\t\tentries[i]->prev = entries[i - 1];\n\t\tentries[i]->next = entries[i + 1];\n\t}\n\n\tfree (entries);\n\tdb->changed = true;\n\n\treturn 0;\n}\n\n/*\n * Sort entries in db according to order in another.\n */\nint commonio_sort_wrt (struct commonio_db *shadow,\n const struct commonio_db *passwd)\n{\n\tstruct commonio_entry *head = NULL, *pw_ptr, *spw_ptr;\n\tconst char *name;\n\n\tif ((NULL == shadow) || (NULL == shadow->head)) {\n\t\treturn 0;\n\t}\n\n\tfor (pw_ptr = passwd->head; NULL != pw_ptr; pw_ptr = pw_ptr->next) {\n\t\tif (NULL == pw_ptr->eptr) {\n\t\t\tcontinue;\n\t\t}\n\t\tname = passwd->ops->getname (pw_ptr->eptr);\n\t\tfor (spw_ptr = shadow->head;\n\t\t NULL != spw_ptr;\n\t\t spw_ptr = spw_ptr->next) {\n\t\t\tif (NULL == spw_ptr->eptr) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (strcmp (name, shadow->ops->getname (spw_ptr->eptr))\n\t\t\t == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NULL == spw_ptr) {\n\t\t\tcontinue;\n\t\t}\n\t\tcommonio_del_entry (shadow, spw_ptr);\n\t\tspw_ptr->next = head;\n\t\thead = spw_ptr;\n\t}\n\n\tfor (spw_ptr = head; NULL != spw_ptr; spw_ptr = head) {\n\t\thead = head->next;\n\n\t\tif (NULL != shadow->head) {\n\t\t\tshadow->head->prev = spw_ptr;\n\t\t}\n\t\tspw_ptr->next = shadow->head;\n\t\tshadow->head = spw_ptr;\n\t}\n\n\tshadow->head->prev = NULL;\n\tshadow->changed = true;\n\n\treturn 0;\n}\n\n/*\n * write_all - Write the database to its file.\n *\n * It returns 0 if all the entries could be written correctly.\n */\nstatic int write_all (const struct commonio_db *db)\n\t/*@requires notnull db->fp@*/\n{\n\tconst struct commonio_entry *p;\n\tvoid *eptr;\n\n\tfor (p = db->head; NULL != p; p = p->next) {\n\t\tif (p->changed) {\n\t\t\teptr = p->eptr;\n\t\t\tassert (NULL != eptr);\n\t\t\tif (db->ops->put (eptr, db->fp) != 0) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t} else if (NULL != p->line) {\n\t\t\tif (db->ops->fputs (p->line, db->fp) == EOF) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (putc ('\\n', db->fp) == EOF) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\n\nint commonio_close (struct commonio_db *db)\n\t/*@requires notnull db->fp@*/\n{\n\tchar buf[1024];\n\tint errors = 0;\n\tstruct stat sb;\n\n\tif (!db->isopen) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tdb->isopen = false;\n\n\tif (!db->changed || db->readonly) {\n\t\t(void) fclose (db->fp);\n\t\tdb->fp = NULL;\n\t\tgoto success;\n\t}\n\n\tif ((NULL != db->ops->close_hook) && (db->ops->close_hook () == 0)) {\n\t\tgoto fail;\n\t}\n\n\tmemzero (&sb, sizeof sb);\n\tif (NULL != db->fp) {\n\t\tif (fstat (fileno (db->fp), &sb) != 0) {\n\t\t\t(void) fclose (db->fp);\n\t\t\tdb->fp = NULL;\n\t\t\tgoto fail;\n\t\t}\n\n\t\t/*\n\t\t * Create backup file.\n\t\t */\n\t\tsnprintf (buf, sizeof buf, \"%s-\", db->filename);\n\n#ifdef WITH_SELINUX\n\t\tif (set_selinux_file_context (buf) != 0) {\n\t\t\terrors++;\n\t\t}\n#endif\n\t\tif (create_backup (buf, db->fp) != 0) {\n\t\t\terrors++;\n\t\t}\n\n\t\tif (fclose (db->fp) != 0) {\n\t\t\terrors++;\n\t\t}\n\n#ifdef WITH_SELINUX\n\t\tif (reset_selinux_file_context () != 0) {\n\t\t\terrors++;\n\t\t}\n#endif\n\t\tif (errors != 0) {\n\t\t\tdb->fp = NULL;\n\t\t\tgoto fail;\n\t\t}\n\t} else {\n\t\t/*\n\t\t * Default permissions for new [g]shadow files.\n\t\t */\n\t\tsb.st_mode = db->st_mode;\n\t\tsb.st_uid = db->st_uid;\n\t\tsb.st_gid = db->st_gid;\n\t}\n\n\tsnprintf (buf, sizeof buf, \"%s+\", db->filename);\n\n#ifdef WITH_SELINUX\n\tif (set_selinux_file_context (buf) != 0) {\n\t\terrors++;\n\t}\n#endif\n\n\tdb->fp = fopen_set_perms (buf, \"w\", &sb);\n\tif (NULL == db->fp) {\n\t\tgoto fail;\n\t}\n\n\tif (write_all (db) != 0) {\n\t\terrors++;\n\t}\n\n\tif (fflush (db->fp) != 0) {\n\t\terrors++;\n\t}\n#ifdef HAVE_FSYNC\n\tif (fsync (fileno (db->fp)) != 0) {\n\t\terrors++;\n\t}\n#else\t\t\t\t/* !HAVE_FSYNC */\n\tsync ();\n#endif\t\t\t\t/* !HAVE_FSYNC */\n\tif (fclose (db->fp) != 0) {\n\t\terrors++;\n\t}\n\n\tdb->fp = NULL;\n\n\tif (errors != 0) {\n\t\tunlink (buf);\n\t\tgoto fail;\n\t}\n\n\tif (lrename (buf, db->filename) != 0) {\n\t\tgoto fail;\n\t}\n\n#ifdef WITH_SELINUX\n\tif (reset_selinux_file_context () != 0) {\n\t\tgoto fail;\n\t}\n#endif\n\n\tnscd_need_reload = true;\n\tgoto success;\n fail:\n\terrors++;\n success:\n\n\tfree_linked_list (db);\n\treturn errors == 0;\n}\n\nstatic /*@dependent@*/ /*@null@*/struct commonio_entry *next_entry_by_name (\n\tstruct commonio_db *db,\n\t/*@null@*/struct commonio_entry *pos,\n\tconst char *name)\n{\n\tstruct commonio_entry *p;\n\tvoid *ep;\n\n\tif (NULL == pos) {\n\t\treturn NULL;\n\t}\n\n\tfor (p = pos; NULL != p; p = p->next) {\n\t\tep = p->eptr;\n\t\tif ( (NULL != ep)\n\t\t && (strcmp (db->ops->getname (ep), name) == 0)) {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn p;\n}\n\nstatic /*@dependent@*/ /*@null@*/struct commonio_entry *find_entry_by_name (\n\tstruct commonio_db *db,\n\tconst char *name)\n{\n\treturn next_entry_by_name (db, db->head, name);\n}\n\n\nint commonio_update (struct commonio_db *db, const void *eptr)\n{\n\tstruct commonio_entry *p;\n\tvoid *nentry;\n\n\tif (!db->isopen || db->readonly) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tnentry = db->ops->dup (eptr);\n\tif (NULL == nentry) {\n\t\terrno = ENOMEM;\n\t\treturn 0;\n\t}\n\tp = find_entry_by_name (db, db->ops->getname (eptr));\n\tif (NULL != p) {\n\t\tif (next_entry_by_name (db, p->next, db->ops->getname (eptr)) != NULL) {\n\t\t\tfprintf (stderr, _(\"Multiple entries named '%s' in %s. Please fix this with pwck or grpck.\\n\"), db->ops->getname (eptr), db->filename);\n\t\t\tdb->ops->free (nentry);\n\t\t\treturn 0;\n\t\t}\n\t\tdb->ops->free (p->eptr);\n\t\tp->eptr = nentry;\n\t\tp->changed = true;\n\t\tdb->cursor = p;\n\n\t\tdb->changed = true;\n\t\treturn 1;\n\t}\n\t/* not found, new entry */\n\tp = (struct commonio_entry *) malloc (sizeof *p);\n\tif (NULL == p) {\n\t\tdb->ops->free (nentry);\n\t\terrno = ENOMEM;\n\t\treturn 0;\n\t}\n\n\tp->eptr = nentry;\n\tp->line = NULL;\n\tp->changed = true;\n\n#if KEEP_NIS_AT_END\n\tadd_one_entry_nis (db, p);\n#else\t\t\t\t/* !KEEP_NIS_AT_END */\n\tadd_one_entry (db, p);\n#endif\t\t\t\t/* !KEEP_NIS_AT_END */\n\n\tdb->changed = true;\n\treturn 1;\n}\n\n#ifdef ENABLE_SUBIDS\nint commonio_append (struct commonio_db *db, const void *eptr)\n{\n\tstruct commonio_entry *p;\n\tvoid *nentry;\n\n\tif (!db->isopen || db->readonly) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tnentry = db->ops->dup (eptr);\n\tif (NULL == nentry) {\n\t\terrno = ENOMEM;\n\t\treturn 0;\n\t}\n\t/* new entry */\n\tp = (struct commonio_entry *) malloc (sizeof *p);\n\tif (NULL == p) {\n\t\tdb->ops->free (nentry);\n\t\terrno = ENOMEM;\n\t\treturn 0;\n\t}\n\n\tp->eptr = nentry;\n\tp->line = NULL;\n\tp->changed = true;\n\tadd_one_entry (db, p);\n\n\tdb->changed = true;\n\treturn 1;\n}\n#endif\t\t\t\t/* ENABLE_SUBIDS */\n\nvoid commonio_del_entry (struct commonio_db *db, const struct commonio_entry *p)\n{\n\tif (p == db->cursor) {\n\t\tdb->cursor = p->next;\n\t}\n\n\tif (NULL != p->prev) {\n\t\tp->prev->next = p->next;\n\t} else {\n\t\tdb->head = p->next;\n\t}\n\n\tif (NULL != p->next) {\n\t\tp->next->prev = p->prev;\n\t} else {\n\t\tdb->tail = p->prev;\n\t}\n\n\tdb->changed = true;\n}\n\n/*\n * commonio_remove - Remove the entry of the given name from the database.\n */\nint commonio_remove (struct commonio_db *db, const char *name)\n{\n\tstruct commonio_entry *p;\n\n\tif (!db->isopen || db->readonly) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tp = find_entry_by_name (db, name);\n\tif (NULL == p) {\n\t\terrno = ENOENT;\n\t\treturn 0;\n\t}\n\tif (next_entry_by_name (db, p->next, name) != NULL) {\n\t\tfprintf (stderr, _(\"Multiple entries named '%s' in %s. Please fix this with pwck or grpck.\\n\"), name, db->filename);\n\t\treturn 0;\n\t}\n\n\tcommonio_del_entry (db, p);\n\n\tif (NULL != p->line) {\n\t\tfree (p->line);\n\t}\n\n\tif (NULL != p->eptr) {\n\t\tdb->ops->free (p->eptr);\n\t}\n\n\treturn 1;\n}\n\n/*\n * commonio_locate - Find the first entry with the specified name in\n * the database.\n *\n *\tIf found, it returns the entry and set the cursor of the database to\n *\tthat entry.\n *\n *\tOtherwise, it returns NULL.\n */\n/*@observer@*/ /*@null@*/const void *commonio_locate (struct commonio_db *db, const char *name)\n{\n\tstruct commonio_entry *p;\n\n\tif (!db->isopen) {\n\t\terrno = EINVAL;\n\t\treturn NULL;\n\t}\n\tp = find_entry_by_name (db, name);\n\tif (NULL == p) {\n\t\terrno = ENOENT;\n\t\treturn NULL;\n\t}\n\tdb->cursor = p;\n\treturn p->eptr;\n}\n\n/*\n * commonio_rewind - Restore the database cursor to the first entry.\n *\n * It returns 0 on error, 1 on success.\n */\nint commonio_rewind (struct commonio_db *db)\n{\n\tif (!db->isopen) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tdb->cursor = NULL;\n\treturn 1;\n}\n\n/*\n * commonio_next - Return the next entry of the specified database\n *\n * It returns the next entry, or NULL if no other entries could be found.\n */\n/*@observer@*/ /*@null@*/const void *commonio_next (struct commonio_db *db)\n{\n\tvoid *eptr;\n\n\tif (!db->isopen) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tif (NULL == db->cursor) {\n\t\tdb->cursor = db->head;\n\t} else {\n\t\tdb->cursor = db->cursor->next;\n\t}\n\n\twhile (NULL != db->cursor) {\n\t\teptr = db->cursor->eptr;\n\t\tif (NULL != eptr) {\n\t\t\treturn eptr;\n\t\t}\n\n\t\tdb->cursor = db->cursor->next;\n\t}\n\treturn NULL;\n}\n\n"},"code_after":{"kind":"string","value":"/*\n * Copyright (c) 1990 - 1994, Julianne Frances Haugh\n * Copyright (c) 1996 - 2001, Marek Michałkiewicz\n * Copyright (c) 2001 - 2006, Tomasz Kłoczko\n * Copyright (c) 2007 - 2011, Nicolas François\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. The name of the copyright holders or contributors may not be used to\n * endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \n\n#ident \"$Id$\"\n\n#include \"defines.h\"\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \"nscd.h\"\n#ifdef WITH_TCB\n#include \n#endif\t\t\t\t/* WITH_TCB */\n#include \"prototypes.h\"\n#include \"commonio.h\"\n\n/* local function prototypes */\nstatic int lrename (const char *, const char *);\nstatic int check_link_count (const char *file);\nstatic int do_lock_file (const char *file, const char *lock, bool log);\nstatic /*@null@*/ /*@dependent@*/FILE *fopen_set_perms (\n\tconst char *name,\n\tconst char *mode,\n\tconst struct stat *sb);\nstatic int create_backup (const char *, FILE *);\nstatic void free_linked_list (struct commonio_db *);\nstatic void add_one_entry (\n\tstruct commonio_db *db,\n\t/*@owned@*/struct commonio_entry *p);\nstatic bool name_is_nis (const char *name);\nstatic int write_all (const struct commonio_db *);\nstatic /*@dependent@*/ /*@null@*/struct commonio_entry *find_entry_by_name (\n\tstruct commonio_db *,\n\tconst char *);\nstatic /*@dependent@*/ /*@null@*/struct commonio_entry *next_entry_by_name (\n\tstruct commonio_db *,\n\t/*@null@*/struct commonio_entry *pos,\n\tconst char *);\n\nstatic int lock_count = 0;\nstatic bool nscd_need_reload = false;\n\n/*\n * Simple rename(P) alternative that attempts to rename to symlink\n * target.\n */\nint lrename (const char *old, const char *new)\n{\n\tint res;\n\tchar *r = NULL;\n\n#if defined(S_ISLNK)\n#ifndef __GLIBC__\n\tchar resolved_path[PATH_MAX];\n#endif\t\t\t\t/* !__GLIBC__ */\n\tstruct stat sb;\n\tif (lstat (new, &sb) == 0 && S_ISLNK (sb.st_mode)) {\n#ifdef __GLIBC__ /* now a POSIX.1-2008 feature */\n\t\tr = realpath (new, NULL);\n#else\t\t\t\t/* !__GLIBC__ */\n\t\tr = realpath (new, resolved_path);\n#endif\t\t\t\t/* !__GLIBC__ */\n\t\tif (NULL == r) {\n\t\t\tperror (\"realpath in lrename()\");\n\t\t} else {\n\t\t\tnew = r;\n\t\t}\n\t}\n#endif\t\t\t\t/* S_ISLNK */\n\n\tres = rename (old, new);\n\n#ifdef __GLIBC__\n\tif (NULL != r) {\n\t\tfree (r);\n\t}\n#endif\t\t\t\t/* __GLIBC__ */\n\n\treturn res;\n}\n\nstatic int check_link_count (const char *file)\n{\n\tstruct stat sb;\n\n\tif (stat (file, &sb) != 0) {\n\t\treturn 0;\n\t}\n\n\tif (sb.st_nlink != 2) {\n\t\treturn 0;\n\t}\n\n\treturn 1;\n}\n\n\nstatic int do_lock_file (const char *file, const char *lock, bool log)\n{\n\tint fd;\n\tpid_t pid;\n\tssize_t len;\n\tint retval;\n\tchar buf[32];\n\n\tfd = open (file, O_CREAT | O_EXCL | O_WRONLY, 0600);\n\tif (-1 == fd) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: %s\\n\",\n\t\t\t Prog, file, strerror (errno));\n\t\t}\n\t\treturn 0;\n\t}\n\n\tpid = getpid ();\n\tsnprintf (buf, sizeof buf, \"%lu\", (unsigned long) pid);\n\tlen = (ssize_t) strlen (buf) + 1;\n\tif (write (fd, buf, (size_t) len) != len) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: %s\\n\",\n\t\t\t Prog, file, strerror (errno));\n\t\t}\n\t\t(void) close (fd);\n\t\tunlink (file);\n\t\treturn 0;\n\t}\n\tclose (fd);\n\n\tif (link (file, lock) == 0) {\n\t\tretval = check_link_count (file);\n\t\tif ((0==retval) && log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: lock file already used\\n\",\n\t\t\t Prog, file);\n\t\t}\n\t\tunlink (file);\n\t\treturn retval;\n\t}\n\n\tfd = open (lock, O_RDWR);\n\tif (-1 == fd) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: %s\\n\",\n\t\t\t Prog, lock, strerror (errno));\n\t\t}\n\t\tunlink (file);\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tlen = read (fd, buf, sizeof (buf) - 1);\n\tclose (fd);\n\tif (len <= 0) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: existing lock file %s without a PID\\n\",\n\t\t\t Prog, lock);\n\t\t}\n\t\tunlink (file);\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tbuf[len] = '\\0';\n\tif (get_pid (buf, &pid) == 0) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: existing lock file %s with an invalid PID '%s'\\n\",\n\t\t\t Prog, lock, buf);\n\t\t}\n\t\tunlink (file);\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tif (kill (pid, 0) == 0) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: lock %s already used by PID %lu\\n\",\n\t\t\t Prog, lock, (unsigned long) pid);\n\t\t}\n\t\tunlink (file);\n\t\terrno = EEXIST;\n\t\treturn 0;\n\t}\n\tif (unlink (lock) != 0) {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: cannot get lock %s: %s\\n\",\n\t\t\t Prog, lock, strerror (errno));\n\t\t}\n\t\tunlink (file);\n\t\treturn 0;\n\t}\n\n\tretval = 0;\n\tif (link (file, lock) == 0) {\n\t\tretval = check_link_count (file);\n\t\tif ((0==retval) && log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: %s: lock file already used\\n\",\n\t\t\t Prog, file);\n\t\t}\n\t} else {\n\t\tif (log) {\n\t\t\t(void) fprintf (stderr,\n\t\t\t \"%s: cannot get lock %s: %s\\n\",\n\t\t\t Prog, lock, strerror (errno));\n\t\t}\n\t}\n\n\tunlink (file);\n\treturn retval;\n}\n\n\nstatic /*@null@*/ /*@dependent@*/FILE *fopen_set_perms (\n\tconst char *name,\n\tconst char *mode,\n\tconst struct stat *sb)\n{\n\tFILE *fp;\n\tmode_t mask;\n\n\tmask = umask (0777);\n\tfp = fopen (name, mode);\n\t(void) umask (mask);\n\tif (NULL == fp) {\n\t\treturn NULL;\n\t}\n\n#ifdef HAVE_FCHOWN\n\tif (fchown (fileno (fp), sb->st_uid, sb->st_gid) != 0) {\n\t\tgoto fail;\n\t}\n#else\t\t\t\t/* !HAVE_FCHOWN */\n\tif (chown (name, sb->st_mode) != 0) {\n\t\tgoto fail;\n\t}\n#endif\t\t\t\t/* !HAVE_FCHOWN */\n\n#ifdef HAVE_FCHMOD\n\tif (fchmod (fileno (fp), sb->st_mode & 0664) != 0) {\n\t\tgoto fail;\n\t}\n#else\t\t\t\t/* !HAVE_FCHMOD */\n\tif (chmod (name, sb->st_mode & 0664) != 0) {\n\t\tgoto fail;\n\t}\n#endif\t\t\t\t/* !HAVE_FCHMOD */\n\treturn fp;\n\n fail:\n\t(void) fclose (fp);\n\t/* fopen_set_perms is used for intermediate files */\n\t(void) unlink (name);\n\treturn NULL;\n}\n\n\nstatic int create_backup (const char *backup, FILE * fp)\n{\n\tstruct stat sb;\n\tstruct utimbuf ub;\n\tFILE *bkfp;\n\tint c;\n\n\tif (fstat (fileno (fp), &sb) != 0) {\n\t\treturn -1;\n\t}\n\n\tbkfp = fopen_set_perms (backup, \"w\", &sb);\n\tif (NULL == bkfp) {\n\t\treturn -1;\n\t}\n\n\t/* TODO: faster copy, not one-char-at-a-time. --marekm */\n\tc = 0;\n\tif (fseek (fp, 0, SEEK_SET) == 0) {\n\t\twhile ((c = getc (fp)) != EOF) {\n\t\t\tif (putc (c, bkfp) == EOF) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif ((c != EOF) || (ferror (fp) != 0) || (fflush (bkfp) != 0)) {\n\t\t(void) fclose (bkfp);\n\t\t/* FIXME: unlink the backup file? */\n\t\treturn -1;\n\t}\n\tif ( (fsync (fileno (bkfp)) != 0)\n\t || (fclose (bkfp) != 0)) {\n\t\t/* FIXME: unlink the backup file? */\n\t\treturn -1;\n\t}\n\n\tub.actime = sb.st_atime;\n\tub.modtime = sb.st_mtime;\n\t(void) utime (backup, &ub);\n\treturn 0;\n}\n\n\nstatic void free_linked_list (struct commonio_db *db)\n{\n\tstruct commonio_entry *p;\n\n\twhile (NULL != db->head) {\n\t\tp = db->head;\n\t\tdb->head = p->next;\n\n\t\tif (NULL != p->line) {\n\t\t\tfree (p->line);\n\t\t}\n\n\t\tif (NULL != p->eptr) {\n\t\t\tdb->ops->free (p->eptr);\n\t\t}\n\n\t\tfree (p);\n\t}\n\tdb->tail = NULL;\n}\n\n\nint commonio_setname (struct commonio_db *db, const char *name)\n{\n\tsnprintf (db->filename, sizeof (db->filename), \"%s\", name);\n\treturn 1;\n}\n\n\nbool commonio_present (const struct commonio_db *db)\n{\n\treturn (access (db->filename, F_OK) == 0);\n}\n\n\nint commonio_lock_nowait (struct commonio_db *db, bool log)\n{\n\tchar file[1024];\n\tchar lock[1024];\n\n\tif (db->locked) {\n\t\treturn 1;\n\t}\n\n\tsnprintf (file, sizeof file, \"%s.%lu\",\n\t db->filename, (unsigned long) getpid ());\n\tsnprintf (lock, sizeof lock, \"%s.lock\", db->filename);\n\tif (do_lock_file (file, lock, log) != 0) {\n\t\tdb->locked = true;\n\t\tlock_count++;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\n\nint commonio_lock (struct commonio_db *db)\n{\n#ifdef HAVE_LCKPWDF\n\t/*\n\t * only if the system libc has a real lckpwdf() - the one from\n\t * lockpw.c calls us and would cause infinite recursion!\n\t */\n\n\t/*\n\t * Call lckpwdf() on the first lock.\n\t * If it succeeds, call *_lock() only once\n\t * (no retries, it should always succeed).\n\t */\n\tif (0 == lock_count) {\n\t\tif (lckpwdf () == -1) {\n\t\t\tif (geteuid () != 0) {\n\t\t\t\t(void) fprintf (stderr,\n\t\t\t\t \"%s: Permission denied.\\n\",\n\t\t\t\t Prog);\n\t\t\t}\n\t\t\treturn 0;\t/* failure */\n\t\t}\n\t}\n\n\tif (commonio_lock_nowait (db, true) != 0) {\n\t\treturn 1;\t/* success */\n\t}\n\n\tulckpwdf ();\n\treturn 0;\t\t/* failure */\n#else\t\t\t\t/* !HAVE_LCKPWDF */\n\tint i;\n\n\t/*\n\t * lckpwdf() not used - do it the old way.\n\t */\n#ifndef LOCK_TRIES\n#define LOCK_TRIES 15\n#endif\n\n#ifndef LOCK_SLEEP\n#define LOCK_SLEEP 1\n#endif\n\tfor (i = 0; i < LOCK_TRIES; i++) {\n\t\tif (i > 0) {\n\t\t\tsleep (LOCK_SLEEP);\t/* delay between retries */\n\t\t}\n\t\tif (commonio_lock_nowait (db, i==LOCK_TRIES-1) != 0) {\n\t\t\treturn 1;\t/* success */\n\t\t}\n\t\t/* no unnecessary retries on \"permission denied\" errors */\n\t\tif (geteuid () != 0) {\n\t\t\t(void) fprintf (stderr, \"%s: Permission denied.\\n\",\n\t\t\t Prog);\n\t\t\treturn 0;\n\t\t}\n\t}\n\treturn 0;\t\t/* failure */\n#endif\t\t\t\t/* !HAVE_LCKPWDF */\n}\n\nstatic void dec_lock_count (void)\n{\n\tif (lock_count > 0) {\n\t\tlock_count--;\n\t\tif (lock_count == 0) {\n\t\t\t/* Tell nscd when lock count goes to zero,\n\t\t\t if any of the files were changed. */\n\t\t\tif (nscd_need_reload) {\n\t\t\t\tnscd_flush_cache (\"passwd\");\n\t\t\t\tnscd_flush_cache (\"group\");\n\t\t\t\tnscd_need_reload = false;\n\t\t\t}\n#ifdef HAVE_LCKPWDF\n\t\t\tulckpwdf ();\n#endif\t\t\t\t/* HAVE_LCKPWDF */\n\t\t}\n\t}\n}\n\n\nint commonio_unlock (struct commonio_db *db)\n{\n\tchar lock[1024];\n\n\tif (db->isopen) {\n\t\tdb->readonly = true;\n\t\tif (commonio_close (db) == 0) {\n\t\t\tif (db->locked) {\n\t\t\t\tdec_lock_count ();\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n\tif (db->locked) {\n\t\t/*\n\t\t * Unlock in reverse order: remove the lock file,\n\t\t * then call ulckpwdf() (if used) on last unlock.\n\t\t */\n\t\tdb->locked = false;\n\t\tsnprintf (lock, sizeof lock, \"%s.lock\", db->filename);\n\t\tunlink (lock);\n\t\tdec_lock_count ();\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\n\n/*\n * Add an entry at the end.\n *\n * defines p->next, p->prev\n * (unfortunately, owned special are not supported)\n */\nstatic void add_one_entry (struct commonio_db *db,\n /*@owned@*/struct commonio_entry *p)\n{\n\t/*@-mustfreeonly@*/\n\tp->next = NULL;\n\tp->prev = db->tail;\n\t/*@=mustfreeonly@*/\n\tif (NULL == db->head) {\n\t\tdb->head = p;\n\t}\n\tif (NULL != db->tail) {\n\t\tdb->tail->next = p;\n\t}\n\tdb->tail = p;\n}\n\n\nstatic bool name_is_nis (const char *name)\n{\n\treturn (('+' == name[0]) || ('-' == name[0]));\n}\n\n\n/*\n * New entries are inserted before the first NIS entry. Order is preserved\n * when db is written out.\n */\n#ifndef KEEP_NIS_AT_END\n#define KEEP_NIS_AT_END 1\n#endif\n\n#if KEEP_NIS_AT_END\nstatic void add_one_entry_nis (struct commonio_db *db,\n /*@owned@*/struct commonio_entry *newp);\n\n/*\n * Insert an entry between the regular entries, and the NIS entries.\n *\n * defines newp->next, newp->prev\n * (unfortunately, owned special are not supported)\n */\nstatic void add_one_entry_nis (struct commonio_db *db,\n /*@owned@*/struct commonio_entry *newp)\n{\n\tstruct commonio_entry *p;\n\n\tfor (p = db->head; NULL != p; p = p->next) {\n\t\tif (name_is_nis (p->eptr ? db->ops->getname (p->eptr)\n\t\t : p->line)) {\n\t\t\t/*@-mustfreeonly@*/\n\t\t\tnewp->next = p;\n\t\t\tnewp->prev = p->prev;\n\t\t\t/*@=mustfreeonly@*/\n\t\t\tif (NULL != p->prev) {\n\t\t\t\tp->prev->next = newp;\n\t\t\t} else {\n\t\t\t\tdb->head = newp;\n\t\t\t}\n\t\t\tp->prev = newp;\n\t\t\treturn;\n\t\t}\n\t}\n\tadd_one_entry (db, newp);\n}\n#endif\t\t\t\t/* KEEP_NIS_AT_END */\n\n/* Initial buffer size, as well as increment if not sufficient\n (for reading very long lines in group files). */\n#define BUFLEN 4096\n\nint commonio_open (struct commonio_db *db, int mode)\n{\n\tchar *buf;\n\tchar *cp;\n\tchar *line;\n\tstruct commonio_entry *p;\n\tvoid *eptr = NULL;\n\tint flags = mode;\n\tsize_t buflen;\n\tint fd;\n\tint saved_errno;\n\n\tmode &= ~O_CREAT;\n\n\tif ( db->isopen\n\t || ( (O_RDONLY != mode)\n\t && (O_RDWR != mode))) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tdb->readonly = (mode == O_RDONLY);\n\tif (!db->readonly && !db->locked) {\n\t\terrno = EACCES;\n\t\treturn 0;\n\t}\n\n\tdb->head = NULL;\n\tdb->tail = NULL;\n\tdb->cursor = NULL;\n\tdb->changed = false;\n\n\tfd = open (db->filename,\n\t (db->readonly ? O_RDONLY : O_RDWR)\n\t | O_NOCTTY | O_NONBLOCK | O_NOFOLLOW);\n\tsaved_errno = errno;\n\tdb->fp = NULL;\n\tif (fd >= 0) {\n#ifdef WITH_TCB\n\t\tif (tcb_is_suspect (fd) != 0) {\n\t\t\t(void) close (fd);\n\t\t\terrno = EINVAL;\n\t\t\treturn 0;\n\t\t}\n#endif\t\t\t\t/* WITH_TCB */\n\t\tdb->fp = fdopen (fd, db->readonly ? \"r\" : \"r+\");\n\t\tsaved_errno = errno;\n\t\tif (NULL == db->fp) {\n\t\t\t(void) close (fd);\n\t\t}\n\t}\n\terrno = saved_errno;\n\n\t/*\n\t * If O_CREAT was specified and the file didn't exist, it will be\n\t * created by commonio_close(). We have no entries to read yet. --marekm\n\t */\n\tif (NULL == db->fp) {\n\t\tif (((flags & O_CREAT) != 0) && (ENOENT == errno)) {\n\t\t\tdb->isopen = true;\n\t\t\treturn 1;\n\t\t}\n\t\treturn 0;\n\t}\n\n\t/* Do not inherit fd in spawned processes (e.g. nscd) */\n\tfcntl (fileno (db->fp), F_SETFD, FD_CLOEXEC);\n\n\tbuflen = BUFLEN;\n\tbuf = (char *) malloc (buflen);\n\tif (NULL == buf) {\n\t\tgoto cleanup_ENOMEM;\n\t}\n\n\twhile (db->ops->fgets (buf, (int) buflen, db->fp) == buf) {\n\t\twhile ( ((cp = strrchr (buf, '\\n')) == NULL)\n\t\t && (feof (db->fp) == 0)) {\n\t\t\tsize_t len;\n\n\t\t\tbuflen += BUFLEN;\n\t\t\tcp = (char *) realloc (buf, buflen);\n\t\t\tif (NULL == cp) {\n\t\t\t\tgoto cleanup_buf;\n\t\t\t}\n\t\t\tbuf = cp;\n\t\t\tlen = strlen (buf);\n\t\t\tif (db->ops->fgets (buf + len,\n\t\t\t (int) (buflen - len),\n\t\t\t db->fp) == NULL) {\n\t\t\t\tgoto cleanup_buf;\n\t\t\t}\n\t\t}\n\t\tcp = strrchr (buf, '\\n');\n\t\tif (NULL != cp) {\n\t\t\t*cp = '\\0';\n\t\t}\n\n\t\tline = strdup (buf);\n\t\tif (NULL == line) {\n\t\t\tgoto cleanup_buf;\n\t\t}\n\n\t\tif (name_is_nis (line)) {\n\t\t\teptr = NULL;\n\t\t} else {\n\t\t\teptr = db->ops->parse (line);\n\t\t\tif (NULL != eptr) {\n\t\t\t\teptr = db->ops->dup (eptr);\n\t\t\t\tif (NULL == eptr) {\n\t\t\t\t\tgoto cleanup_line;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tp = (struct commonio_entry *) malloc (sizeof *p);\n\t\tif (NULL == p) {\n\t\t\tgoto cleanup_entry;\n\t\t}\n\n\t\tp->eptr = eptr;\n\t\tp->line = line;\n\t\tp->changed = false;\n\n\t\tadd_one_entry (db, p);\n\t}\n\n\tfree (buf);\n\n\tif (ferror (db->fp) != 0) {\n\t\tgoto cleanup_errno;\n\t}\n\n\tif ((NULL != db->ops->open_hook) && (db->ops->open_hook () == 0)) {\n\t\tgoto cleanup_errno;\n\t}\n\n\tdb->isopen = true;\n\treturn 1;\n\n cleanup_entry:\n\tif (NULL != eptr) {\n\t\tdb->ops->free (eptr);\n\t}\n cleanup_line:\n\tfree (line);\n cleanup_buf:\n\tfree (buf);\n cleanup_ENOMEM:\n\terrno = ENOMEM;\n cleanup_errno:\n\tsaved_errno = errno;\n\tfree_linked_list (db);\n\tfclose (db->fp);\n\tdb->fp = NULL;\n\terrno = saved_errno;\n\treturn 0;\n}\n\n/*\n * Sort given db according to cmp function (usually compares uids)\n */\nint\ncommonio_sort (struct commonio_db *db, int (*cmp) (const void *, const void *))\n{\n\tstruct commonio_entry **entries, *ptr;\n\tsize_t n = 0, i;\n#if KEEP_NIS_AT_END\n\tstruct commonio_entry *nis = NULL;\n#endif\n\n\tfor (ptr = db->head;\n\t (NULL != ptr)\n#if KEEP_NIS_AT_END\n\t && ((NULL == ptr->line)\n\t || (('+' != ptr->line[0])\n\t && ('-' != ptr->line[0])))\n#endif\n\t ;\n\t ptr = ptr->next) {\n\t\tn++;\n\t}\n#if KEEP_NIS_AT_END\n\tif (NULL != ptr) {\n\t\tnis = ptr;\n\t}\n#endif\n\n\tif (n <= 1) {\n\t\treturn 0;\n\t}\n\n\tentries = malloc (n * sizeof (struct commonio_entry *));\n\tif (entries == NULL) {\n\t\treturn -1;\n\t}\n\n\tn = 0;\n\tfor (ptr = db->head;\n#if KEEP_NIS_AT_END\n\t nis != ptr;\n#else\n\t NULL != ptr;\n#endif\n/*@ -nullderef @*/\n\t ptr = ptr->next\n/*@ +nullderef @*/\n\t ) {\n\t\tentries[n] = ptr;\n\t\tn++;\n\t}\n\tqsort (entries, n, sizeof (struct commonio_entry *), cmp);\n\n\t/* Take care of the head and tail separately */\n\tdb->head = entries[0];\n\tn--;\n#if KEEP_NIS_AT_END\n\tif (NULL == nis)\n#endif\n\t{\n\t\tdb->tail = entries[n];\n\t}\n\tdb->head->prev = NULL;\n\tdb->head->next = entries[1];\n\tentries[n]->prev = entries[n - 1];\n#if KEEP_NIS_AT_END\n\tentries[n]->next = nis;\n#else\n\tentries[n]->next = NULL;\n#endif\n\n\t/* Now other elements have prev and next entries */\n\tfor (i = 1; i < n; i++) {\n\t\tentries[i]->prev = entries[i - 1];\n\t\tentries[i]->next = entries[i + 1];\n\t}\n\n\tfree (entries);\n\tdb->changed = true;\n\n\treturn 0;\n}\n\n/*\n * Sort entries in db according to order in another.\n */\nint commonio_sort_wrt (struct commonio_db *shadow,\n const struct commonio_db *passwd)\n{\n\tstruct commonio_entry *head = NULL, *pw_ptr, *spw_ptr;\n\tconst char *name;\n\n\tif ((NULL == shadow) || (NULL == shadow->head)) {\n\t\treturn 0;\n\t}\n\n\tfor (pw_ptr = passwd->head; NULL != pw_ptr; pw_ptr = pw_ptr->next) {\n\t\tif (NULL == pw_ptr->eptr) {\n\t\t\tcontinue;\n\t\t}\n\t\tname = passwd->ops->getname (pw_ptr->eptr);\n\t\tfor (spw_ptr = shadow->head;\n\t\t NULL != spw_ptr;\n\t\t spw_ptr = spw_ptr->next) {\n\t\t\tif (NULL == spw_ptr->eptr) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (strcmp (name, shadow->ops->getname (spw_ptr->eptr))\n\t\t\t == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (NULL == spw_ptr) {\n\t\t\tcontinue;\n\t\t}\n\t\tcommonio_del_entry (shadow, spw_ptr);\n\t\tspw_ptr->next = head;\n\t\thead = spw_ptr;\n\t}\n\n\tfor (spw_ptr = head; NULL != spw_ptr; spw_ptr = head) {\n\t\thead = head->next;\n\n\t\tif (NULL != shadow->head) {\n\t\t\tshadow->head->prev = spw_ptr;\n\t\t}\n\t\tspw_ptr->next = shadow->head;\n\t\tshadow->head = spw_ptr;\n\t}\n\n\tshadow->head->prev = NULL;\n\tshadow->changed = true;\n\n\treturn 0;\n}\n\n/*\n * write_all - Write the database to its file.\n *\n * It returns 0 if all the entries could be written correctly.\n */\nstatic int write_all (const struct commonio_db *db)\n\t/*@requires notnull db->fp@*/\n{\n\tconst struct commonio_entry *p;\n\tvoid *eptr;\n\n\tfor (p = db->head; NULL != p; p = p->next) {\n\t\tif (p->changed) {\n\t\t\teptr = p->eptr;\n\t\t\tassert (NULL != eptr);\n\t\t\tif (db->ops->put (eptr, db->fp) != 0) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t} else if (NULL != p->line) {\n\t\t\tif (db->ops->fputs (p->line, db->fp) == EOF) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (putc ('\\n', db->fp) == EOF) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\n\nint commonio_close (struct commonio_db *db)\n\t/*@requires notnull db->fp@*/\n{\n\tchar buf[1024];\n\tint errors = 0;\n\tstruct stat sb;\n\n\tif (!db->isopen) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tdb->isopen = false;\n\n\tif (!db->changed || db->readonly) {\n\t\t(void) fclose (db->fp);\n\t\tdb->fp = NULL;\n\t\tgoto success;\n\t}\n\n\tif ((NULL != db->ops->close_hook) && (db->ops->close_hook () == 0)) {\n\t\tgoto fail;\n\t}\n\n\tmemzero (&sb, sizeof sb);\n\tif (NULL != db->fp) {\n\t\tif (fstat (fileno (db->fp), &sb) != 0) {\n\t\t\t(void) fclose (db->fp);\n\t\t\tdb->fp = NULL;\n\t\t\tgoto fail;\n\t\t}\n\n\t\t/*\n\t\t * Create backup file.\n\t\t */\n\t\tsnprintf (buf, sizeof buf, \"%s-\", db->filename);\n\n#ifdef WITH_SELINUX\n\t\tif (set_selinux_file_context (buf) != 0) {\n\t\t\terrors++;\n\t\t}\n#endif\n\t\tif (create_backup (buf, db->fp) != 0) {\n\t\t\terrors++;\n\t\t}\n\n\t\tif (fclose (db->fp) != 0) {\n\t\t\terrors++;\n\t\t}\n\n#ifdef WITH_SELINUX\n\t\tif (reset_selinux_file_context () != 0) {\n\t\t\terrors++;\n\t\t}\n#endif\n\t\tif (errors != 0) {\n\t\t\tdb->fp = NULL;\n\t\t\tgoto fail;\n\t\t}\n\t} else {\n\t\t/*\n\t\t * Default permissions for new [g]shadow files.\n\t\t */\n\t\tsb.st_mode = db->st_mode;\n\t\tsb.st_uid = db->st_uid;\n\t\tsb.st_gid = db->st_gid;\n\t}\n\n\tsnprintf (buf, sizeof buf, \"%s+\", db->filename);\n\n#ifdef WITH_SELINUX\n\tif (set_selinux_file_context (buf) != 0) {\n\t\terrors++;\n\t}\n#endif\n\n\tdb->fp = fopen_set_perms (buf, \"w\", &sb);\n\tif (NULL == db->fp) {\n\t\tgoto fail;\n\t}\n\n\tif (write_all (db) != 0) {\n\t\terrors++;\n\t}\n\n\tif (fflush (db->fp) != 0) {\n\t\terrors++;\n\t}\n#ifdef HAVE_FSYNC\n\tif (fsync (fileno (db->fp)) != 0) {\n\t\terrors++;\n\t}\n#else\t\t\t\t/* !HAVE_FSYNC */\n\tsync ();\n#endif\t\t\t\t/* !HAVE_FSYNC */\n\tif (fclose (db->fp) != 0) {\n\t\terrors++;\n\t}\n\n\tdb->fp = NULL;\n\n\tif (errors != 0) {\n\t\tunlink (buf);\n\t\tgoto fail;\n\t}\n\n\tif (lrename (buf, db->filename) != 0) {\n\t\tgoto fail;\n\t}\n\n#ifdef WITH_SELINUX\n\tif (reset_selinux_file_context () != 0) {\n\t\tgoto fail;\n\t}\n#endif\n\n\tnscd_need_reload = true;\n\tgoto success;\n fail:\n\terrors++;\n success:\n\n\tfree_linked_list (db);\n\treturn errors == 0;\n}\n\nstatic /*@dependent@*/ /*@null@*/struct commonio_entry *next_entry_by_name (\n\tstruct commonio_db *db,\n\t/*@null@*/struct commonio_entry *pos,\n\tconst char *name)\n{\n\tstruct commonio_entry *p;\n\tvoid *ep;\n\n\tif (NULL == pos) {\n\t\treturn NULL;\n\t}\n\n\tfor (p = pos; NULL != p; p = p->next) {\n\t\tep = p->eptr;\n\t\tif ( (NULL != ep)\n\t\t && (strcmp (db->ops->getname (ep), name) == 0)) {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn p;\n}\n\nstatic /*@dependent@*/ /*@null@*/struct commonio_entry *find_entry_by_name (\n\tstruct commonio_db *db,\n\tconst char *name)\n{\n\treturn next_entry_by_name (db, db->head, name);\n}\n\n\nint commonio_update (struct commonio_db *db, const void *eptr)\n{\n\tstruct commonio_entry *p;\n\tvoid *nentry;\n\n\tif (!db->isopen || db->readonly) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tnentry = db->ops->dup (eptr);\n\tif (NULL == nentry) {\n\t\terrno = ENOMEM;\n\t\treturn 0;\n\t}\n\tp = find_entry_by_name (db, db->ops->getname (eptr));\n\tif (NULL != p) {\n\t\tif (next_entry_by_name (db, p->next, db->ops->getname (eptr)) != NULL) {\n\t\t\tfprintf (stderr, _(\"Multiple entries named '%s' in %s. Please fix this with pwck or grpck.\\n\"), db->ops->getname (eptr), db->filename);\n\t\t\tdb->ops->free (nentry);\n\t\t\treturn 0;\n\t\t}\n\t\tdb->ops->free (p->eptr);\n\t\tp->eptr = nentry;\n\t\tp->changed = true;\n\t\tdb->cursor = p;\n\n\t\tdb->changed = true;\n\t\treturn 1;\n\t}\n\t/* not found, new entry */\n\tp = (struct commonio_entry *) malloc (sizeof *p);\n\tif (NULL == p) {\n\t\tdb->ops->free (nentry);\n\t\terrno = ENOMEM;\n\t\treturn 0;\n\t}\n\n\tp->eptr = nentry;\n\tp->line = NULL;\n\tp->changed = true;\n\n#if KEEP_NIS_AT_END\n\tadd_one_entry_nis (db, p);\n#else\t\t\t\t/* !KEEP_NIS_AT_END */\n\tadd_one_entry (db, p);\n#endif\t\t\t\t/* !KEEP_NIS_AT_END */\n\n\tdb->changed = true;\n\treturn 1;\n}\n\n#ifdef ENABLE_SUBIDS\nint commonio_append (struct commonio_db *db, const void *eptr)\n{\n\tstruct commonio_entry *p;\n\tvoid *nentry;\n\n\tif (!db->isopen || db->readonly) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tnentry = db->ops->dup (eptr);\n\tif (NULL == nentry) {\n\t\terrno = ENOMEM;\n\t\treturn 0;\n\t}\n\t/* new entry */\n\tp = (struct commonio_entry *) malloc (sizeof *p);\n\tif (NULL == p) {\n\t\tdb->ops->free (nentry);\n\t\terrno = ENOMEM;\n\t\treturn 0;\n\t}\n\n\tp->eptr = nentry;\n\tp->line = NULL;\n\tp->changed = true;\n\tadd_one_entry (db, p);\n\n\tdb->changed = true;\n\treturn 1;\n}\n#endif\t\t\t\t/* ENABLE_SUBIDS */\n\nvoid commonio_del_entry (struct commonio_db *db, const struct commonio_entry *p)\n{\n\tif (p == db->cursor) {\n\t\tdb->cursor = p->next;\n\t}\n\n\tif (NULL != p->prev) {\n\t\tp->prev->next = p->next;\n\t} else {\n\t\tdb->head = p->next;\n\t}\n\n\tif (NULL != p->next) {\n\t\tp->next->prev = p->prev;\n\t} else {\n\t\tdb->tail = p->prev;\n\t}\n\n\tdb->changed = true;\n}\n\n/*\n * commonio_remove - Remove the entry of the given name from the database.\n */\nint commonio_remove (struct commonio_db *db, const char *name)\n{\n\tstruct commonio_entry *p;\n\n\tif (!db->isopen || db->readonly) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tp = find_entry_by_name (db, name);\n\tif (NULL == p) {\n\t\terrno = ENOENT;\n\t\treturn 0;\n\t}\n\tif (next_entry_by_name (db, p->next, name) != NULL) {\n\t\tfprintf (stderr, _(\"Multiple entries named '%s' in %s. Please fix this with pwck or grpck.\\n\"), name, db->filename);\n\t\treturn 0;\n\t}\n\n\tcommonio_del_entry (db, p);\n\n\tif (NULL != p->line) {\n\t\tfree (p->line);\n\t}\n\n\tif (NULL != p->eptr) {\n\t\tdb->ops->free (p->eptr);\n\t}\n\n\treturn 1;\n}\n\n/*\n * commonio_locate - Find the first entry with the specified name in\n * the database.\n *\n *\tIf found, it returns the entry and set the cursor of the database to\n *\tthat entry.\n *\n *\tOtherwise, it returns NULL.\n */\n/*@observer@*/ /*@null@*/const void *commonio_locate (struct commonio_db *db, const char *name)\n{\n\tstruct commonio_entry *p;\n\n\tif (!db->isopen) {\n\t\terrno = EINVAL;\n\t\treturn NULL;\n\t}\n\tp = find_entry_by_name (db, name);\n\tif (NULL == p) {\n\t\terrno = ENOENT;\n\t\treturn NULL;\n\t}\n\tdb->cursor = p;\n\treturn p->eptr;\n}\n\n/*\n * commonio_rewind - Restore the database cursor to the first entry.\n *\n * It returns 0 on error, 1 on success.\n */\nint commonio_rewind (struct commonio_db *db)\n{\n\tif (!db->isopen) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tdb->cursor = NULL;\n\treturn 1;\n}\n\n/*\n * commonio_next - Return the next entry of the specified database\n *\n * It returns the next entry, or NULL if no other entries could be found.\n */\n/*@observer@*/ /*@null@*/const void *commonio_next (struct commonio_db *db)\n{\n\tvoid *eptr;\n\n\tif (!db->isopen) {\n\t\terrno = EINVAL;\n\t\treturn 0;\n\t}\n\tif (NULL == db->cursor) {\n\t\tdb->cursor = db->head;\n\t} else {\n\t\tdb->cursor = db->cursor->next;\n\t}\n\n\twhile (NULL != db->cursor) {\n\t\teptr = db->cursor->eptr;\n\t\tif (NULL != eptr) {\n\t\t\treturn eptr;\n\t\t}\n\n\t\tdb->cursor = db->cursor->next;\n\t}\n\treturn NULL;\n}\n\n"},"func_before":{"kind":"string","value":"commonio_sort (struct commonio_db *db, int (*cmp) (const void *, const void *))\n{\n\tstruct commonio_entry **entries, *ptr;\n\tsize_t n = 0, i;\n#if KEEP_NIS_AT_END\n\tstruct commonio_entry *nis = NULL;\n#endif\n\n\tfor (ptr = db->head;\n\t (NULL != ptr)\n#if KEEP_NIS_AT_END\n\t && (NULL != ptr->line)\n\t && ( ('+' != ptr->line[0])\n\t && ('-' != ptr->line[0]))\n#endif\n\t ;\n\t ptr = ptr->next) {\n\t\tn++;\n\t}\n#if KEEP_NIS_AT_END\n\tif ((NULL != ptr) && (NULL != ptr->line)) {\n\t\tnis = ptr;\n\t}\n#endif\n\n\tif (n <= 1) {\n\t\treturn 0;\n\t}\n\n\tentries = malloc (n * sizeof (struct commonio_entry *));\n\tif (entries == NULL) {\n\t\treturn -1;\n\t}\n\n\tn = 0;\n\tfor (ptr = db->head;\n#if KEEP_NIS_AT_END\n\t nis != ptr;\n#else\n\t NULL != ptr;\n#endif\n/*@ -nullderef @*/\n\t ptr = ptr->next\n/*@ +nullderef @*/\n\t ) {\n\t\tentries[n] = ptr;\n\t\tn++;\n\t}\n\tqsort (entries, n, sizeof (struct commonio_entry *), cmp);\n\n\t/* Take care of the head and tail separately */\n\tdb->head = entries[0];\n\tn--;\n#if KEEP_NIS_AT_END\n\tif (NULL == nis)\n#endif\n\t{\n\t\tdb->tail = entries[n];\n\t}\n\tdb->head->prev = NULL;\n\tdb->head->next = entries[1];\n\tentries[n]->prev = entries[n - 1];\n#if KEEP_NIS_AT_END\n\tentries[n]->next = nis;\n#else\n\tentries[n]->next = NULL;\n#endif\n\n\t/* Now other elements have prev and next entries */\n\tfor (i = 1; i < n; i++) {\n\t\tentries[i]->prev = entries[i - 1];\n\t\tentries[i]->next = entries[i + 1];\n\t}\n\n\tfree (entries);\n\tdb->changed = true;\n\n\treturn 0;\n}"},"func_after":{"kind":"string","value":"commonio_sort (struct commonio_db *db, int (*cmp) (const void *, const void *))\n{\n\tstruct commonio_entry **entries, *ptr;\n\tsize_t n = 0, i;\n#if KEEP_NIS_AT_END\n\tstruct commonio_entry *nis = NULL;\n#endif\n\n\tfor (ptr = db->head;\n\t (NULL != ptr)\n#if KEEP_NIS_AT_END\n\t && ((NULL == ptr->line)\n\t || (('+' != ptr->line[0])\n\t && ('-' != ptr->line[0])))\n#endif\n\t ;\n\t ptr = ptr->next) {\n\t\tn++;\n\t}\n#if KEEP_NIS_AT_END\n\tif (NULL != ptr) {\n\t\tnis = ptr;\n\t}\n#endif\n\n\tif (n <= 1) {\n\t\treturn 0;\n\t}\n\n\tentries = malloc (n * sizeof (struct commonio_entry *));\n\tif (entries == NULL) {\n\t\treturn -1;\n\t}\n\n\tn = 0;\n\tfor (ptr = db->head;\n#if KEEP_NIS_AT_END\n\t nis != ptr;\n#else\n\t NULL != ptr;\n#endif\n/*@ -nullderef @*/\n\t ptr = ptr->next\n/*@ +nullderef @*/\n\t ) {\n\t\tentries[n] = ptr;\n\t\tn++;\n\t}\n\tqsort (entries, n, sizeof (struct commonio_entry *), cmp);\n\n\t/* Take care of the head and tail separately */\n\tdb->head = entries[0];\n\tn--;\n#if KEEP_NIS_AT_END\n\tif (NULL == nis)\n#endif\n\t{\n\t\tdb->tail = entries[n];\n\t}\n\tdb->head->prev = NULL;\n\tdb->head->next = entries[1];\n\tentries[n]->prev = entries[n - 1];\n#if KEEP_NIS_AT_END\n\tentries[n]->next = nis;\n#else\n\tentries[n]->next = NULL;\n#endif\n\n\t/* Now other elements have prev and next entries */\n\tfor (i = 1; i < n; i++) {\n\t\tentries[i]->prev = entries[i - 1];\n\t\tentries[i]->next = entries[i + 1];\n\t}\n\n\tfree (entries);\n\tdb->changed = true;\n\n\treturn 0;\n}"},"diff":{"kind":"string","value":"{'added': [(754, '\\t && ((NULL == ptr->line)'), (755, \"\\t || (('+' != ptr->line[0])\"), (756, \"\\t && ('-' != ptr->line[0])))\"), (763, '\\tif (NULL != ptr) {')], 'deleted': [(754, '\\t && (NULL != ptr->line)'), (755, \"\\t && ( ('+' != ptr->line[0])\"), (756, \"\\t && ('-' != ptr->line[0]))\"), (763, '\\tif ((NULL != ptr) && (NULL != ptr->line)) {')]}"},"num_lines_added":{"kind":"number","value":4,"string":"4"},"num_lines_deleted":{"kind":"number","value":4,"string":"4"},"num_lines_in_file":{"kind":"number","value":910,"string":"910"},"num_tokens_in_file":{"kind":"number","value":5122,"string":"5,122"},"num_lines_in_method":{"kind":"number","value":53,"string":"53"},"num_tokens_in_method":{"kind":"number","value":353,"string":"353"},"method_complexity":{"kind":"number","value":18,"string":"18"},"repo":{"kind":"string","value":"https://github.com/shadow-maint/shadow"},"cve_id":{"kind":"string","value":"CVE-2017-12424"},"cwe_id":{"kind":"string","value":"CWE-119"}}},{"rowIdx":389,"cells":{"id":{"kind":"number","value":2786,"string":"2,786"},"file_name":{"kind":"string","value":"jsiArray.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"jsi_ArrayShiftCmd"},"code_before":{"kind":"string","value":"#ifndef JSI_LITE_ONLY\n#ifndef JSI_AMALGAMATION\n#include \"jsiInt.h\"\n#endif\n\n#if JSI__MUSL==1 || defined(__FreeBSD__)\n#define NO_QSORT_R 1\n#endif\n\nstatic Jsi_RC jsi_ArrayPushCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,\n Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n Jsi_Obj *obj;\n \n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) {\n Jsi_ValueMakeNumber(interp, ret, 0);\n return JSI_OK;\n }\n obj = _this->d.obj;\n \n int argc = Jsi_ValueGetLength(interp, args);\n int curlen = Jsi_ObjGetLength(interp, obj);\n if (curlen < 0) {\n Jsi_ObjSetLength(interp, obj, 0);\n }\n \n int i;\n for (i = 0; i < argc; ++i) {\n Jsi_Value *ov = Jsi_ValueArrayIndex(interp, args, i);\n if (!ov) { Jsi_LogBug(\"Arguments Error\"); ov = Jsi_ValueNew(interp); }\n Jsi_ValueInsertArray(interp, _this, curlen + i, ov, 0);\n }\n \n Jsi_ValueMakeNumber(interp, ret, Jsi_ObjGetLength(interp, obj));\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayPopCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,\n Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) {\n Jsi_ValueMakeNumber(interp, ret, 0);\n return JSI_OK;\n }\n Jsi_Value *v;\n Jsi_Obj *obj;\n obj = _this->d.obj;\n int i = Jsi_ObjGetLength(interp, obj) - 1;\n\n if (i < 0) {\n Jsi_ValueMakeUndef(interp, ret);\n return JSI_OK;\n }\n \n if (obj->arr) {\n if ((v = obj->arr[i])) {\n obj->arr[i] = NULL;\n obj->arrCnt--;\n }\n } else {\n v = Jsi_ValueArrayIndex(interp, _this, i);\n }\n if (v) {\n Jsi_DecrRefCount(interp, *ret);\n *ret = v;\n }\n Jsi_ObjSetLength(interp, obj, i);\n return JSI_OK;\n}\n\n\nstatic Jsi_RC jsi_ArrayJoinCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,\n Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n const char *jstr = \"\";\n int argc, curlen;\n Jsi_DString dStr = {};\n\n curlen = Jsi_ObjGetLength(interp, _this->d.obj);\n if (curlen == 0) {\n goto bail;\n }\n\n if (Jsi_ValueGetLength(interp, args) >= 1) {\n Jsi_Value *sc = Jsi_ValueArrayIndex(interp, args, 0);\n if (sc != NULL)\n jstr = Jsi_ValueToString(interp, sc, NULL);\n }\n \n if (0 == (argc=Jsi_ObjGetLength(interp, _this->d.obj))) {\n goto bail;\n }\n int i;\n for (i = 0; i < argc; ++i) {\n const char *cp;\n Jsi_Value *ov = Jsi_ValueArrayIndex(interp, _this, i);\n if (!ov) {\n /* TODO: are NULL args ok? */ \n continue;\n cp = \"\";\n } else\n cp = Jsi_ValueToString(interp, ov, NULL);\n if (i && jstr[0])\n Jsi_DSAppend(&dStr, jstr, NULL);\n Jsi_DSAppend(&dStr, cp, NULL);\n }\n \n Jsi_ValueMakeStringDup(interp, ret, Jsi_DSValue(&dStr));\n Jsi_DSFree(&dStr);\n return JSI_OK;\nbail:\n Jsi_ValueMakeStringDup(interp, ret, \"\");\n return JSI_OK; \n}\n\n\nJsi_Value* Jsi_ValueArrayConcat(Jsi_Interp *interp, Jsi_Value *arg1, Jsi_Value *arg2) {\n Jsi_Value *va;\n Jsi_Obj *obj;\n if (arg1->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, arg1->d.obj)) {\n return NULL;\n }\n if (arg2->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, arg2->d.obj)) {\n return NULL;\n }\n int len1 = arg1->d.obj->arrCnt;\n int len2 = arg2->d.obj->arrCnt;\n Jsi_Obj *nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n Jsi_ObjArraySizer(interp, nobj, len1+len2);\n\n int i, j = 0;\n obj = arg1->d.obj;\n for (i = 0; iarr[i]) continue;\n nobj->arr[j] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+j, obj->arr[i]);\n }\n obj = arg2->d.obj;\n for (i = 0; iarr[i]) continue;\n nobj->arr[j] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+j, obj->arr[i]);\n }\n Jsi_ObjSetLength(interp, nobj, len1+len2);\n va = Jsi_ValueMakeArrayObject(interp, NULL, nobj);\n return va;\n}\n\nJsi_RC Jsi_ValueArrayPush(Jsi_Interp *interp, Jsi_Value *arg1, Jsi_Value *arg2) {\n Jsi_Obj *obj;\n if (arg1->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, arg1->d.obj))\n return JSI_ERROR;\n if (!arg2)\n return JSI_ERROR;\n int len1 = arg1->d.obj->arrCnt;\n obj = arg1->d.obj;\n Jsi_ObjArraySizer(interp, obj, len1);\n obj->arr[len1] = arg2;\n Jsi_IncrRefCount(interp, arg2);\n obj->arrCnt++;\n return JSI_OK;\n}\n\n\nJsi_Value *Jsi_ValueArrayPop(Jsi_Interp *interp, Jsi_Value *v)\n{\n if (v->vt != JSI_VT_OBJECT) {\n Jsi_LogBug(\"Jsi_ValueArrayPop, target is not object\");\n return NULL;\n }\n Jsi_Obj *o = v->d.obj;\n if (!o->isarrlist) {\n Jsi_LogBug(\"Jsi_ValueArrayPop, target is not array\");\n return NULL;\n }\n if (o->arrCnt<=0)\n return NULL;\n int idx = o->arrCnt-1;\n if (!o->arr[idx])\n return NULL;\n Jsi_DecrRefCount(interp, o->arr[idx]);\n Jsi_Value *ret = o->arr[idx];\n o->arr[idx] = NULL;\n o->arrCnt--;\n return ret;\n}\n\n\nJsi_Value *Jsi_ValueArrayUnshift(Jsi_Interp *interp, Jsi_Value *v)\n{\n if (v->vt != JSI_VT_OBJECT) {\n Jsi_LogBug(\"Jsi_ValueArrayUnshift, target is not object\");\n return NULL;\n }\n Jsi_Obj *o = v->d.obj;\n if (!o->isarrlist) {\n Jsi_LogBug(\"Jsi_ValueArrayUnshift, target is not array\");\n return NULL;\n }\n if (o->arrCnt<=0)\n return NULL;\n if (!o->arr[0])\n return NULL;\n Jsi_DecrRefCount(interp, o->arr[0]);\n Jsi_Value *ret = o->arr[0];\n o->arr[0] = NULL;\n o->arrCnt--;\n return ret;\n}\n\n/* delete array[0], array[1]->array[0] */\nvoid Jsi_ValueArrayShift(Jsi_Interp *interp, Jsi_Value *v)\n{\n if (v->vt != JSI_VT_OBJECT) {\n Jsi_LogBug(\"Jsi_ValueArrayShift, target is not object\");\n return;\n }\n Jsi_Obj *o = v->d.obj;\n if (o->isarrlist) {\n uint i;\n if (!o->arrCnt)\n return;\n if (o->arr[0])\n Jsi_DecrRefCount(interp, o->arr[0]);\n for (i=1; iarrCnt; i++) {\n o->arr[i-1] = o->arr[i];\n }\n o->arr[o->arrCnt--] = NULL;\n return;\n }\n \n int len = Jsi_ObjGetLength(interp, v->d.obj);\n if (len <= 0) return;\n \n Jsi_Value *v0 = Jsi_ValueArrayIndex(interp, v, 0);\n if (!v0) return;\n \n Jsi_ValueReset(interp, &v0);\n \n int i;\n Jsi_Value *last = v0;\n for (i = 1; i < len; ++i) {\n Jsi_Value *t = Jsi_ValueArrayIndex(interp, v, i);\n if (!t) return;\n Jsi_ValueCopy(interp, last, t);\n Jsi_ValueReset(interp, &t);\n last = t;\n }\n Jsi_ObjSetLength(interp, v->d.obj, len - 1);\n}\n\nstatic Jsi_RC jsi_ArrayFlatSub(Jsi_Interp *interp, Jsi_Obj* nobj, Jsi_Value *arr, int depth) {\n \n int i, n = 0, len = Jsi_ObjGetLength(interp, arr->d.obj);\n if (len <= 0) return JSI_OK;\n Jsi_RC rc = JSI_OK;\n int clen = Jsi_ObjGetLength(interp, nobj);\n for (i = 0; i < len && rc == JSI_OK; i++) {\n Jsi_Value *t = Jsi_ValueArrayIndex(interp, arr, i);\n if (t && depth>0 && Jsi_ValueIsArray(interp, t))\n rc = jsi_ArrayFlatSub(interp, nobj, t , depth-1);\n else if (!Jsi_ValueIsUndef(interp, t))\n Jsi_ObjArrayAdd(interp, nobj, t);\n if ((++n + clen)>interp->maxArrayList)\n return Jsi_LogError(\"array size exceeded\");\n }\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayFlatCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n Jsi_Number ndepth = 1;\n Jsi_Obj *nobj;\n Jsi_Value *depth = Jsi_ValueArrayIndex(interp, args, 0);\n if (depth && Jsi_GetNumberFromValue(interp,depth, &ndepth) != JSI_OK)\n return JSI_ERROR;\n \n if (ndepth < 0 || ndepth>1000)\n return Jsi_LogError(\"bad depth: %d\", (int)ndepth);\n\n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n Jsi_ValueMakeArrayObject(interp, ret, nobj );\n if (ndepth>0)\n return jsi_ArrayFlatSub(interp, nobj, _this, ndepth);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayConcatCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_RC rc = JSI_OK;\n int curlen, argc, nsiz;\n Jsi_Obj *obj, *nobj;\n Jsi_Value *va;\n\n obj = _this->d.obj;\n \n argc = Jsi_ValueGetLength(interp, args);\n curlen = Jsi_ObjGetLength(interp, obj);\n if (curlen < 0) {\n Jsi_ObjSetLength(interp, obj, 0);\n }\n Jsi_ObjListifyArray(interp, obj);\n \n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n nsiz = obj->arrMaxSize;\n if (nsiz<=0) nsiz = 100;\n if (Jsi_ObjArraySizer(interp, nobj, nsiz+1) <= 0) {\n rc = JSI_ERROR;\n Jsi_LogError(\"index too large: %d\", nsiz+1);\n goto bail;\n }\n\n int i, j, m;\n for (i = 0; iarr[i]) continue;\n nobj->arr[i] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+i, obj->arr[i]);\n }\n m = i;\n for (i = 0; i < argc; i++) {\n va = Jsi_ValueArrayIndex(interp, args, i);\n if (va->vt == JSI_VT_OBJECT && Jsi_ObjIsArray(interp, va->d.obj)) {\n int margc = Jsi_ValueGetLength(interp, va);\n Jsi_Obj *mobj = va->d.obj;\n Jsi_ObjListifyArray(interp, mobj);\n if (Jsi_ObjArraySizer(interp, nobj, curlen += margc) <= 0) {\n rc = JSI_ERROR;\n Jsi_LogError(\"index too large: %d\", curlen);\n goto bail;\n }\n for (j = 0; jarr[j]) continue;\n nobj->arr[m] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+m, mobj->arr[j]);\n }\n } else {\n if (Jsi_ObjArraySizer(interp, nobj, ++curlen) <= 0) {\n rc = JSI_ERROR;\n Jsi_LogError(\"index too large: %d\", curlen);\n goto bail;\n }\n nobj->arr[m] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+m++, va);\n }\n }\n Jsi_ObjSetLength(interp, nobj, curlen);\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n return JSI_OK;\n \nbail:\n Jsi_ValueMakeNull(interp, ret);\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayMapCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_RC rc = JSI_OK;\n int curlen, nsiz, i, maa = 0;\n Jsi_Obj *obj, *nobj;\n Jsi_Value *func, *vpargs, *nthis = NULL, *sthis;\n Jsi_Func *fptr = NULL;\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n sthis = Jsi_ValueArrayIndex(interp, args, 1);\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n obj = _this->d.obj;\n curlen = Jsi_ObjGetLength(interp, obj); \n if (curlen < 0) {\n Jsi_ObjSetLength(interp, obj, 0);\n }\n Jsi_ObjListifyArray(interp, obj);\n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n nsiz = obj->arrCnt;\n if (nsiz<=0) nsiz = 1;\n if (Jsi_ObjArraySizer(interp, nobj, nsiz) <= 0) {\n Jsi_LogError(\"index too large: %d\", nsiz);\n rc = JSI_ERROR;\n goto bail;\n }\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n Jsi_Value *vobjs[3];\n\n fptr = func->d.obj->d.fobj->func;\n maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>3)\n maa = 3;\n for (i = 0; i < curlen; i++) {\n if (!obj->arr[i]) continue;\n vobjs[0] = obj->arr[i];\n vobjs[1] = (maa>1?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[2] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n nobj->arr[i] = Jsi_ValueNew1(interp);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, nobj->arr+i, sthis);\n Jsi_DecrRefCount(interp, vpargs);\n if( JSI_OK!=rc ) {\n goto bail;\n }\n }\n Jsi_ObjSetLength(interp, nobj, curlen);\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n return JSI_OK;\n \nbail:\n Jsi_ValueMakeNull(interp, ret);\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayFilterCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_RC rc = JSI_OK;\n int curlen, nsiz, i, fval, n = 0, maa = 0;\n Jsi_Obj *obj, *nobj;\n Jsi_Value *func, *vpargs, *nthis = NULL, *sthis, *nrPtr = NULL;\n Jsi_Func *fptr = NULL;\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n sthis = Jsi_ValueArrayIndex(interp, args, 1);\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n obj = _this->d.obj;\n curlen = Jsi_ObjGetLength(interp, obj); \n if (curlen < 0) {\n Jsi_ObjSetLength(interp, obj, 0);\n }\n Jsi_ObjListifyArray(interp, obj);\n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n nsiz = obj->arrCnt;\n if (nsiz<=0) nsiz = 1;\n if (Jsi_ObjArraySizer(interp, nobj, nsiz) <= 0) {\n Jsi_LogError(\"index too large: %d\", nsiz);\n rc = JSI_ERROR;\n goto bail;\n }\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n nrPtr = Jsi_ValueNew1(interp);\n Jsi_Value *vobjs[4];\n\n fptr = func->d.obj->d.fobj->func;\n maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>3)\n maa = 3;\n for (i = 0; i < curlen; i++) {\n if (!obj->arr[i]) continue;\n vobjs[0] = obj->arr[i];\n vobjs[1] = (maa>1?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[2] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, &nrPtr, sthis);\n Jsi_DecrRefCount(interp, vpargs);\n fval = Jsi_ValueIsTrue(interp, nrPtr);\n Jsi_ValueMakeUndef(interp, &nrPtr);\n if( JSI_OK!=rc ) {\n goto bail;\n }\n if (fval) {\n nobj->arr[n++] = obj->arr[i];\n Jsi_IncrRefCount(interp, obj->arr[i]);\n }\n }\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n Jsi_DecrRefCount(interp, nrPtr);\n Jsi_ObjSetLength(interp, nobj, n);\n return JSI_OK;\n \nbail:\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n if (nrPtr)\n Jsi_DecrRefCount(interp, nrPtr);\n Jsi_ValueMakeNull(interp, ret);\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayReverseCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this, Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array\");\n int i, n, m;\n Jsi_Obj *obj;\n Jsi_Value *tval, *nthis = NULL, *sthis = Jsi_ValueArrayIndex(interp, args, 1);\n\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n obj = _this->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n m = obj->arrCnt/2;\n for (i = 0, n=obj->arrCnt-1; i < m; i++, n--) {\n tval = obj->arr[i];\n obj->arr[i] = obj->arr[n];\n obj->arr[n] = tval;\n }\n Jsi_ValueDup2(interp, ret, _this);\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayForeachCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) \n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array object\");\n Jsi_Obj *obj;\n int curlen;\n uint i;\n Jsi_Value *func, *vpargs;\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n Jsi_Value *sthis = Jsi_ValueArrayIndex(interp, args, 1);\n Jsi_Value *nthis = NULL;\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n\n obj = _this->d.obj;\n curlen = Jsi_ObjGetLength(interp, obj); \n if (curlen < 0) {\n Jsi_ObjSetLength(interp, obj, 0);\n }\n Jsi_ObjListifyArray(interp, obj);\n Jsi_RC rc = JSI_OK;\n \n Jsi_Value *vobjs[3];\n Jsi_Func *fptr = func->d.obj->d.fobj->func;\n int maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>3)\n maa = 3;\n for (i = 0; i < obj->arrCnt && rc == JSI_OK; i++) {\n if (!obj->arr[i]) continue;\n vobjs[0] = obj->arr[i];\n vobjs[1] = (maa>1?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[2] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, ret, sthis);\n Jsi_DecrRefCount(interp, vpargs);\n }\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayFindSubCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr, int op) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array\");\n Jsi_Obj *obj;\n int curlen;\n uint i;\n Jsi_RC rc = JSI_OK;\n Jsi_Value *func, *vpargs, *sthis = Jsi_ValueArrayIndex(interp, args, 1);\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n Jsi_Value *nthis = NULL;\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n\n obj = _this->d.obj;\n curlen = Jsi_ObjGetLength(interp, obj); \n if (curlen < 0) {\n Jsi_ObjSetLength(interp, obj, 0);\n }\n Jsi_ObjListifyArray(interp, obj);\n int fval = 0;\n Jsi_Value *nrPtr = Jsi_ValueNew1(interp);\n Jsi_Value *vobjs[3];\n Jsi_Func *fptr = func->d.obj->d.fobj->func;\n int maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>3)\n maa = 3;\n for (i = 0; i < obj->arrCnt && rc == JSI_OK; i++) {\n if (!obj->arr[i]) continue;\n vobjs[0] = obj->arr[i];\n vobjs[1] = (maa>1?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[2] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, &nrPtr, sthis);\n Jsi_DecrRefCount(interp, vpargs);\n if (rc != JSI_OK)\n break;\n fval = Jsi_ValueIsTrue(interp, nrPtr);\n Jsi_ValueMakeUndef(interp, &nrPtr);\n if (op == 3) {\n if (!fval) break;\n } else if (fval)\n break;\n }\n if (rc == JSI_OK) {\n if (op == 1 && fval) // Find\n Jsi_ValueCopy(interp, *ret, obj->arr[i]); \n else if (op == 2 || op == 3) // Some/Every\n Jsi_ValueMakeBool(interp, ret, fval);\n else if (op == 4)\n Jsi_ValueMakeNumber(interp, ret, (Jsi_Number)(fval?(int)i:-1));\n }\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n Jsi_DecrRefCount(interp, nrPtr);\n return rc;\n\n}\n\nstatic Jsi_RC jsi_ArrayReduceSubCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr, int op) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array\");\n Jsi_RC rc = JSI_OK;\n int curlen, i;\n Jsi_Obj *obj;\n Jsi_Value *func, *vpargs, *ini = Jsi_ValueArrayIndex(interp, args, 1);\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n\n Jsi_Value *nrPtr = Jsi_ValueNew1(interp);\n obj = _this->d.obj;\n curlen = Jsi_ObjGetLength(interp, obj); \n if (curlen < 0)\n Jsi_ObjSetLength(interp, obj, 0);\n Jsi_ObjListifyArray(interp, obj);\n Jsi_Value *vobjs[4];\n int n, rev = (op==2);\n Jsi_Func *fptr = func->d.obj->d.fobj->func;\n int maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>4)\n maa = 4;\n\n for (n = 0, i = (rev?obj->arrCnt-1:0); (rev?i>=0:i < (int)obj->arrCnt) && rc == JSI_OK; n++, i = (rev?i-1:i+1)) {\n if (!obj->arr[i]) continue;\n if (n==0 && !ini) {\n ini = obj->arr[i];\n continue;\n }\n \n vobjs[0] = ini;\n vobjs[1] = obj->arr[i];\n vobjs[2] = (maa>2?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[3] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, &nrPtr, NULL);\n Jsi_DecrRefCount(interp, vpargs);\n if (rc != JSI_OK)\n break;\n ini = nrPtr;\n }\n if (rc == JSI_OK && ini)\n Jsi_ValueCopy(interp, *ret, ini); \n Jsi_DecrRefCount(interp, nrPtr);\n return rc;\n\n}\n\nstatic Jsi_RC jsi_ArrayFindCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayFindSubCmd(interp, args, _this, ret, funcPtr, 1);\n}\nstatic Jsi_RC jsi_ArraySomeCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayFindSubCmd(interp, args, _this, ret, funcPtr, 2);\n}\nstatic Jsi_RC jsi_ArrayEveryCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayFindSubCmd(interp, args, _this, ret, funcPtr, 3);\n}\nstatic Jsi_RC jsi_ArrayFindIndexCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayFindSubCmd(interp, args, _this, ret, funcPtr, 4);\n}\nstatic Jsi_RC jsi_ArrayReduceCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayReduceSubCmd(interp, args, _this, ret, funcPtr, 1);\n}\nstatic Jsi_RC jsi_ArrayReduceRightCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayReduceSubCmd(interp, args, _this, ret, funcPtr, 2);\n}\nstatic Jsi_RC jsi_ArrayIsArrayCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n bool b = 0;\n Jsi_Value *sthis = _this;\n if (_this->vt == JSI_VT_OBJECT && _this->d.obj->ot == JSI_OT_FUNCTION &&\n _this->d.obj->__proto__ == interp->Array_prototype->d.obj->__proto__ )\n sthis = Jsi_ValueArrayIndex(interp, args, 0); \n if (sthis && sthis->vt == JSI_VT_OBJECT && Jsi_ObjIsArray(interp, sthis->d.obj))\n b = 1;\n Jsi_ValueMakeBool(interp, ret, b);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayIndexSubCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr, int op) {\n int istart = 0, n, i = 0, dir=1, idx=-1;\n Jsi_Value *seq = Jsi_ValueArrayIndex(interp, args, 0),\n *start = Jsi_ValueArrayIndex(interp, args, 1);\n Jsi_Obj *obj = _this->d.obj;\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n if (!seq) {\n goto bail;\n }\n \n n = Jsi_ObjGetLength(interp, obj); \n if (n == 0) {\n goto bail;\n }\n Jsi_Number nstart;\n if (op == 2) {\n istart = n-1;\n }\n if (start && Jsi_GetNumberFromValue(interp,start, &nstart)==JSI_OK) {\n istart = (int)nstart;\n if (istart > n)\n goto bail;\n if (istart < 0)\n istart = (n+istart);\n if (istart<0)\n goto bail;\n }\n if (op == 2) {\n istart = n-1;\n dir = -1;\n }\n Jsi_ObjListifyArray(interp, obj);\n for (i = istart; ; i+=dir)\n {\n if ((dir>0 && i>=n) || (dir<0 && i<0) || i>=(int)obj->arrCnt)\n break;\n if (obj->arr[i] && Jsi_ValueCmp(interp, obj->arr[i], seq, JSI_CMP_EXACT)==0) {\n idx = i;\n break;\n }\n }\nbail:\n if (op == 3)\n Jsi_ValueMakeBool(interp, ret, (idx!=-1));\n else\n Jsi_ValueMakeNumber(interp, ret, idx);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayIndexOfCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayIndexSubCmd(interp, args, _this, ret, funcPtr, 1);\n}\nstatic Jsi_RC jsi_ArrayLastindexOfCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayIndexSubCmd(interp, args, _this, ret, funcPtr, 2);\n}\nstatic Jsi_RC jsi_ArrayIncludesCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayIndexSubCmd(interp, args, _this, ret, funcPtr, 3);\n}\n\nstatic Jsi_RC jsi_ArraySizeOfCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n int i = Jsi_ObjGetLength(interp, _this->d.obj);\n Jsi_ValueMakeNumber(interp, ret, i);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayShiftCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_Value *v;\n Jsi_Obj *obj = _this->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n uint n = Jsi_ObjGetLength(interp, obj);\n assert(n <= obj->arrCnt);\n if (n<=0) {\n Jsi_ValueMakeUndef(interp, ret);\n } else {\n n--;\n v = obj->arr[0];\n memmove(obj->arr, obj->arr+1, n*sizeof(Jsi_Value*));\n obj->arr[n] = NULL;\n Jsi_ValueDup2(interp, ret, v);\n Jsi_DecrRefCount(interp, v);\n Jsi_ObjSetLength(interp, obj, n);\n }\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayUnshiftCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n Jsi_Obj *obj = _this->d.obj;\n int argc = Jsi_ValueGetLength(interp, args);\n int curlen = Jsi_ObjGetLength(interp, obj);\n if (curlen < 0) {\n Jsi_ObjSetLength(interp, obj, 0);\n }\n if (argc <= 0) {\n Jsi_ValueMakeNumber(interp, ret, 0);\n return JSI_OK;\n }\n Jsi_ObjListifyArray(interp, obj);\n if (Jsi_ObjArraySizer(interp, obj, curlen+argc)<=0) \n return Jsi_LogError(\"too long\");\n memmove(obj->arr+argc, obj->arr, (curlen)*sizeof(Jsi_Value*));\n obj->arrCnt += argc;\n int i;\n for (i = 0; i < argc; ++i) {\n Jsi_Value *ov = Jsi_ValueArrayIndex(interp, args, i);\n obj->arr[i] = NULL;\n if (!ov) { Jsi_LogBug(\"Arguments Error\"); continue; }\n obj->arr[i] = ov;\n Jsi_IncrRefCount(interp, ov);\n }\n Jsi_ObjSetLength(interp, obj, curlen+argc);\n \n Jsi_ValueMakeNumber(interp, ret, Jsi_ObjGetLength(interp, obj));\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayFillCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array object\");\n Jsi_RC rc = JSI_OK;\n int istart = 0, iend, n, nsiz;\n Jsi_Number nstart = 0, nend = 0; // TODO: merge with code in ArraySliceCmd.\n Jsi_Value *value = Jsi_ValueArrayIndex(interp, args, 0),\n *start = Jsi_ValueArrayIndex(interp, args, 1),\n *end = Jsi_ValueArrayIndex(interp, args, 2);\n Jsi_Obj *obj = _this->d.obj;\n n = Jsi_ObjGetLength(interp, obj);\n\n if (start && Jsi_GetNumberFromValue(interp, start, &nstart) == JSI_OK) {\n istart = (int)nstart;\n if (istart > n)\n goto bail;\n if (istart < 0)\n istart = (n+istart);\n if (istart<0)\n goto bail;\n }\n \n if (n == 0) {\n goto bail;\n }\n iend = n-1;\n if (end && Jsi_GetNumberFromValue(interp,end, &nend) == JSI_OK) {\n iend = (int) nend;\n if (iend >= n)\n iend = n;\n if (iend < 0)\n iend = (n+iend);\n if (iend<0)\n goto bail;\n }\n nsiz = iend-istart+1;\n if (nsiz<=0)\n goto bail;\n\n int i;\n for (i = istart; i <= iend; i++)\n {\n if (obj->arr[i])\n Jsi_ValueCopy(interp, obj->arr[i], value);\n else\n obj->arr[i] = Jsi_ValueDup(interp, value);\n }\nbail:\n if (_this != *ret) {\n Jsi_ValueMove(interp, *ret, _this);\n /*if (*ret)\n Jsi_DecrRefCount(interp, *ret);\n *ret = _this;\n Jsi_IncrRefCount(interp, *ret);*/\n }\n return rc;\n}\n\n\nstatic Jsi_RC jsi_ArraySliceCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n Jsi_RC rc = JSI_OK;\n int istart = 0, iend, n, nsiz;\n Jsi_Number nstart;\n Jsi_Obj *nobj, *obj;\n Jsi_Value *start = Jsi_ValueArrayIndex(interp, args, 0),\n *end = Jsi_ValueArrayIndex(interp, args, 1);\n if (!start) {\n goto bail;\n }\n obj = _this->d.obj;\n n = Jsi_ObjGetLength(interp, obj);\n if (Jsi_GetNumberFromValue(interp,start, &nstart) == JSI_OK) {\n istart = (int)nstart;\n if (istart > n)\n goto done;\n if (istart < 0)\n istart = (n+istart);\n if (istart<0)\n goto bail;\n }\n \n if (n == 0) {\ndone:\n Jsi_ValueMakeArrayObject(interp, ret, Jsi_ObjNewType(interp, JSI_OT_ARRAY));\n return JSI_OK;\n }\n Jsi_Number nend;\n iend = n-1;\n if (end && Jsi_GetNumberFromValue(interp,end, &nend) == JSI_OK) {\n iend = (int) nend;\n if (iend >= n)\n iend = n;\n if (iend < 0)\n iend = (n+iend);\n if (iend<0)\n goto bail;\n }\n nsiz = iend-istart+1;\n if (nsiz<=0)\n goto done;\n Jsi_ObjListifyArray(interp, obj);\n \n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n\n if (Jsi_ObjArraySizer(interp, nobj, nsiz) <= 0) {\n rc = Jsi_LogError(\"index too large: %d\", nsiz);\n goto bail;\n }\n\n int i, m;\n for (m = 0, i = istart; i <= iend; i++, m++)\n {\n if (!obj->arr[i]) continue;\n nobj->arr[m] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+m, obj->arr[i]);\n }\n Jsi_ObjSetLength(interp, nobj, nsiz);\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n return JSI_OK;\n \nbail:\n Jsi_ValueMakeNull(interp, ret);\n return rc;\n}\n\ntypedef struct {\n Jsi_Interp *interp;\n int flags;\n int mode;\n bool unique;\n Jsi_Value *compare;\n int errCnt;\n} SortInfo;\n\nstatic const char *sortArrayStrs[] = {\"default\", \"desc\", \"dict\", \"nocase\", 0};\n\nstatic Jsi_OptionSpec jsi_ArraySortOptions[] = {\n JSI_OPT(CUSTOM, SortInfo, mode, .help=\"Mode to sort by\", .flags=0, .custom=Jsi_Opt_SwitchEnum, .data=sortArrayStrs),\n JSI_OPT(FUNC, SortInfo, compare, .help=\"Function to do comparison\", .flags=0, .custom=0, .data=(void*)\"val1,val2\"),\n JSI_OPT(BOOL, SortInfo, unique, .help=\"Eliminate duplicate items\"),\n JSI_OPT_END(SortInfo)\n};\n\n#ifdef NO_QSORT_R\n\nSortInfo *curSortInfo = NULL;\n\nstatic int SortSubCmd(const void *p1, const void *p2) {\n SortInfo *si = curSortInfo;\n#else\n#ifdef __WIN32\nstatic int SortSubCmd(void *thunk, const void *p1, const void *p2)\n#else\nstatic int SortSubCmd(const void *p1, const void *p2, void *thunk)\n#endif\n{\n SortInfo *si = (SortInfo *)thunk;\n#endif\n Jsi_Interp *interp = si->interp;\n int sortFlags = si->flags;\n\n if (interp == NULL || interp->deleting)\n return 0;\n Jsi_Value *v1 = *(Jsi_Value**)p1, *v2 = *(Jsi_Value**)p2;\n int rc = 0;\n if (v1 != NULL && v2 != NULL) {\n VALCHK(v1);\n VALCHK(v2);\n if (!si->compare)\n rc = Jsi_ValueCmp(interp, v1, v2, sortFlags);\n else {\n Jsi_Value *vv[2] = {v1, v2};\n Jsi_Value *retP = Jsi_ValueNew1(interp);\n Jsi_Value *vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vv, 2, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, si->compare, vpargs, &retP, NULL);\n Jsi_DecrRefCount(interp, vpargs);\n if (rc == JSI_OK) {\n Jsi_Number d = 0;\n if (Jsi_ValueGetNumber(interp, retP, &d) == JSI_OK)\n rc = -(int)d;\n else {\n if (!si->errCnt)\n Jsi_LogWarn(\"invalid function return\");\n si->errCnt++;\n }\n }\n Jsi_DecrRefCount(interp, retP);\n }\n } else {\n if (v1 == v2) \n rc = 0;\n else if (v1 == NULL)\n rc = 1;\n else\n rc = -1;\n }\n if ((sortFlags&JSI_SORT_DESCEND))\n return rc;\n return -rc;\n}\n\nJsi_RC Jsi_ValueArraySort(Jsi_Interp *interp, Jsi_Value *val, int flags)\n{\n if (val->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, val->d.obj)) {\n return JSI_ERROR;\n }\n Jsi_Obj *obj = val->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n if (obj->arrCnt <= 0) {\n return JSI_OK;\n }\n#ifdef __WIN32\n#define qsort_r qsort_s\n#endif\n\n SortInfo si = {};\n si.interp = interp;\n si.flags = flags;\n#ifdef NO_QSORT_R\n curSortInfo = &si;\n qsort(obj->arr, obj->arrCnt, sizeof(Jsi_Value*), SortSubCmd);\n curSortInfo = NULL;\n#else\n qsort_r(obj->arr, obj->arrCnt, sizeof(Jsi_Value*), SortSubCmd, &si);\n#endif\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArraySortCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n int flags = 0, i, curlen, hasopt = 0;\n Jsi_Value *v, *arg = NULL;\n SortInfo si = {};\n si.interp = interp;\n\n\n Jsi_Obj *obj = _this->d.obj;\n curlen = obj->arrCnt;\n\n if (curlen <= 1) {\n goto done;\n }\n \n arg = Jsi_ValueArrayIndex(interp, args, 0);\n if (arg) {\n if (Jsi_ValueIsObjType(interp, arg, JSI_OT_OBJECT)) {\n if (Jsi_OptionsProcess(interp, jsi_ArraySortOptions, &si, arg, 0) < 0)\n return JSI_ERROR;\n hasopt = 1;\n switch (si.mode) {\n case 1: flags |= JSI_SORT_DESCEND; break;\n case 2: flags |= JSI_SORT_DICT; break;\n case 3: flags |= JSI_SORT_NOCASE; break;\n }\n } else if (Jsi_ValueIsObjType(interp, arg, JSI_OT_FUNCTION))\n si.compare = arg;\n else \n return Jsi_LogError(\"expected object or function\");\n }\n si.flags = flags;\n Jsi_ObjListifyArray(interp, obj);\n#ifdef NO_QSORT_R\n /* TODO: mutex. */\n curSortInfo = &si;\n qsort(obj->arr, curlen, sizeof(Jsi_Value*), SortSubCmd);\n#else\n qsort_r(obj->arr, curlen, sizeof(Jsi_Value*), SortSubCmd, &si);\n#endif\n\n if (interp->deleting) {\n#ifdef NO_QSORT_R\n curSortInfo = NULL;\n#endif\n return JSI_ERROR;\n }\n if (si.unique) {\n int n, diff = 1, dupCnt=0;\n for (n=0, i=1; i<(int)obj->arrCnt; i++) {\n if (obj->arr[n] == obj->arr[i])\n diff = 1;\n else\n#ifdef NO_QSORT_R\n diff = SortSubCmd(&obj->arr[n], &obj->arr[i]);\n#else\n#ifdef __WIN32\n diff = SortSubCmd(&si, &obj->arr[n], &obj->arr[i]);\n#else\n diff = SortSubCmd(&obj->arr[n], &obj->arr[i], &si);\n#endif\n#endif\n if (diff) {\n n++;\n if (n!=i)\n obj->arr[n] = obj->arr[i];\n } else {\n dupCnt++;\n if (obj->arr[i])\n Jsi_DecrRefCount(interp, obj->arr[i]);\n obj->arr[i] = 0;\n }\n }\n obj->arrCnt -= dupCnt;\n }\n#ifdef NO_QSORT_R\n curSortInfo = NULL;\n#endif\n if (hasopt)\n Jsi_OptionsFree(interp, jsi_ArraySortOptions, &si, 0);\ndone:\n v = Jsi_ValueMakeObject(interp, NULL, obj);\n Jsi_ValueReplace(interp, ret, v);\n return JSI_OK;\n \n Jsi_ValueMakeNull(interp, ret);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArraySpliceCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n int newlen, argc, istart, n, rhowmany, ilen, curlen;\n Jsi_Value *va, *start, *howmany;\n Jsi_Obj *nobj, *obj = _this->d.obj;\n \n start = Jsi_ValueArrayIndex(interp, args, 0);\n howmany = Jsi_ValueArrayIndex(interp, args, 1);\n argc = Jsi_ValueGetLength(interp, args);\n istart = 0;\n ilen = (argc>=2 ? argc - 2 : 0);\n n = Jsi_ObjGetLength(interp, obj);\n curlen = n;\n \n if (!start) {\n goto bail2;\n }\n\n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n Jsi_ObjSetLength(interp, nobj, 0);\n \n /* Determine start index. */\n Jsi_Number nstart;\n if (Jsi_GetNumberFromValue(interp, start, &nstart) == JSI_OK) {\n istart = (int)nstart;\n if (istart > n)\n goto bail;\n if (istart < 0)\n istart = (n+istart);\n if (istart<0)\n istart=0;\n }\n \n Jsi_Number nhow;\n rhowmany = n-istart;\n if (howmany && Jsi_GetNumberFromValue(interp, howmany, &nhow) == JSI_OK) {\n rhowmany = (int)nhow;\n if (rhowmany >= (n-istart))\n rhowmany = n-istart;\n if (rhowmany < 0)\n rhowmany = (n-istart);\n if (rhowmany<0)\n goto bail;\n }\n \n if (curlen < 0) {\n Jsi_ObjSetLength(interp, obj, 0);\n }\n Jsi_ObjListifyArray(interp, obj);\n \n Jsi_ObjArraySizer(interp, nobj, rhowmany);\n\n /* Move elements to return object. */\n int i, j, m;\n for (m=0, j = 0, i = istart; marr[i]) continue;\n nobj->arr[m] = obj->arr[i];\n obj->arr[i] = NULL;\n }\n Jsi_ObjSetLength(interp, nobj, m);\n \n /* Shift remaining down. */\n for (; rhowmany && iarr[i-rhowmany] = obj->arr[i];\n obj->arr[i] = NULL;\n }\n curlen -= j;\n /* Add elements. */\n newlen = curlen + argc - (argc>=2?2:1);\n if (Jsi_ObjArraySizer(interp, obj, newlen+3) <= 0) {\n Jsi_LogError(\"too long\");\n Jsi_ValueMakeUndef(interp, ret);\n return JSI_ERROR;\n }\n if (ilen>0) {\n for (i = curlen-1; i>=istart; i--) {\n obj->arr[i+ilen] = obj->arr[i];\n obj->arr[i] = NULL;\n }\n for (m=istart, i = 2; iarr[m] = NULL;\n Jsi_ValueDup2(interp, obj->arr+m, va);\n }\n }\n Jsi_ObjSetLength(interp, obj, newlen);\nbail: \n return JSI_OK;\n \n \nbail2:\n Jsi_ValueMakeNull(interp, ret);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayConstructor(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,\n Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n int argc = Jsi_ValueGetLength(interp, args), iscons = Jsi_FunctionIsConstructor(funcPtr);\n Jsi_Value *target;\n Jsi_Value *v = Jsi_ValueArrayIndex(interp, args, 0);\n \n if (iscons) {\n target = _this;\n Jsi_ValueMakeArrayObject(interp, &_this, Jsi_ObjNewArray(interp, NULL, 0, 0));\n } else {\n Jsi_Obj *o = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n o->__proto__ = interp->Array_prototype;\n Jsi_ValueMakeObject(interp, ret, o);\n target = *ret;\n }\n\n if (argc == 1 && v && Jsi_ValueIsNumber(interp, v)) {\n Jsi_Number nv;\n Jsi_GetNumberFromValue(interp,v, &nv);\n int len = (int)nv;\n if (!Jsi_NumberIsInteger(v->d.num) || len < 0) \n return Jsi_LogError(\"Invalid array length\");\n target->d.obj->isarrlist = 1;\n if (Jsi_ObjArraySizer(interp, target->d.obj, len) <= 0)\n return JSI_ERROR;\n } else {\n \n int i;\n target->d.obj->isarrlist = 1;\n if (Jsi_ObjArraySizer(interp, target->d.obj, 0) <= 0)\n return JSI_ERROR;\n \n for (i = 0; i < argc; ++i) {\n Jsi_Value *argv = Jsi_ValueArrayIndex(interp, args, i); ;\n Jsi_ValueInsertArray(interp, _this, i, argv, 0);\n }\n }\n if (iscons)\n Jsi_ValueDup2(interp, ret, target);\n return JSI_OK;\n}\n \nstatic Jsi_CmdSpec arrayCmds[] = {\n { \"Array\", jsi_ArrayConstructor, 0,-1, \"...\", .help=\"jsi_Array constructor\", .retType=(uint)JSI_TT_ARRAY, .flags=JSI_CMD_IS_CONSTRUCTOR },\n { \"concat\", jsi_ArrayConcatCmd, 0,-1, \"...\", .help=\"Return array with args appended\", .retType=(uint)JSI_TT_ARRAY },\n { \"every\", jsi_ArrayEveryCmd, 1, 1, \"callback:function\", .help=\"Returns true if every value in array satisfies the test\", .retType=(uint)JSI_TT_ANY },\n { \"fill\", jsi_ArrayFillCmd, 1, 3, \"value:any, start:number=0, end:number=-1\", .help=\"Fill an array with values\", .retType=(uint)JSI_TT_ARRAY },\n { \"filter\", jsi_ArrayFilterCmd, 1, 2, \"callback:function, this:object=void\", .help=\"Return a filtered array\", .retType=(uint)JSI_TT_ARRAY },\n { \"find\", jsi_ArrayFindCmd, 1, 1, \"callback:function\", .help=\"Returns the value of the first element in the array that satisfies the test\", .retType=(uint)JSI_TT_ANY },\n { \"findIndex\", jsi_ArrayFindIndexCmd, 1, 1, \"callback:function\", .help=\"Returns the index of the first element in the array that satisfies the test\", .retType=(uint)JSI_TT_ANY },\n { \"flat\", jsi_ArrayFlatCmd, 0, 1, \"depth:number=1\", .help=\"Flatten an arra\", .retType=(uint)JSI_TT_ARRAY },\n { \"forEach\", jsi_ArrayForeachCmd, 1, 2, \"callback:function, this:object=void\", .help=\"Invoke function with each item in object\", .retType=(uint)JSI_TT_VOID },\n { \"includes\", jsi_ArrayIncludesCmd, 1, 1, \"val:any\", .help=\"Returns true if array contains value\", .retType=(uint)JSI_TT_ANY },\n { \"indexOf\", jsi_ArrayIndexOfCmd, 1, 2, \"str:any, startIdx:number=0\", .help=\"Return index of first occurrance in array\", .retType=(uint)JSI_TT_NUMBER },\n { \"isArray\", jsi_ArrayIsArrayCmd, 0, 0, \"\", .help=\"True if val array\", .retType=(uint)JSI_TT_BOOLEAN },\n { \"join\", jsi_ArrayJoinCmd, 0, 1, \"sep:string=''\", .help=\"Return elements joined by char\", .retType=(uint)JSI_TT_STRING },\n { \"lastIndexOf\",jsi_ArrayLastindexOfCmd,1, 2, \"val:any, start:number=0\", .help=\"Return index of last occurence in array\", .retType=(uint)JSI_TT_NUMBER },\n { \"map\", jsi_ArrayMapCmd, 1, 2, \"callback:function, this:object=void\", .help=\"Creates a new array with the results of calling a provided function on every element in this array\", .retType=(uint)JSI_TT_ARRAY },\n { \"pop\", jsi_ArrayPopCmd, 0, 0, \"\", .help=\"Remove and return last element of array\", .retType=(uint)JSI_TT_ANY },\n { \"push\", jsi_ArrayPushCmd, 1,-1, \"val:any, ...\", .help=\"Push one or more elements onto array and return size\", .retType=(uint)JSI_TT_NUMBER },\n { \"reduce\", jsi_ArrayReduceCmd, 1, 2, \"callback:function, initial:any\", .help=\"Return a reduced array\", .retType=(uint)JSI_TT_ANY },\n { \"reduceRight\",jsi_ArrayReduceRightCmd,1, 2, \"callback:function, initial:any\", .help=\"Return a reduced array\", .retType=(uint)JSI_TT_ANY },\n { \"shift\", jsi_ArrayShiftCmd, 0, 0, \"\", .help=\"Remove first element and shift downwards\", .retType=(uint)JSI_TT_ANY },\n { \"sizeOf\", jsi_ArraySizeOfCmd, 0, 0, \"\", .help=\"Return size of array\", .retType=(uint)JSI_TT_NUMBER },\n { \"slice\", jsi_ArraySliceCmd, 1, 2, \"start:number, end:number=void\", .help=\"Return sub-array\", .retType=(uint)JSI_TT_ARRAY },\n { \"some\", jsi_ArraySomeCmd, 1, 2, \"callback:function, this:object=void\", .help=\"Return true if function returns true some element\", .retType=(uint)JSI_TT_BOOLEAN },\n { \"sort\", jsi_ArraySortCmd, 0, 1, \"options:function|object=void\", .help=\"Sort an array\", .retType=(uint)JSI_TT_ARRAY, .flags=0, .info=0, .opts=jsi_ArraySortOptions },\n { \"splice\", jsi_ArraySpliceCmd, 1,-1, \"start:number, howmany:number=void, ...\", .help=\"Change the content of an array, adding new elements while removing old elements\", .retType=(uint)JSI_TT_ARRAY },\n { \"reverse\", jsi_ArrayReverseCmd, 0, 0, \"\", .help=\"Reverse order of all elements in an array\", .retType=(uint)JSI_TT_ARRAY },\n { \"unshift\", jsi_ArrayUnshiftCmd, 0,-1, \"...\", .help=\"Add new elements to start of array and return size\", .retType=(uint)JSI_TT_NUMBER },\n { NULL, 0,0,0,0, .help=\"Provide access to array objects\" }\n};\n\nJsi_RC jsi_InitArray(Jsi_Interp *interp, int release)\n{\n if (release) return JSI_OK;\n interp->Array_prototype = Jsi_CommandCreateSpecs(interp, \"Array\", arrayCmds, NULL, JSI_CMDSPEC_ISOBJ);\n return JSI_OK;\n}\n\n#endif\n"},"code_after":{"kind":"string","value":"#ifndef JSI_LITE_ONLY\n#ifndef JSI_AMALGAMATION\n#include \"jsiInt.h\"\n#endif\n\n#if JSI__MUSL==1 || defined(__FreeBSD__)\n#define NO_QSORT_R 1\n#endif\n\nstatic uint jsi_SizeOfArray(Jsi_Interp *interp, Jsi_Obj *obj) {\n if (!obj || !obj->arr)\n return 0;\n return obj->arrCnt;\n}\n\nstatic Jsi_RC jsi_ArrayPushCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,\n Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n Jsi_Obj *obj;\n \n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) {\n Jsi_ValueMakeNumber(interp, ret, 0);\n return JSI_OK;\n }\n obj = _this->d.obj;\n \n int argc = Jsi_ValueGetLength(interp, args);\n int curlen = jsi_SizeOfArray(interp, obj); \n int i;\n for (i = 0; i < argc; ++i) {\n Jsi_Value *ov = Jsi_ValueArrayIndex(interp, args, i);\n if (!ov) { Jsi_LogBug(\"Arguments Error\"); ov = Jsi_ValueNew(interp); }\n Jsi_ValueInsertArray(interp, _this, curlen + i, ov, 0);\n }\n \n Jsi_ValueMakeNumber(interp, ret, jsi_SizeOfArray(interp, obj));\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayPopCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,\n Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) {\n Jsi_ValueMakeNumber(interp, ret, 0);\n return JSI_OK;\n }\n Jsi_Value *v;\n Jsi_Obj *obj;\n obj = _this->d.obj;\n int i = jsi_SizeOfArray(interp, obj) - 1;\n\n if (i < 0) {\n Jsi_ValueMakeUndef(interp, ret);\n return JSI_OK;\n }\n \n if (obj->arr) {\n if ((v = obj->arr[i])) {\n obj->arr[i] = NULL;\n obj->arrCnt--;\n }\n } else {\n v = Jsi_ValueArrayIndex(interp, _this, i);\n }\n if (v) {\n Jsi_DecrRefCount(interp, *ret);\n *ret = v;\n }\n Jsi_ObjSetLength(interp, obj, i);\n return JSI_OK;\n}\n\n\nstatic Jsi_RC jsi_ArrayJoinCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,\n Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n const char *jstr = \"\";\n int argc, curlen;\n Jsi_DString dStr = {};\n\n curlen = jsi_SizeOfArray(interp, _this->d.obj);\n if (curlen == 0) {\n goto bail;\n }\n\n if (Jsi_ValueGetLength(interp, args) >= 1) {\n Jsi_Value *sc = Jsi_ValueArrayIndex(interp, args, 0);\n if (sc != NULL)\n jstr = Jsi_ValueToString(interp, sc, NULL);\n }\n \n if (0 == (argc=jsi_SizeOfArray(interp, _this->d.obj))) {\n goto bail;\n }\n int i;\n for (i = 0; i < argc; ++i) {\n const char *cp;\n Jsi_Value *ov = Jsi_ValueArrayIndex(interp, _this, i);\n if (!ov) {\n /* TODO: are NULL args ok? */ \n continue;\n cp = \"\";\n } else\n cp = Jsi_ValueToString(interp, ov, NULL);\n if (i && jstr[0])\n Jsi_DSAppend(&dStr, jstr, NULL);\n Jsi_DSAppend(&dStr, cp, NULL);\n }\n \n Jsi_ValueMakeStringDup(interp, ret, Jsi_DSValue(&dStr));\n Jsi_DSFree(&dStr);\n return JSI_OK;\nbail:\n Jsi_ValueMakeStringDup(interp, ret, \"\");\n return JSI_OK; \n}\n\n\nJsi_Value* Jsi_ValueArrayConcat(Jsi_Interp *interp, Jsi_Value *arg1, Jsi_Value *arg2) {\n Jsi_Value *va;\n Jsi_Obj *obj;\n if (arg1->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, arg1->d.obj)) {\n return NULL;\n }\n if (arg2->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, arg2->d.obj)) {\n return NULL;\n }\n int len1 = arg1->d.obj->arrCnt;\n int len2 = arg2->d.obj->arrCnt;\n Jsi_Obj *nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n Jsi_ObjArraySizer(interp, nobj, len1+len2);\n\n int i, j = 0;\n obj = arg1->d.obj;\n for (i = 0; iarr[i]) continue;\n nobj->arr[j] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+j, obj->arr[i]);\n }\n obj = arg2->d.obj;\n for (i = 0; iarr[i]) continue;\n nobj->arr[j] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+j, obj->arr[i]);\n }\n Jsi_ObjSetLength(interp, nobj, len1+len2);\n va = Jsi_ValueMakeArrayObject(interp, NULL, nobj);\n return va;\n}\n\nJsi_RC Jsi_ValueArrayPush(Jsi_Interp *interp, Jsi_Value *arg1, Jsi_Value *arg2) {\n Jsi_Obj *obj;\n if (arg1->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, arg1->d.obj))\n return JSI_ERROR;\n if (!arg2)\n return JSI_ERROR;\n int len1 = arg1->d.obj->arrCnt;\n obj = arg1->d.obj;\n Jsi_ObjArraySizer(interp, obj, len1);\n obj->arr[len1] = arg2;\n Jsi_IncrRefCount(interp, arg2);\n obj->arrCnt++;\n return JSI_OK;\n}\n\n\nJsi_Value *Jsi_ValueArrayPop(Jsi_Interp *interp, Jsi_Value *v)\n{\n if (v->vt != JSI_VT_OBJECT) {\n Jsi_LogBug(\"Jsi_ValueArrayPop, target is not object\");\n return NULL;\n }\n Jsi_Obj *o = v->d.obj;\n if (!o->isarrlist) {\n Jsi_LogBug(\"Jsi_ValueArrayPop, target is not array\");\n return NULL;\n }\n if (o->arrCnt<=0)\n return NULL;\n int idx = o->arrCnt-1;\n if (!o->arr[idx])\n return NULL;\n Jsi_DecrRefCount(interp, o->arr[idx]);\n Jsi_Value *ret = o->arr[idx];\n o->arr[idx] = NULL;\n o->arrCnt--;\n return ret;\n}\n\n\nJsi_Value *Jsi_ValueArrayUnshift(Jsi_Interp *interp, Jsi_Value *v)\n{\n if (v->vt != JSI_VT_OBJECT) {\n Jsi_LogBug(\"Jsi_ValueArrayUnshift, target is not object\");\n return NULL;\n }\n Jsi_Obj *o = v->d.obj;\n if (!o->isarrlist) {\n Jsi_LogBug(\"Jsi_ValueArrayUnshift, target is not array\");\n return NULL;\n }\n if (o->arrCnt<=0)\n return NULL;\n if (!o->arr[0])\n return NULL;\n Jsi_DecrRefCount(interp, o->arr[0]);\n Jsi_Value *ret = o->arr[0];\n o->arr[0] = NULL;\n o->arrCnt--;\n return ret;\n}\n\n/* delete array[0], array[1]->array[0] */\nvoid Jsi_ValueArrayShift(Jsi_Interp *interp, Jsi_Value *v)\n{\n if (v->vt != JSI_VT_OBJECT) {\n Jsi_LogBug(\"Jsi_ValueArrayShift, target is not object\");\n return;\n }\n Jsi_Obj *o = v->d.obj;\n if (o->isarrlist) {\n uint i;\n if (!o->arrCnt)\n return;\n if (o->arr[0])\n Jsi_DecrRefCount(interp, o->arr[0]);\n for (i=1; iarrCnt; i++) {\n o->arr[i-1] = o->arr[i];\n }\n o->arr[o->arrCnt--] = NULL;\n return;\n }\n \n int len = jsi_SizeOfArray(interp, v->d.obj);\n if (len <= 0) return;\n \n Jsi_Value *v0 = Jsi_ValueArrayIndex(interp, v, 0);\n if (!v0) return;\n \n Jsi_ValueReset(interp, &v0);\n \n int i;\n Jsi_Value *last = v0;\n for (i = 1; i < len; ++i) {\n Jsi_Value *t = Jsi_ValueArrayIndex(interp, v, i);\n if (!t) return;\n Jsi_ValueCopy(interp, last, t);\n Jsi_ValueReset(interp, &t);\n last = t;\n }\n Jsi_ObjSetLength(interp, v->d.obj, len - 1);\n}\n\nstatic Jsi_RC jsi_ArrayFlatSub(Jsi_Interp *interp, Jsi_Obj* nobj, Jsi_Value *arr, int depth) {\n \n int i, n = 0, len = jsi_SizeOfArray(interp, arr->d.obj);\n if (len <= 0) return JSI_OK;\n Jsi_RC rc = JSI_OK;\n int clen = jsi_SizeOfArray(interp, nobj);\n for (i = 0; i < len && rc == JSI_OK; i++) {\n Jsi_Value *t = Jsi_ValueArrayIndex(interp, arr, i);\n if (t && depth>0 && Jsi_ValueIsArray(interp, t))\n rc = jsi_ArrayFlatSub(interp, nobj, t , depth-1);\n else if (!Jsi_ValueIsUndef(interp, t))\n Jsi_ObjArrayAdd(interp, nobj, t);\n if ((++n + clen)>interp->maxArrayList)\n return Jsi_LogError(\"array size exceeded\");\n }\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayFlatCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n Jsi_Number ndepth = 1;\n Jsi_Obj *nobj;\n Jsi_Value *depth = Jsi_ValueArrayIndex(interp, args, 0);\n if (depth && Jsi_GetNumberFromValue(interp,depth, &ndepth) != JSI_OK)\n return JSI_ERROR;\n \n if (ndepth < 0 || ndepth>1000)\n return Jsi_LogError(\"bad depth: %d\", (int)ndepth);\n\n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n Jsi_ValueMakeArrayObject(interp, ret, nobj );\n if (ndepth>0)\n return jsi_ArrayFlatSub(interp, nobj, _this, ndepth);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayConcatCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_RC rc = JSI_OK;\n int curlen, argc, nsiz;\n Jsi_Obj *obj, *nobj;\n Jsi_Value *va;\n\n obj = _this->d.obj;\n \n argc = Jsi_ValueGetLength(interp, args);\n curlen = jsi_SizeOfArray(interp, obj);\n Jsi_ObjListifyArray(interp, obj);\n \n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n nsiz = obj->arrMaxSize;\n if (nsiz<=0) nsiz = 100;\n if (Jsi_ObjArraySizer(interp, nobj, nsiz+1) <= 0) {\n rc = JSI_ERROR;\n Jsi_LogError(\"index too large: %d\", nsiz+1);\n goto bail;\n }\n\n int i, j, m;\n for (i = 0; iarr[i]) continue;\n nobj->arr[i] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+i, obj->arr[i]);\n }\n m = i;\n for (i = 0; i < argc; i++) {\n va = Jsi_ValueArrayIndex(interp, args, i);\n if (va->vt == JSI_VT_OBJECT && Jsi_ObjIsArray(interp, va->d.obj)) {\n int margc = Jsi_ValueGetLength(interp, va);\n Jsi_Obj *mobj = va->d.obj;\n Jsi_ObjListifyArray(interp, mobj);\n if (Jsi_ObjArraySizer(interp, nobj, curlen += margc) <= 0) {\n rc = JSI_ERROR;\n Jsi_LogError(\"index too large: %d\", curlen);\n goto bail;\n }\n for (j = 0; jarr[j]) continue;\n nobj->arr[m] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+m, mobj->arr[j]);\n }\n } else {\n if (Jsi_ObjArraySizer(interp, nobj, ++curlen) <= 0) {\n rc = JSI_ERROR;\n Jsi_LogError(\"index too large: %d\", curlen);\n goto bail;\n }\n nobj->arr[m] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+m++, va);\n }\n }\n Jsi_ObjSetLength(interp, nobj, curlen);\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n return JSI_OK;\n \nbail:\n Jsi_ValueMakeNull(interp, ret);\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayMapCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_RC rc = JSI_OK;\n int curlen, nsiz, i, maa = 0;\n Jsi_Obj *obj, *nobj;\n Jsi_Value *func, *vpargs, *nthis = NULL, *sthis;\n Jsi_Func *fptr = NULL;\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n sthis = Jsi_ValueArrayIndex(interp, args, 1);\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n obj = _this->d.obj;\n curlen = jsi_SizeOfArray(interp, obj); \n Jsi_ObjListifyArray(interp, obj);\n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n nsiz = obj->arrCnt;\n if (nsiz<=0) nsiz = 1;\n if (Jsi_ObjArraySizer(interp, nobj, nsiz) <= 0) {\n Jsi_LogError(\"index too large: %d\", nsiz);\n rc = JSI_ERROR;\n goto bail;\n }\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n Jsi_Value *vobjs[3];\n\n fptr = func->d.obj->d.fobj->func;\n maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>3)\n maa = 3;\n for (i = 0; i < curlen; i++) {\n if (!obj->arr[i]) continue;\n vobjs[0] = obj->arr[i];\n vobjs[1] = (maa>1?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[2] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n nobj->arr[i] = Jsi_ValueNew1(interp);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, nobj->arr+i, sthis);\n Jsi_DecrRefCount(interp, vpargs);\n if( JSI_OK!=rc ) {\n goto bail;\n }\n }\n Jsi_ObjSetLength(interp, nobj, curlen);\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n return JSI_OK;\n \nbail:\n Jsi_ValueMakeNull(interp, ret);\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayFilterCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_RC rc = JSI_OK;\n int curlen, nsiz, i, fval, n = 0, maa = 0;\n Jsi_Obj *obj, *nobj;\n Jsi_Value *func, *vpargs, *nthis = NULL, *sthis, *nrPtr = NULL;\n Jsi_Func *fptr = NULL;\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n sthis = Jsi_ValueArrayIndex(interp, args, 1);\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n obj = _this->d.obj;\n curlen = jsi_SizeOfArray(interp, obj); \n Jsi_ObjListifyArray(interp, obj);\n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n nsiz = obj->arrCnt;\n if (nsiz<=0) nsiz = 1;\n if (Jsi_ObjArraySizer(interp, nobj, nsiz) <= 0) {\n Jsi_LogError(\"index too large: %d\", nsiz);\n rc = JSI_ERROR;\n goto bail;\n }\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n nrPtr = Jsi_ValueNew1(interp);\n Jsi_Value *vobjs[4];\n\n fptr = func->d.obj->d.fobj->func;\n maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>3)\n maa = 3;\n for (i = 0; i < curlen; i++) {\n if (!obj->arr[i]) continue;\n vobjs[0] = obj->arr[i];\n vobjs[1] = (maa>1?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[2] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, &nrPtr, sthis);\n Jsi_DecrRefCount(interp, vpargs);\n fval = Jsi_ValueIsTrue(interp, nrPtr);\n Jsi_ValueMakeUndef(interp, &nrPtr);\n if( JSI_OK!=rc ) {\n goto bail;\n }\n if (fval) {\n nobj->arr[n++] = obj->arr[i];\n Jsi_IncrRefCount(interp, obj->arr[i]);\n }\n }\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n Jsi_DecrRefCount(interp, nrPtr);\n Jsi_ObjSetLength(interp, nobj, n);\n return JSI_OK;\n \nbail:\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n if (nrPtr)\n Jsi_DecrRefCount(interp, nrPtr);\n Jsi_ValueMakeNull(interp, ret);\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayReverseCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this, Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array\");\n int i, n, m;\n Jsi_Obj *obj;\n Jsi_Value *tval, *nthis = NULL, *sthis = Jsi_ValueArrayIndex(interp, args, 1);\n\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n obj = _this->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n m = obj->arrCnt/2;\n for (i = 0, n=obj->arrCnt-1; i < m; i++, n--) {\n tval = obj->arr[i];\n obj->arr[i] = obj->arr[n];\n obj->arr[n] = tval;\n }\n Jsi_ValueDup2(interp, ret, _this);\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayForeachCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) \n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array object\");\n Jsi_Obj *obj;\n uint i;\n Jsi_Value *func, *vpargs;\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n Jsi_Value *sthis = Jsi_ValueArrayIndex(interp, args, 1);\n Jsi_Value *nthis = NULL;\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n\n obj = _this->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n Jsi_RC rc = JSI_OK;\n \n Jsi_Value *vobjs[3];\n Jsi_Func *fptr = func->d.obj->d.fobj->func;\n int maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>3)\n maa = 3;\n for (i = 0; i < obj->arrCnt && rc == JSI_OK; i++) {\n if (!obj->arr[i]) continue;\n vobjs[0] = obj->arr[i];\n vobjs[1] = (maa>1?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[2] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, ret, sthis);\n Jsi_DecrRefCount(interp, vpargs);\n }\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n return rc;\n}\n\nstatic Jsi_RC jsi_ArrayFindSubCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr, int op) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array\");\n Jsi_Obj *obj;\n uint i;\n Jsi_RC rc = JSI_OK;\n Jsi_Value *func, *vpargs, *sthis = Jsi_ValueArrayIndex(interp, args, 1);\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n Jsi_Value *nthis = NULL;\n if (!sthis)\n sthis = nthis = Jsi_ValueNew1(interp);\n\n obj = _this->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n int fval = 0;\n Jsi_Value *nrPtr = Jsi_ValueNew1(interp);\n Jsi_Value *vobjs[3];\n Jsi_Func *fptr = func->d.obj->d.fobj->func;\n int maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>3)\n maa = 3;\n for (i = 0; i < obj->arrCnt && rc == JSI_OK; i++) {\n if (!obj->arr[i]) continue;\n vobjs[0] = obj->arr[i];\n vobjs[1] = (maa>1?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[2] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, &nrPtr, sthis);\n Jsi_DecrRefCount(interp, vpargs);\n if (rc != JSI_OK)\n break;\n fval = Jsi_ValueIsTrue(interp, nrPtr);\n Jsi_ValueMakeUndef(interp, &nrPtr);\n if (op == 3) {\n if (!fval) break;\n } else if (fval)\n break;\n }\n if (rc == JSI_OK) {\n if (op == 1 && fval) // Find\n Jsi_ValueCopy(interp, *ret, obj->arr[i]); \n else if (op == 2 || op == 3) // Some/Every\n Jsi_ValueMakeBool(interp, ret, fval);\n else if (op == 4)\n Jsi_ValueMakeNumber(interp, ret, (Jsi_Number)(fval?(int)i:-1));\n }\n if (nthis)\n Jsi_DecrRefCount(interp, nthis);\n Jsi_DecrRefCount(interp, nrPtr);\n return rc;\n\n}\n\nstatic Jsi_RC jsi_ArrayReduceSubCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr, int op) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array\");\n Jsi_RC rc = JSI_OK;\n int i;\n Jsi_Obj *obj;\n Jsi_Value *func, *vpargs, *ini = Jsi_ValueArrayIndex(interp, args, 1);\n\n func = Jsi_ValueArrayIndex(interp, args, 0);\n if (!Jsi_ValueIsFunction(interp, func)) \n return Jsi_LogError(\"expected function\");\n\n Jsi_Value *nrPtr = Jsi_ValueNew1(interp);\n obj = _this->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n Jsi_Value *vobjs[4];\n int n, rev = (op==2);\n Jsi_Func *fptr = func->d.obj->d.fobj->func;\n int maa = (fptr->argnames?fptr->argnames->argCnt:0);\n if (maa>4)\n maa = 4;\n\n for (n = 0, i = (rev?obj->arrCnt-1:0); (rev?i>=0:i < (int)obj->arrCnt) && rc == JSI_OK; n++, i = (rev?i-1:i+1)) {\n if (!obj->arr[i]) continue;\n if (n==0 && !ini) {\n ini = obj->arr[i];\n continue;\n }\n \n vobjs[0] = ini;\n vobjs[1] = obj->arr[i];\n vobjs[2] = (maa>2?Jsi_ValueNewNumber(interp, i):NULL);\n vobjs[3] = _this;\n vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vobjs, maa, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, func, vpargs, &nrPtr, NULL);\n Jsi_DecrRefCount(interp, vpargs);\n if (rc != JSI_OK)\n break;\n ini = nrPtr;\n }\n if (rc == JSI_OK && ini)\n Jsi_ValueCopy(interp, *ret, ini); \n Jsi_DecrRefCount(interp, nrPtr);\n return rc;\n\n}\n\nstatic Jsi_RC jsi_ArrayFindCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayFindSubCmd(interp, args, _this, ret, funcPtr, 1);\n}\nstatic Jsi_RC jsi_ArraySomeCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayFindSubCmd(interp, args, _this, ret, funcPtr, 2);\n}\nstatic Jsi_RC jsi_ArrayEveryCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayFindSubCmd(interp, args, _this, ret, funcPtr, 3);\n}\nstatic Jsi_RC jsi_ArrayFindIndexCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayFindSubCmd(interp, args, _this, ret, funcPtr, 4);\n}\nstatic Jsi_RC jsi_ArrayReduceCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayReduceSubCmd(interp, args, _this, ret, funcPtr, 1);\n}\nstatic Jsi_RC jsi_ArrayReduceRightCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayReduceSubCmd(interp, args, _this, ret, funcPtr, 2);\n}\nstatic Jsi_RC jsi_ArrayIsArrayCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n bool b = 0;\n Jsi_Value *sthis = _this;\n if (_this->vt == JSI_VT_OBJECT && _this->d.obj->ot == JSI_OT_FUNCTION &&\n _this->d.obj->__proto__ == interp->Array_prototype->d.obj->__proto__ )\n sthis = Jsi_ValueArrayIndex(interp, args, 0); \n if (sthis && sthis->vt == JSI_VT_OBJECT && Jsi_ObjIsArray(interp, sthis->d.obj))\n b = 1;\n Jsi_ValueMakeBool(interp, ret, b);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayIndexSubCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr, int op) {\n int istart = 0, n, i = 0, dir=1, idx=-1;\n Jsi_Value *seq = Jsi_ValueArrayIndex(interp, args, 0),\n *start = Jsi_ValueArrayIndex(interp, args, 1);\n Jsi_Obj *obj = _this->d.obj;\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n if (!seq) {\n goto bail;\n }\n \n n = jsi_SizeOfArray(interp, obj); \n if (n == 0) {\n goto bail;\n }\n Jsi_Number nstart;\n if (op == 2) {\n istart = n-1;\n }\n if (start && Jsi_GetNumberFromValue(interp,start, &nstart)==JSI_OK) {\n istart = (int)nstart;\n if (istart > n)\n goto bail;\n if (istart < 0)\n istart = (n+istart);\n if (istart<0)\n goto bail;\n }\n if (op == 2) {\n istart = n-1;\n dir = -1;\n }\n Jsi_ObjListifyArray(interp, obj);\n for (i = istart; ; i+=dir)\n {\n if ((dir>0 && i>=n) || (dir<0 && i<0) || i>=(int)obj->arrCnt)\n break;\n if (obj->arr[i] && Jsi_ValueCmp(interp, obj->arr[i], seq, JSI_CMP_EXACT)==0) {\n idx = i;\n break;\n }\n }\nbail:\n if (op == 3)\n Jsi_ValueMakeBool(interp, ret, (idx!=-1));\n else\n Jsi_ValueMakeNumber(interp, ret, idx);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayIndexOfCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayIndexSubCmd(interp, args, _this, ret, funcPtr, 1);\n}\nstatic Jsi_RC jsi_ArrayLastindexOfCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayIndexSubCmd(interp, args, _this, ret, funcPtr, 2);\n}\nstatic Jsi_RC jsi_ArrayIncludesCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n return jsi_ArrayIndexSubCmd(interp, args, _this, ret, funcPtr, 3);\n}\n\nstatic Jsi_RC jsi_ArraySizeOfCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n int i = jsi_SizeOfArray(interp, _this->d.obj);\n Jsi_ValueMakeNumber(interp, ret, i);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayShiftCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_Value *v;\n Jsi_Obj *obj = _this->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n uint n = jsi_SizeOfArray(interp, obj);\n if (n<=0) {\n Jsi_ValueMakeUndef(interp, ret);\n } else {\n n--;\n v = obj->arr[0];\n memmove(obj->arr, obj->arr+1, n*sizeof(Jsi_Value*));\n obj->arr[n] = NULL;\n Jsi_ValueDup2(interp, ret, v);\n Jsi_DecrRefCount(interp, v);\n Jsi_ObjSetLength(interp, obj, n);\n }\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayUnshiftCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n Jsi_Obj *obj = _this->d.obj;\n int argc = Jsi_ValueGetLength(interp, args);\n int curlen = jsi_SizeOfArray(interp, obj);\n if (argc <= 0) {\n Jsi_ValueMakeNumber(interp, ret, 0);\n return JSI_OK;\n }\n Jsi_ObjListifyArray(interp, obj);\n if (Jsi_ObjArraySizer(interp, obj, curlen+argc)<=0) \n return Jsi_LogError(\"too long\");\n memmove(obj->arr+argc, obj->arr, (curlen)*sizeof(Jsi_Value*));\n obj->arrCnt += argc;\n int i;\n for (i = 0; i < argc; ++i) {\n Jsi_Value *ov = Jsi_ValueArrayIndex(interp, args, i);\n obj->arr[i] = NULL;\n if (!ov) { Jsi_LogBug(\"Arguments Error\"); continue; }\n obj->arr[i] = ov;\n Jsi_IncrRefCount(interp, ov);\n }\n Jsi_ObjSetLength(interp, obj, curlen+argc);\n \n Jsi_ValueMakeNumber(interp, ret, jsi_SizeOfArray(interp, obj));\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayFillCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj)) \n return Jsi_LogError(\"expected array object\");\n Jsi_RC rc = JSI_OK;\n int istart = 0, iend, n, nsiz;\n Jsi_Number nstart = 0, nend = 0; // TODO: merge with code in ArraySliceCmd.\n Jsi_Value *value = Jsi_ValueArrayIndex(interp, args, 0),\n *start = Jsi_ValueArrayIndex(interp, args, 1),\n *end = Jsi_ValueArrayIndex(interp, args, 2);\n Jsi_Obj *obj = _this->d.obj;\n n = jsi_SizeOfArray(interp, obj);\n\n if (start && Jsi_GetNumberFromValue(interp, start, &nstart) == JSI_OK) {\n istart = (int)nstart;\n if (istart > n)\n goto bail;\n if (istart < 0)\n istart = (n+istart);\n if (istart<0)\n goto bail;\n }\n \n if (n == 0) {\n goto bail;\n }\n iend = n-1;\n if (end && Jsi_GetNumberFromValue(interp,end, &nend) == JSI_OK) {\n iend = (int) nend;\n if (iend >= n)\n iend = n;\n if (iend < 0)\n iend = (n+iend);\n if (iend<0)\n goto bail;\n }\n nsiz = iend-istart+1;\n if (nsiz<=0)\n goto bail;\n\n int i;\n for (i = istart; i <= iend; i++)\n {\n if (obj->arr[i])\n Jsi_ValueCopy(interp, obj->arr[i], value);\n else\n obj->arr[i] = Jsi_ValueDup(interp, value);\n }\nbail:\n if (_this != *ret) {\n Jsi_ValueMove(interp, *ret, _this);\n /*if (*ret)\n Jsi_DecrRefCount(interp, *ret);\n *ret = _this;\n Jsi_IncrRefCount(interp, *ret);*/\n }\n return rc;\n}\n\n\nstatic Jsi_RC jsi_ArraySliceCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n Jsi_RC rc = JSI_OK;\n int istart = 0, iend, n, nsiz;\n Jsi_Number nstart;\n Jsi_Obj *nobj, *obj;\n Jsi_Value *start = Jsi_ValueArrayIndex(interp, args, 0),\n *end = Jsi_ValueArrayIndex(interp, args, 1);\n if (!start) {\n goto bail;\n }\n obj = _this->d.obj;\n n = jsi_SizeOfArray(interp, obj);\n if (Jsi_GetNumberFromValue(interp,start, &nstart) == JSI_OK) {\n istart = (int)nstart;\n if (istart > n)\n goto done;\n if (istart < 0)\n istart = (n+istart);\n if (istart<0)\n goto bail;\n }\n \n if (n == 0) {\ndone:\n Jsi_ValueMakeArrayObject(interp, ret, Jsi_ObjNewType(interp, JSI_OT_ARRAY));\n return JSI_OK;\n }\n Jsi_Number nend;\n iend = n-1;\n if (end && Jsi_GetNumberFromValue(interp,end, &nend) == JSI_OK) {\n iend = (int) nend;\n if (iend >= n)\n iend = n;\n if (iend < 0)\n iend = (n+iend);\n if (iend<0)\n goto bail;\n }\n nsiz = iend-istart+1;\n if (nsiz<=0)\n goto done;\n Jsi_ObjListifyArray(interp, obj);\n \n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n\n if (Jsi_ObjArraySizer(interp, nobj, nsiz) <= 0) {\n rc = Jsi_LogError(\"index too large: %d\", nsiz);\n goto bail;\n }\n\n int i, m;\n for (m = 0, i = istart; i <= iend; i++, m++)\n {\n if (!obj->arr[i]) continue;\n nobj->arr[m] = NULL;\n Jsi_ValueDup2(interp, nobj->arr+m, obj->arr[i]);\n }\n Jsi_ObjSetLength(interp, nobj, nsiz);\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n return JSI_OK;\n \nbail:\n Jsi_ValueMakeNull(interp, ret);\n return rc;\n}\n\ntypedef struct {\n Jsi_Interp *interp;\n int flags;\n int mode;\n bool unique;\n Jsi_Value *compare;\n int errCnt;\n} SortInfo;\n\nstatic const char *sortArrayStrs[] = {\"default\", \"desc\", \"dict\", \"nocase\", 0};\n\nstatic Jsi_OptionSpec jsi_ArraySortOptions[] = {\n JSI_OPT(CUSTOM, SortInfo, mode, .help=\"Mode to sort by\", .flags=0, .custom=Jsi_Opt_SwitchEnum, .data=sortArrayStrs),\n JSI_OPT(FUNC, SortInfo, compare, .help=\"Function to do comparison\", .flags=0, .custom=0, .data=(void*)\"val1,val2\"),\n JSI_OPT(BOOL, SortInfo, unique, .help=\"Eliminate duplicate items\"),\n JSI_OPT_END(SortInfo)\n};\n\n#ifdef NO_QSORT_R\n\nSortInfo *curSortInfo = NULL;\n\nstatic int SortSubCmd(const void *p1, const void *p2) {\n SortInfo *si = curSortInfo;\n#else\n#ifdef __WIN32\nstatic int SortSubCmd(void *thunk, const void *p1, const void *p2)\n#else\nstatic int SortSubCmd(const void *p1, const void *p2, void *thunk)\n#endif\n{\n SortInfo *si = (SortInfo *)thunk;\n#endif\n Jsi_Interp *interp = si->interp;\n int sortFlags = si->flags;\n\n if (interp == NULL || interp->deleting)\n return 0;\n Jsi_Value *v1 = *(Jsi_Value**)p1, *v2 = *(Jsi_Value**)p2;\n int rc = 0;\n if (v1 != NULL && v2 != NULL) {\n VALCHK(v1);\n VALCHK(v2);\n if (!si->compare)\n rc = Jsi_ValueCmp(interp, v1, v2, sortFlags);\n else {\n Jsi_Value *vv[2] = {v1, v2};\n Jsi_Value *retP = Jsi_ValueNew1(interp);\n Jsi_Value *vpargs = Jsi_ValueMakeObject(interp, NULL, Jsi_ObjNewArray(interp, vv, 2, 0));\n Jsi_IncrRefCount(interp, vpargs);\n rc = Jsi_FunctionInvoke(interp, si->compare, vpargs, &retP, NULL);\n Jsi_DecrRefCount(interp, vpargs);\n if (rc == JSI_OK) {\n Jsi_Number d = 0;\n if (Jsi_ValueGetNumber(interp, retP, &d) == JSI_OK)\n rc = -(int)d;\n else {\n if (!si->errCnt)\n Jsi_LogWarn(\"invalid function return\");\n si->errCnt++;\n }\n }\n Jsi_DecrRefCount(interp, retP);\n }\n } else {\n if (v1 == v2) \n rc = 0;\n else if (v1 == NULL)\n rc = 1;\n else\n rc = -1;\n }\n if ((sortFlags&JSI_SORT_DESCEND))\n return rc;\n return -rc;\n}\n\nJsi_RC Jsi_ValueArraySort(Jsi_Interp *interp, Jsi_Value *val, int flags)\n{\n if (val->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, val->d.obj)) {\n return JSI_ERROR;\n }\n Jsi_Obj *obj = val->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n if (obj->arrCnt <= 0) {\n return JSI_OK;\n }\n#ifdef __WIN32\n#define qsort_r qsort_s\n#endif\n\n SortInfo si = {};\n si.interp = interp;\n si.flags = flags;\n#ifdef NO_QSORT_R\n curSortInfo = &si;\n qsort(obj->arr, obj->arrCnt, sizeof(Jsi_Value*), SortSubCmd);\n curSortInfo = NULL;\n#else\n qsort_r(obj->arr, obj->arrCnt, sizeof(Jsi_Value*), SortSubCmd, &si);\n#endif\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArraySortCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n\n int flags = 0, i, curlen, hasopt = 0;\n Jsi_Value *v, *arg = NULL;\n SortInfo si = {};\n si.interp = interp;\n\n\n Jsi_Obj *obj = _this->d.obj;\n curlen = obj->arrCnt;\n\n if (curlen <= 1) {\n goto done;\n }\n \n arg = Jsi_ValueArrayIndex(interp, args, 0);\n if (arg) {\n if (Jsi_ValueIsObjType(interp, arg, JSI_OT_OBJECT)) {\n if (Jsi_OptionsProcess(interp, jsi_ArraySortOptions, &si, arg, 0) < 0)\n return JSI_ERROR;\n hasopt = 1;\n switch (si.mode) {\n case 1: flags |= JSI_SORT_DESCEND; break;\n case 2: flags |= JSI_SORT_DICT; break;\n case 3: flags |= JSI_SORT_NOCASE; break;\n }\n } else if (Jsi_ValueIsObjType(interp, arg, JSI_OT_FUNCTION))\n si.compare = arg;\n else \n return Jsi_LogError(\"expected object or function\");\n }\n si.flags = flags;\n Jsi_ObjListifyArray(interp, obj);\n#ifdef NO_QSORT_R\n /* TODO: mutex. */\n curSortInfo = &si;\n qsort(obj->arr, curlen, sizeof(Jsi_Value*), SortSubCmd);\n#else\n qsort_r(obj->arr, curlen, sizeof(Jsi_Value*), SortSubCmd, &si);\n#endif\n\n if (interp->deleting) {\n#ifdef NO_QSORT_R\n curSortInfo = NULL;\n#endif\n return JSI_ERROR;\n }\n if (si.unique) {\n int n, diff = 1, dupCnt=0;\n for (n=0, i=1; i<(int)obj->arrCnt; i++) {\n if (obj->arr[n] == obj->arr[i])\n diff = 1;\n else\n#ifdef NO_QSORT_R\n diff = SortSubCmd(&obj->arr[n], &obj->arr[i]);\n#else\n#ifdef __WIN32\n diff = SortSubCmd(&si, &obj->arr[n], &obj->arr[i]);\n#else\n diff = SortSubCmd(&obj->arr[n], &obj->arr[i], &si);\n#endif\n#endif\n if (diff) {\n n++;\n if (n!=i)\n obj->arr[n] = obj->arr[i];\n } else {\n dupCnt++;\n if (obj->arr[i])\n Jsi_DecrRefCount(interp, obj->arr[i]);\n obj->arr[i] = 0;\n }\n }\n obj->arrCnt -= dupCnt;\n }\n#ifdef NO_QSORT_R\n curSortInfo = NULL;\n#endif\n if (hasopt)\n Jsi_OptionsFree(interp, jsi_ArraySortOptions, &si, 0);\ndone:\n v = Jsi_ValueMakeObject(interp, NULL, obj);\n Jsi_ValueReplace(interp, ret, v);\n return JSI_OK;\n \n Jsi_ValueMakeNull(interp, ret);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArraySpliceCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n int newlen, argc, istart, n, rhowmany, ilen, curlen;\n Jsi_Value *va, *start, *howmany;\n Jsi_Obj *nobj, *obj = _this->d.obj;\n \n start = Jsi_ValueArrayIndex(interp, args, 0);\n howmany = Jsi_ValueArrayIndex(interp, args, 1);\n argc = Jsi_ValueGetLength(interp, args);\n istart = 0;\n ilen = (argc>=2 ? argc - 2 : 0);\n n = jsi_SizeOfArray(interp, obj);\n curlen = n;\n \n if (!start) {\n goto bail2;\n }\n\n nobj = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n Jsi_ValueMakeArrayObject(interp, ret, nobj);\n Jsi_ObjSetLength(interp, nobj, 0);\n \n /* Determine start index. */\n Jsi_Number nstart;\n if (Jsi_GetNumberFromValue(interp, start, &nstart) == JSI_OK) {\n istart = (int)nstart;\n if (istart > n)\n goto bail;\n if (istart < 0)\n istart = (n+istart);\n if (istart<0)\n istart=0;\n }\n \n Jsi_Number nhow;\n rhowmany = n-istart;\n if (howmany && Jsi_GetNumberFromValue(interp, howmany, &nhow) == JSI_OK) {\n rhowmany = (int)nhow;\n if (rhowmany >= (n-istart))\n rhowmany = n-istart;\n if (rhowmany < 0)\n rhowmany = (n-istart);\n if (rhowmany<0)\n goto bail;\n }\n \n if (curlen < 0) {\n Jsi_ObjSetLength(interp, obj, curlen=0);\n }\n Jsi_ObjListifyArray(interp, obj);\n \n Jsi_ObjArraySizer(interp, nobj, rhowmany);\n\n /* Move elements to return object. */\n int i, j, m;\n for (m=0, j = 0, i = istart; marr[i]) continue;\n nobj->arr[m] = obj->arr[i];\n obj->arr[i] = NULL;\n }\n Jsi_ObjSetLength(interp, nobj, m);\n \n /* Shift remaining down. */\n for (; rhowmany && iarr[i-rhowmany] = obj->arr[i];\n obj->arr[i] = NULL;\n }\n curlen -= j;\n /* Add elements. */\n newlen = curlen + argc - (argc>=2?2:1);\n if (Jsi_ObjArraySizer(interp, obj, newlen+3) <= 0) {\n Jsi_LogError(\"too long\");\n Jsi_ValueMakeUndef(interp, ret);\n return JSI_ERROR;\n }\n if (ilen>0) {\n for (i = curlen-1; i>=istart; i--) {\n obj->arr[i+ilen] = obj->arr[i];\n obj->arr[i] = NULL;\n }\n for (m=istart, i = 2; iarr[m] = NULL;\n Jsi_ValueDup2(interp, obj->arr+m, va);\n }\n }\n Jsi_ObjSetLength(interp, obj, newlen);\nbail: \n return JSI_OK;\n \n \nbail2:\n Jsi_ValueMakeNull(interp, ret);\n return JSI_OK;\n}\n\nstatic Jsi_RC jsi_ArrayConstructor(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,\n Jsi_Value **ret, Jsi_Func *funcPtr)\n{\n int argc = Jsi_ValueGetLength(interp, args), iscons = Jsi_FunctionIsConstructor(funcPtr);\n Jsi_Value *target;\n Jsi_Value *v = Jsi_ValueArrayIndex(interp, args, 0);\n \n if (iscons) {\n target = _this;\n Jsi_ValueMakeArrayObject(interp, &_this, Jsi_ObjNewArray(interp, NULL, 0, 0));\n } else {\n Jsi_Obj *o = Jsi_ObjNewType(interp, JSI_OT_ARRAY);\n o->__proto__ = interp->Array_prototype;\n Jsi_ValueMakeObject(interp, ret, o);\n target = *ret;\n }\n\n if (argc == 1 && v && Jsi_ValueIsNumber(interp, v)) {\n Jsi_Number nv;\n Jsi_GetNumberFromValue(interp,v, &nv);\n int len = (int)nv;\n if (!Jsi_NumberIsInteger(v->d.num) || len < 0) \n return Jsi_LogError(\"Invalid array length\");\n target->d.obj->isarrlist = 1;\n if (Jsi_ObjArraySizer(interp, target->d.obj, len) <= 0)\n return JSI_ERROR;\n } else {\n \n int i;\n target->d.obj->isarrlist = 1;\n if (Jsi_ObjArraySizer(interp, target->d.obj, 0) <= 0)\n return JSI_ERROR;\n \n for (i = 0; i < argc; ++i) {\n Jsi_Value *argv = Jsi_ValueArrayIndex(interp, args, i); ;\n Jsi_ValueInsertArray(interp, _this, i, argv, 0);\n }\n }\n if (iscons)\n Jsi_ValueDup2(interp, ret, target);\n return JSI_OK;\n}\n \nstatic Jsi_CmdSpec arrayCmds[] = {\n { \"Array\", jsi_ArrayConstructor, 0,-1, \"...\", .help=\"jsi_Array constructor\", .retType=(uint)JSI_TT_ARRAY, .flags=JSI_CMD_IS_CONSTRUCTOR },\n { \"concat\", jsi_ArrayConcatCmd, 0,-1, \"...\", .help=\"Return array with args appended\", .retType=(uint)JSI_TT_ARRAY },\n { \"every\", jsi_ArrayEveryCmd, 1, 1, \"callback:function\", .help=\"Returns true if every value in array satisfies the test\", .retType=(uint)JSI_TT_ANY },\n { \"fill\", jsi_ArrayFillCmd, 1, 3, \"value:any, start:number=0, end:number=-1\", .help=\"Fill an array with values\", .retType=(uint)JSI_TT_ARRAY },\n { \"filter\", jsi_ArrayFilterCmd, 1, 2, \"callback:function, this:object=void\", .help=\"Return a filtered array\", .retType=(uint)JSI_TT_ARRAY },\n { \"find\", jsi_ArrayFindCmd, 1, 1, \"callback:function\", .help=\"Returns the value of the first element in the array that satisfies the test\", .retType=(uint)JSI_TT_ANY },\n { \"findIndex\", jsi_ArrayFindIndexCmd, 1, 1, \"callback:function\", .help=\"Returns the index of the first element in the array that satisfies the test\", .retType=(uint)JSI_TT_ANY },\n { \"flat\", jsi_ArrayFlatCmd, 0, 1, \"depth:number=1\", .help=\"Flatten an arra\", .retType=(uint)JSI_TT_ARRAY },\n { \"forEach\", jsi_ArrayForeachCmd, 1, 2, \"callback:function, this:object=void\", .help=\"Invoke function with each item in object\", .retType=(uint)JSI_TT_VOID },\n { \"includes\", jsi_ArrayIncludesCmd, 1, 1, \"val:any\", .help=\"Returns true if array contains value\", .retType=(uint)JSI_TT_ANY },\n { \"indexOf\", jsi_ArrayIndexOfCmd, 1, 2, \"str:any, startIdx:number=0\", .help=\"Return index of first occurrance in array\", .retType=(uint)JSI_TT_NUMBER },\n { \"isArray\", jsi_ArrayIsArrayCmd, 0, 0, \"\", .help=\"True if val array\", .retType=(uint)JSI_TT_BOOLEAN },\n { \"join\", jsi_ArrayJoinCmd, 0, 1, \"sep:string=''\", .help=\"Return elements joined by char\", .retType=(uint)JSI_TT_STRING },\n { \"lastIndexOf\",jsi_ArrayLastindexOfCmd,1, 2, \"val:any, start:number=0\", .help=\"Return index of last occurence in array\", .retType=(uint)JSI_TT_NUMBER },\n { \"map\", jsi_ArrayMapCmd, 1, 2, \"callback:function, this:object=void\", .help=\"Creates a new array with the results of calling a provided function on every element in this array\", .retType=(uint)JSI_TT_ARRAY },\n { \"pop\", jsi_ArrayPopCmd, 0, 0, \"\", .help=\"Remove and return last element of array\", .retType=(uint)JSI_TT_ANY },\n { \"push\", jsi_ArrayPushCmd, 1,-1, \"val:any, ...\", .help=\"Push one or more elements onto array and return size\", .retType=(uint)JSI_TT_NUMBER },\n { \"reduce\", jsi_ArrayReduceCmd, 1, 2, \"callback:function, initial:any\", .help=\"Return a reduced array\", .retType=(uint)JSI_TT_ANY },\n { \"reduceRight\",jsi_ArrayReduceRightCmd,1, 2, \"callback:function, initial:any\", .help=\"Return a reduced array\", .retType=(uint)JSI_TT_ANY },\n { \"shift\", jsi_ArrayShiftCmd, 0, 0, \"\", .help=\"Remove first element and shift downwards\", .retType=(uint)JSI_TT_ANY },\n { \"sizeOf\", jsi_ArraySizeOfCmd, 0, 0, \"\", .help=\"Return size of array\", .retType=(uint)JSI_TT_NUMBER },\n { \"slice\", jsi_ArraySliceCmd, 1, 2, \"start:number, end:number=void\", .help=\"Return sub-array\", .retType=(uint)JSI_TT_ARRAY },\n { \"some\", jsi_ArraySomeCmd, 1, 2, \"callback:function, this:object=void\", .help=\"Return true if function returns true some element\", .retType=(uint)JSI_TT_BOOLEAN },\n { \"sort\", jsi_ArraySortCmd, 0, 1, \"options:function|object=void\", .help=\"Sort an array\", .retType=(uint)JSI_TT_ARRAY, .flags=0, .info=0, .opts=jsi_ArraySortOptions },\n { \"splice\", jsi_ArraySpliceCmd, 1,-1, \"start:number, howmany:number=void, ...\", .help=\"Change the content of an array, adding new elements while removing old elements\", .retType=(uint)JSI_TT_ARRAY },\n { \"reverse\", jsi_ArrayReverseCmd, 0, 0, \"\", .help=\"Reverse order of all elements in an array\", .retType=(uint)JSI_TT_ARRAY },\n { \"unshift\", jsi_ArrayUnshiftCmd, 0,-1, \"...\", .help=\"Add new elements to start of array and return size\", .retType=(uint)JSI_TT_NUMBER },\n { NULL, 0,0,0,0, .help=\"Provide access to array objects\" }\n};\n\nJsi_RC jsi_InitArray(Jsi_Interp *interp, int release)\n{\n if (release) return JSI_OK;\n interp->Array_prototype = Jsi_CommandCreateSpecs(interp, \"Array\", arrayCmds, NULL, JSI_CMDSPEC_ISOBJ);\n return JSI_OK;\n}\n\n#endif\n"},"func_before":{"kind":"string","value":"static Jsi_RC jsi_ArrayShiftCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_Value *v;\n Jsi_Obj *obj = _this->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n uint n = Jsi_ObjGetLength(interp, obj);\n assert(n <= obj->arrCnt);\n if (n<=0) {\n Jsi_ValueMakeUndef(interp, ret);\n } else {\n n--;\n v = obj->arr[0];\n memmove(obj->arr, obj->arr+1, n*sizeof(Jsi_Value*));\n obj->arr[n] = NULL;\n Jsi_ValueDup2(interp, ret, v);\n Jsi_DecrRefCount(interp, v);\n Jsi_ObjSetLength(interp, obj, n);\n }\n return JSI_OK;\n}"},"func_after":{"kind":"string","value":"static Jsi_RC jsi_ArrayShiftCmd(Jsi_Interp *interp, Jsi_Value *args, Jsi_Value *_this,Jsi_Value **ret, Jsi_Func *funcPtr) {\n if (_this->vt != JSI_VT_OBJECT || !Jsi_ObjIsArray(interp, _this->d.obj))\n return Jsi_LogError(\"expected array object\");\n Jsi_Value *v;\n Jsi_Obj *obj = _this->d.obj;\n Jsi_ObjListifyArray(interp, obj);\n uint n = jsi_SizeOfArray(interp, obj);\n if (n<=0) {\n Jsi_ValueMakeUndef(interp, ret);\n } else {\n n--;\n v = obj->arr[0];\n memmove(obj->arr, obj->arr+1, n*sizeof(Jsi_Value*));\n obj->arr[n] = NULL;\n Jsi_ValueDup2(interp, ret, v);\n Jsi_DecrRefCount(interp, v);\n Jsi_ObjSetLength(interp, obj, n);\n }\n return JSI_OK;\n}"},"diff":{"kind":"string","value":"{'added': [(10, 'static uint jsi_SizeOfArray(Jsi_Interp *interp, Jsi_Obj *obj) {'), (11, ' if (!obj || !obj->arr)'), (12, ' return 0;'), (13, ' return obj->arrCnt;'), (14, '}'), (15, ''), (28, ' int curlen = jsi_SizeOfArray(interp, obj);'), (36, ' Jsi_ValueMakeNumber(interp, ret, jsi_SizeOfArray(interp, obj));'), (50, ' int i = jsi_SizeOfArray(interp, obj) - 1;'), (83, ' curlen = jsi_SizeOfArray(interp, _this->d.obj);'), (94, ' if (0 == (argc=jsi_SizeOfArray(interp, _this->d.obj))) {'), (238, ' int len = jsi_SizeOfArray(interp, v->d.obj);'), (260, ' int i, n = 0, len = jsi_SizeOfArray(interp, arr->d.obj);'), (263, ' int clen = jsi_SizeOfArray(interp, nobj);'), (307, ' curlen = jsi_SizeOfArray(interp, obj);'), (379, ' curlen = jsi_SizeOfArray(interp, obj);'), (438, ' curlen = jsi_SizeOfArray(interp, obj);'), (614, ' int i;'), (700, ' n = jsi_SizeOfArray(interp, obj);'), (752, ' int i = jsi_SizeOfArray(interp, _this->d.obj);'), (763, ' uint n = jsi_SizeOfArray(interp, obj);'), (784, ' int curlen = jsi_SizeOfArray(interp, obj);'), (804, ' Jsi_ValueMakeNumber(interp, ret, jsi_SizeOfArray(interp, obj));'), (818, ' n = jsi_SizeOfArray(interp, obj);'), (881, ' n = jsi_SizeOfArray(interp, obj);'), (1145, ' n = jsi_SizeOfArray(interp, obj);'), (1181, ' Jsi_ObjSetLength(interp, obj, curlen=0);')], 'deleted': [(22, ' int curlen = Jsi_ObjGetLength(interp, obj);'), (23, ' if (curlen < 0) {'), (24, ' Jsi_ObjSetLength(interp, obj, 0);'), (25, ' }'), (26, ''), (34, ' Jsi_ValueMakeNumber(interp, ret, Jsi_ObjGetLength(interp, obj));'), (48, ' int i = Jsi_ObjGetLength(interp, obj) - 1;'), (81, ' curlen = Jsi_ObjGetLength(interp, _this->d.obj);'), (92, ' if (0 == (argc=Jsi_ObjGetLength(interp, _this->d.obj))) {'), (236, ' int len = Jsi_ObjGetLength(interp, v->d.obj);'), (258, ' int i, n = 0, len = Jsi_ObjGetLength(interp, arr->d.obj);'), (261, ' int clen = Jsi_ObjGetLength(interp, nobj);'), (305, ' curlen = Jsi_ObjGetLength(interp, obj);'), (306, ' if (curlen < 0) {'), (307, ' Jsi_ObjSetLength(interp, obj, 0);'), (308, ' }'), (380, ' curlen = Jsi_ObjGetLength(interp, obj);'), (381, ' if (curlen < 0) {'), (382, ' Jsi_ObjSetLength(interp, obj, 0);'), (383, ' }'), (442, ' curlen = Jsi_ObjGetLength(interp, obj);'), (443, ' if (curlen < 0) {'), (444, ' Jsi_ObjSetLength(interp, obj, 0);'), (445, ' }'), (525, ' int curlen;'), (538, ' curlen = Jsi_ObjGetLength(interp, obj);'), (539, ' if (curlen < 0) {'), (540, ' Jsi_ObjSetLength(interp, obj, 0);'), (541, ' }'), (569, ' int curlen;'), (582, ' curlen = Jsi_ObjGetLength(interp, obj);'), (583, ' if (curlen < 0) {'), (584, ' Jsi_ObjSetLength(interp, obj, 0);'), (585, ' }'), (631, ' int curlen, i;'), (641, ' curlen = Jsi_ObjGetLength(interp, obj);'), (642, ' if (curlen < 0)'), (643, ' Jsi_ObjSetLength(interp, obj, 0);'), (720, ' n = Jsi_ObjGetLength(interp, obj);'), (772, ' int i = Jsi_ObjGetLength(interp, _this->d.obj);'), (783, ' uint n = Jsi_ObjGetLength(interp, obj);'), (784, ' assert(n <= obj->arrCnt);'), (805, ' int curlen = Jsi_ObjGetLength(interp, obj);'), (806, ' if (curlen < 0) {'), (807, ' Jsi_ObjSetLength(interp, obj, 0);'), (808, ' }'), (828, ' Jsi_ValueMakeNumber(interp, ret, Jsi_ObjGetLength(interp, obj));'), (842, ' n = Jsi_ObjGetLength(interp, obj);'), (905, ' n = Jsi_ObjGetLength(interp, obj);'), (1169, ' n = Jsi_ObjGetLength(interp, obj);'), (1205, ' Jsi_ObjSetLength(interp, obj, 0);')]}"},"num_lines_added":{"kind":"number","value":27,"string":"27"},"num_lines_deleted":{"kind":"number","value":51,"string":"51"},"num_lines_in_file":{"kind":"number","value":1148,"string":"1,148"},"num_tokens_in_file":{"kind":"number","value":9934,"string":"9,934"},"num_lines_in_method":{"kind":"number","value":21,"string":"21"},"num_tokens_in_method":{"kind":"number","value":178,"string":"178"},"method_complexity":{"kind":"number","value":4,"string":"4"},"repo":{"kind":"string","value":"https://github.com/pcmacdon/jsish"},"cve_id":{"kind":"string","value":"CVE-2020-22875"},"cwe_id":{"kind":"string","value":"CWE-190"}}},{"rowIdx":390,"cells":{"id":{"kind":"number","value":735,"string":"735"},"file_name":{"kind":"string","value":"ne.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"r_bin_ne_get_entrypoints"},"code_before":{"kind":"string","value":"/* radare - LGPL - Copyright 2019-2022 - GustavoLCR */\n\n#include \"ne.h\"\n\nstatic char *__get_target_os(r_bin_ne_obj_t *bin) {\n\tswitch (bin->ne_header->targOS) {\n\tcase 1:\n\t\treturn \"OS/2\";\n\tcase 2:\n\t\treturn \"Windows\";\n\tcase 3:\n\t\treturn \"European MS-DOS 4.x\";\n\tcase 4:\n\t\treturn \"Windows 386\";\n\tcase 5:\n\t\treturn \"BOSS (Borland Operating System Services)\";\n\tdefault:\n\t\treturn \"Unknown\";\n\t}\n}\n\nstatic int __translate_perms(int flags) {\n\tint perms = 0;\n\tif (flags & IS_RX) {\n\t\tif (flags & IS_DATA) {\n\t\t\tperms = R_PERM_R;\n\t\t} else {\n\t\t\tperms = R_PERM_X;\n\t\t}\n\t}\n\tif (!perms) {\n\t\tperms = R_PERM_RWX;\n\t}\n\treturn perms;\n}\n\nstatic char *__read_nonnull_str_at(RBuffer *buf, ut64 offset) {\n\tut8 sz = r_buf_read8_at (buf, offset);\n\tif (!sz) {\n\t\treturn NULL;\n\t}\n\tchar *str = malloc ((ut64)sz + 1);\n\tif (!str) {\n\t\treturn NULL;\n\t}\n\tr_buf_read_at (buf, offset + 1, (ut8 *)str, sz);\n\tstr[sz] = '\\0';\n\treturn str;\n}\n\nstatic char *__func_name_from_ord(const char *module, ut16 ordinal) {\n\tif (!module) {\n\t\treturn NULL;\n\t}\n\tchar *lower_module = strdup (module);\n\tr_str_case (lower_module, false);\n\tchar *path = r_str_newf (R_JOIN_4_PATHS (\"%s\", R2_SDB_FORMAT, \"dll\", \"%s.sdb\"), r_sys_prefix (NULL), lower_module);\n\tfree (lower_module);\n\tchar *ord = r_str_newf (\"%d\", ordinal);\n\tchar *name;\n\tif (r_file_exists (path)) {\n\t\tSdb *sdb = sdb_new (NULL, path, 0);\n\t\tname = sdb_get (sdb, ord, NULL);\n\t\tif (!name) {\n\t\t\tname = ord;\n\t\t} else {\n\t\t\tfree (ord);\n\t\t}\n\t\tsdb_close (sdb);\n\t\tfree (sdb);\n\t} else {\n\t\tname = ord;\n\t}\n\tfree (path);\n\treturn name;\n}\n\nRList *r_bin_ne_get_segments(r_bin_ne_obj_t *bin) {\n\tint i;\n\tif (!bin) {\n\t\treturn NULL;\n\t}\n\tRList *segments = r_list_newf (free);\n\tfor (i = 0; i < bin->ne_header->SegCount; i++) {\n\t\tRBinSection *bs = R_NEW0 (RBinSection);\n\t\tif (!bs) {\n\t\t\treturn segments;\n\t\t}\n\t\tNE_image_segment_entry *se = &bin->segment_entries[i];\n\t\tbs->size = se->length;\n\t\tbs->vsize = se->minAllocSz ? se->minAllocSz : 64000;\n\t\tbs->bits = R_SYS_BITS_16;\n\t\tbs->is_data = se->flags & IS_DATA;\n\t\tbs->perm = __translate_perms (se->flags);\n\t\tbs->paddr = (ut64)se->offset * bin->alignment;\n\t\tbs->name = r_str_newf (\"%s.%\" PFMT64d, se->flags & IS_MOVEABLE ? \"MOVEABLE\" : \"FIXED\", bs->paddr);\n\t\tbs->is_segment = true;\n\t\tr_list_append (segments, bs);\n\t}\n\tbin->segments = segments;\n\treturn segments;\n}\n\nstatic int __find_symbol_by_paddr(const void *paddr, const void *sym) {\n\treturn (int)!(*(ut64 *)paddr == ((RBinSymbol *)sym)->paddr);\n}\n\nRList *r_bin_ne_get_symbols(r_bin_ne_obj_t *bin) {\n\tRBinSymbol *sym;\n\tut16 off = bin->ne_header->ResidNamTable + bin->header_offset;\n\tRList *symbols = r_list_newf (free);\n\tif (!symbols) {\n\t\treturn NULL;\n\t}\n\tRList *entries = r_bin_ne_get_entrypoints (bin);\n\tbool resident = true, first = true;\n\twhile (entries) {\n\t\tut8 sz = r_buf_read8_at (bin->buf, off);\n\t\tif (!sz) {\n\t\t\tfirst = true;\n\t\t\tif (resident) {\n\t\t\t\tresident = false;\n\t\t\t\toff = bin->ne_header->OffStartNonResTab;\n\t\t\t\tsz = r_buf_read8_at (bin->buf, off);\n\t\t\t\tif (!sz) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tchar *name = malloc ((ut64)sz + 1);\n\t\tif (!name) {\n\t\t\tbreak;\n\t\t}\n\t\toff++;\n\t\tr_buf_read_at (bin->buf, off, (ut8 *)name, sz);\n\t\tname[sz] = '\\0';\n\t\toff += sz;\n\t\tsym = R_NEW0 (RBinSymbol);\n\t\tif (!sym) {\n\t\t\tbreak;\n\t\t}\n\t\tsym->name = name;\n\t\tif (!first) {\n\t\t\tsym->bind = R_BIN_BIND_GLOBAL_STR;\n\t\t}\n\t\tut16 entry_off = r_buf_read_le16_at (bin->buf, off);\n\t\toff += 2;\n\t\tRBinAddr *entry = r_list_get_n (entries, entry_off);\n\t\tif (entry) {\n\t\t\tsym->paddr = entry->paddr;\n\t\t} else {\n\t\t\tsym->paddr = -1;\n\t\t}\n\t\tsym->ordinal = entry_off;\n\t\tr_list_append (symbols, sym);\n\t\tfirst = false;\n\t}\n\tRListIter *it;\n\tRBinAddr *en;\n\tint i = 1;\n\tr_list_foreach (entries, it, en) {\n\t\tif (!r_list_find (symbols, &en->paddr, __find_symbol_by_paddr)) {\n\t\t\tsym = R_NEW0 (RBinSymbol);\n\t\t\tif (!sym) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsym->name = r_str_newf (\"entry%d\", i - 1);\n\t\t\tsym->paddr = en->paddr;\n\t\t\tsym->bind = R_BIN_BIND_GLOBAL_STR;\n\t\t\tsym->ordinal = i;\n\t\t\tr_list_append (symbols, sym);\n\t\t}\n\t\ti++;\n\t}\n\tbin->symbols = symbols;\n\treturn symbols;\n}\n\nstatic char *__resource_type_str(int type) {\n\tchar *typeName;\n\tswitch (type) {\n\tcase 1:\n\t\ttypeName = \"CURSOR\";\n\t\tbreak;\n\tcase 2:\n\t\ttypeName = \"BITMAP\";\n\t\tbreak;\n\tcase 3:\n\t\ttypeName = \"ICON\";\n\t\tbreak;\n\tcase 4:\n\t\ttypeName = \"MENU\";\n\t\tbreak;\n\tcase 5:\n\t\ttypeName = \"DIALOG\";\n\t\tbreak;\n\tcase 6:\n\t\ttypeName = \"STRING\";\n\t\tbreak;\n\tcase 7:\n\t\ttypeName = \"FONTDIR\";\n\t\tbreak;\n\tcase 8:\n\t\ttypeName = \"FONT\";\n\t\tbreak;\n\tcase 9:\n\t\ttypeName = \"ACCELERATOR\";\n\t\tbreak;\n\tcase 10:\n\t\ttypeName = \"RCDATA\";\n\t\tbreak;\n\tcase 11:\n\t\ttypeName = \"MESSAGETABLE\";\n\t\tbreak;\n\tcase 12:\n\t\ttypeName = \"GROUP_CURSOR\";\n\t\tbreak;\n\tcase 14:\n\t\ttypeName = \"GROUP_ICON\";\n\t\tbreak;\n\tcase 15:\n\t\ttypeName = \"NAMETABLE\";\n\t\tbreak;\n\tcase 16:\n\t\ttypeName = \"VERSION\";\n\t\tbreak;\n\tcase 17:\n\t\ttypeName = \"DLGINCLUDE\";\n\t\tbreak;\n\tcase 19:\n\t\ttypeName = \"PLUGPLAY\";\n\t\tbreak;\n\tcase 20:\n\t\ttypeName = \"VXD\";\n\t\tbreak;\n\tcase 21:\n\t\ttypeName = \"ANICURSOR\";\n\t\tbreak;\n\tcase 22:\n\t\ttypeName = \"ANIICON\";\n\t\tbreak;\n\tcase 23:\n\t\ttypeName = \"HTML\";\n\t\tbreak;\n\tcase 24:\n\t\ttypeName = \"MANIFEST\";\n\t\tbreak;\n\tdefault:\n\t\treturn r_str_newf (\"UNKNOWN (%d)\", type);\n\t}\n\treturn strdup (typeName);\n}\n\nstatic void __free_resource_entry(void *entry) {\n\tr_ne_resource_entry *en = (r_ne_resource_entry *)entry;\n\tfree (en->name);\n\tfree (en);\n}\n\nstatic void __free_resource(void *resource) {\n\tr_ne_resource *res = (r_ne_resource *)resource;\n\tfree (res->name);\n\tr_list_free (res->entry);\n\tfree (res);\n}\n\nstatic bool __ne_get_resources(r_bin_ne_obj_t *bin) {\n\tif (!bin->resources) {\n\t\tbin->resources = r_list_newf (__free_resource);\n\t}\n\tut16 resoff = bin->ne_header->ResTableOffset + bin->header_offset;\n\tut16 alignment = r_buf_read_le16_at (bin->buf, resoff);\n\tut32 off = resoff + 2;\n\twhile (true) {\n\t\tNE_image_typeinfo_entry ti = {0};\n\t\tr_ne_resource *res = R_NEW0 (r_ne_resource);\n\t\tif (!res) {\n\t\t\tbreak;\n\t\t}\n\t\tres->entry = r_list_newf (__free_resource_entry);\n\t\tif (!res->entry) {\n\t\t\tbreak;\n\t\t}\n\t\tr_buf_read_at (bin->buf, off, (ut8 *)&ti, sizeof (ti));\n\t\tif (!ti.rtTypeID) {\n\t\t\tbreak;\n\t\t} else if (ti.rtTypeID & 0x8000) {\n\t\t\tres->name = __resource_type_str (ti.rtTypeID & ~0x8000);\n\t\t} else {\n\t\t\t// Offset to resident name table\n\t\t\tres->name = __read_nonnull_str_at (bin->buf, (ut64)resoff + ti.rtTypeID);\n\t\t}\n\t\toff += sizeof (NE_image_typeinfo_entry);\n\t\tint i;\n\t\tfor (i = 0; i < ti.rtResourceCount; i++) {\n\t\t\tNE_image_nameinfo_entry ni;\n\t\t\tr_ne_resource_entry *ren = R_NEW0 (r_ne_resource_entry);\n\t\t\tif (!ren) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tr_buf_read_at (bin->buf, off, (ut8 *)&ni, sizeof (NE_image_nameinfo_entry));\n\t\t\tren->offset = ni.rnOffset << alignment;\n\t\t\tren->size = ni.rnLength;\n\t\t\tif (ni.rnID & 0x8000) {\n\t\t\t\tren->name = r_str_newf (\"%d\", ni.rnID & ~0x8000);\n\t\t\t} else {\n\t\t\t\t// Offset to resident name table\n\t\t\t\tren->name = __read_nonnull_str_at (bin->buf, (ut64)resoff + ni.rnID);\n\t\t\t}\n\t\t\tr_list_append (res->entry, ren);\n\t\t\toff += sizeof (NE_image_nameinfo_entry);\n\t\t}\n\t\tr_list_append (bin->resources, res);\n\t}\n\treturn true;\n}\n\nRList *r_bin_ne_get_imports(r_bin_ne_obj_t *bin) {\n\tRList *imports = r_list_newf ((RListFree)r_bin_import_free);\n\tif (!imports) {\n\t\treturn NULL;\n\t}\n\tut16 off = bin->ne_header->ImportNameTable + bin->header_offset + 1;\n\tint i;\n\tfor (i = 0; i < bin->ne_header->ModRefs; i++) {\n\t\tRBinImport *imp = R_NEW0 (RBinImport);\n\t\tif (!imp) {\n\t\t\tbreak;\n\t\t}\n\t\tut8 sz = r_buf_read8_at (bin->buf, off);\n\t\tif (!sz) {\n\t\t\tr_bin_import_free (imp);\n\t\t\tbreak;\n\t\t}\n\t\toff++;\n\t\tchar *name = malloc ((ut64)sz + 1);\n\t\tif (!name) {\n\t\t\tbreak;\n\t\t}\n\t\tr_buf_read_at (bin->buf, off, (ut8 *)name, sz);\n\t\tname[sz] = '\\0';\n\t\timp->name = name;\n\t\timp->ordinal = i + 1;\n\t\tr_list_append (imports, imp);\n\t\toff += sz;\n\t}\n\tbin->imports = imports;\n\treturn imports;\n}\n\nRList *r_bin_ne_get_entrypoints(r_bin_ne_obj_t *bin) {\n\tif (!bin->entry_table) {\n\t\treturn NULL;\n\t}\n\tRList *entries = r_list_newf (free);\n\tif (!entries) {\n\t\treturn NULL;\n\t}\n\tRList *segments = r_bin_ne_get_segments (bin);\n\tif (!segments) {\n\t\tr_list_free (entries);\n\t\treturn NULL;\n\t}\n\tif (bin->ne_header->csEntryPoint) {\n\t\tRBinAddr *entry = R_NEW0 (RBinAddr);\n\t\tif (!entry) {\n\t\t\tr_list_free (entries);\n\t\t\treturn NULL;\n\t\t}\n\t\tentry->bits = 16;\n\t\tut32 entry_cs = bin->ne_header->csEntryPoint;\n\t\tRBinSection *s = r_list_get_n (segments, entry_cs - 1);\n\t\tentry->paddr = bin->ne_header->ipEntryPoint + (s? s->paddr: 0);\n\n\t\tr_list_append (entries, entry);\n\t}\n\tint off = 0;\n\tsize_t tableat = bin->header_offset + bin->ne_header->EntryTableOffset;\n\twhile (off < bin->ne_header->EntryTableLength) {\n\t\tif (tableat + off >= r_buf_size (bin->buf)) {\n\t\t\tbreak;\n\t\t}\n\t\tut8 bundle_length = *(ut8 *)(bin->entry_table + off);\n\t\tif (!bundle_length) {\n\t\t\tbreak;\n\t\t}\n\t\toff++;\n\t\tut8 bundle_type = *(ut8 *)(bin->entry_table + off);\n\t\toff++;\n\t\tint i;\n\t\tfor (i = 0; i < bundle_length; i++) {\n\t\t\tif (tableat + off + 4 >= r_buf_size (bin->buf)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tRBinAddr *entry = R_NEW0 (RBinAddr);\n\t\t\tif (!entry) {\n\t\t\t\tr_list_free (entries);\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\toff++;\n\t\t\tif (!bundle_type) { // Skip\n\t\t\t\toff--;\n\t\t\t\tfree (entry);\n\t\t\t\tbreak;\n\t\t\t} else if (bundle_type == 0xff) { // moveable\n\t\t\t\toff += 2;\n\t\t\t\tut8 segnum = *(bin->entry_table + off);\n\t\t\t\toff++;\n\t\t\t\tut16 segoff = *(ut16 *)(bin->entry_table + off);\n\t\t\t\tif (segnum > 0) {\n\t\t\t\t\tentry->paddr = (ut64)bin->segment_entries[segnum - 1].offset * bin->alignment + segoff;\n\t\t\t\t}\n\t\t\t} else { // Fixed\n\t\t\t\tif (bundle_type < bin->ne_header->SegCount) {\n\t\t\t\t\tentry->paddr = (ut64)bin->segment_entries[bundle_type - 1].offset\n\t\t\t\t\t\t* bin->alignment + *(ut16 *)(bin->entry_table + off);\n\t\t\t\t}\n\t\t\t}\n\t\t\toff += 2;\n\t\t\tr_list_append (entries, entry);\n\t\t}\n\t}\n\tr_list_free (segments);\n\tbin->entries = entries;\n\treturn entries;\n}\n\nRList *r_bin_ne_get_relocs(r_bin_ne_obj_t *bin) {\n\tRList *segments = bin->segments;\n\tif (!segments) {\n\t\treturn NULL;\n\t}\n\tRList *entries = bin->entries;\n\tif (!entries) {\n\t\treturn NULL;\n\t}\n\tRList *symbols = bin->symbols;\n\tif (!symbols) {\n\t\treturn NULL;\n\t}\n\n\tut16 *modref = calloc (bin->ne_header->ModRefs, sizeof (ut16));\n\tif (!modref) {\n\t\treturn NULL;\n\t}\n\tr_buf_read_at (bin->buf, (ut64)bin->ne_header->ModRefTable + bin->header_offset, (ut8 *)modref, bin->ne_header->ModRefs * sizeof (ut16));\n\n\tRList *relocs = r_list_newf (free);\n\tif (!relocs) {\n\t\tfree (modref);\n\t\treturn NULL;\n\t}\n\n\tRListIter *it;\n\tRBinSection *seg;\n\tint index = -1;\n\tr_list_foreach (segments, it, seg) {\n\t\tindex++;\n\t\tif (!(bin->segment_entries[index].flags & RELOCINFO)) {\n\t\t\tcontinue;\n\t\t}\n\t\tut32 off = seg->paddr + seg->size;\n\t\tut32 start = off;\n\t\tut16 length = r_buf_read_le16_at (bin->buf, off);\n\t\tif (!length) {\n\t\t\tcontinue;\n\t\t}\n\t\toff += 2;\n\t\t// size_t buf_size = r_buf_size (bin->buf);\n\t\twhile (off < start + length * sizeof (NE_image_reloc_item)) {\n\t\t\t// && off + sizeof (NE_image_reloc_item) < buf_size)\n\t\t\tNE_image_reloc_item rel = {0};\n\t\t\tif (r_buf_read_at (bin->buf, off, (ut8 *)&rel, sizeof (rel)) < 1) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tRBinReloc *reloc = R_NEW0 (RBinReloc);\n\t\t\tif (!reloc) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\treloc->paddr = seg->paddr + rel.offset;\n\t\t\tswitch (rel.type) {\n\t\t\tcase LOBYTE:\n\t\t\t\treloc->type = R_BIN_RELOC_8;\n\t\t\t\tbreak;\n\t\t\tcase SEL_16:\n\t\t\tcase OFF_16:\n\t\t\t\treloc->type = R_BIN_RELOC_16;\n\t\t\t\tbreak;\n\t\t\tcase POI_32:\n\t\t\tcase OFF_32:\n\t\t\t\treloc->type = R_BIN_RELOC_32;\n\t\t\t\tbreak;\n\t\t\tcase POI_48:\n\t\t\t\treloc->type = R_BIN_RELOC_64;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tut32 offset;\n\t\t\tif (rel.flags & (IMPORTED_ORD | IMPORTED_NAME)) {\n\t\t\t\tRBinImport *imp = R_NEW0 (RBinImport);\n\t\t\t\tif (!imp) {\n\t\t\t\t\tfree (reloc);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tchar *name = NULL;\n\t\t\t\tif (rel.index > bin->ne_header->ModRefs) {\n\t\t\t\t\tname = r_str_newf (\"UnknownModule%d_%x\", rel.index, off); // ????\n\t\t\t\t} else if (rel.index > 0) {\n\t\t\t\t\toffset = modref[rel.index - 1] + bin->header_offset + bin->ne_header->ImportNameTable;\n\t\t\t\t\tname = __read_nonnull_str_at (bin->buf, offset);\n\t\t\t\t}\n\t\t\t\tif (rel.flags & IMPORTED_ORD) {\n\t\t\t\t\timp->ordinal = rel.func_ord;\n\t\t\t\t\tchar *fname = __func_name_from_ord (name, rel.func_ord);\n\t\t\t\t\timp->name = r_str_newf (\"%s.%s\", name, fname);\n\t\t\t\t\tfree (fname);\n\t\t\t\t} else {\n\t\t\t\t\toffset = bin->header_offset + bin->ne_header->ImportNameTable + rel.name_off;\n\t\t\t\t\tchar *func = __read_nonnull_str_at (bin->buf, offset);\n\t\t\t\t\timp->name = r_str_newf (\"%s.%s\", name, func);\n\t\t\t\t\tfree (func);\n\t\t\t\t}\n\t\t\t\tfree (name);\n\t\t\t\treloc->import = imp;\n\t\t\t} else if (rel.flags & OSFIXUP) {\n\t\t\t\t// TODO\n\t\t\t} else {\n\t\t\t\tif (strstr (seg->name, \"FIXED\")) {\n\t\t\t\t\tRBinSection *s = r_list_get_n (segments, rel.segnum - 1);\n\t\t\t\t\tif (s) {\n\t\t\t\t\t\toffset = s->paddr + rel.segoff;\n\t\t\t\t\t} else {\n\t\t\t\t\t\toffset = -1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tRBinAddr *entry = r_list_get_n (entries, rel.entry_ordinal - 1);\n\t\t\t\t\tif (entry) {\n\t\t\t\t\t\toffset = entry->paddr;\n\t\t\t\t\t} else {\n\t\t\t\t\t\toffset = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treloc->addend = offset;\n\t\t\t\tRBinSymbol *sym = NULL;\n\t\t\t\tRListIter *sit;\n\t\t\t\tr_list_foreach (symbols, sit, sym) {\n\t\t\t\t\tif (sym->paddr == reloc->addend) {\n\t\t\t\t\t\treloc->symbol = sym;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (rel.flags & ADDITIVE) {\n\t\t\t\treloc->additive = 1;\n\t\t\t\tr_list_append (relocs, reloc);\n\t\t\t} else {\n\t\t\t\tdo {\n#define NE_BUG 0\n#if NE_BUG\n\t\t\t\t\tif (reloc->paddr + 4 < r_buf_size (bin->buf)) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n#endif\n\t\t\t\t\tr_list_append (relocs, reloc);\n\t\t\t\t\toffset = r_buf_read_le16_at (bin->buf, reloc->paddr);\n\t\t\t\t\tRBinReloc *tmp = reloc;\n\t\t\t\t\treloc = R_NEW0 (RBinReloc);\n\t\t\t\t\tif (!reloc) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\t*reloc = *tmp;\n\t\t\t\t\treloc->paddr = seg->paddr + offset;\n\t\t\t\t} while (offset != 0xFFFF);\n\t\t\t\tfree (reloc);\n\t\t\t}\n\n\t\t\toff += sizeof (NE_image_reloc_item);\n\t\t}\n\t}\n\tfree (modref);\n\treturn relocs;\n}\n\nvoid __init(RBuffer *buf, r_bin_ne_obj_t *bin) {\n\tbin->header_offset = r_buf_read_le16_at (buf, 0x3c);\n\tbin->ne_header = R_NEW0 (NE_image_header);\n\tif (!bin->ne_header) {\n\t\treturn;\n\t}\n\tbin->buf = buf;\n\t// XXX this is endian unsafe\n\tif (r_buf_read_at (buf, bin->header_offset, (ut8 *)bin->ne_header, sizeof (NE_image_header)) < 1) {\n\t\tR_FREE (bin->ne_header);\n\t\treturn;\n\t}\n\tif (bin->ne_header->FileAlnSzShftCnt > 15) {\n\t\tbin->ne_header->FileAlnSzShftCnt = 15;\n\t}\n\tut64 from = bin->ne_header->ModRefTable + bin->header_offset;\n\tut64 left = r_buf_size (bin->buf) - from;\n\tif (from + bin->ne_header->ModRefs * sizeof (ut16) >= left) {\n\t\tbin->ne_header->ModRefs = left / sizeof (ut16);\n\t}\n\tbin->alignment = 1 << bin->ne_header->FileAlnSzShftCnt;\n\tif (!bin->alignment) {\n\t\tbin->alignment = 1 << 9;\n\t}\n\tbin->os = __get_target_os (bin);\n\n\tut16 offset = bin->ne_header->SegTableOffset + bin->header_offset;\n\tsize_t size = bin->ne_header->SegCount * sizeof (NE_image_segment_entry);\n\tif (offset >= r_buf_size (bin->buf)) {\n\t\treturn;\n\t}\n\tsize_t remaining = r_buf_size (bin->buf) - offset;\n\tsize = R_MIN (remaining, size);\n\tbin->ne_header->SegCount = size / sizeof (NE_image_segment_entry); // * sizeof (NE_image_segment_entry);\n\tbin->segment_entries = calloc (1, size);\n\tif (size >= remaining) {\n\t\tbin->ne_header->SegCount = size / sizeof (NE_image_segment_entry);\n\t}\n\tif (!bin->segment_entries) {\n\t\treturn;\n\t}\n\tr_buf_read_at (buf, offset, (ut8 *)bin->segment_entries, size);\n\tbin->entry_table = calloc (4, bin->ne_header->EntryTableLength);\n\tif (!bin->entry_table) {\n\t\tR_FREE (bin->segment_entries);\n\t\treturn;\n\t}\n\tr_buf_read_at (buf, (ut64)bin->header_offset + bin->ne_header->EntryTableOffset, bin->entry_table, bin->ne_header->EntryTableLength);\n\tbin->imports = r_bin_ne_get_imports (bin);\n\t__ne_get_resources (bin);\n}\n\nvoid r_bin_ne_free(r_bin_ne_obj_t *bin) {\n\t// r_list_free (bin->imports); // double free\n\tr_list_free (bin->resources);\n\tfree (bin->entry_table);\n\tfree (bin->ne_header);\n\tfree (bin->resident_name_table);\n\tfree (bin->segment_entries);\n\tfree (bin);\n}\n\nr_bin_ne_obj_t *r_bin_ne_new_buf(RBuffer *buf, bool verbose) {\n\tr_bin_ne_obj_t *bin = R_NEW0 (r_bin_ne_obj_t);\n\tif (!bin) {\n\t\treturn NULL;\n\t}\n\t__init(buf, bin);\n\treturn bin;\n}\n"},"code_after":{"kind":"string","value":"/* radare - LGPL - Copyright 2019-2022 - GustavoLCR */\n\n#include \"ne.h\"\n\nstatic char *__get_target_os(r_bin_ne_obj_t *bin) {\n\tswitch (bin->ne_header->targOS) {\n\tcase 1:\n\t\treturn \"OS/2\";\n\tcase 2:\n\t\treturn \"Windows\";\n\tcase 3:\n\t\treturn \"European MS-DOS 4.x\";\n\tcase 4:\n\t\treturn \"Windows 386\";\n\tcase 5:\n\t\treturn \"BOSS (Borland Operating System Services)\";\n\tdefault:\n\t\treturn \"Unknown\";\n\t}\n}\n\nstatic int __translate_perms(int flags) {\n\tint perms = 0;\n\tif (flags & IS_RX) {\n\t\tif (flags & IS_DATA) {\n\t\t\tperms = R_PERM_R;\n\t\t} else {\n\t\t\tperms = R_PERM_X;\n\t\t}\n\t}\n\tif (!perms) {\n\t\tperms = R_PERM_RWX;\n\t}\n\treturn perms;\n}\n\nstatic char *__read_nonnull_str_at(RBuffer *buf, ut64 offset) {\n\tut8 sz = r_buf_read8_at (buf, offset);\n\tif (!sz) {\n\t\treturn NULL;\n\t}\n\tchar *str = malloc ((ut64)sz + 1);\n\tif (!str) {\n\t\treturn NULL;\n\t}\n\tr_buf_read_at (buf, offset + 1, (ut8 *)str, sz);\n\tstr[sz] = '\\0';\n\treturn str;\n}\n\nstatic char *__func_name_from_ord(const char *module, ut16 ordinal) {\n\tif (!module) {\n\t\treturn NULL;\n\t}\n\tchar *lower_module = strdup (module);\n\tr_str_case (lower_module, false);\n\tchar *path = r_str_newf (R_JOIN_4_PATHS (\"%s\", R2_SDB_FORMAT, \"dll\", \"%s.sdb\"), r_sys_prefix (NULL), lower_module);\n\tfree (lower_module);\n\tchar *ord = r_str_newf (\"%d\", ordinal);\n\tchar *name;\n\tif (r_file_exists (path)) {\n\t\tSdb *sdb = sdb_new (NULL, path, 0);\n\t\tname = sdb_get (sdb, ord, NULL);\n\t\tif (!name) {\n\t\t\tname = ord;\n\t\t} else {\n\t\t\tfree (ord);\n\t\t}\n\t\tsdb_close (sdb);\n\t\tfree (sdb);\n\t} else {\n\t\tname = ord;\n\t}\n\tfree (path);\n\treturn name;\n}\n\nRList *r_bin_ne_get_segments(r_bin_ne_obj_t *bin) {\n\tint i;\n\tif (!bin) {\n\t\treturn NULL;\n\t}\n\tRList *segments = r_list_newf (free);\n\tfor (i = 0; i < bin->ne_header->SegCount; i++) {\n\t\tRBinSection *bs = R_NEW0 (RBinSection);\n\t\tif (!bs) {\n\t\t\treturn segments;\n\t\t}\n\t\tNE_image_segment_entry *se = &bin->segment_entries[i];\n\t\tbs->size = se->length;\n\t\tbs->vsize = se->minAllocSz ? se->minAllocSz : 64000;\n\t\tbs->bits = R_SYS_BITS_16;\n\t\tbs->is_data = se->flags & IS_DATA;\n\t\tbs->perm = __translate_perms (se->flags);\n\t\tbs->paddr = (ut64)se->offset * bin->alignment;\n\t\tbs->name = r_str_newf (\"%s.%\" PFMT64d, se->flags & IS_MOVEABLE ? \"MOVEABLE\" : \"FIXED\", bs->paddr);\n\t\tbs->is_segment = true;\n\t\tr_list_append (segments, bs);\n\t}\n\tbin->segments = segments;\n\treturn segments;\n}\n\nstatic int __find_symbol_by_paddr(const void *paddr, const void *sym) {\n\treturn (int)!(*(ut64 *)paddr == ((RBinSymbol *)sym)->paddr);\n}\n\nRList *r_bin_ne_get_symbols(r_bin_ne_obj_t *bin) {\n\tRBinSymbol *sym;\n\tut16 off = bin->ne_header->ResidNamTable + bin->header_offset;\n\tRList *symbols = r_list_newf (free);\n\tif (!symbols) {\n\t\treturn NULL;\n\t}\n\tRList *entries = r_bin_ne_get_entrypoints (bin);\n\tbool resident = true, first = true;\n\twhile (entries) {\n\t\tut8 sz = r_buf_read8_at (bin->buf, off);\n\t\tif (!sz) {\n\t\t\tfirst = true;\n\t\t\tif (resident) {\n\t\t\t\tresident = false;\n\t\t\t\toff = bin->ne_header->OffStartNonResTab;\n\t\t\t\tsz = r_buf_read8_at (bin->buf, off);\n\t\t\t\tif (!sz) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tchar *name = malloc ((ut64)sz + 1);\n\t\tif (!name) {\n\t\t\tbreak;\n\t\t}\n\t\toff++;\n\t\tr_buf_read_at (bin->buf, off, (ut8 *)name, sz);\n\t\tname[sz] = '\\0';\n\t\toff += sz;\n\t\tsym = R_NEW0 (RBinSymbol);\n\t\tif (!sym) {\n\t\t\tbreak;\n\t\t}\n\t\tsym->name = name;\n\t\tif (!first) {\n\t\t\tsym->bind = R_BIN_BIND_GLOBAL_STR;\n\t\t}\n\t\tut16 entry_off = r_buf_read_le16_at (bin->buf, off);\n\t\toff += 2;\n\t\tRBinAddr *entry = r_list_get_n (entries, entry_off);\n\t\tif (entry) {\n\t\t\tsym->paddr = entry->paddr;\n\t\t} else {\n\t\t\tsym->paddr = -1;\n\t\t}\n\t\tsym->ordinal = entry_off;\n\t\tr_list_append (symbols, sym);\n\t\tfirst = false;\n\t}\n\tRListIter *it;\n\tRBinAddr *en;\n\tint i = 1;\n\tr_list_foreach (entries, it, en) {\n\t\tif (!r_list_find (symbols, &en->paddr, __find_symbol_by_paddr)) {\n\t\t\tsym = R_NEW0 (RBinSymbol);\n\t\t\tif (!sym) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsym->name = r_str_newf (\"entry%d\", i - 1);\n\t\t\tsym->paddr = en->paddr;\n\t\t\tsym->bind = R_BIN_BIND_GLOBAL_STR;\n\t\t\tsym->ordinal = i;\n\t\t\tr_list_append (symbols, sym);\n\t\t}\n\t\ti++;\n\t}\n\tbin->symbols = symbols;\n\treturn symbols;\n}\n\nstatic char *__resource_type_str(int type) {\n\tchar *typeName;\n\tswitch (type) {\n\tcase 1:\n\t\ttypeName = \"CURSOR\";\n\t\tbreak;\n\tcase 2:\n\t\ttypeName = \"BITMAP\";\n\t\tbreak;\n\tcase 3:\n\t\ttypeName = \"ICON\";\n\t\tbreak;\n\tcase 4:\n\t\ttypeName = \"MENU\";\n\t\tbreak;\n\tcase 5:\n\t\ttypeName = \"DIALOG\";\n\t\tbreak;\n\tcase 6:\n\t\ttypeName = \"STRING\";\n\t\tbreak;\n\tcase 7:\n\t\ttypeName = \"FONTDIR\";\n\t\tbreak;\n\tcase 8:\n\t\ttypeName = \"FONT\";\n\t\tbreak;\n\tcase 9:\n\t\ttypeName = \"ACCELERATOR\";\n\t\tbreak;\n\tcase 10:\n\t\ttypeName = \"RCDATA\";\n\t\tbreak;\n\tcase 11:\n\t\ttypeName = \"MESSAGETABLE\";\n\t\tbreak;\n\tcase 12:\n\t\ttypeName = \"GROUP_CURSOR\";\n\t\tbreak;\n\tcase 14:\n\t\ttypeName = \"GROUP_ICON\";\n\t\tbreak;\n\tcase 15:\n\t\ttypeName = \"NAMETABLE\";\n\t\tbreak;\n\tcase 16:\n\t\ttypeName = \"VERSION\";\n\t\tbreak;\n\tcase 17:\n\t\ttypeName = \"DLGINCLUDE\";\n\t\tbreak;\n\tcase 19:\n\t\ttypeName = \"PLUGPLAY\";\n\t\tbreak;\n\tcase 20:\n\t\ttypeName = \"VXD\";\n\t\tbreak;\n\tcase 21:\n\t\ttypeName = \"ANICURSOR\";\n\t\tbreak;\n\tcase 22:\n\t\ttypeName = \"ANIICON\";\n\t\tbreak;\n\tcase 23:\n\t\ttypeName = \"HTML\";\n\t\tbreak;\n\tcase 24:\n\t\ttypeName = \"MANIFEST\";\n\t\tbreak;\n\tdefault:\n\t\treturn r_str_newf (\"UNKNOWN (%d)\", type);\n\t}\n\treturn strdup (typeName);\n}\n\nstatic void __free_resource_entry(void *entry) {\n\tr_ne_resource_entry *en = (r_ne_resource_entry *)entry;\n\tfree (en->name);\n\tfree (en);\n}\n\nstatic void __free_resource(void *resource) {\n\tr_ne_resource *res = (r_ne_resource *)resource;\n\tfree (res->name);\n\tr_list_free (res->entry);\n\tfree (res);\n}\n\nstatic bool __ne_get_resources(r_bin_ne_obj_t *bin) {\n\tif (!bin->resources) {\n\t\tbin->resources = r_list_newf (__free_resource);\n\t}\n\tut16 resoff = bin->ne_header->ResTableOffset + bin->header_offset;\n\tut16 alignment = r_buf_read_le16_at (bin->buf, resoff);\n\tut32 off = resoff + 2;\n\twhile (true) {\n\t\tNE_image_typeinfo_entry ti = {0};\n\t\tr_ne_resource *res = R_NEW0 (r_ne_resource);\n\t\tif (!res) {\n\t\t\tbreak;\n\t\t}\n\t\tres->entry = r_list_newf (__free_resource_entry);\n\t\tif (!res->entry) {\n\t\t\tbreak;\n\t\t}\n\t\tr_buf_read_at (bin->buf, off, (ut8 *)&ti, sizeof (ti));\n\t\tif (!ti.rtTypeID) {\n\t\t\tbreak;\n\t\t} else if (ti.rtTypeID & 0x8000) {\n\t\t\tres->name = __resource_type_str (ti.rtTypeID & ~0x8000);\n\t\t} else {\n\t\t\t// Offset to resident name table\n\t\t\tres->name = __read_nonnull_str_at (bin->buf, (ut64)resoff + ti.rtTypeID);\n\t\t}\n\t\toff += sizeof (NE_image_typeinfo_entry);\n\t\tint i;\n\t\tfor (i = 0; i < ti.rtResourceCount; i++) {\n\t\t\tNE_image_nameinfo_entry ni;\n\t\t\tr_ne_resource_entry *ren = R_NEW0 (r_ne_resource_entry);\n\t\t\tif (!ren) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tr_buf_read_at (bin->buf, off, (ut8 *)&ni, sizeof (NE_image_nameinfo_entry));\n\t\t\tren->offset = ni.rnOffset << alignment;\n\t\t\tren->size = ni.rnLength;\n\t\t\tif (ni.rnID & 0x8000) {\n\t\t\t\tren->name = r_str_newf (\"%d\", ni.rnID & ~0x8000);\n\t\t\t} else {\n\t\t\t\t// Offset to resident name table\n\t\t\t\tren->name = __read_nonnull_str_at (bin->buf, (ut64)resoff + ni.rnID);\n\t\t\t}\n\t\t\tr_list_append (res->entry, ren);\n\t\t\toff += sizeof (NE_image_nameinfo_entry);\n\t\t}\n\t\tr_list_append (bin->resources, res);\n\t}\n\treturn true;\n}\n\nRList *r_bin_ne_get_imports(r_bin_ne_obj_t *bin) {\n\tRList *imports = r_list_newf ((RListFree)r_bin_import_free);\n\tif (!imports) {\n\t\treturn NULL;\n\t}\n\tut16 off = bin->ne_header->ImportNameTable + bin->header_offset + 1;\n\tint i;\n\tfor (i = 0; i < bin->ne_header->ModRefs; i++) {\n\t\tRBinImport *imp = R_NEW0 (RBinImport);\n\t\tif (!imp) {\n\t\t\tbreak;\n\t\t}\n\t\tut8 sz = r_buf_read8_at (bin->buf, off);\n\t\tif (!sz) {\n\t\t\tr_bin_import_free (imp);\n\t\t\tbreak;\n\t\t}\n\t\toff++;\n\t\tchar *name = malloc ((ut64)sz + 1);\n\t\tif (!name) {\n\t\t\tbreak;\n\t\t}\n\t\tr_buf_read_at (bin->buf, off, (ut8 *)name, sz);\n\t\tname[sz] = '\\0';\n\t\timp->name = name;\n\t\timp->ordinal = i + 1;\n\t\tr_list_append (imports, imp);\n\t\toff += sz;\n\t}\n\tbin->imports = imports;\n\treturn imports;\n}\n\nRList *r_bin_ne_get_entrypoints(r_bin_ne_obj_t *bin) {\n\tif (!bin->entry_table) {\n\t\treturn NULL;\n\t}\n\tRList *entries = r_list_newf (free);\n\tif (!entries) {\n\t\treturn NULL;\n\t}\n\tRList *segments = r_bin_ne_get_segments (bin);\n\tif (!segments) {\n\t\tr_list_free (entries);\n\t\treturn NULL;\n\t}\n\tif (bin->ne_header->csEntryPoint) {\n\t\tRBinAddr *entry = R_NEW0 (RBinAddr);\n\t\tif (!entry) {\n\t\t\tr_list_free (entries);\n\t\t\treturn NULL;\n\t\t}\n\t\tentry->bits = 16;\n\t\tut32 entry_cs = bin->ne_header->csEntryPoint;\n\t\tRBinSection *s = r_list_get_n (segments, entry_cs - 1);\n\t\tentry->paddr = bin->ne_header->ipEntryPoint + (s? s->paddr: 0);\n\n\t\tr_list_append (entries, entry);\n\t}\n\tint off = 0;\n\tsize_t tableat = bin->header_offset + bin->ne_header->EntryTableOffset;\n\twhile (off < bin->ne_header->EntryTableLength) {\n\t\tif (tableat + off >= r_buf_size (bin->buf)) {\n\t\t\tbreak;\n\t\t}\n\t\tut8 bundle_length = *(ut8 *)(bin->entry_table + off);\n\t\tif (!bundle_length) {\n\t\t\tbreak;\n\t\t}\n\t\toff++;\n\t\tut8 bundle_type = *(ut8 *)(bin->entry_table + off);\n\t\toff++;\n\t\tint i;\n\t\tfor (i = 0; i < bundle_length; i++) {\n\t\t\tif (tableat + off + 4 >= r_buf_size (bin->buf)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tRBinAddr *entry = R_NEW0 (RBinAddr);\n\t\t\tif (!entry) {\n\t\t\t\tr_list_free (entries);\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\toff++;\n\t\t\tif (!bundle_type) { // Skip\n\t\t\t\toff--;\n\t\t\t\tfree (entry);\n\t\t\t\tbreak;\n\t\t\t} else if (bundle_type == 0xff) { // moveable\n\t\t\t\toff += 2;\n\t\t\t\tut8 segnum = *(bin->entry_table + off);\n\t\t\t\toff++;\n\t\t\t\tif (off > bin->ne_header->EntryTableLength) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tut16 segoff = r_read_le16 (bin->entry_table + off);\n\t\t\t\tif (segnum > 0 && segnum < bin->ne_header->SegCount) {\n\t\t\t\t\tentry->paddr = (ut64)bin->segment_entries[segnum - 1].offset * bin->alignment + segoff;\n\t\t\t\t}\n\t\t\t} else { // Fixed\n\t\t\t\tif (off + 2 >= bin->ne_header->EntryTableLength) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tut16 delta = r_read_le16 (bin->entry_table + off);\n\t\t\t\tif (bundle_type < bin->ne_header->SegCount) {\n\t\t\t\t\tentry->paddr = (ut64)bin->segment_entries[bundle_type - 1].offset\n\t\t\t\t\t\t* bin->alignment + delta;\n\t\t\t\t}\n\t\t\t}\n\t\t\toff += 2;\n\t\t\tr_list_append (entries, entry);\n\t\t}\n\t}\n\tr_list_free (segments);\n\tbin->entries = entries;\n\treturn entries;\n}\n\nRList *r_bin_ne_get_relocs(r_bin_ne_obj_t *bin) {\n\tRList *segments = bin->segments;\n\tif (!segments) {\n\t\treturn NULL;\n\t}\n\tRList *entries = bin->entries;\n\tif (!entries) {\n\t\treturn NULL;\n\t}\n\tRList *symbols = bin->symbols;\n\tif (!symbols) {\n\t\treturn NULL;\n\t}\n\n\tut16 *modref = calloc (bin->ne_header->ModRefs, sizeof (ut16));\n\tif (!modref) {\n\t\treturn NULL;\n\t}\n\tr_buf_read_at (bin->buf, (ut64)bin->ne_header->ModRefTable + bin->header_offset, (ut8 *)modref, bin->ne_header->ModRefs * sizeof (ut16));\n\n\tRList *relocs = r_list_newf (free);\n\tif (!relocs) {\n\t\tfree (modref);\n\t\treturn NULL;\n\t}\n\n\tRListIter *it;\n\tRBinSection *seg;\n\tint index = -1;\n\tr_list_foreach (segments, it, seg) {\n\t\tindex++;\n\t\tif (!(bin->segment_entries[index].flags & RELOCINFO)) {\n\t\t\tcontinue;\n\t\t}\n\t\tut32 off = seg->paddr + seg->size;\n\t\tut32 start = off;\n\t\tut16 length = r_buf_read_le16_at (bin->buf, off);\n\t\tif (!length) {\n\t\t\tcontinue;\n\t\t}\n\t\toff += 2;\n\t\t// size_t buf_size = r_buf_size (bin->buf);\n\t\twhile (off < start + length * sizeof (NE_image_reloc_item)) {\n\t\t\t// && off + sizeof (NE_image_reloc_item) < buf_size)\n\t\t\tNE_image_reloc_item rel = {0};\n\t\t\tif (r_buf_read_at (bin->buf, off, (ut8 *)&rel, sizeof (rel)) < 1) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tRBinReloc *reloc = R_NEW0 (RBinReloc);\n\t\t\tif (!reloc) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\treloc->paddr = seg->paddr + rel.offset;\n\t\t\tswitch (rel.type) {\n\t\t\tcase LOBYTE:\n\t\t\t\treloc->type = R_BIN_RELOC_8;\n\t\t\t\tbreak;\n\t\t\tcase SEL_16:\n\t\t\tcase OFF_16:\n\t\t\t\treloc->type = R_BIN_RELOC_16;\n\t\t\t\tbreak;\n\t\t\tcase POI_32:\n\t\t\tcase OFF_32:\n\t\t\t\treloc->type = R_BIN_RELOC_32;\n\t\t\t\tbreak;\n\t\t\tcase POI_48:\n\t\t\t\treloc->type = R_BIN_RELOC_64;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tut32 offset;\n\t\t\tif (rel.flags & (IMPORTED_ORD | IMPORTED_NAME)) {\n\t\t\t\tRBinImport *imp = R_NEW0 (RBinImport);\n\t\t\t\tif (!imp) {\n\t\t\t\t\tfree (reloc);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tchar *name = NULL;\n\t\t\t\tif (rel.index > bin->ne_header->ModRefs) {\n\t\t\t\t\tname = r_str_newf (\"UnknownModule%d_%x\", rel.index, off); // ????\n\t\t\t\t} else if (rel.index > 0) {\n\t\t\t\t\toffset = modref[rel.index - 1] + bin->header_offset + bin->ne_header->ImportNameTable;\n\t\t\t\t\tname = __read_nonnull_str_at (bin->buf, offset);\n\t\t\t\t}\n\t\t\t\tif (rel.flags & IMPORTED_ORD) {\n\t\t\t\t\timp->ordinal = rel.func_ord;\n\t\t\t\t\tchar *fname = __func_name_from_ord (name, rel.func_ord);\n\t\t\t\t\timp->name = r_str_newf (\"%s.%s\", name, fname);\n\t\t\t\t\tfree (fname);\n\t\t\t\t} else {\n\t\t\t\t\toffset = bin->header_offset + bin->ne_header->ImportNameTable + rel.name_off;\n\t\t\t\t\tchar *func = __read_nonnull_str_at (bin->buf, offset);\n\t\t\t\t\timp->name = r_str_newf (\"%s.%s\", name, func);\n\t\t\t\t\tfree (func);\n\t\t\t\t}\n\t\t\t\tfree (name);\n\t\t\t\treloc->import = imp;\n\t\t\t} else if (rel.flags & OSFIXUP) {\n\t\t\t\t// TODO\n\t\t\t} else {\n\t\t\t\tif (strstr (seg->name, \"FIXED\")) {\n\t\t\t\t\tRBinSection *s = r_list_get_n (segments, rel.segnum - 1);\n\t\t\t\t\tif (s) {\n\t\t\t\t\t\toffset = s->paddr + rel.segoff;\n\t\t\t\t\t} else {\n\t\t\t\t\t\toffset = -1;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tRBinAddr *entry = r_list_get_n (entries, rel.entry_ordinal - 1);\n\t\t\t\t\tif (entry) {\n\t\t\t\t\t\toffset = entry->paddr;\n\t\t\t\t\t} else {\n\t\t\t\t\t\toffset = -1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treloc->addend = offset;\n\t\t\t\tRBinSymbol *sym = NULL;\n\t\t\t\tRListIter *sit;\n\t\t\t\tr_list_foreach (symbols, sit, sym) {\n\t\t\t\t\tif (sym->paddr == reloc->addend) {\n\t\t\t\t\t\treloc->symbol = sym;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (rel.flags & ADDITIVE) {\n\t\t\t\treloc->additive = 1;\n\t\t\t\tr_list_append (relocs, reloc);\n\t\t\t} else {\n\t\t\t\tdo {\n#define NE_BUG 0\n#if NE_BUG\n\t\t\t\t\tif (reloc->paddr + 4 < r_buf_size (bin->buf)) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n#endif\n\t\t\t\t\tr_list_append (relocs, reloc);\n\t\t\t\t\toffset = r_buf_read_le16_at (bin->buf, reloc->paddr);\n\t\t\t\t\tRBinReloc *tmp = reloc;\n\t\t\t\t\treloc = R_NEW0 (RBinReloc);\n\t\t\t\t\tif (!reloc) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\t*reloc = *tmp;\n\t\t\t\t\treloc->paddr = seg->paddr + offset;\n\t\t\t\t} while (offset != 0xFFFF);\n\t\t\t\tfree (reloc);\n\t\t\t}\n\n\t\t\toff += sizeof (NE_image_reloc_item);\n\t\t}\n\t}\n\tfree (modref);\n\treturn relocs;\n}\n\nvoid __init(RBuffer *buf, r_bin_ne_obj_t *bin) {\n\tbin->header_offset = r_buf_read_le16_at (buf, 0x3c);\n\tbin->ne_header = R_NEW0 (NE_image_header);\n\tif (!bin->ne_header) {\n\t\treturn;\n\t}\n\tbin->buf = buf;\n\t// XXX this is endian unsafe\n\tif (r_buf_read_at (buf, bin->header_offset, (ut8 *)bin->ne_header, sizeof (NE_image_header)) < 1) {\n\t\tR_FREE (bin->ne_header);\n\t\treturn;\n\t}\n\tif (bin->ne_header->FileAlnSzShftCnt > 15) {\n\t\tbin->ne_header->FileAlnSzShftCnt = 15;\n\t}\n\tut64 from = bin->ne_header->ModRefTable + bin->header_offset;\n\tut64 left = r_buf_size (bin->buf) - from;\n\tif (from + bin->ne_header->ModRefs * sizeof (ut16) >= left) {\n\t\tbin->ne_header->ModRefs = left / sizeof (ut16);\n\t}\n\tbin->alignment = 1 << bin->ne_header->FileAlnSzShftCnt;\n\tif (!bin->alignment) {\n\t\tbin->alignment = 1 << 9;\n\t}\n\tbin->os = __get_target_os (bin);\n\n\tut16 offset = bin->ne_header->SegTableOffset + bin->header_offset;\n\tsize_t size = bin->ne_header->SegCount * sizeof (NE_image_segment_entry);\n\tif (offset >= r_buf_size (bin->buf)) {\n\t\treturn;\n\t}\n\tsize_t remaining = r_buf_size (bin->buf) - offset;\n\tsize = R_MIN (remaining, size);\n\tbin->ne_header->SegCount = size / sizeof (NE_image_segment_entry); // * sizeof (NE_image_segment_entry);\n\tbin->segment_entries = calloc (1, size);\n\tif (size >= remaining) {\n\t\tbin->ne_header->SegCount = size / sizeof (NE_image_segment_entry);\n\t}\n\tif (!bin->segment_entries) {\n\t\treturn;\n\t}\n\tr_buf_read_at (buf, offset, (ut8 *)bin->segment_entries, size);\n\tbin->entry_table = calloc (4, bin->ne_header->EntryTableLength);\n\tif (!bin->entry_table) {\n\t\tR_FREE (bin->segment_entries);\n\t\treturn;\n\t}\n\tr_buf_read_at (buf, (ut64)bin->header_offset + bin->ne_header->EntryTableOffset, bin->entry_table, bin->ne_header->EntryTableLength);\n\tbin->imports = r_bin_ne_get_imports (bin);\n\t__ne_get_resources (bin);\n}\n\nvoid r_bin_ne_free(r_bin_ne_obj_t *bin) {\n\t// r_list_free (bin->imports); // double free\n\tr_list_free (bin->resources);\n\tfree (bin->entry_table);\n\tfree (bin->ne_header);\n\tfree (bin->resident_name_table);\n\tfree (bin->segment_entries);\n\tfree (bin);\n}\n\nr_bin_ne_obj_t *r_bin_ne_new_buf(RBuffer *buf, bool verbose) {\n\tr_bin_ne_obj_t *bin = R_NEW0 (r_bin_ne_obj_t);\n\tif (!bin) {\n\t\treturn NULL;\n\t}\n\t__init(buf, bin);\n\treturn bin;\n}\n"},"func_before":{"kind":"string","value":"RList *r_bin_ne_get_entrypoints(r_bin_ne_obj_t *bin) {\n\tif (!bin->entry_table) {\n\t\treturn NULL;\n\t}\n\tRList *entries = r_list_newf (free);\n\tif (!entries) {\n\t\treturn NULL;\n\t}\n\tRList *segments = r_bin_ne_get_segments (bin);\n\tif (!segments) {\n\t\tr_list_free (entries);\n\t\treturn NULL;\n\t}\n\tif (bin->ne_header->csEntryPoint) {\n\t\tRBinAddr *entry = R_NEW0 (RBinAddr);\n\t\tif (!entry) {\n\t\t\tr_list_free (entries);\n\t\t\treturn NULL;\n\t\t}\n\t\tentry->bits = 16;\n\t\tut32 entry_cs = bin->ne_header->csEntryPoint;\n\t\tRBinSection *s = r_list_get_n (segments, entry_cs - 1);\n\t\tentry->paddr = bin->ne_header->ipEntryPoint + (s? s->paddr: 0);\n\n\t\tr_list_append (entries, entry);\n\t}\n\tint off = 0;\n\tsize_t tableat = bin->header_offset + bin->ne_header->EntryTableOffset;\n\twhile (off < bin->ne_header->EntryTableLength) {\n\t\tif (tableat + off >= r_buf_size (bin->buf)) {\n\t\t\tbreak;\n\t\t}\n\t\tut8 bundle_length = *(ut8 *)(bin->entry_table + off);\n\t\tif (!bundle_length) {\n\t\t\tbreak;\n\t\t}\n\t\toff++;\n\t\tut8 bundle_type = *(ut8 *)(bin->entry_table + off);\n\t\toff++;\n\t\tint i;\n\t\tfor (i = 0; i < bundle_length; i++) {\n\t\t\tif (tableat + off + 4 >= r_buf_size (bin->buf)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tRBinAddr *entry = R_NEW0 (RBinAddr);\n\t\t\tif (!entry) {\n\t\t\t\tr_list_free (entries);\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\toff++;\n\t\t\tif (!bundle_type) { // Skip\n\t\t\t\toff--;\n\t\t\t\tfree (entry);\n\t\t\t\tbreak;\n\t\t\t} else if (bundle_type == 0xff) { // moveable\n\t\t\t\toff += 2;\n\t\t\t\tut8 segnum = *(bin->entry_table + off);\n\t\t\t\toff++;\n\t\t\t\tut16 segoff = *(ut16 *)(bin->entry_table + off);\n\t\t\t\tif (segnum > 0) {\n\t\t\t\t\tentry->paddr = (ut64)bin->segment_entries[segnum - 1].offset * bin->alignment + segoff;\n\t\t\t\t}\n\t\t\t} else { // Fixed\n\t\t\t\tif (bundle_type < bin->ne_header->SegCount) {\n\t\t\t\t\tentry->paddr = (ut64)bin->segment_entries[bundle_type - 1].offset\n\t\t\t\t\t\t* bin->alignment + *(ut16 *)(bin->entry_table + off);\n\t\t\t\t}\n\t\t\t}\n\t\t\toff += 2;\n\t\t\tr_list_append (entries, entry);\n\t\t}\n\t}\n\tr_list_free (segments);\n\tbin->entries = entries;\n\treturn entries;\n}"},"func_after":{"kind":"string","value":"RList *r_bin_ne_get_entrypoints(r_bin_ne_obj_t *bin) {\n\tif (!bin->entry_table) {\n\t\treturn NULL;\n\t}\n\tRList *entries = r_list_newf (free);\n\tif (!entries) {\n\t\treturn NULL;\n\t}\n\tRList *segments = r_bin_ne_get_segments (bin);\n\tif (!segments) {\n\t\tr_list_free (entries);\n\t\treturn NULL;\n\t}\n\tif (bin->ne_header->csEntryPoint) {\n\t\tRBinAddr *entry = R_NEW0 (RBinAddr);\n\t\tif (!entry) {\n\t\t\tr_list_free (entries);\n\t\t\treturn NULL;\n\t\t}\n\t\tentry->bits = 16;\n\t\tut32 entry_cs = bin->ne_header->csEntryPoint;\n\t\tRBinSection *s = r_list_get_n (segments, entry_cs - 1);\n\t\tentry->paddr = bin->ne_header->ipEntryPoint + (s? s->paddr: 0);\n\n\t\tr_list_append (entries, entry);\n\t}\n\tint off = 0;\n\tsize_t tableat = bin->header_offset + bin->ne_header->EntryTableOffset;\n\twhile (off < bin->ne_header->EntryTableLength) {\n\t\tif (tableat + off >= r_buf_size (bin->buf)) {\n\t\t\tbreak;\n\t\t}\n\t\tut8 bundle_length = *(ut8 *)(bin->entry_table + off);\n\t\tif (!bundle_length) {\n\t\t\tbreak;\n\t\t}\n\t\toff++;\n\t\tut8 bundle_type = *(ut8 *)(bin->entry_table + off);\n\t\toff++;\n\t\tint i;\n\t\tfor (i = 0; i < bundle_length; i++) {\n\t\t\tif (tableat + off + 4 >= r_buf_size (bin->buf)) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tRBinAddr *entry = R_NEW0 (RBinAddr);\n\t\t\tif (!entry) {\n\t\t\t\tr_list_free (entries);\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\toff++;\n\t\t\tif (!bundle_type) { // Skip\n\t\t\t\toff--;\n\t\t\t\tfree (entry);\n\t\t\t\tbreak;\n\t\t\t} else if (bundle_type == 0xff) { // moveable\n\t\t\t\toff += 2;\n\t\t\t\tut8 segnum = *(bin->entry_table + off);\n\t\t\t\toff++;\n\t\t\t\tif (off > bin->ne_header->EntryTableLength) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tut16 segoff = r_read_le16 (bin->entry_table + off);\n\t\t\t\tif (segnum > 0 && segnum < bin->ne_header->SegCount) {\n\t\t\t\t\tentry->paddr = (ut64)bin->segment_entries[segnum - 1].offset * bin->alignment + segoff;\n\t\t\t\t}\n\t\t\t} else { // Fixed\n\t\t\t\tif (off + 2 >= bin->ne_header->EntryTableLength) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tut16 delta = r_read_le16 (bin->entry_table + off);\n\t\t\t\tif (bundle_type < bin->ne_header->SegCount) {\n\t\t\t\t\tentry->paddr = (ut64)bin->segment_entries[bundle_type - 1].offset\n\t\t\t\t\t\t* bin->alignment + delta;\n\t\t\t\t}\n\t\t\t}\n\t\t\toff += 2;\n\t\t\tr_list_append (entries, entry);\n\t\t}\n\t}\n\tr_list_free (segments);\n\tbin->entries = entries;\n\treturn entries;\n}"},"diff":{"kind":"string","value":"{'added': [(411, '\\t\\t\\t\\tif (off > bin->ne_header->EntryTableLength) {'), (412, '\\t\\t\\t\\t\\tbreak;'), (413, '\\t\\t\\t\\t}'), (414, '\\t\\t\\t\\tut16 segoff = r_read_le16 (bin->entry_table + off);'), (415, '\\t\\t\\t\\tif (segnum > 0 && segnum < bin->ne_header->SegCount) {'), (419, '\\t\\t\\t\\tif (off + 2 >= bin->ne_header->EntryTableLength) {'), (420, '\\t\\t\\t\\t\\tbreak;'), (421, '\\t\\t\\t\\t}'), (422, '\\t\\t\\t\\tut16 delta = r_read_le16 (bin->entry_table + off);'), (425, '\\t\\t\\t\\t\\t\\t* bin->alignment + delta;')], 'deleted': [(411, '\\t\\t\\t\\tut16 segoff = *(ut16 *)(bin->entry_table + off);'), (412, '\\t\\t\\t\\tif (segnum > 0) {'), (418, '\\t\\t\\t\\t\\t\\t* bin->alignment + *(ut16 *)(bin->entry_table + off);')]}"},"num_lines_added":{"kind":"number","value":10,"string":"10"},"num_lines_deleted":{"kind":"number","value":3,"string":"3"},"num_lines_in_file":{"kind":"number","value":626,"string":"626"},"num_tokens_in_file":{"kind":"number","value":3762,"string":"3,762"},"num_lines_in_method":{"kind":"number","value":75,"string":"75"},"num_tokens_in_method":{"kind":"number","value":478,"string":"478"},"method_complexity":{"kind":"number","value":17,"string":"17"},"repo":{"kind":"string","value":"https://github.com/radareorg/radare2"},"cve_id":{"kind":"string","value":"CVE-2022-1297"},"cwe_id":{"kind":"string","value":"CWE-125"}}},{"rowIdx":391,"cells":{"id":{"kind":"number","value":1532,"string":"1,532"},"file_name":{"kind":"string","value":"rose_timer.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"rose_stop_heartbeat"},"code_before":{"kind":"string","value":"// SPDX-License-Identifier: GPL-2.0-or-later\n/*\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)\n * Copyright (C) 2002 Ralf Baechle DO1GRB (ralf@gnu.org)\n */\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nstatic void rose_heartbeat_expiry(struct timer_list *t);\nstatic void rose_timer_expiry(struct timer_list *);\nstatic void rose_idletimer_expiry(struct timer_list *);\n\nvoid rose_start_heartbeat(struct sock *sk)\n{\n\tdel_timer(&sk->sk_timer);\n\n\tsk->sk_timer.function = rose_heartbeat_expiry;\n\tsk->sk_timer.expires = jiffies + 5 * HZ;\n\n\tadd_timer(&sk->sk_timer);\n}\n\nvoid rose_start_t1timer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tdel_timer(&rose->timer);\n\n\trose->timer.function = rose_timer_expiry;\n\trose->timer.expires = jiffies + rose->t1;\n\n\tadd_timer(&rose->timer);\n}\n\nvoid rose_start_t2timer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tdel_timer(&rose->timer);\n\n\trose->timer.function = rose_timer_expiry;\n\trose->timer.expires = jiffies + rose->t2;\n\n\tadd_timer(&rose->timer);\n}\n\nvoid rose_start_t3timer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tdel_timer(&rose->timer);\n\n\trose->timer.function = rose_timer_expiry;\n\trose->timer.expires = jiffies + rose->t3;\n\n\tadd_timer(&rose->timer);\n}\n\nvoid rose_start_hbtimer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tdel_timer(&rose->timer);\n\n\trose->timer.function = rose_timer_expiry;\n\trose->timer.expires = jiffies + rose->hb;\n\n\tadd_timer(&rose->timer);\n}\n\nvoid rose_start_idletimer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tdel_timer(&rose->idletimer);\n\n\tif (rose->idle > 0) {\n\t\trose->idletimer.function = rose_idletimer_expiry;\n\t\trose->idletimer.expires = jiffies + rose->idle;\n\n\t\tadd_timer(&rose->idletimer);\n\t}\n}\n\nvoid rose_stop_heartbeat(struct sock *sk)\n{\n\tdel_timer(&sk->sk_timer);\n}\n\nvoid rose_stop_timer(struct sock *sk)\n{\n\tdel_timer(&rose_sk(sk)->timer);\n}\n\nvoid rose_stop_idletimer(struct sock *sk)\n{\n\tdel_timer(&rose_sk(sk)->idletimer);\n}\n\nstatic void rose_heartbeat_expiry(struct timer_list *t)\n{\n\tstruct sock *sk = from_timer(sk, t, sk_timer);\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tbh_lock_sock(sk);\n\tswitch (rose->state) {\n\tcase ROSE_STATE_0:\n\t\t/* Magic here: If we listen() and a new link dies before it\n\t\t is accepted() it isn't 'dead' so doesn't get removed. */\n\t\tif (sock_flag(sk, SOCK_DESTROY) ||\n\t\t (sk->sk_state == TCP_LISTEN && sock_flag(sk, SOCK_DEAD))) {\n\t\t\tbh_unlock_sock(sk);\n\t\t\trose_destroy_socket(sk);\n\t\t\treturn;\n\t\t}\n\t\tbreak;\n\n\tcase ROSE_STATE_3:\n\t\t/*\n\t\t * Check for the state of the receive buffer.\n\t\t */\n\t\tif (atomic_read(&sk->sk_rmem_alloc) < (sk->sk_rcvbuf / 2) &&\n\t\t (rose->condition & ROSE_COND_OWN_RX_BUSY)) {\n\t\t\trose->condition &= ~ROSE_COND_OWN_RX_BUSY;\n\t\t\trose->condition &= ~ROSE_COND_ACK_PENDING;\n\t\t\trose->vl = rose->vr;\n\t\t\trose_write_internal(sk, ROSE_RR);\n\t\t\trose_stop_timer(sk);\t/* HB */\n\t\t\tbreak;\n\t\t}\n\t\tbreak;\n\t}\n\n\trose_start_heartbeat(sk);\n\tbh_unlock_sock(sk);\n}\n\nstatic void rose_timer_expiry(struct timer_list *t)\n{\n\tstruct rose_sock *rose = from_timer(rose, t, timer);\n\tstruct sock *sk = &rose->sock;\n\n\tbh_lock_sock(sk);\n\tswitch (rose->state) {\n\tcase ROSE_STATE_1:\t/* T1 */\n\tcase ROSE_STATE_4:\t/* T2 */\n\t\trose_write_internal(sk, ROSE_CLEAR_REQUEST);\n\t\trose->state = ROSE_STATE_2;\n\t\trose_start_t3timer(sk);\n\t\tbreak;\n\n\tcase ROSE_STATE_2:\t/* T3 */\n\t\trose->neighbour->use--;\n\t\trose_disconnect(sk, ETIMEDOUT, -1, -1);\n\t\tbreak;\n\n\tcase ROSE_STATE_3:\t/* HB */\n\t\tif (rose->condition & ROSE_COND_ACK_PENDING) {\n\t\t\trose->condition &= ~ROSE_COND_ACK_PENDING;\n\t\t\trose_enquiry_response(sk);\n\t\t}\n\t\tbreak;\n\t}\n\tbh_unlock_sock(sk);\n}\n\nstatic void rose_idletimer_expiry(struct timer_list *t)\n{\n\tstruct rose_sock *rose = from_timer(rose, t, idletimer);\n\tstruct sock *sk = &rose->sock;\n\n\tbh_lock_sock(sk);\n\trose_clear_queues(sk);\n\n\trose_write_internal(sk, ROSE_CLEAR_REQUEST);\n\trose_sk(sk)->state = ROSE_STATE_2;\n\n\trose_start_t3timer(sk);\n\n\tsk->sk_state = TCP_CLOSE;\n\tsk->sk_err = 0;\n\tsk->sk_shutdown |= SEND_SHUTDOWN;\n\n\tif (!sock_flag(sk, SOCK_DEAD)) {\n\t\tsk->sk_state_change(sk);\n\t\tsock_set_flag(sk, SOCK_DEAD);\n\t}\n\tbh_unlock_sock(sk);\n}\n"},"code_after":{"kind":"string","value":"// SPDX-License-Identifier: GPL-2.0-or-later\n/*\n *\n * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)\n * Copyright (C) 2002 Ralf Baechle DO1GRB (ralf@gnu.org)\n */\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nstatic void rose_heartbeat_expiry(struct timer_list *t);\nstatic void rose_timer_expiry(struct timer_list *);\nstatic void rose_idletimer_expiry(struct timer_list *);\n\nvoid rose_start_heartbeat(struct sock *sk)\n{\n\tsk_stop_timer(sk, &sk->sk_timer);\n\n\tsk->sk_timer.function = rose_heartbeat_expiry;\n\tsk->sk_timer.expires = jiffies + 5 * HZ;\n\n\tsk_reset_timer(sk, &sk->sk_timer, sk->sk_timer.expires);\n}\n\nvoid rose_start_t1timer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tsk_stop_timer(sk, &rose->timer);\n\n\trose->timer.function = rose_timer_expiry;\n\trose->timer.expires = jiffies + rose->t1;\n\n\tsk_reset_timer(sk, &rose->timer, rose->timer.expires);\n}\n\nvoid rose_start_t2timer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tsk_stop_timer(sk, &rose->timer);\n\n\trose->timer.function = rose_timer_expiry;\n\trose->timer.expires = jiffies + rose->t2;\n\n\tsk_reset_timer(sk, &rose->timer, rose->timer.expires);\n}\n\nvoid rose_start_t3timer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tsk_stop_timer(sk, &rose->timer);\n\n\trose->timer.function = rose_timer_expiry;\n\trose->timer.expires = jiffies + rose->t3;\n\n\tsk_reset_timer(sk, &rose->timer, rose->timer.expires);\n}\n\nvoid rose_start_hbtimer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tsk_stop_timer(sk, &rose->timer);\n\n\trose->timer.function = rose_timer_expiry;\n\trose->timer.expires = jiffies + rose->hb;\n\n\tsk_reset_timer(sk, &rose->timer, rose->timer.expires);\n}\n\nvoid rose_start_idletimer(struct sock *sk)\n{\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tsk_stop_timer(sk, &rose->idletimer);\n\n\tif (rose->idle > 0) {\n\t\trose->idletimer.function = rose_idletimer_expiry;\n\t\trose->idletimer.expires = jiffies + rose->idle;\n\n\t\tsk_reset_timer(sk, &rose->idletimer, rose->idletimer.expires);\n\t}\n}\n\nvoid rose_stop_heartbeat(struct sock *sk)\n{\n\tsk_stop_timer(sk, &sk->sk_timer);\n}\n\nvoid rose_stop_timer(struct sock *sk)\n{\n\tsk_stop_timer(sk, &rose_sk(sk)->timer);\n}\n\nvoid rose_stop_idletimer(struct sock *sk)\n{\n\tsk_stop_timer(sk, &rose_sk(sk)->idletimer);\n}\n\nstatic void rose_heartbeat_expiry(struct timer_list *t)\n{\n\tstruct sock *sk = from_timer(sk, t, sk_timer);\n\tstruct rose_sock *rose = rose_sk(sk);\n\n\tbh_lock_sock(sk);\n\tswitch (rose->state) {\n\tcase ROSE_STATE_0:\n\t\t/* Magic here: If we listen() and a new link dies before it\n\t\t is accepted() it isn't 'dead' so doesn't get removed. */\n\t\tif (sock_flag(sk, SOCK_DESTROY) ||\n\t\t (sk->sk_state == TCP_LISTEN && sock_flag(sk, SOCK_DEAD))) {\n\t\t\tbh_unlock_sock(sk);\n\t\t\trose_destroy_socket(sk);\n\t\t\tsock_put(sk);\n\t\t\treturn;\n\t\t}\n\t\tbreak;\n\n\tcase ROSE_STATE_3:\n\t\t/*\n\t\t * Check for the state of the receive buffer.\n\t\t */\n\t\tif (atomic_read(&sk->sk_rmem_alloc) < (sk->sk_rcvbuf / 2) &&\n\t\t (rose->condition & ROSE_COND_OWN_RX_BUSY)) {\n\t\t\trose->condition &= ~ROSE_COND_OWN_RX_BUSY;\n\t\t\trose->condition &= ~ROSE_COND_ACK_PENDING;\n\t\t\trose->vl = rose->vr;\n\t\t\trose_write_internal(sk, ROSE_RR);\n\t\t\trose_stop_timer(sk);\t/* HB */\n\t\t\tbreak;\n\t\t}\n\t\tbreak;\n\t}\n\n\trose_start_heartbeat(sk);\n\tbh_unlock_sock(sk);\n\tsock_put(sk);\n}\n\nstatic void rose_timer_expiry(struct timer_list *t)\n{\n\tstruct rose_sock *rose = from_timer(rose, t, timer);\n\tstruct sock *sk = &rose->sock;\n\n\tbh_lock_sock(sk);\n\tswitch (rose->state) {\n\tcase ROSE_STATE_1:\t/* T1 */\n\tcase ROSE_STATE_4:\t/* T2 */\n\t\trose_write_internal(sk, ROSE_CLEAR_REQUEST);\n\t\trose->state = ROSE_STATE_2;\n\t\trose_start_t3timer(sk);\n\t\tbreak;\n\n\tcase ROSE_STATE_2:\t/* T3 */\n\t\trose->neighbour->use--;\n\t\trose_disconnect(sk, ETIMEDOUT, -1, -1);\n\t\tbreak;\n\n\tcase ROSE_STATE_3:\t/* HB */\n\t\tif (rose->condition & ROSE_COND_ACK_PENDING) {\n\t\t\trose->condition &= ~ROSE_COND_ACK_PENDING;\n\t\t\trose_enquiry_response(sk);\n\t\t}\n\t\tbreak;\n\t}\n\tbh_unlock_sock(sk);\n\tsock_put(sk);\n}\n\nstatic void rose_idletimer_expiry(struct timer_list *t)\n{\n\tstruct rose_sock *rose = from_timer(rose, t, idletimer);\n\tstruct sock *sk = &rose->sock;\n\n\tbh_lock_sock(sk);\n\trose_clear_queues(sk);\n\n\trose_write_internal(sk, ROSE_CLEAR_REQUEST);\n\trose_sk(sk)->state = ROSE_STATE_2;\n\n\trose_start_t3timer(sk);\n\n\tsk->sk_state = TCP_CLOSE;\n\tsk->sk_err = 0;\n\tsk->sk_shutdown |= SEND_SHUTDOWN;\n\n\tif (!sock_flag(sk, SOCK_DEAD)) {\n\t\tsk->sk_state_change(sk);\n\t\tsock_set_flag(sk, SOCK_DEAD);\n\t}\n\tbh_unlock_sock(sk);\n\tsock_put(sk);\n}\n"},"func_before":{"kind":"string","value":"void rose_stop_heartbeat(struct sock *sk)\n{\n\tdel_timer(&sk->sk_timer);\n}"},"func_after":{"kind":"string","value":"void rose_stop_heartbeat(struct sock *sk)\n{\n\tsk_stop_timer(sk, &sk->sk_timer);\n}"},"diff":{"kind":"string","value":"{'added': [(34, '\\tsk_stop_timer(sk, &sk->sk_timer);'), (39, '\\tsk_reset_timer(sk, &sk->sk_timer, sk->sk_timer.expires);'), (46, '\\tsk_stop_timer(sk, &rose->timer);'), (51, '\\tsk_reset_timer(sk, &rose->timer, rose->timer.expires);'), (58, '\\tsk_stop_timer(sk, &rose->timer);'), (63, '\\tsk_reset_timer(sk, &rose->timer, rose->timer.expires);'), (70, '\\tsk_stop_timer(sk, &rose->timer);'), (75, '\\tsk_reset_timer(sk, &rose->timer, rose->timer.expires);'), (82, '\\tsk_stop_timer(sk, &rose->timer);'), (87, '\\tsk_reset_timer(sk, &rose->timer, rose->timer.expires);'), (94, '\\tsk_stop_timer(sk, &rose->idletimer);'), (100, '\\t\\tsk_reset_timer(sk, &rose->idletimer, rose->idletimer.expires);'), (106, '\\tsk_stop_timer(sk, &sk->sk_timer);'), (111, '\\tsk_stop_timer(sk, &rose_sk(sk)->timer);'), (116, '\\tsk_stop_timer(sk, &rose_sk(sk)->idletimer);'), (133, '\\t\\t\\tsock_put(sk);'), (156, '\\tsock_put(sk);'), (186, '\\tsock_put(sk);'), (211, '\\tsock_put(sk);')], 'deleted': [(34, '\\tdel_timer(&sk->sk_timer);'), (39, '\\tadd_timer(&sk->sk_timer);'), (46, '\\tdel_timer(&rose->timer);'), (51, '\\tadd_timer(&rose->timer);'), (58, '\\tdel_timer(&rose->timer);'), (63, '\\tadd_timer(&rose->timer);'), (70, '\\tdel_timer(&rose->timer);'), (75, '\\tadd_timer(&rose->timer);'), (82, '\\tdel_timer(&rose->timer);'), (87, '\\tadd_timer(&rose->timer);'), (94, '\\tdel_timer(&rose->idletimer);'), (100, '\\t\\tadd_timer(&rose->idletimer);'), (106, '\\tdel_timer(&sk->sk_timer);'), (111, '\\tdel_timer(&rose_sk(sk)->timer);'), (116, '\\tdel_timer(&rose_sk(sk)->idletimer);')]}"},"num_lines_added":{"kind":"number","value":19,"string":"19"},"num_lines_deleted":{"kind":"number","value":15,"string":"15"},"num_lines_in_file":{"kind":"number","value":160,"string":"160"},"num_tokens_in_file":{"kind":"number","value":963,"string":"963"},"num_lines_in_method":{"kind":"number","value":4,"string":"4"},"num_tokens_in_method":{"kind":"number","value":17,"string":"17"},"method_complexity":{"kind":"number","value":1,"string":"1"},"repo":{"kind":"string","value":"https://github.com/torvalds/linux"},"cve_id":{"kind":"string","value":"CVE-2022-2318"},"cwe_id":{"kind":"string","value":"CWE-416"}}},{"rowIdx":392,"cells":{"id":{"kind":"number","value":3132,"string":"3,132"},"file_name":{"kind":"string","value":"oom_kill.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"__oom_reap_task_mm"},"code_before":{"kind":"string","value":"/*\n * linux/mm/oom_kill.c\n * \n * Copyright (C) 1998,2000 Rik van Riel\n *\tThanks go out to Claus Fischer for some serious inspiration and\n *\tfor goading me into coding this file...\n * Copyright (C) 2010 Google, Inc.\n *\tRewritten by David Rientjes\n *\n * The routines in this file are used to kill a process when\n * we're seriously out of memory. This gets called from __alloc_pages()\n * in mm/page_alloc.c when we really run out of memory.\n *\n * Since we won't call these routines often (on a well-configured\n * machine) this file will double as a 'coding guide' and a signpost\n * for newbie kernel hackers. It features several pointers to major\n * kernel subsystems and hints as to where to find out what things do.\n */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \"internal.h\"\n#include \"slab.h\"\n\n#define CREATE_TRACE_POINTS\n#include \n\nint sysctl_panic_on_oom;\nint sysctl_oom_kill_allocating_task;\nint sysctl_oom_dump_tasks = 1;\n\nDEFINE_MUTEX(oom_lock);\n\n#ifdef CONFIG_NUMA\n/**\n * has_intersects_mems_allowed() - check task eligiblity for kill\n * @start: task struct of which task to consider\n * @mask: nodemask passed to page allocator for mempolicy ooms\n *\n * Task eligibility is determined by whether or not a candidate task, @tsk,\n * shares the same mempolicy nodes as current if it is bound by such a policy\n * and whether or not it has the same set of allowed cpuset nodes.\n */\nstatic bool has_intersects_mems_allowed(struct task_struct *start,\n\t\t\t\t\tconst nodemask_t *mask)\n{\n\tstruct task_struct *tsk;\n\tbool ret = false;\n\n\trcu_read_lock();\n\tfor_each_thread(start, tsk) {\n\t\tif (mask) {\n\t\t\t/*\n\t\t\t * If this is a mempolicy constrained oom, tsk's\n\t\t\t * cpuset is irrelevant. Only return true if its\n\t\t\t * mempolicy intersects current, otherwise it may be\n\t\t\t * needlessly killed.\n\t\t\t */\n\t\t\tret = mempolicy_nodemask_intersects(tsk, mask);\n\t\t} else {\n\t\t\t/*\n\t\t\t * This is not a mempolicy constrained oom, so only\n\t\t\t * check the mems of tsk's cpuset.\n\t\t\t */\n\t\t\tret = cpuset_mems_allowed_intersects(current, tsk);\n\t\t}\n\t\tif (ret)\n\t\t\tbreak;\n\t}\n\trcu_read_unlock();\n\n\treturn ret;\n}\n#else\nstatic bool has_intersects_mems_allowed(struct task_struct *tsk,\n\t\t\t\t\tconst nodemask_t *mask)\n{\n\treturn true;\n}\n#endif /* CONFIG_NUMA */\n\n/*\n * The process p may have detached its own ->mm while exiting or through\n * use_mm(), but one or more of its subthreads may still have a valid\n * pointer. Return p, or any of its subthreads with a valid ->mm, with\n * task_lock() held.\n */\nstruct task_struct *find_lock_task_mm(struct task_struct *p)\n{\n\tstruct task_struct *t;\n\n\trcu_read_lock();\n\n\tfor_each_thread(p, t) {\n\t\ttask_lock(t);\n\t\tif (likely(t->mm))\n\t\t\tgoto found;\n\t\ttask_unlock(t);\n\t}\n\tt = NULL;\nfound:\n\trcu_read_unlock();\n\n\treturn t;\n}\n\n/*\n * order == -1 means the oom kill is required by sysrq, otherwise only\n * for display purposes.\n */\nstatic inline bool is_sysrq_oom(struct oom_control *oc)\n{\n\treturn oc->order == -1;\n}\n\nstatic inline bool is_memcg_oom(struct oom_control *oc)\n{\n\treturn oc->memcg != NULL;\n}\n\n/* return true if the task is not adequate as candidate victim task. */\nstatic bool oom_unkillable_task(struct task_struct *p,\n\t\tstruct mem_cgroup *memcg, const nodemask_t *nodemask)\n{\n\tif (is_global_init(p))\n\t\treturn true;\n\tif (p->flags & PF_KTHREAD)\n\t\treturn true;\n\n\t/* When mem_cgroup_out_of_memory() and p is not member of the group */\n\tif (memcg && !task_in_mem_cgroup(p, memcg))\n\t\treturn true;\n\n\t/* p may not have freeable memory in nodemask */\n\tif (!has_intersects_mems_allowed(p, nodemask))\n\t\treturn true;\n\n\treturn false;\n}\n\n/*\n * Print out unreclaimble slabs info when unreclaimable slabs amount is greater\n * than all user memory (LRU pages)\n */\nstatic bool is_dump_unreclaim_slabs(void)\n{\n\tunsigned long nr_lru;\n\n\tnr_lru = global_node_page_state(NR_ACTIVE_ANON) +\n\t\t global_node_page_state(NR_INACTIVE_ANON) +\n\t\t global_node_page_state(NR_ACTIVE_FILE) +\n\t\t global_node_page_state(NR_INACTIVE_FILE) +\n\t\t global_node_page_state(NR_ISOLATED_ANON) +\n\t\t global_node_page_state(NR_ISOLATED_FILE) +\n\t\t global_node_page_state(NR_UNEVICTABLE);\n\n\treturn (global_node_page_state(NR_SLAB_UNRECLAIMABLE) > nr_lru);\n}\n\n/**\n * oom_badness - heuristic function to determine which candidate task to kill\n * @p: task struct of which task we should calculate\n * @totalpages: total present RAM allowed for page allocation\n *\n * The heuristic for determining which task to kill is made to be as simple and\n * predictable as possible. The goal is to return the highest value for the\n * task consuming the most memory to avoid subsequent oom failures.\n */\nunsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,\n\t\t\t const nodemask_t *nodemask, unsigned long totalpages)\n{\n\tlong points;\n\tlong adj;\n\n\tif (oom_unkillable_task(p, memcg, nodemask))\n\t\treturn 0;\n\n\tp = find_lock_task_mm(p);\n\tif (!p)\n\t\treturn 0;\n\n\t/*\n\t * Do not even consider tasks which are explicitly marked oom\n\t * unkillable or have been already oom reaped or the are in\n\t * the middle of vfork\n\t */\n\tadj = (long)p->signal->oom_score_adj;\n\tif (adj == OOM_SCORE_ADJ_MIN ||\n\t\t\ttest_bit(MMF_OOM_SKIP, &p->mm->flags) ||\n\t\t\tin_vfork(p)) {\n\t\ttask_unlock(p);\n\t\treturn 0;\n\t}\n\n\t/*\n\t * The baseline for the badness score is the proportion of RAM that each\n\t * task's rss, pagetable and swap space use.\n\t */\n\tpoints = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) +\n\t\tmm_pgtables_bytes(p->mm) / PAGE_SIZE;\n\ttask_unlock(p);\n\n\t/*\n\t * Root processes get 3% bonus, just like the __vm_enough_memory()\n\t * implementation used by LSMs.\n\t */\n\tif (has_capability_noaudit(p, CAP_SYS_ADMIN))\n\t\tpoints -= (points * 3) / 100;\n\n\t/* Normalize to oom_score_adj units */\n\tadj *= totalpages / 1000;\n\tpoints += adj;\n\n\t/*\n\t * Never return 0 for an eligible task regardless of the root bonus and\n\t * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).\n\t */\n\treturn points > 0 ? points : 1;\n}\n\nenum oom_constraint {\n\tCONSTRAINT_NONE,\n\tCONSTRAINT_CPUSET,\n\tCONSTRAINT_MEMORY_POLICY,\n\tCONSTRAINT_MEMCG,\n};\n\n/*\n * Determine the type of allocation constraint.\n */\nstatic enum oom_constraint constrained_alloc(struct oom_control *oc)\n{\n\tstruct zone *zone;\n\tstruct zoneref *z;\n\tenum zone_type high_zoneidx = gfp_zone(oc->gfp_mask);\n\tbool cpuset_limited = false;\n\tint nid;\n\n\tif (is_memcg_oom(oc)) {\n\t\toc->totalpages = mem_cgroup_get_limit(oc->memcg) ?: 1;\n\t\treturn CONSTRAINT_MEMCG;\n\t}\n\n\t/* Default to all available memory */\n\toc->totalpages = totalram_pages + total_swap_pages;\n\n\tif (!IS_ENABLED(CONFIG_NUMA))\n\t\treturn CONSTRAINT_NONE;\n\n\tif (!oc->zonelist)\n\t\treturn CONSTRAINT_NONE;\n\t/*\n\t * Reach here only when __GFP_NOFAIL is used. So, we should avoid\n\t * to kill current.We have to random task kill in this case.\n\t * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.\n\t */\n\tif (oc->gfp_mask & __GFP_THISNODE)\n\t\treturn CONSTRAINT_NONE;\n\n\t/*\n\t * This is not a __GFP_THISNODE allocation, so a truncated nodemask in\n\t * the page allocator means a mempolicy is in effect. Cpuset policy\n\t * is enforced in get_page_from_freelist().\n\t */\n\tif (oc->nodemask &&\n\t !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {\n\t\toc->totalpages = total_swap_pages;\n\t\tfor_each_node_mask(nid, *oc->nodemask)\n\t\t\toc->totalpages += node_spanned_pages(nid);\n\t\treturn CONSTRAINT_MEMORY_POLICY;\n\t}\n\n\t/* Check this allocation failure is caused by cpuset's wall function */\n\tfor_each_zone_zonelist_nodemask(zone, z, oc->zonelist,\n\t\t\thigh_zoneidx, oc->nodemask)\n\t\tif (!cpuset_zone_allowed(zone, oc->gfp_mask))\n\t\t\tcpuset_limited = true;\n\n\tif (cpuset_limited) {\n\t\toc->totalpages = total_swap_pages;\n\t\tfor_each_node_mask(nid, cpuset_current_mems_allowed)\n\t\t\toc->totalpages += node_spanned_pages(nid);\n\t\treturn CONSTRAINT_CPUSET;\n\t}\n\treturn CONSTRAINT_NONE;\n}\n\nstatic int oom_evaluate_task(struct task_struct *task, void *arg)\n{\n\tstruct oom_control *oc = arg;\n\tunsigned long points;\n\n\tif (oom_unkillable_task(task, NULL, oc->nodemask))\n\t\tgoto next;\n\n\t/*\n\t * This task already has access to memory reserves and is being killed.\n\t * Don't allow any other task to have access to the reserves unless\n\t * the task has MMF_OOM_SKIP because chances that it would release\n\t * any memory is quite low.\n\t */\n\tif (!is_sysrq_oom(oc) && tsk_is_oom_victim(task)) {\n\t\tif (test_bit(MMF_OOM_SKIP, &task->signal->oom_mm->flags))\n\t\t\tgoto next;\n\t\tgoto abort;\n\t}\n\n\t/*\n\t * If task is allocating a lot of memory and has been marked to be\n\t * killed first if it triggers an oom, then select it.\n\t */\n\tif (oom_task_origin(task)) {\n\t\tpoints = ULONG_MAX;\n\t\tgoto select;\n\t}\n\n\tpoints = oom_badness(task, NULL, oc->nodemask, oc->totalpages);\n\tif (!points || points < oc->chosen_points)\n\t\tgoto next;\n\n\t/* Prefer thread group leaders for display purposes */\n\tif (points == oc->chosen_points && thread_group_leader(oc->chosen))\n\t\tgoto next;\nselect:\n\tif (oc->chosen)\n\t\tput_task_struct(oc->chosen);\n\tget_task_struct(task);\n\toc->chosen = task;\n\toc->chosen_points = points;\nnext:\n\treturn 0;\nabort:\n\tif (oc->chosen)\n\t\tput_task_struct(oc->chosen);\n\toc->chosen = (void *)-1UL;\n\treturn 1;\n}\n\n/*\n * Simple selection loop. We choose the process with the highest number of\n * 'points'. In case scan was aborted, oc->chosen is set to -1.\n */\nstatic void select_bad_process(struct oom_control *oc)\n{\n\tif (is_memcg_oom(oc))\n\t\tmem_cgroup_scan_tasks(oc->memcg, oom_evaluate_task, oc);\n\telse {\n\t\tstruct task_struct *p;\n\n\t\trcu_read_lock();\n\t\tfor_each_process(p)\n\t\t\tif (oom_evaluate_task(p, oc))\n\t\t\t\tbreak;\n\t\trcu_read_unlock();\n\t}\n\n\toc->chosen_points = oc->chosen_points * 1000 / oc->totalpages;\n}\n\n/**\n * dump_tasks - dump current memory state of all system tasks\n * @memcg: current's memory controller, if constrained\n * @nodemask: nodemask passed to page allocator for mempolicy ooms\n *\n * Dumps the current memory state of all eligible tasks. Tasks not in the same\n * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes\n * are not shown.\n * State information includes task's pid, uid, tgid, vm size, rss,\n * pgtables_bytes, swapents, oom_score_adj value, and name.\n */\nstatic void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask)\n{\n\tstruct task_struct *p;\n\tstruct task_struct *task;\n\n\tpr_info(\"[ pid ] uid tgid total_vm rss pgtables_bytes swapents oom_score_adj name\\n\");\n\trcu_read_lock();\n\tfor_each_process(p) {\n\t\tif (oom_unkillable_task(p, memcg, nodemask))\n\t\t\tcontinue;\n\n\t\ttask = find_lock_task_mm(p);\n\t\tif (!task) {\n\t\t\t/*\n\t\t\t * This is a kthread or all of p's threads have already\n\t\t\t * detached their mm's. There's no need to report\n\t\t\t * them; they can't be oom killed anyway.\n\t\t\t */\n\t\t\tcontinue;\n\t\t}\n\n\t\tpr_info(\"[%5d] %5d %5d %8lu %8lu %8ld %8lu %5hd %s\\n\",\n\t\t\ttask->pid, from_kuid(&init_user_ns, task_uid(task)),\n\t\t\ttask->tgid, task->mm->total_vm, get_mm_rss(task->mm),\n\t\t\tmm_pgtables_bytes(task->mm),\n\t\t\tget_mm_counter(task->mm, MM_SWAPENTS),\n\t\t\ttask->signal->oom_score_adj, task->comm);\n\t\ttask_unlock(task);\n\t}\n\trcu_read_unlock();\n}\n\nstatic void dump_header(struct oom_control *oc, struct task_struct *p)\n{\n\tpr_warn(\"%s invoked oom-killer: gfp_mask=%#x(%pGg), nodemask=%*pbl, order=%d, oom_score_adj=%hd\\n\",\n\t\tcurrent->comm, oc->gfp_mask, &oc->gfp_mask,\n\t\tnodemask_pr_args(oc->nodemask), oc->order,\n\t\t\tcurrent->signal->oom_score_adj);\n\tif (!IS_ENABLED(CONFIG_COMPACTION) && oc->order)\n\t\tpr_warn(\"COMPACTION is disabled!!!\\n\");\n\n\tcpuset_print_current_mems_allowed();\n\tdump_stack();\n\tif (is_memcg_oom(oc))\n\t\tmem_cgroup_print_oom_info(oc->memcg, p);\n\telse {\n\t\tshow_mem(SHOW_MEM_FILTER_NODES, oc->nodemask);\n\t\tif (is_dump_unreclaim_slabs())\n\t\t\tdump_unreclaimable_slab();\n\t}\n\tif (sysctl_oom_dump_tasks)\n\t\tdump_tasks(oc->memcg, oc->nodemask);\n}\n\n/*\n * Number of OOM victims in flight\n */\nstatic atomic_t oom_victims = ATOMIC_INIT(0);\nstatic DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);\n\nstatic bool oom_killer_disabled __read_mostly;\n\n#define K(x) ((x) << (PAGE_SHIFT-10))\n\n/*\n * task->mm can be NULL if the task is the exited group leader. So to\n * determine whether the task is using a particular mm, we examine all the\n * task's threads: if one of those is using this mm then this task was also\n * using it.\n */\nbool process_shares_mm(struct task_struct *p, struct mm_struct *mm)\n{\n\tstruct task_struct *t;\n\n\tfor_each_thread(p, t) {\n\t\tstruct mm_struct *t_mm = READ_ONCE(t->mm);\n\t\tif (t_mm)\n\t\t\treturn t_mm == mm;\n\t}\n\treturn false;\n}\n\n\n#ifdef CONFIG_MMU\n/*\n * OOM Reaper kernel thread which tries to reap the memory used by the OOM\n * victim (if that is possible) to help the OOM killer to move on.\n */\nstatic struct task_struct *oom_reaper_th;\nstatic DECLARE_WAIT_QUEUE_HEAD(oom_reaper_wait);\nstatic struct task_struct *oom_reaper_list;\nstatic DEFINE_SPINLOCK(oom_reaper_lock);\n\nstatic bool __oom_reap_task_mm(struct task_struct *tsk, struct mm_struct *mm)\n{\n\tstruct mmu_gather tlb;\n\tstruct vm_area_struct *vma;\n\tbool ret = true;\n\n\t/*\n\t * We have to make sure to not race with the victim exit path\n\t * and cause premature new oom victim selection:\n\t * __oom_reap_task_mm\t\texit_mm\n\t * mmget_not_zero\n\t *\t\t\t\t mmput\n\t *\t\t\t\t atomic_dec_and_test\n\t *\t\t\t\t exit_oom_victim\n\t *\t\t\t\t[...]\n\t *\t\t\t\tout_of_memory\n\t *\t\t\t\t select_bad_process\n\t *\t\t\t\t # no TIF_MEMDIE task selects new victim\n\t * unmap_page_range # frees some memory\n\t */\n\tmutex_lock(&oom_lock);\n\n\tif (!down_read_trylock(&mm->mmap_sem)) {\n\t\tret = false;\n\t\ttrace_skip_task_reaping(tsk->pid);\n\t\tgoto unlock_oom;\n\t}\n\n\t/*\n\t * If the mm has notifiers then we would need to invalidate them around\n\t * unmap_page_range and that is risky because notifiers can sleep and\n\t * what they do is basically undeterministic. So let's have a short\n\t * sleep to give the oom victim some more time.\n\t * TODO: we really want to get rid of this ugly hack and make sure that\n\t * notifiers cannot block for unbounded amount of time and add\n\t * mmu_notifier_invalidate_range_{start,end} around unmap_page_range\n\t */\n\tif (mm_has_notifiers(mm)) {\n\t\tup_read(&mm->mmap_sem);\n\t\tschedule_timeout_idle(HZ);\n\t\tgoto unlock_oom;\n\t}\n\n\t/*\n\t * MMF_OOM_SKIP is set by exit_mmap when the OOM reaper can't\n\t * work on the mm anymore. The check for MMF_OOM_SKIP must run\n\t * under mmap_sem for reading because it serializes against the\n\t * down_write();up_write() cycle in exit_mmap().\n\t */\n\tif (test_bit(MMF_OOM_SKIP, &mm->flags)) {\n\t\tup_read(&mm->mmap_sem);\n\t\ttrace_skip_task_reaping(tsk->pid);\n\t\tgoto unlock_oom;\n\t}\n\n\ttrace_start_task_reaping(tsk->pid);\n\n\t/*\n\t * Tell all users of get_user/copy_from_user etc... that the content\n\t * is no longer stable. No barriers really needed because unmapping\n\t * should imply barriers already and the reader would hit a page fault\n\t * if it stumbled over a reaped memory.\n\t */\n\tset_bit(MMF_UNSTABLE, &mm->flags);\n\n\ttlb_gather_mmu(&tlb, mm, 0, -1);\n\tfor (vma = mm->mmap ; vma; vma = vma->vm_next) {\n\t\tif (!can_madv_dontneed_vma(vma))\n\t\t\tcontinue;\n\n\t\t/*\n\t\t * Only anonymous pages have a good chance to be dropped\n\t\t * without additional steps which we cannot afford as we\n\t\t * are OOM already.\n\t\t *\n\t\t * We do not even care about fs backed pages because all\n\t\t * which are reclaimable have already been reclaimed and\n\t\t * we do not want to block exit_mmap by keeping mm ref\n\t\t * count elevated without a good reason.\n\t\t */\n\t\tif (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED))\n\t\t\tunmap_page_range(&tlb, vma, vma->vm_start, vma->vm_end,\n\t\t\t\t\t NULL);\n\t}\n\ttlb_finish_mmu(&tlb, 0, -1);\n\tpr_info(\"oom_reaper: reaped process %d (%s), now anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\\n\",\n\t\t\ttask_pid_nr(tsk), tsk->comm,\n\t\t\tK(get_mm_counter(mm, MM_ANONPAGES)),\n\t\t\tK(get_mm_counter(mm, MM_FILEPAGES)),\n\t\t\tK(get_mm_counter(mm, MM_SHMEMPAGES)));\n\tup_read(&mm->mmap_sem);\n\n\ttrace_finish_task_reaping(tsk->pid);\nunlock_oom:\n\tmutex_unlock(&oom_lock);\n\treturn ret;\n}\n\n#define MAX_OOM_REAP_RETRIES 10\nstatic void oom_reap_task(struct task_struct *tsk)\n{\n\tint attempts = 0;\n\tstruct mm_struct *mm = tsk->signal->oom_mm;\n\n\t/* Retry the down_read_trylock(mmap_sem) a few times */\n\twhile (attempts++ < MAX_OOM_REAP_RETRIES && !__oom_reap_task_mm(tsk, mm))\n\t\tschedule_timeout_idle(HZ/10);\n\n\tif (attempts <= MAX_OOM_REAP_RETRIES)\n\t\tgoto done;\n\n\n\tpr_info(\"oom_reaper: unable to reap pid:%d (%s)\\n\",\n\t\ttask_pid_nr(tsk), tsk->comm);\n\tdebug_show_all_locks();\n\ndone:\n\ttsk->oom_reaper_list = NULL;\n\n\t/*\n\t * Hide this mm from OOM killer because it has been either reaped or\n\t * somebody can't call up_write(mmap_sem).\n\t */\n\tset_bit(MMF_OOM_SKIP, &mm->flags);\n\n\t/* Drop a reference taken by wake_oom_reaper */\n\tput_task_struct(tsk);\n}\n\nstatic int oom_reaper(void *unused)\n{\n\twhile (true) {\n\t\tstruct task_struct *tsk = NULL;\n\n\t\twait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL);\n\t\tspin_lock(&oom_reaper_lock);\n\t\tif (oom_reaper_list != NULL) {\n\t\t\ttsk = oom_reaper_list;\n\t\t\toom_reaper_list = tsk->oom_reaper_list;\n\t\t}\n\t\tspin_unlock(&oom_reaper_lock);\n\n\t\tif (tsk)\n\t\t\toom_reap_task(tsk);\n\t}\n\n\treturn 0;\n}\n\nstatic void wake_oom_reaper(struct task_struct *tsk)\n{\n\t/* tsk is already queued? */\n\tif (tsk == oom_reaper_list || tsk->oom_reaper_list)\n\t\treturn;\n\n\tget_task_struct(tsk);\n\n\tspin_lock(&oom_reaper_lock);\n\ttsk->oom_reaper_list = oom_reaper_list;\n\toom_reaper_list = tsk;\n\tspin_unlock(&oom_reaper_lock);\n\ttrace_wake_reaper(tsk->pid);\n\twake_up(&oom_reaper_wait);\n}\n\nstatic int __init oom_init(void)\n{\n\toom_reaper_th = kthread_run(oom_reaper, NULL, \"oom_reaper\");\n\treturn 0;\n}\nsubsys_initcall(oom_init)\n#else\nstatic inline void wake_oom_reaper(struct task_struct *tsk)\n{\n}\n#endif /* CONFIG_MMU */\n\n/**\n * mark_oom_victim - mark the given task as OOM victim\n * @tsk: task to mark\n *\n * Has to be called with oom_lock held and never after\n * oom has been disabled already.\n *\n * tsk->mm has to be non NULL and caller has to guarantee it is stable (either\n * under task_lock or operate on the current).\n */\nstatic void mark_oom_victim(struct task_struct *tsk)\n{\n\tstruct mm_struct *mm = tsk->mm;\n\n\tWARN_ON(oom_killer_disabled);\n\t/* OOM killer might race with memcg OOM */\n\tif (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))\n\t\treturn;\n\n\t/* oom_mm is bound to the signal struct life time. */\n\tif (!cmpxchg(&tsk->signal->oom_mm, NULL, mm))\n\t\tmmgrab(tsk->signal->oom_mm);\n\n\t/*\n\t * Make sure that the task is woken up from uninterruptible sleep\n\t * if it is frozen because OOM killer wouldn't be able to free\n\t * any memory and livelock. freezing_slow_path will tell the freezer\n\t * that TIF_MEMDIE tasks should be ignored.\n\t */\n\t__thaw_task(tsk);\n\tatomic_inc(&oom_victims);\n\ttrace_mark_victim(tsk->pid);\n}\n\n/**\n * exit_oom_victim - note the exit of an OOM victim\n */\nvoid exit_oom_victim(void)\n{\n\tclear_thread_flag(TIF_MEMDIE);\n\n\tif (!atomic_dec_return(&oom_victims))\n\t\twake_up_all(&oom_victims_wait);\n}\n\n/**\n * oom_killer_enable - enable OOM killer\n */\nvoid oom_killer_enable(void)\n{\n\toom_killer_disabled = false;\n\tpr_info(\"OOM killer enabled.\\n\");\n}\n\n/**\n * oom_killer_disable - disable OOM killer\n * @timeout: maximum timeout to wait for oom victims in jiffies\n *\n * Forces all page allocations to fail rather than trigger OOM killer.\n * Will block and wait until all OOM victims are killed or the given\n * timeout expires.\n *\n * The function cannot be called when there are runnable user tasks because\n * the userspace would see unexpected allocation failures as a result. Any\n * new usage of this function should be consulted with MM people.\n *\n * Returns true if successful and false if the OOM killer cannot be\n * disabled.\n */\nbool oom_killer_disable(signed long timeout)\n{\n\tsigned long ret;\n\n\t/*\n\t * Make sure to not race with an ongoing OOM killer. Check that the\n\t * current is not killed (possibly due to sharing the victim's memory).\n\t */\n\tif (mutex_lock_killable(&oom_lock))\n\t\treturn false;\n\toom_killer_disabled = true;\n\tmutex_unlock(&oom_lock);\n\n\tret = wait_event_interruptible_timeout(oom_victims_wait,\n\t\t\t!atomic_read(&oom_victims), timeout);\n\tif (ret <= 0) {\n\t\toom_killer_enable();\n\t\treturn false;\n\t}\n\tpr_info(\"OOM killer disabled.\\n\");\n\n\treturn true;\n}\n\nstatic inline bool __task_will_free_mem(struct task_struct *task)\n{\n\tstruct signal_struct *sig = task->signal;\n\n\t/*\n\t * A coredumping process may sleep for an extended period in exit_mm(),\n\t * so the oom killer cannot assume that the process will promptly exit\n\t * and release memory.\n\t */\n\tif (sig->flags & SIGNAL_GROUP_COREDUMP)\n\t\treturn false;\n\n\tif (sig->flags & SIGNAL_GROUP_EXIT)\n\t\treturn true;\n\n\tif (thread_group_empty(task) && (task->flags & PF_EXITING))\n\t\treturn true;\n\n\treturn false;\n}\n\n/*\n * Checks whether the given task is dying or exiting and likely to\n * release its address space. This means that all threads and processes\n * sharing the same mm have to be killed or exiting.\n * Caller has to make sure that task->mm is stable (hold task_lock or\n * it operates on the current).\n */\nstatic bool task_will_free_mem(struct task_struct *task)\n{\n\tstruct mm_struct *mm = task->mm;\n\tstruct task_struct *p;\n\tbool ret = true;\n\n\t/*\n\t * Skip tasks without mm because it might have passed its exit_mm and\n\t * exit_oom_victim. oom_reaper could have rescued that but do not rely\n\t * on that for now. We can consider find_lock_task_mm in future.\n\t */\n\tif (!mm)\n\t\treturn false;\n\n\tif (!__task_will_free_mem(task))\n\t\treturn false;\n\n\t/*\n\t * This task has already been drained by the oom reaper so there are\n\t * only small chances it will free some more\n\t */\n\tif (test_bit(MMF_OOM_SKIP, &mm->flags))\n\t\treturn false;\n\n\tif (atomic_read(&mm->mm_users) <= 1)\n\t\treturn true;\n\n\t/*\n\t * Make sure that all tasks which share the mm with the given tasks\n\t * are dying as well to make sure that a) nobody pins its mm and\n\t * b) the task is also reapable by the oom reaper.\n\t */\n\trcu_read_lock();\n\tfor_each_process(p) {\n\t\tif (!process_shares_mm(p, mm))\n\t\t\tcontinue;\n\t\tif (same_thread_group(task, p))\n\t\t\tcontinue;\n\t\tret = __task_will_free_mem(p);\n\t\tif (!ret)\n\t\t\tbreak;\n\t}\n\trcu_read_unlock();\n\n\treturn ret;\n}\n\nstatic void oom_kill_process(struct oom_control *oc, const char *message)\n{\n\tstruct task_struct *p = oc->chosen;\n\tunsigned int points = oc->chosen_points;\n\tstruct task_struct *victim = p;\n\tstruct task_struct *child;\n\tstruct task_struct *t;\n\tstruct mm_struct *mm;\n\tunsigned int victim_points = 0;\n\tstatic DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,\n\t\t\t\t\t DEFAULT_RATELIMIT_BURST);\n\tbool can_oom_reap = true;\n\n\t/*\n\t * If the task is already exiting, don't alarm the sysadmin or kill\n\t * its children or threads, just give it access to memory reserves\n\t * so it can die quickly\n\t */\n\ttask_lock(p);\n\tif (task_will_free_mem(p)) {\n\t\tmark_oom_victim(p);\n\t\twake_oom_reaper(p);\n\t\ttask_unlock(p);\n\t\tput_task_struct(p);\n\t\treturn;\n\t}\n\ttask_unlock(p);\n\n\tif (__ratelimit(&oom_rs))\n\t\tdump_header(oc, p);\n\n\tpr_err(\"%s: Kill process %d (%s) score %u or sacrifice child\\n\",\n\t\tmessage, task_pid_nr(p), p->comm, points);\n\n\t/*\n\t * If any of p's children has a different mm and is eligible for kill,\n\t * the one with the highest oom_badness() score is sacrificed for its\n\t * parent. This attempts to lose the minimal amount of work done while\n\t * still freeing memory.\n\t */\n\tread_lock(&tasklist_lock);\n\tfor_each_thread(p, t) {\n\t\tlist_for_each_entry(child, &t->children, sibling) {\n\t\t\tunsigned int child_points;\n\n\t\t\tif (process_shares_mm(child, p->mm))\n\t\t\t\tcontinue;\n\t\t\t/*\n\t\t\t * oom_badness() returns 0 if the thread is unkillable\n\t\t\t */\n\t\t\tchild_points = oom_badness(child,\n\t\t\t\toc->memcg, oc->nodemask, oc->totalpages);\n\t\t\tif (child_points > victim_points) {\n\t\t\t\tput_task_struct(victim);\n\t\t\t\tvictim = child;\n\t\t\t\tvictim_points = child_points;\n\t\t\t\tget_task_struct(victim);\n\t\t\t}\n\t\t}\n\t}\n\tread_unlock(&tasklist_lock);\n\n\tp = find_lock_task_mm(victim);\n\tif (!p) {\n\t\tput_task_struct(victim);\n\t\treturn;\n\t} else if (victim != p) {\n\t\tget_task_struct(p);\n\t\tput_task_struct(victim);\n\t\tvictim = p;\n\t}\n\n\t/* Get a reference to safely compare mm after task_unlock(victim) */\n\tmm = victim->mm;\n\tmmgrab(mm);\n\n\t/* Raise event before sending signal: task reaper must see this */\n\tcount_vm_event(OOM_KILL);\n\tcount_memcg_event_mm(mm, OOM_KILL);\n\n\t/*\n\t * We should send SIGKILL before granting access to memory reserves\n\t * in order to prevent the OOM victim from depleting the memory\n\t * reserves from the user space under its control.\n\t */\n\tdo_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);\n\tmark_oom_victim(victim);\n\tpr_err(\"Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\\n\",\n\t\ttask_pid_nr(victim), victim->comm, K(victim->mm->total_vm),\n\t\tK(get_mm_counter(victim->mm, MM_ANONPAGES)),\n\t\tK(get_mm_counter(victim->mm, MM_FILEPAGES)),\n\t\tK(get_mm_counter(victim->mm, MM_SHMEMPAGES)));\n\ttask_unlock(victim);\n\n\t/*\n\t * Kill all user processes sharing victim->mm in other thread groups, if\n\t * any. They don't get access to memory reserves, though, to avoid\n\t * depletion of all memory. This prevents mm->mmap_sem livelock when an\n\t * oom killed thread cannot exit because it requires the semaphore and\n\t * its contended by another thread trying to allocate memory itself.\n\t * That thread will now get access to memory reserves since it has a\n\t * pending fatal signal.\n\t */\n\trcu_read_lock();\n\tfor_each_process(p) {\n\t\tif (!process_shares_mm(p, mm))\n\t\t\tcontinue;\n\t\tif (same_thread_group(p, victim))\n\t\t\tcontinue;\n\t\tif (is_global_init(p)) {\n\t\t\tcan_oom_reap = false;\n\t\t\tset_bit(MMF_OOM_SKIP, &mm->flags);\n\t\t\tpr_info(\"oom killer %d (%s) has mm pinned by %d (%s)\\n\",\n\t\t\t\t\ttask_pid_nr(victim), victim->comm,\n\t\t\t\t\ttask_pid_nr(p), p->comm);\n\t\t\tcontinue;\n\t\t}\n\t\t/*\n\t\t * No use_mm() user needs to read from the userspace so we are\n\t\t * ok to reap it.\n\t\t */\n\t\tif (unlikely(p->flags & PF_KTHREAD))\n\t\t\tcontinue;\n\t\tdo_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);\n\t}\n\trcu_read_unlock();\n\n\tif (can_oom_reap)\n\t\twake_oom_reaper(victim);\n\n\tmmdrop(mm);\n\tput_task_struct(victim);\n}\n#undef K\n\n/*\n * Determines whether the kernel must panic because of the panic_on_oom sysctl.\n */\nstatic void check_panic_on_oom(struct oom_control *oc,\n\t\t\t enum oom_constraint constraint)\n{\n\tif (likely(!sysctl_panic_on_oom))\n\t\treturn;\n\tif (sysctl_panic_on_oom != 2) {\n\t\t/*\n\t\t * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel\n\t\t * does not panic for cpuset, mempolicy, or memcg allocation\n\t\t * failures.\n\t\t */\n\t\tif (constraint != CONSTRAINT_NONE)\n\t\t\treturn;\n\t}\n\t/* Do not panic for oom kills triggered by sysrq */\n\tif (is_sysrq_oom(oc))\n\t\treturn;\n\tdump_header(oc, NULL);\n\tpanic(\"Out of memory: %s panic_on_oom is enabled\\n\",\n\t\tsysctl_panic_on_oom == 2 ? \"compulsory\" : \"system-wide\");\n}\n\nstatic BLOCKING_NOTIFIER_HEAD(oom_notify_list);\n\nint register_oom_notifier(struct notifier_block *nb)\n{\n\treturn blocking_notifier_chain_register(&oom_notify_list, nb);\n}\nEXPORT_SYMBOL_GPL(register_oom_notifier);\n\nint unregister_oom_notifier(struct notifier_block *nb)\n{\n\treturn blocking_notifier_chain_unregister(&oom_notify_list, nb);\n}\nEXPORT_SYMBOL_GPL(unregister_oom_notifier);\n\n/**\n * out_of_memory - kill the \"best\" process when we run out of memory\n * @oc: pointer to struct oom_control\n *\n * If we run out of memory, we have the choice between either\n * killing a random task (bad), letting the system crash (worse)\n * OR try to be smart about which process to kill. Note that we\n * don't have to be perfect here, we just have to be good.\n */\nbool out_of_memory(struct oom_control *oc)\n{\n\tunsigned long freed = 0;\n\tenum oom_constraint constraint = CONSTRAINT_NONE;\n\n\tif (oom_killer_disabled)\n\t\treturn false;\n\n\tif (!is_memcg_oom(oc)) {\n\t\tblocking_notifier_call_chain(&oom_notify_list, 0, &freed);\n\t\tif (freed > 0)\n\t\t\t/* Got some memory back in the last second. */\n\t\t\treturn true;\n\t}\n\n\t/*\n\t * If current has a pending SIGKILL or is exiting, then automatically\n\t * select it. The goal is to allow it to allocate so that it may\n\t * quickly exit and free its memory.\n\t */\n\tif (task_will_free_mem(current)) {\n\t\tmark_oom_victim(current);\n\t\twake_oom_reaper(current);\n\t\treturn true;\n\t}\n\n\t/*\n\t * The OOM killer does not compensate for IO-less reclaim.\n\t * pagefault_out_of_memory lost its gfp context so we have to\n\t * make sure exclude 0 mask - all other users should have at least\n\t * ___GFP_DIRECT_RECLAIM to get here.\n\t */\n\tif (oc->gfp_mask && !(oc->gfp_mask & __GFP_FS))\n\t\treturn true;\n\n\t/*\n\t * Check if there were limitations on the allocation (only relevant for\n\t * NUMA and memcg) that may require different handling.\n\t */\n\tconstraint = constrained_alloc(oc);\n\tif (constraint != CONSTRAINT_MEMORY_POLICY)\n\t\toc->nodemask = NULL;\n\tcheck_panic_on_oom(oc, constraint);\n\n\tif (!is_memcg_oom(oc) && sysctl_oom_kill_allocating_task &&\n\t current->mm && !oom_unkillable_task(current, NULL, oc->nodemask) &&\n\t current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {\n\t\tget_task_struct(current);\n\t\toc->chosen = current;\n\t\toom_kill_process(oc, \"Out of memory (oom_kill_allocating_task)\");\n\t\treturn true;\n\t}\n\n\tselect_bad_process(oc);\n\t/* Found nothing?!?! Either we hang forever, or we panic. */\n\tif (!oc->chosen && !is_sysrq_oom(oc) && !is_memcg_oom(oc)) {\n\t\tdump_header(oc, NULL);\n\t\tpanic(\"Out of memory and no killable processes...\\n\");\n\t}\n\tif (oc->chosen && oc->chosen != (void *)-1UL) {\n\t\toom_kill_process(oc, !is_memcg_oom(oc) ? \"Out of memory\" :\n\t\t\t\t \"Memory cgroup out of memory\");\n\t\t/*\n\t\t * Give the killed process a good chance to exit before trying\n\t\t * to allocate memory again.\n\t\t */\n\t\tschedule_timeout_killable(1);\n\t}\n\treturn !!oc->chosen;\n}\n\n/*\n * The pagefault handler calls here because it is out of memory, so kill a\n * memory-hogging task. If oom_lock is held by somebody else, a parallel oom\n * killing is already in progress so do nothing.\n */\nvoid pagefault_out_of_memory(void)\n{\n\tstruct oom_control oc = {\n\t\t.zonelist = NULL,\n\t\t.nodemask = NULL,\n\t\t.memcg = NULL,\n\t\t.gfp_mask = 0,\n\t\t.order = 0,\n\t};\n\n\tif (mem_cgroup_oom_synchronize(true))\n\t\treturn;\n\n\tif (!mutex_trylock(&oom_lock))\n\t\treturn;\n\tout_of_memory(&oc);\n\tmutex_unlock(&oom_lock);\n}\n"},"code_after":{"kind":"string","value":"/*\n * linux/mm/oom_kill.c\n * \n * Copyright (C) 1998,2000 Rik van Riel\n *\tThanks go out to Claus Fischer for some serious inspiration and\n *\tfor goading me into coding this file...\n * Copyright (C) 2010 Google, Inc.\n *\tRewritten by David Rientjes\n *\n * The routines in this file are used to kill a process when\n * we're seriously out of memory. This gets called from __alloc_pages()\n * in mm/page_alloc.c when we really run out of memory.\n *\n * Since we won't call these routines often (on a well-configured\n * machine) this file will double as a 'coding guide' and a signpost\n * for newbie kernel hackers. It features several pointers to major\n * kernel subsystems and hints as to where to find out what things do.\n */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \"internal.h\"\n#include \"slab.h\"\n\n#define CREATE_TRACE_POINTS\n#include \n\nint sysctl_panic_on_oom;\nint sysctl_oom_kill_allocating_task;\nint sysctl_oom_dump_tasks = 1;\n\nDEFINE_MUTEX(oom_lock);\n\n#ifdef CONFIG_NUMA\n/**\n * has_intersects_mems_allowed() - check task eligiblity for kill\n * @start: task struct of which task to consider\n * @mask: nodemask passed to page allocator for mempolicy ooms\n *\n * Task eligibility is determined by whether or not a candidate task, @tsk,\n * shares the same mempolicy nodes as current if it is bound by such a policy\n * and whether or not it has the same set of allowed cpuset nodes.\n */\nstatic bool has_intersects_mems_allowed(struct task_struct *start,\n\t\t\t\t\tconst nodemask_t *mask)\n{\n\tstruct task_struct *tsk;\n\tbool ret = false;\n\n\trcu_read_lock();\n\tfor_each_thread(start, tsk) {\n\t\tif (mask) {\n\t\t\t/*\n\t\t\t * If this is a mempolicy constrained oom, tsk's\n\t\t\t * cpuset is irrelevant. Only return true if its\n\t\t\t * mempolicy intersects current, otherwise it may be\n\t\t\t * needlessly killed.\n\t\t\t */\n\t\t\tret = mempolicy_nodemask_intersects(tsk, mask);\n\t\t} else {\n\t\t\t/*\n\t\t\t * This is not a mempolicy constrained oom, so only\n\t\t\t * check the mems of tsk's cpuset.\n\t\t\t */\n\t\t\tret = cpuset_mems_allowed_intersects(current, tsk);\n\t\t}\n\t\tif (ret)\n\t\t\tbreak;\n\t}\n\trcu_read_unlock();\n\n\treturn ret;\n}\n#else\nstatic bool has_intersects_mems_allowed(struct task_struct *tsk,\n\t\t\t\t\tconst nodemask_t *mask)\n{\n\treturn true;\n}\n#endif /* CONFIG_NUMA */\n\n/*\n * The process p may have detached its own ->mm while exiting or through\n * use_mm(), but one or more of its subthreads may still have a valid\n * pointer. Return p, or any of its subthreads with a valid ->mm, with\n * task_lock() held.\n */\nstruct task_struct *find_lock_task_mm(struct task_struct *p)\n{\n\tstruct task_struct *t;\n\n\trcu_read_lock();\n\n\tfor_each_thread(p, t) {\n\t\ttask_lock(t);\n\t\tif (likely(t->mm))\n\t\t\tgoto found;\n\t\ttask_unlock(t);\n\t}\n\tt = NULL;\nfound:\n\trcu_read_unlock();\n\n\treturn t;\n}\n\n/*\n * order == -1 means the oom kill is required by sysrq, otherwise only\n * for display purposes.\n */\nstatic inline bool is_sysrq_oom(struct oom_control *oc)\n{\n\treturn oc->order == -1;\n}\n\nstatic inline bool is_memcg_oom(struct oom_control *oc)\n{\n\treturn oc->memcg != NULL;\n}\n\n/* return true if the task is not adequate as candidate victim task. */\nstatic bool oom_unkillable_task(struct task_struct *p,\n\t\tstruct mem_cgroup *memcg, const nodemask_t *nodemask)\n{\n\tif (is_global_init(p))\n\t\treturn true;\n\tif (p->flags & PF_KTHREAD)\n\t\treturn true;\n\n\t/* When mem_cgroup_out_of_memory() and p is not member of the group */\n\tif (memcg && !task_in_mem_cgroup(p, memcg))\n\t\treturn true;\n\n\t/* p may not have freeable memory in nodemask */\n\tif (!has_intersects_mems_allowed(p, nodemask))\n\t\treturn true;\n\n\treturn false;\n}\n\n/*\n * Print out unreclaimble slabs info when unreclaimable slabs amount is greater\n * than all user memory (LRU pages)\n */\nstatic bool is_dump_unreclaim_slabs(void)\n{\n\tunsigned long nr_lru;\n\n\tnr_lru = global_node_page_state(NR_ACTIVE_ANON) +\n\t\t global_node_page_state(NR_INACTIVE_ANON) +\n\t\t global_node_page_state(NR_ACTIVE_FILE) +\n\t\t global_node_page_state(NR_INACTIVE_FILE) +\n\t\t global_node_page_state(NR_ISOLATED_ANON) +\n\t\t global_node_page_state(NR_ISOLATED_FILE) +\n\t\t global_node_page_state(NR_UNEVICTABLE);\n\n\treturn (global_node_page_state(NR_SLAB_UNRECLAIMABLE) > nr_lru);\n}\n\n/**\n * oom_badness - heuristic function to determine which candidate task to kill\n * @p: task struct of which task we should calculate\n * @totalpages: total present RAM allowed for page allocation\n *\n * The heuristic for determining which task to kill is made to be as simple and\n * predictable as possible. The goal is to return the highest value for the\n * task consuming the most memory to avoid subsequent oom failures.\n */\nunsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,\n\t\t\t const nodemask_t *nodemask, unsigned long totalpages)\n{\n\tlong points;\n\tlong adj;\n\n\tif (oom_unkillable_task(p, memcg, nodemask))\n\t\treturn 0;\n\n\tp = find_lock_task_mm(p);\n\tif (!p)\n\t\treturn 0;\n\n\t/*\n\t * Do not even consider tasks which are explicitly marked oom\n\t * unkillable or have been already oom reaped or the are in\n\t * the middle of vfork\n\t */\n\tadj = (long)p->signal->oom_score_adj;\n\tif (adj == OOM_SCORE_ADJ_MIN ||\n\t\t\ttest_bit(MMF_OOM_SKIP, &p->mm->flags) ||\n\t\t\tin_vfork(p)) {\n\t\ttask_unlock(p);\n\t\treturn 0;\n\t}\n\n\t/*\n\t * The baseline for the badness score is the proportion of RAM that each\n\t * task's rss, pagetable and swap space use.\n\t */\n\tpoints = get_mm_rss(p->mm) + get_mm_counter(p->mm, MM_SWAPENTS) +\n\t\tmm_pgtables_bytes(p->mm) / PAGE_SIZE;\n\ttask_unlock(p);\n\n\t/*\n\t * Root processes get 3% bonus, just like the __vm_enough_memory()\n\t * implementation used by LSMs.\n\t */\n\tif (has_capability_noaudit(p, CAP_SYS_ADMIN))\n\t\tpoints -= (points * 3) / 100;\n\n\t/* Normalize to oom_score_adj units */\n\tadj *= totalpages / 1000;\n\tpoints += adj;\n\n\t/*\n\t * Never return 0 for an eligible task regardless of the root bonus and\n\t * oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).\n\t */\n\treturn points > 0 ? points : 1;\n}\n\nenum oom_constraint {\n\tCONSTRAINT_NONE,\n\tCONSTRAINT_CPUSET,\n\tCONSTRAINT_MEMORY_POLICY,\n\tCONSTRAINT_MEMCG,\n};\n\n/*\n * Determine the type of allocation constraint.\n */\nstatic enum oom_constraint constrained_alloc(struct oom_control *oc)\n{\n\tstruct zone *zone;\n\tstruct zoneref *z;\n\tenum zone_type high_zoneidx = gfp_zone(oc->gfp_mask);\n\tbool cpuset_limited = false;\n\tint nid;\n\n\tif (is_memcg_oom(oc)) {\n\t\toc->totalpages = mem_cgroup_get_limit(oc->memcg) ?: 1;\n\t\treturn CONSTRAINT_MEMCG;\n\t}\n\n\t/* Default to all available memory */\n\toc->totalpages = totalram_pages + total_swap_pages;\n\n\tif (!IS_ENABLED(CONFIG_NUMA))\n\t\treturn CONSTRAINT_NONE;\n\n\tif (!oc->zonelist)\n\t\treturn CONSTRAINT_NONE;\n\t/*\n\t * Reach here only when __GFP_NOFAIL is used. So, we should avoid\n\t * to kill current.We have to random task kill in this case.\n\t * Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.\n\t */\n\tif (oc->gfp_mask & __GFP_THISNODE)\n\t\treturn CONSTRAINT_NONE;\n\n\t/*\n\t * This is not a __GFP_THISNODE allocation, so a truncated nodemask in\n\t * the page allocator means a mempolicy is in effect. Cpuset policy\n\t * is enforced in get_page_from_freelist().\n\t */\n\tif (oc->nodemask &&\n\t !nodes_subset(node_states[N_MEMORY], *oc->nodemask)) {\n\t\toc->totalpages = total_swap_pages;\n\t\tfor_each_node_mask(nid, *oc->nodemask)\n\t\t\toc->totalpages += node_spanned_pages(nid);\n\t\treturn CONSTRAINT_MEMORY_POLICY;\n\t}\n\n\t/* Check this allocation failure is caused by cpuset's wall function */\n\tfor_each_zone_zonelist_nodemask(zone, z, oc->zonelist,\n\t\t\thigh_zoneidx, oc->nodemask)\n\t\tif (!cpuset_zone_allowed(zone, oc->gfp_mask))\n\t\t\tcpuset_limited = true;\n\n\tif (cpuset_limited) {\n\t\toc->totalpages = total_swap_pages;\n\t\tfor_each_node_mask(nid, cpuset_current_mems_allowed)\n\t\t\toc->totalpages += node_spanned_pages(nid);\n\t\treturn CONSTRAINT_CPUSET;\n\t}\n\treturn CONSTRAINT_NONE;\n}\n\nstatic int oom_evaluate_task(struct task_struct *task, void *arg)\n{\n\tstruct oom_control *oc = arg;\n\tunsigned long points;\n\n\tif (oom_unkillable_task(task, NULL, oc->nodemask))\n\t\tgoto next;\n\n\t/*\n\t * This task already has access to memory reserves and is being killed.\n\t * Don't allow any other task to have access to the reserves unless\n\t * the task has MMF_OOM_SKIP because chances that it would release\n\t * any memory is quite low.\n\t */\n\tif (!is_sysrq_oom(oc) && tsk_is_oom_victim(task)) {\n\t\tif (test_bit(MMF_OOM_SKIP, &task->signal->oom_mm->flags))\n\t\t\tgoto next;\n\t\tgoto abort;\n\t}\n\n\t/*\n\t * If task is allocating a lot of memory and has been marked to be\n\t * killed first if it triggers an oom, then select it.\n\t */\n\tif (oom_task_origin(task)) {\n\t\tpoints = ULONG_MAX;\n\t\tgoto select;\n\t}\n\n\tpoints = oom_badness(task, NULL, oc->nodemask, oc->totalpages);\n\tif (!points || points < oc->chosen_points)\n\t\tgoto next;\n\n\t/* Prefer thread group leaders for display purposes */\n\tif (points == oc->chosen_points && thread_group_leader(oc->chosen))\n\t\tgoto next;\nselect:\n\tif (oc->chosen)\n\t\tput_task_struct(oc->chosen);\n\tget_task_struct(task);\n\toc->chosen = task;\n\toc->chosen_points = points;\nnext:\n\treturn 0;\nabort:\n\tif (oc->chosen)\n\t\tput_task_struct(oc->chosen);\n\toc->chosen = (void *)-1UL;\n\treturn 1;\n}\n\n/*\n * Simple selection loop. We choose the process with the highest number of\n * 'points'. In case scan was aborted, oc->chosen is set to -1.\n */\nstatic void select_bad_process(struct oom_control *oc)\n{\n\tif (is_memcg_oom(oc))\n\t\tmem_cgroup_scan_tasks(oc->memcg, oom_evaluate_task, oc);\n\telse {\n\t\tstruct task_struct *p;\n\n\t\trcu_read_lock();\n\t\tfor_each_process(p)\n\t\t\tif (oom_evaluate_task(p, oc))\n\t\t\t\tbreak;\n\t\trcu_read_unlock();\n\t}\n\n\toc->chosen_points = oc->chosen_points * 1000 / oc->totalpages;\n}\n\n/**\n * dump_tasks - dump current memory state of all system tasks\n * @memcg: current's memory controller, if constrained\n * @nodemask: nodemask passed to page allocator for mempolicy ooms\n *\n * Dumps the current memory state of all eligible tasks. Tasks not in the same\n * memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes\n * are not shown.\n * State information includes task's pid, uid, tgid, vm size, rss,\n * pgtables_bytes, swapents, oom_score_adj value, and name.\n */\nstatic void dump_tasks(struct mem_cgroup *memcg, const nodemask_t *nodemask)\n{\n\tstruct task_struct *p;\n\tstruct task_struct *task;\n\n\tpr_info(\"[ pid ] uid tgid total_vm rss pgtables_bytes swapents oom_score_adj name\\n\");\n\trcu_read_lock();\n\tfor_each_process(p) {\n\t\tif (oom_unkillable_task(p, memcg, nodemask))\n\t\t\tcontinue;\n\n\t\ttask = find_lock_task_mm(p);\n\t\tif (!task) {\n\t\t\t/*\n\t\t\t * This is a kthread or all of p's threads have already\n\t\t\t * detached their mm's. There's no need to report\n\t\t\t * them; they can't be oom killed anyway.\n\t\t\t */\n\t\t\tcontinue;\n\t\t}\n\n\t\tpr_info(\"[%5d] %5d %5d %8lu %8lu %8ld %8lu %5hd %s\\n\",\n\t\t\ttask->pid, from_kuid(&init_user_ns, task_uid(task)),\n\t\t\ttask->tgid, task->mm->total_vm, get_mm_rss(task->mm),\n\t\t\tmm_pgtables_bytes(task->mm),\n\t\t\tget_mm_counter(task->mm, MM_SWAPENTS),\n\t\t\ttask->signal->oom_score_adj, task->comm);\n\t\ttask_unlock(task);\n\t}\n\trcu_read_unlock();\n}\n\nstatic void dump_header(struct oom_control *oc, struct task_struct *p)\n{\n\tpr_warn(\"%s invoked oom-killer: gfp_mask=%#x(%pGg), nodemask=%*pbl, order=%d, oom_score_adj=%hd\\n\",\n\t\tcurrent->comm, oc->gfp_mask, &oc->gfp_mask,\n\t\tnodemask_pr_args(oc->nodemask), oc->order,\n\t\t\tcurrent->signal->oom_score_adj);\n\tif (!IS_ENABLED(CONFIG_COMPACTION) && oc->order)\n\t\tpr_warn(\"COMPACTION is disabled!!!\\n\");\n\n\tcpuset_print_current_mems_allowed();\n\tdump_stack();\n\tif (is_memcg_oom(oc))\n\t\tmem_cgroup_print_oom_info(oc->memcg, p);\n\telse {\n\t\tshow_mem(SHOW_MEM_FILTER_NODES, oc->nodemask);\n\t\tif (is_dump_unreclaim_slabs())\n\t\t\tdump_unreclaimable_slab();\n\t}\n\tif (sysctl_oom_dump_tasks)\n\t\tdump_tasks(oc->memcg, oc->nodemask);\n}\n\n/*\n * Number of OOM victims in flight\n */\nstatic atomic_t oom_victims = ATOMIC_INIT(0);\nstatic DECLARE_WAIT_QUEUE_HEAD(oom_victims_wait);\n\nstatic bool oom_killer_disabled __read_mostly;\n\n#define K(x) ((x) << (PAGE_SHIFT-10))\n\n/*\n * task->mm can be NULL if the task is the exited group leader. So to\n * determine whether the task is using a particular mm, we examine all the\n * task's threads: if one of those is using this mm then this task was also\n * using it.\n */\nbool process_shares_mm(struct task_struct *p, struct mm_struct *mm)\n{\n\tstruct task_struct *t;\n\n\tfor_each_thread(p, t) {\n\t\tstruct mm_struct *t_mm = READ_ONCE(t->mm);\n\t\tif (t_mm)\n\t\t\treturn t_mm == mm;\n\t}\n\treturn false;\n}\n\n\n#ifdef CONFIG_MMU\n/*\n * OOM Reaper kernel thread which tries to reap the memory used by the OOM\n * victim (if that is possible) to help the OOM killer to move on.\n */\nstatic struct task_struct *oom_reaper_th;\nstatic DECLARE_WAIT_QUEUE_HEAD(oom_reaper_wait);\nstatic struct task_struct *oom_reaper_list;\nstatic DEFINE_SPINLOCK(oom_reaper_lock);\n\nstatic bool __oom_reap_task_mm(struct task_struct *tsk, struct mm_struct *mm)\n{\n\tstruct mmu_gather tlb;\n\tstruct vm_area_struct *vma;\n\tbool ret = true;\n\n\t/*\n\t * We have to make sure to not race with the victim exit path\n\t * and cause premature new oom victim selection:\n\t * __oom_reap_task_mm\t\texit_mm\n\t * mmget_not_zero\n\t *\t\t\t\t mmput\n\t *\t\t\t\t atomic_dec_and_test\n\t *\t\t\t\t exit_oom_victim\n\t *\t\t\t\t[...]\n\t *\t\t\t\tout_of_memory\n\t *\t\t\t\t select_bad_process\n\t *\t\t\t\t # no TIF_MEMDIE task selects new victim\n\t * unmap_page_range # frees some memory\n\t */\n\tmutex_lock(&oom_lock);\n\n\tif (!down_read_trylock(&mm->mmap_sem)) {\n\t\tret = false;\n\t\ttrace_skip_task_reaping(tsk->pid);\n\t\tgoto unlock_oom;\n\t}\n\n\t/*\n\t * If the mm has notifiers then we would need to invalidate them around\n\t * unmap_page_range and that is risky because notifiers can sleep and\n\t * what they do is basically undeterministic. So let's have a short\n\t * sleep to give the oom victim some more time.\n\t * TODO: we really want to get rid of this ugly hack and make sure that\n\t * notifiers cannot block for unbounded amount of time and add\n\t * mmu_notifier_invalidate_range_{start,end} around unmap_page_range\n\t */\n\tif (mm_has_notifiers(mm)) {\n\t\tup_read(&mm->mmap_sem);\n\t\tschedule_timeout_idle(HZ);\n\t\tgoto unlock_oom;\n\t}\n\n\t/*\n\t * MMF_OOM_SKIP is set by exit_mmap when the OOM reaper can't\n\t * work on the mm anymore. The check for MMF_OOM_SKIP must run\n\t * under mmap_sem for reading because it serializes against the\n\t * down_write();up_write() cycle in exit_mmap().\n\t */\n\tif (test_bit(MMF_OOM_SKIP, &mm->flags)) {\n\t\tup_read(&mm->mmap_sem);\n\t\ttrace_skip_task_reaping(tsk->pid);\n\t\tgoto unlock_oom;\n\t}\n\n\ttrace_start_task_reaping(tsk->pid);\n\n\t/*\n\t * Tell all users of get_user/copy_from_user etc... that the content\n\t * is no longer stable. No barriers really needed because unmapping\n\t * should imply barriers already and the reader would hit a page fault\n\t * if it stumbled over a reaped memory.\n\t */\n\tset_bit(MMF_UNSTABLE, &mm->flags);\n\n\tfor (vma = mm->mmap ; vma; vma = vma->vm_next) {\n\t\tif (!can_madv_dontneed_vma(vma))\n\t\t\tcontinue;\n\n\t\t/*\n\t\t * Only anonymous pages have a good chance to be dropped\n\t\t * without additional steps which we cannot afford as we\n\t\t * are OOM already.\n\t\t *\n\t\t * We do not even care about fs backed pages because all\n\t\t * which are reclaimable have already been reclaimed and\n\t\t * we do not want to block exit_mmap by keeping mm ref\n\t\t * count elevated without a good reason.\n\t\t */\n\t\tif (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED)) {\n\t\t\ttlb_gather_mmu(&tlb, mm, vma->vm_start, vma->vm_end);\n\t\t\tunmap_page_range(&tlb, vma, vma->vm_start, vma->vm_end,\n\t\t\t\t\t NULL);\n\t\t\ttlb_finish_mmu(&tlb, vma->vm_start, vma->vm_end);\n\t\t}\n\t}\n\tpr_info(\"oom_reaper: reaped process %d (%s), now anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\\n\",\n\t\t\ttask_pid_nr(tsk), tsk->comm,\n\t\t\tK(get_mm_counter(mm, MM_ANONPAGES)),\n\t\t\tK(get_mm_counter(mm, MM_FILEPAGES)),\n\t\t\tK(get_mm_counter(mm, MM_SHMEMPAGES)));\n\tup_read(&mm->mmap_sem);\n\n\ttrace_finish_task_reaping(tsk->pid);\nunlock_oom:\n\tmutex_unlock(&oom_lock);\n\treturn ret;\n}\n\n#define MAX_OOM_REAP_RETRIES 10\nstatic void oom_reap_task(struct task_struct *tsk)\n{\n\tint attempts = 0;\n\tstruct mm_struct *mm = tsk->signal->oom_mm;\n\n\t/* Retry the down_read_trylock(mmap_sem) a few times */\n\twhile (attempts++ < MAX_OOM_REAP_RETRIES && !__oom_reap_task_mm(tsk, mm))\n\t\tschedule_timeout_idle(HZ/10);\n\n\tif (attempts <= MAX_OOM_REAP_RETRIES)\n\t\tgoto done;\n\n\n\tpr_info(\"oom_reaper: unable to reap pid:%d (%s)\\n\",\n\t\ttask_pid_nr(tsk), tsk->comm);\n\tdebug_show_all_locks();\n\ndone:\n\ttsk->oom_reaper_list = NULL;\n\n\t/*\n\t * Hide this mm from OOM killer because it has been either reaped or\n\t * somebody can't call up_write(mmap_sem).\n\t */\n\tset_bit(MMF_OOM_SKIP, &mm->flags);\n\n\t/* Drop a reference taken by wake_oom_reaper */\n\tput_task_struct(tsk);\n}\n\nstatic int oom_reaper(void *unused)\n{\n\twhile (true) {\n\t\tstruct task_struct *tsk = NULL;\n\n\t\twait_event_freezable(oom_reaper_wait, oom_reaper_list != NULL);\n\t\tspin_lock(&oom_reaper_lock);\n\t\tif (oom_reaper_list != NULL) {\n\t\t\ttsk = oom_reaper_list;\n\t\t\toom_reaper_list = tsk->oom_reaper_list;\n\t\t}\n\t\tspin_unlock(&oom_reaper_lock);\n\n\t\tif (tsk)\n\t\t\toom_reap_task(tsk);\n\t}\n\n\treturn 0;\n}\n\nstatic void wake_oom_reaper(struct task_struct *tsk)\n{\n\t/* tsk is already queued? */\n\tif (tsk == oom_reaper_list || tsk->oom_reaper_list)\n\t\treturn;\n\n\tget_task_struct(tsk);\n\n\tspin_lock(&oom_reaper_lock);\n\ttsk->oom_reaper_list = oom_reaper_list;\n\toom_reaper_list = tsk;\n\tspin_unlock(&oom_reaper_lock);\n\ttrace_wake_reaper(tsk->pid);\n\twake_up(&oom_reaper_wait);\n}\n\nstatic int __init oom_init(void)\n{\n\toom_reaper_th = kthread_run(oom_reaper, NULL, \"oom_reaper\");\n\treturn 0;\n}\nsubsys_initcall(oom_init)\n#else\nstatic inline void wake_oom_reaper(struct task_struct *tsk)\n{\n}\n#endif /* CONFIG_MMU */\n\n/**\n * mark_oom_victim - mark the given task as OOM victim\n * @tsk: task to mark\n *\n * Has to be called with oom_lock held and never after\n * oom has been disabled already.\n *\n * tsk->mm has to be non NULL and caller has to guarantee it is stable (either\n * under task_lock or operate on the current).\n */\nstatic void mark_oom_victim(struct task_struct *tsk)\n{\n\tstruct mm_struct *mm = tsk->mm;\n\n\tWARN_ON(oom_killer_disabled);\n\t/* OOM killer might race with memcg OOM */\n\tif (test_and_set_tsk_thread_flag(tsk, TIF_MEMDIE))\n\t\treturn;\n\n\t/* oom_mm is bound to the signal struct life time. */\n\tif (!cmpxchg(&tsk->signal->oom_mm, NULL, mm))\n\t\tmmgrab(tsk->signal->oom_mm);\n\n\t/*\n\t * Make sure that the task is woken up from uninterruptible sleep\n\t * if it is frozen because OOM killer wouldn't be able to free\n\t * any memory and livelock. freezing_slow_path will tell the freezer\n\t * that TIF_MEMDIE tasks should be ignored.\n\t */\n\t__thaw_task(tsk);\n\tatomic_inc(&oom_victims);\n\ttrace_mark_victim(tsk->pid);\n}\n\n/**\n * exit_oom_victim - note the exit of an OOM victim\n */\nvoid exit_oom_victim(void)\n{\n\tclear_thread_flag(TIF_MEMDIE);\n\n\tif (!atomic_dec_return(&oom_victims))\n\t\twake_up_all(&oom_victims_wait);\n}\n\n/**\n * oom_killer_enable - enable OOM killer\n */\nvoid oom_killer_enable(void)\n{\n\toom_killer_disabled = false;\n\tpr_info(\"OOM killer enabled.\\n\");\n}\n\n/**\n * oom_killer_disable - disable OOM killer\n * @timeout: maximum timeout to wait for oom victims in jiffies\n *\n * Forces all page allocations to fail rather than trigger OOM killer.\n * Will block and wait until all OOM victims are killed or the given\n * timeout expires.\n *\n * The function cannot be called when there are runnable user tasks because\n * the userspace would see unexpected allocation failures as a result. Any\n * new usage of this function should be consulted with MM people.\n *\n * Returns true if successful and false if the OOM killer cannot be\n * disabled.\n */\nbool oom_killer_disable(signed long timeout)\n{\n\tsigned long ret;\n\n\t/*\n\t * Make sure to not race with an ongoing OOM killer. Check that the\n\t * current is not killed (possibly due to sharing the victim's memory).\n\t */\n\tif (mutex_lock_killable(&oom_lock))\n\t\treturn false;\n\toom_killer_disabled = true;\n\tmutex_unlock(&oom_lock);\n\n\tret = wait_event_interruptible_timeout(oom_victims_wait,\n\t\t\t!atomic_read(&oom_victims), timeout);\n\tif (ret <= 0) {\n\t\toom_killer_enable();\n\t\treturn false;\n\t}\n\tpr_info(\"OOM killer disabled.\\n\");\n\n\treturn true;\n}\n\nstatic inline bool __task_will_free_mem(struct task_struct *task)\n{\n\tstruct signal_struct *sig = task->signal;\n\n\t/*\n\t * A coredumping process may sleep for an extended period in exit_mm(),\n\t * so the oom killer cannot assume that the process will promptly exit\n\t * and release memory.\n\t */\n\tif (sig->flags & SIGNAL_GROUP_COREDUMP)\n\t\treturn false;\n\n\tif (sig->flags & SIGNAL_GROUP_EXIT)\n\t\treturn true;\n\n\tif (thread_group_empty(task) && (task->flags & PF_EXITING))\n\t\treturn true;\n\n\treturn false;\n}\n\n/*\n * Checks whether the given task is dying or exiting and likely to\n * release its address space. This means that all threads and processes\n * sharing the same mm have to be killed or exiting.\n * Caller has to make sure that task->mm is stable (hold task_lock or\n * it operates on the current).\n */\nstatic bool task_will_free_mem(struct task_struct *task)\n{\n\tstruct mm_struct *mm = task->mm;\n\tstruct task_struct *p;\n\tbool ret = true;\n\n\t/*\n\t * Skip tasks without mm because it might have passed its exit_mm and\n\t * exit_oom_victim. oom_reaper could have rescued that but do not rely\n\t * on that for now. We can consider find_lock_task_mm in future.\n\t */\n\tif (!mm)\n\t\treturn false;\n\n\tif (!__task_will_free_mem(task))\n\t\treturn false;\n\n\t/*\n\t * This task has already been drained by the oom reaper so there are\n\t * only small chances it will free some more\n\t */\n\tif (test_bit(MMF_OOM_SKIP, &mm->flags))\n\t\treturn false;\n\n\tif (atomic_read(&mm->mm_users) <= 1)\n\t\treturn true;\n\n\t/*\n\t * Make sure that all tasks which share the mm with the given tasks\n\t * are dying as well to make sure that a) nobody pins its mm and\n\t * b) the task is also reapable by the oom reaper.\n\t */\n\trcu_read_lock();\n\tfor_each_process(p) {\n\t\tif (!process_shares_mm(p, mm))\n\t\t\tcontinue;\n\t\tif (same_thread_group(task, p))\n\t\t\tcontinue;\n\t\tret = __task_will_free_mem(p);\n\t\tif (!ret)\n\t\t\tbreak;\n\t}\n\trcu_read_unlock();\n\n\treturn ret;\n}\n\nstatic void oom_kill_process(struct oom_control *oc, const char *message)\n{\n\tstruct task_struct *p = oc->chosen;\n\tunsigned int points = oc->chosen_points;\n\tstruct task_struct *victim = p;\n\tstruct task_struct *child;\n\tstruct task_struct *t;\n\tstruct mm_struct *mm;\n\tunsigned int victim_points = 0;\n\tstatic DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,\n\t\t\t\t\t DEFAULT_RATELIMIT_BURST);\n\tbool can_oom_reap = true;\n\n\t/*\n\t * If the task is already exiting, don't alarm the sysadmin or kill\n\t * its children or threads, just give it access to memory reserves\n\t * so it can die quickly\n\t */\n\ttask_lock(p);\n\tif (task_will_free_mem(p)) {\n\t\tmark_oom_victim(p);\n\t\twake_oom_reaper(p);\n\t\ttask_unlock(p);\n\t\tput_task_struct(p);\n\t\treturn;\n\t}\n\ttask_unlock(p);\n\n\tif (__ratelimit(&oom_rs))\n\t\tdump_header(oc, p);\n\n\tpr_err(\"%s: Kill process %d (%s) score %u or sacrifice child\\n\",\n\t\tmessage, task_pid_nr(p), p->comm, points);\n\n\t/*\n\t * If any of p's children has a different mm and is eligible for kill,\n\t * the one with the highest oom_badness() score is sacrificed for its\n\t * parent. This attempts to lose the minimal amount of work done while\n\t * still freeing memory.\n\t */\n\tread_lock(&tasklist_lock);\n\tfor_each_thread(p, t) {\n\t\tlist_for_each_entry(child, &t->children, sibling) {\n\t\t\tunsigned int child_points;\n\n\t\t\tif (process_shares_mm(child, p->mm))\n\t\t\t\tcontinue;\n\t\t\t/*\n\t\t\t * oom_badness() returns 0 if the thread is unkillable\n\t\t\t */\n\t\t\tchild_points = oom_badness(child,\n\t\t\t\toc->memcg, oc->nodemask, oc->totalpages);\n\t\t\tif (child_points > victim_points) {\n\t\t\t\tput_task_struct(victim);\n\t\t\t\tvictim = child;\n\t\t\t\tvictim_points = child_points;\n\t\t\t\tget_task_struct(victim);\n\t\t\t}\n\t\t}\n\t}\n\tread_unlock(&tasklist_lock);\n\n\tp = find_lock_task_mm(victim);\n\tif (!p) {\n\t\tput_task_struct(victim);\n\t\treturn;\n\t} else if (victim != p) {\n\t\tget_task_struct(p);\n\t\tput_task_struct(victim);\n\t\tvictim = p;\n\t}\n\n\t/* Get a reference to safely compare mm after task_unlock(victim) */\n\tmm = victim->mm;\n\tmmgrab(mm);\n\n\t/* Raise event before sending signal: task reaper must see this */\n\tcount_vm_event(OOM_KILL);\n\tcount_memcg_event_mm(mm, OOM_KILL);\n\n\t/*\n\t * We should send SIGKILL before granting access to memory reserves\n\t * in order to prevent the OOM victim from depleting the memory\n\t * reserves from the user space under its control.\n\t */\n\tdo_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);\n\tmark_oom_victim(victim);\n\tpr_err(\"Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\\n\",\n\t\ttask_pid_nr(victim), victim->comm, K(victim->mm->total_vm),\n\t\tK(get_mm_counter(victim->mm, MM_ANONPAGES)),\n\t\tK(get_mm_counter(victim->mm, MM_FILEPAGES)),\n\t\tK(get_mm_counter(victim->mm, MM_SHMEMPAGES)));\n\ttask_unlock(victim);\n\n\t/*\n\t * Kill all user processes sharing victim->mm in other thread groups, if\n\t * any. They don't get access to memory reserves, though, to avoid\n\t * depletion of all memory. This prevents mm->mmap_sem livelock when an\n\t * oom killed thread cannot exit because it requires the semaphore and\n\t * its contended by another thread trying to allocate memory itself.\n\t * That thread will now get access to memory reserves since it has a\n\t * pending fatal signal.\n\t */\n\trcu_read_lock();\n\tfor_each_process(p) {\n\t\tif (!process_shares_mm(p, mm))\n\t\t\tcontinue;\n\t\tif (same_thread_group(p, victim))\n\t\t\tcontinue;\n\t\tif (is_global_init(p)) {\n\t\t\tcan_oom_reap = false;\n\t\t\tset_bit(MMF_OOM_SKIP, &mm->flags);\n\t\t\tpr_info(\"oom killer %d (%s) has mm pinned by %d (%s)\\n\",\n\t\t\t\t\ttask_pid_nr(victim), victim->comm,\n\t\t\t\t\ttask_pid_nr(p), p->comm);\n\t\t\tcontinue;\n\t\t}\n\t\t/*\n\t\t * No use_mm() user needs to read from the userspace so we are\n\t\t * ok to reap it.\n\t\t */\n\t\tif (unlikely(p->flags & PF_KTHREAD))\n\t\t\tcontinue;\n\t\tdo_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);\n\t}\n\trcu_read_unlock();\n\n\tif (can_oom_reap)\n\t\twake_oom_reaper(victim);\n\n\tmmdrop(mm);\n\tput_task_struct(victim);\n}\n#undef K\n\n/*\n * Determines whether the kernel must panic because of the panic_on_oom sysctl.\n */\nstatic void check_panic_on_oom(struct oom_control *oc,\n\t\t\t enum oom_constraint constraint)\n{\n\tif (likely(!sysctl_panic_on_oom))\n\t\treturn;\n\tif (sysctl_panic_on_oom != 2) {\n\t\t/*\n\t\t * panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel\n\t\t * does not panic for cpuset, mempolicy, or memcg allocation\n\t\t * failures.\n\t\t */\n\t\tif (constraint != CONSTRAINT_NONE)\n\t\t\treturn;\n\t}\n\t/* Do not panic for oom kills triggered by sysrq */\n\tif (is_sysrq_oom(oc))\n\t\treturn;\n\tdump_header(oc, NULL);\n\tpanic(\"Out of memory: %s panic_on_oom is enabled\\n\",\n\t\tsysctl_panic_on_oom == 2 ? \"compulsory\" : \"system-wide\");\n}\n\nstatic BLOCKING_NOTIFIER_HEAD(oom_notify_list);\n\nint register_oom_notifier(struct notifier_block *nb)\n{\n\treturn blocking_notifier_chain_register(&oom_notify_list, nb);\n}\nEXPORT_SYMBOL_GPL(register_oom_notifier);\n\nint unregister_oom_notifier(struct notifier_block *nb)\n{\n\treturn blocking_notifier_chain_unregister(&oom_notify_list, nb);\n}\nEXPORT_SYMBOL_GPL(unregister_oom_notifier);\n\n/**\n * out_of_memory - kill the \"best\" process when we run out of memory\n * @oc: pointer to struct oom_control\n *\n * If we run out of memory, we have the choice between either\n * killing a random task (bad), letting the system crash (worse)\n * OR try to be smart about which process to kill. Note that we\n * don't have to be perfect here, we just have to be good.\n */\nbool out_of_memory(struct oom_control *oc)\n{\n\tunsigned long freed = 0;\n\tenum oom_constraint constraint = CONSTRAINT_NONE;\n\n\tif (oom_killer_disabled)\n\t\treturn false;\n\n\tif (!is_memcg_oom(oc)) {\n\t\tblocking_notifier_call_chain(&oom_notify_list, 0, &freed);\n\t\tif (freed > 0)\n\t\t\t/* Got some memory back in the last second. */\n\t\t\treturn true;\n\t}\n\n\t/*\n\t * If current has a pending SIGKILL or is exiting, then automatically\n\t * select it. The goal is to allow it to allocate so that it may\n\t * quickly exit and free its memory.\n\t */\n\tif (task_will_free_mem(current)) {\n\t\tmark_oom_victim(current);\n\t\twake_oom_reaper(current);\n\t\treturn true;\n\t}\n\n\t/*\n\t * The OOM killer does not compensate for IO-less reclaim.\n\t * pagefault_out_of_memory lost its gfp context so we have to\n\t * make sure exclude 0 mask - all other users should have at least\n\t * ___GFP_DIRECT_RECLAIM to get here.\n\t */\n\tif (oc->gfp_mask && !(oc->gfp_mask & __GFP_FS))\n\t\treturn true;\n\n\t/*\n\t * Check if there were limitations on the allocation (only relevant for\n\t * NUMA and memcg) that may require different handling.\n\t */\n\tconstraint = constrained_alloc(oc);\n\tif (constraint != CONSTRAINT_MEMORY_POLICY)\n\t\toc->nodemask = NULL;\n\tcheck_panic_on_oom(oc, constraint);\n\n\tif (!is_memcg_oom(oc) && sysctl_oom_kill_allocating_task &&\n\t current->mm && !oom_unkillable_task(current, NULL, oc->nodemask) &&\n\t current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {\n\t\tget_task_struct(current);\n\t\toc->chosen = current;\n\t\toom_kill_process(oc, \"Out of memory (oom_kill_allocating_task)\");\n\t\treturn true;\n\t}\n\n\tselect_bad_process(oc);\n\t/* Found nothing?!?! Either we hang forever, or we panic. */\n\tif (!oc->chosen && !is_sysrq_oom(oc) && !is_memcg_oom(oc)) {\n\t\tdump_header(oc, NULL);\n\t\tpanic(\"Out of memory and no killable processes...\\n\");\n\t}\n\tif (oc->chosen && oc->chosen != (void *)-1UL) {\n\t\toom_kill_process(oc, !is_memcg_oom(oc) ? \"Out of memory\" :\n\t\t\t\t \"Memory cgroup out of memory\");\n\t\t/*\n\t\t * Give the killed process a good chance to exit before trying\n\t\t * to allocate memory again.\n\t\t */\n\t\tschedule_timeout_killable(1);\n\t}\n\treturn !!oc->chosen;\n}\n\n/*\n * The pagefault handler calls here because it is out of memory, so kill a\n * memory-hogging task. If oom_lock is held by somebody else, a parallel oom\n * killing is already in progress so do nothing.\n */\nvoid pagefault_out_of_memory(void)\n{\n\tstruct oom_control oc = {\n\t\t.zonelist = NULL,\n\t\t.nodemask = NULL,\n\t\t.memcg = NULL,\n\t\t.gfp_mask = 0,\n\t\t.order = 0,\n\t};\n\n\tif (mem_cgroup_oom_synchronize(true))\n\t\treturn;\n\n\tif (!mutex_trylock(&oom_lock))\n\t\treturn;\n\tout_of_memory(&oc);\n\tmutex_unlock(&oom_lock);\n}\n"},"func_before":{"kind":"string","value":"static bool __oom_reap_task_mm(struct task_struct *tsk, struct mm_struct *mm)\n{\n\tstruct mmu_gather tlb;\n\tstruct vm_area_struct *vma;\n\tbool ret = true;\n\n\t/*\n\t * We have to make sure to not race with the victim exit path\n\t * and cause premature new oom victim selection:\n\t * __oom_reap_task_mm\t\texit_mm\n\t * mmget_not_zero\n\t *\t\t\t\t mmput\n\t *\t\t\t\t atomic_dec_and_test\n\t *\t\t\t\t exit_oom_victim\n\t *\t\t\t\t[...]\n\t *\t\t\t\tout_of_memory\n\t *\t\t\t\t select_bad_process\n\t *\t\t\t\t # no TIF_MEMDIE task selects new victim\n\t * unmap_page_range # frees some memory\n\t */\n\tmutex_lock(&oom_lock);\n\n\tif (!down_read_trylock(&mm->mmap_sem)) {\n\t\tret = false;\n\t\ttrace_skip_task_reaping(tsk->pid);\n\t\tgoto unlock_oom;\n\t}\n\n\t/*\n\t * If the mm has notifiers then we would need to invalidate them around\n\t * unmap_page_range and that is risky because notifiers can sleep and\n\t * what they do is basically undeterministic. So let's have a short\n\t * sleep to give the oom victim some more time.\n\t * TODO: we really want to get rid of this ugly hack and make sure that\n\t * notifiers cannot block for unbounded amount of time and add\n\t * mmu_notifier_invalidate_range_{start,end} around unmap_page_range\n\t */\n\tif (mm_has_notifiers(mm)) {\n\t\tup_read(&mm->mmap_sem);\n\t\tschedule_timeout_idle(HZ);\n\t\tgoto unlock_oom;\n\t}\n\n\t/*\n\t * MMF_OOM_SKIP is set by exit_mmap when the OOM reaper can't\n\t * work on the mm anymore. The check for MMF_OOM_SKIP must run\n\t * under mmap_sem for reading because it serializes against the\n\t * down_write();up_write() cycle in exit_mmap().\n\t */\n\tif (test_bit(MMF_OOM_SKIP, &mm->flags)) {\n\t\tup_read(&mm->mmap_sem);\n\t\ttrace_skip_task_reaping(tsk->pid);\n\t\tgoto unlock_oom;\n\t}\n\n\ttrace_start_task_reaping(tsk->pid);\n\n\t/*\n\t * Tell all users of get_user/copy_from_user etc... that the content\n\t * is no longer stable. No barriers really needed because unmapping\n\t * should imply barriers already and the reader would hit a page fault\n\t * if it stumbled over a reaped memory.\n\t */\n\tset_bit(MMF_UNSTABLE, &mm->flags);\n\n\ttlb_gather_mmu(&tlb, mm, 0, -1);\n\tfor (vma = mm->mmap ; vma; vma = vma->vm_next) {\n\t\tif (!can_madv_dontneed_vma(vma))\n\t\t\tcontinue;\n\n\t\t/*\n\t\t * Only anonymous pages have a good chance to be dropped\n\t\t * without additional steps which we cannot afford as we\n\t\t * are OOM already.\n\t\t *\n\t\t * We do not even care about fs backed pages because all\n\t\t * which are reclaimable have already been reclaimed and\n\t\t * we do not want to block exit_mmap by keeping mm ref\n\t\t * count elevated without a good reason.\n\t\t */\n\t\tif (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED))\n\t\t\tunmap_page_range(&tlb, vma, vma->vm_start, vma->vm_end,\n\t\t\t\t\t NULL);\n\t}\n\ttlb_finish_mmu(&tlb, 0, -1);\n\tpr_info(\"oom_reaper: reaped process %d (%s), now anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\\n\",\n\t\t\ttask_pid_nr(tsk), tsk->comm,\n\t\t\tK(get_mm_counter(mm, MM_ANONPAGES)),\n\t\t\tK(get_mm_counter(mm, MM_FILEPAGES)),\n\t\t\tK(get_mm_counter(mm, MM_SHMEMPAGES)));\n\tup_read(&mm->mmap_sem);\n\n\ttrace_finish_task_reaping(tsk->pid);\nunlock_oom:\n\tmutex_unlock(&oom_lock);\n\treturn ret;\n}"},"func_after":{"kind":"string","value":"static bool __oom_reap_task_mm(struct task_struct *tsk, struct mm_struct *mm)\n{\n\tstruct mmu_gather tlb;\n\tstruct vm_area_struct *vma;\n\tbool ret = true;\n\n\t/*\n\t * We have to make sure to not race with the victim exit path\n\t * and cause premature new oom victim selection:\n\t * __oom_reap_task_mm\t\texit_mm\n\t * mmget_not_zero\n\t *\t\t\t\t mmput\n\t *\t\t\t\t atomic_dec_and_test\n\t *\t\t\t\t exit_oom_victim\n\t *\t\t\t\t[...]\n\t *\t\t\t\tout_of_memory\n\t *\t\t\t\t select_bad_process\n\t *\t\t\t\t # no TIF_MEMDIE task selects new victim\n\t * unmap_page_range # frees some memory\n\t */\n\tmutex_lock(&oom_lock);\n\n\tif (!down_read_trylock(&mm->mmap_sem)) {\n\t\tret = false;\n\t\ttrace_skip_task_reaping(tsk->pid);\n\t\tgoto unlock_oom;\n\t}\n\n\t/*\n\t * If the mm has notifiers then we would need to invalidate them around\n\t * unmap_page_range and that is risky because notifiers can sleep and\n\t * what they do is basically undeterministic. So let's have a short\n\t * sleep to give the oom victim some more time.\n\t * TODO: we really want to get rid of this ugly hack and make sure that\n\t * notifiers cannot block for unbounded amount of time and add\n\t * mmu_notifier_invalidate_range_{start,end} around unmap_page_range\n\t */\n\tif (mm_has_notifiers(mm)) {\n\t\tup_read(&mm->mmap_sem);\n\t\tschedule_timeout_idle(HZ);\n\t\tgoto unlock_oom;\n\t}\n\n\t/*\n\t * MMF_OOM_SKIP is set by exit_mmap when the OOM reaper can't\n\t * work on the mm anymore. The check for MMF_OOM_SKIP must run\n\t * under mmap_sem for reading because it serializes against the\n\t * down_write();up_write() cycle in exit_mmap().\n\t */\n\tif (test_bit(MMF_OOM_SKIP, &mm->flags)) {\n\t\tup_read(&mm->mmap_sem);\n\t\ttrace_skip_task_reaping(tsk->pid);\n\t\tgoto unlock_oom;\n\t}\n\n\ttrace_start_task_reaping(tsk->pid);\n\n\t/*\n\t * Tell all users of get_user/copy_from_user etc... that the content\n\t * is no longer stable. No barriers really needed because unmapping\n\t * should imply barriers already and the reader would hit a page fault\n\t * if it stumbled over a reaped memory.\n\t */\n\tset_bit(MMF_UNSTABLE, &mm->flags);\n\n\tfor (vma = mm->mmap ; vma; vma = vma->vm_next) {\n\t\tif (!can_madv_dontneed_vma(vma))\n\t\t\tcontinue;\n\n\t\t/*\n\t\t * Only anonymous pages have a good chance to be dropped\n\t\t * without additional steps which we cannot afford as we\n\t\t * are OOM already.\n\t\t *\n\t\t * We do not even care about fs backed pages because all\n\t\t * which are reclaimable have already been reclaimed and\n\t\t * we do not want to block exit_mmap by keeping mm ref\n\t\t * count elevated without a good reason.\n\t\t */\n\t\tif (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED)) {\n\t\t\ttlb_gather_mmu(&tlb, mm, vma->vm_start, vma->vm_end);\n\t\t\tunmap_page_range(&tlb, vma, vma->vm_start, vma->vm_end,\n\t\t\t\t\t NULL);\n\t\t\ttlb_finish_mmu(&tlb, vma->vm_start, vma->vm_end);\n\t\t}\n\t}\n\tpr_info(\"oom_reaper: reaped process %d (%s), now anon-rss:%lukB, file-rss:%lukB, shmem-rss:%lukB\\n\",\n\t\t\ttask_pid_nr(tsk), tsk->comm,\n\t\t\tK(get_mm_counter(mm, MM_ANONPAGES)),\n\t\t\tK(get_mm_counter(mm, MM_FILEPAGES)),\n\t\t\tK(get_mm_counter(mm, MM_SHMEMPAGES)));\n\tup_read(&mm->mmap_sem);\n\n\ttrace_finish_task_reaping(tsk->pid);\nunlock_oom:\n\tmutex_unlock(&oom_lock);\n\treturn ret;\n}"},"diff":{"kind":"string","value":"{'added': [(567, '\\t\\tif (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED)) {'), (568, '\\t\\t\\ttlb_gather_mmu(&tlb, mm, vma->vm_start, vma->vm_end);'), (571, '\\t\\t\\ttlb_finish_mmu(&tlb, vma->vm_start, vma->vm_end);'), (572, '\\t\\t}')], 'deleted': [(553, '\\ttlb_gather_mmu(&tlb, mm, 0, -1);'), (568, '\\t\\tif (vma_is_anonymous(vma) || !(vma->vm_flags & VM_SHARED))'), (572, '\\ttlb_finish_mmu(&tlb, 0, -1);')]}"},"num_lines_added":{"kind":"number","value":4,"string":"4"},"num_lines_deleted":{"kind":"number","value":3,"string":"3"},"num_lines_in_file":{"kind":"number","value":624,"string":"624"},"num_tokens_in_file":{"kind":"number","value":3414,"string":"3,414"},"num_lines_in_method":{"kind":"number","value":43,"string":"43"},"num_tokens_in_method":{"kind":"number","value":291,"string":"291"},"method_complexity":{"kind":"number","value":8,"string":"8"},"repo":{"kind":"string","value":"https://github.com/torvalds/linux"},"cve_id":{"kind":"string","value":"CVE-2017-18202"},"cwe_id":{"kind":"string","value":"CWE-416"}}},{"rowIdx":393,"cells":{"id":{"kind":"number","value":3174,"string":"3,174"},"file_name":{"kind":"string","value":"adaptmap_reg.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"main"},"code_before":{"kind":"string","value":"/*====================================================================*\n - Copyright (C) 2001 Leptonica. All rights reserved.\n -\n - Redistribution and use in source and binary forms, with or without\n - modification, are permitted provided that the following conditions\n - are met:\n - 1. Redistributions of source code must retain the above copyright\n - notice, this list of conditions and the following disclaimer.\n - 2. Redistributions in binary form must reproduce the above\n - copyright notice, this list of conditions and the following\n - disclaimer in the documentation and/or other materials\n - provided with the distribution.\n -\n - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY\n - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *====================================================================*/\n\n/*\n * adaptmap_reg.c\n *\n * Regression test demonstrating adaptive mappings in both gray and color\n */\n\n#ifdef HAVE_CONFIG_H\n#include \n#endif /* HAVE_CONFIG_H */\n\n#include \"allheaders.h\"\n\n /* Location of image region in wet-day.jpg */\nstatic const l_int32 XS = 151;\nstatic const l_int32 YS = 225;\nstatic const l_int32 WS = 913;\nstatic const l_int32 HS = 1285;\n\nstatic const l_int32 SIZE_X = 10;\nstatic const l_int32 SIZE_Y = 30;\nstatic const l_int32 BINTHRESH = 50;\nstatic const l_int32 MINCOUNT = 30;\n\nstatic const l_int32 BGVAL = 200;\nstatic const l_int32 SMOOTH_X = 2;\nstatic const l_int32 SMOOTH_Y = 1;\n\nint main(int argc,\n char **argv)\n{\nl_int32 w, h;\nPIX *pixs, *pixg, *pixim, *pixgm, *pixmi, *pix1, *pix2;\nPIX *pixmr, *pixmg, *pixmb, *pixmri, *pixmgi, *pixmbi;\nPIXA *pixa;\nL_REGPARAMS *rp;\n\n if (regTestSetup(argc, argv, &rp))\n return 1;\n\n lept_mkdir(\"lept/adapt\"); // REMOVE?\n\n pixs = pixRead(\"wet-day.jpg\");\n pixa = pixaCreate(0);\n pixg = pixConvertRGBToGray(pixs, 0.33, 0.34, 0.33);\n pixaAddPix(pixa, pixs, L_INSERT);\n pixaAddPix(pixa, pixg, L_INSERT);\n pixGetDimensions(pixs, &w, &h, NULL);\n\n /* Process in grayscale */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pixGetBackgroundGrayMap(pixg, pixim, SIZE_X, SIZE_Y,\n BINTHRESH, MINCOUNT, &pixgm);\n fprintf(stderr, \"Time for gray adaptmap gen: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixgm, IFF_PNG); /* 0 */\n pixaAddPix(pixa, pixgm, L_INSERT);\n\n startTimer();\n pixmi = pixGetInvBackgroundMap(pixgm, BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for gray inv map generation: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmi, IFF_PNG); /* 1 */\n pixaAddPix(pixa, pixmi, L_INSERT);\n\n startTimer();\n pix1 = pixApplyInvBackgroundGrayMap(pixg, pixmi, SIZE_X, SIZE_Y);\n fprintf(stderr, \"Time to apply gray inv map: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 2 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 3 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Process in color */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pixGetBackgroundRGBMap(pixs, pixim, NULL, SIZE_X, SIZE_Y,\n BINTHRESH, MINCOUNT,\n &pixmr, &pixmg, &pixmb);\n fprintf(stderr, \"Time for color adaptmap gen: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmr, IFF_PNG); /* 4 */\n regTestWritePixAndCheck(rp, pixmg, IFF_PNG); /* 5 */\n regTestWritePixAndCheck(rp, pixmb, IFF_PNG); /* 6 */\n pixaAddPix(pixa, pixmr, L_INSERT);\n pixaAddPix(pixa, pixmg, L_INSERT);\n pixaAddPix(pixa, pixmb, L_INSERT);\n\n startTimer();\n pixmri = pixGetInvBackgroundMap(pixmr, BGVAL, SMOOTH_X, SMOOTH_Y);\n pixmgi = pixGetInvBackgroundMap(pixmg, BGVAL, SMOOTH_X, SMOOTH_Y);\n pixmbi = pixGetInvBackgroundMap(pixmb, BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for color inv map generation: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmri, IFF_PNG); /* 7 */\n regTestWritePixAndCheck(rp, pixmgi, IFF_PNG); /* 8 */\n regTestWritePixAndCheck(rp, pixmbi, IFF_PNG); /* 9 */\n pixaAddPix(pixa, pixmri, L_INSERT);\n pixaAddPix(pixa, pixmgi, L_INSERT);\n pixaAddPix(pixa, pixmbi, L_INSERT);\n\n startTimer();\n pix1 = pixApplyInvBackgroundRGBMap(pixs, pixmri, pixmgi, pixmbi,\n SIZE_X, SIZE_Y);\n fprintf(stderr, \"Time to apply color inv maps: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 10 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 11 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Process at higher level in color */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pix1 = pixBackgroundNorm(pixs, pixim, NULL, 5, 10, BINTHRESH, 20,\n BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for bg normalization: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 12 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 13 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Display results */\n pix1 = pixaDisplayTiledAndScaled(pixa, 32, 400, 4, 0, 20, 2);\n pixWrite(\"/tmp/lept/adapt/results.jpg\", pix1, IFF_JFIF_JPEG);\n pixDisplayWithTitle(pix1, 100, 0, NULL, rp->display);\n pixDestroy(&pix1);\n pixaDestroy(&pixa);\n\n return regTestCleanup(rp);\n}\n\n"},"code_after":{"kind":"string","value":"/*====================================================================*\n - Copyright (C) 2001 Leptonica. All rights reserved.\n -\n - Redistribution and use in source and binary forms, with or without\n - modification, are permitted provided that the following conditions\n - are met:\n - 1. Redistributions of source code must retain the above copyright\n - notice, this list of conditions and the following disclaimer.\n - 2. Redistributions in binary form must reproduce the above\n - copyright notice, this list of conditions and the following\n - disclaimer in the documentation and/or other materials\n - provided with the distribution.\n -\n - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY\n - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *====================================================================*/\n\n/*\n * adaptmap_reg.c\n *\n * Regression test demonstrating adaptive mappings in both gray and color\n */\n\n#ifdef HAVE_CONFIG_H\n#include \n#endif /* HAVE_CONFIG_H */\n\n#include \"allheaders.h\"\n\n /* Location of image region in wet-day.jpg */\nstatic const l_int32 XS = 151;\nstatic const l_int32 YS = 225;\nstatic const l_int32 WS = 913;\nstatic const l_int32 HS = 1285;\n\nstatic const l_int32 SIZE_X = 10;\nstatic const l_int32 SIZE_Y = 30;\nstatic const l_int32 BINTHRESH = 50;\nstatic const l_int32 MINCOUNT = 30;\n\nstatic const l_int32 BGVAL = 200;\nstatic const l_int32 SMOOTH_X = 2;\nstatic const l_int32 SMOOTH_Y = 1;\n\nint main(int argc,\n char **argv)\n{\nl_int32 w, h;\nPIX *pixs, *pixg, *pixim, *pixgm, *pixmi, *pix1, *pix2;\nPIX *pixmr, *pixmg, *pixmb, *pixmri, *pixmgi, *pixmbi;\nPIXA *pixa, *pixa2;\nL_REGPARAMS *rp;\n\n if (regTestSetup(argc, argv, &rp))\n return 1;\n\n lept_mkdir(\"lept/adapt\"); // REMOVE?\n\n pixs = pixRead(\"wet-day.jpg\");\n pixa = pixaCreate(0);\n pixg = pixConvertRGBToGray(pixs, 0.33, 0.34, 0.33);\n pixaAddPix(pixa, pixs, L_INSERT);\n pixaAddPix(pixa, pixg, L_INSERT);\n pixGetDimensions(pixs, &w, &h, NULL);\n\n /* Process in grayscale */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pixGetBackgroundGrayMap(pixg, pixim, SIZE_X, SIZE_Y,\n BINTHRESH, MINCOUNT, &pixgm);\n fprintf(stderr, \"Time for gray adaptmap gen: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixgm, IFF_PNG); /* 0 */\n pixaAddPix(pixa, pixgm, L_INSERT);\n\n startTimer();\n pixmi = pixGetInvBackgroundMap(pixgm, BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for gray inv map generation: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmi, IFF_PNG); /* 1 */\n pixaAddPix(pixa, pixmi, L_INSERT);\n\n startTimer();\n pix1 = pixApplyInvBackgroundGrayMap(pixg, pixmi, SIZE_X, SIZE_Y);\n fprintf(stderr, \"Time to apply gray inv map: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 2 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 3 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Process in color */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pixGetBackgroundRGBMap(pixs, pixim, NULL, SIZE_X, SIZE_Y,\n BINTHRESH, MINCOUNT,\n &pixmr, &pixmg, &pixmb);\n fprintf(stderr, \"Time for color adaptmap gen: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmr, IFF_PNG); /* 4 */\n regTestWritePixAndCheck(rp, pixmg, IFF_PNG); /* 5 */\n regTestWritePixAndCheck(rp, pixmb, IFF_PNG); /* 6 */\n pixaAddPix(pixa, pixmr, L_INSERT);\n pixaAddPix(pixa, pixmg, L_INSERT);\n pixaAddPix(pixa, pixmb, L_INSERT);\n\n startTimer();\n pixmri = pixGetInvBackgroundMap(pixmr, BGVAL, SMOOTH_X, SMOOTH_Y);\n pixmgi = pixGetInvBackgroundMap(pixmg, BGVAL, SMOOTH_X, SMOOTH_Y);\n pixmbi = pixGetInvBackgroundMap(pixmb, BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for color inv map generation: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmri, IFF_PNG); /* 7 */\n regTestWritePixAndCheck(rp, pixmgi, IFF_PNG); /* 8 */\n regTestWritePixAndCheck(rp, pixmbi, IFF_PNG); /* 9 */\n pixaAddPix(pixa, pixmri, L_INSERT);\n pixaAddPix(pixa, pixmgi, L_INSERT);\n pixaAddPix(pixa, pixmbi, L_INSERT);\n\n startTimer();\n pix1 = pixApplyInvBackgroundRGBMap(pixs, pixmri, pixmgi, pixmbi,\n SIZE_X, SIZE_Y);\n fprintf(stderr, \"Time to apply color inv maps: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 10 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 11 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Process at higher level in color */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pix1 = pixBackgroundNorm(pixs, pixim, NULL, 5, 10, BINTHRESH, 20,\n BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for bg normalization: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 12 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 13 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Check pixFillMapHoles() */\n pixa2 = pixaCreate(3);\n pix1 = pixRead(\"weasel8.png\"); /* use this as the map */\n pixGammaTRC(pix1, pix1, 1.0, 0, 270); /* darken white pixels */\n pixaAddPix(pixa2, pix1, L_COPY);\n pixGetDimensions(pix1, &w, &h, NULL);\n pixRasterop(pix1, 0, 0, 5, h, PIX_SET, NULL, 0, 0); /* add white holes */\n pixRasterop(pix1, 20, 0, 2, h, PIX_SET, NULL, 0, 0);\n pixRasterop(pix1, 40, 0, 3, h, PIX_SET, NULL, 0, 0);\n pixRasterop(pix1, 0, 0, w, 3, PIX_SET, NULL, 0, 0);\n pixRasterop(pix1, 0, 15, w, 3, PIX_SET, NULL, 0, 0);\n pixRasterop(pix1, 0, 35, w, 2, PIX_SET, NULL, 0, 0);\n pixaAddPix(pixa2, pix1, L_COPY);\n pixFillMapHoles(pix1, w, h, L_FILL_WHITE);\n pixaAddPix(pixa2, pix1, L_INSERT);\n pix2 = pixaDisplayTiledInColumns(pixa2, 3, 1.0, 20, 1);\n regTestWritePixAndCheck(rp, pix2, IFF_PNG); /* 14 */\n pixDisplayWithTitle(pix2, 50, 850, NULL, rp->display);\n pixaDestroy(&pixa2);\n pixDestroy(&pix2);\n \n /* Display results */\n pix1 = pixaDisplayTiledAndScaled(pixa, 32, 400, 4, 0, 20, 2);\n pixWrite(\"/tmp/lept/adapt/results.jpg\", pix1, IFF_JFIF_JPEG);\n pixDisplayWithTitle(pix1, 50, 0, NULL, rp->display);\n pixDestroy(&pix1);\n pixaDestroy(&pixa);\n\n return regTestCleanup(rp);\n}\n\n"},"func_before":{"kind":"string","value":"int main(int argc,\n char **argv)\n{\nl_int32 w, h;\nPIX *pixs, *pixg, *pixim, *pixgm, *pixmi, *pix1, *pix2;\nPIX *pixmr, *pixmg, *pixmb, *pixmri, *pixmgi, *pixmbi;\nPIXA *pixa;\nL_REGPARAMS *rp;\n\n if (regTestSetup(argc, argv, &rp))\n return 1;\n\n lept_mkdir(\"lept/adapt\"); // REMOVE?\n\n pixs = pixRead(\"wet-day.jpg\");\n pixa = pixaCreate(0);\n pixg = pixConvertRGBToGray(pixs, 0.33, 0.34, 0.33);\n pixaAddPix(pixa, pixs, L_INSERT);\n pixaAddPix(pixa, pixg, L_INSERT);\n pixGetDimensions(pixs, &w, &h, NULL);\n\n /* Process in grayscale */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pixGetBackgroundGrayMap(pixg, pixim, SIZE_X, SIZE_Y,\n BINTHRESH, MINCOUNT, &pixgm);\n fprintf(stderr, \"Time for gray adaptmap gen: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixgm, IFF_PNG); /* 0 */\n pixaAddPix(pixa, pixgm, L_INSERT);\n\n startTimer();\n pixmi = pixGetInvBackgroundMap(pixgm, BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for gray inv map generation: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmi, IFF_PNG); /* 1 */\n pixaAddPix(pixa, pixmi, L_INSERT);\n\n startTimer();\n pix1 = pixApplyInvBackgroundGrayMap(pixg, pixmi, SIZE_X, SIZE_Y);\n fprintf(stderr, \"Time to apply gray inv map: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 2 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 3 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Process in color */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pixGetBackgroundRGBMap(pixs, pixim, NULL, SIZE_X, SIZE_Y,\n BINTHRESH, MINCOUNT,\n &pixmr, &pixmg, &pixmb);\n fprintf(stderr, \"Time for color adaptmap gen: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmr, IFF_PNG); /* 4 */\n regTestWritePixAndCheck(rp, pixmg, IFF_PNG); /* 5 */\n regTestWritePixAndCheck(rp, pixmb, IFF_PNG); /* 6 */\n pixaAddPix(pixa, pixmr, L_INSERT);\n pixaAddPix(pixa, pixmg, L_INSERT);\n pixaAddPix(pixa, pixmb, L_INSERT);\n\n startTimer();\n pixmri = pixGetInvBackgroundMap(pixmr, BGVAL, SMOOTH_X, SMOOTH_Y);\n pixmgi = pixGetInvBackgroundMap(pixmg, BGVAL, SMOOTH_X, SMOOTH_Y);\n pixmbi = pixGetInvBackgroundMap(pixmb, BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for color inv map generation: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmri, IFF_PNG); /* 7 */\n regTestWritePixAndCheck(rp, pixmgi, IFF_PNG); /* 8 */\n regTestWritePixAndCheck(rp, pixmbi, IFF_PNG); /* 9 */\n pixaAddPix(pixa, pixmri, L_INSERT);\n pixaAddPix(pixa, pixmgi, L_INSERT);\n pixaAddPix(pixa, pixmbi, L_INSERT);\n\n startTimer();\n pix1 = pixApplyInvBackgroundRGBMap(pixs, pixmri, pixmgi, pixmbi,\n SIZE_X, SIZE_Y);\n fprintf(stderr, \"Time to apply color inv maps: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 10 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 11 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Process at higher level in color */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pix1 = pixBackgroundNorm(pixs, pixim, NULL, 5, 10, BINTHRESH, 20,\n BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for bg normalization: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 12 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 13 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Display results */\n pix1 = pixaDisplayTiledAndScaled(pixa, 32, 400, 4, 0, 20, 2);\n pixWrite(\"/tmp/lept/adapt/results.jpg\", pix1, IFF_JFIF_JPEG);\n pixDisplayWithTitle(pix1, 100, 0, NULL, rp->display);\n pixDestroy(&pix1);\n pixaDestroy(&pixa);\n\n return regTestCleanup(rp);\n}"},"func_after":{"kind":"string","value":"int main(int argc,\n char **argv)\n{\nl_int32 w, h;\nPIX *pixs, *pixg, *pixim, *pixgm, *pixmi, *pix1, *pix2;\nPIX *pixmr, *pixmg, *pixmb, *pixmri, *pixmgi, *pixmbi;\nPIXA *pixa, *pixa2;\nL_REGPARAMS *rp;\n\n if (regTestSetup(argc, argv, &rp))\n return 1;\n\n lept_mkdir(\"lept/adapt\"); // REMOVE?\n\n pixs = pixRead(\"wet-day.jpg\");\n pixa = pixaCreate(0);\n pixg = pixConvertRGBToGray(pixs, 0.33, 0.34, 0.33);\n pixaAddPix(pixa, pixs, L_INSERT);\n pixaAddPix(pixa, pixg, L_INSERT);\n pixGetDimensions(pixs, &w, &h, NULL);\n\n /* Process in grayscale */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pixGetBackgroundGrayMap(pixg, pixim, SIZE_X, SIZE_Y,\n BINTHRESH, MINCOUNT, &pixgm);\n fprintf(stderr, \"Time for gray adaptmap gen: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixgm, IFF_PNG); /* 0 */\n pixaAddPix(pixa, pixgm, L_INSERT);\n\n startTimer();\n pixmi = pixGetInvBackgroundMap(pixgm, BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for gray inv map generation: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmi, IFF_PNG); /* 1 */\n pixaAddPix(pixa, pixmi, L_INSERT);\n\n startTimer();\n pix1 = pixApplyInvBackgroundGrayMap(pixg, pixmi, SIZE_X, SIZE_Y);\n fprintf(stderr, \"Time to apply gray inv map: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 2 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 3 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Process in color */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pixGetBackgroundRGBMap(pixs, pixim, NULL, SIZE_X, SIZE_Y,\n BINTHRESH, MINCOUNT,\n &pixmr, &pixmg, &pixmb);\n fprintf(stderr, \"Time for color adaptmap gen: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmr, IFF_PNG); /* 4 */\n regTestWritePixAndCheck(rp, pixmg, IFF_PNG); /* 5 */\n regTestWritePixAndCheck(rp, pixmb, IFF_PNG); /* 6 */\n pixaAddPix(pixa, pixmr, L_INSERT);\n pixaAddPix(pixa, pixmg, L_INSERT);\n pixaAddPix(pixa, pixmb, L_INSERT);\n\n startTimer();\n pixmri = pixGetInvBackgroundMap(pixmr, BGVAL, SMOOTH_X, SMOOTH_Y);\n pixmgi = pixGetInvBackgroundMap(pixmg, BGVAL, SMOOTH_X, SMOOTH_Y);\n pixmbi = pixGetInvBackgroundMap(pixmb, BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for color inv map generation: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pixmri, IFF_PNG); /* 7 */\n regTestWritePixAndCheck(rp, pixmgi, IFF_PNG); /* 8 */\n regTestWritePixAndCheck(rp, pixmbi, IFF_PNG); /* 9 */\n pixaAddPix(pixa, pixmri, L_INSERT);\n pixaAddPix(pixa, pixmgi, L_INSERT);\n pixaAddPix(pixa, pixmbi, L_INSERT);\n\n startTimer();\n pix1 = pixApplyInvBackgroundRGBMap(pixs, pixmri, pixmgi, pixmbi,\n SIZE_X, SIZE_Y);\n fprintf(stderr, \"Time to apply color inv maps: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 10 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 11 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Process at higher level in color */\n startTimer();\n pixim = pixCreate(w, h, 1);\n pixRasterop(pixim, XS, YS, WS, HS, PIX_SET, NULL, 0, 0);\n pix1 = pixBackgroundNorm(pixs, pixim, NULL, 5, 10, BINTHRESH, 20,\n BGVAL, SMOOTH_X, SMOOTH_Y);\n fprintf(stderr, \"Time for bg normalization: %7.3f\\n\", stopTimer());\n regTestWritePixAndCheck(rp, pix1, IFF_JFIF_JPEG); /* 12 */\n pixaAddPix(pixa, pix1, L_INSERT);\n\n pix2 = pixGammaTRCMasked(NULL, pix1, pixim, 1.0, 0, 190);\n pixInvert(pixim, pixim);\n pixGammaTRCMasked(pix2, pix2, pixim, 1.0, 60, 190);\n regTestWritePixAndCheck(rp, pix2, IFF_JFIF_JPEG); /* 13 */\n pixaAddPix(pixa, pix2, L_INSERT);\n pixDestroy(&pixim);\n\n /* Check pixFillMapHoles() */\n pixa2 = pixaCreate(3);\n pix1 = pixRead(\"weasel8.png\"); /* use this as the map */\n pixGammaTRC(pix1, pix1, 1.0, 0, 270); /* darken white pixels */\n pixaAddPix(pixa2, pix1, L_COPY);\n pixGetDimensions(pix1, &w, &h, NULL);\n pixRasterop(pix1, 0, 0, 5, h, PIX_SET, NULL, 0, 0); /* add white holes */\n pixRasterop(pix1, 20, 0, 2, h, PIX_SET, NULL, 0, 0);\n pixRasterop(pix1, 40, 0, 3, h, PIX_SET, NULL, 0, 0);\n pixRasterop(pix1, 0, 0, w, 3, PIX_SET, NULL, 0, 0);\n pixRasterop(pix1, 0, 15, w, 3, PIX_SET, NULL, 0, 0);\n pixRasterop(pix1, 0, 35, w, 2, PIX_SET, NULL, 0, 0);\n pixaAddPix(pixa2, pix1, L_COPY);\n pixFillMapHoles(pix1, w, h, L_FILL_WHITE);\n pixaAddPix(pixa2, pix1, L_INSERT);\n pix2 = pixaDisplayTiledInColumns(pixa2, 3, 1.0, 20, 1);\n regTestWritePixAndCheck(rp, pix2, IFF_PNG); /* 14 */\n pixDisplayWithTitle(pix2, 50, 850, NULL, rp->display);\n pixaDestroy(&pixa2);\n pixDestroy(&pix2);\n \n /* Display results */\n pix1 = pixaDisplayTiledAndScaled(pixa, 32, 400, 4, 0, 20, 2);\n pixWrite(\"/tmp/lept/adapt/results.jpg\", pix1, IFF_JFIF_JPEG);\n pixDisplayWithTitle(pix1, 50, 0, NULL, rp->display);\n pixDestroy(&pix1);\n pixaDestroy(&pixa);\n\n return regTestCleanup(rp);\n}"},"diff":{"kind":"string","value":"{'added': [(60, 'PIXA *pixa, *pixa2;'), (162, ' /* Check pixFillMapHoles() */'), (163, ' pixa2 = pixaCreate(3);'), (164, ' pix1 = pixRead(\"weasel8.png\"); /* use this as the map */'), (165, ' pixGammaTRC(pix1, pix1, 1.0, 0, 270); /* darken white pixels */'), (166, ' pixaAddPix(pixa2, pix1, L_COPY);'), (167, ' pixGetDimensions(pix1, &w, &h, NULL);'), (168, ' pixRasterop(pix1, 0, 0, 5, h, PIX_SET, NULL, 0, 0); /* add white holes */'), (169, ' pixRasterop(pix1, 20, 0, 2, h, PIX_SET, NULL, 0, 0);'), (170, ' pixRasterop(pix1, 40, 0, 3, h, PIX_SET, NULL, 0, 0);'), (171, ' pixRasterop(pix1, 0, 0, w, 3, PIX_SET, NULL, 0, 0);'), (172, ' pixRasterop(pix1, 0, 15, w, 3, PIX_SET, NULL, 0, 0);'), (173, ' pixRasterop(pix1, 0, 35, w, 2, PIX_SET, NULL, 0, 0);'), (174, ' pixaAddPix(pixa2, pix1, L_COPY);'), (175, ' pixFillMapHoles(pix1, w, h, L_FILL_WHITE);'), (176, ' pixaAddPix(pixa2, pix1, L_INSERT);'), (177, ' pix2 = pixaDisplayTiledInColumns(pixa2, 3, 1.0, 20, 1);'), (178, ' regTestWritePixAndCheck(rp, pix2, IFF_PNG); /* 14 */'), (179, ' pixDisplayWithTitle(pix2, 50, 850, NULL, rp->display);'), (180, ' pixaDestroy(&pixa2);'), (181, ' pixDestroy(&pix2);'), (182, ''), (186, ' pixDisplayWithTitle(pix1, 50, 0, NULL, rp->display);')], 'deleted': [(60, 'PIXA *pixa;'), (165, ' pixDisplayWithTitle(pix1, 100, 0, NULL, rp->display);')]}"},"num_lines_added":{"kind":"number","value":23,"string":"23"},"num_lines_deleted":{"kind":"number","value":2,"string":"2"},"num_lines_in_file":{"kind":"number","value":130,"string":"130"},"num_tokens_in_file":{"kind":"number","value":1305,"string":"1,305"},"num_lines_in_method":{"kind":"number","value":98,"string":"98"},"num_tokens_in_method":{"kind":"number","value":961,"string":"961"},"method_complexity":{"kind":"number","value":2,"string":"2"},"repo":{"kind":"string","value":"https://github.com/DanBloomberg/leptonica"},"cve_id":{"kind":"string","value":"CVE-2020-36279"},"cwe_id":{"kind":"string","value":"CWE-125"}}},{"rowIdx":394,"cells":{"id":{"kind":"number","value":1881,"string":"1,881"},"file_name":{"kind":"string","value":"elf.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"init_shdr"},"code_before":{"kind":"string","value":"/* radare - LGPL - Copyright 2008-2022 - nibble, pancake, alvaro_fe */\n\n#define R_LOG_ORIGIN \"elf\"\n#include \n#include \n#include \"elf.h\"\n\n#define MIPS_PLT_OFFSET 0x20\n#define RISCV_PLT_OFFSET 0x20\n#define LOONGARCH_PLT_OFFSET 0x20\n\n#define RISCV_PLT_ENTRY_SIZE 0x10\n#define LOONGARCH_PLT_ENTRY_SIZE 0x10\n#define X86_PLT_ENTRY_SIZE 0x10\n\n#define SPARC_OFFSET_PLT_ENTRY_FROM_GOT_ADDR -0x6\n#define X86_OFFSET_PLT_ENTRY_FROM_GOT_ADDR -0x6\n\n#define ELF_PAGE_MASK 0xFFFFFFFFFFFFF000LL\n#define ELF_PAGE_SIZE 12\n\n#define R_ELF_NO_RELRO 0\n#define R_ELF_PART_RELRO 1\n#define R_ELF_FULL_RELRO 2\n\n#define MAX_REL_RELA_SZ (sizeof (Elf_(Rel)) > sizeof (Elf_(Rela))? sizeof (Elf_(Rel)): sizeof (Elf_(Rela)))\n\n#define READ8(x, i) r_read_ble8((x) + (i)); (i) += 1\n#define READ16(x, i) r_read_ble16((x) + (i), bin->endian); (i) += 2\n#define READ32(x, i) r_read_ble32((x) + (i), bin->endian); (i) += 4\n#define READ64(x, i) r_read_ble64((x) + (i), bin->endian); (i) += 8\n\n#define BREAD8(x, i) r_buf_read_ble8_at (x, i); (i) += 1\n#define BREAD16(x, i) r_buf_read_ble16_at (x, i, bin->endian); (i) += 2\n#define BREAD32(x, i) r_buf_read_ble32_at (x, i, bin->endian); (i) += 4\n#define BREAD64(x, i) r_buf_read_ble64_at (x, i, bin->endian); (i) += 8\n\n#define NUMENTRIES_ROUNDUP(sectionsize, entrysize) (((sectionsize) + (entrysize)-1) / (entrysize))\n#define COMPUTE_PLTGOT_POSITION(rel, pltgot_addr, n_initial_unused_entries) \\\n\t((rel->rva - pltgot_addr - n_initial_unused_entries * R_BIN_ELF_WORDSIZE) / R_BIN_ELF_WORDSIZE)\n\n#define GROWTH_FACTOR (1.5)\n\n#define round_up(a) ((((a) + (4) - (1)) / (4)) * (4))\n\n#define EF_MIPS_ABI_O32\t\t0x00001000 /* O32 ABI. */\n#define EF_MIPS_ABI_O64\t\t0x00002000 /* O32 extended for 64 bit. */\n#define EF_MIPS_ABI\t\t\t0x0000f000\n\nstatic inline bool is_elfclass64(Elf_(Ehdr) *h) {\n\treturn h->e_ident[EI_CLASS] == ELFCLASS64;\n}\n\nstatic bool is_mips_o32(Elf_(Ehdr) *h) {\n\tif (h->e_ident[EI_CLASS] != ELFCLASS32) {\n\t\treturn false;\n\t}\n\tif ((h->e_flags & EF_MIPS_ABI2) != 0) {\n\t\treturn false;\n\t}\n\tif (((h->e_flags & EF_MIPS_ABI) != 0) &&\n\t\t((h->e_flags & EF_MIPS_ABI) != EF_MIPS_ABI_O32)) {\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nstatic bool is_mips_n32(Elf_(Ehdr) *h) {\n\tif (h->e_ident[EI_CLASS] != ELFCLASS32) {\n\t\treturn false;\n\t}\n\tif (((h->e_flags & EF_MIPS_ABI2) == 0) ||\n\t\t((h->e_flags & EF_MIPS_ABI) != 0)) {\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nenum {\n\tX86,\n\tX86_64,\n\tARM,\n\tAARCH64,\n\tRCE,\n\tARCH_LEN\n};\n\ntypedef struct reginfo {\n\tut32 regsize;\n\tut32 regdelta;\n} reginfo_t;\n\nstatic reginfo_t reginf[ARCH_LEN] = {\n\t{ 160, 0x5c },\n\t{ 216, 0x84 },\n\t{ 72, 0x5c },\n\t{ 272, 0x84 },\n\t{ 272, 0x84 }\n};\n\nstatic inline int __strnlen(const char *str, int len) {\n\tint l = 0;\n\twhile (IS_PRINTABLE (*str) && --len) {\n\t\tif (((ut8)*str) == 0xff) {\n\t\t\tbreak;\n\t\t}\n\t\tstr++;\n\t\tl++;\n\t}\n\treturn l + 1;\n}\n\nstatic bool is_bin_etrel(ELFOBJ *bin) {\n\treturn bin->ehdr.e_type == ET_REL;\n}\n\nstatic bool __is_valid_ident(ELFOBJ *bin) {\n\treturn !strncmp ((char *)bin->ehdr.e_ident, ELFMAG, SELFMAG) ||\n\t\t!strncmp ((char *)bin->ehdr.e_ident, CGCMAG, SCGCMAG);\n}\n\nstatic bool init_ehdr(ELFOBJ *bin) {\n\tut8 e_ident[EI_NIDENT];\n\tut8 ehdr[sizeof (Elf_(Ehdr))] = {0};\n\tint i, len;\n\tif (r_buf_read_at (bin->b, 0, e_ident, EI_NIDENT) == -1) {\n\t\tR_LOG_ERROR (\"read (magic)\");\n\t\treturn false;\n\t}\n\tsdb_set (bin->kv, \"elf_type.cparse\", \"enum elf_type { ET_NONE=0, ET_REL=1,\"\n\t\t\t\" ET_EXEC=2, ET_DYN=3, ET_CORE=4, ET_LOOS=0xfe00, ET_HIOS=0xfeff,\"\n\t\t\t\" ET_LOPROC=0xff00, ET_HIPROC=0xffff };\", 0);\n\tsdb_set (bin->kv, \"elf_machine.cparse\", \"enum elf_machine {EM_NONE=0, EM_M32=1,\"\n\t\t\t\" EM_SPARC=2, EM_386=3, EM_68K=4, EM_88K=5, EM_IAMCU=6, EM_860=7, EM_MIPS=8,\"\n\t\t\t\" EM_S370=9, EM_MIPS_RS3_LE=10, EM_RS6000=11, EM_PARISC=15, EM_nCUBE=16,\"\n\t\t\t\" EM_VPP500=17, EM_SPARC32PLUS=18, EM_960=19, EM_PPC=20, EM_PPC64=21, EM_S390=22,\"\n\t\t\t\" EM_SPU=23, EM_V800=36, EM_FR20=37, EM_RH32=38, EM_RCE=39, EM_ARM=40,\"\n\t\t\t\" EM_ALPHA=41, EM_SH=42, EM_SPARCV9=43, EM_TRICORE=44, EM_ARC=45, EM_H8_300=46,\"\n\t\t\t\" EM_H8_300H=47, EM_H8S=48, EM_H8_500=49, EM_IA_64=50, EM_MIPS_X=51,\"\n\t\t\t\" EM_COLDFIRE=52, EM_68HC12=53, EM_MMA=54, EM_PCP=55, EM_NCPU=56, EM_NDR1=57,\"\n\t\t\t\" EM_STARCORE=58, EM_ME16=59, EM_ST100=60, EM_TINYJ=61, EM_X86_64=62, EM_PDSP=63,\"\n\t\t\t\" EM_PDP10=64, EM_PDP11=65, EM_FX66=66, EM_ST9PLUS=67, EM_ST7=68, EM_68HC16=69,\"\n\t\t\t\" EM_68HC11=70, EM_68HC08=71, EM_68HC05=72, EM_SVX=73, EM_ST19=74, EM_VAX=75,\"\n\t\t\t\" EM_CRIS=76, EM_JAVELIN=77, EM_FIREPATH=78, EM_ZSP=79, EM_MMIX=80, EM_HUANY=81,\"\n\t\t\t\" EM_PRISM=82, EM_AVR=83, EM_FR30=84, EM_D10V=85, EM_D30V=86, EM_V850=87,\"\n\t\t\t\" EM_M32R=88, EM_MN10300=89, EM_MN10200=90, EM_PJ=91, EM_OPENRISC=92,\"\n\t\t\t\" EM_ARC_COMPACT=93, EM_XTENSA=94, EM_VIDEOCORE=95, EM_TMM_GPP=96, EM_NS32K=97,\"\n\t\t\t\" EM_TPC=98, EM_SNP1K=99, EM_ST200=100, EM_IP2K=101, EM_MAX=102, EM_CR=103,\"\n\t\t\t\" EM_F2MC16=104, EM_MSP430=105, EM_BLACKFIN=106, EM_SE_C33=107, EM_SEP=108,\"\n\t\t\t\" EM_ARCA=109, EM_UNICORE=110, EM_EXCESS=111, EM_DXP=112, EM_ALTERA_NIOS2=113,\"\n\t\t\t\" EM_CRX=114, EM_XGATE=115, EM_C166=116, EM_M16C=117, EM_DSPIC30F=118, EM_CE=119,\"\n\t\t\t\" EM_M32C=120, EM_TSK3000=131, EM_RS08=132, EM_SHARC=133, EM_ECOG2=134,\"\n\t\t\t\" EM_SCORE7=135, EM_DSP24=136, EM_VIDEOCORE3=137, EM_LATTICEMICO32=138,\"\n\t\t\t\" EM_SE_C17=139, EM_TI_C6000=140, EM_TI_C2000=141, EM_TI_C5500=142,\"\n\t\t\t\" EM_TI_ARP32=143, EM_TI_PRU=144,\"\n\t\t\t\" EM_MMDSP_PLUS=160, EM_CYPRESS_M8C=161, EM_R32C=162, EM_TRIMEDIA=163,\"\n\t\t\t\" EM_QDSP6=164, EM_8051=165, EM_STXP7X=166, EM_NDS32=167,\"\n\t\t\t\" EM_ECOG1X=168, EM_MAXQ30=169, EM_XIMO16=170, EM_MANIK=171, EM_CRAYNV2=172,\"\n\t\t\t\" EM_RX=173, EM_METAG=174, EM_MCST_ELBRUS=175, EM_ECOG16=176, EM_CR16=177,\"\n\t\t\t\" EM_ETPU=178, EM_SLE9X=179, EM_L10M=180, EM_K10M=181, EM_AARCH64=183,\"\n\t\t\t\" EM_AVR32=185, EM_STM8=186, EM_TILE64=187, EM_TILEPRO=188, EM_CUDA=190,\"\n\t\t\t\" EM_TILEGX=191, EM_CLOUDSHIELD=192, EM_COREA_1ST=193, EM_COREA_2ND=194,\"\n\t\t\t\" EM_ARC_COMPACT2=195, EM_OPEN8=196, EM_RL78=197, EM_VIDEOCORE5=198,\"\n\t\t\t\" EM_78KOR=199, EM_56800EX=200, EM_BA1=201, EM_BA2=202, EM_XCORE=203,\"\n\t\t\t\" EM_MCHP_PIC=204, EM_INTEL205=205, EM_INTEL206=206, EM_INTEL207=207,\"\n\t\t\t\" EM_INTEL208=208, EM_INTEL209=209, EM_KM32=210, EM_KMX32=211, EM_KMX16=212,\"\n\t\t\t\" EM_KMX8=213, EM_KVARC=214, EM_CDP=215, EM_COGE=216, EM_COOL=217, EM_NORC=218,\"\n\t\t\t\" EM_CSR_KALIMBA=219, EM_AMDGPU=224, EM_RISCV=243, EM_LANAI=244, EM_BPF=247,\"\n\t\t\t\" EM_CSKY=252, EM_KVX=256, EM_LOONGARCH=258}\", 0);\n\tsdb_set (bin->kv, \"elf_class.cparse\", \"enum elf_class {ELFCLASSNONE=0, ELFCLASS32=1, ELFCLASS64=2};\", 0);\n\tsdb_set (bin->kv, \"elf_data.cparse\", \"enum elf_data {ELFDATANONE=0, ELFDATA2LSB=1, ELFDATA2MSB=2};\", 0);\n\tsdb_set (bin->kv, \"elf_hdr_version.cparse\", \"enum elf_hdr_version {EV_NONE=0, EV_CURRENT=1};\", 0);\n\tsdb_set (bin->kv, \"elf_obj_version.cparse\", \"enum elf_obj_version {EV_NONE=0, EV_CURRENT=1};\", 0);\n\tsdb_num_set (bin->kv, \"elf_header.offset\", 0, 0);\n\tsdb_num_set (bin->kv, \"elf_header.size\", sizeof (Elf_(Ehdr)), 0);\n\tsdb_set (bin->kv, \"elf_ident.format\", \"[4]z[1]E[1]E[1]E.::\"\n\t\t\t\" magic (elf_class)class (elf_data)data (elf_hdr_version)version\", 0);\n#if R_BIN_ELF64\n\tsdb_set (bin->kv, \"elf_header.format\", \"?[2]E[2]E[4]EqqqxN2N2N2N2N2N2\"\n\t\t\t\" (elf_ident)ident (elf_type)type (elf_machine)machine (elf_obj_version)version\"\n\t\t\t\" entry phoff shoff flags ehsize phentsize phnum shentsize shnum shstrndx\", 0);\n#else\n\tsdb_set (bin->kv, \"elf_header.format\", \"?[2]E[2]E[4]ExxxxN2N2N2N2N2N2\"\n\t\t\t\" (elf_ident)ident (elf_type)type (elf_machine)machine (elf_obj_version)version\"\n\t\t\t\" entry phoff shoff flags ehsize phentsize phnum shentsize shnum shstrndx\", 0);\n#endif\n\tbin->endian = (e_ident[EI_DATA] == ELFDATA2MSB)? 1: 0;\n\tmemset (&bin->ehdr, 0, sizeof (Elf_(Ehdr)));\n\tlen = r_buf_read_at (bin->b, 0, ehdr, sizeof (ehdr));\n\tif (len < 32) { // tinyelf != sizeof (Elf_(Ehdr))) {\n\t\tR_LOG_ERROR (\"read (ehdr)\");\n\t\treturn false;\n\t}\n\t// XXX no need to check twice\n\tmemcpy (&bin->ehdr.e_ident, ehdr, 16);\n\tif (!__is_valid_ident (bin)) {\n\t\treturn false;\n\t}\n\ti = 16;\n\t// TODO: use r_read or r_buf_read_ apis instead\n\tbin->ehdr.e_type = READ16 (ehdr, i);\n\tbin->ehdr.e_machine = READ16 (ehdr, i);\n\tbin->ehdr.e_version = READ32 (ehdr, i);\n#if R_BIN_ELF64\n\tbin->ehdr.e_entry = READ64 (ehdr, i);\n\tbin->ehdr.e_phoff = READ64 (ehdr, i);\n\tbin->ehdr.e_shoff = READ64 (ehdr, i);\n#else\n\tbin->ehdr.e_entry = READ32 (ehdr, i);\n\tbin->ehdr.e_phoff = READ32 (ehdr, i);\n\tbin->ehdr.e_shoff = READ32 (ehdr, i);\n#endif\n\tbin->ehdr.e_flags = READ32 (ehdr, i);\n\tbin->ehdr.e_ehsize = READ16 (ehdr, i);\n\tbin->ehdr.e_phentsize = READ16 (ehdr, i);\n\tbin->ehdr.e_phnum = READ16 (ehdr, i);\n\tbin->ehdr.e_shentsize = READ16 (ehdr, i);\n\tbin->ehdr.e_shnum = READ16 (ehdr, i);\n\tbin->ehdr.e_shstrndx = READ16 (ehdr, i);\n\treturn true;\n\t// [Outdated] Usage example:\n\t// > td `k bin/cur/info/elf_type.cparse`; td `k bin/cur/info/elf_machine.cparse`\n\t// > pf `k bin/cur/info/elf_header.format` @ `k bin/cur/info/elf_header.offset`\n}\n\nut64 Elf_(r_bin_elf_get_phnum)(ELFOBJ *obj) {\n\tr_return_val_if_fail (obj, 0);\n\tut64 num = obj->ehdr.e_phnum & UT16_MAX;\n\tif (obj->ehdr.e_phnum == 0xffff) {\n\t\tut32 shnum = obj->ehdr.e_shnum;\n\t\t// sh_info member of the initial entry in section header table.\n\t\tif (shnum > 0) {\n\t\t\tut32 shoff = obj->ehdr.e_shoff;\n\t\t\tElf_(Shdr) shdr = {0};\n\t\t\t(void)r_buf_read_at (obj->b, shoff, (ut8 *)&shdr, sizeof (shdr));\n\t\t\tnum = shdr.sh_info;\n\t\t\tif ((int)(shdr.sh_info) < 1) {\n\t\t\t\treturn UT16_MAX;\n\t\t\t}\n\t\t}\n\t}\n\treturn num;\n}\n\nstatic bool read_phdr(ELFOBJ *bin, bool linux_kernel_hack) {\n\tbool phdr_found = false;\n\tint i;\n#if R_BIN_ELF64\n\tconst bool is_elf64 = true;\n#else\n\tconst bool is_elf64 = false;\n#endif\n\tut64 phnum = Elf_(r_bin_elf_get_phnum) (bin);\n\tfor (i = 0; i < phnum; i++) {\n\t\tut8 phdr[sizeof (Elf_(Phdr))] = {0};\n\t\tint j = 0;\n\t\tconst size_t rsize = bin->ehdr.e_phoff + i * sizeof (Elf_(Phdr));\n\t\tint len = r_buf_read_at (bin->b, rsize, phdr, sizeof (Elf_(Phdr)));\n\t\tif (len < 1) {\n\t\t\tR_LOG_ERROR (\"read (phdr)\");\n\t\t\tR_FREE (bin->phdr);\n\t\t\treturn false;\n\t\t}\n\t\tbin->phdr[i].p_type = READ32 (phdr, j);\n\t\tif (bin->phdr[i].p_type == PT_PHDR) {\n\t\t\tphdr_found = true;\n\t\t}\n\n\t\tif (is_elf64) {\n\t\t\tbin->phdr[i].p_flags = READ32 (phdr, j);\n\t\t}\n\t\tbin->phdr[i].p_offset = R_BIN_ELF_READWORD (phdr, j);\n\t\tbin->phdr[i].p_vaddr = R_BIN_ELF_READWORD (phdr, j);\n\t\tbin->phdr[i].p_paddr = R_BIN_ELF_READWORD (phdr, j);\n\t\tbin->phdr[i].p_filesz = R_BIN_ELF_READWORD (phdr, j);\n\t\tbin->phdr[i].p_memsz = R_BIN_ELF_READWORD (phdr, j);\n\t\tif (!is_elf64) {\n\t\t\tbin->phdr[i].p_flags = READ32 (phdr, j);\n\t\t//\tbin->phdr[i].p_flags |= 1; tiny.elf needs this somehow :? LOAD0 is always +x for linux?\n\t\t}\n\t\tbin->phdr[i].p_align = R_BIN_ELF_READWORD (phdr, j);\n\t}\n\t/* Here is the where all the fun starts.\n\t * Linux kernel since 2005 calculates phdr offset wrongly\n\t * adding it to the load address (va of the LOAD0).\n\t * See `fs/binfmt_elf.c` file this line:\n\t * NEW_AUX_ENT(AT_PHDR, load_addr + exec->e_phoff);\n\t * So after the first read, we fix the address and read it again\n\t */\n\tif (linux_kernel_hack && phdr_found) {\n\t\tut64 load_addr = Elf_(r_bin_elf_get_baddr) (bin);\n\t\tbin->ehdr.e_phoff = Elf_(r_bin_elf_v2p) (bin, load_addr + bin->ehdr.e_phoff);\n\t\treturn read_phdr (bin, false);\n\t}\n\n\treturn true;\n}\n\nstatic int init_phdr(ELFOBJ *bin) {\n\tut32 phdr_size;\n\n\tr_return_val_if_fail (bin && !bin->phdr, false);\n\n\tif (!bin->ehdr.e_phnum) {\n\t\treturn false;\n\t}\n\tif (!UT32_MUL (&phdr_size, (ut32)bin->ehdr.e_phnum, sizeof (Elf_(Phdr)))) {\n\t\treturn false;\n\t}\n\tif (!phdr_size) {\n\t\treturn false;\n\t}\n\tif (phdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (phdr_size > (ut32)bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_phoff > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_phoff + phdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tut64 phnum = Elf_(r_bin_elf_get_phnum) (bin);\n\tif (!(bin->phdr = R_NEWS0 (Elf_(Phdr), phnum))) {\n\t\tr_sys_perror (\"malloc (phdr)\");\n\t\treturn false;\n\t}\n\n\tbool linux_kern_hack = false;\n\t/* Enable this hack only for the X86 64bit ELFs */\n\tconst int _128K = 1024 * 128;\n\tif (r_buf_size (bin->b) > _128K && (bin->ehdr.e_machine == EM_X86_64 || bin->ehdr.e_machine == EM_386)) {\n\t\tlinux_kern_hack = true;\n\t}\n\tif (!read_phdr (bin, linux_kern_hack)) {\n\t\treturn false;\n\t}\n\n\tsdb_num_set (bin->kv, \"elf_phdr.offset\", bin->ehdr.e_phoff, 0);\n\tsdb_num_set (bin->kv, \"elf_phdr.size\", sizeof (Elf_(Phdr)), 0);\n\tsdb_set (bin->kv, \"elf_p_type.cparse\", \"enum elf_p_type {PT_NULL=0,PT_LOAD=1,PT_DYNAMIC=2,\"\n\t\t\"PT_INTERP=3,PT_NOTE=4,PT_SHLIB=5,PT_PHDR=6,PT_LOOS=0x60000000,\"\n\t\t\"PT_HIOS=0x6fffffff,PT_LOPROC=0x70000000,PT_HIPROC=0x7fffffff};\",\n\t\t0);\n\tsdb_set (bin->kv, \"elf_p_flags.cparse\", \"enum elf_p_flags {PF_None=0,PF_Exec=1,\"\n\t\t\t\"PF_Write=2,PF_Write_Exec=3,PF_Read=4,PF_Read_Exec=5,PF_Read_Write=6,\"\n\t\t\t\"PF_Read_Write_Exec=7};\", 0);\n#if R_BIN_ELF64\n\tsdb_set (bin->kv, \"elf_phdr.format\", \"[4]E[4]Eqqqqqq (elf_p_type)type (elf_p_flags)flags\"\n\t\t\t\" offset vaddr paddr filesz memsz align\", 0);\n#else\n\tsdb_set (bin->kv, \"elf_phdr.format\", \"[4]Exxxxx[4]Ex (elf_p_type)type offset vaddr paddr\"\n\t\t\t\" filesz memsz (elf_p_flags)flags align\", 0);\n#endif\n\treturn true;\n\t// Usage example:\n\t// > td `k bin/cur/info/elf_p_type.cparse`; td `k bin/cur/info/elf_p_flags.cparse`\n\t// > pf `k bin/cur/info/elf_phdr.format` @ `k bin/cur/info/elf_phdr.offset`\n}\n\nstatic int init_shdr(ELFOBJ *bin) {\n\tut32 shdr_size;\n\tut8 shdr[sizeof (Elf_(Shdr))] = {0};\n\tsize_t i, j, len;\n\n\tr_return_val_if_fail (bin && !bin->shdr, false);\n\n\tif (!UT32_MUL (&shdr_size, bin->ehdr.e_shnum, sizeof (Elf_(Shdr)))) {\n\t\treturn false;\n\t}\n\tif (shdr_size < 1) {\n\t\treturn false;\n\t}\n\tif (shdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_shoff > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_shoff + shdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (!(bin->shdr = R_NEWS0 (Elf_(Shdr), bin->ehdr.e_shnum))) {\n\t\tr_sys_perror (\"malloc (shdr)\");\n\t\treturn false;\n\t}\n\tsdb_num_set (bin->kv, \"elf_shdr.offset\", bin->ehdr.e_shoff, 0);\n\tsdb_num_set (bin->kv, \"elf_shdr.size\", sizeof (Elf_(Shdr)), 0);\n\tsdb_set (bin->kv, \"elf_s_type.cparse\", \"enum elf_s_type {SHT_NULL=0,SHT_PROGBITS=1,\"\n\t\t\t\"SHT_SYMTAB=2,SHT_STRTAB=3,SHT_RELA=4,SHT_HASH=5,SHT_DYNAMIC=6,SHT_NOTE=7,\"\n\t\t\t\"SHT_NOBITS=8,SHT_REL=9,SHT_SHLIB=10,SHT_DYNSYM=11,SHT_LOOS=0x60000000,\"\n\t\t\t\"SHT_HIOS=0x6fffffff,SHT_LOPROC=0x70000000,SHT_HIPROC=0x7fffffff};\", 0);\n\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tj = 0;\n\t\tlen = r_buf_read_at (bin->b, bin->ehdr.e_shoff + i * sizeof (Elf_(Shdr)), shdr, sizeof (Elf_(Shdr)));\n\t\tif (len < 1) {\n\t\t\tR_LOG_ERROR (\"read (shdr) at 0x%\" PFMT64x, (ut64) bin->ehdr.e_shoff);\n\t\t\tR_FREE (bin->shdr);\n\t\t\treturn false;\n\t\t}\n\t\tbin->shdr[i].sh_name = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_type = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_flags = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_addr = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_offset = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_size = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_link = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_info = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_addralign = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_entsize = R_BIN_ELF_READWORD (shdr, j);\n\t}\n\n#if R_BIN_ELF64\n\tsdb_set (bin->kv, \"elf_s_flags_64.cparse\", \"enum elf_s_flags_64 {SF64_None=0,SF64_Exec=1,\"\n\t\t\t\"SF64_Alloc=2,SF64_Alloc_Exec=3,SF64_Write=4,SF64_Write_Exec=5,\"\n\t\t\t\"SF64_Write_Alloc=6,SF64_Write_Alloc_Exec=7};\", 0);\n\tsdb_set (bin->kv, \"elf_shdr.format\", \"x[4]E[8]Eqqqxxqq name (elf_s_type)type\"\n\t\t\t\" (elf_s_flags_64)flags addr offset size link info addralign entsize\", 0);\n#else\n\tsdb_set (bin->kv, \"elf_s_flags_32.cparse\", \"enum elf_s_flags_32 {SF32_None=0,SF32_Exec=1,\"\n\t\t\t\"SF32_Alloc=2,SF32_Alloc_Exec=3,SF32_Write=4,SF32_Write_Exec=5,\"\n\t\t\t\"SF32_Write_Alloc=6,SF32_Write_Alloc_Exec=7};\", 0);\n\tsdb_set (bin->kv, \"elf_shdr.format\", \"x[4]E[4]Exxxxxxx name (elf_s_type)type\"\n\t\t\t\" (elf_s_flags_32)flags addr offset size link info addralign entsize\", 0);\n#endif\n\treturn true;\n\t// Usage example:\n\t// > td `k bin/cur/info/elf_s_type.cparse`; td `k bin/cur/info/elf_s_flags_64.cparse`\n\t// > pf `k bin/cur/info/elf_shdr.format` @ `k bin/cur/info/elf_shdr.offset`\n}\n\nstatic bool is_shidx_valid(ELFOBJ *bin, Elf_(Half) value) {\n\treturn value < bin->ehdr.e_shnum && !R_BETWEEN (SHN_LORESERVE, value, SHN_HIRESERVE);\n}\n\nstatic int init_strtab(ELFOBJ *bin) {\n\tr_return_val_if_fail (!bin->strtab, false);\n\n\tif (!bin->shdr) {\n\t\treturn false;\n\t}\n\n\tElf_(Half) shstrndx = bin->ehdr.e_shstrndx;\n\tif (shstrndx != SHN_UNDEF && !is_shidx_valid (bin, shstrndx)) {\n\t\treturn false;\n\t}\n\n\t/* sh_size must be lower than UT32_MAX and not equal to zero, to avoid bugs on malloc() */\n\tif (bin->shdr[shstrndx].sh_size > UT32_MAX) {\n\t\treturn false;\n\t}\n\tif (!bin->shdr[shstrndx].sh_size) {\n\t\treturn false;\n\t}\n\tbin->shstrtab_section = bin->strtab_section = &bin->shdr[shstrndx];\n\tbin->shstrtab_size = bin->shstrtab_section->sh_size;\n\tif (bin->shstrtab_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->shstrtab_section->sh_offset > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->shstrtab_section->sh_offset + bin->shstrtab_section->sh_size > bin->size) {\n\t\treturn false;\n\t}\n\n\tif (!(bin->shstrtab = calloc (1, bin->shstrtab_size + 1))) {\n\t\tr_sys_perror (\"malloc\");\n\t\tbin->shstrtab = NULL;\n\t\treturn false;\n\t}\n\tint res = r_buf_read_at (bin->b, bin->shstrtab_section->sh_offset, (ut8*)bin->shstrtab,\n\t\tbin->shstrtab_section->sh_size);\n\tif (res < 1) {\n\t\tR_LOG_ERROR (\"read (shstrtab) at 0x%\" PFMT64x, (ut64) bin->shstrtab_section->sh_offset);\n\t\tR_FREE (bin->shstrtab);\n\t\treturn false;\n\t}\n\tbin->shstrtab[bin->shstrtab_section->sh_size] = '\\0';\n\n\tsdb_num_set (bin->kv, \"elf_shstrtab.offset\", bin->shstrtab_section->sh_offset, 0);\n\tsdb_num_set (bin->kv, \"elf_shstrtab.size\", bin->shstrtab_section->sh_size, 0);\n\n\treturn true;\n}\n\nstatic Elf_(Phdr) *get_dynamic_segment(ELFOBJ *bin) {\n\tint i;\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tif (bin->phdr[i].p_type == PT_DYNAMIC) {\n\t\t\tif (bin->phdr[i].p_filesz > bin->size) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (bin->phdr[i].p_offset > bin->size) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (bin->phdr[i].p_offset + sizeof (Elf_(Dyn)) > bin->size) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\treturn &bin->phdr[i];\n\t\t}\n\t}\n\treturn NULL;\n}\n\nstatic void init_dynamic_section_sdb(ELFOBJ *bin, Elf_(Addr) strtabaddr, size_t strsize) {\n\tint r = Elf_(r_bin_elf_has_relro) (bin);\n\tswitch (r) {\n\tcase R_ELF_FULL_RELRO:\n\t\tsdb_set (bin->kv, \"elf.relro\", \"full\", 0);\n\t\tbreak;\n\tcase R_ELF_PART_RELRO:\n\t\tsdb_set (bin->kv, \"elf.relro\", \"partial\", 0);\n\t\tbreak;\n\tdefault:\n\t\tsdb_set (bin->kv, \"elf.relro\", \"no\", 0);\n\t\tbreak;\n\t}\n\tsdb_num_set (bin->kv, \"elf_strtab.offset\", strtabaddr, 0);\n\tsdb_num_set (bin->kv, \"elf_strtab.size\", strsize, 0);\n}\n\nstatic void set_default_value_dynamic_info(ELFOBJ *bin) {\n\tbin->dyn_info.dt_pltrelsz = 0;\n\tbin->dyn_info.dt_pltgot = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_hash = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_strtab = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_symtab = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_rela = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_relasz = 0;\n\tbin->dyn_info.dt_relaent = 0;\n\tbin->dyn_info.dt_strsz = 0;\n\tbin->dyn_info.dt_syment = 0;\n\tbin->dyn_info.dt_rel = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_relsz = 0;\n\tbin->dyn_info.dt_relent = 0;\n\tbin->dyn_info.dt_pltrel = R_BIN_ELF_XWORD_MAX;\n\tbin->dyn_info.dt_jmprel = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_pltgot = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_mips_pltgot = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_bind_now = false;\n\tbin->dyn_info.dt_flags = R_BIN_ELF_XWORD_MAX;\n\tbin->dyn_info.dt_flags_1 = R_BIN_ELF_XWORD_MAX;\n\tbin->dyn_info.dt_rpath = R_BIN_ELF_XWORD_MAX;\n\tbin->dyn_info.dt_runpath = R_BIN_ELF_XWORD_MAX;\n\tr_vector_init(&bin->dyn_info.dt_needed, sizeof (Elf_(Off)), NULL, NULL);\n}\n\nstatic size_t get_maximum_number_of_dynamic_entries(ut64 dyn_size) {\n\treturn dyn_size / sizeof (Elf_(Dyn));\n}\n\nstatic bool fill_dynamic_entry(ELFOBJ *bin, ut64 entry_offset, Elf_(Dyn) *d) {\n\tut8 sdyn[sizeof (Elf_(Dyn))] = {0};\n\tint j = 0;\n\tint len = r_buf_read_at (bin->b, entry_offset, sdyn, sizeof (Elf_(Dyn)));\n\tif (len < 1) {\n\t\treturn false;\n\t}\n\n\td->d_tag = R_BIN_ELF_READWORD (sdyn, j);\n\td->d_un.d_ptr = R_BIN_ELF_READWORD (sdyn, j);\n\n\treturn true;\n}\n\nstatic void fill_dynamic_entries(ELFOBJ *bin, ut64 loaded_offset, ut64 dyn_size) {\n\tElf_(Dyn) d = {0};\n\tsize_t i;\n\tsize_t number_of_entries = get_maximum_number_of_dynamic_entries(dyn_size);\n\n\tfor (i = 0; i < number_of_entries; i++) {\n\t\tut64 entry_offset = loaded_offset + i * sizeof (Elf_(Dyn));\n\t\tif (!fill_dynamic_entry (bin, entry_offset, &d)) {\n\t\t\tbreak;\n\t\t}\n\n\t\tswitch (d.d_tag) {\n\t\tcase DT_NULL:\n\t\t\tbreak;\n\t\tcase DT_PLTRELSZ:\n\t\t\tbin->dyn_info.dt_pltrelsz = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_PLTGOT:\n\t\t\tbin->dyn_info.dt_pltgot = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_HASH:\n\t\t\tbin->dyn_info.dt_hash = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_STRTAB:\n\t\t\tbin->dyn_info.dt_strtab = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_SYMTAB:\n\t\t\tbin->dyn_info.dt_symtab = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_RELA:\n\t\t\tbin->dyn_info.dt_rela = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_RELASZ:\n\t\t\tbin->dyn_info.dt_relasz = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_RELAENT:\n\t\t\tbin->dyn_info.dt_relaent = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_STRSZ:\n\t\t\tbin->dyn_info.dt_strsz = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_SYMENT:\n\t\t\tbin->dyn_info.dt_syment = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_REL:\n\t\t\tbin->dyn_info.dt_rel = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_RELSZ:\n\t\t\tbin->dyn_info.dt_relsz = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_RELENT:\n\t\t\tbin->dyn_info.dt_relent = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_PLTREL:\n\t\t\tbin->dyn_info.dt_pltrel = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_JMPREL:\n\t\t\tbin->dyn_info.dt_jmprel = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_MIPS_PLTGOT:\n\t\t\tbin->dyn_info.dt_mips_pltgot = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_BIND_NOW:\n\t\t\tbin->dyn_info.dt_bind_now = true;\n\t\t\tbreak;\n\t\tcase DT_FLAGS:\n\t\t\tbin->dyn_info.dt_flags = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_FLAGS_1:\n\t\t\tbin->dyn_info.dt_flags_1 = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_RPATH:\n\t\t\tbin->dyn_info.dt_rpath = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_RUNPATH:\n\t\t\tbin->dyn_info.dt_runpath = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_NEEDED:\n\t\t\tr_vector_push (&bin->dyn_info.dt_needed, &d.d_un.d_val);\n\t\t\tbreak;\n\t\tcase DT_INIT:\n\t\tcase DT_FINI:\n\t\tcase DT_DEBUG:\n\t\tcase DT_INIT_ARRAY:\n\t\tcase DT_FINI_ARRAY:\n\t\tcase DT_INIT_ARRAYSZ:\n\t\tcase DT_FINI_ARRAYSZ:\n\t\tcase DT_PREINIT_ARRAY:\n\t\tcase DT_PREINIT_ARRAYSZ:\n\t\tcase DT_SONAME:\n\t\tcase DT_GNU_HASH:\n\t\t\t// common dynamic entries in ELF, but we don't need to\n\t\t\t// do anything with them.\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif ((d.d_tag >= DT_VERSYM) && (d.d_tag <= DT_VERNEEDNUM)) {\n\t\t\t\tbin->version_info[DT_VERSIONTAGIDX (d.d_tag)] = d.d_un.d_val;\n\t\t\t} else {\n\t\t\t\tR_LOG_DEBUG (\"Dynamic tag %\" PFMT64d \" not handled\", (ut64) d.d_tag);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tif (d.d_tag == DT_NULL) {\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nstatic int init_dynamic_section(ELFOBJ *bin) {\n\tut64 strtabaddr = 0;\n\tchar *strtab = NULL;\n\tsize_t strsize = 0;\n\tint r;\n\tut64 dyn_size = 0, loaded_offset;\n\tset_default_value_dynamic_info(bin);\n\n\tr_return_val_if_fail (bin, false);\n\tif (!bin->phdr || !bin->ehdr.e_phnum) {\n\t\treturn false;\n\t}\n\n\tElf_(Phdr) *dyn_phdr = get_dynamic_segment (bin);\n\tif (!dyn_phdr) {\n\t\treturn false;\n\t}\n\n\tdyn_size = dyn_phdr->p_filesz;\n\tloaded_offset = Elf_(r_bin_elf_v2p_new) (bin, dyn_phdr->p_vaddr);\n\tif (loaded_offset == UT64_MAX) {\n\t\treturn false;\n\t}\n\n\tif (!dyn_size || loaded_offset + dyn_size > bin->size) {\n\t\treturn false;\n\t}\n\n\tfill_dynamic_entries (bin, loaded_offset, dyn_size);\n\n\tif (bin->dyn_info.dt_strtab != R_BIN_ELF_ADDR_MAX) {\n\t\tstrtabaddr = Elf_(r_bin_elf_v2p_new) (bin, bin->dyn_info.dt_strtab);\n\t}\n\n\tif (bin->dyn_info.dt_strsz > 0) {\n\t\tstrsize = bin->dyn_info.dt_strsz;\n\t}\n\n\tif (strtabaddr == UT64_MAX || strtabaddr > bin->size || strsize > ST32_MAX || !strsize || strsize > bin->size || strtabaddr + strsize > bin->size) {\n\t\tif (!strtabaddr) {\n\t\t\tR_LOG_DEBUG (\"DT_STRTAB not found or invalid\");\n\t\t}\n\t\treturn false;\n\t}\n\tstrtab = (char *)calloc (1, strsize + 1);\n\tif (!strtab) {\n\t\treturn false;\n\t}\n\tr = r_buf_read_at (bin->b, strtabaddr, (ut8 *)strtab, strsize);\n\tif (r < 1) {\n\t\tfree (strtab);\n\t\treturn false;\n\t}\n\n\tbin->strtab = strtab;\n\tbin->strtab_size = strsize;\n\tinit_dynamic_section_sdb (bin, strtabaddr, strsize);\n\treturn true;\n}\n\nstatic RBinElfSection* get_section_by_name(ELFOBJ *bin, const char *section_name) {\n\tif (bin->g_sections) {\n\t\tsize_t i;\n\t\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\t\tif (!strncmp (bin->g_sections[i].name, section_name, ELF_STRING_LENGTH - 1)) {\n\t\t\t\treturn &bin->g_sections[i];\n\t\t\t}\n\t\t}\n\t}\n\treturn NULL;\n}\n\nstatic char *get_ver_flags(ut32 flags) {\n\tif (!flags) {\n\t\treturn \"none\";\n\t}\n\tstatic char buff[32];\n\tbuff[0] = 0;\n\tif (flags & VER_FLG_BASE) {\n\t\tstrcpy (buff, \"BASE \");\n\t}\n\tif (flags & VER_FLG_WEAK) {\n\t\tif (flags & VER_FLG_BASE) {\n\t\t\tstrcat (buff, \"| \");\n\t\t}\n\t\tstrcat (buff, \"WEAK \");\n\t}\n\tif (flags & ~(VER_FLG_BASE | VER_FLG_WEAK)) {\n\t\tstrcat (buff, \"| \");\n\t}\n\treturn buff;\n}\n\nstatic Sdb *store_versioninfo_gnu_versym(ELFOBJ *bin, Elf_(Shdr) *shdr, int sz) {\n\tsize_t i;\n\tconst ut64 num_entries = sz / sizeof (Elf_(Versym));\n\tconst char *section_name = \"\";\n\tconst char *link_section_name = \"\";\n\tSdb *sdb = sdb_new0 ();\n\tif (!sdb) {\n\t\treturn NULL;\n\t}\n\tif (!bin->version_info[DT_VERSIONTAGIDX (DT_VERSYM)]) {\n\t\tsdb_free (sdb);\n\t\treturn NULL;\n\t}\n\tif (shdr->sh_link >= bin->ehdr.e_shnum) {\n\t\tsdb_free (sdb);\n\t\treturn NULL;\n\t}\n\tElf_(Shdr) *link_shdr = &bin->shdr[shdr->sh_link];\n\tut8 *edata = (ut8*) calloc (R_MAX (1, num_entries), 2 * sizeof (ut8));\n\tif (!edata) {\n\t\tsdb_free (sdb);\n\t\treturn NULL;\n\t}\n\tut16 *data = (ut16 *)calloc (R_MAX (1, num_entries), sizeof (ut16));\n\tif (!data) {\n\t\tfree (edata);\n\t\tsdb_free (sdb);\n\t\treturn NULL;\n\t}\n\tut64 off = Elf_(r_bin_elf_v2p) (bin, bin->version_info[DT_VERSIONTAGIDX (DT_VERSYM)]);\n\tif (bin->shstrtab && shdr->sh_name < bin->shstrtab_size) {\n\t\tsection_name = &bin->shstrtab[shdr->sh_name];\n\t}\n\tif (bin->shstrtab && link_shdr->sh_name < bin->shstrtab_size) {\n\t\tlink_section_name = &bin->shstrtab[link_shdr->sh_name];\n\t}\n\tr_buf_read_at (bin->b, off, edata, sizeof (ut16) * num_entries);\n\tsdb_set (sdb, \"section_name\", section_name, 0);\n\tsdb_num_set (sdb, \"num_entries\", num_entries, 0);\n\tsdb_num_set (sdb, \"addr\", shdr->sh_addr, 0);\n\tsdb_num_set (sdb, \"offset\", shdr->sh_offset, 0);\n\tsdb_num_set (sdb, \"link\", shdr->sh_link, 0);\n\tsdb_set (sdb, \"link_section_name\", link_section_name, 0);\n\tfor (i = num_entries; i--;) {\n\t\tdata[i] = r_read_ble16 (&edata[i * sizeof (ut16)], bin->endian);\n\t}\n\tR_FREE (edata);\n\tchar *tmp_val = NULL;\n\tfor (i = 0; i < num_entries; i += 4) {\n\t\tsize_t j;\n\t\tint check_def;\n\t\tchar key[32] = {0};\n\n\t\tfor (j = 0; (j < 4) && (i + j) < num_entries; j++) {\n\t\t\tint k;\n\t\t\tsnprintf (key, sizeof (key), \"entry%d\", (int)(i + j));\n\t\t\tswitch (data[i + j]) {\n\t\t\tcase 0:\n\t\t\t\tsdb_set (sdb, key, \"0 (*local*)\", 0);\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tsdb_set (sdb, key, \"1 (*global*)\", 0);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tfree (tmp_val);\n\t\t\t\ttmp_val = r_str_newf (\"%x \", data[i+j] & 0x7FFF);\n\t\t\t\tcheck_def = true;\n\t\t\t\tif (bin->version_info[DT_VERSIONTAGIDX (DT_VERNEED)]) {\n\t\t\t\t\tElf_(Verneed) vn;\n\t\t\t\t\tut8 svn[sizeof (Elf_(Verneed))] = {0};\n\t\t\t\t\tut64 offset = Elf_(r_bin_elf_v2p) (bin, bin->version_info[DT_VERSIONTAGIDX (DT_VERNEED)]);\n\t\t\t\t\tdo {\n\t\t\t\t\t\tElf_(Vernaux) vna;\n\t\t\t\t\t\tut8 svna[sizeof (Elf_(Vernaux))] = {0};\n\t\t\t\t\t\tut64 a_off;\n\t\t\t\t\t\tif (offset > bin->size || offset + sizeof (vn) > bin->size) {\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (r_buf_read_at (bin->b, offset, svn, sizeof (svn)) < 0) {\n\t\t\t\t\t\t\tR_LOG_DEBUG (\"Cannot read Verneed for Versym\");\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tk = 0;\n\t\t\t\t\t\tvn.vn_version = READ16 (svn, k);\n\t\t\t\t\t\tvn.vn_cnt = READ16 (svn, k);\n\t\t\t\t\t\tvn.vn_file = READ32 (svn, k);\n\t\t\t\t\t\tvn.vn_aux = READ32 (svn, k);\n\t\t\t\t\t\tvn.vn_next = READ32 (svn, k);\n\t\t\t\t\t\ta_off = offset + vn.vn_aux;\n\t\t\t\t\t\tdo {\n\t\t\t\t\t\t\tif (a_off > bin->size || a_off + sizeof (vna) > bin->size) {\n\t\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (r_buf_read_at (bin->b, a_off, svna, sizeof (svna)) < 0) {\n\t\t\t\t\t\t\t\tR_LOG_DEBUG (\"Cannot read Vernaux for Versym\");\n\t\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tk = 0;\n\t\t\t\t\t\t\tvna.vna_hash = READ32 (svna, k);\n\t\t\t\t\t\t\tvna.vna_flags = READ16 (svna, k);\n\t\t\t\t\t\t\tvna.vna_other = READ16 (svna, k);\n\t\t\t\t\t\t\tvna.vna_name = READ32 (svna, k);\n\t\t\t\t\t\t\tvna.vna_next = READ32 (svna, k);\n\t\t\t\t\t\t\ta_off += vna.vna_next;\n\t\t\t\t\t\t} while (vna.vna_other != data[i + j] && vna.vna_next != 0);\n\n\t\t\t\t\t\tif (vna.vna_other == data[i + j]) {\n\t\t\t\t\t\t\tif (vna.vna_name > bin->strtab_size) {\n\t\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tchar *val = r_str_newf (\"%s(%s)\", tmp_val, bin->strtab + vna.vna_name);\n\t\t\t\t\t\t\tsdb_set (sdb, key, val, 0);\n\t\t\t\t\t\t\tfree (val);\n\t\t\t\t\t\t\tcheck_def = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\toffset += vn.vn_next;\n\t\t\t\t\t} while (vn.vn_next);\n\t\t\t\t}\n\n\t\t\t\tut64 vinfoaddr = bin->version_info[DT_VERSIONTAGIDX (DT_VERDEF)];\n\t\t\t\tif (check_def && data[i + j] != 0x8001 && vinfoaddr) {\n\t\t\t\t\tElf_(Verdef) vd;\n\t\t\t\t\tut8 svd[sizeof (Elf_(Verdef))] = {0};\n\t\t\t\t\tut64 offset = Elf_(r_bin_elf_v2p) (bin, vinfoaddr);\n\t\t\t\t\tif (offset > bin->size || offset + sizeof (vd) > bin->size) {\n\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t}\n\t\t\t\t\tdo {\n\t\t\t\t\t\tif (r_buf_read_at (bin->b, offset, svd, sizeof (svd)) < 0) {\n\t\t\t\t\t\t\tR_LOG_DEBUG (\"Cannot read Verdef for Versym\");\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tk = 0;\n\t\t\t\t\t\tvd.vd_version = READ16 (svd, k);\n\t\t\t\t\t\tvd.vd_flags = READ16 (svd, k);\n\t\t\t\t\t\tvd.vd_ndx = READ16 (svd, k);\n\t\t\t\t\t\tvd.vd_cnt = READ16 (svd, k);\n\t\t\t\t\t\tvd.vd_hash = READ32 (svd, k);\n\t\t\t\t\t\tvd.vd_aux = READ32 (svd, k);\n\t\t\t\t\t\tvd.vd_next = READ32 (svd, k);\n\t\t\t\t\t\toffset += vd.vd_next;\n\t\t\t\t\t} while (vd.vd_ndx != (data[i + j] & 0x7FFF) && vd.vd_next != 0);\n\n\t\t\t\t\tif (vd.vd_ndx == (data[i + j] & 0x7FFF)) {\n\t\t\t\t\t\tElf_(Verdaux) vda;\n\t\t\t\t\t\tut8 svda[sizeof (Elf_(Verdaux))] = {0};\n\t\t\t\t\t\tut64 off_vda = offset - vd.vd_next + vd.vd_aux;\n\t\t\t\t\t\tif (off_vda > bin->size || off_vda + sizeof (vda) > bin->size) {\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (r_buf_read_at (bin->b, off_vda, svda, sizeof (svda)) < 0) {\n\t\t\t\t\t\t\tR_LOG_DEBUG (\"Cannot read Verdaux for Versym\");\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tk = 0;\n\t\t\t\t\t\tvda.vda_name = READ32 (svda, k);\n\t\t\t\t\t\tvda.vda_next = READ32 (svda, k);\n\t\t\t\t\t\tif (vda.vda_name > bin->strtab_size) {\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tconst char *name = bin->strtab + vda.vda_name;\n\t\t\t\t\t\tif (name) {\n\t\t\t\t\t\t\tchar *fname = r_str_newf (\"%s(%s%-*s)\", tmp_val, name, (int)(12 - strlen (name)),\")\");\n\t\t\t\t\t\t\tsdb_set (sdb, key, fname, 0);\n\t\t\t\t\t\t\tfree (fname);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tR_FREE (tmp_val);\n\t}\nbeach:\n\tR_FREE (tmp_val);\n\tfree (data);\n\treturn sdb;\n}\n\nstatic Sdb *store_versioninfo_gnu_verdef(ELFOBJ *bin, Elf_(Shdr) *shdr, int sz) {\n\tconst char *section_name = \"\";\n\tconst char *link_section_name = \"\";\n\tchar *end = NULL;\n\tut8 dfs[sizeof (Elf_(Verdef))] = {0};\n\tut32 cnt;\n\tsize_t i;\n\tif (shdr->sh_link >= bin->ehdr.e_shnum) {\n\t\treturn false;\n\t}\n\tElf_(Shdr) *link_shdr = &bin->shdr[shdr->sh_link];\n#ifdef R_BIN_ELF64\n\tif ((int)shdr->sh_size < 1 || shdr->sh_size > SIZE_MAX) {\n#else\n\tif ((int)shdr->sh_size < 1) {\n#endif\n\t\treturn false;\n\t}\n\tif (shdr->sh_size < sizeof (Elf_(Verdef)) || shdr->sh_size < sizeof (Elf_(Verdaux))) {\n\t\treturn false;\n\t}\n\tElf_(Verdef) *defs = calloc (shdr->sh_size, 1);\n\tif (!defs) {\n\t\tR_LOG_ERROR (\"Cannot allocate memory (Check Elf_(Verdef))\");\n\t\treturn false;\n\t}\n\tif (bin->shstrtab && shdr->sh_name < bin->shstrtab_size) {\n\t\tsection_name = &bin->shstrtab[shdr->sh_name];\n\t}\n\tif (link_shdr && bin->shstrtab && link_shdr->sh_name < bin->shstrtab_size) {\n\t\tlink_section_name = &bin->shstrtab[link_shdr->sh_name];\n\t}\n\tSdb *sdb = sdb_new0 ();\n\tif (!sdb) {\n\t\tfree (defs);\n\t\treturn false;\n\t}\n\tsize_t shsize = shdr->sh_size;\n\tif (shdr->sh_size > bin->size) {\n\t\tif (bin->verbose) {\n\t\t\teprintf (\"Truncating shsize from %d to %d\\n\", (int)shdr->sh_size, (int)bin->size);\n\t\t}\n\t\tif (bin->size > shdr->sh_offset) {\n\t\t\tshsize = bin->size - shdr->sh_offset;\n\t\t} else {\n\t\t\tshsize = bin->size;\n\t\t}\n\t}\n\tend = (char *)defs + shsize; //& shdr->sh_size;\n\tsdb_set (sdb, \"section_name\", section_name, 0);\n\tsdb_num_set (sdb, \"entries\", shdr->sh_info, 0);\n\tsdb_num_set (sdb, \"addr\", shdr->sh_addr, 0);\n\tsdb_num_set (sdb, \"offset\", shdr->sh_offset, 0);\n\tsdb_num_set (sdb, \"link\", shdr->sh_link, 0);\n\tsdb_set (sdb, \"link_section_name\", link_section_name, 0);\n\n\tfor (cnt = 0, i = 0; cnt < shdr->sh_info && i < shdr->sh_size; cnt++) {\n\t\tSdb *sdb_verdef = sdb_new0 ();\n\t\tchar *vstart = ((char*)defs) + i;\n\t\tsize_t vstart_off = i;\n\t\tchar key[32] = {0};\n\t\tElf_(Verdef) *verdef = (Elf_(Verdef)*)vstart;\n\t\tElf_(Verdaux) aux = {0};\n\t\tint j = 0;\n\t\tint isum = 0;\n\n\t\tif (vstart + sizeof (*verdef) > end) {\n\t\t\tbreak;\n\t\t}\n\t\tr_buf_read_at (bin->b, shdr->sh_offset + i, dfs, sizeof (Elf_(Verdef)));\n\t\tverdef->vd_version = READ16 (dfs, j);\n\t\tverdef->vd_flags = READ16 (dfs, j);\n\t\tverdef->vd_ndx = READ16 (dfs, j);\n\t\tverdef->vd_cnt = READ16 (dfs, j);\n\t\tverdef->vd_hash = READ32 (dfs, j);\n\t\tverdef->vd_aux = READ32 (dfs, j);\n\t\tverdef->vd_next = READ32 (dfs, j);\n\t\tint vdaux = verdef->vd_aux;\n\t\tif (vdaux < 1 || shdr->sh_size - vstart_off < vdaux) {\n\t\t\tsdb_free (sdb_verdef);\n\t\t\tgoto out_error;\n\t\t}\n\t\tvstart += vdaux;\n\t\tvstart_off += vdaux;\n\t\tif (vstart > end || shdr->sh_size - sizeof (Elf_(Verdaux)) < vstart_off) {\n\t\t\tsdb_free (sdb_verdef);\n\t\t\tgoto out_error;\n\t\t}\n\n\t\tj = 0;\n\t\taux.vda_name = READ32 (vstart, j);\n\t\taux.vda_next = READ32 (vstart, j);\n\n\t\tisum = i + verdef->vd_aux;\n\t\tif (aux.vda_name > bin->dynstr_size) {\n\t\t\tsdb_free (sdb_verdef);\n\t\t\tgoto out_error;\n\t\t}\n\n\t\tsdb_num_set (sdb_verdef, \"idx\", i, 0);\n\t\tsdb_num_set (sdb_verdef, \"vd_version\", verdef->vd_version, 0);\n\t\tsdb_num_set (sdb_verdef, \"vd_ndx\", verdef->vd_ndx, 0);\n\t\tsdb_num_set (sdb_verdef, \"vd_cnt\", verdef->vd_cnt, 0);\n\t\tsdb_set (sdb_verdef, \"vda_name\", &bin->dynstr[aux.vda_name], 0);\n\t\tsdb_set (sdb_verdef, \"flags\", get_ver_flags (verdef->vd_flags), 0);\n\n\t\tfor (j = 1; j < verdef->vd_cnt; j++) {\n\t\t\tint k;\n\t\t\tSdb *sdb_parent = sdb_new0 ();\n\t\t\tif (shdr->sh_size - vstart_off < aux.vda_next) {\n\t\t\t\tsdb_free (sdb_verdef);\n\t\t\t\tsdb_free (sdb_parent);\n\t\t\t\tgoto out_error;\n\t\t\t}\n\t\t\tisum += aux.vda_next;\n\t\t\tvstart += aux.vda_next;\n\t\t\tvstart_off += aux.vda_next;\n\t\t\tif (vstart > end || shdr->sh_size - sizeof (Elf_(Verdaux)) < vstart_off) {\n\t\t\t\tsdb_free (sdb_verdef);\n\t\t\t\tsdb_free (sdb_parent);\n\t\t\t\tgoto out_error;\n\t\t\t}\n\t\t\tk = 0;\n\t\t\taux.vda_name = READ32 (vstart, k);\n\t\t\taux.vda_next = READ32 (vstart, k);\n\t\t\tif (aux.vda_name > bin->dynstr_size) {\n\t\t\t\tsdb_free (sdb_verdef);\n\t\t\t\tsdb_free (sdb_parent);\n\t\t\t\tgoto out_error;\n\t\t\t}\n\t\t\tsdb_num_set (sdb_parent, \"idx\", isum, 0);\n\t\t\tsdb_num_set (sdb_parent, \"parent\", j, 0);\n\t\t\tsdb_set (sdb_parent, \"vda_name\", &bin->dynstr[aux.vda_name], 0);\n\t\t\tsnprintf (key, sizeof (key), \"parent%d\", j - 1);\n\t\t\tsdb_ns_set (sdb_verdef, key, sdb_parent);\n\t\t}\n\n\t\tsnprintf (key, sizeof (key), \"verdef%u\", cnt);\n\t\tsdb_ns_set (sdb, key, sdb_verdef);\n\t\tif (!verdef->vd_next || shdr->sh_size - i < verdef->vd_next) {\n\t\t\tsdb_free (sdb_verdef);\n\t\t\tgoto out_error;\n\t\t}\n\t\tif ((st32)verdef->vd_next < 1) {\n\t\t\tR_LOG_DEBUG (\"Invalid vd_next in the ELF version\");\n\t\t\tbreak;\n\t\t}\n\t\ti += verdef->vd_next;\n\t}\n\tfree (defs);\n\treturn sdb;\nout_error:\n\tfree (defs);\n\tsdb_free (sdb);\n\treturn NULL;\n}\n\nstatic Sdb *store_versioninfo_gnu_verneed(ELFOBJ *bin, Elf_(Shdr) *shdr, int sz) {\n\tut8 *end, *need = NULL;\n\tconst char *section_name = \"\";\n\tElf_(Shdr) *link_shdr = NULL;\n\tconst char *link_section_name = \"\";\n\tSdb *sdb_vernaux = NULL;\n\tSdb *sdb_version = NULL;\n\tSdb *sdb = NULL;\n\tut64 i;\n\tint cnt;\n\n\tif (!bin || !bin->dynstr) {\n\t\treturn NULL;\n\t}\n\tif (shdr->sh_link >= bin->ehdr.e_shnum) {\n\t\treturn NULL;\n\t}\n#ifdef R_BIN_ELF64\n\tif ((int)shdr->sh_size < 1 || shdr->sh_size > SIZE_MAX) {\n#else\n\tif ((int)shdr->sh_size < 1) {\n#endif\n\t\treturn NULL;\n\t}\n\tsdb = sdb_new0 ();\n\tif (!sdb) {\n\t\treturn NULL;\n\t}\n\tlink_shdr = &bin->shdr[shdr->sh_link];\n\tif (bin->shstrtab && shdr->sh_name < bin->shstrtab_size) {\n\t\tsection_name = &bin->shstrtab[shdr->sh_name];\n\t}\n\tif (bin->shstrtab && link_shdr->sh_name < bin->shstrtab_size) {\n\t\tlink_section_name = &bin->shstrtab[link_shdr->sh_name];\n\t}\n\tif (!(need = (ut8*) calloc (R_MAX (1, shdr->sh_size), sizeof (ut8)))) {\n\t\tR_LOG_ERROR (\"Cannot allocate memory for Elf_(Verneed)\");\n\t\tgoto beach;\n\t}\n\tend = need + shdr->sh_size;\n\tsdb_set (sdb, \"section_name\", section_name, 0);\n\tsdb_num_set (sdb, \"num_entries\", shdr->sh_info, 0);\n\tsdb_num_set (sdb, \"addr\", shdr->sh_addr, 0);\n\tsdb_num_set (sdb, \"offset\", shdr->sh_offset, 0);\n\tsdb_num_set (sdb, \"link\", shdr->sh_link, 0);\n\tsdb_set (sdb, \"link_section_name\", link_section_name, 0);\n\n\tif (shdr->sh_offset > bin->size || shdr->sh_offset + shdr->sh_size > bin->size) {\n\t\tgoto beach;\n\t}\n\tif (shdr->sh_offset + shdr->sh_size < shdr->sh_size) {\n\t\tgoto beach;\n\t}\n\ti = r_buf_read_at (bin->b, shdr->sh_offset, need, shdr->sh_size);\n\tif (i < 1) {\n\t\tgoto beach;\n\t}\n\t//XXX we should use DT_VERNEEDNUM instead of sh_info\n\t//TODO https://sourceware.org/ml/binutils/2014-11/msg00353.html\n\tfor (i = 0, cnt = 0; cnt < shdr->sh_info; cnt++) {\n\t\tint j, isum;\n\t\tut8 *vstart = need + i;\n\t\tElf_(Verneed) vvn = {0};\n\t\tif (vstart + sizeof (Elf_(Verneed)) > end) {\n\t\t\tgoto beach;\n\t\t}\n\t\tElf_(Verneed) *entry = &vvn;\n\t\tchar key[32] = {0};\n\t\tsdb_version = sdb_new0 ();\n\t\tif (!sdb_version) {\n\t\t\tgoto beach;\n\t\t}\n\t\tj = 0;\n\t\tvvn.vn_version = READ16 (vstart, j);\n\t\tvvn.vn_cnt = READ16 (vstart, j);\n\t\tvvn.vn_file = READ32 (vstart, j);\n\t\tvvn.vn_aux = READ32 (vstart, j);\n\t\tvvn.vn_next = READ32 (vstart, j);\n\n\t\tsdb_num_set (sdb_version, \"vn_version\", entry->vn_version, 0);\n\t\tsdb_num_set (sdb_version, \"idx\", i, 0);\n\t\tif (entry->vn_file > bin->dynstr_size) {\n\t\t\tgoto beach;\n\t\t}\n\t\t{\n\t\t\tchar *s = r_str_ndup (&bin->dynstr[entry->vn_file], 16);\n\t\t\tsdb_set (sdb_version, \"file_name\", s, 0);\n\t\t\tfree (s);\n\t\t}\n\t\tsdb_num_set (sdb_version, \"cnt\", entry->vn_cnt, 0);\n\t\tst32 vnaux = entry->vn_aux;\n\t\tif (vnaux < 1) {\n\t\t\tgoto beach;\n\t\t}\n\t\tvstart += vnaux;\n\t\tut32 vn_cnt = entry->vn_cnt;\n\t\tfor (j = 0, isum = i + entry->vn_aux; j < vn_cnt && vstart + sizeof (Elf_(Vernaux)) <= end; j++) {\n\t\t\tint k;\n\t\t\tElf_(Vernaux) *aux = NULL;\n\t\t\tElf_(Vernaux) vaux = {0};\n\t\t\taux = (Elf_(Vernaux)*)&vaux;\n\t\t\tk = 0;\n\t\t\tvaux.vna_hash = READ32 (vstart, k);\n\t\t\tvaux.vna_flags = READ16 (vstart, k);\n\t\t\tvaux.vna_other = READ16 (vstart, k);\n\t\t\tvaux.vna_name = READ32 (vstart, k);\n\t\t\tvaux.vna_next = READ32 (vstart, k);\n\t\t\tif (aux->vna_name > bin->dynstr_size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n#if 1\n\t\t\tsdb_vernaux = sdb_new0 ();\n\t\t\tif (!sdb_vernaux) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tsdb_num_set (sdb_vernaux, \"idx\", isum, 0);\n\t\t\tif (aux->vna_name > 0 && aux->vna_name + 8 < bin->dynstr_size) {\n\t\t\t\tchar name [16];\n\t\t\t\tstrncpy (name, &bin->dynstr[aux->vna_name], sizeof (name)-1);\n\t\t\t\tname[sizeof (name)-1] = 0;\n\t\t\t\tsdb_set (sdb_vernaux, \"name\", name, 0);\n\t\t\t}\n\t\t\tsdb_set (sdb_vernaux, \"flags\", get_ver_flags (aux->vna_flags), 0);\n\t\t\tsdb_num_set (sdb_vernaux, \"version\", aux->vna_other, 0);\n\t\t\tisum += aux->vna_next;\n\t\t\tvstart += aux->vna_next;\n\t\t\tsnprintf (key, sizeof (key), \"vernaux%d\", j);\n\t\t\tsdb_ns_set (sdb_version, key, sdb_vernaux);\n#else\n\t\t\tchar *key = r_str_newf (\"vernaux%d\", j);\n\t\t\tchar *val = r_str_newf (\"%d,%s\", isum, get_ver_flags (aux->vna_flags));\n\t\t\tsdb_set (sdb_version, key, val, 0);\n\t\t\tfree (key);\n\t\t\tfree (val);\n#endif\n\t\t}\n\t\tif ((int)entry->vn_next < 0) {\n\t\t\tR_LOG_DEBUG (\"Invalid vn_next at 0x%08\" PFMT64x, (ut64)shdr->sh_offset);\n\t\t\tbreak;\n\t\t}\n\t\ti += entry->vn_next;\n\t\tsnprintf (key, sizeof (key), \"version%d\", cnt );\n\t\tsdb_ns_set (sdb, key, sdb_version);\n\t\t//if entry->vn_next is 0 it iterate infinitely\n\t\tif (!entry->vn_next) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tfree (need);\n\treturn sdb;\nbeach:\n\tfree (need);\n\tsdb_free (sdb_vernaux);\n\tsdb_free (sdb_version);\n\tsdb_free (sdb);\n\treturn NULL;\n}\n\nstatic Sdb *store_versioninfo(ELFOBJ *bin) {\n\tSdb *sdb_versioninfo = NULL;\n\tint num_verdef = 0;\n\tint num_verneed = 0;\n\tint num_versym = 0;\n\tsize_t i;\n\n\tif (!bin || !bin->shdr) {\n\t\treturn NULL;\n\t}\n\tif (!(sdb_versioninfo = sdb_new0 ())) {\n\t\treturn NULL;\n\t}\n\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tSdb *sdb = NULL;\n\t\tchar key[32] = {0};\n\t\tint size = bin->shdr[i].sh_size;\n\n\t\tif (size - (i * sizeof (Elf_(Shdr)) > bin->size)) {\n\t\t\tsize = bin->size - (i*sizeof (Elf_(Shdr)));\n\t\t}\n\t\tint left = size - (i * sizeof (Elf_(Shdr)));\n\t\tleft = R_MIN (left, bin->shdr[i].sh_size);\n\t\tif (left < 0) {\n\t\t\tbreak;\n\t\t}\n\t\tswitch (bin->shdr[i].sh_type) {\n\t\tcase SHT_GNU_verdef:\n\t\t\tsdb = store_versioninfo_gnu_verdef (bin, &bin->shdr[i], left);\n\t\t\tsnprintf (key, sizeof (key), \"verdef%d\", num_verdef++);\n\t\t\tsdb_ns_set (sdb_versioninfo, key, sdb);\n\t\t\tbreak;\n\t\tcase SHT_GNU_verneed:\n\t\t\tsdb = store_versioninfo_gnu_verneed (bin, &bin->shdr[i], left);\n\t\t\tsnprintf (key, sizeof (key), \"verneed%d\", num_verneed++);\n\t\t\tsdb_ns_set (sdb_versioninfo, key, sdb);\n\t\t\tbreak;\n\t\tcase SHT_GNU_versym:\n\t\t\tsdb = store_versioninfo_gnu_versym (bin, &bin->shdr[i], left);\n\t\t\tsnprintf (key, sizeof (key), \"versym%d\", num_versym++);\n\t\t\tsdb_ns_set (sdb_versioninfo, key, sdb);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn sdb_versioninfo;\n}\n\nstatic bool init_dynstr(ELFOBJ *bin) {\n\tint i, r;\n\tconst char *section_name = NULL;\n\tif (!bin || !bin->shdr) {\n\t\treturn false;\n\t}\n\tif (!bin->shstrtab) {\n\t\treturn false;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tif (bin->shdr[i].sh_name > bin->shstrtab_size) {\n\t\t\treturn false;\n\t\t}\n\t\tsection_name = &bin->shstrtab[bin->shdr[i].sh_name];\n\t\tif (bin->shdr[i].sh_type == SHT_STRTAB && !strcmp (section_name, \".dynstr\")) {\n\t\t\tif (!(bin->dynstr = (char*) calloc (bin->shdr[i].sh_size + 1, sizeof (char)))) {\n\t\t\t\tR_LOG_ERROR (\"Cannot allocate memory for dynamic strings\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset > bin->size) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset + bin->shdr[i].sh_size > bin->size) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset + bin->shdr[i].sh_size < bin->shdr[i].sh_size) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tr = r_buf_read_at (bin->b, bin->shdr[i].sh_offset, (ut8*)bin->dynstr, bin->shdr[i].sh_size);\n\t\t\tif (r < 1) {\n\t\t\t\tR_FREE (bin->dynstr);\n\t\t\t\tbin->dynstr_size = 0;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbin->dynstr_size = bin->shdr[i].sh_size;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nstatic HtUP *rel_cache_new(RBinElfReloc *relocs, ut32 reloc_num) {\n\tif (!relocs || reloc_num == 0) {\n\t\treturn NULL;\n\t}\n\tconst int htsize = R_MIN (reloc_num, 1024);\n\tHtUP *rel_cache = ht_up_new_size (htsize, NULL, NULL, NULL);\n\tif (rel_cache) {\n\t\tsize_t i;\n\t\tfor (i = 0; i < reloc_num; i++) {\n\t\t\tRBinElfReloc *tmp = relocs + i;\n\t\t\tht_up_insert (rel_cache, tmp->sym, tmp);\n\t\t}\n\t}\n\treturn rel_cache;\n}\n\nstatic bool elf_init(ELFOBJ *bin) {\n\t/* bin is not an ELF */\n\tif (!init_ehdr (bin)) {\n\t\treturn false;\n\t}\n\tif (!init_phdr (bin) && !is_bin_etrel (bin)) {\n\t\tR_LOG_DEBUG (\"Cannot initialize program headers\");\n\t}\n\tif (bin->ehdr.e_type != ET_CORE) {\n\t\tif (!init_shdr (bin)) {\n\t\t\tR_LOG_DEBUG (\"Cannot initialize section headers\");\n\t\t}\n\t\tif (!init_strtab (bin)) {\n\t\t\tR_LOG_DEBUG (\"Cannot initialize strings table\");\n\t\t}\n\t\tif (!init_dynstr (bin) && !is_bin_etrel (bin)) {\n\t\t\tR_LOG_DEBUG (\"Cannot initialize dynamic strings\");\n\t\t}\n\t\tbin->baddr = Elf_(r_bin_elf_get_baddr) (bin);\n\t\tif (!init_dynamic_section (bin) && !Elf_(r_bin_elf_is_static) (bin) && !is_bin_etrel (bin)) {\n\t\t\tR_LOG_DEBUG (\"Cannot initialize dynamic section\");\n\t\t}\n\t}\n\tbin->imports_by_ord_size = 0;\n\tbin->imports_by_ord = NULL;\n\tbin->symbols_by_ord_size = 0;\n\tbin->symbols_by_ord = NULL;\n\tbin->g_sections = Elf_(r_bin_elf_get_sections) (bin);\n\tbin->boffset = Elf_(r_bin_elf_get_boffset) (bin);\n\tbin->g_relocs = Elf_(r_bin_elf_get_relocs) (bin);\n\tbin->rel_cache = rel_cache_new (bin->g_relocs, bin->g_reloc_num);\n\tsdb_ns_set (bin->kv, \"versioninfo\", store_versioninfo (bin));\n\treturn true;\n}\n\nut64 Elf_(r_bin_elf_get_section_offset)(ELFOBJ *bin, const char *section_name) {\n\tRBinElfSection *section = get_section_by_name (bin, section_name);\n\treturn section? section->offset: UT64_MAX;\n}\n\nut64 Elf_(r_bin_elf_get_section_addr)(ELFOBJ *bin, const char *section_name) {\n\tRBinElfSection *section = get_section_by_name (bin, section_name);\n\treturn section? section->rva: UT64_MAX;\n}\n\nut64 Elf_(r_bin_elf_get_section_addr_end)(ELFOBJ *bin, const char *section_name) {\n\tRBinElfSection *section = get_section_by_name (bin, section_name);\n\treturn section? section->rva + section->size: UT64_MAX;\n}\n\nstatic ut64 get_got_entry(ELFOBJ *bin, RBinElfReloc *rel) {\n\tif (!rel->rva) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 p_sym_got_addr = Elf_(r_bin_elf_v2p_new) (bin, rel->rva);\n\tut64 addr = R_BIN_ELF_BREADWORD (bin->b, p_sym_got_addr);\n\n\treturn (!addr || addr == R_BIN_ELF_WORD_MAX) ? UT64_MAX : addr;\n}\n\nstatic bool is_thumb_symbol(ut64 plt_addr) {\n\treturn plt_addr & 1;\n}\n\nstatic ut64 get_import_addr_arm(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\tif (got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 plt_addr = get_got_entry (bin, rel);\n\tif (plt_addr == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 pos = COMPUTE_PLTGOT_POSITION (rel, got_addr, 0x3);\n\n\tswitch (rel->type) {\n\tcase R_ARM_JUMP_SLOT:\n\t\tplt_addr += pos * 12 + 20;\n\t\tif (is_thumb_symbol (plt_addr)) {\n\t\t\tplt_addr--;\n\t\t}\n\t\treturn plt_addr;\n\tcase R_AARCH64_RELATIVE:\n\t\tR_LOG_WARN (\"Unsupported relocation type for imports %d\", rel->type);\n\t\treturn UT64_MAX;\n\tcase R_AARCH64_IRELATIVE:\n\t\tif (rel->addend > plt_addr) { // start\n\t\t\treturn (plt_addr + pos * 16 + 32) + rel->addend;\n\t\t}\n\t\t// same as fallback to JUMP_SLOT\n\t\treturn plt_addr + pos * 16 + 32;\n\tcase R_AARCH64_JUMP_SLOT:\n\t\treturn plt_addr + pos * 16 + 32;\n\tdefault:\n\t\tR_LOG_WARN (\"Unsupported relocation type for imports %d\", rel->type);\n\t\treturn UT64_MAX;\n\t}\n\treturn UT64_MAX;\n}\n\nstatic ut64 get_import_addr_mips(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 jmprel_addr = bin->dyn_info.dt_jmprel;\n\tut64 got_addr = bin->dyn_info.dt_mips_pltgot;\n\n\tif (jmprel_addr == R_BIN_ELF_ADDR_MAX || got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 pos = COMPUTE_PLTGOT_POSITION(rel, got_addr, 0x2);\n\n\tut8 buf[1024];\n\tut64 plt_addr = jmprel_addr + bin->dyn_info.dt_pltrelsz;\n\tut64 p_plt_addr = Elf_(r_bin_elf_v2p_new) (bin, plt_addr);\n\tint res = r_buf_read_at (bin->b, p_plt_addr, buf, sizeof (buf));\n\tif (res != sizeof (buf)) {\n\t\treturn UT64_MAX;\n\t}\n\n\tconst ut8 *base = r_mem_mem_aligned (buf, sizeof (buf), (const ut8 *)\"\\x3c\\x0f\\x00\", 3, 4);\n\tplt_addr += base? (int)(size_t) (base - buf): MIPS_PLT_OFFSET + 8; // HARDCODED HACK\n\tplt_addr += pos * 16;\n\n\treturn plt_addr;\n}\n\nstatic size_t get_size_rel_mode(Elf_(Xword) mode) {\n\treturn mode == DT_RELA? sizeof (Elf_(Rela)): sizeof (Elf_(Rel));\n}\n\nstatic ut64 get_num_relocs_dynamic_plt(ELFOBJ *bin) {\n\tif (bin->dyn_info.dt_pltrelsz) {\n\t\tconst ut64 size = bin->dyn_info.dt_pltrelsz;\n\t\tconst ut64 relsize = get_size_rel_mode (bin->dyn_info.dt_pltrel);\n\t\treturn size / relsize;\n\t}\n\treturn 0;\n}\n\nstatic ut64 get_import_addr_riscv(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\tif (got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 plt_addr = get_got_entry (bin, rel);\n\tif (plt_addr == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 pos = COMPUTE_PLTGOT_POSITION(rel, got_addr, 0x2);\n\treturn plt_addr + RISCV_PLT_OFFSET + pos * RISCV_PLT_ENTRY_SIZE;\n}\n\nstatic ut64 get_import_addr_loongarch(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\tif (got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 plt_addr = get_got_entry (bin, rel);\n\tif (plt_addr == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 pos = COMPUTE_PLTGOT_POSITION(rel, got_addr, 0x2);\n\treturn plt_addr + LOONGARCH_PLT_OFFSET + pos * LOONGARCH_PLT_ENTRY_SIZE;\n}\nstatic ut64 get_import_addr_sparc(ELFOBJ *bin, RBinElfReloc *rel) {\n\tif (rel->type != R_SPARC_JMP_SLOT) {\n\t\tR_LOG_DEBUG (\"Unknown sparc reloc type %d\", rel->type);\n\t\treturn UT64_MAX;\n\t}\n\tut64 tmp = get_got_entry (bin, rel);\n\n\treturn (tmp == UT64_MAX) ? UT64_MAX : tmp + SPARC_OFFSET_PLT_ENTRY_FROM_GOT_ADDR;\n}\n\nstatic ut64 get_import_addr_ppc(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 plt_addr = bin->dyn_info.dt_pltgot;\n\tif (plt_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\tut64 p_plt_addr = Elf_(r_bin_elf_v2p_new) (bin, plt_addr);\n\tif (p_plt_addr == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 base = r_buf_read_ble32_at (bin->b, p_plt_addr, bin->endian);\n\tif (base == UT32_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 nrel = get_num_relocs_dynamic_plt (bin);\n\tut64 pos = COMPUTE_PLTGOT_POSITION(rel, plt_addr, 0x0);\n\n\tif (bin->endian) {\n\t\tbase -= (nrel * 16);\n\t\tbase += (pos * 16);\n\t\treturn base;\n\t}\n\n\tbase -= (nrel * 12) + 20;\n\tbase += (pos * 8);\n\treturn base;\n}\n\nstatic ut64 get_import_addr_x86_manual(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\tif (got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 got_offset = Elf_(r_bin_elf_v2p_new) (bin, got_addr);\n\tif (got_offset == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\t//XXX HACK ALERT!!!! full relro?? try to fix it\n\t//will there always be .plt.got, what would happen if is .got.plt?\n\tRBinElfSection *s = get_section_by_name (bin, \".plt.got\");\n\tif (Elf_(r_bin_elf_has_relro) (bin) < R_ELF_PART_RELRO || !s) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut8 buf[sizeof (Elf_(Addr))] = {0};\n\n\tut64 plt_addr = s->offset;\n\tut64 plt_sym_addr;\n\n\twhile (plt_addr + 2 + 4 < s->offset + s->size) {\n\t\t/*we try to locate the plt entry that correspond with the relocation\n\t\t since got does not point back to .plt. In this case it has the following\n\t\t form\n\t\t ff253a152000 JMP QWORD [RIP + 0x20153A]\n\t\t 6690\t\t NOP\n\t\t ----\n\t\t ff25ec9f0408 JMP DWORD [reloc.puts_236]\n\t\t plt_addr + 2 to remove jmp opcode and get the imm reading 4\n\t\t and if RIP (plt_addr + 6) + imm == rel->offset\n\t\t return plt_addr, that will be our sym addr\n\t\t perhaps this hack doesn't work on 32 bits\n\t\t */\n\t\tint res = r_buf_read_at (bin->b, plt_addr + 2, buf, sizeof (ut32));\n\t\tif (res < 0) {\n\t\t\treturn UT64_MAX;\n\t\t}\n\n\t\tsize_t i = 0;\n\t\tplt_sym_addr = R_BIN_ELF_READWORD (buf, i);\n\n\t\t//relative address\n\t\tif ((plt_addr + 6 + Elf_(r_bin_elf_v2p) (bin, plt_sym_addr)) == rel->rva) {\n\t\t\treturn plt_addr;\n\t\t}\n\t\tif (plt_sym_addr == rel->rva) {\n\t\t\treturn plt_addr;\n\t\t}\n\t\tplt_addr += 8;\n\t}\n\n\treturn UT64_MAX;\n}\n\nstatic ut64 get_import_addr_x86(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 tmp = get_got_entry (bin, rel);\n\tif (tmp == UT64_MAX) {\n\t\treturn get_import_addr_x86_manual (bin, rel);\n\t}\n\n\tRBinElfSection *pltsec_section = get_section_by_name (bin, \".plt.sec\");\n\tif (pltsec_section) {\n\t\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\t\tut64 pos = COMPUTE_PLTGOT_POSITION (rel, got_addr, 0x3);\n\t\treturn pltsec_section->rva + pos * X86_PLT_ENTRY_SIZE;\n\t}\n\n\treturn tmp + X86_OFFSET_PLT_ENTRY_FROM_GOT_ADDR;\n}\n\nstatic ut64 get_import_addr(ELFOBJ *bin, int sym) {\n\tif ((!bin->shdr || !bin->strtab) && !bin->phdr) {\n\t\treturn UT64_MAX;\n\t}\n\n\tif (!bin->rel_cache) {\n\t\treturn UT64_MAX;\n\t}\n\n\t// lookup the right rel/rela entry\n\tRBinElfReloc *rel = ht_up_find (bin->rel_cache, sym, NULL);\n\tif (!rel) {\n\t\treturn UT64_MAX;\n\t}\n\n\tswitch (bin->ehdr.e_machine) {\n\tcase EM_ARM:\n\tcase EM_AARCH64:\n\t\treturn get_import_addr_arm (bin, rel);\n\tcase EM_MIPS: // MIPS32 BIG ENDIAN relocs\n\t\treturn get_import_addr_mips (bin, rel);\n\tcase EM_VAX:\n\t\t// as beautiful as riscv <3\n\t\treturn get_import_addr_riscv (bin, rel);\n\tcase EM_RISCV:\n\t\treturn get_import_addr_riscv (bin, rel);\n\tcase EM_SPARC:\n\tcase EM_SPARCV9:\n\tcase EM_SPARC32PLUS:\n\t\treturn get_import_addr_sparc (bin, rel);\n\tcase EM_PPC:\n\tcase EM_PPC64:\n\t\treturn get_import_addr_ppc (bin, rel);\n\tcase EM_386:\n\tcase EM_X86_64:\n\t\treturn get_import_addr_x86 (bin, rel);\n\tcase EM_LOONGARCH:\n\t\treturn get_import_addr_loongarch(bin, rel);\n\tdefault:\n\t\teprintf (\"Unsupported relocs type %\" PFMT64u \" for arch %d\\n\",\n\t\t\t\t(ut64) rel->type, bin->ehdr.e_machine);\n\t\treturn UT64_MAX;\n\t}\n}\n\nint Elf_(r_bin_elf_has_nx)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, 0);\n\tint i;\n\tif (bin && bin->phdr) {\n\t\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\t\tif (bin->phdr[i].p_type == PT_GNU_STACK) {\n\t\t\t\treturn (!(bin->phdr[i].p_flags & 1))? 1: 0;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nint Elf_(r_bin_elf_has_relro)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, R_ELF_NO_RELRO);\n\tbool haveBindNow = false;\n\tbool haveGnuRelro = false;\n\n\tif (bin->dyn_info.dt_bind_now) {\n\t\thaveBindNow = true;\n\t} else if (bin->dyn_info.dt_flags != R_BIN_ELF_XWORD_MAX && bin->dyn_info.dt_flags != R_BIN_ELF_XWORD_MAX) {\n\t\thaveBindNow = bin->dyn_info.dt_flags_1 & DF_1_NOW;\n\t}\n\n\tif (bin->phdr) {\n\t\tsize_t i;\n\t\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\t\tif (bin->phdr[i].p_type == PT_GNU_RELRO) {\n\t\t\t\thaveGnuRelro = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (haveGnuRelro) {\n\t\tif (haveBindNow) {\n\t\t\treturn R_ELF_FULL_RELRO;\n\t\t}\n\t\treturn R_ELF_PART_RELRO;\n\t}\n\treturn R_ELF_NO_RELRO;\n}\n\n/*\nTo compute the base address, one determines the memory\naddress associated with the lowest p_vaddr value for a\nPT_LOAD segment. One then obtains the base address by\ntruncating the memory address to the nearest multiple\nof the maximum page size\n*/\n\nut64 Elf_(r_bin_elf_get_baddr)(ELFOBJ *bin) {\n\tut64 tmp, base = UT64_MAX;\n\tif (!bin) {\n\t\treturn 0;\n\t}\n\tif (bin->phdr) {\n\t\tsize_t i;\n\t\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\t\tif (bin->phdr[i].p_type == PT_LOAD) {\n\t\t\t\ttmp = (ut64)bin->phdr[i].p_vaddr & ELF_PAGE_MASK;\n\t\t\t\ttmp = tmp - (tmp % (1 << ELF_PAGE_SIZE));\n\t\t\t\tif (tmp < base) {\n\t\t\t\t\tbase = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (base == UT64_MAX && is_bin_etrel (bin)) {\n\t\t//we return our own base address for ET_REL type\n\t\t//we act as a loader for ELF\n\t\treturn 0x08000000;\n\t}\n\treturn base == UT64_MAX? 0: base;\n}\n\nut64 Elf_(r_bin_elf_get_boffset)(ELFOBJ *bin) {\n\tut64 tmp, base = UT64_MAX;\n\tr_return_val_if_fail (bin, 0);\n\n\tif (!bin->phdr) {\n\t\treturn 0; // TODO: should return ut64.max\n\t}\n\n\tsize_t i;\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tif (bin->phdr[i].p_type == PT_LOAD) {\n\t\t\ttmp = (ut64)bin->phdr[i].p_offset & ELF_PAGE_MASK;\n\t\t\ttmp = tmp - (tmp % (1 << ELF_PAGE_SIZE));\n\t\t\tif (tmp < base) {\n\t\t\t\tbase = tmp;\n\t\t\t}\n\t\t}\n\t}\n\treturn base == UT64_MAX? 0: base;\n}\n\nut64 Elf_(r_bin_elf_get_init_offset)(ELFOBJ *bin) {\n\tut64 entry = Elf_(r_bin_elf_get_entry_offset) (bin);\n\tut8 buf[128];\n\tif (!bin || entry == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\tif (r_buf_read_at (bin->b, entry + 16, buf, sizeof (buf)) < 1) {\n\t\tR_LOG_ERROR (\"read (init_offset)\");\n\t\treturn 0;\n\t}\n\tif (buf[0] == 0x68) { // push // x86 only\n\t\tut64 addr;\n\t\tmemmove (buf, buf + 1, 4);\n\t\taddr = (ut64)r_read_le32 (buf);\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n\treturn 0;\n}\n\nut64 Elf_(r_bin_elf_get_fini_offset)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tut64 entry = Elf_(r_bin_elf_get_entry_offset) (bin);\n\tif (entry == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\tut8 buf[512];\n\tif (r_buf_read_at (bin->b, entry + 11, buf, sizeof (buf)) == -1) {\n\t\tR_LOG_ERROR (\"read (get_fini)\");\n\t\treturn 0;\n\t}\n\tif (*buf == 0x68) { // push // x86/32 only\n\t\tmemmove (buf, buf + 1, 4);\n\t\tut64 addr = (ut64)r_read_le32 (buf);\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n\treturn 0;\n}\n\nut64 Elf_(r_bin_elf_get_entry_offset)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tut64 entry = bin->ehdr.e_entry;\n\tif (!entry) {\n\t\tif (!Elf_(r_bin_elf_is_executable) (bin)) {\n\t\t\treturn UT64_MAX;\n\t\t}\n\t\tentry = Elf_(r_bin_elf_get_section_offset)(bin, \".init.text\");\n\t\tif (entry != UT64_MAX) {\n\t\t\treturn entry;\n\t\t}\n\t\tentry = Elf_(r_bin_elf_get_section_offset)(bin, \".text\");\n\t\tif (entry != UT64_MAX) {\n\t\t\treturn entry;\n\t\t}\n\t\treturn Elf_(r_bin_elf_get_section_offset)(bin, \".init\");\n\t}\n\treturn Elf_(r_bin_elf_v2p) (bin, entry);\n}\n\nstatic ut64 getmainsymbol(ELFOBJ *bin) {\n\tstruct r_bin_elf_symbol_t *symbol = Elf_(r_bin_elf_get_symbols) (bin);\n\tif (symbol) {\n\t\tsize_t i;\n\t\tfor (i = 0; !symbol[i].last; i++) {\n\t\t\tif (!strcmp (symbol[i].name, \"main\")) {\n\t\t\t\treturn symbol[i].offset;\n\t\t\t}\n\t\t}\n\t}\n\treturn UT64_MAX;\n}\n\nut64 Elf_(r_bin_elf_get_main_offset)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tut64 entry = Elf_(r_bin_elf_get_entry_offset) (bin);\n\tif (entry == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\tut8 buf[256];\n\tif (entry > bin->size || (entry + sizeof (buf)) > bin->size) {\n\t\treturn UT64_MAX;\n\t}\n\t// unnecessary to read 512 bytes imho\n\tif (r_buf_read_at (bin->b, entry, buf, sizeof (buf)) < 1) {\n\t\tR_LOG_ERROR (\"read (main)\");\n\t\treturn UT64_MAX;\n\t}\n\t// ARM64\n\tif (buf[0x18 + 3] == 0x58 && buf[0x2f] == 0x00) {\n\t\tut32 entry_vaddr = Elf_(r_bin_elf_p2v) (bin, entry);\n\t\tut32 main_addr = r_read_le32 (&buf[0x30]);\n\t\tif ((main_addr >> 16) == (entry_vaddr >> 16)) {\n\t\t\treturn Elf_(r_bin_elf_v2p) (bin, main_addr);\n\t\t}\n\t}\n\n\t// TODO: Use arch to identify arch before memcmp's\n\n\t// ARM Glibc\n\tif (entry & 1) {\n\t\tint delta = 0;\n\t\t/* thumb entry points */\n\t\tif (!memcmp (buf, \"\\xf0\\x00\\x0b\\x4f\\xf0\\x00\\x0e\\x02\\xbc\\x6a\\x46\", 11)) {\n\t\t\t/* newer versions of gcc use push/pop */\n\t\t\tdelta = 0x28;\n\t\t} else if (!memcmp (buf, \"\\xf0\\x00\\x0b\\x4f\\xf0\\x00\\x0e\\x5d\\xf8\\x04\\x1b\", 11)) {\n\t\t\t/* older versions of gcc (4.5.x) use ldr/str */\n\t\t\tdelta = 0x30;\n\t\t}\n\t\tif (delta) {\n\t\t\tut64 pa = Elf_(r_bin_elf_v2p) (bin, r_read_le32 (&buf[delta-1]) & ~1);\n\t\t\tif (pa < r_buf_size (bin->b)) {\n\t\t\t\treturn pa;\n\t\t\t}\n\t\t}\n\t} else {\n\t\t/* non-thumb entry points */\n\t\tif (!memcmp (buf, \"\\x00\\xb0\\xa0\\xe3\\x00\\xe0\\xa0\\xe3\", 8)) {\n\t\t\treturn Elf_(r_bin_elf_v2p) (bin, r_read_le32 (&buf[0x34]) & ~1);\n\t\t}\n\t\tif (!memcmp (buf, \"\\x24\\xc0\\x9f\\xe5\\x00\\xb0\\xa0\\xe3\", 8)) {\n\t\t\treturn Elf_(r_bin_elf_v2p) (bin, r_read_le32 (&buf[0x30]) & ~1);\n\t\t}\n\t}\n\n\t// MIPS\n\t/* get .got, calculate offset of main symbol */\n\tif (!memcmp (buf, \"\\x21\\x00\\xe0\\x03\\x01\\x00\\x11\\x04\", 8)) {\n\n\t\t/*\n\t\t assuming the startup code looks like\n\t\t got = gp-0x7ff0\n\t\t got[index__libc_start_main] ( got[index_main] );\n\n\t\t looking for the instruction generating the first argument to find main\n\t\t lw a0, offset(gp)\n\t\t*/\n\n\t\tut64 got_offset;\n\t\tif ((got_offset = Elf_(r_bin_elf_get_section_offset) (bin, \".got\")) != -1 ||\n\t\t (got_offset = Elf_(r_bin_elf_get_section_offset) (bin, \".got.plt\")) != -1)\n\t\t{\n\t\t\tconst ut64 gp = got_offset + 0x7ff0;\n\t\t\tsize_t i, len = sizeof (buf) / sizeof (buf[0]);\n\t\t\tfor (i = 0; i < len; i += 4) {\n\t\t\t\tconst ut32 instr = r_read_le32 (&buf[i]);\n\t\t\t\tif ((instr & 0xffff0000) == 0x8f840000) { // lw a0, offset(gp)\n\t\t\t\t\tconst short delta = instr & 0x0000ffff;\n\t\t\t\t\tr_buf_read_at (bin->b, /* got_entry_offset = */ gp + delta, buf, 4);\n\t\t\t\t\treturn Elf_(r_bin_elf_v2p) (bin, r_read_le32 (&buf[0]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t}\n\t// X86-CGC\n\tif (buf[0] == 0xe8 && !memcmp (buf + 5, \"\\x50\\xe8\\x00\\x00\\x00\\x00\\xb8\\x01\\x00\\x00\\x00\\x53\", 12)) {\n\t\tsize_t SIZEOF_CALL = 5;\n\t\tut64 rel_addr = (ut64)((int)(buf[1] + (buf[2] << 8) + (buf[3] << 16) + (buf[4] << 24)));\n\t\tut64 addr = Elf_(r_bin_elf_p2v)(bin, entry + SIZEOF_CALL);\n\t\taddr += rel_addr;\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n\t// X86-PIE\n\tif (buf[0x00] == 0x48 && buf[0x1e] == 0x8d && buf[0x11] == 0xe8) {\n\t\tut32 *pmain = (ut32*)(buf + 0x30);\n\t\tut64 vmain = Elf_(r_bin_elf_p2v) (bin, (ut64)*pmain);\n\t\tut64 ventry = Elf_(r_bin_elf_p2v) (bin, entry);\n\t\tif (vmain >> 16 == ventry >> 16) {\n\t\t\treturn (ut64)vmain;\n\t\t}\n\t}\n\t// X86-PIE\n\tif (buf[0x1d] == 0x48 && buf[0x1e] == 0x8b) {\n\t\tif (!memcmp (buf, \"\\x31\\xed\\x49\\x89\", 4)) {// linux\n\t\t\tut64 maddr, baddr;\n\t\t\tut8 n32s[sizeof (ut32)] = {0};\n\t\t\tmaddr = entry + 0x24 + r_read_le32 (buf + 0x20);\n\t\t\tif (r_buf_read_at (bin->b, maddr, n32s, sizeof (ut32)) == -1) {\n\t\t\t\tR_LOG_ERROR (\"read (maddr) 2\");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tmaddr = (ut64)r_read_le32 (&n32s[0]);\n\t\t\tbaddr = (bin->ehdr.e_entry >> 16) << 16;\n\t\t\tif (bin->phdr) {\n\t\t\t\tbaddr = Elf_(r_bin_elf_get_baddr) (bin);\n\t\t\t}\n\t\t\tmaddr += baddr;\n\t\t\treturn maddr;\n\t\t}\n\t}\n\t// X86-NONPIE\n#if R_BIN_ELF64\n\tif (!memcmp (buf, \"\\x49\\x89\\xd9\", 3) && buf[156] == 0xe8) { // openbsd\n\t\treturn r_read_le32 (&buf[157]) + entry + 156 + 5;\n\t}\n\tif (!memcmp (buf+29, \"\\x48\\xc7\\xc7\", 3)) { // linux\n\t\tut64 addr = (ut64)r_read_le32 (&buf[29 + 3]);\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n#else\n\tif (buf[23] == '\\x68') {\n\t\tut64 addr = (ut64)r_read_le32 (&buf[23 + 1]);\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n#endif\n\t/* linux64 pie main -- probably buggy in some cases */\n\tint bo = 29; // Begin offset may vary depending on the entry prelude\n\t// endbr64 - fedora bins have this\n\tif (buf[0] == 0xf3 && buf[1] == 0x0f && buf[2] == 0x1e && buf[3] == 0xfa) {\n\t\t// Change begin offset if binary starts with 'endbr64'\n\t\tbo = 33;\n\t}\n\tif (buf[bo] == 0x48) {\n\t\tut8 ch = buf[bo + 1];\n\t\tif (ch == 0x8d) { // lea rdi, qword [rip-0x21c4]\n\t\t\tut8 *p = buf + bo + 3;\n\t\t\tst32 maindelta = (st32)r_read_le32 (p);\n\t\t\tut64 vmain = (ut64)(entry + bo + maindelta) + 7;\n\t\t\tut64 ventry = Elf_(r_bin_elf_p2v) (bin, entry);\n\t\t\tif ((vmain >> 16) == (ventry >> 16)) {\n\t\t\t\treturn (ut64)vmain;\n\t\t\t}\n\t\t} else if (ch == 0xc7) { // mov rdi, 0xADDR\n\t\t\tut8 *p = buf + bo + 3;\n\t\t\treturn (ut64)(ut32)r_read_le32 (p);\n\t\t}\n\t}\n\n\t/* find sym.main if possible */\n\t{\n\t\tut64 m = getmainsymbol (bin);\n\t\tif (m != UT64_MAX) {\n\t\t\treturn m;\n\t\t}\n\t}\n\treturn UT64_MAX;\n}\n\nbool Elf_(r_bin_elf_get_stripped)(ELFOBJ *bin) {\n\tif (!bin->shdr) {\n\t\treturn false;\n\t}\n\tif (bin->g_sections) {\n\t\tsize_t i;\n\t\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\t\tif (!strcmp (bin->g_sections[i].name, \".gnu_debugdata\")) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\tsize_t i;\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tif (bin->shdr[i].sh_type == SHT_SYMTAB) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nchar *Elf_(r_bin_elf_intrp)(ELFOBJ *bin) {\n\tint i;\n\tif (!bin || !bin->phdr) {\n\t\treturn NULL;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tif (bin->phdr[i].p_type == PT_INTERP) {\n\t\t\tut64 addr = bin->phdr[i].p_offset;\n\t\t\tint sz = bin->phdr[i].p_filesz;\n\t\t\tsdb_num_set (bin->kv, \"elf_header.intrp_addr\", addr, 0);\n\t\t\tsdb_num_set (bin->kv, \"elf_header.intrp_size\", sz, 0);\n\t\t\tif (sz < 1 || sz > r_buf_size (bin->b)) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tchar *str = malloc (sz + 1);\n\t\t\tif (!str) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (r_buf_read_at (bin->b, addr, (ut8*)str, sz) < 1) {\n\t\t\t\tR_LOG_ERROR (\"read (main)\");\n\t\t\t\tfree (str);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tstr[sz] = 0;\n\t\t\tsdb_set (bin->kv, \"elf_header.intrp\", str, 0);\n\t\t\treturn str;\n\t\t}\n\t}\n\treturn NULL;\n}\n\nbool Elf_(r_bin_elf_is_static)(ELFOBJ *bin) {\n\tsize_t i;\n\tif (!bin->phdr) {\n\t\treturn false;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tif (bin->phdr[i].p_type == PT_INTERP ||\n\t\t\tbin->phdr[i].p_type == PT_DYNAMIC) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nchar* Elf_(r_bin_elf_get_data_encoding)(ELFOBJ *bin) {\n\tswitch (bin->ehdr.e_ident[EI_DATA]) {\n\tcase ELFDATANONE: return strdup (\"none\");\n\tcase ELFDATA2LSB: return strdup (\"2's complement, little endian\");\n\tcase ELFDATA2MSB: return strdup (\"2's complement, big endian\");\n\tdefault: return r_str_newf (\"\", bin->ehdr.e_ident[EI_DATA]);\n\t}\n}\n\nint Elf_(r_bin_elf_has_va)(ELFOBJ *bin) {\n\treturn true;\n}\n\nchar* Elf_(r_bin_elf_get_arch)(ELFOBJ *bin) {\n\tswitch (bin->ehdr.e_machine) {\n\tcase EM_ARC:\n\tcase EM_ARC_A5:\n\t\treturn strdup (\"arc\");\n\tcase EM_AVR: return strdup (\"avr\");\n\tcase EM_BA2_NON_STANDARD:\n\tcase EM_BA2: return strdup (\"ba2\");\n\tcase EM_CRIS: return strdup (\"cris\");\n\tcase EM_68K: return strdup (\"m68k\");\n\tcase EM_MIPS:\n\tcase EM_MIPS_RS3_LE:\n\tcase EM_MIPS_X:\n\t\treturn strdup (\"mips\");\n\tcase EM_MCST_ELBRUS:\n\t\treturn strdup (\"elbrus\");\n\tcase EM_TRICORE:\n\t\treturn strdup (\"tricore\");\n\tcase EM_RCE:\n\t\treturn strdup (\"mcore\");\n\tcase EM_ARM:\n\tcase EM_AARCH64:\n\t\treturn strdup (\"arm\");\n\tcase EM_QDSP6: // EM_HEXAGON\n\t\treturn strdup (\"hexagon\");\n\tcase EM_BLACKFIN:\n\t\treturn strdup (\"blackfin\");\n\tcase EM_SPARC:\n\tcase EM_SPARC32PLUS:\n\tcase EM_SPARCV9:\n\t\treturn strdup (\"sparc\");\n\tcase EM_PPC:\n\tcase EM_PPC64:\n\t\treturn strdup (\"ppc\");\n\tcase EM_PARISC:\n\t\treturn strdup (\"hppa\");\n\tcase EM_PROPELLER:\n\t\treturn strdup (\"propeller\");\n\tcase EM_MICROBLAZE:\n\t\treturn strdup (\"microblaze.gnu\");\n\tcase EM_RISCV:\n\t\treturn strdup (\"riscv\");\n\tcase EM_VAX:\n\t\treturn strdup (\"vax\");\n\tcase EM_XTENSA:\n\t\treturn strdup (\"xtensa\");\n\tcase EM_LANAI:\n\t\treturn strdup (\"lanai\");\n\tcase EM_VIDEOCORE3:\n\tcase EM_VIDEOCORE4:\n\t\treturn strdup (\"vc4\");\n\tcase EM_MSP430:\n\t\treturn strdup (\"msp430\");\n\tcase EM_SH:\n\t\treturn strdup (\"sh\");\n\tcase EM_V800:\n\t\treturn strdup (\"v850\");\n\tcase EM_V850:\n\t\treturn strdup (\"v850\");\n\tcase EM_IA_64:\n\t\treturn strdup (\"ia64\");\n\tcase EM_S390:\n\t\treturn strdup (\"s390\");\n\tcase EM_KVX:\n\t\treturn strdup(\"kvx\");\n\tcase EM_LOONGARCH:\n\t\treturn strdup (\"loongarch\");\n\tdefault: return strdup (\"x86\");\n\t}\n}\nchar* Elf_(r_bin_elf_get_abi)(ELFOBJ *bin) {\n\tElf_(Ehdr)* ehdr = (Elf_(Ehdr) *) &bin->ehdr;\n\n\tif (ehdr->e_machine == EM_MIPS) {\n\t\tif (is_elfclass64 (ehdr)) {\n\t\t\treturn strdup (\"n64\");\n\t\t}\n\t\tif (is_mips_n32 (ehdr)) {\n\t\t\treturn strdup (\"n32\");\n\t\t}\n\t\tif (is_mips_o32 (ehdr)) {\n\t\t\treturn strdup (\"o32\");\n\t\t}\n\t}\n\treturn NULL;\n}\n\nchar* Elf_(r_bin_elf_get_cpu)(ELFOBJ *bin) {\n\tif (bin->phdr && bin->ehdr.e_machine == EM_MIPS) {\n\t\tconst ut32 mipsType = bin->ehdr.e_flags & EF_MIPS_ARCH;\n\t\tswitch (mipsType) {\n\t\tcase EF_MIPS_ARCH_1: return strdup (\"mips1\");\n\t\tcase EF_MIPS_ARCH_2: return strdup (\"mips2\");\n\t\tcase EF_MIPS_ARCH_3: return strdup (\"mips3\");\n\t\tcase EF_MIPS_ARCH_4: return strdup (\"mips4\");\n\t\tcase EF_MIPS_ARCH_5: return strdup (\"mips5\");\n\t\tcase EF_MIPS_ARCH_32: return strdup (\"mips32\");\n\t\tcase EF_MIPS_ARCH_64: return strdup (\"mips64\");\n\t\tcase EF_MIPS_ARCH_32R2: return strdup (\"mips32r2\");\n\t\tcase EF_MIPS_ARCH_64R2: return strdup (\"mips64r2\");\n\t\tdefault : return strdup (\" Unknown mips ISA\");\n\t\t}\n\t}\n\treturn NULL;\n}\n\nchar* Elf_(r_bin_elf_get_head_flag)(ELFOBJ *bin) {\n\tchar *head_flag = NULL;\n\tchar *str = Elf_(r_bin_elf_get_cpu) (bin);\n\tif (str) {\n\t\thead_flag = r_str_append (head_flag, str);\n\t\tfree (str);\n\t}\n\tstr = Elf_(r_bin_elf_get_abi) (bin);\n\tif (str) {\n\t\thead_flag = r_str_appendf (head_flag, \" %s\", str);\n\t\tfree (str);\n\t}\n\tif (R_STR_ISEMPTY (head_flag)) {\n\t\thead_flag = r_str_append (head_flag, \"unknown_flag\");\n\t}\n\treturn head_flag;\n}\n\n// http://www.sco.com/developers/gabi/latest/ch4.eheader.html\n\nchar* Elf_(r_bin_elf_get_machine_name)(ELFOBJ *bin) {\n\tswitch (bin->ehdr.e_machine) {\n\tcase EM_NONE: return strdup (\"No machine\");\n\tcase EM_M32: return strdup (\"AT&T WE 32100\");\n\tcase EM_SPARC: return strdup (\"SUN SPARC\");\n\tcase EM_386: return strdup (\"Intel 80386\");\n\tcase EM_68K: return strdup (\"Motorola m68k family\");\n\tcase EM_88K: return strdup (\"Motorola m88k family\");\n\tcase EM_860: return strdup (\"Intel 80860\");\n\tcase EM_MIPS: return strdup (\"MIPS R3000\");\n\tcase EM_S370: return strdup (\"IBM System/370\");\n\tcase EM_MIPS_RS3_LE: return strdup (\"MIPS R3000 little-endian\");\n\tcase EM_PARISC: return strdup (\"HPPA\");\n\tcase EM_VPP500: return strdup (\"Fujitsu VPP500\");\n\tcase EM_SPARC32PLUS: return strdup (\"Sun's \\\"v8plus\\\"\");\n\tcase EM_960: return strdup (\"Intel 80960\");\n\tcase EM_PPC: return strdup (\"PowerPC\");\n\tcase EM_PPC64: return strdup (\"PowerPC 64-bit\");\n\tcase EM_S390: return strdup (\"IBM S390\");\n\tcase EM_V800: return strdup (\"NEC V800 series\");\n\tcase EM_FR20: return strdup (\"Fujitsu FR20\");\n\tcase EM_RH32: return strdup (\"TRW RH-32\");\n\tcase EM_RCE: return strdup (\"Motorola RCE\");\n\tcase EM_ARM: return strdup (\"ARM\");\n\tcase EM_BLACKFIN: return strdup (\"Analog Devices Blackfin\");\n\tcase EM_FAKE_ALPHA: return strdup (\"Digital Alpha\");\n\tcase EM_SH: return strdup (\"Hitachi SH\");\n\tcase EM_SPARCV9: return strdup (\"SPARC v9 64-bit\");\n\tcase EM_TRICORE: return strdup (\"Siemens Tricore\");\n\tcase EM_ARC: return strdup (\"Argonaut RISC Core\");\n\tcase EM_H8_300: return strdup (\"Hitachi H8/300\");\n\tcase EM_H8_300H: return strdup (\"Hitachi H8/300H\");\n\tcase EM_H8S: return strdup (\"Hitachi H8S\");\n\tcase EM_H8_500: return strdup (\"Hitachi H8/500\");\n\tcase EM_IA_64: return strdup (\"Intel Merced\");\n\tcase EM_MIPS_X: return strdup (\"Stanford MIPS-X\");\n\tcase EM_COLDFIRE: return strdup (\"Motorola Coldfire\");\n\tcase EM_68HC12: return strdup (\"Motorola M68HC12\");\n\tcase EM_MMA: return strdup (\"Fujitsu MMA Multimedia Accelerator\");\n\tcase EM_PCP: return strdup (\"Siemens PCP\");\n\tcase EM_NCPU: return strdup (\"Sony nCPU embeeded RISC\");\n\tcase EM_NDR1: return strdup (\"Denso NDR1 microprocessor\");\n\tcase EM_STARCORE: return strdup (\"Motorola Start*Core processor\");\n\tcase EM_ME16: return strdup (\"Toyota ME16 processor\");\n\tcase EM_ST100: return strdup (\"STMicroelectronic ST100 processor\");\n\tcase EM_TINYJ: return strdup (\"Advanced Logic Corp. Tinyj emb.fam\");\n\tcase EM_X86_64: return strdup (\"AMD x86-64 architecture\");\n\tcase EM_LANAI: return strdup (\"32bit LANAI architecture\");\n\tcase EM_PDSP: return strdup (\"Sony DSP Processor\");\n\tcase EM_PDP10: return strdup (\"Digital Equipment Corp. PDP-10\");\n\tcase EM_PDP11: return strdup (\"Digital Equipment Corp. PDP-11\");\n\tcase EM_FX66: return strdup (\"Siemens FX66 microcontroller\");\n\tcase EM_ST9PLUS: return strdup (\"STMicroelectronics ST9+ 8/16 mc\");\n\tcase EM_ST7: return strdup (\"STmicroelectronics ST7 8 bit mc\");\n\tcase EM_68HC16: return strdup (\"Motorola MC68HC16 microcontroller\");\n\tcase EM_68HC11: return strdup (\"Motorola MC68HC11 microcontroller\");\n\tcase EM_68HC08: return strdup (\"Motorola MC68HC08 microcontroller\");\n\tcase EM_68HC05: return strdup (\"Motorola MC68HC05 microcontroller\");\n\tcase EM_SVX: return strdup (\"Silicon Graphics SVx\");\n\tcase EM_ST19: return strdup (\"STMicroelectronics ST19 8 bit mc\");\n\tcase EM_VAX: return strdup (\"Digital VAX\");\n\tcase EM_CRIS: return strdup (\"Axis Communications 32-bit embedded processor\");\n\tcase EM_JAVELIN: return strdup (\"Infineon Technologies 32-bit embedded processor\");\n\tcase EM_FIREPATH: return strdup (\"Element 14 64-bit DSP Processor\");\n\tcase EM_ZSP: return strdup (\"LSI Logic 16-bit DSP Processor\");\n\tcase EM_MMIX: return strdup (\"Donald Knuth's educational 64-bit processor\");\n\tcase EM_HUANY: return strdup (\"Harvard University machine-independent object files\");\n\tcase EM_PRISM: return strdup (\"SiTera Prism\");\n\tcase EM_AVR: return strdup (\"Atmel AVR 8-bit microcontroller\");\n\tcase EM_FR30: return strdup (\"Fujitsu FR30\");\n\tcase EM_D10V: return strdup (\"Mitsubishi D10V\");\n\tcase EM_D30V: return strdup (\"Mitsubishi D30V\");\n\tcase EM_V850: return strdup (\"NEC v850\");\n\tcase EM_M32R: return strdup (\"Mitsubishi M32R\");\n\tcase EM_MN10300: return strdup (\"Matsushita MN10300\");\n\tcase EM_MN10200: return strdup (\"Matsushita MN10200\");\n\tcase EM_PJ: return strdup (\"picoJava\");\n\tcase EM_OPENRISC: return strdup (\"OpenRISC 32-bit embedded processor\");\n\tcase EM_ARC_A5: return strdup (\"ARC Cores Tangent-A5\");\n\tcase EM_XTENSA: return strdup (\"Tensilica Xtensa Architecture\");\n\tcase EM_AARCH64: return strdup (\"ARM aarch64\");\n\tcase EM_PROPELLER: return strdup (\"Parallax Propeller\");\n\tcase EM_MICROBLAZE: return strdup (\"Xilinx MicroBlaze\");\n\tcase EM_RISCV: return strdup (\"RISC V\");\n\tcase EM_VIDEOCORE3: return strdup (\"VideoCore III\");\n\tcase EM_VIDEOCORE4: return strdup (\"VideoCore IV\");\n\tcase EM_LATTICEMICO32: return strdup (\"RISC processor for Lattice FPGA architecture\");\n\tcase EM_SE_C17: return strdup (\"Seiko Epson C17 family\");\n\tcase EM_TI_C6000: return strdup (\"The Texas Instruments TMS320C6000 DSP family\");\n\tcase EM_TI_C2000: return strdup (\"The Texas Instruments TMS320C2000 DSP family\");\n\tcase EM_TI_C5500: return strdup (\"The Texas Instruments TMS320C55x DSP family\");\n\tcase EM_TI_ARP32: return strdup (\"Texas Instruments Application Specific RISC Processor, 32bit fetch\");\n\tcase EM_TI_PRU: return strdup (\"Texas Instruments Programmable Realtime Unit\");\n\tcase EM_MMDSP_PLUS: return strdup (\"STMicroelectronics 64bit VLIW Data Signal Processor\");\n\tcase EM_CYPRESS_M8C: return strdup (\"Cypress M8C microprocessor\");\n\tcase EM_R32C: return strdup (\"Renesas R32C series microprocessors\");\n\tcase EM_TRIMEDIA: return strdup (\"NXP Semiconductors TriMedia architecture family\");\n\tcase EM_QDSP6: return strdup (\"QUALCOMM DSP6 Processor\"); // Nonstandard\n\tcase EM_8051: return strdup (\"Intel 8051 and variants\");\n\tcase EM_STXP7X: return strdup (\"STMicroelectronics STxP7x family of configurable and extensible RISC processors\");\n\tcase EM_NDS32: return strdup (\"Andes Technology compact code size embedded RISC processor family\");\n\tcase EM_ECOG1: return strdup (\"Cyan Technology eCOG1X family\");\n\t// case EM_ECOG1X: return strdup (\"Cyan Technology eCOG1X family\"); // Nonstandard\n\tcase EM_MAXQ30: return strdup (\"Dallas Semiconductor MAXQ30 Core Micro-controllers\");\n\tcase EM_XIMO16: return strdup (\"New Japan Radio (NJR) 16-bit DSP Processor\");\n\tcase EM_MANIK: return strdup (\"M2000 Reconfigurable RISC Microprocessor\");\n\tcase EM_CRAYNV2: return strdup (\"Cray Inc. NV2 vector architecture\");\n\tcase EM_RX: return strdup (\"Renesas RX family\");\n\tcase EM_METAG: return strdup (\"Imagination Technologies META processor architecture\");\n\tcase EM_MCST_ELBRUS: return strdup (\"MCST Elbrus general purpose hardware architecture\");\n\tcase EM_ECOG16: return strdup (\"Cyan Technology eCOG16 family\");\n\tcase EM_CR16: return strdup (\"National Semiconductor CompactRISC CR16 16-bit microprocessor\");\n\tcase EM_ETPU: return strdup (\"Freescale Extended Time Processing Unit\");\n\tcase EM_SLE9X: return strdup (\"Infineon Technologies SLE9X core\");\n\tcase EM_L10M: return strdup (\"Intel L10M\");\n\tcase EM_K10M: return strdup (\"Intel K10M\");\n\t// case EM_AARCH64: return strdup (\"ARM 64-bit architecture (AARCH64)\"); // Nonstandard\n\tcase EM_AVR32: return strdup (\"Atmel Corporation 32-bit microprocessor family\");\n\tcase EM_STM8: return strdup (\"STMicroeletronics STM8 8-bit microcontroller\");\n\tcase EM_TILE64: return strdup (\"Tilera TILE64 multicore architecture family\");\n\tcase EM_TILEPRO: return strdup (\"Tilera TILEPro multicore architecture family\");\n\t// case EM_MICROBLAZE: return strdup (\"Xilinx MicroBlaze 32-bit RISC soft processor core\"); // Nonstandard\n\tcase EM_CUDA: return strdup (\"NVIDIA CUDA architecture\");\n\tcase EM_TILEGX: return strdup (\"Tilera TILE-Gx multicore architecture family\");\n\tcase EM_CLOUDSHIELD: return strdup (\"CloudShield architecture family\");\n\tcase EM_COREA_1ST: return strdup (\"KIPO-KAIST Core-A 1st generation processor family\");\n\tcase EM_COREA_2ND: return strdup (\"KIPO-KAIST Core-A 2nd generation processor family\");\n\tcase EM_ARC_COMPACT2: return strdup (\"Synopsys ARCompact V2\");\n\tcase EM_OPEN8: return strdup (\"Open8 8-bit RISC soft processor core\");\n\tcase EM_RL78: return strdup (\"Renesas RL78 family\");\n\tcase EM_VIDEOCORE5: return strdup (\"Broadcom VideoCore V processor\");\n\tcase EM_78KOR: return strdup (\"Renesas 78KOR family\");\n\t// case EM_56800EX: return strdup (\"Freescale 56800EX Digital Signal Controller (DSC)\"); // Nonstandard\n\tcase EM_BA1: return strdup (\"Beyond BA1 CPU architecture\");\n\tcase EM_BA2_NON_STANDARD:\n\tcase EM_BA2: return strdup (\"Beyond BA2 CPU architecture\");\n\tcase EM_XCORE: return strdup (\"XMOS xCORE processor family\");\n\tcase EM_MCHP_PIC: return strdup (\"Microchip 8-bit PIC(r) family\");\n\tcase EM_INTEL205: return strdup (\"Reserved by Intel\");\n\tcase EM_INTEL206: return strdup (\"Reserved by Intel\");\n\tcase EM_INTEL207: return strdup (\"Reserved by Intel\");\n\tcase EM_INTEL208: return strdup (\"Reserved by Intel\");\n\tcase EM_INTEL209: return strdup (\"Reserved by Intel\");\n\tcase EM_KM32: return strdup (\"KM211 KM32 32-bit processor\");\n\tcase EM_KMX32: return strdup (\"KM211 KMX32 32-bit processor\");\n\tcase EM_KMX16: return strdup (\"KM211 KMX16 16-bit processor\");\n\tcase EM_KMX8: return strdup (\"KM211 KMX8 8-bit processor\");\n\tcase EM_KVARC: return strdup (\"KM211 KVARC processor\");\n\tcase EM_CDP: return strdup (\"Paneve CDP architecture family\");\n\tcase EM_COGE: return strdup (\"Cognitive Smart Memory Processor\");\n\tcase EM_COOL: return strdup (\"Bluechip Systems CoolEngine\");\n\tcase EM_NORC: return strdup (\"Nanoradio Optimized RISC\");\n\tcase EM_CSR_KALIMBA: return strdup (\"CSR Kalimba architecture family\");\n\tcase EM_Z80: return strdup (\"Zilog Z80\");\n\tcase EM_VISIUM: return strdup (\"Controls and Data Services VISIUMcore processor\");\n\tcase EM_FT32: return strdup (\"FTDI Chip FT32 high performance 32-bit RISC architecture\");\n\tcase EM_MOXIE: return strdup (\"Moxie processor family\");\n\tcase EM_AMDGPU: return strdup (\"AMD GPU architecture\");\n\tcase EM_LOONGARCH: return strdup (\"Loongson Loongarch\");\n\n\tdefault: return r_str_newf (\": 0x%x\", bin->ehdr.e_machine);\n\t}\n}\n\nchar* Elf_(r_bin_elf_get_file_type)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, NULL);\n\tut32 e_type = (ut32)bin->ehdr.e_type; // cast to avoid warn in iphone-gcc, must be ut16\n\tswitch (e_type) {\n\tcase ET_NONE: return strdup (\"NONE (None)\");\n\tcase ET_REL: return strdup (\"REL (Relocatable file)\");\n\tcase ET_EXEC: return strdup (\"EXEC (Executable file)\");\n\tcase ET_DYN: return strdup (\"DYN (Shared object file)\");\n\tcase ET_CORE: return strdup (\"CORE (Core file)\");\n\t}\n\tif ((e_type >= ET_LOPROC) && (e_type <= ET_HIPROC)) {\n\t\treturn r_str_newf (\"Processor Specific: %x\", e_type);\n\t}\n\tif ((e_type >= ET_LOOS) && (e_type <= ET_HIOS)) {\n\t\treturn r_str_newf (\"OS Specific: %x\", e_type);\n\t}\n\treturn r_str_newf (\": %x\", e_type);\n}\n\nchar* Elf_(r_bin_elf_get_elf_class)(ELFOBJ *bin) {\n\tswitch (bin->ehdr.e_ident[EI_CLASS]) {\n\tcase ELFCLASSNONE: return strdup (\"none\");\n\tcase ELFCLASS32: return strdup (\"ELF32\");\n\tcase ELFCLASS64: return strdup (\"ELF64\");\n\tdefault: return r_str_newf (\"\", bin->ehdr.e_ident[EI_CLASS]);\n\t}\n}\n\nint Elf_(r_bin_elf_get_bits)(ELFOBJ *bin) {\n\t/* Hack for ARCompact */\n\tif (bin->ehdr.e_machine == EM_ARC_A5) {\n\t\treturn 16;\n\t}\n\t/* Hack for Ps2 */\n\tif (bin->phdr && bin->ehdr.e_machine == EM_MIPS) {\n\t\tconst ut32 mipsType = bin->ehdr.e_flags & EF_MIPS_ARCH;\n\t\tif (bin->ehdr.e_type == ET_EXEC) {\n\t\t\tint i;\n\t\t\tbool haveInterp = false;\n\t\t\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\t\t\tif (bin->phdr[i].p_type == PT_INTERP) {\n\t\t\t\t\thaveInterp = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!haveInterp && mipsType == EF_MIPS_ARCH_3) {\n\t\t\t\t// Playstation2 Hack\n\t\t\t\treturn 64;\n\t\t\t}\n\t\t}\n\t\t// TODO: show this specific asm.cpu somewhere in bininfo (mips1, mips2, mips3, mips32r2, ...)\n\t\tswitch (mipsType) {\n\t\tcase EF_MIPS_ARCH_1:\n\t\tcase EF_MIPS_ARCH_2:\n\t\tcase EF_MIPS_ARCH_3:\n\t\tcase EF_MIPS_ARCH_4:\n\t\tcase EF_MIPS_ARCH_5:\n\t\tcase EF_MIPS_ARCH_32:\n\t\t\treturn 32;\n\t\tcase EF_MIPS_ARCH_64:\n\t\t\treturn 64;\n\t\tcase EF_MIPS_ARCH_32R2:\n\t\t\treturn 32;\n\t\tcase EF_MIPS_ARCH_64R2:\n\t\t\treturn 64;\n\t\t\tbreak;\n\t\t}\n\t\treturn 32;\n\t}\n\t/* Hack for Thumb */\n\tif (bin->ehdr.e_machine == EM_ARM) {\n\t\tif (bin->ehdr.e_type != ET_EXEC) {\n\t\t\tstruct r_bin_elf_symbol_t *symbol;\n\t\t\tif ((symbol = Elf_(r_bin_elf_get_symbols) (bin))) {\n\t\t\t\tint i = 0;\n\t\t\t\tfor (i = 0; !symbol[i].last; i++) {\n\t\t\t\t\tut64 paddr = symbol[i].offset;\n\t\t\t\t\tif (paddr & 1) {\n\t\t\t\t\t\treturn 16;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tut64 entry = Elf_(r_bin_elf_get_entry_offset) (bin);\n\t\tif (entry & 1) {\n\t\t\treturn 16;\n\t\t}\n\t}\n\tswitch (bin->ehdr.e_ident[EI_CLASS]) {\n\tcase ELFCLASS32: return 32;\n\tcase ELFCLASS64: return 64;\n\tcase ELFCLASSNONE:\n\tdefault: return 32; // defaults\n\t}\n}\n\nstatic inline int noodle(ELFOBJ *bin, const char *s) {\n\tif (r_buf_size (bin->b) >= 64) {\n\t\tut8 tmp[64] = {0};\n\t\tif (r_buf_read_at (bin->b, r_buf_size (bin->b) - 64, tmp, 64) == 64) {\n\t\t\treturn (bool)r_mem_mem (tmp, 64, (const ut8 *)s, strlen (s));\n\t\t}\n\t}\n\treturn false;\n}\n\nstatic inline bool needle(ELFOBJ *bin, const char *s) {\n\tif (bin->shstrtab) {\n\t\tut32 len = bin->shstrtab_size;\n\t\tif (len > 4096) {\n\t\t\tlen = 4096; // avoid slow loading .. can be buggy?\n\t\t}\n\t\treturn (bool)r_mem_mem ((const ut8*)bin->shstrtab, len,\n\t\t\t\t(const ut8*)s, strlen (s));\n\t}\n\treturn false;\n}\n\n// TODO: must return const char * all those strings must be const char os[LINUX] or so\nchar* Elf_(r_bin_elf_get_osabi_name)(ELFOBJ *bin) {\n\tsize_t i;\n\tsize_t num = bin->ehdr.e_shnum;\n\tconst char *section_name = NULL;\n\tswitch (bin->ehdr.e_ident[EI_OSABI]) {\n\tcase ELFOSABI_LINUX: return strdup(\"linux\");\n\tcase ELFOSABI_SOLARIS: return strdup(\"solaris\");\n\tcase ELFOSABI_FREEBSD: return strdup(\"freebsd\");\n\tcase ELFOSABI_HPUX: return strdup(\"hpux\");\n\t}\n\n\tif (bin->shdr && bin->shstrtab) {\n\t\tfor (i = 0; i < num; i++) {\n\t\t\tif (bin->shdr[i].sh_type == SHT_NOTE && bin->shdr[i].sh_name < bin->shstrtab_size) {\n\t\t\t\tsection_name = &bin->shstrtab[bin->shdr[i].sh_name];\n\t\t\t\tif (!strcmp (section_name, \".note.openbsd.ident\")) {\n\t\t\t\t\treturn strdup (\"openbsd\");\n\t\t\t\t}\n\t\t\t\tif (!strcmp (section_name, \".note.minix.ident\")) {\n\t\t\t\t\treturn strdup (\"minix\");\n\t\t\t\t}\n\t\t\t\tif (!strcmp (section_name, \".note.netbsd.ident\")) {\n\t\t\t\t\treturn strdup (\"netbsd\");\n\t\t\t\t}\n\t\t\t\tif (!strcmp (section_name, \".note.android.ident\")) {\n\t\t\t\t\treturn strdup (\"android\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t/* Hack to identify OS */\n\tif (needle (bin, \"freebsd\")) {\n\t\treturn strdup (\"freebsd\");\n\t}\n\tif (noodle (bin, \"BEOS:APP_VERSION\")) {\n\t\treturn strdup (\"beos\");\n\t}\n\tif (needle (bin, \"GNU\")) {\n\t\treturn strdup (\"linux\");\n\t}\n\treturn strdup (\"linux\");\n}\n\nut8 *Elf_(r_bin_elf_grab_regstate)(ELFOBJ *bin, int *len) {\n\tif (bin->phdr) {\n\t\tsize_t i;\n\t\tint num = bin->ehdr.e_phnum;\n\t\tfor (i = 0; i < num; i++) {\n\t\t\tif (bin->phdr[i].p_type != PT_NOTE) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tint bits = Elf_(r_bin_elf_get_bits)(bin);\n\t\t\tint elf_nhdr_size = (bits == 64) ? sizeof (Elf64_Nhdr) : sizeof (Elf32_Nhdr);\n\t\t\tvoid *elf_nhdr = calloc (elf_nhdr_size, 1);\n\t\t\tbool regs_found = false;\n\t\t\tut64 offset = 0;\n\n\t\t\twhile (!regs_found) {\n\t\t\t\tut32 n_descsz, n_namesz, n_type;\n\t\t\t\tint ret;\n\t\t\t\tret = r_buf_read_at (bin->b, bin->phdr[i].p_offset + offset, elf_nhdr, elf_nhdr_size);\n\t\t\t\tif (ret != elf_nhdr_size) {\n\t\t\t\t\tR_LOG_DEBUG (\"Cannot read NOTES hdr from CORE file\");\n\t\t\t\t\tfree (elf_nhdr);\n\t\t\t\t\treturn NULL;\n\t\t\t\t}\n\t\t\t\tif (bits == 64) {\n\t\t\t\t\tn_descsz = round_up (((Elf64_Nhdr *)elf_nhdr)->n_descsz);\n\t\t\t\t\tn_namesz = round_up (((Elf64_Nhdr *)elf_nhdr)->n_namesz);\n\t\t\t\t\tn_type = ((Elf64_Nhdr *)elf_nhdr)->n_type;\n\t\t\t\t} else {\n\t\t\t\t\tn_descsz = round_up (((Elf32_Nhdr *)elf_nhdr)->n_descsz);\n\t\t\t\t\tn_namesz = round_up (((Elf32_Nhdr *)elf_nhdr)->n_namesz);\n\t\t\t\t\tn_type = ((Elf32_Nhdr *)elf_nhdr)->n_type;\n\t\t\t\t}\n\t\t\t\tif (n_type == NT_PRSTATUS) {\n\t\t\t\t\tregs_found = true;\n\t\t\t\t\tfree (elf_nhdr);\n\t\t\t\t} else {\n\t\t\t\t\toffset += elf_nhdr_size + n_descsz + n_namesz;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint regdelta = 0;\n\t\t\tint regsize = 0;\n\t\t\tswitch (bin->ehdr.e_machine) {\n\t\t\t\tcase EM_AARCH64:\n\t\t\t\t\tregsize = reginf[AARCH64].regsize;\n\t\t\t\t\tregdelta = reginf[AARCH64].regdelta;\n\t\t\t\t\tbreak;\n\t\t\t\tcase EM_ARM:\n\t\t\t\t\tregsize = reginf[ARM].regsize;\n\t\t\t\t\tregdelta = reginf[ARM].regdelta;\n\t\t\t\t\tbreak;\n\t\t\t\tcase EM_386:\n\t\t\t\t\tregsize = reginf[X86].regsize;\n\t\t\t\t\tregdelta = reginf[X86].regdelta;\n\t\t\t\t\tbreak;\n\t\t\t\tcase EM_X86_64:\n\t\t\t\t\tregsize = reginf[X86_64].regsize;\n\t\t\t\t\tregdelta = reginf[X86_64].regdelta;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tut8 *buf = malloc (regsize);\n\t\t\tif (r_buf_read_at (bin->b, bin->phdr[i].p_offset + offset + regdelta, buf, regsize) != regsize) {\n\t\t\t\tfree (buf);\n\t\t\t\tR_LOG_DEBUG (\"Cannot read register state from CORE file\");\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (len) {\n\t\t\t\t*len = regsize;\n\t\t\t}\n\t\t\treturn buf;\n\t\t}\n\t}\n\tR_LOG_DEBUG (\"Cannot find NOTE section.\");\n\treturn NULL;\n}\n\nint Elf_(r_bin_elf_is_big_endian)(ELFOBJ *bin) {\n\treturn (bin->ehdr.e_ident[EI_DATA] == ELFDATA2MSB);\n}\n\n/* XXX Init dt_strtab? */\nchar *Elf_(r_bin_elf_get_rpath)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, NULL);\n\tElf_(Xword) val;\n\n\tif (!bin->phdr || !bin->strtab) {\n\t\treturn NULL;\n\t}\n\n\tif (bin->dyn_info.dt_rpath != R_BIN_ELF_XWORD_MAX) {\n\t\tval = bin->dyn_info.dt_rpath;\n\t} else if (bin->dyn_info.dt_runpath != R_BIN_ELF_XWORD_MAX) {\n\t\tval = bin->dyn_info.dt_runpath;\n\t} else {\n\t\treturn NULL;\n\t}\n\n\tif (val > bin->strtab_size) {\n\t\treturn NULL;\n\t}\n\n\treturn r_str_ndup (bin->strtab + val, ELF_STRING_LENGTH);\n}\n\nstatic bool has_valid_section_header(ELFOBJ *bin, size_t pos) {\n\treturn bin->g_sections[pos].info < bin->ehdr.e_shnum && bin->shdr;\n}\n\nstatic void fix_rva_and_offset_relocable_file(ELFOBJ *bin, RBinElfReloc *r, size_t pos) {\n\tif (has_valid_section_header (bin, pos)) {\n\t\tsize_t idx = bin->g_sections[pos].info;\n\t\tif (idx < bin->ehdr.e_shnum) {\n\t\t\tut64 pa = bin->shdr[idx].sh_offset + r->offset;\n\t\t\tr->offset = pa;\n\t\t\tr->rva = Elf_(r_bin_elf_p2v) (bin, pa);\n\t\t} else {\n\t\t\teprintf (\"fix_rva_and_offset_reloc..: invalid index\\n\");\n\t\t}\n\t} else {\n\t\tr->rva = r->offset;\n\t}\n}\n\nstatic void fix_rva_and_offset_exec_file(ELFOBJ *bin, RBinElfReloc *r) {\n\tr->rva = r->offset;\n\tr->offset = Elf_(r_bin_elf_v2p) (bin, r->offset);\n}\n\nstatic void fix_rva_and_offset(ELFOBJ *bin, RBinElfReloc *r, size_t pos) {\n\tif (is_bin_etrel (bin)) {\n\t\tfix_rva_and_offset_relocable_file (bin, r, pos);\n\t} else {\n\t\tfix_rva_and_offset_exec_file (bin, r);\n\t}\n}\n\nstatic bool read_reloc(ELFOBJ *bin, RBinElfReloc *r, Elf_(Xword) rel_mode, ut64 vaddr) {\n\tut64 offset = Elf_(r_bin_elf_v2p_new) (bin, vaddr);\n\tif (offset == UT64_MAX) {\n\t\treturn false;\n\t}\n\n\tsize_t size_struct = get_size_rel_mode (rel_mode);\n\n\tut8 buf[sizeof (Elf_(Rela))] = {0};\n\tint res = r_buf_read_at (bin->b, offset, buf, size_struct);\n\tif (res != size_struct) {\n\t\treturn false;\n\t}\n\n\tsize_t i = 0;\n\tElf_(Rela) reloc_info;\n\n\treloc_info.r_offset = R_BIN_ELF_READWORD (buf, i);\n\treloc_info.r_info = R_BIN_ELF_READWORD (buf, i);\n\n\tif (rel_mode == DT_RELA) {\n\t\treloc_info.r_addend = R_BIN_ELF_READWORD (buf, i);\n\t\tr->addend = reloc_info.r_addend;\n\t}\n\n\tr->mode = rel_mode;\n\tr->last = 0;\n\tr->offset = reloc_info.r_offset;\n\tr->sym = ELF_R_SYM (reloc_info.r_info);\n\tr->type = ELF_R_TYPE (reloc_info.r_info);\n\n\treturn true;\n}\n\nstatic size_t get_num_relocs_dynamic(ELFOBJ *bin) {\n\tsize_t res = 0;\n\n\tif (bin->dyn_info.dt_relaent) {\n\t\tres += bin->dyn_info.dt_relasz / bin->dyn_info.dt_relaent;\n\t}\n\n\tif (bin->dyn_info.dt_relent) {\n\t\tres += bin->dyn_info.dt_relsz / bin->dyn_info.dt_relent;\n\t}\n\n\treturn res + get_num_relocs_dynamic_plt (bin);\n}\n\nstatic bool sectionIsValid(ELFOBJ *bin, RBinElfSection *sect) {\n\treturn (sect->offset + sect->size <= bin->size);\n}\n\nstatic Elf_(Xword) get_section_mode(ELFOBJ *bin, size_t pos) {\n\tif (r_str_startswith (bin->g_sections[pos].name, \".rela.\")) {\n\t\treturn DT_RELA;\n\t}\n\tif (r_str_startswith (bin->g_sections[pos].name, \".rel.\")) {\n\t\treturn DT_REL;\n\t}\n\treturn 0;\n}\n\nstatic bool is_reloc_section(Elf_(Xword) rel_mode) {\n\treturn rel_mode == DT_REL || rel_mode == DT_RELA;\n}\n\nstatic size_t get_num_relocs_sections(ELFOBJ *bin) {\n\tsize_t i, size, ret = 0;\n\tElf_(Xword) rel_mode;\n\n\tif (!bin->g_sections) {\n\t\treturn 0;\n\t}\n\n\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\tif (!sectionIsValid (bin, &bin->g_sections[i])) {\n\t\t\tcontinue;\n\t\t}\n\t\trel_mode = get_section_mode (bin, i);\n\t\tif (!is_reloc_section (rel_mode)) {\n\t\t\tcontinue;\n\t\t}\n\t\tsize = get_size_rel_mode (rel_mode);\n\t\tret += NUMENTRIES_ROUNDUP (bin->g_sections[i].size, size);\n\t}\n\n\treturn ret;\n}\n\nstatic size_t get_num_relocs_approx(ELFOBJ *bin) {\n\tsize_t total = get_num_relocs_dynamic (bin) + get_num_relocs_sections (bin);\n\tif (total > bin->size) {\n\t\treturn bin->size / 2;\n\t}\n\treturn total;\n}\n\nstatic size_t populate_relocs_record_from_dynamic(ELFOBJ *bin, RBinElfReloc *relocs, size_t pos, size_t num_relocs) {\n\tsize_t offset;\n\tsize_t size = get_size_rel_mode (bin->dyn_info.dt_pltrel);\n\n\tfor (offset = 0; offset < bin->dyn_info.dt_pltrelsz && pos < num_relocs; offset += size, pos++) {\n\t\tif (!read_reloc (bin, relocs + pos, bin->dyn_info.dt_pltrel, bin->dyn_info.dt_jmprel + offset)) {\n\t\t\tbreak;\n\t\t}\n\t\tfix_rva_and_offset_exec_file (bin, relocs + pos);\n\t}\n\n\tfor (offset = 0; offset < bin->dyn_info.dt_relasz && pos < num_relocs; offset += bin->dyn_info.dt_relaent, pos++) {\n\t\tif (!read_reloc (bin, relocs + pos, DT_RELA, bin->dyn_info.dt_rela + offset)) {\n\t\t\tbreak;\n\t\t}\n\t\tfix_rva_and_offset_exec_file (bin, relocs + pos);\n\t}\n\n\tfor (offset = 0; offset < bin->dyn_info.dt_relsz && pos < num_relocs; offset += bin->dyn_info.dt_relent, pos++) {\n\t\tif (!read_reloc (bin, relocs + pos, DT_REL, bin->dyn_info.dt_rel + offset)) {\n\t\t\tbreak;\n\t\t}\n\t\tfix_rva_and_offset_exec_file (bin, relocs + pos);\n\t}\n\n\treturn pos;\n}\n\nstatic size_t get_next_not_analysed_offset(ELFOBJ *bin, size_t section_vaddr, size_t offset) {\n\tsize_t gvaddr = section_vaddr + offset;\n\n\tif (bin->dyn_info.dt_rela != R_BIN_ELF_ADDR_MAX && bin->dyn_info.dt_rela <= gvaddr\n\t\t&& gvaddr < bin->dyn_info.dt_rela + bin->dyn_info.dt_relasz) {\n\t\treturn bin->dyn_info.dt_rela + bin->dyn_info.dt_relasz - section_vaddr;\n\t}\n\n\tif (bin->dyn_info.dt_rel != R_BIN_ELF_ADDR_MAX && bin->dyn_info.dt_rel <= gvaddr\n\t\t&& gvaddr < bin->dyn_info.dt_rel + bin->dyn_info.dt_relsz) {\n\t\treturn bin->dyn_info.dt_rel + bin->dyn_info.dt_relsz - section_vaddr;\n\t}\n\n\tif (bin->dyn_info.dt_jmprel != R_BIN_ELF_ADDR_MAX && bin->dyn_info.dt_jmprel <= gvaddr\n\t\t&& gvaddr < bin->dyn_info.dt_jmprel + bin->dyn_info.dt_pltrelsz) {\n\t\treturn bin->dyn_info.dt_jmprel + bin->dyn_info.dt_pltrelsz - section_vaddr;\n\t}\n\n\treturn offset;\n}\n\nstatic size_t populate_relocs_record_from_section(ELFOBJ *bin, RBinElfReloc *relocs, size_t pos, size_t num_relocs) {\n\tsize_t size, i, j;\n\tElf_(Xword) rel_mode;\n\n\tif (!bin->g_sections) {\n\t\treturn pos;\n\t}\n\n\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\trel_mode = get_section_mode (bin, i);\n\n\t\tif (!is_reloc_section (rel_mode) || bin->g_sections[i].size > bin->size || bin->g_sections[i].offset > bin->size) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tsize = get_size_rel_mode (rel_mode);\n\n\t\tfor (j = get_next_not_analysed_offset (bin, bin->g_sections[i].rva, 0);\n\t\t\tj < bin->g_sections[i].size && pos < num_relocs;\n\t\t\tj = get_next_not_analysed_offset (bin, bin->g_sections[i].rva, j + size)) {\n\n\t\t\tif (!read_reloc (bin, relocs + pos, rel_mode, bin->g_sections[i].rva + j)) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfix_rva_and_offset (bin, relocs + pos, i);\n\t\t\tpos++;\n\t\t}\n\t}\n\n\treturn pos;\n}\n\nstatic RBinElfReloc *populate_relocs_record(ELFOBJ *bin) {\n\tsize_t i = 0;\n\tsize_t num_relocs = get_num_relocs_approx (bin);\n\tRBinElfReloc *relocs = R_NEWS0 (RBinElfReloc, num_relocs + 1);\n\tif (!relocs) {\n\t\t// In case we can't allocate enough memory for all the claimed\n\t\t// relocation entries, try to parse only the ones specified in\n\t\t// the dynamic segment.\n\t\tnum_relocs = get_num_relocs_dynamic (bin);\n\t\trelocs = R_NEWS0 (RBinElfReloc, num_relocs + 1);\n\t\tif (!relocs) {\n\t\t\treturn NULL;\n\t\t}\n\t}\n\n\ti = populate_relocs_record_from_dynamic (bin, relocs, i, num_relocs);\n\ti = populate_relocs_record_from_section (bin, relocs, i, num_relocs);\n\trelocs[i].last = 1;\n\n\tbin->g_reloc_num = i;\n\treturn relocs;\n}\n\nRBinElfReloc* Elf_(r_bin_elf_get_relocs) (ELFOBJ *bin) {\n\tif (!bin) {\n\t\treturn NULL;\n\t}\n\n\tif (!bin->g_relocs) {\n\t\tbin->g_relocs = populate_relocs_record (bin);\n\t}\n\treturn bin->g_relocs;\n}\n\nRBinElfLib* Elf_(r_bin_elf_get_libs)(ELFOBJ *bin) {\n\tRBinElfLib *ret = NULL;\n\tElf_(Off) *it = NULL;\n\tsize_t k = 0;\n\n\tif (!bin || !bin->phdr || !bin->strtab || *(bin->strtab+1) == '0') {\n\t\treturn NULL;\n\t}\n\n\tr_vector_foreach(&bin->dyn_info.dt_needed, it) {\n\t\tElf_(Off) val = *it;\n\n\t\tRBinElfLib *r = realloc (ret, (k + 1) * sizeof (RBinElfLib));\n\t\tif (!r) {\n\t\t\tr_sys_perror (\"realloc (libs)\");\n\t\t\tfree (ret);\n\t\t\treturn NULL;\n\t\t}\n\t\tret = r;\n\t\tif (val > bin->strtab_size) {\n\t\t\tfree (ret);\n\t\t\treturn NULL;\n\t\t}\n\t\tstrncpy (ret[k].name, bin->strtab + val, ELF_STRING_LENGTH);\n\t\tret[k].name[ELF_STRING_LENGTH - 1] = '\\0';\n\t\tret[k].last = 0;\n\t\tif (ret[k].name[0]) {\n\t\t\tk++;\n\t\t}\n\t}\n\n\tRBinElfLib *r = realloc (ret, (k + 1) * sizeof (RBinElfLib));\n\tif (!r) {\n\t\tr_sys_perror (\"realloc (libs)\");\n\t\tfree (ret);\n\t\treturn NULL;\n\t}\n\tret = r;\n\tret[k].last = 1;\n\treturn ret;\n}\n\nstatic void create_section_from_phdr(ELFOBJ *bin, RBinElfSection *ret, size_t *i, const char *name, ut64 addr, ut64 sz) {\n\tr_return_if_fail (bin && ret && i);\n\tif (!addr || addr == UT64_MAX) {\n\t\treturn;\n\t}\n\tret[*i].offset = Elf_(r_bin_elf_v2p_new) (bin, addr);\n\tret[*i].rva = addr;\n\tret[*i].size = sz;\n\tr_str_ncpy (ret[*i].name, name, R_ARRAY_SIZE (ret[*i].name) - 1);\n\tret[*i].last = 0;\n\t*i = *i + 1;\n}\n\nstatic RBinElfSection *get_sections_from_phdr(ELFOBJ *bin) {\n\tRBinElfSection *ret;\n\tsize_t num_sections = 0;\n\tut64 reldyn = 0, relava = 0, pltgotva = 0, relva = 0;\n\tut64 reldynsz = 0, relasz = 0, pltgotsz = 0;\n\tr_return_val_if_fail (bin && bin->phdr, NULL);\n\n\tif (!bin->ehdr.e_phnum) {\n\t\treturn NULL;\n\t}\n\tif (bin->dyn_info.dt_rel != R_BIN_ELF_ADDR_MAX) {\n\t\treldyn = bin->dyn_info.dt_rel;\n\t\tnum_sections++;\n\t}\n\tif (bin->dyn_info.dt_rela != R_BIN_ELF_ADDR_MAX) {\n\t\trelva = bin->dyn_info.dt_rela;\n\t\tnum_sections++;\n\t}\n\tif (bin->dyn_info.dt_relsz) {\n\t\treldynsz = bin->dyn_info.dt_relsz;\n\t}\n\tif (bin->dyn_info.dt_relasz) {\n\t\trelasz = bin->dyn_info.dt_relasz;\n\t}\n\tif (bin->dyn_info.dt_pltgot != R_BIN_ELF_ADDR_MAX) {\n\t\tpltgotva = bin->dyn_info.dt_pltgot;\n\t\tnum_sections++;\n\t}\n\tif (bin->dyn_info.dt_pltrelsz) {\n\t\tpltgotsz = bin->dyn_info.dt_pltrelsz;\n\t}\n\tif (bin->dyn_info.dt_jmprel != R_BIN_ELF_ADDR_MAX) {\n\t\trelava = bin->dyn_info.dt_jmprel;\n\t\tnum_sections++;\n\t}\n\n\tret = calloc (num_sections + 1, sizeof (RBinElfSection));\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\n\tsize_t i = 0;\n\tcreate_section_from_phdr (bin, ret, &i, \".rel.dyn\", reldyn, reldynsz);\n\tcreate_section_from_phdr (bin, ret, &i, \".rela.plt\", relava, pltgotsz);\n\tcreate_section_from_phdr (bin, ret, &i, \".rel.plt\", relva, relasz);\n\tcreate_section_from_phdr (bin, ret, &i, \".got.plt\", pltgotva, pltgotsz);\n\tret[i].last = 1;\n\n\treturn ret;\n}\n\nRBinElfSection* Elf_(r_bin_elf_get_sections)(ELFOBJ *bin) {\n\tRBinElfSection *ret = NULL;\n\tchar unknown_s[32], invalid_s[32];\n\tint i, nidx, unknown_c=0, invalid_c=0;\n\n\tr_return_val_if_fail (bin, NULL);\n\tif (bin->g_sections) {\n\t\treturn bin->g_sections;\n\t}\n\tif (!bin->shdr && bin->phdr) {\n\t\t//we don't give up search in phdr section\n\t\treturn get_sections_from_phdr (bin);\n\t}\n\tif (!bin->shdr) {\n\t\treturn NULL;\n\t}\n\tut32 count = bin->ehdr.e_shnum;\n\tif (!(ret = calloc ((count + 1), sizeof (RBinElfSection)))) {\n\t\treturn NULL;\n\t}\n\tfor (i = 0; i < count; i++) {\n\t\tret[i].offset = bin->shdr[i].sh_offset;\n\t\tret[i].size = bin->shdr[i].sh_size;\n\t\tret[i].align = bin->shdr[i].sh_addralign;\n\t\tret[i].flags = bin->shdr[i].sh_flags;\n\t\tret[i].link = bin->shdr[i].sh_link;\n\t\tret[i].info = bin->shdr[i].sh_info;\n\t\tret[i].type = bin->shdr[i].sh_type;\n\t\tif (is_bin_etrel (bin)) {\n\t\t\tret[i].rva = bin->baddr + bin->shdr[i].sh_offset;\n\t\t} else {\n\t\t\tret[i].rva = bin->shdr[i].sh_addr;\n\t\t}\n\n\t\tconst int SHNAME = (int)bin->shdr[i].sh_name;\n\t\tconst int SHSIZE = (int)bin->shstrtab_size;\n\t\tnidx = SHNAME;\n\t\tif (nidx < 0 || !bin->shstrtab_section || !bin->shstrtab_size || nidx > bin->shstrtab_size) {\n\t\t\tsnprintf (invalid_s, sizeof (invalid_s), \"invalid%d\", invalid_c);\n\t\t\tstrncpy (ret[i].name, invalid_s, sizeof (ret[i].name) - 1);\n\t\t\tinvalid_c++;\n\t\t} else if (bin->shstrtab && (SHNAME > 0) && (SHNAME < SHSIZE)) {\n\t\t\tstrncpy (ret[i].name, &bin->shstrtab[SHNAME], sizeof (ret[i].name) - 1);\n\t\t} else if (bin->shdr[i].sh_type == SHT_NULL) {\n\t\t\t//to follow the same behaviour as readelf\n\t\t\tret[i].name[0] = '\\0';\n\t\t} else {\n\t\t\tsnprintf (unknown_s, sizeof (unknown_s), \"unknown%d\", unknown_c);\n\t\t\tstrncpy (ret[i].name, unknown_s, sizeof (ret[i].name) - 1);\n\t\t\tunknown_c++;\n\t\t}\n\t\tret[i].name[ELF_STRING_LENGTH - 1] = '\\0';\n\t\tret[i].last = 0;\n\t}\n\tret[i].last = 1;\n\treturn ret;\n}\n\nstatic bool is_special_arm_symbol(ELFOBJ *bin, Elf_(Sym) *sym, const char *name) {\n\tif (name[0] != '$') {\n\t\treturn false;\n\t}\n\tswitch (name[1]) {\n\tcase 'a':\n\tcase 't':\n\tcase 'd':\n\tcase 'x':\n\t\treturn (name[2] == '\\0' || name[2] == '.') &&\n\t\t\tELF_ST_TYPE (sym->st_info) == STT_NOTYPE &&\n\t\t\tELF_ST_BIND (sym->st_info) == STB_LOCAL &&\n\t\t\tELF_ST_VISIBILITY (sym->st_info) == STV_DEFAULT;\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic bool is_special_symbol(ELFOBJ *bin, Elf_(Sym) *sym, const char *name) {\n\tswitch (bin->ehdr.e_machine) {\n\tcase EM_ARM:\n\tcase EM_AARCH64:\n\t\treturn is_special_arm_symbol (bin, sym, name);\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic const char *bind2str(Elf_(Sym) *sym) {\n\tswitch (ELF_ST_BIND (sym->st_info)) {\n\tcase STB_LOCAL: return R_BIN_BIND_LOCAL_STR;\n\tcase STB_GLOBAL: return R_BIN_BIND_GLOBAL_STR;\n\tcase STB_WEAK: return R_BIN_BIND_WEAK_STR;\n\tcase STB_NUM: return R_BIN_BIND_NUM_STR;\n\tcase STB_LOOS: return R_BIN_BIND_LOOS_STR;\n\tcase STB_HIOS: return R_BIN_BIND_HIOS_STR;\n\tcase STB_LOPROC: return R_BIN_BIND_LOPROC_STR;\n\tcase STB_HIPROC: return R_BIN_BIND_HIPROC_STR;\n\tdefault: return R_BIN_BIND_UNKNOWN_STR;\n\t}\n}\n\nstatic const char *type2str(ELFOBJ *bin, struct r_bin_elf_symbol_t *ret, Elf_(Sym) *sym) {\n\tif (bin && ret && is_special_symbol (bin, sym, ret->name)) {\n\t\treturn R_BIN_TYPE_SPECIAL_SYM_STR;\n\t}\n\tswitch (ELF_ST_TYPE (sym->st_info)) {\n\tcase STT_NOTYPE: return R_BIN_TYPE_NOTYPE_STR;\n\tcase STT_OBJECT: return R_BIN_TYPE_OBJECT_STR;\n\tcase STT_FUNC: return R_BIN_TYPE_FUNC_STR;\n\tcase STT_SECTION: return R_BIN_TYPE_SECTION_STR;\n\tcase STT_FILE: return R_BIN_TYPE_FILE_STR;\n\tcase STT_COMMON: return R_BIN_TYPE_COMMON_STR;\n\tcase STT_TLS: return R_BIN_TYPE_TLS_STR;\n\tcase STT_NUM: return R_BIN_TYPE_NUM_STR;\n\tcase STT_LOOS: return R_BIN_TYPE_LOOS_STR;\n\tcase STT_HIOS: return R_BIN_TYPE_HIOS_STR;\n\tcase STT_LOPROC: return R_BIN_TYPE_LOPROC_STR;\n\tcase STT_HIPROC: return R_BIN_TYPE_HIPROC_STR;\n\tdefault: return R_BIN_TYPE_UNKNOWN_STR;\n\t}\n}\n\nstatic void fill_symbol_bind_and_type(ELFOBJ *bin, struct r_bin_elf_symbol_t *ret, Elf_(Sym) *sym) {\n\tret->bind = bind2str (sym);\n\tret->type = type2str (bin, ret, sym);\n}\n\nstatic RBinElfSymbol* get_symbols_from_phdr(ELFOBJ *bin, int type) {\n\tElf_(Sym) *sym = NULL;\n\tElf_(Addr) addr_sym_table = 0;\n\tut8 s[sizeof (Elf_(Sym))] = {0};\n\tRBinElfSymbol *ret = NULL;\n\tint i, r, tsize, nsym, ret_ctr;\n\tut64 toffset = 0, tmp_offset;\n\tut32 size, sym_size = 0;\n\n\tif (!bin || !bin->phdr || !bin->ehdr.e_phnum) {\n\t\treturn NULL;\n\t}\n\n\tif (bin->dyn_info.dt_symtab == R_BIN_ELF_ADDR_MAX || !bin->dyn_info.dt_syment) {\n\t\treturn NULL;\n\t}\n\n\taddr_sym_table = Elf_(r_bin_elf_v2p) (bin, bin->dyn_info.dt_symtab);\n\tsym_size = bin->dyn_info.dt_syment;\n\tif (!sym_size) {\n\t\tgoto beach;\n\t}\n\n\t//since ELF doesn't specify the symbol table size we may read until the end of the buffer\n\tnsym = (bin->size - addr_sym_table) / sym_size;\n\tif (!UT32_MUL (&size, nsym, sizeof (Elf_ (Sym)))) {\n\t\tgoto beach;\n\t}\n\tif (size < 1) {\n\t\tgoto beach;\n\t}\n\tif (addr_sym_table > bin->size || addr_sym_table + size > bin->size) {\n\t\tgoto beach;\n\t}\n\tif (nsym < 1) {\n\t\treturn NULL;\n\t}\n\t// we reserve room for 4096 and grow as needed.\n\tsize_t capacity1 = 4096;\n\tsize_t capacity2 = 4096;\n\tsym = (Elf_(Sym)*) calloc (capacity1, sym_size);\n\tret = (RBinElfSymbol *) calloc (capacity2, sizeof (struct r_bin_elf_symbol_t));\n\tif (!sym || !ret) {\n\t\tgoto beach;\n\t}\n\tfor (i = 1, ret_ctr = 0; i < nsym; i++) {\n\t\tif (i >= capacity1) { // maybe grow\n\t\t\t// You take what you want, but you eat what you take.\n\t\t\tElf_(Sym)* temp_sym = (Elf_(Sym)*) realloc (sym, (size_t)(capacity1 * GROWTH_FACTOR) * sym_size);\n\t\t\tif (!temp_sym) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tsym = temp_sym;\n\t\t\tcapacity1 = (size_t)(capacity1 * GROWTH_FACTOR);\n\t\t}\n\t\tif (ret_ctr >= capacity2) { // maybe grow\n\t\t\tRBinElfSymbol *temp_ret = realloc (ret, (size_t)(capacity2 * GROWTH_FACTOR) * sizeof (struct r_bin_elf_symbol_t));\n\t\t\tif (!temp_ret) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tret = temp_ret;\n\t\t\tcapacity2 = (size_t)(capacity2 * GROWTH_FACTOR);\n\t\t}\n\t\t// read in one entry\n\t\tr = r_buf_read_at (bin->b, addr_sym_table + i * sizeof (Elf_ (Sym)), s, sizeof (Elf_ (Sym)));\n\t\tif (r < 1) {\n\t\t\tgoto beach;\n\t\t}\n\t\tint j = 0;\n#if R_BIN_ELF64\n\t\tsym[i].st_name = READ32 (s, j);\n\t\tsym[i].st_info = READ8 (s, j);\n\t\tsym[i].st_other = READ8 (s, j);\n\t\tsym[i].st_shndx = READ16 (s, j);\n\t\tsym[i].st_value = READ64 (s, j);\n\t\tsym[i].st_size = READ64 (s, j);\n#else\n\t\tsym[i].st_name = READ32 (s, j);\n\t\tsym[i].st_value = READ32 (s, j);\n\t\tsym[i].st_size = READ32 (s, j);\n\t\tsym[i].st_info = READ8 (s, j);\n\t\tsym[i].st_other = READ8 (s, j);\n\t\tsym[i].st_shndx = READ16 (s, j);\n#endif\n\t\tbool is_sht_null = false;\n\t\tbool is_vaddr = false;\n\t\t// zero symbol is always empty\n\t\t// Examine entry and maybe store\n\t\tif (type == R_BIN_ELF_IMPORT_SYMBOLS && sym[i].st_shndx == SHT_NULL) {\n\t\t\tif (sym[i].st_value) {\n\t\t\t\ttoffset = sym[i].st_value;\n\t\t\t} else if ((toffset = get_import_addr (bin, i)) == -1){\n\t\t\t\ttoffset = 0;\n\t\t\t}\n\t\t\ttsize = 16;\n\t\t} else if (type == R_BIN_ELF_ALL_SYMBOLS) {\n\t\t\ttsize = sym[i].st_size;\n\t\t\ttoffset = (ut64) sym[i].st_value;\n\t\t\tis_sht_null = sym[i].st_shndx == SHT_NULL;\n\t\t} else {\n\t\t\tcontinue;\n\t\t}\n\t\t// since we don't know the size of the sym table in this case,\n\t\t// let's stop at the first invalid entry\n\t\tif (!strcmp (bind2str (&sym[i]), R_BIN_BIND_UNKNOWN_STR) ||\n\t\t !strcmp (type2str (NULL, NULL, &sym[i]), R_BIN_TYPE_UNKNOWN_STR)) {\n\t\t\tgoto done;\n\t\t}\n\t\ttmp_offset = Elf_(r_bin_elf_v2p_new) (bin, toffset);\n\t\tif (tmp_offset == UT64_MAX) {\n\t\t\ttmp_offset = toffset;\n\t\t\tis_vaddr = true;\n\t\t}\n\t\tif (sym[i].st_name + 2 > bin->strtab_size) {\n\t\t\t// Since we are reading beyond the symbol table what's happening\n\t\t\t// is that some entry is trying to dereference the strtab beyond its capacity\n\t\t\t// is not a symbol so is the end\n\t\t\tgoto done;\n\t\t}\n\t\tret[ret_ctr].offset = tmp_offset;\n\t\tret[ret_ctr].size = tsize;\n\t\t{\n\t\t\tint rest = ELF_STRING_LENGTH - 1;\n\t\t\tint st_name = sym[i].st_name;\n\t\t\tint maxsize = R_MIN (bin->size, bin->strtab_size);\n\t\t\tif (st_name < 0 || st_name >= maxsize) {\n\t\t\t\tret[ret_ctr].name[0] = 0;\n\t\t\t} else {\n\t\t\t\tconst int len = __strnlen (bin->strtab + st_name, rest);\n\t\t\t\tmemcpy (ret[ret_ctr].name, &bin->strtab[st_name], len);\n\t\t\t}\n\t\t}\n\t\tret[ret_ctr].ordinal = i;\n\t\tret[ret_ctr].in_shdr = false;\n\t\tret[ret_ctr].name[ELF_STRING_LENGTH - 2] = '\\0';\n\t\tfill_symbol_bind_and_type (bin, &ret[ret_ctr], &sym[i]);\n\t\tret[ret_ctr].is_sht_null = is_sht_null;\n\t\tret[ret_ctr].is_vaddr = is_vaddr;\n\t\tret[ret_ctr].last = 0;\n\t\tret_ctr++;\n\t}\ndone:\n\t// Size everything down to only what is used\n\t{\n\t\tnsym = i > 0? i: 1;\n\t\tElf_(Sym) *temp_sym = (Elf_(Sym) *)realloc (sym, (size_t)(nsym * GROWTH_FACTOR) * sym_size);\n\t\tif (!temp_sym) {\n\t\t\tgoto beach;\n\t\t}\n\t\tsym = temp_sym;\n\t}\n\t{\n\t\tret_ctr = ret_ctr > 0? ret_ctr: 1;\n\t\tRBinElfSymbol *p = (RBinElfSymbol *)realloc (ret, (ret_ctr + 1) * sizeof (RBinElfSymbol));\n\t\tif (!p) {\n\t\t\tgoto beach;\n\t\t}\n\t\tret = p;\n\t}\n\tret[ret_ctr].last = 1;\n\tif (type == R_BIN_ELF_IMPORT_SYMBOLS && !bin->imports_by_ord_size) {\n\t\tbin->imports_by_ord_size = ret_ctr + 1;\n\t\tif (ret_ctr > 0) {\n\t\t\tbin->imports_by_ord = (RBinImport * *) calloc (ret_ctr + 1, sizeof (RBinImport*));\n\t\t} else {\n\t\t\tbin->imports_by_ord = NULL;\n\t\t}\n\t} else if (type == R_BIN_ELF_ALL_SYMBOLS && !bin->symbols_by_ord_size && ret_ctr) {\n\t\tbin->symbols_by_ord_size = ret_ctr + 1;\n\t\tif (ret_ctr > 0) {\n\t\t\tbin->symbols_by_ord = (RBinSymbol **) calloc (ret_ctr + 1, sizeof (RBinSymbol*));\n\t\t} else {\n\t\t\tbin->symbols_by_ord = NULL;\n\t\t}\n\t}\n\tfree (sym);\n\treturn ret;\nbeach:\n\tfree (sym);\n\tfree (ret);\n\treturn NULL;\n}\n\nstatic RBinElfSymbol *Elf_(r_bin_elf_get_phdr_symbols)(ELFOBJ *bin) {\n\tif (!bin) {\n\t\treturn NULL;\n\t}\n\tif (bin->phdr_symbols) {\n\t\treturn bin->phdr_symbols;\n\t}\n\tbin->phdr_symbols = get_symbols_from_phdr (bin, R_BIN_ELF_ALL_SYMBOLS);\n\treturn bin->phdr_symbols;\n}\n\nstatic RBinElfSymbol *Elf_(r_bin_elf_get_phdr_imports)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, NULL);\n\tif (!bin->phdr_imports) {\n\t\tbin->phdr_imports = get_symbols_from_phdr (bin, R_BIN_ELF_IMPORT_SYMBOLS);\n\t}\n\treturn bin->phdr_imports;\n}\n\nstatic RBinElfSymbol *Elf_(get_phdr_symbols)(ELFOBJ *bin, int type) {\n\treturn (type != R_BIN_ELF_IMPORT_SYMBOLS)\n\t\t? Elf_(r_bin_elf_get_phdr_symbols) (bin)\n\t\t: Elf_(r_bin_elf_get_phdr_imports) (bin);\n}\n\nstatic int Elf_(fix_symbols)(ELFOBJ *bin, int nsym, int type, RBinElfSymbol **sym) {\n\tint count = 0;\n\tint result = -1;\n\tRBinElfSymbol *ret = *sym;\n\tRBinElfSymbol *phdr_symbols = Elf_(get_phdr_symbols) (bin, type);\n\tRBinElfSymbol *tmp, *p;\n\tHtUP *phd_offset_map = ht_up_new0 ();\n\tHtUP *phd_ordinal_map = ht_up_new0 ();\n\tif (phdr_symbols) {\n\t\tRBinElfSymbol *d = ret;\n\t\twhile (!d->last) {\n\t\t\tht_up_insert (phd_offset_map, d->offset, d);\n\t\t\tht_up_insert (phd_ordinal_map, d->ordinal, d);\n\t\t\td++;\n\t\t}\n\t\tp = phdr_symbols;\n\t\twhile (!p->last) {\n\t\t\t/* find match in phdr */\n\t\t\td = ht_up_find (phd_offset_map, p->offset, NULL);\n\t\t\tif (!d) {\n\t\t\t\td = ht_up_find (phd_ordinal_map, p->ordinal, NULL);\n\t\t\t}\n\t\t\tif (d) {\n\t\t\t\tp->in_shdr = true;\n\t\t\t\tif (*p->name && *d->name && r_str_startswith (d->name, \"$\")) {\n\t\t\t\t\tstrcpy (d->name, p->name);\n\t\t\t\t}\n\t\t\t}\n\t\t\tp++;\n\t\t}\n\t\tp = phdr_symbols;\n\t\twhile (!p->last) {\n\t\t\tif (!p->in_shdr) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tp++;\n\t\t}\n\t\t/*Take those symbols that are not present in the shdr but yes in phdr*/\n\t\t/*This should only should happen with fucked up binaries*/\n\t\tif (count > 0) {\n\t\t\t/*what happens if a shdr says it has only one symbol? we should look anyway into phdr*/\n\t\t\ttmp = (RBinElfSymbol*)realloc (ret, (nsym + count + 1) * sizeof (RBinElfSymbol));\n\t\t\tif (!tmp) {\n\t\t\t\tresult = -1;\n\t\t\t\tgoto done;\n\t\t\t}\n\t\t\tret = tmp;\n\t\t\tret[nsym--].last = 0;\n\t\t\tp = phdr_symbols;\n\t\t\twhile (!p->last) {\n\t\t\t\tif (!p->in_shdr) {\n\t\t\t\t\tmemcpy (&ret[++nsym], p, sizeof (RBinElfSymbol));\n\t\t\t\t}\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tret[nsym + 1].last = 1;\n\t\t}\n\t\t*sym = ret;\n\t\tresult = nsym + 1;\n\t\tgoto done;\n\t}\n\tresult = nsym;\ndone:\n\tht_up_free (phd_offset_map);\n\tht_up_free (phd_ordinal_map);\n\treturn result;\n}\n\nstatic bool is_section_local_sym(ELFOBJ *bin, Elf_(Sym) *sym) {\n\tif (sym->st_name != 0) {\n\t\treturn false;\n\t}\n\tif (ELF_ST_TYPE (sym->st_info) != STT_SECTION) {\n\t\treturn false;\n\t}\n\tif (ELF_ST_BIND (sym->st_info) != STB_LOCAL) {\n\t\treturn false;\n\t}\n\tif (!is_shidx_valid (bin, sym->st_shndx)) {\n\t\treturn false;\n\t}\n\tElf_(Word) sh_name = bin->shdr[sym->st_shndx].sh_name;\n\treturn bin->shstrtab && sh_name < bin->shstrtab_size;\n}\n\nstatic void setsymord(ELFOBJ* eobj, ut32 ord, RBinSymbol *ptr) {\n\tif (!eobj->symbols_by_ord || ord >= eobj->symbols_by_ord_size) {\n\t\treturn;\n\t}\n\tr_bin_symbol_free (eobj->symbols_by_ord[ord]);\n\teobj->symbols_by_ord[ord] = ptr;\n}\n\nstatic void _set_arm_thumb_bits(struct Elf_(r_bin_elf_obj_t) *bin, RBinSymbol **sym) {\n\tint bin_bits = Elf_(r_bin_elf_get_bits) (bin);\n\tRBinSymbol *ptr = *sym;\n\tint len = strlen (ptr->name);\n\tif (ptr->name[0] == '$' && (len >= 2 && !ptr->name[2])) {\n\t\tswitch (ptr->name[1]) {\n\t\tcase 'a' : //arm\n\t\t\tptr->bits = 32;\n\t\t\tbreak;\n\t\tcase 't': //thumb\n\t\t\tptr->bits = 16;\n\t\t\tif (ptr->vaddr & 1) {\n\t\t\t\tptr->vaddr--;\n\t\t\t}\n\t\t\tif (ptr->paddr & 1) {\n\t\t\t\tptr->paddr--;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 'd': //data\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tgoto arm_symbol;\n\t\t}\n\t} else {\narm_symbol:\n\t\tptr->bits = bin_bits;\n\t\tif (bin_bits != 64) {\n\t\t\tptr->bits = 32;\n\t\t\tif (ptr->paddr != UT64_MAX) {\n\t\t\t\tif (ptr->vaddr & 1) {\n\t\t\t\t\tptr->vaddr--;\n\t\t\t\t\tptr->bits = 16;\n\t\t\t\t}\n\t\t\t\tif (ptr->paddr & 1) {\n\t\t\t\t\tptr->paddr--;\n\t\t\t\t\tptr->bits = 16;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nRBinSymbol *Elf_(_r_bin_elf_convert_symbol)(struct Elf_(r_bin_elf_obj_t) *bin,\n\t\t\t\t\t struct r_bin_elf_symbol_t *symbol,\n\t\t\t\t\t const char *namefmt) {\n\tut64 paddr, vaddr;\n\tRBinSymbol *ptr = NULL;\n\tif (symbol->is_vaddr) {\n\t\tpaddr = UT64_MAX;\n\t\tvaddr = symbol->offset;\n\t} else {\n\t\tpaddr = symbol->offset;\n\t\tvaddr = Elf_(r_bin_elf_p2v_new) (bin, paddr);\n\t}\n\n\tif (!(ptr = R_NEW0 (RBinSymbol))) {\n\t\treturn NULL;\n\t}\n\tptr->name = symbol->name[0] ? r_str_newf (namefmt, &symbol->name[0]) : strdup (\"\");\n\tptr->forwarder = \"NONE\";\n\tptr->bind = symbol->bind;\n\tptr->type = symbol->type;\n\tptr->is_imported = symbol->is_imported;\n\tptr->paddr = paddr;\n\tptr->vaddr = vaddr;\n\tptr->size = symbol->size;\n\tptr->ordinal = symbol->ordinal;\n\t// detect thumb\n\tif (bin->ehdr.e_machine == EM_ARM && *ptr->name) {\n\t\t_set_arm_thumb_bits (bin, &ptr);\n\t}\n\n\treturn ptr;\n}\n\nstatic ut32 hashRBinElfSymbol(const void *obj) {\n\tconst RBinElfSymbol *symbol = (const RBinElfSymbol *)obj;\n\tif (!symbol || !*symbol->name) {\n\t\treturn 0;\n\t}\n\tint hash = sdb_hash (symbol->name);\n\thash ^= sdb_hash (symbol->type);\n\thash ^= (symbol->offset >> 32);\n\thash ^= (symbol->offset & 0xffffffff);\n\treturn hash;\n}\n\nstatic int cmp_RBinElfSymbol(const RBinElfSymbol *a, const RBinElfSymbol *b) {\n\tif (a->offset != b->offset) {\n\t\treturn 1;\n\t}\n\tint result = strcmp (a->name, b->name);\n\tif (result != 0) {\n\t\treturn result;\n\t}\n\treturn strcmp (a->type, b->type);\n}\n\nstatic RBinElfSymbol* parse_gnu_debugdata(ELFOBJ *bin, size_t *ret_size) {\n\tif (ret_size) {\n\t\t*ret_size = 0;\n\t}\n\tif (bin->g_sections) {\n\t\tsize_t i;\n\t\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\t\tif (!strcmp (bin->g_sections[i].name, \".gnu_debugdata\")) {\n\t\t\t\tut64 addr = bin->g_sections[i].offset;\n\t\t\t\tut64 size = bin->g_sections[i].size;\n\t\t\t\tif (size < 10) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tut8 *data = malloc (size + 1);\n\t\t\t\tif (r_buf_read_at (bin->b, addr, data, size) == -1) {\n\t\t\t\t\teprintf (\"Cannot read%c\\n\", 10);\n\t\t\t\t}\n\t\t\t\tsize_t osize;\n\t\t\t\tut8 *odata = r_sys_unxz (data, size, &osize);\n\t\t\t\tif (odata) {\n\t\t\t\t\tRBuffer *newelf = r_buf_new_with_pointers (odata, osize, false);\n\t\t\t\t\tELFOBJ* newobj = Elf_(r_bin_elf_new_buf) (newelf, false);\n\t\t\t\t\tRBinElfSymbol *symbol = NULL;\n\t\t\t\t\tif (newobj) {\n\t\t\t\t\t\tsymbol = Elf_(r_bin_elf_get_symbols) (newobj);\n\t\t\t\t\t\tnewobj->g_symbols = NULL;\n\t\t\t\t\t\tElf_(r_bin_elf_free)(newobj);\n\t\t\t\t\t}\n\t\t\t\t\tr_buf_free (newelf);\n\t\t\t\t\tfree (odata);\n\t\t\t\t\tif (ret_size) {\n\t\t\t\t\t\t*ret_size = i;\n\t\t\t\t\t}\n\t\t\t\t\tfree (data);\n\t\t\t\t\treturn symbol;\n\t\t\t\t}\n\t\t\t\tfree (data);\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t}\n\t}\n\treturn NULL;\n}\n\n// TODO: return RList .. or run a callback with that symbol constructed, so we don't have to do it twice\nstatic RBinElfSymbol* Elf_(_r_bin_elf_get_symbols_imports)(ELFOBJ *bin, int type) {\n\tut32 shdr_size;\n\tint tsize, nsym, ret_ctr = 0, i, j, r, k, newsize;\n\tut64 toffset;\n\tut32 size = 0;\n\tRBinElfSymbol *ret = NULL, *import_ret = NULL;\n\tRBinSymbol *import_sym_ptr = NULL;\n\tsize_t ret_size = 0, prev_ret_size = 0, import_ret_ctr = 0;\n\tElf_(Shdr) *strtab_section = NULL;\n\tElf_(Sym) *sym = NULL;\n\tut8 s[sizeof (Elf_(Sym))] = {0};\n\tchar *strtab = NULL;\n\tHtPP *symbol_map = NULL;\n\tHtPPOptions symbol_map_options = {\n\t\t.cmp = (HtPPListComparator)cmp_RBinElfSymbol,\n\t\t.hashfn = hashRBinElfSymbol,\n\t\t.dupkey = NULL,\n\t\t.calcsizeK = NULL,\n\t\t.calcsizeV = NULL,\n\t\t.freefn = NULL,\n\t\t.elem_size = sizeof (HtPPKv),\n\t};\n\n\tif (!bin || !bin->shdr || !bin->ehdr.e_shnum || bin->ehdr.e_shnum == 0xffff) {\n\t\treturn Elf_(get_phdr_symbols) (bin, type);\n\t}\n\tif (!UT32_MUL (&shdr_size, bin->ehdr.e_shnum, sizeof (Elf_(Shdr)))) {\n\t\treturn NULL;\n\t}\n\tif (shdr_size + 8 > bin->size) {\n\t\treturn NULL;\n\t}\n\tRBinElfSymbol *dbgsyms = parse_gnu_debugdata (bin, &ret_size);\n\tif (dbgsyms) {\n\t\tret = dbgsyms;\n\t\tret_ctr = ret_size;\n\t} else {\n\t\tret_ctr = 0;\n\t\tret_size = 0;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tif (((type & R_BIN_ELF_SYMTAB_SYMBOLS) && bin->shdr[i].sh_type == SHT_SYMTAB) ||\n\t\t\t((type & R_BIN_ELF_DYNSYM_SYMBOLS) && bin->shdr[i].sh_type == SHT_DYNSYM)) {\n\t\t\tif (bin->shdr[i].sh_link < 1) {\n\t\t\t\t/* oops. fix out of range pointers */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t// hack to avoid asan cry\n\t\t\tif ((bin->shdr[i].sh_link * sizeof (Elf_(Shdr))) >= shdr_size) {\n\t\t\t\t/* oops. fix out of range pointers */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tstrtab_section = &bin->shdr[bin->shdr[i].sh_link];\n\t\t\tif (strtab_section->sh_size > ST32_MAX || strtab_section->sh_size+8 > bin->size) {\n\t\t\t\tR_LOG_ERROR (\"size (syms strtab)\");\n\t\t\t\tfree (ret);\n\t\t\t\tfree (strtab);\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (!strtab) {\n\t\t\t\tif (!(strtab = (char *)calloc (1, 8 + strtab_section->sh_size))) {\n\t\t\t\t\tR_LOG_ERROR (\"malloc (syms strtab)\");\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\t\t\t\tif (strtab_section->sh_offset > bin->size ||\n\t\t\t\t\t\tstrtab_section->sh_offset + strtab_section->sh_size > bin->size) {\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\t\t\t\tif (r_buf_read_at (bin->b, strtab_section->sh_offset,\n\t\t\t\t\t\t\t(ut8*)strtab, strtab_section->sh_size) == -1) {\n\t\t\t\t\tR_LOG_ERROR (\"read (syms strtab)\");\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tnewsize = 1 + bin->shdr[i].sh_size;\n\t\t\tif (newsize < 0 || newsize > bin->size) {\n\t\t\t\tR_LOG_ERROR (\"invalid shdr %d size\", i);\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tnsym = (int)(bin->shdr[i].sh_size / sizeof (Elf_(Sym)));\n\t\t\tif (nsym < 0) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\t{\n\t\t\t\tut64 sh_begin = bin->shdr[i].sh_offset;\n\t\t\t\tut64 sh_end = sh_begin + bin->shdr[i].sh_size;\n\t\t\t\tif (sh_begin > bin->size) {\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\t\t\t\tif (sh_end > bin->size) {\n\t\t\t\t\tst64 newshsize = bin->size - sh_begin;\n\t\t\t\t\tnsym = (int)(newshsize / sizeof (Elf_(Sym)));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!(sym = (Elf_(Sym) *)calloc (nsym, sizeof (Elf_(Sym))))) {\n\t\t\t\tR_LOG_ERROR (\"calloc (syms)\");\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (!UT32_MUL (&size, nsym, sizeof (Elf_(Sym)))) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (size < 1 || size > bin->size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset > bin->size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset + size > bin->size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tfor (j = 0; j < nsym; j++) {\n\t\t\t\tint k = 0;\n\t\t\t\tr = r_buf_read_at (bin->b, bin->shdr[i].sh_offset + j * sizeof (Elf_(Sym)), s, sizeof (Elf_(Sym)));\n\t\t\t\tif (r < 1) {\n\t\t\t\t\tR_LOG_ERROR (\"read (sym)\");\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n#if R_BIN_ELF64\n\t\t\t\tsym[j].st_name = READ32 (s, k);\n\t\t\t\tsym[j].st_info = READ8 (s, k);\n\t\t\t\tsym[j].st_other = READ8 (s, k);\n\t\t\t\tsym[j].st_shndx = READ16 (s, k);\n\t\t\t\tsym[j].st_value = READ64 (s, k);\n\t\t\t\tsym[j].st_size = READ64 (s, k);\n#else\n\t\t\t\tsym[j].st_name = READ32 (s, k);\n\t\t\t\tsym[j].st_value = READ32 (s, k);\n\t\t\t\tsym[j].st_size = READ32 (s, k);\n\t\t\t\tsym[j].st_info = READ8 (s, k);\n\t\t\t\tsym[j].st_other = READ8 (s, k);\n\t\t\t\tsym[j].st_shndx = READ16 (s, k);\n#endif\n\t\t\t}\n\t\t\tvoid *rett = realloc (ret, (ret_size + nsym) * sizeof (RBinElfSymbol));\n\t\t\tif (!rett) {\n\t\t\t\tR_LOG_ERROR (\"Cannot allocate %d symbols.\", (int)(nsym + ret_size));\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tret = rett;\n\t\t\tmemset (ret + ret_size, 0, nsym * sizeof (RBinElfSymbol));\n\t\t\tprev_ret_size = ret_size;\n\t\t\tret_size += nsym;\n\t\t\tsymbol_map = ht_pp_new_opt (&symbol_map_options);\n\t\t\tfor (k = 0; k < prev_ret_size; k++) {\n\t\t\t\tif (ret[k].name[0]) {\n\t\t\t\t\tht_pp_insert (symbol_map, ret + k, ret + k);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (k = 1; k < nsym; k++) {\n\t\t\t\tbool is_sht_null = false;\n\t\t\t\tbool is_vaddr = false;\n\t\t\t\tbool is_imported = false;\n\t\t\t\tif (type == R_BIN_ELF_IMPORT_SYMBOLS) {\n\t\t\t\t\tif (sym[k].st_value) {\n\t\t\t\t\t\ttoffset = sym[k].st_value;\n\t\t\t\t\t} else if ((toffset = get_import_addr (bin, k)) == -1) {\n\t\t\t\t\t\ttoffset = 0;\n\t\t\t\t\t}\n\t\t\t\t\ttsize = 16;\n\t\t\t\t\tis_imported = sym[k].st_shndx == STN_UNDEF;\n\t\t\t\t} else {\n\t\t\t\t\ttsize = sym[k].st_size;\n\t\t\t\t\ttoffset = (ut64)sym[k].st_value;\n\t\t\t\t\tis_sht_null = sym[k].st_shndx == SHT_NULL;\n\t\t\t\t}\n\t\t\t\tif (is_bin_etrel (bin)) {\n\t\t\t\t\tif (sym[k].st_shndx < bin->ehdr.e_shnum) {\n\t\t\t\t\t\tret[ret_ctr].offset = sym[k].st_value + bin->shdr[sym[k].st_shndx].sh_offset;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tret[ret_ctr].offset = Elf_(r_bin_elf_v2p_new) (bin, toffset);\n\t\t\t\t\tif (ret[ret_ctr].offset == UT64_MAX) {\n\t\t\t\t\t\tret[ret_ctr].offset = toffset;\n\t\t\t\t\t\tis_vaddr = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tret[ret_ctr].size = tsize;\n\t\t\t\tif (sym[k].st_name + 1 > strtab_section->sh_size) {\n\t\t\t\t\tR_LOG_DEBUG (\"index out of strtab range (%\"PFMT64d\" / %\"PFMT64d\")\\n\",\n\t\t\t\t\t\t(ut64)sym[k].st_name, (ut64)strtab_section->sh_size);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t{\n\t\t\t\t\tint st_name = sym[k].st_name;\n\t\t\t\t\tint maxsize = R_MIN (r_buf_size (bin->b), strtab_section->sh_size);\n\t\t\t\t\tif (is_section_local_sym (bin, &sym[k])) {\n\t\t\t\t\t\tconst char *shname = &bin->shstrtab[bin->shdr[sym[k].st_shndx].sh_name];\n\t\t\t\t\t\tr_str_ncpy (ret[ret_ctr].name, shname, ELF_STRING_LENGTH - 1);\n\t\t\t\t\t} else if (st_name <= 0 || st_name >= maxsize) {\n\t\t\t\t\t\tret[ret_ctr].name[0] = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tr_str_ncpy (ret[ret_ctr].name, &strtab[st_name], ELF_STRING_LENGTH - 1);\n\t\t\t\t\t\tret[ret_ctr].type = type2str (bin, &ret[ret_ctr], &sym[k]);\n\n\t\t\t\t\t\tif (ht_pp_find (symbol_map, &ret[ret_ctr], NULL)) {\n\t\t\t\t\t\t\tmemset (ret + ret_ctr, 0, sizeof (RBinElfSymbol));\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tret[ret_ctr].ordinal = k;\n\t\t\t\tret[ret_ctr].name[ELF_STRING_LENGTH - 1] = '\\0';\n\t\t\t\tfill_symbol_bind_and_type (bin, &ret[ret_ctr], &sym[k]);\n\t\t\t\tret[ret_ctr].is_sht_null = is_sht_null;\n\t\t\t\tret[ret_ctr].is_vaddr = is_vaddr;\n\t\t\t\tret[ret_ctr].last = 0;\n\t\t\t\tret[ret_ctr].is_imported = is_imported;\n\t\t\t\tret_ctr++;\n\t\t\t\tif (type == R_BIN_ELF_IMPORT_SYMBOLS && is_imported) {\n\t\t\t\t\timport_ret_ctr++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tR_FREE (strtab);\n\t\t\tR_FREE (sym);\n\t\t\tht_pp_free (symbol_map);\n\t\t\tsymbol_map = NULL;\n\t\t\tif (type == R_BIN_ELF_IMPORT_SYMBOLS) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (!ret) {\n\t\treturn Elf_(get_phdr_symbols) (bin, type);\n\t}\n\tret[ret_ctr].last = 1; // ugly dirty hack :D\n\tint max = -1;\n\tRBinElfSymbol *aux = NULL;\n\tnsym = Elf_(fix_symbols) (bin, ret_ctr, type, &ret);\n\tif (nsym == -1) {\n\t\tgoto beach;\n\t}\n\n\t// Elf_(fix_symbols) may find additional symbols, some of which could be\n\t// imported symbols. Let's reserve additional space for them.\n\tr_warn_if_fail (nsym >= ret_ctr);\n\timport_ret_ctr += nsym - ret_ctr;\n\n\taux = ret;\n\twhile (!aux->last) {\n\t\tif ((int)aux->ordinal > max) {\n\t\t\tmax = aux->ordinal;\n\t\t}\n\t\taux++;\n\t}\n\tnsym = max;\n\tif (type == R_BIN_ELF_IMPORT_SYMBOLS) {\n\t\tR_FREE (bin->imports_by_ord);\n\t\tbin->imports_by_ord_size = nsym + 1;\n\t\tbin->imports_by_ord = (RBinImport**)calloc (R_MAX (1, nsym + 1), sizeof (RBinImport*));\n\t\tR_FREE (bin->symbols_by_ord);\n\t\tbin->symbols_by_ord_size = nsym + 1;\n\t\tbin->symbols_by_ord = (RBinSymbol**)calloc (R_MAX (1, nsym + 1), sizeof (RBinSymbol*));\n\t\timport_ret = calloc (import_ret_ctr + 1, sizeof (RBinElfSymbol));\n\t\tif (!import_ret) {\n\t\t\tR_LOG_DEBUG (\"Cannot allocate %d symbols\", nsym);\n\t\t\tgoto beach;\n\t\t}\n\t\timport_ret_ctr = 0;\n\t\ti = -1;\n\t\twhile (!ret[++i].last) {\n\t\t\tif (!(import_sym_ptr = Elf_(_r_bin_elf_convert_symbol) (bin, &ret[i], \"%s\"))) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tsetsymord (bin, import_sym_ptr->ordinal, import_sym_ptr);\n\t\t\tif (ret[i].is_imported) {\n\t\t\t\tmemcpy (&import_ret[import_ret_ctr], &ret[i], sizeof (RBinElfSymbol));\n\t\t\t\t++import_ret_ctr;\n\t\t\t}\n\t\t}\n\t\timport_ret[import_ret_ctr].last = 1;\n\t\tR_FREE (ret);\n\t\treturn import_ret;\n\t}\n\treturn ret;\nbeach:\n\tfree (ret);\n\tfree (sym);\n\tfree (strtab);\n\tht_pp_free (symbol_map);\n\treturn NULL;\n}\n\nRBinElfSymbol *Elf_(r_bin_elf_get_symbols)(ELFOBJ *bin) {\n\tif (!bin->g_symbols) {\n\t\tbin->g_symbols = Elf_(_r_bin_elf_get_symbols_imports) (bin, R_BIN_ELF_ALL_SYMBOLS);\n\t}\n\treturn bin->g_symbols;\n}\n\nRBinElfSymbol *Elf_(r_bin_elf_get_imports)(ELFOBJ *bin) {\n\tif (!bin->g_imports) {\n\t\tbin->g_imports = Elf_(_r_bin_elf_get_symbols_imports) (bin, R_BIN_ELF_IMPORT_SYMBOLS);\n\t}\n\treturn bin->g_imports;\n}\n\nRBinElfField* Elf_(r_bin_elf_get_fields)(ELFOBJ *bin) {\n\tRBinElfField *ret = NULL;\n\tint i = 0, j;\n\tif (!bin || !(ret = calloc ((bin->ehdr.e_phnum + 3 + 1), sizeof (RBinElfField)))) {\n\t\treturn NULL;\n\t}\n\tstrncpy (ret[i].name, \"ehdr\", ELF_STRING_LENGTH);\n\tret[i].offset = 0;\n\tret[i++].last = 0;\n\tstrncpy (ret[i].name, \"shoff\", ELF_STRING_LENGTH);\n\tret[i].offset = bin->ehdr.e_shoff;\n\tret[i++].last = 0;\n\tstrncpy (ret[i].name, \"phoff\", ELF_STRING_LENGTH);\n\tret[i].offset = bin->ehdr.e_phoff;\n\tret[i++].last = 0;\n\tfor (j = 0; bin->phdr && j < bin->ehdr.e_phnum; i++, j++) {\n\t\tsnprintf (ret[i].name, ELF_STRING_LENGTH, \"phdr_%i\", j);\n\t\tret[i].offset = bin->phdr[j].p_offset;\n\t\tret[i].last = 0;\n\t}\n\tret[i].last = 1;\n\treturn ret;\n}\n\nvoid Elf_(r_bin_elf_free)(ELFOBJ* bin) {\n\tif (!bin) {\n\t\treturn;\n\t}\n\tfree (bin->phdr);\n\tfree (bin->shdr);\n\tfree (bin->strtab);\n\tfree (bin->shstrtab);\n\tfree (bin->dynstr);\n\tr_vector_fini (&bin->dyn_info.dt_needed);\n\t//free (bin->strtab_section);\n\tsize_t i;\n\tif (bin->imports_by_ord) {\n\t\tfor (i = 0; iimports_by_ord_size; i++) {\n\t\t\tfree (bin->imports_by_ord[i]);\n\t\t}\n\t\tfree (bin->imports_by_ord);\n\t}\n\tif (bin->symbols_by_ord) {\n\t\tfor (i = 0; isymbols_by_ord_size; i++) {\n\t\t\tr_bin_symbol_free (bin->symbols_by_ord[i]);\n\t\t}\n\t\tfree (bin->symbols_by_ord);\n\t}\n\tr_buf_free (bin->b);\n\tif (bin->g_symbols != bin->phdr_symbols) {\n\t\tR_FREE (bin->phdr_symbols);\n\t}\n\tif (bin->g_imports != bin->phdr_imports) {\n\t\tR_FREE (bin->phdr_imports);\n\t}\n\tR_FREE (bin->g_sections);\n\tR_FREE (bin->g_symbols);\n\tR_FREE (bin->g_imports);\n\tR_FREE (bin->g_relocs);\n\tht_up_free (bin->rel_cache);\n\tbin->rel_cache = NULL;\n\tsdb_free (bin->kv);\n\tfree (bin);\n}\n\nELFOBJ* Elf_(r_bin_elf_new_buf)(RBuffer *buf, bool verbose) {\n\tELFOBJ *bin = R_NEW0 (ELFOBJ);\n\tif (bin) {\n\t\tbin->kv = sdb_new0 ();\n\t\tbin->size = r_buf_size (buf);\n\t\tbin->verbose = verbose;\n\t\tbin->b = r_buf_ref (buf);\n\t\tif (!elf_init (bin)) {\n\t\t\tElf_(r_bin_elf_free) (bin);\n\t\t\treturn NULL;\n\t\t}\n\t}\n\treturn bin;\n}\n\nstatic int is_in_pphdr(Elf_(Phdr) *p, ut64 addr) {\n\treturn addr >= p->p_offset && addr < p->p_offset + p->p_filesz;\n}\n\nstatic int is_in_vphdr(Elf_(Phdr) *p, ut64 addr) {\n\treturn addr >= p->p_vaddr && addr < p->p_vaddr + p->p_filesz;\n}\n\n/* Deprecated temporarily. Use r_bin_elf_p2v_new in new code for now. */\nut64 Elf_(r_bin_elf_p2v) (ELFOBJ *bin, ut64 paddr) {\n\tsize_t i;\n\n\tr_return_val_if_fail (bin, 0);\n\tif (!bin->phdr) {\n\t\tif (is_bin_etrel (bin)) {\n\t\t\treturn bin->baddr + paddr;\n\t\t}\n\t\treturn paddr;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tElf_(Phdr) *p = &bin->phdr[i];\n\t\tif (p->p_type == PT_LOAD && is_in_pphdr (p, paddr)) {\n\t\t\tif (!p->p_vaddr && !p->p_offset) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn p->p_vaddr + paddr - p->p_offset;\n\t\t}\n\t}\n\n\treturn paddr;\n}\n\n/* Deprecated temporarily. Use r_bin_elf_v2p_new in new code for now. */\nut64 Elf_(r_bin_elf_v2p)(ELFOBJ *bin, ut64 vaddr) {\n\tr_return_val_if_fail (bin, 0); // UT64_MAX or vaddr?\n\t// r_return_val_if_fail (bin, UT64_MAX);\n\tif (!bin->phdr) {\n\t\tif (is_bin_etrel (bin)) {\n\t\t\treturn vaddr - bin->baddr;\n\t\t}\n\t\treturn vaddr;\n\t}\n\n\tsize_t i;\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tElf_(Phdr) *p = &bin->phdr[i];\n\t\tif (p->p_type == PT_LOAD && is_in_vphdr (p, vaddr)) {\n\t\t\tif (!p->p_offset && !p->p_vaddr) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn p->p_offset + vaddr - p->p_vaddr;\n\t\t}\n\t}\n\treturn vaddr;\n}\n\n/* converts a physical address to the virtual address, looking\n * at the program headers in the binary bin */\nut64 Elf_(r_bin_elf_p2v_new) (ELFOBJ *bin, ut64 paddr) {\n\tsize_t i;\n\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tif (!bin->phdr) {\n\t\tif (is_bin_etrel (bin)) {\n\t\t\treturn bin->baddr + paddr;\n\t\t}\n\t\treturn UT64_MAX;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tElf_(Phdr) *p = &bin->phdr[i];\n\t\tif (p->p_type == PT_LOAD && is_in_pphdr (p, paddr)) {\n\t\t\treturn p->p_vaddr + paddr - p->p_offset;\n\t\t}\n\t}\n\n\treturn UT64_MAX;\n}\n\n/* converts a virtual address to the relative physical address, looking\n * at the program headers in the binary bin */\nut64 Elf_(r_bin_elf_v2p_new) (ELFOBJ *bin, ut64 vaddr) {\n\tsize_t i;\n\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tif (!bin->phdr) {\n\t\tif (is_bin_etrel (bin)) {\n\t\t\treturn vaddr - bin->baddr;\n\t\t}\n\t\treturn UT64_MAX;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tElf_(Phdr) *p = &bin->phdr[i];\n\t\tif (p->p_type == PT_LOAD && is_in_vphdr (p, vaddr)) {\n\t\t\treturn p->p_offset + vaddr - p->p_vaddr;\n\t\t}\n\t}\n\treturn UT64_MAX;\n}\n\nstatic bool get_nt_file_maps(ELFOBJ *bin, RList *core_maps) {\n\tut16 ph, ph_num = bin->ehdr.e_phnum;\n\n\tfor (ph = 0; ph < ph_num; ph++) {\n\t\tElf_(Phdr) *p = &bin->phdr[ph];\n\t\tif (p->p_type == PT_NOTE) {\n\t\t\tint bits = Elf_(r_bin_elf_get_bits)(bin);\n\t\t\tint elf_nhdr_size = (bits == 64) ? sizeof (Elf64_Nhdr) : sizeof (Elf32_Nhdr);\n\t\t\tint size_of = (bits == 64) ? sizeof (ut64) : sizeof (ut32);\n\t\t\tvoid *elf_nhdr = calloc (elf_nhdr_size, 1);\n\t\t\tut64 offset = 0;\n\t\t\tbool found = false;\n\n\t\t\twhile (!found) {\n\t\t\t\tint ret;\n\t\t\t\tut32 n_descsz, n_namesz, n_type;\n\t\t\t\tret = r_buf_read_at (bin->b,\n\t\t\t\t\t\tbin->phdr[ph].p_offset + offset,\n\t\t\t\t\t\telf_nhdr, elf_nhdr_size);\n\t\t\t\tif (ret != elf_nhdr_size) {\n\t\t\t\t\teprintf (\"Cannot read more NOTES header from CORE\\n\");\n\t\t\t\t\tfree (elf_nhdr);\n\t\t\t\t\tgoto fail;\n\t\t\t\t}\n\t\t\t\tif (bits == 64) {\n\t\t\t\t\tn_descsz = round_up (((Elf64_Nhdr *)elf_nhdr)->n_descsz);\n\t\t\t\t\tn_namesz = round_up (((Elf64_Nhdr *)elf_nhdr)->n_namesz);\n\t\t\t\t\tn_type = ((Elf64_Nhdr *)elf_nhdr)->n_type;\n\t\t\t\t} else {\n\t\t\t\t\tn_descsz = round_up (((Elf32_Nhdr *)elf_nhdr)->n_descsz);\n\t\t\t\t\tn_namesz = round_up (((Elf32_Nhdr *)elf_nhdr)->n_namesz);\n\t\t\t\t\tn_type = ((Elf32_Nhdr *)elf_nhdr)->n_type;\n\t\t\t\t}\n\n\t\t\t\tif (n_type == NT_FILE) {\n\t\t\t\t\tfound = true;\n\t\t\t\t\toffset += elf_nhdr_size + n_namesz;\n\t\t\t\t\tfree (elf_nhdr);\n\t\t\t\t} else {\n\t\t\t\t\toffset += elf_nhdr_size + n_descsz + n_namesz;\n\t\t\t\t}\n\t\t\t}\n\t\t\tut64 i = bin->phdr[ph].p_offset + offset;\n\t\t\tut64 n_maps;\n\t\t\tif (bits == 64) {\n\t\t\t\tn_maps = BREAD64 (bin->b, i);\n\t\t\t\t(void)BREAD64 (bin->b, i);\n\t\t\t} else {\n\t\t\t\tn_maps = BREAD32 (bin->b, i);\n\t\t\t\t(void)BREAD32 (bin->b, i);\n\t\t\t}\n\t\t\tut64 jump = ((size_of * 3) * n_maps) + i;\n\t\t\tint len_str = 0;\n\t\t\twhile (n_maps > 0) {\n\t\t\t\tut64 addr;\n\t\t\t\tif (bits == 64) {\n\t\t\t\t\taddr = BREAD64 (bin->b, i);\n\t\t\t\t} else {\n\t\t\t\t\taddr = BREAD32 (bin->b, i);\n\t\t\t\t}\n\t\t\t\tif (addr == UT64_MAX) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tchar str[512] = {0};\n\t\t\t\tr_buf_read_at (bin->b, jump + len_str, (ut8*)str, sizeof (str) - 1);\n\t\t\t\tstr[sizeof (str) - 1] = 0; // null terminate string\n\t\t\t\tRListIter *iter;\n\t\t\t\tRBinMap *p;\n\t\t\t\tr_list_foreach (core_maps, iter, p) {\n\t\t\t\t\tif (p->addr == addr) {\n\t\t\t\t\t\tp->file = strdup (str);\n\t\t\t\t\t }\n\t\t\t\t}\n\t\t\t\tlen_str += strlen (str) + 1;\n\t\t\t\tn_maps--;\n\t\t\t\ti += (size_of * 2);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\nfail:\n\treturn false;\n}\n\nstatic void r_bin_elf_map_free(RBinMap *map) {\n\tif (map) {\n\t\tfree (map->file);\n\t\tfree (map);\n\t}\n}\n\nRList *Elf_(r_bin_elf_get_maps)(ELFOBJ *bin) {\n\tut16 ph, ph_num = bin->ehdr.e_phnum; //Skip PT_NOTE\n\tif (!bin->phdr) {\n\t\treturn NULL;\n\t}\n\tRList *maps = r_list_newf ((RListFree)r_bin_elf_map_free);\n\tfor (ph = 0; ph < ph_num; ph++) {\n\t\tElf_(Phdr) *p = &bin->phdr[ph];\n\t\tif (p->p_type == PT_LOAD) {\n\t\t\tRBinMap *map = R_NEW0 (RBinMap);\n\t\t\tif (map) {\n\t\t\t\tmap->addr = p->p_vaddr;\n\t\t\t\tmap->size = p->p_memsz;\n\t\t\t\tmap->perms = p->p_flags;\n\t\t\t\tmap->offset = p->p_offset;\n\t\t\t\tmap->file = NULL;\n\t\t\t\tr_list_append (maps, map);\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!r_list_empty (maps)) {\n\t\tif (!get_nt_file_maps (bin, maps)) {\n\t\t\teprintf (\"Could not retrieve the names of all maps from NT_FILE\\n\");\n\t\t}\n\t}\n\n\treturn maps;\n}\n\nchar *Elf_(r_bin_elf_compiler)(ELFOBJ *bin) {\n\tRBinElfSection *section = get_section_by_name (bin, \".comment\");\n\tif (!section) {\n\t\treturn NULL;\n\t}\n\tut64 off = section->offset;\n\tut32 sz = R_MIN (section->size, 128);\n\tif (sz < 1) {\n\t\treturn NULL;\n\t}\n\tchar *buf = malloc (sz + 1);\n\tif (!buf) {\n\t\treturn NULL;\n\t}\n\tif (r_buf_read_at (bin->b, off, (ut8*)buf, sz) < 1) {\n\t\tfree (buf);\n\t\treturn NULL;\n\t}\n\tbuf[sz] = 0;\n\tconst size_t buflen = strlen (buf);\n\tchar *nullbyte = buf + buflen;\n\tif (buflen != sz && nullbyte[1] && buflen < sz) {\n\t\tnullbyte[0] = ' ';\n\t}\n\tbuf[sz] = 0;\n\tr_str_trim (buf);\n\tchar * res = r_str_escape (buf);\n\tfree (buf);\n\treturn res;\n}\n\nbool Elf_(r_bin_elf_is_executable)(ELFOBJ *bin) {\n\tconst int t = bin->ehdr.e_type;\n\treturn t == ET_EXEC || t == ET_DYN;\n}\n"},"code_after":{"kind":"string","value":"/* radare - LGPL - Copyright 2008-2022 - nibble, pancake, alvaro_fe */\n\n#define R_LOG_ORIGIN \"elf\"\n#include \n#include \n#include \"elf.h\"\n\n#define MIPS_PLT_OFFSET 0x20\n#define RISCV_PLT_OFFSET 0x20\n#define LOONGARCH_PLT_OFFSET 0x20\n\n#define RISCV_PLT_ENTRY_SIZE 0x10\n#define LOONGARCH_PLT_ENTRY_SIZE 0x10\n#define X86_PLT_ENTRY_SIZE 0x10\n\n#define SPARC_OFFSET_PLT_ENTRY_FROM_GOT_ADDR -0x6\n#define X86_OFFSET_PLT_ENTRY_FROM_GOT_ADDR -0x6\n\n#define ELF_PAGE_MASK 0xFFFFFFFFFFFFF000LL\n#define ELF_PAGE_SIZE 12\n\n#define R_ELF_NO_RELRO 0\n#define R_ELF_PART_RELRO 1\n#define R_ELF_FULL_RELRO 2\n\n#define MAX_REL_RELA_SZ (sizeof (Elf_(Rel)) > sizeof (Elf_(Rela))? sizeof (Elf_(Rel)): sizeof (Elf_(Rela)))\n\n#define READ8(x, i) r_read_ble8((x) + (i)); (i) += 1\n#define READ16(x, i) r_read_ble16((x) + (i), bin->endian); (i) += 2\n#define READ32(x, i) r_read_ble32((x) + (i), bin->endian); (i) += 4\n#define READ64(x, i) r_read_ble64((x) + (i), bin->endian); (i) += 8\n\n#define BREAD8(x, i) r_buf_read_ble8_at (x, i); (i) += 1\n#define BREAD16(x, i) r_buf_read_ble16_at (x, i, bin->endian); (i) += 2\n#define BREAD32(x, i) r_buf_read_ble32_at (x, i, bin->endian); (i) += 4\n#define BREAD64(x, i) r_buf_read_ble64_at (x, i, bin->endian); (i) += 8\n\n#define NUMENTRIES_ROUNDUP(sectionsize, entrysize) (((sectionsize) + (entrysize)-1) / (entrysize))\n#define COMPUTE_PLTGOT_POSITION(rel, pltgot_addr, n_initial_unused_entries) \\\n\t((rel->rva - pltgot_addr - n_initial_unused_entries * R_BIN_ELF_WORDSIZE) / R_BIN_ELF_WORDSIZE)\n\n#define GROWTH_FACTOR (1.5)\n\n#define round_up(a) ((((a) + (4) - (1)) / (4)) * (4))\n\n#define EF_MIPS_ABI_O32\t\t0x00001000 /* O32 ABI. */\n#define EF_MIPS_ABI_O64\t\t0x00002000 /* O32 extended for 64 bit. */\n#define EF_MIPS_ABI\t\t\t0x0000f000\n\nstatic inline bool is_elfclass64(Elf_(Ehdr) *h) {\n\treturn h->e_ident[EI_CLASS] == ELFCLASS64;\n}\n\nstatic bool is_mips_o32(Elf_(Ehdr) *h) {\n\tif (h->e_ident[EI_CLASS] != ELFCLASS32) {\n\t\treturn false;\n\t}\n\tif ((h->e_flags & EF_MIPS_ABI2) != 0) {\n\t\treturn false;\n\t}\n\tif (((h->e_flags & EF_MIPS_ABI) != 0) &&\n\t\t((h->e_flags & EF_MIPS_ABI) != EF_MIPS_ABI_O32)) {\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nstatic bool is_mips_n32(Elf_(Ehdr) *h) {\n\tif (h->e_ident[EI_CLASS] != ELFCLASS32) {\n\t\treturn false;\n\t}\n\tif (((h->e_flags & EF_MIPS_ABI2) == 0) ||\n\t\t((h->e_flags & EF_MIPS_ABI) != 0)) {\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nenum {\n\tX86,\n\tX86_64,\n\tARM,\n\tAARCH64,\n\tRCE,\n\tARCH_LEN\n};\n\ntypedef struct reginfo {\n\tut32 regsize;\n\tut32 regdelta;\n} reginfo_t;\n\nstatic reginfo_t reginf[ARCH_LEN] = {\n\t{ 160, 0x5c },\n\t{ 216, 0x84 },\n\t{ 72, 0x5c },\n\t{ 272, 0x84 },\n\t{ 272, 0x84 }\n};\n\nstatic inline int __strnlen(const char *str, int len) {\n\tint l = 0;\n\twhile (IS_PRINTABLE (*str) && --len) {\n\t\tif (((ut8)*str) == 0xff) {\n\t\t\tbreak;\n\t\t}\n\t\tstr++;\n\t\tl++;\n\t}\n\treturn l + 1;\n}\n\nstatic bool is_bin_etrel(ELFOBJ *bin) {\n\treturn bin->ehdr.e_type == ET_REL;\n}\n\nstatic bool __is_valid_ident(ELFOBJ *bin) {\n\treturn !strncmp ((char *)bin->ehdr.e_ident, ELFMAG, SELFMAG) ||\n\t\t!strncmp ((char *)bin->ehdr.e_ident, CGCMAG, SCGCMAG);\n}\n\nstatic bool init_ehdr(ELFOBJ *bin) {\n\tut8 e_ident[EI_NIDENT];\n\tut8 ehdr[sizeof (Elf_(Ehdr))] = {0};\n\tint i, len;\n\tif (r_buf_read_at (bin->b, 0, e_ident, EI_NIDENT) == -1) {\n\t\tR_LOG_DEBUG (\"read (magic)\");\n\t\treturn false;\n\t}\n\tsdb_set (bin->kv, \"elf_type.cparse\", \"enum elf_type { ET_NONE=0, ET_REL=1,\"\n\t\t\t\" ET_EXEC=2, ET_DYN=3, ET_CORE=4, ET_LOOS=0xfe00, ET_HIOS=0xfeff,\"\n\t\t\t\" ET_LOPROC=0xff00, ET_HIPROC=0xffff };\", 0);\n\tsdb_set (bin->kv, \"elf_machine.cparse\", \"enum elf_machine {EM_NONE=0, EM_M32=1,\"\n\t\t\t\" EM_SPARC=2, EM_386=3, EM_68K=4, EM_88K=5, EM_IAMCU=6, EM_860=7, EM_MIPS=8,\"\n\t\t\t\" EM_S370=9, EM_MIPS_RS3_LE=10, EM_RS6000=11, EM_PARISC=15, EM_nCUBE=16,\"\n\t\t\t\" EM_VPP500=17, EM_SPARC32PLUS=18, EM_960=19, EM_PPC=20, EM_PPC64=21, EM_S390=22,\"\n\t\t\t\" EM_SPU=23, EM_V800=36, EM_FR20=37, EM_RH32=38, EM_RCE=39, EM_ARM=40,\"\n\t\t\t\" EM_ALPHA=41, EM_SH=42, EM_SPARCV9=43, EM_TRICORE=44, EM_ARC=45, EM_H8_300=46,\"\n\t\t\t\" EM_H8_300H=47, EM_H8S=48, EM_H8_500=49, EM_IA_64=50, EM_MIPS_X=51,\"\n\t\t\t\" EM_COLDFIRE=52, EM_68HC12=53, EM_MMA=54, EM_PCP=55, EM_NCPU=56, EM_NDR1=57,\"\n\t\t\t\" EM_STARCORE=58, EM_ME16=59, EM_ST100=60, EM_TINYJ=61, EM_X86_64=62, EM_PDSP=63,\"\n\t\t\t\" EM_PDP10=64, EM_PDP11=65, EM_FX66=66, EM_ST9PLUS=67, EM_ST7=68, EM_68HC16=69,\"\n\t\t\t\" EM_68HC11=70, EM_68HC08=71, EM_68HC05=72, EM_SVX=73, EM_ST19=74, EM_VAX=75,\"\n\t\t\t\" EM_CRIS=76, EM_JAVELIN=77, EM_FIREPATH=78, EM_ZSP=79, EM_MMIX=80, EM_HUANY=81,\"\n\t\t\t\" EM_PRISM=82, EM_AVR=83, EM_FR30=84, EM_D10V=85, EM_D30V=86, EM_V850=87,\"\n\t\t\t\" EM_M32R=88, EM_MN10300=89, EM_MN10200=90, EM_PJ=91, EM_OPENRISC=92,\"\n\t\t\t\" EM_ARC_COMPACT=93, EM_XTENSA=94, EM_VIDEOCORE=95, EM_TMM_GPP=96, EM_NS32K=97,\"\n\t\t\t\" EM_TPC=98, EM_SNP1K=99, EM_ST200=100, EM_IP2K=101, EM_MAX=102, EM_CR=103,\"\n\t\t\t\" EM_F2MC16=104, EM_MSP430=105, EM_BLACKFIN=106, EM_SE_C33=107, EM_SEP=108,\"\n\t\t\t\" EM_ARCA=109, EM_UNICORE=110, EM_EXCESS=111, EM_DXP=112, EM_ALTERA_NIOS2=113,\"\n\t\t\t\" EM_CRX=114, EM_XGATE=115, EM_C166=116, EM_M16C=117, EM_DSPIC30F=118, EM_CE=119,\"\n\t\t\t\" EM_M32C=120, EM_TSK3000=131, EM_RS08=132, EM_SHARC=133, EM_ECOG2=134,\"\n\t\t\t\" EM_SCORE7=135, EM_DSP24=136, EM_VIDEOCORE3=137, EM_LATTICEMICO32=138,\"\n\t\t\t\" EM_SE_C17=139, EM_TI_C6000=140, EM_TI_C2000=141, EM_TI_C5500=142,\"\n\t\t\t\" EM_TI_ARP32=143, EM_TI_PRU=144,\"\n\t\t\t\" EM_MMDSP_PLUS=160, EM_CYPRESS_M8C=161, EM_R32C=162, EM_TRIMEDIA=163,\"\n\t\t\t\" EM_QDSP6=164, EM_8051=165, EM_STXP7X=166, EM_NDS32=167,\"\n\t\t\t\" EM_ECOG1X=168, EM_MAXQ30=169, EM_XIMO16=170, EM_MANIK=171, EM_CRAYNV2=172,\"\n\t\t\t\" EM_RX=173, EM_METAG=174, EM_MCST_ELBRUS=175, EM_ECOG16=176, EM_CR16=177,\"\n\t\t\t\" EM_ETPU=178, EM_SLE9X=179, EM_L10M=180, EM_K10M=181, EM_AARCH64=183,\"\n\t\t\t\" EM_AVR32=185, EM_STM8=186, EM_TILE64=187, EM_TILEPRO=188, EM_CUDA=190,\"\n\t\t\t\" EM_TILEGX=191, EM_CLOUDSHIELD=192, EM_COREA_1ST=193, EM_COREA_2ND=194,\"\n\t\t\t\" EM_ARC_COMPACT2=195, EM_OPEN8=196, EM_RL78=197, EM_VIDEOCORE5=198,\"\n\t\t\t\" EM_78KOR=199, EM_56800EX=200, EM_BA1=201, EM_BA2=202, EM_XCORE=203,\"\n\t\t\t\" EM_MCHP_PIC=204, EM_INTEL205=205, EM_INTEL206=206, EM_INTEL207=207,\"\n\t\t\t\" EM_INTEL208=208, EM_INTEL209=209, EM_KM32=210, EM_KMX32=211, EM_KMX16=212,\"\n\t\t\t\" EM_KMX8=213, EM_KVARC=214, EM_CDP=215, EM_COGE=216, EM_COOL=217, EM_NORC=218,\"\n\t\t\t\" EM_CSR_KALIMBA=219, EM_AMDGPU=224, EM_RISCV=243, EM_LANAI=244, EM_BPF=247,\"\n\t\t\t\" EM_CSKY=252, EM_KVX=256, EM_LOONGARCH=258}\", 0);\n\tsdb_set (bin->kv, \"elf_class.cparse\", \"enum elf_class {ELFCLASSNONE=0, ELFCLASS32=1, ELFCLASS64=2};\", 0);\n\tsdb_set (bin->kv, \"elf_data.cparse\", \"enum elf_data {ELFDATANONE=0, ELFDATA2LSB=1, ELFDATA2MSB=2};\", 0);\n\tsdb_set (bin->kv, \"elf_hdr_version.cparse\", \"enum elf_hdr_version {EV_NONE=0, EV_CURRENT=1};\", 0);\n\tsdb_set (bin->kv, \"elf_obj_version.cparse\", \"enum elf_obj_version {EV_NONE=0, EV_CURRENT=1};\", 0);\n\tsdb_num_set (bin->kv, \"elf_header.offset\", 0, 0);\n\tsdb_num_set (bin->kv, \"elf_header.size\", sizeof (Elf_(Ehdr)), 0);\n\tsdb_set (bin->kv, \"elf_ident.format\", \"[4]z[1]E[1]E[1]E.::\"\n\t\t\t\" magic (elf_class)class (elf_data)data (elf_hdr_version)version\", 0);\n#if R_BIN_ELF64\n\tsdb_set (bin->kv, \"elf_header.format\", \"?[2]E[2]E[4]EqqqxN2N2N2N2N2N2\"\n\t\t\t\" (elf_ident)ident (elf_type)type (elf_machine)machine (elf_obj_version)version\"\n\t\t\t\" entry phoff shoff flags ehsize phentsize phnum shentsize shnum shstrndx\", 0);\n#else\n\tsdb_set (bin->kv, \"elf_header.format\", \"?[2]E[2]E[4]ExxxxN2N2N2N2N2N2\"\n\t\t\t\" (elf_ident)ident (elf_type)type (elf_machine)machine (elf_obj_version)version\"\n\t\t\t\" entry phoff shoff flags ehsize phentsize phnum shentsize shnum shstrndx\", 0);\n#endif\n\tbin->endian = (e_ident[EI_DATA] == ELFDATA2MSB)? 1: 0;\n\tmemset (&bin->ehdr, 0, sizeof (Elf_(Ehdr)));\n\tlen = r_buf_read_at (bin->b, 0, ehdr, sizeof (ehdr));\n\tif (len < 32) { // tinyelf != sizeof (Elf_(Ehdr))) {\n\t\tR_LOG_DEBUG (\"read (ehdr)\");\n\t\treturn false;\n\t}\n\t// XXX no need to check twice\n\tmemcpy (&bin->ehdr.e_ident, ehdr, 16);\n\tif (!__is_valid_ident (bin)) {\n\t\treturn false;\n\t}\n\ti = 16;\n\t// TODO: use r_read or r_buf_read_ apis instead\n\tbin->ehdr.e_type = READ16 (ehdr, i);\n\tbin->ehdr.e_machine = READ16 (ehdr, i);\n\tbin->ehdr.e_version = READ32 (ehdr, i);\n#if R_BIN_ELF64\n\tbin->ehdr.e_entry = READ64 (ehdr, i);\n\tbin->ehdr.e_phoff = READ64 (ehdr, i);\n\tbin->ehdr.e_shoff = READ64 (ehdr, i);\n#else\n\tbin->ehdr.e_entry = READ32 (ehdr, i);\n\tbin->ehdr.e_phoff = READ32 (ehdr, i);\n\tbin->ehdr.e_shoff = READ32 (ehdr, i);\n#endif\n\tbin->ehdr.e_flags = READ32 (ehdr, i);\n\tbin->ehdr.e_ehsize = READ16 (ehdr, i);\n\tbin->ehdr.e_phentsize = READ16 (ehdr, i);\n\tbin->ehdr.e_phnum = READ16 (ehdr, i);\n\tbin->ehdr.e_shentsize = READ16 (ehdr, i);\n\tbin->ehdr.e_shnum = READ16 (ehdr, i);\n\tbin->ehdr.e_shstrndx = READ16 (ehdr, i);\n\treturn true;\n\t// [Outdated] Usage example:\n\t// > td `k bin/cur/info/elf_type.cparse`; td `k bin/cur/info/elf_machine.cparse`\n\t// > pf `k bin/cur/info/elf_header.format` @ `k bin/cur/info/elf_header.offset`\n}\n\nut64 Elf_(r_bin_elf_get_phnum)(ELFOBJ *obj) {\n\tr_return_val_if_fail (obj, 0);\n\tut64 num = obj->ehdr.e_phnum & UT16_MAX;\n\tif (obj->ehdr.e_phnum == 0xffff) {\n\t\tut32 shnum = obj->ehdr.e_shnum;\n\t\t// sh_info member of the initial entry in section header table.\n\t\tif (shnum > 0) {\n\t\t\tut32 shoff = obj->ehdr.e_shoff;\n\t\t\tElf_(Shdr) shdr = {0};\n\t\t\t(void)r_buf_read_at (obj->b, shoff, (ut8 *)&shdr, sizeof (shdr));\n\t\t\tnum = shdr.sh_info;\n\t\t\tif ((int)(shdr.sh_info) < 1) {\n\t\t\t\treturn UT16_MAX;\n\t\t\t}\n\t\t}\n\t}\n\treturn num;\n}\n\nstatic bool read_phdr(ELFOBJ *bin, bool linux_kernel_hack) {\n\tbool phdr_found = false;\n\tint i;\n#if R_BIN_ELF64\n\tconst bool is_elf64 = true;\n#else\n\tconst bool is_elf64 = false;\n#endif\n\tut64 phnum = Elf_(r_bin_elf_get_phnum) (bin);\n\tfor (i = 0; i < phnum; i++) {\n\t\tut8 phdr[sizeof (Elf_(Phdr))] = {0};\n\t\tint j = 0;\n\t\tconst size_t rsize = bin->ehdr.e_phoff + i * sizeof (Elf_(Phdr));\n\t\tint len = r_buf_read_at (bin->b, rsize, phdr, sizeof (Elf_(Phdr)));\n\t\tif (len < 1) {\n\t\t\tR_LOG_DEBUG (\"read (phdr)\");\n\t\t\tR_FREE (bin->phdr);\n\t\t\treturn false;\n\t\t}\n\t\tbin->phdr[i].p_type = READ32 (phdr, j);\n\t\tif (bin->phdr[i].p_type == PT_PHDR) {\n\t\t\tphdr_found = true;\n\t\t}\n\n\t\tif (is_elf64) {\n\t\t\tbin->phdr[i].p_flags = READ32 (phdr, j);\n\t\t}\n\t\tbin->phdr[i].p_offset = R_BIN_ELF_READWORD (phdr, j);\n\t\tbin->phdr[i].p_vaddr = R_BIN_ELF_READWORD (phdr, j);\n\t\tbin->phdr[i].p_paddr = R_BIN_ELF_READWORD (phdr, j);\n\t\tbin->phdr[i].p_filesz = R_BIN_ELF_READWORD (phdr, j);\n\t\tbin->phdr[i].p_memsz = R_BIN_ELF_READWORD (phdr, j);\n\t\tif (!is_elf64) {\n\t\t\tbin->phdr[i].p_flags = READ32 (phdr, j);\n\t\t//\tbin->phdr[i].p_flags |= 1; tiny.elf needs this somehow :? LOAD0 is always +x for linux?\n\t\t}\n\t\tbin->phdr[i].p_align = R_BIN_ELF_READWORD (phdr, j);\n\t}\n\t/* Here is the where all the fun starts.\n\t * Linux kernel since 2005 calculates phdr offset wrongly\n\t * adding it to the load address (va of the LOAD0).\n\t * See `fs/binfmt_elf.c` file this line:\n\t * NEW_AUX_ENT(AT_PHDR, load_addr + exec->e_phoff);\n\t * So after the first read, we fix the address and read it again\n\t */\n\tif (linux_kernel_hack && phdr_found) {\n\t\tut64 load_addr = Elf_(r_bin_elf_get_baddr) (bin);\n\t\tbin->ehdr.e_phoff = Elf_(r_bin_elf_v2p) (bin, load_addr + bin->ehdr.e_phoff);\n\t\treturn read_phdr (bin, false);\n\t}\n\n\treturn true;\n}\n\nstatic int init_phdr(ELFOBJ *bin) {\n\tut32 phdr_size;\n\n\tr_return_val_if_fail (bin && !bin->phdr, false);\n\n\tif (!bin->ehdr.e_phnum) {\n\t\treturn false;\n\t}\n\tif (!UT32_MUL (&phdr_size, (ut32)bin->ehdr.e_phnum, sizeof (Elf_(Phdr)))) {\n\t\treturn false;\n\t}\n\tif (!phdr_size) {\n\t\treturn false;\n\t}\n\tif (phdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (phdr_size > (ut32)bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_phoff > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_phoff + phdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tut64 phnum = Elf_(r_bin_elf_get_phnum) (bin);\n\tif (!(bin->phdr = R_NEWS0 (Elf_(Phdr), phnum))) {\n\t\tr_sys_perror (\"malloc (phdr)\");\n\t\treturn false;\n\t}\n\n\tbool linux_kern_hack = false;\n\t/* Enable this hack only for the X86 64bit ELFs */\n\tconst int _128K = 1024 * 128;\n\tif (r_buf_size (bin->b) > _128K && (bin->ehdr.e_machine == EM_X86_64 || bin->ehdr.e_machine == EM_386)) {\n\t\tlinux_kern_hack = true;\n\t}\n\tif (!read_phdr (bin, linux_kern_hack)) {\n\t\treturn false;\n\t}\n\n\tsdb_num_set (bin->kv, \"elf_phdr.offset\", bin->ehdr.e_phoff, 0);\n\tsdb_num_set (bin->kv, \"elf_phdr.size\", sizeof (Elf_(Phdr)), 0);\n\tsdb_set (bin->kv, \"elf_p_type.cparse\", \"enum elf_p_type {PT_NULL=0,PT_LOAD=1,PT_DYNAMIC=2,\"\n\t\t\"PT_INTERP=3,PT_NOTE=4,PT_SHLIB=5,PT_PHDR=6,PT_LOOS=0x60000000,\"\n\t\t\"PT_HIOS=0x6fffffff,PT_LOPROC=0x70000000,PT_HIPROC=0x7fffffff};\",\n\t\t0);\n\tsdb_set (bin->kv, \"elf_p_flags.cparse\", \"enum elf_p_flags {PF_None=0,PF_Exec=1,\"\n\t\t\t\"PF_Write=2,PF_Write_Exec=3,PF_Read=4,PF_Read_Exec=5,PF_Read_Write=6,\"\n\t\t\t\"PF_Read_Write_Exec=7};\", 0);\n#if R_BIN_ELF64\n\tsdb_set (bin->kv, \"elf_phdr.format\", \"[4]E[4]Eqqqqqq (elf_p_type)type (elf_p_flags)flags\"\n\t\t\t\" offset vaddr paddr filesz memsz align\", 0);\n#else\n\tsdb_set (bin->kv, \"elf_phdr.format\", \"[4]Exxxxx[4]Ex (elf_p_type)type offset vaddr paddr\"\n\t\t\t\" filesz memsz (elf_p_flags)flags align\", 0);\n#endif\n\treturn true;\n\t// Usage example:\n\t// > td `k bin/cur/info/elf_p_type.cparse`; td `k bin/cur/info/elf_p_flags.cparse`\n\t// > pf `k bin/cur/info/elf_phdr.format` @ `k bin/cur/info/elf_phdr.offset`\n}\n\nstatic int init_shdr(ELFOBJ *bin) {\n\tut32 shdr_size;\n\tut8 shdr[sizeof (Elf_(Shdr))] = {0};\n\tsize_t i, j, len;\n\n\tr_return_val_if_fail (bin && !bin->shdr, false);\n\n\tif (!UT32_MUL (&shdr_size, bin->ehdr.e_shnum, sizeof (Elf_(Shdr)))) {\n\t\treturn false;\n\t}\n\tif (shdr_size < 1) {\n\t\treturn false;\n\t}\n\tif (shdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_shoff > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_shoff + shdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (!(bin->shdr = R_NEWS0 (Elf_(Shdr), bin->ehdr.e_shnum))) {\n\t\tr_sys_perror (\"malloc (shdr)\");\n\t\treturn false;\n\t}\n\tsdb_num_set (bin->kv, \"elf_shdr.offset\", bin->ehdr.e_shoff, 0);\n\tsdb_num_set (bin->kv, \"elf_shdr.size\", sizeof (Elf_(Shdr)), 0);\n\tsdb_set (bin->kv, \"elf_s_type.cparse\", \"enum elf_s_type {SHT_NULL=0,SHT_PROGBITS=1,\"\n\t\t\t\"SHT_SYMTAB=2,SHT_STRTAB=3,SHT_RELA=4,SHT_HASH=5,SHT_DYNAMIC=6,SHT_NOTE=7,\"\n\t\t\t\"SHT_NOBITS=8,SHT_REL=9,SHT_SHLIB=10,SHT_DYNSYM=11,SHT_LOOS=0x60000000,\"\n\t\t\t\"SHT_HIOS=0x6fffffff,SHT_LOPROC=0x70000000,SHT_HIPROC=0x7fffffff};\", 0);\n\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tj = 0;\n\t\tlen = r_buf_read_at (bin->b, bin->ehdr.e_shoff + i * sizeof (Elf_(Shdr)), shdr, sizeof (Elf_(Shdr)));\n\t\tif (len < 1) {\n\t\t\tR_LOG_DEBUG (\"read (shdr) at 0x%\" PFMT64x, (ut64) bin->ehdr.e_shoff);\n\t\t\tR_FREE (bin->shdr);\n\t\t\treturn false;\n\t\t}\n\t\tbin->shdr[i].sh_name = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_type = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_flags = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_addr = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_offset = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_size = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_link = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_info = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_addralign = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_entsize = R_BIN_ELF_READWORD (shdr, j);\n\t}\n\n#if R_BIN_ELF64\n\tsdb_set (bin->kv, \"elf_s_flags_64.cparse\", \"enum elf_s_flags_64 {SF64_None=0,SF64_Exec=1,\"\n\t\t\t\"SF64_Alloc=2,SF64_Alloc_Exec=3,SF64_Write=4,SF64_Write_Exec=5,\"\n\t\t\t\"SF64_Write_Alloc=6,SF64_Write_Alloc_Exec=7};\", 0);\n\tsdb_set (bin->kv, \"elf_shdr.format\", \"x[4]E[8]Eqqqxxqq name (elf_s_type)type\"\n\t\t\t\" (elf_s_flags_64)flags addr offset size link info addralign entsize\", 0);\n#else\n\tsdb_set (bin->kv, \"elf_s_flags_32.cparse\", \"enum elf_s_flags_32 {SF32_None=0,SF32_Exec=1,\"\n\t\t\t\"SF32_Alloc=2,SF32_Alloc_Exec=3,SF32_Write=4,SF32_Write_Exec=5,\"\n\t\t\t\"SF32_Write_Alloc=6,SF32_Write_Alloc_Exec=7};\", 0);\n\tsdb_set (bin->kv, \"elf_shdr.format\", \"x[4]E[4]Exxxxxxx name (elf_s_type)type\"\n\t\t\t\" (elf_s_flags_32)flags addr offset size link info addralign entsize\", 0);\n#endif\n\treturn true;\n\t// Usage example:\n\t// > td `k bin/cur/info/elf_s_type.cparse`; td `k bin/cur/info/elf_s_flags_64.cparse`\n\t// > pf `k bin/cur/info/elf_shdr.format` @ `k bin/cur/info/elf_shdr.offset`\n}\n\nstatic bool is_shidx_valid(ELFOBJ *bin, Elf_(Half) value) {\n\treturn value < bin->ehdr.e_shnum && !R_BETWEEN (SHN_LORESERVE, value, SHN_HIRESERVE);\n}\n\nstatic int init_strtab(ELFOBJ *bin) {\n\tr_return_val_if_fail (!bin->strtab, false);\n\n\tif (!bin->shdr) {\n\t\treturn false;\n\t}\n\n\tElf_(Half) shstrndx = bin->ehdr.e_shstrndx;\n\tif (shstrndx != SHN_UNDEF && !is_shidx_valid (bin, shstrndx)) {\n\t\treturn false;\n\t}\n\n\t/* sh_size must be lower than UT32_MAX and not equal to zero, to avoid bugs on malloc() */\n\tif (bin->shdr[shstrndx].sh_size > UT32_MAX) {\n\t\treturn false;\n\t}\n\tif (!bin->shdr[shstrndx].sh_size) {\n\t\treturn false;\n\t}\n\tbin->shstrtab_section = bin->strtab_section = &bin->shdr[shstrndx];\n\tbin->shstrtab_size = bin->shstrtab_section->sh_size;\n\tif (bin->shstrtab_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->shstrtab_section->sh_offset > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->shstrtab_section->sh_offset + bin->shstrtab_section->sh_size > bin->size) {\n\t\treturn false;\n\t}\n\n\tif (!(bin->shstrtab = calloc (1, bin->shstrtab_size + 1))) {\n\t\tr_sys_perror (\"malloc\");\n\t\tbin->shstrtab = NULL;\n\t\treturn false;\n\t}\n\tint res = r_buf_read_at (bin->b, bin->shstrtab_section->sh_offset, (ut8*)bin->shstrtab,\n\t\tbin->shstrtab_section->sh_size);\n\tif (res < 1) {\n\t\tR_LOG_DEBUG (\"read (shstrtab) at 0x%\" PFMT64x, (ut64) bin->shstrtab_section->sh_offset);\n\t\tR_FREE (bin->shstrtab);\n\t\treturn false;\n\t}\n\tbin->shstrtab[bin->shstrtab_section->sh_size] = '\\0';\n\n\tsdb_num_set (bin->kv, \"elf_shstrtab.offset\", bin->shstrtab_section->sh_offset, 0);\n\tsdb_num_set (bin->kv, \"elf_shstrtab.size\", bin->shstrtab_section->sh_size, 0);\n\n\treturn true;\n}\n\nstatic Elf_(Phdr) *get_dynamic_segment(ELFOBJ *bin) {\n\tint i;\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tif (bin->phdr[i].p_type == PT_DYNAMIC) {\n\t\t\tif (bin->phdr[i].p_filesz > bin->size) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (bin->phdr[i].p_offset > bin->size) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (bin->phdr[i].p_offset + sizeof (Elf_(Dyn)) > bin->size) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\treturn &bin->phdr[i];\n\t\t}\n\t}\n\treturn NULL;\n}\n\nstatic void init_dynamic_section_sdb(ELFOBJ *bin, Elf_(Addr) strtabaddr, size_t strsize) {\n\tint r = Elf_(r_bin_elf_has_relro) (bin);\n\tswitch (r) {\n\tcase R_ELF_FULL_RELRO:\n\t\tsdb_set (bin->kv, \"elf.relro\", \"full\", 0);\n\t\tbreak;\n\tcase R_ELF_PART_RELRO:\n\t\tsdb_set (bin->kv, \"elf.relro\", \"partial\", 0);\n\t\tbreak;\n\tdefault:\n\t\tsdb_set (bin->kv, \"elf.relro\", \"no\", 0);\n\t\tbreak;\n\t}\n\tsdb_num_set (bin->kv, \"elf_strtab.offset\", strtabaddr, 0);\n\tsdb_num_set (bin->kv, \"elf_strtab.size\", strsize, 0);\n}\n\nstatic void set_default_value_dynamic_info(ELFOBJ *bin) {\n\tbin->dyn_info.dt_pltrelsz = 0;\n\tbin->dyn_info.dt_pltgot = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_hash = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_strtab = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_symtab = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_rela = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_relasz = 0;\n\tbin->dyn_info.dt_relaent = 0;\n\tbin->dyn_info.dt_strsz = 0;\n\tbin->dyn_info.dt_syment = 0;\n\tbin->dyn_info.dt_rel = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_relsz = 0;\n\tbin->dyn_info.dt_relent = 0;\n\tbin->dyn_info.dt_pltrel = R_BIN_ELF_XWORD_MAX;\n\tbin->dyn_info.dt_jmprel = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_pltgot = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_mips_pltgot = R_BIN_ELF_ADDR_MAX;\n\tbin->dyn_info.dt_bind_now = false;\n\tbin->dyn_info.dt_flags = R_BIN_ELF_XWORD_MAX;\n\tbin->dyn_info.dt_flags_1 = R_BIN_ELF_XWORD_MAX;\n\tbin->dyn_info.dt_rpath = R_BIN_ELF_XWORD_MAX;\n\tbin->dyn_info.dt_runpath = R_BIN_ELF_XWORD_MAX;\n\tr_vector_init(&bin->dyn_info.dt_needed, sizeof (Elf_(Off)), NULL, NULL);\n}\n\nstatic size_t get_maximum_number_of_dynamic_entries(ut64 dyn_size) {\n\treturn dyn_size / sizeof (Elf_(Dyn));\n}\n\nstatic bool fill_dynamic_entry(ELFOBJ *bin, ut64 entry_offset, Elf_(Dyn) *d) {\n\tut8 sdyn[sizeof (Elf_(Dyn))] = {0};\n\tint j = 0;\n\tint len = r_buf_read_at (bin->b, entry_offset, sdyn, sizeof (Elf_(Dyn)));\n\tif (len < 1) {\n\t\treturn false;\n\t}\n\n\td->d_tag = R_BIN_ELF_READWORD (sdyn, j);\n\td->d_un.d_ptr = R_BIN_ELF_READWORD (sdyn, j);\n\n\treturn true;\n}\n\nstatic void fill_dynamic_entries(ELFOBJ *bin, ut64 loaded_offset, ut64 dyn_size) {\n\tElf_(Dyn) d = {0};\n\tsize_t i;\n\tsize_t number_of_entries = get_maximum_number_of_dynamic_entries(dyn_size);\n\n\tfor (i = 0; i < number_of_entries; i++) {\n\t\tut64 entry_offset = loaded_offset + i * sizeof (Elf_(Dyn));\n\t\tif (!fill_dynamic_entry (bin, entry_offset, &d)) {\n\t\t\tbreak;\n\t\t}\n\n\t\tswitch (d.d_tag) {\n\t\tcase DT_NULL:\n\t\t\tbreak;\n\t\tcase DT_PLTRELSZ:\n\t\t\tbin->dyn_info.dt_pltrelsz = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_PLTGOT:\n\t\t\tbin->dyn_info.dt_pltgot = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_HASH:\n\t\t\tbin->dyn_info.dt_hash = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_STRTAB:\n\t\t\tbin->dyn_info.dt_strtab = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_SYMTAB:\n\t\t\tbin->dyn_info.dt_symtab = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_RELA:\n\t\t\tbin->dyn_info.dt_rela = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_RELASZ:\n\t\t\tbin->dyn_info.dt_relasz = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_RELAENT:\n\t\t\tbin->dyn_info.dt_relaent = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_STRSZ:\n\t\t\tbin->dyn_info.dt_strsz = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_SYMENT:\n\t\t\tbin->dyn_info.dt_syment = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_REL:\n\t\t\tbin->dyn_info.dt_rel = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_RELSZ:\n\t\t\tbin->dyn_info.dt_relsz = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_RELENT:\n\t\t\tbin->dyn_info.dt_relent = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_PLTREL:\n\t\t\tbin->dyn_info.dt_pltrel = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_JMPREL:\n\t\t\tbin->dyn_info.dt_jmprel = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_MIPS_PLTGOT:\n\t\t\tbin->dyn_info.dt_mips_pltgot = d.d_un.d_ptr;\n\t\t\tbreak;\n\t\tcase DT_BIND_NOW:\n\t\t\tbin->dyn_info.dt_bind_now = true;\n\t\t\tbreak;\n\t\tcase DT_FLAGS:\n\t\t\tbin->dyn_info.dt_flags = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_FLAGS_1:\n\t\t\tbin->dyn_info.dt_flags_1 = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_RPATH:\n\t\t\tbin->dyn_info.dt_rpath = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_RUNPATH:\n\t\t\tbin->dyn_info.dt_runpath = d.d_un.d_val;\n\t\t\tbreak;\n\t\tcase DT_NEEDED:\n\t\t\tr_vector_push (&bin->dyn_info.dt_needed, &d.d_un.d_val);\n\t\t\tbreak;\n\t\tcase DT_INIT:\n\t\tcase DT_FINI:\n\t\tcase DT_DEBUG:\n\t\tcase DT_INIT_ARRAY:\n\t\tcase DT_FINI_ARRAY:\n\t\tcase DT_INIT_ARRAYSZ:\n\t\tcase DT_FINI_ARRAYSZ:\n\t\tcase DT_PREINIT_ARRAY:\n\t\tcase DT_PREINIT_ARRAYSZ:\n\t\tcase DT_SONAME:\n\t\tcase DT_GNU_HASH:\n\t\t\t// common dynamic entries in ELF, but we don't need to\n\t\t\t// do anything with them.\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif ((d.d_tag >= DT_VERSYM) && (d.d_tag <= DT_VERNEEDNUM)) {\n\t\t\t\tbin->version_info[DT_VERSIONTAGIDX (d.d_tag)] = d.d_un.d_val;\n\t\t\t} else {\n\t\t\t\tR_LOG_DEBUG (\"Dynamic tag %\" PFMT64d \" not handled\", (ut64) d.d_tag);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tif (d.d_tag == DT_NULL) {\n\t\t\tbreak;\n\t\t}\n\t}\n}\n\nstatic int init_dynamic_section(ELFOBJ *bin) {\n\tut64 strtabaddr = 0;\n\tchar *strtab = NULL;\n\tsize_t strsize = 0;\n\tint r;\n\tut64 dyn_size = 0, loaded_offset;\n\tset_default_value_dynamic_info(bin);\n\n\tr_return_val_if_fail (bin, false);\n\tif (!bin->phdr || !bin->ehdr.e_phnum) {\n\t\treturn false;\n\t}\n\n\tElf_(Phdr) *dyn_phdr = get_dynamic_segment (bin);\n\tif (!dyn_phdr) {\n\t\treturn false;\n\t}\n\n\tdyn_size = dyn_phdr->p_filesz;\n\tloaded_offset = Elf_(r_bin_elf_v2p_new) (bin, dyn_phdr->p_vaddr);\n\tif (loaded_offset == UT64_MAX) {\n\t\treturn false;\n\t}\n\n\tif (!dyn_size || loaded_offset + dyn_size > bin->size) {\n\t\treturn false;\n\t}\n\n\tfill_dynamic_entries (bin, loaded_offset, dyn_size);\n\n\tif (bin->dyn_info.dt_strtab != R_BIN_ELF_ADDR_MAX) {\n\t\tstrtabaddr = Elf_(r_bin_elf_v2p_new) (bin, bin->dyn_info.dt_strtab);\n\t}\n\n\tif (bin->dyn_info.dt_strsz > 0) {\n\t\tstrsize = bin->dyn_info.dt_strsz;\n\t}\n\n\tif (strtabaddr == UT64_MAX || strtabaddr > bin->size || strsize > ST32_MAX || !strsize || strsize > bin->size || strtabaddr + strsize > bin->size) {\n\t\tif (!strtabaddr) {\n\t\t\tR_LOG_DEBUG (\"DT_STRTAB not found or invalid\");\n\t\t}\n\t\treturn false;\n\t}\n\tstrtab = (char *)calloc (1, strsize + 1);\n\tif (!strtab) {\n\t\treturn false;\n\t}\n\tr = r_buf_read_at (bin->b, strtabaddr, (ut8 *)strtab, strsize);\n\tif (r < 1) {\n\t\tfree (strtab);\n\t\treturn false;\n\t}\n\n\tbin->strtab = strtab;\n\tbin->strtab_size = strsize;\n\tinit_dynamic_section_sdb (bin, strtabaddr, strsize);\n\treturn true;\n}\n\nstatic RBinElfSection* get_section_by_name(ELFOBJ *bin, const char *section_name) {\n\tif (bin->g_sections) {\n\t\tsize_t i;\n\t\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\t\tif (!strncmp (bin->g_sections[i].name, section_name, ELF_STRING_LENGTH - 1)) {\n\t\t\t\treturn &bin->g_sections[i];\n\t\t\t}\n\t\t}\n\t}\n\treturn NULL;\n}\n\nstatic char *get_ver_flags(ut32 flags) {\n\tif (!flags) {\n\t\treturn \"none\";\n\t}\n\tstatic char buff[32];\n\tbuff[0] = 0;\n\tif (flags & VER_FLG_BASE) {\n\t\tstrcpy (buff, \"BASE \");\n\t}\n\tif (flags & VER_FLG_WEAK) {\n\t\tif (flags & VER_FLG_BASE) {\n\t\t\tstrcat (buff, \"| \");\n\t\t}\n\t\tstrcat (buff, \"WEAK \");\n\t}\n\tif (flags & ~(VER_FLG_BASE | VER_FLG_WEAK)) {\n\t\tstrcat (buff, \"| \");\n\t}\n\treturn buff;\n}\n\nstatic Sdb *store_versioninfo_gnu_versym(ELFOBJ *bin, Elf_(Shdr) *shdr, int sz) {\n\tsize_t i;\n\tconst ut64 num_entries = sz / sizeof (Elf_(Versym));\n\tconst char *section_name = \"\";\n\tconst char *link_section_name = \"\";\n\tSdb *sdb = sdb_new0 ();\n\tif (!sdb) {\n\t\treturn NULL;\n\t}\n\tif (!bin->version_info[DT_VERSIONTAGIDX (DT_VERSYM)]) {\n\t\tsdb_free (sdb);\n\t\treturn NULL;\n\t}\n\tif (shdr->sh_link >= bin->ehdr.e_shnum) {\n\t\tsdb_free (sdb);\n\t\treturn NULL;\n\t}\n\tElf_(Shdr) *link_shdr = &bin->shdr[shdr->sh_link];\n\tut8 *edata = (ut8*) calloc (R_MAX (1, num_entries), 2 * sizeof (ut8));\n\tif (!edata) {\n\t\tsdb_free (sdb);\n\t\treturn NULL;\n\t}\n\tut16 *data = (ut16 *)calloc (R_MAX (1, num_entries), sizeof (ut16));\n\tif (!data) {\n\t\tfree (edata);\n\t\tsdb_free (sdb);\n\t\treturn NULL;\n\t}\n\tut64 off = Elf_(r_bin_elf_v2p) (bin, bin->version_info[DT_VERSIONTAGIDX (DT_VERSYM)]);\n\tif (bin->shstrtab && shdr->sh_name < bin->shstrtab_size) {\n\t\tsection_name = &bin->shstrtab[shdr->sh_name];\n\t}\n\tif (bin->shstrtab && link_shdr->sh_name < bin->shstrtab_size) {\n\t\tlink_section_name = &bin->shstrtab[link_shdr->sh_name];\n\t}\n\tr_buf_read_at (bin->b, off, edata, sizeof (ut16) * num_entries);\n\tsdb_set (sdb, \"section_name\", section_name, 0);\n\tsdb_num_set (sdb, \"num_entries\", num_entries, 0);\n\tsdb_num_set (sdb, \"addr\", shdr->sh_addr, 0);\n\tsdb_num_set (sdb, \"offset\", shdr->sh_offset, 0);\n\tsdb_num_set (sdb, \"link\", shdr->sh_link, 0);\n\tsdb_set (sdb, \"link_section_name\", link_section_name, 0);\n\tfor (i = num_entries; i--;) {\n\t\tdata[i] = r_read_ble16 (&edata[i * sizeof (ut16)], bin->endian);\n\t}\n\tR_FREE (edata);\n\tchar *tmp_val = NULL;\n\tfor (i = 0; i < num_entries; i += 4) {\n\t\tsize_t j;\n\t\tint check_def;\n\t\tchar key[32] = {0};\n\n\t\tfor (j = 0; (j < 4) && (i + j) < num_entries; j++) {\n\t\t\tint k;\n\t\t\tsnprintf (key, sizeof (key), \"entry%d\", (int)(i + j));\n\t\t\tswitch (data[i + j]) {\n\t\t\tcase 0:\n\t\t\t\tsdb_set (sdb, key, \"0 (*local*)\", 0);\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tsdb_set (sdb, key, \"1 (*global*)\", 0);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tfree (tmp_val);\n\t\t\t\ttmp_val = r_str_newf (\"%x \", data[i+j] & 0x7FFF);\n\t\t\t\tcheck_def = true;\n\t\t\t\tif (bin->version_info[DT_VERSIONTAGIDX (DT_VERNEED)]) {\n\t\t\t\t\tElf_(Verneed) vn;\n\t\t\t\t\tut8 svn[sizeof (Elf_(Verneed))] = {0};\n\t\t\t\t\tut64 offset = Elf_(r_bin_elf_v2p) (bin, bin->version_info[DT_VERSIONTAGIDX (DT_VERNEED)]);\n\t\t\t\t\tdo {\n\t\t\t\t\t\tElf_(Vernaux) vna;\n\t\t\t\t\t\tut8 svna[sizeof (Elf_(Vernaux))] = {0};\n\t\t\t\t\t\tut64 a_off;\n\t\t\t\t\t\tif (offset > bin->size || offset + sizeof (vn) > bin->size) {\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (r_buf_read_at (bin->b, offset, svn, sizeof (svn)) < 0) {\n\t\t\t\t\t\t\tR_LOG_DEBUG (\"Cannot read Verneed for Versym\");\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tk = 0;\n\t\t\t\t\t\tvn.vn_version = READ16 (svn, k);\n\t\t\t\t\t\tvn.vn_cnt = READ16 (svn, k);\n\t\t\t\t\t\tvn.vn_file = READ32 (svn, k);\n\t\t\t\t\t\tvn.vn_aux = READ32 (svn, k);\n\t\t\t\t\t\tvn.vn_next = READ32 (svn, k);\n\t\t\t\t\t\ta_off = offset + vn.vn_aux;\n\t\t\t\t\t\tdo {\n\t\t\t\t\t\t\tif (a_off > bin->size || a_off + sizeof (vna) > bin->size) {\n\t\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (r_buf_read_at (bin->b, a_off, svna, sizeof (svna)) < 0) {\n\t\t\t\t\t\t\t\tR_LOG_DEBUG (\"Cannot read Vernaux for Versym\");\n\t\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tk = 0;\n\t\t\t\t\t\t\tvna.vna_hash = READ32 (svna, k);\n\t\t\t\t\t\t\tvna.vna_flags = READ16 (svna, k);\n\t\t\t\t\t\t\tvna.vna_other = READ16 (svna, k);\n\t\t\t\t\t\t\tvna.vna_name = READ32 (svna, k);\n\t\t\t\t\t\t\tvna.vna_next = READ32 (svna, k);\n\t\t\t\t\t\t\ta_off += vna.vna_next;\n\t\t\t\t\t\t} while (vna.vna_other != data[i + j] && vna.vna_next != 0);\n\n\t\t\t\t\t\tif (vna.vna_other == data[i + j]) {\n\t\t\t\t\t\t\tif (vna.vna_name > bin->strtab_size) {\n\t\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tchar *val = r_str_newf (\"%s(%s)\", tmp_val, bin->strtab + vna.vna_name);\n\t\t\t\t\t\t\tsdb_set (sdb, key, val, 0);\n\t\t\t\t\t\t\tfree (val);\n\t\t\t\t\t\t\tcheck_def = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\toffset += vn.vn_next;\n\t\t\t\t\t} while (vn.vn_next);\n\t\t\t\t}\n\n\t\t\t\tut64 vinfoaddr = bin->version_info[DT_VERSIONTAGIDX (DT_VERDEF)];\n\t\t\t\tif (check_def && data[i + j] != 0x8001 && vinfoaddr) {\n\t\t\t\t\tElf_(Verdef) vd;\n\t\t\t\t\tut8 svd[sizeof (Elf_(Verdef))] = {0};\n\t\t\t\t\tut64 offset = Elf_(r_bin_elf_v2p) (bin, vinfoaddr);\n\t\t\t\t\tif (offset > bin->size || offset + sizeof (vd) > bin->size) {\n\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t}\n\t\t\t\t\tdo {\n\t\t\t\t\t\tif (r_buf_read_at (bin->b, offset, svd, sizeof (svd)) < 0) {\n\t\t\t\t\t\t\tR_LOG_DEBUG (\"Cannot read Verdef for Versym\");\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tk = 0;\n\t\t\t\t\t\tvd.vd_version = READ16 (svd, k);\n\t\t\t\t\t\tvd.vd_flags = READ16 (svd, k);\n\t\t\t\t\t\tvd.vd_ndx = READ16 (svd, k);\n\t\t\t\t\t\tvd.vd_cnt = READ16 (svd, k);\n\t\t\t\t\t\tvd.vd_hash = READ32 (svd, k);\n\t\t\t\t\t\tvd.vd_aux = READ32 (svd, k);\n\t\t\t\t\t\tvd.vd_next = READ32 (svd, k);\n\t\t\t\t\t\toffset += vd.vd_next;\n\t\t\t\t\t} while (vd.vd_ndx != (data[i + j] & 0x7FFF) && vd.vd_next != 0);\n\n\t\t\t\t\tif (vd.vd_ndx == (data[i + j] & 0x7FFF)) {\n\t\t\t\t\t\tElf_(Verdaux) vda;\n\t\t\t\t\t\tut8 svda[sizeof (Elf_(Verdaux))] = {0};\n\t\t\t\t\t\tut64 off_vda = offset - vd.vd_next + vd.vd_aux;\n\t\t\t\t\t\tif (off_vda > bin->size || off_vda + sizeof (vda) > bin->size) {\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (r_buf_read_at (bin->b, off_vda, svda, sizeof (svda)) < 0) {\n\t\t\t\t\t\t\tR_LOG_DEBUG (\"Cannot read Verdaux for Versym\");\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tk = 0;\n\t\t\t\t\t\tvda.vda_name = READ32 (svda, k);\n\t\t\t\t\t\tvda.vda_next = READ32 (svda, k);\n\t\t\t\t\t\tif (vda.vda_name > bin->strtab_size) {\n\t\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tconst char *name = bin->strtab + vda.vda_name;\n\t\t\t\t\t\tif (name) {\n\t\t\t\t\t\t\tchar *fname = r_str_newf (\"%s(%s%-*s)\", tmp_val, name, (int)(12 - strlen (name)),\")\");\n\t\t\t\t\t\t\tsdb_set (sdb, key, fname, 0);\n\t\t\t\t\t\t\tfree (fname);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tR_FREE (tmp_val);\n\t}\nbeach:\n\tR_FREE (tmp_val);\n\tfree (data);\n\treturn sdb;\n}\n\nstatic Sdb *store_versioninfo_gnu_verdef(ELFOBJ *bin, Elf_(Shdr) *shdr, int sz) {\n\tconst char *section_name = \"\";\n\tconst char *link_section_name = \"\";\n\tchar *end = NULL;\n\tut8 dfs[sizeof (Elf_(Verdef))] = {0};\n\tut32 cnt;\n\tsize_t i;\n\tif (shdr->sh_link >= bin->ehdr.e_shnum) {\n\t\treturn false;\n\t}\n\tElf_(Shdr) *link_shdr = &bin->shdr[shdr->sh_link];\n#ifdef R_BIN_ELF64\n\tif ((int)shdr->sh_size < 1 || shdr->sh_size > SIZE_MAX) {\n#else\n\tif ((int)shdr->sh_size < 1) {\n#endif\n\t\treturn false;\n\t}\n\tif (shdr->sh_size < sizeof (Elf_(Verdef)) || shdr->sh_size < sizeof (Elf_(Verdaux))) {\n\t\treturn false;\n\t}\n\tElf_(Verdef) *defs = calloc (shdr->sh_size, 1);\n\tif (!defs) {\n\t\tR_LOG_DEBUG (\"Cannot allocate memory (Check Elf_(Verdef))\");\n\t\treturn false;\n\t}\n\tif (bin->shstrtab && shdr->sh_name < bin->shstrtab_size) {\n\t\tsection_name = &bin->shstrtab[shdr->sh_name];\n\t}\n\tif (link_shdr && bin->shstrtab && link_shdr->sh_name < bin->shstrtab_size) {\n\t\tlink_section_name = &bin->shstrtab[link_shdr->sh_name];\n\t}\n\tSdb *sdb = sdb_new0 ();\n\tif (!sdb) {\n\t\tfree (defs);\n\t\treturn false;\n\t}\n\tsize_t shsize = shdr->sh_size;\n\tif (shdr->sh_size > bin->size) {\n\t\tif (bin->verbose) {\n\t\t\teprintf (\"Truncating shsize from %d to %d\\n\", (int)shdr->sh_size, (int)bin->size);\n\t\t}\n\t\tif (bin->size > shdr->sh_offset) {\n\t\t\tshsize = bin->size - shdr->sh_offset;\n\t\t} else {\n\t\t\tshsize = bin->size;\n\t\t}\n\t}\n\tend = (char *)defs + shsize; //& shdr->sh_size;\n\tsdb_set (sdb, \"section_name\", section_name, 0);\n\tsdb_num_set (sdb, \"entries\", shdr->sh_info, 0);\n\tsdb_num_set (sdb, \"addr\", shdr->sh_addr, 0);\n\tsdb_num_set (sdb, \"offset\", shdr->sh_offset, 0);\n\tsdb_num_set (sdb, \"link\", shdr->sh_link, 0);\n\tsdb_set (sdb, \"link_section_name\", link_section_name, 0);\n\n\tfor (cnt = 0, i = 0; cnt < shdr->sh_info && i < shdr->sh_size; cnt++) {\n\t\tSdb *sdb_verdef = sdb_new0 ();\n\t\tchar *vstart = ((char*)defs) + i;\n\t\tsize_t vstart_off = i;\n\t\tchar key[32] = {0};\n\t\tElf_(Verdef) *verdef = (Elf_(Verdef)*)vstart;\n\t\tElf_(Verdaux) aux = {0};\n\t\tint j = 0;\n\t\tint isum = 0;\n\n\t\tif (vstart + sizeof (*verdef) > end) {\n\t\t\tbreak;\n\t\t}\n\t\tr_buf_read_at (bin->b, shdr->sh_offset + i, dfs, sizeof (Elf_(Verdef)));\n\t\tverdef->vd_version = READ16 (dfs, j);\n\t\tverdef->vd_flags = READ16 (dfs, j);\n\t\tverdef->vd_ndx = READ16 (dfs, j);\n\t\tverdef->vd_cnt = READ16 (dfs, j);\n\t\tverdef->vd_hash = READ32 (dfs, j);\n\t\tverdef->vd_aux = READ32 (dfs, j);\n\t\tverdef->vd_next = READ32 (dfs, j);\n\t\tint vdaux = verdef->vd_aux;\n\t\tif (vdaux < 1 || shdr->sh_size - vstart_off < vdaux) {\n\t\t\tsdb_free (sdb_verdef);\n\t\t\tgoto out_error;\n\t\t}\n\t\tvstart += vdaux;\n\t\tvstart_off += vdaux;\n\t\tif (vstart > end || shdr->sh_size - sizeof (Elf_(Verdaux)) < vstart_off) {\n\t\t\tsdb_free (sdb_verdef);\n\t\t\tgoto out_error;\n\t\t}\n\n\t\tj = 0;\n\t\taux.vda_name = READ32 (vstart, j);\n\t\taux.vda_next = READ32 (vstart, j);\n\n\t\tisum = i + verdef->vd_aux;\n\t\tif (aux.vda_name > bin->dynstr_size) {\n\t\t\tsdb_free (sdb_verdef);\n\t\t\tgoto out_error;\n\t\t}\n\n\t\tsdb_num_set (sdb_verdef, \"idx\", i, 0);\n\t\tsdb_num_set (sdb_verdef, \"vd_version\", verdef->vd_version, 0);\n\t\tsdb_num_set (sdb_verdef, \"vd_ndx\", verdef->vd_ndx, 0);\n\t\tsdb_num_set (sdb_verdef, \"vd_cnt\", verdef->vd_cnt, 0);\n\t\tsdb_set (sdb_verdef, \"vda_name\", &bin->dynstr[aux.vda_name], 0);\n\t\tsdb_set (sdb_verdef, \"flags\", get_ver_flags (verdef->vd_flags), 0);\n\n\t\tfor (j = 1; j < verdef->vd_cnt; j++) {\n\t\t\tint k;\n\t\t\tSdb *sdb_parent = sdb_new0 ();\n\t\t\tif (shdr->sh_size - vstart_off < aux.vda_next) {\n\t\t\t\tsdb_free (sdb_verdef);\n\t\t\t\tsdb_free (sdb_parent);\n\t\t\t\tgoto out_error;\n\t\t\t}\n\t\t\tisum += aux.vda_next;\n\t\t\tvstart += aux.vda_next;\n\t\t\tvstart_off += aux.vda_next;\n\t\t\tif (vstart > end || shdr->sh_size - sizeof (Elf_(Verdaux)) < vstart_off) {\n\t\t\t\tsdb_free (sdb_verdef);\n\t\t\t\tsdb_free (sdb_parent);\n\t\t\t\tgoto out_error;\n\t\t\t}\n\t\t\tk = 0;\n\t\t\taux.vda_name = READ32 (vstart, k);\n\t\t\taux.vda_next = READ32 (vstart, k);\n\t\t\tif (aux.vda_name > bin->dynstr_size) {\n\t\t\t\tsdb_free (sdb_verdef);\n\t\t\t\tsdb_free (sdb_parent);\n\t\t\t\tgoto out_error;\n\t\t\t}\n\t\t\tsdb_num_set (sdb_parent, \"idx\", isum, 0);\n\t\t\tsdb_num_set (sdb_parent, \"parent\", j, 0);\n\t\t\tsdb_set (sdb_parent, \"vda_name\", &bin->dynstr[aux.vda_name], 0);\n\t\t\tsnprintf (key, sizeof (key), \"parent%d\", j - 1);\n\t\t\tsdb_ns_set (sdb_verdef, key, sdb_parent);\n\t\t}\n\n\t\tsnprintf (key, sizeof (key), \"verdef%u\", cnt);\n\t\tsdb_ns_set (sdb, key, sdb_verdef);\n\t\tif (!verdef->vd_next || shdr->sh_size - i < verdef->vd_next) {\n\t\t\tsdb_free (sdb_verdef);\n\t\t\tgoto out_error;\n\t\t}\n\t\tif ((st32)verdef->vd_next < 1) {\n\t\t\tR_LOG_DEBUG (\"Invalid vd_next in the ELF version\");\n\t\t\tbreak;\n\t\t}\n\t\ti += verdef->vd_next;\n\t}\n\tfree (defs);\n\treturn sdb;\nout_error:\n\tfree (defs);\n\tsdb_free (sdb);\n\treturn NULL;\n}\n\nstatic Sdb *store_versioninfo_gnu_verneed(ELFOBJ *bin, Elf_(Shdr) *shdr, int sz) {\n\tut8 *end, *need = NULL;\n\tconst char *section_name = \"\";\n\tElf_(Shdr) *link_shdr = NULL;\n\tconst char *link_section_name = \"\";\n\tSdb *sdb_vernaux = NULL;\n\tSdb *sdb_version = NULL;\n\tSdb *sdb = NULL;\n\tut64 i;\n\tint cnt;\n\n\tif (!bin || !bin->dynstr) {\n\t\treturn NULL;\n\t}\n\tif (shdr->sh_link >= bin->ehdr.e_shnum) {\n\t\treturn NULL;\n\t}\n#ifdef R_BIN_ELF64\n\tif ((int)shdr->sh_size < 1 || shdr->sh_size > SIZE_MAX) {\n#else\n\tif ((int)shdr->sh_size < 1) {\n#endif\n\t\treturn NULL;\n\t}\n\tsdb = sdb_new0 ();\n\tif (!sdb) {\n\t\treturn NULL;\n\t}\n\tlink_shdr = &bin->shdr[shdr->sh_link];\n\tif (bin->shstrtab && shdr->sh_name < bin->shstrtab_size) {\n\t\tsection_name = &bin->shstrtab[shdr->sh_name];\n\t}\n\tif (bin->shstrtab && link_shdr->sh_name < bin->shstrtab_size) {\n\t\tlink_section_name = &bin->shstrtab[link_shdr->sh_name];\n\t}\n\tif (!(need = (ut8*) calloc (R_MAX (1, shdr->sh_size), sizeof (ut8)))) {\n\t\tR_LOG_ERROR (\"Cannot allocate memory for Elf_(Verneed)\");\n\t\tgoto beach;\n\t}\n\tend = need + shdr->sh_size;\n\tsdb_set (sdb, \"section_name\", section_name, 0);\n\tsdb_num_set (sdb, \"num_entries\", shdr->sh_info, 0);\n\tsdb_num_set (sdb, \"addr\", shdr->sh_addr, 0);\n\tsdb_num_set (sdb, \"offset\", shdr->sh_offset, 0);\n\tsdb_num_set (sdb, \"link\", shdr->sh_link, 0);\n\tsdb_set (sdb, \"link_section_name\", link_section_name, 0);\n\n\tif (shdr->sh_offset > bin->size || shdr->sh_offset + shdr->sh_size > bin->size) {\n\t\tgoto beach;\n\t}\n\tif (shdr->sh_offset + shdr->sh_size < shdr->sh_size) {\n\t\tgoto beach;\n\t}\n\ti = r_buf_read_at (bin->b, shdr->sh_offset, need, shdr->sh_size);\n\tif (i < 1) {\n\t\tgoto beach;\n\t}\n\t//XXX we should use DT_VERNEEDNUM instead of sh_info\n\t//TODO https://sourceware.org/ml/binutils/2014-11/msg00353.html\n\tfor (i = 0, cnt = 0; cnt < shdr->sh_info; cnt++) {\n\t\tint j, isum;\n\t\tut8 *vstart = need + i;\n\t\tElf_(Verneed) vvn = {0};\n\t\tif (vstart + sizeof (Elf_(Verneed)) > end) {\n\t\t\tgoto beach;\n\t\t}\n\t\tElf_(Verneed) *entry = &vvn;\n\t\tchar key[32] = {0};\n\t\tsdb_version = sdb_new0 ();\n\t\tif (!sdb_version) {\n\t\t\tgoto beach;\n\t\t}\n\t\tj = 0;\n\t\tvvn.vn_version = READ16 (vstart, j);\n\t\tvvn.vn_cnt = READ16 (vstart, j);\n\t\tvvn.vn_file = READ32 (vstart, j);\n\t\tvvn.vn_aux = READ32 (vstart, j);\n\t\tvvn.vn_next = READ32 (vstart, j);\n\n\t\tsdb_num_set (sdb_version, \"vn_version\", entry->vn_version, 0);\n\t\tsdb_num_set (sdb_version, \"idx\", i, 0);\n\t\tif (entry->vn_file > bin->dynstr_size) {\n\t\t\tgoto beach;\n\t\t}\n\t\t{\n\t\t\tchar *s = r_str_ndup (&bin->dynstr[entry->vn_file], 16);\n\t\t\tsdb_set (sdb_version, \"file_name\", s, 0);\n\t\t\tfree (s);\n\t\t}\n\t\tsdb_num_set (sdb_version, \"cnt\", entry->vn_cnt, 0);\n\t\tst32 vnaux = entry->vn_aux;\n\t\tif (vnaux < 1) {\n\t\t\tgoto beach;\n\t\t}\n\t\tvstart += vnaux;\n\t\tut32 vn_cnt = entry->vn_cnt;\n\t\tfor (j = 0, isum = i + entry->vn_aux; j < vn_cnt && vstart + sizeof (Elf_(Vernaux)) <= end; j++) {\n\t\t\tint k;\n\t\t\tElf_(Vernaux) *aux = NULL;\n\t\t\tElf_(Vernaux) vaux = {0};\n\t\t\taux = (Elf_(Vernaux)*)&vaux;\n\t\t\tk = 0;\n\t\t\tvaux.vna_hash = READ32 (vstart, k);\n\t\t\tvaux.vna_flags = READ16 (vstart, k);\n\t\t\tvaux.vna_other = READ16 (vstart, k);\n\t\t\tvaux.vna_name = READ32 (vstart, k);\n\t\t\tvaux.vna_next = READ32 (vstart, k);\n\t\t\tif (aux->vna_name > bin->dynstr_size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n#if 1\n\t\t\tsdb_vernaux = sdb_new0 ();\n\t\t\tif (!sdb_vernaux) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tsdb_num_set (sdb_vernaux, \"idx\", isum, 0);\n\t\t\tif (aux->vna_name > 0 && aux->vna_name + 8 < bin->dynstr_size) {\n\t\t\t\tchar name [16];\n\t\t\t\tstrncpy (name, &bin->dynstr[aux->vna_name], sizeof (name)-1);\n\t\t\t\tname[sizeof (name)-1] = 0;\n\t\t\t\tsdb_set (sdb_vernaux, \"name\", name, 0);\n\t\t\t}\n\t\t\tsdb_set (sdb_vernaux, \"flags\", get_ver_flags (aux->vna_flags), 0);\n\t\t\tsdb_num_set (sdb_vernaux, \"version\", aux->vna_other, 0);\n\t\t\tisum += aux->vna_next;\n\t\t\tvstart += aux->vna_next;\n\t\t\tsnprintf (key, sizeof (key), \"vernaux%d\", j);\n\t\t\tsdb_ns_set (sdb_version, key, sdb_vernaux);\n#else\n\t\t\tchar *key = r_str_newf (\"vernaux%d\", j);\n\t\t\tchar *val = r_str_newf (\"%d,%s\", isum, get_ver_flags (aux->vna_flags));\n\t\t\tsdb_set (sdb_version, key, val, 0);\n\t\t\tfree (key);\n\t\t\tfree (val);\n#endif\n\t\t}\n\t\tif ((int)entry->vn_next < 0) {\n\t\t\tR_LOG_DEBUG (\"Invalid vn_next at 0x%08\" PFMT64x, (ut64)shdr->sh_offset);\n\t\t\tbreak;\n\t\t}\n\t\ti += entry->vn_next;\n\t\tsnprintf (key, sizeof (key), \"version%d\", cnt );\n\t\tsdb_ns_set (sdb, key, sdb_version);\n\t\t//if entry->vn_next is 0 it iterate infinitely\n\t\tif (!entry->vn_next) {\n\t\t\tbreak;\n\t\t}\n\t}\n\tfree (need);\n\treturn sdb;\nbeach:\n\tfree (need);\n\tsdb_free (sdb_vernaux);\n\tsdb_free (sdb_version);\n\tsdb_free (sdb);\n\treturn NULL;\n}\n\nstatic Sdb *store_versioninfo(ELFOBJ *bin) {\n\tSdb *sdb_versioninfo = NULL;\n\tint num_verdef = 0;\n\tint num_verneed = 0;\n\tint num_versym = 0;\n\tsize_t i;\n\n\tif (!bin || !bin->shdr) {\n\t\treturn NULL;\n\t}\n\tif (!(sdb_versioninfo = sdb_new0 ())) {\n\t\treturn NULL;\n\t}\n\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tSdb *sdb = NULL;\n\t\tchar key[32] = {0};\n\t\tint size = bin->shdr[i].sh_size;\n\n\t\tif (size - (i * sizeof (Elf_(Shdr)) > bin->size)) {\n\t\t\tsize = bin->size - (i*sizeof (Elf_(Shdr)));\n\t\t}\n\t\tint left = size - (i * sizeof (Elf_(Shdr)));\n\t\tleft = R_MIN (left, bin->shdr[i].sh_size);\n\t\tif (left < 0) {\n\t\t\tbreak;\n\t\t}\n\t\tswitch (bin->shdr[i].sh_type) {\n\t\tcase SHT_GNU_verdef:\n\t\t\tsdb = store_versioninfo_gnu_verdef (bin, &bin->shdr[i], left);\n\t\t\tsnprintf (key, sizeof (key), \"verdef%d\", num_verdef++);\n\t\t\tsdb_ns_set (sdb_versioninfo, key, sdb);\n\t\t\tbreak;\n\t\tcase SHT_GNU_verneed:\n\t\t\tsdb = store_versioninfo_gnu_verneed (bin, &bin->shdr[i], left);\n\t\t\tsnprintf (key, sizeof (key), \"verneed%d\", num_verneed++);\n\t\t\tsdb_ns_set (sdb_versioninfo, key, sdb);\n\t\t\tbreak;\n\t\tcase SHT_GNU_versym:\n\t\t\tsdb = store_versioninfo_gnu_versym (bin, &bin->shdr[i], left);\n\t\t\tsnprintf (key, sizeof (key), \"versym%d\", num_versym++);\n\t\t\tsdb_ns_set (sdb_versioninfo, key, sdb);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn sdb_versioninfo;\n}\n\nstatic bool init_dynstr(ELFOBJ *bin) {\n\tint i, r;\n\tconst char *section_name = NULL;\n\tif (!bin || !bin->shdr) {\n\t\treturn false;\n\t}\n\tif (!bin->shstrtab) {\n\t\treturn false;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tif (bin->shdr[i].sh_name > bin->shstrtab_size) {\n\t\t\treturn false;\n\t\t}\n\t\tsection_name = &bin->shstrtab[bin->shdr[i].sh_name];\n\t\tif (bin->shdr[i].sh_type == SHT_STRTAB && !strcmp (section_name, \".dynstr\")) {\n\t\t\tif (!(bin->dynstr = (char*) calloc (bin->shdr[i].sh_size + 1, sizeof (char)))) {\n\t\t\t\tR_LOG_ERROR (\"Cannot allocate memory for dynamic strings\\n\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset > bin->size) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset + bin->shdr[i].sh_size > bin->size) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset + bin->shdr[i].sh_size < bin->shdr[i].sh_size) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tr = r_buf_read_at (bin->b, bin->shdr[i].sh_offset, (ut8*)bin->dynstr, bin->shdr[i].sh_size);\n\t\t\tif (r < 1) {\n\t\t\t\tR_FREE (bin->dynstr);\n\t\t\t\tbin->dynstr_size = 0;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbin->dynstr_size = bin->shdr[i].sh_size;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nstatic HtUP *rel_cache_new(RBinElfReloc *relocs, ut32 reloc_num) {\n\tif (!relocs || reloc_num == 0) {\n\t\treturn NULL;\n\t}\n\tconst int htsize = R_MIN (reloc_num, 1024);\n\tHtUP *rel_cache = ht_up_new_size (htsize, NULL, NULL, NULL);\n\tif (rel_cache) {\n\t\tsize_t i;\n\t\tfor (i = 0; i < reloc_num; i++) {\n\t\t\tRBinElfReloc *tmp = relocs + i;\n\t\t\tht_up_insert (rel_cache, tmp->sym, tmp);\n\t\t}\n\t}\n\treturn rel_cache;\n}\n\nstatic bool elf_init(ELFOBJ *bin) {\n\t/* bin is not an ELF */\n\tif (!init_ehdr (bin)) {\n\t\treturn false;\n\t}\n\tif (!init_phdr (bin) && !is_bin_etrel (bin)) {\n\t\tR_LOG_DEBUG (\"Cannot initialize program headers\");\n\t}\n\tif (bin->ehdr.e_type != ET_CORE) {\n\t\tif (!init_shdr (bin)) {\n\t\t\tR_LOG_DEBUG (\"Cannot initialize section headers\");\n\t\t}\n\t\tif (!init_strtab (bin)) {\n\t\t\tR_LOG_DEBUG (\"Cannot initialize strings table\");\n\t\t}\n\t\tif (!init_dynstr (bin) && !is_bin_etrel (bin)) {\n\t\t\tR_LOG_DEBUG (\"Cannot initialize dynamic strings\");\n\t\t}\n\t\tbin->baddr = Elf_(r_bin_elf_get_baddr) (bin);\n\t\tif (!init_dynamic_section (bin) && !Elf_(r_bin_elf_is_static) (bin) && !is_bin_etrel (bin)) {\n\t\t\tR_LOG_DEBUG (\"Cannot initialize dynamic section\");\n\t\t}\n\t}\n\tbin->imports_by_ord_size = 0;\n\tbin->imports_by_ord = NULL;\n\tbin->symbols_by_ord_size = 0;\n\tbin->symbols_by_ord = NULL;\n\tbin->g_sections = Elf_(r_bin_elf_get_sections) (bin);\n\tbin->boffset = Elf_(r_bin_elf_get_boffset) (bin);\n\tbin->g_relocs = Elf_(r_bin_elf_get_relocs) (bin);\n\tbin->rel_cache = rel_cache_new (bin->g_relocs, bin->g_reloc_num);\n\tsdb_ns_set (bin->kv, \"versioninfo\", store_versioninfo (bin));\n\treturn true;\n}\n\nut64 Elf_(r_bin_elf_get_section_offset)(ELFOBJ *bin, const char *section_name) {\n\tRBinElfSection *section = get_section_by_name (bin, section_name);\n\treturn section? section->offset: UT64_MAX;\n}\n\nut64 Elf_(r_bin_elf_get_section_addr)(ELFOBJ *bin, const char *section_name) {\n\tRBinElfSection *section = get_section_by_name (bin, section_name);\n\treturn section? section->rva: UT64_MAX;\n}\n\nut64 Elf_(r_bin_elf_get_section_addr_end)(ELFOBJ *bin, const char *section_name) {\n\tRBinElfSection *section = get_section_by_name (bin, section_name);\n\treturn section? section->rva + section->size: UT64_MAX;\n}\n\nstatic ut64 get_got_entry(ELFOBJ *bin, RBinElfReloc *rel) {\n\tif (!rel->rva) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 p_sym_got_addr = Elf_(r_bin_elf_v2p_new) (bin, rel->rva);\n\tut64 addr = R_BIN_ELF_BREADWORD (bin->b, p_sym_got_addr);\n\n\treturn (!addr || addr == R_BIN_ELF_WORD_MAX) ? UT64_MAX : addr;\n}\n\nstatic bool is_thumb_symbol(ut64 plt_addr) {\n\treturn plt_addr & 1;\n}\n\nstatic ut64 get_import_addr_arm(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\tif (got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 plt_addr = get_got_entry (bin, rel);\n\tif (plt_addr == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 pos = COMPUTE_PLTGOT_POSITION (rel, got_addr, 0x3);\n\n\tswitch (rel->type) {\n\tcase R_ARM_JUMP_SLOT:\n\t\tplt_addr += pos * 12 + 20;\n\t\tif (is_thumb_symbol (plt_addr)) {\n\t\t\tplt_addr--;\n\t\t}\n\t\treturn plt_addr;\n\tcase R_AARCH64_RELATIVE:\n\t\tR_LOG_WARN (\"Unsupported relocation type for imports %d\", rel->type);\n\t\treturn UT64_MAX;\n\tcase R_AARCH64_IRELATIVE:\n\t\tif (rel->addend > plt_addr) { // start\n\t\t\treturn (plt_addr + pos * 16 + 32) + rel->addend;\n\t\t}\n\t\t// same as fallback to JUMP_SLOT\n\t\treturn plt_addr + pos * 16 + 32;\n\tcase R_AARCH64_JUMP_SLOT:\n\t\treturn plt_addr + pos * 16 + 32;\n\tdefault:\n\t\tR_LOG_WARN (\"Unsupported relocation type for imports %d\", rel->type);\n\t\treturn UT64_MAX;\n\t}\n\treturn UT64_MAX;\n}\n\nstatic ut64 get_import_addr_mips(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 jmprel_addr = bin->dyn_info.dt_jmprel;\n\tut64 got_addr = bin->dyn_info.dt_mips_pltgot;\n\n\tif (jmprel_addr == R_BIN_ELF_ADDR_MAX || got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 pos = COMPUTE_PLTGOT_POSITION(rel, got_addr, 0x2);\n\n\tut8 buf[1024];\n\tut64 plt_addr = jmprel_addr + bin->dyn_info.dt_pltrelsz;\n\tut64 p_plt_addr = Elf_(r_bin_elf_v2p_new) (bin, plt_addr);\n\tint res = r_buf_read_at (bin->b, p_plt_addr, buf, sizeof (buf));\n\tif (res != sizeof (buf)) {\n\t\treturn UT64_MAX;\n\t}\n\n\tconst ut8 *base = r_mem_mem_aligned (buf, sizeof (buf), (const ut8 *)\"\\x3c\\x0f\\x00\", 3, 4);\n\tplt_addr += base? (int)(size_t) (base - buf): MIPS_PLT_OFFSET + 8; // HARDCODED HACK\n\tplt_addr += pos * 16;\n\n\treturn plt_addr;\n}\n\nstatic size_t get_size_rel_mode(Elf_(Xword) mode) {\n\treturn mode == DT_RELA? sizeof (Elf_(Rela)): sizeof (Elf_(Rel));\n}\n\nstatic ut64 get_num_relocs_dynamic_plt(ELFOBJ *bin) {\n\tif (bin->dyn_info.dt_pltrelsz) {\n\t\tconst ut64 size = bin->dyn_info.dt_pltrelsz;\n\t\tconst ut64 relsize = get_size_rel_mode (bin->dyn_info.dt_pltrel);\n\t\treturn size / relsize;\n\t}\n\treturn 0;\n}\n\nstatic ut64 get_import_addr_riscv(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\tif (got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 plt_addr = get_got_entry (bin, rel);\n\tif (plt_addr == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 pos = COMPUTE_PLTGOT_POSITION(rel, got_addr, 0x2);\n\treturn plt_addr + RISCV_PLT_OFFSET + pos * RISCV_PLT_ENTRY_SIZE;\n}\n\nstatic ut64 get_import_addr_loongarch(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\tif (got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 plt_addr = get_got_entry (bin, rel);\n\tif (plt_addr == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 pos = COMPUTE_PLTGOT_POSITION(rel, got_addr, 0x2);\n\treturn plt_addr + LOONGARCH_PLT_OFFSET + pos * LOONGARCH_PLT_ENTRY_SIZE;\n}\nstatic ut64 get_import_addr_sparc(ELFOBJ *bin, RBinElfReloc *rel) {\n\tif (rel->type != R_SPARC_JMP_SLOT) {\n\t\tR_LOG_DEBUG (\"Unknown sparc reloc type %d\", rel->type);\n\t\treturn UT64_MAX;\n\t}\n\tut64 tmp = get_got_entry (bin, rel);\n\n\treturn (tmp == UT64_MAX) ? UT64_MAX : tmp + SPARC_OFFSET_PLT_ENTRY_FROM_GOT_ADDR;\n}\n\nstatic ut64 get_import_addr_ppc(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 plt_addr = bin->dyn_info.dt_pltgot;\n\tif (plt_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\tut64 p_plt_addr = Elf_(r_bin_elf_v2p_new) (bin, plt_addr);\n\tif (p_plt_addr == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 base = r_buf_read_ble32_at (bin->b, p_plt_addr, bin->endian);\n\tif (base == UT32_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 nrel = get_num_relocs_dynamic_plt (bin);\n\tut64 pos = COMPUTE_PLTGOT_POSITION(rel, plt_addr, 0x0);\n\n\tif (bin->endian) {\n\t\tbase -= (nrel * 16);\n\t\tbase += (pos * 16);\n\t\treturn base;\n\t}\n\n\tbase -= (nrel * 12) + 20;\n\tbase += (pos * 8);\n\treturn base;\n}\n\nstatic ut64 get_import_addr_x86_manual(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\tif (got_addr == R_BIN_ELF_ADDR_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut64 got_offset = Elf_(r_bin_elf_v2p_new) (bin, got_addr);\n\tif (got_offset == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\n\t//XXX HACK ALERT!!!! full relro?? try to fix it\n\t//will there always be .plt.got, what would happen if is .got.plt?\n\tRBinElfSection *s = get_section_by_name (bin, \".plt.got\");\n\tif (Elf_(r_bin_elf_has_relro) (bin) < R_ELF_PART_RELRO || !s) {\n\t\treturn UT64_MAX;\n\t}\n\n\tut8 buf[sizeof (Elf_(Addr))] = {0};\n\n\tut64 plt_addr = s->offset;\n\tut64 plt_sym_addr;\n\n\twhile (plt_addr + 2 + 4 < s->offset + s->size) {\n\t\t/*we try to locate the plt entry that correspond with the relocation\n\t\t since got does not point back to .plt. In this case it has the following\n\t\t form\n\t\t ff253a152000 JMP QWORD [RIP + 0x20153A]\n\t\t 6690\t\t NOP\n\t\t ----\n\t\t ff25ec9f0408 JMP DWORD [reloc.puts_236]\n\t\t plt_addr + 2 to remove jmp opcode and get the imm reading 4\n\t\t and if RIP (plt_addr + 6) + imm == rel->offset\n\t\t return plt_addr, that will be our sym addr\n\t\t perhaps this hack doesn't work on 32 bits\n\t\t */\n\t\tint res = r_buf_read_at (bin->b, plt_addr + 2, buf, sizeof (ut32));\n\t\tif (res < 0) {\n\t\t\treturn UT64_MAX;\n\t\t}\n\n\t\tsize_t i = 0;\n\t\tplt_sym_addr = R_BIN_ELF_READWORD (buf, i);\n\n\t\t//relative address\n\t\tif ((plt_addr + 6 + Elf_(r_bin_elf_v2p) (bin, plt_sym_addr)) == rel->rva) {\n\t\t\treturn plt_addr;\n\t\t}\n\t\tif (plt_sym_addr == rel->rva) {\n\t\t\treturn plt_addr;\n\t\t}\n\t\tplt_addr += 8;\n\t}\n\n\treturn UT64_MAX;\n}\n\nstatic ut64 get_import_addr_x86(ELFOBJ *bin, RBinElfReloc *rel) {\n\tut64 tmp = get_got_entry (bin, rel);\n\tif (tmp == UT64_MAX) {\n\t\treturn get_import_addr_x86_manual (bin, rel);\n\t}\n\n\tRBinElfSection *pltsec_section = get_section_by_name (bin, \".plt.sec\");\n\tif (pltsec_section) {\n\t\tut64 got_addr = bin->dyn_info.dt_pltgot;\n\t\tut64 pos = COMPUTE_PLTGOT_POSITION (rel, got_addr, 0x3);\n\t\treturn pltsec_section->rva + pos * X86_PLT_ENTRY_SIZE;\n\t}\n\n\treturn tmp + X86_OFFSET_PLT_ENTRY_FROM_GOT_ADDR;\n}\n\nstatic ut64 get_import_addr(ELFOBJ *bin, int sym) {\n\tif ((!bin->shdr || !bin->strtab) && !bin->phdr) {\n\t\treturn UT64_MAX;\n\t}\n\n\tif (!bin->rel_cache) {\n\t\treturn UT64_MAX;\n\t}\n\n\t// lookup the right rel/rela entry\n\tRBinElfReloc *rel = ht_up_find (bin->rel_cache, sym, NULL);\n\tif (!rel) {\n\t\treturn UT64_MAX;\n\t}\n\n\tswitch (bin->ehdr.e_machine) {\n\tcase EM_ARM:\n\tcase EM_AARCH64:\n\t\treturn get_import_addr_arm (bin, rel);\n\tcase EM_MIPS: // MIPS32 BIG ENDIAN relocs\n\t\treturn get_import_addr_mips (bin, rel);\n\tcase EM_VAX:\n\t\t// as beautiful as riscv <3\n\t\treturn get_import_addr_riscv (bin, rel);\n\tcase EM_RISCV:\n\t\treturn get_import_addr_riscv (bin, rel);\n\tcase EM_SPARC:\n\tcase EM_SPARCV9:\n\tcase EM_SPARC32PLUS:\n\t\treturn get_import_addr_sparc (bin, rel);\n\tcase EM_PPC:\n\tcase EM_PPC64:\n\t\treturn get_import_addr_ppc (bin, rel);\n\tcase EM_386:\n\tcase EM_X86_64:\n\t\treturn get_import_addr_x86 (bin, rel);\n\tcase EM_LOONGARCH:\n\t\treturn get_import_addr_loongarch(bin, rel);\n\tdefault:\n\t\teprintf (\"Unsupported relocs type %\" PFMT64u \" for arch %d\\n\",\n\t\t\t\t(ut64) rel->type, bin->ehdr.e_machine);\n\t\treturn UT64_MAX;\n\t}\n}\n\nint Elf_(r_bin_elf_has_nx)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, 0);\n\tint i;\n\tif (bin && bin->phdr) {\n\t\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\t\tif (bin->phdr[i].p_type == PT_GNU_STACK) {\n\t\t\t\treturn (!(bin->phdr[i].p_flags & 1))? 1: 0;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nint Elf_(r_bin_elf_has_relro)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, R_ELF_NO_RELRO);\n\tbool haveBindNow = false;\n\tbool haveGnuRelro = false;\n\n\tif (bin->dyn_info.dt_bind_now) {\n\t\thaveBindNow = true;\n\t} else if (bin->dyn_info.dt_flags != R_BIN_ELF_XWORD_MAX && bin->dyn_info.dt_flags != R_BIN_ELF_XWORD_MAX) {\n\t\thaveBindNow = bin->dyn_info.dt_flags_1 & DF_1_NOW;\n\t}\n\n\tif (bin->phdr) {\n\t\tsize_t i;\n\t\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\t\tif (bin->phdr[i].p_type == PT_GNU_RELRO) {\n\t\t\t\thaveGnuRelro = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (haveGnuRelro) {\n\t\tif (haveBindNow) {\n\t\t\treturn R_ELF_FULL_RELRO;\n\t\t}\n\t\treturn R_ELF_PART_RELRO;\n\t}\n\treturn R_ELF_NO_RELRO;\n}\n\n/*\nTo compute the base address, one determines the memory\naddress associated with the lowest p_vaddr value for a\nPT_LOAD segment. One then obtains the base address by\ntruncating the memory address to the nearest multiple\nof the maximum page size\n*/\n\nut64 Elf_(r_bin_elf_get_baddr)(ELFOBJ *bin) {\n\tut64 tmp, base = UT64_MAX;\n\tif (!bin) {\n\t\treturn 0;\n\t}\n\tif (bin->phdr) {\n\t\tsize_t i;\n\t\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\t\tif (bin->phdr[i].p_type == PT_LOAD) {\n\t\t\t\ttmp = (ut64)bin->phdr[i].p_vaddr & ELF_PAGE_MASK;\n\t\t\t\ttmp = tmp - (tmp % (1 << ELF_PAGE_SIZE));\n\t\t\t\tif (tmp < base) {\n\t\t\t\t\tbase = tmp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (base == UT64_MAX && is_bin_etrel (bin)) {\n\t\t//we return our own base address for ET_REL type\n\t\t//we act as a loader for ELF\n\t\treturn 0x08000000;\n\t}\n\treturn base == UT64_MAX? 0: base;\n}\n\nut64 Elf_(r_bin_elf_get_boffset)(ELFOBJ *bin) {\n\tut64 tmp, base = UT64_MAX;\n\tr_return_val_if_fail (bin, 0);\n\n\tif (!bin->phdr) {\n\t\treturn 0; // TODO: should return ut64.max\n\t}\n\n\tsize_t i;\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tif (bin->phdr[i].p_type == PT_LOAD) {\n\t\t\ttmp = (ut64)bin->phdr[i].p_offset & ELF_PAGE_MASK;\n\t\t\ttmp = tmp - (tmp % (1 << ELF_PAGE_SIZE));\n\t\t\tif (tmp < base) {\n\t\t\t\tbase = tmp;\n\t\t\t}\n\t\t}\n\t}\n\treturn base == UT64_MAX? 0: base;\n}\n\nut64 Elf_(r_bin_elf_get_init_offset)(ELFOBJ *bin) {\n\tut64 entry = Elf_(r_bin_elf_get_entry_offset) (bin);\n\tut8 buf[128];\n\tif (!bin || entry == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\tif (r_buf_read_at (bin->b, entry + 16, buf, sizeof (buf)) < 1) {\n\t\tR_LOG_DEBUG (\"read (init_offset)\");\n\t\treturn 0;\n\t}\n\tif (buf[0] == 0x68) { // push // x86 only\n\t\tut64 addr;\n\t\tmemmove (buf, buf + 1, 4);\n\t\taddr = (ut64)r_read_le32 (buf);\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n\treturn 0;\n}\n\nut64 Elf_(r_bin_elf_get_fini_offset)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tut64 entry = Elf_(r_bin_elf_get_entry_offset) (bin);\n\tif (entry == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\tut8 buf[512];\n\tif (r_buf_read_at (bin->b, entry + 11, buf, sizeof (buf)) == -1) {\n\t\tR_LOG_ERROR (\"read (get_fini)\");\n\t\treturn 0;\n\t}\n\tif (*buf == 0x68) { // push // x86/32 only\n\t\tmemmove (buf, buf + 1, 4);\n\t\tut64 addr = (ut64)r_read_le32 (buf);\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n\treturn 0;\n}\n\nut64 Elf_(r_bin_elf_get_entry_offset)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tut64 entry = bin->ehdr.e_entry;\n\tif (!entry) {\n\t\tif (!Elf_(r_bin_elf_is_executable) (bin)) {\n\t\t\treturn UT64_MAX;\n\t\t}\n\t\tentry = Elf_(r_bin_elf_get_section_offset)(bin, \".init.text\");\n\t\tif (entry != UT64_MAX) {\n\t\t\treturn entry;\n\t\t}\n\t\tentry = Elf_(r_bin_elf_get_section_offset)(bin, \".text\");\n\t\tif (entry != UT64_MAX) {\n\t\t\treturn entry;\n\t\t}\n\t\treturn Elf_(r_bin_elf_get_section_offset)(bin, \".init\");\n\t}\n\treturn Elf_(r_bin_elf_v2p) (bin, entry);\n}\n\nstatic ut64 getmainsymbol(ELFOBJ *bin) {\n\tstruct r_bin_elf_symbol_t *symbol = Elf_(r_bin_elf_get_symbols) (bin);\n\tif (symbol) {\n\t\tsize_t i;\n\t\tfor (i = 0; !symbol[i].last; i++) {\n\t\t\tif (!strcmp (symbol[i].name, \"main\")) {\n\t\t\t\treturn symbol[i].offset;\n\t\t\t}\n\t\t}\n\t}\n\treturn UT64_MAX;\n}\n\nut64 Elf_(r_bin_elf_get_main_offset)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tut64 entry = Elf_(r_bin_elf_get_entry_offset) (bin);\n\tif (entry == UT64_MAX) {\n\t\treturn UT64_MAX;\n\t}\n\tut8 buf[256];\n\tif (entry > bin->size || (entry + sizeof (buf)) > bin->size) {\n\t\treturn UT64_MAX;\n\t}\n\t// unnecessary to read 512 bytes imho\n\tif (r_buf_read_at (bin->b, entry, buf, sizeof (buf)) < 1) {\n\t\tR_LOG_ERROR (\"read (main)\");\n\t\treturn UT64_MAX;\n\t}\n\t// ARM64\n\tif (buf[0x18 + 3] == 0x58 && buf[0x2f] == 0x00) {\n\t\tut32 entry_vaddr = Elf_(r_bin_elf_p2v) (bin, entry);\n\t\tut32 main_addr = r_read_le32 (&buf[0x30]);\n\t\tif ((main_addr >> 16) == (entry_vaddr >> 16)) {\n\t\t\treturn Elf_(r_bin_elf_v2p) (bin, main_addr);\n\t\t}\n\t}\n\n\t// TODO: Use arch to identify arch before memcmp's\n\n\t// ARM Glibc\n\tif (entry & 1) {\n\t\tint delta = 0;\n\t\t/* thumb entry points */\n\t\tif (!memcmp (buf, \"\\xf0\\x00\\x0b\\x4f\\xf0\\x00\\x0e\\x02\\xbc\\x6a\\x46\", 11)) {\n\t\t\t/* newer versions of gcc use push/pop */\n\t\t\tdelta = 0x28;\n\t\t} else if (!memcmp (buf, \"\\xf0\\x00\\x0b\\x4f\\xf0\\x00\\x0e\\x5d\\xf8\\x04\\x1b\", 11)) {\n\t\t\t/* older versions of gcc (4.5.x) use ldr/str */\n\t\t\tdelta = 0x30;\n\t\t}\n\t\tif (delta) {\n\t\t\tut64 pa = Elf_(r_bin_elf_v2p) (bin, r_read_le32 (&buf[delta-1]) & ~1);\n\t\t\tif (pa < r_buf_size (bin->b)) {\n\t\t\t\treturn pa;\n\t\t\t}\n\t\t}\n\t} else {\n\t\t/* non-thumb entry points */\n\t\tif (!memcmp (buf, \"\\x00\\xb0\\xa0\\xe3\\x00\\xe0\\xa0\\xe3\", 8)) {\n\t\t\treturn Elf_(r_bin_elf_v2p) (bin, r_read_le32 (&buf[0x34]) & ~1);\n\t\t}\n\t\tif (!memcmp (buf, \"\\x24\\xc0\\x9f\\xe5\\x00\\xb0\\xa0\\xe3\", 8)) {\n\t\t\treturn Elf_(r_bin_elf_v2p) (bin, r_read_le32 (&buf[0x30]) & ~1);\n\t\t}\n\t}\n\n\t// MIPS\n\t/* get .got, calculate offset of main symbol */\n\tif (!memcmp (buf, \"\\x21\\x00\\xe0\\x03\\x01\\x00\\x11\\x04\", 8)) {\n\n\t\t/*\n\t\t assuming the startup code looks like\n\t\t got = gp-0x7ff0\n\t\t got[index__libc_start_main] ( got[index_main] );\n\n\t\t looking for the instruction generating the first argument to find main\n\t\t lw a0, offset(gp)\n\t\t*/\n\n\t\tut64 got_offset;\n\t\tif ((got_offset = Elf_(r_bin_elf_get_section_offset) (bin, \".got\")) != -1 ||\n\t\t (got_offset = Elf_(r_bin_elf_get_section_offset) (bin, \".got.plt\")) != -1)\n\t\t{\n\t\t\tconst ut64 gp = got_offset + 0x7ff0;\n\t\t\tsize_t i, len = sizeof (buf) / sizeof (buf[0]);\n\t\t\tfor (i = 0; i < len; i += 4) {\n\t\t\t\tconst ut32 instr = r_read_le32 (&buf[i]);\n\t\t\t\tif ((instr & 0xffff0000) == 0x8f840000) { // lw a0, offset(gp)\n\t\t\t\t\tconst short delta = instr & 0x0000ffff;\n\t\t\t\t\tr_buf_read_at (bin->b, /* got_entry_offset = */ gp + delta, buf, 4);\n\t\t\t\t\treturn Elf_(r_bin_elf_v2p) (bin, r_read_le32 (&buf[0]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t}\n\t// X86-CGC\n\tif (buf[0] == 0xe8 && !memcmp (buf + 5, \"\\x50\\xe8\\x00\\x00\\x00\\x00\\xb8\\x01\\x00\\x00\\x00\\x53\", 12)) {\n\t\tsize_t SIZEOF_CALL = 5;\n\t\tut64 rel_addr = (ut64)((int)(buf[1] + (buf[2] << 8) + (buf[3] << 16) + (buf[4] << 24)));\n\t\tut64 addr = Elf_(r_bin_elf_p2v)(bin, entry + SIZEOF_CALL);\n\t\taddr += rel_addr;\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n\t// X86-PIE\n\tif (buf[0x00] == 0x48 && buf[0x1e] == 0x8d && buf[0x11] == 0xe8) {\n\t\tut32 *pmain = (ut32*)(buf + 0x30);\n\t\tut64 vmain = Elf_(r_bin_elf_p2v) (bin, (ut64)*pmain);\n\t\tut64 ventry = Elf_(r_bin_elf_p2v) (bin, entry);\n\t\tif (vmain >> 16 == ventry >> 16) {\n\t\t\treturn (ut64)vmain;\n\t\t}\n\t}\n\t// X86-PIE\n\tif (buf[0x1d] == 0x48 && buf[0x1e] == 0x8b) {\n\t\tif (!memcmp (buf, \"\\x31\\xed\\x49\\x89\", 4)) {// linux\n\t\t\tut64 maddr, baddr;\n\t\t\tut8 n32s[sizeof (ut32)] = {0};\n\t\t\tmaddr = entry + 0x24 + r_read_le32 (buf + 0x20);\n\t\t\tif (r_buf_read_at (bin->b, maddr, n32s, sizeof (ut32)) == -1) {\n\t\t\t\tR_LOG_ERROR (\"read (maddr) 2\");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tmaddr = (ut64)r_read_le32 (&n32s[0]);\n\t\t\tbaddr = (bin->ehdr.e_entry >> 16) << 16;\n\t\t\tif (bin->phdr) {\n\t\t\t\tbaddr = Elf_(r_bin_elf_get_baddr) (bin);\n\t\t\t}\n\t\t\tmaddr += baddr;\n\t\t\treturn maddr;\n\t\t}\n\t}\n\t// X86-NONPIE\n#if R_BIN_ELF64\n\tif (!memcmp (buf, \"\\x49\\x89\\xd9\", 3) && buf[156] == 0xe8) { // openbsd\n\t\treturn r_read_le32 (&buf[157]) + entry + 156 + 5;\n\t}\n\tif (!memcmp (buf+29, \"\\x48\\xc7\\xc7\", 3)) { // linux\n\t\tut64 addr = (ut64)r_read_le32 (&buf[29 + 3]);\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n#else\n\tif (buf[23] == '\\x68') {\n\t\tut64 addr = (ut64)r_read_le32 (&buf[23 + 1]);\n\t\treturn Elf_(r_bin_elf_v2p) (bin, addr);\n\t}\n#endif\n\t/* linux64 pie main -- probably buggy in some cases */\n\tint bo = 29; // Begin offset may vary depending on the entry prelude\n\t// endbr64 - fedora bins have this\n\tif (buf[0] == 0xf3 && buf[1] == 0x0f && buf[2] == 0x1e && buf[3] == 0xfa) {\n\t\t// Change begin offset if binary starts with 'endbr64'\n\t\tbo = 33;\n\t}\n\tif (buf[bo] == 0x48) {\n\t\tut8 ch = buf[bo + 1];\n\t\tif (ch == 0x8d) { // lea rdi, qword [rip-0x21c4]\n\t\t\tut8 *p = buf + bo + 3;\n\t\t\tst32 maindelta = (st32)r_read_le32 (p);\n\t\t\tut64 vmain = (ut64)(entry + bo + maindelta) + 7;\n\t\t\tut64 ventry = Elf_(r_bin_elf_p2v) (bin, entry);\n\t\t\tif ((vmain >> 16) == (ventry >> 16)) {\n\t\t\t\treturn (ut64)vmain;\n\t\t\t}\n\t\t} else if (ch == 0xc7) { // mov rdi, 0xADDR\n\t\t\tut8 *p = buf + bo + 3;\n\t\t\treturn (ut64)(ut32)r_read_le32 (p);\n\t\t}\n\t}\n\n\t/* find sym.main if possible */\n\t{\n\t\tut64 m = getmainsymbol (bin);\n\t\tif (m != UT64_MAX) {\n\t\t\treturn m;\n\t\t}\n\t}\n\treturn UT64_MAX;\n}\n\nbool Elf_(r_bin_elf_get_stripped)(ELFOBJ *bin) {\n\tif (!bin->shdr) {\n\t\treturn false;\n\t}\n\tif (bin->g_sections) {\n\t\tsize_t i;\n\t\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\t\tif (!strcmp (bin->g_sections[i].name, \".gnu_debugdata\")) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\tsize_t i;\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tif (bin->shdr[i].sh_type == SHT_SYMTAB) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nchar *Elf_(r_bin_elf_intrp)(ELFOBJ *bin) {\n\tint i;\n\tif (!bin || !bin->phdr) {\n\t\treturn NULL;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tif (bin->phdr[i].p_type == PT_INTERP) {\n\t\t\tut64 addr = bin->phdr[i].p_offset;\n\t\t\tint sz = bin->phdr[i].p_filesz;\n\t\t\tsdb_num_set (bin->kv, \"elf_header.intrp_addr\", addr, 0);\n\t\t\tsdb_num_set (bin->kv, \"elf_header.intrp_size\", sz, 0);\n\t\t\tif (sz < 1 || sz > r_buf_size (bin->b)) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tchar *str = malloc (sz + 1);\n\t\t\tif (!str) {\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (r_buf_read_at (bin->b, addr, (ut8*)str, sz) < 1) {\n\t\t\t\tR_LOG_ERROR (\"read (main)\");\n\t\t\t\tfree (str);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tstr[sz] = 0;\n\t\t\tsdb_set (bin->kv, \"elf_header.intrp\", str, 0);\n\t\t\treturn str;\n\t\t}\n\t}\n\treturn NULL;\n}\n\nbool Elf_(r_bin_elf_is_static)(ELFOBJ *bin) {\n\tsize_t i;\n\tif (!bin->phdr) {\n\t\treturn false;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tif (bin->phdr[i].p_type == PT_INTERP ||\n\t\t\tbin->phdr[i].p_type == PT_DYNAMIC) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nchar* Elf_(r_bin_elf_get_data_encoding)(ELFOBJ *bin) {\n\tswitch (bin->ehdr.e_ident[EI_DATA]) {\n\tcase ELFDATANONE: return strdup (\"none\");\n\tcase ELFDATA2LSB: return strdup (\"2's complement, little endian\");\n\tcase ELFDATA2MSB: return strdup (\"2's complement, big endian\");\n\tdefault: return r_str_newf (\"\", bin->ehdr.e_ident[EI_DATA]);\n\t}\n}\n\nint Elf_(r_bin_elf_has_va)(ELFOBJ *bin) {\n\treturn true;\n}\n\nchar* Elf_(r_bin_elf_get_arch)(ELFOBJ *bin) {\n\tswitch (bin->ehdr.e_machine) {\n\tcase EM_ARC:\n\tcase EM_ARC_A5:\n\t\treturn strdup (\"arc\");\n\tcase EM_AVR: return strdup (\"avr\");\n\tcase EM_BA2_NON_STANDARD:\n\tcase EM_BA2: return strdup (\"ba2\");\n\tcase EM_CRIS: return strdup (\"cris\");\n\tcase EM_68K: return strdup (\"m68k\");\n\tcase EM_MIPS:\n\tcase EM_MIPS_RS3_LE:\n\tcase EM_MIPS_X:\n\t\treturn strdup (\"mips\");\n\tcase EM_MCST_ELBRUS:\n\t\treturn strdup (\"elbrus\");\n\tcase EM_TRICORE:\n\t\treturn strdup (\"tricore\");\n\tcase EM_RCE:\n\t\treturn strdup (\"mcore\");\n\tcase EM_ARM:\n\tcase EM_AARCH64:\n\t\treturn strdup (\"arm\");\n\tcase EM_QDSP6: // EM_HEXAGON\n\t\treturn strdup (\"hexagon\");\n\tcase EM_BLACKFIN:\n\t\treturn strdup (\"blackfin\");\n\tcase EM_SPARC:\n\tcase EM_SPARC32PLUS:\n\tcase EM_SPARCV9:\n\t\treturn strdup (\"sparc\");\n\tcase EM_PPC:\n\tcase EM_PPC64:\n\t\treturn strdup (\"ppc\");\n\tcase EM_PARISC:\n\t\treturn strdup (\"hppa\");\n\tcase EM_PROPELLER:\n\t\treturn strdup (\"propeller\");\n\tcase EM_MICROBLAZE:\n\t\treturn strdup (\"microblaze.gnu\");\n\tcase EM_RISCV:\n\t\treturn strdup (\"riscv\");\n\tcase EM_VAX:\n\t\treturn strdup (\"vax\");\n\tcase EM_XTENSA:\n\t\treturn strdup (\"xtensa\");\n\tcase EM_LANAI:\n\t\treturn strdup (\"lanai\");\n\tcase EM_VIDEOCORE3:\n\tcase EM_VIDEOCORE4:\n\t\treturn strdup (\"vc4\");\n\tcase EM_MSP430:\n\t\treturn strdup (\"msp430\");\n\tcase EM_SH:\n\t\treturn strdup (\"sh\");\n\tcase EM_V800:\n\t\treturn strdup (\"v850\");\n\tcase EM_V850:\n\t\treturn strdup (\"v850\");\n\tcase EM_IA_64:\n\t\treturn strdup (\"ia64\");\n\tcase EM_S390:\n\t\treturn strdup (\"s390\");\n\tcase EM_KVX:\n\t\treturn strdup(\"kvx\");\n\tcase EM_LOONGARCH:\n\t\treturn strdup (\"loongarch\");\n\tdefault: return strdup (\"x86\");\n\t}\n}\nchar* Elf_(r_bin_elf_get_abi)(ELFOBJ *bin) {\n\tElf_(Ehdr)* ehdr = (Elf_(Ehdr) *) &bin->ehdr;\n\n\tif (ehdr->e_machine == EM_MIPS) {\n\t\tif (is_elfclass64 (ehdr)) {\n\t\t\treturn strdup (\"n64\");\n\t\t}\n\t\tif (is_mips_n32 (ehdr)) {\n\t\t\treturn strdup (\"n32\");\n\t\t}\n\t\tif (is_mips_o32 (ehdr)) {\n\t\t\treturn strdup (\"o32\");\n\t\t}\n\t}\n\treturn NULL;\n}\n\nchar* Elf_(r_bin_elf_get_cpu)(ELFOBJ *bin) {\n\tif (bin->phdr && bin->ehdr.e_machine == EM_MIPS) {\n\t\tconst ut32 mipsType = bin->ehdr.e_flags & EF_MIPS_ARCH;\n\t\tswitch (mipsType) {\n\t\tcase EF_MIPS_ARCH_1: return strdup (\"mips1\");\n\t\tcase EF_MIPS_ARCH_2: return strdup (\"mips2\");\n\t\tcase EF_MIPS_ARCH_3: return strdup (\"mips3\");\n\t\tcase EF_MIPS_ARCH_4: return strdup (\"mips4\");\n\t\tcase EF_MIPS_ARCH_5: return strdup (\"mips5\");\n\t\tcase EF_MIPS_ARCH_32: return strdup (\"mips32\");\n\t\tcase EF_MIPS_ARCH_64: return strdup (\"mips64\");\n\t\tcase EF_MIPS_ARCH_32R2: return strdup (\"mips32r2\");\n\t\tcase EF_MIPS_ARCH_64R2: return strdup (\"mips64r2\");\n\t\tdefault : return strdup (\" Unknown mips ISA\");\n\t\t}\n\t}\n\treturn NULL;\n}\n\nchar* Elf_(r_bin_elf_get_head_flag)(ELFOBJ *bin) {\n\tchar *head_flag = NULL;\n\tchar *str = Elf_(r_bin_elf_get_cpu) (bin);\n\tif (str) {\n\t\thead_flag = r_str_append (head_flag, str);\n\t\tfree (str);\n\t}\n\tstr = Elf_(r_bin_elf_get_abi) (bin);\n\tif (str) {\n\t\thead_flag = r_str_appendf (head_flag, \" %s\", str);\n\t\tfree (str);\n\t}\n\tif (R_STR_ISEMPTY (head_flag)) {\n\t\thead_flag = r_str_append (head_flag, \"unknown_flag\");\n\t}\n\treturn head_flag;\n}\n\n// http://www.sco.com/developers/gabi/latest/ch4.eheader.html\n\nchar* Elf_(r_bin_elf_get_machine_name)(ELFOBJ *bin) {\n\tswitch (bin->ehdr.e_machine) {\n\tcase EM_NONE: return strdup (\"No machine\");\n\tcase EM_M32: return strdup (\"AT&T WE 32100\");\n\tcase EM_SPARC: return strdup (\"SUN SPARC\");\n\tcase EM_386: return strdup (\"Intel 80386\");\n\tcase EM_68K: return strdup (\"Motorola m68k family\");\n\tcase EM_88K: return strdup (\"Motorola m88k family\");\n\tcase EM_860: return strdup (\"Intel 80860\");\n\tcase EM_MIPS: return strdup (\"MIPS R3000\");\n\tcase EM_S370: return strdup (\"IBM System/370\");\n\tcase EM_MIPS_RS3_LE: return strdup (\"MIPS R3000 little-endian\");\n\tcase EM_PARISC: return strdup (\"HPPA\");\n\tcase EM_VPP500: return strdup (\"Fujitsu VPP500\");\n\tcase EM_SPARC32PLUS: return strdup (\"Sun's \\\"v8plus\\\"\");\n\tcase EM_960: return strdup (\"Intel 80960\");\n\tcase EM_PPC: return strdup (\"PowerPC\");\n\tcase EM_PPC64: return strdup (\"PowerPC 64-bit\");\n\tcase EM_S390: return strdup (\"IBM S390\");\n\tcase EM_V800: return strdup (\"NEC V800 series\");\n\tcase EM_FR20: return strdup (\"Fujitsu FR20\");\n\tcase EM_RH32: return strdup (\"TRW RH-32\");\n\tcase EM_RCE: return strdup (\"Motorola RCE\");\n\tcase EM_ARM: return strdup (\"ARM\");\n\tcase EM_BLACKFIN: return strdup (\"Analog Devices Blackfin\");\n\tcase EM_FAKE_ALPHA: return strdup (\"Digital Alpha\");\n\tcase EM_SH: return strdup (\"Hitachi SH\");\n\tcase EM_SPARCV9: return strdup (\"SPARC v9 64-bit\");\n\tcase EM_TRICORE: return strdup (\"Siemens Tricore\");\n\tcase EM_ARC: return strdup (\"Argonaut RISC Core\");\n\tcase EM_H8_300: return strdup (\"Hitachi H8/300\");\n\tcase EM_H8_300H: return strdup (\"Hitachi H8/300H\");\n\tcase EM_H8S: return strdup (\"Hitachi H8S\");\n\tcase EM_H8_500: return strdup (\"Hitachi H8/500\");\n\tcase EM_IA_64: return strdup (\"Intel Merced\");\n\tcase EM_MIPS_X: return strdup (\"Stanford MIPS-X\");\n\tcase EM_COLDFIRE: return strdup (\"Motorola Coldfire\");\n\tcase EM_68HC12: return strdup (\"Motorola M68HC12\");\n\tcase EM_MMA: return strdup (\"Fujitsu MMA Multimedia Accelerator\");\n\tcase EM_PCP: return strdup (\"Siemens PCP\");\n\tcase EM_NCPU: return strdup (\"Sony nCPU embeeded RISC\");\n\tcase EM_NDR1: return strdup (\"Denso NDR1 microprocessor\");\n\tcase EM_STARCORE: return strdup (\"Motorola Start*Core processor\");\n\tcase EM_ME16: return strdup (\"Toyota ME16 processor\");\n\tcase EM_ST100: return strdup (\"STMicroelectronic ST100 processor\");\n\tcase EM_TINYJ: return strdup (\"Advanced Logic Corp. Tinyj emb.fam\");\n\tcase EM_X86_64: return strdup (\"AMD x86-64 architecture\");\n\tcase EM_LANAI: return strdup (\"32bit LANAI architecture\");\n\tcase EM_PDSP: return strdup (\"Sony DSP Processor\");\n\tcase EM_PDP10: return strdup (\"Digital Equipment Corp. PDP-10\");\n\tcase EM_PDP11: return strdup (\"Digital Equipment Corp. PDP-11\");\n\tcase EM_FX66: return strdup (\"Siemens FX66 microcontroller\");\n\tcase EM_ST9PLUS: return strdup (\"STMicroelectronics ST9+ 8/16 mc\");\n\tcase EM_ST7: return strdup (\"STmicroelectronics ST7 8 bit mc\");\n\tcase EM_68HC16: return strdup (\"Motorola MC68HC16 microcontroller\");\n\tcase EM_68HC11: return strdup (\"Motorola MC68HC11 microcontroller\");\n\tcase EM_68HC08: return strdup (\"Motorola MC68HC08 microcontroller\");\n\tcase EM_68HC05: return strdup (\"Motorola MC68HC05 microcontroller\");\n\tcase EM_SVX: return strdup (\"Silicon Graphics SVx\");\n\tcase EM_ST19: return strdup (\"STMicroelectronics ST19 8 bit mc\");\n\tcase EM_VAX: return strdup (\"Digital VAX\");\n\tcase EM_CRIS: return strdup (\"Axis Communications 32-bit embedded processor\");\n\tcase EM_JAVELIN: return strdup (\"Infineon Technologies 32-bit embedded processor\");\n\tcase EM_FIREPATH: return strdup (\"Element 14 64-bit DSP Processor\");\n\tcase EM_ZSP: return strdup (\"LSI Logic 16-bit DSP Processor\");\n\tcase EM_MMIX: return strdup (\"Donald Knuth's educational 64-bit processor\");\n\tcase EM_HUANY: return strdup (\"Harvard University machine-independent object files\");\n\tcase EM_PRISM: return strdup (\"SiTera Prism\");\n\tcase EM_AVR: return strdup (\"Atmel AVR 8-bit microcontroller\");\n\tcase EM_FR30: return strdup (\"Fujitsu FR30\");\n\tcase EM_D10V: return strdup (\"Mitsubishi D10V\");\n\tcase EM_D30V: return strdup (\"Mitsubishi D30V\");\n\tcase EM_V850: return strdup (\"NEC v850\");\n\tcase EM_M32R: return strdup (\"Mitsubishi M32R\");\n\tcase EM_MN10300: return strdup (\"Matsushita MN10300\");\n\tcase EM_MN10200: return strdup (\"Matsushita MN10200\");\n\tcase EM_PJ: return strdup (\"picoJava\");\n\tcase EM_OPENRISC: return strdup (\"OpenRISC 32-bit embedded processor\");\n\tcase EM_ARC_A5: return strdup (\"ARC Cores Tangent-A5\");\n\tcase EM_XTENSA: return strdup (\"Tensilica Xtensa Architecture\");\n\tcase EM_AARCH64: return strdup (\"ARM aarch64\");\n\tcase EM_PROPELLER: return strdup (\"Parallax Propeller\");\n\tcase EM_MICROBLAZE: return strdup (\"Xilinx MicroBlaze\");\n\tcase EM_RISCV: return strdup (\"RISC V\");\n\tcase EM_VIDEOCORE3: return strdup (\"VideoCore III\");\n\tcase EM_VIDEOCORE4: return strdup (\"VideoCore IV\");\n\tcase EM_LATTICEMICO32: return strdup (\"RISC processor for Lattice FPGA architecture\");\n\tcase EM_SE_C17: return strdup (\"Seiko Epson C17 family\");\n\tcase EM_TI_C6000: return strdup (\"The Texas Instruments TMS320C6000 DSP family\");\n\tcase EM_TI_C2000: return strdup (\"The Texas Instruments TMS320C2000 DSP family\");\n\tcase EM_TI_C5500: return strdup (\"The Texas Instruments TMS320C55x DSP family\");\n\tcase EM_TI_ARP32: return strdup (\"Texas Instruments Application Specific RISC Processor, 32bit fetch\");\n\tcase EM_TI_PRU: return strdup (\"Texas Instruments Programmable Realtime Unit\");\n\tcase EM_MMDSP_PLUS: return strdup (\"STMicroelectronics 64bit VLIW Data Signal Processor\");\n\tcase EM_CYPRESS_M8C: return strdup (\"Cypress M8C microprocessor\");\n\tcase EM_R32C: return strdup (\"Renesas R32C series microprocessors\");\n\tcase EM_TRIMEDIA: return strdup (\"NXP Semiconductors TriMedia architecture family\");\n\tcase EM_QDSP6: return strdup (\"QUALCOMM DSP6 Processor\"); // Nonstandard\n\tcase EM_8051: return strdup (\"Intel 8051 and variants\");\n\tcase EM_STXP7X: return strdup (\"STMicroelectronics STxP7x family of configurable and extensible RISC processors\");\n\tcase EM_NDS32: return strdup (\"Andes Technology compact code size embedded RISC processor family\");\n\tcase EM_ECOG1: return strdup (\"Cyan Technology eCOG1X family\");\n\t// case EM_ECOG1X: return strdup (\"Cyan Technology eCOG1X family\"); // Nonstandard\n\tcase EM_MAXQ30: return strdup (\"Dallas Semiconductor MAXQ30 Core Micro-controllers\");\n\tcase EM_XIMO16: return strdup (\"New Japan Radio (NJR) 16-bit DSP Processor\");\n\tcase EM_MANIK: return strdup (\"M2000 Reconfigurable RISC Microprocessor\");\n\tcase EM_CRAYNV2: return strdup (\"Cray Inc. NV2 vector architecture\");\n\tcase EM_RX: return strdup (\"Renesas RX family\");\n\tcase EM_METAG: return strdup (\"Imagination Technologies META processor architecture\");\n\tcase EM_MCST_ELBRUS: return strdup (\"MCST Elbrus general purpose hardware architecture\");\n\tcase EM_ECOG16: return strdup (\"Cyan Technology eCOG16 family\");\n\tcase EM_CR16: return strdup (\"National Semiconductor CompactRISC CR16 16-bit microprocessor\");\n\tcase EM_ETPU: return strdup (\"Freescale Extended Time Processing Unit\");\n\tcase EM_SLE9X: return strdup (\"Infineon Technologies SLE9X core\");\n\tcase EM_L10M: return strdup (\"Intel L10M\");\n\tcase EM_K10M: return strdup (\"Intel K10M\");\n\t// case EM_AARCH64: return strdup (\"ARM 64-bit architecture (AARCH64)\"); // Nonstandard\n\tcase EM_AVR32: return strdup (\"Atmel Corporation 32-bit microprocessor family\");\n\tcase EM_STM8: return strdup (\"STMicroeletronics STM8 8-bit microcontroller\");\n\tcase EM_TILE64: return strdup (\"Tilera TILE64 multicore architecture family\");\n\tcase EM_TILEPRO: return strdup (\"Tilera TILEPro multicore architecture family\");\n\t// case EM_MICROBLAZE: return strdup (\"Xilinx MicroBlaze 32-bit RISC soft processor core\"); // Nonstandard\n\tcase EM_CUDA: return strdup (\"NVIDIA CUDA architecture\");\n\tcase EM_TILEGX: return strdup (\"Tilera TILE-Gx multicore architecture family\");\n\tcase EM_CLOUDSHIELD: return strdup (\"CloudShield architecture family\");\n\tcase EM_COREA_1ST: return strdup (\"KIPO-KAIST Core-A 1st generation processor family\");\n\tcase EM_COREA_2ND: return strdup (\"KIPO-KAIST Core-A 2nd generation processor family\");\n\tcase EM_ARC_COMPACT2: return strdup (\"Synopsys ARCompact V2\");\n\tcase EM_OPEN8: return strdup (\"Open8 8-bit RISC soft processor core\");\n\tcase EM_RL78: return strdup (\"Renesas RL78 family\");\n\tcase EM_VIDEOCORE5: return strdup (\"Broadcom VideoCore V processor\");\n\tcase EM_78KOR: return strdup (\"Renesas 78KOR family\");\n\t// case EM_56800EX: return strdup (\"Freescale 56800EX Digital Signal Controller (DSC)\"); // Nonstandard\n\tcase EM_BA1: return strdup (\"Beyond BA1 CPU architecture\");\n\tcase EM_BA2_NON_STANDARD:\n\tcase EM_BA2: return strdup (\"Beyond BA2 CPU architecture\");\n\tcase EM_XCORE: return strdup (\"XMOS xCORE processor family\");\n\tcase EM_MCHP_PIC: return strdup (\"Microchip 8-bit PIC(r) family\");\n\tcase EM_INTEL205: return strdup (\"Reserved by Intel\");\n\tcase EM_INTEL206: return strdup (\"Reserved by Intel\");\n\tcase EM_INTEL207: return strdup (\"Reserved by Intel\");\n\tcase EM_INTEL208: return strdup (\"Reserved by Intel\");\n\tcase EM_INTEL209: return strdup (\"Reserved by Intel\");\n\tcase EM_KM32: return strdup (\"KM211 KM32 32-bit processor\");\n\tcase EM_KMX32: return strdup (\"KM211 KMX32 32-bit processor\");\n\tcase EM_KMX16: return strdup (\"KM211 KMX16 16-bit processor\");\n\tcase EM_KMX8: return strdup (\"KM211 KMX8 8-bit processor\");\n\tcase EM_KVARC: return strdup (\"KM211 KVARC processor\");\n\tcase EM_CDP: return strdup (\"Paneve CDP architecture family\");\n\tcase EM_COGE: return strdup (\"Cognitive Smart Memory Processor\");\n\tcase EM_COOL: return strdup (\"Bluechip Systems CoolEngine\");\n\tcase EM_NORC: return strdup (\"Nanoradio Optimized RISC\");\n\tcase EM_CSR_KALIMBA: return strdup (\"CSR Kalimba architecture family\");\n\tcase EM_Z80: return strdup (\"Zilog Z80\");\n\tcase EM_VISIUM: return strdup (\"Controls and Data Services VISIUMcore processor\");\n\tcase EM_FT32: return strdup (\"FTDI Chip FT32 high performance 32-bit RISC architecture\");\n\tcase EM_MOXIE: return strdup (\"Moxie processor family\");\n\tcase EM_AMDGPU: return strdup (\"AMD GPU architecture\");\n\tcase EM_LOONGARCH: return strdup (\"Loongson Loongarch\");\n\n\tdefault: return r_str_newf (\": 0x%x\", bin->ehdr.e_machine);\n\t}\n}\n\nchar* Elf_(r_bin_elf_get_file_type)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, NULL);\n\tut32 e_type = (ut32)bin->ehdr.e_type; // cast to avoid warn in iphone-gcc, must be ut16\n\tswitch (e_type) {\n\tcase ET_NONE: return strdup (\"NONE (None)\");\n\tcase ET_REL: return strdup (\"REL (Relocatable file)\");\n\tcase ET_EXEC: return strdup (\"EXEC (Executable file)\");\n\tcase ET_DYN: return strdup (\"DYN (Shared object file)\");\n\tcase ET_CORE: return strdup (\"CORE (Core file)\");\n\t}\n\tif ((e_type >= ET_LOPROC) && (e_type <= ET_HIPROC)) {\n\t\treturn r_str_newf (\"Processor Specific: %x\", e_type);\n\t}\n\tif ((e_type >= ET_LOOS) && (e_type <= ET_HIOS)) {\n\t\treturn r_str_newf (\"OS Specific: %x\", e_type);\n\t}\n\treturn r_str_newf (\": %x\", e_type);\n}\n\nchar* Elf_(r_bin_elf_get_elf_class)(ELFOBJ *bin) {\n\tswitch (bin->ehdr.e_ident[EI_CLASS]) {\n\tcase ELFCLASSNONE: return strdup (\"none\");\n\tcase ELFCLASS32: return strdup (\"ELF32\");\n\tcase ELFCLASS64: return strdup (\"ELF64\");\n\tdefault: return r_str_newf (\"\", bin->ehdr.e_ident[EI_CLASS]);\n\t}\n}\n\nint Elf_(r_bin_elf_get_bits)(ELFOBJ *bin) {\n\t/* Hack for ARCompact */\n\tif (bin->ehdr.e_machine == EM_ARC_A5) {\n\t\treturn 16;\n\t}\n\t/* Hack for Ps2 */\n\tif (bin->phdr && bin->ehdr.e_machine == EM_MIPS) {\n\t\tconst ut32 mipsType = bin->ehdr.e_flags & EF_MIPS_ARCH;\n\t\tif (bin->ehdr.e_type == ET_EXEC) {\n\t\t\tint i;\n\t\t\tbool haveInterp = false;\n\t\t\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\t\t\tif (bin->phdr[i].p_type == PT_INTERP) {\n\t\t\t\t\thaveInterp = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!haveInterp && mipsType == EF_MIPS_ARCH_3) {\n\t\t\t\t// Playstation2 Hack\n\t\t\t\treturn 64;\n\t\t\t}\n\t\t}\n\t\t// TODO: show this specific asm.cpu somewhere in bininfo (mips1, mips2, mips3, mips32r2, ...)\n\t\tswitch (mipsType) {\n\t\tcase EF_MIPS_ARCH_1:\n\t\tcase EF_MIPS_ARCH_2:\n\t\tcase EF_MIPS_ARCH_3:\n\t\tcase EF_MIPS_ARCH_4:\n\t\tcase EF_MIPS_ARCH_5:\n\t\tcase EF_MIPS_ARCH_32:\n\t\t\treturn 32;\n\t\tcase EF_MIPS_ARCH_64:\n\t\t\treturn 64;\n\t\tcase EF_MIPS_ARCH_32R2:\n\t\t\treturn 32;\n\t\tcase EF_MIPS_ARCH_64R2:\n\t\t\treturn 64;\n\t\t\tbreak;\n\t\t}\n\t\treturn 32;\n\t}\n\t/* Hack for Thumb */\n\tif (bin->ehdr.e_machine == EM_ARM) {\n\t\tif (bin->ehdr.e_type != ET_EXEC) {\n\t\t\tstruct r_bin_elf_symbol_t *symbol;\n\t\t\tif ((symbol = Elf_(r_bin_elf_get_symbols) (bin))) {\n\t\t\t\tint i = 0;\n\t\t\t\tfor (i = 0; !symbol[i].last; i++) {\n\t\t\t\t\tut64 paddr = symbol[i].offset;\n\t\t\t\t\tif (paddr & 1) {\n\t\t\t\t\t\treturn 16;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tut64 entry = Elf_(r_bin_elf_get_entry_offset) (bin);\n\t\tif (entry & 1) {\n\t\t\treturn 16;\n\t\t}\n\t}\n\tswitch (bin->ehdr.e_ident[EI_CLASS]) {\n\tcase ELFCLASS32: return 32;\n\tcase ELFCLASS64: return 64;\n\tcase ELFCLASSNONE:\n\tdefault: return 32; // defaults\n\t}\n}\n\nstatic inline int noodle(ELFOBJ *bin, const char *s) {\n\tif (r_buf_size (bin->b) >= 64) {\n\t\tut8 tmp[64] = {0};\n\t\tif (r_buf_read_at (bin->b, r_buf_size (bin->b) - 64, tmp, 64) == 64) {\n\t\t\treturn (bool)r_mem_mem (tmp, 64, (const ut8 *)s, strlen (s));\n\t\t}\n\t}\n\treturn false;\n}\n\nstatic inline bool needle(ELFOBJ *bin, const char *s) {\n\tif (bin->shstrtab) {\n\t\tut32 len = bin->shstrtab_size;\n\t\tif (len > 4096) {\n\t\t\tlen = 4096; // avoid slow loading .. can be buggy?\n\t\t}\n\t\treturn (bool)r_mem_mem ((const ut8*)bin->shstrtab, len,\n\t\t\t\t(const ut8*)s, strlen (s));\n\t}\n\treturn false;\n}\n\n// TODO: must return const char * all those strings must be const char os[LINUX] or so\nchar* Elf_(r_bin_elf_get_osabi_name)(ELFOBJ *bin) {\n\tsize_t i;\n\tsize_t num = bin->ehdr.e_shnum;\n\tconst char *section_name = NULL;\n\tswitch (bin->ehdr.e_ident[EI_OSABI]) {\n\tcase ELFOSABI_LINUX: return strdup(\"linux\");\n\tcase ELFOSABI_SOLARIS: return strdup(\"solaris\");\n\tcase ELFOSABI_FREEBSD: return strdup(\"freebsd\");\n\tcase ELFOSABI_HPUX: return strdup(\"hpux\");\n\t}\n\n\tif (bin->shdr && bin->shstrtab) {\n\t\tfor (i = 0; i < num; i++) {\n\t\t\tif (bin->shdr[i].sh_type == SHT_NOTE && bin->shdr[i].sh_name < bin->shstrtab_size) {\n\t\t\t\tsection_name = &bin->shstrtab[bin->shdr[i].sh_name];\n\t\t\t\tif (!strcmp (section_name, \".note.openbsd.ident\")) {\n\t\t\t\t\treturn strdup (\"openbsd\");\n\t\t\t\t}\n\t\t\t\tif (!strcmp (section_name, \".note.minix.ident\")) {\n\t\t\t\t\treturn strdup (\"minix\");\n\t\t\t\t}\n\t\t\t\tif (!strcmp (section_name, \".note.netbsd.ident\")) {\n\t\t\t\t\treturn strdup (\"netbsd\");\n\t\t\t\t}\n\t\t\t\tif (!strcmp (section_name, \".note.android.ident\")) {\n\t\t\t\t\treturn strdup (\"android\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t/* Hack to identify OS */\n\tif (needle (bin, \"freebsd\")) {\n\t\treturn strdup (\"freebsd\");\n\t}\n\tif (noodle (bin, \"BEOS:APP_VERSION\")) {\n\t\treturn strdup (\"beos\");\n\t}\n\tif (needle (bin, \"GNU\")) {\n\t\treturn strdup (\"linux\");\n\t}\n\treturn strdup (\"linux\");\n}\n\nut8 *Elf_(r_bin_elf_grab_regstate)(ELFOBJ *bin, int *len) {\n\tif (bin->phdr) {\n\t\tsize_t i;\n\t\tint num = bin->ehdr.e_phnum;\n\t\tfor (i = 0; i < num; i++) {\n\t\t\tif (bin->phdr[i].p_type != PT_NOTE) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tint bits = Elf_(r_bin_elf_get_bits)(bin);\n\t\t\tint elf_nhdr_size = (bits == 64) ? sizeof (Elf64_Nhdr) : sizeof (Elf32_Nhdr);\n\t\t\tvoid *elf_nhdr = calloc (elf_nhdr_size, 1);\n\t\t\tbool regs_found = false;\n\t\t\tut64 offset = 0;\n\n\t\t\twhile (!regs_found) {\n\t\t\t\tut32 n_descsz, n_namesz, n_type;\n\t\t\t\tint ret;\n\t\t\t\tret = r_buf_read_at (bin->b, bin->phdr[i].p_offset + offset, elf_nhdr, elf_nhdr_size);\n\t\t\t\tif (ret != elf_nhdr_size) {\n\t\t\t\t\tR_LOG_DEBUG (\"Cannot read NOTES hdr from CORE file\");\n\t\t\t\t\tfree (elf_nhdr);\n\t\t\t\t\treturn NULL;\n\t\t\t\t}\n\t\t\t\tif (bits == 64) {\n\t\t\t\t\tn_descsz = round_up (((Elf64_Nhdr *)elf_nhdr)->n_descsz);\n\t\t\t\t\tn_namesz = round_up (((Elf64_Nhdr *)elf_nhdr)->n_namesz);\n\t\t\t\t\tn_type = ((Elf64_Nhdr *)elf_nhdr)->n_type;\n\t\t\t\t} else {\n\t\t\t\t\tn_descsz = round_up (((Elf32_Nhdr *)elf_nhdr)->n_descsz);\n\t\t\t\t\tn_namesz = round_up (((Elf32_Nhdr *)elf_nhdr)->n_namesz);\n\t\t\t\t\tn_type = ((Elf32_Nhdr *)elf_nhdr)->n_type;\n\t\t\t\t}\n\t\t\t\tif (n_type == NT_PRSTATUS) {\n\t\t\t\t\tregs_found = true;\n\t\t\t\t\tfree (elf_nhdr);\n\t\t\t\t} else {\n\t\t\t\t\toffset += elf_nhdr_size + n_descsz + n_namesz;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint regdelta = 0;\n\t\t\tint regsize = 0;\n\t\t\tswitch (bin->ehdr.e_machine) {\n\t\t\t\tcase EM_AARCH64:\n\t\t\t\t\tregsize = reginf[AARCH64].regsize;\n\t\t\t\t\tregdelta = reginf[AARCH64].regdelta;\n\t\t\t\t\tbreak;\n\t\t\t\tcase EM_ARM:\n\t\t\t\t\tregsize = reginf[ARM].regsize;\n\t\t\t\t\tregdelta = reginf[ARM].regdelta;\n\t\t\t\t\tbreak;\n\t\t\t\tcase EM_386:\n\t\t\t\t\tregsize = reginf[X86].regsize;\n\t\t\t\t\tregdelta = reginf[X86].regdelta;\n\t\t\t\t\tbreak;\n\t\t\t\tcase EM_X86_64:\n\t\t\t\t\tregsize = reginf[X86_64].regsize;\n\t\t\t\t\tregdelta = reginf[X86_64].regdelta;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tut8 *buf = malloc (regsize);\n\t\t\tif (r_buf_read_at (bin->b, bin->phdr[i].p_offset + offset + regdelta, buf, regsize) != regsize) {\n\t\t\t\tfree (buf);\n\t\t\t\tR_LOG_DEBUG (\"Cannot read register state from CORE file\");\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (len) {\n\t\t\t\t*len = regsize;\n\t\t\t}\n\t\t\treturn buf;\n\t\t}\n\t}\n\tR_LOG_DEBUG (\"Cannot find NOTE section.\");\n\treturn NULL;\n}\n\nint Elf_(r_bin_elf_is_big_endian)(ELFOBJ *bin) {\n\treturn (bin->ehdr.e_ident[EI_DATA] == ELFDATA2MSB);\n}\n\n/* XXX Init dt_strtab? */\nchar *Elf_(r_bin_elf_get_rpath)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, NULL);\n\tElf_(Xword) val;\n\n\tif (!bin->phdr || !bin->strtab) {\n\t\treturn NULL;\n\t}\n\n\tif (bin->dyn_info.dt_rpath != R_BIN_ELF_XWORD_MAX) {\n\t\tval = bin->dyn_info.dt_rpath;\n\t} else if (bin->dyn_info.dt_runpath != R_BIN_ELF_XWORD_MAX) {\n\t\tval = bin->dyn_info.dt_runpath;\n\t} else {\n\t\treturn NULL;\n\t}\n\n\tif (val > bin->strtab_size) {\n\t\treturn NULL;\n\t}\n\n\treturn r_str_ndup (bin->strtab + val, ELF_STRING_LENGTH);\n}\n\nstatic bool has_valid_section_header(ELFOBJ *bin, size_t pos) {\n\treturn bin->g_sections[pos].info < bin->ehdr.e_shnum && bin->shdr;\n}\n\nstatic void fix_rva_and_offset_relocable_file(ELFOBJ *bin, RBinElfReloc *r, size_t pos) {\n\tif (has_valid_section_header (bin, pos)) {\n\t\tsize_t idx = bin->g_sections[pos].info;\n\t\tif (idx < bin->ehdr.e_shnum) {\n\t\t\tut64 pa = bin->shdr[idx].sh_offset + r->offset;\n\t\t\tr->offset = pa;\n\t\t\tr->rva = Elf_(r_bin_elf_p2v) (bin, pa);\n\t\t} else {\n\t\t\teprintf (\"fix_rva_and_offset_reloc..: invalid index\\n\");\n\t\t}\n\t} else {\n\t\tr->rva = r->offset;\n\t}\n}\n\nstatic void fix_rva_and_offset_exec_file(ELFOBJ *bin, RBinElfReloc *r) {\n\tr->rva = r->offset;\n\tr->offset = Elf_(r_bin_elf_v2p) (bin, r->offset);\n}\n\nstatic void fix_rva_and_offset(ELFOBJ *bin, RBinElfReloc *r, size_t pos) {\n\tif (is_bin_etrel (bin)) {\n\t\tfix_rva_and_offset_relocable_file (bin, r, pos);\n\t} else {\n\t\tfix_rva_and_offset_exec_file (bin, r);\n\t}\n}\n\nstatic bool read_reloc(ELFOBJ *bin, RBinElfReloc *r, Elf_(Xword) rel_mode, ut64 vaddr) {\n\tut64 offset = Elf_(r_bin_elf_v2p_new) (bin, vaddr);\n\tif (offset == UT64_MAX) {\n\t\treturn false;\n\t}\n\n\tsize_t size_struct = get_size_rel_mode (rel_mode);\n\n\tut8 buf[sizeof (Elf_(Rela))] = {0};\n\tint res = r_buf_read_at (bin->b, offset, buf, size_struct);\n\tif (res != size_struct) {\n\t\treturn false;\n\t}\n\n\tsize_t i = 0;\n\tElf_(Rela) reloc_info;\n\n\treloc_info.r_offset = R_BIN_ELF_READWORD (buf, i);\n\treloc_info.r_info = R_BIN_ELF_READWORD (buf, i);\n\n\tif (rel_mode == DT_RELA) {\n\t\treloc_info.r_addend = R_BIN_ELF_READWORD (buf, i);\n\t\tr->addend = reloc_info.r_addend;\n\t}\n\n\tr->mode = rel_mode;\n\tr->last = 0;\n\tr->offset = reloc_info.r_offset;\n\tr->sym = ELF_R_SYM (reloc_info.r_info);\n\tr->type = ELF_R_TYPE (reloc_info.r_info);\n\n\treturn true;\n}\n\nstatic size_t get_num_relocs_dynamic(ELFOBJ *bin) {\n\tsize_t res = 0;\n\n\tif (bin->dyn_info.dt_relaent) {\n\t\tres += bin->dyn_info.dt_relasz / bin->dyn_info.dt_relaent;\n\t}\n\n\tif (bin->dyn_info.dt_relent) {\n\t\tres += bin->dyn_info.dt_relsz / bin->dyn_info.dt_relent;\n\t}\n\n\treturn res + get_num_relocs_dynamic_plt (bin);\n}\n\nstatic bool sectionIsValid(ELFOBJ *bin, RBinElfSection *sect) {\n\treturn (sect->offset + sect->size <= bin->size);\n}\n\nstatic Elf_(Xword) get_section_mode(ELFOBJ *bin, size_t pos) {\n\tif (r_str_startswith (bin->g_sections[pos].name, \".rela.\")) {\n\t\treturn DT_RELA;\n\t}\n\tif (r_str_startswith (bin->g_sections[pos].name, \".rel.\")) {\n\t\treturn DT_REL;\n\t}\n\treturn 0;\n}\n\nstatic bool is_reloc_section(Elf_(Xword) rel_mode) {\n\treturn rel_mode == DT_REL || rel_mode == DT_RELA;\n}\n\nstatic size_t get_num_relocs_sections(ELFOBJ *bin) {\n\tsize_t i, size, ret = 0;\n\tElf_(Xword) rel_mode;\n\n\tif (!bin->g_sections) {\n\t\treturn 0;\n\t}\n\n\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\tif (!sectionIsValid (bin, &bin->g_sections[i])) {\n\t\t\tcontinue;\n\t\t}\n\t\trel_mode = get_section_mode (bin, i);\n\t\tif (!is_reloc_section (rel_mode)) {\n\t\t\tcontinue;\n\t\t}\n\t\tsize = get_size_rel_mode (rel_mode);\n\t\tret += NUMENTRIES_ROUNDUP (bin->g_sections[i].size, size);\n\t}\n\n\treturn ret;\n}\n\nstatic size_t get_num_relocs_approx(ELFOBJ *bin) {\n\tsize_t total = get_num_relocs_dynamic (bin) + get_num_relocs_sections (bin);\n\tif (total > bin->size) {\n\t\treturn bin->size / 2;\n\t}\n\treturn total;\n}\n\nstatic size_t populate_relocs_record_from_dynamic(ELFOBJ *bin, RBinElfReloc *relocs, size_t pos, size_t num_relocs) {\n\tsize_t offset;\n\tsize_t size = get_size_rel_mode (bin->dyn_info.dt_pltrel);\n\n\tfor (offset = 0; offset < bin->dyn_info.dt_pltrelsz && pos < num_relocs; offset += size, pos++) {\n\t\tif (!read_reloc (bin, relocs + pos, bin->dyn_info.dt_pltrel, bin->dyn_info.dt_jmprel + offset)) {\n\t\t\tbreak;\n\t\t}\n\t\tfix_rva_and_offset_exec_file (bin, relocs + pos);\n\t}\n\n\tfor (offset = 0; offset < bin->dyn_info.dt_relasz && pos < num_relocs; offset += bin->dyn_info.dt_relaent, pos++) {\n\t\tif (!read_reloc (bin, relocs + pos, DT_RELA, bin->dyn_info.dt_rela + offset)) {\n\t\t\tbreak;\n\t\t}\n\t\tfix_rva_and_offset_exec_file (bin, relocs + pos);\n\t}\n\n\tfor (offset = 0; offset < bin->dyn_info.dt_relsz && pos < num_relocs; offset += bin->dyn_info.dt_relent, pos++) {\n\t\tif (!read_reloc (bin, relocs + pos, DT_REL, bin->dyn_info.dt_rel + offset)) {\n\t\t\tbreak;\n\t\t}\n\t\tfix_rva_and_offset_exec_file (bin, relocs + pos);\n\t}\n\n\treturn pos;\n}\n\nstatic size_t get_next_not_analysed_offset(ELFOBJ *bin, size_t section_vaddr, size_t offset) {\n\tsize_t gvaddr = section_vaddr + offset;\n\n\tif (bin->dyn_info.dt_rela != R_BIN_ELF_ADDR_MAX && bin->dyn_info.dt_rela <= gvaddr\n\t\t&& gvaddr < bin->dyn_info.dt_rela + bin->dyn_info.dt_relasz) {\n\t\treturn bin->dyn_info.dt_rela + bin->dyn_info.dt_relasz - section_vaddr;\n\t}\n\n\tif (bin->dyn_info.dt_rel != R_BIN_ELF_ADDR_MAX && bin->dyn_info.dt_rel <= gvaddr\n\t\t&& gvaddr < bin->dyn_info.dt_rel + bin->dyn_info.dt_relsz) {\n\t\treturn bin->dyn_info.dt_rel + bin->dyn_info.dt_relsz - section_vaddr;\n\t}\n\n\tif (bin->dyn_info.dt_jmprel != R_BIN_ELF_ADDR_MAX && bin->dyn_info.dt_jmprel <= gvaddr\n\t\t&& gvaddr < bin->dyn_info.dt_jmprel + bin->dyn_info.dt_pltrelsz) {\n\t\treturn bin->dyn_info.dt_jmprel + bin->dyn_info.dt_pltrelsz - section_vaddr;\n\t}\n\n\treturn offset;\n}\n\nstatic size_t populate_relocs_record_from_section(ELFOBJ *bin, RBinElfReloc *relocs, size_t pos, size_t num_relocs) {\n\tsize_t size, i, j;\n\tElf_(Xword) rel_mode;\n\n\tif (!bin->g_sections) {\n\t\treturn pos;\n\t}\n\n\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\trel_mode = get_section_mode (bin, i);\n\n\t\tif (!is_reloc_section (rel_mode) || bin->g_sections[i].size > bin->size || bin->g_sections[i].offset > bin->size) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tsize = get_size_rel_mode (rel_mode);\n\n\t\tfor (j = get_next_not_analysed_offset (bin, bin->g_sections[i].rva, 0);\n\t\t\tj < bin->g_sections[i].size && pos < num_relocs;\n\t\t\tj = get_next_not_analysed_offset (bin, bin->g_sections[i].rva, j + size)) {\n\n\t\t\tif (!read_reloc (bin, relocs + pos, rel_mode, bin->g_sections[i].rva + j)) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfix_rva_and_offset (bin, relocs + pos, i);\n\t\t\tpos++;\n\t\t}\n\t}\n\n\treturn pos;\n}\n\nstatic RBinElfReloc *populate_relocs_record(ELFOBJ *bin) {\n\tsize_t i = 0;\n\tsize_t num_relocs = get_num_relocs_approx (bin);\n\tRBinElfReloc *relocs = R_NEWS0 (RBinElfReloc, num_relocs + 1);\n\tif (!relocs) {\n\t\t// In case we can't allocate enough memory for all the claimed\n\t\t// relocation entries, try to parse only the ones specified in\n\t\t// the dynamic segment.\n\t\tnum_relocs = get_num_relocs_dynamic (bin);\n\t\trelocs = R_NEWS0 (RBinElfReloc, num_relocs + 1);\n\t\tif (!relocs) {\n\t\t\treturn NULL;\n\t\t}\n\t}\n\n\ti = populate_relocs_record_from_dynamic (bin, relocs, i, num_relocs);\n\ti = populate_relocs_record_from_section (bin, relocs, i, num_relocs);\n\trelocs[i].last = 1;\n\n\tbin->g_reloc_num = i;\n\treturn relocs;\n}\n\nRBinElfReloc* Elf_(r_bin_elf_get_relocs) (ELFOBJ *bin) {\n\tif (!bin) {\n\t\treturn NULL;\n\t}\n\n\tif (!bin->g_relocs) {\n\t\tbin->g_relocs = populate_relocs_record (bin);\n\t}\n\treturn bin->g_relocs;\n}\n\nRBinElfLib* Elf_(r_bin_elf_get_libs)(ELFOBJ *bin) {\n\tRBinElfLib *ret = NULL;\n\tElf_(Off) *it = NULL;\n\tsize_t k = 0;\n\n\tif (!bin || !bin->phdr || !bin->strtab || *(bin->strtab+1) == '0') {\n\t\treturn NULL;\n\t}\n\n\tr_vector_foreach(&bin->dyn_info.dt_needed, it) {\n\t\tElf_(Off) val = *it;\n\n\t\tRBinElfLib *r = realloc (ret, (k + 1) * sizeof (RBinElfLib));\n\t\tif (!r) {\n\t\t\tr_sys_perror (\"realloc (libs)\");\n\t\t\tfree (ret);\n\t\t\treturn NULL;\n\t\t}\n\t\tret = r;\n\t\tif (val > bin->strtab_size) {\n\t\t\tfree (ret);\n\t\t\treturn NULL;\n\t\t}\n\t\tstrncpy (ret[k].name, bin->strtab + val, ELF_STRING_LENGTH);\n\t\tret[k].name[ELF_STRING_LENGTH - 1] = '\\0';\n\t\tret[k].last = 0;\n\t\tif (ret[k].name[0]) {\n\t\t\tk++;\n\t\t}\n\t}\n\n\tRBinElfLib *r = realloc (ret, (k + 1) * sizeof (RBinElfLib));\n\tif (!r) {\n\t\tr_sys_perror (\"realloc (libs)\");\n\t\tfree (ret);\n\t\treturn NULL;\n\t}\n\tret = r;\n\tret[k].last = 1;\n\treturn ret;\n}\n\nstatic void create_section_from_phdr(ELFOBJ *bin, RBinElfSection *ret, size_t *i, const char *name, ut64 addr, ut64 sz) {\n\tr_return_if_fail (bin && ret && i);\n\tif (!addr || addr == UT64_MAX) {\n\t\treturn;\n\t}\n\tret[*i].offset = Elf_(r_bin_elf_v2p_new) (bin, addr);\n\tret[*i].rva = addr;\n\tret[*i].size = sz;\n\tr_str_ncpy (ret[*i].name, name, R_ARRAY_SIZE (ret[*i].name) - 1);\n\tret[*i].last = 0;\n\t*i = *i + 1;\n}\n\nstatic RBinElfSection *get_sections_from_phdr(ELFOBJ *bin) {\n\tRBinElfSection *ret;\n\tsize_t num_sections = 0;\n\tut64 reldyn = 0, relava = 0, pltgotva = 0, relva = 0;\n\tut64 reldynsz = 0, relasz = 0, pltgotsz = 0;\n\tr_return_val_if_fail (bin && bin->phdr, NULL);\n\n\tif (!bin->ehdr.e_phnum) {\n\t\treturn NULL;\n\t}\n\tif (bin->dyn_info.dt_rel != R_BIN_ELF_ADDR_MAX) {\n\t\treldyn = bin->dyn_info.dt_rel;\n\t\tnum_sections++;\n\t}\n\tif (bin->dyn_info.dt_rela != R_BIN_ELF_ADDR_MAX) {\n\t\trelva = bin->dyn_info.dt_rela;\n\t\tnum_sections++;\n\t}\n\tif (bin->dyn_info.dt_relsz) {\n\t\treldynsz = bin->dyn_info.dt_relsz;\n\t}\n\tif (bin->dyn_info.dt_relasz) {\n\t\trelasz = bin->dyn_info.dt_relasz;\n\t}\n\tif (bin->dyn_info.dt_pltgot != R_BIN_ELF_ADDR_MAX) {\n\t\tpltgotva = bin->dyn_info.dt_pltgot;\n\t\tnum_sections++;\n\t}\n\tif (bin->dyn_info.dt_pltrelsz) {\n\t\tpltgotsz = bin->dyn_info.dt_pltrelsz;\n\t}\n\tif (bin->dyn_info.dt_jmprel != R_BIN_ELF_ADDR_MAX) {\n\t\trelava = bin->dyn_info.dt_jmprel;\n\t\tnum_sections++;\n\t}\n\n\tret = calloc (num_sections + 1, sizeof (RBinElfSection));\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\n\tsize_t i = 0;\n\tcreate_section_from_phdr (bin, ret, &i, \".rel.dyn\", reldyn, reldynsz);\n\tcreate_section_from_phdr (bin, ret, &i, \".rela.plt\", relava, pltgotsz);\n\tcreate_section_from_phdr (bin, ret, &i, \".rel.plt\", relva, relasz);\n\tcreate_section_from_phdr (bin, ret, &i, \".got.plt\", pltgotva, pltgotsz);\n\tret[i].last = 1;\n\n\treturn ret;\n}\n\nRBinElfSection* Elf_(r_bin_elf_get_sections)(ELFOBJ *bin) {\n\tRBinElfSection *ret = NULL;\n\tchar unknown_s[32], invalid_s[32];\n\tint i, nidx, unknown_c=0, invalid_c=0;\n\n\tr_return_val_if_fail (bin, NULL);\n\tif (bin->g_sections) {\n\t\treturn bin->g_sections;\n\t}\n\tif (!bin->shdr && bin->phdr) {\n\t\t//we don't give up search in phdr section\n\t\treturn get_sections_from_phdr (bin);\n\t}\n\tif (!bin->shdr) {\n\t\treturn NULL;\n\t}\n\tut32 count = bin->ehdr.e_shnum;\n\tif (!(ret = calloc ((count + 1), sizeof (RBinElfSection)))) {\n\t\treturn NULL;\n\t}\n\tfor (i = 0; i < count; i++) {\n\t\tret[i].offset = bin->shdr[i].sh_offset;\n\t\tret[i].size = bin->shdr[i].sh_size;\n\t\tret[i].align = bin->shdr[i].sh_addralign;\n\t\tret[i].flags = bin->shdr[i].sh_flags;\n\t\tret[i].link = bin->shdr[i].sh_link;\n\t\tret[i].info = bin->shdr[i].sh_info;\n\t\tret[i].type = bin->shdr[i].sh_type;\n\t\tif (is_bin_etrel (bin)) {\n\t\t\tret[i].rva = bin->baddr + bin->shdr[i].sh_offset;\n\t\t} else {\n\t\t\tret[i].rva = bin->shdr[i].sh_addr;\n\t\t}\n\n\t\tconst int SHNAME = (int)bin->shdr[i].sh_name;\n\t\tconst int SHSIZE = (int)bin->shstrtab_size;\n\t\tnidx = SHNAME;\n\t\tif (nidx < 0 || !bin->shstrtab_section || !bin->shstrtab_size || nidx > bin->shstrtab_size) {\n\t\t\tsnprintf (invalid_s, sizeof (invalid_s), \"invalid%d\", invalid_c);\n\t\t\tstrncpy (ret[i].name, invalid_s, sizeof (ret[i].name) - 1);\n\t\t\tinvalid_c++;\n\t\t} else if (bin->shstrtab && (SHNAME > 0) && (SHNAME < SHSIZE)) {\n\t\t\tstrncpy (ret[i].name, &bin->shstrtab[SHNAME], sizeof (ret[i].name) - 1);\n\t\t} else if (bin->shdr[i].sh_type == SHT_NULL) {\n\t\t\t//to follow the same behaviour as readelf\n\t\t\tret[i].name[0] = '\\0';\n\t\t} else {\n\t\t\tsnprintf (unknown_s, sizeof (unknown_s), \"unknown%d\", unknown_c);\n\t\t\tstrncpy (ret[i].name, unknown_s, sizeof (ret[i].name) - 1);\n\t\t\tunknown_c++;\n\t\t}\n\t\tret[i].name[ELF_STRING_LENGTH - 1] = '\\0';\n\t\tret[i].last = 0;\n\t}\n\tret[i].last = 1;\n\treturn ret;\n}\n\nstatic bool is_special_arm_symbol(ELFOBJ *bin, Elf_(Sym) *sym, const char *name) {\n\tif (name[0] != '$') {\n\t\treturn false;\n\t}\n\tswitch (name[1]) {\n\tcase 'a':\n\tcase 't':\n\tcase 'd':\n\tcase 'x':\n\t\treturn (name[2] == '\\0' || name[2] == '.') &&\n\t\t\tELF_ST_TYPE (sym->st_info) == STT_NOTYPE &&\n\t\t\tELF_ST_BIND (sym->st_info) == STB_LOCAL &&\n\t\t\tELF_ST_VISIBILITY (sym->st_info) == STV_DEFAULT;\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic bool is_special_symbol(ELFOBJ *bin, Elf_(Sym) *sym, const char *name) {\n\tswitch (bin->ehdr.e_machine) {\n\tcase EM_ARM:\n\tcase EM_AARCH64:\n\t\treturn is_special_arm_symbol (bin, sym, name);\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic const char *bind2str(Elf_(Sym) *sym) {\n\tswitch (ELF_ST_BIND (sym->st_info)) {\n\tcase STB_LOCAL: return R_BIN_BIND_LOCAL_STR;\n\tcase STB_GLOBAL: return R_BIN_BIND_GLOBAL_STR;\n\tcase STB_WEAK: return R_BIN_BIND_WEAK_STR;\n\tcase STB_NUM: return R_BIN_BIND_NUM_STR;\n\tcase STB_LOOS: return R_BIN_BIND_LOOS_STR;\n\tcase STB_HIOS: return R_BIN_BIND_HIOS_STR;\n\tcase STB_LOPROC: return R_BIN_BIND_LOPROC_STR;\n\tcase STB_HIPROC: return R_BIN_BIND_HIPROC_STR;\n\tdefault: return R_BIN_BIND_UNKNOWN_STR;\n\t}\n}\n\nstatic const char *type2str(ELFOBJ *bin, struct r_bin_elf_symbol_t *ret, Elf_(Sym) *sym) {\n\tif (bin && ret && is_special_symbol (bin, sym, ret->name)) {\n\t\treturn R_BIN_TYPE_SPECIAL_SYM_STR;\n\t}\n\tswitch (ELF_ST_TYPE (sym->st_info)) {\n\tcase STT_NOTYPE: return R_BIN_TYPE_NOTYPE_STR;\n\tcase STT_OBJECT: return R_BIN_TYPE_OBJECT_STR;\n\tcase STT_FUNC: return R_BIN_TYPE_FUNC_STR;\n\tcase STT_SECTION: return R_BIN_TYPE_SECTION_STR;\n\tcase STT_FILE: return R_BIN_TYPE_FILE_STR;\n\tcase STT_COMMON: return R_BIN_TYPE_COMMON_STR;\n\tcase STT_TLS: return R_BIN_TYPE_TLS_STR;\n\tcase STT_NUM: return R_BIN_TYPE_NUM_STR;\n\tcase STT_LOOS: return R_BIN_TYPE_LOOS_STR;\n\tcase STT_HIOS: return R_BIN_TYPE_HIOS_STR;\n\tcase STT_LOPROC: return R_BIN_TYPE_LOPROC_STR;\n\tcase STT_HIPROC: return R_BIN_TYPE_HIPROC_STR;\n\tdefault: return R_BIN_TYPE_UNKNOWN_STR;\n\t}\n}\n\nstatic void fill_symbol_bind_and_type(ELFOBJ *bin, struct r_bin_elf_symbol_t *ret, Elf_(Sym) *sym) {\n\tret->bind = bind2str (sym);\n\tret->type = type2str (bin, ret, sym);\n}\n\nstatic RBinElfSymbol* get_symbols_from_phdr(ELFOBJ *bin, int type) {\n\tElf_(Sym) *sym = NULL;\n\tElf_(Addr) addr_sym_table = 0;\n\tut8 s[sizeof (Elf_(Sym))] = {0};\n\tRBinElfSymbol *ret = NULL;\n\tint i, r, tsize, nsym, ret_ctr;\n\tut64 toffset = 0, tmp_offset;\n\tut32 size, sym_size = 0;\n\n\tif (!bin || !bin->phdr || !bin->ehdr.e_phnum) {\n\t\treturn NULL;\n\t}\n\n\tif (bin->dyn_info.dt_symtab == R_BIN_ELF_ADDR_MAX || !bin->dyn_info.dt_syment) {\n\t\treturn NULL;\n\t}\n\n\taddr_sym_table = Elf_(r_bin_elf_v2p) (bin, bin->dyn_info.dt_symtab);\n\tsym_size = bin->dyn_info.dt_syment;\n\tif (!sym_size) {\n\t\tgoto beach;\n\t}\n\n\t//since ELF doesn't specify the symbol table size we may read until the end of the buffer\n\tnsym = (bin->size - addr_sym_table) / sym_size;\n\tif (!UT32_MUL (&size, nsym, sizeof (Elf_ (Sym)))) {\n\t\tgoto beach;\n\t}\n\tif (size < 1) {\n\t\tgoto beach;\n\t}\n\tif (addr_sym_table > bin->size || addr_sym_table + size > bin->size) {\n\t\tgoto beach;\n\t}\n\tif (nsym < 1) {\n\t\treturn NULL;\n\t}\n\t// we reserve room for 4096 and grow as needed.\n\tsize_t capacity1 = 4096;\n\tsize_t capacity2 = 4096;\n\tsym = (Elf_(Sym)*) calloc (capacity1, sym_size);\n\tret = (RBinElfSymbol *) calloc (capacity2, sizeof (struct r_bin_elf_symbol_t));\n\tif (!sym || !ret) {\n\t\tgoto beach;\n\t}\n\tfor (i = 1, ret_ctr = 0; i < nsym; i++) {\n\t\tif (i >= capacity1) { // maybe grow\n\t\t\t// You take what you want, but you eat what you take.\n\t\t\tElf_(Sym)* temp_sym = (Elf_(Sym)*) realloc (sym, (size_t)(capacity1 * GROWTH_FACTOR) * sym_size);\n\t\t\tif (!temp_sym) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tsym = temp_sym;\n\t\t\tcapacity1 = (size_t)(capacity1 * GROWTH_FACTOR);\n\t\t}\n\t\tif (ret_ctr >= capacity2) { // maybe grow\n\t\t\tRBinElfSymbol *temp_ret = realloc (ret, (size_t)(capacity2 * GROWTH_FACTOR) * sizeof (struct r_bin_elf_symbol_t));\n\t\t\tif (!temp_ret) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tret = temp_ret;\n\t\t\tcapacity2 = (size_t)(capacity2 * GROWTH_FACTOR);\n\t\t}\n\t\t// read in one entry\n\t\tr = r_buf_read_at (bin->b, addr_sym_table + i * sizeof (Elf_ (Sym)), s, sizeof (Elf_ (Sym)));\n\t\tif (r < 1) {\n\t\t\tgoto beach;\n\t\t}\n\t\tint j = 0;\n#if R_BIN_ELF64\n\t\tsym[i].st_name = READ32 (s, j);\n\t\tsym[i].st_info = READ8 (s, j);\n\t\tsym[i].st_other = READ8 (s, j);\n\t\tsym[i].st_shndx = READ16 (s, j);\n\t\tsym[i].st_value = READ64 (s, j);\n\t\tsym[i].st_size = READ64 (s, j);\n#else\n\t\tsym[i].st_name = READ32 (s, j);\n\t\tsym[i].st_value = READ32 (s, j);\n\t\tsym[i].st_size = READ32 (s, j);\n\t\tsym[i].st_info = READ8 (s, j);\n\t\tsym[i].st_other = READ8 (s, j);\n\t\tsym[i].st_shndx = READ16 (s, j);\n#endif\n\t\tbool is_sht_null = false;\n\t\tbool is_vaddr = false;\n\t\t// zero symbol is always empty\n\t\t// Examine entry and maybe store\n\t\tif (type == R_BIN_ELF_IMPORT_SYMBOLS && sym[i].st_shndx == SHT_NULL) {\n\t\t\tif (sym[i].st_value) {\n\t\t\t\ttoffset = sym[i].st_value;\n\t\t\t} else if ((toffset = get_import_addr (bin, i)) == -1){\n\t\t\t\ttoffset = 0;\n\t\t\t}\n\t\t\ttsize = 16;\n\t\t} else if (type == R_BIN_ELF_ALL_SYMBOLS) {\n\t\t\ttsize = sym[i].st_size;\n\t\t\ttoffset = (ut64) sym[i].st_value;\n\t\t\tis_sht_null = sym[i].st_shndx == SHT_NULL;\n\t\t} else {\n\t\t\tcontinue;\n\t\t}\n\t\t// since we don't know the size of the sym table in this case,\n\t\t// let's stop at the first invalid entry\n\t\tif (!strcmp (bind2str (&sym[i]), R_BIN_BIND_UNKNOWN_STR) ||\n\t\t !strcmp (type2str (NULL, NULL, &sym[i]), R_BIN_TYPE_UNKNOWN_STR)) {\n\t\t\tgoto done;\n\t\t}\n\t\ttmp_offset = Elf_(r_bin_elf_v2p_new) (bin, toffset);\n\t\tif (tmp_offset == UT64_MAX) {\n\t\t\ttmp_offset = toffset;\n\t\t\tis_vaddr = true;\n\t\t}\n\t\tif (sym[i].st_name + 2 > bin->strtab_size) {\n\t\t\t// Since we are reading beyond the symbol table what's happening\n\t\t\t// is that some entry is trying to dereference the strtab beyond its capacity\n\t\t\t// is not a symbol so is the end\n\t\t\tgoto done;\n\t\t}\n\t\tret[ret_ctr].offset = tmp_offset;\n\t\tret[ret_ctr].size = tsize;\n\t\t{\n\t\t\tint rest = ELF_STRING_LENGTH - 1;\n\t\t\tint st_name = sym[i].st_name;\n\t\t\tint maxsize = R_MIN (bin->size, bin->strtab_size);\n\t\t\tif (st_name < 0 || st_name >= maxsize) {\n\t\t\t\tret[ret_ctr].name[0] = 0;\n\t\t\t} else {\n\t\t\t\tconst int len = __strnlen (bin->strtab + st_name, rest);\n\t\t\t\tmemcpy (ret[ret_ctr].name, &bin->strtab[st_name], len);\n\t\t\t}\n\t\t}\n\t\tret[ret_ctr].ordinal = i;\n\t\tret[ret_ctr].in_shdr = false;\n\t\tret[ret_ctr].name[ELF_STRING_LENGTH - 2] = '\\0';\n\t\tfill_symbol_bind_and_type (bin, &ret[ret_ctr], &sym[i]);\n\t\tret[ret_ctr].is_sht_null = is_sht_null;\n\t\tret[ret_ctr].is_vaddr = is_vaddr;\n\t\tret[ret_ctr].last = 0;\n\t\tret_ctr++;\n\t}\ndone:\n\t// Size everything down to only what is used\n\t{\n\t\tnsym = i > 0? i: 1;\n\t\tElf_(Sym) *temp_sym = (Elf_(Sym) *)realloc (sym, (size_t)(nsym * GROWTH_FACTOR) * sym_size);\n\t\tif (!temp_sym) {\n\t\t\tgoto beach;\n\t\t}\n\t\tsym = temp_sym;\n\t}\n\t{\n\t\tret_ctr = ret_ctr > 0? ret_ctr: 1;\n\t\tRBinElfSymbol *p = (RBinElfSymbol *)realloc (ret, (ret_ctr + 1) * sizeof (RBinElfSymbol));\n\t\tif (!p) {\n\t\t\tgoto beach;\n\t\t}\n\t\tret = p;\n\t}\n\tret[ret_ctr].last = 1;\n\tif (type == R_BIN_ELF_IMPORT_SYMBOLS && !bin->imports_by_ord_size) {\n\t\tbin->imports_by_ord_size = ret_ctr + 1;\n\t\tif (ret_ctr > 0) {\n\t\t\tbin->imports_by_ord = (RBinImport * *) calloc (ret_ctr + 1, sizeof (RBinImport*));\n\t\t} else {\n\t\t\tbin->imports_by_ord = NULL;\n\t\t}\n\t} else if (type == R_BIN_ELF_ALL_SYMBOLS && !bin->symbols_by_ord_size && ret_ctr) {\n\t\tbin->symbols_by_ord_size = ret_ctr + 1;\n\t\tif (ret_ctr > 0) {\n\t\t\tbin->symbols_by_ord = (RBinSymbol **) calloc (ret_ctr + 1, sizeof (RBinSymbol*));\n\t\t} else {\n\t\t\tbin->symbols_by_ord = NULL;\n\t\t}\n\t}\n\tfree (sym);\n\treturn ret;\nbeach:\n\tfree (sym);\n\tfree (ret);\n\treturn NULL;\n}\n\nstatic RBinElfSymbol *Elf_(r_bin_elf_get_phdr_symbols)(ELFOBJ *bin) {\n\tif (!bin) {\n\t\treturn NULL;\n\t}\n\tif (bin->phdr_symbols) {\n\t\treturn bin->phdr_symbols;\n\t}\n\tbin->phdr_symbols = get_symbols_from_phdr (bin, R_BIN_ELF_ALL_SYMBOLS);\n\treturn bin->phdr_symbols;\n}\n\nstatic RBinElfSymbol *Elf_(r_bin_elf_get_phdr_imports)(ELFOBJ *bin) {\n\tr_return_val_if_fail (bin, NULL);\n\tif (!bin->phdr_imports) {\n\t\tbin->phdr_imports = get_symbols_from_phdr (bin, R_BIN_ELF_IMPORT_SYMBOLS);\n\t}\n\treturn bin->phdr_imports;\n}\n\nstatic RBinElfSymbol *Elf_(get_phdr_symbols)(ELFOBJ *bin, int type) {\n\treturn (type != R_BIN_ELF_IMPORT_SYMBOLS)\n\t\t? Elf_(r_bin_elf_get_phdr_symbols) (bin)\n\t\t: Elf_(r_bin_elf_get_phdr_imports) (bin);\n}\n\nstatic int Elf_(fix_symbols)(ELFOBJ *bin, int nsym, int type, RBinElfSymbol **sym) {\n\tint count = 0;\n\tint result = -1;\n\tRBinElfSymbol *ret = *sym;\n\tRBinElfSymbol *phdr_symbols = Elf_(get_phdr_symbols) (bin, type);\n\tRBinElfSymbol *tmp, *p;\n\tHtUP *phd_offset_map = ht_up_new0 ();\n\tHtUP *phd_ordinal_map = ht_up_new0 ();\n\tif (phdr_symbols) {\n\t\tRBinElfSymbol *d = ret;\n\t\twhile (!d->last) {\n\t\t\tht_up_insert (phd_offset_map, d->offset, d);\n\t\t\tht_up_insert (phd_ordinal_map, d->ordinal, d);\n\t\t\td++;\n\t\t}\n\t\tp = phdr_symbols;\n\t\twhile (!p->last) {\n\t\t\t/* find match in phdr */\n\t\t\td = ht_up_find (phd_offset_map, p->offset, NULL);\n\t\t\tif (!d) {\n\t\t\t\td = ht_up_find (phd_ordinal_map, p->ordinal, NULL);\n\t\t\t}\n\t\t\tif (d) {\n\t\t\t\tp->in_shdr = true;\n\t\t\t\tif (*p->name && *d->name && r_str_startswith (d->name, \"$\")) {\n\t\t\t\t\tstrcpy (d->name, p->name);\n\t\t\t\t}\n\t\t\t}\n\t\t\tp++;\n\t\t}\n\t\tp = phdr_symbols;\n\t\twhile (!p->last) {\n\t\t\tif (!p->in_shdr) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tp++;\n\t\t}\n\t\t/*Take those symbols that are not present in the shdr but yes in phdr*/\n\t\t/*This should only should happen with fucked up binaries*/\n\t\tif (count > 0) {\n\t\t\t/*what happens if a shdr says it has only one symbol? we should look anyway into phdr*/\n\t\t\ttmp = (RBinElfSymbol*)realloc (ret, (nsym + count + 1) * sizeof (RBinElfSymbol));\n\t\t\tif (!tmp) {\n\t\t\t\tresult = -1;\n\t\t\t\tgoto done;\n\t\t\t}\n\t\t\tret = tmp;\n\t\t\tret[nsym--].last = 0;\n\t\t\tp = phdr_symbols;\n\t\t\twhile (!p->last) {\n\t\t\t\tif (!p->in_shdr) {\n\t\t\t\t\tmemcpy (&ret[++nsym], p, sizeof (RBinElfSymbol));\n\t\t\t\t}\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tret[nsym + 1].last = 1;\n\t\t}\n\t\t*sym = ret;\n\t\tresult = nsym + 1;\n\t\tgoto done;\n\t}\n\tresult = nsym;\ndone:\n\tht_up_free (phd_offset_map);\n\tht_up_free (phd_ordinal_map);\n\treturn result;\n}\n\nstatic bool is_section_local_sym(ELFOBJ *bin, Elf_(Sym) *sym) {\n\tif (sym->st_name != 0) {\n\t\treturn false;\n\t}\n\tif (ELF_ST_TYPE (sym->st_info) != STT_SECTION) {\n\t\treturn false;\n\t}\n\tif (ELF_ST_BIND (sym->st_info) != STB_LOCAL) {\n\t\treturn false;\n\t}\n\tif (!is_shidx_valid (bin, sym->st_shndx)) {\n\t\treturn false;\n\t}\n\tElf_(Word) sh_name = bin->shdr[sym->st_shndx].sh_name;\n\treturn bin->shstrtab && sh_name < bin->shstrtab_size;\n}\n\nstatic void setsymord(ELFOBJ* eobj, ut32 ord, RBinSymbol *ptr) {\n\tif (!eobj->symbols_by_ord || ord >= eobj->symbols_by_ord_size) {\n\t\treturn;\n\t}\n\tr_bin_symbol_free (eobj->symbols_by_ord[ord]);\n\teobj->symbols_by_ord[ord] = ptr;\n}\n\nstatic void _set_arm_thumb_bits(struct Elf_(r_bin_elf_obj_t) *bin, RBinSymbol **sym) {\n\tint bin_bits = Elf_(r_bin_elf_get_bits) (bin);\n\tRBinSymbol *ptr = *sym;\n\tint len = strlen (ptr->name);\n\tif (ptr->name[0] == '$' && (len >= 2 && !ptr->name[2])) {\n\t\tswitch (ptr->name[1]) {\n\t\tcase 'a' : //arm\n\t\t\tptr->bits = 32;\n\t\t\tbreak;\n\t\tcase 't': //thumb\n\t\t\tptr->bits = 16;\n\t\t\tif (ptr->vaddr & 1) {\n\t\t\t\tptr->vaddr--;\n\t\t\t}\n\t\t\tif (ptr->paddr & 1) {\n\t\t\t\tptr->paddr--;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase 'd': //data\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tgoto arm_symbol;\n\t\t}\n\t} else {\narm_symbol:\n\t\tptr->bits = bin_bits;\n\t\tif (bin_bits != 64) {\n\t\t\tptr->bits = 32;\n\t\t\tif (ptr->paddr != UT64_MAX) {\n\t\t\t\tif (ptr->vaddr & 1) {\n\t\t\t\t\tptr->vaddr--;\n\t\t\t\t\tptr->bits = 16;\n\t\t\t\t}\n\t\t\t\tif (ptr->paddr & 1) {\n\t\t\t\t\tptr->paddr--;\n\t\t\t\t\tptr->bits = 16;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nRBinSymbol *Elf_(_r_bin_elf_convert_symbol)(struct Elf_(r_bin_elf_obj_t) *bin,\n\t\t\t\t\t struct r_bin_elf_symbol_t *symbol,\n\t\t\t\t\t const char *namefmt) {\n\tut64 paddr, vaddr;\n\tRBinSymbol *ptr = NULL;\n\tif (symbol->is_vaddr) {\n\t\tpaddr = UT64_MAX;\n\t\tvaddr = symbol->offset;\n\t} else {\n\t\tpaddr = symbol->offset;\n\t\tvaddr = Elf_(r_bin_elf_p2v_new) (bin, paddr);\n\t}\n\n\tif (!(ptr = R_NEW0 (RBinSymbol))) {\n\t\treturn NULL;\n\t}\n\tptr->name = symbol->name[0] ? r_str_newf (namefmt, &symbol->name[0]) : strdup (\"\");\n\tptr->forwarder = \"NONE\";\n\tptr->bind = symbol->bind;\n\tptr->type = symbol->type;\n\tptr->is_imported = symbol->is_imported;\n\tptr->paddr = paddr;\n\tptr->vaddr = vaddr;\n\tptr->size = symbol->size;\n\tptr->ordinal = symbol->ordinal;\n\t// detect thumb\n\tif (bin->ehdr.e_machine == EM_ARM && *ptr->name) {\n\t\t_set_arm_thumb_bits (bin, &ptr);\n\t}\n\n\treturn ptr;\n}\n\nstatic ut32 hashRBinElfSymbol(const void *obj) {\n\tconst RBinElfSymbol *symbol = (const RBinElfSymbol *)obj;\n\tif (!symbol || !*symbol->name) {\n\t\treturn 0;\n\t}\n\tint hash = sdb_hash (symbol->name);\n\thash ^= sdb_hash (symbol->type);\n\thash ^= (symbol->offset >> 32);\n\thash ^= (symbol->offset & 0xffffffff);\n\treturn hash;\n}\n\nstatic int cmp_RBinElfSymbol(const RBinElfSymbol *a, const RBinElfSymbol *b) {\n\tif (a->offset != b->offset) {\n\t\treturn 1;\n\t}\n\tint result = strcmp (a->name, b->name);\n\tif (result != 0) {\n\t\treturn result;\n\t}\n\treturn strcmp (a->type, b->type);\n}\n\nstatic RBinElfSymbol* parse_gnu_debugdata(ELFOBJ *bin, size_t *ret_size) {\n\tif (ret_size) {\n\t\t*ret_size = 0;\n\t}\n\tif (bin->g_sections) {\n\t\tsize_t i;\n\t\tfor (i = 0; !bin->g_sections[i].last; i++) {\n\t\t\tif (!strcmp (bin->g_sections[i].name, \".gnu_debugdata\")) {\n\t\t\t\tut64 addr = bin->g_sections[i].offset;\n\t\t\t\tut64 size = bin->g_sections[i].size;\n\t\t\t\tif (size < 10) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tut8 *data = malloc (size + 1);\n\t\t\t\tif (r_buf_read_at (bin->b, addr, data, size) == -1) {\n\t\t\t\t\teprintf (\"Cannot read%c\\n\", 10);\n\t\t\t\t}\n\t\t\t\tsize_t osize;\n\t\t\t\tut8 *odata = r_sys_unxz (data, size, &osize);\n\t\t\t\tif (odata) {\n\t\t\t\t\tRBuffer *newelf = r_buf_new_with_pointers (odata, osize, false);\n\t\t\t\t\tELFOBJ* newobj = Elf_(r_bin_elf_new_buf) (newelf, false);\n\t\t\t\t\tRBinElfSymbol *symbol = NULL;\n\t\t\t\t\tif (newobj) {\n\t\t\t\t\t\tsymbol = Elf_(r_bin_elf_get_symbols) (newobj);\n\t\t\t\t\t\tnewobj->g_symbols = NULL;\n\t\t\t\t\t\tElf_(r_bin_elf_free)(newobj);\n\t\t\t\t\t}\n\t\t\t\t\tr_buf_free (newelf);\n\t\t\t\t\tfree (odata);\n\t\t\t\t\tif (ret_size) {\n\t\t\t\t\t\t*ret_size = i;\n\t\t\t\t\t}\n\t\t\t\t\tfree (data);\n\t\t\t\t\treturn symbol;\n\t\t\t\t}\n\t\t\t\tfree (data);\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t}\n\t}\n\treturn NULL;\n}\n\n// TODO: return RList .. or run a callback with that symbol constructed, so we don't have to do it twice\nstatic RBinElfSymbol* Elf_(_r_bin_elf_get_symbols_imports)(ELFOBJ *bin, int type) {\n\tut32 shdr_size;\n\tint tsize, nsym, ret_ctr = 0, i, j, r, k, newsize;\n\tut64 toffset;\n\tut32 size = 0;\n\tRBinElfSymbol *ret = NULL, *import_ret = NULL;\n\tRBinSymbol *import_sym_ptr = NULL;\n\tsize_t ret_size = 0, prev_ret_size = 0, import_ret_ctr = 0;\n\tElf_(Shdr) *strtab_section = NULL;\n\tElf_(Sym) *sym = NULL;\n\tut8 s[sizeof (Elf_(Sym))] = {0};\n\tchar *strtab = NULL;\n\tHtPP *symbol_map = NULL;\n\tHtPPOptions symbol_map_options = {\n\t\t.cmp = (HtPPListComparator)cmp_RBinElfSymbol,\n\t\t.hashfn = hashRBinElfSymbol,\n\t\t.dupkey = NULL,\n\t\t.calcsizeK = NULL,\n\t\t.calcsizeV = NULL,\n\t\t.freefn = NULL,\n\t\t.elem_size = sizeof (HtPPKv),\n\t};\n\n\tif (!bin || !bin->shdr || !bin->ehdr.e_shnum || bin->ehdr.e_shnum == 0xffff) {\n\t\treturn Elf_(get_phdr_symbols) (bin, type);\n\t}\n\tif (!UT32_MUL (&shdr_size, bin->ehdr.e_shnum, sizeof (Elf_(Shdr)))) {\n\t\treturn NULL;\n\t}\n\tif (shdr_size + 8 > bin->size) {\n\t\treturn NULL;\n\t}\n\tRBinElfSymbol *dbgsyms = parse_gnu_debugdata (bin, &ret_size);\n\tif (dbgsyms) {\n\t\tret = dbgsyms;\n\t\tret_ctr = ret_size;\n\t} else {\n\t\tret_ctr = 0;\n\t\tret_size = 0;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tif (((type & R_BIN_ELF_SYMTAB_SYMBOLS) && bin->shdr[i].sh_type == SHT_SYMTAB) ||\n\t\t\t((type & R_BIN_ELF_DYNSYM_SYMBOLS) && bin->shdr[i].sh_type == SHT_DYNSYM)) {\n\t\t\tif (bin->shdr[i].sh_link < 1) {\n\t\t\t\t/* oops. fix out of range pointers */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t// hack to avoid asan cry\n\t\t\tif ((bin->shdr[i].sh_link * sizeof (Elf_(Shdr))) >= shdr_size) {\n\t\t\t\t/* oops. fix out of range pointers */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tstrtab_section = &bin->shdr[bin->shdr[i].sh_link];\n\t\t\tif (strtab_section->sh_size > ST32_MAX || strtab_section->sh_size+8 > bin->size) {\n\t\t\t\tR_LOG_ERROR (\"size (syms strtab)\");\n\t\t\t\tfree (ret);\n\t\t\t\tfree (strtab);\n\t\t\t\treturn NULL;\n\t\t\t}\n\t\t\tif (!strtab) {\n\t\t\t\tif (!(strtab = (char *)calloc (1, 8 + strtab_section->sh_size))) {\n\t\t\t\t\tR_LOG_ERROR (\"malloc (syms strtab)\");\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\t\t\t\tif (strtab_section->sh_offset > bin->size ||\n\t\t\t\t\t\tstrtab_section->sh_offset + strtab_section->sh_size > bin->size) {\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\t\t\t\tif (r_buf_read_at (bin->b, strtab_section->sh_offset,\n\t\t\t\t\t\t\t(ut8*)strtab, strtab_section->sh_size) == -1) {\n\t\t\t\t\tR_LOG_ERROR (\"read (syms strtab)\");\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tnewsize = 1 + bin->shdr[i].sh_size;\n\t\t\tif (newsize < 0 || newsize > bin->size) {\n\t\t\t\tR_LOG_ERROR (\"invalid shdr %d size\", i);\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tnsym = (int)(bin->shdr[i].sh_size / sizeof (Elf_(Sym)));\n\t\t\tif (nsym < 0) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\t{\n\t\t\t\tut64 sh_begin = bin->shdr[i].sh_offset;\n\t\t\t\tut64 sh_end = sh_begin + bin->shdr[i].sh_size;\n\t\t\t\tif (sh_begin > bin->size) {\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\t\t\t\tif (sh_end > bin->size) {\n\t\t\t\t\tst64 newshsize = bin->size - sh_begin;\n\t\t\t\t\tnsym = (int)(newshsize / sizeof (Elf_(Sym)));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!(sym = (Elf_(Sym) *)calloc (nsym, sizeof (Elf_(Sym))))) {\n\t\t\t\tR_LOG_ERROR (\"calloc (syms)\");\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (!UT32_MUL (&size, nsym, sizeof (Elf_(Sym)))) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (size < 1 || size > bin->size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset > bin->size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (bin->shdr[i].sh_offset + size > bin->size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tfor (j = 0; j < nsym; j++) {\n\t\t\t\tint k = 0;\n\t\t\t\tr = r_buf_read_at (bin->b, bin->shdr[i].sh_offset + j * sizeof (Elf_(Sym)), s, sizeof (Elf_(Sym)));\n\t\t\t\tif (r < 1) {\n\t\t\t\t\tR_LOG_ERROR (\"read (sym)\");\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n#if R_BIN_ELF64\n\t\t\t\tsym[j].st_name = READ32 (s, k);\n\t\t\t\tsym[j].st_info = READ8 (s, k);\n\t\t\t\tsym[j].st_other = READ8 (s, k);\n\t\t\t\tsym[j].st_shndx = READ16 (s, k);\n\t\t\t\tsym[j].st_value = READ64 (s, k);\n\t\t\t\tsym[j].st_size = READ64 (s, k);\n#else\n\t\t\t\tsym[j].st_name = READ32 (s, k);\n\t\t\t\tsym[j].st_value = READ32 (s, k);\n\t\t\t\tsym[j].st_size = READ32 (s, k);\n\t\t\t\tsym[j].st_info = READ8 (s, k);\n\t\t\t\tsym[j].st_other = READ8 (s, k);\n\t\t\t\tsym[j].st_shndx = READ16 (s, k);\n#endif\n\t\t\t}\n\t\t\tvoid *rett = realloc (ret, (ret_size + nsym) * sizeof (RBinElfSymbol));\n\t\t\tif (!rett) {\n\t\t\t\tR_LOG_ERROR (\"Cannot allocate %d symbols.\", (int)(nsym + ret_size));\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tret = rett;\n\t\t\tmemset (ret + ret_size, 0, nsym * sizeof (RBinElfSymbol));\n\t\t\tprev_ret_size = ret_size;\n\t\t\tret_size += nsym;\n\t\t\tsymbol_map = ht_pp_new_opt (&symbol_map_options);\n\t\t\tfor (k = 0; k < prev_ret_size; k++) {\n\t\t\t\tif (ret[k].name[0]) {\n\t\t\t\t\tht_pp_insert (symbol_map, ret + k, ret + k);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (k = 1; k < nsym; k++) {\n\t\t\t\tbool is_sht_null = false;\n\t\t\t\tbool is_vaddr = false;\n\t\t\t\tbool is_imported = false;\n\t\t\t\tif (type == R_BIN_ELF_IMPORT_SYMBOLS) {\n\t\t\t\t\tif (sym[k].st_value) {\n\t\t\t\t\t\ttoffset = sym[k].st_value;\n\t\t\t\t\t} else if ((toffset = get_import_addr (bin, k)) == -1) {\n\t\t\t\t\t\ttoffset = 0;\n\t\t\t\t\t}\n\t\t\t\t\ttsize = 16;\n\t\t\t\t\tis_imported = sym[k].st_shndx == STN_UNDEF;\n\t\t\t\t} else {\n\t\t\t\t\ttsize = sym[k].st_size;\n\t\t\t\t\ttoffset = (ut64)sym[k].st_value;\n\t\t\t\t\tis_sht_null = sym[k].st_shndx == SHT_NULL;\n\t\t\t\t}\n\t\t\t\tif (is_bin_etrel (bin)) {\n\t\t\t\t\tif (sym[k].st_shndx < bin->ehdr.e_shnum) {\n\t\t\t\t\t\tret[ret_ctr].offset = sym[k].st_value + bin->shdr[sym[k].st_shndx].sh_offset;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tret[ret_ctr].offset = Elf_(r_bin_elf_v2p_new) (bin, toffset);\n\t\t\t\t\tif (ret[ret_ctr].offset == UT64_MAX) {\n\t\t\t\t\t\tret[ret_ctr].offset = toffset;\n\t\t\t\t\t\tis_vaddr = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tret[ret_ctr].size = tsize;\n\t\t\t\tif (sym[k].st_name + 1 > strtab_section->sh_size) {\n\t\t\t\t\tR_LOG_DEBUG (\"index out of strtab range (%\"PFMT64d\" / %\"PFMT64d\")\\n\",\n\t\t\t\t\t\t(ut64)sym[k].st_name, (ut64)strtab_section->sh_size);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t{\n\t\t\t\t\tint st_name = sym[k].st_name;\n\t\t\t\t\tint maxsize = R_MIN (r_buf_size (bin->b), strtab_section->sh_size);\n\t\t\t\t\tif (is_section_local_sym (bin, &sym[k])) {\n\t\t\t\t\t\tconst char *shname = &bin->shstrtab[bin->shdr[sym[k].st_shndx].sh_name];\n\t\t\t\t\t\tr_str_ncpy (ret[ret_ctr].name, shname, ELF_STRING_LENGTH - 1);\n\t\t\t\t\t} else if (st_name <= 0 || st_name >= maxsize) {\n\t\t\t\t\t\tret[ret_ctr].name[0] = 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tr_str_ncpy (ret[ret_ctr].name, &strtab[st_name], ELF_STRING_LENGTH - 1);\n\t\t\t\t\t\tret[ret_ctr].type = type2str (bin, &ret[ret_ctr], &sym[k]);\n\n\t\t\t\t\t\tif (ht_pp_find (symbol_map, &ret[ret_ctr], NULL)) {\n\t\t\t\t\t\t\tmemset (ret + ret_ctr, 0, sizeof (RBinElfSymbol));\n\t\t\t\t\t\t\tcontinue;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tret[ret_ctr].ordinal = k;\n\t\t\t\tret[ret_ctr].name[ELF_STRING_LENGTH - 1] = '\\0';\n\t\t\t\tfill_symbol_bind_and_type (bin, &ret[ret_ctr], &sym[k]);\n\t\t\t\tret[ret_ctr].is_sht_null = is_sht_null;\n\t\t\t\tret[ret_ctr].is_vaddr = is_vaddr;\n\t\t\t\tret[ret_ctr].last = 0;\n\t\t\t\tret[ret_ctr].is_imported = is_imported;\n\t\t\t\tret_ctr++;\n\t\t\t\tif (type == R_BIN_ELF_IMPORT_SYMBOLS && is_imported) {\n\t\t\t\t\timport_ret_ctr++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tR_FREE (strtab);\n\t\t\tR_FREE (sym);\n\t\t\tht_pp_free (symbol_map);\n\t\t\tsymbol_map = NULL;\n\t\t\tif (type == R_BIN_ELF_IMPORT_SYMBOLS) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (!ret) {\n\t\treturn Elf_(get_phdr_symbols) (bin, type);\n\t}\n\tret[ret_ctr].last = 1; // ugly dirty hack :D\n\tint max = -1;\n\tRBinElfSymbol *aux = NULL;\n\tnsym = Elf_(fix_symbols) (bin, ret_ctr, type, &ret);\n\tif (nsym == -1) {\n\t\tgoto beach;\n\t}\n\n\t// Elf_(fix_symbols) may find additional symbols, some of which could be\n\t// imported symbols. Let's reserve additional space for them.\n\tr_warn_if_fail (nsym >= ret_ctr);\n\timport_ret_ctr += nsym - ret_ctr;\n\n\taux = ret;\n\twhile (!aux->last) {\n\t\tif ((int)aux->ordinal > max) {\n\t\t\tmax = aux->ordinal;\n\t\t}\n\t\taux++;\n\t}\n\tnsym = max;\n\tif (type == R_BIN_ELF_IMPORT_SYMBOLS) {\n\t\tR_FREE (bin->imports_by_ord);\n\t\tbin->imports_by_ord_size = nsym + 1;\n\t\tbin->imports_by_ord = (RBinImport**)calloc (R_MAX (1, nsym + 1), sizeof (RBinImport*));\n\t\tR_FREE (bin->symbols_by_ord);\n\t\tbin->symbols_by_ord_size = nsym + 1;\n\t\tbin->symbols_by_ord = (RBinSymbol**)calloc (R_MAX (1, nsym + 1), sizeof (RBinSymbol*));\n\t\timport_ret = calloc (import_ret_ctr + 1, sizeof (RBinElfSymbol));\n\t\tif (!import_ret) {\n\t\t\tR_LOG_DEBUG (\"Cannot allocate %d symbols\", nsym);\n\t\t\tgoto beach;\n\t\t}\n\t\timport_ret_ctr = 0;\n\t\ti = -1;\n\t\twhile (!ret[++i].last) {\n\t\t\tif (!(import_sym_ptr = Elf_(_r_bin_elf_convert_symbol) (bin, &ret[i], \"%s\"))) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tsetsymord (bin, import_sym_ptr->ordinal, import_sym_ptr);\n\t\t\tif (ret[i].is_imported) {\n\t\t\t\tmemcpy (&import_ret[import_ret_ctr], &ret[i], sizeof (RBinElfSymbol));\n\t\t\t\t++import_ret_ctr;\n\t\t\t}\n\t\t}\n\t\timport_ret[import_ret_ctr].last = 1;\n\t\tR_FREE (ret);\n\t\treturn import_ret;\n\t}\n\treturn ret;\nbeach:\n\tfree (ret);\n\tfree (sym);\n\tfree (strtab);\n\tht_pp_free (symbol_map);\n\treturn NULL;\n}\n\nRBinElfSymbol *Elf_(r_bin_elf_get_symbols)(ELFOBJ *bin) {\n\tif (!bin->g_symbols) {\n\t\tbin->g_symbols = Elf_(_r_bin_elf_get_symbols_imports) (bin, R_BIN_ELF_ALL_SYMBOLS);\n\t}\n\treturn bin->g_symbols;\n}\n\nRBinElfSymbol *Elf_(r_bin_elf_get_imports)(ELFOBJ *bin) {\n\tif (!bin->g_imports) {\n\t\tbin->g_imports = Elf_(_r_bin_elf_get_symbols_imports) (bin, R_BIN_ELF_IMPORT_SYMBOLS);\n\t}\n\treturn bin->g_imports;\n}\n\nRBinElfField* Elf_(r_bin_elf_get_fields)(ELFOBJ *bin) {\n\tRBinElfField *ret = NULL;\n\tint i = 0, j;\n\tif (!bin || !(ret = calloc ((bin->ehdr.e_phnum + 3 + 1), sizeof (RBinElfField)))) {\n\t\treturn NULL;\n\t}\n\tstrncpy (ret[i].name, \"ehdr\", ELF_STRING_LENGTH);\n\tret[i].offset = 0;\n\tret[i++].last = 0;\n\tstrncpy (ret[i].name, \"shoff\", ELF_STRING_LENGTH);\n\tret[i].offset = bin->ehdr.e_shoff;\n\tret[i++].last = 0;\n\tstrncpy (ret[i].name, \"phoff\", ELF_STRING_LENGTH);\n\tret[i].offset = bin->ehdr.e_phoff;\n\tret[i++].last = 0;\n\tfor (j = 0; bin->phdr && j < bin->ehdr.e_phnum; i++, j++) {\n\t\tsnprintf (ret[i].name, ELF_STRING_LENGTH, \"phdr_%i\", j);\n\t\tret[i].offset = bin->phdr[j].p_offset;\n\t\tret[i].last = 0;\n\t}\n\tret[i].last = 1;\n\treturn ret;\n}\n\nvoid Elf_(r_bin_elf_free)(ELFOBJ* bin) {\n\tif (!bin) {\n\t\treturn;\n\t}\n\tfree (bin->phdr);\n\tfree (bin->shdr);\n\tfree (bin->strtab);\n\tfree (bin->shstrtab);\n\tfree (bin->dynstr);\n\tr_vector_fini (&bin->dyn_info.dt_needed);\n\t//free (bin->strtab_section);\n\tsize_t i;\n\tif (bin->imports_by_ord) {\n\t\tfor (i = 0; iimports_by_ord_size; i++) {\n\t\t\tfree (bin->imports_by_ord[i]);\n\t\t}\n\t\tfree (bin->imports_by_ord);\n\t}\n\tif (bin->symbols_by_ord) {\n\t\tfor (i = 0; isymbols_by_ord_size; i++) {\n\t\t\tr_bin_symbol_free (bin->symbols_by_ord[i]);\n\t\t}\n\t\tfree (bin->symbols_by_ord);\n\t}\n\tr_buf_free (bin->b);\n\tif (bin->g_symbols != bin->phdr_symbols) {\n\t\tR_FREE (bin->phdr_symbols);\n\t}\n\tif (bin->g_imports != bin->phdr_imports) {\n\t\tR_FREE (bin->phdr_imports);\n\t}\n\tR_FREE (bin->g_sections);\n\tR_FREE (bin->g_symbols);\n\tR_FREE (bin->g_imports);\n\tR_FREE (bin->g_relocs);\n\tht_up_free (bin->rel_cache);\n\tbin->rel_cache = NULL;\n\tsdb_free (bin->kv);\n\tfree (bin);\n}\n\nELFOBJ* Elf_(r_bin_elf_new_buf)(RBuffer *buf, bool verbose) {\n\tELFOBJ *bin = R_NEW0 (ELFOBJ);\n\tif (bin) {\n\t\tbin->kv = sdb_new0 ();\n\t\tbin->size = r_buf_size (buf);\n\t\tbin->verbose = verbose;\n\t\tbin->b = r_buf_ref (buf);\n\t\tif (!elf_init (bin)) {\n\t\t\tElf_(r_bin_elf_free) (bin);\n\t\t\treturn NULL;\n\t\t}\n\t}\n\treturn bin;\n}\n\nstatic int is_in_pphdr(Elf_(Phdr) *p, ut64 addr) {\n\treturn addr >= p->p_offset && addr < p->p_offset + p->p_filesz;\n}\n\nstatic int is_in_vphdr(Elf_(Phdr) *p, ut64 addr) {\n\treturn addr >= p->p_vaddr && addr < p->p_vaddr + p->p_filesz;\n}\n\n/* Deprecated temporarily. Use r_bin_elf_p2v_new in new code for now. */\nut64 Elf_(r_bin_elf_p2v) (ELFOBJ *bin, ut64 paddr) {\n\tsize_t i;\n\n\tr_return_val_if_fail (bin, 0);\n\tif (!bin->phdr) {\n\t\tif (is_bin_etrel (bin)) {\n\t\t\treturn bin->baddr + paddr;\n\t\t}\n\t\treturn paddr;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tElf_(Phdr) *p = &bin->phdr[i];\n\t\tif (p->p_type == PT_LOAD && is_in_pphdr (p, paddr)) {\n\t\t\tif (!p->p_vaddr && !p->p_offset) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn p->p_vaddr + paddr - p->p_offset;\n\t\t}\n\t}\n\n\treturn paddr;\n}\n\n/* Deprecated temporarily. Use r_bin_elf_v2p_new in new code for now. */\nut64 Elf_(r_bin_elf_v2p)(ELFOBJ *bin, ut64 vaddr) {\n\tr_return_val_if_fail (bin, 0); // UT64_MAX or vaddr?\n\t// r_return_val_if_fail (bin, UT64_MAX);\n\tif (!bin->phdr) {\n\t\tif (is_bin_etrel (bin)) {\n\t\t\treturn vaddr - bin->baddr;\n\t\t}\n\t\treturn vaddr;\n\t}\n\n\tsize_t i;\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tElf_(Phdr) *p = &bin->phdr[i];\n\t\tif (p->p_type == PT_LOAD && is_in_vphdr (p, vaddr)) {\n\t\t\tif (!p->p_offset && !p->p_vaddr) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn p->p_offset + vaddr - p->p_vaddr;\n\t\t}\n\t}\n\treturn vaddr;\n}\n\n/* converts a physical address to the virtual address, looking\n * at the program headers in the binary bin */\nut64 Elf_(r_bin_elf_p2v_new) (ELFOBJ *bin, ut64 paddr) {\n\tsize_t i;\n\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tif (!bin->phdr) {\n\t\tif (is_bin_etrel (bin)) {\n\t\t\treturn bin->baddr + paddr;\n\t\t}\n\t\treturn UT64_MAX;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tElf_(Phdr) *p = &bin->phdr[i];\n\t\tif (p->p_type == PT_LOAD && is_in_pphdr (p, paddr)) {\n\t\t\treturn p->p_vaddr + paddr - p->p_offset;\n\t\t}\n\t}\n\n\treturn UT64_MAX;\n}\n\n/* converts a virtual address to the relative physical address, looking\n * at the program headers in the binary bin */\nut64 Elf_(r_bin_elf_v2p_new) (ELFOBJ *bin, ut64 vaddr) {\n\tsize_t i;\n\n\tr_return_val_if_fail (bin, UT64_MAX);\n\tif (!bin->phdr) {\n\t\tif (is_bin_etrel (bin)) {\n\t\t\treturn vaddr - bin->baddr;\n\t\t}\n\t\treturn UT64_MAX;\n\t}\n\tfor (i = 0; i < bin->ehdr.e_phnum; i++) {\n\t\tElf_(Phdr) *p = &bin->phdr[i];\n\t\tif (p->p_type == PT_LOAD && is_in_vphdr (p, vaddr)) {\n\t\t\treturn p->p_offset + vaddr - p->p_vaddr;\n\t\t}\n\t}\n\treturn UT64_MAX;\n}\n\nstatic bool get_nt_file_maps(ELFOBJ *bin, RList *core_maps) {\n\tut16 ph, ph_num = bin->ehdr.e_phnum;\n\n\tfor (ph = 0; ph < ph_num; ph++) {\n\t\tElf_(Phdr) *p = &bin->phdr[ph];\n\t\tif (p->p_type == PT_NOTE) {\n\t\t\tint bits = Elf_(r_bin_elf_get_bits)(bin);\n\t\t\tint elf_nhdr_size = (bits == 64) ? sizeof (Elf64_Nhdr) : sizeof (Elf32_Nhdr);\n\t\t\tint size_of = (bits == 64) ? sizeof (ut64) : sizeof (ut32);\n\t\t\tvoid *elf_nhdr = calloc (elf_nhdr_size, 1);\n\t\t\tut64 offset = 0;\n\t\t\tbool found = false;\n\n\t\t\twhile (!found) {\n\t\t\t\tint ret;\n\t\t\t\tut32 n_descsz, n_namesz, n_type;\n\t\t\t\tret = r_buf_read_at (bin->b,\n\t\t\t\t\t\tbin->phdr[ph].p_offset + offset,\n\t\t\t\t\t\telf_nhdr, elf_nhdr_size);\n\t\t\t\tif (ret != elf_nhdr_size) {\n\t\t\t\t\teprintf (\"Cannot read more NOTES header from CORE\\n\");\n\t\t\t\t\tfree (elf_nhdr);\n\t\t\t\t\tgoto fail;\n\t\t\t\t}\n\t\t\t\tif (bits == 64) {\n\t\t\t\t\tn_descsz = round_up (((Elf64_Nhdr *)elf_nhdr)->n_descsz);\n\t\t\t\t\tn_namesz = round_up (((Elf64_Nhdr *)elf_nhdr)->n_namesz);\n\t\t\t\t\tn_type = ((Elf64_Nhdr *)elf_nhdr)->n_type;\n\t\t\t\t} else {\n\t\t\t\t\tn_descsz = round_up (((Elf32_Nhdr *)elf_nhdr)->n_descsz);\n\t\t\t\t\tn_namesz = round_up (((Elf32_Nhdr *)elf_nhdr)->n_namesz);\n\t\t\t\t\tn_type = ((Elf32_Nhdr *)elf_nhdr)->n_type;\n\t\t\t\t}\n\n\t\t\t\tif (n_type == NT_FILE) {\n\t\t\t\t\tfound = true;\n\t\t\t\t\toffset += elf_nhdr_size + n_namesz;\n\t\t\t\t\tfree (elf_nhdr);\n\t\t\t\t} else {\n\t\t\t\t\toffset += elf_nhdr_size + n_descsz + n_namesz;\n\t\t\t\t}\n\t\t\t}\n\t\t\tut64 i = bin->phdr[ph].p_offset + offset;\n\t\t\tut64 n_maps;\n\t\t\tif (bits == 64) {\n\t\t\t\tn_maps = BREAD64 (bin->b, i);\n\t\t\t\t(void)BREAD64 (bin->b, i);\n\t\t\t} else {\n\t\t\t\tn_maps = BREAD32 (bin->b, i);\n\t\t\t\t(void)BREAD32 (bin->b, i);\n\t\t\t}\n\t\t\tut64 jump = ((size_of * 3) * n_maps) + i;\n\t\t\tint len_str = 0;\n\t\t\twhile (n_maps > 0) {\n\t\t\t\tut64 addr;\n\t\t\t\tif (bits == 64) {\n\t\t\t\t\taddr = BREAD64 (bin->b, i);\n\t\t\t\t} else {\n\t\t\t\t\taddr = BREAD32 (bin->b, i);\n\t\t\t\t}\n\t\t\t\tif (addr == UT64_MAX) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tchar str[512] = {0};\n\t\t\t\tr_buf_read_at (bin->b, jump + len_str, (ut8*)str, sizeof (str) - 1);\n\t\t\t\tstr[sizeof (str) - 1] = 0; // null terminate string\n\t\t\t\tRListIter *iter;\n\t\t\t\tRBinMap *p;\n\t\t\t\tr_list_foreach (core_maps, iter, p) {\n\t\t\t\t\tif (p->addr == addr) {\n\t\t\t\t\t\tp->file = strdup (str);\n\t\t\t\t\t }\n\t\t\t\t}\n\t\t\t\tlen_str += strlen (str) + 1;\n\t\t\t\tn_maps--;\n\t\t\t\ti += (size_of * 2);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\nfail:\n\treturn false;\n}\n\nstatic void r_bin_elf_map_free(RBinMap *map) {\n\tif (map) {\n\t\tfree (map->file);\n\t\tfree (map);\n\t}\n}\n\nRList *Elf_(r_bin_elf_get_maps)(ELFOBJ *bin) {\n\tut16 ph, ph_num = bin->ehdr.e_phnum; //Skip PT_NOTE\n\tif (!bin->phdr) {\n\t\treturn NULL;\n\t}\n\tRList *maps = r_list_newf ((RListFree)r_bin_elf_map_free);\n\tfor (ph = 0; ph < ph_num; ph++) {\n\t\tElf_(Phdr) *p = &bin->phdr[ph];\n\t\tif (p->p_type == PT_LOAD) {\n\t\t\tRBinMap *map = R_NEW0 (RBinMap);\n\t\t\tif (map) {\n\t\t\t\tmap->addr = p->p_vaddr;\n\t\t\t\tmap->size = p->p_memsz;\n\t\t\t\tmap->perms = p->p_flags;\n\t\t\t\tmap->offset = p->p_offset;\n\t\t\t\tmap->file = NULL;\n\t\t\t\tr_list_append (maps, map);\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!r_list_empty (maps)) {\n\t\tif (!get_nt_file_maps (bin, maps)) {\n\t\t\teprintf (\"Could not retrieve the names of all maps from NT_FILE\\n\");\n\t\t}\n\t}\n\n\treturn maps;\n}\n\nchar *Elf_(r_bin_elf_compiler)(ELFOBJ *bin) {\n\tRBinElfSection *section = get_section_by_name (bin, \".comment\");\n\tif (!section) {\n\t\treturn NULL;\n\t}\n\tut64 off = section->offset;\n\tut32 sz = R_MIN (section->size, 128);\n\tif (sz < 1) {\n\t\treturn NULL;\n\t}\n\tchar *buf = malloc (sz + 1);\n\tif (!buf) {\n\t\treturn NULL;\n\t}\n\tif (r_buf_read_at (bin->b, off, (ut8*)buf, sz) < 1) {\n\t\tfree (buf);\n\t\treturn NULL;\n\t}\n\tbuf[sz] = 0;\n\tconst size_t buflen = strlen (buf);\n\tchar *nullbyte = buf + buflen;\n\tif (buflen != sz && nullbyte[1] && buflen < sz) {\n\t\tnullbyte[0] = ' ';\n\t}\n\tbuf[sz] = 0;\n\tr_str_trim (buf);\n\tchar * res = r_str_escape (buf);\n\tfree (buf);\n\treturn res;\n}\n\nbool Elf_(r_bin_elf_is_executable)(ELFOBJ *bin) {\n\tconst int t = bin->ehdr.e_type;\n\treturn t == ET_EXEC || t == ET_DYN;\n}\n"},"func_before":{"kind":"string","value":"static int init_shdr(ELFOBJ *bin) {\n\tut32 shdr_size;\n\tut8 shdr[sizeof (Elf_(Shdr))] = {0};\n\tsize_t i, j, len;\n\n\tr_return_val_if_fail (bin && !bin->shdr, false);\n\n\tif (!UT32_MUL (&shdr_size, bin->ehdr.e_shnum, sizeof (Elf_(Shdr)))) {\n\t\treturn false;\n\t}\n\tif (shdr_size < 1) {\n\t\treturn false;\n\t}\n\tif (shdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_shoff > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_shoff + shdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (!(bin->shdr = R_NEWS0 (Elf_(Shdr), bin->ehdr.e_shnum))) {\n\t\tr_sys_perror (\"malloc (shdr)\");\n\t\treturn false;\n\t}\n\tsdb_num_set (bin->kv, \"elf_shdr.offset\", bin->ehdr.e_shoff, 0);\n\tsdb_num_set (bin->kv, \"elf_shdr.size\", sizeof (Elf_(Shdr)), 0);\n\tsdb_set (bin->kv, \"elf_s_type.cparse\", \"enum elf_s_type {SHT_NULL=0,SHT_PROGBITS=1,\"\n\t\t\t\"SHT_SYMTAB=2,SHT_STRTAB=3,SHT_RELA=4,SHT_HASH=5,SHT_DYNAMIC=6,SHT_NOTE=7,\"\n\t\t\t\"SHT_NOBITS=8,SHT_REL=9,SHT_SHLIB=10,SHT_DYNSYM=11,SHT_LOOS=0x60000000,\"\n\t\t\t\"SHT_HIOS=0x6fffffff,SHT_LOPROC=0x70000000,SHT_HIPROC=0x7fffffff};\", 0);\n\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tj = 0;\n\t\tlen = r_buf_read_at (bin->b, bin->ehdr.e_shoff + i * sizeof (Elf_(Shdr)), shdr, sizeof (Elf_(Shdr)));\n\t\tif (len < 1) {\n\t\t\tR_LOG_ERROR (\"read (shdr) at 0x%\" PFMT64x, (ut64) bin->ehdr.e_shoff);\n\t\t\tR_FREE (bin->shdr);\n\t\t\treturn false;\n\t\t}\n\t\tbin->shdr[i].sh_name = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_type = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_flags = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_addr = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_offset = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_size = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_link = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_info = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_addralign = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_entsize = R_BIN_ELF_READWORD (shdr, j);\n\t}\n\n#if R_BIN_ELF64\n\tsdb_set (bin->kv, \"elf_s_flags_64.cparse\", \"enum elf_s_flags_64 {SF64_None=0,SF64_Exec=1,\"\n\t\t\t\"SF64_Alloc=2,SF64_Alloc_Exec=3,SF64_Write=4,SF64_Write_Exec=5,\"\n\t\t\t\"SF64_Write_Alloc=6,SF64_Write_Alloc_Exec=7};\", 0);\n\tsdb_set (bin->kv, \"elf_shdr.format\", \"x[4]E[8]Eqqqxxqq name (elf_s_type)type\"\n\t\t\t\" (elf_s_flags_64)flags addr offset size link info addralign entsize\", 0);\n#else\n\tsdb_set (bin->kv, \"elf_s_flags_32.cparse\", \"enum elf_s_flags_32 {SF32_None=0,SF32_Exec=1,\"\n\t\t\t\"SF32_Alloc=2,SF32_Alloc_Exec=3,SF32_Write=4,SF32_Write_Exec=5,\"\n\t\t\t\"SF32_Write_Alloc=6,SF32_Write_Alloc_Exec=7};\", 0);\n\tsdb_set (bin->kv, \"elf_shdr.format\", \"x[4]E[4]Exxxxxxx name (elf_s_type)type\"\n\t\t\t\" (elf_s_flags_32)flags addr offset size link info addralign entsize\", 0);\n#endif\n\treturn true;\n\t// Usage example:\n\t// > td `k bin/cur/info/elf_s_type.cparse`; td `k bin/cur/info/elf_s_flags_64.cparse`\n\t// > pf `k bin/cur/info/elf_shdr.format` @ `k bin/cur/info/elf_shdr.offset`\n}"},"func_after":{"kind":"string","value":"static int init_shdr(ELFOBJ *bin) {\n\tut32 shdr_size;\n\tut8 shdr[sizeof (Elf_(Shdr))] = {0};\n\tsize_t i, j, len;\n\n\tr_return_val_if_fail (bin && !bin->shdr, false);\n\n\tif (!UT32_MUL (&shdr_size, bin->ehdr.e_shnum, sizeof (Elf_(Shdr)))) {\n\t\treturn false;\n\t}\n\tif (shdr_size < 1) {\n\t\treturn false;\n\t}\n\tif (shdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_shoff > bin->size) {\n\t\treturn false;\n\t}\n\tif (bin->ehdr.e_shoff + shdr_size > bin->size) {\n\t\treturn false;\n\t}\n\tif (!(bin->shdr = R_NEWS0 (Elf_(Shdr), bin->ehdr.e_shnum))) {\n\t\tr_sys_perror (\"malloc (shdr)\");\n\t\treturn false;\n\t}\n\tsdb_num_set (bin->kv, \"elf_shdr.offset\", bin->ehdr.e_shoff, 0);\n\tsdb_num_set (bin->kv, \"elf_shdr.size\", sizeof (Elf_(Shdr)), 0);\n\tsdb_set (bin->kv, \"elf_s_type.cparse\", \"enum elf_s_type {SHT_NULL=0,SHT_PROGBITS=1,\"\n\t\t\t\"SHT_SYMTAB=2,SHT_STRTAB=3,SHT_RELA=4,SHT_HASH=5,SHT_DYNAMIC=6,SHT_NOTE=7,\"\n\t\t\t\"SHT_NOBITS=8,SHT_REL=9,SHT_SHLIB=10,SHT_DYNSYM=11,SHT_LOOS=0x60000000,\"\n\t\t\t\"SHT_HIOS=0x6fffffff,SHT_LOPROC=0x70000000,SHT_HIPROC=0x7fffffff};\", 0);\n\n\tfor (i = 0; i < bin->ehdr.e_shnum; i++) {\n\t\tj = 0;\n\t\tlen = r_buf_read_at (bin->b, bin->ehdr.e_shoff + i * sizeof (Elf_(Shdr)), shdr, sizeof (Elf_(Shdr)));\n\t\tif (len < 1) {\n\t\t\tR_LOG_DEBUG (\"read (shdr) at 0x%\" PFMT64x, (ut64) bin->ehdr.e_shoff);\n\t\t\tR_FREE (bin->shdr);\n\t\t\treturn false;\n\t\t}\n\t\tbin->shdr[i].sh_name = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_type = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_flags = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_addr = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_offset = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_size = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_link = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_info = READ32 (shdr, j);\n\t\tbin->shdr[i].sh_addralign = R_BIN_ELF_READWORD (shdr, j);\n\t\tbin->shdr[i].sh_entsize = R_BIN_ELF_READWORD (shdr, j);\n\t}\n\n#if R_BIN_ELF64\n\tsdb_set (bin->kv, \"elf_s_flags_64.cparse\", \"enum elf_s_flags_64 {SF64_None=0,SF64_Exec=1,\"\n\t\t\t\"SF64_Alloc=2,SF64_Alloc_Exec=3,SF64_Write=4,SF64_Write_Exec=5,\"\n\t\t\t\"SF64_Write_Alloc=6,SF64_Write_Alloc_Exec=7};\", 0);\n\tsdb_set (bin->kv, \"elf_shdr.format\", \"x[4]E[8]Eqqqxxqq name (elf_s_type)type\"\n\t\t\t\" (elf_s_flags_64)flags addr offset size link info addralign entsize\", 0);\n#else\n\tsdb_set (bin->kv, \"elf_s_flags_32.cparse\", \"enum elf_s_flags_32 {SF32_None=0,SF32_Exec=1,\"\n\t\t\t\"SF32_Alloc=2,SF32_Alloc_Exec=3,SF32_Write=4,SF32_Write_Exec=5,\"\n\t\t\t\"SF32_Write_Alloc=6,SF32_Write_Alloc_Exec=7};\", 0);\n\tsdb_set (bin->kv, \"elf_shdr.format\", \"x[4]E[4]Exxxxxxx name (elf_s_type)type\"\n\t\t\t\" (elf_s_flags_32)flags addr offset size link info addralign entsize\", 0);\n#endif\n\treturn true;\n\t// Usage example:\n\t// > td `k bin/cur/info/elf_s_type.cparse`; td `k bin/cur/info/elf_s_flags_64.cparse`\n\t// > pf `k bin/cur/info/elf_shdr.format` @ `k bin/cur/info/elf_shdr.offset`\n}"},"diff":{"kind":"string","value":"{'added': [(127, '\\t\\tR_LOG_DEBUG (\"read (magic)\");'), (191, '\\t\\tR_LOG_DEBUG (\"read (ehdr)\");'), (260, '\\t\\t\\tR_LOG_DEBUG (\"read (phdr)\");'), (400, '\\t\\t\\tR_LOG_DEBUG (\"read (shdr) at 0x%\" PFMT64x, (ut64) bin->ehdr.e_shoff);'), (478, '\\t\\tR_LOG_DEBUG (\"read (shstrtab) at 0x%\" PFMT64x, (ut64) bin->shstrtab_section->sh_offset);'), (973, '\\t\\tR_LOG_DEBUG (\"Cannot allocate memory (Check Elf_(Verdef))\");'), (1801, '\\t\\tR_LOG_DEBUG (\"read (init_offset)\");')], 'deleted': [(127, '\\t\\tR_LOG_ERROR (\"read (magic)\");'), (191, '\\t\\tR_LOG_ERROR (\"read (ehdr)\");'), (260, '\\t\\t\\tR_LOG_ERROR (\"read (phdr)\");'), (400, '\\t\\t\\tR_LOG_ERROR (\"read (shdr) at 0x%\" PFMT64x, (ut64) bin->ehdr.e_shoff);'), (478, '\\t\\tR_LOG_ERROR (\"read (shstrtab) at 0x%\" PFMT64x, (ut64) bin->shstrtab_section->sh_offset);'), (973, '\\t\\tR_LOG_ERROR (\"Cannot allocate memory (Check Elf_(Verdef))\");'), (1801, '\\t\\tR_LOG_ERROR (\"read (init_offset)\");')]}"},"num_lines_added":{"kind":"number","value":7,"string":"7"},"num_lines_deleted":{"kind":"number","value":7,"string":"7"},"num_lines_in_file":{"kind":"number","value":3718,"string":"3,718"},"num_tokens_in_file":{"kind":"number","value":27554,"string":"27,554"},"num_lines_in_method":{"kind":"number","value":61,"string":"61"},"num_tokens_in_method":{"kind":"number","value":531,"string":"531"},"method_complexity":{"kind":"number","value":11,"string":"11"},"repo":{"kind":"string","value":"https://github.com/radareorg/radare2"},"cve_id":{"kind":"string","value":"CVE-2022-1714"},"cwe_id":{"kind":"string","value":"CWE-787"}}},{"rowIdx":395,"cells":{"id":{"kind":"number","value":2282,"string":"2,282"},"file_name":{"kind":"string","value":"ip_tables.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"check_compat_entry_size_and_hooks"},"code_before":{"kind":"string","value":"/*\n * Packet matching code.\n *\n * Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling\n * Copyright (C) 2000-2005 Netfilter Core Team \n * Copyright (C) 2006-2010 Patrick McHardy \n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License version 2 as\n * published by the Free Software Foundation.\n */\n#define pr_fmt(fmt) KBUILD_MODNAME \": \" fmt\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \"../../netfilter/xt_repldata.h\"\n\nMODULE_LICENSE(\"GPL\");\nMODULE_AUTHOR(\"Netfilter Core Team \");\nMODULE_DESCRIPTION(\"IPv4 packet filter\");\n\n/*#define DEBUG_IP_FIREWALL*/\n/*#define DEBUG_ALLOW_ALL*/ /* Useful for remote debugging */\n/*#define DEBUG_IP_FIREWALL_USER*/\n\n#ifdef DEBUG_IP_FIREWALL\n#define dprintf(format, args...) pr_info(format , ## args)\n#else\n#define dprintf(format, args...)\n#endif\n\n#ifdef DEBUG_IP_FIREWALL_USER\n#define duprintf(format, args...) pr_info(format , ## args)\n#else\n#define duprintf(format, args...)\n#endif\n\n#ifdef CONFIG_NETFILTER_DEBUG\n#define IP_NF_ASSERT(x)\t\tWARN_ON(!(x))\n#else\n#define IP_NF_ASSERT(x)\n#endif\n\n#if 0\n/* All the better to debug you with... */\n#define static\n#define inline\n#endif\n\nvoid *ipt_alloc_initial_table(const struct xt_table *info)\n{\n\treturn xt_alloc_initial_table(ipt, IPT);\n}\nEXPORT_SYMBOL_GPL(ipt_alloc_initial_table);\n\n/* Returns whether matches rule or not. */\n/* Performance critical - called for every packet */\nstatic inline bool\nip_packet_match(const struct iphdr *ip,\n\t\tconst char *indev,\n\t\tconst char *outdev,\n\t\tconst struct ipt_ip *ipinfo,\n\t\tint isfrag)\n{\n\tunsigned long ret;\n\n#define FWINV(bool, invflg) ((bool) ^ !!(ipinfo->invflags & (invflg)))\n\n\tif (FWINV((ip->saddr&ipinfo->smsk.s_addr) != ipinfo->src.s_addr,\n\t\t IPT_INV_SRCIP) ||\n\t FWINV((ip->daddr&ipinfo->dmsk.s_addr) != ipinfo->dst.s_addr,\n\t\t IPT_INV_DSTIP)) {\n\t\tdprintf(\"Source or dest mismatch.\\n\");\n\n\t\tdprintf(\"SRC: %pI4. Mask: %pI4. Target: %pI4.%s\\n\",\n\t\t\t&ip->saddr, &ipinfo->smsk.s_addr, &ipinfo->src.s_addr,\n\t\t\tipinfo->invflags & IPT_INV_SRCIP ? \" (INV)\" : \"\");\n\t\tdprintf(\"DST: %pI4 Mask: %pI4 Target: %pI4.%s\\n\",\n\t\t\t&ip->daddr, &ipinfo->dmsk.s_addr, &ipinfo->dst.s_addr,\n\t\t\tipinfo->invflags & IPT_INV_DSTIP ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\tret = ifname_compare_aligned(indev, ipinfo->iniface, ipinfo->iniface_mask);\n\n\tif (FWINV(ret != 0, IPT_INV_VIA_IN)) {\n\t\tdprintf(\"VIA in mismatch (%s vs %s).%s\\n\",\n\t\t\tindev, ipinfo->iniface,\n\t\t\tipinfo->invflags & IPT_INV_VIA_IN ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\tret = ifname_compare_aligned(outdev, ipinfo->outiface, ipinfo->outiface_mask);\n\n\tif (FWINV(ret != 0, IPT_INV_VIA_OUT)) {\n\t\tdprintf(\"VIA out mismatch (%s vs %s).%s\\n\",\n\t\t\toutdev, ipinfo->outiface,\n\t\t\tipinfo->invflags & IPT_INV_VIA_OUT ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\t/* Check specific protocol */\n\tif (ipinfo->proto &&\n\t FWINV(ip->protocol != ipinfo->proto, IPT_INV_PROTO)) {\n\t\tdprintf(\"Packet protocol %hi does not match %hi.%s\\n\",\n\t\t\tip->protocol, ipinfo->proto,\n\t\t\tipinfo->invflags & IPT_INV_PROTO ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\t/* If we have a fragment rule but the packet is not a fragment\n\t * then we return zero */\n\tif (FWINV((ipinfo->flags&IPT_F_FRAG) && !isfrag, IPT_INV_FRAG)) {\n\t\tdprintf(\"Fragment rule but not fragment.%s\\n\",\n\t\t\tipinfo->invflags & IPT_INV_FRAG ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nstatic bool\nip_checkentry(const struct ipt_ip *ip)\n{\n\tif (ip->flags & ~IPT_F_MASK) {\n\t\tduprintf(\"Unknown flag bits set: %08X\\n\",\n\t\t\t ip->flags & ~IPT_F_MASK);\n\t\treturn false;\n\t}\n\tif (ip->invflags & ~IPT_INV_MASK) {\n\t\tduprintf(\"Unknown invflag bits set: %08X\\n\",\n\t\t\t ip->invflags & ~IPT_INV_MASK);\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nstatic unsigned int\nipt_error(struct sk_buff *skb, const struct xt_action_param *par)\n{\n\tnet_info_ratelimited(\"error: `%s'\\n\", (const char *)par->targinfo);\n\n\treturn NF_DROP;\n}\n\n/* Performance critical */\nstatic inline struct ipt_entry *\nget_entry(const void *base, unsigned int offset)\n{\n\treturn (struct ipt_entry *)(base + offset);\n}\n\n/* All zeroes == unconditional rule. */\n/* Mildly perf critical (only if packet tracing is on) */\nstatic inline bool unconditional(const struct ipt_ip *ip)\n{\n\tstatic const struct ipt_ip uncond;\n\n\treturn memcmp(ip, &uncond, sizeof(uncond)) == 0;\n#undef FWINV\n}\n\n/* for const-correctness */\nstatic inline const struct xt_entry_target *\nipt_get_target_c(const struct ipt_entry *e)\n{\n\treturn ipt_get_target((struct ipt_entry *)e);\n}\n\n#if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)\nstatic const char *const hooknames[] = {\n\t[NF_INET_PRE_ROUTING]\t\t= \"PREROUTING\",\n\t[NF_INET_LOCAL_IN]\t\t= \"INPUT\",\n\t[NF_INET_FORWARD]\t\t= \"FORWARD\",\n\t[NF_INET_LOCAL_OUT]\t\t= \"OUTPUT\",\n\t[NF_INET_POST_ROUTING]\t\t= \"POSTROUTING\",\n};\n\nenum nf_ip_trace_comments {\n\tNF_IP_TRACE_COMMENT_RULE,\n\tNF_IP_TRACE_COMMENT_RETURN,\n\tNF_IP_TRACE_COMMENT_POLICY,\n};\n\nstatic const char *const comments[] = {\n\t[NF_IP_TRACE_COMMENT_RULE]\t= \"rule\",\n\t[NF_IP_TRACE_COMMENT_RETURN]\t= \"return\",\n\t[NF_IP_TRACE_COMMENT_POLICY]\t= \"policy\",\n};\n\nstatic struct nf_loginfo trace_loginfo = {\n\t.type = NF_LOG_TYPE_LOG,\n\t.u = {\n\t\t.log = {\n\t\t\t.level = 4,\n\t\t\t.logflags = NF_LOG_MASK,\n\t\t},\n\t},\n};\n\n/* Mildly perf critical (only if packet tracing is on) */\nstatic inline int\nget_chainname_rulenum(const struct ipt_entry *s, const struct ipt_entry *e,\n\t\t const char *hookname, const char **chainname,\n\t\t const char **comment, unsigned int *rulenum)\n{\n\tconst struct xt_standard_target *t = (void *)ipt_get_target_c(s);\n\n\tif (strcmp(t->target.u.kernel.target->name, XT_ERROR_TARGET) == 0) {\n\t\t/* Head of user chain: ERROR target with chainname */\n\t\t*chainname = t->target.data;\n\t\t(*rulenum) = 0;\n\t} else if (s == e) {\n\t\t(*rulenum)++;\n\n\t\tif (s->target_offset == sizeof(struct ipt_entry) &&\n\t\t strcmp(t->target.u.kernel.target->name,\n\t\t\t XT_STANDARD_TARGET) == 0 &&\n\t\t t->verdict < 0 &&\n\t\t unconditional(&s->ip)) {\n\t\t\t/* Tail of chains: STANDARD target (return/policy) */\n\t\t\t*comment = *chainname == hookname\n\t\t\t\t? comments[NF_IP_TRACE_COMMENT_POLICY]\n\t\t\t\t: comments[NF_IP_TRACE_COMMENT_RETURN];\n\t\t}\n\t\treturn 1;\n\t} else\n\t\t(*rulenum)++;\n\n\treturn 0;\n}\n\nstatic void trace_packet(struct net *net,\n\t\t\t const struct sk_buff *skb,\n\t\t\t unsigned int hook,\n\t\t\t const struct net_device *in,\n\t\t\t const struct net_device *out,\n\t\t\t const char *tablename,\n\t\t\t const struct xt_table_info *private,\n\t\t\t const struct ipt_entry *e)\n{\n\tconst struct ipt_entry *root;\n\tconst char *hookname, *chainname, *comment;\n\tconst struct ipt_entry *iter;\n\tunsigned int rulenum = 0;\n\n\troot = get_entry(private->entries, private->hook_entry[hook]);\n\n\thookname = chainname = hooknames[hook];\n\tcomment = comments[NF_IP_TRACE_COMMENT_RULE];\n\n\txt_entry_foreach(iter, root, private->size - private->hook_entry[hook])\n\t\tif (get_chainname_rulenum(iter, e, hookname,\n\t\t &chainname, &comment, &rulenum) != 0)\n\t\t\tbreak;\n\n\tnf_log_trace(net, AF_INET, hook, skb, in, out, &trace_loginfo,\n\t\t \"TRACE: %s:%s:%s:%u \",\n\t\t tablename, chainname, comment, rulenum);\n}\n#endif\n\nstatic inline\nstruct ipt_entry *ipt_next_entry(const struct ipt_entry *entry)\n{\n\treturn (void *)entry + entry->next_offset;\n}\n\n/* Returns one of the generic firewall policies, like NF_ACCEPT. */\nunsigned int\nipt_do_table(struct sk_buff *skb,\n\t const struct nf_hook_state *state,\n\t struct xt_table *table)\n{\n\tunsigned int hook = state->hook;\n\tstatic const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long))));\n\tconst struct iphdr *ip;\n\t/* Initializing verdict to NF_DROP keeps gcc happy. */\n\tunsigned int verdict = NF_DROP;\n\tconst char *indev, *outdev;\n\tconst void *table_base;\n\tstruct ipt_entry *e, **jumpstack;\n\tunsigned int stackidx, cpu;\n\tconst struct xt_table_info *private;\n\tstruct xt_action_param acpar;\n\tunsigned int addend;\n\n\t/* Initialization */\n\tstackidx = 0;\n\tip = ip_hdr(skb);\n\tindev = state->in ? state->in->name : nulldevname;\n\toutdev = state->out ? state->out->name : nulldevname;\n\t/* We handle fragments by dealing with the first fragment as\n\t * if it was a normal packet. All other fragments are treated\n\t * normally, except that they will NEVER match rules that ask\n\t * things we don't know, ie. tcp syn flag or ports). If the\n\t * rule is also a fragment-specific rule, non-fragments won't\n\t * match it. */\n\tacpar.fragoff = ntohs(ip->frag_off) & IP_OFFSET;\n\tacpar.thoff = ip_hdrlen(skb);\n\tacpar.hotdrop = false;\n\tacpar.net = state->net;\n\tacpar.in = state->in;\n\tacpar.out = state->out;\n\tacpar.family = NFPROTO_IPV4;\n\tacpar.hooknum = hook;\n\n\tIP_NF_ASSERT(table->valid_hooks & (1 << hook));\n\tlocal_bh_disable();\n\taddend = xt_write_recseq_begin();\n\tprivate = table->private;\n\tcpu = smp_processor_id();\n\t/*\n\t * Ensure we load private-> members after we've fetched the base\n\t * pointer.\n\t */\n\tsmp_read_barrier_depends();\n\ttable_base = private->entries;\n\tjumpstack = (struct ipt_entry **)private->jumpstack[cpu];\n\n\t/* Switch to alternate jumpstack if we're being invoked via TEE.\n\t * TEE issues XT_CONTINUE verdict on original skb so we must not\n\t * clobber the jumpstack.\n\t *\n\t * For recursion via REJECT or SYNPROXY the stack will be clobbered\n\t * but it is no problem since absolute verdict is issued by these.\n\t */\n\tif (static_key_false(&xt_tee_enabled))\n\t\tjumpstack += private->stacksize * __this_cpu_read(nf_skb_duplicated);\n\n\te = get_entry(table_base, private->hook_entry[hook]);\n\n\tpr_debug(\"Entering %s(hook %u), UF %p\\n\",\n\t\t table->name, hook,\n\t\t get_entry(table_base, private->underflow[hook]));\n\n\tdo {\n\t\tconst struct xt_entry_target *t;\n\t\tconst struct xt_entry_match *ematch;\n\t\tstruct xt_counters *counter;\n\n\t\tIP_NF_ASSERT(e);\n\t\tif (!ip_packet_match(ip, indev, outdev,\n\t\t &e->ip, acpar.fragoff)) {\n no_match:\n\t\t\te = ipt_next_entry(e);\n\t\t\tcontinue;\n\t\t}\n\n\t\txt_ematch_foreach(ematch, e) {\n\t\t\tacpar.match = ematch->u.kernel.match;\n\t\t\tacpar.matchinfo = ematch->data;\n\t\t\tif (!acpar.match->match(skb, &acpar))\n\t\t\t\tgoto no_match;\n\t\t}\n\n\t\tcounter = xt_get_this_cpu_counter(&e->counters);\n\t\tADD_COUNTER(*counter, skb->len, 1);\n\n\t\tt = ipt_get_target(e);\n\t\tIP_NF_ASSERT(t->u.kernel.target);\n\n#if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)\n\t\t/* The packet is traced: log it */\n\t\tif (unlikely(skb->nf_trace))\n\t\t\ttrace_packet(state->net, skb, hook, state->in,\n\t\t\t\t state->out, table->name, private, e);\n#endif\n\t\t/* Standard target? */\n\t\tif (!t->u.kernel.target->target) {\n\t\t\tint v;\n\n\t\t\tv = ((struct xt_standard_target *)t)->verdict;\n\t\t\tif (v < 0) {\n\t\t\t\t/* Pop from stack? */\n\t\t\t\tif (v != XT_RETURN) {\n\t\t\t\t\tverdict = (unsigned int)(-v) - 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (stackidx == 0) {\n\t\t\t\t\te = get_entry(table_base,\n\t\t\t\t\t private->underflow[hook]);\n\t\t\t\t\tpr_debug(\"Underflow (this is normal) \"\n\t\t\t\t\t\t \"to %p\\n\", e);\n\t\t\t\t} else {\n\t\t\t\t\te = jumpstack[--stackidx];\n\t\t\t\t\tpr_debug(\"Pulled %p out from pos %u\\n\",\n\t\t\t\t\t\t e, stackidx);\n\t\t\t\t\te = ipt_next_entry(e);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (table_base + v != ipt_next_entry(e) &&\n\t\t\t !(e->ip.flags & IPT_F_GOTO)) {\n\t\t\t\tjumpstack[stackidx++] = e;\n\t\t\t\tpr_debug(\"Pushed %p into pos %u\\n\",\n\t\t\t\t\t e, stackidx - 1);\n\t\t\t}\n\n\t\t\te = get_entry(table_base, v);\n\t\t\tcontinue;\n\t\t}\n\n\t\tacpar.target = t->u.kernel.target;\n\t\tacpar.targinfo = t->data;\n\n\t\tverdict = t->u.kernel.target->target(skb, &acpar);\n\t\t/* Target might have changed stuff. */\n\t\tip = ip_hdr(skb);\n\t\tif (verdict == XT_CONTINUE)\n\t\t\te = ipt_next_entry(e);\n\t\telse\n\t\t\t/* Verdict */\n\t\t\tbreak;\n\t} while (!acpar.hotdrop);\n\tpr_debug(\"Exiting %s; sp at %u\\n\", __func__, stackidx);\n\n\txt_write_recseq_end(addend);\n\tlocal_bh_enable();\n\n#ifdef DEBUG_ALLOW_ALL\n\treturn NF_ACCEPT;\n#else\n\tif (acpar.hotdrop)\n\t\treturn NF_DROP;\n\telse return verdict;\n#endif\n}\n\n/* Figures out from what hook each rule can be called: returns 0 if\n there are loops. Puts hook bitmask in comefrom. */\nstatic int\nmark_source_chains(const struct xt_table_info *newinfo,\n\t\t unsigned int valid_hooks, void *entry0)\n{\n\tunsigned int hook;\n\n\t/* No recursion; use packet counter to save back ptrs (reset\n\t to 0 as we leave), and comefrom to save source hook bitmask */\n\tfor (hook = 0; hook < NF_INET_NUMHOOKS; hook++) {\n\t\tunsigned int pos = newinfo->hook_entry[hook];\n\t\tstruct ipt_entry *e = (struct ipt_entry *)(entry0 + pos);\n\n\t\tif (!(valid_hooks & (1 << hook)))\n\t\t\tcontinue;\n\n\t\t/* Set initial back pointer. */\n\t\te->counters.pcnt = pos;\n\n\t\tfor (;;) {\n\t\t\tconst struct xt_standard_target *t\n\t\t\t\t= (void *)ipt_get_target_c(e);\n\t\t\tint visited = e->comefrom & (1 << hook);\n\n\t\t\tif (e->comefrom & (1 << NF_INET_NUMHOOKS)) {\n\t\t\t\tpr_err(\"iptables: loop hook %u pos %u %08X.\\n\",\n\t\t\t\t hook, pos, e->comefrom);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\te->comefrom |= ((1 << hook) | (1 << NF_INET_NUMHOOKS));\n\n\t\t\t/* Unconditional return/END. */\n\t\t\tif ((e->target_offset == sizeof(struct ipt_entry) &&\n\t\t\t (strcmp(t->target.u.user.name,\n\t\t\t\t XT_STANDARD_TARGET) == 0) &&\n\t\t\t t->verdict < 0 && unconditional(&e->ip)) ||\n\t\t\t visited) {\n\t\t\t\tunsigned int oldpos, size;\n\n\t\t\t\tif ((strcmp(t->target.u.user.name,\n\t\t\t\t\t XT_STANDARD_TARGET) == 0) &&\n\t\t\t\t t->verdict < -NF_MAX_VERDICT - 1) {\n\t\t\t\t\tduprintf(\"mark_source_chains: bad \"\n\t\t\t\t\t\t\"negative verdict (%i)\\n\",\n\t\t\t\t\t\t\t\tt->verdict);\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\n\t\t\t\t/* Return: backtrack through the last\n\t\t\t\t big jump. */\n\t\t\t\tdo {\n\t\t\t\t\te->comefrom ^= (1<comefrom\n\t\t\t\t\t & (1 << NF_INET_NUMHOOKS)) {\n\t\t\t\t\t\tduprintf(\"Back unset \"\n\t\t\t\t\t\t\t \"on hook %u \"\n\t\t\t\t\t\t\t \"rule %u\\n\",\n\t\t\t\t\t\t\t hook, pos);\n\t\t\t\t\t}\n#endif\n\t\t\t\t\toldpos = pos;\n\t\t\t\t\tpos = e->counters.pcnt;\n\t\t\t\t\te->counters.pcnt = 0;\n\n\t\t\t\t\t/* We're at the start. */\n\t\t\t\t\tif (pos == oldpos)\n\t\t\t\t\t\tgoto next;\n\n\t\t\t\t\te = (struct ipt_entry *)\n\t\t\t\t\t\t(entry0 + pos);\n\t\t\t\t} while (oldpos == pos + e->next_offset);\n\n\t\t\t\t/* Move along one */\n\t\t\t\tsize = e->next_offset;\n\t\t\t\te = (struct ipt_entry *)\n\t\t\t\t\t(entry0 + pos + size);\n\t\t\t\te->counters.pcnt = pos;\n\t\t\t\tpos += size;\n\t\t\t} else {\n\t\t\t\tint newpos = t->verdict;\n\n\t\t\t\tif (strcmp(t->target.u.user.name,\n\t\t\t\t\t XT_STANDARD_TARGET) == 0 &&\n\t\t\t\t newpos >= 0) {\n\t\t\t\t\tif (newpos > newinfo->size -\n\t\t\t\t\t\tsizeof(struct ipt_entry)) {\n\t\t\t\t\t\tduprintf(\"mark_source_chains: \"\n\t\t\t\t\t\t\t\"bad verdict (%i)\\n\",\n\t\t\t\t\t\t\t\tnewpos);\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t\t/* This a jump; chase it. */\n\t\t\t\t\tduprintf(\"Jump rule %u -> %u\\n\",\n\t\t\t\t\t\t pos, newpos);\n\t\t\t\t} else {\n\t\t\t\t\t/* ... this is a fallthru */\n\t\t\t\t\tnewpos = pos + e->next_offset;\n\t\t\t\t}\n\t\t\t\te = (struct ipt_entry *)\n\t\t\t\t\t(entry0 + newpos);\n\t\t\t\te->counters.pcnt = pos;\n\t\t\t\tpos = newpos;\n\t\t\t}\n\t\t}\nnext:\n\t\tduprintf(\"Finished chain %u\\n\", hook);\n\t}\n\treturn 1;\n}\n\nstatic void cleanup_match(struct xt_entry_match *m, struct net *net)\n{\n\tstruct xt_mtdtor_param par;\n\n\tpar.net = net;\n\tpar.match = m->u.kernel.match;\n\tpar.matchinfo = m->data;\n\tpar.family = NFPROTO_IPV4;\n\tif (par.match->destroy != NULL)\n\t\tpar.match->destroy(&par);\n\tmodule_put(par.match->me);\n}\n\nstatic int\ncheck_entry(const struct ipt_entry *e)\n{\n\tconst struct xt_entry_target *t;\n\n\tif (!ip_checkentry(&e->ip))\n\t\treturn -EINVAL;\n\n\tif (e->target_offset + sizeof(struct xt_entry_target) >\n\t e->next_offset)\n\t\treturn -EINVAL;\n\n\tt = ipt_get_target_c(e);\n\tif (e->target_offset + t->u.target_size > e->next_offset)\n\t\treturn -EINVAL;\n\n\treturn 0;\n}\n\nstatic int\ncheck_match(struct xt_entry_match *m, struct xt_mtchk_param *par)\n{\n\tconst struct ipt_ip *ip = par->entryinfo;\n\tint ret;\n\n\tpar->match = m->u.kernel.match;\n\tpar->matchinfo = m->data;\n\n\tret = xt_check_match(par, m->u.match_size - sizeof(*m),\n\t ip->proto, ip->invflags & IPT_INV_PROTO);\n\tif (ret < 0) {\n\t\tduprintf(\"check failed for `%s'.\\n\", par->match->name);\n\t\treturn ret;\n\t}\n\treturn 0;\n}\n\nstatic int\nfind_check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)\n{\n\tstruct xt_match *match;\n\tint ret;\n\n\tmatch = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,\n\t\t\t\t m->u.user.revision);\n\tif (IS_ERR(match)) {\n\t\tduprintf(\"find_check_match: `%s' not found\\n\", m->u.user.name);\n\t\treturn PTR_ERR(match);\n\t}\n\tm->u.kernel.match = match;\n\n\tret = check_match(m, par);\n\tif (ret)\n\t\tgoto err;\n\n\treturn 0;\nerr:\n\tmodule_put(m->u.kernel.match->me);\n\treturn ret;\n}\n\nstatic int check_target(struct ipt_entry *e, struct net *net, const char *name)\n{\n\tstruct xt_entry_target *t = ipt_get_target(e);\n\tstruct xt_tgchk_param par = {\n\t\t.net = net,\n\t\t.table = name,\n\t\t.entryinfo = e,\n\t\t.target = t->u.kernel.target,\n\t\t.targinfo = t->data,\n\t\t.hook_mask = e->comefrom,\n\t\t.family = NFPROTO_IPV4,\n\t};\n\tint ret;\n\n\tret = xt_check_target(&par, t->u.target_size - sizeof(*t),\n\t e->ip.proto, e->ip.invflags & IPT_INV_PROTO);\n\tif (ret < 0) {\n\t\tduprintf(\"check failed for `%s'.\\n\",\n\t\t\t t->u.kernel.target->name);\n\t\treturn ret;\n\t}\n\treturn 0;\n}\n\nstatic int\nfind_check_entry(struct ipt_entry *e, struct net *net, const char *name,\n\t\t unsigned int size)\n{\n\tstruct xt_entry_target *t;\n\tstruct xt_target *target;\n\tint ret;\n\tunsigned int j;\n\tstruct xt_mtchk_param mtpar;\n\tstruct xt_entry_match *ematch;\n\n\te->counters.pcnt = xt_percpu_counter_alloc();\n\tif (IS_ERR_VALUE(e->counters.pcnt))\n\t\treturn -ENOMEM;\n\n\tj = 0;\n\tmtpar.net\t= net;\n\tmtpar.table = name;\n\tmtpar.entryinfo = &e->ip;\n\tmtpar.hook_mask = e->comefrom;\n\tmtpar.family = NFPROTO_IPV4;\n\txt_ematch_foreach(ematch, e) {\n\t\tret = find_check_match(ematch, &mtpar);\n\t\tif (ret != 0)\n\t\t\tgoto cleanup_matches;\n\t\t++j;\n\t}\n\n\tt = ipt_get_target(e);\n\ttarget = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,\n\t\t\t\t\tt->u.user.revision);\n\tif (IS_ERR(target)) {\n\t\tduprintf(\"find_check_entry: `%s' not found\\n\", t->u.user.name);\n\t\tret = PTR_ERR(target);\n\t\tgoto cleanup_matches;\n\t}\n\tt->u.kernel.target = target;\n\n\tret = check_target(e, net, name);\n\tif (ret)\n\t\tgoto err;\n\n\treturn 0;\n err:\n\tmodule_put(t->u.kernel.target->me);\n cleanup_matches:\n\txt_ematch_foreach(ematch, e) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tcleanup_match(ematch, net);\n\t}\n\n\txt_percpu_counter_free(e->counters.pcnt);\n\n\treturn ret;\n}\n\nstatic bool check_underflow(const struct ipt_entry *e)\n{\n\tconst struct xt_entry_target *t;\n\tunsigned int verdict;\n\n\tif (!unconditional(&e->ip))\n\t\treturn false;\n\tt = ipt_get_target_c(e);\n\tif (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0)\n\t\treturn false;\n\tverdict = ((struct xt_standard_target *)t)->verdict;\n\tverdict = -verdict - 1;\n\treturn verdict == NF_DROP || verdict == NF_ACCEPT;\n}\n\nstatic int\ncheck_entry_size_and_hooks(struct ipt_entry *e,\n\t\t\t struct xt_table_info *newinfo,\n\t\t\t const unsigned char *base,\n\t\t\t const unsigned char *limit,\n\t\t\t const unsigned int *hook_entries,\n\t\t\t const unsigned int *underflows,\n\t\t\t unsigned int valid_hooks)\n{\n\tunsigned int h;\n\tint err;\n\n\tif ((unsigned long)e % __alignof__(struct ipt_entry) != 0 ||\n\t (unsigned char *)e + sizeof(struct ipt_entry) >= limit) {\n\t\tduprintf(\"Bad offset %p\\n\", e);\n\t\treturn -EINVAL;\n\t}\n\n\tif (e->next_offset\n\t < sizeof(struct ipt_entry) + sizeof(struct xt_entry_target)) {\n\t\tduprintf(\"checking: element %p size %u\\n\",\n\t\t\t e, e->next_offset);\n\t\treturn -EINVAL;\n\t}\n\n\terr = check_entry(e);\n\tif (err)\n\t\treturn err;\n\n\t/* Check hooks & underflows */\n\tfor (h = 0; h < NF_INET_NUMHOOKS; h++) {\n\t\tif (!(valid_hooks & (1 << h)))\n\t\t\tcontinue;\n\t\tif ((unsigned char *)e - base == hook_entries[h])\n\t\t\tnewinfo->hook_entry[h] = hook_entries[h];\n\t\tif ((unsigned char *)e - base == underflows[h]) {\n\t\t\tif (!check_underflow(e)) {\n\t\t\t\tpr_err(\"Underflows must be unconditional and \"\n\t\t\t\t \"use the STANDARD target with \"\n\t\t\t\t \"ACCEPT/DROP\\n\");\n\t\t\t\treturn -EINVAL;\n\t\t\t}\n\t\t\tnewinfo->underflow[h] = underflows[h];\n\t\t}\n\t}\n\n\t/* Clear counters and comefrom */\n\te->counters = ((struct xt_counters) { 0, 0 });\n\te->comefrom = 0;\n\treturn 0;\n}\n\nstatic void\ncleanup_entry(struct ipt_entry *e, struct net *net)\n{\n\tstruct xt_tgdtor_param par;\n\tstruct xt_entry_target *t;\n\tstruct xt_entry_match *ematch;\n\n\t/* Cleanup all matches */\n\txt_ematch_foreach(ematch, e)\n\t\tcleanup_match(ematch, net);\n\tt = ipt_get_target(e);\n\n\tpar.net = net;\n\tpar.target = t->u.kernel.target;\n\tpar.targinfo = t->data;\n\tpar.family = NFPROTO_IPV4;\n\tif (par.target->destroy != NULL)\n\t\tpar.target->destroy(&par);\n\tmodule_put(par.target->me);\n\txt_percpu_counter_free(e->counters.pcnt);\n}\n\n/* Checks and translates the user-supplied table segment (held in\n newinfo) */\nstatic int\ntranslate_table(struct net *net, struct xt_table_info *newinfo, void *entry0,\n\t\tconst struct ipt_replace *repl)\n{\n\tstruct ipt_entry *iter;\n\tunsigned int i;\n\tint ret = 0;\n\n\tnewinfo->size = repl->size;\n\tnewinfo->number = repl->num_entries;\n\n\t/* Init all hooks to impossible value. */\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\tnewinfo->hook_entry[i] = 0xFFFFFFFF;\n\t\tnewinfo->underflow[i] = 0xFFFFFFFF;\n\t}\n\n\tduprintf(\"translate_table: size %u\\n\", newinfo->size);\n\ti = 0;\n\t/* Walk through entries, checking offsets. */\n\txt_entry_foreach(iter, entry0, newinfo->size) {\n\t\tret = check_entry_size_and_hooks(iter, newinfo, entry0,\n\t\t\t\t\t\t entry0 + repl->size,\n\t\t\t\t\t\t repl->hook_entry,\n\t\t\t\t\t\t repl->underflow,\n\t\t\t\t\t\t repl->valid_hooks);\n\t\tif (ret != 0)\n\t\t\treturn ret;\n\t\t++i;\n\t\tif (strcmp(ipt_get_target(iter)->u.user.name,\n\t\t XT_ERROR_TARGET) == 0)\n\t\t\t++newinfo->stacksize;\n\t}\n\n\tif (i != repl->num_entries) {\n\t\tduprintf(\"translate_table: %u not %u entries\\n\",\n\t\t\t i, repl->num_entries);\n\t\treturn -EINVAL;\n\t}\n\n\t/* Check hooks all assigned */\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\t/* Only hooks which are valid */\n\t\tif (!(repl->valid_hooks & (1 << i)))\n\t\t\tcontinue;\n\t\tif (newinfo->hook_entry[i] == 0xFFFFFFFF) {\n\t\t\tduprintf(\"Invalid hook entry %u %u\\n\",\n\t\t\t\t i, repl->hook_entry[i]);\n\t\t\treturn -EINVAL;\n\t\t}\n\t\tif (newinfo->underflow[i] == 0xFFFFFFFF) {\n\t\t\tduprintf(\"Invalid underflow %u %u\\n\",\n\t\t\t\t i, repl->underflow[i]);\n\t\t\treturn -EINVAL;\n\t\t}\n\t}\n\n\tif (!mark_source_chains(newinfo, repl->valid_hooks, entry0))\n\t\treturn -ELOOP;\n\n\t/* Finally, each sanity check must pass */\n\ti = 0;\n\txt_entry_foreach(iter, entry0, newinfo->size) {\n\t\tret = find_check_entry(iter, net, repl->name, repl->size);\n\t\tif (ret != 0)\n\t\t\tbreak;\n\t\t++i;\n\t}\n\n\tif (ret != 0) {\n\t\txt_entry_foreach(iter, entry0, newinfo->size) {\n\t\t\tif (i-- == 0)\n\t\t\t\tbreak;\n\t\t\tcleanup_entry(iter, net);\n\t\t}\n\t\treturn ret;\n\t}\n\n\treturn ret;\n}\n\nstatic void\nget_counters(const struct xt_table_info *t,\n\t struct xt_counters counters[])\n{\n\tstruct ipt_entry *iter;\n\tunsigned int cpu;\n\tunsigned int i;\n\n\tfor_each_possible_cpu(cpu) {\n\t\tseqcount_t *s = &per_cpu(xt_recseq, cpu);\n\n\t\ti = 0;\n\t\txt_entry_foreach(iter, t->entries, t->size) {\n\t\t\tstruct xt_counters *tmp;\n\t\t\tu64 bcnt, pcnt;\n\t\t\tunsigned int start;\n\n\t\t\ttmp = xt_get_per_cpu_counter(&iter->counters, cpu);\n\t\t\tdo {\n\t\t\t\tstart = read_seqcount_begin(s);\n\t\t\t\tbcnt = tmp->bcnt;\n\t\t\t\tpcnt = tmp->pcnt;\n\t\t\t} while (read_seqcount_retry(s, start));\n\n\t\t\tADD_COUNTER(counters[i], bcnt, pcnt);\n\t\t\t++i; /* macro does multi eval of i */\n\t\t}\n\t}\n}\n\nstatic struct xt_counters *alloc_counters(const struct xt_table *table)\n{\n\tunsigned int countersize;\n\tstruct xt_counters *counters;\n\tconst struct xt_table_info *private = table->private;\n\n\t/* We need atomic snapshot of counters: rest doesn't change\n\t (other than comefrom, which userspace doesn't care\n\t about). */\n\tcountersize = sizeof(struct xt_counters) * private->number;\n\tcounters = vzalloc(countersize);\n\n\tif (counters == NULL)\n\t\treturn ERR_PTR(-ENOMEM);\n\n\tget_counters(private, counters);\n\n\treturn counters;\n}\n\nstatic int\ncopy_entries_to_user(unsigned int total_size,\n\t\t const struct xt_table *table,\n\t\t void __user *userptr)\n{\n\tunsigned int off, num;\n\tconst struct ipt_entry *e;\n\tstruct xt_counters *counters;\n\tconst struct xt_table_info *private = table->private;\n\tint ret = 0;\n\tconst void *loc_cpu_entry;\n\n\tcounters = alloc_counters(table);\n\tif (IS_ERR(counters))\n\t\treturn PTR_ERR(counters);\n\n\tloc_cpu_entry = private->entries;\n\tif (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {\n\t\tret = -EFAULT;\n\t\tgoto free_counters;\n\t}\n\n\t/* FIXME: use iterator macros --RR */\n\t/* ... then go back and fix counters and names */\n\tfor (off = 0, num = 0; off < total_size; off += e->next_offset, num++){\n\t\tunsigned int i;\n\t\tconst struct xt_entry_match *m;\n\t\tconst struct xt_entry_target *t;\n\n\t\te = (struct ipt_entry *)(loc_cpu_entry + off);\n\t\tif (copy_to_user(userptr + off\n\t\t\t\t + offsetof(struct ipt_entry, counters),\n\t\t\t\t &counters[num],\n\t\t\t\t sizeof(counters[num])) != 0) {\n\t\t\tret = -EFAULT;\n\t\t\tgoto free_counters;\n\t\t}\n\n\t\tfor (i = sizeof(struct ipt_entry);\n\t\t i < e->target_offset;\n\t\t i += m->u.match_size) {\n\t\t\tm = (void *)e + i;\n\n\t\t\tif (copy_to_user(userptr + off + i\n\t\t\t\t\t + offsetof(struct xt_entry_match,\n\t\t\t\t\t\t u.user.name),\n\t\t\t\t\t m->u.kernel.match->name,\n\t\t\t\t\t strlen(m->u.kernel.match->name)+1)\n\t\t\t != 0) {\n\t\t\t\tret = -EFAULT;\n\t\t\t\tgoto free_counters;\n\t\t\t}\n\t\t}\n\n\t\tt = ipt_get_target_c(e);\n\t\tif (copy_to_user(userptr + off + e->target_offset\n\t\t\t\t + offsetof(struct xt_entry_target,\n\t\t\t\t\t u.user.name),\n\t\t\t\t t->u.kernel.target->name,\n\t\t\t\t strlen(t->u.kernel.target->name)+1) != 0) {\n\t\t\tret = -EFAULT;\n\t\t\tgoto free_counters;\n\t\t}\n\t}\n\n free_counters:\n\tvfree(counters);\n\treturn ret;\n}\n\n#ifdef CONFIG_COMPAT\nstatic void compat_standard_from_user(void *dst, const void *src)\n{\n\tint v = *(compat_int_t *)src;\n\n\tif (v > 0)\n\t\tv += xt_compat_calc_jump(AF_INET, v);\n\tmemcpy(dst, &v, sizeof(v));\n}\n\nstatic int compat_standard_to_user(void __user *dst, const void *src)\n{\n\tcompat_int_t cv = *(int *)src;\n\n\tif (cv > 0)\n\t\tcv -= xt_compat_calc_jump(AF_INET, cv);\n\treturn copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;\n}\n\nstatic int compat_calc_entry(const struct ipt_entry *e,\n\t\t\t const struct xt_table_info *info,\n\t\t\t const void *base, struct xt_table_info *newinfo)\n{\n\tconst struct xt_entry_match *ematch;\n\tconst struct xt_entry_target *t;\n\tunsigned int entry_offset;\n\tint off, i, ret;\n\n\toff = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\tentry_offset = (void *)e - base;\n\txt_ematch_foreach(ematch, e)\n\t\toff += xt_compat_match_offset(ematch->u.kernel.match);\n\tt = ipt_get_target_c(e);\n\toff += xt_compat_target_offset(t->u.kernel.target);\n\tnewinfo->size -= off;\n\tret = xt_compat_add_offset(AF_INET, entry_offset, off);\n\tif (ret)\n\t\treturn ret;\n\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\tif (info->hook_entry[i] &&\n\t\t (e < (struct ipt_entry *)(base + info->hook_entry[i])))\n\t\t\tnewinfo->hook_entry[i] -= off;\n\t\tif (info->underflow[i] &&\n\t\t (e < (struct ipt_entry *)(base + info->underflow[i])))\n\t\t\tnewinfo->underflow[i] -= off;\n\t}\n\treturn 0;\n}\n\nstatic int compat_table_info(const struct xt_table_info *info,\n\t\t\t struct xt_table_info *newinfo)\n{\n\tstruct ipt_entry *iter;\n\tconst void *loc_cpu_entry;\n\tint ret;\n\n\tif (!newinfo || !info)\n\t\treturn -EINVAL;\n\n\t/* we dont care about newinfo->entries */\n\tmemcpy(newinfo, info, offsetof(struct xt_table_info, entries));\n\tnewinfo->initial_entries = 0;\n\tloc_cpu_entry = info->entries;\n\txt_compat_init_offsets(AF_INET, info->number);\n\txt_entry_foreach(iter, loc_cpu_entry, info->size) {\n\t\tret = compat_calc_entry(iter, info, loc_cpu_entry, newinfo);\n\t\tif (ret != 0)\n\t\t\treturn ret;\n\t}\n\treturn 0;\n}\n#endif\n\nstatic int get_info(struct net *net, void __user *user,\n\t\t const int *len, int compat)\n{\n\tchar name[XT_TABLE_MAXNAMELEN];\n\tstruct xt_table *t;\n\tint ret;\n\n\tif (*len != sizeof(struct ipt_getinfo)) {\n\t\tduprintf(\"length %u != %zu\\n\", *len,\n\t\t\t sizeof(struct ipt_getinfo));\n\t\treturn -EINVAL;\n\t}\n\n\tif (copy_from_user(name, user, sizeof(name)) != 0)\n\t\treturn -EFAULT;\n\n\tname[XT_TABLE_MAXNAMELEN-1] = '\\0';\n#ifdef CONFIG_COMPAT\n\tif (compat)\n\t\txt_compat_lock(AF_INET);\n#endif\n\tt = try_then_request_module(xt_find_table_lock(net, AF_INET, name),\n\t\t\t\t \"iptable_%s\", name);\n\tif (!IS_ERR_OR_NULL(t)) {\n\t\tstruct ipt_getinfo info;\n\t\tconst struct xt_table_info *private = t->private;\n#ifdef CONFIG_COMPAT\n\t\tstruct xt_table_info tmp;\n\n\t\tif (compat) {\n\t\t\tret = compat_table_info(private, &tmp);\n\t\t\txt_compat_flush_offsets(AF_INET);\n\t\t\tprivate = &tmp;\n\t\t}\n#endif\n\t\tmemset(&info, 0, sizeof(info));\n\t\tinfo.valid_hooks = t->valid_hooks;\n\t\tmemcpy(info.hook_entry, private->hook_entry,\n\t\t sizeof(info.hook_entry));\n\t\tmemcpy(info.underflow, private->underflow,\n\t\t sizeof(info.underflow));\n\t\tinfo.num_entries = private->number;\n\t\tinfo.size = private->size;\n\t\tstrcpy(info.name, name);\n\n\t\tif (copy_to_user(user, &info, *len) != 0)\n\t\t\tret = -EFAULT;\n\t\telse\n\t\t\tret = 0;\n\n\t\txt_table_unlock(t);\n\t\tmodule_put(t->me);\n\t} else\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n#ifdef CONFIG_COMPAT\n\tif (compat)\n\t\txt_compat_unlock(AF_INET);\n#endif\n\treturn ret;\n}\n\nstatic int\nget_entries(struct net *net, struct ipt_get_entries __user *uptr,\n\t const int *len)\n{\n\tint ret;\n\tstruct ipt_get_entries get;\n\tstruct xt_table *t;\n\n\tif (*len < sizeof(get)) {\n\t\tduprintf(\"get_entries: %u < %zu\\n\", *len, sizeof(get));\n\t\treturn -EINVAL;\n\t}\n\tif (copy_from_user(&get, uptr, sizeof(get)) != 0)\n\t\treturn -EFAULT;\n\tif (*len != sizeof(struct ipt_get_entries) + get.size) {\n\t\tduprintf(\"get_entries: %u != %zu\\n\",\n\t\t\t *len, sizeof(get) + get.size);\n\t\treturn -EINVAL;\n\t}\n\n\tt = xt_find_table_lock(net, AF_INET, get.name);\n\tif (!IS_ERR_OR_NULL(t)) {\n\t\tconst struct xt_table_info *private = t->private;\n\t\tduprintf(\"t->private->number = %u\\n\", private->number);\n\t\tif (get.size == private->size)\n\t\t\tret = copy_entries_to_user(private->size,\n\t\t\t\t\t\t t, uptr->entrytable);\n\t\telse {\n\t\t\tduprintf(\"get_entries: I've got %u not %u!\\n\",\n\t\t\t\t private->size, get.size);\n\t\t\tret = -EAGAIN;\n\t\t}\n\t\tmodule_put(t->me);\n\t\txt_table_unlock(t);\n\t} else\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n\n\treturn ret;\n}\n\nstatic int\n__do_replace(struct net *net, const char *name, unsigned int valid_hooks,\n\t struct xt_table_info *newinfo, unsigned int num_counters,\n\t void __user *counters_ptr)\n{\n\tint ret;\n\tstruct xt_table *t;\n\tstruct xt_table_info *oldinfo;\n\tstruct xt_counters *counters;\n\tstruct ipt_entry *iter;\n\n\tret = 0;\n\tcounters = vzalloc(num_counters * sizeof(struct xt_counters));\n\tif (!counters) {\n\t\tret = -ENOMEM;\n\t\tgoto out;\n\t}\n\n\tt = try_then_request_module(xt_find_table_lock(net, AF_INET, name),\n\t\t\t\t \"iptable_%s\", name);\n\tif (IS_ERR_OR_NULL(t)) {\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n\t\tgoto free_newinfo_counters_untrans;\n\t}\n\n\t/* You lied! */\n\tif (valid_hooks != t->valid_hooks) {\n\t\tduprintf(\"Valid hook crap: %08X vs %08X\\n\",\n\t\t\t valid_hooks, t->valid_hooks);\n\t\tret = -EINVAL;\n\t\tgoto put_module;\n\t}\n\n\toldinfo = xt_replace_table(t, num_counters, newinfo, &ret);\n\tif (!oldinfo)\n\t\tgoto put_module;\n\n\t/* Update module usage count based on number of rules */\n\tduprintf(\"do_replace: oldnum=%u, initnum=%u, newnum=%u\\n\",\n\t\toldinfo->number, oldinfo->initial_entries, newinfo->number);\n\tif ((oldinfo->number > oldinfo->initial_entries) ||\n\t (newinfo->number <= oldinfo->initial_entries))\n\t\tmodule_put(t->me);\n\tif ((oldinfo->number > oldinfo->initial_entries) &&\n\t (newinfo->number <= oldinfo->initial_entries))\n\t\tmodule_put(t->me);\n\n\t/* Get the old counters, and synchronize with replace */\n\tget_counters(oldinfo, counters);\n\n\t/* Decrease module usage counts and free resource */\n\txt_entry_foreach(iter, oldinfo->entries, oldinfo->size)\n\t\tcleanup_entry(iter, net);\n\n\txt_free_table_info(oldinfo);\n\tif (copy_to_user(counters_ptr, counters,\n\t\t\t sizeof(struct xt_counters) * num_counters) != 0) {\n\t\t/* Silent error, can't fail, new table is already in place */\n\t\tnet_warn_ratelimited(\"iptables: counters copy to user failed while replacing table\\n\");\n\t}\n\tvfree(counters);\n\txt_table_unlock(t);\n\treturn ret;\n\n put_module:\n\tmodule_put(t->me);\n\txt_table_unlock(t);\n free_newinfo_counters_untrans:\n\tvfree(counters);\n out:\n\treturn ret;\n}\n\nstatic int\ndo_replace(struct net *net, const void __user *user, unsigned int len)\n{\n\tint ret;\n\tstruct ipt_replace tmp;\n\tstruct xt_table_info *newinfo;\n\tvoid *loc_cpu_entry;\n\tstruct ipt_entry *iter;\n\n\tif (copy_from_user(&tmp, user, sizeof(tmp)) != 0)\n\t\treturn -EFAULT;\n\n\t/* overflow check */\n\tif (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))\n\t\treturn -ENOMEM;\n\tif (tmp.num_counters == 0)\n\t\treturn -EINVAL;\n\n\ttmp.name[sizeof(tmp.name)-1] = 0;\n\n\tnewinfo = xt_alloc_table_info(tmp.size);\n\tif (!newinfo)\n\t\treturn -ENOMEM;\n\n\tloc_cpu_entry = newinfo->entries;\n\tif (copy_from_user(loc_cpu_entry, user + sizeof(tmp),\n\t\t\t tmp.size) != 0) {\n\t\tret = -EFAULT;\n\t\tgoto free_newinfo;\n\t}\n\n\tret = translate_table(net, newinfo, loc_cpu_entry, &tmp);\n\tif (ret != 0)\n\t\tgoto free_newinfo;\n\n\tduprintf(\"Translated table\\n\");\n\n\tret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,\n\t\t\t tmp.num_counters, tmp.counters);\n\tif (ret)\n\t\tgoto free_newinfo_untrans;\n\treturn 0;\n\n free_newinfo_untrans:\n\txt_entry_foreach(iter, loc_cpu_entry, newinfo->size)\n\t\tcleanup_entry(iter, net);\n free_newinfo:\n\txt_free_table_info(newinfo);\n\treturn ret;\n}\n\nstatic int\ndo_add_counters(struct net *net, const void __user *user,\n\t\tunsigned int len, int compat)\n{\n\tunsigned int i;\n\tstruct xt_counters_info tmp;\n\tstruct xt_counters *paddc;\n\tunsigned int num_counters;\n\tconst char *name;\n\tint size;\n\tvoid *ptmp;\n\tstruct xt_table *t;\n\tconst struct xt_table_info *private;\n\tint ret = 0;\n\tstruct ipt_entry *iter;\n\tunsigned int addend;\n#ifdef CONFIG_COMPAT\n\tstruct compat_xt_counters_info compat_tmp;\n\n\tif (compat) {\n\t\tptmp = &compat_tmp;\n\t\tsize = sizeof(struct compat_xt_counters_info);\n\t} else\n#endif\n\t{\n\t\tptmp = &tmp;\n\t\tsize = sizeof(struct xt_counters_info);\n\t}\n\n\tif (copy_from_user(ptmp, user, size) != 0)\n\t\treturn -EFAULT;\n\n#ifdef CONFIG_COMPAT\n\tif (compat) {\n\t\tnum_counters = compat_tmp.num_counters;\n\t\tname = compat_tmp.name;\n\t} else\n#endif\n\t{\n\t\tnum_counters = tmp.num_counters;\n\t\tname = tmp.name;\n\t}\n\n\tif (len != size + num_counters * sizeof(struct xt_counters))\n\t\treturn -EINVAL;\n\n\tpaddc = vmalloc(len - size);\n\tif (!paddc)\n\t\treturn -ENOMEM;\n\n\tif (copy_from_user(paddc, user + size, len - size) != 0) {\n\t\tret = -EFAULT;\n\t\tgoto free;\n\t}\n\n\tt = xt_find_table_lock(net, AF_INET, name);\n\tif (IS_ERR_OR_NULL(t)) {\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n\t\tgoto free;\n\t}\n\n\tlocal_bh_disable();\n\tprivate = t->private;\n\tif (private->number != num_counters) {\n\t\tret = -EINVAL;\n\t\tgoto unlock_up_free;\n\t}\n\n\ti = 0;\n\taddend = xt_write_recseq_begin();\n\txt_entry_foreach(iter, private->entries, private->size) {\n\t\tstruct xt_counters *tmp;\n\n\t\ttmp = xt_get_this_cpu_counter(&iter->counters);\n\t\tADD_COUNTER(*tmp, paddc[i].bcnt, paddc[i].pcnt);\n\t\t++i;\n\t}\n\txt_write_recseq_end(addend);\n unlock_up_free:\n\tlocal_bh_enable();\n\txt_table_unlock(t);\n\tmodule_put(t->me);\n free:\n\tvfree(paddc);\n\n\treturn ret;\n}\n\n#ifdef CONFIG_COMPAT\nstruct compat_ipt_replace {\n\tchar\t\t\tname[XT_TABLE_MAXNAMELEN];\n\tu32\t\t\tvalid_hooks;\n\tu32\t\t\tnum_entries;\n\tu32\t\t\tsize;\n\tu32\t\t\thook_entry[NF_INET_NUMHOOKS];\n\tu32\t\t\tunderflow[NF_INET_NUMHOOKS];\n\tu32\t\t\tnum_counters;\n\tcompat_uptr_t\t\tcounters;\t/* struct xt_counters * */\n\tstruct compat_ipt_entry\tentries[0];\n};\n\nstatic int\ncompat_copy_entry_to_user(struct ipt_entry *e, void __user **dstptr,\n\t\t\t unsigned int *size, struct xt_counters *counters,\n\t\t\t unsigned int i)\n{\n\tstruct xt_entry_target *t;\n\tstruct compat_ipt_entry __user *ce;\n\tu_int16_t target_offset, next_offset;\n\tcompat_uint_t origsize;\n\tconst struct xt_entry_match *ematch;\n\tint ret = 0;\n\n\torigsize = *size;\n\tce = (struct compat_ipt_entry __user *)*dstptr;\n\tif (copy_to_user(ce, e, sizeof(struct ipt_entry)) != 0 ||\n\t copy_to_user(&ce->counters, &counters[i],\n\t sizeof(counters[i])) != 0)\n\t\treturn -EFAULT;\n\n\t*dstptr += sizeof(struct compat_ipt_entry);\n\t*size -= sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\n\txt_ematch_foreach(ematch, e) {\n\t\tret = xt_compat_match_to_user(ematch, dstptr, size);\n\t\tif (ret != 0)\n\t\t\treturn ret;\n\t}\n\ttarget_offset = e->target_offset - (origsize - *size);\n\tt = ipt_get_target(e);\n\tret = xt_compat_target_to_user(t, dstptr, size);\n\tif (ret)\n\t\treturn ret;\n\tnext_offset = e->next_offset - (origsize - *size);\n\tif (put_user(target_offset, &ce->target_offset) != 0 ||\n\t put_user(next_offset, &ce->next_offset) != 0)\n\t\treturn -EFAULT;\n\treturn 0;\n}\n\nstatic int\ncompat_find_calc_match(struct xt_entry_match *m,\n\t\t const char *name,\n\t\t const struct ipt_ip *ip,\n\t\t int *size)\n{\n\tstruct xt_match *match;\n\n\tmatch = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,\n\t\t\t\t m->u.user.revision);\n\tif (IS_ERR(match)) {\n\t\tduprintf(\"compat_check_calc_match: `%s' not found\\n\",\n\t\t\t m->u.user.name);\n\t\treturn PTR_ERR(match);\n\t}\n\tm->u.kernel.match = match;\n\t*size += xt_compat_match_offset(match);\n\treturn 0;\n}\n\nstatic void compat_release_entry(struct compat_ipt_entry *e)\n{\n\tstruct xt_entry_target *t;\n\tstruct xt_entry_match *ematch;\n\n\t/* Cleanup all matches */\n\txt_ematch_foreach(ematch, e)\n\t\tmodule_put(ematch->u.kernel.match->me);\n\tt = compat_ipt_get_target(e);\n\tmodule_put(t->u.kernel.target->me);\n}\n\nstatic int\ncheck_compat_entry_size_and_hooks(struct compat_ipt_entry *e,\n\t\t\t\t struct xt_table_info *newinfo,\n\t\t\t\t unsigned int *size,\n\t\t\t\t const unsigned char *base,\n\t\t\t\t const unsigned char *limit,\n\t\t\t\t const unsigned int *hook_entries,\n\t\t\t\t const unsigned int *underflows,\n\t\t\t\t const char *name)\n{\n\tstruct xt_entry_match *ematch;\n\tstruct xt_entry_target *t;\n\tstruct xt_target *target;\n\tunsigned int entry_offset;\n\tunsigned int j;\n\tint ret, off, h;\n\n\tduprintf(\"check_compat_entry_size_and_hooks %p\\n\", e);\n\tif ((unsigned long)e % __alignof__(struct compat_ipt_entry) != 0 ||\n\t (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit) {\n\t\tduprintf(\"Bad offset %p, limit = %p\\n\", e, limit);\n\t\treturn -EINVAL;\n\t}\n\n\tif (e->next_offset < sizeof(struct compat_ipt_entry) +\n\t\t\t sizeof(struct compat_xt_entry_target)) {\n\t\tduprintf(\"checking: element %p size %u\\n\",\n\t\t\t e, e->next_offset);\n\t\treturn -EINVAL;\n\t}\n\n\t/* For purposes of check_entry casting the compat entry is fine */\n\tret = check_entry((struct ipt_entry *)e);\n\tif (ret)\n\t\treturn ret;\n\n\toff = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\tentry_offset = (void *)e - (void *)base;\n\tj = 0;\n\txt_ematch_foreach(ematch, e) {\n\t\tret = compat_find_calc_match(ematch, name, &e->ip, &off);\n\t\tif (ret != 0)\n\t\t\tgoto release_matches;\n\t\t++j;\n\t}\n\n\tt = compat_ipt_get_target(e);\n\ttarget = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,\n\t\t\t\t\tt->u.user.revision);\n\tif (IS_ERR(target)) {\n\t\tduprintf(\"check_compat_entry_size_and_hooks: `%s' not found\\n\",\n\t\t\t t->u.user.name);\n\t\tret = PTR_ERR(target);\n\t\tgoto release_matches;\n\t}\n\tt->u.kernel.target = target;\n\n\toff += xt_compat_target_offset(target);\n\t*size += off;\n\tret = xt_compat_add_offset(AF_INET, entry_offset, off);\n\tif (ret)\n\t\tgoto out;\n\n\t/* Check hooks & underflows */\n\tfor (h = 0; h < NF_INET_NUMHOOKS; h++) {\n\t\tif ((unsigned char *)e - base == hook_entries[h])\n\t\t\tnewinfo->hook_entry[h] = hook_entries[h];\n\t\tif ((unsigned char *)e - base == underflows[h])\n\t\t\tnewinfo->underflow[h] = underflows[h];\n\t}\n\n\t/* Clear counters and comefrom */\n\tmemset(&e->counters, 0, sizeof(e->counters));\n\te->comefrom = 0;\n\treturn 0;\n\nout:\n\tmodule_put(t->u.kernel.target->me);\nrelease_matches:\n\txt_ematch_foreach(ematch, e) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tmodule_put(ematch->u.kernel.match->me);\n\t}\n\treturn ret;\n}\n\nstatic int\ncompat_copy_entry_from_user(struct compat_ipt_entry *e, void **dstptr,\n\t\t\t unsigned int *size, const char *name,\n\t\t\t struct xt_table_info *newinfo, unsigned char *base)\n{\n\tstruct xt_entry_target *t;\n\tstruct xt_target *target;\n\tstruct ipt_entry *de;\n\tunsigned int origsize;\n\tint ret, h;\n\tstruct xt_entry_match *ematch;\n\n\tret = 0;\n\torigsize = *size;\n\tde = (struct ipt_entry *)*dstptr;\n\tmemcpy(de, e, sizeof(struct ipt_entry));\n\tmemcpy(&de->counters, &e->counters, sizeof(e->counters));\n\n\t*dstptr += sizeof(struct ipt_entry);\n\t*size += sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\n\txt_ematch_foreach(ematch, e) {\n\t\tret = xt_compat_match_from_user(ematch, dstptr, size);\n\t\tif (ret != 0)\n\t\t\treturn ret;\n\t}\n\tde->target_offset = e->target_offset - (origsize - *size);\n\tt = compat_ipt_get_target(e);\n\ttarget = t->u.kernel.target;\n\txt_compat_target_from_user(t, dstptr, size);\n\n\tde->next_offset = e->next_offset - (origsize - *size);\n\tfor (h = 0; h < NF_INET_NUMHOOKS; h++) {\n\t\tif ((unsigned char *)de - base < newinfo->hook_entry[h])\n\t\t\tnewinfo->hook_entry[h] -= origsize - *size;\n\t\tif ((unsigned char *)de - base < newinfo->underflow[h])\n\t\t\tnewinfo->underflow[h] -= origsize - *size;\n\t}\n\treturn ret;\n}\n\nstatic int\ncompat_check_entry(struct ipt_entry *e, struct net *net, const char *name)\n{\n\tstruct xt_entry_match *ematch;\n\tstruct xt_mtchk_param mtpar;\n\tunsigned int j;\n\tint ret = 0;\n\n\te->counters.pcnt = xt_percpu_counter_alloc();\n\tif (IS_ERR_VALUE(e->counters.pcnt))\n\t\treturn -ENOMEM;\n\n\tj = 0;\n\tmtpar.net\t= net;\n\tmtpar.table = name;\n\tmtpar.entryinfo = &e->ip;\n\tmtpar.hook_mask = e->comefrom;\n\tmtpar.family = NFPROTO_IPV4;\n\txt_ematch_foreach(ematch, e) {\n\t\tret = check_match(ematch, &mtpar);\n\t\tif (ret != 0)\n\t\t\tgoto cleanup_matches;\n\t\t++j;\n\t}\n\n\tret = check_target(e, net, name);\n\tif (ret)\n\t\tgoto cleanup_matches;\n\treturn 0;\n\n cleanup_matches:\n\txt_ematch_foreach(ematch, e) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tcleanup_match(ematch, net);\n\t}\n\n\txt_percpu_counter_free(e->counters.pcnt);\n\n\treturn ret;\n}\n\nstatic int\ntranslate_compat_table(struct net *net,\n\t\t const char *name,\n\t\t unsigned int valid_hooks,\n\t\t struct xt_table_info **pinfo,\n\t\t void **pentry0,\n\t\t unsigned int total_size,\n\t\t unsigned int number,\n\t\t unsigned int *hook_entries,\n\t\t unsigned int *underflows)\n{\n\tunsigned int i, j;\n\tstruct xt_table_info *newinfo, *info;\n\tvoid *pos, *entry0, *entry1;\n\tstruct compat_ipt_entry *iter0;\n\tstruct ipt_entry *iter1;\n\tunsigned int size;\n\tint ret;\n\n\tinfo = *pinfo;\n\tentry0 = *pentry0;\n\tsize = total_size;\n\tinfo->number = number;\n\n\t/* Init all hooks to impossible value. */\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\tinfo->hook_entry[i] = 0xFFFFFFFF;\n\t\tinfo->underflow[i] = 0xFFFFFFFF;\n\t}\n\n\tduprintf(\"translate_compat_table: size %u\\n\", info->size);\n\tj = 0;\n\txt_compat_lock(AF_INET);\n\txt_compat_init_offsets(AF_INET, number);\n\t/* Walk through entries, checking offsets. */\n\txt_entry_foreach(iter0, entry0, total_size) {\n\t\tret = check_compat_entry_size_and_hooks(iter0, info, &size,\n\t\t\t\t\t\t\tentry0,\n\t\t\t\t\t\t\tentry0 + total_size,\n\t\t\t\t\t\t\thook_entries,\n\t\t\t\t\t\t\tunderflows,\n\t\t\t\t\t\t\tname);\n\t\tif (ret != 0)\n\t\t\tgoto out_unlock;\n\t\t++j;\n\t}\n\n\tret = -EINVAL;\n\tif (j != number) {\n\t\tduprintf(\"translate_compat_table: %u not %u entries\\n\",\n\t\t\t j, number);\n\t\tgoto out_unlock;\n\t}\n\n\t/* Check hooks all assigned */\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\t/* Only hooks which are valid */\n\t\tif (!(valid_hooks & (1 << i)))\n\t\t\tcontinue;\n\t\tif (info->hook_entry[i] == 0xFFFFFFFF) {\n\t\t\tduprintf(\"Invalid hook entry %u %u\\n\",\n\t\t\t\t i, hook_entries[i]);\n\t\t\tgoto out_unlock;\n\t\t}\n\t\tif (info->underflow[i] == 0xFFFFFFFF) {\n\t\t\tduprintf(\"Invalid underflow %u %u\\n\",\n\t\t\t\t i, underflows[i]);\n\t\t\tgoto out_unlock;\n\t\t}\n\t}\n\n\tret = -ENOMEM;\n\tnewinfo = xt_alloc_table_info(size);\n\tif (!newinfo)\n\t\tgoto out_unlock;\n\n\tnewinfo->number = number;\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\tnewinfo->hook_entry[i] = info->hook_entry[i];\n\t\tnewinfo->underflow[i] = info->underflow[i];\n\t}\n\tentry1 = newinfo->entries;\n\tpos = entry1;\n\tsize = total_size;\n\txt_entry_foreach(iter0, entry0, total_size) {\n\t\tret = compat_copy_entry_from_user(iter0, &pos, &size,\n\t\t\t\t\t\t name, newinfo, entry1);\n\t\tif (ret != 0)\n\t\t\tbreak;\n\t}\n\txt_compat_flush_offsets(AF_INET);\n\txt_compat_unlock(AF_INET);\n\tif (ret)\n\t\tgoto free_newinfo;\n\n\tret = -ELOOP;\n\tif (!mark_source_chains(newinfo, valid_hooks, entry1))\n\t\tgoto free_newinfo;\n\n\ti = 0;\n\txt_entry_foreach(iter1, entry1, newinfo->size) {\n\t\tret = compat_check_entry(iter1, net, name);\n\t\tif (ret != 0)\n\t\t\tbreak;\n\t\t++i;\n\t\tif (strcmp(ipt_get_target(iter1)->u.user.name,\n\t\t XT_ERROR_TARGET) == 0)\n\t\t\t++newinfo->stacksize;\n\t}\n\tif (ret) {\n\t\t/*\n\t\t * The first i matches need cleanup_entry (calls ->destroy)\n\t\t * because they had called ->check already. The other j-i\n\t\t * entries need only release.\n\t\t */\n\t\tint skip = i;\n\t\tj -= i;\n\t\txt_entry_foreach(iter0, entry0, newinfo->size) {\n\t\t\tif (skip-- > 0)\n\t\t\t\tcontinue;\n\t\t\tif (j-- == 0)\n\t\t\t\tbreak;\n\t\t\tcompat_release_entry(iter0);\n\t\t}\n\t\txt_entry_foreach(iter1, entry1, newinfo->size) {\n\t\t\tif (i-- == 0)\n\t\t\t\tbreak;\n\t\t\tcleanup_entry(iter1, net);\n\t\t}\n\t\txt_free_table_info(newinfo);\n\t\treturn ret;\n\t}\n\n\t*pinfo = newinfo;\n\t*pentry0 = entry1;\n\txt_free_table_info(info);\n\treturn 0;\n\nfree_newinfo:\n\txt_free_table_info(newinfo);\nout:\n\txt_entry_foreach(iter0, entry0, total_size) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tcompat_release_entry(iter0);\n\t}\n\treturn ret;\nout_unlock:\n\txt_compat_flush_offsets(AF_INET);\n\txt_compat_unlock(AF_INET);\n\tgoto out;\n}\n\nstatic int\ncompat_do_replace(struct net *net, void __user *user, unsigned int len)\n{\n\tint ret;\n\tstruct compat_ipt_replace tmp;\n\tstruct xt_table_info *newinfo;\n\tvoid *loc_cpu_entry;\n\tstruct ipt_entry *iter;\n\n\tif (copy_from_user(&tmp, user, sizeof(tmp)) != 0)\n\t\treturn -EFAULT;\n\n\t/* overflow check */\n\tif (tmp.size >= INT_MAX / num_possible_cpus())\n\t\treturn -ENOMEM;\n\tif (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))\n\t\treturn -ENOMEM;\n\tif (tmp.num_counters == 0)\n\t\treturn -EINVAL;\n\n\ttmp.name[sizeof(tmp.name)-1] = 0;\n\n\tnewinfo = xt_alloc_table_info(tmp.size);\n\tif (!newinfo)\n\t\treturn -ENOMEM;\n\n\tloc_cpu_entry = newinfo->entries;\n\tif (copy_from_user(loc_cpu_entry, user + sizeof(tmp),\n\t\t\t tmp.size) != 0) {\n\t\tret = -EFAULT;\n\t\tgoto free_newinfo;\n\t}\n\n\tret = translate_compat_table(net, tmp.name, tmp.valid_hooks,\n\t\t\t\t &newinfo, &loc_cpu_entry, tmp.size,\n\t\t\t\t tmp.num_entries, tmp.hook_entry,\n\t\t\t\t tmp.underflow);\n\tif (ret != 0)\n\t\tgoto free_newinfo;\n\n\tduprintf(\"compat_do_replace: Translated table\\n\");\n\n\tret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,\n\t\t\t tmp.num_counters, compat_ptr(tmp.counters));\n\tif (ret)\n\t\tgoto free_newinfo_untrans;\n\treturn 0;\n\n free_newinfo_untrans:\n\txt_entry_foreach(iter, loc_cpu_entry, newinfo->size)\n\t\tcleanup_entry(iter, net);\n free_newinfo:\n\txt_free_table_info(newinfo);\n\treturn ret;\n}\n\nstatic int\ncompat_do_ipt_set_ctl(struct sock *sk,\tint cmd, void __user *user,\n\t\t unsigned int len)\n{\n\tint ret;\n\n\tif (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))\n\t\treturn -EPERM;\n\n\tswitch (cmd) {\n\tcase IPT_SO_SET_REPLACE:\n\t\tret = compat_do_replace(sock_net(sk), user, len);\n\t\tbreak;\n\n\tcase IPT_SO_SET_ADD_COUNTERS:\n\t\tret = do_add_counters(sock_net(sk), user, len, 1);\n\t\tbreak;\n\n\tdefault:\n\t\tduprintf(\"do_ipt_set_ctl: unknown request %i\\n\", cmd);\n\t\tret = -EINVAL;\n\t}\n\n\treturn ret;\n}\n\nstruct compat_ipt_get_entries {\n\tchar name[XT_TABLE_MAXNAMELEN];\n\tcompat_uint_t size;\n\tstruct compat_ipt_entry entrytable[0];\n};\n\nstatic int\ncompat_copy_entries_to_user(unsigned int total_size, struct xt_table *table,\n\t\t\t void __user *userptr)\n{\n\tstruct xt_counters *counters;\n\tconst struct xt_table_info *private = table->private;\n\tvoid __user *pos;\n\tunsigned int size;\n\tint ret = 0;\n\tunsigned int i = 0;\n\tstruct ipt_entry *iter;\n\n\tcounters = alloc_counters(table);\n\tif (IS_ERR(counters))\n\t\treturn PTR_ERR(counters);\n\n\tpos = userptr;\n\tsize = total_size;\n\txt_entry_foreach(iter, private->entries, total_size) {\n\t\tret = compat_copy_entry_to_user(iter, &pos,\n\t\t\t\t\t\t&size, counters, i++);\n\t\tif (ret != 0)\n\t\t\tbreak;\n\t}\n\n\tvfree(counters);\n\treturn ret;\n}\n\nstatic int\ncompat_get_entries(struct net *net, struct compat_ipt_get_entries __user *uptr,\n\t\t int *len)\n{\n\tint ret;\n\tstruct compat_ipt_get_entries get;\n\tstruct xt_table *t;\n\n\tif (*len < sizeof(get)) {\n\t\tduprintf(\"compat_get_entries: %u < %zu\\n\", *len, sizeof(get));\n\t\treturn -EINVAL;\n\t}\n\n\tif (copy_from_user(&get, uptr, sizeof(get)) != 0)\n\t\treturn -EFAULT;\n\n\tif (*len != sizeof(struct compat_ipt_get_entries) + get.size) {\n\t\tduprintf(\"compat_get_entries: %u != %zu\\n\",\n\t\t\t *len, sizeof(get) + get.size);\n\t\treturn -EINVAL;\n\t}\n\n\txt_compat_lock(AF_INET);\n\tt = xt_find_table_lock(net, AF_INET, get.name);\n\tif (!IS_ERR_OR_NULL(t)) {\n\t\tconst struct xt_table_info *private = t->private;\n\t\tstruct xt_table_info info;\n\t\tduprintf(\"t->private->number = %u\\n\", private->number);\n\t\tret = compat_table_info(private, &info);\n\t\tif (!ret && get.size == info.size) {\n\t\t\tret = compat_copy_entries_to_user(private->size,\n\t\t\t\t\t\t\t t, uptr->entrytable);\n\t\t} else if (!ret) {\n\t\t\tduprintf(\"compat_get_entries: I've got %u not %u!\\n\",\n\t\t\t\t private->size, get.size);\n\t\t\tret = -EAGAIN;\n\t\t}\n\t\txt_compat_flush_offsets(AF_INET);\n\t\tmodule_put(t->me);\n\t\txt_table_unlock(t);\n\t} else\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n\n\txt_compat_unlock(AF_INET);\n\treturn ret;\n}\n\nstatic int do_ipt_get_ctl(struct sock *, int, void __user *, int *);\n\nstatic int\ncompat_do_ipt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)\n{\n\tint ret;\n\n\tif (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))\n\t\treturn -EPERM;\n\n\tswitch (cmd) {\n\tcase IPT_SO_GET_INFO:\n\t\tret = get_info(sock_net(sk), user, len, 1);\n\t\tbreak;\n\tcase IPT_SO_GET_ENTRIES:\n\t\tret = compat_get_entries(sock_net(sk), user, len);\n\t\tbreak;\n\tdefault:\n\t\tret = do_ipt_get_ctl(sk, cmd, user, len);\n\t}\n\treturn ret;\n}\n#endif\n\nstatic int\ndo_ipt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)\n{\n\tint ret;\n\n\tif (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))\n\t\treturn -EPERM;\n\n\tswitch (cmd) {\n\tcase IPT_SO_SET_REPLACE:\n\t\tret = do_replace(sock_net(sk), user, len);\n\t\tbreak;\n\n\tcase IPT_SO_SET_ADD_COUNTERS:\n\t\tret = do_add_counters(sock_net(sk), user, len, 0);\n\t\tbreak;\n\n\tdefault:\n\t\tduprintf(\"do_ipt_set_ctl: unknown request %i\\n\", cmd);\n\t\tret = -EINVAL;\n\t}\n\n\treturn ret;\n}\n\nstatic int\ndo_ipt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)\n{\n\tint ret;\n\n\tif (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))\n\t\treturn -EPERM;\n\n\tswitch (cmd) {\n\tcase IPT_SO_GET_INFO:\n\t\tret = get_info(sock_net(sk), user, len, 0);\n\t\tbreak;\n\n\tcase IPT_SO_GET_ENTRIES:\n\t\tret = get_entries(sock_net(sk), user, len);\n\t\tbreak;\n\n\tcase IPT_SO_GET_REVISION_MATCH:\n\tcase IPT_SO_GET_REVISION_TARGET: {\n\t\tstruct xt_get_revision rev;\n\t\tint target;\n\n\t\tif (*len != sizeof(rev)) {\n\t\t\tret = -EINVAL;\n\t\t\tbreak;\n\t\t}\n\t\tif (copy_from_user(&rev, user, sizeof(rev)) != 0) {\n\t\t\tret = -EFAULT;\n\t\t\tbreak;\n\t\t}\n\t\trev.name[sizeof(rev.name)-1] = 0;\n\n\t\tif (cmd == IPT_SO_GET_REVISION_TARGET)\n\t\t\ttarget = 1;\n\t\telse\n\t\t\ttarget = 0;\n\n\t\ttry_then_request_module(xt_find_revision(AF_INET, rev.name,\n\t\t\t\t\t\t\t rev.revision,\n\t\t\t\t\t\t\t target, &ret),\n\t\t\t\t\t\"ipt_%s\", rev.name);\n\t\tbreak;\n\t}\n\n\tdefault:\n\t\tduprintf(\"do_ipt_get_ctl: unknown request %i\\n\", cmd);\n\t\tret = -EINVAL;\n\t}\n\n\treturn ret;\n}\n\nstatic void __ipt_unregister_table(struct net *net, struct xt_table *table)\n{\n\tstruct xt_table_info *private;\n\tvoid *loc_cpu_entry;\n\tstruct module *table_owner = table->me;\n\tstruct ipt_entry *iter;\n\n\tprivate = xt_unregister_table(table);\n\n\t/* Decrease module usage counts and free resources */\n\tloc_cpu_entry = private->entries;\n\txt_entry_foreach(iter, loc_cpu_entry, private->size)\n\t\tcleanup_entry(iter, net);\n\tif (private->number > private->initial_entries)\n\t\tmodule_put(table_owner);\n\txt_free_table_info(private);\n}\n\nint ipt_register_table(struct net *net, const struct xt_table *table,\n\t\t const struct ipt_replace *repl,\n\t\t const struct nf_hook_ops *ops, struct xt_table **res)\n{\n\tint ret;\n\tstruct xt_table_info *newinfo;\n\tstruct xt_table_info bootstrap = {0};\n\tvoid *loc_cpu_entry;\n\tstruct xt_table *new_table;\n\n\tnewinfo = xt_alloc_table_info(repl->size);\n\tif (!newinfo)\n\t\treturn -ENOMEM;\n\n\tloc_cpu_entry = newinfo->entries;\n\tmemcpy(loc_cpu_entry, repl->entries, repl->size);\n\n\tret = translate_table(net, newinfo, loc_cpu_entry, repl);\n\tif (ret != 0)\n\t\tgoto out_free;\n\n\tnew_table = xt_register_table(net, table, &bootstrap, newinfo);\n\tif (IS_ERR(new_table)) {\n\t\tret = PTR_ERR(new_table);\n\t\tgoto out_free;\n\t}\n\n\t/* set res now, will see skbs right after nf_register_net_hooks */\n\tWRITE_ONCE(*res, new_table);\n\n\tret = nf_register_net_hooks(net, ops, hweight32(table->valid_hooks));\n\tif (ret != 0) {\n\t\t__ipt_unregister_table(net, new_table);\n\t\t*res = NULL;\n\t}\n\n\treturn ret;\n\nout_free:\n\txt_free_table_info(newinfo);\n\treturn ret;\n}\n\nvoid ipt_unregister_table(struct net *net, struct xt_table *table,\n\t\t\t const struct nf_hook_ops *ops)\n{\n\tnf_unregister_net_hooks(net, ops, hweight32(table->valid_hooks));\n\t__ipt_unregister_table(net, table);\n}\n\n/* Returns 1 if the type and code is matched by the range, 0 otherwise */\nstatic inline bool\nicmp_type_code_match(u_int8_t test_type, u_int8_t min_code, u_int8_t max_code,\n\t\t u_int8_t type, u_int8_t code,\n\t\t bool invert)\n{\n\treturn ((test_type == 0xFF) ||\n\t\t(type == test_type && code >= min_code && code <= max_code))\n\t\t^ invert;\n}\n\nstatic bool\nicmp_match(const struct sk_buff *skb, struct xt_action_param *par)\n{\n\tconst struct icmphdr *ic;\n\tstruct icmphdr _icmph;\n\tconst struct ipt_icmp *icmpinfo = par->matchinfo;\n\n\t/* Must not be a fragment. */\n\tif (par->fragoff != 0)\n\t\treturn false;\n\n\tic = skb_header_pointer(skb, par->thoff, sizeof(_icmph), &_icmph);\n\tif (ic == NULL) {\n\t\t/* We've been asked to examine this packet, and we\n\t\t * can't. Hence, no choice but to drop.\n\t\t */\n\t\tduprintf(\"Dropping evil ICMP tinygram.\\n\");\n\t\tpar->hotdrop = true;\n\t\treturn false;\n\t}\n\n\treturn icmp_type_code_match(icmpinfo->type,\n\t\t\t\t icmpinfo->code[0],\n\t\t\t\t icmpinfo->code[1],\n\t\t\t\t ic->type, ic->code,\n\t\t\t\t !!(icmpinfo->invflags&IPT_ICMP_INV));\n}\n\nstatic int icmp_checkentry(const struct xt_mtchk_param *par)\n{\n\tconst struct ipt_icmp *icmpinfo = par->matchinfo;\n\n\t/* Must specify no unknown invflags */\n\treturn (icmpinfo->invflags & ~IPT_ICMP_INV) ? -EINVAL : 0;\n}\n\nstatic struct xt_target ipt_builtin_tg[] __read_mostly = {\n\t{\n\t\t.name = XT_STANDARD_TARGET,\n\t\t.targetsize = sizeof(int),\n\t\t.family = NFPROTO_IPV4,\n#ifdef CONFIG_COMPAT\n\t\t.compatsize = sizeof(compat_int_t),\n\t\t.compat_from_user = compat_standard_from_user,\n\t\t.compat_to_user = compat_standard_to_user,\n#endif\n\t},\n\t{\n\t\t.name = XT_ERROR_TARGET,\n\t\t.target = ipt_error,\n\t\t.targetsize = XT_FUNCTION_MAXNAMELEN,\n\t\t.family = NFPROTO_IPV4,\n\t},\n};\n\nstatic struct nf_sockopt_ops ipt_sockopts = {\n\t.pf\t\t= PF_INET,\n\t.set_optmin\t= IPT_BASE_CTL,\n\t.set_optmax\t= IPT_SO_SET_MAX+1,\n\t.set\t\t= do_ipt_set_ctl,\n#ifdef CONFIG_COMPAT\n\t.compat_set\t= compat_do_ipt_set_ctl,\n#endif\n\t.get_optmin\t= IPT_BASE_CTL,\n\t.get_optmax\t= IPT_SO_GET_MAX+1,\n\t.get\t\t= do_ipt_get_ctl,\n#ifdef CONFIG_COMPAT\n\t.compat_get\t= compat_do_ipt_get_ctl,\n#endif\n\t.owner\t\t= THIS_MODULE,\n};\n\nstatic struct xt_match ipt_builtin_mt[] __read_mostly = {\n\t{\n\t\t.name = \"icmp\",\n\t\t.match = icmp_match,\n\t\t.matchsize = sizeof(struct ipt_icmp),\n\t\t.checkentry = icmp_checkentry,\n\t\t.proto = IPPROTO_ICMP,\n\t\t.family = NFPROTO_IPV4,\n\t},\n};\n\nstatic int __net_init ip_tables_net_init(struct net *net)\n{\n\treturn xt_proto_init(net, NFPROTO_IPV4);\n}\n\nstatic void __net_exit ip_tables_net_exit(struct net *net)\n{\n\txt_proto_fini(net, NFPROTO_IPV4);\n}\n\nstatic struct pernet_operations ip_tables_net_ops = {\n\t.init = ip_tables_net_init,\n\t.exit = ip_tables_net_exit,\n};\n\nstatic int __init ip_tables_init(void)\n{\n\tint ret;\n\n\tret = register_pernet_subsys(&ip_tables_net_ops);\n\tif (ret < 0)\n\t\tgoto err1;\n\n\t/* No one else will be downing sem now, so we won't sleep */\n\tret = xt_register_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));\n\tif (ret < 0)\n\t\tgoto err2;\n\tret = xt_register_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));\n\tif (ret < 0)\n\t\tgoto err4;\n\n\t/* Register setsockopt */\n\tret = nf_register_sockopt(&ipt_sockopts);\n\tif (ret < 0)\n\t\tgoto err5;\n\n\tpr_info(\"(C) 2000-2006 Netfilter Core Team\\n\");\n\treturn 0;\n\nerr5:\n\txt_unregister_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));\nerr4:\n\txt_unregister_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));\nerr2:\n\tunregister_pernet_subsys(&ip_tables_net_ops);\nerr1:\n\treturn ret;\n}\n\nstatic void __exit ip_tables_fini(void)\n{\n\tnf_unregister_sockopt(&ipt_sockopts);\n\n\txt_unregister_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));\n\txt_unregister_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));\n\tunregister_pernet_subsys(&ip_tables_net_ops);\n}\n\nEXPORT_SYMBOL(ipt_register_table);\nEXPORT_SYMBOL(ipt_unregister_table);\nEXPORT_SYMBOL(ipt_do_table);\nmodule_init(ip_tables_init);\nmodule_exit(ip_tables_fini);\n"},"code_after":{"kind":"string","value":"/*\n * Packet matching code.\n *\n * Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling\n * Copyright (C) 2000-2005 Netfilter Core Team \n * Copyright (C) 2006-2010 Patrick McHardy \n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License version 2 as\n * published by the Free Software Foundation.\n */\n#define pr_fmt(fmt) KBUILD_MODNAME \": \" fmt\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \"../../netfilter/xt_repldata.h\"\n\nMODULE_LICENSE(\"GPL\");\nMODULE_AUTHOR(\"Netfilter Core Team \");\nMODULE_DESCRIPTION(\"IPv4 packet filter\");\n\n/*#define DEBUG_IP_FIREWALL*/\n/*#define DEBUG_ALLOW_ALL*/ /* Useful for remote debugging */\n/*#define DEBUG_IP_FIREWALL_USER*/\n\n#ifdef DEBUG_IP_FIREWALL\n#define dprintf(format, args...) pr_info(format , ## args)\n#else\n#define dprintf(format, args...)\n#endif\n\n#ifdef DEBUG_IP_FIREWALL_USER\n#define duprintf(format, args...) pr_info(format , ## args)\n#else\n#define duprintf(format, args...)\n#endif\n\n#ifdef CONFIG_NETFILTER_DEBUG\n#define IP_NF_ASSERT(x)\t\tWARN_ON(!(x))\n#else\n#define IP_NF_ASSERT(x)\n#endif\n\n#if 0\n/* All the better to debug you with... */\n#define static\n#define inline\n#endif\n\nvoid *ipt_alloc_initial_table(const struct xt_table *info)\n{\n\treturn xt_alloc_initial_table(ipt, IPT);\n}\nEXPORT_SYMBOL_GPL(ipt_alloc_initial_table);\n\n/* Returns whether matches rule or not. */\n/* Performance critical - called for every packet */\nstatic inline bool\nip_packet_match(const struct iphdr *ip,\n\t\tconst char *indev,\n\t\tconst char *outdev,\n\t\tconst struct ipt_ip *ipinfo,\n\t\tint isfrag)\n{\n\tunsigned long ret;\n\n#define FWINV(bool, invflg) ((bool) ^ !!(ipinfo->invflags & (invflg)))\n\n\tif (FWINV((ip->saddr&ipinfo->smsk.s_addr) != ipinfo->src.s_addr,\n\t\t IPT_INV_SRCIP) ||\n\t FWINV((ip->daddr&ipinfo->dmsk.s_addr) != ipinfo->dst.s_addr,\n\t\t IPT_INV_DSTIP)) {\n\t\tdprintf(\"Source or dest mismatch.\\n\");\n\n\t\tdprintf(\"SRC: %pI4. Mask: %pI4. Target: %pI4.%s\\n\",\n\t\t\t&ip->saddr, &ipinfo->smsk.s_addr, &ipinfo->src.s_addr,\n\t\t\tipinfo->invflags & IPT_INV_SRCIP ? \" (INV)\" : \"\");\n\t\tdprintf(\"DST: %pI4 Mask: %pI4 Target: %pI4.%s\\n\",\n\t\t\t&ip->daddr, &ipinfo->dmsk.s_addr, &ipinfo->dst.s_addr,\n\t\t\tipinfo->invflags & IPT_INV_DSTIP ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\tret = ifname_compare_aligned(indev, ipinfo->iniface, ipinfo->iniface_mask);\n\n\tif (FWINV(ret != 0, IPT_INV_VIA_IN)) {\n\t\tdprintf(\"VIA in mismatch (%s vs %s).%s\\n\",\n\t\t\tindev, ipinfo->iniface,\n\t\t\tipinfo->invflags & IPT_INV_VIA_IN ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\tret = ifname_compare_aligned(outdev, ipinfo->outiface, ipinfo->outiface_mask);\n\n\tif (FWINV(ret != 0, IPT_INV_VIA_OUT)) {\n\t\tdprintf(\"VIA out mismatch (%s vs %s).%s\\n\",\n\t\t\toutdev, ipinfo->outiface,\n\t\t\tipinfo->invflags & IPT_INV_VIA_OUT ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\t/* Check specific protocol */\n\tif (ipinfo->proto &&\n\t FWINV(ip->protocol != ipinfo->proto, IPT_INV_PROTO)) {\n\t\tdprintf(\"Packet protocol %hi does not match %hi.%s\\n\",\n\t\t\tip->protocol, ipinfo->proto,\n\t\t\tipinfo->invflags & IPT_INV_PROTO ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\t/* If we have a fragment rule but the packet is not a fragment\n\t * then we return zero */\n\tif (FWINV((ipinfo->flags&IPT_F_FRAG) && !isfrag, IPT_INV_FRAG)) {\n\t\tdprintf(\"Fragment rule but not fragment.%s\\n\",\n\t\t\tipinfo->invflags & IPT_INV_FRAG ? \" (INV)\" : \"\");\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nstatic bool\nip_checkentry(const struct ipt_ip *ip)\n{\n\tif (ip->flags & ~IPT_F_MASK) {\n\t\tduprintf(\"Unknown flag bits set: %08X\\n\",\n\t\t\t ip->flags & ~IPT_F_MASK);\n\t\treturn false;\n\t}\n\tif (ip->invflags & ~IPT_INV_MASK) {\n\t\tduprintf(\"Unknown invflag bits set: %08X\\n\",\n\t\t\t ip->invflags & ~IPT_INV_MASK);\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nstatic unsigned int\nipt_error(struct sk_buff *skb, const struct xt_action_param *par)\n{\n\tnet_info_ratelimited(\"error: `%s'\\n\", (const char *)par->targinfo);\n\n\treturn NF_DROP;\n}\n\n/* Performance critical */\nstatic inline struct ipt_entry *\nget_entry(const void *base, unsigned int offset)\n{\n\treturn (struct ipt_entry *)(base + offset);\n}\n\n/* All zeroes == unconditional rule. */\n/* Mildly perf critical (only if packet tracing is on) */\nstatic inline bool unconditional(const struct ipt_ip *ip)\n{\n\tstatic const struct ipt_ip uncond;\n\n\treturn memcmp(ip, &uncond, sizeof(uncond)) == 0;\n#undef FWINV\n}\n\n/* for const-correctness */\nstatic inline const struct xt_entry_target *\nipt_get_target_c(const struct ipt_entry *e)\n{\n\treturn ipt_get_target((struct ipt_entry *)e);\n}\n\n#if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)\nstatic const char *const hooknames[] = {\n\t[NF_INET_PRE_ROUTING]\t\t= \"PREROUTING\",\n\t[NF_INET_LOCAL_IN]\t\t= \"INPUT\",\n\t[NF_INET_FORWARD]\t\t= \"FORWARD\",\n\t[NF_INET_LOCAL_OUT]\t\t= \"OUTPUT\",\n\t[NF_INET_POST_ROUTING]\t\t= \"POSTROUTING\",\n};\n\nenum nf_ip_trace_comments {\n\tNF_IP_TRACE_COMMENT_RULE,\n\tNF_IP_TRACE_COMMENT_RETURN,\n\tNF_IP_TRACE_COMMENT_POLICY,\n};\n\nstatic const char *const comments[] = {\n\t[NF_IP_TRACE_COMMENT_RULE]\t= \"rule\",\n\t[NF_IP_TRACE_COMMENT_RETURN]\t= \"return\",\n\t[NF_IP_TRACE_COMMENT_POLICY]\t= \"policy\",\n};\n\nstatic struct nf_loginfo trace_loginfo = {\n\t.type = NF_LOG_TYPE_LOG,\n\t.u = {\n\t\t.log = {\n\t\t\t.level = 4,\n\t\t\t.logflags = NF_LOG_MASK,\n\t\t},\n\t},\n};\n\n/* Mildly perf critical (only if packet tracing is on) */\nstatic inline int\nget_chainname_rulenum(const struct ipt_entry *s, const struct ipt_entry *e,\n\t\t const char *hookname, const char **chainname,\n\t\t const char **comment, unsigned int *rulenum)\n{\n\tconst struct xt_standard_target *t = (void *)ipt_get_target_c(s);\n\n\tif (strcmp(t->target.u.kernel.target->name, XT_ERROR_TARGET) == 0) {\n\t\t/* Head of user chain: ERROR target with chainname */\n\t\t*chainname = t->target.data;\n\t\t(*rulenum) = 0;\n\t} else if (s == e) {\n\t\t(*rulenum)++;\n\n\t\tif (s->target_offset == sizeof(struct ipt_entry) &&\n\t\t strcmp(t->target.u.kernel.target->name,\n\t\t\t XT_STANDARD_TARGET) == 0 &&\n\t\t t->verdict < 0 &&\n\t\t unconditional(&s->ip)) {\n\t\t\t/* Tail of chains: STANDARD target (return/policy) */\n\t\t\t*comment = *chainname == hookname\n\t\t\t\t? comments[NF_IP_TRACE_COMMENT_POLICY]\n\t\t\t\t: comments[NF_IP_TRACE_COMMENT_RETURN];\n\t\t}\n\t\treturn 1;\n\t} else\n\t\t(*rulenum)++;\n\n\treturn 0;\n}\n\nstatic void trace_packet(struct net *net,\n\t\t\t const struct sk_buff *skb,\n\t\t\t unsigned int hook,\n\t\t\t const struct net_device *in,\n\t\t\t const struct net_device *out,\n\t\t\t const char *tablename,\n\t\t\t const struct xt_table_info *private,\n\t\t\t const struct ipt_entry *e)\n{\n\tconst struct ipt_entry *root;\n\tconst char *hookname, *chainname, *comment;\n\tconst struct ipt_entry *iter;\n\tunsigned int rulenum = 0;\n\n\troot = get_entry(private->entries, private->hook_entry[hook]);\n\n\thookname = chainname = hooknames[hook];\n\tcomment = comments[NF_IP_TRACE_COMMENT_RULE];\n\n\txt_entry_foreach(iter, root, private->size - private->hook_entry[hook])\n\t\tif (get_chainname_rulenum(iter, e, hookname,\n\t\t &chainname, &comment, &rulenum) != 0)\n\t\t\tbreak;\n\n\tnf_log_trace(net, AF_INET, hook, skb, in, out, &trace_loginfo,\n\t\t \"TRACE: %s:%s:%s:%u \",\n\t\t tablename, chainname, comment, rulenum);\n}\n#endif\n\nstatic inline\nstruct ipt_entry *ipt_next_entry(const struct ipt_entry *entry)\n{\n\treturn (void *)entry + entry->next_offset;\n}\n\n/* Returns one of the generic firewall policies, like NF_ACCEPT. */\nunsigned int\nipt_do_table(struct sk_buff *skb,\n\t const struct nf_hook_state *state,\n\t struct xt_table *table)\n{\n\tunsigned int hook = state->hook;\n\tstatic const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long))));\n\tconst struct iphdr *ip;\n\t/* Initializing verdict to NF_DROP keeps gcc happy. */\n\tunsigned int verdict = NF_DROP;\n\tconst char *indev, *outdev;\n\tconst void *table_base;\n\tstruct ipt_entry *e, **jumpstack;\n\tunsigned int stackidx, cpu;\n\tconst struct xt_table_info *private;\n\tstruct xt_action_param acpar;\n\tunsigned int addend;\n\n\t/* Initialization */\n\tstackidx = 0;\n\tip = ip_hdr(skb);\n\tindev = state->in ? state->in->name : nulldevname;\n\toutdev = state->out ? state->out->name : nulldevname;\n\t/* We handle fragments by dealing with the first fragment as\n\t * if it was a normal packet. All other fragments are treated\n\t * normally, except that they will NEVER match rules that ask\n\t * things we don't know, ie. tcp syn flag or ports). If the\n\t * rule is also a fragment-specific rule, non-fragments won't\n\t * match it. */\n\tacpar.fragoff = ntohs(ip->frag_off) & IP_OFFSET;\n\tacpar.thoff = ip_hdrlen(skb);\n\tacpar.hotdrop = false;\n\tacpar.net = state->net;\n\tacpar.in = state->in;\n\tacpar.out = state->out;\n\tacpar.family = NFPROTO_IPV4;\n\tacpar.hooknum = hook;\n\n\tIP_NF_ASSERT(table->valid_hooks & (1 << hook));\n\tlocal_bh_disable();\n\taddend = xt_write_recseq_begin();\n\tprivate = table->private;\n\tcpu = smp_processor_id();\n\t/*\n\t * Ensure we load private-> members after we've fetched the base\n\t * pointer.\n\t */\n\tsmp_read_barrier_depends();\n\ttable_base = private->entries;\n\tjumpstack = (struct ipt_entry **)private->jumpstack[cpu];\n\n\t/* Switch to alternate jumpstack if we're being invoked via TEE.\n\t * TEE issues XT_CONTINUE verdict on original skb so we must not\n\t * clobber the jumpstack.\n\t *\n\t * For recursion via REJECT or SYNPROXY the stack will be clobbered\n\t * but it is no problem since absolute verdict is issued by these.\n\t */\n\tif (static_key_false(&xt_tee_enabled))\n\t\tjumpstack += private->stacksize * __this_cpu_read(nf_skb_duplicated);\n\n\te = get_entry(table_base, private->hook_entry[hook]);\n\n\tpr_debug(\"Entering %s(hook %u), UF %p\\n\",\n\t\t table->name, hook,\n\t\t get_entry(table_base, private->underflow[hook]));\n\n\tdo {\n\t\tconst struct xt_entry_target *t;\n\t\tconst struct xt_entry_match *ematch;\n\t\tstruct xt_counters *counter;\n\n\t\tIP_NF_ASSERT(e);\n\t\tif (!ip_packet_match(ip, indev, outdev,\n\t\t &e->ip, acpar.fragoff)) {\n no_match:\n\t\t\te = ipt_next_entry(e);\n\t\t\tcontinue;\n\t\t}\n\n\t\txt_ematch_foreach(ematch, e) {\n\t\t\tacpar.match = ematch->u.kernel.match;\n\t\t\tacpar.matchinfo = ematch->data;\n\t\t\tif (!acpar.match->match(skb, &acpar))\n\t\t\t\tgoto no_match;\n\t\t}\n\n\t\tcounter = xt_get_this_cpu_counter(&e->counters);\n\t\tADD_COUNTER(*counter, skb->len, 1);\n\n\t\tt = ipt_get_target(e);\n\t\tIP_NF_ASSERT(t->u.kernel.target);\n\n#if IS_ENABLED(CONFIG_NETFILTER_XT_TARGET_TRACE)\n\t\t/* The packet is traced: log it */\n\t\tif (unlikely(skb->nf_trace))\n\t\t\ttrace_packet(state->net, skb, hook, state->in,\n\t\t\t\t state->out, table->name, private, e);\n#endif\n\t\t/* Standard target? */\n\t\tif (!t->u.kernel.target->target) {\n\t\t\tint v;\n\n\t\t\tv = ((struct xt_standard_target *)t)->verdict;\n\t\t\tif (v < 0) {\n\t\t\t\t/* Pop from stack? */\n\t\t\t\tif (v != XT_RETURN) {\n\t\t\t\t\tverdict = (unsigned int)(-v) - 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (stackidx == 0) {\n\t\t\t\t\te = get_entry(table_base,\n\t\t\t\t\t private->underflow[hook]);\n\t\t\t\t\tpr_debug(\"Underflow (this is normal) \"\n\t\t\t\t\t\t \"to %p\\n\", e);\n\t\t\t\t} else {\n\t\t\t\t\te = jumpstack[--stackidx];\n\t\t\t\t\tpr_debug(\"Pulled %p out from pos %u\\n\",\n\t\t\t\t\t\t e, stackidx);\n\t\t\t\t\te = ipt_next_entry(e);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (table_base + v != ipt_next_entry(e) &&\n\t\t\t !(e->ip.flags & IPT_F_GOTO)) {\n\t\t\t\tjumpstack[stackidx++] = e;\n\t\t\t\tpr_debug(\"Pushed %p into pos %u\\n\",\n\t\t\t\t\t e, stackidx - 1);\n\t\t\t}\n\n\t\t\te = get_entry(table_base, v);\n\t\t\tcontinue;\n\t\t}\n\n\t\tacpar.target = t->u.kernel.target;\n\t\tacpar.targinfo = t->data;\n\n\t\tverdict = t->u.kernel.target->target(skb, &acpar);\n\t\t/* Target might have changed stuff. */\n\t\tip = ip_hdr(skb);\n\t\tif (verdict == XT_CONTINUE)\n\t\t\te = ipt_next_entry(e);\n\t\telse\n\t\t\t/* Verdict */\n\t\t\tbreak;\n\t} while (!acpar.hotdrop);\n\tpr_debug(\"Exiting %s; sp at %u\\n\", __func__, stackidx);\n\n\txt_write_recseq_end(addend);\n\tlocal_bh_enable();\n\n#ifdef DEBUG_ALLOW_ALL\n\treturn NF_ACCEPT;\n#else\n\tif (acpar.hotdrop)\n\t\treturn NF_DROP;\n\telse return verdict;\n#endif\n}\n\n/* Figures out from what hook each rule can be called: returns 0 if\n there are loops. Puts hook bitmask in comefrom. */\nstatic int\nmark_source_chains(const struct xt_table_info *newinfo,\n\t\t unsigned int valid_hooks, void *entry0)\n{\n\tunsigned int hook;\n\n\t/* No recursion; use packet counter to save back ptrs (reset\n\t to 0 as we leave), and comefrom to save source hook bitmask */\n\tfor (hook = 0; hook < NF_INET_NUMHOOKS; hook++) {\n\t\tunsigned int pos = newinfo->hook_entry[hook];\n\t\tstruct ipt_entry *e = (struct ipt_entry *)(entry0 + pos);\n\n\t\tif (!(valid_hooks & (1 << hook)))\n\t\t\tcontinue;\n\n\t\t/* Set initial back pointer. */\n\t\te->counters.pcnt = pos;\n\n\t\tfor (;;) {\n\t\t\tconst struct xt_standard_target *t\n\t\t\t\t= (void *)ipt_get_target_c(e);\n\t\t\tint visited = e->comefrom & (1 << hook);\n\n\t\t\tif (e->comefrom & (1 << NF_INET_NUMHOOKS)) {\n\t\t\t\tpr_err(\"iptables: loop hook %u pos %u %08X.\\n\",\n\t\t\t\t hook, pos, e->comefrom);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\te->comefrom |= ((1 << hook) | (1 << NF_INET_NUMHOOKS));\n\n\t\t\t/* Unconditional return/END. */\n\t\t\tif ((e->target_offset == sizeof(struct ipt_entry) &&\n\t\t\t (strcmp(t->target.u.user.name,\n\t\t\t\t XT_STANDARD_TARGET) == 0) &&\n\t\t\t t->verdict < 0 && unconditional(&e->ip)) ||\n\t\t\t visited) {\n\t\t\t\tunsigned int oldpos, size;\n\n\t\t\t\tif ((strcmp(t->target.u.user.name,\n\t\t\t\t\t XT_STANDARD_TARGET) == 0) &&\n\t\t\t\t t->verdict < -NF_MAX_VERDICT - 1) {\n\t\t\t\t\tduprintf(\"mark_source_chains: bad \"\n\t\t\t\t\t\t\"negative verdict (%i)\\n\",\n\t\t\t\t\t\t\t\tt->verdict);\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\n\t\t\t\t/* Return: backtrack through the last\n\t\t\t\t big jump. */\n\t\t\t\tdo {\n\t\t\t\t\te->comefrom ^= (1<comefrom\n\t\t\t\t\t & (1 << NF_INET_NUMHOOKS)) {\n\t\t\t\t\t\tduprintf(\"Back unset \"\n\t\t\t\t\t\t\t \"on hook %u \"\n\t\t\t\t\t\t\t \"rule %u\\n\",\n\t\t\t\t\t\t\t hook, pos);\n\t\t\t\t\t}\n#endif\n\t\t\t\t\toldpos = pos;\n\t\t\t\t\tpos = e->counters.pcnt;\n\t\t\t\t\te->counters.pcnt = 0;\n\n\t\t\t\t\t/* We're at the start. */\n\t\t\t\t\tif (pos == oldpos)\n\t\t\t\t\t\tgoto next;\n\n\t\t\t\t\te = (struct ipt_entry *)\n\t\t\t\t\t\t(entry0 + pos);\n\t\t\t\t} while (oldpos == pos + e->next_offset);\n\n\t\t\t\t/* Move along one */\n\t\t\t\tsize = e->next_offset;\n\t\t\t\te = (struct ipt_entry *)\n\t\t\t\t\t(entry0 + pos + size);\n\t\t\t\te->counters.pcnt = pos;\n\t\t\t\tpos += size;\n\t\t\t} else {\n\t\t\t\tint newpos = t->verdict;\n\n\t\t\t\tif (strcmp(t->target.u.user.name,\n\t\t\t\t\t XT_STANDARD_TARGET) == 0 &&\n\t\t\t\t newpos >= 0) {\n\t\t\t\t\tif (newpos > newinfo->size -\n\t\t\t\t\t\tsizeof(struct ipt_entry)) {\n\t\t\t\t\t\tduprintf(\"mark_source_chains: \"\n\t\t\t\t\t\t\t\"bad verdict (%i)\\n\",\n\t\t\t\t\t\t\t\tnewpos);\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t}\n\t\t\t\t\t/* This a jump; chase it. */\n\t\t\t\t\tduprintf(\"Jump rule %u -> %u\\n\",\n\t\t\t\t\t\t pos, newpos);\n\t\t\t\t} else {\n\t\t\t\t\t/* ... this is a fallthru */\n\t\t\t\t\tnewpos = pos + e->next_offset;\n\t\t\t\t}\n\t\t\t\te = (struct ipt_entry *)\n\t\t\t\t\t(entry0 + newpos);\n\t\t\t\te->counters.pcnt = pos;\n\t\t\t\tpos = newpos;\n\t\t\t}\n\t\t}\nnext:\n\t\tduprintf(\"Finished chain %u\\n\", hook);\n\t}\n\treturn 1;\n}\n\nstatic void cleanup_match(struct xt_entry_match *m, struct net *net)\n{\n\tstruct xt_mtdtor_param par;\n\n\tpar.net = net;\n\tpar.match = m->u.kernel.match;\n\tpar.matchinfo = m->data;\n\tpar.family = NFPROTO_IPV4;\n\tif (par.match->destroy != NULL)\n\t\tpar.match->destroy(&par);\n\tmodule_put(par.match->me);\n}\n\nstatic int\ncheck_entry(const struct ipt_entry *e)\n{\n\tconst struct xt_entry_target *t;\n\n\tif (!ip_checkentry(&e->ip))\n\t\treturn -EINVAL;\n\n\tif (e->target_offset + sizeof(struct xt_entry_target) >\n\t e->next_offset)\n\t\treturn -EINVAL;\n\n\tt = ipt_get_target_c(e);\n\tif (e->target_offset + t->u.target_size > e->next_offset)\n\t\treturn -EINVAL;\n\n\treturn 0;\n}\n\nstatic int\ncheck_match(struct xt_entry_match *m, struct xt_mtchk_param *par)\n{\n\tconst struct ipt_ip *ip = par->entryinfo;\n\tint ret;\n\n\tpar->match = m->u.kernel.match;\n\tpar->matchinfo = m->data;\n\n\tret = xt_check_match(par, m->u.match_size - sizeof(*m),\n\t ip->proto, ip->invflags & IPT_INV_PROTO);\n\tif (ret < 0) {\n\t\tduprintf(\"check failed for `%s'.\\n\", par->match->name);\n\t\treturn ret;\n\t}\n\treturn 0;\n}\n\nstatic int\nfind_check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)\n{\n\tstruct xt_match *match;\n\tint ret;\n\n\tmatch = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,\n\t\t\t\t m->u.user.revision);\n\tif (IS_ERR(match)) {\n\t\tduprintf(\"find_check_match: `%s' not found\\n\", m->u.user.name);\n\t\treturn PTR_ERR(match);\n\t}\n\tm->u.kernel.match = match;\n\n\tret = check_match(m, par);\n\tif (ret)\n\t\tgoto err;\n\n\treturn 0;\nerr:\n\tmodule_put(m->u.kernel.match->me);\n\treturn ret;\n}\n\nstatic int check_target(struct ipt_entry *e, struct net *net, const char *name)\n{\n\tstruct xt_entry_target *t = ipt_get_target(e);\n\tstruct xt_tgchk_param par = {\n\t\t.net = net,\n\t\t.table = name,\n\t\t.entryinfo = e,\n\t\t.target = t->u.kernel.target,\n\t\t.targinfo = t->data,\n\t\t.hook_mask = e->comefrom,\n\t\t.family = NFPROTO_IPV4,\n\t};\n\tint ret;\n\n\tret = xt_check_target(&par, t->u.target_size - sizeof(*t),\n\t e->ip.proto, e->ip.invflags & IPT_INV_PROTO);\n\tif (ret < 0) {\n\t\tduprintf(\"check failed for `%s'.\\n\",\n\t\t\t t->u.kernel.target->name);\n\t\treturn ret;\n\t}\n\treturn 0;\n}\n\nstatic int\nfind_check_entry(struct ipt_entry *e, struct net *net, const char *name,\n\t\t unsigned int size)\n{\n\tstruct xt_entry_target *t;\n\tstruct xt_target *target;\n\tint ret;\n\tunsigned int j;\n\tstruct xt_mtchk_param mtpar;\n\tstruct xt_entry_match *ematch;\n\n\te->counters.pcnt = xt_percpu_counter_alloc();\n\tif (IS_ERR_VALUE(e->counters.pcnt))\n\t\treturn -ENOMEM;\n\n\tj = 0;\n\tmtpar.net\t= net;\n\tmtpar.table = name;\n\tmtpar.entryinfo = &e->ip;\n\tmtpar.hook_mask = e->comefrom;\n\tmtpar.family = NFPROTO_IPV4;\n\txt_ematch_foreach(ematch, e) {\n\t\tret = find_check_match(ematch, &mtpar);\n\t\tif (ret != 0)\n\t\t\tgoto cleanup_matches;\n\t\t++j;\n\t}\n\n\tt = ipt_get_target(e);\n\ttarget = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,\n\t\t\t\t\tt->u.user.revision);\n\tif (IS_ERR(target)) {\n\t\tduprintf(\"find_check_entry: `%s' not found\\n\", t->u.user.name);\n\t\tret = PTR_ERR(target);\n\t\tgoto cleanup_matches;\n\t}\n\tt->u.kernel.target = target;\n\n\tret = check_target(e, net, name);\n\tif (ret)\n\t\tgoto err;\n\n\treturn 0;\n err:\n\tmodule_put(t->u.kernel.target->me);\n cleanup_matches:\n\txt_ematch_foreach(ematch, e) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tcleanup_match(ematch, net);\n\t}\n\n\txt_percpu_counter_free(e->counters.pcnt);\n\n\treturn ret;\n}\n\nstatic bool check_underflow(const struct ipt_entry *e)\n{\n\tconst struct xt_entry_target *t;\n\tunsigned int verdict;\n\n\tif (!unconditional(&e->ip))\n\t\treturn false;\n\tt = ipt_get_target_c(e);\n\tif (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0)\n\t\treturn false;\n\tverdict = ((struct xt_standard_target *)t)->verdict;\n\tverdict = -verdict - 1;\n\treturn verdict == NF_DROP || verdict == NF_ACCEPT;\n}\n\nstatic int\ncheck_entry_size_and_hooks(struct ipt_entry *e,\n\t\t\t struct xt_table_info *newinfo,\n\t\t\t const unsigned char *base,\n\t\t\t const unsigned char *limit,\n\t\t\t const unsigned int *hook_entries,\n\t\t\t const unsigned int *underflows,\n\t\t\t unsigned int valid_hooks)\n{\n\tunsigned int h;\n\tint err;\n\n\tif ((unsigned long)e % __alignof__(struct ipt_entry) != 0 ||\n\t (unsigned char *)e + sizeof(struct ipt_entry) >= limit ||\n\t (unsigned char *)e + e->next_offset > limit) {\n\t\tduprintf(\"Bad offset %p\\n\", e);\n\t\treturn -EINVAL;\n\t}\n\n\tif (e->next_offset\n\t < sizeof(struct ipt_entry) + sizeof(struct xt_entry_target)) {\n\t\tduprintf(\"checking: element %p size %u\\n\",\n\t\t\t e, e->next_offset);\n\t\treturn -EINVAL;\n\t}\n\n\terr = check_entry(e);\n\tif (err)\n\t\treturn err;\n\n\t/* Check hooks & underflows */\n\tfor (h = 0; h < NF_INET_NUMHOOKS; h++) {\n\t\tif (!(valid_hooks & (1 << h)))\n\t\t\tcontinue;\n\t\tif ((unsigned char *)e - base == hook_entries[h])\n\t\t\tnewinfo->hook_entry[h] = hook_entries[h];\n\t\tif ((unsigned char *)e - base == underflows[h]) {\n\t\t\tif (!check_underflow(e)) {\n\t\t\t\tpr_err(\"Underflows must be unconditional and \"\n\t\t\t\t \"use the STANDARD target with \"\n\t\t\t\t \"ACCEPT/DROP\\n\");\n\t\t\t\treturn -EINVAL;\n\t\t\t}\n\t\t\tnewinfo->underflow[h] = underflows[h];\n\t\t}\n\t}\n\n\t/* Clear counters and comefrom */\n\te->counters = ((struct xt_counters) { 0, 0 });\n\te->comefrom = 0;\n\treturn 0;\n}\n\nstatic void\ncleanup_entry(struct ipt_entry *e, struct net *net)\n{\n\tstruct xt_tgdtor_param par;\n\tstruct xt_entry_target *t;\n\tstruct xt_entry_match *ematch;\n\n\t/* Cleanup all matches */\n\txt_ematch_foreach(ematch, e)\n\t\tcleanup_match(ematch, net);\n\tt = ipt_get_target(e);\n\n\tpar.net = net;\n\tpar.target = t->u.kernel.target;\n\tpar.targinfo = t->data;\n\tpar.family = NFPROTO_IPV4;\n\tif (par.target->destroy != NULL)\n\t\tpar.target->destroy(&par);\n\tmodule_put(par.target->me);\n\txt_percpu_counter_free(e->counters.pcnt);\n}\n\n/* Checks and translates the user-supplied table segment (held in\n newinfo) */\nstatic int\ntranslate_table(struct net *net, struct xt_table_info *newinfo, void *entry0,\n\t\tconst struct ipt_replace *repl)\n{\n\tstruct ipt_entry *iter;\n\tunsigned int i;\n\tint ret = 0;\n\n\tnewinfo->size = repl->size;\n\tnewinfo->number = repl->num_entries;\n\n\t/* Init all hooks to impossible value. */\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\tnewinfo->hook_entry[i] = 0xFFFFFFFF;\n\t\tnewinfo->underflow[i] = 0xFFFFFFFF;\n\t}\n\n\tduprintf(\"translate_table: size %u\\n\", newinfo->size);\n\ti = 0;\n\t/* Walk through entries, checking offsets. */\n\txt_entry_foreach(iter, entry0, newinfo->size) {\n\t\tret = check_entry_size_and_hooks(iter, newinfo, entry0,\n\t\t\t\t\t\t entry0 + repl->size,\n\t\t\t\t\t\t repl->hook_entry,\n\t\t\t\t\t\t repl->underflow,\n\t\t\t\t\t\t repl->valid_hooks);\n\t\tif (ret != 0)\n\t\t\treturn ret;\n\t\t++i;\n\t\tif (strcmp(ipt_get_target(iter)->u.user.name,\n\t\t XT_ERROR_TARGET) == 0)\n\t\t\t++newinfo->stacksize;\n\t}\n\n\tif (i != repl->num_entries) {\n\t\tduprintf(\"translate_table: %u not %u entries\\n\",\n\t\t\t i, repl->num_entries);\n\t\treturn -EINVAL;\n\t}\n\n\t/* Check hooks all assigned */\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\t/* Only hooks which are valid */\n\t\tif (!(repl->valid_hooks & (1 << i)))\n\t\t\tcontinue;\n\t\tif (newinfo->hook_entry[i] == 0xFFFFFFFF) {\n\t\t\tduprintf(\"Invalid hook entry %u %u\\n\",\n\t\t\t\t i, repl->hook_entry[i]);\n\t\t\treturn -EINVAL;\n\t\t}\n\t\tif (newinfo->underflow[i] == 0xFFFFFFFF) {\n\t\t\tduprintf(\"Invalid underflow %u %u\\n\",\n\t\t\t\t i, repl->underflow[i]);\n\t\t\treturn -EINVAL;\n\t\t}\n\t}\n\n\tif (!mark_source_chains(newinfo, repl->valid_hooks, entry0))\n\t\treturn -ELOOP;\n\n\t/* Finally, each sanity check must pass */\n\ti = 0;\n\txt_entry_foreach(iter, entry0, newinfo->size) {\n\t\tret = find_check_entry(iter, net, repl->name, repl->size);\n\t\tif (ret != 0)\n\t\t\tbreak;\n\t\t++i;\n\t}\n\n\tif (ret != 0) {\n\t\txt_entry_foreach(iter, entry0, newinfo->size) {\n\t\t\tif (i-- == 0)\n\t\t\t\tbreak;\n\t\t\tcleanup_entry(iter, net);\n\t\t}\n\t\treturn ret;\n\t}\n\n\treturn ret;\n}\n\nstatic void\nget_counters(const struct xt_table_info *t,\n\t struct xt_counters counters[])\n{\n\tstruct ipt_entry *iter;\n\tunsigned int cpu;\n\tunsigned int i;\n\n\tfor_each_possible_cpu(cpu) {\n\t\tseqcount_t *s = &per_cpu(xt_recseq, cpu);\n\n\t\ti = 0;\n\t\txt_entry_foreach(iter, t->entries, t->size) {\n\t\t\tstruct xt_counters *tmp;\n\t\t\tu64 bcnt, pcnt;\n\t\t\tunsigned int start;\n\n\t\t\ttmp = xt_get_per_cpu_counter(&iter->counters, cpu);\n\t\t\tdo {\n\t\t\t\tstart = read_seqcount_begin(s);\n\t\t\t\tbcnt = tmp->bcnt;\n\t\t\t\tpcnt = tmp->pcnt;\n\t\t\t} while (read_seqcount_retry(s, start));\n\n\t\t\tADD_COUNTER(counters[i], bcnt, pcnt);\n\t\t\t++i; /* macro does multi eval of i */\n\t\t}\n\t}\n}\n\nstatic struct xt_counters *alloc_counters(const struct xt_table *table)\n{\n\tunsigned int countersize;\n\tstruct xt_counters *counters;\n\tconst struct xt_table_info *private = table->private;\n\n\t/* We need atomic snapshot of counters: rest doesn't change\n\t (other than comefrom, which userspace doesn't care\n\t about). */\n\tcountersize = sizeof(struct xt_counters) * private->number;\n\tcounters = vzalloc(countersize);\n\n\tif (counters == NULL)\n\t\treturn ERR_PTR(-ENOMEM);\n\n\tget_counters(private, counters);\n\n\treturn counters;\n}\n\nstatic int\ncopy_entries_to_user(unsigned int total_size,\n\t\t const struct xt_table *table,\n\t\t void __user *userptr)\n{\n\tunsigned int off, num;\n\tconst struct ipt_entry *e;\n\tstruct xt_counters *counters;\n\tconst struct xt_table_info *private = table->private;\n\tint ret = 0;\n\tconst void *loc_cpu_entry;\n\n\tcounters = alloc_counters(table);\n\tif (IS_ERR(counters))\n\t\treturn PTR_ERR(counters);\n\n\tloc_cpu_entry = private->entries;\n\tif (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {\n\t\tret = -EFAULT;\n\t\tgoto free_counters;\n\t}\n\n\t/* FIXME: use iterator macros --RR */\n\t/* ... then go back and fix counters and names */\n\tfor (off = 0, num = 0; off < total_size; off += e->next_offset, num++){\n\t\tunsigned int i;\n\t\tconst struct xt_entry_match *m;\n\t\tconst struct xt_entry_target *t;\n\n\t\te = (struct ipt_entry *)(loc_cpu_entry + off);\n\t\tif (copy_to_user(userptr + off\n\t\t\t\t + offsetof(struct ipt_entry, counters),\n\t\t\t\t &counters[num],\n\t\t\t\t sizeof(counters[num])) != 0) {\n\t\t\tret = -EFAULT;\n\t\t\tgoto free_counters;\n\t\t}\n\n\t\tfor (i = sizeof(struct ipt_entry);\n\t\t i < e->target_offset;\n\t\t i += m->u.match_size) {\n\t\t\tm = (void *)e + i;\n\n\t\t\tif (copy_to_user(userptr + off + i\n\t\t\t\t\t + offsetof(struct xt_entry_match,\n\t\t\t\t\t\t u.user.name),\n\t\t\t\t\t m->u.kernel.match->name,\n\t\t\t\t\t strlen(m->u.kernel.match->name)+1)\n\t\t\t != 0) {\n\t\t\t\tret = -EFAULT;\n\t\t\t\tgoto free_counters;\n\t\t\t}\n\t\t}\n\n\t\tt = ipt_get_target_c(e);\n\t\tif (copy_to_user(userptr + off + e->target_offset\n\t\t\t\t + offsetof(struct xt_entry_target,\n\t\t\t\t\t u.user.name),\n\t\t\t\t t->u.kernel.target->name,\n\t\t\t\t strlen(t->u.kernel.target->name)+1) != 0) {\n\t\t\tret = -EFAULT;\n\t\t\tgoto free_counters;\n\t\t}\n\t}\n\n free_counters:\n\tvfree(counters);\n\treturn ret;\n}\n\n#ifdef CONFIG_COMPAT\nstatic void compat_standard_from_user(void *dst, const void *src)\n{\n\tint v = *(compat_int_t *)src;\n\n\tif (v > 0)\n\t\tv += xt_compat_calc_jump(AF_INET, v);\n\tmemcpy(dst, &v, sizeof(v));\n}\n\nstatic int compat_standard_to_user(void __user *dst, const void *src)\n{\n\tcompat_int_t cv = *(int *)src;\n\n\tif (cv > 0)\n\t\tcv -= xt_compat_calc_jump(AF_INET, cv);\n\treturn copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;\n}\n\nstatic int compat_calc_entry(const struct ipt_entry *e,\n\t\t\t const struct xt_table_info *info,\n\t\t\t const void *base, struct xt_table_info *newinfo)\n{\n\tconst struct xt_entry_match *ematch;\n\tconst struct xt_entry_target *t;\n\tunsigned int entry_offset;\n\tint off, i, ret;\n\n\toff = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\tentry_offset = (void *)e - base;\n\txt_ematch_foreach(ematch, e)\n\t\toff += xt_compat_match_offset(ematch->u.kernel.match);\n\tt = ipt_get_target_c(e);\n\toff += xt_compat_target_offset(t->u.kernel.target);\n\tnewinfo->size -= off;\n\tret = xt_compat_add_offset(AF_INET, entry_offset, off);\n\tif (ret)\n\t\treturn ret;\n\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\tif (info->hook_entry[i] &&\n\t\t (e < (struct ipt_entry *)(base + info->hook_entry[i])))\n\t\t\tnewinfo->hook_entry[i] -= off;\n\t\tif (info->underflow[i] &&\n\t\t (e < (struct ipt_entry *)(base + info->underflow[i])))\n\t\t\tnewinfo->underflow[i] -= off;\n\t}\n\treturn 0;\n}\n\nstatic int compat_table_info(const struct xt_table_info *info,\n\t\t\t struct xt_table_info *newinfo)\n{\n\tstruct ipt_entry *iter;\n\tconst void *loc_cpu_entry;\n\tint ret;\n\n\tif (!newinfo || !info)\n\t\treturn -EINVAL;\n\n\t/* we dont care about newinfo->entries */\n\tmemcpy(newinfo, info, offsetof(struct xt_table_info, entries));\n\tnewinfo->initial_entries = 0;\n\tloc_cpu_entry = info->entries;\n\txt_compat_init_offsets(AF_INET, info->number);\n\txt_entry_foreach(iter, loc_cpu_entry, info->size) {\n\t\tret = compat_calc_entry(iter, info, loc_cpu_entry, newinfo);\n\t\tif (ret != 0)\n\t\t\treturn ret;\n\t}\n\treturn 0;\n}\n#endif\n\nstatic int get_info(struct net *net, void __user *user,\n\t\t const int *len, int compat)\n{\n\tchar name[XT_TABLE_MAXNAMELEN];\n\tstruct xt_table *t;\n\tint ret;\n\n\tif (*len != sizeof(struct ipt_getinfo)) {\n\t\tduprintf(\"length %u != %zu\\n\", *len,\n\t\t\t sizeof(struct ipt_getinfo));\n\t\treturn -EINVAL;\n\t}\n\n\tif (copy_from_user(name, user, sizeof(name)) != 0)\n\t\treturn -EFAULT;\n\n\tname[XT_TABLE_MAXNAMELEN-1] = '\\0';\n#ifdef CONFIG_COMPAT\n\tif (compat)\n\t\txt_compat_lock(AF_INET);\n#endif\n\tt = try_then_request_module(xt_find_table_lock(net, AF_INET, name),\n\t\t\t\t \"iptable_%s\", name);\n\tif (!IS_ERR_OR_NULL(t)) {\n\t\tstruct ipt_getinfo info;\n\t\tconst struct xt_table_info *private = t->private;\n#ifdef CONFIG_COMPAT\n\t\tstruct xt_table_info tmp;\n\n\t\tif (compat) {\n\t\t\tret = compat_table_info(private, &tmp);\n\t\t\txt_compat_flush_offsets(AF_INET);\n\t\t\tprivate = &tmp;\n\t\t}\n#endif\n\t\tmemset(&info, 0, sizeof(info));\n\t\tinfo.valid_hooks = t->valid_hooks;\n\t\tmemcpy(info.hook_entry, private->hook_entry,\n\t\t sizeof(info.hook_entry));\n\t\tmemcpy(info.underflow, private->underflow,\n\t\t sizeof(info.underflow));\n\t\tinfo.num_entries = private->number;\n\t\tinfo.size = private->size;\n\t\tstrcpy(info.name, name);\n\n\t\tif (copy_to_user(user, &info, *len) != 0)\n\t\t\tret = -EFAULT;\n\t\telse\n\t\t\tret = 0;\n\n\t\txt_table_unlock(t);\n\t\tmodule_put(t->me);\n\t} else\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n#ifdef CONFIG_COMPAT\n\tif (compat)\n\t\txt_compat_unlock(AF_INET);\n#endif\n\treturn ret;\n}\n\nstatic int\nget_entries(struct net *net, struct ipt_get_entries __user *uptr,\n\t const int *len)\n{\n\tint ret;\n\tstruct ipt_get_entries get;\n\tstruct xt_table *t;\n\n\tif (*len < sizeof(get)) {\n\t\tduprintf(\"get_entries: %u < %zu\\n\", *len, sizeof(get));\n\t\treturn -EINVAL;\n\t}\n\tif (copy_from_user(&get, uptr, sizeof(get)) != 0)\n\t\treturn -EFAULT;\n\tif (*len != sizeof(struct ipt_get_entries) + get.size) {\n\t\tduprintf(\"get_entries: %u != %zu\\n\",\n\t\t\t *len, sizeof(get) + get.size);\n\t\treturn -EINVAL;\n\t}\n\n\tt = xt_find_table_lock(net, AF_INET, get.name);\n\tif (!IS_ERR_OR_NULL(t)) {\n\t\tconst struct xt_table_info *private = t->private;\n\t\tduprintf(\"t->private->number = %u\\n\", private->number);\n\t\tif (get.size == private->size)\n\t\t\tret = copy_entries_to_user(private->size,\n\t\t\t\t\t\t t, uptr->entrytable);\n\t\telse {\n\t\t\tduprintf(\"get_entries: I've got %u not %u!\\n\",\n\t\t\t\t private->size, get.size);\n\t\t\tret = -EAGAIN;\n\t\t}\n\t\tmodule_put(t->me);\n\t\txt_table_unlock(t);\n\t} else\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n\n\treturn ret;\n}\n\nstatic int\n__do_replace(struct net *net, const char *name, unsigned int valid_hooks,\n\t struct xt_table_info *newinfo, unsigned int num_counters,\n\t void __user *counters_ptr)\n{\n\tint ret;\n\tstruct xt_table *t;\n\tstruct xt_table_info *oldinfo;\n\tstruct xt_counters *counters;\n\tstruct ipt_entry *iter;\n\n\tret = 0;\n\tcounters = vzalloc(num_counters * sizeof(struct xt_counters));\n\tif (!counters) {\n\t\tret = -ENOMEM;\n\t\tgoto out;\n\t}\n\n\tt = try_then_request_module(xt_find_table_lock(net, AF_INET, name),\n\t\t\t\t \"iptable_%s\", name);\n\tif (IS_ERR_OR_NULL(t)) {\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n\t\tgoto free_newinfo_counters_untrans;\n\t}\n\n\t/* You lied! */\n\tif (valid_hooks != t->valid_hooks) {\n\t\tduprintf(\"Valid hook crap: %08X vs %08X\\n\",\n\t\t\t valid_hooks, t->valid_hooks);\n\t\tret = -EINVAL;\n\t\tgoto put_module;\n\t}\n\n\toldinfo = xt_replace_table(t, num_counters, newinfo, &ret);\n\tif (!oldinfo)\n\t\tgoto put_module;\n\n\t/* Update module usage count based on number of rules */\n\tduprintf(\"do_replace: oldnum=%u, initnum=%u, newnum=%u\\n\",\n\t\toldinfo->number, oldinfo->initial_entries, newinfo->number);\n\tif ((oldinfo->number > oldinfo->initial_entries) ||\n\t (newinfo->number <= oldinfo->initial_entries))\n\t\tmodule_put(t->me);\n\tif ((oldinfo->number > oldinfo->initial_entries) &&\n\t (newinfo->number <= oldinfo->initial_entries))\n\t\tmodule_put(t->me);\n\n\t/* Get the old counters, and synchronize with replace */\n\tget_counters(oldinfo, counters);\n\n\t/* Decrease module usage counts and free resource */\n\txt_entry_foreach(iter, oldinfo->entries, oldinfo->size)\n\t\tcleanup_entry(iter, net);\n\n\txt_free_table_info(oldinfo);\n\tif (copy_to_user(counters_ptr, counters,\n\t\t\t sizeof(struct xt_counters) * num_counters) != 0) {\n\t\t/* Silent error, can't fail, new table is already in place */\n\t\tnet_warn_ratelimited(\"iptables: counters copy to user failed while replacing table\\n\");\n\t}\n\tvfree(counters);\n\txt_table_unlock(t);\n\treturn ret;\n\n put_module:\n\tmodule_put(t->me);\n\txt_table_unlock(t);\n free_newinfo_counters_untrans:\n\tvfree(counters);\n out:\n\treturn ret;\n}\n\nstatic int\ndo_replace(struct net *net, const void __user *user, unsigned int len)\n{\n\tint ret;\n\tstruct ipt_replace tmp;\n\tstruct xt_table_info *newinfo;\n\tvoid *loc_cpu_entry;\n\tstruct ipt_entry *iter;\n\n\tif (copy_from_user(&tmp, user, sizeof(tmp)) != 0)\n\t\treturn -EFAULT;\n\n\t/* overflow check */\n\tif (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))\n\t\treturn -ENOMEM;\n\tif (tmp.num_counters == 0)\n\t\treturn -EINVAL;\n\n\ttmp.name[sizeof(tmp.name)-1] = 0;\n\n\tnewinfo = xt_alloc_table_info(tmp.size);\n\tif (!newinfo)\n\t\treturn -ENOMEM;\n\n\tloc_cpu_entry = newinfo->entries;\n\tif (copy_from_user(loc_cpu_entry, user + sizeof(tmp),\n\t\t\t tmp.size) != 0) {\n\t\tret = -EFAULT;\n\t\tgoto free_newinfo;\n\t}\n\n\tret = translate_table(net, newinfo, loc_cpu_entry, &tmp);\n\tif (ret != 0)\n\t\tgoto free_newinfo;\n\n\tduprintf(\"Translated table\\n\");\n\n\tret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,\n\t\t\t tmp.num_counters, tmp.counters);\n\tif (ret)\n\t\tgoto free_newinfo_untrans;\n\treturn 0;\n\n free_newinfo_untrans:\n\txt_entry_foreach(iter, loc_cpu_entry, newinfo->size)\n\t\tcleanup_entry(iter, net);\n free_newinfo:\n\txt_free_table_info(newinfo);\n\treturn ret;\n}\n\nstatic int\ndo_add_counters(struct net *net, const void __user *user,\n\t\tunsigned int len, int compat)\n{\n\tunsigned int i;\n\tstruct xt_counters_info tmp;\n\tstruct xt_counters *paddc;\n\tunsigned int num_counters;\n\tconst char *name;\n\tint size;\n\tvoid *ptmp;\n\tstruct xt_table *t;\n\tconst struct xt_table_info *private;\n\tint ret = 0;\n\tstruct ipt_entry *iter;\n\tunsigned int addend;\n#ifdef CONFIG_COMPAT\n\tstruct compat_xt_counters_info compat_tmp;\n\n\tif (compat) {\n\t\tptmp = &compat_tmp;\n\t\tsize = sizeof(struct compat_xt_counters_info);\n\t} else\n#endif\n\t{\n\t\tptmp = &tmp;\n\t\tsize = sizeof(struct xt_counters_info);\n\t}\n\n\tif (copy_from_user(ptmp, user, size) != 0)\n\t\treturn -EFAULT;\n\n#ifdef CONFIG_COMPAT\n\tif (compat) {\n\t\tnum_counters = compat_tmp.num_counters;\n\t\tname = compat_tmp.name;\n\t} else\n#endif\n\t{\n\t\tnum_counters = tmp.num_counters;\n\t\tname = tmp.name;\n\t}\n\n\tif (len != size + num_counters * sizeof(struct xt_counters))\n\t\treturn -EINVAL;\n\n\tpaddc = vmalloc(len - size);\n\tif (!paddc)\n\t\treturn -ENOMEM;\n\n\tif (copy_from_user(paddc, user + size, len - size) != 0) {\n\t\tret = -EFAULT;\n\t\tgoto free;\n\t}\n\n\tt = xt_find_table_lock(net, AF_INET, name);\n\tif (IS_ERR_OR_NULL(t)) {\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n\t\tgoto free;\n\t}\n\n\tlocal_bh_disable();\n\tprivate = t->private;\n\tif (private->number != num_counters) {\n\t\tret = -EINVAL;\n\t\tgoto unlock_up_free;\n\t}\n\n\ti = 0;\n\taddend = xt_write_recseq_begin();\n\txt_entry_foreach(iter, private->entries, private->size) {\n\t\tstruct xt_counters *tmp;\n\n\t\ttmp = xt_get_this_cpu_counter(&iter->counters);\n\t\tADD_COUNTER(*tmp, paddc[i].bcnt, paddc[i].pcnt);\n\t\t++i;\n\t}\n\txt_write_recseq_end(addend);\n unlock_up_free:\n\tlocal_bh_enable();\n\txt_table_unlock(t);\n\tmodule_put(t->me);\n free:\n\tvfree(paddc);\n\n\treturn ret;\n}\n\n#ifdef CONFIG_COMPAT\nstruct compat_ipt_replace {\n\tchar\t\t\tname[XT_TABLE_MAXNAMELEN];\n\tu32\t\t\tvalid_hooks;\n\tu32\t\t\tnum_entries;\n\tu32\t\t\tsize;\n\tu32\t\t\thook_entry[NF_INET_NUMHOOKS];\n\tu32\t\t\tunderflow[NF_INET_NUMHOOKS];\n\tu32\t\t\tnum_counters;\n\tcompat_uptr_t\t\tcounters;\t/* struct xt_counters * */\n\tstruct compat_ipt_entry\tentries[0];\n};\n\nstatic int\ncompat_copy_entry_to_user(struct ipt_entry *e, void __user **dstptr,\n\t\t\t unsigned int *size, struct xt_counters *counters,\n\t\t\t unsigned int i)\n{\n\tstruct xt_entry_target *t;\n\tstruct compat_ipt_entry __user *ce;\n\tu_int16_t target_offset, next_offset;\n\tcompat_uint_t origsize;\n\tconst struct xt_entry_match *ematch;\n\tint ret = 0;\n\n\torigsize = *size;\n\tce = (struct compat_ipt_entry __user *)*dstptr;\n\tif (copy_to_user(ce, e, sizeof(struct ipt_entry)) != 0 ||\n\t copy_to_user(&ce->counters, &counters[i],\n\t sizeof(counters[i])) != 0)\n\t\treturn -EFAULT;\n\n\t*dstptr += sizeof(struct compat_ipt_entry);\n\t*size -= sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\n\txt_ematch_foreach(ematch, e) {\n\t\tret = xt_compat_match_to_user(ematch, dstptr, size);\n\t\tif (ret != 0)\n\t\t\treturn ret;\n\t}\n\ttarget_offset = e->target_offset - (origsize - *size);\n\tt = ipt_get_target(e);\n\tret = xt_compat_target_to_user(t, dstptr, size);\n\tif (ret)\n\t\treturn ret;\n\tnext_offset = e->next_offset - (origsize - *size);\n\tif (put_user(target_offset, &ce->target_offset) != 0 ||\n\t put_user(next_offset, &ce->next_offset) != 0)\n\t\treturn -EFAULT;\n\treturn 0;\n}\n\nstatic int\ncompat_find_calc_match(struct xt_entry_match *m,\n\t\t const char *name,\n\t\t const struct ipt_ip *ip,\n\t\t int *size)\n{\n\tstruct xt_match *match;\n\n\tmatch = xt_request_find_match(NFPROTO_IPV4, m->u.user.name,\n\t\t\t\t m->u.user.revision);\n\tif (IS_ERR(match)) {\n\t\tduprintf(\"compat_check_calc_match: `%s' not found\\n\",\n\t\t\t m->u.user.name);\n\t\treturn PTR_ERR(match);\n\t}\n\tm->u.kernel.match = match;\n\t*size += xt_compat_match_offset(match);\n\treturn 0;\n}\n\nstatic void compat_release_entry(struct compat_ipt_entry *e)\n{\n\tstruct xt_entry_target *t;\n\tstruct xt_entry_match *ematch;\n\n\t/* Cleanup all matches */\n\txt_ematch_foreach(ematch, e)\n\t\tmodule_put(ematch->u.kernel.match->me);\n\tt = compat_ipt_get_target(e);\n\tmodule_put(t->u.kernel.target->me);\n}\n\nstatic int\ncheck_compat_entry_size_and_hooks(struct compat_ipt_entry *e,\n\t\t\t\t struct xt_table_info *newinfo,\n\t\t\t\t unsigned int *size,\n\t\t\t\t const unsigned char *base,\n\t\t\t\t const unsigned char *limit,\n\t\t\t\t const unsigned int *hook_entries,\n\t\t\t\t const unsigned int *underflows,\n\t\t\t\t const char *name)\n{\n\tstruct xt_entry_match *ematch;\n\tstruct xt_entry_target *t;\n\tstruct xt_target *target;\n\tunsigned int entry_offset;\n\tunsigned int j;\n\tint ret, off, h;\n\n\tduprintf(\"check_compat_entry_size_and_hooks %p\\n\", e);\n\tif ((unsigned long)e % __alignof__(struct compat_ipt_entry) != 0 ||\n\t (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit ||\n\t (unsigned char *)e + e->next_offset > limit) {\n\t\tduprintf(\"Bad offset %p, limit = %p\\n\", e, limit);\n\t\treturn -EINVAL;\n\t}\n\n\tif (e->next_offset < sizeof(struct compat_ipt_entry) +\n\t\t\t sizeof(struct compat_xt_entry_target)) {\n\t\tduprintf(\"checking: element %p size %u\\n\",\n\t\t\t e, e->next_offset);\n\t\treturn -EINVAL;\n\t}\n\n\t/* For purposes of check_entry casting the compat entry is fine */\n\tret = check_entry((struct ipt_entry *)e);\n\tif (ret)\n\t\treturn ret;\n\n\toff = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\tentry_offset = (void *)e - (void *)base;\n\tj = 0;\n\txt_ematch_foreach(ematch, e) {\n\t\tret = compat_find_calc_match(ematch, name, &e->ip, &off);\n\t\tif (ret != 0)\n\t\t\tgoto release_matches;\n\t\t++j;\n\t}\n\n\tt = compat_ipt_get_target(e);\n\ttarget = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,\n\t\t\t\t\tt->u.user.revision);\n\tif (IS_ERR(target)) {\n\t\tduprintf(\"check_compat_entry_size_and_hooks: `%s' not found\\n\",\n\t\t\t t->u.user.name);\n\t\tret = PTR_ERR(target);\n\t\tgoto release_matches;\n\t}\n\tt->u.kernel.target = target;\n\n\toff += xt_compat_target_offset(target);\n\t*size += off;\n\tret = xt_compat_add_offset(AF_INET, entry_offset, off);\n\tif (ret)\n\t\tgoto out;\n\n\t/* Check hooks & underflows */\n\tfor (h = 0; h < NF_INET_NUMHOOKS; h++) {\n\t\tif ((unsigned char *)e - base == hook_entries[h])\n\t\t\tnewinfo->hook_entry[h] = hook_entries[h];\n\t\tif ((unsigned char *)e - base == underflows[h])\n\t\t\tnewinfo->underflow[h] = underflows[h];\n\t}\n\n\t/* Clear counters and comefrom */\n\tmemset(&e->counters, 0, sizeof(e->counters));\n\te->comefrom = 0;\n\treturn 0;\n\nout:\n\tmodule_put(t->u.kernel.target->me);\nrelease_matches:\n\txt_ematch_foreach(ematch, e) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tmodule_put(ematch->u.kernel.match->me);\n\t}\n\treturn ret;\n}\n\nstatic int\ncompat_copy_entry_from_user(struct compat_ipt_entry *e, void **dstptr,\n\t\t\t unsigned int *size, const char *name,\n\t\t\t struct xt_table_info *newinfo, unsigned char *base)\n{\n\tstruct xt_entry_target *t;\n\tstruct xt_target *target;\n\tstruct ipt_entry *de;\n\tunsigned int origsize;\n\tint ret, h;\n\tstruct xt_entry_match *ematch;\n\n\tret = 0;\n\torigsize = *size;\n\tde = (struct ipt_entry *)*dstptr;\n\tmemcpy(de, e, sizeof(struct ipt_entry));\n\tmemcpy(&de->counters, &e->counters, sizeof(e->counters));\n\n\t*dstptr += sizeof(struct ipt_entry);\n\t*size += sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\n\txt_ematch_foreach(ematch, e) {\n\t\tret = xt_compat_match_from_user(ematch, dstptr, size);\n\t\tif (ret != 0)\n\t\t\treturn ret;\n\t}\n\tde->target_offset = e->target_offset - (origsize - *size);\n\tt = compat_ipt_get_target(e);\n\ttarget = t->u.kernel.target;\n\txt_compat_target_from_user(t, dstptr, size);\n\n\tde->next_offset = e->next_offset - (origsize - *size);\n\tfor (h = 0; h < NF_INET_NUMHOOKS; h++) {\n\t\tif ((unsigned char *)de - base < newinfo->hook_entry[h])\n\t\t\tnewinfo->hook_entry[h] -= origsize - *size;\n\t\tif ((unsigned char *)de - base < newinfo->underflow[h])\n\t\t\tnewinfo->underflow[h] -= origsize - *size;\n\t}\n\treturn ret;\n}\n\nstatic int\ncompat_check_entry(struct ipt_entry *e, struct net *net, const char *name)\n{\n\tstruct xt_entry_match *ematch;\n\tstruct xt_mtchk_param mtpar;\n\tunsigned int j;\n\tint ret = 0;\n\n\te->counters.pcnt = xt_percpu_counter_alloc();\n\tif (IS_ERR_VALUE(e->counters.pcnt))\n\t\treturn -ENOMEM;\n\n\tj = 0;\n\tmtpar.net\t= net;\n\tmtpar.table = name;\n\tmtpar.entryinfo = &e->ip;\n\tmtpar.hook_mask = e->comefrom;\n\tmtpar.family = NFPROTO_IPV4;\n\txt_ematch_foreach(ematch, e) {\n\t\tret = check_match(ematch, &mtpar);\n\t\tif (ret != 0)\n\t\t\tgoto cleanup_matches;\n\t\t++j;\n\t}\n\n\tret = check_target(e, net, name);\n\tif (ret)\n\t\tgoto cleanup_matches;\n\treturn 0;\n\n cleanup_matches:\n\txt_ematch_foreach(ematch, e) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tcleanup_match(ematch, net);\n\t}\n\n\txt_percpu_counter_free(e->counters.pcnt);\n\n\treturn ret;\n}\n\nstatic int\ntranslate_compat_table(struct net *net,\n\t\t const char *name,\n\t\t unsigned int valid_hooks,\n\t\t struct xt_table_info **pinfo,\n\t\t void **pentry0,\n\t\t unsigned int total_size,\n\t\t unsigned int number,\n\t\t unsigned int *hook_entries,\n\t\t unsigned int *underflows)\n{\n\tunsigned int i, j;\n\tstruct xt_table_info *newinfo, *info;\n\tvoid *pos, *entry0, *entry1;\n\tstruct compat_ipt_entry *iter0;\n\tstruct ipt_entry *iter1;\n\tunsigned int size;\n\tint ret;\n\n\tinfo = *pinfo;\n\tentry0 = *pentry0;\n\tsize = total_size;\n\tinfo->number = number;\n\n\t/* Init all hooks to impossible value. */\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\tinfo->hook_entry[i] = 0xFFFFFFFF;\n\t\tinfo->underflow[i] = 0xFFFFFFFF;\n\t}\n\n\tduprintf(\"translate_compat_table: size %u\\n\", info->size);\n\tj = 0;\n\txt_compat_lock(AF_INET);\n\txt_compat_init_offsets(AF_INET, number);\n\t/* Walk through entries, checking offsets. */\n\txt_entry_foreach(iter0, entry0, total_size) {\n\t\tret = check_compat_entry_size_and_hooks(iter0, info, &size,\n\t\t\t\t\t\t\tentry0,\n\t\t\t\t\t\t\tentry0 + total_size,\n\t\t\t\t\t\t\thook_entries,\n\t\t\t\t\t\t\tunderflows,\n\t\t\t\t\t\t\tname);\n\t\tif (ret != 0)\n\t\t\tgoto out_unlock;\n\t\t++j;\n\t}\n\n\tret = -EINVAL;\n\tif (j != number) {\n\t\tduprintf(\"translate_compat_table: %u not %u entries\\n\",\n\t\t\t j, number);\n\t\tgoto out_unlock;\n\t}\n\n\t/* Check hooks all assigned */\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\t/* Only hooks which are valid */\n\t\tif (!(valid_hooks & (1 << i)))\n\t\t\tcontinue;\n\t\tif (info->hook_entry[i] == 0xFFFFFFFF) {\n\t\t\tduprintf(\"Invalid hook entry %u %u\\n\",\n\t\t\t\t i, hook_entries[i]);\n\t\t\tgoto out_unlock;\n\t\t}\n\t\tif (info->underflow[i] == 0xFFFFFFFF) {\n\t\t\tduprintf(\"Invalid underflow %u %u\\n\",\n\t\t\t\t i, underflows[i]);\n\t\t\tgoto out_unlock;\n\t\t}\n\t}\n\n\tret = -ENOMEM;\n\tnewinfo = xt_alloc_table_info(size);\n\tif (!newinfo)\n\t\tgoto out_unlock;\n\n\tnewinfo->number = number;\n\tfor (i = 0; i < NF_INET_NUMHOOKS; i++) {\n\t\tnewinfo->hook_entry[i] = info->hook_entry[i];\n\t\tnewinfo->underflow[i] = info->underflow[i];\n\t}\n\tentry1 = newinfo->entries;\n\tpos = entry1;\n\tsize = total_size;\n\txt_entry_foreach(iter0, entry0, total_size) {\n\t\tret = compat_copy_entry_from_user(iter0, &pos, &size,\n\t\t\t\t\t\t name, newinfo, entry1);\n\t\tif (ret != 0)\n\t\t\tbreak;\n\t}\n\txt_compat_flush_offsets(AF_INET);\n\txt_compat_unlock(AF_INET);\n\tif (ret)\n\t\tgoto free_newinfo;\n\n\tret = -ELOOP;\n\tif (!mark_source_chains(newinfo, valid_hooks, entry1))\n\t\tgoto free_newinfo;\n\n\ti = 0;\n\txt_entry_foreach(iter1, entry1, newinfo->size) {\n\t\tret = compat_check_entry(iter1, net, name);\n\t\tif (ret != 0)\n\t\t\tbreak;\n\t\t++i;\n\t\tif (strcmp(ipt_get_target(iter1)->u.user.name,\n\t\t XT_ERROR_TARGET) == 0)\n\t\t\t++newinfo->stacksize;\n\t}\n\tif (ret) {\n\t\t/*\n\t\t * The first i matches need cleanup_entry (calls ->destroy)\n\t\t * because they had called ->check already. The other j-i\n\t\t * entries need only release.\n\t\t */\n\t\tint skip = i;\n\t\tj -= i;\n\t\txt_entry_foreach(iter0, entry0, newinfo->size) {\n\t\t\tif (skip-- > 0)\n\t\t\t\tcontinue;\n\t\t\tif (j-- == 0)\n\t\t\t\tbreak;\n\t\t\tcompat_release_entry(iter0);\n\t\t}\n\t\txt_entry_foreach(iter1, entry1, newinfo->size) {\n\t\t\tif (i-- == 0)\n\t\t\t\tbreak;\n\t\t\tcleanup_entry(iter1, net);\n\t\t}\n\t\txt_free_table_info(newinfo);\n\t\treturn ret;\n\t}\n\n\t*pinfo = newinfo;\n\t*pentry0 = entry1;\n\txt_free_table_info(info);\n\treturn 0;\n\nfree_newinfo:\n\txt_free_table_info(newinfo);\nout:\n\txt_entry_foreach(iter0, entry0, total_size) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tcompat_release_entry(iter0);\n\t}\n\treturn ret;\nout_unlock:\n\txt_compat_flush_offsets(AF_INET);\n\txt_compat_unlock(AF_INET);\n\tgoto out;\n}\n\nstatic int\ncompat_do_replace(struct net *net, void __user *user, unsigned int len)\n{\n\tint ret;\n\tstruct compat_ipt_replace tmp;\n\tstruct xt_table_info *newinfo;\n\tvoid *loc_cpu_entry;\n\tstruct ipt_entry *iter;\n\n\tif (copy_from_user(&tmp, user, sizeof(tmp)) != 0)\n\t\treturn -EFAULT;\n\n\t/* overflow check */\n\tif (tmp.size >= INT_MAX / num_possible_cpus())\n\t\treturn -ENOMEM;\n\tif (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))\n\t\treturn -ENOMEM;\n\tif (tmp.num_counters == 0)\n\t\treturn -EINVAL;\n\n\ttmp.name[sizeof(tmp.name)-1] = 0;\n\n\tnewinfo = xt_alloc_table_info(tmp.size);\n\tif (!newinfo)\n\t\treturn -ENOMEM;\n\n\tloc_cpu_entry = newinfo->entries;\n\tif (copy_from_user(loc_cpu_entry, user + sizeof(tmp),\n\t\t\t tmp.size) != 0) {\n\t\tret = -EFAULT;\n\t\tgoto free_newinfo;\n\t}\n\n\tret = translate_compat_table(net, tmp.name, tmp.valid_hooks,\n\t\t\t\t &newinfo, &loc_cpu_entry, tmp.size,\n\t\t\t\t tmp.num_entries, tmp.hook_entry,\n\t\t\t\t tmp.underflow);\n\tif (ret != 0)\n\t\tgoto free_newinfo;\n\n\tduprintf(\"compat_do_replace: Translated table\\n\");\n\n\tret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,\n\t\t\t tmp.num_counters, compat_ptr(tmp.counters));\n\tif (ret)\n\t\tgoto free_newinfo_untrans;\n\treturn 0;\n\n free_newinfo_untrans:\n\txt_entry_foreach(iter, loc_cpu_entry, newinfo->size)\n\t\tcleanup_entry(iter, net);\n free_newinfo:\n\txt_free_table_info(newinfo);\n\treturn ret;\n}\n\nstatic int\ncompat_do_ipt_set_ctl(struct sock *sk,\tint cmd, void __user *user,\n\t\t unsigned int len)\n{\n\tint ret;\n\n\tif (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))\n\t\treturn -EPERM;\n\n\tswitch (cmd) {\n\tcase IPT_SO_SET_REPLACE:\n\t\tret = compat_do_replace(sock_net(sk), user, len);\n\t\tbreak;\n\n\tcase IPT_SO_SET_ADD_COUNTERS:\n\t\tret = do_add_counters(sock_net(sk), user, len, 1);\n\t\tbreak;\n\n\tdefault:\n\t\tduprintf(\"do_ipt_set_ctl: unknown request %i\\n\", cmd);\n\t\tret = -EINVAL;\n\t}\n\n\treturn ret;\n}\n\nstruct compat_ipt_get_entries {\n\tchar name[XT_TABLE_MAXNAMELEN];\n\tcompat_uint_t size;\n\tstruct compat_ipt_entry entrytable[0];\n};\n\nstatic int\ncompat_copy_entries_to_user(unsigned int total_size, struct xt_table *table,\n\t\t\t void __user *userptr)\n{\n\tstruct xt_counters *counters;\n\tconst struct xt_table_info *private = table->private;\n\tvoid __user *pos;\n\tunsigned int size;\n\tint ret = 0;\n\tunsigned int i = 0;\n\tstruct ipt_entry *iter;\n\n\tcounters = alloc_counters(table);\n\tif (IS_ERR(counters))\n\t\treturn PTR_ERR(counters);\n\n\tpos = userptr;\n\tsize = total_size;\n\txt_entry_foreach(iter, private->entries, total_size) {\n\t\tret = compat_copy_entry_to_user(iter, &pos,\n\t\t\t\t\t\t&size, counters, i++);\n\t\tif (ret != 0)\n\t\t\tbreak;\n\t}\n\n\tvfree(counters);\n\treturn ret;\n}\n\nstatic int\ncompat_get_entries(struct net *net, struct compat_ipt_get_entries __user *uptr,\n\t\t int *len)\n{\n\tint ret;\n\tstruct compat_ipt_get_entries get;\n\tstruct xt_table *t;\n\n\tif (*len < sizeof(get)) {\n\t\tduprintf(\"compat_get_entries: %u < %zu\\n\", *len, sizeof(get));\n\t\treturn -EINVAL;\n\t}\n\n\tif (copy_from_user(&get, uptr, sizeof(get)) != 0)\n\t\treturn -EFAULT;\n\n\tif (*len != sizeof(struct compat_ipt_get_entries) + get.size) {\n\t\tduprintf(\"compat_get_entries: %u != %zu\\n\",\n\t\t\t *len, sizeof(get) + get.size);\n\t\treturn -EINVAL;\n\t}\n\n\txt_compat_lock(AF_INET);\n\tt = xt_find_table_lock(net, AF_INET, get.name);\n\tif (!IS_ERR_OR_NULL(t)) {\n\t\tconst struct xt_table_info *private = t->private;\n\t\tstruct xt_table_info info;\n\t\tduprintf(\"t->private->number = %u\\n\", private->number);\n\t\tret = compat_table_info(private, &info);\n\t\tif (!ret && get.size == info.size) {\n\t\t\tret = compat_copy_entries_to_user(private->size,\n\t\t\t\t\t\t\t t, uptr->entrytable);\n\t\t} else if (!ret) {\n\t\t\tduprintf(\"compat_get_entries: I've got %u not %u!\\n\",\n\t\t\t\t private->size, get.size);\n\t\t\tret = -EAGAIN;\n\t\t}\n\t\txt_compat_flush_offsets(AF_INET);\n\t\tmodule_put(t->me);\n\t\txt_table_unlock(t);\n\t} else\n\t\tret = t ? PTR_ERR(t) : -ENOENT;\n\n\txt_compat_unlock(AF_INET);\n\treturn ret;\n}\n\nstatic int do_ipt_get_ctl(struct sock *, int, void __user *, int *);\n\nstatic int\ncompat_do_ipt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)\n{\n\tint ret;\n\n\tif (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))\n\t\treturn -EPERM;\n\n\tswitch (cmd) {\n\tcase IPT_SO_GET_INFO:\n\t\tret = get_info(sock_net(sk), user, len, 1);\n\t\tbreak;\n\tcase IPT_SO_GET_ENTRIES:\n\t\tret = compat_get_entries(sock_net(sk), user, len);\n\t\tbreak;\n\tdefault:\n\t\tret = do_ipt_get_ctl(sk, cmd, user, len);\n\t}\n\treturn ret;\n}\n#endif\n\nstatic int\ndo_ipt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)\n{\n\tint ret;\n\n\tif (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))\n\t\treturn -EPERM;\n\n\tswitch (cmd) {\n\tcase IPT_SO_SET_REPLACE:\n\t\tret = do_replace(sock_net(sk), user, len);\n\t\tbreak;\n\n\tcase IPT_SO_SET_ADD_COUNTERS:\n\t\tret = do_add_counters(sock_net(sk), user, len, 0);\n\t\tbreak;\n\n\tdefault:\n\t\tduprintf(\"do_ipt_set_ctl: unknown request %i\\n\", cmd);\n\t\tret = -EINVAL;\n\t}\n\n\treturn ret;\n}\n\nstatic int\ndo_ipt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)\n{\n\tint ret;\n\n\tif (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))\n\t\treturn -EPERM;\n\n\tswitch (cmd) {\n\tcase IPT_SO_GET_INFO:\n\t\tret = get_info(sock_net(sk), user, len, 0);\n\t\tbreak;\n\n\tcase IPT_SO_GET_ENTRIES:\n\t\tret = get_entries(sock_net(sk), user, len);\n\t\tbreak;\n\n\tcase IPT_SO_GET_REVISION_MATCH:\n\tcase IPT_SO_GET_REVISION_TARGET: {\n\t\tstruct xt_get_revision rev;\n\t\tint target;\n\n\t\tif (*len != sizeof(rev)) {\n\t\t\tret = -EINVAL;\n\t\t\tbreak;\n\t\t}\n\t\tif (copy_from_user(&rev, user, sizeof(rev)) != 0) {\n\t\t\tret = -EFAULT;\n\t\t\tbreak;\n\t\t}\n\t\trev.name[sizeof(rev.name)-1] = 0;\n\n\t\tif (cmd == IPT_SO_GET_REVISION_TARGET)\n\t\t\ttarget = 1;\n\t\telse\n\t\t\ttarget = 0;\n\n\t\ttry_then_request_module(xt_find_revision(AF_INET, rev.name,\n\t\t\t\t\t\t\t rev.revision,\n\t\t\t\t\t\t\t target, &ret),\n\t\t\t\t\t\"ipt_%s\", rev.name);\n\t\tbreak;\n\t}\n\n\tdefault:\n\t\tduprintf(\"do_ipt_get_ctl: unknown request %i\\n\", cmd);\n\t\tret = -EINVAL;\n\t}\n\n\treturn ret;\n}\n\nstatic void __ipt_unregister_table(struct net *net, struct xt_table *table)\n{\n\tstruct xt_table_info *private;\n\tvoid *loc_cpu_entry;\n\tstruct module *table_owner = table->me;\n\tstruct ipt_entry *iter;\n\n\tprivate = xt_unregister_table(table);\n\n\t/* Decrease module usage counts and free resources */\n\tloc_cpu_entry = private->entries;\n\txt_entry_foreach(iter, loc_cpu_entry, private->size)\n\t\tcleanup_entry(iter, net);\n\tif (private->number > private->initial_entries)\n\t\tmodule_put(table_owner);\n\txt_free_table_info(private);\n}\n\nint ipt_register_table(struct net *net, const struct xt_table *table,\n\t\t const struct ipt_replace *repl,\n\t\t const struct nf_hook_ops *ops, struct xt_table **res)\n{\n\tint ret;\n\tstruct xt_table_info *newinfo;\n\tstruct xt_table_info bootstrap = {0};\n\tvoid *loc_cpu_entry;\n\tstruct xt_table *new_table;\n\n\tnewinfo = xt_alloc_table_info(repl->size);\n\tif (!newinfo)\n\t\treturn -ENOMEM;\n\n\tloc_cpu_entry = newinfo->entries;\n\tmemcpy(loc_cpu_entry, repl->entries, repl->size);\n\n\tret = translate_table(net, newinfo, loc_cpu_entry, repl);\n\tif (ret != 0)\n\t\tgoto out_free;\n\n\tnew_table = xt_register_table(net, table, &bootstrap, newinfo);\n\tif (IS_ERR(new_table)) {\n\t\tret = PTR_ERR(new_table);\n\t\tgoto out_free;\n\t}\n\n\t/* set res now, will see skbs right after nf_register_net_hooks */\n\tWRITE_ONCE(*res, new_table);\n\n\tret = nf_register_net_hooks(net, ops, hweight32(table->valid_hooks));\n\tif (ret != 0) {\n\t\t__ipt_unregister_table(net, new_table);\n\t\t*res = NULL;\n\t}\n\n\treturn ret;\n\nout_free:\n\txt_free_table_info(newinfo);\n\treturn ret;\n}\n\nvoid ipt_unregister_table(struct net *net, struct xt_table *table,\n\t\t\t const struct nf_hook_ops *ops)\n{\n\tnf_unregister_net_hooks(net, ops, hweight32(table->valid_hooks));\n\t__ipt_unregister_table(net, table);\n}\n\n/* Returns 1 if the type and code is matched by the range, 0 otherwise */\nstatic inline bool\nicmp_type_code_match(u_int8_t test_type, u_int8_t min_code, u_int8_t max_code,\n\t\t u_int8_t type, u_int8_t code,\n\t\t bool invert)\n{\n\treturn ((test_type == 0xFF) ||\n\t\t(type == test_type && code >= min_code && code <= max_code))\n\t\t^ invert;\n}\n\nstatic bool\nicmp_match(const struct sk_buff *skb, struct xt_action_param *par)\n{\n\tconst struct icmphdr *ic;\n\tstruct icmphdr _icmph;\n\tconst struct ipt_icmp *icmpinfo = par->matchinfo;\n\n\t/* Must not be a fragment. */\n\tif (par->fragoff != 0)\n\t\treturn false;\n\n\tic = skb_header_pointer(skb, par->thoff, sizeof(_icmph), &_icmph);\n\tif (ic == NULL) {\n\t\t/* We've been asked to examine this packet, and we\n\t\t * can't. Hence, no choice but to drop.\n\t\t */\n\t\tduprintf(\"Dropping evil ICMP tinygram.\\n\");\n\t\tpar->hotdrop = true;\n\t\treturn false;\n\t}\n\n\treturn icmp_type_code_match(icmpinfo->type,\n\t\t\t\t icmpinfo->code[0],\n\t\t\t\t icmpinfo->code[1],\n\t\t\t\t ic->type, ic->code,\n\t\t\t\t !!(icmpinfo->invflags&IPT_ICMP_INV));\n}\n\nstatic int icmp_checkentry(const struct xt_mtchk_param *par)\n{\n\tconst struct ipt_icmp *icmpinfo = par->matchinfo;\n\n\t/* Must specify no unknown invflags */\n\treturn (icmpinfo->invflags & ~IPT_ICMP_INV) ? -EINVAL : 0;\n}\n\nstatic struct xt_target ipt_builtin_tg[] __read_mostly = {\n\t{\n\t\t.name = XT_STANDARD_TARGET,\n\t\t.targetsize = sizeof(int),\n\t\t.family = NFPROTO_IPV4,\n#ifdef CONFIG_COMPAT\n\t\t.compatsize = sizeof(compat_int_t),\n\t\t.compat_from_user = compat_standard_from_user,\n\t\t.compat_to_user = compat_standard_to_user,\n#endif\n\t},\n\t{\n\t\t.name = XT_ERROR_TARGET,\n\t\t.target = ipt_error,\n\t\t.targetsize = XT_FUNCTION_MAXNAMELEN,\n\t\t.family = NFPROTO_IPV4,\n\t},\n};\n\nstatic struct nf_sockopt_ops ipt_sockopts = {\n\t.pf\t\t= PF_INET,\n\t.set_optmin\t= IPT_BASE_CTL,\n\t.set_optmax\t= IPT_SO_SET_MAX+1,\n\t.set\t\t= do_ipt_set_ctl,\n#ifdef CONFIG_COMPAT\n\t.compat_set\t= compat_do_ipt_set_ctl,\n#endif\n\t.get_optmin\t= IPT_BASE_CTL,\n\t.get_optmax\t= IPT_SO_GET_MAX+1,\n\t.get\t\t= do_ipt_get_ctl,\n#ifdef CONFIG_COMPAT\n\t.compat_get\t= compat_do_ipt_get_ctl,\n#endif\n\t.owner\t\t= THIS_MODULE,\n};\n\nstatic struct xt_match ipt_builtin_mt[] __read_mostly = {\n\t{\n\t\t.name = \"icmp\",\n\t\t.match = icmp_match,\n\t\t.matchsize = sizeof(struct ipt_icmp),\n\t\t.checkentry = icmp_checkentry,\n\t\t.proto = IPPROTO_ICMP,\n\t\t.family = NFPROTO_IPV4,\n\t},\n};\n\nstatic int __net_init ip_tables_net_init(struct net *net)\n{\n\treturn xt_proto_init(net, NFPROTO_IPV4);\n}\n\nstatic void __net_exit ip_tables_net_exit(struct net *net)\n{\n\txt_proto_fini(net, NFPROTO_IPV4);\n}\n\nstatic struct pernet_operations ip_tables_net_ops = {\n\t.init = ip_tables_net_init,\n\t.exit = ip_tables_net_exit,\n};\n\nstatic int __init ip_tables_init(void)\n{\n\tint ret;\n\n\tret = register_pernet_subsys(&ip_tables_net_ops);\n\tif (ret < 0)\n\t\tgoto err1;\n\n\t/* No one else will be downing sem now, so we won't sleep */\n\tret = xt_register_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));\n\tif (ret < 0)\n\t\tgoto err2;\n\tret = xt_register_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));\n\tif (ret < 0)\n\t\tgoto err4;\n\n\t/* Register setsockopt */\n\tret = nf_register_sockopt(&ipt_sockopts);\n\tif (ret < 0)\n\t\tgoto err5;\n\n\tpr_info(\"(C) 2000-2006 Netfilter Core Team\\n\");\n\treturn 0;\n\nerr5:\n\txt_unregister_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));\nerr4:\n\txt_unregister_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));\nerr2:\n\tunregister_pernet_subsys(&ip_tables_net_ops);\nerr1:\n\treturn ret;\n}\n\nstatic void __exit ip_tables_fini(void)\n{\n\tnf_unregister_sockopt(&ipt_sockopts);\n\n\txt_unregister_matches(ipt_builtin_mt, ARRAY_SIZE(ipt_builtin_mt));\n\txt_unregister_targets(ipt_builtin_tg, ARRAY_SIZE(ipt_builtin_tg));\n\tunregister_pernet_subsys(&ip_tables_net_ops);\n}\n\nEXPORT_SYMBOL(ipt_register_table);\nEXPORT_SYMBOL(ipt_unregister_table);\nEXPORT_SYMBOL(ipt_do_table);\nmodule_init(ip_tables_init);\nmodule_exit(ip_tables_fini);\n"},"func_before":{"kind":"string","value":"check_compat_entry_size_and_hooks(struct compat_ipt_entry *e,\n\t\t\t\t struct xt_table_info *newinfo,\n\t\t\t\t unsigned int *size,\n\t\t\t\t const unsigned char *base,\n\t\t\t\t const unsigned char *limit,\n\t\t\t\t const unsigned int *hook_entries,\n\t\t\t\t const unsigned int *underflows,\n\t\t\t\t const char *name)\n{\n\tstruct xt_entry_match *ematch;\n\tstruct xt_entry_target *t;\n\tstruct xt_target *target;\n\tunsigned int entry_offset;\n\tunsigned int j;\n\tint ret, off, h;\n\n\tduprintf(\"check_compat_entry_size_and_hooks %p\\n\", e);\n\tif ((unsigned long)e % __alignof__(struct compat_ipt_entry) != 0 ||\n\t (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit) {\n\t\tduprintf(\"Bad offset %p, limit = %p\\n\", e, limit);\n\t\treturn -EINVAL;\n\t}\n\n\tif (e->next_offset < sizeof(struct compat_ipt_entry) +\n\t\t\t sizeof(struct compat_xt_entry_target)) {\n\t\tduprintf(\"checking: element %p size %u\\n\",\n\t\t\t e, e->next_offset);\n\t\treturn -EINVAL;\n\t}\n\n\t/* For purposes of check_entry casting the compat entry is fine */\n\tret = check_entry((struct ipt_entry *)e);\n\tif (ret)\n\t\treturn ret;\n\n\toff = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\tentry_offset = (void *)e - (void *)base;\n\tj = 0;\n\txt_ematch_foreach(ematch, e) {\n\t\tret = compat_find_calc_match(ematch, name, &e->ip, &off);\n\t\tif (ret != 0)\n\t\t\tgoto release_matches;\n\t\t++j;\n\t}\n\n\tt = compat_ipt_get_target(e);\n\ttarget = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,\n\t\t\t\t\tt->u.user.revision);\n\tif (IS_ERR(target)) {\n\t\tduprintf(\"check_compat_entry_size_and_hooks: `%s' not found\\n\",\n\t\t\t t->u.user.name);\n\t\tret = PTR_ERR(target);\n\t\tgoto release_matches;\n\t}\n\tt->u.kernel.target = target;\n\n\toff += xt_compat_target_offset(target);\n\t*size += off;\n\tret = xt_compat_add_offset(AF_INET, entry_offset, off);\n\tif (ret)\n\t\tgoto out;\n\n\t/* Check hooks & underflows */\n\tfor (h = 0; h < NF_INET_NUMHOOKS; h++) {\n\t\tif ((unsigned char *)e - base == hook_entries[h])\n\t\t\tnewinfo->hook_entry[h] = hook_entries[h];\n\t\tif ((unsigned char *)e - base == underflows[h])\n\t\t\tnewinfo->underflow[h] = underflows[h];\n\t}\n\n\t/* Clear counters and comefrom */\n\tmemset(&e->counters, 0, sizeof(e->counters));\n\te->comefrom = 0;\n\treturn 0;\n\nout:\n\tmodule_put(t->u.kernel.target->me);\nrelease_matches:\n\txt_ematch_foreach(ematch, e) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tmodule_put(ematch->u.kernel.match->me);\n\t}\n\treturn ret;\n}"},"func_after":{"kind":"string","value":"check_compat_entry_size_and_hooks(struct compat_ipt_entry *e,\n\t\t\t\t struct xt_table_info *newinfo,\n\t\t\t\t unsigned int *size,\n\t\t\t\t const unsigned char *base,\n\t\t\t\t const unsigned char *limit,\n\t\t\t\t const unsigned int *hook_entries,\n\t\t\t\t const unsigned int *underflows,\n\t\t\t\t const char *name)\n{\n\tstruct xt_entry_match *ematch;\n\tstruct xt_entry_target *t;\n\tstruct xt_target *target;\n\tunsigned int entry_offset;\n\tunsigned int j;\n\tint ret, off, h;\n\n\tduprintf(\"check_compat_entry_size_and_hooks %p\\n\", e);\n\tif ((unsigned long)e % __alignof__(struct compat_ipt_entry) != 0 ||\n\t (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit ||\n\t (unsigned char *)e + e->next_offset > limit) {\n\t\tduprintf(\"Bad offset %p, limit = %p\\n\", e, limit);\n\t\treturn -EINVAL;\n\t}\n\n\tif (e->next_offset < sizeof(struct compat_ipt_entry) +\n\t\t\t sizeof(struct compat_xt_entry_target)) {\n\t\tduprintf(\"checking: element %p size %u\\n\",\n\t\t\t e, e->next_offset);\n\t\treturn -EINVAL;\n\t}\n\n\t/* For purposes of check_entry casting the compat entry is fine */\n\tret = check_entry((struct ipt_entry *)e);\n\tif (ret)\n\t\treturn ret;\n\n\toff = sizeof(struct ipt_entry) - sizeof(struct compat_ipt_entry);\n\tentry_offset = (void *)e - (void *)base;\n\tj = 0;\n\txt_ematch_foreach(ematch, e) {\n\t\tret = compat_find_calc_match(ematch, name, &e->ip, &off);\n\t\tif (ret != 0)\n\t\t\tgoto release_matches;\n\t\t++j;\n\t}\n\n\tt = compat_ipt_get_target(e);\n\ttarget = xt_request_find_target(NFPROTO_IPV4, t->u.user.name,\n\t\t\t\t\tt->u.user.revision);\n\tif (IS_ERR(target)) {\n\t\tduprintf(\"check_compat_entry_size_and_hooks: `%s' not found\\n\",\n\t\t\t t->u.user.name);\n\t\tret = PTR_ERR(target);\n\t\tgoto release_matches;\n\t}\n\tt->u.kernel.target = target;\n\n\toff += xt_compat_target_offset(target);\n\t*size += off;\n\tret = xt_compat_add_offset(AF_INET, entry_offset, off);\n\tif (ret)\n\t\tgoto out;\n\n\t/* Check hooks & underflows */\n\tfor (h = 0; h < NF_INET_NUMHOOKS; h++) {\n\t\tif ((unsigned char *)e - base == hook_entries[h])\n\t\t\tnewinfo->hook_entry[h] = hook_entries[h];\n\t\tif ((unsigned char *)e - base == underflows[h])\n\t\t\tnewinfo->underflow[h] = underflows[h];\n\t}\n\n\t/* Clear counters and comefrom */\n\tmemset(&e->counters, 0, sizeof(e->counters));\n\te->comefrom = 0;\n\treturn 0;\n\nout:\n\tmodule_put(t->u.kernel.target->me);\nrelease_matches:\n\txt_ematch_foreach(ematch, e) {\n\t\tif (j-- == 0)\n\t\t\tbreak;\n\t\tmodule_put(ematch->u.kernel.match->me);\n\t}\n\treturn ret;\n}"},"diff":{"kind":"string","value":"{'added': [(741, '\\t (unsigned char *)e + sizeof(struct ipt_entry) >= limit ||'), (742, '\\t (unsigned char *)e + e->next_offset > limit) {'), (1496, '\\t (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit ||'), (1497, '\\t (unsigned char *)e + e->next_offset > limit) {')], 'deleted': [(741, '\\t (unsigned char *)e + sizeof(struct ipt_entry) >= limit) {'), (1495, '\\t (unsigned char *)e + sizeof(struct compat_ipt_entry) >= limit) {')]}"},"num_lines_added":{"kind":"number","value":4,"string":"4"},"num_lines_deleted":{"kind":"number","value":2,"string":"2"},"num_lines_in_file":{"kind":"number","value":1816,"string":"1,816"},"num_tokens_in_file":{"kind":"number","value":11251,"string":"11,251"},"num_lines_in_method":{"kind":"number","value":73,"string":"73"},"num_tokens_in_method":{"kind":"number","value":503,"string":"503"},"method_complexity":{"kind":"number","value":12,"string":"12"},"repo":{"kind":"string","value":"https://github.com/torvalds/linux"},"cve_id":{"kind":"string","value":"CVE-2016-4998"},"cwe_id":{"kind":"string","value":"CWE-119"}}},{"rowIdx":396,"cells":{"id":{"kind":"number","value":132,"string":"132"},"file_name":{"kind":"string","value":"bin_dyldcache.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"read_cache_accel"},"code_before":{"kind":"string","value":"/* radare2 - LGPL - Copyright 2018-2022 - pancake, mrmacete, keegan */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n// #include \"../format/mach0/mach0_defines.h\"\n#define R_BIN_MACH064 1\n#include \"../format/mach0/mach0.h\"\n#include \"objc/mach0_classes.h\"\n\n#define R_IS_PTR_AUTHENTICATED(x) B_IS_SET(x, 63)\n#define MAX_N_HDR 16\n\ntypedef struct {\n\tut8 version;\n\tut64 slide;\n\tut8 *one_page_buf;\n\tut32 page_size;\n\tut64 start_of_data;\n} RDyldRebaseInfo;\n\ntypedef struct {\n\tut64 start;\n\tut64 end;\n\tRDyldRebaseInfo *info;\n} RDyldRebaseInfosEntry;\n\ntypedef struct {\n\tRDyldRebaseInfosEntry *entries;\n\tsize_t length;\n} RDyldRebaseInfos;\n\ntypedef struct {\n\tut8 version;\n\tut64 slide;\n\tut8 *one_page_buf;\n\tut32 page_size;\n\tut64 start_of_data;\n\tut16 *page_starts;\n\tut32 page_starts_count;\n\tut64 delta_mask;\n\tut32 delta_shift;\n\tut64 auth_value_add;\n} RDyldRebaseInfo3;\n\ntypedef struct {\n\tut8 version;\n\tut64 slide;\n\tut8 *one_page_buf;\n\tut32 page_size;\n\tut64 start_of_data;\n\tut16 *page_starts;\n\tut32 page_starts_count;\n\tut16 *page_extras;\n\tut32 page_extras_count;\n\tut64 delta_mask;\n\tut64 value_mask;\n\tut32 delta_shift;\n\tut64 value_add;\n} RDyldRebaseInfo2;\n\ntypedef struct {\n\tut8 version;\n\tut64 slide;\n\tut8 *one_page_buf;\n\tut32 page_size;\n\tut64 start_of_data;\n\tut16 *toc;\n\tut32 toc_count;\n\tut8 *entries;\n\tut32 entries_size;\n} RDyldRebaseInfo1;\n\ntypedef struct {\n\tut64 local_symbols_offset;\n\tut64 nlists_offset;\n\tut64 nlists_count;\n\tut64 strings_offset;\n\tut64 strings_size;\n} RDyldLocSym;\n\ntypedef struct _r_dyldcache {\n\tut8 magic[8];\n\n\tcache_hdr_t *hdr;\n\tut64 *hdr_offset;\n\tut32 *maps_index;\n\tut32 n_hdr;\n\tcache_map_t *maps;\n\tut32 n_maps;\n\n\tRList *bins;\n\tRBuffer *buf;\n\tint (*original_io_read)(RIO *io, RIODesc *fd, ut8 *buf, int count);\n\tRDyldRebaseInfos *rebase_infos;\n\tcache_accel_t *accel;\n\tRDyldLocSym *locsym;\n\tobjc_cache_opt_info *oi;\n\tbool objc_opt_info_loaded;\n} RDyldCache;\n\ntypedef struct _r_bin_image {\n\tchar *file;\n\tut64 header_at;\n\tut64 hdr_offset;\n\tut64 symbols_off;\n\tut64 va;\n\tut32 nlist_start_index;\n\tut32 nlist_count;\n} RDyldBinImage;\n\nstatic R_TH_LOCAL RList *pending_bin_files = NULL;\n\nstatic ut64 va2pa(uint64_t addr, ut32 n_maps, cache_map_t *maps, RBuffer *cache_buf, ut64 slide, ut32 *offset, ut32 *left) {\n\tut64 res = UT64_MAX;\n\tut32 i;\n\n\taddr -= slide;\n\n\tfor (i = 0; i < n_maps; i++) {\n\t\tif (addr >= maps[i].address && addr < maps[i].address + maps[i].size) {\n\t\t\tres = maps[i].fileOffset + addr - maps[i].address;\n\t\t\tif (offset) {\n\t\t\t\t*offset = addr - maps[i].address;\n\t\t\t}\n\t\t\tif (left) {\n\t\t\t\t*left = maps[i].size - (addr - maps[i].address);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn res;\n}\n\nstatic void free_bin(RDyldBinImage *bin) {\n\tif (!bin) {\n\t\treturn;\n\t}\n\n\tR_FREE (bin->file);\n\tR_FREE (bin);\n}\n\nstatic void rebase_info3_free(RDyldRebaseInfo3 *rebase_info) {\n\tif (!rebase_info) {\n\t\treturn;\n\t}\n\n\tR_FREE (rebase_info->page_starts);\n\tR_FREE (rebase_info);\n}\n\nstatic void rebase_info2_free(RDyldRebaseInfo2 *rebase_info) {\n\tif (!rebase_info) {\n\t\treturn;\n\t}\n\n\tR_FREE (rebase_info->page_starts);\n\tR_FREE (rebase_info->page_extras);\n\tR_FREE (rebase_info);\n}\n\nstatic void rebase_info1_free(RDyldRebaseInfo1 *rebase_info) {\n\tif (!rebase_info) {\n\t\treturn;\n\t}\n\n\tR_FREE (rebase_info->toc);\n\tR_FREE (rebase_info->entries);\n\tR_FREE (rebase_info);\n}\n\nstatic void rebase_info_free(RDyldRebaseInfo *rebase_info) {\n\tif (!rebase_info) {\n\t\treturn;\n\t}\n\n\tR_FREE (rebase_info->one_page_buf);\n\n\tut8 version = rebase_info->version;\n\n\tif (version == 1) {\n\t\trebase_info1_free ((RDyldRebaseInfo1*) rebase_info);\n\t} else if (version == 2 || version == 4) {\n\t\trebase_info2_free ((RDyldRebaseInfo2*) rebase_info);\n\t} else if (version == 3) {\n\t\trebase_info3_free ((RDyldRebaseInfo3*) rebase_info);\n\t} else {\n\t\tR_FREE (rebase_info);\n\t}\n}\n\nstatic cache_img_t *read_cache_images(RBuffer *cache_buf, cache_hdr_t *hdr, ut64 hdr_offset) {\n\tif (!cache_buf || !hdr) {\n\t\treturn NULL;\n\t}\n\tif (!hdr->imagesCount || !hdr->imagesOffset || hdr->imagesOffset == UT32_MAX || hdr->imagesCount == UT32_MAX) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_img_t) * hdr->imagesCount;\n\tcache_img_t *images = R_NEWS0 (cache_img_t, hdr->imagesCount);\n\tif (!images) {\n\t\treturn NULL;\n\t}\n\n\tif (r_buf_fread_at (cache_buf, hdr->imagesOffset, (ut8*) images, \"3l2i\", hdr->imagesCount) != size) {\n\t\tR_FREE (images);\n\t\treturn NULL;\n\t}\n\n\tif (hdr_offset) {\n\t\tut32 i;\n\t\tfor (i = 0; i < hdr->imagesCount; i++) {\n\t\t\tcache_img_t *img = &images[i];\n\t\t\timg->pathFileOffset += hdr_offset;\n\t\t}\n\t}\n\n\treturn images;\n}\n\nstatic void match_bin_entries(RDyldCache *cache, void *entries) {\n\tr_return_if_fail (cache && cache->bins && entries);\n\n\tcache_img_t *imgs = read_cache_images (cache->buf, cache->hdr, 0);\n\tif (!imgs) {\n\t\treturn;\n\t}\n\n\tRDyldBinImage *bin = NULL;\n\tRListIter *it = r_list_iterator (cache->bins);\n\n\tbool has_large_entries = cache->n_hdr > 1;\n\n\tut32 i;\n\tfor (i = 0; i < cache->hdr->imagesCount; i++) {\n\t\tcache_img_t *img = &imgs[i];\n\t\tif (!it) {\n\t\t\tbreak;\n\t\t}\n\t\tbin = it->data;\n\t\tif (!bin) {\n\t\t\tbreak;\n\t\t}\n\t\tif (bin && bin->va == img->address) {\n\t\t\tif (has_large_entries) {\n\t\t\t\tcache_locsym_entry_large_t *e = &((cache_locsym_entry_large_t *) entries)[i];\n\t\t\t\tbin->nlist_start_index = e->nlistStartIndex;\n\t\t\t\tbin->nlist_count = e->nlistCount;\n\t\t\t} else {\n\t\t\t\tcache_locsym_entry_t *e = &((cache_locsym_entry_t *) entries)[i];\n\t\t\t\tbin->nlist_start_index = e->nlistStartIndex;\n\t\t\t\tbin->nlist_count = e->nlistCount;\n\t\t\t}\n\t\t\tit = it->n;\n\t\t}\n\t}\n\n\tR_FREE (imgs);\n}\n\nstatic RDyldLocSym *r_dyld_locsym_new(RDyldCache *cache) {\n\tr_return_val_if_fail (cache && cache->buf, NULL);\n\n\tut32 i;\n\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\tif (!hdr || !hdr->localSymbolsSize || !hdr->localSymbolsOffset) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tcache_locsym_info_t *info = NULL;\n\t\tvoid *entries = NULL;\n\n\t\tut64 info_size = sizeof (cache_locsym_info_t);\n\t\tinfo = R_NEW0 (cache_locsym_info_t);\n\t\tif (!info) {\n\t\t\tgoto beach;\n\t\t}\n\t\tif (r_buf_fread_at (cache->buf, hdr->localSymbolsOffset, (ut8*) info, \"6i\", 1) != info_size) {\n\t\t\teprintf (\"locsym err 01\\n\");\n\t\t\tgoto beach;\n\t\t}\n\t\tif (info->entriesCount != cache->hdr->imagesCount) {\n\t\t\teprintf (\"locsym err 02\\n\");\n\t\t\tgoto beach;\n\t\t}\n\n\t\tbool has_large_entries = cache->n_hdr > 1;\n\t\tif (has_large_entries) {\n\t\t\tut64 entries_size = sizeof (cache_locsym_entry_large_t) * info->entriesCount;\n\t\t\tcache_locsym_entry_large_t *large_entries = R_NEWS0 (cache_locsym_entry_large_t, info->entriesCount);\n\t\t\tif (!large_entries) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache->buf, hdr->localSymbolsOffset + info->entriesOffset, (ut8*) large_entries, \"lii\",\n\t\t\t\t\tinfo->entriesCount) != entries_size) {\n\t\t\t\teprintf (\"locsym err 03\\n\");\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tentries = large_entries;\n\t\t} else {\n\t\t\tut64 entries_size = sizeof (cache_locsym_entry_t) * info->entriesCount;\n\t\t\tcache_locsym_entry_t *regular_entries = R_NEWS0 (cache_locsym_entry_t, info->entriesCount);\n\t\t\tif (!regular_entries) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache->buf, hdr->localSymbolsOffset + info->entriesOffset, (ut8*) regular_entries, \"iii\",\n\t\t\t\t\tinfo->entriesCount) != entries_size) {\n\t\t\t\teprintf (\"locsym err 04\\n\");\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tentries = regular_entries;\n\t\t}\n\t\tRDyldLocSym * locsym = R_NEW0 (RDyldLocSym);\n\t\tif (!locsym) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tmatch_bin_entries (cache, entries);\n\n\t\tlocsym->local_symbols_offset = hdr->localSymbolsOffset;\n\t\tlocsym->nlists_offset = info->nlistOffset;\n\t\tlocsym->nlists_count = info->nlistCount;\n\t\tlocsym->strings_offset = info->stringsOffset;\n\t\tlocsym->strings_size = info->stringsSize;\n\n\t\tfree (info);\n\t\tfree (entries);\n\n\t\treturn locsym;\n\nbeach:\n\t\tfree (info);\n\t\tfree (entries);\n\n\t\teprintf (\"dyldcache: malformed local symbols metadata\\n\");\n\t\tbreak;\n\t}\n\treturn NULL;\n}\n\nstatic ut64 rebase_infos_get_slide(RDyldCache *cache) {\n\tif (!cache->rebase_infos || !cache->rebase_infos->length) {\n\t\treturn 0;\n\t}\n\n\tsize_t i;\n\tfor (i = 0; i < cache->rebase_infos->length; i++) {\n\t\tif (cache->rebase_infos->entries[i].info) {\n\t\t\treturn cache->rebase_infos->entries[i].info->slide;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nstatic void symbols_from_locsym(RDyldCache *cache, RDyldBinImage *bin, RList *symbols, SetU *hash) {\n\tRDyldLocSym *locsym = cache->locsym;\n\tif (!locsym) {\n\t\treturn;\n\t}\n\n\tif (bin->nlist_start_index >= locsym->nlists_count ||\n\t\t\tbin->nlist_start_index + bin->nlist_count > locsym->nlists_count) {\n\t\teprintf (\"dyldcache: malformed local symbol entry\\n\");\n\t\treturn;\n\t}\n\n\tut64 nlists_size = sizeof (struct MACH0_(nlist)) * bin->nlist_count;\n\tstruct MACH0_(nlist) *nlists = R_NEWS0 (struct MACH0_(nlist), bin->nlist_count);\n\tif (!nlists) {\n\t\treturn;\n\t}\n\tut64 nlists_offset = locsym->local_symbols_offset + locsym->nlists_offset +\n\t\tbin->nlist_start_index * sizeof (struct MACH0_(nlist));\n\tif (r_buf_fread_at (cache->buf, nlists_offset, (ut8*) nlists, \"iccsl\", bin->nlist_count) != nlists_size) {\n\t\tfree (nlists);\n\t\treturn;\n\t}\n\n\tut32 j;\n\tfor (j = 0; j != bin->nlist_count; j++) {\n\t\tstruct MACH0_(nlist) *nlist = &nlists[j];\n\t\tif (set_u_contains (hash, (ut64)nlist->n_value)) {\n\t\t\tcontinue;\n\t\t}\n\t\tset_u_add (hash, (ut64)nlist->n_value);\n\t\tif (nlist->n_strx >= locsym->strings_size) {\n\t\t\tcontinue;\n\t\t}\n\t\tRBinSymbol *sym = R_NEW0 (RBinSymbol);\n\t\tif (!sym) {\n\t\t\tbreak;\n\t\t}\n\t\tsym->type = \"LOCAL\";\n\t\tsym->vaddr = nlist->n_value;\n\t\tut64 slide = rebase_infos_get_slide (cache);\n\t\tsym->paddr = va2pa (nlist->n_value, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\n\t\tchar *symstr =r_buf_get_string (cache->buf, locsym->local_symbols_offset + locsym->strings_offset + nlist->n_strx);\n\t\tif (symstr) {\n\t\t\tsym->name = symstr;\n\t\t} else {\n\t\t\tstatic ut32 k = 0;\n\t\t\tsym->name = r_str_newf (\"unk_local%d\", k++);\n\t\t}\n\n\t\tr_list_append (symbols, sym);\n\t}\n\n\tfree (nlists);\n}\n\nstatic void r_dyldcache_free(RDyldCache *cache) {\n\tif (!cache) {\n\t\treturn;\n\t}\n\n\tr_list_free (cache->bins);\n\tcache->bins = NULL;\n\tr_buf_free (cache->buf);\n\tcache->buf = NULL;\n\tif (cache->rebase_infos) {\n\t\tint i;\n\t\tfor (i = 0; i < cache->rebase_infos->length; i++) {\n\t\t\trebase_info_free (cache->rebase_infos->entries[i].info);\n\t\t\tcache->rebase_infos->entries[i].info = NULL;\n\t\t}\n\t\tR_FREE (cache->rebase_infos->entries);\n\t\tR_FREE (cache->rebase_infos);\n\t}\n\tR_FREE (cache->hdr);\n\tR_FREE (cache->maps);\n\tR_FREE (cache->maps_index);\n\tR_FREE (cache->hdr_offset);\n\tR_FREE (cache->accel);\n\tR_FREE (cache->locsym);\n\tR_FREE (cache->oi);\n\tR_FREE (cache);\n}\n\nstatic ut64 bin_obj_va2pa(ut64 p, ut32 *offset, ut32 *left, RBinFile *bf) {\n\tif (!bf || !bf->o || !bf->o->bin_obj) {\n\t\treturn 0;\n\t}\n\n\tRDyldCache *cache = (RDyldCache*) ((struct MACH0_(obj_t)*)bf->o->bin_obj)->user;\n\tif (!cache) {\n\t\treturn 0;\n\t}\n\n\tut64 slide = rebase_infos_get_slide (cache);\n\tut64 res = va2pa (p, cache->n_maps, cache->maps, cache->buf, slide, offset, left);\n\tif (res == UT64_MAX) {\n\t\tres = 0;\n\t}\n\treturn res;\n}\n\nstatic struct MACH0_(obj_t) *bin_to_mach0(RBinFile *bf, RDyldBinImage *bin) {\n\tif (!bin || !bf) {\n\t\treturn NULL;\n\t}\n\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tRBuffer *buf = r_buf_new_slice (cache->buf, bin->hdr_offset, r_buf_size (cache->buf) - bin->hdr_offset);\n\tif (!buf) {\n\t\treturn NULL;\n\t}\n\n\tstruct MACH0_(opts_t) opts;\n\tMACH0_(opts_set_default) (&opts, bf);\n\topts.header_at = bin->header_at - bin->hdr_offset;\n\topts.symbols_off = bin->symbols_off;\n\n\tstruct MACH0_(obj_t) *mach0 = MACH0_(new_buf) (buf, &opts);\n\n\tmach0->user = cache;\n\tmach0->va2pa = &bin_obj_va2pa;\n\n\tr_buf_free (buf);\n\n\treturn mach0;\n}\n\nstatic int prot2perm(int x) {\n\tint r = 0;\n\tif (x & 1) {\n\t\tr |= 4;\n\t}\n\tif (x & 2) {\n\t\tr |= 2;\n\t}\n\tif (x & 4) {\n\t\tr |= 1;\n\t}\n\treturn r;\n}\n\nstatic ut32 dumb_ctzll(ut64 x) {\n\tut64 result = 0;\n\tint i, j;\n\tfor (i = 0; i < 64; i += 8) {\n\t\tut8 byte = (x >> i) & 0xff;\n\t\tif (!byte) {\n\t\t\tresult += 8;\n\t\t} else {\n\t\t\tfor (j = 0; j < 8; j++) {\n\t\t\t\tif (!((byte >> j) & 1)) {\n\t\t\t\t\tresult++;\n\t\t\t\t} else {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn result;\n}\n\nstatic ut64 estimate_slide(RBinFile *bf, RDyldCache *cache, ut64 value_mask, ut64 value_add) {\n\tut64 slide = 0;\n\tif (cache->n_hdr > 1) {\n\t\treturn slide;\n\t}\n\tut64 *classlist = malloc (64);\n\tif (!classlist) {\n\t\tgoto beach;\n\t}\n\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tbool found_sample = false;\n\n\t\tstruct MACH0_(opts_t) opts = {0};\n\t\topts.verbose = bf->rbin->verbose;\n\t\topts.header_at = bin->header_at;\n\t\topts.symbols_off = 0;\n\n\t\tstruct MACH0_(obj_t) *mach0 = MACH0_(new_buf) (cache->buf, &opts);\n\t\tif (!mach0) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tstruct section_t *sections = NULL;\n\t\tif (!(sections = MACH0_(get_sections) (mach0))) {\n\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\tgoto beach;\n\t\t}\n\n\t\tint i;\n\t\tint incomplete = 2;\n\t\tint classlist_idx = 0, data_idx = 0;\n\t\tfor (i = 0; !sections[i].last && incomplete; i++) {\n\t\t\tif (sections[i].size == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (strstr (sections[i].name, \"__objc_classlist\")) {\n\t\t\t\tincomplete--;\n\t\t\t\tclasslist_idx = i;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (strstr (sections[i].name, \"__objc_data\")) {\n\t\t\t\tincomplete--;\n\t\t\t\tdata_idx = i;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tif (incomplete) {\n\t\t\tgoto next_bin;\n\t\t}\n\n\t\tint classlist_sample_size = R_MIN (64, sections[classlist_idx].size);\n\t\tint n_classes = classlist_sample_size / 8;\n\t\tut64 sect_offset = sections[classlist_idx].offset + bin->hdr_offset;\n\n\t\tif (r_buf_fread_at (cache->buf, sect_offset, (ut8*) classlist, \"l\", n_classes) < classlist_sample_size) {\n\t\t\tgoto next_bin;\n\t\t}\n\n\t\tut64 data_addr = sections[data_idx].addr;\n\t\tut64 data_tail = data_addr & 0xfff;\n\t\tut64 data_tail_end = (data_addr + sections[data_idx].size) & 0xfff;\n\t\tfor (i = 0; i < n_classes; i++) {\n\t\t\tut64 cl_addr = (classlist[i] & value_mask) + value_add;\n\t\t\tut64 cl_tail = cl_addr & 0xfff;\n\t\t\tif (cl_tail >= data_tail && cl_tail < data_tail_end) {\n\t\t\t\tut64 off = cl_tail - data_tail;\n\t\t\t\tslide = ((cl_addr - off) & value_mask) - (data_addr & value_mask);\n\t\t\t\tfound_sample = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\nnext_bin:\n\t\tMACH0_(mach0_free) (mach0);\n\t\tR_FREE (sections);\n\n\t\tif (found_sample) {\n\t\t\tbreak;\n\t\t}\n\t}\n\nbeach:\n\tR_FREE (classlist);\n\treturn slide;\n}\n\nstatic RDyldRebaseInfo *get_rebase_info(RBinFile *bf, RDyldCache *cache, ut64 slideInfoOffset, ut64 slideInfoSize, ut64 start_of_data, ut64 slide) {\n\tut8 *tmp_buf_1 = NULL;\n\tut8 *tmp_buf_2 = NULL;\n\tut8 *one_page_buf = NULL;\n\tRBuffer *cache_buf = cache->buf;\n\n\tut64 offset = slideInfoOffset;\n\tut32 slide_info_version = 0;\n\tif (r_buf_read_at (cache_buf, offset, (ut8*) &slide_info_version, 4) != 4) {\n\t\treturn NULL;\n\t}\n\n\tif (slide_info_version == 3) {\n\t\tcache_slide3_t slide_info;\n\t\tut64 size = sizeof (cache_slide3_t);\n\t\tif (r_buf_fread_at (cache_buf, offset, (ut8*) &slide_info, \"4i1l\", 1) < 20) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tut64 page_starts_offset = offset + size;\n\t\tut64 page_starts_size = slide_info.page_starts_count * 2;\n\n\t\tif (page_starts_size + size > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (page_starts_size > 0) {\n\t\t\ttmp_buf_1 = malloc (page_starts_size);\n\t\t\tif (!tmp_buf_1) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache_buf, page_starts_offset, tmp_buf_1, \"s\", slide_info.page_starts_count) != page_starts_size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tif (slide_info.page_size > 0) {\n\t\t\tone_page_buf = malloc (slide_info.page_size);\n\t\t\tif (!one_page_buf) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tRDyldRebaseInfo3 *rebase_info = R_NEW0 (RDyldRebaseInfo3);\n\t\tif (!rebase_info) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\trebase_info->version = 3;\n\t\trebase_info->delta_mask = 0x3ff8000000000000ULL;\n\t\trebase_info->delta_shift = 51;\n\t\trebase_info->start_of_data = start_of_data;\n\t\trebase_info->page_starts = (ut16*) tmp_buf_1;\n\t\trebase_info->page_starts_count = slide_info.page_starts_count;\n\t\trebase_info->auth_value_add = slide_info.auth_value_add;\n\t\trebase_info->page_size = slide_info.page_size;\n\t\trebase_info->one_page_buf = one_page_buf;\n\t\tif (slide == UT64_MAX) {\n\t\t\trebase_info->slide = estimate_slide (bf, cache, 0x7ffffffffffffULL, 0);\n\t\t\tif (rebase_info->slide) {\n\t\t\t\teprintf (\"dyldcache is slid: 0x%\"PFMT64x\"\\n\", rebase_info->slide);\n\t\t\t}\n\t\t} else {\n\t\t\trebase_info->slide = slide;\n\t\t}\n\n\t\treturn (RDyldRebaseInfo*) rebase_info;\n\t} else if (slide_info_version == 2 || slide_info_version == 4) {\n\t\tcache_slide2_t slide_info;\n\t\tut64 size = sizeof (cache_slide2_t);\n\t\tif (r_buf_fread_at (cache_buf, offset, (ut8*) &slide_info, \"6i2l\", 1) != size) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.page_starts_offset == 0 ||\n\t\t\tslide_info.page_starts_offset > slideInfoSize ||\n\t\t\tslide_info.page_starts_offset + slide_info.page_starts_count * 2 > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.page_extras_offset == 0 ||\n\t\t\tslide_info.page_extras_offset > slideInfoSize ||\n\t\t\tslide_info.page_extras_offset + slide_info.page_extras_count * 2 > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.page_starts_count > 0) {\n\t\t\tut64 size = slide_info.page_starts_count * 2;\n\t\t\tut64 at = slideInfoOffset + slide_info.page_starts_offset;\n\t\t\ttmp_buf_1 = malloc (size);\n\t\t\tif (!tmp_buf_1) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache_buf, at, tmp_buf_1, \"s\", slide_info.page_starts_count) != size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tif (slide_info.page_extras_count > 0) {\n\t\t\tut64 size = slide_info.page_extras_count * 2;\n\t\t\tut64 at = slideInfoOffset + slide_info.page_extras_offset;\n\t\t\ttmp_buf_2 = malloc (size);\n\t\t\tif (!tmp_buf_2) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache_buf, at, tmp_buf_2, \"s\", slide_info.page_extras_count) != size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tif (slide_info.page_size > 0) {\n\t\t\tone_page_buf = malloc (slide_info.page_size);\n\t\t\tif (!one_page_buf) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tRDyldRebaseInfo2 *rebase_info = R_NEW0 (RDyldRebaseInfo2);\n\t\tif (!rebase_info) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\trebase_info->version = slide_info_version;\n\t\trebase_info->start_of_data = start_of_data;\n\t\trebase_info->page_starts = (ut16*) tmp_buf_1;\n\t\trebase_info->page_starts_count = slide_info.page_starts_count;\n\t\trebase_info->page_extras = (ut16*) tmp_buf_2;\n\t\trebase_info->page_extras_count = slide_info.page_extras_count;\n\t\trebase_info->value_add = slide_info.value_add;\n\t\trebase_info->delta_mask = slide_info.delta_mask;\n\t\trebase_info->value_mask = ~rebase_info->delta_mask;\n\t\trebase_info->delta_shift = dumb_ctzll (rebase_info->delta_mask) - 2;\n\t\trebase_info->page_size = slide_info.page_size;\n\t\trebase_info->one_page_buf = one_page_buf;\n\t\tif (slide == UT64_MAX) {\n\t\t\trebase_info->slide = estimate_slide (bf, cache, rebase_info->value_mask, rebase_info->value_add);\n\t\t\tif (rebase_info->slide) {\n\t\t\t\teprintf (\"dyldcache is slid: 0x%\"PFMT64x\"\\n\", rebase_info->slide);\n\t\t\t}\n\t\t} else {\n\t\t\trebase_info->slide = slide;\n\t\t}\n\n\t\treturn (RDyldRebaseInfo*) rebase_info;\n\t} else if (slide_info_version == 1) {\n\t\tcache_slide1_t slide_info;\n\t\tut64 size = sizeof (cache_slide1_t);\n\t\tif (r_buf_fread_at (cache_buf, offset, (ut8*) &slide_info, \"6i\", 1) != size) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.toc_offset == 0 ||\n\t\t\tslide_info.toc_offset > slideInfoSize ||\n\t\t\tslide_info.toc_offset + slide_info.toc_count * 2 > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.entries_offset == 0 ||\n\t\t\tslide_info.entries_offset > slideInfoSize ||\n\t\t\tslide_info.entries_offset + slide_info.entries_count * slide_info.entries_size > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.toc_count > 0) {\n\t\t\tut64 size = slide_info.toc_count * 2;\n\t\t\tut64 at = slideInfoOffset + slide_info.toc_offset;\n\t\t\ttmp_buf_1 = malloc (size);\n\t\t\tif (!tmp_buf_1) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache_buf, at, tmp_buf_1, \"s\", slide_info.toc_count) != size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tif (slide_info.entries_count > 0) {\n\t\t\tut64 size = (ut64) slide_info.entries_count * (ut64) slide_info.entries_size;\n\t\t\tut64 at = slideInfoOffset + slide_info.entries_offset;\n\t\t\ttmp_buf_2 = malloc (size);\n\t\t\tif (!tmp_buf_2) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_read_at (cache_buf, at, tmp_buf_2, size) != size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tone_page_buf = malloc (4096);\n\t\tif (!one_page_buf) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tRDyldRebaseInfo1 *rebase_info = R_NEW0 (RDyldRebaseInfo1);\n\t\tif (!rebase_info) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\trebase_info->version = 1;\n\t\trebase_info->start_of_data = start_of_data;\n\t\trebase_info->one_page_buf = one_page_buf;\n\t\trebase_info->page_size = 4096;\n\t\trebase_info->toc = (ut16*) tmp_buf_1;\n\t\trebase_info->toc_count = slide_info.toc_count;\n\t\trebase_info->entries = tmp_buf_2;\n\t\trebase_info->entries_size = slide_info.entries_size;\n\t\tif (slide == UT64_MAX) {\n\t\t\trebase_info->slide = estimate_slide (bf, cache, UT64_MAX, 0);\n\t\t\tif (rebase_info->slide) {\n\t\t\t\teprintf (\"dyldcache is slid: 0x%\"PFMT64x\"\\n\", rebase_info->slide);\n\t\t\t}\n\t\t} else {\n\t\t\trebase_info->slide = slide;\n\t\t}\n\n\t\treturn (RDyldRebaseInfo*) rebase_info;\n\t} else {\n\t\teprintf (\"unsupported slide info version %d\\n\", slide_info_version);\n\t\treturn NULL;\n\t}\n\nbeach:\n\tR_FREE (tmp_buf_1);\n\tR_FREE (tmp_buf_2);\n\tR_FREE (one_page_buf);\n\treturn NULL;\n}\n\nstatic RDyldRebaseInfos *get_rebase_infos(RBinFile *bf, RDyldCache *cache) {\n\tRDyldRebaseInfos *result = R_NEW0 (RDyldRebaseInfos);\n\tif (!result) {\n\t\treturn NULL;\n\t}\n\n\tif (!cache->hdr->slideInfoOffset || !cache->hdr->slideInfoSize) {\n\t\tut32 total_slide_infos = 0;\n\t\tut32 n_slide_infos[MAX_N_HDR];\n\n\t\tut32 i;\n\t\tfor (i = 0; i < cache->n_hdr && i < MAX_N_HDR; i++) {\n\t\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\t\tif ((n_slide_infos[i] = r_buf_read_le32_at (cache->buf, 0x13c + hdr_offset)) == UT32_MAX) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\ttotal_slide_infos += n_slide_infos[i];\n\t\t}\n\n\t\tif (!total_slide_infos) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tRDyldRebaseInfosEntry * infos = R_NEWS0 (RDyldRebaseInfosEntry, total_slide_infos);\n\t\tif (!infos) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tut32 k = 0;\n\t\tfor (i = 0; i < cache->n_hdr && i < MAX_N_HDR; i++) {\n\t\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\t\tut64 slide_infos_offset;\n\t\t\tif (!n_slide_infos[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif ((slide_infos_offset = r_buf_read_le32_at (cache->buf, 0x138 + hdr_offset)) == UT32_MAX) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (!slide_infos_offset) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tslide_infos_offset += hdr_offset;\n\n\t\t\tut32 j;\n\t\t\tRDyldRebaseInfo *prev_info = NULL;\n\t\t\tfor (j = 0; j < n_slide_infos[i]; j++) {\n\t\t\t\tut64 offset = slide_infos_offset + j * sizeof (cache_mapping_slide);\n\t\t\t\tcache_mapping_slide entry;\n\t\t\t\tif (r_buf_fread_at (cache->buf, offset, (ut8*)&entry, \"6lii\", 1) != sizeof (cache_mapping_slide)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (entry.slideInfoOffset && entry.slideInfoSize) {\n\t\t\t\t\tinfos[k].start = entry.fileOffset + hdr_offset;\n\t\t\t\t\tinfos[k].end = infos[k].start + entry.size;\n\t\t\t\t\tut64 slide = prev_info ? prev_info->slide : UT64_MAX;\n\t\t\t\t\tinfos[k].info = get_rebase_info (bf, cache, entry.slideInfoOffset + hdr_offset, entry.slideInfoSize, entry.fileOffset + hdr_offset, slide);\n\t\t\t\t\tprev_info = infos[k].info;\n\t\t\t\t\tk++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (!k) {\n\t\t\tfree (infos);\n\t\t\tgoto beach;\n\t\t}\n\n\t\tif (k < total_slide_infos) {\n\t\t\tRDyldRebaseInfosEntry * pruned_infos = R_NEWS0 (RDyldRebaseInfosEntry, k);\n\t\t\tif (!pruned_infos) {\n\t\t\t\tfree (infos);\n\t\t\t\tgoto beach;\n\t\t\t}\n\n\t\t\tmemcpy (pruned_infos, infos, sizeof (RDyldRebaseInfosEntry) * k);\n\t\t\tfree (infos);\n\t\t\tinfos = pruned_infos;\n\t\t}\n\n\t\tresult->entries = infos;\n\t\tresult->length = k;\n\t\treturn result;\n\t}\n\n\tif (cache->hdr->mappingCount > 1) {\n\t\tRDyldRebaseInfosEntry * infos = R_NEWS0 (RDyldRebaseInfosEntry, 1);\n\t\tif (!infos) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tinfos[0].start = cache->maps[1].fileOffset;\n\t\tinfos[0].end = infos[0].start + cache->maps[1].size;\n\t\tinfos[0].info = get_rebase_info (bf, cache, cache->hdr->slideInfoOffset, cache->hdr->slideInfoSize, infos[0].start, UT64_MAX);\n\n\t\tresult->entries = infos;\n\t\tresult->length = 1;\n\t\treturn result;\n\t}\n\nbeach:\n\tfree (result);\n\treturn NULL;\n}\n\nstatic bool check_magic(const char *magic) {\n\treturn !strcmp (magic, \"dyld_v1 arm64\")\n\t\t|| !strcmp (magic, \"dyld_v1 arm64e\")\n\t\t|| !strcmp (magic, \"dyld_v1 x86_64\")\n\t\t|| !strcmp (magic, \"dyld_v1 x86_64h\");\n}\n\nstatic bool check_buffer(RBinFile *bf, RBuffer *buf) {\n\tif (r_buf_size (buf) < 32) {\n\t\treturn false;\n\t}\n\n\tchar hdr[17] = { 0 };\n\tint rhdr = r_buf_read_at (buf, 0, (ut8 *)&hdr, sizeof (hdr) - 1);\n\tif (rhdr != sizeof (hdr) - 1) {\n\t\treturn false;\n\t}\n\n\treturn check_magic (hdr);\n}\n\nstatic cache_imgxtr_t *read_cache_imgextra(RBuffer *cache_buf, cache_hdr_t *hdr, cache_accel_t *accel) {\n\tif (!cache_buf || !hdr || !hdr->imagesCount || !accel || !accel->imageExtrasCount || !accel->imagesExtrasOffset) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_imgxtr_t) * accel->imageExtrasCount;\n\tcache_imgxtr_t *images = R_NEWS0 (cache_imgxtr_t, accel->imageExtrasCount);\n\tif (!images) {\n\t\treturn NULL;\n\t}\n\n\tif (r_buf_fread_at (cache_buf, accel->imagesExtrasOffset, (ut8*) images, \"ll4i\", accel->imageExtrasCount) != size) {\n\t\tR_FREE (images);\n\t\treturn NULL;\n\t}\n\n\treturn images;\n}\n\nstatic char *get_lib_name(RBuffer *cache_buf, cache_img_t *img) {\n\tchar file[256];\n\tchar *lib_name = file;\n\tif (r_buf_read_at (cache_buf, img->pathFileOffset, (ut8*) &file, sizeof (file)) == sizeof (file)) {\n\t\tfile[255] = 0;\n\t\t/*char * last_slash = strrchr (file, '/');\n\t\tif (last_slash && *last_slash) {\n\t\t\tlib_name = last_slash + 1;\n\t\t}*/\n\t\treturn strdup (lib_name);\n\t}\n\treturn strdup (\"FAIL\");\n}\n\nstatic int string_contains(const void *a, const void *b) {\n\treturn !strstr ((const char*) a, (const char*) b);\n}\n\nstatic HtPU *create_path_to_index(RBuffer *cache_buf, cache_img_t *img, cache_hdr_t *hdr) {\n\tHtPU *path_to_idx = ht_pu_new0 ();\n\tif (!path_to_idx) {\n\t\treturn NULL;\n\t}\n\tsize_t i;\n\tfor (i = 0; i != hdr->imagesCount; i++) {\n\t\tchar file[256];\n\t\tif (r_buf_read_at (cache_buf, img[i].pathFileOffset, (ut8*) &file, sizeof (file)) != sizeof (file)) {\n\t\t\tcontinue;\n\t\t}\n\t\tfile[sizeof (file) - 1] = 0;\n\t\tht_pu_insert (path_to_idx, file, (ut64)i);\n\n\t\tconst char versions_pattern[] = \".framework/Versions/\";\n\t\tchar *versions = strstr (file, versions_pattern);\n\t\tif (versions) {\n\t\t\tchar *next_slash = strchr (versions + 20, '/');\n\t\t\tif (next_slash) {\n\t\t\t\tchar *tail = strdup (next_slash);\n\t\t\t\tif (!tail) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tstrcpy (versions + 10, tail);\n\t\t\t\tfree (tail);\n\t\t\t\tht_pu_insert (path_to_idx, file, (ut64)i);\n\t\t\t}\n\t\t}\n\t}\n\treturn path_to_idx;\n}\n\nstatic void carve_deps_at_address(RDyldCache *cache, cache_img_t *img, HtPU *path_to_idx, ut64 address, int *deps, bool printing) {\n\tut64 pa = va2pa (address, cache->n_maps, cache->maps, cache->buf, 0, NULL, NULL);\n\tif (pa == UT64_MAX) {\n\t\treturn;\n\t}\n\tstruct MACH0_(mach_header) mh;\n\tif (r_buf_fread_at (cache->buf, pa, (ut8*) &mh, \"8i\", 1) != sizeof (struct MACH0_(mach_header))) {\n\t\treturn;\n\t}\n\tif (mh.magic != MH_MAGIC_64 || mh.sizeofcmds == 0) {\n\t\treturn;\n\t}\n\tut64 cmds_at = pa + sizeof (struct MACH0_(mach_header));\n\tut8 *cmds = malloc (mh.sizeofcmds + 1);\n\tif (!cmds || r_buf_read_at (cache->buf, cmds_at, cmds, mh.sizeofcmds) != mh.sizeofcmds) {\n\t\tgoto beach;\n\t}\n\tcmds[mh.sizeofcmds] = 0;\n\tut8 *cursor = cmds;\n\tut8 *end = cmds + mh.sizeofcmds;\n\twhile (cursor < end) {\n\t\tut32 cmd = r_read_le32 (cursor);\n\t\tut32 cmdsize = r_read_le32 (cursor + sizeof (ut32));\n\t\tif (cmd == LC_LOAD_DYLIB ||\n\t\t\t\tcmd == LC_LOAD_WEAK_DYLIB ||\n\t\t\t\tcmd == LC_REEXPORT_DYLIB ||\n\t\t\t\tcmd == LC_LOAD_UPWARD_DYLIB) {\n\t\t\tbool found;\n\t\t\tif (cursor + 24 >= end) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tconst char *key = (const char *) cursor + 24;\n\t\t\tsize_t dep_index = (size_t)ht_pu_find (path_to_idx, key, &found);\n\t\t\tif (!found || dep_index >= cache->hdr->imagesCount) {\n\t\t\t\teprintf (\"Warning: alien dep '%s'\\n\", key);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tdeps[dep_index]++;\n\t\t\tif (printing) {\n\t\t\t\teprintf (\"-> %s\\n\", key);\n\t\t\t}\n\t\t}\n\t\tcursor += cmdsize;\n\t}\n\nbeach:\n\tfree (cmds);\n}\n\nstatic ut64 resolve_symbols_off(RDyldCache *cache, ut64 pa) {\n\tstruct MACH0_(mach_header) mh;\n\tif (r_buf_fread_at (cache->buf, pa, (ut8*) &mh, \"8i\", 1) != sizeof (struct MACH0_(mach_header))) {\n\t\treturn 0;\n\t}\n\tif (mh.magic != MH_MAGIC_64 || mh.sizeofcmds == 0) {\n\t\treturn 0;\n\t}\n\tut64 cmds_at = pa + sizeof (struct MACH0_(mach_header));\n\tut64 cursor = cmds_at;\n\tut64 end = cursor + mh.sizeofcmds;\n\twhile (cursor < end) {\n\t\tut32 cmd = r_buf_read_le32_at (cache->buf, cursor);\n\t\tif (cmd == UT32_MAX) {\n\t\t\treturn 0;\n\t\t}\n\t\tut32 cmdsize = r_buf_read_le32_at (cache->buf, cursor + sizeof (ut32));\n\t\tif (cmdsize == UT32_MAX) {\n\t\t\treturn 0;\n\t\t}\n\t\tif (cmd == LC_SEGMENT || cmd == LC_SEGMENT_64) {\n\t\t\tchar segname[17];\n\t\t\tsegname[16] = 0;\n\t\t\tif (r_buf_read_at (cache->buf, cursor + 2 * sizeof (ut32), (ut8 *)segname, 16) != 16) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (!strncmp (segname, \"__LINKEDIT\", 16)) {\n\t\t\t\tut64 vmaddr = r_buf_read_le64_at (cache->buf, cursor + 2 * sizeof (ut32) + 16);\n\t\t\t\tif (vmaddr == UT64_MAX) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\n\t\t\t\tut32 i,j;\n\t\t\t\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\t\t\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\t\t\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\t\t\t\tut32 maps_index = cache->maps_index[i];\n\t\t\t\t\tfor (j = 0; j < hdr->mappingCount; j++) {\n\t\t\t\t\t\tut64 map_start = cache->maps[maps_index + j].address;\n\t\t\t\t\t\tut64 map_end = map_start + cache->maps[maps_index + j].size;\n\t\t\t\t\t\tif (vmaddr >= map_start && vmaddr < map_end) {\n\t\t\t\t\t\t\treturn hdr_offset;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcursor += cmdsize;\n\t}\n\treturn 0;\n}\n\nstatic RList *create_cache_bins(RBinFile *bf, RDyldCache *cache) {\n\tRList *bins = r_list_newf ((RListFree)free_bin);\n\tif (!bins) {\n\t\treturn NULL;\n\t}\n\n\tchar *target_libs = NULL;\n\tRList *target_lib_names = NULL;\n\tint *deps = NULL;\n\ttarget_libs = r_sys_getenv (\"R_DYLDCACHE_FILTER\");\n\tif (target_libs) {\n\t\ttarget_lib_names = r_str_split_list (target_libs, \":\", 0);\n\t\tif (!target_lib_names) {\n\t\t\tr_list_free (bins);\n\t\t\treturn NULL;\n\t\t}\n\t\tdeps = R_NEWS0 (int, cache->hdr->imagesCount);\n\t\tif (!deps) {\n\t\t\tr_list_free (bins);\n\t\t\tr_list_free (target_lib_names);\n\t\t\treturn NULL;\n\t\t}\n\t}\n\n\tut32 i;\n\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\tut32 maps_index = cache->maps_index[i];\n\t\tcache_img_t *img = read_cache_images (cache->buf, hdr, hdr_offset);\n\t\tif (!img) {\n\t\t\tgoto next;\n\t\t}\n\n\t\tut32 j;\n\t\tut16 *depArray = NULL;\n\t\tcache_imgxtr_t *extras = NULL;\n\t\tif (target_libs) {\n\t\t\tHtPU *path_to_idx = NULL;\n\t\t\tif (cache->accel) {\n\t\t\t\tdepArray = R_NEWS0 (ut16, cache->accel->depListCount);\n\t\t\t\tif (!depArray) {\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\n\t\t\t\tif (r_buf_fread_at (cache->buf, cache->accel->depListOffset, (ut8*) depArray, \"s\", cache->accel->depListCount) != cache->accel->depListCount * 2) {\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\n\t\t\t\textras = read_cache_imgextra (cache->buf, hdr, cache->accel);\n\t\t\t\tif (!extras) {\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tpath_to_idx = create_path_to_index (cache->buf, img, hdr);\n\t\t\t}\n\n\t\t\tfor (j = 0; j < hdr->imagesCount; j++) {\n\t\t\t\tbool printing = !deps[j];\n\t\t\t\tchar *lib_name = get_lib_name (cache->buf, &img[j]);\n\t\t\t\tif (!lib_name) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (strstr (lib_name, \"libobjc.A.dylib\")) {\n\t\t\t\t\tdeps[j]++;\n\t\t\t\t}\n\t\t\t\tif (!r_list_find (target_lib_names, lib_name, string_contains)) {\n\t\t\t\t\tR_FREE (lib_name);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (printing) {\n\t\t\t\t\teprintf (\"FILTER: %s\\n\", lib_name);\n\t\t\t\t}\n\t\t\t\tR_FREE (lib_name);\n\t\t\t\tdeps[j]++;\n\n\t\t\t\tif (extras && depArray) {\n\t\t\t\t\tut32 k;\n\t\t\t\t\tfor (k = extras[j].dependentsStartArrayIndex; depArray[k] != 0xffff; k++) {\n\t\t\t\t\t\tut16 dep_index = depArray[k] & 0x7fff;\n\t\t\t\t\t\tdeps[dep_index]++;\n\n\t\t\t\t\t\tchar *dep_name = get_lib_name (cache->buf, &img[dep_index]);\n\t\t\t\t\t\tif (!dep_name) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (printing) {\n\t\t\t\t\t\t\teprintf (\"-> %s\\n\", dep_name);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfree (dep_name);\n\t\t\t\t\t}\n\t\t\t\t} else if (path_to_idx) {\n\t\t\t\t\tcarve_deps_at_address (cache, img, path_to_idx, img[j].address, deps, printing);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tht_pu_free (path_to_idx);\n\t\t\tR_FREE (depArray);\n\t\t\tR_FREE (extras);\n\t\t}\n\n\t\tfor (j = 0; j < hdr->imagesCount; j++) {\n\t\t\tif (deps && !deps[j]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tut64 pa = va2pa (img[j].address, hdr->mappingCount, &cache->maps[maps_index], cache->buf, 0, NULL, NULL);\n\t\t\tif (pa == UT64_MAX) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tut8 magicbytes[4];\n\t\t\tr_buf_read_at (cache->buf, pa, magicbytes, 4);\n\t\t\tint magic = r_read_le32 (magicbytes);\n\t\t\tswitch (magic) {\n\t\t\tcase MH_MAGIC_64:\n\t\t\t{\n\t\t\t\tchar file[256];\n\t\t\t\tRDyldBinImage *bin = R_NEW0 (RDyldBinImage);\n\t\t\t\tif (!bin) {\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\t\t\t\tbin->header_at = pa;\n\t\t\t\tbin->hdr_offset = hdr_offset;\n\t\t\t\tbin->symbols_off = resolve_symbols_off (cache, pa);\n\t\t\t\tbin->va = img[j].address;\n\t\t\t\tif (r_buf_read_at (cache->buf, img[j].pathFileOffset, (ut8*) &file, sizeof (file)) == sizeof (file)) {\n\t\t\t\t\tfile[255] = 0;\n\t\t\t\t\tchar *last_slash = strrchr (file, '/');\n\t\t\t\t\tif (last_slash && *last_slash) {\n\t\t\t\t\t\tif (last_slash > file) {\n\t\t\t\t\t\t\tchar *scan = last_slash - 1;\n\t\t\t\t\t\t\twhile (scan > file && *scan != '/') {\n\t\t\t\t\t\t\t\tscan--;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (*scan == '/') {\n\t\t\t\t\t\t\t\tbin->file = strdup (scan + 1);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbin->file = strdup (last_slash + 1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tbin->file = strdup (last_slash + 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tbin->file = strdup (file);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tr_list_append (bins, bin);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\teprintf (\"Unknown sub-bin\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\nnext:\n\t\tR_FREE (depArray);\n\t\tR_FREE (extras);\n\t\tR_FREE (img);\n\t}\n\tif (r_list_empty (bins)) {\n\t\tr_list_free (bins);\n\t\tbins = NULL;\n\t}\n\tR_FREE (deps);\n\tR_FREE (target_libs);\n\tr_list_free (target_lib_names);\n\treturn bins;\n}\n\nstatic void rebase_bytes_v1(RDyldRebaseInfo1 *rebase_info, ut8 *buf, ut64 offset, int count, ut64 start_of_write) {\n\tint in_buf = 0;\n\twhile (in_buf < count) {\n\t\tut64 offset_in_data = offset - rebase_info->start_of_data;\n\t\tut64 page_index = offset_in_data / rebase_info->page_size;\n\t\tut64 page_offset = offset_in_data % rebase_info->page_size;\n\t\tut64 to_next_page = rebase_info->page_size - page_offset;\n\t\tut64 entry_index = page_offset / 32;\n\t\tut64 offset_in_entry = (page_offset % 32) / 4;\n\n\t\tif (entry_index >= rebase_info->entries_size) {\n\t\t\tin_buf += to_next_page;\n\t\t\toffset += to_next_page;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (page_index >= rebase_info->toc_count) {\n\t\t\tbreak;\n\t\t}\n\n\t\tut8 *entry = &rebase_info->entries[rebase_info->toc[page_index] * rebase_info->entries_size];\n\t\tut8 b = entry[entry_index];\n\n\t\tif (b & (1 << offset_in_entry)) {\n\t\t\tut64 value = r_read_le64 (buf + in_buf);\n\t\t\tvalue += rebase_info->slide;\n\t\t\tr_write_le64 (buf + in_buf, value);\n\t\t\tin_buf += 8;\n\t\t\toffset += 8;\n\t\t} else {\n\t\t\tin_buf += 4;\n\t\t\toffset += 4;\n\t\t}\n\t}\n}\n\nstatic void rebase_bytes_v2(RDyldRebaseInfo2 *rebase_info, ut8 *buf, ut64 offset, int count, ut64 start_of_write) {\n\tint in_buf = 0;\n\twhile (in_buf < count) {\n\t\tut64 offset_in_data = offset - rebase_info->start_of_data;\n\t\tut64 page_index = offset_in_data / rebase_info->page_size;\n\t\tut64 page_offset = offset_in_data % rebase_info->page_size;\n\t\tut64 to_next_page = rebase_info->page_size - page_offset;\n\n\t\tif (page_index >= rebase_info->page_starts_count) {\n\t\t\tgoto next_page;\n\t\t}\n\t\tut16 page_flag = rebase_info->page_starts[page_index];\n\n\t\tif (page_flag == DYLD_CACHE_SLIDE_PAGE_ATTR_NO_REBASE) {\n\t\t\tgoto next_page;\n\t\t}\n\n\t\tif (!(page_flag & DYLD_CACHE_SLIDE_PAGE_ATTR_EXTRA)) {\n\t\t\tut64 first_rebase_off = rebase_info->page_starts[page_index] * 4;\n\t\t\tif (first_rebase_off >= page_offset && first_rebase_off < page_offset + count) {\n\t\t\t\tut32 delta = 1;\n\t\t\t\twhile (delta) {\n\t\t\t\t\tut64 position = in_buf + first_rebase_off - page_offset;\n\t\t\t\t\tif (position >= count) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tut64 raw_value = r_read_le64 (buf + position);\n\t\t\t\t\tdelta = ((raw_value & rebase_info->delta_mask) >> rebase_info->delta_shift);\n\t\t\t\t\tif (position >= start_of_write) {\n\t\t\t\t\t\tut64 new_value = raw_value & rebase_info->value_mask;\n\t\t\t\t\t\tif (new_value != 0) {\n\t\t\t\t\t\t\tnew_value += rebase_info->value_add;\n\t\t\t\t\t\t\tnew_value += rebase_info->slide;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tr_write_le64 (buf + position, new_value);\n\t\t\t\t\t}\n\t\t\t\t\tfirst_rebase_off += delta;\n\t\t\t\t}\n\t\t\t}\n\t\t}\nnext_page:\n\t\tin_buf += to_next_page;\n\t\toffset += to_next_page;\n\t}\n}\n\nstatic void rebase_bytes_v3(RDyldRebaseInfo3 *rebase_info, ut8 *buf, ut64 offset, int count, ut64 start_of_write) {\n\tint in_buf = 0;\n\twhile (in_buf < count) {\n\t\tut64 offset_in_data = offset - rebase_info->start_of_data;\n\t\tut64 page_index = offset_in_data / rebase_info->page_size;\n\t\tut64 page_offset = offset_in_data % rebase_info->page_size;\n\t\tut64 to_next_page = rebase_info->page_size - page_offset;\n\n\t\tif (page_index >= rebase_info->page_starts_count) {\n\t\t\tgoto next_page;\n\t\t}\n\t\tut64 delta = rebase_info->page_starts[page_index];\n\n\t\tif (delta == DYLD_CACHE_SLIDE_V3_PAGE_ATTR_NO_REBASE) {\n\t\t\tgoto next_page;\n\t\t}\n\n\t\tut64 first_rebase_off = delta;\n\t\tif (first_rebase_off >= page_offset && first_rebase_off < page_offset + count) {\n\t\t\tdo {\n\t\t\t\tut64 position = in_buf + first_rebase_off - page_offset;\n\t\t\t\tif (position >= count) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tut64 raw_value = r_read_le64 (buf + position);\n\t\t\t\tdelta = ((raw_value & rebase_info->delta_mask) >> rebase_info->delta_shift) * 8;\n\t\t\t\tif (position >= start_of_write) {\n\t\t\t\t\tut64 new_value = 0;\n\t\t\t\t\tif (R_IS_PTR_AUTHENTICATED (raw_value)) {\n\t\t\t\t\t\tnew_value = (raw_value & 0xFFFFFFFFULL) + rebase_info->auth_value_add;\n\t\t\t\t\t\t// TODO: don't throw auth info away\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnew_value = ((raw_value << 13) & 0xFF00000000000000ULL) | (raw_value & 0x7ffffffffffULL);\n\t\t\t\t\t\tnew_value &= 0x00FFFFFFFFFFFFFFULL;\n\t\t\t\t\t}\n\t\t\t\t\tif (new_value != 0) {\n\t\t\t\t\t\tnew_value += rebase_info->slide;\n\t\t\t\t\t}\n\t\t\t\t\tr_write_le64 (buf + position, new_value);\n\t\t\t\t}\n\t\t\t\tfirst_rebase_off += delta;\n\t\t\t} while (delta);\n\t\t}\nnext_page:\n\t\tin_buf += to_next_page;\n\t\toffset += to_next_page;\n\t}\n}\n\nstatic RDyldRebaseInfo *rebase_info_by_range(RDyldRebaseInfos *infos, ut64 offset, int count) {\n\tint imid;\n\tint imin = 0;\n\tint imax = infos->length - 1;\n\n\twhile (imin < imax) {\n\t\timid = (imin + imax) / 2;\n\t\tRDyldRebaseInfosEntry *entry = &infos->entries[imid];\n\t\tif ((entry->end) <= offset) {\n\t\t\timin = imid + 1;\n\t\t} else {\n\t\t\timax = imid;\n\t\t}\n\t}\n\n\tRDyldRebaseInfosEntry *minEntry = &infos->entries[imin];\n\tif ((imax == imin) && (minEntry->start <= offset + count) && (minEntry->end >= offset)) {\n\t\treturn minEntry->info;\n\t}\n\treturn NULL;\n}\n\nstatic void rebase_bytes(RDyldRebaseInfo *rebase_info, ut8 *buf, ut64 offset, int count, ut64 start_of_write) {\n\tif (!rebase_info || !buf) {\n\t\treturn;\n\t}\n\n\tif (rebase_info->version == 3) {\n\t\trebase_bytes_v3 ((RDyldRebaseInfo3*) rebase_info, buf, offset, count, start_of_write);\n\t} else if (rebase_info->version == 2 || rebase_info->version == 4) {\n\t\trebase_bytes_v2 ((RDyldRebaseInfo2*) rebase_info, buf, offset, count, start_of_write);\n\t} else if (rebase_info->version == 1) {\n\t\trebase_bytes_v1 ((RDyldRebaseInfo1*) rebase_info, buf, offset, count, start_of_write);\n\t}\n}\n\nstatic int dyldcache_io_read(RIO *io, RIODesc *fd, ut8 *buf, int count) {\n\tr_return_val_if_fail (io, -1);\n\tRCore *core = (RCore*) io->corebind.core;\n\n\tif (!core || !core->bin || !core->bin->binfiles) {\n\t\treturn -1;\n\t}\n\n\tRDyldCache *cache = NULL;\n\tRListIter *iter;\n\tRBinFile *bf;\n\tr_list_foreach (core->bin->binfiles, iter, bf) {\n\t\tif (bf->fd == fd->fd ) {\n\t\t\tif (!strncmp ((char*) bf->o->bin_obj, \"dyldcac\", 7)) {\n\t\t\t\tcache = bf->o->bin_obj;\n\t\t\t} else {\n\t\t\t\tcache = ((struct MACH0_(obj_t)*) bf->o->bin_obj)->user;\n\t\t\t}\n\t\t\tif (pending_bin_files) {\n\t\t\t\tRListIter *to_remove = r_list_contains (pending_bin_files, bf);\n\t\t\t\tif (to_remove) {\n\t\t\t\t\tr_list_delete (pending_bin_files, to_remove);\n\t\t\t\t\tif (r_list_empty (pending_bin_files)) {\n\t\t\t\t\t\tr_list_free (pending_bin_files);\n\t\t\t\t\t\tpending_bin_files = NULL;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (!cache) {\n\t\tr_list_foreach (pending_bin_files, iter, bf) {\n\t\t\tif (bf->fd == fd->fd && bf->o) {\n\t\t\t\tif (!strncmp ((char*) bf->o->bin_obj, \"dyldcac\", 7)) {\n\t\t\t\t\tcache = bf->o->bin_obj;\n\t\t\t\t} else {\n\t\t\t\t\tcache = ((struct MACH0_(obj_t)*) bf->o->bin_obj)->user;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (!cache || !cache->original_io_read) {\n\t\tif (fd->plugin->read == &dyldcache_io_read) {\n\t\t\treturn -1;\n\t\t}\n\t\treturn fd->plugin->read (io, fd, buf, count);\n\t}\n\n\tRDyldRebaseInfo *rebase_info = rebase_info_by_range (cache->rebase_infos, io->off, count);\n\n\tint result = 0;\n\n\tif (rebase_info && count > 0) {\n\t\tut64 offset_in_data = io->off - rebase_info->start_of_data;\n\t\tut64 page_offset = offset_in_data % rebase_info->page_size;\n\n\t\tut64 internal_offset = io->off & ~(rebase_info->page_size - 1);\n\t\tut64 internal_end = io->off + count;\n\t\tint rounded_count = internal_end - internal_offset;\n\n\t\tut8 *internal_buf = rebase_info->one_page_buf;\n\t\tif (rounded_count > rebase_info->page_size) {\n\t\t\tinternal_buf = malloc (rounded_count);\n\t\t\tif (!internal_buf) {\n\t\t\t\teprintf (\"Cannot allocate memory for 'internal_buf'\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\n\t\tut64 original_off = io->off;\n\t\tio->off = internal_offset;\n\n\t\tint internal_result = cache->original_io_read (io, fd, internal_buf, rounded_count);\n\n\t\tio->off = original_off;\n\n\t\tif (internal_result >= page_offset + count) {\n\t\t\trebase_bytes (rebase_info, internal_buf, internal_offset, internal_result, page_offset);\n\t\t\tresult = R_MIN (count, internal_result);\n\t\t\tmemcpy (buf, internal_buf + page_offset, result);\n\t\t} else {\n\t\t\teprintf (\"ERROR rebasing\\n\");\n\t\t\tresult = cache->original_io_read (io, fd, buf, count);\n\t\t}\n\n\t\tif (internal_buf != rebase_info->one_page_buf) {\n\t\t\tR_FREE (internal_buf);\n\t\t}\n\t} else {\n\t\tresult = cache->original_io_read (io, fd, buf, count);\n\t}\n\n\treturn result;\n}\n\nstatic void swizzle_io_read(RDyldCache *cache, RIO *io) {\n\tif (!io || !io->desc || !io->desc->plugin) {\n\t\treturn;\n\t}\n\n\tRIOPlugin *plugin = io->desc->plugin;\n\tcache->original_io_read = plugin->read;\n\tplugin->read = &dyldcache_io_read;\n}\n\nstatic cache_hdr_t *read_cache_header(RBuffer *cache_buf, ut64 offset) {\n\tif (!cache_buf) {\n\t\treturn NULL;\n\t}\n\n\tcache_hdr_t *hdr = R_NEW0 (cache_hdr_t);\n\tif (!hdr) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_hdr_t);\n\tif (r_buf_fread_at (cache_buf, offset, (ut8*) hdr, \"16c4i7l16clii4l\", 1) != size) {\n\t\tR_FREE (hdr);\n\t\treturn NULL;\n\t}\n\tif (!check_magic (hdr->magic)) {\n\t\tR_FREE (hdr);\n\t\treturn NULL;\n\t}\n\n\tif (!hdr->imagesCount && !hdr->imagesOffset) {\n\t\thdr->imagesOffset = r_buf_read_le32_at (cache_buf, 0x1c0 + offset);\n\t\thdr->imagesCount = r_buf_read_le32_at (cache_buf, 0x1c4 + offset);\n\t}\n\treturn hdr;\n}\n\n\nstatic void populate_cache_headers(RDyldCache *cache) {\n\tcache->n_hdr = 0;\n\tRList *hdrs = r_list_newf (NULL);\n\tif (!hdrs) {\n\t\treturn;\n\t}\n\n\tcache_hdr_t *h;\n\tut64 offsets[MAX_N_HDR];\n\tut64 offset = 0;\n\tdo {\n\t\toffsets[cache->n_hdr] = offset;\n\t\th = read_cache_header (cache->buf, offset);\n\t\tif (!h) {\n\t\t\tbreak;\n\t\t}\n\t\tr_list_append (hdrs, h);\n\n\t\tut64 size = h->codeSignatureOffset + h->codeSignatureSize;\n\n#define SHIFT_MAYBE(x) \\\n\tif (x) { \\\n\t\tx += offset; \\\n\t}\n\n\t\tSHIFT_MAYBE (h->mappingOffset);\n\t\tSHIFT_MAYBE (h->imagesOffset);\n\t\tSHIFT_MAYBE (h->codeSignatureOffset);\n\t\tSHIFT_MAYBE (h->slideInfoOffset);\n\t\tSHIFT_MAYBE (h->localSymbolsOffset);\n\t\tSHIFT_MAYBE (h->branchPoolsOffset);\n\t\tSHIFT_MAYBE (h->imagesTextOffset);\n\n\t\toffset += size;\n\t\tcache->n_hdr++;\n\t} while (cache->n_hdr < MAX_N_HDR);\n\n\tif (!cache->n_hdr) {\n\t\tgoto beach;\n\t}\n\n\tcache->hdr = R_NEWS0 (cache_hdr_t, cache->n_hdr);\n\tif (!cache->hdr) {\n\t\tcache->n_hdr = 0;\n\t\tgoto beach;\n\t}\n\n\tcache->hdr_offset = R_NEWS0 (ut64, cache->n_hdr);\n\tif (!cache->hdr_offset) {\n\t\tcache->n_hdr = 0;\n\t\tR_FREE (cache->hdr);\n\t\tgoto beach;\n\t}\n\n\tmemcpy (cache->hdr_offset, offsets, cache->n_hdr * sizeof (ut64));\n\n\tut32 i = 0;\n\tRListIter *iter;\n\tcache_hdr_t *item;\n\tr_list_foreach (hdrs, iter, item) {\n\t\tif (i >= cache->n_hdr) {\n\t\t\tbreak;\n\t\t}\n\t\tmemcpy (&cache->hdr[i++], item, sizeof (cache_hdr_t));\n\t}\n\nbeach:\n\tr_list_free (hdrs);\n}\n\nstatic void populate_cache_maps(RDyldCache *cache) {\n\tr_return_if_fail (cache && cache->buf);\n\n\tut32 i;\n\tut32 n_maps = 0;\n\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\tif (!hdr->mappingCount || !hdr->mappingOffset) {\n\t\t\tcontinue;\n\t\t}\n\t\tn_maps += hdr->mappingCount;\n\t}\n\n\tcache_map_t *maps = NULL;\n\tif (n_maps != 0) {\n\t\tcache->maps_index = R_NEWS0 (ut32, cache->n_hdr);\n\t\tif (!cache->maps_index) {\n\t\t\treturn;\n\t\t}\n\t\tmaps = R_NEWS0 (cache_map_t, n_maps);\n\t}\n\tif (!maps) {\n\t\tcache->maps = NULL;\n\t\tcache->n_maps = 0;\n\t\treturn;\n\t}\n\n\tut32 next_map = 0;\n\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\tcache->maps_index[i] = next_map;\n\n\t\tif (!hdr->mappingCount || !hdr->mappingOffset) {\n\t\t\tcontinue;\n\t\t}\n\t\tut64 size = sizeof (cache_map_t) * hdr->mappingCount;\n\t\tif (r_buf_fread_at (cache->buf, hdr->mappingOffset, (ut8*) &maps[next_map], \"3l2i\", hdr->mappingCount) != size) {\n\t\t\tcontinue;\n\t\t}\n\t\tut32 j;\n\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\tfor (j = 0; j < hdr->mappingCount; j++) {\n\t\t\tcache_map_t *map = &maps[next_map + j];\n\t\t\tmap->fileOffset += hdr_offset;\n\t\t}\n\t\tnext_map += hdr->mappingCount;\n\t}\n\n\tcache->maps = maps;\n\tcache->n_maps = next_map;\n}\n\nstatic cache_accel_t *read_cache_accel(RBuffer *cache_buf, cache_hdr_t *hdr, cache_map_t *maps) {\n\tif (!cache_buf || !hdr || !hdr->accelerateInfoSize || !hdr->accelerateInfoAddr) {\n\t\treturn NULL;\n\t}\n\n\tut64 offset = va2pa (hdr->accelerateInfoAddr, hdr->mappingCount, maps, cache_buf, 0, NULL, NULL);\n\tif (!offset) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_accel_t);\n\tcache_accel_t *accel = R_NEW0 (cache_accel_t);\n\tif (!accel) {\n\t\treturn NULL;\n\t}\n\n\tif (r_buf_fread_at (cache_buf, offset, (ut8*) accel, \"16il\", 1) != size) {\n\t\tR_FREE (accel);\n\t\treturn NULL;\n\t}\n\n\taccel->imagesExtrasOffset += offset;\n\taccel->bottomUpListOffset += offset;\n\taccel->dylibTrieOffset += offset;\n\taccel->initializersOffset += offset;\n\taccel->dofSectionsOffset += offset;\n\taccel->reExportListOffset += offset;\n\taccel->depListOffset += offset;\n\taccel->rangeTableOffset += offset;\n\n\treturn accel;\n}\n\nstatic objc_cache_opt_info *get_objc_opt_info(RBinFile *bf, RDyldCache *cache) {\n\tobjc_cache_opt_info *result = NULL;\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tif (strcmp (bin->file, \"lib/libobjc.A.dylib\")) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tstruct MACH0_(opts_t) opts = {0};\n\t\topts.verbose = bf->rbin->verbose;\n\t\topts.header_at = bin->header_at;\n\t\topts.symbols_off = 0;\n\n\t\tstruct MACH0_(obj_t) *mach0 = MACH0_(new_buf) (cache->buf, &opts);\n\t\tif (!mach0) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tstruct section_t *sections = NULL;\n\t\tif (!(sections = MACH0_(get_sections) (mach0))) {\n\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\tgoto beach;\n\t\t}\n\n\t\tint i;\n\t\tut64 scoffs_offset = 0;\n\t\tut64 scoffs_size = 0;\n\t\tut64 selrefs_offset = 0;\n\t\tut64 selrefs_size = 0;\n\t\tut8 remaining = 2;\n\t\tut64 slide = rebase_infos_get_slide (cache);\n\t\tfor (i = 0; !sections[i].last; i++) {\n\t\t\tif (sections[i].size == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (strstr (sections[i].name, \"__objc_scoffs\")) {\n\t\t\t\tscoffs_offset = va2pa (sections[i].addr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\t\t\tscoffs_size = sections[i].size;\n\t\t\t\tremaining--;\n\t\t\t\tif (remaining == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (strstr (sections[i].name, \"__DATA.__objc_selrefs\")) {\n\t\t\t\tselrefs_offset = va2pa (sections[i].addr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\t\t\tselrefs_size = sections[i].size;\n\t\t\t\tremaining--;\n\t\t\t\tif (remaining == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tMACH0_(mach0_free) (mach0);\n\t\tR_FREE (sections);\n\n\t\tut64 sel_string_base = 0;\n\t\tif (!scoffs_offset || scoffs_size < 40) {\n\t\t\tif (!selrefs_offset || !selrefs_size || cache->n_hdr == 1) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tut64 cursor = selrefs_offset;\n\t\t\tut64 end = cursor + selrefs_size;\n\t\t\twhile (cursor < end) {\n\t\t\t\tut64 sel_ptr = r_buf_read_le64_at (cache->buf, cursor);\n\t\t\t\tif (sel_ptr == UT64_MAX) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tut64 sel_offset = va2pa (sel_ptr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\t\t\tchar * selector = r_buf_get_string (cache->buf, sel_offset);\n\t\t\t\tif (!selector) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbool is_magic_selector = !strncmp (selector, \"\\xf0\\x9f\\xa4\\xaf\", 4);\n\t\t\t\tfree (selector);\n\n\t\t\t\tif (is_magic_selector) {\n\t\t\t\t\tsel_string_base = sel_ptr;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tcursor += 8;\n\t\t\t}\n\t\t\tif (sel_string_base == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} else {\n\t\t\tut64 check = r_buf_read_le64_at (cache->buf, scoffs_offset);\n\t\t\tif (check != 2) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsel_string_base = r_buf_read_le64_at (cache->buf, scoffs_offset + 8);\n\t\t\tif (sel_string_base == UT64_MAX) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tut64 sel_string_end = r_buf_read_le64_at (cache->buf, scoffs_offset + 16);\n\t\t\tif (sel_string_end == sel_string_base || sel_string_end == UT64_MAX) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tresult = R_NEW0 (objc_cache_opt_info);\n\t\tif (!result) {\n\t\t\tbreak;\n\t\t}\n\t\tresult->sel_string_base = sel_string_base;\n\t}\nbeach:\n\treturn result;\n}\n\nstatic bool load_buffer(RBinFile *bf, void **bin_obj, RBuffer *buf, ut64 loadaddr, Sdb *sdb) {\n\tRDyldCache *cache = R_NEW0 (RDyldCache);\n\tmemcpy (cache->magic, \"dyldcac\", 7);\n\tcache->buf = r_buf_ref (buf);\n\tpopulate_cache_headers (cache);\n\tif (!cache->hdr) {\n\t\tr_dyldcache_free (cache);\n\t\treturn false;\n\t}\n\tpopulate_cache_maps (cache);\n\tif (!cache->maps) {\n\t\tr_dyldcache_free (cache);\n\t\treturn false;\n\t}\n\tcache->accel = read_cache_accel (cache->buf, cache->hdr, cache->maps);\n\tcache->bins = create_cache_bins (bf, cache);\n\tif (!cache->bins) {\n\t\tr_dyldcache_free (cache);\n\t\treturn false;\n\t}\n\tcache->locsym = r_dyld_locsym_new (cache);\n\tcache->rebase_infos = get_rebase_infos (bf, cache);\n\tif (cache->rebase_infos) {\n\t\tif (!rebase_infos_get_slide (cache)) {\n\t\t\tif (!pending_bin_files) {\n\t\t\t\tpending_bin_files = r_list_new ();\n\t\t\t\tif (!pending_bin_files) {\n\t\t\t\t\tr_dyldcache_free (cache);\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tr_list_push (pending_bin_files, bf);\n\t\t\tswizzle_io_read (cache, bf->rbin->iob.io);\n\t\t}\n\t}\n\t*bin_obj = cache;\n\treturn true;\n}\n\nstatic RList *entries(RBinFile *bf) {\n\tRBinAddr *ptr = NULL;\n\tRList *ret = r_list_newf (free);\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\tif ((ptr = R_NEW0 (RBinAddr))) {\n\t\tr_list_append (ret, ptr);\n\t}\n\treturn ret;\n}\n\nstatic RBinInfo *info(RBinFile *bf) {\n\tRBinInfo *ret = NULL;\n\n\tif (!bf || !bf->o) {\n\t\treturn NULL;\n\t}\n\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tbool big_endian = 0;\n\tif (!(ret = R_NEW0 (RBinInfo))) {\n\t\treturn NULL;\n\t}\n\tret->file = strdup (bf->file);\n\tret->bclass = strdup (\"dyldcache\");\n\tret->rclass = strdup (\"ios\");\n\tret->os = strdup (\"iOS\");\n\tif (strstr (cache->hdr->magic, \"x86_64\")) {\n\t\tret->arch = strdup (\"x86\");\n\t\tret->bits = 64;\n\t} else {\n\t\tret->arch = strdup (\"arm\");\n\t\tret->bits = strstr (cache->hdr->magic, \"arm64\")? 64: 32;\n\t}\n\tret->machine = strdup (ret->arch);\n\tret->subsystem = strdup (\"xnu\");\n\tret->type = strdup (\"library-cache\");\n\tret->has_va = true;\n\tret->big_endian = big_endian;\n\tret->dbg_info = 0;\n\treturn ret;\n}\n\n#if 0\nstatic void parse_mach0(RList *ret, ut64 paddr, RBinFile *bf) {\n\t// TODO\n}\n#endif\n\nstatic ut64 baddr(RBinFile *bf) {\n\t// XXX hardcoded\n\treturn 0x180000000;\n}\n\nvoid symbols_from_bin(RDyldCache *cache, RList *ret, RBinFile *bf, RDyldBinImage *bin, SetU *hash) {\n\tstruct MACH0_(obj_t) *mach0 = bin_to_mach0 (bf, bin);\n\tif (!mach0) {\n\t\treturn;\n\t}\n\n\t// const RList*symbols = MACH0_(get_symbols_list) (mach0);\n\tconst struct symbol_t *symbols = MACH0_(get_symbols) (mach0);\n\tif (!symbols) {\n\t\treturn;\n\t}\n\tint i;\n\tfor (i = 0; !symbols[i].last; i++) {\n\t\tif (!symbols[i].name || !symbols[i].name[0] || symbols[i].addr < 100) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (strstr (symbols[i].name, \"\")) {\n\t\t\tcontinue;\n\t\t}\n\t\tRBinSymbol *sym = R_NEW0 (RBinSymbol);\n\t\tif (!sym) {\n\t\t\tbreak;\n\t\t}\n\t\tsym->name = strdup (symbols[i].name);\n\t\tsym->vaddr = symbols[i].addr;\n\t\tsym->forwarder = \"NONE\";\n\t\tsym->bind = (symbols[i].type == R_BIN_MACH0_SYMBOL_TYPE_LOCAL)? R_BIN_BIND_LOCAL_STR: R_BIN_BIND_GLOBAL_STR;\n\t\tsym->type = R_BIN_TYPE_FUNC_STR;\n\t\tsym->paddr = symbols[i].offset + bf->o->boffset;\n\t\tsym->size = symbols[i].size;\n\t\tsym->ordinal = i;\n\n\t\tset_u_add (hash, sym->vaddr);\n\t\tr_list_append (ret, sym);\n\t}\n\tMACH0_(mach0_free) (mach0);\n}\n\nstatic bool __is_data_section(const char *name) {\n\tif (strstr (name, \"_cstring\")) {\n\t\treturn true;\n\t}\n\tif (strstr (name, \"_os_log\")) {\n\t\treturn true;\n\t}\n\tif (strstr (name, \"_objc_methname\")) {\n\t\treturn true;\n\t}\n\tif (strstr (name, \"_objc_classname\")) {\n\t\treturn true;\n\t}\n\tif (strstr (name, \"_objc_methtype\")) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nstatic void sections_from_bin(RList *ret, RBinFile *bf, RDyldBinImage *bin) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn;\n\t}\n\n\tstruct MACH0_(obj_t) *mach0 = bin_to_mach0 (bf, bin);\n\tif (!mach0) {\n\t\treturn;\n\t}\n\n\tstruct section_t *sections = NULL;\n\tif (!(sections = MACH0_(get_sections) (mach0))) {\n\t\treturn;\n\t}\n\n\tut64 slide = rebase_infos_get_slide (cache);\n\tint i;\n\tfor (i = 0; !sections[i].last; i++) {\n\t\tRBinSection *ptr = R_NEW0 (RBinSection);\n\t\tif (!ptr) {\n\t\t\tbreak;\n\t\t}\n\t\tif (bin->file) {\n\t\t\tptr->name = r_str_newf (\"%s.%s\", bin->file, (char*)sections[i].name);\n\t\t} else {\n\t\t\tptr->name = r_str_newf (\"%s\", (char*)sections[i].name);\n\t\t}\n\t\tif (strstr (ptr->name, \"la_symbol_ptr\")) {\n\t\t\tint len = sections[i].size / 8;\n\t\t\tptr->format = r_str_newf (\"Cd %d[%d]\", 8, len);\n\t\t}\n\t\tptr->is_data = __is_data_section (ptr->name);\n\t\tptr->size = sections[i].size;\n\t\tptr->vsize = sections[i].vsize;\n\t\tptr->vaddr = sections[i].addr;\n\t\tptr->paddr = va2pa (sections[i].addr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\tif (!ptr->vaddr) {\n\t\t\tptr->vaddr = ptr->paddr;\n\t\t}\n\t\tptr->perm = sections[i].perm;\n\t\tr_list_append (ret, ptr);\n\t}\n\tfree (sections);\n\tMACH0_(mach0_free) (mach0);\n}\n\nstatic RList *sections(RBinFile *bf) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tRList *ret = r_list_newf (free);\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tsections_from_bin (ret, bf, bin);\n\t}\n\n\tRBinSection *ptr = NULL;\n\tint i;\n\tfor (i = 0; i < cache->n_maps; i++) {\n\t\tif (!(ptr = R_NEW0 (RBinSection))) {\n\t\t\tr_list_free (ret);\n\t\t\treturn NULL;\n\t\t}\n\t\tptr->name = r_str_newf (\"cache_map.%d\", i);\n\t\tptr->size = cache->maps[i].size;\n\t\tptr->vsize = ptr->size;\n\t\tptr->paddr = cache->maps[i].fileOffset;\n\t\tptr->vaddr = cache->maps[i].address;\n\t\tptr->add = true;\n\t\tptr->is_segment = true;\n\t\tptr->perm = prot2perm (cache->maps[i].initProt);\n\t\tr_list_append (ret, ptr);\n\t}\n\n\tut64 slide = rebase_infos_get_slide (cache);\n\tif (slide) {\n\t\tRBinSection *section;\n\t\tr_list_foreach (ret, iter, section) {\n\t\t\tsection->vaddr += slide;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nstatic RList *symbols(RBinFile *bf) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tRList *ret = r_list_newf (free);\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tSetU *hash = set_u_new ();\n\t\tif (!hash) {\n\t\t\tr_list_free (ret);\n\t\t\treturn NULL;\n\t\t}\n\t\tsymbols_from_bin (cache, ret, bf, bin, hash);\n\t\tsymbols_from_locsym (cache, bin, ret, hash);\n\t\tset_u_free (hash);\n\t}\n\n\tut64 slide = rebase_infos_get_slide (cache);\n\tif (slide) {\n\t\tRBinSymbol *sym;\n\t\tr_list_foreach (ret, iter, sym) {\n\t\t\tsym->vaddr += slide;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\n/* static void unswizzle_io_read(RDyldCache *cache, RIO *io) {\n\tif (!io || !io->desc || !io->desc->plugin || !cache->original_io_read) {\n\t\treturn;\n\t}\n\n\tRIOPlugin *plugin = io->desc->plugin;\n\tplugin->read = cache->original_io_read;\n\tcache->original_io_read = NULL;\n} */\n\nstatic void destroy(RBinFile *bf) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\t// unswizzle_io_read (cache, bf->rbin->iob.io); // XXX io may be dead here\n\tr_dyldcache_free (cache);\n}\n\nstatic RList *classes(RBinFile *bf) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tRList *ret = r_list_newf (free);\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\n\tif (!cache->objc_opt_info_loaded) {\n\t\tcache->oi = get_objc_opt_info (bf, cache);\n\t\tcache->objc_opt_info_loaded = true;\n\t}\n\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tut64 slide = rebase_infos_get_slide (cache);\n\n\tRBuffer *orig_buf = bf->buf;\n\tut32 num_of_unnamed_class = 0;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tstruct MACH0_(obj_t) *mach0 = bin_to_mach0 (bf, bin);\n\t\tif (!mach0) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tstruct section_t *sections = NULL;\n\t\tif (!(sections = MACH0_(get_sections) (mach0))) {\n\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\tgoto beach;\n\t\t}\n\n\t\tint i;\n\t\tfor (i = 0; !sections[i].last; i++) {\n\t\t\tif (sections[i].size == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tbool is_classlist = strstr (sections[i].name, \"__objc_classlist\");\n\t\t\tbool is_catlist = strstr (sections[i].name, \"__objc_catlist\");\n\n\t\t\tif (!is_classlist && !is_catlist) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tut8 *pointers = malloc (sections[i].size);\n\t\t\tif (!pointers) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tut64 offset = va2pa (sections[i].addr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\t\tif (r_buf_read_at (cache->buf, offset, pointers, sections[i].size) < sections[i].size) {\n\t\t\t\tR_FREE (pointers);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tut8 *cursor = pointers;\n\t\t\tut8 *pointers_end = pointers + sections[i].size;\n\n\t\t\tfor (; cursor < pointers_end; cursor += 8) {\n\t\t\t\tut64 pointer_to_class = r_read_le64 (cursor);\n\n\t\t\t\tRBinClass *klass;\n\t\t\t\tif (!(klass = R_NEW0 (RBinClass)) ||\n\t\t\t\t\t!(klass->methods = r_list_new ()) ||\n\t\t\t\t\t!(klass->fields = r_list_new ())) {\n\t\t\t\t\tR_FREE (klass);\n\t\t\t\t\tR_FREE (pointers);\n\t\t\t\t\tR_FREE (sections);\n\t\t\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\n\t\t\t\tbf->o->bin_obj = mach0;\n\t\t\t\tbf->buf = cache->buf;\n\t\t\t\tif (is_classlist) {\n\t\t\t\t\tMACH0_(get_class_t) (pointer_to_class, bf, klass, false, NULL, cache->oi);\n\t\t\t\t} else {\n\t\t\t\t\tMACH0_(get_category_t) (pointer_to_class, bf, klass, NULL, cache->oi);\n\t\t\t\t}\n\t\t\t\tbf->o->bin_obj = cache;\n\t\t\t\tbf->buf = orig_buf;\n\n\t\t\t\tif (!klass->name) {\n\t\t\t\t\teprintf (\"KLASS ERROR AT 0x%\"PFMT64x\", is_classlist %d\\n\", pointer_to_class, is_classlist);\n\t\t\t\t\tklass->name = r_str_newf (\"UnnamedClass%u\", num_of_unnamed_class);\n\t\t\t\t\tif (!klass->name) {\n\t\t\t\t\t\tR_FREE (klass);\n\t\t\t\t\t\tR_FREE (pointers);\n\t\t\t\t\t\tR_FREE (sections);\n\t\t\t\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t}\n\t\t\t\t\tnum_of_unnamed_class++;\n\t\t\t\t}\n\t\t\t\tr_list_append (ret, klass);\n\t\t\t}\n\n\t\t\tR_FREE (pointers);\n\t\t}\n\n\t\tR_FREE (sections);\n\t\tMACH0_(mach0_free) (mach0);\n\t}\n\n\treturn ret;\n\nbeach:\n\tr_list_free (ret);\n\treturn NULL;\n}\n\nstatic void header(RBinFile *bf) {\n\tif (!bf || !bf->o) {\n\t\treturn;\n\t}\n\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn;\n\t}\n\n\tRBin *bin = bf->rbin;\n\tut64 slide = rebase_infos_get_slide (cache);\n\tPrintfCallback p = bin->cb_printf;\n\n\tPJ *pj = pj_new ();\n\tif (!pj) {\n\t\treturn;\n\t}\n\n\tpj_o (pj);\n\tpj_k (pj, \"header\");\n\tpj_o (pj);\n\tpj_ks (pj, \"magic\", cache->hdr->magic);\n\tpj_kn (pj, \"mappingOffset\", cache->hdr->mappingOffset);\n\tpj_kn (pj, \"mappingCount\", cache->hdr->mappingCount);\n\tpj_kn (pj, \"imagesOffset\", cache->hdr->imagesOffset);\n\tpj_kn (pj, \"imagesCount\", cache->hdr->imagesCount);\n\tpj_kn (pj, \"dyldBaseAddress\", cache->hdr->dyldBaseAddress);\n\tpj_kn (pj, \"codeSignatureOffset\", cache->hdr->codeSignatureOffset);\n\tpj_kn (pj, \"codeSignatureSize\", cache->hdr->codeSignatureSize);\n\tpj_kn (pj, \"slideInfoOffset\", cache->hdr->slideInfoOffset);\n\tpj_kn (pj, \"slideInfoSize\", cache->hdr->slideInfoSize);\n\tpj_kn (pj, \"localSymbolsOffset\", cache->hdr->localSymbolsOffset);\n\tpj_kn (pj, \"localSymbolsSize\", cache->hdr->localSymbolsSize);\n\tchar uuidstr[128];\n\tr_hex_bin2str ((ut8*)cache->hdr->uuid, 16, uuidstr);\n\tpj_ks (pj, \"uuid\", uuidstr);\n\tpj_ks (pj, \"cacheType\", (cache->hdr->cacheType == 0) ? \"development\" : \"production\");\n\tpj_kn (pj, \"branchPoolsOffset\", cache->hdr->branchPoolsOffset);\n\tpj_kn (pj, \"branchPoolsCount\", cache->hdr->branchPoolsCount);\n\tpj_kn (pj, \"accelerateInfoAddr\", cache->hdr->accelerateInfoAddr + slide);\n\tpj_kn (pj, \"accelerateInfoSize\", cache->hdr->accelerateInfoSize);\n\tpj_kn (pj, \"imagesTextOffset\", cache->hdr->imagesTextOffset);\n\tpj_kn (pj, \"imagesTextCount\", cache->hdr->imagesTextCount);\n\tpj_end (pj);\n\n\tif (cache->accel) {\n\t\tpj_k (pj, \"accelerator\");\n\t\tpj_o (pj);\n\t\tpj_kn (pj, \"version\", cache->accel->version);\n\t\tpj_kn (pj, \"imageExtrasCount\", cache->accel->imageExtrasCount);\n\t\tpj_kn (pj, \"imagesExtrasOffset\", cache->accel->imagesExtrasOffset);\n\t\tpj_kn (pj, \"bottomUpListOffset\", cache->accel->bottomUpListOffset);\n\t\tpj_kn (pj, \"dylibTrieOffset\", cache->accel->dylibTrieOffset);\n\t\tpj_kn (pj, \"dylibTrieSize\", cache->accel->dylibTrieSize);\n\t\tpj_kn (pj, \"initializersOffset\", cache->accel->initializersOffset);\n\t\tpj_kn (pj, \"initializersCount\", cache->accel->initializersCount);\n\t\tpj_kn (pj, \"dofSectionsOffset\", cache->accel->dofSectionsOffset);\n\t\tpj_kn (pj, \"dofSectionsCount\", cache->accel->dofSectionsCount);\n\t\tpj_kn (pj, \"reExportListOffset\", cache->accel->reExportListOffset);\n\t\tpj_kn (pj, \"reExportCount\", cache->accel->reExportCount);\n\t\tpj_kn (pj, \"depListOffset\", cache->accel->depListOffset);\n\t\tpj_kn (pj, \"depListCount\", cache->accel->depListCount);\n\t\tpj_kn (pj, \"rangeTableOffset\", cache->accel->rangeTableOffset);\n\t\tpj_kn (pj, \"rangeTableCount\", cache->accel->rangeTableCount);\n\t\tpj_kn (pj, \"dyldSectionAddr\", cache->accel->dyldSectionAddr + slide);\n\t\tpj_end (pj);\n\t}\n\n\tif (cache->rebase_infos) {\n\t\tsize_t i;\n\t\tpj_k (pj, \"slideInfo\");\n\t\tpj_a (pj);\n\t\tfor (i = 0; i < cache->rebase_infos->length; i++) {\n\t\t\tRDyldRebaseInfo * rebase_info = cache->rebase_infos->entries[i].info;\n\t\t\tpj_o (pj);\n\t\t\tpj_kn (pj, \"start\", cache->rebase_infos->entries[i].start);\n\t\t\tpj_kn (pj, \"end\", cache->rebase_infos->entries[i].end);\n\t\t\tif (rebase_info) {\n\t\t\t\tut8 version = rebase_info->version;\n\t\t\t\tpj_kn (pj, \"version\", version);\n\t\t\t\tpj_kn (pj, \"slide\", slide);\n\t\t\t\tif (version == 3) {\n\t\t\t\t\tRDyldRebaseInfo3 *info3 = (RDyldRebaseInfo3*) rebase_info;\n\t\t\t\t\tpj_kn (pj, \"page_starts_count\", info3->page_starts_count);\n\t\t\t\t\tpj_kn (pj, \"page_size\", info3->page_size);\n\t\t\t\t\tpj_kn (pj, \"auth_value_add\", info3->auth_value_add);\n\t\t\t\t} else if (version == 2 || version == 4) {\n\t\t\t\t\tRDyldRebaseInfo2 *info2 = (RDyldRebaseInfo2*) rebase_info;\n\t\t\t\t\tpj_kn (pj, \"page_starts_count\", info2->page_starts_count);\n\t\t\t\t\tpj_kn (pj, \"page_extras_count\", info2->page_extras_count);\n\t\t\t\t\tpj_kn (pj, \"delta_mask\", info2->delta_mask);\n\t\t\t\t\tpj_kn (pj, \"value_mask\", info2->value_mask);\n\t\t\t\t\tpj_kn (pj, \"value_add\", info2->value_add);\n\t\t\t\t\tpj_kn (pj, \"delta_shift\", info2->delta_shift);\n\t\t\t\t\tpj_kn (pj, \"page_size\", info2->page_size);\n\t\t\t\t} else if (version == 1) {\n\t\t\t\t\tRDyldRebaseInfo1 *info1 = (RDyldRebaseInfo1*) rebase_info;\n\t\t\t\t\tpj_kn (pj, \"toc_count\", info1->toc_count);\n\t\t\t\t\tpj_kn (pj, \"entries_size\", info1->entries_size);\n\t\t\t\t\tpj_kn (pj, \"page_size\", 4096);\n\t\t\t\t}\n\t\t\t}\n\t\t\tpj_end (pj);\n\t\t}\n\t\tpj_end (pj);\n\t}\n\n\tif (cache->hdr->imagesTextCount) {\n\t\tpj_k (pj, \"images\");\n\t\tpj_a (pj);\n\t\tut64 total_size = cache->hdr->imagesTextCount * sizeof (cache_text_info_t);\n\t\tcache_text_info_t * text_infos = malloc (total_size);\n\t\tif (!text_infos) {\n\t\t\tgoto beach;\n\t\t}\n\t\tif (r_buf_fread_at (cache->buf, cache->hdr->imagesTextOffset, (ut8*)text_infos, \"16clii\", cache->hdr->imagesTextCount) != total_size) {\n\t\t\tfree (text_infos);\n\t\t\tgoto beach;\n\t\t}\n\t\tsize_t i;\n\t\tfor (i = 0; i != cache->hdr->imagesTextCount; i++) {\n\t\t\tcache_text_info_t * text_info = &text_infos[i];\n\t\t\tr_hex_bin2str ((ut8*)text_info->uuid, 16, uuidstr);\n\t\t\tpj_o (pj);\n\t\t\tpj_ks (pj, \"uuid\", uuidstr);\n\t\t\tpj_kn (pj, \"address\", text_info->loadAddress + slide);\n\t\t\tpj_kn (pj, \"textSegmentSize\", text_info->textSegmentSize);\n\t\t\tchar file[256];\n\t\t\tif (r_buf_read_at (cache->buf, text_info->pathOffset, (ut8*) &file, sizeof (file)) == sizeof (file)) {\n\t\t\t\tfile[255] = 0;\n\t\t\t\tpj_ks (pj, \"path\", file);\n\t\t\t\tchar *last_slash = strrchr (file, '/');\n\t\t\t\tif (last_slash && *last_slash) {\n\t\t\t\t\tpj_ks (pj, \"name\", last_slash + 1);\n\t\t\t\t} else {\n\t\t\t\t\tpj_ks (pj, \"name\", file);\n\t\t\t\t}\n\t\t\t}\n\t\t\tpj_end (pj);\n\t\t}\n\t\tpj_end (pj);\n\t\tfree (text_infos);\n\t}\n\n\tpj_end (pj);\n\tp (\"%s\", pj_string (pj));\n\nbeach:\n\tpj_free (pj);\n}\n\nRBinPlugin r_bin_plugin_dyldcache = {\n\t.name = \"dyldcache\",\n\t.desc = \"dyldcache bin plugin\",\n\t.license = \"LGPL3\",\n\t.load_buffer = &load_buffer,\n\t.entries = &entries,\n\t.baddr = &baddr,\n\t.symbols = &symbols,\n\t.sections = §ions,\n\t.check_buffer = &check_buffer,\n\t.destroy = &destroy,\n\t.classes = &classes,\n\t.header = &header,\n\t.info = &info,\n};\n\n#ifndef R2_PLUGIN_INCORE\nR_API RLibStruct radare_plugin = {\n\t.type = R_LIB_TYPE_BIN,\n\t.data = &r_bin_plugin_dyldcache,\n\t.version = R2_VERSION\n};\n#endif\n"},"code_after":{"kind":"string","value":"/* radare2 - LGPL - Copyright 2018-2022 - pancake, mrmacete, keegan */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n// #include \"../format/mach0/mach0_defines.h\"\n#define R_BIN_MACH064 1\n#include \"../format/mach0/mach0.h\"\n#include \"objc/mach0_classes.h\"\n\n#define R_IS_PTR_AUTHENTICATED(x) B_IS_SET(x, 63)\n#define MAX_N_HDR 16\n\ntypedef struct {\n\tut8 version;\n\tut64 slide;\n\tut8 *one_page_buf;\n\tut32 page_size;\n\tut64 start_of_data;\n} RDyldRebaseInfo;\n\ntypedef struct {\n\tut64 start;\n\tut64 end;\n\tRDyldRebaseInfo *info;\n} RDyldRebaseInfosEntry;\n\ntypedef struct {\n\tRDyldRebaseInfosEntry *entries;\n\tsize_t length;\n} RDyldRebaseInfos;\n\ntypedef struct {\n\tut8 version;\n\tut64 slide;\n\tut8 *one_page_buf;\n\tut32 page_size;\n\tut64 start_of_data;\n\tut16 *page_starts;\n\tut32 page_starts_count;\n\tut64 delta_mask;\n\tut32 delta_shift;\n\tut64 auth_value_add;\n} RDyldRebaseInfo3;\n\ntypedef struct {\n\tut8 version;\n\tut64 slide;\n\tut8 *one_page_buf;\n\tut32 page_size;\n\tut64 start_of_data;\n\tut16 *page_starts;\n\tut32 page_starts_count;\n\tut16 *page_extras;\n\tut32 page_extras_count;\n\tut64 delta_mask;\n\tut64 value_mask;\n\tut32 delta_shift;\n\tut64 value_add;\n} RDyldRebaseInfo2;\n\ntypedef struct {\n\tut8 version;\n\tut64 slide;\n\tut8 *one_page_buf;\n\tut32 page_size;\n\tut64 start_of_data;\n\tut16 *toc;\n\tut32 toc_count;\n\tut8 *entries;\n\tut32 entries_size;\n} RDyldRebaseInfo1;\n\ntypedef struct {\n\tut64 local_symbols_offset;\n\tut64 nlists_offset;\n\tut64 nlists_count;\n\tut64 strings_offset;\n\tut64 strings_size;\n} RDyldLocSym;\n\ntypedef struct _r_dyldcache {\n\tut8 magic[8];\n\n\tcache_hdr_t *hdr;\n\tut64 *hdr_offset;\n\tut32 *maps_index;\n\tut32 n_hdr;\n\tcache_map_t *maps;\n\tut32 n_maps;\n\n\tRList *bins;\n\tRBuffer *buf;\n\tint (*original_io_read)(RIO *io, RIODesc *fd, ut8 *buf, int count);\n\tRDyldRebaseInfos *rebase_infos;\n\tcache_accel_t *accel;\n\tRDyldLocSym *locsym;\n\tobjc_cache_opt_info *oi;\n\tbool objc_opt_info_loaded;\n} RDyldCache;\n\ntypedef struct _r_bin_image {\n\tchar *file;\n\tut64 header_at;\n\tut64 hdr_offset;\n\tut64 symbols_off;\n\tut64 va;\n\tut32 nlist_start_index;\n\tut32 nlist_count;\n} RDyldBinImage;\n\nstatic R_TH_LOCAL RList *pending_bin_files = NULL;\n\nstatic ut64 va2pa(uint64_t addr, ut32 n_maps, cache_map_t *maps, RBuffer *cache_buf, ut64 slide, ut32 *offset, ut32 *left) {\n\tut64 res = UT64_MAX;\n\tut32 i;\n\n\taddr -= slide;\n\n\tfor (i = 0; i < n_maps; i++) {\n\t\tif (addr >= maps[i].address && addr < maps[i].address + maps[i].size) {\n\t\t\tres = maps[i].fileOffset + addr - maps[i].address;\n\t\t\tif (offset) {\n\t\t\t\t*offset = addr - maps[i].address;\n\t\t\t}\n\t\t\tif (left) {\n\t\t\t\t*left = maps[i].size - (addr - maps[i].address);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn res;\n}\n\nstatic void free_bin(RDyldBinImage *bin) {\n\tif (!bin) {\n\t\treturn;\n\t}\n\n\tR_FREE (bin->file);\n\tR_FREE (bin);\n}\n\nstatic void rebase_info3_free(RDyldRebaseInfo3 *rebase_info) {\n\tif (!rebase_info) {\n\t\treturn;\n\t}\n\n\tR_FREE (rebase_info->page_starts);\n\tR_FREE (rebase_info);\n}\n\nstatic void rebase_info2_free(RDyldRebaseInfo2 *rebase_info) {\n\tif (!rebase_info) {\n\t\treturn;\n\t}\n\n\tR_FREE (rebase_info->page_starts);\n\tR_FREE (rebase_info->page_extras);\n\tR_FREE (rebase_info);\n}\n\nstatic void rebase_info1_free(RDyldRebaseInfo1 *rebase_info) {\n\tif (!rebase_info) {\n\t\treturn;\n\t}\n\n\tR_FREE (rebase_info->toc);\n\tR_FREE (rebase_info->entries);\n\tR_FREE (rebase_info);\n}\n\nstatic void rebase_info_free(RDyldRebaseInfo *rebase_info) {\n\tif (!rebase_info) {\n\t\treturn;\n\t}\n\n\tR_FREE (rebase_info->one_page_buf);\n\n\tut8 version = rebase_info->version;\n\n\tif (version == 1) {\n\t\trebase_info1_free ((RDyldRebaseInfo1*) rebase_info);\n\t} else if (version == 2 || version == 4) {\n\t\trebase_info2_free ((RDyldRebaseInfo2*) rebase_info);\n\t} else if (version == 3) {\n\t\trebase_info3_free ((RDyldRebaseInfo3*) rebase_info);\n\t} else {\n\t\tR_FREE (rebase_info);\n\t}\n}\n\nstatic cache_img_t *read_cache_images(RBuffer *cache_buf, cache_hdr_t *hdr, ut64 hdr_offset) {\n\tif (!cache_buf || !hdr) {\n\t\treturn NULL;\n\t}\n\tif (!hdr->imagesCount || !hdr->imagesOffset || hdr->imagesOffset == UT32_MAX || hdr->imagesCount == UT32_MAX) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_img_t) * hdr->imagesCount;\n\tcache_img_t *images = R_NEWS0 (cache_img_t, hdr->imagesCount);\n\tif (!images) {\n\t\treturn NULL;\n\t}\n\n\tif (r_buf_fread_at (cache_buf, hdr->imagesOffset, (ut8*) images, \"3l2i\", hdr->imagesCount) != size) {\n\t\tR_FREE (images);\n\t\treturn NULL;\n\t}\n\n\tif (hdr_offset) {\n\t\tut32 i;\n\t\tfor (i = 0; i < hdr->imagesCount; i++) {\n\t\t\tcache_img_t *img = &images[i];\n\t\t\timg->pathFileOffset += hdr_offset;\n\t\t}\n\t}\n\n\treturn images;\n}\n\nstatic void match_bin_entries(RDyldCache *cache, void *entries) {\n\tr_return_if_fail (cache && cache->bins && entries);\n\n\tcache_img_t *imgs = read_cache_images (cache->buf, cache->hdr, 0);\n\tif (!imgs) {\n\t\treturn;\n\t}\n\n\tRDyldBinImage *bin = NULL;\n\tRListIter *it = r_list_iterator (cache->bins);\n\n\tbool has_large_entries = cache->n_hdr > 1;\n\n\tut32 i;\n\tfor (i = 0; i < cache->hdr->imagesCount; i++) {\n\t\tcache_img_t *img = &imgs[i];\n\t\tif (!it) {\n\t\t\tbreak;\n\t\t}\n\t\tbin = it->data;\n\t\tif (!bin) {\n\t\t\tbreak;\n\t\t}\n\t\tif (bin && bin->va == img->address) {\n\t\t\tif (has_large_entries) {\n\t\t\t\tcache_locsym_entry_large_t *e = &((cache_locsym_entry_large_t *) entries)[i];\n\t\t\t\tbin->nlist_start_index = e->nlistStartIndex;\n\t\t\t\tbin->nlist_count = e->nlistCount;\n\t\t\t} else {\n\t\t\t\tcache_locsym_entry_t *e = &((cache_locsym_entry_t *) entries)[i];\n\t\t\t\tbin->nlist_start_index = e->nlistStartIndex;\n\t\t\t\tbin->nlist_count = e->nlistCount;\n\t\t\t}\n\t\t\tit = it->n;\n\t\t}\n\t}\n\n\tR_FREE (imgs);\n}\n\nstatic RDyldLocSym *r_dyld_locsym_new(RDyldCache *cache) {\n\tr_return_val_if_fail (cache && cache->buf, NULL);\n\n\tut32 i;\n\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\tif (!hdr || !hdr->localSymbolsSize || !hdr->localSymbolsOffset) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tcache_locsym_info_t *info = NULL;\n\t\tvoid *entries = NULL;\n\n\t\tut64 info_size = sizeof (cache_locsym_info_t);\n\t\tinfo = R_NEW0 (cache_locsym_info_t);\n\t\tif (!info) {\n\t\t\tgoto beach;\n\t\t}\n\t\tif (r_buf_fread_at (cache->buf, hdr->localSymbolsOffset, (ut8*) info, \"6i\", 1) != info_size) {\n\t\t\teprintf (\"locsym err 01\\n\");\n\t\t\tgoto beach;\n\t\t}\n\t\tif (info->entriesCount != cache->hdr->imagesCount) {\n\t\t\teprintf (\"locsym err 02\\n\");\n\t\t\tgoto beach;\n\t\t}\n\n\t\tbool has_large_entries = cache->n_hdr > 1;\n\t\tif (has_large_entries) {\n\t\t\tut64 entries_size = sizeof (cache_locsym_entry_large_t) * info->entriesCount;\n\t\t\tcache_locsym_entry_large_t *large_entries = R_NEWS0 (cache_locsym_entry_large_t, info->entriesCount);\n\t\t\tif (!large_entries) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache->buf, hdr->localSymbolsOffset + info->entriesOffset, (ut8*) large_entries, \"lii\",\n\t\t\t\t\tinfo->entriesCount) != entries_size) {\n\t\t\t\teprintf (\"locsym err 03\\n\");\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tentries = large_entries;\n\t\t} else {\n\t\t\tut64 entries_size = sizeof (cache_locsym_entry_t) * info->entriesCount;\n\t\t\tcache_locsym_entry_t *regular_entries = R_NEWS0 (cache_locsym_entry_t, info->entriesCount);\n\t\t\tif (!regular_entries) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache->buf, hdr->localSymbolsOffset + info->entriesOffset, (ut8*) regular_entries, \"iii\",\n\t\t\t\t\tinfo->entriesCount) != entries_size) {\n\t\t\t\teprintf (\"locsym err 04\\n\");\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tentries = regular_entries;\n\t\t}\n\t\tRDyldLocSym * locsym = R_NEW0 (RDyldLocSym);\n\t\tif (!locsym) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tmatch_bin_entries (cache, entries);\n\n\t\tlocsym->local_symbols_offset = hdr->localSymbolsOffset;\n\t\tlocsym->nlists_offset = info->nlistOffset;\n\t\tlocsym->nlists_count = info->nlistCount;\n\t\tlocsym->strings_offset = info->stringsOffset;\n\t\tlocsym->strings_size = info->stringsSize;\n\n\t\tfree (info);\n\t\tfree (entries);\n\n\t\treturn locsym;\n\nbeach:\n\t\tfree (info);\n\t\tfree (entries);\n\n\t\teprintf (\"dyldcache: malformed local symbols metadata\\n\");\n\t\tbreak;\n\t}\n\treturn NULL;\n}\n\nstatic ut64 rebase_infos_get_slide(RDyldCache *cache) {\n\tif (!cache->rebase_infos || !cache->rebase_infos->length) {\n\t\treturn 0;\n\t}\n\n\tsize_t i;\n\tfor (i = 0; i < cache->rebase_infos->length; i++) {\n\t\tif (cache->rebase_infos->entries[i].info) {\n\t\t\treturn cache->rebase_infos->entries[i].info->slide;\n\t\t}\n\t}\n\n\treturn 0;\n}\n\nstatic void symbols_from_locsym(RDyldCache *cache, RDyldBinImage *bin, RList *symbols, SetU *hash) {\n\tRDyldLocSym *locsym = cache->locsym;\n\tif (!locsym) {\n\t\treturn;\n\t}\n\n\tif (bin->nlist_start_index >= locsym->nlists_count ||\n\t\t\tbin->nlist_start_index + bin->nlist_count > locsym->nlists_count) {\n\t\teprintf (\"dyldcache: malformed local symbol entry\\n\");\n\t\treturn;\n\t}\n\n\tut64 nlists_size = sizeof (struct MACH0_(nlist)) * bin->nlist_count;\n\tstruct MACH0_(nlist) *nlists = R_NEWS0 (struct MACH0_(nlist), bin->nlist_count);\n\tif (!nlists) {\n\t\treturn;\n\t}\n\tut64 nlists_offset = locsym->local_symbols_offset + locsym->nlists_offset +\n\t\tbin->nlist_start_index * sizeof (struct MACH0_(nlist));\n\tif (r_buf_fread_at (cache->buf, nlists_offset, (ut8*) nlists, \"iccsl\", bin->nlist_count) != nlists_size) {\n\t\tfree (nlists);\n\t\treturn;\n\t}\n\n\tut32 j;\n\tfor (j = 0; j != bin->nlist_count; j++) {\n\t\tstruct MACH0_(nlist) *nlist = &nlists[j];\n\t\tif (set_u_contains (hash, (ut64)nlist->n_value)) {\n\t\t\tcontinue;\n\t\t}\n\t\tset_u_add (hash, (ut64)nlist->n_value);\n\t\tif (nlist->n_strx >= locsym->strings_size) {\n\t\t\tcontinue;\n\t\t}\n\t\tRBinSymbol *sym = R_NEW0 (RBinSymbol);\n\t\tif (!sym) {\n\t\t\tbreak;\n\t\t}\n\t\tsym->type = \"LOCAL\";\n\t\tsym->vaddr = nlist->n_value;\n\t\tut64 slide = rebase_infos_get_slide (cache);\n\t\tsym->paddr = va2pa (nlist->n_value, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\n\t\tchar *symstr =r_buf_get_string (cache->buf, locsym->local_symbols_offset + locsym->strings_offset + nlist->n_strx);\n\t\tif (symstr) {\n\t\t\tsym->name = symstr;\n\t\t} else {\n\t\t\tstatic ut32 k = 0;\n\t\t\tsym->name = r_str_newf (\"unk_local%d\", k++);\n\t\t}\n\n\t\tr_list_append (symbols, sym);\n\t}\n\n\tfree (nlists);\n}\n\nstatic void r_dyldcache_free(RDyldCache *cache) {\n\tif (!cache) {\n\t\treturn;\n\t}\n\n\tr_list_free (cache->bins);\n\tcache->bins = NULL;\n\tr_buf_free (cache->buf);\n\tcache->buf = NULL;\n\tif (cache->rebase_infos) {\n\t\tint i;\n\t\tfor (i = 0; i < cache->rebase_infos->length; i++) {\n\t\t\trebase_info_free (cache->rebase_infos->entries[i].info);\n\t\t\tcache->rebase_infos->entries[i].info = NULL;\n\t\t}\n\t\tR_FREE (cache->rebase_infos->entries);\n\t\tR_FREE (cache->rebase_infos);\n\t}\n\tR_FREE (cache->hdr);\n\tR_FREE (cache->maps);\n\tR_FREE (cache->maps_index);\n\tR_FREE (cache->hdr_offset);\n\tR_FREE (cache->accel);\n\tR_FREE (cache->locsym);\n\tR_FREE (cache->oi);\n\tR_FREE (cache);\n}\n\nstatic ut64 bin_obj_va2pa(ut64 p, ut32 *offset, ut32 *left, RBinFile *bf) {\n\tif (!bf || !bf->o || !bf->o->bin_obj) {\n\t\treturn 0;\n\t}\n\n\tRDyldCache *cache = (RDyldCache*) ((struct MACH0_(obj_t)*)bf->o->bin_obj)->user;\n\tif (!cache) {\n\t\treturn 0;\n\t}\n\n\tut64 slide = rebase_infos_get_slide (cache);\n\tut64 res = va2pa (p, cache->n_maps, cache->maps, cache->buf, slide, offset, left);\n\tif (res == UT64_MAX) {\n\t\tres = 0;\n\t}\n\treturn res;\n}\n\nstatic struct MACH0_(obj_t) *bin_to_mach0(RBinFile *bf, RDyldBinImage *bin) {\n\tif (!bin || !bf) {\n\t\treturn NULL;\n\t}\n\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tRBuffer *buf = r_buf_new_slice (cache->buf, bin->hdr_offset, r_buf_size (cache->buf) - bin->hdr_offset);\n\tif (!buf) {\n\t\treturn NULL;\n\t}\n\n\tstruct MACH0_(opts_t) opts;\n\tMACH0_(opts_set_default) (&opts, bf);\n\topts.header_at = bin->header_at - bin->hdr_offset;\n\topts.symbols_off = bin->symbols_off;\n\n\tstruct MACH0_(obj_t) *mach0 = MACH0_(new_buf) (buf, &opts);\n\n\tmach0->user = cache;\n\tmach0->va2pa = &bin_obj_va2pa;\n\n\tr_buf_free (buf);\n\n\treturn mach0;\n}\n\nstatic int prot2perm(int x) {\n\tint r = 0;\n\tif (x & 1) {\n\t\tr |= 4;\n\t}\n\tif (x & 2) {\n\t\tr |= 2;\n\t}\n\tif (x & 4) {\n\t\tr |= 1;\n\t}\n\treturn r;\n}\n\nstatic ut32 dumb_ctzll(ut64 x) {\n\tut64 result = 0;\n\tint i, j;\n\tfor (i = 0; i < 64; i += 8) {\n\t\tut8 byte = (x >> i) & 0xff;\n\t\tif (!byte) {\n\t\t\tresult += 8;\n\t\t} else {\n\t\t\tfor (j = 0; j < 8; j++) {\n\t\t\t\tif (!((byte >> j) & 1)) {\n\t\t\t\t\tresult++;\n\t\t\t\t} else {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn result;\n}\n\nstatic ut64 estimate_slide(RBinFile *bf, RDyldCache *cache, ut64 value_mask, ut64 value_add) {\n\tut64 slide = 0;\n\tif (cache->n_hdr > 1) {\n\t\treturn slide;\n\t}\n\tut64 *classlist = malloc (64);\n\tif (!classlist) {\n\t\tgoto beach;\n\t}\n\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tbool found_sample = false;\n\n\t\tstruct MACH0_(opts_t) opts = {0};\n\t\topts.verbose = bf->rbin->verbose;\n\t\topts.header_at = bin->header_at;\n\t\topts.symbols_off = 0;\n\n\t\tstruct MACH0_(obj_t) *mach0 = MACH0_(new_buf) (cache->buf, &opts);\n\t\tif (!mach0) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tstruct section_t *sections = NULL;\n\t\tif (!(sections = MACH0_(get_sections) (mach0))) {\n\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\tgoto beach;\n\t\t}\n\n\t\tint i;\n\t\tint incomplete = 2;\n\t\tint classlist_idx = 0, data_idx = 0;\n\t\tfor (i = 0; !sections[i].last && incomplete; i++) {\n\t\t\tif (sections[i].size == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (strstr (sections[i].name, \"__objc_classlist\")) {\n\t\t\t\tincomplete--;\n\t\t\t\tclasslist_idx = i;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (strstr (sections[i].name, \"__objc_data\")) {\n\t\t\t\tincomplete--;\n\t\t\t\tdata_idx = i;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tif (incomplete) {\n\t\t\tgoto next_bin;\n\t\t}\n\n\t\tint classlist_sample_size = R_MIN (64, sections[classlist_idx].size);\n\t\tint n_classes = classlist_sample_size / 8;\n\t\tut64 sect_offset = sections[classlist_idx].offset + bin->hdr_offset;\n\n\t\tif (r_buf_fread_at (cache->buf, sect_offset, (ut8*) classlist, \"l\", n_classes) < classlist_sample_size) {\n\t\t\tgoto next_bin;\n\t\t}\n\n\t\tut64 data_addr = sections[data_idx].addr;\n\t\tut64 data_tail = data_addr & 0xfff;\n\t\tut64 data_tail_end = (data_addr + sections[data_idx].size) & 0xfff;\n\t\tfor (i = 0; i < n_classes; i++) {\n\t\t\tut64 cl_addr = (classlist[i] & value_mask) + value_add;\n\t\t\tut64 cl_tail = cl_addr & 0xfff;\n\t\t\tif (cl_tail >= data_tail && cl_tail < data_tail_end) {\n\t\t\t\tut64 off = cl_tail - data_tail;\n\t\t\t\tslide = ((cl_addr - off) & value_mask) - (data_addr & value_mask);\n\t\t\t\tfound_sample = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\nnext_bin:\n\t\tMACH0_(mach0_free) (mach0);\n\t\tR_FREE (sections);\n\n\t\tif (found_sample) {\n\t\t\tbreak;\n\t\t}\n\t}\n\nbeach:\n\tR_FREE (classlist);\n\treturn slide;\n}\n\nstatic RDyldRebaseInfo *get_rebase_info(RBinFile *bf, RDyldCache *cache, ut64 slideInfoOffset, ut64 slideInfoSize, ut64 start_of_data, ut64 slide) {\n\tut8 *tmp_buf_1 = NULL;\n\tut8 *tmp_buf_2 = NULL;\n\tut8 *one_page_buf = NULL;\n\tRBuffer *cache_buf = cache->buf;\n\n\tut64 offset = slideInfoOffset;\n\tut32 slide_info_version = 0;\n\tif (r_buf_read_at (cache_buf, offset, (ut8*) &slide_info_version, 4) != 4) {\n\t\treturn NULL;\n\t}\n\n\tif (slide_info_version == 3) {\n\t\tcache_slide3_t slide_info;\n\t\tut64 size = sizeof (cache_slide3_t);\n\t\tif (r_buf_fread_at (cache_buf, offset, (ut8*) &slide_info, \"4i1l\", 1) < 20) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tut64 page_starts_offset = offset + size;\n\t\tut64 page_starts_size = slide_info.page_starts_count * 2;\n\n\t\tif (page_starts_size + size > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (page_starts_size > 0) {\n\t\t\ttmp_buf_1 = malloc (page_starts_size);\n\t\t\tif (!tmp_buf_1) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache_buf, page_starts_offset, tmp_buf_1, \"s\", slide_info.page_starts_count) != page_starts_size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tif (slide_info.page_size > 0) {\n\t\t\tone_page_buf = malloc (slide_info.page_size);\n\t\t\tif (!one_page_buf) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tRDyldRebaseInfo3 *rebase_info = R_NEW0 (RDyldRebaseInfo3);\n\t\tif (!rebase_info) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\trebase_info->version = 3;\n\t\trebase_info->delta_mask = 0x3ff8000000000000ULL;\n\t\trebase_info->delta_shift = 51;\n\t\trebase_info->start_of_data = start_of_data;\n\t\trebase_info->page_starts = (ut16*) tmp_buf_1;\n\t\trebase_info->page_starts_count = slide_info.page_starts_count;\n\t\trebase_info->auth_value_add = slide_info.auth_value_add;\n\t\trebase_info->page_size = slide_info.page_size;\n\t\trebase_info->one_page_buf = one_page_buf;\n\t\tif (slide == UT64_MAX) {\n\t\t\trebase_info->slide = estimate_slide (bf, cache, 0x7ffffffffffffULL, 0);\n\t\t\tif (rebase_info->slide) {\n\t\t\t\teprintf (\"dyldcache is slid: 0x%\"PFMT64x\"\\n\", rebase_info->slide);\n\t\t\t}\n\t\t} else {\n\t\t\trebase_info->slide = slide;\n\t\t}\n\n\t\treturn (RDyldRebaseInfo*) rebase_info;\n\t} else if (slide_info_version == 2 || slide_info_version == 4) {\n\t\tcache_slide2_t slide_info;\n\t\tut64 size = sizeof (cache_slide2_t);\n\t\tif (r_buf_fread_at (cache_buf, offset, (ut8*) &slide_info, \"6i2l\", 1) != size) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.page_starts_offset == 0 ||\n\t\t\tslide_info.page_starts_offset > slideInfoSize ||\n\t\t\tslide_info.page_starts_offset + slide_info.page_starts_count * 2 > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.page_extras_offset == 0 ||\n\t\t\tslide_info.page_extras_offset > slideInfoSize ||\n\t\t\tslide_info.page_extras_offset + slide_info.page_extras_count * 2 > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.page_starts_count > 0) {\n\t\t\tut64 size = slide_info.page_starts_count * 2;\n\t\t\tut64 at = slideInfoOffset + slide_info.page_starts_offset;\n\t\t\ttmp_buf_1 = malloc (size);\n\t\t\tif (!tmp_buf_1) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache_buf, at, tmp_buf_1, \"s\", slide_info.page_starts_count) != size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tif (slide_info.page_extras_count > 0) {\n\t\t\tut64 size = slide_info.page_extras_count * 2;\n\t\t\tut64 at = slideInfoOffset + slide_info.page_extras_offset;\n\t\t\ttmp_buf_2 = malloc (size);\n\t\t\tif (!tmp_buf_2) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache_buf, at, tmp_buf_2, \"s\", slide_info.page_extras_count) != size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tif (slide_info.page_size > 0) {\n\t\t\tone_page_buf = malloc (slide_info.page_size);\n\t\t\tif (!one_page_buf) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tRDyldRebaseInfo2 *rebase_info = R_NEW0 (RDyldRebaseInfo2);\n\t\tif (!rebase_info) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\trebase_info->version = slide_info_version;\n\t\trebase_info->start_of_data = start_of_data;\n\t\trebase_info->page_starts = (ut16*) tmp_buf_1;\n\t\trebase_info->page_starts_count = slide_info.page_starts_count;\n\t\trebase_info->page_extras = (ut16*) tmp_buf_2;\n\t\trebase_info->page_extras_count = slide_info.page_extras_count;\n\t\trebase_info->value_add = slide_info.value_add;\n\t\trebase_info->delta_mask = slide_info.delta_mask;\n\t\trebase_info->value_mask = ~rebase_info->delta_mask;\n\t\trebase_info->delta_shift = dumb_ctzll (rebase_info->delta_mask) - 2;\n\t\trebase_info->page_size = slide_info.page_size;\n\t\trebase_info->one_page_buf = one_page_buf;\n\t\tif (slide == UT64_MAX) {\n\t\t\trebase_info->slide = estimate_slide (bf, cache, rebase_info->value_mask, rebase_info->value_add);\n\t\t\tif (rebase_info->slide) {\n\t\t\t\teprintf (\"dyldcache is slid: 0x%\"PFMT64x\"\\n\", rebase_info->slide);\n\t\t\t}\n\t\t} else {\n\t\t\trebase_info->slide = slide;\n\t\t}\n\n\t\treturn (RDyldRebaseInfo*) rebase_info;\n\t} else if (slide_info_version == 1) {\n\t\tcache_slide1_t slide_info;\n\t\tut64 size = sizeof (cache_slide1_t);\n\t\tif (r_buf_fread_at (cache_buf, offset, (ut8*) &slide_info, \"6i\", 1) != size) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.toc_offset == 0 ||\n\t\t\tslide_info.toc_offset > slideInfoSize ||\n\t\t\tslide_info.toc_offset + slide_info.toc_count * 2 > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.entries_offset == 0 ||\n\t\t\tslide_info.entries_offset > slideInfoSize ||\n\t\t\tslide_info.entries_offset + slide_info.entries_count * slide_info.entries_size > slideInfoSize) {\n\t\t\treturn NULL;\n\t\t}\n\n\t\tif (slide_info.toc_count > 0) {\n\t\t\tut64 size = slide_info.toc_count * 2;\n\t\t\tut64 at = slideInfoOffset + slide_info.toc_offset;\n\t\t\ttmp_buf_1 = malloc (size);\n\t\t\tif (!tmp_buf_1) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_fread_at (cache_buf, at, tmp_buf_1, \"s\", slide_info.toc_count) != size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tif (slide_info.entries_count > 0) {\n\t\t\tut64 size = (ut64) slide_info.entries_count * (ut64) slide_info.entries_size;\n\t\t\tut64 at = slideInfoOffset + slide_info.entries_offset;\n\t\t\ttmp_buf_2 = malloc (size);\n\t\t\tif (!tmp_buf_2) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\tif (r_buf_read_at (cache_buf, at, tmp_buf_2, size) != size) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t}\n\n\t\tone_page_buf = malloc (4096);\n\t\tif (!one_page_buf) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tRDyldRebaseInfo1 *rebase_info = R_NEW0 (RDyldRebaseInfo1);\n\t\tif (!rebase_info) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\trebase_info->version = 1;\n\t\trebase_info->start_of_data = start_of_data;\n\t\trebase_info->one_page_buf = one_page_buf;\n\t\trebase_info->page_size = 4096;\n\t\trebase_info->toc = (ut16*) tmp_buf_1;\n\t\trebase_info->toc_count = slide_info.toc_count;\n\t\trebase_info->entries = tmp_buf_2;\n\t\trebase_info->entries_size = slide_info.entries_size;\n\t\tif (slide == UT64_MAX) {\n\t\t\trebase_info->slide = estimate_slide (bf, cache, UT64_MAX, 0);\n\t\t\tif (rebase_info->slide) {\n\t\t\t\teprintf (\"dyldcache is slid: 0x%\"PFMT64x\"\\n\", rebase_info->slide);\n\t\t\t}\n\t\t} else {\n\t\t\trebase_info->slide = slide;\n\t\t}\n\n\t\treturn (RDyldRebaseInfo*) rebase_info;\n\t} else {\n\t\teprintf (\"unsupported slide info version %d\\n\", slide_info_version);\n\t\treturn NULL;\n\t}\n\nbeach:\n\tR_FREE (tmp_buf_1);\n\tR_FREE (tmp_buf_2);\n\tR_FREE (one_page_buf);\n\treturn NULL;\n}\n\nstatic RDyldRebaseInfos *get_rebase_infos(RBinFile *bf, RDyldCache *cache) {\n\tRDyldRebaseInfos *result = R_NEW0 (RDyldRebaseInfos);\n\tif (!result) {\n\t\treturn NULL;\n\t}\n\n\tif (!cache->hdr->slideInfoOffset || !cache->hdr->slideInfoSize) {\n\t\tut32 total_slide_infos = 0;\n\t\tut32 n_slide_infos[MAX_N_HDR];\n\n\t\tut32 i;\n\t\tfor (i = 0; i < cache->n_hdr && i < MAX_N_HDR; i++) {\n\t\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\t\tif ((n_slide_infos[i] = r_buf_read_le32_at (cache->buf, 0x13c + hdr_offset)) == UT32_MAX) {\n\t\t\t\tgoto beach;\n\t\t\t}\n\t\t\ttotal_slide_infos += n_slide_infos[i];\n\t\t}\n\n\t\tif (!total_slide_infos) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tRDyldRebaseInfosEntry * infos = R_NEWS0 (RDyldRebaseInfosEntry, total_slide_infos);\n\t\tif (!infos) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tut32 k = 0;\n\t\tfor (i = 0; i < cache->n_hdr && i < MAX_N_HDR; i++) {\n\t\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\t\tut64 slide_infos_offset;\n\t\t\tif (!n_slide_infos[i]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif ((slide_infos_offset = r_buf_read_le32_at (cache->buf, 0x138 + hdr_offset)) == UT32_MAX) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (!slide_infos_offset) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tslide_infos_offset += hdr_offset;\n\n\t\t\tut32 j;\n\t\t\tRDyldRebaseInfo *prev_info = NULL;\n\t\t\tfor (j = 0; j < n_slide_infos[i]; j++) {\n\t\t\t\tut64 offset = slide_infos_offset + j * sizeof (cache_mapping_slide);\n\t\t\t\tcache_mapping_slide entry;\n\t\t\t\tif (r_buf_fread_at (cache->buf, offset, (ut8*)&entry, \"6lii\", 1) != sizeof (cache_mapping_slide)) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tif (entry.slideInfoOffset && entry.slideInfoSize) {\n\t\t\t\t\tinfos[k].start = entry.fileOffset + hdr_offset;\n\t\t\t\t\tinfos[k].end = infos[k].start + entry.size;\n\t\t\t\t\tut64 slide = prev_info ? prev_info->slide : UT64_MAX;\n\t\t\t\t\tinfos[k].info = get_rebase_info (bf, cache, entry.slideInfoOffset + hdr_offset, entry.slideInfoSize, entry.fileOffset + hdr_offset, slide);\n\t\t\t\t\tprev_info = infos[k].info;\n\t\t\t\t\tk++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (!k) {\n\t\t\tfree (infos);\n\t\t\tgoto beach;\n\t\t}\n\n\t\tif (k < total_slide_infos) {\n\t\t\tRDyldRebaseInfosEntry * pruned_infos = R_NEWS0 (RDyldRebaseInfosEntry, k);\n\t\t\tif (!pruned_infos) {\n\t\t\t\tfree (infos);\n\t\t\t\tgoto beach;\n\t\t\t}\n\n\t\t\tmemcpy (pruned_infos, infos, sizeof (RDyldRebaseInfosEntry) * k);\n\t\t\tfree (infos);\n\t\t\tinfos = pruned_infos;\n\t\t}\n\n\t\tresult->entries = infos;\n\t\tresult->length = k;\n\t\treturn result;\n\t}\n\n\tif (cache->hdr->mappingCount > 1) {\n\t\tRDyldRebaseInfosEntry * infos = R_NEWS0 (RDyldRebaseInfosEntry, 1);\n\t\tif (!infos) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tinfos[0].start = cache->maps[1].fileOffset;\n\t\tinfos[0].end = infos[0].start + cache->maps[1].size;\n\t\tinfos[0].info = get_rebase_info (bf, cache, cache->hdr->slideInfoOffset, cache->hdr->slideInfoSize, infos[0].start, UT64_MAX);\n\n\t\tresult->entries = infos;\n\t\tresult->length = 1;\n\t\treturn result;\n\t}\n\nbeach:\n\tfree (result);\n\treturn NULL;\n}\n\nstatic bool check_magic(const char *magic) {\n\treturn !strcmp (magic, \"dyld_v1 arm64\")\n\t\t|| !strcmp (magic, \"dyld_v1 arm64e\")\n\t\t|| !strcmp (magic, \"dyld_v1 x86_64\")\n\t\t|| !strcmp (magic, \"dyld_v1 x86_64h\");\n}\n\nstatic bool check_buffer(RBinFile *bf, RBuffer *buf) {\n\tif (r_buf_size (buf) < 32) {\n\t\treturn false;\n\t}\n\n\tchar hdr[17] = { 0 };\n\tint rhdr = r_buf_read_at (buf, 0, (ut8 *)&hdr, sizeof (hdr) - 1);\n\tif (rhdr != sizeof (hdr) - 1) {\n\t\treturn false;\n\t}\n\n\treturn check_magic (hdr);\n}\n\nstatic cache_imgxtr_t *read_cache_imgextra(RBuffer *cache_buf, cache_hdr_t *hdr, cache_accel_t *accel) {\n\tif (!cache_buf || !hdr || !hdr->imagesCount || !accel || !accel->imageExtrasCount || !accel->imagesExtrasOffset) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_imgxtr_t) * accel->imageExtrasCount;\n\tcache_imgxtr_t *images = R_NEWS0 (cache_imgxtr_t, accel->imageExtrasCount);\n\tif (!images) {\n\t\treturn NULL;\n\t}\n\n\tif (r_buf_fread_at (cache_buf, accel->imagesExtrasOffset, (ut8*) images, \"ll4i\", accel->imageExtrasCount) != size) {\n\t\tR_FREE (images);\n\t\treturn NULL;\n\t}\n\n\treturn images;\n}\n\nstatic char *get_lib_name(RBuffer *cache_buf, cache_img_t *img) {\n\tchar file[256];\n\tchar *lib_name = file;\n\tif (r_buf_read_at (cache_buf, img->pathFileOffset, (ut8*) &file, sizeof (file)) == sizeof (file)) {\n\t\tfile[255] = 0;\n\t\t/*char * last_slash = strrchr (file, '/');\n\t\tif (last_slash && *last_slash) {\n\t\t\tlib_name = last_slash + 1;\n\t\t}*/\n\t\treturn strdup (lib_name);\n\t}\n\treturn strdup (\"FAIL\");\n}\n\nstatic int string_contains(const void *a, const void *b) {\n\treturn !strstr ((const char*) a, (const char*) b);\n}\n\nstatic HtPU *create_path_to_index(RBuffer *cache_buf, cache_img_t *img, cache_hdr_t *hdr) {\n\tHtPU *path_to_idx = ht_pu_new0 ();\n\tif (!path_to_idx) {\n\t\treturn NULL;\n\t}\n\tsize_t i;\n\tfor (i = 0; i != hdr->imagesCount; i++) {\n\t\tchar file[256];\n\t\tif (r_buf_read_at (cache_buf, img[i].pathFileOffset, (ut8*) &file, sizeof (file)) != sizeof (file)) {\n\t\t\tcontinue;\n\t\t}\n\t\tfile[sizeof (file) - 1] = 0;\n\t\tht_pu_insert (path_to_idx, file, (ut64)i);\n\n\t\tconst char versions_pattern[] = \".framework/Versions/\";\n\t\tchar *versions = strstr (file, versions_pattern);\n\t\tif (versions) {\n\t\t\tchar *next_slash = strchr (versions + 20, '/');\n\t\t\tif (next_slash) {\n\t\t\t\tchar *tail = strdup (next_slash);\n\t\t\t\tif (!tail) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tstrcpy (versions + 10, tail);\n\t\t\t\tfree (tail);\n\t\t\t\tht_pu_insert (path_to_idx, file, (ut64)i);\n\t\t\t}\n\t\t}\n\t}\n\treturn path_to_idx;\n}\n\nstatic void carve_deps_at_address(RDyldCache *cache, cache_img_t *img, HtPU *path_to_idx, ut64 address, int *deps, bool printing) {\n\tut64 pa = va2pa (address, cache->n_maps, cache->maps, cache->buf, 0, NULL, NULL);\n\tif (pa == UT64_MAX) {\n\t\treturn;\n\t}\n\tstruct MACH0_(mach_header) mh;\n\tif (r_buf_fread_at (cache->buf, pa, (ut8*) &mh, \"8i\", 1) != sizeof (struct MACH0_(mach_header))) {\n\t\treturn;\n\t}\n\tif (mh.magic != MH_MAGIC_64 || mh.sizeofcmds == 0) {\n\t\treturn;\n\t}\n\tut64 cmds_at = pa + sizeof (struct MACH0_(mach_header));\n\tut8 *cmds = malloc (mh.sizeofcmds + 1);\n\tif (!cmds || r_buf_read_at (cache->buf, cmds_at, cmds, mh.sizeofcmds) != mh.sizeofcmds) {\n\t\tgoto beach;\n\t}\n\tcmds[mh.sizeofcmds] = 0;\n\tut8 *cursor = cmds;\n\tut8 *end = cmds + mh.sizeofcmds;\n\twhile (cursor < end) {\n\t\tut32 cmd = r_read_le32 (cursor);\n\t\tut32 cmdsize = r_read_le32 (cursor + sizeof (ut32));\n\t\tif (cmd == LC_LOAD_DYLIB ||\n\t\t\t\tcmd == LC_LOAD_WEAK_DYLIB ||\n\t\t\t\tcmd == LC_REEXPORT_DYLIB ||\n\t\t\t\tcmd == LC_LOAD_UPWARD_DYLIB) {\n\t\t\tbool found;\n\t\t\tif (cursor + 24 >= end) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tconst char *key = (const char *) cursor + 24;\n\t\t\tsize_t dep_index = (size_t)ht_pu_find (path_to_idx, key, &found);\n\t\t\tif (!found || dep_index >= cache->hdr->imagesCount) {\n\t\t\t\teprintf (\"Warning: alien dep '%s'\\n\", key);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tdeps[dep_index]++;\n\t\t\tif (printing) {\n\t\t\t\teprintf (\"-> %s\\n\", key);\n\t\t\t}\n\t\t}\n\t\tcursor += cmdsize;\n\t}\n\nbeach:\n\tfree (cmds);\n}\n\nstatic ut64 resolve_symbols_off(RDyldCache *cache, ut64 pa) {\n\tstruct MACH0_(mach_header) mh;\n\tif (r_buf_fread_at (cache->buf, pa, (ut8*) &mh, \"8i\", 1) != sizeof (struct MACH0_(mach_header))) {\n\t\treturn 0;\n\t}\n\tif (mh.magic != MH_MAGIC_64 || mh.sizeofcmds == 0) {\n\t\treturn 0;\n\t}\n\tut64 cmds_at = pa + sizeof (struct MACH0_(mach_header));\n\tut64 cursor = cmds_at;\n\tut64 end = cursor + mh.sizeofcmds;\n\twhile (cursor < end) {\n\t\tut32 cmd = r_buf_read_le32_at (cache->buf, cursor);\n\t\tif (cmd == UT32_MAX) {\n\t\t\treturn 0;\n\t\t}\n\t\tut32 cmdsize = r_buf_read_le32_at (cache->buf, cursor + sizeof (ut32));\n\t\tif (cmdsize == UT32_MAX) {\n\t\t\treturn 0;\n\t\t}\n\t\tif (cmd == LC_SEGMENT || cmd == LC_SEGMENT_64) {\n\t\t\tchar segname[17];\n\t\t\tsegname[16] = 0;\n\t\t\tif (r_buf_read_at (cache->buf, cursor + 2 * sizeof (ut32), (ut8 *)segname, 16) != 16) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (!strncmp (segname, \"__LINKEDIT\", 16)) {\n\t\t\t\tut64 vmaddr = r_buf_read_le64_at (cache->buf, cursor + 2 * sizeof (ut32) + 16);\n\t\t\t\tif (vmaddr == UT64_MAX) {\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\n\t\t\t\tut32 i,j;\n\t\t\t\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\t\t\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\t\t\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\t\t\t\tut32 maps_index = cache->maps_index[i];\n\t\t\t\t\tfor (j = 0; j < hdr->mappingCount; j++) {\n\t\t\t\t\t\tut64 map_start = cache->maps[maps_index + j].address;\n\t\t\t\t\t\tut64 map_end = map_start + cache->maps[maps_index + j].size;\n\t\t\t\t\t\tif (vmaddr >= map_start && vmaddr < map_end) {\n\t\t\t\t\t\t\treturn hdr_offset;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcursor += cmdsize;\n\t}\n\treturn 0;\n}\n\nstatic RList *create_cache_bins(RBinFile *bf, RDyldCache *cache) {\n\tRList *bins = r_list_newf ((RListFree)free_bin);\n\tut16 *depArray = NULL;\n\tcache_imgxtr_t *extras = NULL;\n\tif (!bins) {\n\t\treturn NULL;\n\t}\n\n\tchar *target_libs = NULL;\n\tRList *target_lib_names = NULL;\n\tint *deps = NULL;\n\ttarget_libs = r_sys_getenv (\"R_DYLDCACHE_FILTER\");\n\tif (target_libs) {\n\t\ttarget_lib_names = r_str_split_list (target_libs, \":\", 0);\n\t\tif (!target_lib_names) {\n\t\t\tr_list_free (bins);\n\t\t\treturn NULL;\n\t\t}\n\t\tdeps = R_NEWS0 (int, cache->hdr->imagesCount);\n\t\tif (!deps) {\n\t\t\tr_list_free (bins);\n\t\t\tr_list_free (target_lib_names);\n\t\t\treturn NULL;\n\t\t}\n\t}\n\n\tut32 i;\n\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\tut32 maps_index = cache->maps_index[i];\n\t\tcache_img_t *img = read_cache_images (cache->buf, hdr, hdr_offset);\n\t\tif (!img) {\n\t\t\tgoto next;\n\t\t}\n\n\t\tut32 j;\n\t\tif (target_libs) {\n\t\t\tHtPU *path_to_idx = NULL;\n\t\t\tif (cache->accel) {\n\t\t\t\tdepArray = R_NEWS0 (ut16, cache->accel->depListCount);\n\t\t\t\tif (!depArray) {\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\n\t\t\t\tif (r_buf_fread_at (cache->buf, cache->accel->depListOffset, (ut8*) depArray, \"s\", cache->accel->depListCount) != cache->accel->depListCount * 2) {\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\n\t\t\t\textras = read_cache_imgextra (cache->buf, hdr, cache->accel);\n\t\t\t\tif (!extras) {\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tpath_to_idx = create_path_to_index (cache->buf, img, hdr);\n\t\t\t}\n\n\t\t\tfor (j = 0; j < hdr->imagesCount; j++) {\n\t\t\t\tbool printing = !deps[j];\n\t\t\t\tchar *lib_name = get_lib_name (cache->buf, &img[j]);\n\t\t\t\tif (!lib_name) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (strstr (lib_name, \"libobjc.A.dylib\")) {\n\t\t\t\t\tdeps[j]++;\n\t\t\t\t}\n\t\t\t\tif (!r_list_find (target_lib_names, lib_name, string_contains)) {\n\t\t\t\t\tR_FREE (lib_name);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (printing) {\n\t\t\t\t\teprintf (\"FILTER: %s\\n\", lib_name);\n\t\t\t\t}\n\t\t\t\tR_FREE (lib_name);\n\t\t\t\tdeps[j]++;\n\n\t\t\t\tif (extras && depArray) {\n\t\t\t\t\tut32 k;\n\t\t\t\t\tfor (k = extras[j].dependentsStartArrayIndex; depArray[k] != 0xffff; k++) {\n\t\t\t\t\t\tut16 dep_index = depArray[k] & 0x7fff;\n\t\t\t\t\t\tdeps[dep_index]++;\n\n\t\t\t\t\t\tchar *dep_name = get_lib_name (cache->buf, &img[dep_index]);\n\t\t\t\t\t\tif (!dep_name) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (printing) {\n\t\t\t\t\t\t\teprintf (\"-> %s\\n\", dep_name);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfree (dep_name);\n\t\t\t\t\t}\n\t\t\t\t} else if (path_to_idx) {\n\t\t\t\t\tcarve_deps_at_address (cache, img, path_to_idx, img[j].address, deps, printing);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tht_pu_free (path_to_idx);\n\t\t\tR_FREE (depArray);\n\t\t\tR_FREE (extras);\n\t\t}\n\n\t\tfor (j = 0; j < hdr->imagesCount; j++) {\n\t\t\tif (deps && !deps[j]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tut64 pa = va2pa (img[j].address, hdr->mappingCount, &cache->maps[maps_index], cache->buf, 0, NULL, NULL);\n\t\t\tif (pa == UT64_MAX) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tut8 magicbytes[4];\n\t\t\tr_buf_read_at (cache->buf, pa, magicbytes, 4);\n\t\t\tint magic = r_read_le32 (magicbytes);\n\t\t\tswitch (magic) {\n\t\t\tcase MH_MAGIC_64:\n\t\t\t{\n\t\t\t\tchar file[256];\n\t\t\t\tRDyldBinImage *bin = R_NEW0 (RDyldBinImage);\n\t\t\t\tif (!bin) {\n\t\t\t\t\tgoto next;\n\t\t\t\t}\n\t\t\t\tbin->header_at = pa;\n\t\t\t\tbin->hdr_offset = hdr_offset;\n\t\t\t\tbin->symbols_off = resolve_symbols_off (cache, pa);\n\t\t\t\tbin->va = img[j].address;\n\t\t\t\tif (r_buf_read_at (cache->buf, img[j].pathFileOffset, (ut8*) &file, sizeof (file)) == sizeof (file)) {\n\t\t\t\t\tfile[255] = 0;\n\t\t\t\t\tchar *last_slash = strrchr (file, '/');\n\t\t\t\t\tif (last_slash && *last_slash) {\n\t\t\t\t\t\tif (last_slash > file) {\n\t\t\t\t\t\t\tchar *scan = last_slash - 1;\n\t\t\t\t\t\t\twhile (scan > file && *scan != '/') {\n\t\t\t\t\t\t\t\tscan--;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (*scan == '/') {\n\t\t\t\t\t\t\t\tbin->file = strdup (scan + 1);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbin->file = strdup (last_slash + 1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tbin->file = strdup (last_slash + 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tbin->file = strdup (file);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tr_list_append (bins, bin);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\teprintf (\"Unknown sub-bin\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\nnext:\n\t\tR_FREE (depArray);\n\t\tR_FREE (extras);\n\t\tR_FREE (img);\n\t}\n\tif (r_list_empty (bins)) {\n\t\tr_list_free (bins);\n\t\tbins = NULL;\n\t}\n\tR_FREE (deps);\n\tR_FREE (target_libs);\n\tr_list_free (target_lib_names);\n\treturn bins;\n}\n\nstatic void rebase_bytes_v1(RDyldRebaseInfo1 *rebase_info, ut8 *buf, ut64 offset, int count, ut64 start_of_write) {\n\tint in_buf = 0;\n\twhile (in_buf < count) {\n\t\tut64 offset_in_data = offset - rebase_info->start_of_data;\n\t\tut64 page_index = offset_in_data / rebase_info->page_size;\n\t\tut64 page_offset = offset_in_data % rebase_info->page_size;\n\t\tut64 to_next_page = rebase_info->page_size - page_offset;\n\t\tut64 entry_index = page_offset / 32;\n\t\tut64 offset_in_entry = (page_offset % 32) / 4;\n\n\t\tif (entry_index >= rebase_info->entries_size) {\n\t\t\tin_buf += to_next_page;\n\t\t\toffset += to_next_page;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (page_index >= rebase_info->toc_count) {\n\t\t\tbreak;\n\t\t}\n\n\t\tut8 *entry = &rebase_info->entries[rebase_info->toc[page_index] * rebase_info->entries_size];\n\t\tut8 b = entry[entry_index];\n\n\t\tif (b & (1 << offset_in_entry)) {\n\t\t\tut64 value = r_read_le64 (buf + in_buf);\n\t\t\tvalue += rebase_info->slide;\n\t\t\tr_write_le64 (buf + in_buf, value);\n\t\t\tin_buf += 8;\n\t\t\toffset += 8;\n\t\t} else {\n\t\t\tin_buf += 4;\n\t\t\toffset += 4;\n\t\t}\n\t}\n}\n\nstatic void rebase_bytes_v2(RDyldRebaseInfo2 *rebase_info, ut8 *buf, ut64 offset, int count, ut64 start_of_write) {\n\tint in_buf = 0;\n\twhile (in_buf < count) {\n\t\tut64 offset_in_data = offset - rebase_info->start_of_data;\n\t\tut64 page_index = offset_in_data / rebase_info->page_size;\n\t\tut64 page_offset = offset_in_data % rebase_info->page_size;\n\t\tut64 to_next_page = rebase_info->page_size - page_offset;\n\n\t\tif (page_index >= rebase_info->page_starts_count) {\n\t\t\tgoto next_page;\n\t\t}\n\t\tut16 page_flag = rebase_info->page_starts[page_index];\n\n\t\tif (page_flag == DYLD_CACHE_SLIDE_PAGE_ATTR_NO_REBASE) {\n\t\t\tgoto next_page;\n\t\t}\n\n\t\tif (!(page_flag & DYLD_CACHE_SLIDE_PAGE_ATTR_EXTRA)) {\n\t\t\tut64 first_rebase_off = rebase_info->page_starts[page_index] * 4;\n\t\t\tif (first_rebase_off >= page_offset && first_rebase_off < page_offset + count) {\n\t\t\t\tut32 delta = 1;\n\t\t\t\twhile (delta) {\n\t\t\t\t\tut64 position = in_buf + first_rebase_off - page_offset;\n\t\t\t\t\tif (position >= count) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tut64 raw_value = r_read_le64 (buf + position);\n\t\t\t\t\tdelta = ((raw_value & rebase_info->delta_mask) >> rebase_info->delta_shift);\n\t\t\t\t\tif (position >= start_of_write) {\n\t\t\t\t\t\tut64 new_value = raw_value & rebase_info->value_mask;\n\t\t\t\t\t\tif (new_value != 0) {\n\t\t\t\t\t\t\tnew_value += rebase_info->value_add;\n\t\t\t\t\t\t\tnew_value += rebase_info->slide;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tr_write_le64 (buf + position, new_value);\n\t\t\t\t\t}\n\t\t\t\t\tfirst_rebase_off += delta;\n\t\t\t\t}\n\t\t\t}\n\t\t}\nnext_page:\n\t\tin_buf += to_next_page;\n\t\toffset += to_next_page;\n\t}\n}\n\nstatic void rebase_bytes_v3(RDyldRebaseInfo3 *rebase_info, ut8 *buf, ut64 offset, int count, ut64 start_of_write) {\n\tint in_buf = 0;\n\twhile (in_buf < count) {\n\t\tut64 offset_in_data = offset - rebase_info->start_of_data;\n\t\tut64 page_index = offset_in_data / rebase_info->page_size;\n\t\tut64 page_offset = offset_in_data % rebase_info->page_size;\n\t\tut64 to_next_page = rebase_info->page_size - page_offset;\n\n\t\tif (page_index >= rebase_info->page_starts_count) {\n\t\t\tgoto next_page;\n\t\t}\n\t\tut64 delta = rebase_info->page_starts[page_index];\n\n\t\tif (delta == DYLD_CACHE_SLIDE_V3_PAGE_ATTR_NO_REBASE) {\n\t\t\tgoto next_page;\n\t\t}\n\n\t\tut64 first_rebase_off = delta;\n\t\tif (first_rebase_off >= page_offset && first_rebase_off < page_offset + count) {\n\t\t\tdo {\n\t\t\t\tut64 position = in_buf + first_rebase_off - page_offset;\n\t\t\t\tif (position >= count) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tut64 raw_value = r_read_le64 (buf + position);\n\t\t\t\tdelta = ((raw_value & rebase_info->delta_mask) >> rebase_info->delta_shift) * 8;\n\t\t\t\tif (position >= start_of_write) {\n\t\t\t\t\tut64 new_value = 0;\n\t\t\t\t\tif (R_IS_PTR_AUTHENTICATED (raw_value)) {\n\t\t\t\t\t\tnew_value = (raw_value & 0xFFFFFFFFULL) + rebase_info->auth_value_add;\n\t\t\t\t\t\t// TODO: don't throw auth info away\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnew_value = ((raw_value << 13) & 0xFF00000000000000ULL) | (raw_value & 0x7ffffffffffULL);\n\t\t\t\t\t\tnew_value &= 0x00FFFFFFFFFFFFFFULL;\n\t\t\t\t\t}\n\t\t\t\t\tif (new_value != 0) {\n\t\t\t\t\t\tnew_value += rebase_info->slide;\n\t\t\t\t\t}\n\t\t\t\t\tr_write_le64 (buf + position, new_value);\n\t\t\t\t}\n\t\t\t\tfirst_rebase_off += delta;\n\t\t\t} while (delta);\n\t\t}\nnext_page:\n\t\tin_buf += to_next_page;\n\t\toffset += to_next_page;\n\t}\n}\n\nstatic RDyldRebaseInfo *rebase_info_by_range(RDyldRebaseInfos *infos, ut64 offset, int count) {\n\tint imid;\n\tint imin = 0;\n\tint imax = infos->length - 1;\n\n\twhile (imin < imax) {\n\t\timid = (imin + imax) / 2;\n\t\tRDyldRebaseInfosEntry *entry = &infos->entries[imid];\n\t\tif ((entry->end) <= offset) {\n\t\t\timin = imid + 1;\n\t\t} else {\n\t\t\timax = imid;\n\t\t}\n\t}\n\n\tRDyldRebaseInfosEntry *minEntry = &infos->entries[imin];\n\tif ((imax == imin) && (minEntry->start <= offset + count) && (minEntry->end >= offset)) {\n\t\treturn minEntry->info;\n\t}\n\treturn NULL;\n}\n\nstatic void rebase_bytes(RDyldRebaseInfo *rebase_info, ut8 *buf, ut64 offset, int count, ut64 start_of_write) {\n\tif (!rebase_info || !buf) {\n\t\treturn;\n\t}\n\n\tif (rebase_info->version == 3) {\n\t\trebase_bytes_v3 ((RDyldRebaseInfo3*) rebase_info, buf, offset, count, start_of_write);\n\t} else if (rebase_info->version == 2 || rebase_info->version == 4) {\n\t\trebase_bytes_v2 ((RDyldRebaseInfo2*) rebase_info, buf, offset, count, start_of_write);\n\t} else if (rebase_info->version == 1) {\n\t\trebase_bytes_v1 ((RDyldRebaseInfo1*) rebase_info, buf, offset, count, start_of_write);\n\t}\n}\n\nstatic int dyldcache_io_read(RIO *io, RIODesc *fd, ut8 *buf, int count) {\n\tr_return_val_if_fail (io, -1);\n\tRCore *core = (RCore*) io->corebind.core;\n\n\tif (!core || !core->bin || !core->bin->binfiles) {\n\t\treturn -1;\n\t}\n\n\tRDyldCache *cache = NULL;\n\tRListIter *iter;\n\tRBinFile *bf;\n\tr_list_foreach (core->bin->binfiles, iter, bf) {\n\t\tif (bf->fd == fd->fd ) {\n\t\t\tif (!strncmp ((char*) bf->o->bin_obj, \"dyldcac\", 7)) {\n\t\t\t\tcache = bf->o->bin_obj;\n\t\t\t} else {\n\t\t\t\tcache = ((struct MACH0_(obj_t)*) bf->o->bin_obj)->user;\n\t\t\t}\n\t\t\tif (pending_bin_files) {\n\t\t\t\tRListIter *to_remove = r_list_contains (pending_bin_files, bf);\n\t\t\t\tif (to_remove) {\n\t\t\t\t\tr_list_delete (pending_bin_files, to_remove);\n\t\t\t\t\tif (r_list_empty (pending_bin_files)) {\n\t\t\t\t\t\tr_list_free (pending_bin_files);\n\t\t\t\t\t\tpending_bin_files = NULL;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (!cache) {\n\t\tr_list_foreach (pending_bin_files, iter, bf) {\n\t\t\tif (bf->fd == fd->fd && bf->o) {\n\t\t\t\tif (!strncmp ((char*) bf->o->bin_obj, \"dyldcac\", 7)) {\n\t\t\t\t\tcache = bf->o->bin_obj;\n\t\t\t\t} else {\n\t\t\t\t\tcache = ((struct MACH0_(obj_t)*) bf->o->bin_obj)->user;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tif (!cache || !cache->original_io_read) {\n\t\tif (fd->plugin->read == &dyldcache_io_read) {\n\t\t\treturn -1;\n\t\t}\n\t\treturn fd->plugin->read (io, fd, buf, count);\n\t}\n\n\tRDyldRebaseInfo *rebase_info = rebase_info_by_range (cache->rebase_infos, io->off, count);\n\n\tint result = 0;\n\n\tif (rebase_info && count > 0) {\n\t\tut64 offset_in_data = io->off - rebase_info->start_of_data;\n\t\tut64 page_offset = offset_in_data % rebase_info->page_size;\n\n\t\tut64 internal_offset = io->off & ~(rebase_info->page_size - 1);\n\t\tut64 internal_end = io->off + count;\n\t\tint rounded_count = internal_end - internal_offset;\n\n\t\tut8 *internal_buf = rebase_info->one_page_buf;\n\t\tif (rounded_count > rebase_info->page_size) {\n\t\t\tinternal_buf = malloc (rounded_count);\n\t\t\tif (!internal_buf) {\n\t\t\t\teprintf (\"Cannot allocate memory for 'internal_buf'\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\n\t\tut64 original_off = io->off;\n\t\tio->off = internal_offset;\n\n\t\tint internal_result = cache->original_io_read (io, fd, internal_buf, rounded_count);\n\n\t\tio->off = original_off;\n\n\t\tif (internal_result >= page_offset + count) {\n\t\t\trebase_bytes (rebase_info, internal_buf, internal_offset, internal_result, page_offset);\n\t\t\tresult = R_MIN (count, internal_result);\n\t\t\tmemcpy (buf, internal_buf + page_offset, result);\n\t\t} else {\n\t\t\teprintf (\"ERROR rebasing\\n\");\n\t\t\tresult = cache->original_io_read (io, fd, buf, count);\n\t\t}\n\n\t\tif (internal_buf != rebase_info->one_page_buf) {\n\t\t\tR_FREE (internal_buf);\n\t\t}\n\t} else {\n\t\tresult = cache->original_io_read (io, fd, buf, count);\n\t}\n\n\treturn result;\n}\n\nstatic void swizzle_io_read(RDyldCache *cache, RIO *io) {\n\tif (!io || !io->desc || !io->desc->plugin) {\n\t\treturn;\n\t}\n\n\tRIOPlugin *plugin = io->desc->plugin;\n\tcache->original_io_read = plugin->read;\n\tplugin->read = &dyldcache_io_read;\n}\n\nstatic cache_hdr_t *read_cache_header(RBuffer *cache_buf, ut64 offset) {\n\tif (!cache_buf) {\n\t\treturn NULL;\n\t}\n\n\tcache_hdr_t *hdr = R_NEW0 (cache_hdr_t);\n\tif (!hdr) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_hdr_t);\n\tif (r_buf_fread_at (cache_buf, offset, (ut8*) hdr, \"16c4i7l16clii4l\", 1) != size) {\n\t\tR_FREE (hdr);\n\t\treturn NULL;\n\t}\n\tif (!check_magic (hdr->magic)) {\n\t\tR_FREE (hdr);\n\t\treturn NULL;\n\t}\n\n\tif (!hdr->imagesCount && !hdr->imagesOffset) {\n\t\thdr->imagesOffset = r_buf_read_le32_at (cache_buf, 0x1c0 + offset);\n\t\thdr->imagesCount = r_buf_read_le32_at (cache_buf, 0x1c4 + offset);\n\t}\n\treturn hdr;\n}\n\n\nstatic void populate_cache_headers(RDyldCache *cache) {\n\tcache->n_hdr = 0;\n\tRList *hdrs = r_list_newf (NULL);\n\tif (!hdrs) {\n\t\treturn;\n\t}\n\n\tcache_hdr_t *h;\n\tut64 offsets[MAX_N_HDR];\n\tut64 offset = 0;\n\tdo {\n\t\toffsets[cache->n_hdr] = offset;\n\t\th = read_cache_header (cache->buf, offset);\n\t\tif (!h) {\n\t\t\tbreak;\n\t\t}\n\t\tr_list_append (hdrs, h);\n\n\t\tut64 size = h->codeSignatureOffset + h->codeSignatureSize;\n\n#define SHIFT_MAYBE(x) \\\n\tif (x) { \\\n\t\tx += offset; \\\n\t}\n\n\t\tSHIFT_MAYBE (h->mappingOffset);\n\t\tSHIFT_MAYBE (h->imagesOffset);\n\t\tSHIFT_MAYBE (h->codeSignatureOffset);\n\t\tSHIFT_MAYBE (h->slideInfoOffset);\n\t\tSHIFT_MAYBE (h->localSymbolsOffset);\n\t\tSHIFT_MAYBE (h->branchPoolsOffset);\n\t\tSHIFT_MAYBE (h->imagesTextOffset);\n\n\t\toffset += size;\n\t\tcache->n_hdr++;\n\t} while (cache->n_hdr < MAX_N_HDR);\n\n\tif (!cache->n_hdr) {\n\t\tgoto beach;\n\t}\n\n\tcache->hdr = R_NEWS0 (cache_hdr_t, cache->n_hdr);\n\tif (!cache->hdr) {\n\t\tcache->n_hdr = 0;\n\t\tgoto beach;\n\t}\n\n\tcache->hdr_offset = R_NEWS0 (ut64, cache->n_hdr);\n\tif (!cache->hdr_offset) {\n\t\tcache->n_hdr = 0;\n\t\tR_FREE (cache->hdr);\n\t\tgoto beach;\n\t}\n\n\tmemcpy (cache->hdr_offset, offsets, cache->n_hdr * sizeof (ut64));\n\n\tut32 i = 0;\n\tRListIter *iter;\n\tcache_hdr_t *item;\n\tr_list_foreach (hdrs, iter, item) {\n\t\tif (i >= cache->n_hdr) {\n\t\t\tbreak;\n\t\t}\n\t\tmemcpy (&cache->hdr[i++], item, sizeof (cache_hdr_t));\n\t}\n\nbeach:\n\tr_list_free (hdrs);\n}\n\nstatic void populate_cache_maps(RDyldCache *cache) {\n\tr_return_if_fail (cache && cache->buf);\n\n\tut32 i;\n\tut32 n_maps = 0;\n\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\tif (!hdr->mappingCount || !hdr->mappingOffset) {\n\t\t\tcontinue;\n\t\t}\n\t\tn_maps += hdr->mappingCount;\n\t}\n\n\tcache_map_t *maps = NULL;\n\tif (n_maps != 0) {\n\t\tcache->maps_index = R_NEWS0 (ut32, cache->n_hdr);\n\t\tif (!cache->maps_index) {\n\t\t\treturn;\n\t\t}\n\t\tmaps = R_NEWS0 (cache_map_t, n_maps);\n\t}\n\tif (!maps) {\n\t\tcache->maps = NULL;\n\t\tcache->n_maps = 0;\n\t\treturn;\n\t}\n\n\tut32 next_map = 0;\n\tfor (i = 0; i < cache->n_hdr; i++) {\n\t\tcache_hdr_t *hdr = &cache->hdr[i];\n\t\tcache->maps_index[i] = next_map;\n\n\t\tif (!hdr->mappingCount || !hdr->mappingOffset) {\n\t\t\tcontinue;\n\t\t}\n\t\tut64 size = sizeof (cache_map_t) * hdr->mappingCount;\n\t\tif (r_buf_fread_at (cache->buf, hdr->mappingOffset, (ut8*) &maps[next_map], \"3l2i\", hdr->mappingCount) != size) {\n\t\t\tcontinue;\n\t\t}\n\t\tut32 j;\n\t\tut64 hdr_offset = cache->hdr_offset[i];\n\t\tfor (j = 0; j < hdr->mappingCount; j++) {\n\t\t\tcache_map_t *map = &maps[next_map + j];\n\t\t\tmap->fileOffset += hdr_offset;\n\t\t}\n\t\tnext_map += hdr->mappingCount;\n\t}\n\n\tcache->maps = maps;\n\tcache->n_maps = next_map;\n}\n\nstatic cache_accel_t *read_cache_accel(RBuffer *cache_buf, cache_hdr_t *hdr, cache_map_t *maps, int n_maps) {\n\tif (!cache_buf || !hdr || !hdr->accelerateInfoSize || !hdr->accelerateInfoAddr) {\n\t\treturn NULL;\n\t}\n\tsize_t mc = R_MIN (hdr->mappingCount, n_maps);\n\tut64 offset = va2pa (hdr->accelerateInfoAddr, mc, maps, cache_buf, 0, NULL, NULL);\n\tif (!offset) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_accel_t);\n\tcache_accel_t *accel = R_NEW0 (cache_accel_t);\n\tif (!accel) {\n\t\treturn NULL;\n\t}\n\n\tif (r_buf_fread_at (cache_buf, offset, (ut8*) accel, \"16il\", 1) != size) {\n\t\tR_FREE (accel);\n\t\treturn NULL;\n\t}\n\n\taccel->imagesExtrasOffset += offset;\n\taccel->bottomUpListOffset += offset;\n\taccel->dylibTrieOffset += offset;\n\taccel->initializersOffset += offset;\n\taccel->dofSectionsOffset += offset;\n\taccel->reExportListOffset += offset;\n\taccel->depListOffset += offset;\n\taccel->rangeTableOffset += offset;\n\n\treturn accel;\n}\n\nstatic objc_cache_opt_info *get_objc_opt_info(RBinFile *bf, RDyldCache *cache) {\n\tobjc_cache_opt_info *result = NULL;\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tif (strcmp (bin->file, \"lib/libobjc.A.dylib\")) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tstruct MACH0_(opts_t) opts = {0};\n\t\topts.verbose = bf->rbin->verbose;\n\t\topts.header_at = bin->header_at;\n\t\topts.symbols_off = 0;\n\n\t\tstruct MACH0_(obj_t) *mach0 = MACH0_(new_buf) (cache->buf, &opts);\n\t\tif (!mach0) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tstruct section_t *sections = NULL;\n\t\tif (!(sections = MACH0_(get_sections) (mach0))) {\n\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\tgoto beach;\n\t\t}\n\n\t\tint i;\n\t\tut64 scoffs_offset = 0;\n\t\tut64 scoffs_size = 0;\n\t\tut64 selrefs_offset = 0;\n\t\tut64 selrefs_size = 0;\n\t\tut8 remaining = 2;\n\t\tut64 slide = rebase_infos_get_slide (cache);\n\t\tfor (i = 0; !sections[i].last; i++) {\n\t\t\tif (sections[i].size == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (strstr (sections[i].name, \"__objc_scoffs\")) {\n\t\t\t\tscoffs_offset = va2pa (sections[i].addr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\t\t\tscoffs_size = sections[i].size;\n\t\t\t\tremaining--;\n\t\t\t\tif (remaining == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (strstr (sections[i].name, \"__DATA.__objc_selrefs\")) {\n\t\t\t\tselrefs_offset = va2pa (sections[i].addr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\t\t\tselrefs_size = sections[i].size;\n\t\t\t\tremaining--;\n\t\t\t\tif (remaining == 0) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tMACH0_(mach0_free) (mach0);\n\t\tR_FREE (sections);\n\n\t\tut64 sel_string_base = 0;\n\t\tif (!scoffs_offset || scoffs_size < 40) {\n\t\t\tif (!selrefs_offset || !selrefs_size || cache->n_hdr == 1) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tut64 cursor = selrefs_offset;\n\t\t\tut64 end = cursor + selrefs_size;\n\t\t\twhile (cursor < end) {\n\t\t\t\tut64 sel_ptr = r_buf_read_le64_at (cache->buf, cursor);\n\t\t\t\tif (sel_ptr == UT64_MAX) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tut64 sel_offset = va2pa (sel_ptr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\t\t\tchar * selector = r_buf_get_string (cache->buf, sel_offset);\n\t\t\t\tif (!selector) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbool is_magic_selector = !strncmp (selector, \"\\xf0\\x9f\\xa4\\xaf\", 4);\n\t\t\t\tfree (selector);\n\n\t\t\t\tif (is_magic_selector) {\n\t\t\t\t\tsel_string_base = sel_ptr;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tcursor += 8;\n\t\t\t}\n\t\t\tif (sel_string_base == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} else {\n\t\t\tut64 check = r_buf_read_le64_at (cache->buf, scoffs_offset);\n\t\t\tif (check != 2) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tsel_string_base = r_buf_read_le64_at (cache->buf, scoffs_offset + 8);\n\t\t\tif (sel_string_base == UT64_MAX) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tut64 sel_string_end = r_buf_read_le64_at (cache->buf, scoffs_offset + 16);\n\t\t\tif (sel_string_end == sel_string_base || sel_string_end == UT64_MAX) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tresult = R_NEW0 (objc_cache_opt_info);\n\t\tif (!result) {\n\t\t\tbreak;\n\t\t}\n\t\tresult->sel_string_base = sel_string_base;\n\t}\nbeach:\n\treturn result;\n}\n\nstatic bool load_buffer(RBinFile *bf, void **bin_obj, RBuffer *buf, ut64 loadaddr, Sdb *sdb) {\n\tRDyldCache *cache = R_NEW0 (RDyldCache);\n\tmemcpy (cache->magic, \"dyldcac\", 7);\n\tcache->buf = r_buf_ref (buf);\n\tpopulate_cache_headers (cache);\n\tif (!cache->hdr) {\n\t\tr_dyldcache_free (cache);\n\t\treturn false;\n\t}\n\tpopulate_cache_maps (cache);\n\tif (!cache->maps) {\n\t\tr_dyldcache_free (cache);\n\t\treturn false;\n\t}\n\tcache->accel = read_cache_accel (cache->buf, cache->hdr, cache->maps, cache->n_maps);\n\tcache->bins = create_cache_bins (bf, cache);\n\tif (!cache->bins) {\n\t\tr_dyldcache_free (cache);\n\t\treturn false;\n\t}\n\tcache->locsym = r_dyld_locsym_new (cache);\n\tcache->rebase_infos = get_rebase_infos (bf, cache);\n\tif (cache->rebase_infos) {\n\t\tif (!rebase_infos_get_slide (cache)) {\n\t\t\tif (!pending_bin_files) {\n\t\t\t\tpending_bin_files = r_list_new ();\n\t\t\t\tif (!pending_bin_files) {\n\t\t\t\t\tr_dyldcache_free (cache);\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tr_list_push (pending_bin_files, bf);\n\t\t\tswizzle_io_read (cache, bf->rbin->iob.io);\n\t\t}\n\t}\n\t*bin_obj = cache;\n\treturn true;\n}\n\nstatic RList *entries(RBinFile *bf) {\n\tRBinAddr *ptr = NULL;\n\tRList *ret = r_list_newf (free);\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\tif ((ptr = R_NEW0 (RBinAddr))) {\n\t\tr_list_append (ret, ptr);\n\t}\n\treturn ret;\n}\n\nstatic RBinInfo *info(RBinFile *bf) {\n\tRBinInfo *ret = NULL;\n\n\tif (!bf || !bf->o) {\n\t\treturn NULL;\n\t}\n\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tbool big_endian = 0;\n\tif (!(ret = R_NEW0 (RBinInfo))) {\n\t\treturn NULL;\n\t}\n\tret->file = strdup (bf->file);\n\tret->bclass = strdup (\"dyldcache\");\n\tret->rclass = strdup (\"ios\");\n\tret->os = strdup (\"iOS\");\n\tif (strstr (cache->hdr->magic, \"x86_64\")) {\n\t\tret->arch = strdup (\"x86\");\n\t\tret->bits = 64;\n\t} else {\n\t\tret->arch = strdup (\"arm\");\n\t\tret->bits = strstr (cache->hdr->magic, \"arm64\")? 64: 32;\n\t}\n\tret->machine = strdup (ret->arch);\n\tret->subsystem = strdup (\"xnu\");\n\tret->type = strdup (\"library-cache\");\n\tret->has_va = true;\n\tret->big_endian = big_endian;\n\tret->dbg_info = 0;\n\treturn ret;\n}\n\n#if 0\nstatic void parse_mach0(RList *ret, ut64 paddr, RBinFile *bf) {\n\t// TODO\n}\n#endif\n\nstatic ut64 baddr(RBinFile *bf) {\n\t// XXX hardcoded\n\treturn 0x180000000;\n}\n\nvoid symbols_from_bin(RDyldCache *cache, RList *ret, RBinFile *bf, RDyldBinImage *bin, SetU *hash) {\n\tstruct MACH0_(obj_t) *mach0 = bin_to_mach0 (bf, bin);\n\tif (!mach0) {\n\t\treturn;\n\t}\n\n\t// const RList*symbols = MACH0_(get_symbols_list) (mach0);\n\tconst struct symbol_t *symbols = MACH0_(get_symbols) (mach0);\n\tif (!symbols) {\n\t\treturn;\n\t}\n\tint i;\n\tfor (i = 0; !symbols[i].last; i++) {\n\t\tif (!symbols[i].name || !symbols[i].name[0] || symbols[i].addr < 100) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (strstr (symbols[i].name, \"\")) {\n\t\t\tcontinue;\n\t\t}\n\t\tRBinSymbol *sym = R_NEW0 (RBinSymbol);\n\t\tif (!sym) {\n\t\t\tbreak;\n\t\t}\n\t\tsym->name = strdup (symbols[i].name);\n\t\tsym->vaddr = symbols[i].addr;\n\t\tsym->forwarder = \"NONE\";\n\t\tsym->bind = (symbols[i].type == R_BIN_MACH0_SYMBOL_TYPE_LOCAL)? R_BIN_BIND_LOCAL_STR: R_BIN_BIND_GLOBAL_STR;\n\t\tsym->type = R_BIN_TYPE_FUNC_STR;\n\t\tsym->paddr = symbols[i].offset + bf->o->boffset;\n\t\tsym->size = symbols[i].size;\n\t\tsym->ordinal = i;\n\n\t\tset_u_add (hash, sym->vaddr);\n\t\tr_list_append (ret, sym);\n\t}\n\tMACH0_(mach0_free) (mach0);\n}\n\nstatic bool __is_data_section(const char *name) {\n\tif (strstr (name, \"_cstring\")) {\n\t\treturn true;\n\t}\n\tif (strstr (name, \"_os_log\")) {\n\t\treturn true;\n\t}\n\tif (strstr (name, \"_objc_methname\")) {\n\t\treturn true;\n\t}\n\tif (strstr (name, \"_objc_classname\")) {\n\t\treturn true;\n\t}\n\tif (strstr (name, \"_objc_methtype\")) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nstatic void sections_from_bin(RList *ret, RBinFile *bf, RDyldBinImage *bin) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn;\n\t}\n\n\tstruct MACH0_(obj_t) *mach0 = bin_to_mach0 (bf, bin);\n\tif (!mach0) {\n\t\treturn;\n\t}\n\n\tstruct section_t *sections = NULL;\n\tif (!(sections = MACH0_(get_sections) (mach0))) {\n\t\treturn;\n\t}\n\n\tut64 slide = rebase_infos_get_slide (cache);\n\tint i;\n\tfor (i = 0; !sections[i].last; i++) {\n\t\tRBinSection *ptr = R_NEW0 (RBinSection);\n\t\tif (!ptr) {\n\t\t\tbreak;\n\t\t}\n\t\tif (bin->file) {\n\t\t\tptr->name = r_str_newf (\"%s.%s\", bin->file, (char*)sections[i].name);\n\t\t} else {\n\t\t\tptr->name = r_str_newf (\"%s\", (char*)sections[i].name);\n\t\t}\n\t\tif (strstr (ptr->name, \"la_symbol_ptr\")) {\n\t\t\tint len = sections[i].size / 8;\n\t\t\tptr->format = r_str_newf (\"Cd %d[%d]\", 8, len);\n\t\t}\n\t\tptr->is_data = __is_data_section (ptr->name);\n\t\tptr->size = sections[i].size;\n\t\tptr->vsize = sections[i].vsize;\n\t\tptr->vaddr = sections[i].addr;\n\t\tptr->paddr = va2pa (sections[i].addr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\tif (!ptr->vaddr) {\n\t\t\tptr->vaddr = ptr->paddr;\n\t\t}\n\t\tptr->perm = sections[i].perm;\n\t\tr_list_append (ret, ptr);\n\t}\n\tfree (sections);\n\tMACH0_(mach0_free) (mach0);\n}\n\nstatic RList *sections(RBinFile *bf) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tRList *ret = r_list_newf (free);\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tsections_from_bin (ret, bf, bin);\n\t}\n\n\tRBinSection *ptr = NULL;\n\tint i;\n\tfor (i = 0; i < cache->n_maps; i++) {\n\t\tif (!(ptr = R_NEW0 (RBinSection))) {\n\t\t\tr_list_free (ret);\n\t\t\treturn NULL;\n\t\t}\n\t\tptr->name = r_str_newf (\"cache_map.%d\", i);\n\t\tptr->size = cache->maps[i].size;\n\t\tptr->vsize = ptr->size;\n\t\tptr->paddr = cache->maps[i].fileOffset;\n\t\tptr->vaddr = cache->maps[i].address;\n\t\tptr->add = true;\n\t\tptr->is_segment = true;\n\t\tptr->perm = prot2perm (cache->maps[i].initProt);\n\t\tr_list_append (ret, ptr);\n\t}\n\n\tut64 slide = rebase_infos_get_slide (cache);\n\tif (slide) {\n\t\tRBinSection *section;\n\t\tr_list_foreach (ret, iter, section) {\n\t\t\tsection->vaddr += slide;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nstatic RList *symbols(RBinFile *bf) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tRList *ret = r_list_newf (free);\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tSetU *hash = set_u_new ();\n\t\tif (!hash) {\n\t\t\tr_list_free (ret);\n\t\t\treturn NULL;\n\t\t}\n\t\tsymbols_from_bin (cache, ret, bf, bin, hash);\n\t\tsymbols_from_locsym (cache, bin, ret, hash);\n\t\tset_u_free (hash);\n\t}\n\n\tut64 slide = rebase_infos_get_slide (cache);\n\tif (slide) {\n\t\tRBinSymbol *sym;\n\t\tr_list_foreach (ret, iter, sym) {\n\t\t\tsym->vaddr += slide;\n\t\t}\n\t}\n\n\treturn ret;\n}\n\n/* static void unswizzle_io_read(RDyldCache *cache, RIO *io) {\n\tif (!io || !io->desc || !io->desc->plugin || !cache->original_io_read) {\n\t\treturn;\n\t}\n\n\tRIOPlugin *plugin = io->desc->plugin;\n\tplugin->read = cache->original_io_read;\n\tcache->original_io_read = NULL;\n} */\n\nstatic void destroy(RBinFile *bf) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\t// unswizzle_io_read (cache, bf->rbin->iob.io); // XXX io may be dead here\n\tr_dyldcache_free (cache);\n}\n\nstatic RList *classes(RBinFile *bf) {\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn NULL;\n\t}\n\n\tRList *ret = r_list_newf (free);\n\tif (!ret) {\n\t\treturn NULL;\n\t}\n\n\tif (!cache->objc_opt_info_loaded) {\n\t\tcache->oi = get_objc_opt_info (bf, cache);\n\t\tcache->objc_opt_info_loaded = true;\n\t}\n\n\tRListIter *iter;\n\tRDyldBinImage *bin;\n\tut64 slide = rebase_infos_get_slide (cache);\n\n\tRBuffer *orig_buf = bf->buf;\n\tut32 num_of_unnamed_class = 0;\n\tr_list_foreach (cache->bins, iter, bin) {\n\t\tstruct MACH0_(obj_t) *mach0 = bin_to_mach0 (bf, bin);\n\t\tif (!mach0) {\n\t\t\tgoto beach;\n\t\t}\n\n\t\tstruct section_t *sections = NULL;\n\t\tif (!(sections = MACH0_(get_sections) (mach0))) {\n\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\tgoto beach;\n\t\t}\n\n\t\tint i;\n\t\tfor (i = 0; !sections[i].last; i++) {\n\t\t\tif (sections[i].size == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tbool is_classlist = strstr (sections[i].name, \"__objc_classlist\");\n\t\t\tbool is_catlist = strstr (sections[i].name, \"__objc_catlist\");\n\n\t\t\tif (!is_classlist && !is_catlist) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tut8 *pointers = malloc (sections[i].size);\n\t\t\tif (!pointers) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tut64 offset = va2pa (sections[i].addr, cache->n_maps, cache->maps, cache->buf, slide, NULL, NULL);\n\t\t\tif (r_buf_read_at (cache->buf, offset, pointers, sections[i].size) < sections[i].size) {\n\t\t\t\tR_FREE (pointers);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tut8 *cursor = pointers;\n\t\t\tut8 *pointers_end = pointers + sections[i].size;\n\n\t\t\tfor (; cursor < pointers_end; cursor += 8) {\n\t\t\t\tut64 pointer_to_class = r_read_le64 (cursor);\n\n\t\t\t\tRBinClass *klass;\n\t\t\t\tif (!(klass = R_NEW0 (RBinClass)) ||\n\t\t\t\t\t!(klass->methods = r_list_new ()) ||\n\t\t\t\t\t!(klass->fields = r_list_new ())) {\n\t\t\t\t\tR_FREE (klass);\n\t\t\t\t\tR_FREE (pointers);\n\t\t\t\t\tR_FREE (sections);\n\t\t\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\t\t\tgoto beach;\n\t\t\t\t}\n\n\t\t\t\tbf->o->bin_obj = mach0;\n\t\t\t\tbf->buf = cache->buf;\n\t\t\t\tif (is_classlist) {\n\t\t\t\t\tMACH0_(get_class_t) (pointer_to_class, bf, klass, false, NULL, cache->oi);\n\t\t\t\t} else {\n\t\t\t\t\tMACH0_(get_category_t) (pointer_to_class, bf, klass, NULL, cache->oi);\n\t\t\t\t}\n\t\t\t\tbf->o->bin_obj = cache;\n\t\t\t\tbf->buf = orig_buf;\n\n\t\t\t\tif (!klass->name) {\n\t\t\t\t\teprintf (\"KLASS ERROR AT 0x%\"PFMT64x\", is_classlist %d\\n\", pointer_to_class, is_classlist);\n\t\t\t\t\tklass->name = r_str_newf (\"UnnamedClass%u\", num_of_unnamed_class);\n\t\t\t\t\tif (!klass->name) {\n\t\t\t\t\t\tR_FREE (klass);\n\t\t\t\t\t\tR_FREE (pointers);\n\t\t\t\t\t\tR_FREE (sections);\n\t\t\t\t\t\tMACH0_(mach0_free) (mach0);\n\t\t\t\t\t\tgoto beach;\n\t\t\t\t\t}\n\t\t\t\t\tnum_of_unnamed_class++;\n\t\t\t\t}\n\t\t\t\tr_list_append (ret, klass);\n\t\t\t}\n\n\t\t\tR_FREE (pointers);\n\t\t}\n\n\t\tR_FREE (sections);\n\t\tMACH0_(mach0_free) (mach0);\n\t}\n\n\treturn ret;\n\nbeach:\n\tr_list_free (ret);\n\treturn NULL;\n}\n\nstatic void header(RBinFile *bf) {\n\tif (!bf || !bf->o) {\n\t\treturn;\n\t}\n\n\tRDyldCache *cache = (RDyldCache*) bf->o->bin_obj;\n\tif (!cache) {\n\t\treturn;\n\t}\n\n\tRBin *bin = bf->rbin;\n\tut64 slide = rebase_infos_get_slide (cache);\n\tPrintfCallback p = bin->cb_printf;\n\n\tPJ *pj = pj_new ();\n\tif (!pj) {\n\t\treturn;\n\t}\n\n\tpj_o (pj);\n\tpj_k (pj, \"header\");\n\tpj_o (pj);\n\tpj_ks (pj, \"magic\", cache->hdr->magic);\n\tpj_kn (pj, \"mappingOffset\", cache->hdr->mappingOffset);\n\tpj_kn (pj, \"mappingCount\", cache->hdr->mappingCount);\n\tpj_kn (pj, \"imagesOffset\", cache->hdr->imagesOffset);\n\tpj_kn (pj, \"imagesCount\", cache->hdr->imagesCount);\n\tpj_kn (pj, \"dyldBaseAddress\", cache->hdr->dyldBaseAddress);\n\tpj_kn (pj, \"codeSignatureOffset\", cache->hdr->codeSignatureOffset);\n\tpj_kn (pj, \"codeSignatureSize\", cache->hdr->codeSignatureSize);\n\tpj_kn (pj, \"slideInfoOffset\", cache->hdr->slideInfoOffset);\n\tpj_kn (pj, \"slideInfoSize\", cache->hdr->slideInfoSize);\n\tpj_kn (pj, \"localSymbolsOffset\", cache->hdr->localSymbolsOffset);\n\tpj_kn (pj, \"localSymbolsSize\", cache->hdr->localSymbolsSize);\n\tchar uuidstr[128];\n\tr_hex_bin2str ((ut8*)cache->hdr->uuid, 16, uuidstr);\n\tpj_ks (pj, \"uuid\", uuidstr);\n\tpj_ks (pj, \"cacheType\", (cache->hdr->cacheType == 0) ? \"development\" : \"production\");\n\tpj_kn (pj, \"branchPoolsOffset\", cache->hdr->branchPoolsOffset);\n\tpj_kn (pj, \"branchPoolsCount\", cache->hdr->branchPoolsCount);\n\tpj_kn (pj, \"accelerateInfoAddr\", cache->hdr->accelerateInfoAddr + slide);\n\tpj_kn (pj, \"accelerateInfoSize\", cache->hdr->accelerateInfoSize);\n\tpj_kn (pj, \"imagesTextOffset\", cache->hdr->imagesTextOffset);\n\tpj_kn (pj, \"imagesTextCount\", cache->hdr->imagesTextCount);\n\tpj_end (pj);\n\n\tif (cache->accel) {\n\t\tpj_k (pj, \"accelerator\");\n\t\tpj_o (pj);\n\t\tpj_kn (pj, \"version\", cache->accel->version);\n\t\tpj_kn (pj, \"imageExtrasCount\", cache->accel->imageExtrasCount);\n\t\tpj_kn (pj, \"imagesExtrasOffset\", cache->accel->imagesExtrasOffset);\n\t\tpj_kn (pj, \"bottomUpListOffset\", cache->accel->bottomUpListOffset);\n\t\tpj_kn (pj, \"dylibTrieOffset\", cache->accel->dylibTrieOffset);\n\t\tpj_kn (pj, \"dylibTrieSize\", cache->accel->dylibTrieSize);\n\t\tpj_kn (pj, \"initializersOffset\", cache->accel->initializersOffset);\n\t\tpj_kn (pj, \"initializersCount\", cache->accel->initializersCount);\n\t\tpj_kn (pj, \"dofSectionsOffset\", cache->accel->dofSectionsOffset);\n\t\tpj_kn (pj, \"dofSectionsCount\", cache->accel->dofSectionsCount);\n\t\tpj_kn (pj, \"reExportListOffset\", cache->accel->reExportListOffset);\n\t\tpj_kn (pj, \"reExportCount\", cache->accel->reExportCount);\n\t\tpj_kn (pj, \"depListOffset\", cache->accel->depListOffset);\n\t\tpj_kn (pj, \"depListCount\", cache->accel->depListCount);\n\t\tpj_kn (pj, \"rangeTableOffset\", cache->accel->rangeTableOffset);\n\t\tpj_kn (pj, \"rangeTableCount\", cache->accel->rangeTableCount);\n\t\tpj_kn (pj, \"dyldSectionAddr\", cache->accel->dyldSectionAddr + slide);\n\t\tpj_end (pj);\n\t}\n\n\tif (cache->rebase_infos) {\n\t\tsize_t i;\n\t\tpj_k (pj, \"slideInfo\");\n\t\tpj_a (pj);\n\t\tfor (i = 0; i < cache->rebase_infos->length; i++) {\n\t\t\tRDyldRebaseInfo * rebase_info = cache->rebase_infos->entries[i].info;\n\t\t\tpj_o (pj);\n\t\t\tpj_kn (pj, \"start\", cache->rebase_infos->entries[i].start);\n\t\t\tpj_kn (pj, \"end\", cache->rebase_infos->entries[i].end);\n\t\t\tif (rebase_info) {\n\t\t\t\tut8 version = rebase_info->version;\n\t\t\t\tpj_kn (pj, \"version\", version);\n\t\t\t\tpj_kn (pj, \"slide\", slide);\n\t\t\t\tif (version == 3) {\n\t\t\t\t\tRDyldRebaseInfo3 *info3 = (RDyldRebaseInfo3*) rebase_info;\n\t\t\t\t\tpj_kn (pj, \"page_starts_count\", info3->page_starts_count);\n\t\t\t\t\tpj_kn (pj, \"page_size\", info3->page_size);\n\t\t\t\t\tpj_kn (pj, \"auth_value_add\", info3->auth_value_add);\n\t\t\t\t} else if (version == 2 || version == 4) {\n\t\t\t\t\tRDyldRebaseInfo2 *info2 = (RDyldRebaseInfo2*) rebase_info;\n\t\t\t\t\tpj_kn (pj, \"page_starts_count\", info2->page_starts_count);\n\t\t\t\t\tpj_kn (pj, \"page_extras_count\", info2->page_extras_count);\n\t\t\t\t\tpj_kn (pj, \"delta_mask\", info2->delta_mask);\n\t\t\t\t\tpj_kn (pj, \"value_mask\", info2->value_mask);\n\t\t\t\t\tpj_kn (pj, \"value_add\", info2->value_add);\n\t\t\t\t\tpj_kn (pj, \"delta_shift\", info2->delta_shift);\n\t\t\t\t\tpj_kn (pj, \"page_size\", info2->page_size);\n\t\t\t\t} else if (version == 1) {\n\t\t\t\t\tRDyldRebaseInfo1 *info1 = (RDyldRebaseInfo1*) rebase_info;\n\t\t\t\t\tpj_kn (pj, \"toc_count\", info1->toc_count);\n\t\t\t\t\tpj_kn (pj, \"entries_size\", info1->entries_size);\n\t\t\t\t\tpj_kn (pj, \"page_size\", 4096);\n\t\t\t\t}\n\t\t\t}\n\t\t\tpj_end (pj);\n\t\t}\n\t\tpj_end (pj);\n\t}\n\n\tif (cache->hdr->imagesTextCount) {\n\t\tpj_k (pj, \"images\");\n\t\tpj_a (pj);\n\t\tut64 total_size = cache->hdr->imagesTextCount * sizeof (cache_text_info_t);\n\t\tcache_text_info_t * text_infos = malloc (total_size);\n\t\tif (!text_infos) {\n\t\t\tgoto beach;\n\t\t}\n\t\tif (r_buf_fread_at (cache->buf, cache->hdr->imagesTextOffset, (ut8*)text_infos, \"16clii\", cache->hdr->imagesTextCount) != total_size) {\n\t\t\tfree (text_infos);\n\t\t\tgoto beach;\n\t\t}\n\t\tsize_t i;\n\t\tfor (i = 0; i != cache->hdr->imagesTextCount; i++) {\n\t\t\tcache_text_info_t * text_info = &text_infos[i];\n\t\t\tr_hex_bin2str ((ut8*)text_info->uuid, 16, uuidstr);\n\t\t\tpj_o (pj);\n\t\t\tpj_ks (pj, \"uuid\", uuidstr);\n\t\t\tpj_kn (pj, \"address\", text_info->loadAddress + slide);\n\t\t\tpj_kn (pj, \"textSegmentSize\", text_info->textSegmentSize);\n\t\t\tchar file[256];\n\t\t\tif (r_buf_read_at (cache->buf, text_info->pathOffset, (ut8*) &file, sizeof (file)) == sizeof (file)) {\n\t\t\t\tfile[255] = 0;\n\t\t\t\tpj_ks (pj, \"path\", file);\n\t\t\t\tchar *last_slash = strrchr (file, '/');\n\t\t\t\tif (last_slash && *last_slash) {\n\t\t\t\t\tpj_ks (pj, \"name\", last_slash + 1);\n\t\t\t\t} else {\n\t\t\t\t\tpj_ks (pj, \"name\", file);\n\t\t\t\t}\n\t\t\t}\n\t\t\tpj_end (pj);\n\t\t}\n\t\tpj_end (pj);\n\t\tfree (text_infos);\n\t}\n\n\tpj_end (pj);\n\tp (\"%s\", pj_string (pj));\n\nbeach:\n\tpj_free (pj);\n}\n\nRBinPlugin r_bin_plugin_dyldcache = {\n\t.name = \"dyldcache\",\n\t.desc = \"dyldcache bin plugin\",\n\t.license = \"LGPL3\",\n\t.load_buffer = &load_buffer,\n\t.entries = &entries,\n\t.baddr = &baddr,\n\t.symbols = &symbols,\n\t.sections = §ions,\n\t.check_buffer = &check_buffer,\n\t.destroy = &destroy,\n\t.classes = &classes,\n\t.header = &header,\n\t.info = &info,\n};\n\n#ifndef R2_PLUGIN_INCORE\nR_API RLibStruct radare_plugin = {\n\t.type = R_LIB_TYPE_BIN,\n\t.data = &r_bin_plugin_dyldcache,\n\t.version = R2_VERSION\n};\n#endif\n"},"func_before":{"kind":"string","value":"static cache_accel_t *read_cache_accel(RBuffer *cache_buf, cache_hdr_t *hdr, cache_map_t *maps) {\n\tif (!cache_buf || !hdr || !hdr->accelerateInfoSize || !hdr->accelerateInfoAddr) {\n\t\treturn NULL;\n\t}\n\n\tut64 offset = va2pa (hdr->accelerateInfoAddr, hdr->mappingCount, maps, cache_buf, 0, NULL, NULL);\n\tif (!offset) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_accel_t);\n\tcache_accel_t *accel = R_NEW0 (cache_accel_t);\n\tif (!accel) {\n\t\treturn NULL;\n\t}\n\n\tif (r_buf_fread_at (cache_buf, offset, (ut8*) accel, \"16il\", 1) != size) {\n\t\tR_FREE (accel);\n\t\treturn NULL;\n\t}\n\n\taccel->imagesExtrasOffset += offset;\n\taccel->bottomUpListOffset += offset;\n\taccel->dylibTrieOffset += offset;\n\taccel->initializersOffset += offset;\n\taccel->dofSectionsOffset += offset;\n\taccel->reExportListOffset += offset;\n\taccel->depListOffset += offset;\n\taccel->rangeTableOffset += offset;\n\n\treturn accel;\n}"},"func_after":{"kind":"string","value":"static cache_accel_t *read_cache_accel(RBuffer *cache_buf, cache_hdr_t *hdr, cache_map_t *maps, int n_maps) {\n\tif (!cache_buf || !hdr || !hdr->accelerateInfoSize || !hdr->accelerateInfoAddr) {\n\t\treturn NULL;\n\t}\n\tsize_t mc = R_MIN (hdr->mappingCount, n_maps);\n\tut64 offset = va2pa (hdr->accelerateInfoAddr, mc, maps, cache_buf, 0, NULL, NULL);\n\tif (!offset) {\n\t\treturn NULL;\n\t}\n\n\tut64 size = sizeof (cache_accel_t);\n\tcache_accel_t *accel = R_NEW0 (cache_accel_t);\n\tif (!accel) {\n\t\treturn NULL;\n\t}\n\n\tif (r_buf_fread_at (cache_buf, offset, (ut8*) accel, \"16il\", 1) != size) {\n\t\tR_FREE (accel);\n\t\treturn NULL;\n\t}\n\n\taccel->imagesExtrasOffset += offset;\n\taccel->bottomUpListOffset += offset;\n\taccel->dylibTrieOffset += offset;\n\taccel->initializersOffset += offset;\n\taccel->dofSectionsOffset += offset;\n\taccel->reExportListOffset += offset;\n\taccel->depListOffset += offset;\n\taccel->rangeTableOffset += offset;\n\n\treturn accel;\n}"},"diff":{"kind":"string","value":"{'added': [(1147, '\\tut16 *depArray = NULL;'), (1148, '\\tcache_imgxtr_t *extras = NULL;'), (1737, 'static cache_accel_t *read_cache_accel(RBuffer *cache_buf, cache_hdr_t *hdr, cache_map_t *maps, int n_maps) {'), (1741, '\\tsize_t mc = R_MIN (hdr->mappingCount, n_maps);'), (1742, '\\tut64 offset = va2pa (hdr->accelerateInfoAddr, mc, maps, cache_buf, 0, NULL, NULL);'), (1898, '\\tcache->accel = read_cache_accel (cache->buf, cache->hdr, cache->maps, cache->n_maps);')], 'deleted': [(1180, '\\t\\tut16 *depArray = NULL;'), (1181, '\\t\\tcache_imgxtr_t *extras = NULL;'), (1737, 'static cache_accel_t *read_cache_accel(RBuffer *cache_buf, cache_hdr_t *hdr, cache_map_t *maps) {'), (1741, ''), (1742, '\\tut64 offset = va2pa (hdr->accelerateInfoAddr, hdr->mappingCount, maps, cache_buf, 0, NULL, NULL);'), (1898, '\\tcache->accel = read_cache_accel (cache->buf, cache->hdr, cache->maps);')]}"},"num_lines_added":{"kind":"number","value":6,"string":"6"},"num_lines_deleted":{"kind":"number","value":6,"string":"6"},"num_lines_in_file":{"kind":"number","value":2145,"string":"2,145"},"num_tokens_in_file":{"kind":"number","value":14485,"string":"14,485"},"num_lines_in_method":{"kind":"number","value":27,"string":"27"},"num_tokens_in_method":{"kind":"number","value":182,"string":"182"},"method_complexity":{"kind":"number","value":8,"string":"8"},"repo":{"kind":"string","value":"https://github.com/radareorg/radare2"},"cve_id":{"kind":"string","value":"CVE-2022-0676"},"cwe_id":{"kind":"string","value":"CWE-787"}}},{"rowIdx":397,"cells":{"id":{"kind":"number","value":2611,"string":"2,611"},"file_name":{"kind":"string","value":"ast.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"decode_bytes_with_escapes"},"code_before":{"kind":"string","value":"/*\n * This file includes functions to transform a concrete syntax tree (CST) to\n * an abstract syntax tree (AST). The main function is Ta3AST_FromNode().\n *\n */\n#include \"Python.h\"\n#include \"Python-ast.h\"\n#include \"node.h\"\n#include \"ast.h\"\n#include \"token.h\"\n\n#include \n\n#if PY_MINOR_VERSION < 4\n#define PyErr_ProgramTextObject PyErr_ProgramText\n\n#define PyMem_RawMalloc PyMem_Malloc\n#define PyMem_RawRealloc PyMem_Realloc\n#define PyMem_RawFree PyMem_Free\n#endif\n\nstatic int validate_stmts(asdl_seq *);\nstatic int validate_exprs(asdl_seq *, expr_context_ty, int);\nstatic int validate_nonempty_seq(asdl_seq *, const char *, const char *);\nstatic int validate_stmt(stmt_ty);\nstatic int validate_expr(expr_ty, expr_context_ty);\n\nmod_ty\nstring_object_to_c_ast(const char *s, PyObject *filename, int start,\n PyCompilerFlags *flags, int feature_version,\n PyArena *arena);\n\nstatic int\nvalidate_comprehension(asdl_seq *gens)\n{\n int i;\n if (!asdl_seq_LEN(gens)) {\n PyErr_SetString(PyExc_ValueError, \"comprehension with no generators\");\n return 0;\n }\n for (i = 0; i < asdl_seq_LEN(gens); i++) {\n comprehension_ty comp = asdl_seq_GET(gens, i);\n if (!validate_expr(comp->target, Store) ||\n !validate_expr(comp->iter, Load) ||\n !validate_exprs(comp->ifs, Load, 0))\n return 0;\n }\n return 1;\n}\n\nstatic int\nvalidate_slice(slice_ty slice)\n{\n switch (slice->kind) {\n case Slice_kind:\n return (!slice->v.Slice.lower || validate_expr(slice->v.Slice.lower, Load)) &&\n (!slice->v.Slice.upper || validate_expr(slice->v.Slice.upper, Load)) &&\n (!slice->v.Slice.step || validate_expr(slice->v.Slice.step, Load));\n case ExtSlice_kind: {\n int i;\n if (!validate_nonempty_seq(slice->v.ExtSlice.dims, \"dims\", \"ExtSlice\"))\n return 0;\n for (i = 0; i < asdl_seq_LEN(slice->v.ExtSlice.dims); i++)\n if (!validate_slice(asdl_seq_GET(slice->v.ExtSlice.dims, i)))\n return 0;\n return 1;\n }\n case Index_kind:\n return validate_expr(slice->v.Index.value, Load);\n default:\n PyErr_SetString(PyExc_SystemError, \"unknown slice node\");\n return 0;\n }\n}\n\nstatic int\nvalidate_keywords(asdl_seq *keywords)\n{\n int i;\n for (i = 0; i < asdl_seq_LEN(keywords); i++)\n if (!validate_expr(((keyword_ty)asdl_seq_GET(keywords, i))->value, Load))\n return 0;\n return 1;\n}\n\nstatic int\nvalidate_args(asdl_seq *args)\n{\n int i;\n for (i = 0; i < asdl_seq_LEN(args); i++) {\n arg_ty arg = asdl_seq_GET(args, i);\n if (arg->annotation && !validate_expr(arg->annotation, Load))\n return 0;\n }\n return 1;\n}\n\nstatic const char *\nexpr_context_name(expr_context_ty ctx)\n{\n switch (ctx) {\n case Load:\n return \"Load\";\n case Store:\n return \"Store\";\n case Del:\n return \"Del\";\n case AugLoad:\n return \"AugLoad\";\n case AugStore:\n return \"AugStore\";\n case Param:\n return \"Param\";\n default:\n assert(0);\n return \"(unknown)\";\n }\n}\n\nstatic int\nvalidate_arguments(arguments_ty args)\n{\n if (!validate_args(args->args))\n return 0;\n if (args->vararg && args->vararg->annotation\n && !validate_expr(args->vararg->annotation, Load)) {\n return 0;\n }\n if (!validate_args(args->kwonlyargs))\n return 0;\n if (args->kwarg && args->kwarg->annotation\n && !validate_expr(args->kwarg->annotation, Load)) {\n return 0;\n }\n if (asdl_seq_LEN(args->defaults) > asdl_seq_LEN(args->args)) {\n PyErr_SetString(PyExc_ValueError, \"more positional defaults than args on arguments\");\n return 0;\n }\n if (asdl_seq_LEN(args->kw_defaults) != asdl_seq_LEN(args->kwonlyargs)) {\n PyErr_SetString(PyExc_ValueError, \"length of kwonlyargs is not the same as \"\n \"kw_defaults on arguments\");\n return 0;\n }\n return validate_exprs(args->defaults, Load, 0) && validate_exprs(args->kw_defaults, Load, 1);\n}\n\nstatic int\nvalidate_constant(PyObject *value)\n{\n if (value == Py_None || value == Py_Ellipsis)\n return 1;\n\n if (PyLong_CheckExact(value)\n || PyFloat_CheckExact(value)\n || PyComplex_CheckExact(value)\n || PyBool_Check(value)\n || PyUnicode_CheckExact(value)\n || PyBytes_CheckExact(value))\n return 1;\n\n if (PyTuple_CheckExact(value) || PyFrozenSet_CheckExact(value)) {\n PyObject *it;\n\n it = PyObject_GetIter(value);\n if (it == NULL)\n return 0;\n\n while (1) {\n PyObject *item = PyIter_Next(it);\n if (item == NULL) {\n if (PyErr_Occurred()) {\n Py_DECREF(it);\n return 0;\n }\n break;\n }\n\n if (!validate_constant(item)) {\n Py_DECREF(it);\n Py_DECREF(item);\n return 0;\n }\n Py_DECREF(item);\n }\n\n Py_DECREF(it);\n return 1;\n }\n\n return 0;\n}\n\nstatic int\nvalidate_expr(expr_ty exp, expr_context_ty ctx)\n{\n int check_ctx = 1;\n expr_context_ty actual_ctx;\n\n /* First check expression context. */\n switch (exp->kind) {\n case Attribute_kind:\n actual_ctx = exp->v.Attribute.ctx;\n break;\n case Subscript_kind:\n actual_ctx = exp->v.Subscript.ctx;\n break;\n case Starred_kind:\n actual_ctx = exp->v.Starred.ctx;\n break;\n case Name_kind:\n actual_ctx = exp->v.Name.ctx;\n break;\n case List_kind:\n actual_ctx = exp->v.List.ctx;\n break;\n case Tuple_kind:\n actual_ctx = exp->v.Tuple.ctx;\n break;\n default:\n if (ctx != Load) {\n PyErr_Format(PyExc_ValueError, \"expression which can't be \"\n \"assigned to in %s context\", expr_context_name(ctx));\n return 0;\n }\n check_ctx = 0;\n /* set actual_ctx to prevent gcc warning */\n actual_ctx = 0;\n }\n if (check_ctx && actual_ctx != ctx) {\n PyErr_Format(PyExc_ValueError, \"expression must have %s context but has %s instead\",\n expr_context_name(ctx), expr_context_name(actual_ctx));\n return 0;\n }\n\n /* Now validate expression. */\n switch (exp->kind) {\n case BoolOp_kind:\n if (asdl_seq_LEN(exp->v.BoolOp.values) < 2) {\n PyErr_SetString(PyExc_ValueError, \"BoolOp with less than 2 values\");\n return 0;\n }\n return validate_exprs(exp->v.BoolOp.values, Load, 0);\n case BinOp_kind:\n return validate_expr(exp->v.BinOp.left, Load) &&\n validate_expr(exp->v.BinOp.right, Load);\n case UnaryOp_kind:\n return validate_expr(exp->v.UnaryOp.operand, Load);\n case Lambda_kind:\n return validate_arguments(exp->v.Lambda.args) &&\n validate_expr(exp->v.Lambda.body, Load);\n case IfExp_kind:\n return validate_expr(exp->v.IfExp.test, Load) &&\n validate_expr(exp->v.IfExp.body, Load) &&\n validate_expr(exp->v.IfExp.orelse, Load);\n case Dict_kind:\n if (asdl_seq_LEN(exp->v.Dict.keys) != asdl_seq_LEN(exp->v.Dict.values)) {\n PyErr_SetString(PyExc_ValueError,\n \"Dict doesn't have the same number of keys as values\");\n return 0;\n }\n /* null_ok=1 for keys expressions to allow dict unpacking to work in\n dict literals, i.e. ``{**{a:b}}`` */\n return validate_exprs(exp->v.Dict.keys, Load, /*null_ok=*/ 1) &&\n validate_exprs(exp->v.Dict.values, Load, /*null_ok=*/ 0);\n case Set_kind:\n return validate_exprs(exp->v.Set.elts, Load, 0);\n#define COMP(NAME) \\\n case NAME ## _kind: \\\n return validate_comprehension(exp->v.NAME.generators) && \\\n validate_expr(exp->v.NAME.elt, Load);\n COMP(ListComp)\n COMP(SetComp)\n COMP(GeneratorExp)\n#undef COMP\n case DictComp_kind:\n return validate_comprehension(exp->v.DictComp.generators) &&\n validate_expr(exp->v.DictComp.key, Load) &&\n validate_expr(exp->v.DictComp.value, Load);\n case Yield_kind:\n return !exp->v.Yield.value || validate_expr(exp->v.Yield.value, Load);\n case YieldFrom_kind:\n return validate_expr(exp->v.YieldFrom.value, Load);\n case Await_kind:\n return validate_expr(exp->v.Await.value, Load);\n case Compare_kind:\n if (!asdl_seq_LEN(exp->v.Compare.comparators)) {\n PyErr_SetString(PyExc_ValueError, \"Compare with no comparators\");\n return 0;\n }\n if (asdl_seq_LEN(exp->v.Compare.comparators) !=\n asdl_seq_LEN(exp->v.Compare.ops)) {\n PyErr_SetString(PyExc_ValueError, \"Compare has a different number \"\n \"of comparators and operands\");\n return 0;\n }\n return validate_exprs(exp->v.Compare.comparators, Load, 0) &&\n validate_expr(exp->v.Compare.left, Load);\n case Call_kind:\n return validate_expr(exp->v.Call.func, Load) &&\n validate_exprs(exp->v.Call.args, Load, 0) &&\n validate_keywords(exp->v.Call.keywords);\n case Constant_kind:\n if (!validate_constant(exp->v.Constant.value)) {\n PyErr_Format(PyExc_TypeError,\n \"got an invalid type in Constant: %s\",\n Py_TYPE(exp->v.Constant.value)->tp_name);\n return 0;\n }\n return 1;\n case Num_kind: {\n PyObject *n = exp->v.Num.n;\n if (!PyLong_CheckExact(n) && !PyFloat_CheckExact(n) &&\n !PyComplex_CheckExact(n)) {\n PyErr_SetString(PyExc_TypeError, \"non-numeric type in Num\");\n return 0;\n }\n return 1;\n }\n case Str_kind: {\n PyObject *s = exp->v.Str.s;\n if (!PyUnicode_CheckExact(s)) {\n PyErr_SetString(PyExc_TypeError, \"non-string type in Str\");\n return 0;\n }\n return 1;\n }\n case JoinedStr_kind:\n return validate_exprs(exp->v.JoinedStr.values, Load, 0);\n case FormattedValue_kind:\n if (validate_expr(exp->v.FormattedValue.value, Load) == 0)\n return 0;\n if (exp->v.FormattedValue.format_spec)\n return validate_expr(exp->v.FormattedValue.format_spec, Load);\n return 1;\n case Bytes_kind: {\n PyObject *b = exp->v.Bytes.s;\n if (!PyBytes_CheckExact(b)) {\n PyErr_SetString(PyExc_TypeError, \"non-bytes type in Bytes\");\n return 0;\n }\n return 1;\n }\n case Attribute_kind:\n return validate_expr(exp->v.Attribute.value, Load);\n case Subscript_kind:\n return validate_slice(exp->v.Subscript.slice) &&\n validate_expr(exp->v.Subscript.value, Load);\n case Starred_kind:\n return validate_expr(exp->v.Starred.value, ctx);\n case List_kind:\n return validate_exprs(exp->v.List.elts, ctx, 0);\n case Tuple_kind:\n return validate_exprs(exp->v.Tuple.elts, ctx, 0);\n /* These last cases don't have any checking. */\n case Name_kind:\n case NameConstant_kind:\n case Ellipsis_kind:\n return 1;\n default:\n PyErr_SetString(PyExc_SystemError, \"unexpected expression\");\n return 0;\n }\n}\n\nstatic int\nvalidate_nonempty_seq(asdl_seq *seq, const char *what, const char *owner)\n{\n if (asdl_seq_LEN(seq))\n return 1;\n PyErr_Format(PyExc_ValueError, \"empty %s on %s\", what, owner);\n return 0;\n}\n\nstatic int\nvalidate_assignlist(asdl_seq *targets, expr_context_ty ctx)\n{\n return validate_nonempty_seq(targets, \"targets\", ctx == Del ? \"Delete\" : \"Assign\") &&\n validate_exprs(targets, ctx, 0);\n}\n\nstatic int\nvalidate_body(asdl_seq *body, const char *owner)\n{\n return validate_nonempty_seq(body, \"body\", owner) && validate_stmts(body);\n}\n\nstatic int\nvalidate_stmt(stmt_ty stmt)\n{\n int i;\n switch (stmt->kind) {\n case FunctionDef_kind:\n return validate_body(stmt->v.FunctionDef.body, \"FunctionDef\") &&\n validate_arguments(stmt->v.FunctionDef.args) &&\n validate_exprs(stmt->v.FunctionDef.decorator_list, Load, 0) &&\n (!stmt->v.FunctionDef.returns ||\n validate_expr(stmt->v.FunctionDef.returns, Load));\n case ClassDef_kind:\n return validate_body(stmt->v.ClassDef.body, \"ClassDef\") &&\n validate_exprs(stmt->v.ClassDef.bases, Load, 0) &&\n validate_keywords(stmt->v.ClassDef.keywords) &&\n validate_exprs(stmt->v.ClassDef.decorator_list, Load, 0);\n case Return_kind:\n return !stmt->v.Return.value || validate_expr(stmt->v.Return.value, Load);\n case Delete_kind:\n return validate_assignlist(stmt->v.Delete.targets, Del);\n case Assign_kind:\n return validate_assignlist(stmt->v.Assign.targets, Store) &&\n validate_expr(stmt->v.Assign.value, Load);\n case AugAssign_kind:\n return validate_expr(stmt->v.AugAssign.target, Store) &&\n validate_expr(stmt->v.AugAssign.value, Load);\n case AnnAssign_kind:\n if (stmt->v.AnnAssign.target->kind != Name_kind &&\n stmt->v.AnnAssign.simple) {\n PyErr_SetString(PyExc_TypeError,\n \"AnnAssign with simple non-Name target\");\n return 0;\n }\n return validate_expr(stmt->v.AnnAssign.target, Store) &&\n (!stmt->v.AnnAssign.value ||\n validate_expr(stmt->v.AnnAssign.value, Load)) &&\n validate_expr(stmt->v.AnnAssign.annotation, Load);\n case For_kind:\n return validate_expr(stmt->v.For.target, Store) &&\n validate_expr(stmt->v.For.iter, Load) &&\n validate_body(stmt->v.For.body, \"For\") &&\n validate_stmts(stmt->v.For.orelse);\n case AsyncFor_kind:\n return validate_expr(stmt->v.AsyncFor.target, Store) &&\n validate_expr(stmt->v.AsyncFor.iter, Load) &&\n validate_body(stmt->v.AsyncFor.body, \"AsyncFor\") &&\n validate_stmts(stmt->v.AsyncFor.orelse);\n case While_kind:\n return validate_expr(stmt->v.While.test, Load) &&\n validate_body(stmt->v.While.body, \"While\") &&\n validate_stmts(stmt->v.While.orelse);\n case If_kind:\n return validate_expr(stmt->v.If.test, Load) &&\n validate_body(stmt->v.If.body, \"If\") &&\n validate_stmts(stmt->v.If.orelse);\n case With_kind:\n if (!validate_nonempty_seq(stmt->v.With.items, \"items\", \"With\"))\n return 0;\n for (i = 0; i < asdl_seq_LEN(stmt->v.With.items); i++) {\n withitem_ty item = asdl_seq_GET(stmt->v.With.items, i);\n if (!validate_expr(item->context_expr, Load) ||\n (item->optional_vars && !validate_expr(item->optional_vars, Store)))\n return 0;\n }\n return validate_body(stmt->v.With.body, \"With\");\n case AsyncWith_kind:\n if (!validate_nonempty_seq(stmt->v.AsyncWith.items, \"items\", \"AsyncWith\"))\n return 0;\n for (i = 0; i < asdl_seq_LEN(stmt->v.AsyncWith.items); i++) {\n withitem_ty item = asdl_seq_GET(stmt->v.AsyncWith.items, i);\n if (!validate_expr(item->context_expr, Load) ||\n (item->optional_vars && !validate_expr(item->optional_vars, Store)))\n return 0;\n }\n return validate_body(stmt->v.AsyncWith.body, \"AsyncWith\");\n case Raise_kind:\n if (stmt->v.Raise.exc) {\n return validate_expr(stmt->v.Raise.exc, Load) &&\n (!stmt->v.Raise.cause || validate_expr(stmt->v.Raise.cause, Load));\n }\n if (stmt->v.Raise.cause) {\n PyErr_SetString(PyExc_ValueError, \"Raise with cause but no exception\");\n return 0;\n }\n return 1;\n case Try_kind:\n if (!validate_body(stmt->v.Try.body, \"Try\"))\n return 0;\n if (!asdl_seq_LEN(stmt->v.Try.handlers) &&\n !asdl_seq_LEN(stmt->v.Try.finalbody)) {\n PyErr_SetString(PyExc_ValueError, \"Try has neither except handlers nor finalbody\");\n return 0;\n }\n if (!asdl_seq_LEN(stmt->v.Try.handlers) &&\n asdl_seq_LEN(stmt->v.Try.orelse)) {\n PyErr_SetString(PyExc_ValueError, \"Try has orelse but no except handlers\");\n return 0;\n }\n for (i = 0; i < asdl_seq_LEN(stmt->v.Try.handlers); i++) {\n excepthandler_ty handler = asdl_seq_GET(stmt->v.Try.handlers, i);\n if ((handler->v.ExceptHandler.type &&\n !validate_expr(handler->v.ExceptHandler.type, Load)) ||\n !validate_body(handler->v.ExceptHandler.body, \"ExceptHandler\"))\n return 0;\n }\n return (!asdl_seq_LEN(stmt->v.Try.finalbody) ||\n validate_stmts(stmt->v.Try.finalbody)) &&\n (!asdl_seq_LEN(stmt->v.Try.orelse) ||\n validate_stmts(stmt->v.Try.orelse));\n case Assert_kind:\n return validate_expr(stmt->v.Assert.test, Load) &&\n (!stmt->v.Assert.msg || validate_expr(stmt->v.Assert.msg, Load));\n case Import_kind:\n return validate_nonempty_seq(stmt->v.Import.names, \"names\", \"Import\");\n case ImportFrom_kind:\n if (stmt->v.ImportFrom.level < 0) {\n PyErr_SetString(PyExc_ValueError, \"Negative ImportFrom level\");\n return 0;\n }\n return validate_nonempty_seq(stmt->v.ImportFrom.names, \"names\", \"ImportFrom\");\n case Global_kind:\n return validate_nonempty_seq(stmt->v.Global.names, \"names\", \"Global\");\n case Nonlocal_kind:\n return validate_nonempty_seq(stmt->v.Nonlocal.names, \"names\", \"Nonlocal\");\n case Expr_kind:\n return validate_expr(stmt->v.Expr.value, Load);\n case AsyncFunctionDef_kind:\n return validate_body(stmt->v.AsyncFunctionDef.body, \"AsyncFunctionDef\") &&\n validate_arguments(stmt->v.AsyncFunctionDef.args) &&\n validate_exprs(stmt->v.AsyncFunctionDef.decorator_list, Load, 0) &&\n (!stmt->v.AsyncFunctionDef.returns ||\n validate_expr(stmt->v.AsyncFunctionDef.returns, Load));\n case Pass_kind:\n case Break_kind:\n case Continue_kind:\n return 1;\n default:\n PyErr_SetString(PyExc_SystemError, \"unexpected statement\");\n return 0;\n }\n}\n\nstatic int\nvalidate_stmts(asdl_seq *seq)\n{\n int i;\n for (i = 0; i < asdl_seq_LEN(seq); i++) {\n stmt_ty stmt = asdl_seq_GET(seq, i);\n if (stmt) {\n if (!validate_stmt(stmt))\n return 0;\n }\n else {\n PyErr_SetString(PyExc_ValueError,\n \"None disallowed in statement list\");\n return 0;\n }\n }\n return 1;\n}\n\nstatic int\nvalidate_exprs(asdl_seq *exprs, expr_context_ty ctx, int null_ok)\n{\n int i;\n for (i = 0; i < asdl_seq_LEN(exprs); i++) {\n expr_ty expr = asdl_seq_GET(exprs, i);\n if (expr) {\n if (!validate_expr(expr, ctx))\n return 0;\n }\n else if (!null_ok) {\n PyErr_SetString(PyExc_ValueError,\n \"None disallowed in expression list\");\n return 0;\n }\n\n }\n return 1;\n}\n\nint\nTa3AST_Validate(mod_ty mod)\n{\n int res = 0;\n\n switch (mod->kind) {\n case Module_kind:\n res = validate_stmts(mod->v.Module.body);\n break;\n case Interactive_kind:\n res = validate_stmts(mod->v.Interactive.body);\n break;\n case Expression_kind:\n res = validate_expr(mod->v.Expression.body, Load);\n break;\n case Suite_kind:\n PyErr_SetString(PyExc_ValueError, \"Suite is not valid in the CPython compiler\");\n break;\n default:\n PyErr_SetString(PyExc_SystemError, \"impossible module node\");\n res = 0;\n break;\n }\n return res;\n}\n\n/* This is done here, so defines like \"test\" don't interfere with AST use above. */\n#include \"grammar.h\"\n#include \"parsetok.h\"\n#include \"graminit.h\"\n\n/* Data structure used internally */\nstruct compiling {\n PyArena *c_arena; /* Arena for allocating memory. */\n PyObject *c_filename; /* filename */\n PyObject *c_normalize; /* Normalization function from unicodedata. */\n PyObject *c_normalize_args; /* Normalization argument tuple. */\n int c_feature_version; /* Latest minior version of Python for allowed features */\n};\n\nstatic asdl_seq *seq_for_testlist(struct compiling *, const node *);\nstatic expr_ty ast_for_expr(struct compiling *, const node *);\nstatic stmt_ty ast_for_stmt(struct compiling *, const node *);\nstatic asdl_seq *ast_for_suite(struct compiling *, const node *);\nstatic asdl_seq *ast_for_exprlist(struct compiling *, const node *,\n expr_context_ty);\nstatic expr_ty ast_for_testlist(struct compiling *, const node *);\nstatic stmt_ty ast_for_classdef(struct compiling *, const node *, asdl_seq *);\n\nstatic stmt_ty ast_for_with_stmt(struct compiling *, const node *, int);\nstatic stmt_ty ast_for_for_stmt(struct compiling *, const node *, int);\n\n/* Note different signature for ast_for_call */\nstatic expr_ty ast_for_call(struct compiling *, const node *, expr_ty);\n\nstatic PyObject *parsenumber(struct compiling *, const char *);\nstatic expr_ty parsestrplus(struct compiling *, const node *n);\n\n#define COMP_GENEXP 0\n#define COMP_LISTCOMP 1\n#define COMP_SETCOMP 2\n\nstatic int\ninit_normalization(struct compiling *c)\n{\n PyObject *m = PyImport_ImportModuleNoBlock(\"unicodedata\");\n if (!m)\n return 0;\n c->c_normalize = PyObject_GetAttrString(m, \"normalize\");\n Py_DECREF(m);\n if (!c->c_normalize)\n return 0;\n c->c_normalize_args = Py_BuildValue(\"(sN)\", \"NFKC\", Py_None);\n if (!c->c_normalize_args) {\n Py_CLEAR(c->c_normalize);\n return 0;\n }\n PyTuple_SET_ITEM(c->c_normalize_args, 1, NULL);\n return 1;\n}\n\nstatic identifier\nnew_identifier(const char *n, struct compiling *c)\n{\n PyObject *id = PyUnicode_DecodeUTF8(n, strlen(n), NULL);\n if (!id)\n return NULL;\n /* PyUnicode_DecodeUTF8 should always return a ready string. */\n assert(PyUnicode_IS_READY(id));\n /* Check whether there are non-ASCII characters in the\n identifier; if so, normalize to NFKC. */\n if (!PyUnicode_IS_ASCII(id)) {\n PyObject *id2;\n if (!c->c_normalize && !init_normalization(c)) {\n Py_DECREF(id);\n return NULL;\n }\n PyTuple_SET_ITEM(c->c_normalize_args, 1, id);\n id2 = PyObject_Call(c->c_normalize, c->c_normalize_args, NULL);\n Py_DECREF(id);\n if (!id2)\n return NULL;\n id = id2;\n }\n PyUnicode_InternInPlace(&id);\n if (PyArena_AddPyObject(c->c_arena, id) < 0) {\n Py_DECREF(id);\n return NULL;\n }\n return id;\n}\n\n#define NEW_IDENTIFIER(n) new_identifier(STR(n), c)\n\nstatic string\nnew_type_comment(const char *s, struct compiling *c)\n{\n return PyUnicode_DecodeUTF8(s, strlen(s), NULL);\n}\n#define NEW_TYPE_COMMENT(n) new_type_comment(STR(n), c)\n\nstatic int\nast_error(struct compiling *c, const node *n, const char *errmsg)\n{\n PyObject *value, *errstr, *loc, *tmp;\n\n loc = PyErr_ProgramTextObject(c->c_filename, LINENO(n));\n if (!loc) {\n Py_INCREF(Py_None);\n loc = Py_None;\n }\n tmp = Py_BuildValue(\"(OiiN)\", c->c_filename, LINENO(n), n->n_col_offset, loc);\n if (!tmp)\n return 0;\n errstr = PyUnicode_FromString(errmsg);\n if (!errstr) {\n Py_DECREF(tmp);\n return 0;\n }\n value = PyTuple_Pack(2, errstr, tmp);\n Py_DECREF(errstr);\n Py_DECREF(tmp);\n if (value) {\n PyErr_SetObject(PyExc_SyntaxError, value);\n Py_DECREF(value);\n }\n return 0;\n}\n\n/* num_stmts() returns number of contained statements.\n\n Use this routine to determine how big a sequence is needed for\n the statements in a parse tree. Its raison d'etre is this bit of\n grammar:\n\n stmt: simple_stmt | compound_stmt\n simple_stmt: small_stmt (';' small_stmt)* [';'] NEWLINE\n\n A simple_stmt can contain multiple small_stmt elements joined\n by semicolons. If the arg is a simple_stmt, the number of\n small_stmt elements is returned.\n*/\n\nstatic int\nnum_stmts(const node *n)\n{\n int i, l;\n node *ch;\n\n switch (TYPE(n)) {\n case single_input:\n if (TYPE(CHILD(n, 0)) == NEWLINE)\n return 0;\n else\n return num_stmts(CHILD(n, 0));\n case file_input:\n l = 0;\n for (i = 0; i < NCH(n); i++) {\n ch = CHILD(n, i);\n if (TYPE(ch) == stmt)\n l += num_stmts(ch);\n }\n return l;\n case stmt:\n return num_stmts(CHILD(n, 0));\n case compound_stmt:\n return 1;\n case simple_stmt:\n return NCH(n) / 2; /* Divide by 2 to remove count of semi-colons */\n case suite:\n /* suite: simple_stmt | NEWLINE [TYPE_COMMENT NEWLINE] INDENT stmt+ DEDENT */\n if (NCH(n) == 1)\n return num_stmts(CHILD(n, 0));\n else {\n i = 2;\n l = 0;\n if (TYPE(CHILD(n, 1)) == TYPE_COMMENT)\n i += 2;\n for (; i < (NCH(n) - 1); i++)\n l += num_stmts(CHILD(n, i));\n return l;\n }\n default: {\n char buf[128];\n\n sprintf(buf, \"Non-statement found: %d %d\",\n TYPE(n), NCH(n));\n Py_FatalError(buf);\n }\n }\n assert(0);\n return 0;\n}\n\n/* Transform the CST rooted at node * to the appropriate AST\n*/\n\nmod_ty\nTa3AST_FromNodeObject(const node *n, PyCompilerFlags *flags,\n PyObject *filename, int feature_version,\n PyArena *arena)\n{\n int i, j, k, num;\n asdl_seq *stmts = NULL;\n asdl_seq *type_ignores = NULL;\n stmt_ty s;\n node *ch;\n struct compiling c;\n mod_ty res = NULL;\n asdl_seq *argtypes = NULL;\n expr_ty ret, arg;\n\n c.c_arena = arena;\n /* borrowed reference */\n c.c_filename = filename;\n c.c_normalize = NULL;\n c.c_normalize_args = NULL;\n c.c_feature_version = feature_version;\n\n if (TYPE(n) == encoding_decl)\n n = CHILD(n, 0);\n\n k = 0;\n switch (TYPE(n)) {\n case file_input:\n stmts = _Ta3_asdl_seq_new(num_stmts(n), arena);\n if (!stmts)\n goto out;\n for (i = 0; i < NCH(n) - 1; i++) {\n ch = CHILD(n, i);\n if (TYPE(ch) == NEWLINE)\n continue;\n REQ(ch, stmt);\n num = num_stmts(ch);\n if (num == 1) {\n s = ast_for_stmt(&c, ch);\n if (!s)\n goto out;\n asdl_seq_SET(stmts, k++, s);\n }\n else {\n ch = CHILD(ch, 0);\n REQ(ch, simple_stmt);\n for (j = 0; j < num; j++) {\n s = ast_for_stmt(&c, CHILD(ch, j * 2));\n if (!s)\n goto out;\n asdl_seq_SET(stmts, k++, s);\n }\n }\n }\n\n /* Type ignores are stored under the ENDMARKER in file_input. */\n ch = CHILD(n, NCH(n) - 1);\n REQ(ch, ENDMARKER);\n num = NCH(ch);\n type_ignores = _Ta3_asdl_seq_new(num, arena);\n if (!type_ignores)\n goto out;\n\n for (i = 0; i < num; i++) {\n type_ignore_ty ti = TypeIgnore(LINENO(CHILD(ch, i)), arena);\n if (!ti)\n goto out;\n asdl_seq_SET(type_ignores, i, ti);\n }\n\n res = Module(stmts, type_ignores, arena);\n break;\n case eval_input: {\n expr_ty testlist_ast;\n\n /* XXX Why not comp_for here? */\n testlist_ast = ast_for_testlist(&c, CHILD(n, 0));\n if (!testlist_ast)\n goto out;\n res = Expression(testlist_ast, arena);\n break;\n }\n case single_input:\n if (TYPE(CHILD(n, 0)) == NEWLINE) {\n stmts = _Ta3_asdl_seq_new(1, arena);\n if (!stmts)\n goto out;\n asdl_seq_SET(stmts, 0, Pass(n->n_lineno, n->n_col_offset,\n arena));\n if (!asdl_seq_GET(stmts, 0))\n goto out;\n res = Interactive(stmts, arena);\n }\n else {\n n = CHILD(n, 0);\n num = num_stmts(n);\n stmts = _Ta3_asdl_seq_new(num, arena);\n if (!stmts)\n goto out;\n if (num == 1) {\n s = ast_for_stmt(&c, n);\n if (!s)\n goto out;\n asdl_seq_SET(stmts, 0, s);\n }\n else {\n /* Only a simple_stmt can contain multiple statements. */\n REQ(n, simple_stmt);\n for (i = 0; i < NCH(n); i += 2) {\n if (TYPE(CHILD(n, i)) == NEWLINE)\n break;\n s = ast_for_stmt(&c, CHILD(n, i));\n if (!s)\n goto out;\n asdl_seq_SET(stmts, i / 2, s);\n }\n }\n\n res = Interactive(stmts, arena);\n }\n break;\n case func_type_input:\n n = CHILD(n, 0);\n REQ(n, func_type);\n\n if (TYPE(CHILD(n, 1)) == typelist) {\n ch = CHILD(n, 1);\n /* this is overly permissive -- we don't pay any attention to\n * stars on the args -- just parse them into an ordered list */\n num = 0;\n for (i = 0; i < NCH(ch); i++) {\n if (TYPE(CHILD(ch, i)) == test)\n num++;\n }\n\n argtypes = _Ta3_asdl_seq_new(num, arena);\n\n j = 0;\n for (i = 0; i < NCH(ch); i++) {\n if (TYPE(CHILD(ch, i)) == test) {\n arg = ast_for_expr(&c, CHILD(ch, i));\n if (!arg)\n goto out;\n asdl_seq_SET(argtypes, j++, arg);\n }\n }\n }\n else\n argtypes = _Ta3_asdl_seq_new(0, arena);\n\n ret = ast_for_expr(&c, CHILD(n, NCH(n) - 1));\n if (!ret)\n goto out;\n res = FunctionType(argtypes, ret, arena);\n break;\n default:\n PyErr_Format(PyExc_SystemError,\n \"invalid node %d for Ta3AST_FromNode\", TYPE(n));\n goto out;\n }\n out:\n if (c.c_normalize) {\n Py_DECREF(c.c_normalize);\n PyTuple_SET_ITEM(c.c_normalize_args, 1, NULL);\n Py_DECREF(c.c_normalize_args);\n }\n return res;\n}\n\nmod_ty\nTa3AST_FromNode(const node *n, PyCompilerFlags *flags, const char *filename_str,\n int feature_version, PyArena *arena)\n{\n mod_ty mod;\n PyObject *filename;\n filename = PyUnicode_DecodeFSDefault(filename_str);\n if (filename == NULL)\n return NULL;\n mod = Ta3AST_FromNodeObject(n, flags, filename, feature_version, arena);\n Py_DECREF(filename);\n return mod;\n\n}\n\n/* Return the AST repr. of the operator represented as syntax (|, ^, etc.)\n*/\n\nstatic operator_ty\nget_operator(struct compiling *c, const node *n)\n{\n switch (TYPE(n)) {\n case VBAR:\n return BitOr;\n case CIRCUMFLEX:\n return BitXor;\n case AMPER:\n return BitAnd;\n case LEFTSHIFT:\n return LShift;\n case RIGHTSHIFT:\n return RShift;\n case PLUS:\n return Add;\n case MINUS:\n return Sub;\n case STAR:\n return Mult;\n case AT:\n if (c->c_feature_version < 5) {\n ast_error(c, n,\n \"The '@' operator is only supported in Python 3.5 and greater\");\n return (operator_ty)0;\n }\n return MatMult;\n case SLASH:\n return Div;\n case DOUBLESLASH:\n return FloorDiv;\n case PERCENT:\n return Mod;\n default:\n return (operator_ty)0;\n }\n}\n\nstatic const char * const FORBIDDEN[] = {\n \"None\",\n \"True\",\n \"False\",\n NULL,\n};\n\nstatic int\nforbidden_name(struct compiling *c, identifier name, const node *n,\n int full_checks)\n{\n assert(PyUnicode_Check(name));\n if (PyUnicode_CompareWithASCIIString(name, \"__debug__\") == 0) {\n ast_error(c, n, \"assignment to keyword\");\n return 1;\n }\n if (full_checks) {\n const char * const *p;\n for (p = FORBIDDEN; *p; p++) {\n if (PyUnicode_CompareWithASCIIString(name, *p) == 0) {\n ast_error(c, n, \"assignment to keyword\");\n return 1;\n }\n }\n }\n return 0;\n}\n\n/* Set the context ctx for expr_ty e, recursively traversing e.\n\n Only sets context for expr kinds that \"can appear in assignment context\"\n (according to ../Parser/Python.asdl). For other expr kinds, it sets\n an appropriate syntax error and returns false.\n*/\n\nstatic int\nset_context(struct compiling *c, expr_ty e, expr_context_ty ctx, const node *n)\n{\n asdl_seq *s = NULL;\n /* If a particular expression type can't be used for assign / delete,\n set expr_name to its name and an error message will be generated.\n */\n const char* expr_name = NULL;\n\n /* The ast defines augmented store and load contexts, but the\n implementation here doesn't actually use them. The code may be\n a little more complex than necessary as a result. It also means\n that expressions in an augmented assignment have a Store context.\n Consider restructuring so that augmented assignment uses\n set_context(), too.\n */\n assert(ctx != AugStore && ctx != AugLoad);\n\n switch (e->kind) {\n case Attribute_kind:\n e->v.Attribute.ctx = ctx;\n if (ctx == Store && forbidden_name(c, e->v.Attribute.attr, n, 1))\n return 0;\n break;\n case Subscript_kind:\n e->v.Subscript.ctx = ctx;\n break;\n case Starred_kind:\n e->v.Starred.ctx = ctx;\n if (!set_context(c, e->v.Starred.value, ctx, n))\n return 0;\n break;\n case Name_kind:\n if (ctx == Store) {\n if (forbidden_name(c, e->v.Name.id, n, 0))\n return 0; /* forbidden_name() calls ast_error() */\n }\n e->v.Name.ctx = ctx;\n break;\n case List_kind:\n e->v.List.ctx = ctx;\n s = e->v.List.elts;\n break;\n case Tuple_kind:\n e->v.Tuple.ctx = ctx;\n s = e->v.Tuple.elts;\n break;\n case Lambda_kind:\n expr_name = \"lambda\";\n break;\n case Call_kind:\n expr_name = \"function call\";\n break;\n case BoolOp_kind:\n case BinOp_kind:\n case UnaryOp_kind:\n expr_name = \"operator\";\n break;\n case GeneratorExp_kind:\n expr_name = \"generator expression\";\n break;\n case Yield_kind:\n case YieldFrom_kind:\n expr_name = \"yield expression\";\n break;\n case Await_kind:\n expr_name = \"await expression\";\n break;\n case ListComp_kind:\n expr_name = \"list comprehension\";\n break;\n case SetComp_kind:\n expr_name = \"set comprehension\";\n break;\n case DictComp_kind:\n expr_name = \"dict comprehension\";\n break;\n case Dict_kind:\n case Set_kind:\n case Num_kind:\n case Str_kind:\n case Bytes_kind:\n case JoinedStr_kind:\n case FormattedValue_kind:\n expr_name = \"literal\";\n break;\n case NameConstant_kind:\n expr_name = \"keyword\";\n break;\n case Ellipsis_kind:\n expr_name = \"Ellipsis\";\n break;\n case Compare_kind:\n expr_name = \"comparison\";\n break;\n case IfExp_kind:\n expr_name = \"conditional expression\";\n break;\n default:\n PyErr_Format(PyExc_SystemError,\n \"unexpected expression in assignment %d (line %d)\",\n e->kind, e->lineno);\n return 0;\n }\n /* Check for error string set by switch */\n if (expr_name) {\n char buf[300];\n PyOS_snprintf(buf, sizeof(buf),\n \"can't %s %s\",\n ctx == Store ? \"assign to\" : \"delete\",\n expr_name);\n return ast_error(c, n, buf);\n }\n\n /* If the LHS is a list or tuple, we need to set the assignment\n context for all the contained elements.\n */\n if (s) {\n int i;\n\n for (i = 0; i < asdl_seq_LEN(s); i++) {\n if (!set_context(c, (expr_ty)asdl_seq_GET(s, i), ctx, n))\n return 0;\n }\n }\n return 1;\n}\n\nstatic operator_ty\nast_for_augassign(struct compiling *c, const node *n)\n{\n REQ(n, augassign);\n n = CHILD(n, 0);\n switch (STR(n)[0]) {\n case '+':\n return Add;\n case '-':\n return Sub;\n case '/':\n if (STR(n)[1] == '/')\n return FloorDiv;\n else\n return Div;\n case '%':\n return Mod;\n case '<':\n return LShift;\n case '>':\n return RShift;\n case '&':\n return BitAnd;\n case '^':\n return BitXor;\n case '|':\n return BitOr;\n case '*':\n if (STR(n)[1] == '*')\n return Pow;\n else\n return Mult;\n case '@':\n if (c->c_feature_version < 5) {\n ast_error(c, n,\n \"The '@' operator is only supported in Python 3.5 and greater\");\n return (operator_ty)0;\n }\n return MatMult;\n default:\n PyErr_Format(PyExc_SystemError, \"invalid augassign: %s\", STR(n));\n return (operator_ty)0;\n }\n}\n\nstatic cmpop_ty\nast_for_comp_op(struct compiling *c, const node *n)\n{\n /* comp_op: '<'|'>'|'=='|'>='|'<='|'!='|'in'|'not' 'in'|'is'\n |'is' 'not'\n */\n REQ(n, comp_op);\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n switch (TYPE(n)) {\n case LESS:\n return Lt;\n case GREATER:\n return Gt;\n case EQEQUAL: /* == */\n return Eq;\n case LESSEQUAL:\n return LtE;\n case GREATEREQUAL:\n return GtE;\n case NOTEQUAL:\n return NotEq;\n case NAME:\n if (strcmp(STR(n), \"in\") == 0)\n return In;\n if (strcmp(STR(n), \"is\") == 0)\n return Is;\n default:\n PyErr_Format(PyExc_SystemError, \"invalid comp_op: %s\",\n STR(n));\n return (cmpop_ty)0;\n }\n }\n else if (NCH(n) == 2) {\n /* handle \"not in\" and \"is not\" */\n switch (TYPE(CHILD(n, 0))) {\n case NAME:\n if (strcmp(STR(CHILD(n, 1)), \"in\") == 0)\n return NotIn;\n if (strcmp(STR(CHILD(n, 0)), \"is\") == 0)\n return IsNot;\n default:\n PyErr_Format(PyExc_SystemError, \"invalid comp_op: %s %s\",\n STR(CHILD(n, 0)), STR(CHILD(n, 1)));\n return (cmpop_ty)0;\n }\n }\n PyErr_Format(PyExc_SystemError, \"invalid comp_op: has %d children\",\n NCH(n));\n return (cmpop_ty)0;\n}\n\nstatic asdl_seq *\nseq_for_testlist(struct compiling *c, const node *n)\n{\n /* testlist: test (',' test)* [',']\n testlist_star_expr: test|star_expr (',' test|star_expr)* [',']\n */\n asdl_seq *seq;\n expr_ty expression;\n int i;\n assert(TYPE(n) == testlist || TYPE(n) == testlist_star_expr || TYPE(n) == testlist_comp);\n\n seq = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!seq)\n return NULL;\n\n for (i = 0; i < NCH(n); i += 2) {\n const node *ch = CHILD(n, i);\n assert(TYPE(ch) == test || TYPE(ch) == test_nocond || TYPE(ch) == star_expr);\n\n expression = ast_for_expr(c, ch);\n if (!expression)\n return NULL;\n\n assert(i / 2 < seq->size);\n asdl_seq_SET(seq, i / 2, expression);\n }\n return seq;\n}\n\nstatic arg_ty\nast_for_arg(struct compiling *c, const node *n)\n{\n identifier name;\n expr_ty annotation = NULL;\n node *ch;\n arg_ty ret;\n\n assert(TYPE(n) == tfpdef || TYPE(n) == vfpdef);\n ch = CHILD(n, 0);\n name = NEW_IDENTIFIER(ch);\n if (!name)\n return NULL;\n if (forbidden_name(c, name, ch, 0))\n return NULL;\n\n if (NCH(n) == 3 && TYPE(CHILD(n, 1)) == COLON) {\n annotation = ast_for_expr(c, CHILD(n, 2));\n if (!annotation)\n return NULL;\n }\n\n ret = arg(name, annotation, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n if (!ret)\n return NULL;\n return ret;\n}\n\n/* returns -1 if failed to handle keyword only arguments\n returns new position to keep processing if successful\n (',' tfpdef ['=' test])*\n ^^^\n start pointing here\n */\nstatic int\nhandle_keywordonly_args(struct compiling *c, const node *n, int start,\n asdl_seq *kwonlyargs, asdl_seq *kwdefaults)\n{\n PyObject *argname;\n node *ch;\n expr_ty expression, annotation;\n arg_ty arg;\n int i = start;\n int j = 0; /* index for kwdefaults and kwonlyargs */\n\n if (kwonlyargs == NULL) {\n ast_error(c, CHILD(n, start), \"named arguments must follow bare *\");\n return -1;\n }\n assert(kwdefaults != NULL);\n while (i < NCH(n)) {\n ch = CHILD(n, i);\n switch (TYPE(ch)) {\n case vfpdef:\n case tfpdef:\n if (i + 1 < NCH(n) && TYPE(CHILD(n, i + 1)) == EQUAL) {\n expression = ast_for_expr(c, CHILD(n, i + 2));\n if (!expression)\n goto error;\n asdl_seq_SET(kwdefaults, j, expression);\n i += 2; /* '=' and test */\n }\n else { /* setting NULL if no default value exists */\n asdl_seq_SET(kwdefaults, j, NULL);\n }\n if (NCH(ch) == 3) {\n /* ch is NAME ':' test */\n annotation = ast_for_expr(c, CHILD(ch, 2));\n if (!annotation)\n goto error;\n }\n else {\n annotation = NULL;\n }\n ch = CHILD(ch, 0);\n argname = NEW_IDENTIFIER(ch);\n if (!argname)\n goto error;\n if (forbidden_name(c, argname, ch, 0))\n goto error;\n arg = arg(argname, annotation, NULL, LINENO(ch), ch->n_col_offset,\n c->c_arena);\n if (!arg)\n goto error;\n asdl_seq_SET(kwonlyargs, j++, arg);\n i += 1; /* the name */\n if (i < NCH(n) && TYPE(CHILD(n, i)) == COMMA)\n i += 1; /* the comma, if present */\n break;\n case TYPE_COMMENT:\n /* arg will be equal to the last argument processed */\n arg->type_comment = NEW_TYPE_COMMENT(ch);\n i += 1;\n break;\n case DOUBLESTAR:\n return i;\n default:\n ast_error(c, ch, \"unexpected node\");\n goto error;\n }\n }\n return i;\n error:\n return -1;\n}\n\n/* Create AST for argument list. */\n\nstatic arguments_ty\nast_for_arguments(struct compiling *c, const node *n)\n{\n /* This function handles both typedargslist (function definition)\n and varargslist (lambda definition).\n\n parameters: '(' [typedargslist] ')'\n typedargslist: (tfpdef ['=' test] (',' tfpdef ['=' test])* [',' [\n '*' [tfpdef] (',' tfpdef ['=' test])* [',' ['**' tfpdef [',']]]\n | '**' tfpdef [',']]]\n | '*' [tfpdef] (',' tfpdef ['=' test])* [',' ['**' tfpdef [',']]]\n | '**' tfpdef [','])\n tfpdef: NAME [':' test]\n varargslist: (vfpdef ['=' test] (',' vfpdef ['=' test])* [',' [\n '*' [vfpdef] (',' vfpdef ['=' test])* [',' ['**' vfpdef [',']]]\n | '**' vfpdef [',']]]\n | '*' [vfpdef] (',' vfpdef ['=' test])* [',' ['**' vfpdef [',']]]\n | '**' vfpdef [',']\n )\n vfpdef: NAME\n\n */\n int i, j, k, nposargs = 0, nkwonlyargs = 0;\n int nposdefaults = 0, found_default = 0;\n asdl_seq *posargs, *posdefaults, *kwonlyargs, *kwdefaults;\n arg_ty vararg = NULL, kwarg = NULL;\n arg_ty arg;\n node *ch;\n\n if (TYPE(n) == parameters) {\n if (NCH(n) == 2) /* () as argument list */\n return arguments(NULL, NULL, NULL, NULL, NULL, NULL, c->c_arena);\n n = CHILD(n, 1);\n }\n assert(TYPE(n) == typedargslist || TYPE(n) == varargslist);\n\n /* First count the number of positional args & defaults. The\n variable i is the loop index for this for loop and the next.\n The next loop picks up where the first leaves off.\n */\n for (i = 0; i < NCH(n); i++) {\n ch = CHILD(n, i);\n if (TYPE(ch) == STAR) {\n /* skip star */\n i++;\n if (i < NCH(n) && /* skip argument following star */\n (TYPE(CHILD(n, i)) == tfpdef ||\n TYPE(CHILD(n, i)) == vfpdef)) {\n i++;\n }\n break;\n }\n if (TYPE(ch) == DOUBLESTAR) break;\n if (TYPE(ch) == vfpdef || TYPE(ch) == tfpdef) nposargs++;\n if (TYPE(ch) == EQUAL) nposdefaults++;\n }\n /* count the number of keyword only args &\n defaults for keyword only args */\n for ( ; i < NCH(n); ++i) {\n ch = CHILD(n, i);\n if (TYPE(ch) == DOUBLESTAR) break;\n if (TYPE(ch) == tfpdef || TYPE(ch) == vfpdef) nkwonlyargs++;\n }\n posargs = (nposargs ? _Ta3_asdl_seq_new(nposargs, c->c_arena) : NULL);\n if (!posargs && nposargs)\n return NULL;\n kwonlyargs = (nkwonlyargs ?\n _Ta3_asdl_seq_new(nkwonlyargs, c->c_arena) : NULL);\n if (!kwonlyargs && nkwonlyargs)\n return NULL;\n posdefaults = (nposdefaults ?\n _Ta3_asdl_seq_new(nposdefaults, c->c_arena) : NULL);\n if (!posdefaults && nposdefaults)\n return NULL;\n /* The length of kwonlyargs and kwdefaults are same\n since we set NULL as default for keyword only argument w/o default\n - we have sequence data structure, but no dictionary */\n kwdefaults = (nkwonlyargs ?\n _Ta3_asdl_seq_new(nkwonlyargs, c->c_arena) : NULL);\n if (!kwdefaults && nkwonlyargs)\n return NULL;\n\n if (nposargs + nkwonlyargs > 255) {\n ast_error(c, n, \"more than 255 arguments\");\n return NULL;\n }\n\n /* tfpdef: NAME [':' test]\n vfpdef: NAME\n */\n i = 0;\n j = 0; /* index for defaults */\n k = 0; /* index for args */\n while (i < NCH(n)) {\n ch = CHILD(n, i);\n switch (TYPE(ch)) {\n case tfpdef:\n case vfpdef:\n /* XXX Need to worry about checking if TYPE(CHILD(n, i+1)) is\n anything other than EQUAL or a comma? */\n /* XXX Should NCH(n) check be made a separate check? */\n if (i + 1 < NCH(n) && TYPE(CHILD(n, i + 1)) == EQUAL) {\n expr_ty expression = ast_for_expr(c, CHILD(n, i + 2));\n if (!expression)\n return NULL;\n assert(posdefaults != NULL);\n asdl_seq_SET(posdefaults, j++, expression);\n i += 2;\n found_default = 1;\n }\n else if (found_default) {\n ast_error(c, n,\n \"non-default argument follows default argument\");\n return NULL;\n }\n arg = ast_for_arg(c, ch);\n if (!arg)\n return NULL;\n asdl_seq_SET(posargs, k++, arg);\n i += 1; /* the name */\n if (i < NCH(n) && TYPE(CHILD(n, i)) == COMMA)\n i += 1; /* the comma, if present */\n break;\n case STAR:\n if (i+1 >= NCH(n) ||\n (i+2 == NCH(n) && (TYPE(CHILD(n, i+1)) == COMMA\n || TYPE(CHILD(n, i+1)) == TYPE_COMMENT))) {\n ast_error(c, CHILD(n, i),\n \"named arguments must follow bare *\");\n return NULL;\n }\n ch = CHILD(n, i+1); /* tfpdef or COMMA */\n if (TYPE(ch) == COMMA) {\n int res = 0;\n i += 2; /* now follows keyword only arguments */\n\n if (i < NCH(n) && TYPE(CHILD(n, i)) == TYPE_COMMENT) {\n ast_error(c, CHILD(n, i),\n \"bare * has associated type comment\");\n return NULL;\n }\n\n res = handle_keywordonly_args(c, n, i,\n kwonlyargs, kwdefaults);\n if (res == -1) return NULL;\n i = res; /* res has new position to process */\n }\n else {\n vararg = ast_for_arg(c, ch);\n if (!vararg)\n return NULL;\n\n i += 2; /* the star and the name */\n if (i < NCH(n) && TYPE(CHILD(n, i)) == COMMA)\n i += 1; /* the comma, if present */\n\n if (i < NCH(n) && TYPE(CHILD(n, i)) == TYPE_COMMENT) {\n vararg->type_comment = NEW_TYPE_COMMENT(CHILD(n, i));\n i += 1;\n }\n\n if (i < NCH(n) && (TYPE(CHILD(n, i)) == tfpdef\n || TYPE(CHILD(n, i)) == vfpdef)) {\n int res = 0;\n res = handle_keywordonly_args(c, n, i,\n kwonlyargs, kwdefaults);\n if (res == -1) return NULL;\n i = res; /* res has new position to process */\n }\n }\n break;\n case DOUBLESTAR:\n ch = CHILD(n, i+1); /* tfpdef */\n assert(TYPE(ch) == tfpdef || TYPE(ch) == vfpdef);\n kwarg = ast_for_arg(c, ch);\n if (!kwarg)\n return NULL;\n i += 2; /* the double star and the name */\n if (i < NCH(n) && TYPE(CHILD(n, i)) == COMMA)\n i += 1; /* the comma, if present */\n break;\n case TYPE_COMMENT:\n assert(i);\n\n if (kwarg)\n arg = kwarg;\n\n /* arg will be equal to the last argument processed */\n arg->type_comment = NEW_TYPE_COMMENT(ch);\n i += 1;\n break;\n default:\n PyErr_Format(PyExc_SystemError,\n \"unexpected node in varargslist: %d @ %d\",\n TYPE(ch), i);\n return NULL;\n }\n }\n return arguments(posargs, vararg, kwonlyargs, kwdefaults, kwarg, posdefaults, c->c_arena);\n}\n\nstatic expr_ty\nast_for_dotted_name(struct compiling *c, const node *n)\n{\n expr_ty e;\n identifier id;\n int lineno, col_offset;\n int i;\n\n REQ(n, dotted_name);\n\n lineno = LINENO(n);\n col_offset = n->n_col_offset;\n\n id = NEW_IDENTIFIER(CHILD(n, 0));\n if (!id)\n return NULL;\n e = Name(id, Load, lineno, col_offset, c->c_arena);\n if (!e)\n return NULL;\n\n for (i = 2; i < NCH(n); i+=2) {\n id = NEW_IDENTIFIER(CHILD(n, i));\n if (!id)\n return NULL;\n e = Attribute(e, id, Load, lineno, col_offset, c->c_arena);\n if (!e)\n return NULL;\n }\n\n return e;\n}\n\nstatic expr_ty\nast_for_decorator(struct compiling *c, const node *n)\n{\n /* decorator: '@' dotted_name [ '(' [arglist] ')' ] NEWLINE */\n expr_ty d = NULL;\n expr_ty name_expr;\n\n REQ(n, decorator);\n REQ(CHILD(n, 0), AT);\n REQ(RCHILD(n, -1), NEWLINE);\n\n name_expr = ast_for_dotted_name(c, CHILD(n, 1));\n if (!name_expr)\n return NULL;\n\n if (NCH(n) == 3) { /* No arguments */\n d = name_expr;\n name_expr = NULL;\n }\n else if (NCH(n) == 5) { /* Call with no arguments */\n d = Call(name_expr, NULL, NULL, LINENO(n),\n n->n_col_offset, c->c_arena);\n if (!d)\n return NULL;\n name_expr = NULL;\n }\n else {\n d = ast_for_call(c, CHILD(n, 3), name_expr);\n if (!d)\n return NULL;\n name_expr = NULL;\n }\n\n return d;\n}\n\nstatic asdl_seq*\nast_for_decorators(struct compiling *c, const node *n)\n{\n asdl_seq* decorator_seq;\n expr_ty d;\n int i;\n\n REQ(n, decorators);\n decorator_seq = _Ta3_asdl_seq_new(NCH(n), c->c_arena);\n if (!decorator_seq)\n return NULL;\n\n for (i = 0; i < NCH(n); i++) {\n d = ast_for_decorator(c, CHILD(n, i));\n if (!d)\n return NULL;\n asdl_seq_SET(decorator_seq, i, d);\n }\n return decorator_seq;\n}\n\nstatic stmt_ty\nast_for_funcdef_impl(struct compiling *c, const node *n,\n asdl_seq *decorator_seq, int is_async)\n{\n /* funcdef: 'def' NAME parameters ['->' test] ':' [TYPE_COMMENT] suite */\n identifier name;\n arguments_ty args;\n asdl_seq *body;\n expr_ty returns = NULL;\n int name_i = 1;\n node *tc;\n string type_comment = NULL;\n\n if (is_async && c->c_feature_version < 5) {\n ast_error(c, n,\n \"Async functions are only supported in Python 3.5 and greater\");\n return NULL;\n }\n\n REQ(n, funcdef);\n\n name = NEW_IDENTIFIER(CHILD(n, name_i));\n if (!name)\n return NULL;\n if (forbidden_name(c, name, CHILD(n, name_i), 0))\n return NULL;\n args = ast_for_arguments(c, CHILD(n, name_i + 1));\n if (!args)\n return NULL;\n if (TYPE(CHILD(n, name_i+2)) == RARROW) {\n returns = ast_for_expr(c, CHILD(n, name_i + 3));\n if (!returns)\n return NULL;\n name_i += 2;\n }\n if (TYPE(CHILD(n, name_i + 3)) == TYPE_COMMENT) {\n type_comment = NEW_TYPE_COMMENT(CHILD(n, name_i + 3));\n name_i += 1;\n }\n body = ast_for_suite(c, CHILD(n, name_i + 3));\n if (!body)\n return NULL;\n\n if (!type_comment && NCH(CHILD(n, name_i + 3)) > 1) {\n /* If the function doesn't have a type comment on the same line, check\n * if the suite has a type comment in it. */\n tc = CHILD(CHILD(n, name_i + 3), 1);\n\n if (TYPE(tc) == TYPE_COMMENT)\n type_comment = NEW_TYPE_COMMENT(tc);\n }\n\n if (is_async)\n return AsyncFunctionDef(name, args, body, decorator_seq, returns,\n type_comment, LINENO(n),\n n->n_col_offset, c->c_arena);\n else\n return FunctionDef(name, args, body, decorator_seq, returns,\n type_comment, LINENO(n),\n n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_async_funcdef(struct compiling *c, const node *n, asdl_seq *decorator_seq)\n{\n /* async_funcdef: ASYNC funcdef */\n REQ(n, async_funcdef);\n REQ(CHILD(n, 0), ASYNC);\n REQ(CHILD(n, 1), funcdef);\n\n return ast_for_funcdef_impl(c, CHILD(n, 1), decorator_seq,\n 1 /* is_async */);\n}\n\nstatic stmt_ty\nast_for_funcdef(struct compiling *c, const node *n, asdl_seq *decorator_seq)\n{\n /* funcdef: 'def' NAME parameters ['->' test] ':' suite */\n return ast_for_funcdef_impl(c, n, decorator_seq,\n 0 /* is_async */);\n}\n\n\nstatic stmt_ty\nast_for_async_stmt(struct compiling *c, const node *n)\n{\n /* async_stmt: ASYNC (funcdef | with_stmt | for_stmt) */\n REQ(n, async_stmt);\n REQ(CHILD(n, 0), ASYNC);\n\n switch (TYPE(CHILD(n, 1))) {\n case funcdef:\n return ast_for_funcdef_impl(c, CHILD(n, 1), NULL,\n 1 /* is_async */);\n case with_stmt:\n return ast_for_with_stmt(c, CHILD(n, 1),\n 1 /* is_async */);\n\n case for_stmt:\n return ast_for_for_stmt(c, CHILD(n, 1),\n 1 /* is_async */);\n\n default:\n PyErr_Format(PyExc_SystemError,\n \"invalid async stament: %s\",\n STR(CHILD(n, 1)));\n return NULL;\n }\n}\n\nstatic stmt_ty\nast_for_decorated(struct compiling *c, const node *n)\n{\n /* decorated: decorators (classdef | funcdef | async_funcdef) */\n stmt_ty thing = NULL;\n asdl_seq *decorator_seq = NULL;\n\n REQ(n, decorated);\n\n decorator_seq = ast_for_decorators(c, CHILD(n, 0));\n if (!decorator_seq)\n return NULL;\n\n assert(TYPE(CHILD(n, 1)) == funcdef ||\n TYPE(CHILD(n, 1)) == async_funcdef ||\n TYPE(CHILD(n, 1)) == classdef);\n\n if (TYPE(CHILD(n, 1)) == funcdef) {\n thing = ast_for_funcdef(c, CHILD(n, 1), decorator_seq);\n } else if (TYPE(CHILD(n, 1)) == classdef) {\n thing = ast_for_classdef(c, CHILD(n, 1), decorator_seq);\n } else if (TYPE(CHILD(n, 1)) == async_funcdef) {\n thing = ast_for_async_funcdef(c, CHILD(n, 1), decorator_seq);\n }\n /* we count the decorators in when talking about the class' or\n * function's line number */\n if (thing) {\n thing->lineno = LINENO(n);\n thing->col_offset = n->n_col_offset;\n }\n return thing;\n}\n\nstatic expr_ty\nast_for_lambdef(struct compiling *c, const node *n)\n{\n /* lambdef: 'lambda' [varargslist] ':' test\n lambdef_nocond: 'lambda' [varargslist] ':' test_nocond */\n arguments_ty args;\n expr_ty expression;\n\n if (NCH(n) == 3) {\n args = arguments(NULL, NULL, NULL, NULL, NULL, NULL, c->c_arena);\n if (!args)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, 2));\n if (!expression)\n return NULL;\n }\n else {\n args = ast_for_arguments(c, CHILD(n, 1));\n if (!args)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, 3));\n if (!expression)\n return NULL;\n }\n\n return Lambda(args, expression, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_ifexpr(struct compiling *c, const node *n)\n{\n /* test: or_test 'if' or_test 'else' test */\n expr_ty expression, body, orelse;\n\n assert(NCH(n) == 5);\n body = ast_for_expr(c, CHILD(n, 0));\n if (!body)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, 2));\n if (!expression)\n return NULL;\n orelse = ast_for_expr(c, CHILD(n, 4));\n if (!orelse)\n return NULL;\n return IfExp(expression, body, orelse, LINENO(n), n->n_col_offset,\n c->c_arena);\n}\n\n/*\n Count the number of 'for' loops in a comprehension.\n\n Helper for ast_for_comprehension().\n*/\n\nstatic int\ncount_comp_fors(struct compiling *c, const node *n)\n{\n int n_fors = 0;\n int is_async;\n\n count_comp_for:\n is_async = 0;\n n_fors++;\n REQ(n, comp_for);\n if (TYPE(CHILD(n, 0)) == ASYNC) {\n is_async = 1;\n }\n if (NCH(n) == (5 + is_async)) {\n n = CHILD(n, 4 + is_async);\n }\n else {\n return n_fors;\n }\n count_comp_iter:\n REQ(n, comp_iter);\n n = CHILD(n, 0);\n if (TYPE(n) == comp_for)\n goto count_comp_for;\n else if (TYPE(n) == comp_if) {\n if (NCH(n) == 3) {\n n = CHILD(n, 2);\n goto count_comp_iter;\n }\n else\n return n_fors;\n }\n\n /* Should never be reached */\n PyErr_SetString(PyExc_SystemError,\n \"logic error in count_comp_fors\");\n return -1;\n}\n\n/* Count the number of 'if' statements in a comprehension.\n\n Helper for ast_for_comprehension().\n*/\n\nstatic int\ncount_comp_ifs(struct compiling *c, const node *n)\n{\n int n_ifs = 0;\n\n while (1) {\n REQ(n, comp_iter);\n if (TYPE(CHILD(n, 0)) == comp_for)\n return n_ifs;\n n = CHILD(n, 0);\n REQ(n, comp_if);\n n_ifs++;\n if (NCH(n) == 2)\n return n_ifs;\n n = CHILD(n, 2);\n }\n}\n\nstatic asdl_seq *\nast_for_comprehension(struct compiling *c, const node *n)\n{\n int i, n_fors;\n asdl_seq *comps;\n\n n_fors = count_comp_fors(c, n);\n if (n_fors == -1)\n return NULL;\n\n comps = _Ta3_asdl_seq_new(n_fors, c->c_arena);\n if (!comps)\n return NULL;\n\n for (i = 0; i < n_fors; i++) {\n comprehension_ty comp;\n asdl_seq *t;\n expr_ty expression, first;\n node *for_ch;\n int is_async = 0;\n\n REQ(n, comp_for);\n\n if (TYPE(CHILD(n, 0)) == ASYNC) {\n is_async = 1;\n }\n\n /* Async comprehensions only allowed in Python 3.6 and greater */\n if (is_async && c->c_feature_version < 6) {\n ast_error(c, n,\n \"Async comprehensions are only supported in Python 3.6 and greater\");\n return NULL;\n }\n\n for_ch = CHILD(n, 1 + is_async);\n t = ast_for_exprlist(c, for_ch, Store);\n if (!t)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, 3 + is_async));\n if (!expression)\n return NULL;\n\n /* Check the # of children rather than the length of t, since\n (x for x, in ...) has 1 element in t, but still requires a Tuple. */\n first = (expr_ty)asdl_seq_GET(t, 0);\n if (NCH(for_ch) == 1)\n comp = comprehension(first, expression, NULL,\n is_async, c->c_arena);\n else\n comp = comprehension(Tuple(t, Store, first->lineno,\n first->col_offset, c->c_arena),\n expression, NULL, is_async, c->c_arena);\n if (!comp)\n return NULL;\n\n if (NCH(n) == (5 + is_async)) {\n int j, n_ifs;\n asdl_seq *ifs;\n\n n = CHILD(n, 4 + is_async);\n n_ifs = count_comp_ifs(c, n);\n if (n_ifs == -1)\n return NULL;\n\n ifs = _Ta3_asdl_seq_new(n_ifs, c->c_arena);\n if (!ifs)\n return NULL;\n\n for (j = 0; j < n_ifs; j++) {\n REQ(n, comp_iter);\n n = CHILD(n, 0);\n REQ(n, comp_if);\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n asdl_seq_SET(ifs, j, expression);\n if (NCH(n) == 3)\n n = CHILD(n, 2);\n }\n /* on exit, must guarantee that n is a comp_for */\n if (TYPE(n) == comp_iter)\n n = CHILD(n, 0);\n comp->ifs = ifs;\n }\n asdl_seq_SET(comps, i, comp);\n }\n return comps;\n}\n\nstatic expr_ty\nast_for_itercomp(struct compiling *c, const node *n, int type)\n{\n /* testlist_comp: (test|star_expr)\n * ( comp_for | (',' (test|star_expr))* [','] ) */\n expr_ty elt;\n asdl_seq *comps;\n node *ch;\n\n assert(NCH(n) > 1);\n\n ch = CHILD(n, 0);\n elt = ast_for_expr(c, ch);\n if (!elt)\n return NULL;\n if (elt->kind == Starred_kind) {\n ast_error(c, ch, \"iterable unpacking cannot be used in comprehension\");\n return NULL;\n }\n\n comps = ast_for_comprehension(c, CHILD(n, 1));\n if (!comps)\n return NULL;\n\n if (type == COMP_GENEXP)\n return GeneratorExp(elt, comps, LINENO(n), n->n_col_offset, c->c_arena);\n else if (type == COMP_LISTCOMP)\n return ListComp(elt, comps, LINENO(n), n->n_col_offset, c->c_arena);\n else if (type == COMP_SETCOMP)\n return SetComp(elt, comps, LINENO(n), n->n_col_offset, c->c_arena);\n else\n /* Should never happen */\n return NULL;\n}\n\n/* Fills in the key, value pair corresponding to the dict element. In case\n * of an unpacking, key is NULL. *i is advanced by the number of ast\n * elements. Iff successful, nonzero is returned.\n */\nstatic int\nast_for_dictelement(struct compiling *c, const node *n, int *i,\n expr_ty *key, expr_ty *value)\n{\n expr_ty expression;\n if (TYPE(CHILD(n, *i)) == DOUBLESTAR) {\n assert(NCH(n) - *i >= 2);\n\n expression = ast_for_expr(c, CHILD(n, *i + 1));\n if (!expression)\n return 0;\n *key = NULL;\n *value = expression;\n\n *i += 2;\n }\n else {\n assert(NCH(n) - *i >= 3);\n\n expression = ast_for_expr(c, CHILD(n, *i));\n if (!expression)\n return 0;\n *key = expression;\n\n REQ(CHILD(n, *i + 1), COLON);\n\n expression = ast_for_expr(c, CHILD(n, *i + 2));\n if (!expression)\n return 0;\n *value = expression;\n\n *i += 3;\n }\n return 1;\n}\n\nstatic expr_ty\nast_for_dictcomp(struct compiling *c, const node *n)\n{\n expr_ty key, value;\n asdl_seq *comps;\n int i = 0;\n\n if (!ast_for_dictelement(c, n, &i, &key, &value))\n return NULL;\n assert(key);\n assert(NCH(n) - i >= 1);\n\n comps = ast_for_comprehension(c, CHILD(n, i));\n if (!comps)\n return NULL;\n\n return DictComp(key, value, comps, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_dictdisplay(struct compiling *c, const node *n)\n{\n int i;\n int j;\n int size;\n asdl_seq *keys, *values;\n\n size = (NCH(n) + 1) / 3; /* +1 in case no trailing comma */\n keys = _Ta3_asdl_seq_new(size, c->c_arena);\n if (!keys)\n return NULL;\n\n values = _Ta3_asdl_seq_new(size, c->c_arena);\n if (!values)\n return NULL;\n\n j = 0;\n for (i = 0; i < NCH(n); i++) {\n expr_ty key, value;\n\n if (!ast_for_dictelement(c, n, &i, &key, &value))\n return NULL;\n asdl_seq_SET(keys, j, key);\n asdl_seq_SET(values, j, value);\n\n j++;\n }\n keys->size = j;\n values->size = j;\n return Dict(keys, values, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_genexp(struct compiling *c, const node *n)\n{\n assert(TYPE(n) == (testlist_comp) || TYPE(n) == (argument));\n return ast_for_itercomp(c, n, COMP_GENEXP);\n}\n\nstatic expr_ty\nast_for_listcomp(struct compiling *c, const node *n)\n{\n assert(TYPE(n) == (testlist_comp));\n return ast_for_itercomp(c, n, COMP_LISTCOMP);\n}\n\nstatic expr_ty\nast_for_setcomp(struct compiling *c, const node *n)\n{\n assert(TYPE(n) == (dictorsetmaker));\n return ast_for_itercomp(c, n, COMP_SETCOMP);\n}\n\nstatic expr_ty\nast_for_setdisplay(struct compiling *c, const node *n)\n{\n int i;\n int size;\n asdl_seq *elts;\n\n assert(TYPE(n) == (dictorsetmaker));\n size = (NCH(n) + 1) / 2; /* +1 in case no trailing comma */\n elts = _Ta3_asdl_seq_new(size, c->c_arena);\n if (!elts)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n expr_ty expression;\n expression = ast_for_expr(c, CHILD(n, i));\n if (!expression)\n return NULL;\n asdl_seq_SET(elts, i / 2, expression);\n }\n return Set(elts, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_atom(struct compiling *c, const node *n)\n{\n /* atom: '(' [yield_expr|testlist_comp] ')' | '[' [testlist_comp] ']'\n | '{' [dictmaker|testlist_comp] '}' | NAME | NUMBER | STRING+\n | '...' | 'None' | 'True' | 'False'\n */\n node *ch = CHILD(n, 0);\n\n switch (TYPE(ch)) {\n case NAME: {\n PyObject *name;\n const char *s = STR(ch);\n size_t len = strlen(s);\n if (len >= 4 && len <= 5) {\n if (!strcmp(s, \"None\"))\n return NameConstant(Py_None, LINENO(n), n->n_col_offset, c->c_arena);\n if (!strcmp(s, \"True\"))\n return NameConstant(Py_True, LINENO(n), n->n_col_offset, c->c_arena);\n if (!strcmp(s, \"False\"))\n return NameConstant(Py_False, LINENO(n), n->n_col_offset, c->c_arena);\n }\n name = new_identifier(s, c);\n if (!name)\n return NULL;\n /* All names start in Load context, but may later be changed. */\n return Name(name, Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case STRING: {\n expr_ty str = parsestrplus(c, n);\n if (!str) {\n const char *errtype = NULL;\n if (PyErr_ExceptionMatches(PyExc_UnicodeError))\n errtype = \"unicode error\";\n else if (PyErr_ExceptionMatches(PyExc_ValueError))\n errtype = \"value error\";\n if (errtype) {\n char buf[128];\n const char *s = NULL;\n PyObject *type, *value, *tback, *errstr;\n PyErr_Fetch(&type, &value, &tback);\n errstr = PyObject_Str(value);\n if (errstr)\n s = PyUnicode_AsUTF8(errstr);\n if (s) {\n PyOS_snprintf(buf, sizeof(buf), \"(%s) %s\", errtype, s);\n } else {\n PyErr_Clear();\n PyOS_snprintf(buf, sizeof(buf), \"(%s) unknown error\", errtype);\n }\n Py_XDECREF(errstr);\n ast_error(c, n, buf);\n Py_DECREF(type);\n Py_XDECREF(value);\n Py_XDECREF(tback);\n }\n return NULL;\n }\n return str;\n }\n case NUMBER: {\n PyObject *pynum;\n const char *s = STR(ch);\n /* Underscores in numeric literals are only allowed in Python 3.6 or greater */\n /* Check for underscores here rather than in parse_number so we can report a line number on error */\n if (c->c_feature_version < 6 && strchr(s, '_') != NULL) {\n ast_error(c, ch,\n \"Underscores in numeric literals are only supported in Python 3.6 and greater\");\n return NULL;\n }\n pynum = parsenumber(c, s);\n if (!pynum)\n return NULL;\n\n if (PyArena_AddPyObject(c->c_arena, pynum) < 0) {\n Py_DECREF(pynum);\n return NULL;\n }\n return Num(pynum, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case ELLIPSIS: /* Ellipsis */\n return Ellipsis(LINENO(n), n->n_col_offset, c->c_arena);\n case LPAR: /* some parenthesized expressions */\n ch = CHILD(n, 1);\n\n if (TYPE(ch) == RPAR)\n return Tuple(NULL, Load, LINENO(n), n->n_col_offset, c->c_arena);\n\n if (TYPE(ch) == yield_expr)\n return ast_for_expr(c, ch);\n\n /* testlist_comp: test ( comp_for | (',' test)* [','] ) */\n if ((NCH(ch) > 1) && (TYPE(CHILD(ch, 1)) == comp_for))\n return ast_for_genexp(c, ch);\n\n return ast_for_testlist(c, ch);\n case LSQB: /* list (or list comprehension) */\n ch = CHILD(n, 1);\n\n if (TYPE(ch) == RSQB)\n return List(NULL, Load, LINENO(n), n->n_col_offset, c->c_arena);\n\n REQ(ch, testlist_comp);\n if (NCH(ch) == 1 || TYPE(CHILD(ch, 1)) == COMMA) {\n asdl_seq *elts = seq_for_testlist(c, ch);\n if (!elts)\n return NULL;\n\n return List(elts, Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else\n return ast_for_listcomp(c, ch);\n case LBRACE: {\n /* dictorsetmaker: ( ((test ':' test | '**' test)\n * (comp_for | (',' (test ':' test | '**' test))* [','])) |\n * ((test | '*' test)\n * (comp_for | (',' (test | '*' test))* [','])) ) */\n expr_ty res;\n ch = CHILD(n, 1);\n if (TYPE(ch) == RBRACE) {\n /* It's an empty dict. */\n return Dict(NULL, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else {\n int is_dict = (TYPE(CHILD(ch, 0)) == DOUBLESTAR);\n if (NCH(ch) == 1 ||\n (NCH(ch) > 1 &&\n TYPE(CHILD(ch, 1)) == COMMA)) {\n /* It's a set display. */\n res = ast_for_setdisplay(c, ch);\n }\n else if (NCH(ch) > 1 &&\n TYPE(CHILD(ch, 1)) == comp_for) {\n /* It's a set comprehension. */\n res = ast_for_setcomp(c, ch);\n }\n else if (NCH(ch) > 3 - is_dict &&\n TYPE(CHILD(ch, 3 - is_dict)) == comp_for) {\n /* It's a dictionary comprehension. */\n if (is_dict) {\n ast_error(c, n, \"dict unpacking cannot be used in \"\n \"dict comprehension\");\n return NULL;\n }\n res = ast_for_dictcomp(c, ch);\n }\n else {\n /* It's a dictionary display. */\n res = ast_for_dictdisplay(c, ch);\n }\n if (res) {\n res->lineno = LINENO(n);\n res->col_offset = n->n_col_offset;\n }\n return res;\n }\n }\n default:\n PyErr_Format(PyExc_SystemError, \"unhandled atom %d\", TYPE(ch));\n return NULL;\n }\n}\n\nstatic slice_ty\nast_for_slice(struct compiling *c, const node *n)\n{\n node *ch;\n expr_ty lower = NULL, upper = NULL, step = NULL;\n\n REQ(n, subscript);\n\n /*\n subscript: test | [test] ':' [test] [sliceop]\n sliceop: ':' [test]\n */\n ch = CHILD(n, 0);\n if (NCH(n) == 1 && TYPE(ch) == test) {\n /* 'step' variable hold no significance in terms of being used over\n other vars */\n step = ast_for_expr(c, ch);\n if (!step)\n return NULL;\n\n return Index(step, c->c_arena);\n }\n\n if (TYPE(ch) == test) {\n lower = ast_for_expr(c, ch);\n if (!lower)\n return NULL;\n }\n\n /* If there's an upper bound it's in the second or third position. */\n if (TYPE(ch) == COLON) {\n if (NCH(n) > 1) {\n node *n2 = CHILD(n, 1);\n\n if (TYPE(n2) == test) {\n upper = ast_for_expr(c, n2);\n if (!upper)\n return NULL;\n }\n }\n } else if (NCH(n) > 2) {\n node *n2 = CHILD(n, 2);\n\n if (TYPE(n2) == test) {\n upper = ast_for_expr(c, n2);\n if (!upper)\n return NULL;\n }\n }\n\n ch = CHILD(n, NCH(n) - 1);\n if (TYPE(ch) == sliceop) {\n if (NCH(ch) != 1) {\n ch = CHILD(ch, 1);\n if (TYPE(ch) == test) {\n step = ast_for_expr(c, ch);\n if (!step)\n return NULL;\n }\n }\n }\n\n return Slice(lower, upper, step, c->c_arena);\n}\n\nstatic expr_ty\nast_for_binop(struct compiling *c, const node *n)\n{\n /* Must account for a sequence of expressions.\n How should A op B op C by represented?\n BinOp(BinOp(A, op, B), op, C).\n */\n\n int i, nops;\n expr_ty expr1, expr2, result;\n operator_ty newoperator;\n\n expr1 = ast_for_expr(c, CHILD(n, 0));\n if (!expr1)\n return NULL;\n\n expr2 = ast_for_expr(c, CHILD(n, 2));\n if (!expr2)\n return NULL;\n\n newoperator = get_operator(c, CHILD(n, 1));\n if (!newoperator)\n return NULL;\n\n result = BinOp(expr1, newoperator, expr2, LINENO(n), n->n_col_offset,\n c->c_arena);\n if (!result)\n return NULL;\n\n nops = (NCH(n) - 1) / 2;\n for (i = 1; i < nops; i++) {\n expr_ty tmp_result, tmp;\n const node* next_oper = CHILD(n, i * 2 + 1);\n\n newoperator = get_operator(c, next_oper);\n if (!newoperator)\n return NULL;\n\n tmp = ast_for_expr(c, CHILD(n, i * 2 + 2));\n if (!tmp)\n return NULL;\n\n tmp_result = BinOp(result, newoperator, tmp,\n LINENO(next_oper), next_oper->n_col_offset,\n c->c_arena);\n if (!tmp_result)\n return NULL;\n result = tmp_result;\n }\n return result;\n}\n\nstatic expr_ty\nast_for_trailer(struct compiling *c, const node *n, expr_ty left_expr)\n{\n /* trailer: '(' [arglist] ')' | '[' subscriptlist ']' | '.' NAME\n subscriptlist: subscript (',' subscript)* [',']\n subscript: '.' '.' '.' | test | [test] ':' [test] [sliceop]\n */\n REQ(n, trailer);\n if (TYPE(CHILD(n, 0)) == LPAR) {\n if (NCH(n) == 2)\n return Call(left_expr, NULL, NULL, LINENO(n),\n n->n_col_offset, c->c_arena);\n else\n return ast_for_call(c, CHILD(n, 1), left_expr);\n }\n else if (TYPE(CHILD(n, 0)) == DOT) {\n PyObject *attr_id = NEW_IDENTIFIER(CHILD(n, 1));\n if (!attr_id)\n return NULL;\n return Attribute(left_expr, attr_id, Load,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n else {\n REQ(CHILD(n, 0), LSQB);\n REQ(CHILD(n, 2), RSQB);\n n = CHILD(n, 1);\n if (NCH(n) == 1) {\n slice_ty slc = ast_for_slice(c, CHILD(n, 0));\n if (!slc)\n return NULL;\n return Subscript(left_expr, slc, Load, LINENO(n), n->n_col_offset,\n c->c_arena);\n }\n else {\n /* The grammar is ambiguous here. The ambiguity is resolved\n by treating the sequence as a tuple literal if there are\n no slice features.\n */\n int j;\n slice_ty slc;\n expr_ty e;\n int simple = 1;\n asdl_seq *slices, *elts;\n slices = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!slices)\n return NULL;\n for (j = 0; j < NCH(n); j += 2) {\n slc = ast_for_slice(c, CHILD(n, j));\n if (!slc)\n return NULL;\n if (slc->kind != Index_kind)\n simple = 0;\n asdl_seq_SET(slices, j / 2, slc);\n }\n if (!simple) {\n return Subscript(left_expr, ExtSlice(slices, c->c_arena),\n Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n /* extract Index values and put them in a Tuple */\n elts = _Ta3_asdl_seq_new(asdl_seq_LEN(slices), c->c_arena);\n if (!elts)\n return NULL;\n for (j = 0; j < asdl_seq_LEN(slices); ++j) {\n slc = (slice_ty)asdl_seq_GET(slices, j);\n assert(slc->kind == Index_kind && slc->v.Index.value);\n asdl_seq_SET(elts, j, slc->v.Index.value);\n }\n e = Tuple(elts, Load, LINENO(n), n->n_col_offset, c->c_arena);\n if (!e)\n return NULL;\n return Subscript(left_expr, Index(e, c->c_arena),\n Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n }\n}\n\nstatic expr_ty\nast_for_factor(struct compiling *c, const node *n)\n{\n expr_ty expression;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n\n switch (TYPE(CHILD(n, 0))) {\n case PLUS:\n return UnaryOp(UAdd, expression, LINENO(n), n->n_col_offset,\n c->c_arena);\n case MINUS:\n return UnaryOp(USub, expression, LINENO(n), n->n_col_offset,\n c->c_arena);\n case TILDE:\n return UnaryOp(Invert, expression, LINENO(n),\n n->n_col_offset, c->c_arena);\n }\n PyErr_Format(PyExc_SystemError, \"unhandled factor: %d\",\n TYPE(CHILD(n, 0)));\n return NULL;\n}\n\nstatic expr_ty\nast_for_atom_expr(struct compiling *c, const node *n)\n{\n int i, nch, start = 0;\n expr_ty e, tmp;\n\n REQ(n, atom_expr);\n nch = NCH(n);\n\n if (TYPE(CHILD(n, 0)) == AWAIT) {\n if (c->c_feature_version < 5) {\n ast_error(c, n,\n \"Await expressions are only supported in Python 3.5 and greater\");\n return NULL;\n }\n start = 1;\n assert(nch > 1);\n }\n\n e = ast_for_atom(c, CHILD(n, start));\n if (!e)\n return NULL;\n if (nch == 1)\n return e;\n if (start && nch == 2) {\n return Await(e, LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n for (i = start + 1; i < nch; i++) {\n node *ch = CHILD(n, i);\n if (TYPE(ch) != trailer)\n break;\n tmp = ast_for_trailer(c, ch, e);\n if (!tmp)\n return NULL;\n tmp->lineno = e->lineno;\n tmp->col_offset = e->col_offset;\n e = tmp;\n }\n\n if (start) {\n /* there was an AWAIT */\n return Await(e, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else {\n return e;\n }\n}\n\nstatic expr_ty\nast_for_power(struct compiling *c, const node *n)\n{\n /* power: atom trailer* ('**' factor)*\n */\n expr_ty e;\n REQ(n, power);\n e = ast_for_atom_expr(c, CHILD(n, 0));\n if (!e)\n return NULL;\n if (NCH(n) == 1)\n return e;\n if (TYPE(CHILD(n, NCH(n) - 1)) == factor) {\n expr_ty f = ast_for_expr(c, CHILD(n, NCH(n) - 1));\n if (!f)\n return NULL;\n e = BinOp(e, Pow, f, LINENO(n), n->n_col_offset, c->c_arena);\n }\n return e;\n}\n\nstatic expr_ty\nast_for_starred(struct compiling *c, const node *n)\n{\n expr_ty tmp;\n REQ(n, star_expr);\n\n tmp = ast_for_expr(c, CHILD(n, 1));\n if (!tmp)\n return NULL;\n\n /* The Load context is changed later. */\n return Starred(tmp, Load, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\n\n/* Do not name a variable 'expr'! Will cause a compile error.\n*/\n\nstatic expr_ty\nast_for_expr(struct compiling *c, const node *n)\n{\n /* handle the full range of simple expressions\n test: or_test ['if' or_test 'else' test] | lambdef\n test_nocond: or_test | lambdef_nocond\n or_test: and_test ('or' and_test)*\n and_test: not_test ('and' not_test)*\n not_test: 'not' not_test | comparison\n comparison: expr (comp_op expr)*\n expr: xor_expr ('|' xor_expr)*\n xor_expr: and_expr ('^' and_expr)*\n and_expr: shift_expr ('&' shift_expr)*\n shift_expr: arith_expr (('<<'|'>>') arith_expr)*\n arith_expr: term (('+'|'-') term)*\n term: factor (('*'|'@'|'/'|'%'|'//') factor)*\n factor: ('+'|'-'|'~') factor | power\n power: atom_expr ['**' factor]\n atom_expr: [AWAIT] atom trailer*\n yield_expr: 'yield' [yield_arg]\n */\n\n asdl_seq *seq;\n int i;\n\n loop:\n switch (TYPE(n)) {\n case test:\n case test_nocond:\n if (TYPE(CHILD(n, 0)) == lambdef ||\n TYPE(CHILD(n, 0)) == lambdef_nocond)\n return ast_for_lambdef(c, CHILD(n, 0));\n else if (NCH(n) > 1)\n return ast_for_ifexpr(c, n);\n /* Fallthrough */\n case or_test:\n case and_test:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n seq = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!seq)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n expr_ty e = ast_for_expr(c, CHILD(n, i));\n if (!e)\n return NULL;\n asdl_seq_SET(seq, i / 2, e);\n }\n if (!strcmp(STR(CHILD(n, 1)), \"and\"))\n return BoolOp(And, seq, LINENO(n), n->n_col_offset,\n c->c_arena);\n assert(!strcmp(STR(CHILD(n, 1)), \"or\"));\n return BoolOp(Or, seq, LINENO(n), n->n_col_offset, c->c_arena);\n case not_test:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n else {\n expr_ty expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n\n return UnaryOp(Not, expression, LINENO(n), n->n_col_offset,\n c->c_arena);\n }\n case comparison:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n else {\n expr_ty expression;\n asdl_int_seq *ops;\n asdl_seq *cmps;\n ops = _Ta3_asdl_int_seq_new(NCH(n) / 2, c->c_arena);\n if (!ops)\n return NULL;\n cmps = _Ta3_asdl_seq_new(NCH(n) / 2, c->c_arena);\n if (!cmps) {\n return NULL;\n }\n for (i = 1; i < NCH(n); i += 2) {\n cmpop_ty newoperator;\n\n newoperator = ast_for_comp_op(c, CHILD(n, i));\n if (!newoperator) {\n return NULL;\n }\n\n expression = ast_for_expr(c, CHILD(n, i + 1));\n if (!expression) {\n return NULL;\n }\n\n asdl_seq_SET(ops, i / 2, newoperator);\n asdl_seq_SET(cmps, i / 2, expression);\n }\n expression = ast_for_expr(c, CHILD(n, 0));\n if (!expression) {\n return NULL;\n }\n\n return Compare(expression, ops, cmps, LINENO(n),\n n->n_col_offset, c->c_arena);\n }\n break;\n\n case star_expr:\n return ast_for_starred(c, n);\n /* The next five cases all handle BinOps. The main body of code\n is the same in each case, but the switch turned inside out to\n reuse the code for each type of operator.\n */\n case expr:\n case xor_expr:\n case and_expr:\n case shift_expr:\n case arith_expr:\n case term:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n return ast_for_binop(c, n);\n case yield_expr: {\n node *an = NULL;\n node *en = NULL;\n int is_from = 0;\n expr_ty exp = NULL;\n if (NCH(n) > 1)\n an = CHILD(n, 1); /* yield_arg */\n if (an) {\n en = CHILD(an, NCH(an) - 1);\n if (NCH(an) == 2) {\n is_from = 1;\n exp = ast_for_expr(c, en);\n }\n else\n exp = ast_for_testlist(c, en);\n if (!exp)\n return NULL;\n }\n if (is_from)\n return YieldFrom(exp, LINENO(n), n->n_col_offset, c->c_arena);\n return Yield(exp, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case factor:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n return ast_for_factor(c, n);\n case power:\n return ast_for_power(c, n);\n default:\n PyErr_Format(PyExc_SystemError, \"unhandled expr: %d\", TYPE(n));\n return NULL;\n }\n /* should never get here unless if error is set */\n return NULL;\n}\n\nstatic expr_ty\nast_for_call(struct compiling *c, const node *n, expr_ty func)\n{\n /*\n arglist: argument (',' argument)* [',']\n argument: ( test [comp_for] | '*' test | test '=' test | '**' test )\n */\n\n int i, nargs, nkeywords, ngens;\n int ndoublestars;\n asdl_seq *args;\n asdl_seq *keywords;\n\n REQ(n, arglist);\n\n nargs = 0;\n nkeywords = 0;\n ngens = 0;\n for (i = 0; i < NCH(n); i++) {\n node *ch = CHILD(n, i);\n if (TYPE(ch) == argument) {\n if (NCH(ch) == 1)\n nargs++;\n else if (TYPE(CHILD(ch, 1)) == comp_for)\n ngens++;\n else if (TYPE(CHILD(ch, 0)) == STAR)\n nargs++;\n else\n /* TYPE(CHILD(ch, 0)) == DOUBLESTAR or keyword argument */\n nkeywords++;\n }\n }\n if (ngens > 1 || (ngens && (nargs || nkeywords))) {\n ast_error(c, n, \"Generator expression must be parenthesized \"\n \"if not sole argument\");\n return NULL;\n }\n\n if (nargs + nkeywords + ngens > 255) {\n ast_error(c, n, \"more than 255 arguments\");\n return NULL;\n }\n\n args = _Ta3_asdl_seq_new(nargs + ngens, c->c_arena);\n if (!args)\n return NULL;\n keywords = _Ta3_asdl_seq_new(nkeywords, c->c_arena);\n if (!keywords)\n return NULL;\n\n nargs = 0; /* positional arguments + iterable argument unpackings */\n nkeywords = 0; /* keyword arguments + keyword argument unpackings */\n ndoublestars = 0; /* just keyword argument unpackings */\n for (i = 0; i < NCH(n); i++) {\n node *ch = CHILD(n, i);\n if (TYPE(ch) == argument) {\n expr_ty e;\n node *chch = CHILD(ch, 0);\n if (NCH(ch) == 1) {\n /* a positional argument */\n if (nkeywords) {\n if (ndoublestars) {\n ast_error(c, chch,\n \"positional argument follows \"\n \"keyword argument unpacking\");\n }\n else {\n ast_error(c, chch,\n \"positional argument follows \"\n \"keyword argument\");\n }\n return NULL;\n }\n e = ast_for_expr(c, chch);\n if (!e)\n return NULL;\n asdl_seq_SET(args, nargs++, e);\n }\n else if (TYPE(chch) == STAR) {\n /* an iterable argument unpacking */\n expr_ty starred;\n if (ndoublestars) {\n ast_error(c, chch,\n \"iterable argument unpacking follows \"\n \"keyword argument unpacking\");\n return NULL;\n }\n e = ast_for_expr(c, CHILD(ch, 1));\n if (!e)\n return NULL;\n starred = Starred(e, Load, LINENO(chch),\n chch->n_col_offset,\n c->c_arena);\n if (!starred)\n return NULL;\n asdl_seq_SET(args, nargs++, starred);\n\n }\n else if (TYPE(chch) == DOUBLESTAR) {\n /* a keyword argument unpacking */\n keyword_ty kw;\n i++;\n e = ast_for_expr(c, CHILD(ch, 1));\n if (!e)\n return NULL;\n kw = keyword(NULL, e, c->c_arena);\n asdl_seq_SET(keywords, nkeywords++, kw);\n ndoublestars++;\n }\n else if (TYPE(CHILD(ch, 1)) == comp_for) {\n /* the lone generator expression */\n e = ast_for_genexp(c, ch);\n if (!e)\n return NULL;\n asdl_seq_SET(args, nargs++, e);\n }\n else {\n /* a keyword argument */\n keyword_ty kw;\n identifier key, tmp;\n int k;\n\n /* chch is test, but must be an identifier? */\n e = ast_for_expr(c, chch);\n if (!e)\n return NULL;\n /* f(lambda x: x[0] = 3) ends up getting parsed with\n * LHS test = lambda x: x[0], and RHS test = 3.\n * SF bug 132313 points out that complaining about a keyword\n * then is very confusing.\n */\n if (e->kind == Lambda_kind) {\n ast_error(c, chch,\n \"lambda cannot contain assignment\");\n return NULL;\n }\n else if (e->kind != Name_kind) {\n ast_error(c, chch,\n \"keyword can't be an expression\");\n return NULL;\n }\n else if (forbidden_name(c, e->v.Name.id, ch, 1)) {\n return NULL;\n }\n key = e->v.Name.id;\n for (k = 0; k < nkeywords; k++) {\n tmp = ((keyword_ty)asdl_seq_GET(keywords, k))->arg;\n if (tmp && !PyUnicode_Compare(tmp, key)) {\n ast_error(c, chch,\n \"keyword argument repeated\");\n return NULL;\n }\n }\n e = ast_for_expr(c, CHILD(ch, 2));\n if (!e)\n return NULL;\n kw = keyword(key, e, c->c_arena);\n if (!kw)\n return NULL;\n asdl_seq_SET(keywords, nkeywords++, kw);\n }\n }\n }\n\n return Call(func, args, keywords, func->lineno, func->col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_testlist(struct compiling *c, const node* n)\n{\n /* testlist_comp: test (comp_for | (',' test)* [',']) */\n /* testlist: test (',' test)* [','] */\n assert(NCH(n) > 0);\n if (TYPE(n) == testlist_comp) {\n if (NCH(n) > 1)\n assert(TYPE(CHILD(n, 1)) != comp_for);\n }\n else {\n assert(TYPE(n) == testlist ||\n TYPE(n) == testlist_star_expr);\n }\n if (NCH(n) == 1)\n return ast_for_expr(c, CHILD(n, 0));\n else {\n asdl_seq *tmp = seq_for_testlist(c, n);\n if (!tmp)\n return NULL;\n return Tuple(tmp, Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n}\n\nstatic stmt_ty\nast_for_expr_stmt(struct compiling *c, const node *n)\n{\n int num;\n REQ(n, expr_stmt);\n /* expr_stmt: testlist_star_expr (annassign | augassign (yield_expr|testlist) |\n ('=' (yield_expr|testlist_star_expr))* [TYPE_COMMENT])\n annassign: ':' test ['=' test]\n testlist_star_expr: (test|star_expr) (',' test|star_expr)* [',']\n augassign: '+=' | '-=' | '*=' | '@=' | '/=' | '%=' | '&=' | '|=' | '^='\n | '<<=' | '>>=' | '**=' | '//='\n test: ... here starts the operator precedence dance\n */\n num = NCH(n);\n\n if (num == 1 || (num == 2 && TYPE(CHILD(n, 1)) == TYPE_COMMENT)) {\n expr_ty e = ast_for_testlist(c, CHILD(n, 0));\n if (!e)\n return NULL;\n\n return Expr(e, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else if (TYPE(CHILD(n, 1)) == augassign) {\n expr_ty expr1, expr2;\n operator_ty newoperator;\n node *ch = CHILD(n, 0);\n\n expr1 = ast_for_testlist(c, ch);\n if (!expr1)\n return NULL;\n if(!set_context(c, expr1, Store, ch))\n return NULL;\n /* set_context checks that most expressions are not the left side.\n Augmented assignments can only have a name, a subscript, or an\n attribute on the left, though, so we have to explicitly check for\n those. */\n switch (expr1->kind) {\n case Name_kind:\n case Attribute_kind:\n case Subscript_kind:\n break;\n default:\n ast_error(c, ch, \"illegal expression for augmented assignment\");\n return NULL;\n }\n\n ch = CHILD(n, 2);\n if (TYPE(ch) == testlist)\n expr2 = ast_for_testlist(c, ch);\n else\n expr2 = ast_for_expr(c, ch);\n if (!expr2)\n return NULL;\n\n newoperator = ast_for_augassign(c, CHILD(n, 1));\n if (!newoperator)\n return NULL;\n\n return AugAssign(expr1, newoperator, expr2, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else if (TYPE(CHILD(n, 1)) == annassign) {\n expr_ty expr1, expr2, expr3;\n node *ch = CHILD(n, 0);\n node *deep, *ann = CHILD(n, 1);\n int simple = 1;\n\n /* AnnAssigns are only allowed in Python 3.6 or greater */\n if (c->c_feature_version < 6) {\n ast_error(c, ch,\n \"Variable annotation syntax is only supported in Python 3.6 and greater\");\n return NULL;\n }\n\n /* we keep track of parens to qualify (x) as expression not name */\n deep = ch;\n while (NCH(deep) == 1) {\n deep = CHILD(deep, 0);\n }\n if (NCH(deep) > 0 && TYPE(CHILD(deep, 0)) == LPAR) {\n simple = 0;\n }\n expr1 = ast_for_testlist(c, ch);\n if (!expr1) {\n return NULL;\n }\n switch (expr1->kind) {\n case Name_kind:\n if (forbidden_name(c, expr1->v.Name.id, n, 0)) {\n return NULL;\n }\n expr1->v.Name.ctx = Store;\n break;\n case Attribute_kind:\n if (forbidden_name(c, expr1->v.Attribute.attr, n, 1)) {\n return NULL;\n }\n expr1->v.Attribute.ctx = Store;\n break;\n case Subscript_kind:\n expr1->v.Subscript.ctx = Store;\n break;\n case List_kind:\n ast_error(c, ch,\n \"only single target (not list) can be annotated\");\n return NULL;\n case Tuple_kind:\n ast_error(c, ch,\n \"only single target (not tuple) can be annotated\");\n return NULL;\n default:\n ast_error(c, ch,\n \"illegal target for annotation\");\n return NULL;\n }\n\n if (expr1->kind != Name_kind) {\n simple = 0;\n }\n ch = CHILD(ann, 1);\n expr2 = ast_for_expr(c, ch);\n if (!expr2) {\n return NULL;\n }\n if (NCH(ann) == 2) {\n return AnnAssign(expr1, expr2, NULL, simple,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n else {\n ch = CHILD(ann, 3);\n expr3 = ast_for_expr(c, ch);\n if (!expr3) {\n return NULL;\n }\n return AnnAssign(expr1, expr2, expr3, simple,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n }\n else {\n int i, nch_minus_type, has_type_comment;\n asdl_seq *targets;\n node *value;\n expr_ty expression;\n string type_comment;\n\n /* a normal assignment */\n REQ(CHILD(n, 1), EQUAL);\n\n has_type_comment = TYPE(CHILD(n, num - 1)) == TYPE_COMMENT;\n nch_minus_type = num - has_type_comment;\n\n targets = _Ta3_asdl_seq_new(nch_minus_type / 2, c->c_arena);\n if (!targets)\n return NULL;\n for (i = 0; i < nch_minus_type - 2; i += 2) {\n expr_ty e;\n node *ch = CHILD(n, i);\n if (TYPE(ch) == yield_expr) {\n ast_error(c, ch, \"assignment to yield expression not possible\");\n return NULL;\n }\n e = ast_for_testlist(c, ch);\n if (!e)\n return NULL;\n\n /* set context to assign */\n if (!set_context(c, e, Store, CHILD(n, i)))\n return NULL;\n\n asdl_seq_SET(targets, i / 2, e);\n }\n value = CHILD(n, nch_minus_type - 1);\n if (TYPE(value) == testlist_star_expr)\n expression = ast_for_testlist(c, value);\n else\n expression = ast_for_expr(c, value);\n if (!expression)\n return NULL;\n if (has_type_comment)\n type_comment = NEW_TYPE_COMMENT(CHILD(n, nch_minus_type));\n else\n type_comment = NULL;\n return Assign(targets, expression, type_comment, LINENO(n), n->n_col_offset, c->c_arena);\n }\n}\n\n\nstatic asdl_seq *\nast_for_exprlist(struct compiling *c, const node *n, expr_context_ty context)\n{\n asdl_seq *seq;\n int i;\n expr_ty e;\n\n REQ(n, exprlist);\n\n seq = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!seq)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n e = ast_for_expr(c, CHILD(n, i));\n if (!e)\n return NULL;\n asdl_seq_SET(seq, i / 2, e);\n if (context && !set_context(c, e, context, CHILD(n, i)))\n return NULL;\n }\n return seq;\n}\n\nstatic stmt_ty\nast_for_del_stmt(struct compiling *c, const node *n)\n{\n asdl_seq *expr_list;\n\n /* del_stmt: 'del' exprlist */\n REQ(n, del_stmt);\n\n expr_list = ast_for_exprlist(c, CHILD(n, 1), Del);\n if (!expr_list)\n return NULL;\n return Delete(expr_list, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_flow_stmt(struct compiling *c, const node *n)\n{\n /*\n flow_stmt: break_stmt | continue_stmt | return_stmt | raise_stmt\n | yield_stmt\n break_stmt: 'break'\n continue_stmt: 'continue'\n return_stmt: 'return' [testlist]\n yield_stmt: yield_expr\n yield_expr: 'yield' testlist | 'yield' 'from' test\n raise_stmt: 'raise' [test [',' test [',' test]]]\n */\n node *ch;\n\n REQ(n, flow_stmt);\n ch = CHILD(n, 0);\n switch (TYPE(ch)) {\n case break_stmt:\n return Break(LINENO(n), n->n_col_offset, c->c_arena);\n case continue_stmt:\n return Continue(LINENO(n), n->n_col_offset, c->c_arena);\n case yield_stmt: { /* will reduce to yield_expr */\n expr_ty exp = ast_for_expr(c, CHILD(ch, 0));\n if (!exp)\n return NULL;\n return Expr(exp, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case return_stmt:\n if (NCH(ch) == 1)\n return Return(NULL, LINENO(n), n->n_col_offset, c->c_arena);\n else {\n expr_ty expression = ast_for_testlist(c, CHILD(ch, 1));\n if (!expression)\n return NULL;\n return Return(expression, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case raise_stmt:\n if (NCH(ch) == 1)\n return Raise(NULL, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n else if (NCH(ch) >= 2) {\n expr_ty cause = NULL;\n expr_ty expression = ast_for_expr(c, CHILD(ch, 1));\n if (!expression)\n return NULL;\n if (NCH(ch) == 4) {\n cause = ast_for_expr(c, CHILD(ch, 3));\n if (!cause)\n return NULL;\n }\n return Raise(expression, cause, LINENO(n), n->n_col_offset, c->c_arena);\n }\n default:\n PyErr_Format(PyExc_SystemError,\n \"unexpected flow_stmt: %d\", TYPE(ch));\n return NULL;\n }\n}\n\nstatic alias_ty\nalias_for_import_name(struct compiling *c, const node *n, int store)\n{\n /*\n import_as_name: NAME ['as' NAME]\n dotted_as_name: dotted_name ['as' NAME]\n dotted_name: NAME ('.' NAME)*\n */\n identifier str, name;\n\n loop:\n switch (TYPE(n)) {\n case import_as_name: {\n node *name_node = CHILD(n, 0);\n str = NULL;\n name = NEW_IDENTIFIER(name_node);\n if (!name)\n return NULL;\n if (NCH(n) == 3) {\n node *str_node = CHILD(n, 2);\n str = NEW_IDENTIFIER(str_node);\n if (!str)\n return NULL;\n if (store && forbidden_name(c, str, str_node, 0))\n return NULL;\n }\n else {\n if (forbidden_name(c, name, name_node, 0))\n return NULL;\n }\n return alias(name, str, c->c_arena);\n }\n case dotted_as_name:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n else {\n node *asname_node = CHILD(n, 2);\n alias_ty a = alias_for_import_name(c, CHILD(n, 0), 0);\n if (!a)\n return NULL;\n assert(!a->asname);\n a->asname = NEW_IDENTIFIER(asname_node);\n if (!a->asname)\n return NULL;\n if (forbidden_name(c, a->asname, asname_node, 0))\n return NULL;\n return a;\n }\n break;\n case dotted_name:\n if (NCH(n) == 1) {\n node *name_node = CHILD(n, 0);\n name = NEW_IDENTIFIER(name_node);\n if (!name)\n return NULL;\n if (store && forbidden_name(c, name, name_node, 0))\n return NULL;\n return alias(name, NULL, c->c_arena);\n }\n else {\n /* Create a string of the form \"a.b.c\" */\n int i;\n size_t len;\n char *s;\n PyObject *uni;\n\n len = 0;\n for (i = 0; i < NCH(n); i += 2)\n /* length of string plus one for the dot */\n len += strlen(STR(CHILD(n, i))) + 1;\n len--; /* the last name doesn't have a dot */\n str = PyBytes_FromStringAndSize(NULL, len);\n if (!str)\n return NULL;\n s = PyBytes_AS_STRING(str);\n if (!s)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n char *sch = STR(CHILD(n, i));\n strcpy(s, STR(CHILD(n, i)));\n s += strlen(sch);\n *s++ = '.';\n }\n --s;\n *s = '\\0';\n uni = PyUnicode_DecodeUTF8(PyBytes_AS_STRING(str),\n PyBytes_GET_SIZE(str),\n NULL);\n Py_DECREF(str);\n if (!uni)\n return NULL;\n str = uni;\n PyUnicode_InternInPlace(&str);\n if (PyArena_AddPyObject(c->c_arena, str) < 0) {\n Py_DECREF(str);\n return NULL;\n }\n return alias(str, NULL, c->c_arena);\n }\n break;\n case STAR:\n str = PyUnicode_InternFromString(\"*\");\n if (PyArena_AddPyObject(c->c_arena, str) < 0) {\n Py_DECREF(str);\n return NULL;\n }\n return alias(str, NULL, c->c_arena);\n default:\n PyErr_Format(PyExc_SystemError,\n \"unexpected import name: %d\", TYPE(n));\n return NULL;\n }\n\n PyErr_SetString(PyExc_SystemError, \"unhandled import name condition\");\n return NULL;\n}\n\nstatic stmt_ty\nast_for_import_stmt(struct compiling *c, const node *n)\n{\n /*\n import_stmt: import_name | import_from\n import_name: 'import' dotted_as_names\n import_from: 'from' (('.' | '...')* dotted_name | ('.' | '...')+)\n 'import' ('*' | '(' import_as_names ')' | import_as_names)\n */\n int lineno;\n int col_offset;\n int i;\n asdl_seq *aliases;\n\n REQ(n, import_stmt);\n lineno = LINENO(n);\n col_offset = n->n_col_offset;\n n = CHILD(n, 0);\n if (TYPE(n) == import_name) {\n n = CHILD(n, 1);\n REQ(n, dotted_as_names);\n aliases = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!aliases)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n alias_ty import_alias = alias_for_import_name(c, CHILD(n, i), 1);\n if (!import_alias)\n return NULL;\n asdl_seq_SET(aliases, i / 2, import_alias);\n }\n return Import(aliases, lineno, col_offset, c->c_arena);\n }\n else if (TYPE(n) == import_from) {\n int n_children;\n int idx, ndots = 0;\n alias_ty mod = NULL;\n identifier modname = NULL;\n\n /* Count the number of dots (for relative imports) and check for the\n optional module name */\n for (idx = 1; idx < NCH(n); idx++) {\n if (TYPE(CHILD(n, idx)) == dotted_name) {\n mod = alias_for_import_name(c, CHILD(n, idx), 0);\n if (!mod)\n return NULL;\n idx++;\n break;\n } else if (TYPE(CHILD(n, idx)) == ELLIPSIS) {\n /* three consecutive dots are tokenized as one ELLIPSIS */\n ndots += 3;\n continue;\n } else if (TYPE(CHILD(n, idx)) != DOT) {\n break;\n }\n ndots++;\n }\n idx++; /* skip over the 'import' keyword */\n switch (TYPE(CHILD(n, idx))) {\n case STAR:\n /* from ... import * */\n n = CHILD(n, idx);\n n_children = 1;\n break;\n case LPAR:\n /* from ... import (x, y, z) */\n n = CHILD(n, idx + 1);\n n_children = NCH(n);\n break;\n case import_as_names:\n /* from ... import x, y, z */\n n = CHILD(n, idx);\n n_children = NCH(n);\n if (n_children % 2 == 0) {\n ast_error(c, n, \"trailing comma not allowed without\"\n \" surrounding parentheses\");\n return NULL;\n }\n break;\n default:\n ast_error(c, n, \"Unexpected node-type in from-import\");\n return NULL;\n }\n\n aliases = _Ta3_asdl_seq_new((n_children + 1) / 2, c->c_arena);\n if (!aliases)\n return NULL;\n\n /* handle \"from ... import *\" special b/c there's no children */\n if (TYPE(n) == STAR) {\n alias_ty import_alias = alias_for_import_name(c, n, 1);\n if (!import_alias)\n return NULL;\n asdl_seq_SET(aliases, 0, import_alias);\n }\n else {\n for (i = 0; i < NCH(n); i += 2) {\n alias_ty import_alias = alias_for_import_name(c, CHILD(n, i), 1);\n if (!import_alias)\n return NULL;\n asdl_seq_SET(aliases, i / 2, import_alias);\n }\n }\n if (mod != NULL)\n modname = mod->name;\n return ImportFrom(modname, aliases, ndots, lineno, col_offset,\n c->c_arena);\n }\n PyErr_Format(PyExc_SystemError,\n \"unknown import statement: starts with command '%s'\",\n STR(CHILD(n, 0)));\n return NULL;\n}\n\nstatic stmt_ty\nast_for_global_stmt(struct compiling *c, const node *n)\n{\n /* global_stmt: 'global' NAME (',' NAME)* */\n identifier name;\n asdl_seq *s;\n int i;\n\n REQ(n, global_stmt);\n s = _Ta3_asdl_seq_new(NCH(n) / 2, c->c_arena);\n if (!s)\n return NULL;\n for (i = 1; i < NCH(n); i += 2) {\n name = NEW_IDENTIFIER(CHILD(n, i));\n if (!name)\n return NULL;\n asdl_seq_SET(s, i / 2, name);\n }\n return Global(s, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_nonlocal_stmt(struct compiling *c, const node *n)\n{\n /* nonlocal_stmt: 'nonlocal' NAME (',' NAME)* */\n identifier name;\n asdl_seq *s;\n int i;\n\n REQ(n, nonlocal_stmt);\n s = _Ta3_asdl_seq_new(NCH(n) / 2, c->c_arena);\n if (!s)\n return NULL;\n for (i = 1; i < NCH(n); i += 2) {\n name = NEW_IDENTIFIER(CHILD(n, i));\n if (!name)\n return NULL;\n asdl_seq_SET(s, i / 2, name);\n }\n return Nonlocal(s, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_assert_stmt(struct compiling *c, const node *n)\n{\n /* assert_stmt: 'assert' test [',' test] */\n REQ(n, assert_stmt);\n if (NCH(n) == 2) {\n expr_ty expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n return Assert(expression, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else if (NCH(n) == 4) {\n expr_ty expr1, expr2;\n\n expr1 = ast_for_expr(c, CHILD(n, 1));\n if (!expr1)\n return NULL;\n expr2 = ast_for_expr(c, CHILD(n, 3));\n if (!expr2)\n return NULL;\n\n return Assert(expr1, expr2, LINENO(n), n->n_col_offset, c->c_arena);\n }\n PyErr_Format(PyExc_SystemError,\n \"improper number of parts to 'assert' statement: %d\",\n NCH(n));\n return NULL;\n}\n\nstatic asdl_seq *\nast_for_suite(struct compiling *c, const node *n)\n{\n /* suite: simple_stmt | NEWLINE [TYPE_COMMENT NEWLINE] INDENT stmt+ DEDENT */\n asdl_seq *seq;\n stmt_ty s;\n int i, total, num, end, pos = 0;\n node *ch;\n\n REQ(n, suite);\n\n total = num_stmts(n);\n seq = _Ta3_asdl_seq_new(total, c->c_arena);\n if (!seq)\n return NULL;\n if (TYPE(CHILD(n, 0)) == simple_stmt) {\n n = CHILD(n, 0);\n /* simple_stmt always ends with a NEWLINE,\n and may have a trailing SEMI\n */\n end = NCH(n) - 1;\n if (TYPE(CHILD(n, end - 1)) == SEMI)\n end--;\n /* loop by 2 to skip semi-colons */\n for (i = 0; i < end; i += 2) {\n ch = CHILD(n, i);\n s = ast_for_stmt(c, ch);\n if (!s)\n return NULL;\n asdl_seq_SET(seq, pos++, s);\n }\n }\n else {\n i = 2;\n if (TYPE(CHILD(n, 1)) == TYPE_COMMENT)\n i += 2;\n\n for (; i < (NCH(n) - 1); i++) {\n ch = CHILD(n, i);\n REQ(ch, stmt);\n num = num_stmts(ch);\n if (num == 1) {\n /* small_stmt or compound_stmt with only one child */\n s = ast_for_stmt(c, ch);\n if (!s)\n return NULL;\n asdl_seq_SET(seq, pos++, s);\n }\n else {\n int j;\n ch = CHILD(ch, 0);\n REQ(ch, simple_stmt);\n for (j = 0; j < NCH(ch); j += 2) {\n /* statement terminates with a semi-colon ';' */\n if (NCH(CHILD(ch, j)) == 0) {\n assert((j + 1) == NCH(ch));\n break;\n }\n s = ast_for_stmt(c, CHILD(ch, j));\n if (!s)\n return NULL;\n asdl_seq_SET(seq, pos++, s);\n }\n }\n }\n }\n assert(pos == seq->size);\n return seq;\n}\n\nstatic stmt_ty\nast_for_if_stmt(struct compiling *c, const node *n)\n{\n /* if_stmt: 'if' test ':' suite ('elif' test ':' suite)*\n ['else' ':' suite]\n */\n char *s;\n\n REQ(n, if_stmt);\n\n if (NCH(n) == 4) {\n expr_ty expression;\n asdl_seq *suite_seq;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, 3));\n if (!suite_seq)\n return NULL;\n\n return If(expression, suite_seq, NULL, LINENO(n), n->n_col_offset,\n c->c_arena);\n }\n\n s = STR(CHILD(n, 4));\n /* s[2], the third character in the string, will be\n 's' for el_s_e, or\n 'i' for el_i_f\n */\n if (s[2] == 's') {\n expr_ty expression;\n asdl_seq *seq1, *seq2;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n seq1 = ast_for_suite(c, CHILD(n, 3));\n if (!seq1)\n return NULL;\n seq2 = ast_for_suite(c, CHILD(n, 6));\n if (!seq2)\n return NULL;\n\n return If(expression, seq1, seq2, LINENO(n), n->n_col_offset,\n c->c_arena);\n }\n else if (s[2] == 'i') {\n int i, n_elif, has_else = 0;\n expr_ty expression;\n asdl_seq *suite_seq;\n asdl_seq *orelse = NULL;\n n_elif = NCH(n) - 4;\n /* must reference the child n_elif+1 since 'else' token is third,\n not fourth, child from the end. */\n if (TYPE(CHILD(n, (n_elif + 1))) == NAME\n && STR(CHILD(n, (n_elif + 1)))[2] == 's') {\n has_else = 1;\n n_elif -= 3;\n }\n n_elif /= 4;\n\n if (has_else) {\n asdl_seq *suite_seq2;\n\n orelse = _Ta3_asdl_seq_new(1, c->c_arena);\n if (!orelse)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, NCH(n) - 6));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, NCH(n) - 4));\n if (!suite_seq)\n return NULL;\n suite_seq2 = ast_for_suite(c, CHILD(n, NCH(n) - 1));\n if (!suite_seq2)\n return NULL;\n\n asdl_seq_SET(orelse, 0,\n If(expression, suite_seq, suite_seq2,\n LINENO(CHILD(n, NCH(n) - 6)),\n CHILD(n, NCH(n) - 6)->n_col_offset,\n c->c_arena));\n /* the just-created orelse handled the last elif */\n n_elif--;\n }\n\n for (i = 0; i < n_elif; i++) {\n int off = 5 + (n_elif - i - 1) * 4;\n asdl_seq *newobj = _Ta3_asdl_seq_new(1, c->c_arena);\n if (!newobj)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, off));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, off + 2));\n if (!suite_seq)\n return NULL;\n\n asdl_seq_SET(newobj, 0,\n If(expression, suite_seq, orelse,\n LINENO(CHILD(n, off)),\n CHILD(n, off)->n_col_offset, c->c_arena));\n orelse = newobj;\n }\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, 3));\n if (!suite_seq)\n return NULL;\n return If(expression, suite_seq, orelse,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n PyErr_Format(PyExc_SystemError,\n \"unexpected token in 'if' statement: %s\", s);\n return NULL;\n}\n\nstatic stmt_ty\nast_for_while_stmt(struct compiling *c, const node *n)\n{\n /* while_stmt: 'while' test ':' suite ['else' ':' suite] */\n REQ(n, while_stmt);\n\n if (NCH(n) == 4) {\n expr_ty expression;\n asdl_seq *suite_seq;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, 3));\n if (!suite_seq)\n return NULL;\n return While(expression, suite_seq, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else if (NCH(n) == 7) {\n expr_ty expression;\n asdl_seq *seq1, *seq2;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n seq1 = ast_for_suite(c, CHILD(n, 3));\n if (!seq1)\n return NULL;\n seq2 = ast_for_suite(c, CHILD(n, 6));\n if (!seq2)\n return NULL;\n\n return While(expression, seq1, seq2, LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n PyErr_Format(PyExc_SystemError,\n \"wrong number of tokens for 'while' statement: %d\",\n NCH(n));\n return NULL;\n}\n\nstatic stmt_ty\nast_for_for_stmt(struct compiling *c, const node *n, int is_async)\n{\n asdl_seq *_target, *seq = NULL, *suite_seq;\n expr_ty expression;\n expr_ty target, first;\n const node *node_target;\n int has_type_comment;\n string type_comment;\n\n if (is_async && c->c_feature_version < 5) {\n ast_error(c, n,\n \"Async for loops are only supported in Python 3.5 and greater\");\n return NULL;\n }\n\n /* for_stmt: 'for' exprlist 'in' testlist ':' [TYPE_COMMENT] suite ['else' ':' suite] */\n REQ(n, for_stmt);\n\n has_type_comment = TYPE(CHILD(n, 5)) == TYPE_COMMENT;\n\n if (NCH(n) == 9 + has_type_comment) {\n seq = ast_for_suite(c, CHILD(n, 8 + has_type_comment));\n if (!seq)\n return NULL;\n }\n\n node_target = CHILD(n, 1);\n _target = ast_for_exprlist(c, node_target, Store);\n if (!_target)\n return NULL;\n /* Check the # of children rather than the length of _target, since\n for x, in ... has 1 element in _target, but still requires a Tuple. */\n first = (expr_ty)asdl_seq_GET(_target, 0);\n if (NCH(node_target) == 1)\n target = first;\n else\n target = Tuple(_target, Store, first->lineno, first->col_offset, c->c_arena);\n\n expression = ast_for_testlist(c, CHILD(n, 3));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, 5 + has_type_comment));\n if (!suite_seq)\n return NULL;\n\n if (has_type_comment)\n type_comment = NEW_TYPE_COMMENT(CHILD(n, 5));\n else\n type_comment = NULL;\n\n if (is_async)\n return AsyncFor(target, expression, suite_seq, seq,\n type_comment, LINENO(n), n->n_col_offset,\n c->c_arena);\n else\n return For(target, expression, suite_seq, seq,\n type_comment, LINENO(n), n->n_col_offset,\n c->c_arena);\n}\n\nstatic excepthandler_ty\nast_for_except_clause(struct compiling *c, const node *exc, node *body)\n{\n /* except_clause: 'except' [test ['as' test]] */\n REQ(exc, except_clause);\n REQ(body, suite);\n\n if (NCH(exc) == 1) {\n asdl_seq *suite_seq = ast_for_suite(c, body);\n if (!suite_seq)\n return NULL;\n\n return ExceptHandler(NULL, NULL, suite_seq, LINENO(exc),\n exc->n_col_offset, c->c_arena);\n }\n else if (NCH(exc) == 2) {\n expr_ty expression;\n asdl_seq *suite_seq;\n\n expression = ast_for_expr(c, CHILD(exc, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, body);\n if (!suite_seq)\n return NULL;\n\n return ExceptHandler(expression, NULL, suite_seq, LINENO(exc),\n exc->n_col_offset, c->c_arena);\n }\n else if (NCH(exc) == 4) {\n asdl_seq *suite_seq;\n expr_ty expression;\n identifier e = NEW_IDENTIFIER(CHILD(exc, 3));\n if (!e)\n return NULL;\n if (forbidden_name(c, e, CHILD(exc, 3), 0))\n return NULL;\n expression = ast_for_expr(c, CHILD(exc, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, body);\n if (!suite_seq)\n return NULL;\n\n return ExceptHandler(expression, e, suite_seq, LINENO(exc),\n exc->n_col_offset, c->c_arena);\n }\n\n PyErr_Format(PyExc_SystemError,\n \"wrong number of children for 'except' clause: %d\",\n NCH(exc));\n return NULL;\n}\n\nstatic stmt_ty\nast_for_try_stmt(struct compiling *c, const node *n)\n{\n const int nch = NCH(n);\n int n_except = (nch - 3)/3;\n asdl_seq *body, *handlers = NULL, *orelse = NULL, *finally = NULL;\n\n REQ(n, try_stmt);\n\n body = ast_for_suite(c, CHILD(n, 2));\n if (body == NULL)\n return NULL;\n\n if (TYPE(CHILD(n, nch - 3)) == NAME) {\n if (strcmp(STR(CHILD(n, nch - 3)), \"finally\") == 0) {\n if (nch >= 9 && TYPE(CHILD(n, nch - 6)) == NAME) {\n /* we can assume it's an \"else\",\n because nch >= 9 for try-else-finally and\n it would otherwise have a type of except_clause */\n orelse = ast_for_suite(c, CHILD(n, nch - 4));\n if (orelse == NULL)\n return NULL;\n n_except--;\n }\n\n finally = ast_for_suite(c, CHILD(n, nch - 1));\n if (finally == NULL)\n return NULL;\n n_except--;\n }\n else {\n /* we can assume it's an \"else\",\n otherwise it would have a type of except_clause */\n orelse = ast_for_suite(c, CHILD(n, nch - 1));\n if (orelse == NULL)\n return NULL;\n n_except--;\n }\n }\n else if (TYPE(CHILD(n, nch - 3)) != except_clause) {\n ast_error(c, n, \"malformed 'try' statement\");\n return NULL;\n }\n\n if (n_except > 0) {\n int i;\n /* process except statements to create a try ... except */\n handlers = _Ta3_asdl_seq_new(n_except, c->c_arena);\n if (handlers == NULL)\n return NULL;\n\n for (i = 0; i < n_except; i++) {\n excepthandler_ty e = ast_for_except_clause(c, CHILD(n, 3 + i * 3),\n CHILD(n, 5 + i * 3));\n if (!e)\n return NULL;\n asdl_seq_SET(handlers, i, e);\n }\n }\n\n assert(finally != NULL || asdl_seq_LEN(handlers));\n return Try(body, handlers, orelse, finally, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\n/* with_item: test ['as' expr] */\nstatic withitem_ty\nast_for_with_item(struct compiling *c, const node *n)\n{\n expr_ty context_expr, optional_vars = NULL;\n\n REQ(n, with_item);\n context_expr = ast_for_expr(c, CHILD(n, 0));\n if (!context_expr)\n return NULL;\n if (NCH(n) == 3) {\n optional_vars = ast_for_expr(c, CHILD(n, 2));\n\n if (!optional_vars) {\n return NULL;\n }\n if (!set_context(c, optional_vars, Store, n)) {\n return NULL;\n }\n }\n\n return withitem(context_expr, optional_vars, c->c_arena);\n}\n\n/* with_stmt: 'with' with_item (',' with_item)* ':' [TYPE_COMMENT] suite */\nstatic stmt_ty\nast_for_with_stmt(struct compiling *c, const node *n, int is_async)\n{\n int i, n_items, nch_minus_type, has_type_comment;\n asdl_seq *items, *body;\n string type_comment;\n\n if (is_async && c->c_feature_version < 5) {\n ast_error(c, n,\n \"Async with statements are only supported in Python 3.5 and greater\");\n return NULL;\n }\n\n REQ(n, with_stmt);\n\n has_type_comment = TYPE(CHILD(n, NCH(n) - 2)) == TYPE_COMMENT;\n nch_minus_type = NCH(n) - has_type_comment;\n\n n_items = (nch_minus_type - 2) / 2;\n items = _Ta3_asdl_seq_new(n_items, c->c_arena);\n if (!items)\n return NULL;\n for (i = 1; i < nch_minus_type - 2; i += 2) {\n withitem_ty item = ast_for_with_item(c, CHILD(n, i));\n if (!item)\n return NULL;\n asdl_seq_SET(items, (i - 1) / 2, item);\n }\n\n body = ast_for_suite(c, CHILD(n, NCH(n) - 1));\n if (!body)\n return NULL;\n\n if (has_type_comment)\n type_comment = NEW_TYPE_COMMENT(CHILD(n, NCH(n) - 2));\n else\n type_comment = NULL;\n\n if (is_async)\n return AsyncWith(items, body, type_comment, LINENO(n), n->n_col_offset, c->c_arena);\n else\n return With(items, body, type_comment, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_classdef(struct compiling *c, const node *n, asdl_seq *decorator_seq)\n{\n /* classdef: 'class' NAME ['(' arglist ')'] ':' suite */\n PyObject *classname;\n asdl_seq *s;\n expr_ty call;\n\n REQ(n, classdef);\n\n if (NCH(n) == 4) { /* class NAME ':' suite */\n s = ast_for_suite(c, CHILD(n, 3));\n if (!s)\n return NULL;\n classname = NEW_IDENTIFIER(CHILD(n, 1));\n if (!classname)\n return NULL;\n if (forbidden_name(c, classname, CHILD(n, 3), 0))\n return NULL;\n return ClassDef(classname, NULL, NULL, s, decorator_seq, LINENO(n),\n n->n_col_offset, c->c_arena);\n }\n\n if (TYPE(CHILD(n, 3)) == RPAR) { /* class NAME '(' ')' ':' suite */\n s = ast_for_suite(c, CHILD(n,5));\n if (!s)\n return NULL;\n classname = NEW_IDENTIFIER(CHILD(n, 1));\n if (!classname)\n return NULL;\n if (forbidden_name(c, classname, CHILD(n, 3), 0))\n return NULL;\n return ClassDef(classname, NULL, NULL, s, decorator_seq, LINENO(n),\n n->n_col_offset, c->c_arena);\n }\n\n /* class NAME '(' arglist ')' ':' suite */\n /* build up a fake Call node so we can extract its pieces */\n {\n PyObject *dummy_name;\n expr_ty dummy;\n dummy_name = NEW_IDENTIFIER(CHILD(n, 1));\n if (!dummy_name)\n return NULL;\n dummy = Name(dummy_name, Load, LINENO(n), n->n_col_offset, c->c_arena);\n call = ast_for_call(c, CHILD(n, 3), dummy);\n if (!call)\n return NULL;\n }\n s = ast_for_suite(c, CHILD(n, 6));\n if (!s)\n return NULL;\n classname = NEW_IDENTIFIER(CHILD(n, 1));\n if (!classname)\n return NULL;\n if (forbidden_name(c, classname, CHILD(n, 1), 0))\n return NULL;\n\n return ClassDef(classname, call->v.Call.args, call->v.Call.keywords, s,\n decorator_seq, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_stmt(struct compiling *c, const node *n)\n{\n if (TYPE(n) == stmt) {\n assert(NCH(n) == 1);\n n = CHILD(n, 0);\n }\n if (TYPE(n) == simple_stmt) {\n assert(num_stmts(n) == 1);\n n = CHILD(n, 0);\n }\n if (TYPE(n) == small_stmt) {\n n = CHILD(n, 0);\n /* small_stmt: expr_stmt | del_stmt | pass_stmt | flow_stmt\n | import_stmt | global_stmt | nonlocal_stmt | assert_stmt\n */\n switch (TYPE(n)) {\n case expr_stmt:\n return ast_for_expr_stmt(c, n);\n case del_stmt:\n return ast_for_del_stmt(c, n);\n case pass_stmt:\n return Pass(LINENO(n), n->n_col_offset, c->c_arena);\n case flow_stmt:\n return ast_for_flow_stmt(c, n);\n case import_stmt:\n return ast_for_import_stmt(c, n);\n case global_stmt:\n return ast_for_global_stmt(c, n);\n case nonlocal_stmt:\n return ast_for_nonlocal_stmt(c, n);\n case assert_stmt:\n return ast_for_assert_stmt(c, n);\n default:\n PyErr_Format(PyExc_SystemError,\n \"unhandled small_stmt: TYPE=%d NCH=%d\\n\",\n TYPE(n), NCH(n));\n return NULL;\n }\n }\n else {\n /* compound_stmt: if_stmt | while_stmt | for_stmt | try_stmt\n | funcdef | classdef | decorated | async_stmt\n */\n node *ch = CHILD(n, 0);\n REQ(n, compound_stmt);\n switch (TYPE(ch)) {\n case if_stmt:\n return ast_for_if_stmt(c, ch);\n case while_stmt:\n return ast_for_while_stmt(c, ch);\n case for_stmt:\n return ast_for_for_stmt(c, ch, 0);\n case try_stmt:\n return ast_for_try_stmt(c, ch);\n case with_stmt:\n return ast_for_with_stmt(c, ch, 0);\n case funcdef:\n return ast_for_funcdef(c, ch, NULL);\n case classdef:\n return ast_for_classdef(c, ch, NULL);\n case decorated:\n return ast_for_decorated(c, ch);\n case async_stmt:\n return ast_for_async_stmt(c, ch);\n default:\n PyErr_Format(PyExc_SystemError,\n \"unhandled small_stmt: TYPE=%d NCH=%d\\n\",\n TYPE(n), NCH(n));\n return NULL;\n }\n }\n}\n\nstatic PyObject *\nparsenumber_raw(struct compiling *c, const char *s)\n{\n const char *end;\n long x;\n double dx;\n Py_complex compl;\n int imflag;\n\n assert(s != NULL);\n errno = 0;\n end = s + strlen(s) - 1;\n imflag = *end == 'j' || *end == 'J';\n if (s[0] == '0') {\n x = (long) PyOS_strtoul(s, (char **)&end, 0);\n if (x < 0 && errno == 0) {\n return PyLong_FromString(s, (char **)0, 0);\n }\n }\n else\n x = PyOS_strtol(s, (char **)&end, 0);\n if (*end == '\\0') {\n if (errno != 0)\n return PyLong_FromString(s, (char **)0, 0);\n return PyLong_FromLong(x);\n }\n /* XXX Huge floats may silently fail */\n if (imflag) {\n compl.real = 0.;\n compl.imag = PyOS_string_to_double(s, (char **)&end, NULL);\n if (compl.imag == -1.0 && PyErr_Occurred())\n return NULL;\n return PyComplex_FromCComplex(compl);\n }\n else\n {\n dx = PyOS_string_to_double(s, NULL, NULL);\n if (dx == -1.0 && PyErr_Occurred())\n return NULL;\n return PyFloat_FromDouble(dx);\n }\n}\n\nstatic PyObject *\nparsenumber(struct compiling *c, const char *s)\n{\n char *dup, *end;\n PyObject *res = NULL;\n\n assert(s != NULL);\n\n if (strchr(s, '_') == NULL) {\n return parsenumber_raw(c, s);\n }\n /* Create a duplicate without underscores. */\n dup = PyMem_Malloc(strlen(s) + 1);\n end = dup;\n for (; *s; s++) {\n if (*s != '_') {\n *end++ = *s;\n }\n }\n *end = '\\0';\n res = parsenumber_raw(c, dup);\n PyMem_Free(dup);\n return res;\n}\n\nstatic PyObject *\ndecode_utf8(struct compiling *c, const char **sPtr, const char *end)\n{\n const char *s, *t;\n t = s = *sPtr;\n /* while (s < end && *s != '\\\\') s++; */ /* inefficient for u\"..\" */\n while (s < end && (*s & 0x80)) s++;\n *sPtr = s;\n return PyUnicode_DecodeUTF8(t, s - t, NULL);\n}\n\nstatic PyObject *\ndecode_unicode_with_escapes(struct compiling *c, const node *n, const char *s,\n size_t len)\n{\n PyObject *u;\n char *buf;\n char *p;\n const char *end;\n\n /* check for integer overflow */\n if (len > SIZE_MAX / 6)\n return NULL;\n /* \"ä\" (2 bytes) may become \"\\U000000E4\" (10 bytes), or 1:5\n \"\\ä\" (3 bytes) may become \"\\u005c\\U000000E4\" (16 bytes), or ~1:6 */\n u = PyBytes_FromStringAndSize((char *)NULL, len * 6);\n if (u == NULL)\n return NULL;\n p = buf = PyBytes_AsString(u);\n end = s + len;\n while (s < end) {\n if (*s == '\\\\') {\n *p++ = *s++;\n if (*s & 0x80) {\n strcpy(p, \"u005c\");\n p += 5;\n }\n }\n if (*s & 0x80) { /* XXX inefficient */\n PyObject *w;\n int kind;\n void *data;\n Py_ssize_t len, i;\n w = decode_utf8(c, &s, end);\n if (w == NULL) {\n Py_DECREF(u);\n return NULL;\n }\n kind = PyUnicode_KIND(w);\n data = PyUnicode_DATA(w);\n len = PyUnicode_GET_LENGTH(w);\n for (i = 0; i < len; i++) {\n Py_UCS4 chr = PyUnicode_READ(kind, data, i);\n sprintf(p, \"\\\\U%08x\", chr);\n p += 10;\n }\n /* Should be impossible to overflow */\n assert(p - buf <= Py_SIZE(u));\n Py_DECREF(w);\n } else {\n *p++ = *s++;\n }\n }\n len = p - buf;\n s = buf;\n\n return PyUnicode_DecodeUnicodeEscape(s, len, NULL);\n}\n\nstatic PyObject *\ndecode_bytes_with_escapes(struct compiling *c, const node *n, const char *s,\n size_t len)\n{\n return PyBytes_DecodeEscape(s, len, NULL, 0, NULL);\n}\n\n/* Compile this expression in to an expr_ty. Add parens around the\n expression, in order to allow leading spaces in the expression. */\nstatic expr_ty\nfstring_compile_expr(const char *expr_start, const char *expr_end,\n struct compiling *c, const node *n)\n\n{\n int all_whitespace = 1;\n int kind;\n void *data;\n PyCompilerFlags cf;\n mod_ty mod;\n char *str;\n PyObject *o, *fstring_name;\n Py_ssize_t len;\n Py_ssize_t i;\n\n assert(expr_end >= expr_start);\n assert(*(expr_start-1) == '{');\n assert(*expr_end == '}' || *expr_end == '!' || *expr_end == ':');\n\n /* We know there are no escapes here, because backslashes are not allowed,\n and we know it's utf-8 encoded (per PEP 263). But, in order to check\n that each char is not whitespace, we need to decode it to unicode.\n Which is unfortunate, but such is life. */\n\n /* If the substring is all whitespace, it's an error. We need to catch\n this here, and not when we call PyParser_ASTFromString, because turning\n the expression '' in to '()' would go from being invalid to valid. */\n /* Note that this code says an empty string is all whitespace. That's\n important. There's a test for it: f'{}'. */\n o = PyUnicode_DecodeUTF8(expr_start, expr_end-expr_start, NULL);\n if (o == NULL)\n return NULL;\n len = PyUnicode_GET_LENGTH(o);\n kind = PyUnicode_KIND(o);\n data = PyUnicode_DATA(o);\n for (i = 0; i < len; i++) {\n if (!Py_UNICODE_ISSPACE(PyUnicode_READ(kind, data, i))) {\n all_whitespace = 0;\n break;\n }\n }\n Py_DECREF(o);\n if (all_whitespace) {\n ast_error(c, n, \"f-string: empty expression not allowed\");\n return NULL;\n }\n\n /* Reuse len to be the length of the utf-8 input string. */\n len = expr_end - expr_start;\n /* Allocate 3 extra bytes: open paren, close paren, null byte. */\n str = PyMem_RawMalloc(len + 3);\n if (str == NULL)\n return NULL;\n\n str[0] = '(';\n memcpy(str+1, expr_start, len);\n str[len+1] = ')';\n str[len+2] = 0;\n\n cf.cf_flags = PyCF_ONLY_AST;\n fstring_name = PyUnicode_FromString(\"\");\n mod = string_object_to_c_ast(str, fstring_name,\n Py_eval_input, &cf,\n c->c_feature_version, c->c_arena);\n Py_DECREF(fstring_name);\n PyMem_RawFree(str);\n if (!mod)\n return NULL;\n return mod->v.Expression.body;\n}\n\n/* Return -1 on error.\n\n Return 0 if we reached the end of the literal.\n\n Return 1 if we haven't reached the end of the literal, but we want\n the caller to process the literal up to this point. Used for\n doubled braces.\n*/\nstatic int\nfstring_find_literal(const char **str, const char *end, int raw,\n PyObject **literal, int recurse_lvl,\n struct compiling *c, const node *n)\n{\n /* Get any literal string. It ends when we hit an un-doubled left\n brace (which isn't part of a unicode name escape such as\n \"\\N{EULER CONSTANT}\"), or the end of the string. */\n\n const char *literal_start = *str;\n const char *literal_end;\n int in_named_escape = 0;\n int result = 0;\n\n assert(*literal == NULL);\n for (; *str < end; (*str)++) {\n char ch = **str;\n if (!in_named_escape && ch == '{' && (*str)-literal_start >= 2 &&\n *(*str-2) == '\\\\' && *(*str-1) == 'N') {\n in_named_escape = 1;\n } else if (in_named_escape && ch == '}') {\n in_named_escape = 0;\n } else if (ch == '{' || ch == '}') {\n /* Check for doubled braces, but only at the top level. If\n we checked at every level, then f'{0:{3}}' would fail\n with the two closing braces. */\n if (recurse_lvl == 0) {\n if (*str+1 < end && *(*str+1) == ch) {\n /* We're going to tell the caller that the literal ends\n here, but that they should continue scanning. But also\n skip over the second brace when we resume scanning. */\n literal_end = *str+1;\n *str += 2;\n result = 1;\n goto done;\n }\n\n /* Where a single '{' is the start of a new expression, a\n single '}' is not allowed. */\n if (ch == '}') {\n ast_error(c, n, \"f-string: single '}' is not allowed\");\n return -1;\n }\n }\n /* We're either at a '{', which means we're starting another\n expression; or a '}', which means we're at the end of this\n f-string (for a nested format_spec). */\n break;\n }\n }\n literal_end = *str;\n assert(*str <= end);\n assert(*str == end || **str == '{' || **str == '}');\ndone:\n if (literal_start != literal_end) {\n if (raw)\n *literal = PyUnicode_DecodeUTF8Stateful(literal_start,\n literal_end-literal_start,\n NULL, NULL);\n else\n *literal = decode_unicode_with_escapes(c, n, literal_start,\n literal_end-literal_start);\n if (!*literal)\n return -1;\n }\n return result;\n}\n\n/* Forward declaration because parsing is recursive. */\nstatic expr_ty\nfstring_parse(const char **str, const char *end, int raw, int recurse_lvl,\n struct compiling *c, const node *n);\n\n/* Parse the f-string at *str, ending at end. We know *str starts an\n expression (so it must be a '{'). Returns the FormattedValue node,\n which includes the expression, conversion character, and\n format_spec expression.\n\n Note that I don't do a perfect job here: I don't make sure that a\n closing brace doesn't match an opening paren, for example. It\n doesn't need to error on all invalid expressions, just correctly\n find the end of all valid ones. Any errors inside the expression\n will be caught when we parse it later. */\nstatic int\nfstring_find_expr(const char **str, const char *end, int raw, int recurse_lvl,\n expr_ty *expression, struct compiling *c, const node *n)\n{\n /* Return -1 on error, else 0. */\n\n const char *expr_start;\n const char *expr_end;\n expr_ty simple_expression;\n expr_ty format_spec = NULL; /* Optional format specifier. */\n int conversion = -1; /* The conversion char. -1 if not specified. */\n\n /* 0 if we're not in a string, else the quote char we're trying to\n match (single or double quote). */\n char quote_char = 0;\n\n /* If we're inside a string, 1=normal, 3=triple-quoted. */\n int string_type = 0;\n\n /* Keep track of nesting level for braces/parens/brackets in\n expressions. */\n Py_ssize_t nested_depth = 0;\n\n /* Can only nest one level deep. */\n if (recurse_lvl >= 2) {\n ast_error(c, n, \"f-string: expressions nested too deeply\");\n return -1;\n }\n\n /* The first char must be a left brace, or we wouldn't have gotten\n here. Skip over it. */\n assert(**str == '{');\n *str += 1;\n\n expr_start = *str;\n for (; *str < end; (*str)++) {\n char ch;\n\n /* Loop invariants. */\n assert(nested_depth >= 0);\n assert(*str >= expr_start && *str < end);\n if (quote_char)\n assert(string_type == 1 || string_type == 3);\n else\n assert(string_type == 0);\n\n ch = **str;\n /* Nowhere inside an expression is a backslash allowed. */\n if (ch == '\\\\') {\n /* Error: can't include a backslash character, inside\n parens or strings or not. */\n ast_error(c, n, \"f-string expression part \"\n \"cannot include a backslash\");\n return -1;\n }\n if (quote_char) {\n /* We're inside a string. See if we're at the end. */\n /* This code needs to implement the same non-error logic\n as tok_get from tokenizer.c, at the letter_quote\n label. To actually share that code would be a\n nightmare. But, it's unlikely to change and is small,\n so duplicate it here. Note we don't need to catch all\n of the errors, since they'll be caught when parsing the\n expression. We just need to match the non-error\n cases. Thus we can ignore \\n in single-quoted strings,\n for example. Or non-terminated strings. */\n if (ch == quote_char) {\n /* Does this match the string_type (single or triple\n quoted)? */\n if (string_type == 3) {\n if (*str+2 < end && *(*str+1) == ch && *(*str+2) == ch) {\n /* We're at the end of a triple quoted string. */\n *str += 2;\n string_type = 0;\n quote_char = 0;\n continue;\n }\n } else {\n /* We're at the end of a normal string. */\n quote_char = 0;\n string_type = 0;\n continue;\n }\n }\n } else if (ch == '\\'' || ch == '\"') {\n /* Is this a triple quoted string? */\n if (*str+2 < end && *(*str+1) == ch && *(*str+2) == ch) {\n string_type = 3;\n *str += 2;\n } else {\n /* Start of a normal string. */\n string_type = 1;\n }\n /* Start looking for the end of the string. */\n quote_char = ch;\n } else if (ch == '[' || ch == '{' || ch == '(') {\n nested_depth++;\n } else if (nested_depth != 0 &&\n (ch == ']' || ch == '}' || ch == ')')) {\n nested_depth--;\n } else if (ch == '#') {\n /* Error: can't include a comment character, inside parens\n or not. */\n ast_error(c, n, \"f-string expression part cannot include '#'\");\n return -1;\n } else if (nested_depth == 0 &&\n (ch == '!' || ch == ':' || ch == '}')) {\n /* First, test for the special case of \"!=\". Since '=' is\n not an allowed conversion character, nothing is lost in\n this test. */\n if (ch == '!' && *str+1 < end && *(*str+1) == '=') {\n /* This isn't a conversion character, just continue. */\n continue;\n }\n /* Normal way out of this loop. */\n break;\n } else {\n /* Just consume this char and loop around. */\n }\n }\n expr_end = *str;\n /* If we leave this loop in a string or with mismatched parens, we\n don't care. We'll get a syntax error when compiling the\n expression. But, we can produce a better error message, so\n let's just do that.*/\n if (quote_char) {\n ast_error(c, n, \"f-string: unterminated string\");\n return -1;\n }\n if (nested_depth) {\n ast_error(c, n, \"f-string: mismatched '(', '{', or '['\");\n return -1;\n }\n\n if (*str >= end)\n goto unexpected_end_of_string;\n\n /* Compile the expression as soon as possible, so we show errors\n related to the expression before errors related to the\n conversion or format_spec. */\n simple_expression = fstring_compile_expr(expr_start, expr_end, c, n);\n if (!simple_expression)\n return -1;\n\n /* Check for a conversion char, if present. */\n if (**str == '!') {\n *str += 1;\n if (*str >= end)\n goto unexpected_end_of_string;\n\n conversion = **str;\n *str += 1;\n\n /* Validate the conversion. */\n if (!(conversion == 's' || conversion == 'r'\n || conversion == 'a')) {\n ast_error(c, n, \"f-string: invalid conversion character: \"\n \"expected 's', 'r', or 'a'\");\n return -1;\n }\n }\n\n /* Check for the format spec, if present. */\n if (*str >= end)\n goto unexpected_end_of_string;\n if (**str == ':') {\n *str += 1;\n if (*str >= end)\n goto unexpected_end_of_string;\n\n /* Parse the format spec. */\n format_spec = fstring_parse(str, end, raw, recurse_lvl+1, c, n);\n if (!format_spec)\n return -1;\n }\n\n if (*str >= end || **str != '}')\n goto unexpected_end_of_string;\n\n /* We're at a right brace. Consume it. */\n assert(*str < end);\n assert(**str == '}');\n *str += 1;\n\n /* And now create the FormattedValue node that represents this\n entire expression with the conversion and format spec. */\n *expression = FormattedValue(simple_expression, conversion,\n format_spec, LINENO(n), n->n_col_offset,\n c->c_arena);\n if (!*expression)\n return -1;\n\n return 0;\n\nunexpected_end_of_string:\n ast_error(c, n, \"f-string: expecting '}'\");\n return -1;\n}\n\n/* Return -1 on error.\n\n Return 0 if we have a literal (possible zero length) and an\n expression (zero length if at the end of the string.\n\n Return 1 if we have a literal, but no expression, and we want the\n caller to call us again. This is used to deal with doubled\n braces.\n\n When called multiple times on the string 'a{{b{0}c', this function\n will return:\n\n 1. the literal 'a{' with no expression, and a return value\n of 1. Despite the fact that there's no expression, the return\n value of 1 means we're not finished yet.\n\n 2. the literal 'b' and the expression '0', with a return value of\n 0. The fact that there's an expression means we're not finished.\n\n 3. literal 'c' with no expression and a return value of 0. The\n combination of the return value of 0 with no expression means\n we're finished.\n*/\nstatic int\nfstring_find_literal_and_expr(const char **str, const char *end, int raw,\n int recurse_lvl, PyObject **literal,\n expr_ty *expression,\n struct compiling *c, const node *n)\n{\n int result;\n\n assert(*literal == NULL && *expression == NULL);\n\n /* Get any literal string. */\n result = fstring_find_literal(str, end, raw, literal, recurse_lvl, c, n);\n if (result < 0)\n goto error;\n\n assert(result == 0 || result == 1);\n\n if (result == 1)\n /* We have a literal, but don't look at the expression. */\n return 1;\n\n if (*str >= end || **str == '}')\n /* We're at the end of the string or the end of a nested\n f-string: no expression. The top-level error case where we\n expect to be at the end of the string but we're at a '}' is\n handled later. */\n return 0;\n\n /* We must now be the start of an expression, on a '{'. */\n assert(**str == '{');\n\n if (fstring_find_expr(str, end, raw, recurse_lvl, expression, c, n) < 0)\n goto error;\n\n return 0;\n\nerror:\n Py_CLEAR(*literal);\n return -1;\n}\n\n#define EXPRLIST_N_CACHED 64\n\ntypedef struct {\n /* Incrementally build an array of expr_ty, so be used in an\n asdl_seq. Cache some small but reasonably sized number of\n expr_ty's, and then after that start dynamically allocating,\n doubling the number allocated each time. Note that the f-string\n f'{0}a{1}' contains 3 expr_ty's: 2 FormattedValue's, and one\n Str for the literal 'a'. So you add expr_ty's about twice as\n fast as you add exressions in an f-string. */\n\n Py_ssize_t allocated; /* Number we've allocated. */\n Py_ssize_t size; /* Number we've used. */\n expr_ty *p; /* Pointer to the memory we're actually\n using. Will point to 'data' until we\n start dynamically allocating. */\n expr_ty data[EXPRLIST_N_CACHED];\n} ExprList;\n\n#ifdef NDEBUG\n#define ExprList_check_invariants(l)\n#else\nstatic void\nExprList_check_invariants(ExprList *l)\n{\n /* Check our invariants. Make sure this object is \"live\", and\n hasn't been deallocated. */\n assert(l->size >= 0);\n assert(l->p != NULL);\n if (l->size <= EXPRLIST_N_CACHED)\n assert(l->data == l->p);\n}\n#endif\n\nstatic void\nExprList_Init(ExprList *l)\n{\n l->allocated = EXPRLIST_N_CACHED;\n l->size = 0;\n\n /* Until we start allocating dynamically, p points to data. */\n l->p = l->data;\n\n ExprList_check_invariants(l);\n}\n\nstatic int\nExprList_Append(ExprList *l, expr_ty exp)\n{\n ExprList_check_invariants(l);\n if (l->size >= l->allocated) {\n /* We need to alloc (or realloc) the memory. */\n Py_ssize_t new_size = l->allocated * 2;\n\n /* See if we've ever allocated anything dynamically. */\n if (l->p == l->data) {\n Py_ssize_t i;\n /* We're still using the cached data. Switch to\n alloc-ing. */\n l->p = PyMem_RawMalloc(sizeof(expr_ty) * new_size);\n if (!l->p)\n return -1;\n /* Copy the cached data into the new buffer. */\n for (i = 0; i < l->size; i++)\n l->p[i] = l->data[i];\n } else {\n /* Just realloc. */\n expr_ty *tmp = PyMem_RawRealloc(l->p, sizeof(expr_ty) * new_size);\n if (!tmp) {\n PyMem_RawFree(l->p);\n l->p = NULL;\n return -1;\n }\n l->p = tmp;\n }\n\n l->allocated = new_size;\n assert(l->allocated == 2 * l->size);\n }\n\n l->p[l->size++] = exp;\n\n ExprList_check_invariants(l);\n return 0;\n}\n\nstatic void\nExprList_Dealloc(ExprList *l)\n{\n ExprList_check_invariants(l);\n\n /* If there's been an error, or we've never dynamically allocated,\n do nothing. */\n if (!l->p || l->p == l->data) {\n /* Do nothing. */\n } else {\n /* We have dynamically allocated. Free the memory. */\n PyMem_RawFree(l->p);\n }\n l->p = NULL;\n l->size = -1;\n}\n\nstatic asdl_seq *\nExprList_Finish(ExprList *l, PyArena *arena)\n{\n asdl_seq *seq;\n\n ExprList_check_invariants(l);\n\n /* Allocate the asdl_seq and copy the expressions in to it. */\n seq = _Ta3_asdl_seq_new(l->size, arena);\n if (seq) {\n Py_ssize_t i;\n for (i = 0; i < l->size; i++)\n asdl_seq_SET(seq, i, l->p[i]);\n }\n ExprList_Dealloc(l);\n return seq;\n}\n\n/* The FstringParser is designed to add a mix of strings and\n f-strings, and concat them together as needed. Ultimately, it\n generates an expr_ty. */\ntypedef struct {\n PyObject *last_str;\n ExprList expr_list;\n} FstringParser;\n\n#ifdef NDEBUG\n#define FstringParser_check_invariants(state)\n#else\nstatic void\nFstringParser_check_invariants(FstringParser *state)\n{\n if (state->last_str)\n assert(PyUnicode_CheckExact(state->last_str));\n ExprList_check_invariants(&state->expr_list);\n}\n#endif\n\nstatic void\nFstringParser_Init(FstringParser *state)\n{\n state->last_str = NULL;\n ExprList_Init(&state->expr_list);\n FstringParser_check_invariants(state);\n}\n\nstatic void\nFstringParser_Dealloc(FstringParser *state)\n{\n FstringParser_check_invariants(state);\n\n Py_XDECREF(state->last_str);\n ExprList_Dealloc(&state->expr_list);\n}\n\n/* Make a Str node, but decref the PyUnicode object being added. */\nstatic expr_ty\nmake_str_node_and_del(PyObject **str, struct compiling *c, const node* n)\n{\n PyObject *kind, *s = *str;\n const char *raw = STR(CHILD(n, 0));\n /* currently Python allows up to 2 string modifiers */\n char *ch, s_kind[3] = {0, 0, 0};\n ch = s_kind;\n while (*raw && *raw != '\\'' && *raw != '\"') {\n *ch++ = *raw++;\n }\n kind = PyUnicode_FromString(s_kind);\n if (!kind) {\n return NULL;\n }\n *str = NULL;\n assert(PyUnicode_CheckExact(s));\n if (PyArena_AddPyObject(c->c_arena, s) < 0) {\n Py_DECREF(s);\n return NULL;\n }\n return Str(s, kind, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\n/* Add a non-f-string (that is, a regular literal string). str is\n decref'd. */\nstatic int\nFstringParser_ConcatAndDel(FstringParser *state, PyObject *str)\n{\n FstringParser_check_invariants(state);\n\n assert(PyUnicode_CheckExact(str));\n\n if (PyUnicode_GET_LENGTH(str) == 0) {\n Py_DECREF(str);\n return 0;\n }\n\n if (!state->last_str) {\n /* We didn't have a string before, so just remember this one. */\n state->last_str = str;\n } else {\n /* Concatenate this with the previous string. */\n PyUnicode_AppendAndDel(&state->last_str, str);\n if (!state->last_str)\n return -1;\n }\n FstringParser_check_invariants(state);\n return 0;\n}\n\n/* Parse an f-string. The f-string is in *str to end, with no\n 'f' or quotes. */\nstatic int\nFstringParser_ConcatFstring(FstringParser *state, const char **str,\n const char *end, int raw, int recurse_lvl,\n struct compiling *c, const node *n)\n{\n FstringParser_check_invariants(state);\n\n /* Parse the f-string. */\n while (1) {\n PyObject *literal = NULL;\n expr_ty expression = NULL;\n\n /* If there's a zero length literal in front of the\n expression, literal will be NULL. If we're at the end of\n the f-string, expression will be NULL (unless result == 1,\n see below). */\n int result = fstring_find_literal_and_expr(str, end, raw, recurse_lvl,\n &literal, &expression,\n c, n);\n if (result < 0)\n return -1;\n\n /* Add the literal, if any. */\n if (!literal) {\n /* Do nothing. Just leave last_str alone (and possibly\n NULL). */\n } else if (!state->last_str) {\n state->last_str = literal;\n literal = NULL;\n } else {\n /* We have a literal, concatenate it. */\n assert(PyUnicode_GET_LENGTH(literal) != 0);\n if (FstringParser_ConcatAndDel(state, literal) < 0)\n return -1;\n literal = NULL;\n }\n assert(!state->last_str ||\n PyUnicode_GET_LENGTH(state->last_str) != 0);\n\n /* We've dealt with the literal now. It can't be leaked on further\n errors. */\n assert(literal == NULL);\n\n /* See if we should just loop around to get the next literal\n and expression, while ignoring the expression this\n time. This is used for un-doubling braces, as an\n optimization. */\n if (result == 1)\n continue;\n\n if (!expression)\n /* We're done with this f-string. */\n break;\n\n /* We know we have an expression. Convert any existing string\n to a Str node. */\n if (!state->last_str) {\n /* Do nothing. No previous literal. */\n } else {\n /* Convert the existing last_str literal to a Str node. */\n expr_ty str = make_str_node_and_del(&state->last_str, c, n);\n if (!str || ExprList_Append(&state->expr_list, str) < 0)\n return -1;\n }\n\n if (ExprList_Append(&state->expr_list, expression) < 0)\n return -1;\n }\n\n /* If recurse_lvl is zero, then we must be at the end of the\n string. Otherwise, we must be at a right brace. */\n\n if (recurse_lvl == 0 && *str < end-1) {\n ast_error(c, n, \"f-string: unexpected end of string\");\n return -1;\n }\n if (recurse_lvl != 0 && **str != '}') {\n ast_error(c, n, \"f-string: expecting '}'\");\n return -1;\n }\n\n FstringParser_check_invariants(state);\n return 0;\n}\n\n/* Convert the partial state reflected in last_str and expr_list to an\n expr_ty. The expr_ty can be a Str, or a JoinedStr. */\nstatic expr_ty\nFstringParser_Finish(FstringParser *state, struct compiling *c,\n const node *n)\n{\n asdl_seq *seq;\n\n FstringParser_check_invariants(state);\n\n /* If we're just a constant string with no expressions, return\n that. */\n if(state->expr_list.size == 0) {\n if (!state->last_str) {\n /* Create a zero length string. */\n state->last_str = PyUnicode_FromStringAndSize(NULL, 0);\n if (!state->last_str)\n goto error;\n }\n return make_str_node_and_del(&state->last_str, c, n);\n }\n\n /* Create a Str node out of last_str, if needed. It will be the\n last node in our expression list. */\n if (state->last_str) {\n expr_ty str = make_str_node_and_del(&state->last_str, c, n);\n if (!str || ExprList_Append(&state->expr_list, str) < 0)\n goto error;\n }\n /* This has already been freed. */\n assert(state->last_str == NULL);\n\n seq = ExprList_Finish(&state->expr_list, c->c_arena);\n if (!seq)\n goto error;\n\n /* If there's only one expression, return it. Otherwise, we need\n to join them together. */\n if (seq->size == 1)\n return seq->elements[0];\n\n return JoinedStr(seq, LINENO(n), n->n_col_offset, c->c_arena);\n\nerror:\n FstringParser_Dealloc(state);\n return NULL;\n}\n\n/* Given an f-string (with no 'f' or quotes) that's in *str and ends\n at end, parse it into an expr_ty. Return NULL on error. Adjust\n str to point past the parsed portion. */\nstatic expr_ty\nfstring_parse(const char **str, const char *end, int raw, int recurse_lvl,\n struct compiling *c, const node *n)\n{\n FstringParser state;\n\n FstringParser_Init(&state);\n if (FstringParser_ConcatFstring(&state, str, end, raw, recurse_lvl,\n c, n) < 0) {\n FstringParser_Dealloc(&state);\n return NULL;\n }\n\n return FstringParser_Finish(&state, c, n);\n}\n\n/* n is a Python string literal, including the bracketing quote\n characters, and r, b, u, &/or f prefixes (if any), and embedded\n escape sequences (if any). parsestr parses it, and sets *result to\n decoded Python string object. If the string is an f-string, set\n *fstr and *fstrlen to the unparsed string object. Return 0 if no\n errors occurred.\n*/\nstatic int\nparsestr(struct compiling *c, const node *n, int *bytesmode, int *rawmode,\n PyObject **result, const char **fstr, Py_ssize_t *fstrlen)\n{\n size_t len;\n const char *s = STR(n);\n int quote = Py_CHARMASK(*s);\n int fmode = 0;\n *bytesmode = 0;\n *rawmode = 0;\n *result = NULL;\n *fstr = NULL;\n if (Py_ISALPHA(quote)) {\n while (!*bytesmode || !*rawmode) {\n if (quote == 'b' || quote == 'B') {\n quote = *++s;\n *bytesmode = 1;\n }\n else if (quote == 'u' || quote == 'U') {\n quote = *++s;\n }\n else if (quote == 'r' || quote == 'R') {\n quote = *++s;\n *rawmode = 1;\n }\n else if (quote == 'f' || quote == 'F') {\n quote = *++s;\n fmode = 1;\n }\n else {\n break;\n }\n }\n }\n /* fstrings are only allowed in Python 3.6 and greater */\n if (fmode && c->c_feature_version < 6) {\n ast_error(c, n, \"Format strings are only supported in Python 3.6 and greater\");\n return -1;\n }\n if (fmode && *bytesmode) {\n PyErr_BadInternalCall();\n return -1;\n }\n if (quote != '\\'' && quote != '\\\"') {\n PyErr_BadInternalCall();\n return -1;\n }\n /* Skip the leading quote char. */\n s++;\n len = strlen(s);\n if (len > INT_MAX) {\n PyErr_SetString(PyExc_OverflowError,\n \"string to parse is too long\");\n return -1;\n }\n if (s[--len] != quote) {\n /* Last quote char must match the first. */\n PyErr_BadInternalCall();\n return -1;\n }\n if (len >= 4 && s[0] == quote && s[1] == quote) {\n /* A triple quoted string. We've already skipped one quote at\n the start and one at the end of the string. Now skip the\n two at the start. */\n s += 2;\n len -= 2;\n /* And check that the last two match. */\n if (s[--len] != quote || s[--len] != quote) {\n PyErr_BadInternalCall();\n return -1;\n }\n }\n\n if (fmode) {\n /* Just return the bytes. The caller will parse the resulting\n string. */\n *fstr = s;\n *fstrlen = len;\n return 0;\n }\n\n /* Not an f-string. */\n /* Avoid invoking escape decoding routines if possible. */\n *rawmode = *rawmode || strchr(s, '\\\\') == NULL;\n if (*bytesmode) {\n /* Disallow non-ASCII characters. */\n const char *ch;\n for (ch = s; *ch; ch++) {\n if (Py_CHARMASK(*ch) >= 0x80) {\n ast_error(c, n, \"bytes can only contain ASCII \"\n \"literal characters.\");\n return -1;\n }\n }\n if (*rawmode)\n *result = PyBytes_FromStringAndSize(s, len);\n else\n *result = decode_bytes_with_escapes(c, n, s, len);\n } else {\n if (*rawmode)\n *result = PyUnicode_DecodeUTF8Stateful(s, len, NULL, NULL);\n else\n *result = decode_unicode_with_escapes(c, n, s, len);\n }\n return *result == NULL ? -1 : 0;\n}\n\n/* Accepts a STRING+ atom, and produces an expr_ty node. Run through\n each STRING atom, and process it as needed. For bytes, just\n concatenate them together, and the result will be a Bytes node. For\n normal strings and f-strings, concatenate them together. The result\n will be a Str node if there were no f-strings; a FormattedValue\n node if there's just an f-string (with no leading or trailing\n literals), or a JoinedStr node if there are multiple f-strings or\n any literals involved. */\nstatic expr_ty\nparsestrplus(struct compiling *c, const node *n)\n{\n int bytesmode = 0;\n PyObject *bytes_str = NULL;\n int i;\n\n FstringParser state;\n FstringParser_Init(&state);\n\n for (i = 0; i < NCH(n); i++) {\n int this_bytesmode;\n int this_rawmode;\n PyObject *s;\n const char *fstr;\n Py_ssize_t fstrlen = -1; /* Silence a compiler warning. */\n\n REQ(CHILD(n, i), STRING);\n if (parsestr(c, CHILD(n, i), &this_bytesmode, &this_rawmode, &s,\n &fstr, &fstrlen) != 0)\n goto error;\n\n /* Check that we're not mixing bytes with unicode. */\n if (i != 0 && bytesmode != this_bytesmode) {\n ast_error(c, n, \"cannot mix bytes and nonbytes literals\");\n /* s is NULL if the current string part is an f-string. */\n Py_XDECREF(s);\n goto error;\n }\n bytesmode = this_bytesmode;\n\n if (fstr != NULL) {\n int result;\n assert(s == NULL && !bytesmode);\n /* This is an f-string. Parse and concatenate it. */\n result = FstringParser_ConcatFstring(&state, &fstr, fstr+fstrlen,\n this_rawmode, 0, c, n);\n if (result < 0)\n goto error;\n } else {\n /* A string or byte string. */\n assert(s != NULL && fstr == NULL);\n\n assert(bytesmode ? PyBytes_CheckExact(s) :\n PyUnicode_CheckExact(s));\n\n if (bytesmode) {\n /* For bytes, concat as we go. */\n if (i == 0) {\n /* First time, just remember this value. */\n bytes_str = s;\n } else {\n PyBytes_ConcatAndDel(&bytes_str, s);\n if (!bytes_str)\n goto error;\n }\n } else {\n /* This is a regular string. Concatenate it. */\n if (FstringParser_ConcatAndDel(&state, s) < 0)\n goto error;\n }\n }\n }\n if (bytesmode) {\n /* Just return the bytes object and we're done. */\n if (PyArena_AddPyObject(c->c_arena, bytes_str) < 0)\n goto error;\n return Bytes(bytes_str, LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n /* We're not a bytes string, bytes_str should never have been set. */\n assert(bytes_str == NULL);\n\n return FstringParser_Finish(&state, c, n);\n\nerror:\n Py_XDECREF(bytes_str);\n FstringParser_Dealloc(&state);\n return NULL;\n}\n"},"code_after":{"kind":"string","value":"/*\n * This file includes functions to transform a concrete syntax tree (CST) to\n * an abstract syntax tree (AST). The main function is Ta3AST_FromNode().\n *\n */\n#include \"Python.h\"\n#include \"Python-ast.h\"\n#include \"node.h\"\n#include \"ast.h\"\n#include \"token.h\"\n#include \"pythonrun.h\"\n\n#include \n\n// VS 2010 doesn't have ...\ntypedef int bool;\n#define false 0\n#define true 1\n\n#ifndef _PyObject_FastCall\nstatic PyObject *\n_PyObject_FastCall(PyObject *func, PyObject *const *args, int nargs)\n{\n PyObject *t, *res;\n int i;\n\n t = PyTuple_New(nargs);\n if (t == NULL) {\n return NULL;\n }\n for (i = 0; i < nargs; i++) {\n if (PyTuple_SetItem(t, i, args[i]) < 0) {\n Py_DECREF(t);\n return NULL;\n }\n }\n res = PyObject_CallObject(func, t);\n Py_DECREF(t);\n return res;\n}\n#endif\n\n#if PY_MINOR_VERSION < 6\n#define _PyUnicode_EqualToASCIIString(a, b) (PyUnicode_CompareWithASCIIString((a), (b)) == 0)\n\nstatic PyObject *\n_PyBytes_DecodeEscape(const char *s,\n Py_ssize_t len,\n const char *errors,\n Py_ssize_t unicode,\n const char *recode_encoding,\n const char **first_invalid_escape)\n{\n *first_invalid_escape = NULL;\n return PyBytes_DecodeEscape(s, len, errors, unicode, recode_encoding);\n}\n\nPyObject *\n_PyUnicode_DecodeUnicodeEscape(const char *s,\n Py_ssize_t size,\n const char *errors,\n const char **first_invalid_escape)\n{\n *first_invalid_escape = NULL;\n return PyUnicode_DecodeUnicodeEscape(s, size, errors);\n}\n\n#endif\n\nstatic int validate_stmts(asdl_seq *);\nstatic int validate_exprs(asdl_seq *, expr_context_ty, int);\nstatic int validate_nonempty_seq(asdl_seq *, const char *, const char *);\nstatic int validate_stmt(stmt_ty);\nstatic int validate_expr(expr_ty, expr_context_ty);\n\nmod_ty\nstring_object_to_c_ast(const char *s, PyObject *filename, int start,\n PyCompilerFlags *flags, int feature_version,\n PyArena *arena);\n\nstatic int\nvalidate_comprehension(asdl_seq *gens)\n{\n int i;\n if (!asdl_seq_LEN(gens)) {\n PyErr_SetString(PyExc_ValueError, \"comprehension with no generators\");\n return 0;\n }\n for (i = 0; i < asdl_seq_LEN(gens); i++) {\n comprehension_ty comp = asdl_seq_GET(gens, i);\n if (!validate_expr(comp->target, Store) ||\n !validate_expr(comp->iter, Load) ||\n !validate_exprs(comp->ifs, Load, 0))\n return 0;\n }\n return 1;\n}\n\nstatic int\nvalidate_slice(slice_ty slice)\n{\n switch (slice->kind) {\n case Slice_kind:\n return (!slice->v.Slice.lower || validate_expr(slice->v.Slice.lower, Load)) &&\n (!slice->v.Slice.upper || validate_expr(slice->v.Slice.upper, Load)) &&\n (!slice->v.Slice.step || validate_expr(slice->v.Slice.step, Load));\n case ExtSlice_kind: {\n int i;\n if (!validate_nonempty_seq(slice->v.ExtSlice.dims, \"dims\", \"ExtSlice\"))\n return 0;\n for (i = 0; i < asdl_seq_LEN(slice->v.ExtSlice.dims); i++)\n if (!validate_slice(asdl_seq_GET(slice->v.ExtSlice.dims, i)))\n return 0;\n return 1;\n }\n case Index_kind:\n return validate_expr(slice->v.Index.value, Load);\n default:\n PyErr_SetString(PyExc_SystemError, \"unknown slice node\");\n return 0;\n }\n}\n\nstatic int\nvalidate_keywords(asdl_seq *keywords)\n{\n int i;\n for (i = 0; i < asdl_seq_LEN(keywords); i++)\n if (!validate_expr(((keyword_ty)asdl_seq_GET(keywords, i))->value, Load))\n return 0;\n return 1;\n}\n\nstatic int\nvalidate_args(asdl_seq *args)\n{\n int i;\n for (i = 0; i < asdl_seq_LEN(args); i++) {\n arg_ty arg = asdl_seq_GET(args, i);\n if (arg->annotation && !validate_expr(arg->annotation, Load))\n return 0;\n }\n return 1;\n}\n\nstatic const char *\nexpr_context_name(expr_context_ty ctx)\n{\n switch (ctx) {\n case Load:\n return \"Load\";\n case Store:\n return \"Store\";\n case Del:\n return \"Del\";\n case AugLoad:\n return \"AugLoad\";\n case AugStore:\n return \"AugStore\";\n case Param:\n return \"Param\";\n default:\n abort();\n }\n}\n\nstatic int\nvalidate_arguments(arguments_ty args)\n{\n if (!validate_args(args->args))\n return 0;\n if (args->vararg && args->vararg->annotation\n && !validate_expr(args->vararg->annotation, Load)) {\n return 0;\n }\n if (!validate_args(args->kwonlyargs))\n return 0;\n if (args->kwarg && args->kwarg->annotation\n && !validate_expr(args->kwarg->annotation, Load)) {\n return 0;\n }\n if (asdl_seq_LEN(args->defaults) > asdl_seq_LEN(args->args)) {\n PyErr_SetString(PyExc_ValueError, \"more positional defaults than args on arguments\");\n return 0;\n }\n if (asdl_seq_LEN(args->kw_defaults) != asdl_seq_LEN(args->kwonlyargs)) {\n PyErr_SetString(PyExc_ValueError, \"length of kwonlyargs is not the same as \"\n \"kw_defaults on arguments\");\n return 0;\n }\n return validate_exprs(args->defaults, Load, 0) && validate_exprs(args->kw_defaults, Load, 1);\n}\n\nstatic int\nvalidate_constant(PyObject *value)\n{\n if (value == Py_None || value == Py_Ellipsis)\n return 1;\n\n if (PyLong_CheckExact(value)\n || PyFloat_CheckExact(value)\n || PyComplex_CheckExact(value)\n || PyBool_Check(value)\n || PyUnicode_CheckExact(value)\n || PyBytes_CheckExact(value))\n return 1;\n\n if (PyTuple_CheckExact(value) || PyFrozenSet_CheckExact(value)) {\n PyObject *it;\n\n it = PyObject_GetIter(value);\n if (it == NULL)\n return 0;\n\n while (1) {\n PyObject *item = PyIter_Next(it);\n if (item == NULL) {\n if (PyErr_Occurred()) {\n Py_DECREF(it);\n return 0;\n }\n break;\n }\n\n if (!validate_constant(item)) {\n Py_DECREF(it);\n Py_DECREF(item);\n return 0;\n }\n Py_DECREF(item);\n }\n\n Py_DECREF(it);\n return 1;\n }\n\n return 0;\n}\n\nstatic int\nvalidate_expr(expr_ty exp, expr_context_ty ctx)\n{\n int check_ctx = 1;\n expr_context_ty actual_ctx;\n\n /* First check expression context. */\n switch (exp->kind) {\n case Attribute_kind:\n actual_ctx = exp->v.Attribute.ctx;\n break;\n case Subscript_kind:\n actual_ctx = exp->v.Subscript.ctx;\n break;\n case Starred_kind:\n actual_ctx = exp->v.Starred.ctx;\n break;\n case Name_kind:\n actual_ctx = exp->v.Name.ctx;\n break;\n case List_kind:\n actual_ctx = exp->v.List.ctx;\n break;\n case Tuple_kind:\n actual_ctx = exp->v.Tuple.ctx;\n break;\n default:\n if (ctx != Load) {\n PyErr_Format(PyExc_ValueError, \"expression which can't be \"\n \"assigned to in %s context\", expr_context_name(ctx));\n return 0;\n }\n check_ctx = 0;\n /* set actual_ctx to prevent gcc warning */\n actual_ctx = 0;\n }\n if (check_ctx && actual_ctx != ctx) {\n PyErr_Format(PyExc_ValueError, \"expression must have %s context but has %s instead\",\n expr_context_name(ctx), expr_context_name(actual_ctx));\n return 0;\n }\n\n /* Now validate expression. */\n switch (exp->kind) {\n case BoolOp_kind:\n if (asdl_seq_LEN(exp->v.BoolOp.values) < 2) {\n PyErr_SetString(PyExc_ValueError, \"BoolOp with less than 2 values\");\n return 0;\n }\n return validate_exprs(exp->v.BoolOp.values, Load, 0);\n case BinOp_kind:\n return validate_expr(exp->v.BinOp.left, Load) &&\n validate_expr(exp->v.BinOp.right, Load);\n case UnaryOp_kind:\n return validate_expr(exp->v.UnaryOp.operand, Load);\n case Lambda_kind:\n return validate_arguments(exp->v.Lambda.args) &&\n validate_expr(exp->v.Lambda.body, Load);\n case IfExp_kind:\n return validate_expr(exp->v.IfExp.test, Load) &&\n validate_expr(exp->v.IfExp.body, Load) &&\n validate_expr(exp->v.IfExp.orelse, Load);\n case Dict_kind:\n if (asdl_seq_LEN(exp->v.Dict.keys) != asdl_seq_LEN(exp->v.Dict.values)) {\n PyErr_SetString(PyExc_ValueError,\n \"Dict doesn't have the same number of keys as values\");\n return 0;\n }\n /* null_ok=1 for keys expressions to allow dict unpacking to work in\n dict literals, i.e. ``{**{a:b}}`` */\n return validate_exprs(exp->v.Dict.keys, Load, /*null_ok=*/ 1) &&\n validate_exprs(exp->v.Dict.values, Load, /*null_ok=*/ 0);\n case Set_kind:\n return validate_exprs(exp->v.Set.elts, Load, 0);\n#define COMP(NAME) \\\n case NAME ## _kind: \\\n return validate_comprehension(exp->v.NAME.generators) && \\\n validate_expr(exp->v.NAME.elt, Load);\n COMP(ListComp)\n COMP(SetComp)\n COMP(GeneratorExp)\n#undef COMP\n case DictComp_kind:\n return validate_comprehension(exp->v.DictComp.generators) &&\n validate_expr(exp->v.DictComp.key, Load) &&\n validate_expr(exp->v.DictComp.value, Load);\n case Yield_kind:\n return !exp->v.Yield.value || validate_expr(exp->v.Yield.value, Load);\n case YieldFrom_kind:\n return validate_expr(exp->v.YieldFrom.value, Load);\n case Await_kind:\n return validate_expr(exp->v.Await.value, Load);\n case Compare_kind:\n if (!asdl_seq_LEN(exp->v.Compare.comparators)) {\n PyErr_SetString(PyExc_ValueError, \"Compare with no comparators\");\n return 0;\n }\n if (asdl_seq_LEN(exp->v.Compare.comparators) !=\n asdl_seq_LEN(exp->v.Compare.ops)) {\n PyErr_SetString(PyExc_ValueError, \"Compare has a different number \"\n \"of comparators and operands\");\n return 0;\n }\n return validate_exprs(exp->v.Compare.comparators, Load, 0) &&\n validate_expr(exp->v.Compare.left, Load);\n case Call_kind:\n return validate_expr(exp->v.Call.func, Load) &&\n validate_exprs(exp->v.Call.args, Load, 0) &&\n validate_keywords(exp->v.Call.keywords);\n case Constant_kind:\n if (!validate_constant(exp->v.Constant.value)) {\n PyErr_Format(PyExc_TypeError,\n \"got an invalid type in Constant: %s\",\n Py_TYPE(exp->v.Constant.value)->tp_name);\n return 0;\n }\n return 1;\n case Num_kind: {\n PyObject *n = exp->v.Num.n;\n if (!PyLong_CheckExact(n) && !PyFloat_CheckExact(n) &&\n !PyComplex_CheckExact(n)) {\n PyErr_SetString(PyExc_TypeError, \"non-numeric type in Num\");\n return 0;\n }\n return 1;\n }\n case Str_kind: {\n PyObject *s = exp->v.Str.s;\n if (!PyUnicode_CheckExact(s)) {\n PyErr_SetString(PyExc_TypeError, \"non-string type in Str\");\n return 0;\n }\n return 1;\n }\n case JoinedStr_kind:\n return validate_exprs(exp->v.JoinedStr.values, Load, 0);\n case FormattedValue_kind:\n if (validate_expr(exp->v.FormattedValue.value, Load) == 0)\n return 0;\n if (exp->v.FormattedValue.format_spec)\n return validate_expr(exp->v.FormattedValue.format_spec, Load);\n return 1;\n case Bytes_kind: {\n PyObject *b = exp->v.Bytes.s;\n if (!PyBytes_CheckExact(b)) {\n PyErr_SetString(PyExc_TypeError, \"non-bytes type in Bytes\");\n return 0;\n }\n return 1;\n }\n case Attribute_kind:\n return validate_expr(exp->v.Attribute.value, Load);\n case Subscript_kind:\n return validate_slice(exp->v.Subscript.slice) &&\n validate_expr(exp->v.Subscript.value, Load);\n case Starred_kind:\n return validate_expr(exp->v.Starred.value, ctx);\n case List_kind:\n return validate_exprs(exp->v.List.elts, ctx, 0);\n case Tuple_kind:\n return validate_exprs(exp->v.Tuple.elts, ctx, 0);\n /* These last cases don't have any checking. */\n case Name_kind:\n case NameConstant_kind:\n case Ellipsis_kind:\n return 1;\n default:\n PyErr_SetString(PyExc_SystemError, \"unexpected expression\");\n return 0;\n }\n}\n\nstatic int\nvalidate_nonempty_seq(asdl_seq *seq, const char *what, const char *owner)\n{\n if (asdl_seq_LEN(seq))\n return 1;\n PyErr_Format(PyExc_ValueError, \"empty %s on %s\", what, owner);\n return 0;\n}\n\nstatic int\nvalidate_assignlist(asdl_seq *targets, expr_context_ty ctx)\n{\n return validate_nonempty_seq(targets, \"targets\", ctx == Del ? \"Delete\" : \"Assign\") &&\n validate_exprs(targets, ctx, 0);\n}\n\nstatic int\nvalidate_body(asdl_seq *body, const char *owner)\n{\n return validate_nonempty_seq(body, \"body\", owner) && validate_stmts(body);\n}\n\nstatic int\nvalidate_stmt(stmt_ty stmt)\n{\n int i;\n switch (stmt->kind) {\n case FunctionDef_kind:\n return validate_body(stmt->v.FunctionDef.body, \"FunctionDef\") &&\n validate_arguments(stmt->v.FunctionDef.args) &&\n validate_exprs(stmt->v.FunctionDef.decorator_list, Load, 0) &&\n (!stmt->v.FunctionDef.returns ||\n validate_expr(stmt->v.FunctionDef.returns, Load));\n case ClassDef_kind:\n return validate_body(stmt->v.ClassDef.body, \"ClassDef\") &&\n validate_exprs(stmt->v.ClassDef.bases, Load, 0) &&\n validate_keywords(stmt->v.ClassDef.keywords) &&\n validate_exprs(stmt->v.ClassDef.decorator_list, Load, 0);\n case Return_kind:\n return !stmt->v.Return.value || validate_expr(stmt->v.Return.value, Load);\n case Delete_kind:\n return validate_assignlist(stmt->v.Delete.targets, Del);\n case Assign_kind:\n return validate_assignlist(stmt->v.Assign.targets, Store) &&\n validate_expr(stmt->v.Assign.value, Load);\n case AugAssign_kind:\n return validate_expr(stmt->v.AugAssign.target, Store) &&\n validate_expr(stmt->v.AugAssign.value, Load);\n case AnnAssign_kind:\n if (stmt->v.AnnAssign.target->kind != Name_kind &&\n stmt->v.AnnAssign.simple) {\n PyErr_SetString(PyExc_TypeError,\n \"AnnAssign with simple non-Name target\");\n return 0;\n }\n return validate_expr(stmt->v.AnnAssign.target, Store) &&\n (!stmt->v.AnnAssign.value ||\n validate_expr(stmt->v.AnnAssign.value, Load)) &&\n validate_expr(stmt->v.AnnAssign.annotation, Load);\n case For_kind:\n return validate_expr(stmt->v.For.target, Store) &&\n validate_expr(stmt->v.For.iter, Load) &&\n validate_body(stmt->v.For.body, \"For\") &&\n validate_stmts(stmt->v.For.orelse);\n case AsyncFor_kind:\n return validate_expr(stmt->v.AsyncFor.target, Store) &&\n validate_expr(stmt->v.AsyncFor.iter, Load) &&\n validate_body(stmt->v.AsyncFor.body, \"AsyncFor\") &&\n validate_stmts(stmt->v.AsyncFor.orelse);\n case While_kind:\n return validate_expr(stmt->v.While.test, Load) &&\n validate_body(stmt->v.While.body, \"While\") &&\n validate_stmts(stmt->v.While.orelse);\n case If_kind:\n return validate_expr(stmt->v.If.test, Load) &&\n validate_body(stmt->v.If.body, \"If\") &&\n validate_stmts(stmt->v.If.orelse);\n case With_kind:\n if (!validate_nonempty_seq(stmt->v.With.items, \"items\", \"With\"))\n return 0;\n for (i = 0; i < asdl_seq_LEN(stmt->v.With.items); i++) {\n withitem_ty item = asdl_seq_GET(stmt->v.With.items, i);\n if (!validate_expr(item->context_expr, Load) ||\n (item->optional_vars && !validate_expr(item->optional_vars, Store)))\n return 0;\n }\n return validate_body(stmt->v.With.body, \"With\");\n case AsyncWith_kind:\n if (!validate_nonempty_seq(stmt->v.AsyncWith.items, \"items\", \"AsyncWith\"))\n return 0;\n for (i = 0; i < asdl_seq_LEN(stmt->v.AsyncWith.items); i++) {\n withitem_ty item = asdl_seq_GET(stmt->v.AsyncWith.items, i);\n if (!validate_expr(item->context_expr, Load) ||\n (item->optional_vars && !validate_expr(item->optional_vars, Store)))\n return 0;\n }\n return validate_body(stmt->v.AsyncWith.body, \"AsyncWith\");\n case Raise_kind:\n if (stmt->v.Raise.exc) {\n return validate_expr(stmt->v.Raise.exc, Load) &&\n (!stmt->v.Raise.cause || validate_expr(stmt->v.Raise.cause, Load));\n }\n if (stmt->v.Raise.cause) {\n PyErr_SetString(PyExc_ValueError, \"Raise with cause but no exception\");\n return 0;\n }\n return 1;\n case Try_kind:\n if (!validate_body(stmt->v.Try.body, \"Try\"))\n return 0;\n if (!asdl_seq_LEN(stmt->v.Try.handlers) &&\n !asdl_seq_LEN(stmt->v.Try.finalbody)) {\n PyErr_SetString(PyExc_ValueError, \"Try has neither except handlers nor finalbody\");\n return 0;\n }\n if (!asdl_seq_LEN(stmt->v.Try.handlers) &&\n asdl_seq_LEN(stmt->v.Try.orelse)) {\n PyErr_SetString(PyExc_ValueError, \"Try has orelse but no except handlers\");\n return 0;\n }\n for (i = 0; i < asdl_seq_LEN(stmt->v.Try.handlers); i++) {\n excepthandler_ty handler = asdl_seq_GET(stmt->v.Try.handlers, i);\n if ((handler->v.ExceptHandler.type &&\n !validate_expr(handler->v.ExceptHandler.type, Load)) ||\n !validate_body(handler->v.ExceptHandler.body, \"ExceptHandler\"))\n return 0;\n }\n return (!asdl_seq_LEN(stmt->v.Try.finalbody) ||\n validate_stmts(stmt->v.Try.finalbody)) &&\n (!asdl_seq_LEN(stmt->v.Try.orelse) ||\n validate_stmts(stmt->v.Try.orelse));\n case Assert_kind:\n return validate_expr(stmt->v.Assert.test, Load) &&\n (!stmt->v.Assert.msg || validate_expr(stmt->v.Assert.msg, Load));\n case Import_kind:\n return validate_nonempty_seq(stmt->v.Import.names, \"names\", \"Import\");\n case ImportFrom_kind:\n if (stmt->v.ImportFrom.level < 0) {\n PyErr_SetString(PyExc_ValueError, \"Negative ImportFrom level\");\n return 0;\n }\n return validate_nonempty_seq(stmt->v.ImportFrom.names, \"names\", \"ImportFrom\");\n case Global_kind:\n return validate_nonempty_seq(stmt->v.Global.names, \"names\", \"Global\");\n case Nonlocal_kind:\n return validate_nonempty_seq(stmt->v.Nonlocal.names, \"names\", \"Nonlocal\");\n case Expr_kind:\n return validate_expr(stmt->v.Expr.value, Load);\n case AsyncFunctionDef_kind:\n return validate_body(stmt->v.AsyncFunctionDef.body, \"AsyncFunctionDef\") &&\n validate_arguments(stmt->v.AsyncFunctionDef.args) &&\n validate_exprs(stmt->v.AsyncFunctionDef.decorator_list, Load, 0) &&\n (!stmt->v.AsyncFunctionDef.returns ||\n validate_expr(stmt->v.AsyncFunctionDef.returns, Load));\n case Pass_kind:\n case Break_kind:\n case Continue_kind:\n return 1;\n default:\n PyErr_SetString(PyExc_SystemError, \"unexpected statement\");\n return 0;\n }\n}\n\nstatic int\nvalidate_stmts(asdl_seq *seq)\n{\n int i;\n for (i = 0; i < asdl_seq_LEN(seq); i++) {\n stmt_ty stmt = asdl_seq_GET(seq, i);\n if (stmt) {\n if (!validate_stmt(stmt))\n return 0;\n }\n else {\n PyErr_SetString(PyExc_ValueError,\n \"None disallowed in statement list\");\n return 0;\n }\n }\n return 1;\n}\n\nstatic int\nvalidate_exprs(asdl_seq *exprs, expr_context_ty ctx, int null_ok)\n{\n int i;\n for (i = 0; i < asdl_seq_LEN(exprs); i++) {\n expr_ty expr = asdl_seq_GET(exprs, i);\n if (expr) {\n if (!validate_expr(expr, ctx))\n return 0;\n }\n else if (!null_ok) {\n PyErr_SetString(PyExc_ValueError,\n \"None disallowed in expression list\");\n return 0;\n }\n\n }\n return 1;\n}\n\nint\nTa3AST_Validate(mod_ty mod)\n{\n int res = 0;\n\n switch (mod->kind) {\n case Module_kind:\n res = validate_stmts(mod->v.Module.body);\n break;\n case Interactive_kind:\n res = validate_stmts(mod->v.Interactive.body);\n break;\n case Expression_kind:\n res = validate_expr(mod->v.Expression.body, Load);\n break;\n case Suite_kind:\n PyErr_SetString(PyExc_ValueError, \"Suite is not valid in the CPython compiler\");\n break;\n default:\n PyErr_SetString(PyExc_SystemError, \"impossible module node\");\n res = 0;\n break;\n }\n return res;\n}\n\n/* This is done here, so defines like \"test\" don't interfere with AST use above. */\n#include \"grammar.h\"\n#include \"parsetok.h\"\n#include \"graminit.h\"\n\n/* Data structure used internally */\nstruct compiling {\n PyArena *c_arena; /* Arena for allocating memory. */\n PyObject *c_filename; /* filename */\n PyObject *c_normalize; /* Normalization function from unicodedata. */\n int c_feature_version; /* Latest minior version of Python for allowed features */\n};\n\nstatic asdl_seq *seq_for_testlist(struct compiling *, const node *);\nstatic expr_ty ast_for_expr(struct compiling *, const node *);\nstatic stmt_ty ast_for_stmt(struct compiling *, const node *);\nstatic asdl_seq *ast_for_suite(struct compiling *c, const node *n);\nstatic asdl_seq *ast_for_exprlist(struct compiling *, const node *,\n expr_context_ty);\nstatic expr_ty ast_for_testlist(struct compiling *, const node *);\nstatic stmt_ty ast_for_classdef(struct compiling *, const node *, asdl_seq *);\n\nstatic stmt_ty ast_for_with_stmt(struct compiling *, const node *, bool);\nstatic stmt_ty ast_for_for_stmt(struct compiling *, const node *, bool);\n\n/* Note different signature for ast_for_call */\nstatic expr_ty ast_for_call(struct compiling *, const node *, expr_ty, bool);\n\nstatic PyObject *parsenumber(struct compiling *, const char *);\nstatic expr_ty parsestrplus(struct compiling *, const node *n);\n\n#define COMP_GENEXP 0\n#define COMP_LISTCOMP 1\n#define COMP_SETCOMP 2\n\nstatic int\ninit_normalization(struct compiling *c)\n{\n PyObject *m = PyImport_ImportModuleNoBlock(\"unicodedata\");\n if (!m)\n return 0;\n c->c_normalize = PyObject_GetAttrString(m, \"normalize\");\n Py_DECREF(m);\n if (!c->c_normalize)\n return 0;\n return 1;\n}\n\nstatic identifier\nnew_identifier(const char *n, struct compiling *c)\n{\n PyObject *id = PyUnicode_DecodeUTF8(n, strlen(n), NULL);\n if (!id)\n return NULL;\n /* PyUnicode_DecodeUTF8 should always return a ready string. */\n assert(PyUnicode_IS_READY(id));\n /* Check whether there are non-ASCII characters in the\n identifier; if so, normalize to NFKC. */\n if (!PyUnicode_IS_ASCII(id)) {\n PyObject *id2;\n PyObject *form;\n PyObject *args[2];\n _Py_IDENTIFIER(NFKC);\n if (!c->c_normalize && !init_normalization(c)) {\n Py_DECREF(id);\n return NULL;\n }\n form = _PyUnicode_FromId(&PyId_NFKC);\n if (form == NULL) {\n Py_DECREF(id);\n return NULL;\n }\n args[0] = form;\n args[1] = id;\n id2 = _PyObject_FastCall(c->c_normalize, args, 2);\n Py_DECREF(id);\n if (!id2)\n return NULL;\n if (!PyUnicode_Check(id2)) {\n PyErr_Format(PyExc_TypeError,\n \"unicodedata.normalize() must return a string, not \"\n \"%.200s\",\n Py_TYPE(id2)->tp_name);\n Py_DECREF(id2);\n return NULL;\n }\n id = id2;\n }\n PyUnicode_InternInPlace(&id);\n if (PyArena_AddPyObject(c->c_arena, id) < 0) {\n Py_DECREF(id);\n return NULL;\n }\n return id;\n}\n\n#define NEW_IDENTIFIER(n) new_identifier(STR(n), c)\n\nstatic string\nnew_type_comment(const char *s, struct compiling *c)\n{\n return PyUnicode_DecodeUTF8(s, strlen(s), NULL);\n}\n#define NEW_TYPE_COMMENT(n) new_type_comment(STR(n), c)\n\nstatic int\nast_error(struct compiling *c, const node *n, const char *errmsg)\n{\n PyObject *value, *errstr, *loc, *tmp;\n\n loc = PyErr_ProgramTextObject(c->c_filename, LINENO(n));\n if (!loc) {\n Py_INCREF(Py_None);\n loc = Py_None;\n }\n tmp = Py_BuildValue(\"(OiiN)\", c->c_filename, LINENO(n), n->n_col_offset, loc);\n if (!tmp)\n return 0;\n errstr = PyUnicode_FromString(errmsg);\n if (!errstr) {\n Py_DECREF(tmp);\n return 0;\n }\n value = PyTuple_Pack(2, errstr, tmp);\n Py_DECREF(errstr);\n Py_DECREF(tmp);\n if (value) {\n PyErr_SetObject(PyExc_SyntaxError, value);\n Py_DECREF(value);\n }\n return 0;\n}\n\n/* num_stmts() returns number of contained statements.\n\n Use this routine to determine how big a sequence is needed for\n the statements in a parse tree. Its raison d'etre is this bit of\n grammar:\n\n stmt: simple_stmt | compound_stmt\n simple_stmt: small_stmt (';' small_stmt)* [';'] NEWLINE\n\n A simple_stmt can contain multiple small_stmt elements joined\n by semicolons. If the arg is a simple_stmt, the number of\n small_stmt elements is returned.\n*/\n\nstatic int\nnum_stmts(const node *n)\n{\n int i, l;\n node *ch;\n\n switch (TYPE(n)) {\n case single_input:\n if (TYPE(CHILD(n, 0)) == NEWLINE)\n return 0;\n else\n return num_stmts(CHILD(n, 0));\n case file_input:\n l = 0;\n for (i = 0; i < NCH(n); i++) {\n ch = CHILD(n, i);\n if (TYPE(ch) == stmt)\n l += num_stmts(ch);\n }\n return l;\n case stmt:\n return num_stmts(CHILD(n, 0));\n case compound_stmt:\n return 1;\n case simple_stmt:\n return NCH(n) / 2; /* Divide by 2 to remove count of semi-colons */\n case suite:\n /* suite: simple_stmt | NEWLINE [TYPE_COMMENT NEWLINE] INDENT stmt+ DEDENT */\n if (NCH(n) == 1)\n return num_stmts(CHILD(n, 0));\n else {\n i = 2;\n l = 0;\n if (TYPE(CHILD(n, 1)) == TYPE_COMMENT)\n i += 2;\n for (; i < (NCH(n) - 1); i++)\n l += num_stmts(CHILD(n, i));\n return l;\n }\n default: {\n char buf[128];\n\n sprintf(buf, \"Non-statement found: %d %d\",\n TYPE(n), NCH(n));\n Py_FatalError(buf);\n }\n }\n abort();\n}\n\n/* Transform the CST rooted at node * to the appropriate AST\n*/\n\nmod_ty\nTa3AST_FromNodeObject(const node *n, PyCompilerFlags *flags,\n PyObject *filename, int feature_version,\n PyArena *arena)\n{\n int i, j, k, num;\n asdl_seq *stmts = NULL;\n asdl_seq *type_ignores = NULL;\n stmt_ty s;\n node *ch;\n struct compiling c;\n mod_ty res = NULL;\n asdl_seq *argtypes = NULL;\n expr_ty ret, arg;\n\n c.c_arena = arena;\n /* borrowed reference */\n c.c_filename = filename;\n c.c_normalize = NULL;\n c.c_feature_version = feature_version;\n\n if (TYPE(n) == encoding_decl)\n n = CHILD(n, 0);\n\n k = 0;\n switch (TYPE(n)) {\n case file_input:\n stmts = _Ta3_asdl_seq_new(num_stmts(n), arena);\n if (!stmts)\n goto out;\n for (i = 0; i < NCH(n) - 1; i++) {\n ch = CHILD(n, i);\n if (TYPE(ch) == NEWLINE)\n continue;\n REQ(ch, stmt);\n num = num_stmts(ch);\n if (num == 1) {\n s = ast_for_stmt(&c, ch);\n if (!s)\n goto out;\n asdl_seq_SET(stmts, k++, s);\n }\n else {\n ch = CHILD(ch, 0);\n REQ(ch, simple_stmt);\n for (j = 0; j < num; j++) {\n s = ast_for_stmt(&c, CHILD(ch, j * 2));\n if (!s)\n goto out;\n asdl_seq_SET(stmts, k++, s);\n }\n }\n }\n\n /* Type ignores are stored under the ENDMARKER in file_input. */\n ch = CHILD(n, NCH(n) - 1);\n REQ(ch, ENDMARKER);\n num = NCH(ch);\n type_ignores = _Ta3_asdl_seq_new(num, arena);\n if (!type_ignores)\n goto out;\n\n for (i = 0; i < num; i++) {\n type_ignore_ty ti = TypeIgnore(LINENO(CHILD(ch, i)), arena);\n if (!ti)\n goto out;\n asdl_seq_SET(type_ignores, i, ti);\n }\n\n res = Module(stmts, type_ignores, arena);\n break;\n case eval_input: {\n expr_ty testlist_ast;\n\n /* XXX Why not comp_for here? */\n testlist_ast = ast_for_testlist(&c, CHILD(n, 0));\n if (!testlist_ast)\n goto out;\n res = Expression(testlist_ast, arena);\n break;\n }\n case single_input:\n if (TYPE(CHILD(n, 0)) == NEWLINE) {\n stmts = _Ta3_asdl_seq_new(1, arena);\n if (!stmts)\n goto out;\n asdl_seq_SET(stmts, 0, Pass(n->n_lineno, n->n_col_offset,\n arena));\n if (!asdl_seq_GET(stmts, 0))\n goto out;\n res = Interactive(stmts, arena);\n }\n else {\n n = CHILD(n, 0);\n num = num_stmts(n);\n stmts = _Ta3_asdl_seq_new(num, arena);\n if (!stmts)\n goto out;\n if (num == 1) {\n s = ast_for_stmt(&c, n);\n if (!s)\n goto out;\n asdl_seq_SET(stmts, 0, s);\n }\n else {\n /* Only a simple_stmt can contain multiple statements. */\n REQ(n, simple_stmt);\n for (i = 0; i < NCH(n); i += 2) {\n if (TYPE(CHILD(n, i)) == NEWLINE)\n break;\n s = ast_for_stmt(&c, CHILD(n, i));\n if (!s)\n goto out;\n asdl_seq_SET(stmts, i / 2, s);\n }\n }\n\n res = Interactive(stmts, arena);\n }\n break;\n case func_type_input:\n n = CHILD(n, 0);\n REQ(n, func_type);\n\n if (TYPE(CHILD(n, 1)) == typelist) {\n ch = CHILD(n, 1);\n /* this is overly permissive -- we don't pay any attention to\n * stars on the args -- just parse them into an ordered list */\n num = 0;\n for (i = 0; i < NCH(ch); i++) {\n if (TYPE(CHILD(ch, i)) == test)\n num++;\n }\n\n argtypes = _Ta3_asdl_seq_new(num, arena);\n\n j = 0;\n for (i = 0; i < NCH(ch); i++) {\n if (TYPE(CHILD(ch, i)) == test) {\n arg = ast_for_expr(&c, CHILD(ch, i));\n if (!arg)\n goto out;\n asdl_seq_SET(argtypes, j++, arg);\n }\n }\n }\n else\n argtypes = _Ta3_asdl_seq_new(0, arena);\n\n ret = ast_for_expr(&c, CHILD(n, NCH(n) - 1));\n if (!ret)\n goto out;\n res = FunctionType(argtypes, ret, arena);\n break;\n default:\n PyErr_Format(PyExc_SystemError,\n \"invalid node %d for Ta3AST_FromNode\", TYPE(n));\n goto out;\n }\n out:\n if (c.c_normalize) {\n Py_DECREF(c.c_normalize);\n }\n return res;\n}\n\nmod_ty\nTa3AST_FromNode(const node *n, PyCompilerFlags *flags, const char *filename_str,\n int feature_version, PyArena *arena)\n{\n mod_ty mod;\n PyObject *filename;\n filename = PyUnicode_DecodeFSDefault(filename_str);\n if (filename == NULL)\n return NULL;\n mod = Ta3AST_FromNodeObject(n, flags, filename, feature_version, arena);\n Py_DECREF(filename);\n return mod;\n\n}\n\n/* Return the AST repr. of the operator represented as syntax (|, ^, etc.)\n*/\n\nstatic operator_ty\nget_operator(struct compiling *c, const node *n)\n{\n switch (TYPE(n)) {\n case VBAR:\n return BitOr;\n case CIRCUMFLEX:\n return BitXor;\n case AMPER:\n return BitAnd;\n case LEFTSHIFT:\n return LShift;\n case RIGHTSHIFT:\n return RShift;\n case PLUS:\n return Add;\n case MINUS:\n return Sub;\n case STAR:\n return Mult;\n case AT:\n if (c->c_feature_version < 5) {\n ast_error(c, n,\n \"The '@' operator is only supported in Python 3.5 and greater\");\n return (operator_ty)0;\n }\n return MatMult;\n case SLASH:\n return Div;\n case DOUBLESLASH:\n return FloorDiv;\n case PERCENT:\n return Mod;\n default:\n return (operator_ty)0;\n }\n}\n\nstatic const char * const FORBIDDEN[] = {\n \"None\",\n \"True\",\n \"False\",\n NULL,\n};\n\nstatic int\nforbidden_name(struct compiling *c, identifier name, const node *n,\n int full_checks)\n{\n assert(PyUnicode_Check(name));\n if (_PyUnicode_EqualToASCIIString(name, \"__debug__\")) {\n ast_error(c, n, \"assignment to keyword\");\n return 1;\n }\n if (full_checks) {\n const char * const *p;\n for (p = FORBIDDEN; *p; p++) {\n if (_PyUnicode_EqualToASCIIString(name, *p)) {\n ast_error(c, n, \"assignment to keyword\");\n return 1;\n }\n }\n }\n return 0;\n}\n\n/* Set the context ctx for expr_ty e, recursively traversing e.\n\n Only sets context for expr kinds that \"can appear in assignment context\"\n (according to ../Parser/Python.asdl). For other expr kinds, it sets\n an appropriate syntax error and returns false.\n*/\n\nstatic int\nset_context(struct compiling *c, expr_ty e, expr_context_ty ctx, const node *n)\n{\n asdl_seq *s = NULL;\n /* If a particular expression type can't be used for assign / delete,\n set expr_name to its name and an error message will be generated.\n */\n const char* expr_name = NULL;\n\n /* The ast defines augmented store and load contexts, but the\n implementation here doesn't actually use them. The code may be\n a little more complex than necessary as a result. It also means\n that expressions in an augmented assignment have a Store context.\n Consider restructuring so that augmented assignment uses\n set_context(), too.\n */\n assert(ctx != AugStore && ctx != AugLoad);\n\n switch (e->kind) {\n case Attribute_kind:\n e->v.Attribute.ctx = ctx;\n if (ctx == Store && forbidden_name(c, e->v.Attribute.attr, n, 1))\n return 0;\n break;\n case Subscript_kind:\n e->v.Subscript.ctx = ctx;\n break;\n case Starred_kind:\n e->v.Starred.ctx = ctx;\n if (!set_context(c, e->v.Starred.value, ctx, n))\n return 0;\n break;\n case Name_kind:\n if (ctx == Store) {\n if (forbidden_name(c, e->v.Name.id, n, 0))\n return 0; /* forbidden_name() calls ast_error() */\n }\n e->v.Name.ctx = ctx;\n break;\n case List_kind:\n e->v.List.ctx = ctx;\n s = e->v.List.elts;\n break;\n case Tuple_kind:\n e->v.Tuple.ctx = ctx;\n s = e->v.Tuple.elts;\n break;\n case Lambda_kind:\n expr_name = \"lambda\";\n break;\n case Call_kind:\n expr_name = \"function call\";\n break;\n case BoolOp_kind:\n case BinOp_kind:\n case UnaryOp_kind:\n expr_name = \"operator\";\n break;\n case GeneratorExp_kind:\n expr_name = \"generator expression\";\n break;\n case Yield_kind:\n case YieldFrom_kind:\n expr_name = \"yield expression\";\n break;\n case Await_kind:\n expr_name = \"await expression\";\n break;\n case ListComp_kind:\n expr_name = \"list comprehension\";\n break;\n case SetComp_kind:\n expr_name = \"set comprehension\";\n break;\n case DictComp_kind:\n expr_name = \"dict comprehension\";\n break;\n case Dict_kind:\n case Set_kind:\n case Num_kind:\n case Str_kind:\n case Bytes_kind:\n case JoinedStr_kind:\n case FormattedValue_kind:\n expr_name = \"literal\";\n break;\n case NameConstant_kind:\n expr_name = \"keyword\";\n break;\n case Ellipsis_kind:\n expr_name = \"Ellipsis\";\n break;\n case Compare_kind:\n expr_name = \"comparison\";\n break;\n case IfExp_kind:\n expr_name = \"conditional expression\";\n break;\n default:\n PyErr_Format(PyExc_SystemError,\n \"unexpected expression in assignment %d (line %d)\",\n e->kind, e->lineno);\n return 0;\n }\n /* Check for error string set by switch */\n if (expr_name) {\n char buf[300];\n PyOS_snprintf(buf, sizeof(buf),\n \"can't %s %s\",\n ctx == Store ? \"assign to\" : \"delete\",\n expr_name);\n return ast_error(c, n, buf);\n }\n\n /* If the LHS is a list or tuple, we need to set the assignment\n context for all the contained elements.\n */\n if (s) {\n int i;\n\n for (i = 0; i < asdl_seq_LEN(s); i++) {\n if (!set_context(c, (expr_ty)asdl_seq_GET(s, i), ctx, n))\n return 0;\n }\n }\n return 1;\n}\n\nstatic operator_ty\nast_for_augassign(struct compiling *c, const node *n)\n{\n REQ(n, augassign);\n n = CHILD(n, 0);\n switch (STR(n)[0]) {\n case '+':\n return Add;\n case '-':\n return Sub;\n case '/':\n if (STR(n)[1] == '/')\n return FloorDiv;\n else\n return Div;\n case '%':\n return Mod;\n case '<':\n return LShift;\n case '>':\n return RShift;\n case '&':\n return BitAnd;\n case '^':\n return BitXor;\n case '|':\n return BitOr;\n case '*':\n if (STR(n)[1] == '*')\n return Pow;\n else\n return Mult;\n case '@':\n if (c->c_feature_version < 5) {\n ast_error(c, n,\n \"The '@' operator is only supported in Python 3.5 and greater\");\n return (operator_ty)0;\n }\n return MatMult;\n default:\n PyErr_Format(PyExc_SystemError, \"invalid augassign: %s\", STR(n));\n return (operator_ty)0;\n }\n}\n\nstatic cmpop_ty\nast_for_comp_op(struct compiling *c, const node *n)\n{\n /* comp_op: '<'|'>'|'=='|'>='|'<='|'!='|'in'|'not' 'in'|'is'\n |'is' 'not'\n */\n REQ(n, comp_op);\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n switch (TYPE(n)) {\n case LESS:\n return Lt;\n case GREATER:\n return Gt;\n case EQEQUAL: /* == */\n return Eq;\n case LESSEQUAL:\n return LtE;\n case GREATEREQUAL:\n return GtE;\n case NOTEQUAL:\n return NotEq;\n case NAME:\n if (strcmp(STR(n), \"in\") == 0)\n return In;\n if (strcmp(STR(n), \"is\") == 0)\n return Is;\n /* fall through */\n default:\n PyErr_Format(PyExc_SystemError, \"invalid comp_op: %s\",\n STR(n));\n return (cmpop_ty)0;\n }\n }\n else if (NCH(n) == 2) {\n /* handle \"not in\" and \"is not\" */\n switch (TYPE(CHILD(n, 0))) {\n case NAME:\n if (strcmp(STR(CHILD(n, 1)), \"in\") == 0)\n return NotIn;\n if (strcmp(STR(CHILD(n, 0)), \"is\") == 0)\n return IsNot;\n /* fall through */\n default:\n PyErr_Format(PyExc_SystemError, \"invalid comp_op: %s %s\",\n STR(CHILD(n, 0)), STR(CHILD(n, 1)));\n return (cmpop_ty)0;\n }\n }\n PyErr_Format(PyExc_SystemError, \"invalid comp_op: has %d children\",\n NCH(n));\n return (cmpop_ty)0;\n}\n\nstatic asdl_seq *\nseq_for_testlist(struct compiling *c, const node *n)\n{\n /* testlist: test (',' test)* [',']\n testlist_star_expr: test|star_expr (',' test|star_expr)* [',']\n */\n asdl_seq *seq;\n expr_ty expression;\n int i;\n assert(TYPE(n) == testlist || TYPE(n) == testlist_star_expr || TYPE(n) == testlist_comp);\n\n seq = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!seq)\n return NULL;\n\n for (i = 0; i < NCH(n); i += 2) {\n const node *ch = CHILD(n, i);\n assert(TYPE(ch) == test || TYPE(ch) == test_nocond || TYPE(ch) == star_expr);\n\n expression = ast_for_expr(c, ch);\n if (!expression)\n return NULL;\n\n assert(i / 2 < seq->size);\n asdl_seq_SET(seq, i / 2, expression);\n }\n return seq;\n}\n\nstatic arg_ty\nast_for_arg(struct compiling *c, const node *n)\n{\n identifier name;\n expr_ty annotation = NULL;\n node *ch;\n arg_ty ret;\n\n assert(TYPE(n) == tfpdef || TYPE(n) == vfpdef);\n ch = CHILD(n, 0);\n name = NEW_IDENTIFIER(ch);\n if (!name)\n return NULL;\n if (forbidden_name(c, name, ch, 0))\n return NULL;\n\n if (NCH(n) == 3 && TYPE(CHILD(n, 1)) == COLON) {\n annotation = ast_for_expr(c, CHILD(n, 2));\n if (!annotation)\n return NULL;\n }\n\n ret = arg(name, annotation, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n if (!ret)\n return NULL;\n return ret;\n}\n\n/* returns -1 if failed to handle keyword only arguments\n returns new position to keep processing if successful\n (',' tfpdef ['=' test])*\n ^^^\n start pointing here\n */\nstatic int\nhandle_keywordonly_args(struct compiling *c, const node *n, int start,\n asdl_seq *kwonlyargs, asdl_seq *kwdefaults)\n{\n PyObject *argname;\n node *ch;\n expr_ty expression, annotation;\n arg_ty arg;\n int i = start;\n int j = 0; /* index for kwdefaults and kwonlyargs */\n\n if (kwonlyargs == NULL) {\n ast_error(c, CHILD(n, start), \"named arguments must follow bare *\");\n return -1;\n }\n assert(kwdefaults != NULL);\n while (i < NCH(n)) {\n ch = CHILD(n, i);\n switch (TYPE(ch)) {\n case vfpdef:\n case tfpdef:\n if (i + 1 < NCH(n) && TYPE(CHILD(n, i + 1)) == EQUAL) {\n expression = ast_for_expr(c, CHILD(n, i + 2));\n if (!expression)\n goto error;\n asdl_seq_SET(kwdefaults, j, expression);\n i += 2; /* '=' and test */\n }\n else { /* setting NULL if no default value exists */\n asdl_seq_SET(kwdefaults, j, NULL);\n }\n if (NCH(ch) == 3) {\n /* ch is NAME ':' test */\n annotation = ast_for_expr(c, CHILD(ch, 2));\n if (!annotation)\n goto error;\n }\n else {\n annotation = NULL;\n }\n ch = CHILD(ch, 0);\n argname = NEW_IDENTIFIER(ch);\n if (!argname)\n goto error;\n if (forbidden_name(c, argname, ch, 0))\n goto error;\n arg = arg(argname, annotation, NULL, LINENO(ch), ch->n_col_offset,\n c->c_arena);\n if (!arg)\n goto error;\n asdl_seq_SET(kwonlyargs, j++, arg);\n i += 1; /* the name */\n if (TYPE(CHILD(n, i)) == COMMA)\n i += 1; /* the comma, if present */\n break;\n case TYPE_COMMENT:\n /* arg will be equal to the last argument processed */\n arg->type_comment = NEW_TYPE_COMMENT(ch);\n i += 1;\n break;\n case DOUBLESTAR:\n return i;\n default:\n ast_error(c, ch, \"unexpected node\");\n goto error;\n }\n }\n return i;\n error:\n return -1;\n}\n\n/* Create AST for argument list. */\n\nstatic arguments_ty\nast_for_arguments(struct compiling *c, const node *n)\n{\n /* This function handles both typedargslist (function definition)\n and varargslist (lambda definition).\n\n parameters: '(' [typedargslist] ')'\n typedargslist: (tfpdef ['=' test] (',' tfpdef ['=' test])* [',' [\n '*' [tfpdef] (',' tfpdef ['=' test])* [',' ['**' tfpdef [',']]]\n | '**' tfpdef [',']]]\n | '*' [tfpdef] (',' tfpdef ['=' test])* [',' ['**' tfpdef [',']]]\n | '**' tfpdef [','])\n tfpdef: NAME [':' test]\n varargslist: (vfpdef ['=' test] (',' vfpdef ['=' test])* [',' [\n '*' [vfpdef] (',' vfpdef ['=' test])* [',' ['**' vfpdef [',']]]\n | '**' vfpdef [',']]]\n | '*' [vfpdef] (',' vfpdef ['=' test])* [',' ['**' vfpdef [',']]]\n | '**' vfpdef [',']\n )\n vfpdef: NAME\n\n */\n int i, j, k, nposargs = 0, nkwonlyargs = 0;\n int nposdefaults = 0, found_default = 0;\n asdl_seq *posargs, *posdefaults, *kwonlyargs, *kwdefaults;\n arg_ty vararg = NULL, kwarg = NULL;\n arg_ty arg;\n node *ch;\n\n if (TYPE(n) == parameters) {\n if (NCH(n) == 2) /* () as argument list */\n return arguments(NULL, NULL, NULL, NULL, NULL, NULL, c->c_arena);\n n = CHILD(n, 1);\n }\n assert(TYPE(n) == typedargslist || TYPE(n) == varargslist);\n\n /* First count the number of positional args & defaults. The\n variable i is the loop index for this for loop and the next.\n The next loop picks up where the first leaves off.\n */\n for (i = 0; i < NCH(n); i++) {\n ch = CHILD(n, i);\n if (TYPE(ch) == STAR) {\n /* skip star */\n i++;\n if (i < NCH(n) && /* skip argument following star */\n (TYPE(CHILD(n, i)) == tfpdef ||\n TYPE(CHILD(n, i)) == vfpdef)) {\n i++;\n }\n break;\n }\n if (TYPE(ch) == DOUBLESTAR) break;\n if (TYPE(ch) == vfpdef || TYPE(ch) == tfpdef) nposargs++;\n if (TYPE(ch) == EQUAL) nposdefaults++;\n }\n /* count the number of keyword only args &\n defaults for keyword only args */\n for ( ; i < NCH(n); ++i) {\n ch = CHILD(n, i);\n if (TYPE(ch) == DOUBLESTAR) break;\n if (TYPE(ch) == tfpdef || TYPE(ch) == vfpdef) nkwonlyargs++;\n }\n posargs = (nposargs ? _Ta3_asdl_seq_new(nposargs, c->c_arena) : NULL);\n if (!posargs && nposargs)\n return NULL;\n kwonlyargs = (nkwonlyargs ?\n _Ta3_asdl_seq_new(nkwonlyargs, c->c_arena) : NULL);\n if (!kwonlyargs && nkwonlyargs)\n return NULL;\n posdefaults = (nposdefaults ?\n _Ta3_asdl_seq_new(nposdefaults, c->c_arena) : NULL);\n if (!posdefaults && nposdefaults)\n return NULL;\n /* The length of kwonlyargs and kwdefaults are same\n since we set NULL as default for keyword only argument w/o default\n - we have sequence data structure, but no dictionary */\n kwdefaults = (nkwonlyargs ?\n _Ta3_asdl_seq_new(nkwonlyargs, c->c_arena) : NULL);\n if (!kwdefaults && nkwonlyargs)\n return NULL;\n\n /* tfpdef: NAME [':' test]\n vfpdef: NAME\n */\n i = 0;\n j = 0; /* index for defaults */\n k = 0; /* index for args */\n while (i < NCH(n)) {\n ch = CHILD(n, i);\n switch (TYPE(ch)) {\n case tfpdef:\n case vfpdef:\n /* XXX Need to worry about checking if TYPE(CHILD(n, i+1)) is\n anything other than EQUAL or a comma? */\n /* XXX Should NCH(n) check be made a separate check? */\n if (i + 1 < NCH(n) && TYPE(CHILD(n, i + 1)) == EQUAL) {\n expr_ty expression = ast_for_expr(c, CHILD(n, i + 2));\n if (!expression)\n return NULL;\n assert(posdefaults != NULL);\n asdl_seq_SET(posdefaults, j++, expression);\n i += 2;\n found_default = 1;\n }\n else if (found_default) {\n ast_error(c, n,\n \"non-default argument follows default argument\");\n return NULL;\n }\n arg = ast_for_arg(c, ch);\n if (!arg)\n return NULL;\n asdl_seq_SET(posargs, k++, arg);\n i += 1; /* the name */\n if (TYPE(CHILD(n, i)) == COMMA)\n i += 1; /* the comma, if present */\n break;\n case STAR:\n if (i+1 >= NCH(n) ||\n (i+2 == NCH(n) && (TYPE(CHILD(n, i+1)) == COMMA\n || TYPE(CHILD(n, i+1)) == TYPE_COMMENT))) {\n ast_error(c, CHILD(n, i),\n \"named arguments must follow bare *\");\n return NULL;\n }\n ch = CHILD(n, i+1); /* tfpdef or COMMA */\n if (TYPE(ch) == COMMA) {\n int res = 0;\n i += 2; /* now follows keyword only arguments */\n\n if (TYPE(CHILD(n, i)) == TYPE_COMMENT) {\n ast_error(c, CHILD(n, i),\n \"bare * has associated type comment\");\n return NULL;\n }\n\n res = handle_keywordonly_args(c, n, i,\n kwonlyargs, kwdefaults);\n if (res == -1) return NULL;\n i = res; /* res has new position to process */\n }\n else {\n vararg = ast_for_arg(c, ch);\n if (!vararg)\n return NULL;\n\n i += 2; /* the star and the name */\n if (TYPE(CHILD(n, i)) == COMMA)\n i += 1; /* the comma, if present */\n\n if (TYPE(CHILD(n, i)) == TYPE_COMMENT) {\n vararg->type_comment = NEW_TYPE_COMMENT(CHILD(n, i));\n i += 1;\n }\n\n if (i < NCH(n) && (TYPE(CHILD(n, i)) == tfpdef\n || TYPE(CHILD(n, i)) == vfpdef)) {\n int res = 0;\n res = handle_keywordonly_args(c, n, i,\n kwonlyargs, kwdefaults);\n if (res == -1) return NULL;\n i = res; /* res has new position to process */\n }\n }\n break;\n case DOUBLESTAR:\n ch = CHILD(n, i+1); /* tfpdef */\n assert(TYPE(ch) == tfpdef || TYPE(ch) == vfpdef);\n kwarg = ast_for_arg(c, ch);\n if (!kwarg)\n return NULL;\n i += 2; /* the double star and the name */\n if (TYPE(CHILD(n, i)) == COMMA)\n i += 1; /* the comma, if present */\n break;\n case TYPE_COMMENT:\n assert(i);\n\n if (kwarg)\n arg = kwarg;\n\n /* arg will be equal to the last argument processed */\n arg->type_comment = NEW_TYPE_COMMENT(ch);\n i += 1;\n break;\n default:\n PyErr_Format(PyExc_SystemError,\n \"unexpected node in varargslist: %d @ %d\",\n TYPE(ch), i);\n return NULL;\n }\n }\n return arguments(posargs, vararg, kwonlyargs, kwdefaults, kwarg, posdefaults, c->c_arena);\n}\n\nstatic expr_ty\nast_for_dotted_name(struct compiling *c, const node *n)\n{\n expr_ty e;\n identifier id;\n int lineno, col_offset;\n int i;\n\n REQ(n, dotted_name);\n\n lineno = LINENO(n);\n col_offset = n->n_col_offset;\n\n id = NEW_IDENTIFIER(CHILD(n, 0));\n if (!id)\n return NULL;\n e = Name(id, Load, lineno, col_offset, c->c_arena);\n if (!e)\n return NULL;\n\n for (i = 2; i < NCH(n); i+=2) {\n id = NEW_IDENTIFIER(CHILD(n, i));\n if (!id)\n return NULL;\n e = Attribute(e, id, Load, lineno, col_offset, c->c_arena);\n if (!e)\n return NULL;\n }\n\n return e;\n}\n\nstatic expr_ty\nast_for_decorator(struct compiling *c, const node *n)\n{\n /* decorator: '@' dotted_name [ '(' [arglist] ')' ] NEWLINE */\n expr_ty d = NULL;\n expr_ty name_expr;\n\n REQ(n, decorator);\n REQ(CHILD(n, 0), AT);\n REQ(RCHILD(n, -1), NEWLINE);\n\n name_expr = ast_for_dotted_name(c, CHILD(n, 1));\n if (!name_expr)\n return NULL;\n\n if (NCH(n) == 3) { /* No arguments */\n d = name_expr;\n name_expr = NULL;\n }\n else if (NCH(n) == 5) { /* Call with no arguments */\n d = Call(name_expr, NULL, NULL, LINENO(n),\n n->n_col_offset, c->c_arena);\n if (!d)\n return NULL;\n name_expr = NULL;\n }\n else {\n d = ast_for_call(c, CHILD(n, 3), name_expr, true);\n if (!d)\n return NULL;\n name_expr = NULL;\n }\n\n return d;\n}\n\nstatic asdl_seq*\nast_for_decorators(struct compiling *c, const node *n)\n{\n asdl_seq* decorator_seq;\n expr_ty d;\n int i;\n\n REQ(n, decorators);\n decorator_seq = _Ta3_asdl_seq_new(NCH(n), c->c_arena);\n if (!decorator_seq)\n return NULL;\n\n for (i = 0; i < NCH(n); i++) {\n d = ast_for_decorator(c, CHILD(n, i));\n if (!d)\n return NULL;\n asdl_seq_SET(decorator_seq, i, d);\n }\n return decorator_seq;\n}\n\nstatic stmt_ty\nast_for_funcdef_impl(struct compiling *c, const node *n0,\n asdl_seq *decorator_seq, bool is_async)\n{\n /* funcdef: 'def' NAME parameters ['->' test] ':' [TYPE_COMMENT] suite */\n const node * const n = is_async ? CHILD(n0, 1) : n0;\n identifier name;\n arguments_ty args;\n asdl_seq *body;\n expr_ty returns = NULL;\n int name_i = 1;\n node *tc;\n string type_comment = NULL;\n\n if (is_async && c->c_feature_version < 5) {\n ast_error(c, n,\n \"Async functions are only supported in Python 3.5 and greater\");\n return NULL;\n }\n\n REQ(n, funcdef);\n\n name = NEW_IDENTIFIER(CHILD(n, name_i));\n if (!name)\n return NULL;\n if (forbidden_name(c, name, CHILD(n, name_i), 0))\n return NULL;\n args = ast_for_arguments(c, CHILD(n, name_i + 1));\n if (!args)\n return NULL;\n if (TYPE(CHILD(n, name_i+2)) == RARROW) {\n returns = ast_for_expr(c, CHILD(n, name_i + 3));\n if (!returns)\n return NULL;\n name_i += 2;\n }\n if (TYPE(CHILD(n, name_i + 3)) == TYPE_COMMENT) {\n type_comment = NEW_TYPE_COMMENT(CHILD(n, name_i + 3));\n name_i += 1;\n }\n body = ast_for_suite(c, CHILD(n, name_i + 3));\n if (!body)\n return NULL;\n\n if (!type_comment && NCH(CHILD(n, name_i + 3)) > 1) {\n /* If the function doesn't have a type comment on the same line, check\n * if the suite has a type comment in it. */\n tc = CHILD(CHILD(n, name_i + 3), 1);\n\n if (TYPE(tc) == TYPE_COMMENT)\n type_comment = NEW_TYPE_COMMENT(tc);\n }\n\n if (is_async)\n return AsyncFunctionDef(name, args, body, decorator_seq, returns,\n type_comment, LINENO(n0), n0->n_col_offset, c->c_arena);\n else\n return FunctionDef(name, args, body, decorator_seq, returns,\n type_comment, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_async_funcdef(struct compiling *c, const node *n, asdl_seq *decorator_seq)\n{\n /* async_funcdef: 'async' funcdef */\n REQ(n, async_funcdef);\n REQ(CHILD(n, 0), NAME);\n assert(strcmp(STR(CHILD(n, 0)), \"async\") == 0);\n REQ(CHILD(n, 1), funcdef);\n\n return ast_for_funcdef_impl(c, n, decorator_seq,\n true /* is_async */);\n}\n\nstatic stmt_ty\nast_for_funcdef(struct compiling *c, const node *n, asdl_seq *decorator_seq)\n{\n /* funcdef: 'def' NAME parameters ['->' test] ':' suite */\n return ast_for_funcdef_impl(c, n, decorator_seq,\n false /* is_async */);\n}\n\n\nstatic stmt_ty\nast_for_async_stmt(struct compiling *c, const node *n)\n{\n /* async_stmt: 'async' (funcdef | with_stmt | for_stmt) */\n REQ(n, async_stmt);\n REQ(CHILD(n, 0), NAME);\n assert(strcmp(STR(CHILD(n, 0)), \"async\") == 0);\n\n switch (TYPE(CHILD(n, 1))) {\n case funcdef:\n return ast_for_funcdef_impl(c, n, NULL,\n true /* is_async */);\n case with_stmt:\n return ast_for_with_stmt(c, n,\n true /* is_async */);\n\n case for_stmt:\n return ast_for_for_stmt(c, n,\n true /* is_async */);\n\n default:\n PyErr_Format(PyExc_SystemError,\n \"invalid async stament: %s\",\n STR(CHILD(n, 1)));\n return NULL;\n }\n}\n\nstatic stmt_ty\nast_for_decorated(struct compiling *c, const node *n)\n{\n /* decorated: decorators (classdef | funcdef | async_funcdef) */\n stmt_ty thing = NULL;\n asdl_seq *decorator_seq = NULL;\n\n REQ(n, decorated);\n\n decorator_seq = ast_for_decorators(c, CHILD(n, 0));\n if (!decorator_seq)\n return NULL;\n\n assert(TYPE(CHILD(n, 1)) == funcdef ||\n TYPE(CHILD(n, 1)) == async_funcdef ||\n TYPE(CHILD(n, 1)) == classdef);\n\n if (TYPE(CHILD(n, 1)) == funcdef) {\n thing = ast_for_funcdef(c, CHILD(n, 1), decorator_seq);\n } else if (TYPE(CHILD(n, 1)) == classdef) {\n thing = ast_for_classdef(c, CHILD(n, 1), decorator_seq);\n } else if (TYPE(CHILD(n, 1)) == async_funcdef) {\n thing = ast_for_async_funcdef(c, CHILD(n, 1), decorator_seq);\n }\n /* we count the decorators in when talking about the class' or\n * function's line number */\n if (thing) {\n thing->lineno = LINENO(n);\n thing->col_offset = n->n_col_offset;\n }\n return thing;\n}\n\nstatic expr_ty\nast_for_lambdef(struct compiling *c, const node *n)\n{\n /* lambdef: 'lambda' [varargslist] ':' test\n lambdef_nocond: 'lambda' [varargslist] ':' test_nocond */\n arguments_ty args;\n expr_ty expression;\n\n if (NCH(n) == 3) {\n args = arguments(NULL, NULL, NULL, NULL, NULL, NULL, c->c_arena);\n if (!args)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, 2));\n if (!expression)\n return NULL;\n }\n else {\n args = ast_for_arguments(c, CHILD(n, 1));\n if (!args)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, 3));\n if (!expression)\n return NULL;\n }\n\n return Lambda(args, expression, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_ifexpr(struct compiling *c, const node *n)\n{\n /* test: or_test 'if' or_test 'else' test */\n expr_ty expression, body, orelse;\n\n assert(NCH(n) == 5);\n body = ast_for_expr(c, CHILD(n, 0));\n if (!body)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, 2));\n if (!expression)\n return NULL;\n orelse = ast_for_expr(c, CHILD(n, 4));\n if (!orelse)\n return NULL;\n return IfExp(expression, body, orelse, LINENO(n), n->n_col_offset,\n c->c_arena);\n}\n\n/*\n Count the number of 'for' loops in a comprehension.\n\n Helper for ast_for_comprehension().\n*/\n\nstatic int\ncount_comp_fors(struct compiling *c, const node *n)\n{\n int n_fors = 0;\n\n count_comp_for:\n n_fors++;\n REQ(n, comp_for);\n if (NCH(n) == 2) {\n REQ(CHILD(n, 0), NAME);\n assert(strcmp(STR(CHILD(n, 0)), \"async\") == 0);\n n = CHILD(n, 1);\n }\n else if (NCH(n) == 1) {\n n = CHILD(n, 0);\n }\n else {\n goto error;\n }\n if (NCH(n) == (5)) {\n n = CHILD(n, 4);\n }\n else {\n return n_fors;\n }\n count_comp_iter:\n REQ(n, comp_iter);\n n = CHILD(n, 0);\n if (TYPE(n) == comp_for)\n goto count_comp_for;\n else if (TYPE(n) == comp_if) {\n if (NCH(n) == 3) {\n n = CHILD(n, 2);\n goto count_comp_iter;\n }\n else\n return n_fors;\n }\n\n error:\n /* Should never be reached */\n PyErr_SetString(PyExc_SystemError,\n \"logic error in count_comp_fors\");\n return -1;\n}\n\n/* Count the number of 'if' statements in a comprehension.\n\n Helper for ast_for_comprehension().\n*/\n\nstatic int\ncount_comp_ifs(struct compiling *c, const node *n)\n{\n int n_ifs = 0;\n\n while (1) {\n REQ(n, comp_iter);\n if (TYPE(CHILD(n, 0)) == comp_for)\n return n_ifs;\n n = CHILD(n, 0);\n REQ(n, comp_if);\n n_ifs++;\n if (NCH(n) == 2)\n return n_ifs;\n n = CHILD(n, 2);\n }\n}\n\nstatic asdl_seq *\nast_for_comprehension(struct compiling *c, const node *n)\n{\n int i, n_fors;\n asdl_seq *comps;\n\n n_fors = count_comp_fors(c, n);\n if (n_fors == -1)\n return NULL;\n\n comps = _Ta3_asdl_seq_new(n_fors, c->c_arena);\n if (!comps)\n return NULL;\n\n for (i = 0; i < n_fors; i++) {\n comprehension_ty comp;\n asdl_seq *t;\n expr_ty expression, first;\n node *for_ch;\n node *sync_n;\n int is_async = 0;\n\n REQ(n, comp_for);\n\n if (NCH(n) == 2) {\n is_async = 1;\n REQ(CHILD(n, 0), NAME);\n assert(strcmp(STR(CHILD(n, 0)), \"async\") == 0);\n sync_n = CHILD(n, 1);\n }\n else {\n sync_n = CHILD(n, 0);\n }\n REQ(sync_n, sync_comp_for);\n\n /* Async comprehensions only allowed in Python 3.6 and greater */\n if (is_async && c->c_feature_version < 6) {\n ast_error(c, n,\n \"Async comprehensions are only supported in Python 3.6 and greater\");\n return NULL;\n }\n\n for_ch = CHILD(sync_n, 1);\n t = ast_for_exprlist(c, for_ch, Store);\n if (!t)\n return NULL;\n expression = ast_for_expr(c, CHILD(sync_n, 3));\n if (!expression)\n return NULL;\n\n /* Check the # of children rather than the length of t, since\n (x for x, in ...) has 1 element in t, but still requires a Tuple. */\n first = (expr_ty)asdl_seq_GET(t, 0);\n if (NCH(for_ch) == 1)\n comp = comprehension(first, expression, NULL,\n is_async, c->c_arena);\n else\n comp = comprehension(Tuple(t, Store, first->lineno,\n first->col_offset, c->c_arena),\n expression, NULL, is_async, c->c_arena);\n if (!comp)\n return NULL;\n\n if (NCH(sync_n) == 5) {\n int j, n_ifs;\n asdl_seq *ifs;\n\n n = CHILD(sync_n, 4);\n n_ifs = count_comp_ifs(c, n);\n if (n_ifs == -1)\n return NULL;\n\n ifs = _Ta3_asdl_seq_new(n_ifs, c->c_arena);\n if (!ifs)\n return NULL;\n\n for (j = 0; j < n_ifs; j++) {\n REQ(n, comp_iter);\n n = CHILD(n, 0);\n REQ(n, comp_if);\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n asdl_seq_SET(ifs, j, expression);\n if (NCH(n) == 3)\n n = CHILD(n, 2);\n }\n /* on exit, must guarantee that n is a comp_for */\n if (TYPE(n) == comp_iter)\n n = CHILD(n, 0);\n comp->ifs = ifs;\n }\n asdl_seq_SET(comps, i, comp);\n }\n return comps;\n}\n\nstatic expr_ty\nast_for_itercomp(struct compiling *c, const node *n, int type)\n{\n /* testlist_comp: (test|star_expr)\n * ( comp_for | (',' (test|star_expr))* [','] ) */\n expr_ty elt;\n asdl_seq *comps;\n node *ch;\n\n assert(NCH(n) > 1);\n\n ch = CHILD(n, 0);\n elt = ast_for_expr(c, ch);\n if (!elt)\n return NULL;\n if (elt->kind == Starred_kind) {\n ast_error(c, ch, \"iterable unpacking cannot be used in comprehension\");\n return NULL;\n }\n\n comps = ast_for_comprehension(c, CHILD(n, 1));\n if (!comps)\n return NULL;\n\n if (type == COMP_GENEXP)\n return GeneratorExp(elt, comps, LINENO(n), n->n_col_offset, c->c_arena);\n else if (type == COMP_LISTCOMP)\n return ListComp(elt, comps, LINENO(n), n->n_col_offset, c->c_arena);\n else if (type == COMP_SETCOMP)\n return SetComp(elt, comps, LINENO(n), n->n_col_offset, c->c_arena);\n else\n /* Should never happen */\n return NULL;\n}\n\n/* Fills in the key, value pair corresponding to the dict element. In case\n * of an unpacking, key is NULL. *i is advanced by the number of ast\n * elements. Iff successful, nonzero is returned.\n */\nstatic int\nast_for_dictelement(struct compiling *c, const node *n, int *i,\n expr_ty *key, expr_ty *value)\n{\n expr_ty expression;\n if (TYPE(CHILD(n, *i)) == DOUBLESTAR) {\n assert(NCH(n) - *i >= 2);\n\n expression = ast_for_expr(c, CHILD(n, *i + 1));\n if (!expression)\n return 0;\n *key = NULL;\n *value = expression;\n\n *i += 2;\n }\n else {\n assert(NCH(n) - *i >= 3);\n\n expression = ast_for_expr(c, CHILD(n, *i));\n if (!expression)\n return 0;\n *key = expression;\n\n REQ(CHILD(n, *i + 1), COLON);\n\n expression = ast_for_expr(c, CHILD(n, *i + 2));\n if (!expression)\n return 0;\n *value = expression;\n\n *i += 3;\n }\n return 1;\n}\n\nstatic expr_ty\nast_for_dictcomp(struct compiling *c, const node *n)\n{\n expr_ty key, value;\n asdl_seq *comps;\n int i = 0;\n\n if (!ast_for_dictelement(c, n, &i, &key, &value))\n return NULL;\n assert(key);\n assert(NCH(n) - i >= 1);\n\n comps = ast_for_comprehension(c, CHILD(n, i));\n if (!comps)\n return NULL;\n\n return DictComp(key, value, comps, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_dictdisplay(struct compiling *c, const node *n)\n{\n int i;\n int j;\n int size;\n asdl_seq *keys, *values;\n\n size = (NCH(n) + 1) / 3; /* +1 in case no trailing comma */\n keys = _Ta3_asdl_seq_new(size, c->c_arena);\n if (!keys)\n return NULL;\n\n values = _Ta3_asdl_seq_new(size, c->c_arena);\n if (!values)\n return NULL;\n\n j = 0;\n for (i = 0; i < NCH(n); i++) {\n expr_ty key, value;\n\n if (!ast_for_dictelement(c, n, &i, &key, &value))\n return NULL;\n asdl_seq_SET(keys, j, key);\n asdl_seq_SET(values, j, value);\n\n j++;\n }\n keys->size = j;\n values->size = j;\n return Dict(keys, values, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_genexp(struct compiling *c, const node *n)\n{\n assert(TYPE(n) == (testlist_comp) || TYPE(n) == (argument));\n return ast_for_itercomp(c, n, COMP_GENEXP);\n}\n\nstatic expr_ty\nast_for_listcomp(struct compiling *c, const node *n)\n{\n assert(TYPE(n) == (testlist_comp));\n return ast_for_itercomp(c, n, COMP_LISTCOMP);\n}\n\nstatic expr_ty\nast_for_setcomp(struct compiling *c, const node *n)\n{\n assert(TYPE(n) == (dictorsetmaker));\n return ast_for_itercomp(c, n, COMP_SETCOMP);\n}\n\nstatic expr_ty\nast_for_setdisplay(struct compiling *c, const node *n)\n{\n int i;\n int size;\n asdl_seq *elts;\n\n assert(TYPE(n) == (dictorsetmaker));\n size = (NCH(n) + 1) / 2; /* +1 in case no trailing comma */\n elts = _Ta3_asdl_seq_new(size, c->c_arena);\n if (!elts)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n expr_ty expression;\n expression = ast_for_expr(c, CHILD(n, i));\n if (!expression)\n return NULL;\n asdl_seq_SET(elts, i / 2, expression);\n }\n return Set(elts, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_atom(struct compiling *c, const node *n)\n{\n /* atom: '(' [yield_expr|testlist_comp] ')' | '[' [testlist_comp] ']'\n | '{' [dictmaker|testlist_comp] '}' | NAME | NUMBER | STRING+\n | '...' | 'None' | 'True' | 'False'\n */\n node *ch = CHILD(n, 0);\n\n switch (TYPE(ch)) {\n case NAME: {\n PyObject *name;\n const char *s = STR(ch);\n size_t len = strlen(s);\n if (len >= 4 && len <= 5) {\n if (!strcmp(s, \"None\"))\n return NameConstant(Py_None, LINENO(n), n->n_col_offset, c->c_arena);\n if (!strcmp(s, \"True\"))\n return NameConstant(Py_True, LINENO(n), n->n_col_offset, c->c_arena);\n if (!strcmp(s, \"False\"))\n return NameConstant(Py_False, LINENO(n), n->n_col_offset, c->c_arena);\n }\n name = new_identifier(s, c);\n if (!name)\n return NULL;\n /* All names start in Load context, but may later be changed. */\n return Name(name, Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case STRING: {\n expr_ty str = parsestrplus(c, n);\n if (!str) {\n const char *errtype = NULL;\n if (PyErr_ExceptionMatches(PyExc_UnicodeError))\n errtype = \"unicode error\";\n else if (PyErr_ExceptionMatches(PyExc_ValueError))\n errtype = \"value error\";\n if (errtype) {\n char buf[128];\n const char *s = NULL;\n PyObject *type, *value, *tback, *errstr;\n PyErr_Fetch(&type, &value, &tback);\n errstr = PyObject_Str(value);\n if (errstr)\n s = PyUnicode_AsUTF8(errstr);\n if (s) {\n PyOS_snprintf(buf, sizeof(buf), \"(%s) %s\", errtype, s);\n } else {\n PyErr_Clear();\n PyOS_snprintf(buf, sizeof(buf), \"(%s) unknown error\", errtype);\n }\n Py_XDECREF(errstr);\n ast_error(c, n, buf);\n Py_DECREF(type);\n Py_XDECREF(value);\n Py_XDECREF(tback);\n }\n return NULL;\n }\n return str;\n }\n case NUMBER: {\n PyObject *pynum;\n const char *s = STR(ch);\n /* Underscores in numeric literals are only allowed in Python 3.6 or greater */\n /* Check for underscores here rather than in parse_number so we can report a line number on error */\n if (c->c_feature_version < 6 && strchr(s, '_') != NULL) {\n ast_error(c, ch,\n \"Underscores in numeric literals are only supported in Python 3.6 and greater\");\n return NULL;\n }\n pynum = parsenumber(c, STR(ch));\n if (!pynum)\n return NULL;\n\n if (PyArena_AddPyObject(c->c_arena, pynum) < 0) {\n Py_DECREF(pynum);\n return NULL;\n }\n return Num(pynum, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case ELLIPSIS: /* Ellipsis */\n return Ellipsis(LINENO(n), n->n_col_offset, c->c_arena);\n case LPAR: /* some parenthesized expressions */\n ch = CHILD(n, 1);\n\n if (TYPE(ch) == RPAR)\n return Tuple(NULL, Load, LINENO(n), n->n_col_offset, c->c_arena);\n\n if (TYPE(ch) == yield_expr)\n return ast_for_expr(c, ch);\n\n /* testlist_comp: test ( comp_for | (',' test)* [','] ) */\n if ((NCH(ch) > 1) && (TYPE(CHILD(ch, 1)) == comp_for))\n return ast_for_genexp(c, ch);\n\n return ast_for_testlist(c, ch);\n case LSQB: /* list (or list comprehension) */\n ch = CHILD(n, 1);\n\n if (TYPE(ch) == RSQB)\n return List(NULL, Load, LINENO(n), n->n_col_offset, c->c_arena);\n\n REQ(ch, testlist_comp);\n if (NCH(ch) == 1 || TYPE(CHILD(ch, 1)) == COMMA) {\n asdl_seq *elts = seq_for_testlist(c, ch);\n if (!elts)\n return NULL;\n\n return List(elts, Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else\n return ast_for_listcomp(c, ch);\n case LBRACE: {\n /* dictorsetmaker: ( ((test ':' test | '**' test)\n * (comp_for | (',' (test ':' test | '**' test))* [','])) |\n * ((test | '*' test)\n * (comp_for | (',' (test | '*' test))* [','])) ) */\n expr_ty res;\n ch = CHILD(n, 1);\n if (TYPE(ch) == RBRACE) {\n /* It's an empty dict. */\n return Dict(NULL, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else {\n int is_dict = (TYPE(CHILD(ch, 0)) == DOUBLESTAR);\n if (NCH(ch) == 1 ||\n (NCH(ch) > 1 &&\n TYPE(CHILD(ch, 1)) == COMMA)) {\n /* It's a set display. */\n res = ast_for_setdisplay(c, ch);\n }\n else if (NCH(ch) > 1 &&\n TYPE(CHILD(ch, 1)) == comp_for) {\n /* It's a set comprehension. */\n res = ast_for_setcomp(c, ch);\n }\n else if (NCH(ch) > 3 - is_dict &&\n TYPE(CHILD(ch, 3 - is_dict)) == comp_for) {\n /* It's a dictionary comprehension. */\n if (is_dict) {\n ast_error(c, n, \"dict unpacking cannot be used in \"\n \"dict comprehension\");\n return NULL;\n }\n res = ast_for_dictcomp(c, ch);\n }\n else {\n /* It's a dictionary display. */\n res = ast_for_dictdisplay(c, ch);\n }\n if (res) {\n res->lineno = LINENO(n);\n res->col_offset = n->n_col_offset;\n }\n return res;\n }\n }\n default:\n PyErr_Format(PyExc_SystemError, \"unhandled atom %d\", TYPE(ch));\n return NULL;\n }\n}\n\nstatic slice_ty\nast_for_slice(struct compiling *c, const node *n)\n{\n node *ch;\n expr_ty lower = NULL, upper = NULL, step = NULL;\n\n REQ(n, subscript);\n\n /*\n subscript: test | [test] ':' [test] [sliceop]\n sliceop: ':' [test]\n */\n ch = CHILD(n, 0);\n if (NCH(n) == 1 && TYPE(ch) == test) {\n /* 'step' variable hold no significance in terms of being used over\n other vars */\n step = ast_for_expr(c, ch);\n if (!step)\n return NULL;\n\n return Index(step, c->c_arena);\n }\n\n if (TYPE(ch) == test) {\n lower = ast_for_expr(c, ch);\n if (!lower)\n return NULL;\n }\n\n /* If there's an upper bound it's in the second or third position. */\n if (TYPE(ch) == COLON) {\n if (NCH(n) > 1) {\n node *n2 = CHILD(n, 1);\n\n if (TYPE(n2) == test) {\n upper = ast_for_expr(c, n2);\n if (!upper)\n return NULL;\n }\n }\n } else if (NCH(n) > 2) {\n node *n2 = CHILD(n, 2);\n\n if (TYPE(n2) == test) {\n upper = ast_for_expr(c, n2);\n if (!upper)\n return NULL;\n }\n }\n\n ch = CHILD(n, NCH(n) - 1);\n if (TYPE(ch) == sliceop) {\n if (NCH(ch) != 1) {\n ch = CHILD(ch, 1);\n if (TYPE(ch) == test) {\n step = ast_for_expr(c, ch);\n if (!step)\n return NULL;\n }\n }\n }\n\n return Slice(lower, upper, step, c->c_arena);\n}\n\nstatic expr_ty\nast_for_binop(struct compiling *c, const node *n)\n{\n /* Must account for a sequence of expressions.\n How should A op B op C by represented?\n BinOp(BinOp(A, op, B), op, C).\n */\n\n int i, nops;\n expr_ty expr1, expr2, result;\n operator_ty newoperator;\n\n expr1 = ast_for_expr(c, CHILD(n, 0));\n if (!expr1)\n return NULL;\n\n expr2 = ast_for_expr(c, CHILD(n, 2));\n if (!expr2)\n return NULL;\n\n newoperator = get_operator(c, CHILD(n, 1));\n if (!newoperator)\n return NULL;\n\n result = BinOp(expr1, newoperator, expr2, LINENO(n), n->n_col_offset,\n c->c_arena);\n if (!result)\n return NULL;\n\n nops = (NCH(n) - 1) / 2;\n for (i = 1; i < nops; i++) {\n expr_ty tmp_result, tmp;\n const node* next_oper = CHILD(n, i * 2 + 1);\n\n newoperator = get_operator(c, next_oper);\n if (!newoperator)\n return NULL;\n\n tmp = ast_for_expr(c, CHILD(n, i * 2 + 2));\n if (!tmp)\n return NULL;\n\n tmp_result = BinOp(result, newoperator, tmp,\n LINENO(next_oper), next_oper->n_col_offset,\n c->c_arena);\n if (!tmp_result)\n return NULL;\n result = tmp_result;\n }\n return result;\n}\n\nstatic expr_ty\nast_for_trailer(struct compiling *c, const node *n, expr_ty left_expr)\n{\n /* trailer: '(' [arglist] ')' | '[' subscriptlist ']' | '.' NAME\n subscriptlist: subscript (',' subscript)* [',']\n subscript: '.' '.' '.' | test | [test] ':' [test] [sliceop]\n */\n REQ(n, trailer);\n if (TYPE(CHILD(n, 0)) == LPAR) {\n if (NCH(n) == 2)\n return Call(left_expr, NULL, NULL, LINENO(n),\n n->n_col_offset, c->c_arena);\n else\n return ast_for_call(c, CHILD(n, 1), left_expr, true);\n }\n else if (TYPE(CHILD(n, 0)) == DOT) {\n PyObject *attr_id = NEW_IDENTIFIER(CHILD(n, 1));\n if (!attr_id)\n return NULL;\n return Attribute(left_expr, attr_id, Load,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n else {\n REQ(CHILD(n, 0), LSQB);\n REQ(CHILD(n, 2), RSQB);\n n = CHILD(n, 1);\n if (NCH(n) == 1) {\n slice_ty slc = ast_for_slice(c, CHILD(n, 0));\n if (!slc)\n return NULL;\n return Subscript(left_expr, slc, Load, LINENO(n), n->n_col_offset,\n c->c_arena);\n }\n else {\n /* The grammar is ambiguous here. The ambiguity is resolved\n by treating the sequence as a tuple literal if there are\n no slice features.\n */\n int j;\n slice_ty slc;\n expr_ty e;\n int simple = 1;\n asdl_seq *slices, *elts;\n slices = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!slices)\n return NULL;\n for (j = 0; j < NCH(n); j += 2) {\n slc = ast_for_slice(c, CHILD(n, j));\n if (!slc)\n return NULL;\n if (slc->kind != Index_kind)\n simple = 0;\n asdl_seq_SET(slices, j / 2, slc);\n }\n if (!simple) {\n return Subscript(left_expr, ExtSlice(slices, c->c_arena),\n Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n /* extract Index values and put them in a Tuple */\n elts = _Ta3_asdl_seq_new(asdl_seq_LEN(slices), c->c_arena);\n if (!elts)\n return NULL;\n for (j = 0; j < asdl_seq_LEN(slices); ++j) {\n slc = (slice_ty)asdl_seq_GET(slices, j);\n assert(slc->kind == Index_kind && slc->v.Index.value);\n asdl_seq_SET(elts, j, slc->v.Index.value);\n }\n e = Tuple(elts, Load, LINENO(n), n->n_col_offset, c->c_arena);\n if (!e)\n return NULL;\n return Subscript(left_expr, Index(e, c->c_arena),\n Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n }\n}\n\nstatic expr_ty\nast_for_factor(struct compiling *c, const node *n)\n{\n expr_ty expression;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n\n switch (TYPE(CHILD(n, 0))) {\n case PLUS:\n return UnaryOp(UAdd, expression, LINENO(n), n->n_col_offset,\n c->c_arena);\n case MINUS:\n return UnaryOp(USub, expression, LINENO(n), n->n_col_offset,\n c->c_arena);\n case TILDE:\n return UnaryOp(Invert, expression, LINENO(n),\n n->n_col_offset, c->c_arena);\n }\n PyErr_Format(PyExc_SystemError, \"unhandled factor: %d\",\n TYPE(CHILD(n, 0)));\n return NULL;\n}\n\nstatic expr_ty\nast_for_atom_expr(struct compiling *c, const node *n)\n{\n int i, nch, start = 0;\n expr_ty e, tmp;\n\n REQ(n, atom_expr);\n nch = NCH(n);\n\n if (TYPE(CHILD(n, 0)) == AWAIT) {\n if (c->c_feature_version < 5) {\n ast_error(c, n,\n \"Await expressions are only supported in Python 3.5 and greater\");\n return NULL;\n }\n start = 1;\n assert(nch > 1);\n }\n\n e = ast_for_atom(c, CHILD(n, start));\n if (!e)\n return NULL;\n if (nch == 1)\n return e;\n if (start && nch == 2) {\n return Await(e, LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n for (i = start + 1; i < nch; i++) {\n node *ch = CHILD(n, i);\n if (TYPE(ch) != trailer)\n break;\n tmp = ast_for_trailer(c, ch, e);\n if (!tmp)\n return NULL;\n tmp->lineno = e->lineno;\n tmp->col_offset = e->col_offset;\n e = tmp;\n }\n\n if (start) {\n /* there was an 'await' */\n return Await(e, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else {\n return e;\n }\n}\n\nstatic expr_ty\nast_for_power(struct compiling *c, const node *n)\n{\n /* power: atom trailer* ('**' factor)*\n */\n expr_ty e;\n REQ(n, power);\n e = ast_for_atom_expr(c, CHILD(n, 0));\n if (!e)\n return NULL;\n if (NCH(n) == 1)\n return e;\n if (TYPE(CHILD(n, NCH(n) - 1)) == factor) {\n expr_ty f = ast_for_expr(c, CHILD(n, NCH(n) - 1));\n if (!f)\n return NULL;\n e = BinOp(e, Pow, f, LINENO(n), n->n_col_offset, c->c_arena);\n }\n return e;\n}\n\nstatic expr_ty\nast_for_starred(struct compiling *c, const node *n)\n{\n expr_ty tmp;\n REQ(n, star_expr);\n\n tmp = ast_for_expr(c, CHILD(n, 1));\n if (!tmp)\n return NULL;\n\n /* The Load context is changed later. */\n return Starred(tmp, Load, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\n\n/* Do not name a variable 'expr'! Will cause a compile error.\n*/\n\nstatic expr_ty\nast_for_expr(struct compiling *c, const node *n)\n{\n /* handle the full range of simple expressions\n test: or_test ['if' or_test 'else' test] | lambdef\n test_nocond: or_test | lambdef_nocond\n or_test: and_test ('or' and_test)*\n and_test: not_test ('and' not_test)*\n not_test: 'not' not_test | comparison\n comparison: expr (comp_op expr)*\n expr: xor_expr ('|' xor_expr)*\n xor_expr: and_expr ('^' and_expr)*\n and_expr: shift_expr ('&' shift_expr)*\n shift_expr: arith_expr (('<<'|'>>') arith_expr)*\n arith_expr: term (('+'|'-') term)*\n term: factor (('*'|'@'|'/'|'%'|'//') factor)*\n factor: ('+'|'-'|'~') factor | power\n power: atom_expr ['**' factor]\n atom_expr: ['await'] atom trailer*\n yield_expr: 'yield' [yield_arg]\n */\n\n asdl_seq *seq;\n int i;\n\n loop:\n switch (TYPE(n)) {\n case test:\n case test_nocond:\n if (TYPE(CHILD(n, 0)) == lambdef ||\n TYPE(CHILD(n, 0)) == lambdef_nocond)\n return ast_for_lambdef(c, CHILD(n, 0));\n else if (NCH(n) > 1)\n return ast_for_ifexpr(c, n);\n /* Fallthrough */\n case or_test:\n case and_test:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n seq = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!seq)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n expr_ty e = ast_for_expr(c, CHILD(n, i));\n if (!e)\n return NULL;\n asdl_seq_SET(seq, i / 2, e);\n }\n if (!strcmp(STR(CHILD(n, 1)), \"and\"))\n return BoolOp(And, seq, LINENO(n), n->n_col_offset,\n c->c_arena);\n assert(!strcmp(STR(CHILD(n, 1)), \"or\"));\n return BoolOp(Or, seq, LINENO(n), n->n_col_offset, c->c_arena);\n case not_test:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n else {\n expr_ty expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n\n return UnaryOp(Not, expression, LINENO(n), n->n_col_offset,\n c->c_arena);\n }\n case comparison:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n else {\n expr_ty expression;\n asdl_int_seq *ops;\n asdl_seq *cmps;\n ops = _Ta3_asdl_int_seq_new(NCH(n) / 2, c->c_arena);\n if (!ops)\n return NULL;\n cmps = _Ta3_asdl_seq_new(NCH(n) / 2, c->c_arena);\n if (!cmps) {\n return NULL;\n }\n for (i = 1; i < NCH(n); i += 2) {\n cmpop_ty newoperator;\n\n newoperator = ast_for_comp_op(c, CHILD(n, i));\n if (!newoperator) {\n return NULL;\n }\n\n expression = ast_for_expr(c, CHILD(n, i + 1));\n if (!expression) {\n return NULL;\n }\n\n asdl_seq_SET(ops, i / 2, newoperator);\n asdl_seq_SET(cmps, i / 2, expression);\n }\n expression = ast_for_expr(c, CHILD(n, 0));\n if (!expression) {\n return NULL;\n }\n\n return Compare(expression, ops, cmps, LINENO(n),\n n->n_col_offset, c->c_arena);\n }\n break;\n\n case star_expr:\n return ast_for_starred(c, n);\n /* The next five cases all handle BinOps. The main body of code\n is the same in each case, but the switch turned inside out to\n reuse the code for each type of operator.\n */\n case expr:\n case xor_expr:\n case and_expr:\n case shift_expr:\n case arith_expr:\n case term:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n return ast_for_binop(c, n);\n case yield_expr: {\n node *an = NULL;\n node *en = NULL;\n int is_from = 0;\n expr_ty exp = NULL;\n if (NCH(n) > 1)\n an = CHILD(n, 1); /* yield_arg */\n if (an) {\n en = CHILD(an, NCH(an) - 1);\n if (NCH(an) == 2) {\n is_from = 1;\n exp = ast_for_expr(c, en);\n }\n else\n exp = ast_for_testlist(c, en);\n if (!exp)\n return NULL;\n }\n if (is_from)\n return YieldFrom(exp, LINENO(n), n->n_col_offset, c->c_arena);\n return Yield(exp, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case factor:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n return ast_for_factor(c, n);\n case power:\n return ast_for_power(c, n);\n default:\n PyErr_Format(PyExc_SystemError, \"unhandled expr: %d\", TYPE(n));\n return NULL;\n }\n /* should never get here unless if error is set */\n return NULL;\n}\n\nstatic expr_ty\nast_for_call(struct compiling *c, const node *n, expr_ty func, bool allowgen)\n{\n /*\n arglist: argument (',' argument)* [',']\n argument: ( test [comp_for] | '*' test | test '=' test | '**' test )\n */\n\n int i, nargs, nkeywords;\n int ndoublestars;\n asdl_seq *args;\n asdl_seq *keywords;\n\n REQ(n, arglist);\n\n nargs = 0;\n nkeywords = 0;\n for (i = 0; i < NCH(n); i++) {\n node *ch = CHILD(n, i);\n if (TYPE(ch) == argument) {\n if (NCH(ch) == 1)\n nargs++;\n else if (TYPE(CHILD(ch, 1)) == comp_for) {\n nargs++;\n if (!allowgen) {\n ast_error(c, ch, \"invalid syntax\");\n return NULL;\n }\n if (NCH(n) > 1) {\n ast_error(c, ch, \"Generator expression must be parenthesized\");\n return NULL;\n }\n }\n else if (TYPE(CHILD(ch, 0)) == STAR)\n nargs++;\n else\n /* TYPE(CHILD(ch, 0)) == DOUBLESTAR or keyword argument */\n nkeywords++;\n }\n }\n\n args = _Ta3_asdl_seq_new(nargs, c->c_arena);\n if (!args)\n return NULL;\n keywords = _Ta3_asdl_seq_new(nkeywords, c->c_arena);\n if (!keywords)\n return NULL;\n\n nargs = 0; /* positional arguments + iterable argument unpackings */\n nkeywords = 0; /* keyword arguments + keyword argument unpackings */\n ndoublestars = 0; /* just keyword argument unpackings */\n for (i = 0; i < NCH(n); i++) {\n node *ch = CHILD(n, i);\n if (TYPE(ch) == argument) {\n expr_ty e;\n node *chch = CHILD(ch, 0);\n if (NCH(ch) == 1) {\n /* a positional argument */\n if (nkeywords) {\n if (ndoublestars) {\n ast_error(c, chch,\n \"positional argument follows \"\n \"keyword argument unpacking\");\n }\n else {\n ast_error(c, chch,\n \"positional argument follows \"\n \"keyword argument\");\n }\n return NULL;\n }\n e = ast_for_expr(c, chch);\n if (!e)\n return NULL;\n asdl_seq_SET(args, nargs++, e);\n }\n else if (TYPE(chch) == STAR) {\n /* an iterable argument unpacking */\n expr_ty starred;\n if (ndoublestars) {\n ast_error(c, chch,\n \"iterable argument unpacking follows \"\n \"keyword argument unpacking\");\n return NULL;\n }\n e = ast_for_expr(c, CHILD(ch, 1));\n if (!e)\n return NULL;\n starred = Starred(e, Load, LINENO(chch),\n chch->n_col_offset,\n c->c_arena);\n if (!starred)\n return NULL;\n asdl_seq_SET(args, nargs++, starred);\n\n }\n else if (TYPE(chch) == DOUBLESTAR) {\n /* a keyword argument unpacking */\n keyword_ty kw;\n i++;\n e = ast_for_expr(c, CHILD(ch, 1));\n if (!e)\n return NULL;\n kw = keyword(NULL, e, c->c_arena);\n asdl_seq_SET(keywords, nkeywords++, kw);\n ndoublestars++;\n }\n else if (TYPE(CHILD(ch, 1)) == comp_for) {\n /* the lone generator expression */\n e = ast_for_genexp(c, ch);\n if (!e)\n return NULL;\n asdl_seq_SET(args, nargs++, e);\n }\n else {\n /* a keyword argument */\n keyword_ty kw;\n identifier key, tmp;\n int k;\n\n /* chch is test, but must be an identifier? */\n e = ast_for_expr(c, chch);\n if (!e)\n return NULL;\n /* f(lambda x: x[0] = 3) ends up getting parsed with\n * LHS test = lambda x: x[0], and RHS test = 3.\n * SF bug 132313 points out that complaining about a keyword\n * then is very confusing.\n */\n if (e->kind == Lambda_kind) {\n ast_error(c, chch,\n \"lambda cannot contain assignment\");\n return NULL;\n }\n else if (e->kind != Name_kind) {\n ast_error(c, chch,\n \"keyword can't be an expression\");\n return NULL;\n }\n else if (forbidden_name(c, e->v.Name.id, ch, 1)) {\n return NULL;\n }\n key = e->v.Name.id;\n for (k = 0; k < nkeywords; k++) {\n tmp = ((keyword_ty)asdl_seq_GET(keywords, k))->arg;\n if (tmp && !PyUnicode_Compare(tmp, key)) {\n ast_error(c, chch,\n \"keyword argument repeated\");\n return NULL;\n }\n }\n e = ast_for_expr(c, CHILD(ch, 2));\n if (!e)\n return NULL;\n kw = keyword(key, e, c->c_arena);\n if (!kw)\n return NULL;\n asdl_seq_SET(keywords, nkeywords++, kw);\n }\n }\n }\n\n return Call(func, args, keywords, func->lineno, func->col_offset, c->c_arena);\n}\n\nstatic expr_ty\nast_for_testlist(struct compiling *c, const node* n)\n{\n /* testlist_comp: test (comp_for | (',' test)* [',']) */\n /* testlist: test (',' test)* [','] */\n assert(NCH(n) > 0);\n if (TYPE(n) == testlist_comp) {\n if (NCH(n) > 1)\n assert(TYPE(CHILD(n, 1)) != comp_for);\n }\n else {\n assert(TYPE(n) == testlist ||\n TYPE(n) == testlist_star_expr);\n }\n if (NCH(n) == 1)\n return ast_for_expr(c, CHILD(n, 0));\n else {\n asdl_seq *tmp = seq_for_testlist(c, n);\n if (!tmp)\n return NULL;\n return Tuple(tmp, Load, LINENO(n), n->n_col_offset, c->c_arena);\n }\n}\n\nstatic stmt_ty\nast_for_expr_stmt(struct compiling *c, const node *n)\n{\n int num;\n\n REQ(n, expr_stmt);\n /* expr_stmt: testlist_star_expr (annassign | augassign (yield_expr|testlist) |\n ('=' (yield_expr|testlist_star_expr))* [TYPE_COMMENT])\n annassign: ':' test ['=' test]\n testlist_star_expr: (test|star_expr) (',' test|star_expr)* [',']\n augassign: '+=' | '-=' | '*=' | '@=' | '/=' | '%=' | '&=' | '|=' | '^='\n | '<<=' | '>>=' | '**=' | '//='\n test: ... here starts the operator precedence dance\n */\n num = NCH(n);\n\n if (num == 1 || (num == 2 && TYPE(CHILD(n, 1)) == TYPE_COMMENT)) {\n expr_ty e = ast_for_testlist(c, CHILD(n, 0));\n if (!e)\n return NULL;\n\n return Expr(e, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else if (TYPE(CHILD(n, 1)) == augassign) {\n expr_ty expr1, expr2;\n operator_ty newoperator;\n node *ch = CHILD(n, 0);\n\n expr1 = ast_for_testlist(c, ch);\n if (!expr1)\n return NULL;\n if(!set_context(c, expr1, Store, ch))\n return NULL;\n /* set_context checks that most expressions are not the left side.\n Augmented assignments can only have a name, a subscript, or an\n attribute on the left, though, so we have to explicitly check for\n those. */\n switch (expr1->kind) {\n case Name_kind:\n case Attribute_kind:\n case Subscript_kind:\n break;\n default:\n ast_error(c, ch, \"illegal expression for augmented assignment\");\n return NULL;\n }\n\n ch = CHILD(n, 2);\n if (TYPE(ch) == testlist)\n expr2 = ast_for_testlist(c, ch);\n else\n expr2 = ast_for_expr(c, ch);\n if (!expr2)\n return NULL;\n\n newoperator = ast_for_augassign(c, CHILD(n, 1));\n if (!newoperator)\n return NULL;\n\n return AugAssign(expr1, newoperator, expr2, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else if (TYPE(CHILD(n, 1)) == annassign) {\n expr_ty expr1, expr2, expr3;\n node *ch = CHILD(n, 0);\n node *deep, *ann = CHILD(n, 1);\n int simple = 1;\n\n /* AnnAssigns are only allowed in Python 3.6 or greater */\n if (c->c_feature_version < 6) {\n ast_error(c, ch,\n \"Variable annotation syntax is only supported in Python 3.6 and greater\");\n return NULL;\n }\n\n /* we keep track of parens to qualify (x) as expression not name */\n deep = ch;\n while (NCH(deep) == 1) {\n deep = CHILD(deep, 0);\n }\n if (NCH(deep) > 0 && TYPE(CHILD(deep, 0)) == LPAR) {\n simple = 0;\n }\n expr1 = ast_for_testlist(c, ch);\n if (!expr1) {\n return NULL;\n }\n switch (expr1->kind) {\n case Name_kind:\n if (forbidden_name(c, expr1->v.Name.id, n, 0)) {\n return NULL;\n }\n expr1->v.Name.ctx = Store;\n break;\n case Attribute_kind:\n if (forbidden_name(c, expr1->v.Attribute.attr, n, 1)) {\n return NULL;\n }\n expr1->v.Attribute.ctx = Store;\n break;\n case Subscript_kind:\n expr1->v.Subscript.ctx = Store;\n break;\n case List_kind:\n ast_error(c, ch,\n \"only single target (not list) can be annotated\");\n return NULL;\n case Tuple_kind:\n ast_error(c, ch,\n \"only single target (not tuple) can be annotated\");\n return NULL;\n default:\n ast_error(c, ch,\n \"illegal target for annotation\");\n return NULL;\n }\n\n if (expr1->kind != Name_kind) {\n simple = 0;\n }\n ch = CHILD(ann, 1);\n expr2 = ast_for_expr(c, ch);\n if (!expr2) {\n return NULL;\n }\n if (NCH(ann) == 2) {\n return AnnAssign(expr1, expr2, NULL, simple,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n else {\n ch = CHILD(ann, 3);\n expr3 = ast_for_expr(c, ch);\n if (!expr3) {\n return NULL;\n }\n return AnnAssign(expr1, expr2, expr3, simple,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n }\n else {\n int i, nch_minus_type, has_type_comment;\n asdl_seq *targets;\n node *value;\n expr_ty expression;\n string type_comment;\n\n /* a normal assignment */\n REQ(CHILD(n, 1), EQUAL);\n\n has_type_comment = TYPE(CHILD(n, num - 1)) == TYPE_COMMENT;\n nch_minus_type = num - has_type_comment;\n\n targets = _Ta3_asdl_seq_new(nch_minus_type / 2, c->c_arena);\n if (!targets)\n return NULL;\n for (i = 0; i < nch_minus_type - 2; i += 2) {\n expr_ty e;\n node *ch = CHILD(n, i);\n if (TYPE(ch) == yield_expr) {\n ast_error(c, ch, \"assignment to yield expression not possible\");\n return NULL;\n }\n e = ast_for_testlist(c, ch);\n if (!e)\n return NULL;\n\n /* set context to assign */\n if (!set_context(c, e, Store, CHILD(n, i)))\n return NULL;\n\n asdl_seq_SET(targets, i / 2, e);\n }\n value = CHILD(n, nch_minus_type - 1);\n if (TYPE(value) == testlist_star_expr)\n expression = ast_for_testlist(c, value);\n else\n expression = ast_for_expr(c, value);\n if (!expression)\n return NULL;\n if (has_type_comment)\n type_comment = NEW_TYPE_COMMENT(CHILD(n, nch_minus_type));\n else\n type_comment = NULL;\n return Assign(targets, expression, type_comment, LINENO(n), n->n_col_offset, c->c_arena);\n }\n}\n\n\nstatic asdl_seq *\nast_for_exprlist(struct compiling *c, const node *n, expr_context_ty context)\n{\n asdl_seq *seq;\n int i;\n expr_ty e;\n\n REQ(n, exprlist);\n\n seq = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!seq)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n e = ast_for_expr(c, CHILD(n, i));\n if (!e)\n return NULL;\n asdl_seq_SET(seq, i / 2, e);\n if (context && !set_context(c, e, context, CHILD(n, i)))\n return NULL;\n }\n return seq;\n}\n\nstatic stmt_ty\nast_for_del_stmt(struct compiling *c, const node *n)\n{\n asdl_seq *expr_list;\n\n /* del_stmt: 'del' exprlist */\n REQ(n, del_stmt);\n\n expr_list = ast_for_exprlist(c, CHILD(n, 1), Del);\n if (!expr_list)\n return NULL;\n return Delete(expr_list, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_flow_stmt(struct compiling *c, const node *n)\n{\n /*\n flow_stmt: break_stmt | continue_stmt | return_stmt | raise_stmt\n | yield_stmt\n break_stmt: 'break'\n continue_stmt: 'continue'\n return_stmt: 'return' [testlist]\n yield_stmt: yield_expr\n yield_expr: 'yield' testlist | 'yield' 'from' test\n raise_stmt: 'raise' [test [',' test [',' test]]]\n */\n node *ch;\n\n REQ(n, flow_stmt);\n ch = CHILD(n, 0);\n switch (TYPE(ch)) {\n case break_stmt:\n return Break(LINENO(n), n->n_col_offset, c->c_arena);\n case continue_stmt:\n return Continue(LINENO(n), n->n_col_offset, c->c_arena);\n case yield_stmt: { /* will reduce to yield_expr */\n expr_ty exp = ast_for_expr(c, CHILD(ch, 0));\n if (!exp)\n return NULL;\n return Expr(exp, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case return_stmt:\n if (NCH(ch) == 1)\n return Return(NULL, LINENO(n), n->n_col_offset, c->c_arena);\n else {\n expr_ty expression = ast_for_testlist(c, CHILD(ch, 1));\n if (!expression)\n return NULL;\n return Return(expression, LINENO(n), n->n_col_offset, c->c_arena);\n }\n case raise_stmt:\n if (NCH(ch) == 1)\n return Raise(NULL, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n else if (NCH(ch) >= 2) {\n expr_ty cause = NULL;\n expr_ty expression = ast_for_expr(c, CHILD(ch, 1));\n if (!expression)\n return NULL;\n if (NCH(ch) == 4) {\n cause = ast_for_expr(c, CHILD(ch, 3));\n if (!cause)\n return NULL;\n }\n return Raise(expression, cause, LINENO(n), n->n_col_offset, c->c_arena);\n }\n /* fall through */\n default:\n PyErr_Format(PyExc_SystemError,\n \"unexpected flow_stmt: %d\", TYPE(ch));\n return NULL;\n }\n}\n\nstatic alias_ty\nalias_for_import_name(struct compiling *c, const node *n, int store)\n{\n /*\n import_as_name: NAME ['as' NAME]\n dotted_as_name: dotted_name ['as' NAME]\n dotted_name: NAME ('.' NAME)*\n */\n identifier str, name;\n\n loop:\n switch (TYPE(n)) {\n case import_as_name: {\n node *name_node = CHILD(n, 0);\n str = NULL;\n name = NEW_IDENTIFIER(name_node);\n if (!name)\n return NULL;\n if (NCH(n) == 3) {\n node *str_node = CHILD(n, 2);\n str = NEW_IDENTIFIER(str_node);\n if (!str)\n return NULL;\n if (store && forbidden_name(c, str, str_node, 0))\n return NULL;\n }\n else {\n if (forbidden_name(c, name, name_node, 0))\n return NULL;\n }\n return alias(name, str, c->c_arena);\n }\n case dotted_as_name:\n if (NCH(n) == 1) {\n n = CHILD(n, 0);\n goto loop;\n }\n else {\n node *asname_node = CHILD(n, 2);\n alias_ty a = alias_for_import_name(c, CHILD(n, 0), 0);\n if (!a)\n return NULL;\n assert(!a->asname);\n a->asname = NEW_IDENTIFIER(asname_node);\n if (!a->asname)\n return NULL;\n if (forbidden_name(c, a->asname, asname_node, 0))\n return NULL;\n return a;\n }\n break;\n case dotted_name:\n if (NCH(n) == 1) {\n node *name_node = CHILD(n, 0);\n name = NEW_IDENTIFIER(name_node);\n if (!name)\n return NULL;\n if (store && forbidden_name(c, name, name_node, 0))\n return NULL;\n return alias(name, NULL, c->c_arena);\n }\n else {\n /* Create a string of the form \"a.b.c\" */\n int i;\n size_t len;\n char *s;\n PyObject *uni;\n\n len = 0;\n for (i = 0; i < NCH(n); i += 2)\n /* length of string plus one for the dot */\n len += strlen(STR(CHILD(n, i))) + 1;\n len--; /* the last name doesn't have a dot */\n str = PyBytes_FromStringAndSize(NULL, len);\n if (!str)\n return NULL;\n s = PyBytes_AS_STRING(str);\n if (!s)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n char *sch = STR(CHILD(n, i));\n strcpy(s, STR(CHILD(n, i)));\n s += strlen(sch);\n *s++ = '.';\n }\n --s;\n *s = '\\0';\n uni = PyUnicode_DecodeUTF8(PyBytes_AS_STRING(str),\n PyBytes_GET_SIZE(str),\n NULL);\n Py_DECREF(str);\n if (!uni)\n return NULL;\n str = uni;\n PyUnicode_InternInPlace(&str);\n if (PyArena_AddPyObject(c->c_arena, str) < 0) {\n Py_DECREF(str);\n return NULL;\n }\n return alias(str, NULL, c->c_arena);\n }\n break;\n case STAR:\n str = PyUnicode_InternFromString(\"*\");\n if (!str)\n return NULL;\n if (PyArena_AddPyObject(c->c_arena, str) < 0) {\n Py_DECREF(str);\n return NULL;\n }\n return alias(str, NULL, c->c_arena);\n default:\n PyErr_Format(PyExc_SystemError,\n \"unexpected import name: %d\", TYPE(n));\n return NULL;\n }\n\n PyErr_SetString(PyExc_SystemError, \"unhandled import name condition\");\n return NULL;\n}\n\nstatic stmt_ty\nast_for_import_stmt(struct compiling *c, const node *n)\n{\n /*\n import_stmt: import_name | import_from\n import_name: 'import' dotted_as_names\n import_from: 'from' (('.' | '...')* dotted_name | ('.' | '...')+)\n 'import' ('*' | '(' import_as_names ')' | import_as_names)\n */\n int lineno;\n int col_offset;\n int i;\n asdl_seq *aliases;\n\n REQ(n, import_stmt);\n lineno = LINENO(n);\n col_offset = n->n_col_offset;\n n = CHILD(n, 0);\n if (TYPE(n) == import_name) {\n n = CHILD(n, 1);\n REQ(n, dotted_as_names);\n aliases = _Ta3_asdl_seq_new((NCH(n) + 1) / 2, c->c_arena);\n if (!aliases)\n return NULL;\n for (i = 0; i < NCH(n); i += 2) {\n alias_ty import_alias = alias_for_import_name(c, CHILD(n, i), 1);\n if (!import_alias)\n return NULL;\n asdl_seq_SET(aliases, i / 2, import_alias);\n }\n return Import(aliases, lineno, col_offset, c->c_arena);\n }\n else if (TYPE(n) == import_from) {\n int n_children;\n int idx, ndots = 0;\n alias_ty mod = NULL;\n identifier modname = NULL;\n\n /* Count the number of dots (for relative imports) and check for the\n optional module name */\n for (idx = 1; idx < NCH(n); idx++) {\n if (TYPE(CHILD(n, idx)) == dotted_name) {\n mod = alias_for_import_name(c, CHILD(n, idx), 0);\n if (!mod)\n return NULL;\n idx++;\n break;\n } else if (TYPE(CHILD(n, idx)) == ELLIPSIS) {\n /* three consecutive dots are tokenized as one ELLIPSIS */\n ndots += 3;\n continue;\n } else if (TYPE(CHILD(n, idx)) != DOT) {\n break;\n }\n ndots++;\n }\n idx++; /* skip over the 'import' keyword */\n switch (TYPE(CHILD(n, idx))) {\n case STAR:\n /* from ... import * */\n n = CHILD(n, idx);\n n_children = 1;\n break;\n case LPAR:\n /* from ... import (x, y, z) */\n n = CHILD(n, idx + 1);\n n_children = NCH(n);\n break;\n case import_as_names:\n /* from ... import x, y, z */\n n = CHILD(n, idx);\n n_children = NCH(n);\n if (n_children % 2 == 0) {\n ast_error(c, n, \"trailing comma not allowed without\"\n \" surrounding parentheses\");\n return NULL;\n }\n break;\n default:\n ast_error(c, n, \"Unexpected node-type in from-import\");\n return NULL;\n }\n\n aliases = _Ta3_asdl_seq_new((n_children + 1) / 2, c->c_arena);\n if (!aliases)\n return NULL;\n\n /* handle \"from ... import *\" special b/c there's no children */\n if (TYPE(n) == STAR) {\n alias_ty import_alias = alias_for_import_name(c, n, 1);\n if (!import_alias)\n return NULL;\n asdl_seq_SET(aliases, 0, import_alias);\n }\n else {\n for (i = 0; i < NCH(n); i += 2) {\n alias_ty import_alias = alias_for_import_name(c, CHILD(n, i), 1);\n if (!import_alias)\n return NULL;\n asdl_seq_SET(aliases, i / 2, import_alias);\n }\n }\n if (mod != NULL)\n modname = mod->name;\n return ImportFrom(modname, aliases, ndots, lineno, col_offset,\n c->c_arena);\n }\n PyErr_Format(PyExc_SystemError,\n \"unknown import statement: starts with command '%s'\",\n STR(CHILD(n, 0)));\n return NULL;\n}\n\nstatic stmt_ty\nast_for_global_stmt(struct compiling *c, const node *n)\n{\n /* global_stmt: 'global' NAME (',' NAME)* */\n identifier name;\n asdl_seq *s;\n int i;\n\n REQ(n, global_stmt);\n s = _Ta3_asdl_seq_new(NCH(n) / 2, c->c_arena);\n if (!s)\n return NULL;\n for (i = 1; i < NCH(n); i += 2) {\n name = NEW_IDENTIFIER(CHILD(n, i));\n if (!name)\n return NULL;\n asdl_seq_SET(s, i / 2, name);\n }\n return Global(s, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_nonlocal_stmt(struct compiling *c, const node *n)\n{\n /* nonlocal_stmt: 'nonlocal' NAME (',' NAME)* */\n identifier name;\n asdl_seq *s;\n int i;\n\n REQ(n, nonlocal_stmt);\n s = _Ta3_asdl_seq_new(NCH(n) / 2, c->c_arena);\n if (!s)\n return NULL;\n for (i = 1; i < NCH(n); i += 2) {\n name = NEW_IDENTIFIER(CHILD(n, i));\n if (!name)\n return NULL;\n asdl_seq_SET(s, i / 2, name);\n }\n return Nonlocal(s, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_assert_stmt(struct compiling *c, const node *n)\n{\n /* assert_stmt: 'assert' test [',' test] */\n REQ(n, assert_stmt);\n if (NCH(n) == 2) {\n expr_ty expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n return Assert(expression, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else if (NCH(n) == 4) {\n expr_ty expr1, expr2;\n\n expr1 = ast_for_expr(c, CHILD(n, 1));\n if (!expr1)\n return NULL;\n expr2 = ast_for_expr(c, CHILD(n, 3));\n if (!expr2)\n return NULL;\n\n return Assert(expr1, expr2, LINENO(n), n->n_col_offset, c->c_arena);\n }\n PyErr_Format(PyExc_SystemError,\n \"improper number of parts to 'assert' statement: %d\",\n NCH(n));\n return NULL;\n}\n\nstatic asdl_seq *\nast_for_suite(struct compiling *c, const node *n)\n{\n /* suite: simple_stmt | NEWLINE [TYPE_COMMENT NEWLINE] INDENT stmt+ DEDENT */\n asdl_seq *seq;\n stmt_ty s;\n int i, total, num, end, pos = 0;\n node *ch;\n\n REQ(n, suite);\n\n total = num_stmts(n);\n seq = _Ta3_asdl_seq_new(total, c->c_arena);\n if (!seq)\n return NULL;\n if (TYPE(CHILD(n, 0)) == simple_stmt) {\n n = CHILD(n, 0);\n /* simple_stmt always ends with a NEWLINE,\n and may have a trailing SEMI\n */\n end = NCH(n) - 1;\n if (TYPE(CHILD(n, end - 1)) == SEMI)\n end--;\n /* loop by 2 to skip semi-colons */\n for (i = 0; i < end; i += 2) {\n ch = CHILD(n, i);\n s = ast_for_stmt(c, ch);\n if (!s)\n return NULL;\n asdl_seq_SET(seq, pos++, s);\n }\n }\n else {\n i = 2;\n if (TYPE(CHILD(n, 1)) == TYPE_COMMENT)\n i += 2;\n\n for (; i < (NCH(n) - 1); i++) {\n ch = CHILD(n, i);\n REQ(ch, stmt);\n num = num_stmts(ch);\n if (num == 1) {\n /* small_stmt or compound_stmt with only one child */\n s = ast_for_stmt(c, ch);\n if (!s)\n return NULL;\n asdl_seq_SET(seq, pos++, s);\n }\n else {\n int j;\n ch = CHILD(ch, 0);\n REQ(ch, simple_stmt);\n for (j = 0; j < NCH(ch); j += 2) {\n /* statement terminates with a semi-colon ';' */\n if (NCH(CHILD(ch, j)) == 0) {\n assert((j + 1) == NCH(ch));\n break;\n }\n s = ast_for_stmt(c, CHILD(ch, j));\n if (!s)\n return NULL;\n asdl_seq_SET(seq, pos++, s);\n }\n }\n }\n }\n assert(pos == seq->size);\n return seq;\n}\n\nstatic stmt_ty\nast_for_if_stmt(struct compiling *c, const node *n)\n{\n /* if_stmt: 'if' test ':' suite ('elif' test ':' suite)*\n ['else' ':' suite]\n */\n char *s;\n\n REQ(n, if_stmt);\n\n if (NCH(n) == 4) {\n expr_ty expression;\n asdl_seq *suite_seq;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, 3));\n if (!suite_seq)\n return NULL;\n\n return If(expression, suite_seq, NULL, LINENO(n), n->n_col_offset,\n c->c_arena);\n }\n\n s = STR(CHILD(n, 4));\n /* s[2], the third character in the string, will be\n 's' for el_s_e, or\n 'i' for el_i_f\n */\n if (s[2] == 's') {\n expr_ty expression;\n asdl_seq *seq1, *seq2;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n seq1 = ast_for_suite(c, CHILD(n, 3));\n if (!seq1)\n return NULL;\n seq2 = ast_for_suite(c, CHILD(n, 6));\n if (!seq2)\n return NULL;\n\n return If(expression, seq1, seq2, LINENO(n), n->n_col_offset,\n c->c_arena);\n }\n else if (s[2] == 'i') {\n int i, n_elif, has_else = 0;\n expr_ty expression;\n asdl_seq *suite_seq;\n asdl_seq *orelse = NULL;\n n_elif = NCH(n) - 4;\n /* must reference the child n_elif+1 since 'else' token is third,\n not fourth, child from the end. */\n if (TYPE(CHILD(n, (n_elif + 1))) == NAME\n && STR(CHILD(n, (n_elif + 1)))[2] == 's') {\n has_else = 1;\n n_elif -= 3;\n }\n n_elif /= 4;\n\n if (has_else) {\n asdl_seq *suite_seq2;\n\n orelse = _Ta3_asdl_seq_new(1, c->c_arena);\n if (!orelse)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, NCH(n) - 6));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, NCH(n) - 4));\n if (!suite_seq)\n return NULL;\n suite_seq2 = ast_for_suite(c, CHILD(n, NCH(n) - 1));\n if (!suite_seq2)\n return NULL;\n\n asdl_seq_SET(orelse, 0,\n If(expression, suite_seq, suite_seq2,\n LINENO(CHILD(n, NCH(n) - 6)),\n CHILD(n, NCH(n) - 6)->n_col_offset,\n c->c_arena));\n /* the just-created orelse handled the last elif */\n n_elif--;\n }\n\n for (i = 0; i < n_elif; i++) {\n int off = 5 + (n_elif - i - 1) * 4;\n asdl_seq *newobj = _Ta3_asdl_seq_new(1, c->c_arena);\n if (!newobj)\n return NULL;\n expression = ast_for_expr(c, CHILD(n, off));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, off + 2));\n if (!suite_seq)\n return NULL;\n\n asdl_seq_SET(newobj, 0,\n If(expression, suite_seq, orelse,\n LINENO(CHILD(n, off)),\n CHILD(n, off)->n_col_offset, c->c_arena));\n orelse = newobj;\n }\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, 3));\n if (!suite_seq)\n return NULL;\n return If(expression, suite_seq, orelse,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n PyErr_Format(PyExc_SystemError,\n \"unexpected token in 'if' statement: %s\", s);\n return NULL;\n}\n\nstatic stmt_ty\nast_for_while_stmt(struct compiling *c, const node *n)\n{\n /* while_stmt: 'while' test ':' suite ['else' ':' suite] */\n REQ(n, while_stmt);\n\n if (NCH(n) == 4) {\n expr_ty expression;\n asdl_seq *suite_seq;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, 3));\n if (!suite_seq)\n return NULL;\n return While(expression, suite_seq, NULL, LINENO(n), n->n_col_offset, c->c_arena);\n }\n else if (NCH(n) == 7) {\n expr_ty expression;\n asdl_seq *seq1, *seq2;\n\n expression = ast_for_expr(c, CHILD(n, 1));\n if (!expression)\n return NULL;\n seq1 = ast_for_suite(c, CHILD(n, 3));\n if (!seq1)\n return NULL;\n seq2 = ast_for_suite(c, CHILD(n, 6));\n if (!seq2)\n return NULL;\n\n return While(expression, seq1, seq2, LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n PyErr_Format(PyExc_SystemError,\n \"wrong number of tokens for 'while' statement: %d\",\n NCH(n));\n return NULL;\n}\n\nstatic stmt_ty\nast_for_for_stmt(struct compiling *c, const node *n0, bool is_async)\n{\n const node * const n = is_async ? CHILD(n0, 1) : n0;\n asdl_seq *_target, *seq = NULL, *suite_seq;\n expr_ty expression;\n expr_ty target, first;\n const node *node_target;\n int has_type_comment;\n string type_comment;\n\n if (is_async && c->c_feature_version < 5) {\n ast_error(c, n,\n \"Async for loops are only supported in Python 3.5 and greater\");\n return NULL;\n }\n\n /* for_stmt: 'for' exprlist 'in' testlist ':' [TYPE_COMMENT] suite ['else' ':' suite] */\n REQ(n, for_stmt);\n\n has_type_comment = TYPE(CHILD(n, 5)) == TYPE_COMMENT;\n\n if (NCH(n) == 9 + has_type_comment) {\n seq = ast_for_suite(c, CHILD(n, 8 + has_type_comment));\n if (!seq)\n return NULL;\n }\n\n node_target = CHILD(n, 1);\n _target = ast_for_exprlist(c, node_target, Store);\n if (!_target)\n return NULL;\n /* Check the # of children rather than the length of _target, since\n for x, in ... has 1 element in _target, but still requires a Tuple. */\n first = (expr_ty)asdl_seq_GET(_target, 0);\n if (NCH(node_target) == 1)\n target = first;\n else\n target = Tuple(_target, Store, first->lineno, first->col_offset, c->c_arena);\n\n expression = ast_for_testlist(c, CHILD(n, 3));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, CHILD(n, 5 + has_type_comment));\n if (!suite_seq)\n return NULL;\n\n if (has_type_comment)\n type_comment = NEW_TYPE_COMMENT(CHILD(n, 5));\n else\n type_comment = NULL;\n\n if (is_async)\n return AsyncFor(target, expression, suite_seq, seq, type_comment,\n LINENO(n0), n0->n_col_offset,\n c->c_arena);\n else\n return For(target, expression, suite_seq, seq, type_comment,\n LINENO(n), n->n_col_offset,\n c->c_arena);\n}\n\nstatic excepthandler_ty\nast_for_except_clause(struct compiling *c, const node *exc, node *body)\n{\n /* except_clause: 'except' [test ['as' test]] */\n REQ(exc, except_clause);\n REQ(body, suite);\n\n if (NCH(exc) == 1) {\n asdl_seq *suite_seq = ast_for_suite(c, body);\n if (!suite_seq)\n return NULL;\n\n return ExceptHandler(NULL, NULL, suite_seq, LINENO(exc),\n exc->n_col_offset, c->c_arena);\n }\n else if (NCH(exc) == 2) {\n expr_ty expression;\n asdl_seq *suite_seq;\n\n expression = ast_for_expr(c, CHILD(exc, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, body);\n if (!suite_seq)\n return NULL;\n\n return ExceptHandler(expression, NULL, suite_seq, LINENO(exc),\n exc->n_col_offset, c->c_arena);\n }\n else if (NCH(exc) == 4) {\n asdl_seq *suite_seq;\n expr_ty expression;\n identifier e = NEW_IDENTIFIER(CHILD(exc, 3));\n if (!e)\n return NULL;\n if (forbidden_name(c, e, CHILD(exc, 3), 0))\n return NULL;\n expression = ast_for_expr(c, CHILD(exc, 1));\n if (!expression)\n return NULL;\n suite_seq = ast_for_suite(c, body);\n if (!suite_seq)\n return NULL;\n\n return ExceptHandler(expression, e, suite_seq, LINENO(exc),\n exc->n_col_offset, c->c_arena);\n }\n\n PyErr_Format(PyExc_SystemError,\n \"wrong number of children for 'except' clause: %d\",\n NCH(exc));\n return NULL;\n}\n\nstatic stmt_ty\nast_for_try_stmt(struct compiling *c, const node *n)\n{\n const int nch = NCH(n);\n int n_except = (nch - 3)/3;\n asdl_seq *body, *handlers = NULL, *orelse = NULL, *finally = NULL;\n\n REQ(n, try_stmt);\n\n body = ast_for_suite(c, CHILD(n, 2));\n if (body == NULL)\n return NULL;\n\n if (TYPE(CHILD(n, nch - 3)) == NAME) {\n if (strcmp(STR(CHILD(n, nch - 3)), \"finally\") == 0) {\n if (nch >= 9 && TYPE(CHILD(n, nch - 6)) == NAME) {\n /* we can assume it's an \"else\",\n because nch >= 9 for try-else-finally and\n it would otherwise have a type of except_clause */\n orelse = ast_for_suite(c, CHILD(n, nch - 4));\n if (orelse == NULL)\n return NULL;\n n_except--;\n }\n\n finally = ast_for_suite(c, CHILD(n, nch - 1));\n if (finally == NULL)\n return NULL;\n n_except--;\n }\n else {\n /* we can assume it's an \"else\",\n otherwise it would have a type of except_clause */\n orelse = ast_for_suite(c, CHILD(n, nch - 1));\n if (orelse == NULL)\n return NULL;\n n_except--;\n }\n }\n else if (TYPE(CHILD(n, nch - 3)) != except_clause) {\n ast_error(c, n, \"malformed 'try' statement\");\n return NULL;\n }\n\n if (n_except > 0) {\n int i;\n /* process except statements to create a try ... except */\n handlers = _Ta3_asdl_seq_new(n_except, c->c_arena);\n if (handlers == NULL)\n return NULL;\n\n for (i = 0; i < n_except; i++) {\n excepthandler_ty e = ast_for_except_clause(c, CHILD(n, 3 + i * 3),\n CHILD(n, 5 + i * 3));\n if (!e)\n return NULL;\n asdl_seq_SET(handlers, i, e);\n }\n }\n\n assert(finally != NULL || asdl_seq_LEN(handlers));\n return Try(body, handlers, orelse, finally, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\n/* with_item: test ['as' expr] */\nstatic withitem_ty\nast_for_with_item(struct compiling *c, const node *n)\n{\n expr_ty context_expr, optional_vars = NULL;\n\n REQ(n, with_item);\n context_expr = ast_for_expr(c, CHILD(n, 0));\n if (!context_expr)\n return NULL;\n if (NCH(n) == 3) {\n optional_vars = ast_for_expr(c, CHILD(n, 2));\n\n if (!optional_vars) {\n return NULL;\n }\n if (!set_context(c, optional_vars, Store, n)) {\n return NULL;\n }\n }\n\n return withitem(context_expr, optional_vars, c->c_arena);\n}\n\n/* with_stmt: 'with' with_item (',' with_item)* ':' [TYPE_COMMENT] suite */\nstatic stmt_ty\nast_for_with_stmt(struct compiling *c, const node *n0, bool is_async)\n{\n const node * const n = is_async ? CHILD(n0, 1) : n0;\n int i, n_items, nch_minus_type, has_type_comment;\n asdl_seq *items, *body;\n string type_comment;\n\n if (is_async && c->c_feature_version < 5) {\n ast_error(c, n,\n \"Async with statements are only supported in Python 3.5 and greater\");\n return NULL;\n }\n\n REQ(n, with_stmt);\n\n has_type_comment = TYPE(CHILD(n, NCH(n) - 2)) == TYPE_COMMENT;\n nch_minus_type = NCH(n) - has_type_comment;\n\n n_items = (nch_minus_type - 2) / 2;\n items = _Ta3_asdl_seq_new(n_items, c->c_arena);\n if (!items)\n return NULL;\n for (i = 1; i < nch_minus_type - 2; i += 2) {\n withitem_ty item = ast_for_with_item(c, CHILD(n, i));\n if (!item)\n return NULL;\n asdl_seq_SET(items, (i - 1) / 2, item);\n }\n\n body = ast_for_suite(c, CHILD(n, NCH(n) - 1));\n if (!body)\n return NULL;\n\n if (has_type_comment)\n type_comment = NEW_TYPE_COMMENT(CHILD(n, NCH(n) - 2));\n else\n type_comment = NULL;\n\n if (is_async)\n return AsyncWith(items, body, type_comment, LINENO(n0), n0->n_col_offset, c->c_arena);\n else\n return With(items, body, type_comment, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_classdef(struct compiling *c, const node *n, asdl_seq *decorator_seq)\n{\n /* classdef: 'class' NAME ['(' arglist ')'] ':' suite */\n PyObject *classname;\n asdl_seq *s;\n expr_ty call;\n\n REQ(n, classdef);\n\n if (NCH(n) == 4) { /* class NAME ':' suite */\n s = ast_for_suite(c, CHILD(n, 3));\n if (!s)\n return NULL;\n classname = NEW_IDENTIFIER(CHILD(n, 1));\n if (!classname)\n return NULL;\n if (forbidden_name(c, classname, CHILD(n, 3), 0))\n return NULL;\n return ClassDef(classname, NULL, NULL, s, decorator_seq,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n if (TYPE(CHILD(n, 3)) == RPAR) { /* class NAME '(' ')' ':' suite */\n s = ast_for_suite(c, CHILD(n, 5));\n if (!s)\n return NULL;\n classname = NEW_IDENTIFIER(CHILD(n, 1));\n if (!classname)\n return NULL;\n if (forbidden_name(c, classname, CHILD(n, 3), 0))\n return NULL;\n return ClassDef(classname, NULL, NULL, s, decorator_seq,\n LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n /* class NAME '(' arglist ')' ':' suite */\n /* build up a fake Call node so we can extract its pieces */\n {\n PyObject *dummy_name;\n expr_ty dummy;\n dummy_name = NEW_IDENTIFIER(CHILD(n, 1));\n if (!dummy_name)\n return NULL;\n dummy = Name(dummy_name, Load, LINENO(n), n->n_col_offset, c->c_arena);\n call = ast_for_call(c, CHILD(n, 3), dummy, false);\n if (!call)\n return NULL;\n }\n s = ast_for_suite(c, CHILD(n, 6));\n if (!s)\n return NULL;\n classname = NEW_IDENTIFIER(CHILD(n, 1));\n if (!classname)\n return NULL;\n if (forbidden_name(c, classname, CHILD(n, 1), 0))\n return NULL;\n\n return ClassDef(classname, call->v.Call.args, call->v.Call.keywords, s,\n decorator_seq, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\nstatic stmt_ty\nast_for_stmt(struct compiling *c, const node *n)\n{\n if (TYPE(n) == stmt) {\n assert(NCH(n) == 1);\n n = CHILD(n, 0);\n }\n if (TYPE(n) == simple_stmt) {\n assert(num_stmts(n) == 1);\n n = CHILD(n, 0);\n }\n if (TYPE(n) == small_stmt) {\n n = CHILD(n, 0);\n /* small_stmt: expr_stmt | del_stmt | pass_stmt | flow_stmt\n | import_stmt | global_stmt | nonlocal_stmt | assert_stmt\n */\n switch (TYPE(n)) {\n case expr_stmt:\n return ast_for_expr_stmt(c, n);\n case del_stmt:\n return ast_for_del_stmt(c, n);\n case pass_stmt:\n return Pass(LINENO(n), n->n_col_offset, c->c_arena);\n case flow_stmt:\n return ast_for_flow_stmt(c, n);\n case import_stmt:\n return ast_for_import_stmt(c, n);\n case global_stmt:\n return ast_for_global_stmt(c, n);\n case nonlocal_stmt:\n return ast_for_nonlocal_stmt(c, n);\n case assert_stmt:\n return ast_for_assert_stmt(c, n);\n default:\n PyErr_Format(PyExc_SystemError,\n \"unhandled small_stmt: TYPE=%d NCH=%d\\n\",\n TYPE(n), NCH(n));\n return NULL;\n }\n }\n else {\n /* compound_stmt: if_stmt | while_stmt | for_stmt | try_stmt\n | funcdef | classdef | decorated | async_stmt\n */\n node *ch = CHILD(n, 0);\n REQ(n, compound_stmt);\n switch (TYPE(ch)) {\n case if_stmt:\n return ast_for_if_stmt(c, ch);\n case while_stmt:\n return ast_for_while_stmt(c, ch);\n case for_stmt:\n return ast_for_for_stmt(c, ch, 0);\n case try_stmt:\n return ast_for_try_stmt(c, ch);\n case with_stmt:\n return ast_for_with_stmt(c, ch, 0);\n case funcdef:\n return ast_for_funcdef(c, ch, NULL);\n case classdef:\n return ast_for_classdef(c, ch, NULL);\n case decorated:\n return ast_for_decorated(c, ch);\n case async_stmt:\n return ast_for_async_stmt(c, ch);\n default:\n PyErr_Format(PyExc_SystemError,\n \"unhandled small_stmt: TYPE=%d NCH=%d\\n\",\n TYPE(n), NCH(n));\n return NULL;\n }\n }\n}\n\nstatic PyObject *\nparsenumber_raw(struct compiling *c, const char *s)\n{\n const char *end;\n long x;\n double dx;\n Py_complex compl;\n int imflag;\n\n assert(s != NULL);\n errno = 0;\n end = s + strlen(s) - 1;\n imflag = *end == 'j' || *end == 'J';\n if (s[0] == '0') {\n x = (long) PyOS_strtoul(s, (char **)&end, 0);\n if (x < 0 && errno == 0) {\n return PyLong_FromString(s, (char **)0, 0);\n }\n }\n else\n x = PyOS_strtol(s, (char **)&end, 0);\n if (*end == '\\0') {\n if (errno != 0)\n return PyLong_FromString(s, (char **)0, 0);\n return PyLong_FromLong(x);\n }\n /* XXX Huge floats may silently fail */\n if (imflag) {\n compl.real = 0.;\n compl.imag = PyOS_string_to_double(s, (char **)&end, NULL);\n if (compl.imag == -1.0 && PyErr_Occurred())\n return NULL;\n return PyComplex_FromCComplex(compl);\n }\n else\n {\n dx = PyOS_string_to_double(s, NULL, NULL);\n if (dx == -1.0 && PyErr_Occurred())\n return NULL;\n return PyFloat_FromDouble(dx);\n }\n}\n\nstatic PyObject *\nparsenumber(struct compiling *c, const char *s)\n{\n char *dup, *end;\n PyObject *res = NULL;\n\n assert(s != NULL);\n\n if (strchr(s, '_') == NULL) {\n return parsenumber_raw(c, s);\n }\n /* Create a duplicate without underscores. */\n dup = PyMem_Malloc(strlen(s) + 1);\n if (dup == NULL) {\n return PyErr_NoMemory();\n }\n end = dup;\n for (; *s; s++) {\n if (*s != '_') {\n *end++ = *s;\n }\n }\n *end = '\\0';\n res = parsenumber_raw(c, dup);\n PyMem_Free(dup);\n return res;\n}\n\nstatic PyObject *\ndecode_utf8(struct compiling *c, const char **sPtr, const char *end)\n{\n const char *s, *t;\n t = s = *sPtr;\n /* while (s < end && *s != '\\\\') s++; */ /* inefficient for u\"..\" */\n while (s < end && (*s & 0x80)) s++;\n *sPtr = s;\n return PyUnicode_DecodeUTF8(t, s - t, NULL);\n}\n\nstatic int\nwarn_invalid_escape_sequence(struct compiling *c, const node *n,\n unsigned char first_invalid_escape_char)\n{\n PyObject *msg = PyUnicode_FromFormat(\"invalid escape sequence \\\\%c\",\n first_invalid_escape_char);\n if (msg == NULL) {\n return -1;\n }\n if (PyErr_WarnExplicitObject(PyExc_DeprecationWarning, msg,\n c->c_filename, LINENO(n),\n NULL, NULL) < 0)\n {\n if (PyErr_ExceptionMatches(PyExc_DeprecationWarning)) {\n const char *s;\n\n /* Replace the DeprecationWarning exception with a SyntaxError\n to get a more accurate error report */\n PyErr_Clear();\n\n s = PyUnicode_AsUTF8(msg);\n if (s != NULL) {\n ast_error(c, n, s);\n }\n }\n Py_DECREF(msg);\n return -1;\n }\n Py_DECREF(msg);\n return 0;\n}\n\nstatic PyObject *\ndecode_unicode_with_escapes(struct compiling *c, const node *n, const char *s,\n size_t len)\n{\n PyObject *v, *u;\n char *buf;\n char *p;\n const char *end;\n const char *first_invalid_escape;\n\n /* check for integer overflow */\n if (len > SIZE_MAX / 6)\n return NULL;\n /* \"ä\" (2 bytes) may become \"\\U000000E4\" (10 bytes), or 1:5\n \"\\ä\" (3 bytes) may become \"\\u005c\\U000000E4\" (16 bytes), or ~1:6 */\n u = PyBytes_FromStringAndSize((char *)NULL, len * 6);\n if (u == NULL)\n return NULL;\n p = buf = PyBytes_AsString(u);\n end = s + len;\n while (s < end) {\n if (*s == '\\\\') {\n *p++ = *s++;\n if (s >= end || *s & 0x80) {\n strcpy(p, \"u005c\");\n p += 5;\n if (s >= end)\n break;\n }\n }\n if (*s & 0x80) { /* XXX inefficient */\n PyObject *w;\n int kind;\n void *data;\n Py_ssize_t len, i;\n w = decode_utf8(c, &s, end);\n if (w == NULL) {\n Py_DECREF(u);\n return NULL;\n }\n kind = PyUnicode_KIND(w);\n data = PyUnicode_DATA(w);\n len = PyUnicode_GET_LENGTH(w);\n for (i = 0; i < len; i++) {\n Py_UCS4 chr = PyUnicode_READ(kind, data, i);\n sprintf(p, \"\\\\U%08x\", chr);\n p += 10;\n }\n /* Should be impossible to overflow */\n assert(p - buf <= PyBytes_GET_SIZE(u));\n Py_DECREF(w);\n } else {\n *p++ = *s++;\n }\n }\n len = p - buf;\n s = buf;\n\n v = _PyUnicode_DecodeUnicodeEscape(s, len, NULL, &first_invalid_escape);\n\n if (v != NULL && first_invalid_escape != NULL) {\n if (warn_invalid_escape_sequence(c, n, *first_invalid_escape) < 0) {\n /* We have not decref u before because first_invalid_escape points\n inside u. */\n Py_XDECREF(u);\n Py_DECREF(v);\n return NULL;\n }\n }\n Py_XDECREF(u);\n return v;\n}\n\nstatic PyObject *\ndecode_bytes_with_escapes(struct compiling *c, const node *n, const char *s,\n size_t len)\n{\n const char *first_invalid_escape;\n PyObject *result = _PyBytes_DecodeEscape(s, len, NULL, 0, NULL,\n &first_invalid_escape);\n if (result == NULL)\n return NULL;\n\n if (first_invalid_escape != NULL) {\n if (warn_invalid_escape_sequence(c, n, *first_invalid_escape) < 0) {\n Py_DECREF(result);\n return NULL;\n }\n }\n return result;\n}\n\n/* Shift locations for the given node and all its children by adding `lineno`\n and `col_offset` to existing locations. */\nstatic void fstring_shift_node_locations(node *n, int lineno, int col_offset)\n{\n int i;\n n->n_col_offset = n->n_col_offset + col_offset;\n for (i = 0; i < NCH(n); ++i) {\n if (n->n_lineno && n->n_lineno < CHILD(n, i)->n_lineno) {\n /* Shifting column offsets unnecessary if there's been newlines. */\n col_offset = 0;\n }\n fstring_shift_node_locations(CHILD(n, i), lineno, col_offset);\n }\n n->n_lineno = n->n_lineno + lineno;\n}\n\n/* Fix locations for the given node and its children.\n\n `parent` is the enclosing node.\n `n` is the node which locations are going to be fixed relative to parent.\n `expr_str` is the child node's string representation, including braces.\n*/\nstatic void\nfstring_fix_node_location(const node *parent, node *n, char *expr_str)\n{\n char *substr = NULL;\n char *start;\n int lines = LINENO(parent) - 1;\n int cols = parent->n_col_offset;\n /* Find the full fstring to fix location information in `n`. */\n while (parent && parent->n_type != STRING)\n parent = parent->n_child;\n if (parent && parent->n_str) {\n substr = strstr(parent->n_str, expr_str);\n if (substr) {\n start = substr;\n while (start > parent->n_str) {\n if (start[0] == '\\n')\n break;\n start--;\n }\n cols += substr - start;\n /* Fix lineno in mulitline strings. */\n while ((substr = strchr(substr + 1, '\\n')))\n lines--;\n }\n }\n fstring_shift_node_locations(n, lines, cols);\n}\n\n/* Compile this expression in to an expr_ty. Add parens around the\n expression, in order to allow leading spaces in the expression. */\nstatic expr_ty\nfstring_compile_expr(const char *expr_start, const char *expr_end,\n struct compiling *c, const node *n)\n\n{\n PyCompilerFlags cf;\n node *mod_n;\n mod_ty mod;\n char *str;\n Py_ssize_t len;\n const char *s;\n PyObject *fstring_name;\n\n assert(expr_end >= expr_start);\n assert(*(expr_start-1) == '{');\n assert(*expr_end == '}' || *expr_end == '!' || *expr_end == ':');\n\n /* If the substring is all whitespace, it's an error. We need to catch this\n here, and not when we call PyParser_SimpleParseStringFlagsFilename,\n because turning the expression '' in to '()' would go from being invalid\n to valid. */\n for (s = expr_start; s != expr_end; s++) {\n char c = *s;\n /* The Python parser ignores only the following whitespace\n characters (\\r already is converted to \\n). */\n if (!(c == ' ' || c == '\\t' || c == '\\n' || c == '\\f')) {\n break;\n }\n }\n if (s == expr_end) {\n ast_error(c, n, \"f-string: empty expression not allowed\");\n return NULL;\n }\n\n len = expr_end - expr_start;\n /* Allocate 3 extra bytes: open paren, close paren, null byte. */\n str = PyMem_RawMalloc(len + 3);\n if (str == NULL) {\n PyErr_NoMemory();\n return NULL;\n }\n\n str[0] = '(';\n memcpy(str+1, expr_start, len);\n str[len+1] = ')';\n str[len+2] = 0;\n\n cf.cf_flags = PyCF_ONLY_AST;\n mod_n = PyParser_SimpleParseStringFlagsFilename(str, \"\",\n Py_eval_input, 0);\n if (!mod_n) {\n PyMem_RawFree(str);\n return NULL;\n }\n /* Reuse str to find the correct column offset. */\n str[0] = '{';\n str[len+1] = '}';\n fstring_fix_node_location(n, mod_n, str);\n fstring_name = PyUnicode_FromString(\"\");\n mod = string_object_to_c_ast(str, fstring_name,\n Py_eval_input, &cf,\n c->c_feature_version, c->c_arena);\n Py_DECREF(fstring_name);\n PyMem_RawFree(str);\n Ta3Node_Free(mod_n);\n if (!mod)\n return NULL;\n return mod->v.Expression.body;\n}\n\n/* Return -1 on error.\n\n Return 0 if we reached the end of the literal.\n\n Return 1 if we haven't reached the end of the literal, but we want\n the caller to process the literal up to this point. Used for\n doubled braces.\n*/\nstatic int\nfstring_find_literal(const char **str, const char *end, int raw,\n PyObject **literal, int recurse_lvl,\n struct compiling *c, const node *n)\n{\n /* Get any literal string. It ends when we hit an un-doubled left\n brace (which isn't part of a unicode name escape such as\n \"\\N{EULER CONSTANT}\"), or the end of the string. */\n\n const char *s = *str;\n const char *literal_start = s;\n int result = 0;\n\n assert(*literal == NULL);\n while (s < end) {\n char ch = *s++;\n if (!raw && ch == '\\\\' && s < end) {\n ch = *s++;\n if (ch == 'N') {\n if (s < end && *s++ == '{') {\n while (s < end && *s++ != '}') {\n }\n continue;\n }\n break;\n }\n if (ch == '{' && warn_invalid_escape_sequence(c, n, ch) < 0) {\n return -1;\n }\n }\n if (ch == '{' || ch == '}') {\n /* Check for doubled braces, but only at the top level. If\n we checked at every level, then f'{0:{3}}' would fail\n with the two closing braces. */\n if (recurse_lvl == 0) {\n if (s < end && *s == ch) {\n /* We're going to tell the caller that the literal ends\n here, but that they should continue scanning. But also\n skip over the second brace when we resume scanning. */\n *str = s + 1;\n result = 1;\n goto done;\n }\n\n /* Where a single '{' is the start of a new expression, a\n single '}' is not allowed. */\n if (ch == '}') {\n *str = s - 1;\n ast_error(c, n, \"f-string: single '}' is not allowed\");\n return -1;\n }\n }\n /* We're either at a '{', which means we're starting another\n expression; or a '}', which means we're at the end of this\n f-string (for a nested format_spec). */\n s--;\n break;\n }\n }\n *str = s;\n assert(s <= end);\n assert(s == end || *s == '{' || *s == '}');\ndone:\n if (literal_start != s) {\n if (raw)\n *literal = PyUnicode_DecodeUTF8Stateful(literal_start,\n s - literal_start,\n NULL, NULL);\n else\n *literal = decode_unicode_with_escapes(c, n, literal_start,\n s - literal_start);\n if (!*literal)\n return -1;\n }\n return result;\n}\n\n/* Forward declaration because parsing is recursive. */\nstatic expr_ty\nfstring_parse(const char **str, const char *end, int raw, int recurse_lvl,\n struct compiling *c, const node *n);\n\n/* Parse the f-string at *str, ending at end. We know *str starts an\n expression (so it must be a '{'). Returns the FormattedValue node,\n which includes the expression, conversion character, and\n format_spec expression.\n\n Note that I don't do a perfect job here: I don't make sure that a\n closing brace doesn't match an opening paren, for example. It\n doesn't need to error on all invalid expressions, just correctly\n find the end of all valid ones. Any errors inside the expression\n will be caught when we parse it later. */\nstatic int\nfstring_find_expr(const char **str, const char *end, int raw, int recurse_lvl,\n expr_ty *expression, struct compiling *c, const node *n)\n{\n /* Return -1 on error, else 0. */\n\n const char *expr_start;\n const char *expr_end;\n expr_ty simple_expression;\n expr_ty format_spec = NULL; /* Optional format specifier. */\n int conversion = -1; /* The conversion char. -1 if not specified. */\n\n /* 0 if we're not in a string, else the quote char we're trying to\n match (single or double quote). */\n char quote_char = 0;\n\n /* If we're inside a string, 1=normal, 3=triple-quoted. */\n int string_type = 0;\n\n /* Keep track of nesting level for braces/parens/brackets in\n expressions. */\n Py_ssize_t nested_depth = 0;\n\n /* Can only nest one level deep. */\n if (recurse_lvl >= 2) {\n ast_error(c, n, \"f-string: expressions nested too deeply\");\n return -1;\n }\n\n /* The first char must be a left brace, or we wouldn't have gotten\n here. Skip over it. */\n assert(**str == '{');\n *str += 1;\n\n expr_start = *str;\n for (; *str < end; (*str)++) {\n char ch;\n\n /* Loop invariants. */\n assert(nested_depth >= 0);\n assert(*str >= expr_start && *str < end);\n if (quote_char)\n assert(string_type == 1 || string_type == 3);\n else\n assert(string_type == 0);\n\n ch = **str;\n /* Nowhere inside an expression is a backslash allowed. */\n if (ch == '\\\\') {\n /* Error: can't include a backslash character, inside\n parens or strings or not. */\n ast_error(c, n, \"f-string expression part \"\n \"cannot include a backslash\");\n return -1;\n }\n if (quote_char) {\n /* We're inside a string. See if we're at the end. */\n /* This code needs to implement the same non-error logic\n as tok_get from tokenizer.c, at the letter_quote\n label. To actually share that code would be a\n nightmare. But, it's unlikely to change and is small,\n so duplicate it here. Note we don't need to catch all\n of the errors, since they'll be caught when parsing the\n expression. We just need to match the non-error\n cases. Thus we can ignore \\n in single-quoted strings,\n for example. Or non-terminated strings. */\n if (ch == quote_char) {\n /* Does this match the string_type (single or triple\n quoted)? */\n if (string_type == 3) {\n if (*str+2 < end && *(*str+1) == ch && *(*str+2) == ch) {\n /* We're at the end of a triple quoted string. */\n *str += 2;\n string_type = 0;\n quote_char = 0;\n continue;\n }\n } else {\n /* We're at the end of a normal string. */\n quote_char = 0;\n string_type = 0;\n continue;\n }\n }\n } else if (ch == '\\'' || ch == '\"') {\n /* Is this a triple quoted string? */\n if (*str+2 < end && *(*str+1) == ch && *(*str+2) == ch) {\n string_type = 3;\n *str += 2;\n } else {\n /* Start of a normal string. */\n string_type = 1;\n }\n /* Start looking for the end of the string. */\n quote_char = ch;\n } else if (ch == '[' || ch == '{' || ch == '(') {\n nested_depth++;\n } else if (nested_depth != 0 &&\n (ch == ']' || ch == '}' || ch == ')')) {\n nested_depth--;\n } else if (ch == '#') {\n /* Error: can't include a comment character, inside parens\n or not. */\n ast_error(c, n, \"f-string expression part cannot include '#'\");\n return -1;\n } else if (nested_depth == 0 &&\n (ch == '!' || ch == ':' || ch == '}')) {\n /* First, test for the special case of \"!=\". Since '=' is\n not an allowed conversion character, nothing is lost in\n this test. */\n if (ch == '!' && *str+1 < end && *(*str+1) == '=') {\n /* This isn't a conversion character, just continue. */\n continue;\n }\n /* Normal way out of this loop. */\n break;\n } else {\n /* Just consume this char and loop around. */\n }\n }\n expr_end = *str;\n /* If we leave this loop in a string or with mismatched parens, we\n don't care. We'll get a syntax error when compiling the\n expression. But, we can produce a better error message, so\n let's just do that.*/\n if (quote_char) {\n ast_error(c, n, \"f-string: unterminated string\");\n return -1;\n }\n if (nested_depth) {\n ast_error(c, n, \"f-string: mismatched '(', '{', or '['\");\n return -1;\n }\n\n if (*str >= end)\n goto unexpected_end_of_string;\n\n /* Compile the expression as soon as possible, so we show errors\n related to the expression before errors related to the\n conversion or format_spec. */\n simple_expression = fstring_compile_expr(expr_start, expr_end, c, n);\n if (!simple_expression)\n return -1;\n\n /* Check for a conversion char, if present. */\n if (**str == '!') {\n *str += 1;\n if (*str >= end)\n goto unexpected_end_of_string;\n\n conversion = **str;\n *str += 1;\n\n /* Validate the conversion. */\n if (!(conversion == 's' || conversion == 'r'\n || conversion == 'a')) {\n ast_error(c, n, \"f-string: invalid conversion character: \"\n \"expected 's', 'r', or 'a'\");\n return -1;\n }\n }\n\n /* Check for the format spec, if present. */\n if (*str >= end)\n goto unexpected_end_of_string;\n if (**str == ':') {\n *str += 1;\n if (*str >= end)\n goto unexpected_end_of_string;\n\n /* Parse the format spec. */\n format_spec = fstring_parse(str, end, raw, recurse_lvl+1, c, n);\n if (!format_spec)\n return -1;\n }\n\n if (*str >= end || **str != '}')\n goto unexpected_end_of_string;\n\n /* We're at a right brace. Consume it. */\n assert(*str < end);\n assert(**str == '}');\n *str += 1;\n\n /* And now create the FormattedValue node that represents this\n entire expression with the conversion and format spec. */\n *expression = FormattedValue(simple_expression, conversion,\n format_spec, LINENO(n), n->n_col_offset,\n c->c_arena);\n if (!*expression)\n return -1;\n\n return 0;\n\nunexpected_end_of_string:\n ast_error(c, n, \"f-string: expecting '}'\");\n return -1;\n}\n\n/* Return -1 on error.\n\n Return 0 if we have a literal (possible zero length) and an\n expression (zero length if at the end of the string.\n\n Return 1 if we have a literal, but no expression, and we want the\n caller to call us again. This is used to deal with doubled\n braces.\n\n When called multiple times on the string 'a{{b{0}c', this function\n will return:\n\n 1. the literal 'a{' with no expression, and a return value\n of 1. Despite the fact that there's no expression, the return\n value of 1 means we're not finished yet.\n\n 2. the literal 'b' and the expression '0', with a return value of\n 0. The fact that there's an expression means we're not finished.\n\n 3. literal 'c' with no expression and a return value of 0. The\n combination of the return value of 0 with no expression means\n we're finished.\n*/\nstatic int\nfstring_find_literal_and_expr(const char **str, const char *end, int raw,\n int recurse_lvl, PyObject **literal,\n expr_ty *expression,\n struct compiling *c, const node *n)\n{\n int result;\n\n assert(*literal == NULL && *expression == NULL);\n\n /* Get any literal string. */\n result = fstring_find_literal(str, end, raw, literal, recurse_lvl, c, n);\n if (result < 0)\n goto error;\n\n assert(result == 0 || result == 1);\n\n if (result == 1)\n /* We have a literal, but don't look at the expression. */\n return 1;\n\n if (*str >= end || **str == '}')\n /* We're at the end of the string or the end of a nested\n f-string: no expression. The top-level error case where we\n expect to be at the end of the string but we're at a '}' is\n handled later. */\n return 0;\n\n /* We must now be the start of an expression, on a '{'. */\n assert(**str == '{');\n\n if (fstring_find_expr(str, end, raw, recurse_lvl, expression, c, n) < 0)\n goto error;\n\n return 0;\n\nerror:\n Py_CLEAR(*literal);\n return -1;\n}\n\n#define EXPRLIST_N_CACHED 64\n\ntypedef struct {\n /* Incrementally build an array of expr_ty, so be used in an\n asdl_seq. Cache some small but reasonably sized number of\n expr_ty's, and then after that start dynamically allocating,\n doubling the number allocated each time. Note that the f-string\n f'{0}a{1}' contains 3 expr_ty's: 2 FormattedValue's, and one\n Str for the literal 'a'. So you add expr_ty's about twice as\n fast as you add exressions in an f-string. */\n\n Py_ssize_t allocated; /* Number we've allocated. */\n Py_ssize_t size; /* Number we've used. */\n expr_ty *p; /* Pointer to the memory we're actually\n using. Will point to 'data' until we\n start dynamically allocating. */\n expr_ty data[EXPRLIST_N_CACHED];\n} ExprList;\n\n#ifdef NDEBUG\n#define ExprList_check_invariants(l)\n#else\nstatic void\nExprList_check_invariants(ExprList *l)\n{\n /* Check our invariants. Make sure this object is \"live\", and\n hasn't been deallocated. */\n assert(l->size >= 0);\n assert(l->p != NULL);\n if (l->size <= EXPRLIST_N_CACHED)\n assert(l->data == l->p);\n}\n#endif\n\nstatic void\nExprList_Init(ExprList *l)\n{\n l->allocated = EXPRLIST_N_CACHED;\n l->size = 0;\n\n /* Until we start allocating dynamically, p points to data. */\n l->p = l->data;\n\n ExprList_check_invariants(l);\n}\n\nstatic int\nExprList_Append(ExprList *l, expr_ty exp)\n{\n ExprList_check_invariants(l);\n if (l->size >= l->allocated) {\n /* We need to alloc (or realloc) the memory. */\n Py_ssize_t new_size = l->allocated * 2;\n\n /* See if we've ever allocated anything dynamically. */\n if (l->p == l->data) {\n Py_ssize_t i;\n /* We're still using the cached data. Switch to\n alloc-ing. */\n l->p = PyMem_RawMalloc(sizeof(expr_ty) * new_size);\n if (!l->p)\n return -1;\n /* Copy the cached data into the new buffer. */\n for (i = 0; i < l->size; i++)\n l->p[i] = l->data[i];\n } else {\n /* Just realloc. */\n expr_ty *tmp = PyMem_RawRealloc(l->p, sizeof(expr_ty) * new_size);\n if (!tmp) {\n PyMem_RawFree(l->p);\n l->p = NULL;\n return -1;\n }\n l->p = tmp;\n }\n\n l->allocated = new_size;\n assert(l->allocated == 2 * l->size);\n }\n\n l->p[l->size++] = exp;\n\n ExprList_check_invariants(l);\n return 0;\n}\n\nstatic void\nExprList_Dealloc(ExprList *l)\n{\n ExprList_check_invariants(l);\n\n /* If there's been an error, or we've never dynamically allocated,\n do nothing. */\n if (!l->p || l->p == l->data) {\n /* Do nothing. */\n } else {\n /* We have dynamically allocated. Free the memory. */\n PyMem_RawFree(l->p);\n }\n l->p = NULL;\n l->size = -1;\n}\n\nstatic asdl_seq *\nExprList_Finish(ExprList *l, PyArena *arena)\n{\n asdl_seq *seq;\n\n ExprList_check_invariants(l);\n\n /* Allocate the asdl_seq and copy the expressions in to it. */\n seq = _Ta3_asdl_seq_new(l->size, arena);\n if (seq) {\n Py_ssize_t i;\n for (i = 0; i < l->size; i++)\n asdl_seq_SET(seq, i, l->p[i]);\n }\n ExprList_Dealloc(l);\n return seq;\n}\n\n/* The FstringParser is designed to add a mix of strings and\n f-strings, and concat them together as needed. Ultimately, it\n generates an expr_ty. */\ntypedef struct {\n PyObject *last_str;\n ExprList expr_list;\n int fmode;\n} FstringParser;\n\n#ifdef NDEBUG\n#define FstringParser_check_invariants(state)\n#else\nstatic void\nFstringParser_check_invariants(FstringParser *state)\n{\n if (state->last_str)\n assert(PyUnicode_CheckExact(state->last_str));\n ExprList_check_invariants(&state->expr_list);\n}\n#endif\n\nstatic void\nFstringParser_Init(FstringParser *state)\n{\n state->last_str = NULL;\n state->fmode = 0;\n ExprList_Init(&state->expr_list);\n FstringParser_check_invariants(state);\n}\n\nstatic void\nFstringParser_Dealloc(FstringParser *state)\n{\n FstringParser_check_invariants(state);\n\n Py_XDECREF(state->last_str);\n ExprList_Dealloc(&state->expr_list);\n}\n\n/* Make a Str node, but decref the PyUnicode object being added. */\nstatic expr_ty\nmake_str_node_and_del(PyObject **str, struct compiling *c, const node* n)\n{\n PyObject *kind, *s = *str;\n const char *raw = STR(CHILD(n, 0));\n /* currently Python allows up to 2 string modifiers */\n char *ch, s_kind[3] = {0, 0, 0};\n ch = s_kind;\n while (*raw && *raw != '\\'' && *raw != '\"') {\n *ch++ = *raw++;\n }\n kind = PyUnicode_FromString(s_kind);\n if (!kind) {\n return NULL;\n }\n *str = NULL;\n assert(PyUnicode_CheckExact(s));\n if (PyArena_AddPyObject(c->c_arena, s) < 0) {\n Py_DECREF(s);\n return NULL;\n }\n return Str(s, kind, LINENO(n), n->n_col_offset, c->c_arena);\n}\n\n/* Add a non-f-string (that is, a regular literal string). str is\n decref'd. */\nstatic int\nFstringParser_ConcatAndDel(FstringParser *state, PyObject *str)\n{\n FstringParser_check_invariants(state);\n\n assert(PyUnicode_CheckExact(str));\n\n if (PyUnicode_GET_LENGTH(str) == 0) {\n Py_DECREF(str);\n return 0;\n }\n\n if (!state->last_str) {\n /* We didn't have a string before, so just remember this one. */\n state->last_str = str;\n } else {\n /* Concatenate this with the previous string. */\n PyUnicode_AppendAndDel(&state->last_str, str);\n if (!state->last_str)\n return -1;\n }\n FstringParser_check_invariants(state);\n return 0;\n}\n\n/* Parse an f-string. The f-string is in *str to end, with no\n 'f' or quotes. */\nstatic int\nFstringParser_ConcatFstring(FstringParser *state, const char **str,\n const char *end, int raw, int recurse_lvl,\n struct compiling *c, const node *n)\n{\n FstringParser_check_invariants(state);\n state->fmode = 1;\n\n /* Parse the f-string. */\n while (1) {\n PyObject *literal = NULL;\n expr_ty expression = NULL;\n\n /* If there's a zero length literal in front of the\n expression, literal will be NULL. If we're at the end of\n the f-string, expression will be NULL (unless result == 1,\n see below). */\n int result = fstring_find_literal_and_expr(str, end, raw, recurse_lvl,\n &literal, &expression,\n c, n);\n if (result < 0)\n return -1;\n\n /* Add the literal, if any. */\n if (!literal) {\n /* Do nothing. Just leave last_str alone (and possibly\n NULL). */\n } else if (!state->last_str) {\n /* Note that the literal can be zero length, if the\n input string is \"\\\\\\n\" or \"\\\\\\r\", among others. */\n state->last_str = literal;\n literal = NULL;\n } else {\n /* We have a literal, concatenate it. */\n assert(PyUnicode_GET_LENGTH(literal) != 0);\n if (FstringParser_ConcatAndDel(state, literal) < 0)\n return -1;\n literal = NULL;\n }\n\n /* We've dealt with the literal now. It can't be leaked on further\n errors. */\n assert(literal == NULL);\n\n /* See if we should just loop around to get the next literal\n and expression, while ignoring the expression this\n time. This is used for un-doubling braces, as an\n optimization. */\n if (result == 1)\n continue;\n\n if (!expression)\n /* We're done with this f-string. */\n break;\n\n /* We know we have an expression. Convert any existing string\n to a Str node. */\n if (!state->last_str) {\n /* Do nothing. No previous literal. */\n } else {\n /* Convert the existing last_str literal to a Str node. */\n expr_ty str = make_str_node_and_del(&state->last_str, c, n);\n if (!str || ExprList_Append(&state->expr_list, str) < 0)\n return -1;\n }\n\n if (ExprList_Append(&state->expr_list, expression) < 0)\n return -1;\n }\n\n /* If recurse_lvl is zero, then we must be at the end of the\n string. Otherwise, we must be at a right brace. */\n\n if (recurse_lvl == 0 && *str < end-1) {\n ast_error(c, n, \"f-string: unexpected end of string\");\n return -1;\n }\n if (recurse_lvl != 0 && **str != '}') {\n ast_error(c, n, \"f-string: expecting '}'\");\n return -1;\n }\n\n FstringParser_check_invariants(state);\n return 0;\n}\n\n/* Convert the partial state reflected in last_str and expr_list to an\n expr_ty. The expr_ty can be a Str, or a JoinedStr. */\nstatic expr_ty\nFstringParser_Finish(FstringParser *state, struct compiling *c,\n const node *n)\n{\n asdl_seq *seq;\n\n FstringParser_check_invariants(state);\n\n /* If we're just a constant string with no expressions, return\n that. */\n if (!state->fmode) {\n assert(!state->expr_list.size);\n if (!state->last_str) {\n /* Create a zero length string. */\n state->last_str = PyUnicode_FromStringAndSize(NULL, 0);\n if (!state->last_str)\n goto error;\n }\n return make_str_node_and_del(&state->last_str, c, n);\n }\n\n /* Create a Str node out of last_str, if needed. It will be the\n last node in our expression list. */\n if (state->last_str) {\n expr_ty str = make_str_node_and_del(&state->last_str, c, n);\n if (!str || ExprList_Append(&state->expr_list, str) < 0)\n goto error;\n }\n /* This has already been freed. */\n assert(state->last_str == NULL);\n\n seq = ExprList_Finish(&state->expr_list, c->c_arena);\n if (!seq)\n goto error;\n\n return JoinedStr(seq, LINENO(n), n->n_col_offset, c->c_arena);\n\nerror:\n FstringParser_Dealloc(state);\n return NULL;\n}\n\n/* Given an f-string (with no 'f' or quotes) that's in *str and ends\n at end, parse it into an expr_ty. Return NULL on error. Adjust\n str to point past the parsed portion. */\nstatic expr_ty\nfstring_parse(const char **str, const char *end, int raw, int recurse_lvl,\n struct compiling *c, const node *n)\n{\n FstringParser state;\n\n FstringParser_Init(&state);\n if (FstringParser_ConcatFstring(&state, str, end, raw, recurse_lvl,\n c, n) < 0) {\n FstringParser_Dealloc(&state);\n return NULL;\n }\n\n return FstringParser_Finish(&state, c, n);\n}\n\n/* n is a Python string literal, including the bracketing quote\n characters, and r, b, u, &/or f prefixes (if any), and embedded\n escape sequences (if any). parsestr parses it, and sets *result to\n decoded Python string object. If the string is an f-string, set\n *fstr and *fstrlen to the unparsed string object. Return 0 if no\n errors occurred.\n*/\nstatic int\nparsestr(struct compiling *c, const node *n, int *bytesmode, int *rawmode,\n PyObject **result, const char **fstr, Py_ssize_t *fstrlen)\n{\n size_t len;\n const char *s = STR(n);\n int quote = Py_CHARMASK(*s);\n int fmode = 0;\n *bytesmode = 0;\n *rawmode = 0;\n *result = NULL;\n *fstr = NULL;\n if (Py_ISALPHA(quote)) {\n while (!*bytesmode || !*rawmode) {\n if (quote == 'b' || quote == 'B') {\n quote = *++s;\n *bytesmode = 1;\n }\n else if (quote == 'u' || quote == 'U') {\n quote = *++s;\n }\n else if (quote == 'r' || quote == 'R') {\n quote = *++s;\n *rawmode = 1;\n }\n else if (quote == 'f' || quote == 'F') {\n quote = *++s;\n fmode = 1;\n }\n else {\n break;\n }\n }\n }\n /* fstrings are only allowed in Python 3.6 and greater */\n if (fmode && c->c_feature_version < 6) {\n ast_error(c, n, \"Format strings are only supported in Python 3.6 and greater\");\n return -1;\n }\n if (fmode && *bytesmode) {\n PyErr_BadInternalCall();\n return -1;\n }\n if (quote != '\\'' && quote != '\\\"') {\n PyErr_BadInternalCall();\n return -1;\n }\n /* Skip the leading quote char. */\n s++;\n len = strlen(s);\n if (len > INT_MAX) {\n PyErr_SetString(PyExc_OverflowError,\n \"string to parse is too long\");\n return -1;\n }\n if (s[--len] != quote) {\n /* Last quote char must match the first. */\n PyErr_BadInternalCall();\n return -1;\n }\n if (len >= 4 && s[0] == quote && s[1] == quote) {\n /* A triple quoted string. We've already skipped one quote at\n the start and one at the end of the string. Now skip the\n two at the start. */\n s += 2;\n len -= 2;\n /* And check that the last two match. */\n if (s[--len] != quote || s[--len] != quote) {\n PyErr_BadInternalCall();\n return -1;\n }\n }\n\n if (fmode) {\n /* Just return the bytes. The caller will parse the resulting\n string. */\n *fstr = s;\n *fstrlen = len;\n return 0;\n }\n\n /* Not an f-string. */\n /* Avoid invoking escape decoding routines if possible. */\n *rawmode = *rawmode || strchr(s, '\\\\') == NULL;\n if (*bytesmode) {\n /* Disallow non-ASCII characters. */\n const char *ch;\n for (ch = s; *ch; ch++) {\n if (Py_CHARMASK(*ch) >= 0x80) {\n ast_error(c, n, \"bytes can only contain ASCII \"\n \"literal characters.\");\n return -1;\n }\n }\n if (*rawmode)\n *result = PyBytes_FromStringAndSize(s, len);\n else\n *result = decode_bytes_with_escapes(c, n, s, len);\n } else {\n if (*rawmode)\n *result = PyUnicode_DecodeUTF8Stateful(s, len, NULL, NULL);\n else\n *result = decode_unicode_with_escapes(c, n, s, len);\n }\n return *result == NULL ? -1 : 0;\n}\n\n/* Accepts a STRING+ atom, and produces an expr_ty node. Run through\n each STRING atom, and process it as needed. For bytes, just\n concatenate them together, and the result will be a Bytes node. For\n normal strings and f-strings, concatenate them together. The result\n will be a Str node if there were no f-strings; a FormattedValue\n node if there's just an f-string (with no leading or trailing\n literals), or a JoinedStr node if there are multiple f-strings or\n any literals involved. */\nstatic expr_ty\nparsestrplus(struct compiling *c, const node *n)\n{\n int bytesmode = 0;\n PyObject *bytes_str = NULL;\n int i;\n\n FstringParser state;\n FstringParser_Init(&state);\n\n for (i = 0; i < NCH(n); i++) {\n int this_bytesmode;\n int this_rawmode;\n PyObject *s;\n const char *fstr;\n Py_ssize_t fstrlen = -1; /* Silence a compiler warning. */\n\n REQ(CHILD(n, i), STRING);\n if (parsestr(c, CHILD(n, i), &this_bytesmode, &this_rawmode, &s,\n &fstr, &fstrlen) != 0)\n goto error;\n\n /* Check that we're not mixing bytes with unicode. */\n if (i != 0 && bytesmode != this_bytesmode) {\n ast_error(c, n, \"cannot mix bytes and nonbytes literals\");\n /* s is NULL if the current string part is an f-string. */\n Py_XDECREF(s);\n goto error;\n }\n bytesmode = this_bytesmode;\n\n if (fstr != NULL) {\n int result;\n assert(s == NULL && !bytesmode);\n /* This is an f-string. Parse and concatenate it. */\n result = FstringParser_ConcatFstring(&state, &fstr, fstr+fstrlen,\n this_rawmode, 0, c, n);\n if (result < 0)\n goto error;\n } else {\n /* A string or byte string. */\n assert(s != NULL && fstr == NULL);\n\n assert(bytesmode ? PyBytes_CheckExact(s) :\n PyUnicode_CheckExact(s));\n\n if (bytesmode) {\n /* For bytes, concat as we go. */\n if (i == 0) {\n /* First time, just remember this value. */\n bytes_str = s;\n } else {\n PyBytes_ConcatAndDel(&bytes_str, s);\n if (!bytes_str)\n goto error;\n }\n } else {\n /* This is a regular string. Concatenate it. */\n if (FstringParser_ConcatAndDel(&state, s) < 0)\n goto error;\n }\n }\n }\n if (bytesmode) {\n /* Just return the bytes object and we're done. */\n if (PyArena_AddPyObject(c->c_arena, bytes_str) < 0)\n goto error;\n return Bytes(bytes_str, LINENO(n), n->n_col_offset, c->c_arena);\n }\n\n /* We're not a bytes string, bytes_str should never have been set. */\n assert(bytes_str == NULL);\n\n return FstringParser_Finish(&state, c, n);\n\nerror:\n Py_XDECREF(bytes_str);\n FstringParser_Dealloc(&state);\n return NULL;\n}\n"},"func_before":{"kind":"string","value":"decode_bytes_with_escapes(struct compiling *c, const node *n, const char *s,\n size_t len)\n{\n return PyBytes_DecodeEscape(s, len, NULL, 0, NULL);\n}"},"func_after":{"kind":"string","value":"decode_bytes_with_escapes(struct compiling *c, const node *n, const char *s,\n size_t len)\n{\n const char *first_invalid_escape;\n PyObject *result = _PyBytes_DecodeEscape(s, len, NULL, 0, NULL,\n &first_invalid_escape);\n if (result == NULL)\n return NULL;\n\n if (first_invalid_escape != NULL) {\n if (warn_invalid_escape_sequence(c, n, *first_invalid_escape) < 0) {\n Py_DECREF(result);\n return NULL;\n }\n }\n return result;\n}"},"diff":{"kind":"string","value":"{'added': [(11, '#include \"pythonrun.h\"'), (15, \"// VS 2010 doesn't have ...\"), (16, 'typedef int bool;'), (17, '#define false 0'), (18, '#define true 1'), (19, ''), (20, '#ifndef _PyObject_FastCall'), (21, 'static PyObject *'), (22, '_PyObject_FastCall(PyObject *func, PyObject *const *args, int nargs)'), (23, '{'), (24, ' PyObject *t, *res;'), (25, ' int i;'), (26, ''), (27, ' t = PyTuple_New(nargs);'), (28, ' if (t == NULL) {'), (29, ' return NULL;'), (30, ' }'), (31, ' for (i = 0; i < nargs; i++) {'), (32, ' if (PyTuple_SetItem(t, i, args[i]) < 0) {'), (33, ' Py_DECREF(t);'), (34, ' return NULL;'), (35, ' }'), (36, ' }'), (37, ' res = PyObject_CallObject(func, t);'), (38, ' Py_DECREF(t);'), (39, ' return res;'), (40, '}'), (41, '#endif'), (42, ''), (43, '#if PY_MINOR_VERSION < 6'), (44, '#define _PyUnicode_EqualToASCIIString(a, b) (PyUnicode_CompareWithASCIIString((a), (b)) == 0)'), (45, ''), (46, 'static PyObject *'), (47, '_PyBytes_DecodeEscape(const char *s,'), (48, ' Py_ssize_t len,'), (49, ' const char *errors,'), (50, ' Py_ssize_t unicode,'), (51, ' const char *recode_encoding,'), (52, ' const char **first_invalid_escape)'), (53, '{'), (54, ' *first_invalid_escape = NULL;'), (55, ' return PyBytes_DecodeEscape(s, len, errors, unicode, recode_encoding);'), (56, '}'), (57, ''), (58, 'PyObject *'), (59, '_PyUnicode_DecodeUnicodeEscape(const char *s,'), (60, ' Py_ssize_t size,'), (61, ' const char *errors,'), (62, ' const char **first_invalid_escape)'), (63, '{'), (64, ' *first_invalid_escape = NULL;'), (65, ' return PyUnicode_DecodeUnicodeEscape(s, size, errors);'), (66, '}'), (163, ' abort();'), (657, 'static asdl_seq *ast_for_suite(struct compiling *c, const node *n);'), (663, 'static stmt_ty ast_for_with_stmt(struct compiling *, const node *, bool);'), (664, 'static stmt_ty ast_for_for_stmt(struct compiling *, const node *, bool);'), (667, 'static expr_ty ast_for_call(struct compiling *, const node *, expr_ty, bool);'), (701, ' PyObject *form;'), (702, ' PyObject *args[2];'), (703, ' _Py_IDENTIFIER(NFKC);'), (708, ' form = _PyUnicode_FromId(&PyId_NFKC);'), (709, ' if (form == NULL) {'), (710, ' Py_DECREF(id);'), (711, ' return NULL;'), (712, ' }'), (713, ' args[0] = form;'), (714, ' args[1] = id;'), (715, ' id2 = _PyObject_FastCall(c->c_normalize, args, 2);'), (719, ' if (!PyUnicode_Check(id2)) {'), (720, ' PyErr_Format(PyExc_TypeError,'), (721, ' \"unicodedata.normalize() must return a string, not \"'), (722, ' \"%.200s\",'), (723, ' Py_TYPE(id2)->tp_name);'), (724, ' Py_DECREF(id2);'), (725, ' return NULL;'), (726, ' }'), (835, ' abort();'), (843, ' PyObject *filename, int feature_version,'), (844, ' PyArena *arena)'), (906, ' goto out;'), (907, ' asdl_seq_SET(type_ignores, i, ti);'), (1009, ' int feature_version, PyArena *arena)'), (1075, ' if (_PyUnicode_EqualToASCIIString(name, \"__debug__\")) {'), (1082, ' if (_PyUnicode_EqualToASCIIString(name, *p)) {'), (1298, ' /* fall through */'), (1313, ' /* fall through */'), (1440, ' if (TYPE(CHILD(n, i)) == COMMA)'), (1577, ' if (TYPE(CHILD(n, i)) == COMMA)'), (1593, ' if (TYPE(CHILD(n, i)) == TYPE_COMMENT) {'), (1609, ' i += 2; /* the star and the name */'), (1610, ' if (TYPE(CHILD(n, i)) == COMMA)'), (1611, ' i += 1; /* the comma, if present */'), (1613, ' if (TYPE(CHILD(n, i)) == TYPE_COMMENT) {'), (1635, ' if (TYPE(CHILD(n, i)) == COMMA)'), (1717, ' d = ast_for_call(c, CHILD(n, 3), name_expr, true);'), (1748, 'ast_for_funcdef_impl(struct compiling *c, const node *n0,'), (1749, ' asdl_seq *decorator_seq, bool is_async)'), (1752, ' const node * const n = is_async ? CHILD(n0, 1) : n0;'), (1763, ' \"Async functions are only supported in Python 3.5 and greater\");'), (1802, ' type_comment, LINENO(n0), n0->n_col_offset, c->c_arena);'), (1805, ' type_comment, LINENO(n), n->n_col_offset, c->c_arena);'), (1811, \" /* async_funcdef: 'async' funcdef */\"), (1813, ' REQ(CHILD(n, 0), NAME);'), (1814, ' assert(strcmp(STR(CHILD(n, 0)), \"async\") == 0);'), (1817, ' return ast_for_funcdef_impl(c, n, decorator_seq,'), (1818, ' true /* is_async */);'), (1826, ' false /* is_async */);'), (1833, \" /* async_stmt: 'async' (funcdef | with_stmt | for_stmt) */\"), (1835, ' REQ(CHILD(n, 0), NAME);'), (1836, ' assert(strcmp(STR(CHILD(n, 0)), \"async\") == 0);'), (1840, ' return ast_for_funcdef_impl(c, n, NULL,'), (1841, ' true /* is_async */);'), (1843, ' return ast_for_with_stmt(c, n,'), (1844, ' true /* is_async */);'), (1847, ' return ast_for_for_stmt(c, n,'), (1848, ' true /* is_async */);'), (1953, ' if (NCH(n) == 2) {'), (1954, ' REQ(CHILD(n, 0), NAME);'), (1955, ' assert(strcmp(STR(CHILD(n, 0)), \"async\") == 0);'), (1956, ' n = CHILD(n, 1);'), (1958, ' else if (NCH(n) == 1) {'), (1959, ' n = CHILD(n, 0);'), (1960, ' }'), (1961, ' else {'), (1962, ' goto error;'), (1963, ' }'), (1964, ' if (NCH(n) == (5)) {'), (1965, ' n = CHILD(n, 4);'), (1984, ' error:'), (2033, ' node *sync_n;'), (2038, ' if (NCH(n) == 2) {'), (2040, ' REQ(CHILD(n, 0), NAME);'), (2041, ' assert(strcmp(STR(CHILD(n, 0)), \"async\") == 0);'), (2042, ' sync_n = CHILD(n, 1);'), (2044, ' else {'), (2045, ' sync_n = CHILD(n, 0);'), (2046, ' }'), (2047, ' REQ(sync_n, sync_comp_for);'), (2056, ' for_ch = CHILD(sync_n, 1);'), (2060, ' expression = ast_for_expr(c, CHILD(sync_n, 3));'), (2077, ' if (NCH(sync_n) == 5) {'), (2081, ' n = CHILD(sync_n, 4);'), (2352, ' pynum = parsenumber(c, STR(ch));'), (2575, ' return ast_for_call(c, CHILD(n, 1), left_expr, true);'), (2704, \" /* there was an 'await' */\"), (2769, \" atom_expr: ['await'] atom trailer*\"), (2917, 'ast_for_call(struct compiling *c, const node *n, expr_ty func, bool allowgen)'), (2924, ' int i, nargs, nkeywords;'), (2938, ' else if (TYPE(CHILD(ch, 1)) == comp_for) {'), (2939, ' nargs++;'), (2940, ' if (!allowgen) {'), (2941, ' ast_error(c, ch, \"invalid syntax\");'), (2942, ' return NULL;'), (2943, ' }'), (2944, ' if (NCH(n) > 1) {'), (2945, ' ast_error(c, ch, \"Generator expression must be parenthesized\");'), (2946, ' return NULL;'), (2947, ' }'), (2948, ' }'), (2957, ' args = _Ta3_asdl_seq_new(nargs, c->c_arena);'), (3109, ''), (3381, ' /* fall through */'), (3493, ' if (!str)'), (3494, ' return NULL;'), (3926, 'ast_for_for_stmt(struct compiling *c, const node *n0, bool is_async)'), (3928, ' const node * const n = is_async ? CHILD(n0, 1) : n0;'), (3978, ' return AsyncFor(target, expression, suite_seq, seq, type_comment,'), (3979, ' LINENO(n0), n0->n_col_offset,'), (3982, ' return For(target, expression, suite_seq, seq, type_comment,'), (3983, ' LINENO(n), n->n_col_offset,'), (4131, 'ast_for_with_stmt(struct compiling *c, const node *n0, bool is_async)'), (4133, ' const node * const n = is_async ? CHILD(n0, 1) : n0;'), (4170, ' return AsyncWith(items, body, type_comment, LINENO(n0), n0->n_col_offset, c->c_arena);'), (4194, ' return ClassDef(classname, NULL, NULL, s, decorator_seq,'), (4195, ' LINENO(n), n->n_col_offset, c->c_arena);'), (4199, ' s = ast_for_suite(c, CHILD(n, 5));'), (4207, ' return ClassDef(classname, NULL, NULL, s, decorator_seq,'), (4208, ' LINENO(n), n->n_col_offset, c->c_arena);'), (4220, ' call = ast_for_call(c, CHILD(n, 3), dummy, false);'), (4367, ' if (dup == NULL) {'), (4368, ' return PyErr_NoMemory();'), (4369, ' }'), (4393, 'static int'), (4394, 'warn_invalid_escape_sequence(struct compiling *c, const node *n,'), (4395, ' unsigned char first_invalid_escape_char)'), (4396, '{'), (4397, ' PyObject *msg = PyUnicode_FromFormat(\"invalid escape sequence \\\\\\\\%c\",'), (4398, ' first_invalid_escape_char);'), (4399, ' if (msg == NULL) {'), (4400, ' return -1;'), (4401, ' }'), (4402, ' if (PyErr_WarnExplicitObject(PyExc_DeprecationWarning, msg,'), (4403, ' c->c_filename, LINENO(n),'), (4404, ' NULL, NULL) < 0)'), (4405, ' {'), (4406, ' if (PyErr_ExceptionMatches(PyExc_DeprecationWarning)) {'), (4407, ' const char *s;'), (4408, ''), (4409, ' /* Replace the DeprecationWarning exception with a SyntaxError'), (4410, ' to get a more accurate error report */'), (4411, ' PyErr_Clear();'), (4412, ''), (4413, ' s = PyUnicode_AsUTF8(msg);'), (4414, ' if (s != NULL) {'), (4415, ' ast_error(c, n, s);'), (4416, ' }'), (4417, ' }'), (4418, ' Py_DECREF(msg);'), (4419, ' return -1;'), (4420, ' }'), (4421, ' Py_DECREF(msg);'), (4422, ' return 0;'), (4423, '}'), (4424, ''), (4429, ' PyObject *v, *u;'), (4433, ' const char *first_invalid_escape;'), (4448, ' if (s >= end || *s & 0x80) {'), (4451, ' if (s >= end)'), (4452, ' break;'), (4474, ' assert(p - buf <= PyBytes_GET_SIZE(u));'), (4483, ' v = _PyUnicode_DecodeUnicodeEscape(s, len, NULL, &first_invalid_escape);'), (4484, ''), (4485, ' if (v != NULL && first_invalid_escape != NULL) {'), (4486, ' if (warn_invalid_escape_sequence(c, n, *first_invalid_escape) < 0) {'), (4487, ' /* We have not decref u before because first_invalid_escape points'), (4488, ' inside u. */'), (4489, ' Py_XDECREF(u);'), (4490, ' Py_DECREF(v);'), (4491, ' return NULL;'), (4492, ' }'), (4493, ' }'), (4494, ' Py_XDECREF(u);'), (4495, ' return v;'), (4502, ' const char *first_invalid_escape;'), (4503, ' PyObject *result = _PyBytes_DecodeEscape(s, len, NULL, 0, NULL,'), (4504, ' &first_invalid_escape);'), (4505, ' if (result == NULL)'), (4506, ' return NULL;'), (4507, ''), (4508, ' if (first_invalid_escape != NULL) {'), (4509, ' if (warn_invalid_escape_sequence(c, n, *first_invalid_escape) < 0) {'), (4510, ' Py_DECREF(result);'), (4511, ' return NULL;'), (4512, ' }'), (4513, ' }'), (4514, ' return result;'), (4515, '}'), (4516, ''), (4517, '/* Shift locations for the given node and all its children by adding `lineno`'), (4518, ' and `col_offset` to existing locations. */'), (4519, 'static void fstring_shift_node_locations(node *n, int lineno, int col_offset)'), (4520, '{'), (4521, ' int i;'), (4522, ' n->n_col_offset = n->n_col_offset + col_offset;'), (4523, ' for (i = 0; i < NCH(n); ++i) {'), (4524, ' if (n->n_lineno && n->n_lineno < CHILD(n, i)->n_lineno) {'), (4525, \" /* Shifting column offsets unnecessary if there's been newlines. */\"), (4526, ' col_offset = 0;'), (4527, ' }'), (4528, ' fstring_shift_node_locations(CHILD(n, i), lineno, col_offset);'), (4529, ' }'), (4530, ' n->n_lineno = n->n_lineno + lineno;'), (4531, '}'), (4532, ''), (4533, '/* Fix locations for the given node and its children.'), (4534, ''), (4535, ' `parent` is the enclosing node.'), (4536, ' `n` is the node which locations are going to be fixed relative to parent.'), (4537, \" `expr_str` is the child node's string representation, including braces.\"), (4538, '*/'), (4539, 'static void'), (4540, 'fstring_fix_node_location(const node *parent, node *n, char *expr_str)'), (4541, '{'), (4542, ' char *substr = NULL;'), (4543, ' char *start;'), (4544, ' int lines = LINENO(parent) - 1;'), (4545, ' int cols = parent->n_col_offset;'), (4546, ' /* Find the full fstring to fix location information in `n`. */'), (4547, ' while (parent && parent->n_type != STRING)'), (4548, ' parent = parent->n_child;'), (4549, ' if (parent && parent->n_str) {'), (4550, ' substr = strstr(parent->n_str, expr_str);'), (4551, ' if (substr) {'), (4552, ' start = substr;'), (4553, ' while (start > parent->n_str) {'), (4554, \" if (start[0] == '\\\\n')\"), (4555, ' break;'), (4556, ' start--;'), (4557, ' }'), (4558, ' cols += substr - start;'), (4559, ' /* Fix lineno in mulitline strings. */'), (4560, \" while ((substr = strchr(substr + 1, '\\\\n')))\"), (4561, ' lines--;'), (4562, ' }'), (4563, ' }'), (4564, ' fstring_shift_node_locations(n, lines, cols);'), (4575, ' node *mod_n;'), (4579, ' const char *s;'), (4580, ' PyObject *fstring_name;'), (4586, \" /* If the substring is all whitespace, it's an error. We need to catch this\"), (4587, ' here, and not when we call PyParser_SimpleParseStringFlagsFilename,'), (4588, \" because turning the expression '' in to '()' would go from being invalid\"), (4589, ' to valid. */'), (4590, ' for (s = expr_start; s != expr_end; s++) {'), (4591, ' char c = *s;'), (4592, ' /* The Python parser ignores only the following whitespace'), (4593, ' characters (\\\\r already is converted to \\\\n). */'), (4594, \" if (!(c == ' ' || c == '\\\\t' || c == '\\\\n' || c == '\\\\f')) {\"), (4598, ' if (s == expr_end) {'), (4606, ' if (str == NULL) {'), (4607, ' PyErr_NoMemory();'), (4609, ' }'), (4617, ' mod_n = PyParser_SimpleParseStringFlagsFilename(str, \"\",'), (4618, ' Py_eval_input, 0);'), (4619, ' if (!mod_n) {'), (4620, ' PyMem_RawFree(str);'), (4621, ' return NULL;'), (4622, ' }'), (4623, ' /* Reuse str to find the correct column offset. */'), (4624, \" str[0] = '{';\"), (4625, \" str[len+1] = '}';\"), (4626, ' fstring_fix_node_location(n, mod_n, str);'), (4633, ' Ta3Node_Free(mod_n);'), (4656, ' const char *s = *str;'), (4657, ' const char *literal_start = s;'), (4661, ' while (s < end) {'), (4662, ' char ch = *s++;'), (4663, \" if (!raw && ch == '\\\\\\\\' && s < end) {\"), (4664, ' ch = *s++;'), (4665, \" if (ch == 'N') {\"), (4666, \" if (s < end && *s++ == '{') {\"), (4667, \" while (s < end && *s++ != '}') {\"), (4668, ' }'), (4669, ' continue;'), (4670, ' }'), (4671, ' break;'), (4672, ' }'), (4673, \" if (ch == '{' && warn_invalid_escape_sequence(c, n, ch) < 0) {\"), (4674, ' return -1;'), (4675, ' }'), (4676, ' }'), (4677, \" if (ch == '{' || ch == '}') {\"), (4682, ' if (s < end && *s == ch) {'), (4686, ' *str = s + 1;'), (4694, ' *str = s - 1;'), (4702, ' s--;'), (4706, ' *str = s;'), (4707, ' assert(s <= end);'), (4708, \" assert(s == end || *s == '{' || *s == '}');\"), (4710, ' if (literal_start != s) {'), (4713, ' s - literal_start,'), (4717, ' s - literal_start);'), (5129, ' int fmode;'), (5148, ' state->fmode = 0;'), (5222, ' state->fmode = 1;'), (5244, ' /* Note that the literal can be zero length, if the'), (5245, ' input string is \"\\\\\\\\\\\\n\" or \"\\\\\\\\\\\\r\", among others. */'), (5314, ' if (!state->fmode) {'), (5315, ' assert(!state->expr_list.size);')], 'deleted': [(14, '#if PY_MINOR_VERSION < 4'), (15, '#define PyErr_ProgramTextObject PyErr_ProgramText'), (17, '#define PyMem_RawMalloc PyMem_Malloc'), (18, '#define PyMem_RawRealloc PyMem_Realloc'), (19, '#define PyMem_RawFree PyMem_Free'), (115, ' assert(0);'), (116, ' return \"(unknown)\";'), (604, ' PyObject *c_normalize_args; /* Normalization argument tuple. */'), (611, 'static asdl_seq *ast_for_suite(struct compiling *, const node *);'), (617, 'static stmt_ty ast_for_with_stmt(struct compiling *, const node *, int);'), (618, 'static stmt_ty ast_for_for_stmt(struct compiling *, const node *, int);'), (621, 'static expr_ty ast_for_call(struct compiling *, const node *, expr_ty);'), (640, ' c->c_normalize_args = Py_BuildValue(\"(sN)\", \"NFKC\", Py_None);'), (641, ' if (!c->c_normalize_args) {'), (642, ' Py_CLEAR(c->c_normalize);'), (643, ' return 0;'), (644, ' }'), (645, ' PyTuple_SET_ITEM(c->c_normalize_args, 1, NULL);'), (665, ' PyTuple_SET_ITEM(c->c_normalize_args, 1, id);'), (666, ' id2 = PyObject_Call(c->c_normalize, c->c_normalize_args, NULL);'), (778, ' assert(0);'), (779, ' return 0;'), (787, ' PyObject *filename, int feature_version,'), (788, ' PyArena *arena)'), (804, ' c.c_normalize_args = NULL;'), (851, ' goto out;'), (852, ' asdl_seq_SET(type_ignores, i, ti);'), (948, ' PyTuple_SET_ITEM(c.c_normalize_args, 1, NULL);'), (949, ' Py_DECREF(c.c_normalize_args);'), (956, ' int feature_version, PyArena *arena)'), (1022, ' if (PyUnicode_CompareWithASCIIString(name, \"__debug__\") == 0) {'), (1029, ' if (PyUnicode_CompareWithASCIIString(name, *p) == 0) {'), (1385, ' if (i < NCH(n) && TYPE(CHILD(n, i)) == COMMA)'), (1489, ' if (nposargs + nkwonlyargs > 255) {'), (1490, ' ast_error(c, n, \"more than 255 arguments\");'), (1491, ' return NULL;'), (1492, ' }'), (1493, ''), (1527, ' if (i < NCH(n) && TYPE(CHILD(n, i)) == COMMA)'), (1543, ' if (i < NCH(n) && TYPE(CHILD(n, i)) == TYPE_COMMENT) {'), (1559, ' i += 2; /* the star and the name */'), (1560, ' if (i < NCH(n) && TYPE(CHILD(n, i)) == COMMA)'), (1561, ' i += 1; /* the comma, if present */'), (1563, ' if (i < NCH(n) && TYPE(CHILD(n, i)) == TYPE_COMMENT) {'), (1585, ' if (i < NCH(n) && TYPE(CHILD(n, i)) == COMMA)'), (1667, ' d = ast_for_call(c, CHILD(n, 3), name_expr);'), (1698, 'ast_for_funcdef_impl(struct compiling *c, const node *n,'), (1699, ' asdl_seq *decorator_seq, int is_async)'), (1712, ' \"Async functions are only supported in Python 3.5 and greater\");'), (1751, ' type_comment, LINENO(n),'), (1752, ' n->n_col_offset, c->c_arena);'), (1755, ' type_comment, LINENO(n),'), (1756, ' n->n_col_offset, c->c_arena);'), (1762, ' /* async_funcdef: ASYNC funcdef */'), (1764, ' REQ(CHILD(n, 0), ASYNC);'), (1767, ' return ast_for_funcdef_impl(c, CHILD(n, 1), decorator_seq,'), (1768, ' 1 /* is_async */);'), (1776, ' 0 /* is_async */);'), (1783, ' /* async_stmt: ASYNC (funcdef | with_stmt | for_stmt) */'), (1785, ' REQ(CHILD(n, 0), ASYNC);'), (1789, ' return ast_for_funcdef_impl(c, CHILD(n, 1), NULL,'), (1790, ' 1 /* is_async */);'), (1792, ' return ast_for_with_stmt(c, CHILD(n, 1),'), (1793, ' 1 /* is_async */);'), (1796, ' return ast_for_for_stmt(c, CHILD(n, 1),'), (1797, ' 1 /* is_async */);'), (1898, ' int is_async;'), (1901, ' is_async = 0;'), (1904, ' if (TYPE(CHILD(n, 0)) == ASYNC) {'), (1905, ' is_async = 1;'), (1907, ' if (NCH(n) == (5 + is_async)) {'), (1908, ' n = CHILD(n, 4 + is_async);'), (1979, ' if (TYPE(CHILD(n, 0)) == ASYNC) {'), (1990, ' for_ch = CHILD(n, 1 + is_async);'), (1994, ' expression = ast_for_expr(c, CHILD(n, 3 + is_async));'), (2011, ' if (NCH(n) == (5 + is_async)) {'), (2015, ' n = CHILD(n, 4 + is_async);'), (2286, ' pynum = parsenumber(c, s);'), (2509, ' return ast_for_call(c, CHILD(n, 1), left_expr);'), (2638, ' /* there was an AWAIT */'), (2703, ' atom_expr: [AWAIT] atom trailer*'), (2851, 'ast_for_call(struct compiling *c, const node *n, expr_ty func)'), (2858, ' int i, nargs, nkeywords, ngens;'), (2867, ' ngens = 0;'), (2873, ' else if (TYPE(CHILD(ch, 1)) == comp_for)'), (2874, ' ngens++;'), (2882, ' if (ngens > 1 || (ngens && (nargs || nkeywords))) {'), (2883, ' ast_error(c, n, \"Generator expression must be parenthesized \"'), (2884, ' \"if not sole argument\");'), (2885, ' return NULL;'), (2886, ' }'), (2888, ' if (nargs + nkeywords + ngens > 255) {'), (2889, ' ast_error(c, n, \"more than 255 arguments\");'), (2890, ' return NULL;'), (2891, ' }'), (2892, ''), (2893, ' args = _Ta3_asdl_seq_new(nargs + ngens, c->c_arena);'), (3858, 'ast_for_for_stmt(struct compiling *c, const node *n, int is_async)'), (3909, ' return AsyncFor(target, expression, suite_seq, seq,'), (3910, ' type_comment, LINENO(n), n->n_col_offset,'), (3913, ' return For(target, expression, suite_seq, seq,'), (3914, ' type_comment, LINENO(n), n->n_col_offset,'), (4062, 'ast_for_with_stmt(struct compiling *c, const node *n, int is_async)'), (4100, ' return AsyncWith(items, body, type_comment, LINENO(n), n->n_col_offset, c->c_arena);'), (4124, ' return ClassDef(classname, NULL, NULL, s, decorator_seq, LINENO(n),'), (4125, ' n->n_col_offset, c->c_arena);'), (4129, ' s = ast_for_suite(c, CHILD(n,5));'), (4137, ' return ClassDef(classname, NULL, NULL, s, decorator_seq, LINENO(n),'), (4138, ' n->n_col_offset, c->c_arena);'), (4150, ' call = ast_for_call(c, CHILD(n, 3), dummy);'), (4324, ' PyObject *u;'), (4342, ' if (*s & 0x80) {'), (4366, ' assert(p - buf <= Py_SIZE(u));'), (4375, ' return PyUnicode_DecodeUnicodeEscape(s, len, NULL);'), (4382, ' return PyBytes_DecodeEscape(s, len, NULL, 0, NULL);'), (4392, ' int all_whitespace = 1;'), (4393, ' int kind;'), (4394, ' void *data;'), (4398, ' PyObject *o, *fstring_name;'), (4400, ' Py_ssize_t i;'), (4406, ' /* We know there are no escapes here, because backslashes are not allowed,'), (4407, \" and we know it's utf-8 encoded (per PEP 263). But, in order to check\"), (4408, ' that each char is not whitespace, we need to decode it to unicode.'), (4409, ' Which is unfortunate, but such is life. */'), (4410, ''), (4411, \" /* If the substring is all whitespace, it's an error. We need to catch\"), (4412, ' this here, and not when we call PyParser_ASTFromString, because turning'), (4413, \" the expression '' in to '()' would go from being invalid to valid. */\"), (4414, \" /* Note that this code says an empty string is all whitespace. That's\"), (4415, \" important. There's a test for it: f'{}'. */\"), (4416, ' o = PyUnicode_DecodeUTF8(expr_start, expr_end-expr_start, NULL);'), (4417, ' if (o == NULL)'), (4418, ' return NULL;'), (4419, ' len = PyUnicode_GET_LENGTH(o);'), (4420, ' kind = PyUnicode_KIND(o);'), (4421, ' data = PyUnicode_DATA(o);'), (4422, ' for (i = 0; i < len; i++) {'), (4423, ' if (!Py_UNICODE_ISSPACE(PyUnicode_READ(kind, data, i))) {'), (4424, ' all_whitespace = 0;'), (4428, ' Py_DECREF(o);'), (4429, ' if (all_whitespace) {'), (4434, ' /* Reuse len to be the length of the utf-8 input string. */'), (4438, ' if (str == NULL)'), (4475, ' const char *literal_start = *str;'), (4476, ' const char *literal_end;'), (4477, ' int in_named_escape = 0;'), (4481, ' for (; *str < end; (*str)++) {'), (4482, ' char ch = **str;'), (4483, \" if (!in_named_escape && ch == '{' && (*str)-literal_start >= 2 &&\"), (4484, \" *(*str-2) == '\\\\\\\\' && *(*str-1) == 'N') {\"), (4485, ' in_named_escape = 1;'), (4486, \" } else if (in_named_escape && ch == '}') {\"), (4487, ' in_named_escape = 0;'), (4488, \" } else if (ch == '{' || ch == '}') {\"), (4493, ' if (*str+1 < end && *(*str+1) == ch) {'), (4497, ' literal_end = *str+1;'), (4498, ' *str += 2;'), (4516, ' literal_end = *str;'), (4517, ' assert(*str <= end);'), (4518, \" assert(*str == end || **str == '{' || **str == '}');\"), (4520, ' if (literal_start != literal_end) {'), (4523, ' literal_end-literal_start,'), (4527, ' literal_end-literal_start);'), (5060, ' assert(!state->last_str ||'), (5061, ' PyUnicode_GET_LENGTH(state->last_str) != 0);'), (5121, ' if(state->expr_list.size == 0) {'), (5145, \" /* If there's only one expression, return it. Otherwise, we need\"), (5146, ' to join them together. */'), (5147, ' if (seq->size == 1)'), (5148, ' return seq->elements[0];'), (5149, '')]}"},"num_lines_added":{"kind":"number","value":360,"string":"360"},"num_lines_deleted":{"kind":"number","value":171,"string":"171"},"num_lines_in_file":{"kind":"number","value":4475,"string":"4,475"},"num_tokens_in_file":{"kind":"number","value":28946,"string":"28,946"},"num_lines_in_method":{"kind":"number","value":5,"string":"5"},"num_tokens_in_method":{"kind":"number","value":36,"string":"36"},"method_complexity":{"kind":"number","value":1,"string":"1"},"repo":{"kind":"string","value":"https://github.com/python/typed_ast"},"cve_id":{"kind":"string","value":"CVE-2019-19274"},"cwe_id":{"kind":"string","value":"CWE-125"}}},{"rowIdx":398,"cells":{"id":{"kind":"number","value":3185,"string":"3,185"},"file_name":{"kind":"string","value":"readelf.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"doshn"},"code_before":{"kind":"string","value":"/*\n * Copyright (c) Christos Zoulas 2003.\n * All Rights Reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice immediately at the beginning of the file, without modification,\n * this list of conditions, and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * \n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n */\n#include \"file.h\"\n\n#ifndef lint\nFILE_RCSID(\"@(#)$File: readelf.c,v 1.113 2014/12/11 14:10:53 christos Exp $\")\n#endif\n\n#ifdef BUILTIN_ELF\n#include \n#include \n#include \n#ifdef HAVE_UNISTD_H\n#include \n#endif\n\n#include \"readelf.h\"\n#include \"magic.h\"\n\n#ifdef\tELFCORE\nprivate int dophn_core(struct magic_set *, int, int, int, off_t, int, size_t,\n off_t, int *);\n#endif\nprivate int dophn_exec(struct magic_set *, int, int, int, off_t, int, size_t,\n off_t, int *, int);\nprivate int doshn(struct magic_set *, int, int, int, off_t, int, size_t,\n off_t, int *, int, int);\nprivate size_t donote(struct magic_set *, void *, size_t, size_t, int,\n int, size_t, int *);\n\n#define\tELF_ALIGN(a)\t((((a) + align - 1) / align) * align)\n\n#define isquote(c) (strchr(\"'\\\"`\", (c)) != NULL)\n\nprivate uint16_t getu16(int, uint16_t);\nprivate uint32_t getu32(int, uint32_t);\nprivate uint64_t getu64(int, uint64_t);\n\n#define MAX_PHNUM\t128\n#define\tMAX_SHNUM\t32768\n#define SIZE_UNKNOWN\t((off_t)-1)\n\nprivate int\ntoomany(struct magic_set *ms, const char *name, uint16_t num)\n{\n\tif (file_printf(ms, \", too many %s header sections (%u)\", name, num\n\t ) == -1)\n\t\treturn -1;\n\treturn 0;\n}\n\nprivate uint16_t\ngetu16(int swap, uint16_t value)\n{\n\tunion {\n\t\tuint16_t ui;\n\t\tchar c[2];\n\t} retval, tmpval;\n\n\tif (swap) {\n\t\ttmpval.ui = value;\n\n\t\tretval.c[0] = tmpval.c[1];\n\t\tretval.c[1] = tmpval.c[0];\n\t\t\n\t\treturn retval.ui;\n\t} else\n\t\treturn value;\n}\n\nprivate uint32_t\ngetu32(int swap, uint32_t value)\n{\n\tunion {\n\t\tuint32_t ui;\n\t\tchar c[4];\n\t} retval, tmpval;\n\n\tif (swap) {\n\t\ttmpval.ui = value;\n\n\t\tretval.c[0] = tmpval.c[3];\n\t\tretval.c[1] = tmpval.c[2];\n\t\tretval.c[2] = tmpval.c[1];\n\t\tretval.c[3] = tmpval.c[0];\n\t\t\n\t\treturn retval.ui;\n\t} else\n\t\treturn value;\n}\n\nprivate uint64_t\ngetu64(int swap, uint64_t value)\n{\n\tunion {\n\t\tuint64_t ui;\n\t\tchar c[8];\n\t} retval, tmpval;\n\n\tif (swap) {\n\t\ttmpval.ui = value;\n\n\t\tretval.c[0] = tmpval.c[7];\n\t\tretval.c[1] = tmpval.c[6];\n\t\tretval.c[2] = tmpval.c[5];\n\t\tretval.c[3] = tmpval.c[4];\n\t\tretval.c[4] = tmpval.c[3];\n\t\tretval.c[5] = tmpval.c[2];\n\t\tretval.c[6] = tmpval.c[1];\n\t\tretval.c[7] = tmpval.c[0];\n\t\t\n\t\treturn retval.ui;\n\t} else\n\t\treturn value;\n}\n\n#define elf_getu16(swap, value) getu16(swap, value)\n#define elf_getu32(swap, value) getu32(swap, value)\n#define elf_getu64(swap, value) getu64(swap, value)\n\n#define xsh_addr\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? (void *)&sh32\t\t\t\\\n\t\t\t : (void *)&sh64)\n#define xsh_sizeof\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? sizeof(sh32)\t\t\t\t\\\n\t\t\t : sizeof(sh64))\n#define xsh_size\t(size_t)(clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, sh32.sh_size)\t\\\n\t\t\t : elf_getu64(swap, sh64.sh_size))\n#define xsh_offset\t(off_t)(clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, sh32.sh_offset)\t\\\n\t\t\t : elf_getu64(swap, sh64.sh_offset))\n#define xsh_type\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, sh32.sh_type)\t\\\n\t\t\t : elf_getu32(swap, sh64.sh_type))\n#define xsh_name \t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, sh32.sh_name)\t\\\n\t\t\t : elf_getu32(swap, sh64.sh_name))\n#define xph_addr\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? (void *) &ph32\t\t\t\\\n\t\t\t : (void *) &ph64)\n#define xph_sizeof\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? sizeof(ph32)\t\t\t\t\\\n\t\t\t : sizeof(ph64))\n#define xph_type\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, ph32.p_type)\t\\\n\t\t\t : elf_getu32(swap, ph64.p_type))\n#define xph_offset\t(off_t)(clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, ph32.p_offset)\t\\\n\t\t\t : elf_getu64(swap, ph64.p_offset))\n#define xph_align\t(size_t)((clazz == ELFCLASS32\t\t\\\n\t\t\t ? (off_t) (ph32.p_align ? \t\t\\\n\t\t\t elf_getu32(swap, ph32.p_align) : 4) \\\n\t\t\t : (off_t) (ph64.p_align ?\t\t\\\n\t\t\t elf_getu64(swap, ph64.p_align) : 4)))\n#define xph_filesz\t(size_t)((clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, ph32.p_filesz)\t\\\n\t\t\t : elf_getu64(swap, ph64.p_filesz)))\n#define xnh_addr\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? (void *)&nh32\t\t\t\\\n\t\t\t : (void *)&nh64)\n#define xph_memsz\t(size_t)((clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, ph32.p_memsz)\t\\\n\t\t\t : elf_getu64(swap, ph64.p_memsz)))\n#define xnh_sizeof\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? sizeof nh32\t\t\t\t\\\n\t\t\t : sizeof nh64)\n#define xnh_type\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, nh32.n_type)\t\\\n\t\t\t : elf_getu32(swap, nh64.n_type))\n#define xnh_namesz\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, nh32.n_namesz)\t\\\n\t\t\t : elf_getu32(swap, nh64.n_namesz))\n#define xnh_descsz\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, nh32.n_descsz)\t\\\n\t\t\t : elf_getu32(swap, nh64.n_descsz))\n#define prpsoffsets(i)\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? prpsoffsets32[i]\t\t\t\\\n\t\t\t : prpsoffsets64[i])\n#define xcap_addr\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? (void *)&cap32\t\t\t\\\n\t\t\t : (void *)&cap64)\n#define xcap_sizeof\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? sizeof cap32\t\t\t\t\\\n\t\t\t : sizeof cap64)\n#define xcap_tag\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, cap32.c_tag)\t\\\n\t\t\t : elf_getu64(swap, cap64.c_tag))\n#define xcap_val\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, cap32.c_un.c_val)\t\\\n\t\t\t : elf_getu64(swap, cap64.c_un.c_val))\n\n#ifdef ELFCORE\n/*\n * Try larger offsets first to avoid false matches\n * from earlier data that happen to look like strings.\n */\nstatic const size_t\tprpsoffsets32[] = {\n#ifdef USE_NT_PSINFO\n\t104,\t\t/* SunOS 5.x (command line) */\n\t88,\t\t/* SunOS 5.x (short name) */\n#endif /* USE_NT_PSINFO */\n\n\t100,\t\t/* SunOS 5.x (command line) */\n\t84,\t\t/* SunOS 5.x (short name) */\n\n\t44,\t\t/* Linux (command line) */\n\t28,\t\t/* Linux 2.0.36 (short name) */\n\n\t8,\t\t/* FreeBSD */\n};\n\nstatic const size_t\tprpsoffsets64[] = {\n#ifdef USE_NT_PSINFO\n\t152,\t\t/* SunOS 5.x (command line) */\n\t136,\t\t/* SunOS 5.x (short name) */\n#endif /* USE_NT_PSINFO */\n\n\t136,\t\t/* SunOS 5.x, 64-bit (command line) */\n\t120,\t\t/* SunOS 5.x, 64-bit (short name) */\n\n\t56,\t\t/* Linux (command line) */\n\t40, /* Linux (tested on core from 2.4.x, short name) */\n\n\t16,\t\t/* FreeBSD, 64-bit */\n};\n\n#define\tNOFFSETS32\t(sizeof prpsoffsets32 / sizeof prpsoffsets32[0])\n#define NOFFSETS64\t(sizeof prpsoffsets64 / sizeof prpsoffsets64[0])\n\n#define NOFFSETS\t(clazz == ELFCLASS32 ? NOFFSETS32 : NOFFSETS64)\n\n/*\n * Look through the program headers of an executable image, searching\n * for a PT_NOTE section of type NT_PRPSINFO, with a name \"CORE\" or\n * \"FreeBSD\"; if one is found, try looking in various places in its\n * contents for a 16-character string containing only printable\n * characters - if found, that string should be the name of the program\n * that dropped core. Note: right after that 16-character string is,\n * at least in SunOS 5.x (and possibly other SVR4-flavored systems) and\n * Linux, a longer string (80 characters, in 5.x, probably other\n * SVR4-flavored systems, and Linux) containing the start of the\n * command line for that program.\n *\n * SunOS 5.x core files contain two PT_NOTE sections, with the types\n * NT_PRPSINFO (old) and NT_PSINFO (new). These structs contain the\n * same info about the command name and command line, so it probably\n * isn't worthwhile to look for NT_PSINFO, but the offsets are provided\n * above (see USE_NT_PSINFO), in case we ever decide to do so. The\n * NT_PRPSINFO and NT_PSINFO sections are always in order and adjacent;\n * the SunOS 5.x file command relies on this (and prefers the latter).\n *\n * The signal number probably appears in a section of type NT_PRSTATUS,\n * but that's also rather OS-dependent, in ways that are harder to\n * dissect with heuristics, so I'm not bothering with the signal number.\n * (I suppose the signal number could be of interest in situations where\n * you don't have the binary of the program that dropped core; if you\n * *do* have that binary, the debugger will probably tell you what\n * signal it was.)\n */\n\n#define\tOS_STYLE_SVR4\t\t0\n#define\tOS_STYLE_FREEBSD\t1\n#define\tOS_STYLE_NETBSD\t\t2\n\nprivate const char os_style_names[][8] = {\n\t\"SVR4\",\n\t\"FreeBSD\",\n\t\"NetBSD\",\n};\n\n#define FLAGS_DID_CORE\t\t0x01\n#define FLAGS_DID_NOTE\t\t0x02\n#define FLAGS_DID_BUILD_ID\t0x04\n#define FLAGS_DID_CORE_STYLE\t0x08\n#define FLAGS_IS_CORE\t\t0x10\n\nprivate int\ndophn_core(struct magic_set *ms, int clazz, int swap, int fd, off_t off,\n int num, size_t size, off_t fsize, int *flags)\n{\n\tElf32_Phdr ph32;\n\tElf64_Phdr ph64;\n\tsize_t offset, len;\n\tunsigned char nbuf[BUFSIZ];\n\tssize_t bufsize;\n\n\tif (size != xph_sizeof) {\n\t\tif (file_printf(ms, \", corrupted program header size\") == -1)\n\t\t\treturn -1;\n\t\treturn 0;\n\t}\n\n\t/*\n\t * Loop through all the program headers.\n\t */\n\tfor ( ; num; num--) {\n\t\tif (pread(fd, xph_addr, xph_sizeof, off) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\toff += size;\n\n\t\tif (fsize != SIZE_UNKNOWN && xph_offset > fsize) {\n\t\t\t/* Perhaps warn here */\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (xph_type != PT_NOTE)\n\t\t\tcontinue;\n\n\t\t/*\n\t\t * This is a PT_NOTE section; loop through all the notes\n\t\t * in the section.\n\t\t */\n\t\tlen = xph_filesz < sizeof(nbuf) ? xph_filesz : sizeof(nbuf);\n\t\tif ((bufsize = pread(fd, nbuf, len, xph_offset)) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\toffset = 0;\n\t\tfor (;;) {\n\t\t\tif (offset >= (size_t)bufsize)\n\t\t\t\tbreak;\n\t\t\toffset = donote(ms, nbuf, offset, (size_t)bufsize,\n\t\t\t clazz, swap, 4, flags);\n\t\t\tif (offset == 0)\n\t\t\t\tbreak;\n\n\t\t}\n\t}\n\treturn 0;\n}\n#endif\n\nstatic void\ndo_note_netbsd_version(struct magic_set *ms, int swap, void *v)\n{\n\tuint32_t desc;\n\t(void)memcpy(&desc, v, sizeof(desc));\n\tdesc = elf_getu32(swap, desc);\n\n\tif (file_printf(ms, \", for NetBSD\") == -1)\n\t\treturn;\n\t/*\n\t * The version number used to be stuck as 199905, and was thus\n\t * basically content-free. Newer versions of NetBSD have fixed\n\t * this and now use the encoding of __NetBSD_Version__:\n\t *\n\t *\tMMmmrrpp00\n\t *\n\t * M = major version\n\t * m = minor version\n\t * r = release [\"\",A-Z,Z[A-Z] but numeric]\n\t * p = patchlevel\n\t */\n\tif (desc > 100000000U) {\n\t\tuint32_t ver_patch = (desc / 100) % 100;\n\t\tuint32_t ver_rel = (desc / 10000) % 100;\n\t\tuint32_t ver_min = (desc / 1000000) % 100;\n\t\tuint32_t ver_maj = desc / 100000000;\n\n\t\tif (file_printf(ms, \" %u.%u\", ver_maj, ver_min) == -1)\n\t\t\treturn;\n\t\tif (ver_rel == 0 && ver_patch != 0) {\n\t\t\tif (file_printf(ms, \".%u\", ver_patch) == -1)\n\t\t\t\treturn;\n\t\t} else if (ver_rel != 0) {\n\t\t\twhile (ver_rel > 26) {\n\t\t\t\tif (file_printf(ms, \"Z\") == -1)\n\t\t\t\t\treturn;\n\t\t\t\tver_rel -= 26;\n\t\t\t}\n\t\t\tif (file_printf(ms, \"%c\", 'A' + ver_rel - 1)\n\t\t\t == -1)\n\t\t\t\treturn;\n\t\t}\n\t}\n}\n\nstatic void\ndo_note_freebsd_version(struct magic_set *ms, int swap, void *v)\n{\n\tuint32_t desc;\n\n\t(void)memcpy(&desc, v, sizeof(desc));\n\tdesc = elf_getu32(swap, desc);\n\tif (file_printf(ms, \", for FreeBSD\") == -1)\n\t\treturn;\n\n\t/*\n\t * Contents is __FreeBSD_version, whose relation to OS\n\t * versions is defined by a huge table in the Porter's\n\t * Handbook. This is the general scheme:\n\t * \n\t * Releases:\n\t * \tMmp000 (before 4.10)\n\t * \tMmi0p0 (before 5.0)\n\t * \tMmm0p0\n\t * \n\t * Development branches:\n\t * \tMmpxxx (before 4.6)\n\t * \tMmp1xx (before 4.10)\n\t * \tMmi1xx (before 5.0)\n\t * \tM000xx (pre-M.0)\n\t * \tMmm1xx\n\t * \n\t * M = major version\n\t * m = minor version\n\t * i = minor version increment (491000 -> 4.10)\n\t * p = patchlevel\n\t * x = revision\n\t * \n\t * The first release of FreeBSD to use ELF by default\n\t * was version 3.0.\n\t */\n\tif (desc == 460002) {\n\t\tif (file_printf(ms, \" 4.6.2\") == -1)\n\t\t\treturn;\n\t} else if (desc < 460100) {\n\t\tif (file_printf(ms, \" %d.%d\", desc / 100000,\n\t\t desc / 10000 % 10) == -1)\n\t\t\treturn;\n\t\tif (desc / 1000 % 10 > 0)\n\t\t\tif (file_printf(ms, \".%d\", desc / 1000 % 10) == -1)\n\t\t\t\treturn;\n\t\tif ((desc % 1000 > 0) || (desc % 100000 == 0))\n\t\t\tif (file_printf(ms, \" (%d)\", desc) == -1)\n\t\t\t\treturn;\n\t} else if (desc < 500000) {\n\t\tif (file_printf(ms, \" %d.%d\", desc / 100000,\n\t\t desc / 10000 % 10 + desc / 1000 % 10) == -1)\n\t\t\treturn;\n\t\tif (desc / 100 % 10 > 0) {\n\t\t\tif (file_printf(ms, \" (%d)\", desc) == -1)\n\t\t\t\treturn;\n\t\t} else if (desc / 10 % 10 > 0) {\n\t\t\tif (file_printf(ms, \".%d\", desc / 10 % 10) == -1)\n\t\t\t\treturn;\n\t\t}\n\t} else {\n\t\tif (file_printf(ms, \" %d.%d\", desc / 100000,\n\t\t desc / 1000 % 100) == -1)\n\t\t\treturn;\n\t\tif ((desc / 100 % 10 > 0) ||\n\t\t (desc % 100000 / 100 == 0)) {\n\t\t\tif (file_printf(ms, \" (%d)\", desc) == -1)\n\t\t\t\treturn;\n\t\t} else if (desc / 10 % 10 > 0) {\n\t\t\tif (file_printf(ms, \".%d\", desc / 10 % 10) == -1)\n\t\t\t\treturn;\n\t\t}\n\t}\n}\n\nprivate size_t\ndonote(struct magic_set *ms, void *vbuf, size_t offset, size_t size,\n int clazz, int swap, size_t align, int *flags)\n{\n\tElf32_Nhdr nh32;\n\tElf64_Nhdr nh64;\n\tsize_t noff, doff;\n#ifdef ELFCORE\n\tint os_style = -1;\n#endif\n\tuint32_t namesz, descsz;\n\tunsigned char *nbuf = CAST(unsigned char *, vbuf);\n\tchar sbuf[512];\n\n\tif (xnh_sizeof + offset > size) {\n\t\t/*\n\t\t * We're out of note headers.\n\t\t */\n\t\treturn xnh_sizeof + offset;\n\t}\n\n\t(void)memcpy(xnh_addr, &nbuf[offset], xnh_sizeof);\n\toffset += xnh_sizeof;\n\n\tnamesz = xnh_namesz;\n\tdescsz = xnh_descsz;\n\tif ((namesz == 0) && (descsz == 0)) {\n\t\t/*\n\t\t * We're out of note headers.\n\t\t */\n\t\treturn (offset >= size) ? offset : size;\n\t}\n\n\tif (namesz & 0x80000000) {\n\t (void)file_printf(ms, \", bad note name size 0x%lx\",\n\t\t(unsigned long)namesz);\n\t return 0;\n\t}\n\n\tif (descsz & 0x80000000) {\n\t (void)file_printf(ms, \", bad note description size 0x%lx\",\n\t\t(unsigned long)descsz);\n\t return 0;\n\t}\n\n\n\tnoff = offset;\n\tdoff = ELF_ALIGN(offset + namesz);\n\n\tif (offset + namesz > size) {\n\t\t/*\n\t\t * We're past the end of the buffer.\n\t\t */\n\t\treturn doff;\n\t}\n\n\toffset = ELF_ALIGN(doff + descsz);\n\tif (doff + descsz > size) {\n\t\t/*\n\t\t * We're past the end of the buffer.\n\t\t */\n\t\treturn (offset >= size) ? offset : size;\n\t}\n\n\tif ((*flags & (FLAGS_DID_NOTE|FLAGS_DID_BUILD_ID)) ==\n\t (FLAGS_DID_NOTE|FLAGS_DID_BUILD_ID))\n\t\tgoto core;\n\n\tif (namesz == 5 && strcmp((char *)&nbuf[noff], \"SuSE\") == 0 &&\n\t xnh_type == NT_GNU_VERSION && descsz == 2) {\n\t file_printf(ms, \", for SuSE %d.%d\", nbuf[doff], nbuf[doff + 1]);\n\t}\n\tif (namesz == 4 && strcmp((char *)&nbuf[noff], \"GNU\") == 0 &&\n\t xnh_type == NT_GNU_VERSION && descsz == 16) {\n\t\tuint32_t desc[4];\n\t\t(void)memcpy(desc, &nbuf[doff], sizeof(desc));\n\n\t\tif (file_printf(ms, \", for GNU/\") == -1)\n\t\t\treturn size;\n\t\tswitch (elf_getu32(swap, desc[0])) {\n\t\tcase GNU_OS_LINUX:\n\t\t\tif (file_printf(ms, \"Linux\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase GNU_OS_HURD:\n\t\t\tif (file_printf(ms, \"Hurd\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase GNU_OS_SOLARIS:\n\t\t\tif (file_printf(ms, \"Solaris\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase GNU_OS_KFREEBSD:\n\t\t\tif (file_printf(ms, \"kFreeBSD\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase GNU_OS_KNETBSD:\n\t\t\tif (file_printf(ms, \"kNetBSD\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (file_printf(ms, \"\") == -1)\n\t\t\t\treturn size; \n\t\t}\n\t\tif (file_printf(ms, \" %d.%d.%d\", elf_getu32(swap, desc[1]),\n\t\t elf_getu32(swap, desc[2]), elf_getu32(swap, desc[3])) == -1)\n\t\t\treturn size;\n\t\t*flags |= FLAGS_DID_NOTE;\n\t\treturn size;\n\t}\n\n\tif (namesz == 4 && strcmp((char *)&nbuf[noff], \"GNU\") == 0 &&\n\t xnh_type == NT_GNU_BUILD_ID && (descsz == 16 || descsz == 20)) {\n\t uint8_t desc[20];\n\t uint32_t i;\n\t if (file_printf(ms, \", BuildID[%s]=\", descsz == 16 ? \"md5/uuid\" :\n\t\t\"sha1\") == -1)\n\t\t return size;\n\t (void)memcpy(desc, &nbuf[doff], descsz);\n\t for (i = 0; i < descsz; i++)\n\t\tif (file_printf(ms, \"%02x\", desc[i]) == -1)\n\t\t return size;\n\t *flags |= FLAGS_DID_BUILD_ID;\n\t}\n\n\tif (namesz == 4 && strcmp((char *)&nbuf[noff], \"PaX\") == 0 &&\n\t xnh_type == NT_NETBSD_PAX && descsz == 4) {\n\t\tstatic const char *pax[] = {\n\t\t \"+mprotect\",\n\t\t \"-mprotect\",\n\t\t \"+segvguard\",\n\t\t \"-segvguard\",\n\t\t \"+ASLR\",\n\t\t \"-ASLR\",\n\t\t};\n\t\tuint32_t desc;\n\t\tsize_t i;\n\t\tint did = 0;\n\n\t\t(void)memcpy(&desc, &nbuf[doff], sizeof(desc));\n\t\tdesc = elf_getu32(swap, desc);\n\n\t\tif (desc && file_printf(ms, \", PaX: \") == -1)\n\t\t\treturn size;\n\n\t\tfor (i = 0; i < __arraycount(pax); i++) {\n\t\t\tif (((1 << i) & desc) == 0)\n\t\t\t\tcontinue;\n\t\t\tif (file_printf(ms, \"%s%s\", did++ ? \",\" : \"\",\n\t\t\t pax[i]) == -1)\n\t\t\t\treturn size;\n\t\t}\n\t}\n\n\tif (namesz == 7 && strcmp((char *)&nbuf[noff], \"NetBSD\") == 0) {\n\t\tswitch (xnh_type) {\n\t\tcase NT_NETBSD_VERSION:\n\t\t\tif (descsz == 4) {\n\t\t\t\tdo_note_netbsd_version(ms, swap, &nbuf[doff]);\n\t\t\t\t*flags |= FLAGS_DID_NOTE;\n\t\t\t\treturn size;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase NT_NETBSD_MARCH:\n\t\t\tif (file_printf(ms, \", compiled for: %.*s\", (int)descsz,\n\t\t\t (const char *)&nbuf[doff]) == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase NT_NETBSD_CMODEL:\n\t\t\tif (file_printf(ms, \", compiler model: %.*s\",\n\t\t\t (int)descsz, (const char *)&nbuf[doff]) == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (file_printf(ms, \", note=%u\", xnh_type) == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\t}\n\t\treturn size;\n\t}\n\n\tif (namesz == 8 && strcmp((char *)&nbuf[noff], \"FreeBSD\") == 0) {\n\t \tif (xnh_type == NT_FREEBSD_VERSION && descsz == 4) {\n\t\t\tdo_note_freebsd_version(ms, swap, &nbuf[doff]);\n\t\t\t*flags |= FLAGS_DID_NOTE;\n\t\t\treturn size;\n\t\t}\n\t}\n\n\tif (namesz == 8 && strcmp((char *)&nbuf[noff], \"OpenBSD\") == 0 &&\n\t xnh_type == NT_OPENBSD_VERSION && descsz == 4) {\n\t\tif (file_printf(ms, \", for OpenBSD\") == -1)\n\t\t\treturn size;\n\t\t/* Content of note is always 0 */\n\t\t*flags |= FLAGS_DID_NOTE;\n\t\treturn size;\n\t}\n\n\tif (namesz == 10 && strcmp((char *)&nbuf[noff], \"DragonFly\") == 0 &&\n\t xnh_type == NT_DRAGONFLY_VERSION && descsz == 4) {\n\t\tuint32_t desc;\n\t\tif (file_printf(ms, \", for DragonFly\") == -1)\n\t\t\treturn size;\n\t\t(void)memcpy(&desc, &nbuf[doff], sizeof(desc));\n\t\tdesc = elf_getu32(swap, desc);\n\t\tif (file_printf(ms, \" %d.%d.%d\", desc / 100000,\n\t\t desc / 10000 % 10, desc % 10000) == -1)\n\t\t\treturn size;\n\t\t*flags |= FLAGS_DID_NOTE;\n\t\treturn size;\n\t}\n\ncore:\n\t/*\n\t * Sigh. The 2.0.36 kernel in Debian 2.1, at\n\t * least, doesn't correctly implement name\n\t * sections, in core dumps, as specified by\n\t * the \"Program Linking\" section of \"UNIX(R) System\n\t * V Release 4 Programmer's Guide: ANSI C and\n\t * Programming Support Tools\", because my copy\n\t * clearly says \"The first 'namesz' bytes in 'name'\n\t * contain a *null-terminated* [emphasis mine]\n\t * character representation of the entry's owner\n\t * or originator\", but the 2.0.36 kernel code\n\t * doesn't include the terminating null in the\n\t * name....\n\t */\n\tif ((namesz == 4 && strncmp((char *)&nbuf[noff], \"CORE\", 4) == 0) ||\n\t (namesz == 5 && strcmp((char *)&nbuf[noff], \"CORE\") == 0)) {\n\t\tos_style = OS_STYLE_SVR4;\n\t} \n\n\tif ((namesz == 8 && strcmp((char *)&nbuf[noff], \"FreeBSD\") == 0)) {\n\t\tos_style = OS_STYLE_FREEBSD;\n\t}\n\n\tif ((namesz >= 11 && strncmp((char *)&nbuf[noff], \"NetBSD-CORE\", 11)\n\t == 0)) {\n\t\tos_style = OS_STYLE_NETBSD;\n\t}\n\n#ifdef ELFCORE\n\tif ((*flags & FLAGS_DID_CORE) != 0)\n\t\treturn size;\n\n\tif (os_style != -1 && (*flags & FLAGS_DID_CORE_STYLE) == 0) {\n\t\tif (file_printf(ms, \", %s-style\", os_style_names[os_style])\n\t\t == -1)\n\t\t\treturn size;\n\t\t*flags |= FLAGS_DID_CORE_STYLE;\n\t}\n\n\tswitch (os_style) {\n\tcase OS_STYLE_NETBSD:\n\t\tif (xnh_type == NT_NETBSD_CORE_PROCINFO) {\n\t\t\tuint32_t signo;\n\t\t\t/*\n\t\t\t * Extract the program name. It is at\n\t\t\t * offset 0x7c, and is up to 32-bytes,\n\t\t\t * including the terminating NUL.\n\t\t\t */\n\t\t\tif (file_printf(ms, \", from '%.31s'\",\n\t\t\t file_printable(sbuf, sizeof(sbuf),\n\t\t\t (const char *)&nbuf[doff + 0x7c])) == -1)\n\t\t\t\treturn size;\n\t\t\t\n\t\t\t/*\n\t\t\t * Extract the signal number. It is at\n\t\t\t * offset 0x08.\n\t\t\t */\n\t\t\t(void)memcpy(&signo, &nbuf[doff + 0x08],\n\t\t\t sizeof(signo));\n\t\t\tif (file_printf(ms, \" (signal %u)\",\n\t\t\t elf_getu32(swap, signo)) == -1)\n\t\t\t\treturn size;\n\t\t\t*flags |= FLAGS_DID_CORE;\n\t\t\treturn size;\n\t\t}\n\t\tbreak;\n\n\tdefault:\n\t\tif (xnh_type == NT_PRPSINFO && *flags & FLAGS_IS_CORE) {\n\t\t\tsize_t i, j;\n\t\t\tunsigned char c;\n\t\t\t/*\n\t\t\t * Extract the program name. We assume\n\t\t\t * it to be 16 characters (that's what it\n\t\t\t * is in SunOS 5.x and Linux).\n\t\t\t *\n\t\t\t * Unfortunately, it's at a different offset\n\t\t\t * in various OSes, so try multiple offsets.\n\t\t\t * If the characters aren't all printable,\n\t\t\t * reject it.\n\t\t\t */\n\t\t\tfor (i = 0; i < NOFFSETS; i++) {\n\t\t\t\tunsigned char *cname, *cp;\n\t\t\t\tsize_t reloffset = prpsoffsets(i);\n\t\t\t\tsize_t noffset = doff + reloffset;\n\t\t\t\tsize_t k;\n\t\t\t\tfor (j = 0; j < 16; j++, noffset++,\n\t\t\t\t reloffset++) {\n\t\t\t\t\t/*\n\t\t\t\t\t * Make sure we're not past\n\t\t\t\t\t * the end of the buffer; if\n\t\t\t\t\t * we are, just give up.\n\t\t\t\t\t */\n\t\t\t\t\tif (noffset >= size)\n\t\t\t\t\t\tgoto tryanother;\n\n\t\t\t\t\t/*\n\t\t\t\t\t * Make sure we're not past\n\t\t\t\t\t * the end of the contents;\n\t\t\t\t\t * if we are, this obviously\n\t\t\t\t\t * isn't the right offset.\n\t\t\t\t\t */\n\t\t\t\t\tif (reloffset >= descsz)\n\t\t\t\t\t\tgoto tryanother;\n\n\t\t\t\t\tc = nbuf[noffset];\n\t\t\t\t\tif (c == '\\0') {\n\t\t\t\t\t\t/*\n\t\t\t\t\t\t * A '\\0' at the\n\t\t\t\t\t\t * beginning is\n\t\t\t\t\t\t * obviously wrong.\n\t\t\t\t\t\t * Any other '\\0'\n\t\t\t\t\t\t * means we're done.\n\t\t\t\t\t\t */\n\t\t\t\t\t\tif (j == 0)\n\t\t\t\t\t\t\tgoto tryanother;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else {\n\t\t\t\t\t\t/*\n\t\t\t\t\t\t * A nonprintable\n\t\t\t\t\t\t * character is also\n\t\t\t\t\t\t * wrong.\n\t\t\t\t\t\t */\n\t\t\t\t\t\tif (!isprint(c) || isquote(c))\n\t\t\t\t\t\t\tgoto tryanother;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\t * Well, that worked.\n\t\t\t\t */\n\n\t\t\t\t/*\n\t\t\t\t * Try next offsets, in case this match is\n\t\t\t\t * in the middle of a string.\n\t\t\t\t */\n\t\t\t\tfor (k = i + 1 ; k < NOFFSETS ; k++) {\n\t\t\t\t\tsize_t no;\n\t\t\t\t\tint adjust = 1;\n\t\t\t\t\tif (prpsoffsets(k) >= prpsoffsets(i))\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (no = doff + prpsoffsets(k);\n\t\t\t\t\t no < doff + prpsoffsets(i); no++)\n\t\t\t\t\t\tadjust = adjust\n\t\t\t\t\t\t && isprint(nbuf[no]);\n\t\t\t\t\tif (adjust)\n\t\t\t\t\t\ti = k;\n\t\t\t\t}\n\n\t\t\t\tcname = (unsigned char *)\n\t\t\t\t &nbuf[doff + prpsoffsets(i)];\n\t\t\t\tfor (cp = cname; *cp && isprint(*cp); cp++)\n\t\t\t\t\tcontinue;\n\t\t\t\t/*\n\t\t\t\t * Linux apparently appends a space at the end\n\t\t\t\t * of the command line: remove it.\n\t\t\t\t */\n\t\t\t\twhile (cp > cname && isspace(cp[-1]))\n\t\t\t\t\tcp--;\n\t\t\t\tif (file_printf(ms, \", from '%.*s'\",\n\t\t\t\t (int)(cp - cname), cname) == -1)\n\t\t\t\t\treturn size;\n\t\t\t\t*flags |= FLAGS_DID_CORE;\n\t\t\t\treturn size;\n\n\t\t\ttryanother:\n\t\t\t\t;\n\t\t\t}\n\t\t}\n\t\tbreak;\n\t}\n#endif\n\treturn offset;\n}\n\n/* SunOS 5.x hardware capability descriptions */\ntypedef struct cap_desc {\n\tuint64_t cd_mask;\n\tconst char *cd_name;\n} cap_desc_t;\n\nstatic const cap_desc_t cap_desc_sparc[] = {\n\t{ AV_SPARC_MUL32,\t\t\"MUL32\" },\n\t{ AV_SPARC_DIV32,\t\t\"DIV32\" },\n\t{ AV_SPARC_FSMULD,\t\t\"FSMULD\" },\n\t{ AV_SPARC_V8PLUS,\t\t\"V8PLUS\" },\n\t{ AV_SPARC_POPC,\t\t\"POPC\" },\n\t{ AV_SPARC_VIS,\t\t\t\"VIS\" },\n\t{ AV_SPARC_VIS2,\t\t\"VIS2\" },\n\t{ AV_SPARC_ASI_BLK_INIT,\t\"ASI_BLK_INIT\" },\n\t{ AV_SPARC_FMAF,\t\t\"FMAF\" },\n\t{ AV_SPARC_FJFMAU,\t\t\"FJFMAU\" },\n\t{ AV_SPARC_IMA,\t\t\t\"IMA\" },\n\t{ 0, NULL }\n};\n\nstatic const cap_desc_t cap_desc_386[] = {\n\t{ AV_386_FPU,\t\t\t\"FPU\" },\n\t{ AV_386_TSC,\t\t\t\"TSC\" },\n\t{ AV_386_CX8,\t\t\t\"CX8\" },\n\t{ AV_386_SEP,\t\t\t\"SEP\" },\n\t{ AV_386_AMD_SYSC,\t\t\"AMD_SYSC\" },\n\t{ AV_386_CMOV,\t\t\t\"CMOV\" },\n\t{ AV_386_MMX,\t\t\t\"MMX\" },\n\t{ AV_386_AMD_MMX,\t\t\"AMD_MMX\" },\n\t{ AV_386_AMD_3DNow,\t\t\"AMD_3DNow\" },\n\t{ AV_386_AMD_3DNowx,\t\t\"AMD_3DNowx\" },\n\t{ AV_386_FXSR,\t\t\t\"FXSR\" },\n\t{ AV_386_SSE,\t\t\t\"SSE\" },\n\t{ AV_386_SSE2,\t\t\t\"SSE2\" },\n\t{ AV_386_PAUSE,\t\t\t\"PAUSE\" },\n\t{ AV_386_SSE3,\t\t\t\"SSE3\" },\n\t{ AV_386_MON,\t\t\t\"MON\" },\n\t{ AV_386_CX16,\t\t\t\"CX16\" },\n\t{ AV_386_AHF,\t\t\t\"AHF\" },\n\t{ AV_386_TSCP,\t\t\t\"TSCP\" },\n\t{ AV_386_AMD_SSE4A,\t\t\"AMD_SSE4A\" },\n\t{ AV_386_POPCNT,\t\t\"POPCNT\" },\n\t{ AV_386_AMD_LZCNT,\t\t\"AMD_LZCNT\" },\n\t{ AV_386_SSSE3,\t\t\t\"SSSE3\" },\n\t{ AV_386_SSE4_1,\t\t\"SSE4.1\" },\n\t{ AV_386_SSE4_2,\t\t\"SSE4.2\" },\n\t{ 0, NULL }\n};\n\nprivate int\ndoshn(struct magic_set *ms, int clazz, int swap, int fd, off_t off, int num,\n size_t size, off_t fsize, int *flags, int mach, int strtab)\n{\n\tElf32_Shdr sh32;\n\tElf64_Shdr sh64;\n\tint stripped = 1;\n\tsize_t nbadcap = 0;\n\tvoid *nbuf;\n\toff_t noff, coff, name_off;\n\tuint64_t cap_hw1 = 0;\t/* SunOS 5.x hardware capabilites */\n\tuint64_t cap_sf1 = 0;\t/* SunOS 5.x software capabilites */\n\tchar name[50];\n\n\tif (size != xsh_sizeof) {\n\t\tif (file_printf(ms, \", corrupted section header size\") == -1)\n\t\t\treturn -1;\n\t\treturn 0;\n\t}\n\n\t/* Read offset of name section to be able to read section names later */\n\tif (pread(fd, xsh_addr, xsh_sizeof, off + size * strtab) == -1) {\n\t\tfile_badread(ms);\n\t\treturn -1;\n\t}\n\tname_off = xsh_offset;\n\n\tfor ( ; num; num--) {\n\t\t/* Read the name of this section. */\n\t\tif (pread(fd, name, sizeof(name), name_off + xsh_name) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\tname[sizeof(name) - 1] = '\\0';\n\t\tif (strcmp(name, \".debug_info\") == 0)\n\t\t\tstripped = 0;\n\n\t\tif (pread(fd, xsh_addr, xsh_sizeof, off) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\toff += size;\n\n\t\t/* Things we can determine before we seek */\n\t\tswitch (xsh_type) {\n\t\tcase SHT_SYMTAB:\n#if 0\n\t\tcase SHT_DYNSYM:\n#endif\n\t\t\tstripped = 0;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (fsize != SIZE_UNKNOWN && xsh_offset > fsize) {\n\t\t\t\t/* Perhaps warn here */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\t/* Things we can determine when we seek */\n\t\tswitch (xsh_type) {\n\t\tcase SHT_NOTE:\n\t\t\tif ((nbuf = malloc(xsh_size)) == NULL) {\n\t\t\t\tfile_error(ms, errno, \"Cannot allocate memory\"\n\t\t\t\t \" for note\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (pread(fd, nbuf, xsh_size, xsh_offset) == -1) {\n\t\t\t\tfile_badread(ms);\n\t\t\t\tfree(nbuf);\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tnoff = 0;\n\t\t\tfor (;;) {\n\t\t\t\tif (noff >= (off_t)xsh_size)\n\t\t\t\t\tbreak;\n\t\t\t\tnoff = donote(ms, nbuf, (size_t)noff,\n\t\t\t\t xsh_size, clazz, swap, 4, flags);\n\t\t\t\tif (noff == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfree(nbuf);\n\t\t\tbreak;\n\t\tcase SHT_SUNW_cap:\n\t\t\tswitch (mach) {\n\t\t\tcase EM_SPARC:\n\t\t\tcase EM_SPARCV9:\n\t\t\tcase EM_IA_64:\n\t\t\tcase EM_386:\n\t\t\tcase EM_AMD64:\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tgoto skip;\n\t\t\t}\n\n\t\t\tif (nbadcap > 5)\n\t\t\t\tbreak;\n\t\t\tif (lseek(fd, xsh_offset, SEEK_SET) == (off_t)-1) {\n\t\t\t\tfile_badseek(ms);\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tcoff = 0;\n\t\t\tfor (;;) {\n\t\t\t\tElf32_Cap cap32;\n\t\t\t\tElf64_Cap cap64;\n\t\t\t\tchar cbuf[/*CONSTCOND*/\n\t\t\t\t MAX(sizeof cap32, sizeof cap64)];\n\t\t\t\tif ((coff += xcap_sizeof) > (off_t)xsh_size)\n\t\t\t\t\tbreak;\n\t\t\t\tif (read(fd, cbuf, (size_t)xcap_sizeof) !=\n\t\t\t\t (ssize_t)xcap_sizeof) {\n\t\t\t\t\tfile_badread(ms);\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t\tif (cbuf[0] == 'A') {\n#ifdef notyet\n\t\t\t\t\tchar *p = cbuf + 1;\n\t\t\t\t\tuint32_t len, tag;\n\t\t\t\t\tmemcpy(&len, p, sizeof(len));\n\t\t\t\t\tp += 4;\n\t\t\t\t\tlen = getu32(swap, len);\n\t\t\t\t\tif (memcmp(\"gnu\", p, 3) != 0) {\n\t\t\t\t\t if (file_printf(ms,\n\t\t\t\t\t\t\", unknown capability %.3s\", p)\n\t\t\t\t\t\t== -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t break;\n\t\t\t\t\t}\n\t\t\t\t\tp += strlen(p) + 1;\n\t\t\t\t\ttag = *p++;\n\t\t\t\t\tmemcpy(&len, p, sizeof(len));\n\t\t\t\t\tp += 4;\n\t\t\t\t\tlen = getu32(swap, len);\n\t\t\t\t\tif (tag != 1) {\n\t\t\t\t\t if (file_printf(ms, \", unknown gnu\"\n\t\t\t\t\t\t\" capability tag %d\", tag)\n\t\t\t\t\t\t== -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t break;\n\t\t\t\t\t}\n\t\t\t\t\t// gnu attributes \n#endif\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t(void)memcpy(xcap_addr, cbuf, xcap_sizeof);\n\t\t\t\tswitch (xcap_tag) {\n\t\t\t\tcase CA_SUNW_NULL:\n\t\t\t\t\tbreak;\n\t\t\t\tcase CA_SUNW_HW_1:\n\t\t\t\t\tcap_hw1 |= xcap_val;\n\t\t\t\t\tbreak;\n\t\t\t\tcase CA_SUNW_SF_1:\n\t\t\t\t\tcap_sf1 |= xcap_val;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tif (file_printf(ms,\n\t\t\t\t\t \", with unknown capability \"\n\t\t\t\t\t \"0x%\" INT64_T_FORMAT \"x = 0x%\"\n\t\t\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t\t\t (unsigned long long)xcap_tag,\n\t\t\t\t\t (unsigned long long)xcap_val) == -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\tif (nbadcap++ > 2)\n\t\t\t\t\t\tcoff = xsh_size;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t/*FALLTHROUGH*/\n\t\tskip:\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (file_printf(ms, \", %sstripped\", stripped ? \"\" : \"not \") == -1)\n\t\treturn -1;\n\tif (cap_hw1) {\n\t\tconst cap_desc_t *cdp;\n\t\tswitch (mach) {\n\t\tcase EM_SPARC:\n\t\tcase EM_SPARC32PLUS:\n\t\tcase EM_SPARCV9:\n\t\t\tcdp = cap_desc_sparc;\n\t\t\tbreak;\n\t\tcase EM_386:\n\t\tcase EM_IA_64:\n\t\tcase EM_AMD64:\n\t\t\tcdp = cap_desc_386;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tcdp = NULL;\n\t\t\tbreak;\n\t\t}\n\t\tif (file_printf(ms, \", uses\") == -1)\n\t\t\treturn -1;\n\t\tif (cdp) {\n\t\t\twhile (cdp->cd_name) {\n\t\t\t\tif (cap_hw1 & cdp->cd_mask) {\n\t\t\t\t\tif (file_printf(ms,\n\t\t\t\t\t \" %s\", cdp->cd_name) == -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\tcap_hw1 &= ~cdp->cd_mask;\n\t\t\t\t}\n\t\t\t\t++cdp;\n\t\t\t}\n\t\t\tif (cap_hw1)\n\t\t\t\tif (file_printf(ms,\n\t\t\t\t \" unknown hardware capability 0x%\"\n\t\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t\t (unsigned long long)cap_hw1) == -1)\n\t\t\t\t\treturn -1;\n\t\t} else {\n\t\t\tif (file_printf(ms,\n\t\t\t \" hardware capability 0x%\" INT64_T_FORMAT \"x\",\n\t\t\t (unsigned long long)cap_hw1) == -1)\n\t\t\t\treturn -1;\n\t\t}\n\t}\n\tif (cap_sf1) {\n\t\tif (cap_sf1 & SF1_SUNW_FPUSED) {\n\t\t\tif (file_printf(ms,\n\t\t\t (cap_sf1 & SF1_SUNW_FPKNWN)\n\t\t\t ? \", uses frame pointer\"\n\t\t\t : \", not known to use frame pointer\") == -1)\n\t\t\t\treturn -1;\n\t\t}\n\t\tcap_sf1 &= ~SF1_SUNW_MASK;\n\t\tif (cap_sf1)\n\t\t\tif (file_printf(ms,\n\t\t\t \", with unknown software capability 0x%\"\n\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t (unsigned long long)cap_sf1) == -1)\n\t\t\t\treturn -1;\n\t}\n\treturn 0;\n}\n\n/*\n * Look through the program headers of an executable image, searching\n * for a PT_INTERP section; if one is found, it's dynamically linked,\n * otherwise it's statically linked.\n */\nprivate int\ndophn_exec(struct magic_set *ms, int clazz, int swap, int fd, off_t off,\n int num, size_t size, off_t fsize, int *flags, int sh_num)\n{\n\tElf32_Phdr ph32;\n\tElf64_Phdr ph64;\n\tconst char *linking_style = \"statically\";\n\tconst char *interp = \"\";\n\tunsigned char nbuf[BUFSIZ];\n\tchar ibuf[BUFSIZ];\n\tssize_t bufsize;\n\tsize_t offset, align, len;\n\t\n\tif (size != xph_sizeof) {\n\t\tif (file_printf(ms, \", corrupted program header size\") == -1)\n\t\t\treturn -1;\n\t\treturn 0;\n\t}\n\n \tfor ( ; num; num--) {\n\t\tif (pread(fd, xph_addr, xph_sizeof, off) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\n\t\toff += size;\n\t\tbufsize = 0;\n\t\talign = 4;\n\n\t\t/* Things we can determine before we seek */\n\t\tswitch (xph_type) {\n\t\tcase PT_DYNAMIC:\n\t\t\tlinking_style = \"dynamically\";\n\t\t\tbreak;\n\t\tcase PT_NOTE:\n\t\t\tif (sh_num)\t/* Did this through section headers */\n\t\t\t\tcontinue;\n\t\t\tif (((align = xph_align) & 0x80000000UL) != 0 ||\n\t\t\t align < 4) {\n\t\t\t\tif (file_printf(ms, \n\t\t\t\t \", invalid note alignment 0x%lx\",\n\t\t\t\t (unsigned long)align) == -1)\n\t\t\t\t\treturn -1;\n\t\t\t\talign = 4;\n\t\t\t}\n\t\t\t/*FALLTHROUGH*/\n\t\tcase PT_INTERP:\n\t\t\tlen = xph_filesz < sizeof(nbuf) ? xph_filesz\n\t\t\t : sizeof(nbuf);\n\t\t\tbufsize = pread(fd, nbuf, len, xph_offset);\n\t\t\tif (bufsize == -1) {\n\t\t\t\tfile_badread(ms);\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (fsize != SIZE_UNKNOWN && xph_offset > fsize) {\n\t\t\t\t/* Maybe warn here? */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\t/* Things we can determine when we seek */\n\t\tswitch (xph_type) {\n\t\tcase PT_INTERP:\n\t\t\tif (bufsize && nbuf[0]) {\n\t\t\t\tnbuf[bufsize - 1] = '\\0';\n\t\t\t\tinterp = (const char *)nbuf;\n\t\t\t} else\n\t\t\t\tinterp = \"*empty*\";\n\t\t\tbreak;\n\t\tcase PT_NOTE:\n\t\t\t/*\n\t\t\t * This is a PT_NOTE section; loop through all the notes\n\t\t\t * in the section.\n\t\t\t */\n\t\t\toffset = 0;\n\t\t\tfor (;;) {\n\t\t\t\tif (offset >= (size_t)bufsize)\n\t\t\t\t\tbreak;\n\t\t\t\toffset = donote(ms, nbuf, offset,\n\t\t\t\t (size_t)bufsize, clazz, swap, align,\n\t\t\t\t flags);\n\t\t\t\tif (offset == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (file_printf(ms, \", %s linked\", linking_style)\n\t == -1)\n\t\treturn -1;\n\tif (interp[0])\n\t\tif (file_printf(ms, \", interpreter %s\",\n\t\t file_printable(ibuf, sizeof(ibuf), interp)) == -1)\n\t\t\treturn -1;\n\treturn 0;\n}\n\n\nprotected int\nfile_tryelf(struct magic_set *ms, int fd, const unsigned char *buf,\n size_t nbytes)\n{\n\tunion {\n\t\tint32_t l;\n\t\tchar c[sizeof (int32_t)];\n\t} u;\n\tint clazz;\n\tint swap;\n\tstruct stat st;\n\toff_t fsize;\n\tint flags = 0;\n\tElf32_Ehdr elf32hdr;\n\tElf64_Ehdr elf64hdr;\n\tuint16_t type, phnum, shnum;\n\n\tif (ms->flags & (MAGIC_MIME|MAGIC_APPLE))\n\t\treturn 0;\n\t/*\n\t * ELF executables have multiple section headers in arbitrary\n\t * file locations and thus file(1) cannot determine it from easily.\n\t * Instead we traverse thru all section headers until a symbol table\n\t * one is found or else the binary is stripped.\n\t * Return immediately if it's not ELF (so we avoid pipe2file unless needed).\n\t */\n\tif (buf[EI_MAG0] != ELFMAG0\n\t || (buf[EI_MAG1] != ELFMAG1 && buf[EI_MAG1] != OLFMAG1)\n\t || buf[EI_MAG2] != ELFMAG2 || buf[EI_MAG3] != ELFMAG3)\n\t\treturn 0;\n\n\t/*\n\t * If we cannot seek, it must be a pipe, socket or fifo.\n\t */\n\tif((lseek(fd, (off_t)0, SEEK_SET) == (off_t)-1) && (errno == ESPIPE))\n\t\tfd = file_pipe2file(ms, fd, buf, nbytes);\n\n\tif (fstat(fd, &st) == -1) {\n \t\tfile_badread(ms);\n\t\treturn -1;\n\t}\n\tif (S_ISREG(st.st_mode) || st.st_size != 0)\n\t\tfsize = st.st_size;\n\telse\n\t\tfsize = SIZE_UNKNOWN;\n\n\tclazz = buf[EI_CLASS];\n\n\tswitch (clazz) {\n\tcase ELFCLASS32:\n#undef elf_getu\n#define elf_getu(a, b)\telf_getu32(a, b)\n#undef elfhdr\n#define elfhdr elf32hdr\n#include \"elfclass.h\"\n\tcase ELFCLASS64:\n#undef elf_getu\n#define elf_getu(a, b)\telf_getu64(a, b)\n#undef elfhdr\n#define elfhdr elf64hdr\n#include \"elfclass.h\"\n\tdefault:\n\t if (file_printf(ms, \", unknown class %d\", clazz) == -1)\n\t\t return -1;\n\t break;\n\t}\n\treturn 0;\n}\n#endif\n"},"code_after":{"kind":"string","value":"/*\n * Copyright (c) Christos Zoulas 2003.\n * All Rights Reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice immediately at the beginning of the file, without modification,\n * this list of conditions, and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * \n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n */\n#include \"file.h\"\n\n#ifndef lint\nFILE_RCSID(\"@(#)$File: readelf.c,v 1.114 2014/12/11 14:19:36 christos Exp $\")\n#endif\n\n#ifdef BUILTIN_ELF\n#include \n#include \n#include \n#ifdef HAVE_UNISTD_H\n#include \n#endif\n\n#include \"readelf.h\"\n#include \"magic.h\"\n\n#ifdef\tELFCORE\nprivate int dophn_core(struct magic_set *, int, int, int, off_t, int, size_t,\n off_t, int *);\n#endif\nprivate int dophn_exec(struct magic_set *, int, int, int, off_t, int, size_t,\n off_t, int *, int);\nprivate int doshn(struct magic_set *, int, int, int, off_t, int, size_t,\n off_t, int *, int, int);\nprivate size_t donote(struct magic_set *, void *, size_t, size_t, int,\n int, size_t, int *);\n\n#define\tELF_ALIGN(a)\t((((a) + align - 1) / align) * align)\n\n#define isquote(c) (strchr(\"'\\\"`\", (c)) != NULL)\n\nprivate uint16_t getu16(int, uint16_t);\nprivate uint32_t getu32(int, uint32_t);\nprivate uint64_t getu64(int, uint64_t);\n\n#define MAX_PHNUM\t128\n#define\tMAX_SHNUM\t32768\n#define SIZE_UNKNOWN\t((off_t)-1)\n\nprivate int\ntoomany(struct magic_set *ms, const char *name, uint16_t num)\n{\n\tif (file_printf(ms, \", too many %s header sections (%u)\", name, num\n\t ) == -1)\n\t\treturn -1;\n\treturn 0;\n}\n\nprivate uint16_t\ngetu16(int swap, uint16_t value)\n{\n\tunion {\n\t\tuint16_t ui;\n\t\tchar c[2];\n\t} retval, tmpval;\n\n\tif (swap) {\n\t\ttmpval.ui = value;\n\n\t\tretval.c[0] = tmpval.c[1];\n\t\tretval.c[1] = tmpval.c[0];\n\t\t\n\t\treturn retval.ui;\n\t} else\n\t\treturn value;\n}\n\nprivate uint32_t\ngetu32(int swap, uint32_t value)\n{\n\tunion {\n\t\tuint32_t ui;\n\t\tchar c[4];\n\t} retval, tmpval;\n\n\tif (swap) {\n\t\ttmpval.ui = value;\n\n\t\tretval.c[0] = tmpval.c[3];\n\t\tretval.c[1] = tmpval.c[2];\n\t\tretval.c[2] = tmpval.c[1];\n\t\tretval.c[3] = tmpval.c[0];\n\t\t\n\t\treturn retval.ui;\n\t} else\n\t\treturn value;\n}\n\nprivate uint64_t\ngetu64(int swap, uint64_t value)\n{\n\tunion {\n\t\tuint64_t ui;\n\t\tchar c[8];\n\t} retval, tmpval;\n\n\tif (swap) {\n\t\ttmpval.ui = value;\n\n\t\tretval.c[0] = tmpval.c[7];\n\t\tretval.c[1] = tmpval.c[6];\n\t\tretval.c[2] = tmpval.c[5];\n\t\tretval.c[3] = tmpval.c[4];\n\t\tretval.c[4] = tmpval.c[3];\n\t\tretval.c[5] = tmpval.c[2];\n\t\tretval.c[6] = tmpval.c[1];\n\t\tretval.c[7] = tmpval.c[0];\n\t\t\n\t\treturn retval.ui;\n\t} else\n\t\treturn value;\n}\n\n#define elf_getu16(swap, value) getu16(swap, value)\n#define elf_getu32(swap, value) getu32(swap, value)\n#define elf_getu64(swap, value) getu64(swap, value)\n\n#define xsh_addr\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? (void *)&sh32\t\t\t\\\n\t\t\t : (void *)&sh64)\n#define xsh_sizeof\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? sizeof(sh32)\t\t\t\t\\\n\t\t\t : sizeof(sh64))\n#define xsh_size\t(size_t)(clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, sh32.sh_size)\t\\\n\t\t\t : elf_getu64(swap, sh64.sh_size))\n#define xsh_offset\t(off_t)(clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, sh32.sh_offset)\t\\\n\t\t\t : elf_getu64(swap, sh64.sh_offset))\n#define xsh_type\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, sh32.sh_type)\t\\\n\t\t\t : elf_getu32(swap, sh64.sh_type))\n#define xsh_name \t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, sh32.sh_name)\t\\\n\t\t\t : elf_getu32(swap, sh64.sh_name))\n#define xph_addr\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? (void *) &ph32\t\t\t\\\n\t\t\t : (void *) &ph64)\n#define xph_sizeof\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? sizeof(ph32)\t\t\t\t\\\n\t\t\t : sizeof(ph64))\n#define xph_type\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, ph32.p_type)\t\\\n\t\t\t : elf_getu32(swap, ph64.p_type))\n#define xph_offset\t(off_t)(clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, ph32.p_offset)\t\\\n\t\t\t : elf_getu64(swap, ph64.p_offset))\n#define xph_align\t(size_t)((clazz == ELFCLASS32\t\t\\\n\t\t\t ? (off_t) (ph32.p_align ? \t\t\\\n\t\t\t elf_getu32(swap, ph32.p_align) : 4) \\\n\t\t\t : (off_t) (ph64.p_align ?\t\t\\\n\t\t\t elf_getu64(swap, ph64.p_align) : 4)))\n#define xph_filesz\t(size_t)((clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, ph32.p_filesz)\t\\\n\t\t\t : elf_getu64(swap, ph64.p_filesz)))\n#define xnh_addr\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? (void *)&nh32\t\t\t\\\n\t\t\t : (void *)&nh64)\n#define xph_memsz\t(size_t)((clazz == ELFCLASS32\t\t\\\n\t\t\t ? elf_getu32(swap, ph32.p_memsz)\t\\\n\t\t\t : elf_getu64(swap, ph64.p_memsz)))\n#define xnh_sizeof\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? sizeof nh32\t\t\t\t\\\n\t\t\t : sizeof nh64)\n#define xnh_type\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, nh32.n_type)\t\\\n\t\t\t : elf_getu32(swap, nh64.n_type))\n#define xnh_namesz\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, nh32.n_namesz)\t\\\n\t\t\t : elf_getu32(swap, nh64.n_namesz))\n#define xnh_descsz\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, nh32.n_descsz)\t\\\n\t\t\t : elf_getu32(swap, nh64.n_descsz))\n#define prpsoffsets(i)\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? prpsoffsets32[i]\t\t\t\\\n\t\t\t : prpsoffsets64[i])\n#define xcap_addr\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? (void *)&cap32\t\t\t\\\n\t\t\t : (void *)&cap64)\n#define xcap_sizeof\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? sizeof cap32\t\t\t\t\\\n\t\t\t : sizeof cap64)\n#define xcap_tag\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, cap32.c_tag)\t\\\n\t\t\t : elf_getu64(swap, cap64.c_tag))\n#define xcap_val\t(clazz == ELFCLASS32\t\t\t\\\n\t\t\t ? elf_getu32(swap, cap32.c_un.c_val)\t\\\n\t\t\t : elf_getu64(swap, cap64.c_un.c_val))\n\n#ifdef ELFCORE\n/*\n * Try larger offsets first to avoid false matches\n * from earlier data that happen to look like strings.\n */\nstatic const size_t\tprpsoffsets32[] = {\n#ifdef USE_NT_PSINFO\n\t104,\t\t/* SunOS 5.x (command line) */\n\t88,\t\t/* SunOS 5.x (short name) */\n#endif /* USE_NT_PSINFO */\n\n\t100,\t\t/* SunOS 5.x (command line) */\n\t84,\t\t/* SunOS 5.x (short name) */\n\n\t44,\t\t/* Linux (command line) */\n\t28,\t\t/* Linux 2.0.36 (short name) */\n\n\t8,\t\t/* FreeBSD */\n};\n\nstatic const size_t\tprpsoffsets64[] = {\n#ifdef USE_NT_PSINFO\n\t152,\t\t/* SunOS 5.x (command line) */\n\t136,\t\t/* SunOS 5.x (short name) */\n#endif /* USE_NT_PSINFO */\n\n\t136,\t\t/* SunOS 5.x, 64-bit (command line) */\n\t120,\t\t/* SunOS 5.x, 64-bit (short name) */\n\n\t56,\t\t/* Linux (command line) */\n\t40, /* Linux (tested on core from 2.4.x, short name) */\n\n\t16,\t\t/* FreeBSD, 64-bit */\n};\n\n#define\tNOFFSETS32\t(sizeof prpsoffsets32 / sizeof prpsoffsets32[0])\n#define NOFFSETS64\t(sizeof prpsoffsets64 / sizeof prpsoffsets64[0])\n\n#define NOFFSETS\t(clazz == ELFCLASS32 ? NOFFSETS32 : NOFFSETS64)\n\n/*\n * Look through the program headers of an executable image, searching\n * for a PT_NOTE section of type NT_PRPSINFO, with a name \"CORE\" or\n * \"FreeBSD\"; if one is found, try looking in various places in its\n * contents for a 16-character string containing only printable\n * characters - if found, that string should be the name of the program\n * that dropped core. Note: right after that 16-character string is,\n * at least in SunOS 5.x (and possibly other SVR4-flavored systems) and\n * Linux, a longer string (80 characters, in 5.x, probably other\n * SVR4-flavored systems, and Linux) containing the start of the\n * command line for that program.\n *\n * SunOS 5.x core files contain two PT_NOTE sections, with the types\n * NT_PRPSINFO (old) and NT_PSINFO (new). These structs contain the\n * same info about the command name and command line, so it probably\n * isn't worthwhile to look for NT_PSINFO, but the offsets are provided\n * above (see USE_NT_PSINFO), in case we ever decide to do so. The\n * NT_PRPSINFO and NT_PSINFO sections are always in order and adjacent;\n * the SunOS 5.x file command relies on this (and prefers the latter).\n *\n * The signal number probably appears in a section of type NT_PRSTATUS,\n * but that's also rather OS-dependent, in ways that are harder to\n * dissect with heuristics, so I'm not bothering with the signal number.\n * (I suppose the signal number could be of interest in situations where\n * you don't have the binary of the program that dropped core; if you\n * *do* have that binary, the debugger will probably tell you what\n * signal it was.)\n */\n\n#define\tOS_STYLE_SVR4\t\t0\n#define\tOS_STYLE_FREEBSD\t1\n#define\tOS_STYLE_NETBSD\t\t2\n\nprivate const char os_style_names[][8] = {\n\t\"SVR4\",\n\t\"FreeBSD\",\n\t\"NetBSD\",\n};\n\n#define FLAGS_DID_CORE\t\t0x01\n#define FLAGS_DID_NOTE\t\t0x02\n#define FLAGS_DID_BUILD_ID\t0x04\n#define FLAGS_DID_CORE_STYLE\t0x08\n#define FLAGS_IS_CORE\t\t0x10\n\nprivate int\ndophn_core(struct magic_set *ms, int clazz, int swap, int fd, off_t off,\n int num, size_t size, off_t fsize, int *flags)\n{\n\tElf32_Phdr ph32;\n\tElf64_Phdr ph64;\n\tsize_t offset, len;\n\tunsigned char nbuf[BUFSIZ];\n\tssize_t bufsize;\n\n\tif (size != xph_sizeof) {\n\t\tif (file_printf(ms, \", corrupted program header size\") == -1)\n\t\t\treturn -1;\n\t\treturn 0;\n\t}\n\n\t/*\n\t * Loop through all the program headers.\n\t */\n\tfor ( ; num; num--) {\n\t\tif (pread(fd, xph_addr, xph_sizeof, off) < (ssize_t)xph_sizeof) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\toff += size;\n\n\t\tif (fsize != SIZE_UNKNOWN && xph_offset > fsize) {\n\t\t\t/* Perhaps warn here */\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (xph_type != PT_NOTE)\n\t\t\tcontinue;\n\n\t\t/*\n\t\t * This is a PT_NOTE section; loop through all the notes\n\t\t * in the section.\n\t\t */\n\t\tlen = xph_filesz < sizeof(nbuf) ? xph_filesz : sizeof(nbuf);\n\t\tif ((bufsize = pread(fd, nbuf, len, xph_offset)) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\toffset = 0;\n\t\tfor (;;) {\n\t\t\tif (offset >= (size_t)bufsize)\n\t\t\t\tbreak;\n\t\t\toffset = donote(ms, nbuf, offset, (size_t)bufsize,\n\t\t\t clazz, swap, 4, flags);\n\t\t\tif (offset == 0)\n\t\t\t\tbreak;\n\n\t\t}\n\t}\n\treturn 0;\n}\n#endif\n\nstatic void\ndo_note_netbsd_version(struct magic_set *ms, int swap, void *v)\n{\n\tuint32_t desc;\n\t(void)memcpy(&desc, v, sizeof(desc));\n\tdesc = elf_getu32(swap, desc);\n\n\tif (file_printf(ms, \", for NetBSD\") == -1)\n\t\treturn;\n\t/*\n\t * The version number used to be stuck as 199905, and was thus\n\t * basically content-free. Newer versions of NetBSD have fixed\n\t * this and now use the encoding of __NetBSD_Version__:\n\t *\n\t *\tMMmmrrpp00\n\t *\n\t * M = major version\n\t * m = minor version\n\t * r = release [\"\",A-Z,Z[A-Z] but numeric]\n\t * p = patchlevel\n\t */\n\tif (desc > 100000000U) {\n\t\tuint32_t ver_patch = (desc / 100) % 100;\n\t\tuint32_t ver_rel = (desc / 10000) % 100;\n\t\tuint32_t ver_min = (desc / 1000000) % 100;\n\t\tuint32_t ver_maj = desc / 100000000;\n\n\t\tif (file_printf(ms, \" %u.%u\", ver_maj, ver_min) == -1)\n\t\t\treturn;\n\t\tif (ver_rel == 0 && ver_patch != 0) {\n\t\t\tif (file_printf(ms, \".%u\", ver_patch) == -1)\n\t\t\t\treturn;\n\t\t} else if (ver_rel != 0) {\n\t\t\twhile (ver_rel > 26) {\n\t\t\t\tif (file_printf(ms, \"Z\") == -1)\n\t\t\t\t\treturn;\n\t\t\t\tver_rel -= 26;\n\t\t\t}\n\t\t\tif (file_printf(ms, \"%c\", 'A' + ver_rel - 1)\n\t\t\t == -1)\n\t\t\t\treturn;\n\t\t}\n\t}\n}\n\nstatic void\ndo_note_freebsd_version(struct magic_set *ms, int swap, void *v)\n{\n\tuint32_t desc;\n\n\t(void)memcpy(&desc, v, sizeof(desc));\n\tdesc = elf_getu32(swap, desc);\n\tif (file_printf(ms, \", for FreeBSD\") == -1)\n\t\treturn;\n\n\t/*\n\t * Contents is __FreeBSD_version, whose relation to OS\n\t * versions is defined by a huge table in the Porter's\n\t * Handbook. This is the general scheme:\n\t * \n\t * Releases:\n\t * \tMmp000 (before 4.10)\n\t * \tMmi0p0 (before 5.0)\n\t * \tMmm0p0\n\t * \n\t * Development branches:\n\t * \tMmpxxx (before 4.6)\n\t * \tMmp1xx (before 4.10)\n\t * \tMmi1xx (before 5.0)\n\t * \tM000xx (pre-M.0)\n\t * \tMmm1xx\n\t * \n\t * M = major version\n\t * m = minor version\n\t * i = minor version increment (491000 -> 4.10)\n\t * p = patchlevel\n\t * x = revision\n\t * \n\t * The first release of FreeBSD to use ELF by default\n\t * was version 3.0.\n\t */\n\tif (desc == 460002) {\n\t\tif (file_printf(ms, \" 4.6.2\") == -1)\n\t\t\treturn;\n\t} else if (desc < 460100) {\n\t\tif (file_printf(ms, \" %d.%d\", desc / 100000,\n\t\t desc / 10000 % 10) == -1)\n\t\t\treturn;\n\t\tif (desc / 1000 % 10 > 0)\n\t\t\tif (file_printf(ms, \".%d\", desc / 1000 % 10) == -1)\n\t\t\t\treturn;\n\t\tif ((desc % 1000 > 0) || (desc % 100000 == 0))\n\t\t\tif (file_printf(ms, \" (%d)\", desc) == -1)\n\t\t\t\treturn;\n\t} else if (desc < 500000) {\n\t\tif (file_printf(ms, \" %d.%d\", desc / 100000,\n\t\t desc / 10000 % 10 + desc / 1000 % 10) == -1)\n\t\t\treturn;\n\t\tif (desc / 100 % 10 > 0) {\n\t\t\tif (file_printf(ms, \" (%d)\", desc) == -1)\n\t\t\t\treturn;\n\t\t} else if (desc / 10 % 10 > 0) {\n\t\t\tif (file_printf(ms, \".%d\", desc / 10 % 10) == -1)\n\t\t\t\treturn;\n\t\t}\n\t} else {\n\t\tif (file_printf(ms, \" %d.%d\", desc / 100000,\n\t\t desc / 1000 % 100) == -1)\n\t\t\treturn;\n\t\tif ((desc / 100 % 10 > 0) ||\n\t\t (desc % 100000 / 100 == 0)) {\n\t\t\tif (file_printf(ms, \" (%d)\", desc) == -1)\n\t\t\t\treturn;\n\t\t} else if (desc / 10 % 10 > 0) {\n\t\t\tif (file_printf(ms, \".%d\", desc / 10 % 10) == -1)\n\t\t\t\treturn;\n\t\t}\n\t}\n}\n\nprivate size_t\ndonote(struct magic_set *ms, void *vbuf, size_t offset, size_t size,\n int clazz, int swap, size_t align, int *flags)\n{\n\tElf32_Nhdr nh32;\n\tElf64_Nhdr nh64;\n\tsize_t noff, doff;\n#ifdef ELFCORE\n\tint os_style = -1;\n#endif\n\tuint32_t namesz, descsz;\n\tunsigned char *nbuf = CAST(unsigned char *, vbuf);\n\tchar sbuf[512];\n\n\tif (xnh_sizeof + offset > size) {\n\t\t/*\n\t\t * We're out of note headers.\n\t\t */\n\t\treturn xnh_sizeof + offset;\n\t}\n\n\t(void)memcpy(xnh_addr, &nbuf[offset], xnh_sizeof);\n\toffset += xnh_sizeof;\n\n\tnamesz = xnh_namesz;\n\tdescsz = xnh_descsz;\n\tif ((namesz == 0) && (descsz == 0)) {\n\t\t/*\n\t\t * We're out of note headers.\n\t\t */\n\t\treturn (offset >= size) ? offset : size;\n\t}\n\n\tif (namesz & 0x80000000) {\n\t (void)file_printf(ms, \", bad note name size 0x%lx\",\n\t\t(unsigned long)namesz);\n\t return 0;\n\t}\n\n\tif (descsz & 0x80000000) {\n\t (void)file_printf(ms, \", bad note description size 0x%lx\",\n\t\t(unsigned long)descsz);\n\t return 0;\n\t}\n\n\n\tnoff = offset;\n\tdoff = ELF_ALIGN(offset + namesz);\n\n\tif (offset + namesz > size) {\n\t\t/*\n\t\t * We're past the end of the buffer.\n\t\t */\n\t\treturn doff;\n\t}\n\n\toffset = ELF_ALIGN(doff + descsz);\n\tif (doff + descsz > size) {\n\t\t/*\n\t\t * We're past the end of the buffer.\n\t\t */\n\t\treturn (offset >= size) ? offset : size;\n\t}\n\n\tif ((*flags & (FLAGS_DID_NOTE|FLAGS_DID_BUILD_ID)) ==\n\t (FLAGS_DID_NOTE|FLAGS_DID_BUILD_ID))\n\t\tgoto core;\n\n\tif (namesz == 5 && strcmp((char *)&nbuf[noff], \"SuSE\") == 0 &&\n\t xnh_type == NT_GNU_VERSION && descsz == 2) {\n\t file_printf(ms, \", for SuSE %d.%d\", nbuf[doff], nbuf[doff + 1]);\n\t}\n\tif (namesz == 4 && strcmp((char *)&nbuf[noff], \"GNU\") == 0 &&\n\t xnh_type == NT_GNU_VERSION && descsz == 16) {\n\t\tuint32_t desc[4];\n\t\t(void)memcpy(desc, &nbuf[doff], sizeof(desc));\n\n\t\tif (file_printf(ms, \", for GNU/\") == -1)\n\t\t\treturn size;\n\t\tswitch (elf_getu32(swap, desc[0])) {\n\t\tcase GNU_OS_LINUX:\n\t\t\tif (file_printf(ms, \"Linux\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase GNU_OS_HURD:\n\t\t\tif (file_printf(ms, \"Hurd\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase GNU_OS_SOLARIS:\n\t\t\tif (file_printf(ms, \"Solaris\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase GNU_OS_KFREEBSD:\n\t\t\tif (file_printf(ms, \"kFreeBSD\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase GNU_OS_KNETBSD:\n\t\t\tif (file_printf(ms, \"kNetBSD\") == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (file_printf(ms, \"\") == -1)\n\t\t\t\treturn size; \n\t\t}\n\t\tif (file_printf(ms, \" %d.%d.%d\", elf_getu32(swap, desc[1]),\n\t\t elf_getu32(swap, desc[2]), elf_getu32(swap, desc[3])) == -1)\n\t\t\treturn size;\n\t\t*flags |= FLAGS_DID_NOTE;\n\t\treturn size;\n\t}\n\n\tif (namesz == 4 && strcmp((char *)&nbuf[noff], \"GNU\") == 0 &&\n\t xnh_type == NT_GNU_BUILD_ID && (descsz == 16 || descsz == 20)) {\n\t uint8_t desc[20];\n\t uint32_t i;\n\t if (file_printf(ms, \", BuildID[%s]=\", descsz == 16 ? \"md5/uuid\" :\n\t\t\"sha1\") == -1)\n\t\t return size;\n\t (void)memcpy(desc, &nbuf[doff], descsz);\n\t for (i = 0; i < descsz; i++)\n\t\tif (file_printf(ms, \"%02x\", desc[i]) == -1)\n\t\t return size;\n\t *flags |= FLAGS_DID_BUILD_ID;\n\t}\n\n\tif (namesz == 4 && strcmp((char *)&nbuf[noff], \"PaX\") == 0 &&\n\t xnh_type == NT_NETBSD_PAX && descsz == 4) {\n\t\tstatic const char *pax[] = {\n\t\t \"+mprotect\",\n\t\t \"-mprotect\",\n\t\t \"+segvguard\",\n\t\t \"-segvguard\",\n\t\t \"+ASLR\",\n\t\t \"-ASLR\",\n\t\t};\n\t\tuint32_t desc;\n\t\tsize_t i;\n\t\tint did = 0;\n\n\t\t(void)memcpy(&desc, &nbuf[doff], sizeof(desc));\n\t\tdesc = elf_getu32(swap, desc);\n\n\t\tif (desc && file_printf(ms, \", PaX: \") == -1)\n\t\t\treturn size;\n\n\t\tfor (i = 0; i < __arraycount(pax); i++) {\n\t\t\tif (((1 << i) & desc) == 0)\n\t\t\t\tcontinue;\n\t\t\tif (file_printf(ms, \"%s%s\", did++ ? \",\" : \"\",\n\t\t\t pax[i]) == -1)\n\t\t\t\treturn size;\n\t\t}\n\t}\n\n\tif (namesz == 7 && strcmp((char *)&nbuf[noff], \"NetBSD\") == 0) {\n\t\tswitch (xnh_type) {\n\t\tcase NT_NETBSD_VERSION:\n\t\t\tif (descsz == 4) {\n\t\t\t\tdo_note_netbsd_version(ms, swap, &nbuf[doff]);\n\t\t\t\t*flags |= FLAGS_DID_NOTE;\n\t\t\t\treturn size;\n\t\t\t}\n\t\t\tbreak;\n\t\tcase NT_NETBSD_MARCH:\n\t\t\tif (file_printf(ms, \", compiled for: %.*s\", (int)descsz,\n\t\t\t (const char *)&nbuf[doff]) == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tcase NT_NETBSD_CMODEL:\n\t\t\tif (file_printf(ms, \", compiler model: %.*s\",\n\t\t\t (int)descsz, (const char *)&nbuf[doff]) == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (file_printf(ms, \", note=%u\", xnh_type) == -1)\n\t\t\t\treturn size;\n\t\t\tbreak;\n\t\t}\n\t\treturn size;\n\t}\n\n\tif (namesz == 8 && strcmp((char *)&nbuf[noff], \"FreeBSD\") == 0) {\n\t \tif (xnh_type == NT_FREEBSD_VERSION && descsz == 4) {\n\t\t\tdo_note_freebsd_version(ms, swap, &nbuf[doff]);\n\t\t\t*flags |= FLAGS_DID_NOTE;\n\t\t\treturn size;\n\t\t}\n\t}\n\n\tif (namesz == 8 && strcmp((char *)&nbuf[noff], \"OpenBSD\") == 0 &&\n\t xnh_type == NT_OPENBSD_VERSION && descsz == 4) {\n\t\tif (file_printf(ms, \", for OpenBSD\") == -1)\n\t\t\treturn size;\n\t\t/* Content of note is always 0 */\n\t\t*flags |= FLAGS_DID_NOTE;\n\t\treturn size;\n\t}\n\n\tif (namesz == 10 && strcmp((char *)&nbuf[noff], \"DragonFly\") == 0 &&\n\t xnh_type == NT_DRAGONFLY_VERSION && descsz == 4) {\n\t\tuint32_t desc;\n\t\tif (file_printf(ms, \", for DragonFly\") == -1)\n\t\t\treturn size;\n\t\t(void)memcpy(&desc, &nbuf[doff], sizeof(desc));\n\t\tdesc = elf_getu32(swap, desc);\n\t\tif (file_printf(ms, \" %d.%d.%d\", desc / 100000,\n\t\t desc / 10000 % 10, desc % 10000) == -1)\n\t\t\treturn size;\n\t\t*flags |= FLAGS_DID_NOTE;\n\t\treturn size;\n\t}\n\ncore:\n\t/*\n\t * Sigh. The 2.0.36 kernel in Debian 2.1, at\n\t * least, doesn't correctly implement name\n\t * sections, in core dumps, as specified by\n\t * the \"Program Linking\" section of \"UNIX(R) System\n\t * V Release 4 Programmer's Guide: ANSI C and\n\t * Programming Support Tools\", because my copy\n\t * clearly says \"The first 'namesz' bytes in 'name'\n\t * contain a *null-terminated* [emphasis mine]\n\t * character representation of the entry's owner\n\t * or originator\", but the 2.0.36 kernel code\n\t * doesn't include the terminating null in the\n\t * name....\n\t */\n\tif ((namesz == 4 && strncmp((char *)&nbuf[noff], \"CORE\", 4) == 0) ||\n\t (namesz == 5 && strcmp((char *)&nbuf[noff], \"CORE\") == 0)) {\n\t\tos_style = OS_STYLE_SVR4;\n\t} \n\n\tif ((namesz == 8 && strcmp((char *)&nbuf[noff], \"FreeBSD\") == 0)) {\n\t\tos_style = OS_STYLE_FREEBSD;\n\t}\n\n\tif ((namesz >= 11 && strncmp((char *)&nbuf[noff], \"NetBSD-CORE\", 11)\n\t == 0)) {\n\t\tos_style = OS_STYLE_NETBSD;\n\t}\n\n#ifdef ELFCORE\n\tif ((*flags & FLAGS_DID_CORE) != 0)\n\t\treturn size;\n\n\tif (os_style != -1 && (*flags & FLAGS_DID_CORE_STYLE) == 0) {\n\t\tif (file_printf(ms, \", %s-style\", os_style_names[os_style])\n\t\t == -1)\n\t\t\treturn size;\n\t\t*flags |= FLAGS_DID_CORE_STYLE;\n\t}\n\n\tswitch (os_style) {\n\tcase OS_STYLE_NETBSD:\n\t\tif (xnh_type == NT_NETBSD_CORE_PROCINFO) {\n\t\t\tuint32_t signo;\n\t\t\t/*\n\t\t\t * Extract the program name. It is at\n\t\t\t * offset 0x7c, and is up to 32-bytes,\n\t\t\t * including the terminating NUL.\n\t\t\t */\n\t\t\tif (file_printf(ms, \", from '%.31s'\",\n\t\t\t file_printable(sbuf, sizeof(sbuf),\n\t\t\t (const char *)&nbuf[doff + 0x7c])) == -1)\n\t\t\t\treturn size;\n\t\t\t\n\t\t\t/*\n\t\t\t * Extract the signal number. It is at\n\t\t\t * offset 0x08.\n\t\t\t */\n\t\t\t(void)memcpy(&signo, &nbuf[doff + 0x08],\n\t\t\t sizeof(signo));\n\t\t\tif (file_printf(ms, \" (signal %u)\",\n\t\t\t elf_getu32(swap, signo)) == -1)\n\t\t\t\treturn size;\n\t\t\t*flags |= FLAGS_DID_CORE;\n\t\t\treturn size;\n\t\t}\n\t\tbreak;\n\n\tdefault:\n\t\tif (xnh_type == NT_PRPSINFO && *flags & FLAGS_IS_CORE) {\n\t\t\tsize_t i, j;\n\t\t\tunsigned char c;\n\t\t\t/*\n\t\t\t * Extract the program name. We assume\n\t\t\t * it to be 16 characters (that's what it\n\t\t\t * is in SunOS 5.x and Linux).\n\t\t\t *\n\t\t\t * Unfortunately, it's at a different offset\n\t\t\t * in various OSes, so try multiple offsets.\n\t\t\t * If the characters aren't all printable,\n\t\t\t * reject it.\n\t\t\t */\n\t\t\tfor (i = 0; i < NOFFSETS; i++) {\n\t\t\t\tunsigned char *cname, *cp;\n\t\t\t\tsize_t reloffset = prpsoffsets(i);\n\t\t\t\tsize_t noffset = doff + reloffset;\n\t\t\t\tsize_t k;\n\t\t\t\tfor (j = 0; j < 16; j++, noffset++,\n\t\t\t\t reloffset++) {\n\t\t\t\t\t/*\n\t\t\t\t\t * Make sure we're not past\n\t\t\t\t\t * the end of the buffer; if\n\t\t\t\t\t * we are, just give up.\n\t\t\t\t\t */\n\t\t\t\t\tif (noffset >= size)\n\t\t\t\t\t\tgoto tryanother;\n\n\t\t\t\t\t/*\n\t\t\t\t\t * Make sure we're not past\n\t\t\t\t\t * the end of the contents;\n\t\t\t\t\t * if we are, this obviously\n\t\t\t\t\t * isn't the right offset.\n\t\t\t\t\t */\n\t\t\t\t\tif (reloffset >= descsz)\n\t\t\t\t\t\tgoto tryanother;\n\n\t\t\t\t\tc = nbuf[noffset];\n\t\t\t\t\tif (c == '\\0') {\n\t\t\t\t\t\t/*\n\t\t\t\t\t\t * A '\\0' at the\n\t\t\t\t\t\t * beginning is\n\t\t\t\t\t\t * obviously wrong.\n\t\t\t\t\t\t * Any other '\\0'\n\t\t\t\t\t\t * means we're done.\n\t\t\t\t\t\t */\n\t\t\t\t\t\tif (j == 0)\n\t\t\t\t\t\t\tgoto tryanother;\n\t\t\t\t\t\telse\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else {\n\t\t\t\t\t\t/*\n\t\t\t\t\t\t * A nonprintable\n\t\t\t\t\t\t * character is also\n\t\t\t\t\t\t * wrong.\n\t\t\t\t\t\t */\n\t\t\t\t\t\tif (!isprint(c) || isquote(c))\n\t\t\t\t\t\t\tgoto tryanother;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\t * Well, that worked.\n\t\t\t\t */\n\n\t\t\t\t/*\n\t\t\t\t * Try next offsets, in case this match is\n\t\t\t\t * in the middle of a string.\n\t\t\t\t */\n\t\t\t\tfor (k = i + 1 ; k < NOFFSETS ; k++) {\n\t\t\t\t\tsize_t no;\n\t\t\t\t\tint adjust = 1;\n\t\t\t\t\tif (prpsoffsets(k) >= prpsoffsets(i))\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tfor (no = doff + prpsoffsets(k);\n\t\t\t\t\t no < doff + prpsoffsets(i); no++)\n\t\t\t\t\t\tadjust = adjust\n\t\t\t\t\t\t && isprint(nbuf[no]);\n\t\t\t\t\tif (adjust)\n\t\t\t\t\t\ti = k;\n\t\t\t\t}\n\n\t\t\t\tcname = (unsigned char *)\n\t\t\t\t &nbuf[doff + prpsoffsets(i)];\n\t\t\t\tfor (cp = cname; *cp && isprint(*cp); cp++)\n\t\t\t\t\tcontinue;\n\t\t\t\t/*\n\t\t\t\t * Linux apparently appends a space at the end\n\t\t\t\t * of the command line: remove it.\n\t\t\t\t */\n\t\t\t\twhile (cp > cname && isspace(cp[-1]))\n\t\t\t\t\tcp--;\n\t\t\t\tif (file_printf(ms, \", from '%.*s'\",\n\t\t\t\t (int)(cp - cname), cname) == -1)\n\t\t\t\t\treturn size;\n\t\t\t\t*flags |= FLAGS_DID_CORE;\n\t\t\t\treturn size;\n\n\t\t\ttryanother:\n\t\t\t\t;\n\t\t\t}\n\t\t}\n\t\tbreak;\n\t}\n#endif\n\treturn offset;\n}\n\n/* SunOS 5.x hardware capability descriptions */\ntypedef struct cap_desc {\n\tuint64_t cd_mask;\n\tconst char *cd_name;\n} cap_desc_t;\n\nstatic const cap_desc_t cap_desc_sparc[] = {\n\t{ AV_SPARC_MUL32,\t\t\"MUL32\" },\n\t{ AV_SPARC_DIV32,\t\t\"DIV32\" },\n\t{ AV_SPARC_FSMULD,\t\t\"FSMULD\" },\n\t{ AV_SPARC_V8PLUS,\t\t\"V8PLUS\" },\n\t{ AV_SPARC_POPC,\t\t\"POPC\" },\n\t{ AV_SPARC_VIS,\t\t\t\"VIS\" },\n\t{ AV_SPARC_VIS2,\t\t\"VIS2\" },\n\t{ AV_SPARC_ASI_BLK_INIT,\t\"ASI_BLK_INIT\" },\n\t{ AV_SPARC_FMAF,\t\t\"FMAF\" },\n\t{ AV_SPARC_FJFMAU,\t\t\"FJFMAU\" },\n\t{ AV_SPARC_IMA,\t\t\t\"IMA\" },\n\t{ 0, NULL }\n};\n\nstatic const cap_desc_t cap_desc_386[] = {\n\t{ AV_386_FPU,\t\t\t\"FPU\" },\n\t{ AV_386_TSC,\t\t\t\"TSC\" },\n\t{ AV_386_CX8,\t\t\t\"CX8\" },\n\t{ AV_386_SEP,\t\t\t\"SEP\" },\n\t{ AV_386_AMD_SYSC,\t\t\"AMD_SYSC\" },\n\t{ AV_386_CMOV,\t\t\t\"CMOV\" },\n\t{ AV_386_MMX,\t\t\t\"MMX\" },\n\t{ AV_386_AMD_MMX,\t\t\"AMD_MMX\" },\n\t{ AV_386_AMD_3DNow,\t\t\"AMD_3DNow\" },\n\t{ AV_386_AMD_3DNowx,\t\t\"AMD_3DNowx\" },\n\t{ AV_386_FXSR,\t\t\t\"FXSR\" },\n\t{ AV_386_SSE,\t\t\t\"SSE\" },\n\t{ AV_386_SSE2,\t\t\t\"SSE2\" },\n\t{ AV_386_PAUSE,\t\t\t\"PAUSE\" },\n\t{ AV_386_SSE3,\t\t\t\"SSE3\" },\n\t{ AV_386_MON,\t\t\t\"MON\" },\n\t{ AV_386_CX16,\t\t\t\"CX16\" },\n\t{ AV_386_AHF,\t\t\t\"AHF\" },\n\t{ AV_386_TSCP,\t\t\t\"TSCP\" },\n\t{ AV_386_AMD_SSE4A,\t\t\"AMD_SSE4A\" },\n\t{ AV_386_POPCNT,\t\t\"POPCNT\" },\n\t{ AV_386_AMD_LZCNT,\t\t\"AMD_LZCNT\" },\n\t{ AV_386_SSSE3,\t\t\t\"SSSE3\" },\n\t{ AV_386_SSE4_1,\t\t\"SSE4.1\" },\n\t{ AV_386_SSE4_2,\t\t\"SSE4.2\" },\n\t{ 0, NULL }\n};\n\nprivate int\ndoshn(struct magic_set *ms, int clazz, int swap, int fd, off_t off, int num,\n size_t size, off_t fsize, int *flags, int mach, int strtab)\n{\n\tElf32_Shdr sh32;\n\tElf64_Shdr sh64;\n\tint stripped = 1;\n\tsize_t nbadcap = 0;\n\tvoid *nbuf;\n\toff_t noff, coff, name_off;\n\tuint64_t cap_hw1 = 0;\t/* SunOS 5.x hardware capabilites */\n\tuint64_t cap_sf1 = 0;\t/* SunOS 5.x software capabilites */\n\tchar name[50];\n\tssize_t namesize;\n\n\tif (size != xsh_sizeof) {\n\t\tif (file_printf(ms, \", corrupted section header size\") == -1)\n\t\t\treturn -1;\n\t\treturn 0;\n\t}\n\n\t/* Read offset of name section to be able to read section names later */\n\tif (pread(fd, xsh_addr, xsh_sizeof, off + size * strtab) < (ssize_t)xsh_sizeof) {\n\t\tfile_badread(ms);\n\t\treturn -1;\n\t}\n\tname_off = xsh_offset;\n\n\tfor ( ; num; num--) {\n\t\t/* Read the name of this section. */\n\t\tif ((namesize = pread(fd, name, sizeof(name) - 1, name_off + xsh_name)) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\tname[namesize] = '\\0';\n\t\tif (strcmp(name, \".debug_info\") == 0)\n\t\t\tstripped = 0;\n\n\t\tif (pread(fd, xsh_addr, xsh_sizeof, off) < (ssize_t)xsh_sizeof) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\toff += size;\n\n\t\t/* Things we can determine before we seek */\n\t\tswitch (xsh_type) {\n\t\tcase SHT_SYMTAB:\n#if 0\n\t\tcase SHT_DYNSYM:\n#endif\n\t\t\tstripped = 0;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (fsize != SIZE_UNKNOWN && xsh_offset > fsize) {\n\t\t\t\t/* Perhaps warn here */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\t/* Things we can determine when we seek */\n\t\tswitch (xsh_type) {\n\t\tcase SHT_NOTE:\n\t\t\tif ((nbuf = malloc(xsh_size)) == NULL) {\n\t\t\t\tfile_error(ms, errno, \"Cannot allocate memory\"\n\t\t\t\t \" for note\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (pread(fd, nbuf, xsh_size, xsh_offset) < (ssize_t)xsh_size) {\n\t\t\t\tfile_badread(ms);\n\t\t\t\tfree(nbuf);\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tnoff = 0;\n\t\t\tfor (;;) {\n\t\t\t\tif (noff >= (off_t)xsh_size)\n\t\t\t\t\tbreak;\n\t\t\t\tnoff = donote(ms, nbuf, (size_t)noff,\n\t\t\t\t xsh_size, clazz, swap, 4, flags);\n\t\t\t\tif (noff == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfree(nbuf);\n\t\t\tbreak;\n\t\tcase SHT_SUNW_cap:\n\t\t\tswitch (mach) {\n\t\t\tcase EM_SPARC:\n\t\t\tcase EM_SPARCV9:\n\t\t\tcase EM_IA_64:\n\t\t\tcase EM_386:\n\t\t\tcase EM_AMD64:\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tgoto skip;\n\t\t\t}\n\n\t\t\tif (nbadcap > 5)\n\t\t\t\tbreak;\n\t\t\tif (lseek(fd, xsh_offset, SEEK_SET) == (off_t)-1) {\n\t\t\t\tfile_badseek(ms);\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tcoff = 0;\n\t\t\tfor (;;) {\n\t\t\t\tElf32_Cap cap32;\n\t\t\t\tElf64_Cap cap64;\n\t\t\t\tchar cbuf[/*CONSTCOND*/\n\t\t\t\t MAX(sizeof cap32, sizeof cap64)];\n\t\t\t\tif ((coff += xcap_sizeof) > (off_t)xsh_size)\n\t\t\t\t\tbreak;\n\t\t\t\tif (read(fd, cbuf, (size_t)xcap_sizeof) !=\n\t\t\t\t (ssize_t)xcap_sizeof) {\n\t\t\t\t\tfile_badread(ms);\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t\tif (cbuf[0] == 'A') {\n#ifdef notyet\n\t\t\t\t\tchar *p = cbuf + 1;\n\t\t\t\t\tuint32_t len, tag;\n\t\t\t\t\tmemcpy(&len, p, sizeof(len));\n\t\t\t\t\tp += 4;\n\t\t\t\t\tlen = getu32(swap, len);\n\t\t\t\t\tif (memcmp(\"gnu\", p, 3) != 0) {\n\t\t\t\t\t if (file_printf(ms,\n\t\t\t\t\t\t\", unknown capability %.3s\", p)\n\t\t\t\t\t\t== -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t break;\n\t\t\t\t\t}\n\t\t\t\t\tp += strlen(p) + 1;\n\t\t\t\t\ttag = *p++;\n\t\t\t\t\tmemcpy(&len, p, sizeof(len));\n\t\t\t\t\tp += 4;\n\t\t\t\t\tlen = getu32(swap, len);\n\t\t\t\t\tif (tag != 1) {\n\t\t\t\t\t if (file_printf(ms, \", unknown gnu\"\n\t\t\t\t\t\t\" capability tag %d\", tag)\n\t\t\t\t\t\t== -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t break;\n\t\t\t\t\t}\n\t\t\t\t\t// gnu attributes \n#endif\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t(void)memcpy(xcap_addr, cbuf, xcap_sizeof);\n\t\t\t\tswitch (xcap_tag) {\n\t\t\t\tcase CA_SUNW_NULL:\n\t\t\t\t\tbreak;\n\t\t\t\tcase CA_SUNW_HW_1:\n\t\t\t\t\tcap_hw1 |= xcap_val;\n\t\t\t\t\tbreak;\n\t\t\t\tcase CA_SUNW_SF_1:\n\t\t\t\t\tcap_sf1 |= xcap_val;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tif (file_printf(ms,\n\t\t\t\t\t \", with unknown capability \"\n\t\t\t\t\t \"0x%\" INT64_T_FORMAT \"x = 0x%\"\n\t\t\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t\t\t (unsigned long long)xcap_tag,\n\t\t\t\t\t (unsigned long long)xcap_val) == -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\tif (nbadcap++ > 2)\n\t\t\t\t\t\tcoff = xsh_size;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t/*FALLTHROUGH*/\n\t\tskip:\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (file_printf(ms, \", %sstripped\", stripped ? \"\" : \"not \") == -1)\n\t\treturn -1;\n\tif (cap_hw1) {\n\t\tconst cap_desc_t *cdp;\n\t\tswitch (mach) {\n\t\tcase EM_SPARC:\n\t\tcase EM_SPARC32PLUS:\n\t\tcase EM_SPARCV9:\n\t\t\tcdp = cap_desc_sparc;\n\t\t\tbreak;\n\t\tcase EM_386:\n\t\tcase EM_IA_64:\n\t\tcase EM_AMD64:\n\t\t\tcdp = cap_desc_386;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tcdp = NULL;\n\t\t\tbreak;\n\t\t}\n\t\tif (file_printf(ms, \", uses\") == -1)\n\t\t\treturn -1;\n\t\tif (cdp) {\n\t\t\twhile (cdp->cd_name) {\n\t\t\t\tif (cap_hw1 & cdp->cd_mask) {\n\t\t\t\t\tif (file_printf(ms,\n\t\t\t\t\t \" %s\", cdp->cd_name) == -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\tcap_hw1 &= ~cdp->cd_mask;\n\t\t\t\t}\n\t\t\t\t++cdp;\n\t\t\t}\n\t\t\tif (cap_hw1)\n\t\t\t\tif (file_printf(ms,\n\t\t\t\t \" unknown hardware capability 0x%\"\n\t\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t\t (unsigned long long)cap_hw1) == -1)\n\t\t\t\t\treturn -1;\n\t\t} else {\n\t\t\tif (file_printf(ms,\n\t\t\t \" hardware capability 0x%\" INT64_T_FORMAT \"x\",\n\t\t\t (unsigned long long)cap_hw1) == -1)\n\t\t\t\treturn -1;\n\t\t}\n\t}\n\tif (cap_sf1) {\n\t\tif (cap_sf1 & SF1_SUNW_FPUSED) {\n\t\t\tif (file_printf(ms,\n\t\t\t (cap_sf1 & SF1_SUNW_FPKNWN)\n\t\t\t ? \", uses frame pointer\"\n\t\t\t : \", not known to use frame pointer\") == -1)\n\t\t\t\treturn -1;\n\t\t}\n\t\tcap_sf1 &= ~SF1_SUNW_MASK;\n\t\tif (cap_sf1)\n\t\t\tif (file_printf(ms,\n\t\t\t \", with unknown software capability 0x%\"\n\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t (unsigned long long)cap_sf1) == -1)\n\t\t\t\treturn -1;\n\t}\n\treturn 0;\n}\n\n/*\n * Look through the program headers of an executable image, searching\n * for a PT_INTERP section; if one is found, it's dynamically linked,\n * otherwise it's statically linked.\n */\nprivate int\ndophn_exec(struct magic_set *ms, int clazz, int swap, int fd, off_t off,\n int num, size_t size, off_t fsize, int *flags, int sh_num)\n{\n\tElf32_Phdr ph32;\n\tElf64_Phdr ph64;\n\tconst char *linking_style = \"statically\";\n\tconst char *interp = \"\";\n\tunsigned char nbuf[BUFSIZ];\n\tchar ibuf[BUFSIZ];\n\tssize_t bufsize;\n\tsize_t offset, align, len;\n\t\n\tif (size != xph_sizeof) {\n\t\tif (file_printf(ms, \", corrupted program header size\") == -1)\n\t\t\treturn -1;\n\t\treturn 0;\n\t}\n\n \tfor ( ; num; num--) {\n\t\tif (pread(fd, xph_addr, xph_sizeof, off) < (ssize_t)xph_sizeof) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\n\t\toff += size;\n\t\tbufsize = 0;\n\t\talign = 4;\n\n\t\t/* Things we can determine before we seek */\n\t\tswitch (xph_type) {\n\t\tcase PT_DYNAMIC:\n\t\t\tlinking_style = \"dynamically\";\n\t\t\tbreak;\n\t\tcase PT_NOTE:\n\t\t\tif (sh_num)\t/* Did this through section headers */\n\t\t\t\tcontinue;\n\t\t\tif (((align = xph_align) & 0x80000000UL) != 0 ||\n\t\t\t align < 4) {\n\t\t\t\tif (file_printf(ms, \n\t\t\t\t \", invalid note alignment 0x%lx\",\n\t\t\t\t (unsigned long)align) == -1)\n\t\t\t\t\treturn -1;\n\t\t\t\talign = 4;\n\t\t\t}\n\t\t\t/*FALLTHROUGH*/\n\t\tcase PT_INTERP:\n\t\t\tlen = xph_filesz < sizeof(nbuf) ? xph_filesz\n\t\t\t : sizeof(nbuf);\n\t\t\tbufsize = pread(fd, nbuf, len, xph_offset);\n\t\t\tif (bufsize == -1) {\n\t\t\t\tfile_badread(ms);\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (fsize != SIZE_UNKNOWN && xph_offset > fsize) {\n\t\t\t\t/* Maybe warn here? */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\t/* Things we can determine when we seek */\n\t\tswitch (xph_type) {\n\t\tcase PT_INTERP:\n\t\t\tif (bufsize && nbuf[0]) {\n\t\t\t\tnbuf[bufsize - 1] = '\\0';\n\t\t\t\tinterp = (const char *)nbuf;\n\t\t\t} else\n\t\t\t\tinterp = \"*empty*\";\n\t\t\tbreak;\n\t\tcase PT_NOTE:\n\t\t\t/*\n\t\t\t * This is a PT_NOTE section; loop through all the notes\n\t\t\t * in the section.\n\t\t\t */\n\t\t\toffset = 0;\n\t\t\tfor (;;) {\n\t\t\t\tif (offset >= (size_t)bufsize)\n\t\t\t\t\tbreak;\n\t\t\t\toffset = donote(ms, nbuf, offset,\n\t\t\t\t (size_t)bufsize, clazz, swap, align,\n\t\t\t\t flags);\n\t\t\t\tif (offset == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (file_printf(ms, \", %s linked\", linking_style)\n\t == -1)\n\t\treturn -1;\n\tif (interp[0])\n\t\tif (file_printf(ms, \", interpreter %s\",\n\t\t file_printable(ibuf, sizeof(ibuf), interp)) == -1)\n\t\t\treturn -1;\n\treturn 0;\n}\n\n\nprotected int\nfile_tryelf(struct magic_set *ms, int fd, const unsigned char *buf,\n size_t nbytes)\n{\n\tunion {\n\t\tint32_t l;\n\t\tchar c[sizeof (int32_t)];\n\t} u;\n\tint clazz;\n\tint swap;\n\tstruct stat st;\n\toff_t fsize;\n\tint flags = 0;\n\tElf32_Ehdr elf32hdr;\n\tElf64_Ehdr elf64hdr;\n\tuint16_t type, phnum, shnum;\n\n\tif (ms->flags & (MAGIC_MIME|MAGIC_APPLE))\n\t\treturn 0;\n\t/*\n\t * ELF executables have multiple section headers in arbitrary\n\t * file locations and thus file(1) cannot determine it from easily.\n\t * Instead we traverse thru all section headers until a symbol table\n\t * one is found or else the binary is stripped.\n\t * Return immediately if it's not ELF (so we avoid pipe2file unless needed).\n\t */\n\tif (buf[EI_MAG0] != ELFMAG0\n\t || (buf[EI_MAG1] != ELFMAG1 && buf[EI_MAG1] != OLFMAG1)\n\t || buf[EI_MAG2] != ELFMAG2 || buf[EI_MAG3] != ELFMAG3)\n\t\treturn 0;\n\n\t/*\n\t * If we cannot seek, it must be a pipe, socket or fifo.\n\t */\n\tif((lseek(fd, (off_t)0, SEEK_SET) == (off_t)-1) && (errno == ESPIPE))\n\t\tfd = file_pipe2file(ms, fd, buf, nbytes);\n\n\tif (fstat(fd, &st) == -1) {\n \t\tfile_badread(ms);\n\t\treturn -1;\n\t}\n\tif (S_ISREG(st.st_mode) || st.st_size != 0)\n\t\tfsize = st.st_size;\n\telse\n\t\tfsize = SIZE_UNKNOWN;\n\n\tclazz = buf[EI_CLASS];\n\n\tswitch (clazz) {\n\tcase ELFCLASS32:\n#undef elf_getu\n#define elf_getu(a, b)\telf_getu32(a, b)\n#undef elfhdr\n#define elfhdr elf32hdr\n#include \"elfclass.h\"\n\tcase ELFCLASS64:\n#undef elf_getu\n#define elf_getu(a, b)\telf_getu64(a, b)\n#undef elfhdr\n#define elfhdr elf64hdr\n#include \"elfclass.h\"\n\tdefault:\n\t if (file_printf(ms, \", unknown class %d\", clazz) == -1)\n\t\t return -1;\n\t break;\n\t}\n\treturn 0;\n}\n#endif\n"},"func_before":{"kind":"string","value":"doshn(struct magic_set *ms, int clazz, int swap, int fd, off_t off, int num,\n size_t size, off_t fsize, int *flags, int mach, int strtab)\n{\n\tElf32_Shdr sh32;\n\tElf64_Shdr sh64;\n\tint stripped = 1;\n\tsize_t nbadcap = 0;\n\tvoid *nbuf;\n\toff_t noff, coff, name_off;\n\tuint64_t cap_hw1 = 0;\t/* SunOS 5.x hardware capabilites */\n\tuint64_t cap_sf1 = 0;\t/* SunOS 5.x software capabilites */\n\tchar name[50];\n\n\tif (size != xsh_sizeof) {\n\t\tif (file_printf(ms, \", corrupted section header size\") == -1)\n\t\t\treturn -1;\n\t\treturn 0;\n\t}\n\n\t/* Read offset of name section to be able to read section names later */\n\tif (pread(fd, xsh_addr, xsh_sizeof, off + size * strtab) == -1) {\n\t\tfile_badread(ms);\n\t\treturn -1;\n\t}\n\tname_off = xsh_offset;\n\n\tfor ( ; num; num--) {\n\t\t/* Read the name of this section. */\n\t\tif (pread(fd, name, sizeof(name), name_off + xsh_name) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\tname[sizeof(name) - 1] = '\\0';\n\t\tif (strcmp(name, \".debug_info\") == 0)\n\t\t\tstripped = 0;\n\n\t\tif (pread(fd, xsh_addr, xsh_sizeof, off) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\toff += size;\n\n\t\t/* Things we can determine before we seek */\n\t\tswitch (xsh_type) {\n\t\tcase SHT_SYMTAB:\n#if 0\n\t\tcase SHT_DYNSYM:\n#endif\n\t\t\tstripped = 0;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (fsize != SIZE_UNKNOWN && xsh_offset > fsize) {\n\t\t\t\t/* Perhaps warn here */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\t/* Things we can determine when we seek */\n\t\tswitch (xsh_type) {\n\t\tcase SHT_NOTE:\n\t\t\tif ((nbuf = malloc(xsh_size)) == NULL) {\n\t\t\t\tfile_error(ms, errno, \"Cannot allocate memory\"\n\t\t\t\t \" for note\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (pread(fd, nbuf, xsh_size, xsh_offset) == -1) {\n\t\t\t\tfile_badread(ms);\n\t\t\t\tfree(nbuf);\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tnoff = 0;\n\t\t\tfor (;;) {\n\t\t\t\tif (noff >= (off_t)xsh_size)\n\t\t\t\t\tbreak;\n\t\t\t\tnoff = donote(ms, nbuf, (size_t)noff,\n\t\t\t\t xsh_size, clazz, swap, 4, flags);\n\t\t\t\tif (noff == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfree(nbuf);\n\t\t\tbreak;\n\t\tcase SHT_SUNW_cap:\n\t\t\tswitch (mach) {\n\t\t\tcase EM_SPARC:\n\t\t\tcase EM_SPARCV9:\n\t\t\tcase EM_IA_64:\n\t\t\tcase EM_386:\n\t\t\tcase EM_AMD64:\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tgoto skip;\n\t\t\t}\n\n\t\t\tif (nbadcap > 5)\n\t\t\t\tbreak;\n\t\t\tif (lseek(fd, xsh_offset, SEEK_SET) == (off_t)-1) {\n\t\t\t\tfile_badseek(ms);\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tcoff = 0;\n\t\t\tfor (;;) {\n\t\t\t\tElf32_Cap cap32;\n\t\t\t\tElf64_Cap cap64;\n\t\t\t\tchar cbuf[/*CONSTCOND*/\n\t\t\t\t MAX(sizeof cap32, sizeof cap64)];\n\t\t\t\tif ((coff += xcap_sizeof) > (off_t)xsh_size)\n\t\t\t\t\tbreak;\n\t\t\t\tif (read(fd, cbuf, (size_t)xcap_sizeof) !=\n\t\t\t\t (ssize_t)xcap_sizeof) {\n\t\t\t\t\tfile_badread(ms);\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t\tif (cbuf[0] == 'A') {\n#ifdef notyet\n\t\t\t\t\tchar *p = cbuf + 1;\n\t\t\t\t\tuint32_t len, tag;\n\t\t\t\t\tmemcpy(&len, p, sizeof(len));\n\t\t\t\t\tp += 4;\n\t\t\t\t\tlen = getu32(swap, len);\n\t\t\t\t\tif (memcmp(\"gnu\", p, 3) != 0) {\n\t\t\t\t\t if (file_printf(ms,\n\t\t\t\t\t\t\", unknown capability %.3s\", p)\n\t\t\t\t\t\t== -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t break;\n\t\t\t\t\t}\n\t\t\t\t\tp += strlen(p) + 1;\n\t\t\t\t\ttag = *p++;\n\t\t\t\t\tmemcpy(&len, p, sizeof(len));\n\t\t\t\t\tp += 4;\n\t\t\t\t\tlen = getu32(swap, len);\n\t\t\t\t\tif (tag != 1) {\n\t\t\t\t\t if (file_printf(ms, \", unknown gnu\"\n\t\t\t\t\t\t\" capability tag %d\", tag)\n\t\t\t\t\t\t== -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t break;\n\t\t\t\t\t}\n\t\t\t\t\t// gnu attributes \n#endif\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t(void)memcpy(xcap_addr, cbuf, xcap_sizeof);\n\t\t\t\tswitch (xcap_tag) {\n\t\t\t\tcase CA_SUNW_NULL:\n\t\t\t\t\tbreak;\n\t\t\t\tcase CA_SUNW_HW_1:\n\t\t\t\t\tcap_hw1 |= xcap_val;\n\t\t\t\t\tbreak;\n\t\t\t\tcase CA_SUNW_SF_1:\n\t\t\t\t\tcap_sf1 |= xcap_val;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tif (file_printf(ms,\n\t\t\t\t\t \", with unknown capability \"\n\t\t\t\t\t \"0x%\" INT64_T_FORMAT \"x = 0x%\"\n\t\t\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t\t\t (unsigned long long)xcap_tag,\n\t\t\t\t\t (unsigned long long)xcap_val) == -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\tif (nbadcap++ > 2)\n\t\t\t\t\t\tcoff = xsh_size;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t/*FALLTHROUGH*/\n\t\tskip:\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (file_printf(ms, \", %sstripped\", stripped ? \"\" : \"not \") == -1)\n\t\treturn -1;\n\tif (cap_hw1) {\n\t\tconst cap_desc_t *cdp;\n\t\tswitch (mach) {\n\t\tcase EM_SPARC:\n\t\tcase EM_SPARC32PLUS:\n\t\tcase EM_SPARCV9:\n\t\t\tcdp = cap_desc_sparc;\n\t\t\tbreak;\n\t\tcase EM_386:\n\t\tcase EM_IA_64:\n\t\tcase EM_AMD64:\n\t\t\tcdp = cap_desc_386;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tcdp = NULL;\n\t\t\tbreak;\n\t\t}\n\t\tif (file_printf(ms, \", uses\") == -1)\n\t\t\treturn -1;\n\t\tif (cdp) {\n\t\t\twhile (cdp->cd_name) {\n\t\t\t\tif (cap_hw1 & cdp->cd_mask) {\n\t\t\t\t\tif (file_printf(ms,\n\t\t\t\t\t \" %s\", cdp->cd_name) == -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\tcap_hw1 &= ~cdp->cd_mask;\n\t\t\t\t}\n\t\t\t\t++cdp;\n\t\t\t}\n\t\t\tif (cap_hw1)\n\t\t\t\tif (file_printf(ms,\n\t\t\t\t \" unknown hardware capability 0x%\"\n\t\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t\t (unsigned long long)cap_hw1) == -1)\n\t\t\t\t\treturn -1;\n\t\t} else {\n\t\t\tif (file_printf(ms,\n\t\t\t \" hardware capability 0x%\" INT64_T_FORMAT \"x\",\n\t\t\t (unsigned long long)cap_hw1) == -1)\n\t\t\t\treturn -1;\n\t\t}\n\t}\n\tif (cap_sf1) {\n\t\tif (cap_sf1 & SF1_SUNW_FPUSED) {\n\t\t\tif (file_printf(ms,\n\t\t\t (cap_sf1 & SF1_SUNW_FPKNWN)\n\t\t\t ? \", uses frame pointer\"\n\t\t\t : \", not known to use frame pointer\") == -1)\n\t\t\t\treturn -1;\n\t\t}\n\t\tcap_sf1 &= ~SF1_SUNW_MASK;\n\t\tif (cap_sf1)\n\t\t\tif (file_printf(ms,\n\t\t\t \", with unknown software capability 0x%\"\n\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t (unsigned long long)cap_sf1) == -1)\n\t\t\t\treturn -1;\n\t}\n\treturn 0;\n}"},"func_after":{"kind":"string","value":"doshn(struct magic_set *ms, int clazz, int swap, int fd, off_t off, int num,\n size_t size, off_t fsize, int *flags, int mach, int strtab)\n{\n\tElf32_Shdr sh32;\n\tElf64_Shdr sh64;\n\tint stripped = 1;\n\tsize_t nbadcap = 0;\n\tvoid *nbuf;\n\toff_t noff, coff, name_off;\n\tuint64_t cap_hw1 = 0;\t/* SunOS 5.x hardware capabilites */\n\tuint64_t cap_sf1 = 0;\t/* SunOS 5.x software capabilites */\n\tchar name[50];\n\tssize_t namesize;\n\n\tif (size != xsh_sizeof) {\n\t\tif (file_printf(ms, \", corrupted section header size\") == -1)\n\t\t\treturn -1;\n\t\treturn 0;\n\t}\n\n\t/* Read offset of name section to be able to read section names later */\n\tif (pread(fd, xsh_addr, xsh_sizeof, off + size * strtab) < (ssize_t)xsh_sizeof) {\n\t\tfile_badread(ms);\n\t\treturn -1;\n\t}\n\tname_off = xsh_offset;\n\n\tfor ( ; num; num--) {\n\t\t/* Read the name of this section. */\n\t\tif ((namesize = pread(fd, name, sizeof(name) - 1, name_off + xsh_name)) == -1) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\tname[namesize] = '\\0';\n\t\tif (strcmp(name, \".debug_info\") == 0)\n\t\t\tstripped = 0;\n\n\t\tif (pread(fd, xsh_addr, xsh_sizeof, off) < (ssize_t)xsh_sizeof) {\n\t\t\tfile_badread(ms);\n\t\t\treturn -1;\n\t\t}\n\t\toff += size;\n\n\t\t/* Things we can determine before we seek */\n\t\tswitch (xsh_type) {\n\t\tcase SHT_SYMTAB:\n#if 0\n\t\tcase SHT_DYNSYM:\n#endif\n\t\t\tstripped = 0;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tif (fsize != SIZE_UNKNOWN && xsh_offset > fsize) {\n\t\t\t\t/* Perhaps warn here */\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t\t/* Things we can determine when we seek */\n\t\tswitch (xsh_type) {\n\t\tcase SHT_NOTE:\n\t\t\tif ((nbuf = malloc(xsh_size)) == NULL) {\n\t\t\t\tfile_error(ms, errno, \"Cannot allocate memory\"\n\t\t\t\t \" for note\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (pread(fd, nbuf, xsh_size, xsh_offset) < (ssize_t)xsh_size) {\n\t\t\t\tfile_badread(ms);\n\t\t\t\tfree(nbuf);\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tnoff = 0;\n\t\t\tfor (;;) {\n\t\t\t\tif (noff >= (off_t)xsh_size)\n\t\t\t\t\tbreak;\n\t\t\t\tnoff = donote(ms, nbuf, (size_t)noff,\n\t\t\t\t xsh_size, clazz, swap, 4, flags);\n\t\t\t\tif (noff == 0)\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfree(nbuf);\n\t\t\tbreak;\n\t\tcase SHT_SUNW_cap:\n\t\t\tswitch (mach) {\n\t\t\tcase EM_SPARC:\n\t\t\tcase EM_SPARCV9:\n\t\t\tcase EM_IA_64:\n\t\t\tcase EM_386:\n\t\t\tcase EM_AMD64:\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tgoto skip;\n\t\t\t}\n\n\t\t\tif (nbadcap > 5)\n\t\t\t\tbreak;\n\t\t\tif (lseek(fd, xsh_offset, SEEK_SET) == (off_t)-1) {\n\t\t\t\tfile_badseek(ms);\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tcoff = 0;\n\t\t\tfor (;;) {\n\t\t\t\tElf32_Cap cap32;\n\t\t\t\tElf64_Cap cap64;\n\t\t\t\tchar cbuf[/*CONSTCOND*/\n\t\t\t\t MAX(sizeof cap32, sizeof cap64)];\n\t\t\t\tif ((coff += xcap_sizeof) > (off_t)xsh_size)\n\t\t\t\t\tbreak;\n\t\t\t\tif (read(fd, cbuf, (size_t)xcap_sizeof) !=\n\t\t\t\t (ssize_t)xcap_sizeof) {\n\t\t\t\t\tfile_badread(ms);\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t\tif (cbuf[0] == 'A') {\n#ifdef notyet\n\t\t\t\t\tchar *p = cbuf + 1;\n\t\t\t\t\tuint32_t len, tag;\n\t\t\t\t\tmemcpy(&len, p, sizeof(len));\n\t\t\t\t\tp += 4;\n\t\t\t\t\tlen = getu32(swap, len);\n\t\t\t\t\tif (memcmp(\"gnu\", p, 3) != 0) {\n\t\t\t\t\t if (file_printf(ms,\n\t\t\t\t\t\t\", unknown capability %.3s\", p)\n\t\t\t\t\t\t== -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t break;\n\t\t\t\t\t}\n\t\t\t\t\tp += strlen(p) + 1;\n\t\t\t\t\ttag = *p++;\n\t\t\t\t\tmemcpy(&len, p, sizeof(len));\n\t\t\t\t\tp += 4;\n\t\t\t\t\tlen = getu32(swap, len);\n\t\t\t\t\tif (tag != 1) {\n\t\t\t\t\t if (file_printf(ms, \", unknown gnu\"\n\t\t\t\t\t\t\" capability tag %d\", tag)\n\t\t\t\t\t\t== -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\t break;\n\t\t\t\t\t}\n\t\t\t\t\t// gnu attributes \n#endif\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t(void)memcpy(xcap_addr, cbuf, xcap_sizeof);\n\t\t\t\tswitch (xcap_tag) {\n\t\t\t\tcase CA_SUNW_NULL:\n\t\t\t\t\tbreak;\n\t\t\t\tcase CA_SUNW_HW_1:\n\t\t\t\t\tcap_hw1 |= xcap_val;\n\t\t\t\t\tbreak;\n\t\t\t\tcase CA_SUNW_SF_1:\n\t\t\t\t\tcap_sf1 |= xcap_val;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tif (file_printf(ms,\n\t\t\t\t\t \", with unknown capability \"\n\t\t\t\t\t \"0x%\" INT64_T_FORMAT \"x = 0x%\"\n\t\t\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t\t\t (unsigned long long)xcap_tag,\n\t\t\t\t\t (unsigned long long)xcap_val) == -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\tif (nbadcap++ > 2)\n\t\t\t\t\t\tcoff = xsh_size;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t/*FALLTHROUGH*/\n\t\tskip:\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (file_printf(ms, \", %sstripped\", stripped ? \"\" : \"not \") == -1)\n\t\treturn -1;\n\tif (cap_hw1) {\n\t\tconst cap_desc_t *cdp;\n\t\tswitch (mach) {\n\t\tcase EM_SPARC:\n\t\tcase EM_SPARC32PLUS:\n\t\tcase EM_SPARCV9:\n\t\t\tcdp = cap_desc_sparc;\n\t\t\tbreak;\n\t\tcase EM_386:\n\t\tcase EM_IA_64:\n\t\tcase EM_AMD64:\n\t\t\tcdp = cap_desc_386;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tcdp = NULL;\n\t\t\tbreak;\n\t\t}\n\t\tif (file_printf(ms, \", uses\") == -1)\n\t\t\treturn -1;\n\t\tif (cdp) {\n\t\t\twhile (cdp->cd_name) {\n\t\t\t\tif (cap_hw1 & cdp->cd_mask) {\n\t\t\t\t\tif (file_printf(ms,\n\t\t\t\t\t \" %s\", cdp->cd_name) == -1)\n\t\t\t\t\t\treturn -1;\n\t\t\t\t\tcap_hw1 &= ~cdp->cd_mask;\n\t\t\t\t}\n\t\t\t\t++cdp;\n\t\t\t}\n\t\t\tif (cap_hw1)\n\t\t\t\tif (file_printf(ms,\n\t\t\t\t \" unknown hardware capability 0x%\"\n\t\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t\t (unsigned long long)cap_hw1) == -1)\n\t\t\t\t\treturn -1;\n\t\t} else {\n\t\t\tif (file_printf(ms,\n\t\t\t \" hardware capability 0x%\" INT64_T_FORMAT \"x\",\n\t\t\t (unsigned long long)cap_hw1) == -1)\n\t\t\t\treturn -1;\n\t\t}\n\t}\n\tif (cap_sf1) {\n\t\tif (cap_sf1 & SF1_SUNW_FPUSED) {\n\t\t\tif (file_printf(ms,\n\t\t\t (cap_sf1 & SF1_SUNW_FPKNWN)\n\t\t\t ? \", uses frame pointer\"\n\t\t\t : \", not known to use frame pointer\") == -1)\n\t\t\t\treturn -1;\n\t\t}\n\t\tcap_sf1 &= ~SF1_SUNW_MASK;\n\t\tif (cap_sf1)\n\t\t\tif (file_printf(ms,\n\t\t\t \", with unknown software capability 0x%\"\n\t\t\t INT64_T_FORMAT \"x\",\n\t\t\t (unsigned long long)cap_sf1) == -1)\n\t\t\t\treturn -1;\n\t}\n\treturn 0;\n}"},"diff":{"kind":"string","value":"{'added': [(30, 'FILE_RCSID(\"@(#)$File: readelf.c,v 1.114 2014/12/11 14:19:36 christos Exp $\")'), (322, '\\t\\tif (pread(fd, xph_addr, xph_sizeof, off) < (ssize_t)xph_sizeof) {'), (931, '\\tssize_t namesize;'), (940, '\\tif (pread(fd, xsh_addr, xsh_sizeof, off + size * strtab) < (ssize_t)xsh_sizeof) {'), (948, '\\t\\tif ((namesize = pread(fd, name, sizeof(name) - 1, name_off + xsh_name)) == -1) {'), (952, \"\\t\\tname[namesize] = '\\\\0';\"), (956, '\\t\\tif (pread(fd, xsh_addr, xsh_sizeof, off) < (ssize_t)xsh_sizeof) {'), (986, '\\t\\t\\tif (pread(fd, nbuf, xsh_size, xsh_offset) < (ssize_t)xsh_size) {'), (1182, '\\t\\tif (pread(fd, xph_addr, xph_sizeof, off) < (ssize_t)xph_sizeof) {')], 'deleted': [(30, 'FILE_RCSID(\"@(#)$File: readelf.c,v 1.113 2014/12/11 14:10:53 christos Exp $\")'), (322, '\\t\\tif (pread(fd, xph_addr, xph_sizeof, off) == -1) {'), (939, '\\tif (pread(fd, xsh_addr, xsh_sizeof, off + size * strtab) == -1) {'), (947, '\\t\\tif (pread(fd, name, sizeof(name), name_off + xsh_name) == -1) {'), (951, \"\\t\\tname[sizeof(name) - 1] = '\\\\0';\"), (955, '\\t\\tif (pread(fd, xsh_addr, xsh_sizeof, off) == -1) {'), (985, '\\t\\t\\tif (pread(fd, nbuf, xsh_size, xsh_offset) == -1) {'), (1181, '\\t\\tif (pread(fd, xph_addr, xph_sizeof, off) == -1) {')]}"},"num_lines_added":{"kind":"number","value":9,"string":"9"},"num_lines_deleted":{"kind":"number","value":8,"string":"8"},"num_lines_in_file":{"kind":"number","value":887,"string":"887"},"num_tokens_in_file":{"kind":"number","value":5436,"string":"5,436"},"num_lines_in_method":{"kind":"number","value":216,"string":"216"},"num_tokens_in_method":{"kind":"number","value":1085,"string":"1,085"},"method_complexity":{"kind":"number","value":64,"string":"64"},"repo":{"kind":"string","value":"https://github.com/file/file"},"cve_id":{"kind":"string","value":"CVE-2014-9653"},"cwe_id":{"kind":"string","value":"CWE-20"}}},{"rowIdx":399,"cells":{"id":{"kind":"number","value":2636,"string":"2,636"},"file_name":{"kind":"string","value":"rxe_mr.c"},"programming_language":{"kind":"string","value":"C"},"method_name":{"kind":"string","value":"mem_check_range"},"code_before":{"kind":"string","value":"/*\n * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.\n * Copyright (c) 2015 System Fabric Works, Inc. All rights reserved.\n *\n * This software is available to you under a choice of one of two\n * licenses. You may choose to be licensed under the terms of the GNU\n * General Public License (GPL) Version 2, available from the file\n * COPYING in the main directory of this source tree, or the\n * OpenIB.org BSD license below:\n *\n * Redistribution and use in source and binary forms, with or\n * without modification, are permitted provided that the following\n * conditions are met:\n *\n *\t- Redistributions of source code must retain the above\n *\t copyright notice, this list of conditions and the following\n *\t disclaimer.\n *\n *\t- Redistributions in binary form must reproduce the above\n *\t copyright notice, this list of conditions and the following\n *\t disclaimer in the documentation and/or other materials\n *\t provided with the distribution.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\n#include \"rxe.h\"\n#include \"rxe_loc.h\"\n\n/*\n * lfsr (linear feedback shift register) with period 255\n */\nstatic u8 rxe_get_key(void)\n{\n\tstatic u32 key = 1;\n\n\tkey = key << 1;\n\n\tkey |= (0 != (key & 0x100)) ^ (0 != (key & 0x10))\n\t\t^ (0 != (key & 0x80)) ^ (0 != (key & 0x40));\n\n\tkey &= 0xff;\n\n\treturn key;\n}\n\nint mem_check_range(struct rxe_mem *mem, u64 iova, size_t length)\n{\n\tswitch (mem->type) {\n\tcase RXE_MEM_TYPE_DMA:\n\t\treturn 0;\n\n\tcase RXE_MEM_TYPE_MR:\n\tcase RXE_MEM_TYPE_FMR:\n\t\treturn ((iova < mem->iova) ||\n\t\t\t((iova + length) > (mem->iova + mem->length))) ?\n\t\t\t-EFAULT : 0;\n\n\tdefault:\n\t\treturn -EFAULT;\n\t}\n}\n\n#define IB_ACCESS_REMOTE\t(IB_ACCESS_REMOTE_READ\t\t\\\n\t\t\t\t| IB_ACCESS_REMOTE_WRITE\t\\\n\t\t\t\t| IB_ACCESS_REMOTE_ATOMIC)\n\nstatic void rxe_mem_init(int access, struct rxe_mem *mem)\n{\n\tu32 lkey = mem->pelem.index << 8 | rxe_get_key();\n\tu32 rkey = (access & IB_ACCESS_REMOTE) ? lkey : 0;\n\n\tif (mem->pelem.pool->type == RXE_TYPE_MR) {\n\t\tmem->ibmr.lkey\t\t= lkey;\n\t\tmem->ibmr.rkey\t\t= rkey;\n\t}\n\n\tmem->lkey\t\t= lkey;\n\tmem->rkey\t\t= rkey;\n\tmem->state\t\t= RXE_MEM_STATE_INVALID;\n\tmem->type\t\t= RXE_MEM_TYPE_NONE;\n\tmem->map_shift\t\t= ilog2(RXE_BUF_PER_MAP);\n}\n\nvoid rxe_mem_cleanup(void *arg)\n{\n\tstruct rxe_mem *mem = arg;\n\tint i;\n\n\tif (mem->umem)\n\t\tib_umem_release(mem->umem);\n\n\tif (mem->map) {\n\t\tfor (i = 0; i < mem->num_map; i++)\n\t\t\tkfree(mem->map[i]);\n\n\t\tkfree(mem->map);\n\t}\n}\n\nstatic int rxe_mem_alloc(struct rxe_dev *rxe, struct rxe_mem *mem, int num_buf)\n{\n\tint i;\n\tint num_map;\n\tstruct rxe_map **map = mem->map;\n\n\tnum_map = (num_buf + RXE_BUF_PER_MAP - 1) / RXE_BUF_PER_MAP;\n\n\tmem->map = kmalloc_array(num_map, sizeof(*map), GFP_KERNEL);\n\tif (!mem->map)\n\t\tgoto err1;\n\n\tfor (i = 0; i < num_map; i++) {\n\t\tmem->map[i] = kmalloc(sizeof(**map), GFP_KERNEL);\n\t\tif (!mem->map[i])\n\t\t\tgoto err2;\n\t}\n\n\tWARN_ON(!is_power_of_2(RXE_BUF_PER_MAP));\n\n\tmem->map_shift\t= ilog2(RXE_BUF_PER_MAP);\n\tmem->map_mask\t= RXE_BUF_PER_MAP - 1;\n\n\tmem->num_buf = num_buf;\n\tmem->num_map = num_map;\n\tmem->max_buf = num_map * RXE_BUF_PER_MAP;\n\n\treturn 0;\n\nerr2:\n\tfor (i--; i >= 0; i--)\n\t\tkfree(mem->map[i]);\n\n\tkfree(mem->map);\nerr1:\n\treturn -ENOMEM;\n}\n\nint rxe_mem_init_dma(struct rxe_dev *rxe, struct rxe_pd *pd,\n\t\t int access, struct rxe_mem *mem)\n{\n\trxe_mem_init(access, mem);\n\n\tmem->pd\t\t\t= pd;\n\tmem->access\t\t= access;\n\tmem->state\t\t= RXE_MEM_STATE_VALID;\n\tmem->type\t\t= RXE_MEM_TYPE_DMA;\n\n\treturn 0;\n}\n\nint rxe_mem_init_user(struct rxe_dev *rxe, struct rxe_pd *pd, u64 start,\n\t\t u64 length, u64 iova, int access, struct ib_udata *udata,\n\t\t struct rxe_mem *mem)\n{\n\tint\t\t\tentry;\n\tstruct rxe_map\t\t**map;\n\tstruct rxe_phys_buf\t*buf = NULL;\n\tstruct ib_umem\t\t*umem;\n\tstruct scatterlist\t*sg;\n\tint\t\t\tnum_buf;\n\tvoid\t\t\t*vaddr;\n\tint err;\n\n\tumem = ib_umem_get(pd->ibpd.uobject->context, start, length, access, 0);\n\tif (IS_ERR(umem)) {\n\t\tpr_warn(\"err %d from rxe_umem_get\\n\",\n\t\t\t(int)PTR_ERR(umem));\n\t\terr = -EINVAL;\n\t\tgoto err1;\n\t}\n\n\tmem->umem = umem;\n\tnum_buf = umem->nmap;\n\n\trxe_mem_init(access, mem);\n\n\terr = rxe_mem_alloc(rxe, mem, num_buf);\n\tif (err) {\n\t\tpr_warn(\"err %d from rxe_mem_alloc\\n\", err);\n\t\tib_umem_release(umem);\n\t\tgoto err1;\n\t}\n\n\tWARN_ON(!is_power_of_2(umem->page_size));\n\n\tmem->page_shift\t\t= ilog2(umem->page_size);\n\tmem->page_mask\t\t= umem->page_size - 1;\n\n\tnum_buf\t\t\t= 0;\n\tmap\t\t\t= mem->map;\n\tif (length > 0) {\n\t\tbuf = map[0]->buf;\n\n\t\tfor_each_sg(umem->sg_head.sgl, sg, umem->nmap, entry) {\n\t\t\tvaddr = page_address(sg_page(sg));\n\t\t\tif (!vaddr) {\n\t\t\t\tpr_warn(\"null vaddr\\n\");\n\t\t\t\terr = -ENOMEM;\n\t\t\t\tgoto err1;\n\t\t\t}\n\n\t\t\tbuf->addr = (uintptr_t)vaddr;\n\t\t\tbuf->size = umem->page_size;\n\t\t\tnum_buf++;\n\t\t\tbuf++;\n\n\t\t\tif (num_buf >= RXE_BUF_PER_MAP) {\n\t\t\t\tmap++;\n\t\t\t\tbuf = map[0]->buf;\n\t\t\t\tnum_buf = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tmem->pd\t\t\t= pd;\n\tmem->umem\t\t= umem;\n\tmem->access\t\t= access;\n\tmem->length\t\t= length;\n\tmem->iova\t\t= iova;\n\tmem->va\t\t\t= start;\n\tmem->offset\t\t= ib_umem_offset(umem);\n\tmem->state\t\t= RXE_MEM_STATE_VALID;\n\tmem->type\t\t= RXE_MEM_TYPE_MR;\n\n\treturn 0;\n\nerr1:\n\treturn err;\n}\n\nint rxe_mem_init_fast(struct rxe_dev *rxe, struct rxe_pd *pd,\n\t\t int max_pages, struct rxe_mem *mem)\n{\n\tint err;\n\n\trxe_mem_init(0, mem);\n\n\t/* In fastreg, we also set the rkey */\n\tmem->ibmr.rkey = mem->ibmr.lkey;\n\n\terr = rxe_mem_alloc(rxe, mem, max_pages);\n\tif (err)\n\t\tgoto err1;\n\n\tmem->pd\t\t\t= pd;\n\tmem->max_buf\t\t= max_pages;\n\tmem->state\t\t= RXE_MEM_STATE_FREE;\n\tmem->type\t\t= RXE_MEM_TYPE_MR;\n\n\treturn 0;\n\nerr1:\n\treturn err;\n}\n\nstatic void lookup_iova(\n\tstruct rxe_mem\t*mem,\n\tu64\t\t\tiova,\n\tint\t\t\t*m_out,\n\tint\t\t\t*n_out,\n\tsize_t\t\t\t*offset_out)\n{\n\tsize_t\t\t\toffset = iova - mem->iova + mem->offset;\n\tint\t\t\tmap_index;\n\tint\t\t\tbuf_index;\n\tu64\t\t\tlength;\n\n\tif (likely(mem->page_shift)) {\n\t\t*offset_out = offset & mem->page_mask;\n\t\toffset >>= mem->page_shift;\n\t\t*n_out = offset & mem->map_mask;\n\t\t*m_out = offset >> mem->map_shift;\n\t} else {\n\t\tmap_index = 0;\n\t\tbuf_index = 0;\n\n\t\tlength = mem->map[map_index]->buf[buf_index].size;\n\n\t\twhile (offset >= length) {\n\t\t\toffset -= length;\n\t\t\tbuf_index++;\n\n\t\t\tif (buf_index == RXE_BUF_PER_MAP) {\n\t\t\t\tmap_index++;\n\t\t\t\tbuf_index = 0;\n\t\t\t}\n\t\t\tlength = mem->map[map_index]->buf[buf_index].size;\n\t\t}\n\n\t\t*m_out = map_index;\n\t\t*n_out = buf_index;\n\t\t*offset_out = offset;\n\t}\n}\n\nvoid *iova_to_vaddr(struct rxe_mem *mem, u64 iova, int length)\n{\n\tsize_t offset;\n\tint m, n;\n\tvoid *addr;\n\n\tif (mem->state != RXE_MEM_STATE_VALID) {\n\t\tpr_warn(\"mem not in valid state\\n\");\n\t\taddr = NULL;\n\t\tgoto out;\n\t}\n\n\tif (!mem->map) {\n\t\taddr = (void *)(uintptr_t)iova;\n\t\tgoto out;\n\t}\n\n\tif (mem_check_range(mem, iova, length)) {\n\t\tpr_warn(\"range violation\\n\");\n\t\taddr = NULL;\n\t\tgoto out;\n\t}\n\n\tlookup_iova(mem, iova, &m, &n, &offset);\n\n\tif (offset + length > mem->map[m]->buf[n].size) {\n\t\tpr_warn(\"crosses page boundary\\n\");\n\t\taddr = NULL;\n\t\tgoto out;\n\t}\n\n\taddr = (void *)(uintptr_t)mem->map[m]->buf[n].addr + offset;\n\nout:\n\treturn addr;\n}\n\n/* copy data from a range (vaddr, vaddr+length-1) to or from\n * a mem object starting at iova. Compute incremental value of\n * crc32 if crcp is not zero. caller must hold a reference to mem\n */\nint rxe_mem_copy(struct rxe_mem *mem, u64 iova, void *addr, int length,\n\t\t enum copy_direction dir, u32 *crcp)\n{\n\tint\t\t\terr;\n\tint\t\t\tbytes;\n\tu8\t\t\t*va;\n\tstruct rxe_map\t\t**map;\n\tstruct rxe_phys_buf\t*buf;\n\tint\t\t\tm;\n\tint\t\t\ti;\n\tsize_t\t\t\toffset;\n\tu32\t\t\tcrc = crcp ? (*crcp) : 0;\n\n\tif (length == 0)\n\t\treturn 0;\n\n\tif (mem->type == RXE_MEM_TYPE_DMA) {\n\t\tu8 *src, *dest;\n\n\t\tsrc = (dir == to_mem_obj) ?\n\t\t\taddr : ((void *)(uintptr_t)iova);\n\n\t\tdest = (dir == to_mem_obj) ?\n\t\t\t((void *)(uintptr_t)iova) : addr;\n\n\t\tif (crcp)\n\t\t\t*crcp = crc32_le(*crcp, src, length);\n\n\t\tmemcpy(dest, src, length);\n\n\t\treturn 0;\n\t}\n\n\tWARN_ON(!mem->map);\n\n\terr = mem_check_range(mem, iova, length);\n\tif (err) {\n\t\terr = -EFAULT;\n\t\tgoto err1;\n\t}\n\n\tlookup_iova(mem, iova, &m, &i, &offset);\n\n\tmap\t= mem->map + m;\n\tbuf\t= map[0]->buf + i;\n\n\twhile (length > 0) {\n\t\tu8 *src, *dest;\n\n\t\tva\t= (u8 *)(uintptr_t)buf->addr + offset;\n\t\tsrc = (dir == to_mem_obj) ? addr : va;\n\t\tdest = (dir == to_mem_obj) ? va : addr;\n\n\t\tbytes\t= buf->size - offset;\n\n\t\tif (bytes > length)\n\t\t\tbytes = length;\n\n\t\tif (crcp)\n\t\t\tcrc = crc32_le(crc, src, bytes);\n\n\t\tmemcpy(dest, src, bytes);\n\n\t\tlength\t-= bytes;\n\t\taddr\t+= bytes;\n\n\t\toffset\t= 0;\n\t\tbuf++;\n\t\ti++;\n\n\t\tif (i == RXE_BUF_PER_MAP) {\n\t\t\ti = 0;\n\t\t\tmap++;\n\t\t\tbuf = map[0]->buf;\n\t\t}\n\t}\n\n\tif (crcp)\n\t\t*crcp = crc;\n\n\treturn 0;\n\nerr1:\n\treturn err;\n}\n\n/* copy data in or out of a wqe, i.e. sg list\n * under the control of a dma descriptor\n */\nint copy_data(\n\tstruct rxe_dev\t\t*rxe,\n\tstruct rxe_pd\t\t*pd,\n\tint\t\t\taccess,\n\tstruct rxe_dma_info\t*dma,\n\tvoid\t\t\t*addr,\n\tint\t\t\tlength,\n\tenum copy_direction\tdir,\n\tu32\t\t\t*crcp)\n{\n\tint\t\t\tbytes;\n\tstruct rxe_sge\t\t*sge\t= &dma->sge[dma->cur_sge];\n\tint\t\t\toffset\t= dma->sge_offset;\n\tint\t\t\tresid\t= dma->resid;\n\tstruct rxe_mem\t\t*mem\t= NULL;\n\tu64\t\t\tiova;\n\tint\t\t\terr;\n\n\tif (length == 0)\n\t\treturn 0;\n\n\tif (length > resid) {\n\t\terr = -EINVAL;\n\t\tgoto err2;\n\t}\n\n\tif (sge->length && (offset < sge->length)) {\n\t\tmem = lookup_mem(pd, access, sge->lkey, lookup_local);\n\t\tif (!mem) {\n\t\t\terr = -EINVAL;\n\t\t\tgoto err1;\n\t\t}\n\t}\n\n\twhile (length > 0) {\n\t\tbytes = length;\n\n\t\tif (offset >= sge->length) {\n\t\t\tif (mem) {\n\t\t\t\trxe_drop_ref(mem);\n\t\t\t\tmem = NULL;\n\t\t\t}\n\t\t\tsge++;\n\t\t\tdma->cur_sge++;\n\t\t\toffset = 0;\n\n\t\t\tif (dma->cur_sge >= dma->num_sge) {\n\t\t\t\terr = -ENOSPC;\n\t\t\t\tgoto err2;\n\t\t\t}\n\n\t\t\tif (sge->length) {\n\t\t\t\tmem = lookup_mem(pd, access, sge->lkey,\n\t\t\t\t\t\t lookup_local);\n\t\t\t\tif (!mem) {\n\t\t\t\t\terr = -EINVAL;\n\t\t\t\t\tgoto err1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tif (bytes > sge->length - offset)\n\t\t\tbytes = sge->length - offset;\n\n\t\tif (bytes > 0) {\n\t\t\tiova = sge->addr + offset;\n\n\t\t\terr = rxe_mem_copy(mem, iova, addr, bytes, dir, crcp);\n\t\t\tif (err)\n\t\t\t\tgoto err2;\n\n\t\t\toffset\t+= bytes;\n\t\t\tresid\t-= bytes;\n\t\t\tlength\t-= bytes;\n\t\t\taddr\t+= bytes;\n\t\t}\n\t}\n\n\tdma->sge_offset = offset;\n\tdma->resid\t= resid;\n\n\tif (mem)\n\t\trxe_drop_ref(mem);\n\n\treturn 0;\n\nerr2:\n\tif (mem)\n\t\trxe_drop_ref(mem);\nerr1:\n\treturn err;\n}\n\nint advance_dma_data(struct rxe_dma_info *dma, unsigned int length)\n{\n\tstruct rxe_sge\t\t*sge\t= &dma->sge[dma->cur_sge];\n\tint\t\t\toffset\t= dma->sge_offset;\n\tint\t\t\tresid\t= dma->resid;\n\n\twhile (length) {\n\t\tunsigned int bytes;\n\n\t\tif (offset >= sge->length) {\n\t\t\tsge++;\n\t\t\tdma->cur_sge++;\n\t\t\toffset = 0;\n\t\t\tif (dma->cur_sge >= dma->num_sge)\n\t\t\t\treturn -ENOSPC;\n\t\t}\n\n\t\tbytes = length;\n\n\t\tif (bytes > sge->length - offset)\n\t\t\tbytes = sge->length - offset;\n\n\t\toffset\t+= bytes;\n\t\tresid\t-= bytes;\n\t\tlength\t-= bytes;\n\t}\n\n\tdma->sge_offset = offset;\n\tdma->resid\t= resid;\n\n\treturn 0;\n}\n\n/* (1) find the mem (mr or mw) corresponding to lkey/rkey\n * depending on lookup_type\n * (2) verify that the (qp) pd matches the mem pd\n * (3) verify that the mem can support the requested access\n * (4) verify that mem state is valid\n */\nstruct rxe_mem *lookup_mem(struct rxe_pd *pd, int access, u32 key,\n\t\t\t enum lookup_type type)\n{\n\tstruct rxe_mem *mem;\n\tstruct rxe_dev *rxe = to_rdev(pd->ibpd.device);\n\tint index = key >> 8;\n\n\tif (index >= RXE_MIN_MR_INDEX && index <= RXE_MAX_MR_INDEX) {\n\t\tmem = rxe_pool_get_index(&rxe->mr_pool, index);\n\t\tif (!mem)\n\t\t\tgoto err1;\n\t} else {\n\t\tgoto err1;\n\t}\n\n\tif ((type == lookup_local && mem->lkey != key) ||\n\t (type == lookup_remote && mem->rkey != key))\n\t\tgoto err2;\n\n\tif (mem->pd != pd)\n\t\tgoto err2;\n\n\tif (access && !(access & mem->access))\n\t\tgoto err2;\n\n\tif (mem->state != RXE_MEM_STATE_VALID)\n\t\tgoto err2;\n\n\treturn mem;\n\nerr2:\n\trxe_drop_ref(mem);\nerr1:\n\treturn NULL;\n}\n\nint rxe_mem_map_pages(struct rxe_dev *rxe, struct rxe_mem *mem,\n\t\t u64 *page, int num_pages, u64 iova)\n{\n\tint i;\n\tint num_buf;\n\tint err;\n\tstruct rxe_map **map;\n\tstruct rxe_phys_buf *buf;\n\tint page_size;\n\n\tif (num_pages > mem->max_buf) {\n\t\terr = -EINVAL;\n\t\tgoto err1;\n\t}\n\n\tnum_buf\t\t= 0;\n\tpage_size\t= 1 << mem->page_shift;\n\tmap\t\t= mem->map;\n\tbuf\t\t= map[0]->buf;\n\n\tfor (i = 0; i < num_pages; i++) {\n\t\tbuf->addr = *page++;\n\t\tbuf->size = page_size;\n\t\tbuf++;\n\t\tnum_buf++;\n\n\t\tif (num_buf == RXE_BUF_PER_MAP) {\n\t\t\tmap++;\n\t\t\tbuf = map[0]->buf;\n\t\t\tnum_buf = 0;\n\t\t}\n\t}\n\n\tmem->iova\t= iova;\n\tmem->va\t\t= iova;\n\tmem->length\t= num_pages << mem->page_shift;\n\tmem->state\t= RXE_MEM_STATE_VALID;\n\n\treturn 0;\n\nerr1:\n\treturn err;\n}\n"},"code_after":{"kind":"string","value":"/*\n * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.\n * Copyright (c) 2015 System Fabric Works, Inc. All rights reserved.\n *\n * This software is available to you under a choice of one of two\n * licenses. You may choose to be licensed under the terms of the GNU\n * General Public License (GPL) Version 2, available from the file\n * COPYING in the main directory of this source tree, or the\n * OpenIB.org BSD license below:\n *\n * Redistribution and use in source and binary forms, with or\n * without modification, are permitted provided that the following\n * conditions are met:\n *\n *\t- Redistributions of source code must retain the above\n *\t copyright notice, this list of conditions and the following\n *\t disclaimer.\n *\n *\t- Redistributions in binary form must reproduce the above\n *\t copyright notice, this list of conditions and the following\n *\t disclaimer in the documentation and/or other materials\n *\t provided with the distribution.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\n\n#include \"rxe.h\"\n#include \"rxe_loc.h\"\n\n/*\n * lfsr (linear feedback shift register) with period 255\n */\nstatic u8 rxe_get_key(void)\n{\n\tstatic u32 key = 1;\n\n\tkey = key << 1;\n\n\tkey |= (0 != (key & 0x100)) ^ (0 != (key & 0x10))\n\t\t^ (0 != (key & 0x80)) ^ (0 != (key & 0x40));\n\n\tkey &= 0xff;\n\n\treturn key;\n}\n\nint mem_check_range(struct rxe_mem *mem, u64 iova, size_t length)\n{\n\tswitch (mem->type) {\n\tcase RXE_MEM_TYPE_DMA:\n\t\treturn 0;\n\n\tcase RXE_MEM_TYPE_MR:\n\tcase RXE_MEM_TYPE_FMR:\n\t\tif (iova < mem->iova ||\n\t\t length > mem->length ||\n\t\t iova > mem->iova + mem->length - length)\n\t\t\treturn -EFAULT;\n\t\treturn 0;\n\n\tdefault:\n\t\treturn -EFAULT;\n\t}\n}\n\n#define IB_ACCESS_REMOTE\t(IB_ACCESS_REMOTE_READ\t\t\\\n\t\t\t\t| IB_ACCESS_REMOTE_WRITE\t\\\n\t\t\t\t| IB_ACCESS_REMOTE_ATOMIC)\n\nstatic void rxe_mem_init(int access, struct rxe_mem *mem)\n{\n\tu32 lkey = mem->pelem.index << 8 | rxe_get_key();\n\tu32 rkey = (access & IB_ACCESS_REMOTE) ? lkey : 0;\n\n\tif (mem->pelem.pool->type == RXE_TYPE_MR) {\n\t\tmem->ibmr.lkey\t\t= lkey;\n\t\tmem->ibmr.rkey\t\t= rkey;\n\t}\n\n\tmem->lkey\t\t= lkey;\n\tmem->rkey\t\t= rkey;\n\tmem->state\t\t= RXE_MEM_STATE_INVALID;\n\tmem->type\t\t= RXE_MEM_TYPE_NONE;\n\tmem->map_shift\t\t= ilog2(RXE_BUF_PER_MAP);\n}\n\nvoid rxe_mem_cleanup(void *arg)\n{\n\tstruct rxe_mem *mem = arg;\n\tint i;\n\n\tif (mem->umem)\n\t\tib_umem_release(mem->umem);\n\n\tif (mem->map) {\n\t\tfor (i = 0; i < mem->num_map; i++)\n\t\t\tkfree(mem->map[i]);\n\n\t\tkfree(mem->map);\n\t}\n}\n\nstatic int rxe_mem_alloc(struct rxe_dev *rxe, struct rxe_mem *mem, int num_buf)\n{\n\tint i;\n\tint num_map;\n\tstruct rxe_map **map = mem->map;\n\n\tnum_map = (num_buf + RXE_BUF_PER_MAP - 1) / RXE_BUF_PER_MAP;\n\n\tmem->map = kmalloc_array(num_map, sizeof(*map), GFP_KERNEL);\n\tif (!mem->map)\n\t\tgoto err1;\n\n\tfor (i = 0; i < num_map; i++) {\n\t\tmem->map[i] = kmalloc(sizeof(**map), GFP_KERNEL);\n\t\tif (!mem->map[i])\n\t\t\tgoto err2;\n\t}\n\n\tWARN_ON(!is_power_of_2(RXE_BUF_PER_MAP));\n\n\tmem->map_shift\t= ilog2(RXE_BUF_PER_MAP);\n\tmem->map_mask\t= RXE_BUF_PER_MAP - 1;\n\n\tmem->num_buf = num_buf;\n\tmem->num_map = num_map;\n\tmem->max_buf = num_map * RXE_BUF_PER_MAP;\n\n\treturn 0;\n\nerr2:\n\tfor (i--; i >= 0; i--)\n\t\tkfree(mem->map[i]);\n\n\tkfree(mem->map);\nerr1:\n\treturn -ENOMEM;\n}\n\nint rxe_mem_init_dma(struct rxe_dev *rxe, struct rxe_pd *pd,\n\t\t int access, struct rxe_mem *mem)\n{\n\trxe_mem_init(access, mem);\n\n\tmem->pd\t\t\t= pd;\n\tmem->access\t\t= access;\n\tmem->state\t\t= RXE_MEM_STATE_VALID;\n\tmem->type\t\t= RXE_MEM_TYPE_DMA;\n\n\treturn 0;\n}\n\nint rxe_mem_init_user(struct rxe_dev *rxe, struct rxe_pd *pd, u64 start,\n\t\t u64 length, u64 iova, int access, struct ib_udata *udata,\n\t\t struct rxe_mem *mem)\n{\n\tint\t\t\tentry;\n\tstruct rxe_map\t\t**map;\n\tstruct rxe_phys_buf\t*buf = NULL;\n\tstruct ib_umem\t\t*umem;\n\tstruct scatterlist\t*sg;\n\tint\t\t\tnum_buf;\n\tvoid\t\t\t*vaddr;\n\tint err;\n\n\tumem = ib_umem_get(pd->ibpd.uobject->context, start, length, access, 0);\n\tif (IS_ERR(umem)) {\n\t\tpr_warn(\"err %d from rxe_umem_get\\n\",\n\t\t\t(int)PTR_ERR(umem));\n\t\terr = -EINVAL;\n\t\tgoto err1;\n\t}\n\n\tmem->umem = umem;\n\tnum_buf = umem->nmap;\n\n\trxe_mem_init(access, mem);\n\n\terr = rxe_mem_alloc(rxe, mem, num_buf);\n\tif (err) {\n\t\tpr_warn(\"err %d from rxe_mem_alloc\\n\", err);\n\t\tib_umem_release(umem);\n\t\tgoto err1;\n\t}\n\n\tWARN_ON(!is_power_of_2(umem->page_size));\n\n\tmem->page_shift\t\t= ilog2(umem->page_size);\n\tmem->page_mask\t\t= umem->page_size - 1;\n\n\tnum_buf\t\t\t= 0;\n\tmap\t\t\t= mem->map;\n\tif (length > 0) {\n\t\tbuf = map[0]->buf;\n\n\t\tfor_each_sg(umem->sg_head.sgl, sg, umem->nmap, entry) {\n\t\t\tvaddr = page_address(sg_page(sg));\n\t\t\tif (!vaddr) {\n\t\t\t\tpr_warn(\"null vaddr\\n\");\n\t\t\t\terr = -ENOMEM;\n\t\t\t\tgoto err1;\n\t\t\t}\n\n\t\t\tbuf->addr = (uintptr_t)vaddr;\n\t\t\tbuf->size = umem->page_size;\n\t\t\tnum_buf++;\n\t\t\tbuf++;\n\n\t\t\tif (num_buf >= RXE_BUF_PER_MAP) {\n\t\t\t\tmap++;\n\t\t\t\tbuf = map[0]->buf;\n\t\t\t\tnum_buf = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tmem->pd\t\t\t= pd;\n\tmem->umem\t\t= umem;\n\tmem->access\t\t= access;\n\tmem->length\t\t= length;\n\tmem->iova\t\t= iova;\n\tmem->va\t\t\t= start;\n\tmem->offset\t\t= ib_umem_offset(umem);\n\tmem->state\t\t= RXE_MEM_STATE_VALID;\n\tmem->type\t\t= RXE_MEM_TYPE_MR;\n\n\treturn 0;\n\nerr1:\n\treturn err;\n}\n\nint rxe_mem_init_fast(struct rxe_dev *rxe, struct rxe_pd *pd,\n\t\t int max_pages, struct rxe_mem *mem)\n{\n\tint err;\n\n\trxe_mem_init(0, mem);\n\n\t/* In fastreg, we also set the rkey */\n\tmem->ibmr.rkey = mem->ibmr.lkey;\n\n\terr = rxe_mem_alloc(rxe, mem, max_pages);\n\tif (err)\n\t\tgoto err1;\n\n\tmem->pd\t\t\t= pd;\n\tmem->max_buf\t\t= max_pages;\n\tmem->state\t\t= RXE_MEM_STATE_FREE;\n\tmem->type\t\t= RXE_MEM_TYPE_MR;\n\n\treturn 0;\n\nerr1:\n\treturn err;\n}\n\nstatic void lookup_iova(\n\tstruct rxe_mem\t*mem,\n\tu64\t\t\tiova,\n\tint\t\t\t*m_out,\n\tint\t\t\t*n_out,\n\tsize_t\t\t\t*offset_out)\n{\n\tsize_t\t\t\toffset = iova - mem->iova + mem->offset;\n\tint\t\t\tmap_index;\n\tint\t\t\tbuf_index;\n\tu64\t\t\tlength;\n\n\tif (likely(mem->page_shift)) {\n\t\t*offset_out = offset & mem->page_mask;\n\t\toffset >>= mem->page_shift;\n\t\t*n_out = offset & mem->map_mask;\n\t\t*m_out = offset >> mem->map_shift;\n\t} else {\n\t\tmap_index = 0;\n\t\tbuf_index = 0;\n\n\t\tlength = mem->map[map_index]->buf[buf_index].size;\n\n\t\twhile (offset >= length) {\n\t\t\toffset -= length;\n\t\t\tbuf_index++;\n\n\t\t\tif (buf_index == RXE_BUF_PER_MAP) {\n\t\t\t\tmap_index++;\n\t\t\t\tbuf_index = 0;\n\t\t\t}\n\t\t\tlength = mem->map[map_index]->buf[buf_index].size;\n\t\t}\n\n\t\t*m_out = map_index;\n\t\t*n_out = buf_index;\n\t\t*offset_out = offset;\n\t}\n}\n\nvoid *iova_to_vaddr(struct rxe_mem *mem, u64 iova, int length)\n{\n\tsize_t offset;\n\tint m, n;\n\tvoid *addr;\n\n\tif (mem->state != RXE_MEM_STATE_VALID) {\n\t\tpr_warn(\"mem not in valid state\\n\");\n\t\taddr = NULL;\n\t\tgoto out;\n\t}\n\n\tif (!mem->map) {\n\t\taddr = (void *)(uintptr_t)iova;\n\t\tgoto out;\n\t}\n\n\tif (mem_check_range(mem, iova, length)) {\n\t\tpr_warn(\"range violation\\n\");\n\t\taddr = NULL;\n\t\tgoto out;\n\t}\n\n\tlookup_iova(mem, iova, &m, &n, &offset);\n\n\tif (offset + length > mem->map[m]->buf[n].size) {\n\t\tpr_warn(\"crosses page boundary\\n\");\n\t\taddr = NULL;\n\t\tgoto out;\n\t}\n\n\taddr = (void *)(uintptr_t)mem->map[m]->buf[n].addr + offset;\n\nout:\n\treturn addr;\n}\n\n/* copy data from a range (vaddr, vaddr+length-1) to or from\n * a mem object starting at iova. Compute incremental value of\n * crc32 if crcp is not zero. caller must hold a reference to mem\n */\nint rxe_mem_copy(struct rxe_mem *mem, u64 iova, void *addr, int length,\n\t\t enum copy_direction dir, u32 *crcp)\n{\n\tint\t\t\terr;\n\tint\t\t\tbytes;\n\tu8\t\t\t*va;\n\tstruct rxe_map\t\t**map;\n\tstruct rxe_phys_buf\t*buf;\n\tint\t\t\tm;\n\tint\t\t\ti;\n\tsize_t\t\t\toffset;\n\tu32\t\t\tcrc = crcp ? (*crcp) : 0;\n\n\tif (length == 0)\n\t\treturn 0;\n\n\tif (mem->type == RXE_MEM_TYPE_DMA) {\n\t\tu8 *src, *dest;\n\n\t\tsrc = (dir == to_mem_obj) ?\n\t\t\taddr : ((void *)(uintptr_t)iova);\n\n\t\tdest = (dir == to_mem_obj) ?\n\t\t\t((void *)(uintptr_t)iova) : addr;\n\n\t\tif (crcp)\n\t\t\t*crcp = crc32_le(*crcp, src, length);\n\n\t\tmemcpy(dest, src, length);\n\n\t\treturn 0;\n\t}\n\n\tWARN_ON(!mem->map);\n\n\terr = mem_check_range(mem, iova, length);\n\tif (err) {\n\t\terr = -EFAULT;\n\t\tgoto err1;\n\t}\n\n\tlookup_iova(mem, iova, &m, &i, &offset);\n\n\tmap\t= mem->map + m;\n\tbuf\t= map[0]->buf + i;\n\n\twhile (length > 0) {\n\t\tu8 *src, *dest;\n\n\t\tva\t= (u8 *)(uintptr_t)buf->addr + offset;\n\t\tsrc = (dir == to_mem_obj) ? addr : va;\n\t\tdest = (dir == to_mem_obj) ? va : addr;\n\n\t\tbytes\t= buf->size - offset;\n\n\t\tif (bytes > length)\n\t\t\tbytes = length;\n\n\t\tif (crcp)\n\t\t\tcrc = crc32_le(crc, src, bytes);\n\n\t\tmemcpy(dest, src, bytes);\n\n\t\tlength\t-= bytes;\n\t\taddr\t+= bytes;\n\n\t\toffset\t= 0;\n\t\tbuf++;\n\t\ti++;\n\n\t\tif (i == RXE_BUF_PER_MAP) {\n\t\t\ti = 0;\n\t\t\tmap++;\n\t\t\tbuf = map[0]->buf;\n\t\t}\n\t}\n\n\tif (crcp)\n\t\t*crcp = crc;\n\n\treturn 0;\n\nerr1:\n\treturn err;\n}\n\n/* copy data in or out of a wqe, i.e. sg list\n * under the control of a dma descriptor\n */\nint copy_data(\n\tstruct rxe_dev\t\t*rxe,\n\tstruct rxe_pd\t\t*pd,\n\tint\t\t\taccess,\n\tstruct rxe_dma_info\t*dma,\n\tvoid\t\t\t*addr,\n\tint\t\t\tlength,\n\tenum copy_direction\tdir,\n\tu32\t\t\t*crcp)\n{\n\tint\t\t\tbytes;\n\tstruct rxe_sge\t\t*sge\t= &dma->sge[dma->cur_sge];\n\tint\t\t\toffset\t= dma->sge_offset;\n\tint\t\t\tresid\t= dma->resid;\n\tstruct rxe_mem\t\t*mem\t= NULL;\n\tu64\t\t\tiova;\n\tint\t\t\terr;\n\n\tif (length == 0)\n\t\treturn 0;\n\n\tif (length > resid) {\n\t\terr = -EINVAL;\n\t\tgoto err2;\n\t}\n\n\tif (sge->length && (offset < sge->length)) {\n\t\tmem = lookup_mem(pd, access, sge->lkey, lookup_local);\n\t\tif (!mem) {\n\t\t\terr = -EINVAL;\n\t\t\tgoto err1;\n\t\t}\n\t}\n\n\twhile (length > 0) {\n\t\tbytes = length;\n\n\t\tif (offset >= sge->length) {\n\t\t\tif (mem) {\n\t\t\t\trxe_drop_ref(mem);\n\t\t\t\tmem = NULL;\n\t\t\t}\n\t\t\tsge++;\n\t\t\tdma->cur_sge++;\n\t\t\toffset = 0;\n\n\t\t\tif (dma->cur_sge >= dma->num_sge) {\n\t\t\t\terr = -ENOSPC;\n\t\t\t\tgoto err2;\n\t\t\t}\n\n\t\t\tif (sge->length) {\n\t\t\t\tmem = lookup_mem(pd, access, sge->lkey,\n\t\t\t\t\t\t lookup_local);\n\t\t\t\tif (!mem) {\n\t\t\t\t\terr = -EINVAL;\n\t\t\t\t\tgoto err1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tif (bytes > sge->length - offset)\n\t\t\tbytes = sge->length - offset;\n\n\t\tif (bytes > 0) {\n\t\t\tiova = sge->addr + offset;\n\n\t\t\terr = rxe_mem_copy(mem, iova, addr, bytes, dir, crcp);\n\t\t\tif (err)\n\t\t\t\tgoto err2;\n\n\t\t\toffset\t+= bytes;\n\t\t\tresid\t-= bytes;\n\t\t\tlength\t-= bytes;\n\t\t\taddr\t+= bytes;\n\t\t}\n\t}\n\n\tdma->sge_offset = offset;\n\tdma->resid\t= resid;\n\n\tif (mem)\n\t\trxe_drop_ref(mem);\n\n\treturn 0;\n\nerr2:\n\tif (mem)\n\t\trxe_drop_ref(mem);\nerr1:\n\treturn err;\n}\n\nint advance_dma_data(struct rxe_dma_info *dma, unsigned int length)\n{\n\tstruct rxe_sge\t\t*sge\t= &dma->sge[dma->cur_sge];\n\tint\t\t\toffset\t= dma->sge_offset;\n\tint\t\t\tresid\t= dma->resid;\n\n\twhile (length) {\n\t\tunsigned int bytes;\n\n\t\tif (offset >= sge->length) {\n\t\t\tsge++;\n\t\t\tdma->cur_sge++;\n\t\t\toffset = 0;\n\t\t\tif (dma->cur_sge >= dma->num_sge)\n\t\t\t\treturn -ENOSPC;\n\t\t}\n\n\t\tbytes = length;\n\n\t\tif (bytes > sge->length - offset)\n\t\t\tbytes = sge->length - offset;\n\n\t\toffset\t+= bytes;\n\t\tresid\t-= bytes;\n\t\tlength\t-= bytes;\n\t}\n\n\tdma->sge_offset = offset;\n\tdma->resid\t= resid;\n\n\treturn 0;\n}\n\n/* (1) find the mem (mr or mw) corresponding to lkey/rkey\n * depending on lookup_type\n * (2) verify that the (qp) pd matches the mem pd\n * (3) verify that the mem can support the requested access\n * (4) verify that mem state is valid\n */\nstruct rxe_mem *lookup_mem(struct rxe_pd *pd, int access, u32 key,\n\t\t\t enum lookup_type type)\n{\n\tstruct rxe_mem *mem;\n\tstruct rxe_dev *rxe = to_rdev(pd->ibpd.device);\n\tint index = key >> 8;\n\n\tif (index >= RXE_MIN_MR_INDEX && index <= RXE_MAX_MR_INDEX) {\n\t\tmem = rxe_pool_get_index(&rxe->mr_pool, index);\n\t\tif (!mem)\n\t\t\tgoto err1;\n\t} else {\n\t\tgoto err1;\n\t}\n\n\tif ((type == lookup_local && mem->lkey != key) ||\n\t (type == lookup_remote && mem->rkey != key))\n\t\tgoto err2;\n\n\tif (mem->pd != pd)\n\t\tgoto err2;\n\n\tif (access && !(access & mem->access))\n\t\tgoto err2;\n\n\tif (mem->state != RXE_MEM_STATE_VALID)\n\t\tgoto err2;\n\n\treturn mem;\n\nerr2:\n\trxe_drop_ref(mem);\nerr1:\n\treturn NULL;\n}\n\nint rxe_mem_map_pages(struct rxe_dev *rxe, struct rxe_mem *mem,\n\t\t u64 *page, int num_pages, u64 iova)\n{\n\tint i;\n\tint num_buf;\n\tint err;\n\tstruct rxe_map **map;\n\tstruct rxe_phys_buf *buf;\n\tint page_size;\n\n\tif (num_pages > mem->max_buf) {\n\t\terr = -EINVAL;\n\t\tgoto err1;\n\t}\n\n\tnum_buf\t\t= 0;\n\tpage_size\t= 1 << mem->page_shift;\n\tmap\t\t= mem->map;\n\tbuf\t\t= map[0]->buf;\n\n\tfor (i = 0; i < num_pages; i++) {\n\t\tbuf->addr = *page++;\n\t\tbuf->size = page_size;\n\t\tbuf++;\n\t\tnum_buf++;\n\n\t\tif (num_buf == RXE_BUF_PER_MAP) {\n\t\t\tmap++;\n\t\t\tbuf = map[0]->buf;\n\t\t\tnum_buf = 0;\n\t\t}\n\t}\n\n\tmem->iova\t= iova;\n\tmem->va\t\t= iova;\n\tmem->length\t= num_pages << mem->page_shift;\n\tmem->state\t= RXE_MEM_STATE_VALID;\n\n\treturn 0;\n\nerr1:\n\treturn err;\n}\n"},"func_before":{"kind":"string","value":"int mem_check_range(struct rxe_mem *mem, u64 iova, size_t length)\n{\n\tswitch (mem->type) {\n\tcase RXE_MEM_TYPE_DMA:\n\t\treturn 0;\n\n\tcase RXE_MEM_TYPE_MR:\n\tcase RXE_MEM_TYPE_FMR:\n\t\treturn ((iova < mem->iova) ||\n\t\t\t((iova + length) > (mem->iova + mem->length))) ?\n\t\t\t-EFAULT : 0;\n\n\tdefault:\n\t\treturn -EFAULT;\n\t}\n}"},"func_after":{"kind":"string","value":"int mem_check_range(struct rxe_mem *mem, u64 iova, size_t length)\n{\n\tswitch (mem->type) {\n\tcase RXE_MEM_TYPE_DMA:\n\t\treturn 0;\n\n\tcase RXE_MEM_TYPE_MR:\n\tcase RXE_MEM_TYPE_FMR:\n\t\tif (iova < mem->iova ||\n\t\t length > mem->length ||\n\t\t iova > mem->iova + mem->length - length)\n\t\t\treturn -EFAULT;\n\t\treturn 0;\n\n\tdefault:\n\t\treturn -EFAULT;\n\t}\n}"},"diff":{"kind":"string","value":"{'added': [(62, '\\t\\tif (iova < mem->iova ||'), (63, '\\t\\t length > mem->length ||'), (64, '\\t\\t iova > mem->iova + mem->length - length)'), (65, '\\t\\t\\treturn -EFAULT;'), (66, '\\t\\treturn 0;')], 'deleted': [(62, '\\t\\treturn ((iova < mem->iova) ||'), (63, '\\t\\t\\t((iova + length) > (mem->iova + mem->length))) ?'), (64, '\\t\\t\\t-EFAULT : 0;')]}"},"num_lines_added":{"kind":"number","value":5,"string":"5"},"num_lines_deleted":{"kind":"number","value":3,"string":"3"},"num_lines_in_file":{"kind":"number","value":467,"string":"467"},"num_tokens_in_file":{"kind":"number","value":2702,"string":"2,702"},"num_lines_in_method":{"kind":"number","value":14,"string":"14"},"num_tokens_in_method":{"kind":"number","value":75,"string":"75"},"method_complexity":{"kind":"number","value":6,"string":"6"},"repo":{"kind":"string","value":"https://github.com/torvalds/linux"},"cve_id":{"kind":"string","value":"CVE-2016-8636"},"cwe_id":{"kind":"string","value":"CWE-190"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":3,"numItemsPerPage":100,"numTotalItems":2401,"offset":300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTcyMTc5NTQ5OSwic3ViIjoiL2RhdGFzZXRzL2V1aXN1aDE1L21hc3Rlci12dWwiLCJleHAiOjE3MjE3OTkwOTksImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.2KPShOQN5BpXTFiOmnMMIwF1T5uZV16_BHwlJodOjnSgQc6IrO4TxJYRu44qhDc96tjxDDq6l23FCwAylvsmDQ","displayUrls":true},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false}">