s</b> is ephemeral.\n */\nstatic unsigned int\nrend_service_is_ephemeral(const struct rend_service_t *s)\n{\n return (s->directory == NULL);\n}\n\n/** Returns a escaped string representation of the service, <b>s</b>.\n */\nstatic const char *\nrend_service_escaped_dir(const struct rend_service_t *s)\n{\n return rend_service_is_ephemeral(s) ? \"[EPHEMERAL]\" : escaped(s->directory);\n}\n\n/** Return the number of rendezvous services we have configured. */\nint\nnum_rend_services(void)\n{\n if (!rend_service_list)\n return 0;\n return smartlist_len(rend_service_list);\n}\n\n/** Helper: free storage held by a single service authorized client entry. */\nvoid\nrend_authorized_client_free(rend_authorized_client_t *client)\n{\n if (!client)\n return;\n if (client->client_key)\n crypto_pk_free(client->client_key);\n if (client->client_name)\n memwipe(client->client_name, 0, strlen(client->client_name));\n tor_free(client->client_name);\n memwipe(client->descriptor_cookie, 0, sizeof(client->descriptor_cookie));\n tor_free(client);\n}\n\n/** Helper for strmap_free. */\nstatic void\nrend_authorized_client_strmap_item_free(void *authorized_client)\n{\n rend_authorized_client_free(authorized_client);\n}\n\n/** Release the storage held by <b>service</b>.\n */\nSTATIC void\nrend_service_free(rend_service_t *service)\n{\n if (!service)\n return;\n\n tor_free(service->directory);\n if (service->ports) {\n SMARTLIST_FOREACH(service->ports, rend_service_port_config_t*, p,\n rend_service_port_config_free(p));\n smartlist_free(service->ports);\n }\n if (service->private_key)\n crypto_pk_free(service->private_key);\n if (service->intro_nodes) {\n SMARTLIST_FOREACH(service->intro_nodes, rend_intro_point_t *, intro,\n rend_intro_point_free(intro););\n smartlist_free(service->intro_nodes);\n }\n if (service->expiring_nodes) {\n SMARTLIST_FOREACH(service->expiring_nodes, rend_intro_point_t *, intro,\n rend_intro_point_free(intro););\n smartlist_free(service->expiring_nodes);\n }\n\n rend_service_descriptor_free(service->desc);\n if (service->clients) {\n SMARTLIST_FOREACH(service->clients, rend_authorized_client_t *, c,\n rend_authorized_client_free(c););\n smartlist_free(service->clients);\n }\n if (service->accepted_intro_dh_parts) {\n replaycache_free(service->accepted_intro_dh_parts);\n }\n tor_free(service);\n}\n\n/** Release all the storage held in rend_service_list.\n */\nvoid\nrend_service_free_all(void)\n{\n if (!rend_service_list)\n return;\n\n SMARTLIST_FOREACH(rend_service_list, rend_service_t*, ptr,\n rend_service_free(ptr));\n smartlist_free(rend_service_list);\n rend_service_list = NULL;\n}\n\n/** Validate <b>service</b> and add it to <b>service_list</b>, or to\n * the global rend_service_list if <b>service_list</b> is NULL.\n * Return 0 on success. On failure, free <b>service</b> and return -1.\n * Takes ownership of <b>service</b>.\n */\nstatic int\nrend_add_service(smartlist_t *service_list, rend_service_t *service)\n{\n int i;\n rend_service_port_config_t *p;\n\n tor_assert(service);\n\n smartlist_t *s_list = rend_get_service_list_mutable(service_list);\n /* We must have a service list, even if it's a temporary one, so we can\n * check for duplicate services */\n if (BUG(!s_list)) {\n return -1;\n }\n\n service->intro_nodes = smartlist_new();\n service->expiring_nodes = smartlist_new();\n\n if (service->max_streams_per_circuit < 0) {\n log_warn(LD_CONFIG, \"Hidden service (%s) configured with negative max \"\n \"streams per circuit.\",\n rend_service_escaped_dir(service));\n rend_service_free(service);\n return -1;\n }\n\n if (service->max_streams_close_circuit < 0 ||\n service->max_streams_close_circuit > 1) {\n log_warn(LD_CONFIG, \"Hidden service (%s) configured with invalid \"\n \"max streams handling.\",\n rend_service_escaped_dir(service));\n rend_service_free(service);\n return -1;\n }\n\n if (service->auth_type != REND_NO_AUTH &&\n (!service->clients ||\n smartlist_len(service->clients) == 0)) {\n log_warn(LD_CONFIG, \"Hidden service (%s) with client authorization but no \"\n \"clients.\",\n rend_service_escaped_dir(service));\n rend_service_free(service);\n return -1;\n }\n\n if (!service->ports || !smartlist_len(service->ports)) {\n log_warn(LD_CONFIG, \"Hidden service (%s) with no ports configured.\",\n rend_service_escaped_dir(service));\n rend_service_free(service);\n return -1;\n } else {\n int dupe = 0;\n /* XXX This duplicate check has two problems:\n *\n * a) It's O(n^2), but the same comment from the bottom of\n * rend_config_services() should apply.\n *\n * b) We only compare directory paths as strings, so we can't\n * detect two distinct paths that specify the same directory\n * (which can arise from symlinks, case-insensitivity, bind\n * mounts, etc.).\n *\n * It also can't detect that two separate Tor instances are trying\n * to use the same HiddenServiceDir; for that, we would need a\n * lock file. But this is enough to detect a simple mistake that\n * at least one person has actually made.\n */\n tor_assert(s_list);\n if (!rend_service_is_ephemeral(service)) {\n /* Skip dupe for ephemeral services. */\n SMARTLIST_FOREACH(s_list, rend_service_t*, ptr,\n dupe = dupe ||\n !strcmp(ptr->directory, service->directory));\n if (dupe) {\n log_warn(LD_REND, \"Another hidden service is already configured for \"\n \"directory %s.\",\n rend_service_escaped_dir(service));\n rend_service_free(service);\n return -1;\n }\n }\n log_debug(LD_REND,\"Configuring service with directory %s\",\n rend_service_escaped_dir(service));\n for (i = 0; i < smartlist_len(service->ports); ++i) {\n p = smartlist_get(service->ports, i);\n if (!(p->is_unix_addr)) {\n log_debug(LD_REND,\n \"Service maps port %d to %s\",\n p->virtual_port,\n fmt_addrport(&p->real_addr, p->real_port));\n } else {\n#ifdef HAVE_SYS_UN_H\n log_debug(LD_REND,\n \"Service maps port %d to socket at \\\"%s\\\"\",\n p->virtual_port, p->unix_addr);\n#else\n log_warn(LD_BUG,\n \"Service maps port %d to an AF_UNIX socket, but we \"\n \"have no AF_UNIX support on this platform. This is \"\n \"probably a bug.\",\n p->virtual_port);\n rend_service_free(service);\n return -1;\n#endif /* defined(HAVE_SYS_UN_H) */\n }\n }\n /* The service passed all the checks */\n tor_assert(s_list);\n smartlist_add(s_list, service);\n return 0;\n }\n /* NOTREACHED */\n}\n\n/** Return a new rend_service_port_config_t with its path set to\n * <b>socket_path</b> or empty if <b>socket_path</b> is NULL */\nstatic rend_service_port_config_t *\nrend_service_port_config_new(const char *socket_path)\n{\n if (!socket_path)\n return tor_malloc_zero(sizeof(rend_service_port_config_t) + 1);\n\n const size_t pathlen = strlen(socket_path) + 1;\n rend_service_port_config_t *conf =\n tor_malloc_zero(sizeof(rend_service_port_config_t) + pathlen);\n memcpy(conf->unix_addr, socket_path, pathlen);\n conf->is_unix_addr = 1;\n return conf;\n}\n\n/** Parses a virtual-port to real-port/socket mapping separated by\n * the provided separator and returns a new rend_service_port_config_t,\n * or NULL and an optional error string on failure.\n *\n * The format is: VirtualPort SEP (IP|RealPort|IP:RealPort|'socket':path)?\n *\n * IP defaults to 127.0.0.1; RealPort defaults to VirtualPort.\n */\nrend_service_port_config_t *\nrend_service_parse_port_config(const char *string, const char *sep,\n char **err_msg_out)\n{\n smartlist_t *sl;\n int virtport;\n int realport = 0;\n uint16_t p;\n tor_addr_t addr;\n rend_service_port_config_t *result = NULL;\n unsigned int is_unix_addr = 0;\n const char *socket_path = NULL;\n char *err_msg = NULL;\n char *addrport = NULL;\n\n sl = smartlist_new();\n smartlist_split_string(sl, string, sep,\n SPLIT_SKIP_SPACE|SPLIT_IGNORE_BLANK, 2);\n if (smartlist_len(sl) < 1 || BUG(smartlist_len(sl) > 2)) {\n err_msg = tor_strdup(\"Bad syntax in hidden service port configuration.\");\n goto err;\n }\n virtport = (int)tor_parse_long(smartlist_get(sl,0), 10, 1, 65535, NULL,NULL);\n if (!virtport) {\n tor_asprintf(&err_msg, \"Missing or invalid port %s in hidden service \"\n \"port configuration\", escaped(smartlist_get(sl,0)));\n\n goto err;\n }\n if (smartlist_len(sl) == 1) {\n /* No addr:port part; use default. */\n realport = virtport;\n tor_addr_from_ipv4h(&addr, 0x7F000001u); /* 127.0.0.1 */\n } else {\n int ret;\n\n const char *addrport_element = smartlist_get(sl,1);\n const char *rest = NULL;\n int is_unix;\n ret = port_cfg_line_extract_addrport(addrport_element, &addrport,\n &is_unix, &rest);\n if (ret < 0) {\n tor_asprintf(&err_msg, \"Couldn't process address <%s> from hidden \"\n \"service configuration\", addrport_element);\n goto err;\n }\n if (is_unix) {\n socket_path = addrport;\n is_unix_addr = 1;\n } else if (strchr(addrport, ':') || strchr(addrport, '.')) {\n /* else try it as an IP:port pair if it has a : or . in it */\n if (tor_addr_port_lookup(addrport, &addr, &p)<0) {\n err_msg = tor_strdup(\"Unparseable address in hidden service port \"\n \"configuration.\");\n goto err;\n }\n realport = p?p:virtport;\n } else {\n /* No addr:port, no addr -- must be port. */\n realport = (int)tor_parse_long(addrport, 10, 1, 65535, NULL, NULL);\n if (!realport) {\n tor_asprintf(&err_msg, \"Unparseable or out-of-range port %s in \"\n \"hidden service port configuration.\",\n escaped(addrport));\n goto err;\n }\n tor_addr_from_ipv4h(&addr, 0x7F000001u); /* Default to 127.0.0.1 */\n }\n }\n\n /* Allow room for unix_addr */\n result = rend_service_port_config_new(socket_path);\n result->virtual_port = virtport;\n result->is_unix_addr = is_unix_addr;\n if (!is_unix_addr) {\n result->real_port = realport;\n tor_addr_copy(&result->real_addr, &addr);\n result->unix_addr[0] = '\\0';\n }\n\n err:\n tor_free(addrport);\n if (err_msg_out != NULL) {\n *err_msg_out = err_msg;\n } else {\n tor_free(err_msg);\n }\n SMARTLIST_FOREACH(sl, char *, c, tor_free(c));\n smartlist_free(sl);\n\n return result;\n}\n\n/** Release all storage held in a rend_service_port_config_t. */\nvoid\nrend_service_port_config_free(rend_service_port_config_t *p)\n{\n tor_free(p);\n}\n\n/* Check the directory for <b>service</b>, and add the service to\n * <b>service_list</b>, or to the global list if <b>service_list</b> is NULL.\n * Only add the service to the list if <b>validate_only</b> is false.\n * If <b>validate_only</b> is true, free the service.\n * If <b>service</b> is NULL, ignore it, and return 0.\n * Returns 0 on success, and -1 on failure.\n * Takes ownership of <b>service</b>, either freeing it, or adding it to the\n * global service list.\n */\nSTATIC int\nrend_service_check_dir_and_add(smartlist_t *service_list,\n const or_options_t *options,\n rend_service_t *service,\n int validate_only)\n{\n if (!service) {\n /* It is ok for a service to be NULL, this means there are no services */\n return 0;\n }\n\n if (rend_service_check_private_dir(options, service, !validate_only)\n < 0) {\n rend_service_free(service);\n return -1;\n }\n\n smartlist_t *s_list = rend_get_service_list_mutable(service_list);\n /* We must have a service list, even if it's a temporary one, so we can\n * check for duplicate services */\n if (BUG(!s_list)) {\n return -1;\n }\n return rend_add_service(s_list, service);\n}\n\n/* If this is a reload and there were hidden services configured before,\n * keep the introduction points that are still needed and close the\n * other ones. */\nSTATIC void\nprune_services_on_reload(smartlist_t *old_service_list,\n smartlist_t *new_service_list)\n{\n origin_circuit_t *ocirc = NULL;\n smartlist_t *surviving_services = NULL;\n\n tor_assert(old_service_list);\n tor_assert(new_service_list);\n\n /* This contains all _existing_ services that survives the relaod that is\n * that haven't been removed from the configuration. The difference between\n * this list and the new service list is that the new list can possibly\n * contain newly configured service that have no introduction points opened\n * yet nor key material loaded or generated. */\n surviving_services = smartlist_new();\n\n /* Preserve the existing ephemeral services.\n *\n * This is the ephemeral service equivalent of the \"Copy introduction\n * points to new services\" block, except there's no copy required since\n * the service structure isn't regenerated.\n *\n * After this is done, all ephemeral services will be:\n * * Removed from old_service_list, so the equivalent non-ephemeral code\n * will not attempt to preserve them.\n * * Added to the new_service_list (that previously only had the\n * services listed in the configuration).\n * * Added to surviving_services, which is the list of services that\n * will NOT have their intro point closed.\n */\n SMARTLIST_FOREACH_BEGIN(old_service_list, rend_service_t *, old) {\n if (rend_service_is_ephemeral(old)) {\n SMARTLIST_DEL_CURRENT(old_service_list, old);\n smartlist_add(surviving_services, old);\n smartlist_add(new_service_list, old);\n }\n } SMARTLIST_FOREACH_END(old);\n\n /* Copy introduction points to new services. This is O(n^2), but it's only\n * called on reconfigure, so it's ok performance wise. */\n SMARTLIST_FOREACH_BEGIN(new_service_list, rend_service_t *, new) {\n SMARTLIST_FOREACH_BEGIN(old_service_list, rend_service_t *, old) {\n /* Skip ephemeral services as we only want to copy introduction points\n * from current services to newly configured one that already exists.\n * The same directory means it's the same service. */\n if (rend_service_is_ephemeral(new) || rend_service_is_ephemeral(old) ||\n strcmp(old->directory, new->directory)) {\n continue;\n }\n smartlist_add_all(new->intro_nodes, old->intro_nodes);\n smartlist_clear(old->intro_nodes);\n smartlist_add_all(new->expiring_nodes, old->expiring_nodes);\n smartlist_clear(old->expiring_nodes);\n /* This regular service will survive the closing IPs step after. */\n smartlist_add(surviving_services, old);\n break;\n } SMARTLIST_FOREACH_END(old);\n } SMARTLIST_FOREACH_END(new);\n\n /* For every service introduction circuit we can find, see if we have a\n * matching surviving configured service. If not, close the circuit. */\n while ((ocirc = circuit_get_next_service_intro_circ(ocirc))) {\n int keep_it = 0;\n tor_assert(ocirc->rend_data);\n SMARTLIST_FOREACH_BEGIN(surviving_services, const rend_service_t *, s) {\n if (rend_circuit_pk_digest_eq(ocirc, (uint8_t *) s->pk_digest)) {\n /* Keep this circuit as we have a matching configured service. */\n keep_it = 1;\n break;\n }\n } SMARTLIST_FOREACH_END(s);\n if (keep_it) {\n continue;\n }\n log_info(LD_REND, \"Closing intro point %s for service %s.\",\n safe_str_client(extend_info_describe(\n ocirc->build_state->chosen_exit)),\n safe_str_client(rend_data_get_address(ocirc->rend_data)));\n /* Reason is FINISHED because service has been removed and thus the\n * circuit is considered old/uneeded. */\n circuit_mark_for_close(TO_CIRCUIT(ocirc), END_CIRC_REASON_FINISHED);\n }\n smartlist_free(surviving_services);\n}\n\n/** Set up rend_service_list, based on the values of HiddenServiceDir and\n * HiddenServicePort in <b>options</b>. Return 0 on success and -1 on\n * failure. (If <b>validate_only</b> is set, parse, warn and return as\n * normal, but don't actually change the configured services.)\n */\nint\nrend_config_services(const or_options_t *options, int validate_only)\n{\n config_line_t *line;\n rend_service_t *service = NULL;\n rend_service_port_config_t *portcfg;\n smartlist_t *old_service_list = NULL;\n smartlist_t *temp_service_list = NULL;\n int ok = 0;\n int rv = -1;\n\n /* Use a temporary service list, so that we can check the new services'\n * consistency with each other */\n temp_service_list = smartlist_new();\n\n for (line = options->RendConfigLines; line; line = line->next) {\n if (!strcasecmp(line->key, \"HiddenServiceDir\")) {\n /* register the service we just finished parsing\n * this code registers every service except the last one parsed,\n * which is registered below the loop */\n if (rend_service_check_dir_and_add(temp_service_list, options, service,\n validate_only) < 0) {\n service = NULL;\n goto free_and_return;\n }\n service = tor_malloc_zero(sizeof(rend_service_t));\n service->directory = tor_strdup(line->value);\n service->ports = smartlist_new();\n service->intro_period_started = time(NULL);\n service->n_intro_points_wanted = NUM_INTRO_POINTS_DEFAULT;\n continue;\n }\n if (!service) {\n log_warn(LD_CONFIG, \"%s with no preceding HiddenServiceDir directive\",\n line->key);\n goto free_and_return;\n }\n if (!strcasecmp(line->key, \"HiddenServicePort\")) {\n char *err_msg = NULL;\n portcfg = rend_service_parse_port_config(line->value, \" \", &err_msg);\n if (!portcfg) {\n if (err_msg)\n log_warn(LD_CONFIG, \"%s\", err_msg);\n tor_free(err_msg);\n goto free_and_return;\n }\n tor_assert(!err_msg);\n smartlist_add(service->ports, portcfg);\n } else if (!strcasecmp(line->key, \"HiddenServiceAllowUnknownPorts\")) {\n service->allow_unknown_ports = (int)tor_parse_long(line->value,\n 10, 0, 1, &ok, NULL);\n if (!ok) {\n log_warn(LD_CONFIG,\n \"HiddenServiceAllowUnknownPorts should be 0 or 1, not %s\",\n line->value);\n goto free_and_return;\n }\n log_info(LD_CONFIG,\n \"HiddenServiceAllowUnknownPorts=%d for %s\",\n (int)service->allow_unknown_ports,\n rend_service_escaped_dir(service));\n } else if (!strcasecmp(line->key,\n \"HiddenServiceDirGroupReadable\")) {\n service->dir_group_readable = (int)tor_parse_long(line->value,\n 10, 0, 1, &ok, NULL);\n if (!ok) {\n log_warn(LD_CONFIG,\n \"HiddenServiceDirGroupReadable should be 0 or 1, not %s\",\n line->value);\n goto free_and_return;\n }\n log_info(LD_CONFIG,\n \"HiddenServiceDirGroupReadable=%d for %s\",\n service->dir_group_readable,\n rend_service_escaped_dir(service));\n } else if (!strcasecmp(line->key, \"HiddenServiceMaxStreams\")) {\n service->max_streams_per_circuit = (int)tor_parse_long(line->value,\n 10, 0, 65535, &ok, NULL);\n if (!ok) {\n log_warn(LD_CONFIG,\n \"HiddenServiceMaxStreams should be between 0 and %d, not %s\",\n 65535, line->value);\n goto free_and_return;\n }\n log_info(LD_CONFIG,\n \"HiddenServiceMaxStreams=%d for %s\",\n service->max_streams_per_circuit,\n rend_service_escaped_dir(service));\n } else if (!strcasecmp(line->key, \"HiddenServiceMaxStreamsCloseCircuit\")) {\n service->max_streams_close_circuit = (int)tor_parse_long(line->value,\n 10, 0, 1, &ok, NULL);\n if (!ok) {\n log_warn(LD_CONFIG,\n \"HiddenServiceMaxStreamsCloseCircuit should be 0 or 1, \"\n \"not %s\",\n line->value);\n goto free_and_return;\n }\n log_info(LD_CONFIG,\n \"HiddenServiceMaxStreamsCloseCircuit=%d for %s\",\n (int)service->max_streams_close_circuit,\n rend_service_escaped_dir(service));\n } else if (!strcasecmp(line->key, \"HiddenServiceNumIntroductionPoints\")) {\n service->n_intro_points_wanted =\n (unsigned int) tor_parse_long(line->value, 10,\n 0, NUM_INTRO_POINTS_MAX, &ok, NULL);\n if (!ok) {\n log_warn(LD_CONFIG,\n \"HiddenServiceNumIntroductionPoints \"\n \"should be between %d and %d, not %s\",\n 0, NUM_INTRO_POINTS_MAX, line->value);\n goto free_and_return;\n }\n log_info(LD_CONFIG, \"HiddenServiceNumIntroductionPoints=%d for %s\",\n service->n_intro_points_wanted,\n rend_service_escaped_dir(service));\n } else if (!strcasecmp(line->key, \"HiddenServiceAuthorizeClient\")) {\n /* Parse auth type and comma-separated list of client names and add a\n * rend_authorized_client_t for each client to the service's list\n * of authorized clients. */\n smartlist_t *type_names_split, *clients;\n const char *authname;\n int num_clients;\n if (service->auth_type != REND_NO_AUTH) {\n log_warn(LD_CONFIG, \"Got multiple HiddenServiceAuthorizeClient \"\n \"lines for a single service.\");\n goto free_and_return;\n }\n type_names_split = smartlist_new();\n smartlist_split_string(type_names_split, line->value, \" \", 0, 2);\n if (smartlist_len(type_names_split) < 1) {\n log_warn(LD_BUG, \"HiddenServiceAuthorizeClient has no value. This \"\n \"should have been prevented when parsing the \"\n \"configuration.\");\n goto free_and_return;\n }\n authname = smartlist_get(type_names_split, 0);\n if (!strcasecmp(authname, \"basic\")) {\n service->auth_type = REND_BASIC_AUTH;\n } else if (!strcasecmp(authname, \"stealth\")) {\n service->auth_type = REND_STEALTH_AUTH;\n } else {\n log_warn(LD_CONFIG, \"HiddenServiceAuthorizeClient contains \"\n \"unrecognized auth-type '%s'. Only 'basic' or 'stealth' \"\n \"are recognized.\",\n (char *) smartlist_get(type_names_split, 0));\n SMARTLIST_FOREACH(type_names_split, char *, cp, tor_free(cp));\n smartlist_free(type_names_split);\n goto free_and_return;\n }\n service->clients = smartlist_new();\n if (smartlist_len(type_names_split) < 2) {\n log_warn(LD_CONFIG, \"HiddenServiceAuthorizeClient contains \"\n \"auth-type '%s', but no client names.\",\n service->auth_type == REND_BASIC_AUTH ? \"basic\" : \"stealth\");\n SMARTLIST_FOREACH(type_names_split, char *, cp, tor_free(cp));\n smartlist_free(type_names_split);\n continue;\n }\n clients = smartlist_new();\n smartlist_split_string(clients, smartlist_get(type_names_split, 1),\n \",\", SPLIT_SKIP_SPACE, 0);\n SMARTLIST_FOREACH(type_names_split, char *, cp, tor_free(cp));\n smartlist_free(type_names_split);\n /* Remove duplicate client names. */\n num_clients = smartlist_len(clients);\n smartlist_sort_strings(clients);\n smartlist_uniq_strings(clients);\n if (smartlist_len(clients) < num_clients) {\n log_info(LD_CONFIG, \"HiddenServiceAuthorizeClient contains %d \"\n \"duplicate client name(s); removing.\",\n num_clients - smartlist_len(clients));\n num_clients = smartlist_len(clients);\n }\n SMARTLIST_FOREACH_BEGIN(clients, const char *, client_name)\n {\n rend_authorized_client_t *client;\n if (!rend_valid_client_name(client_name)) {\n log_warn(LD_CONFIG, \"HiddenServiceAuthorizeClient contains an \"\n \"illegal client name: '%s'. Names must be \"\n \"between 1 and %d characters and contain \"\n \"only [A-Za-z0-9+_-].\",\n client_name, REND_CLIENTNAME_MAX_LEN);\n SMARTLIST_FOREACH(clients, char *, cp, tor_free(cp));\n smartlist_free(clients);\n goto free_and_return;\n }\n client = tor_malloc_zero(sizeof(rend_authorized_client_t));\n client->client_name = tor_strdup(client_name);\n smartlist_add(service->clients, client);\n log_debug(LD_REND, \"Adding client name '%s'\", client_name);\n }\n SMARTLIST_FOREACH_END(client_name);\n SMARTLIST_FOREACH(clients, char *, cp, tor_free(cp));\n smartlist_free(clients);\n /* Ensure maximum number of clients. */\n if ((service->auth_type == REND_BASIC_AUTH &&\n smartlist_len(service->clients) > 512) ||\n (service->auth_type == REND_STEALTH_AUTH &&\n smartlist_len(service->clients) > 16)) {\n log_warn(LD_CONFIG, \"HiddenServiceAuthorizeClient contains %d \"\n \"client authorization entries, but only a \"\n \"maximum of %d entries is allowed for \"\n \"authorization type '%s'.\",\n smartlist_len(service->clients),\n service->auth_type == REND_BASIC_AUTH ? 512 : 16,\n service->auth_type == REND_BASIC_AUTH ? \"basic\" : \"stealth\");\n goto free_and_return;\n }\n } else {\n tor_assert(!strcasecmp(line->key, \"HiddenServiceVersion\"));\n if (strcmp(line->value, \"2\")) {\n log_warn(LD_CONFIG,\n \"The only supported HiddenServiceVersion is 2.\");\n goto free_and_return;\n }\n }\n }\n /* register the final service after we have finished parsing all services\n * this code only registers the last service, other services are registered\n * within the loop. It is ok for this service to be NULL, it is ignored. */\n if (rend_service_check_dir_and_add(temp_service_list, options, service,\n validate_only) < 0) {\n service = NULL;\n goto free_and_return;\n }\n service = NULL;\n\n /* Free the newly added services if validating */\n if (validate_only) {\n rv = 0;\n goto free_and_return;\n }\n\n /* Otherwise, use the newly added services as the new service list\n * Since we have now replaced the global service list, from this point on we\n * must succeed, or die trying. */\n old_service_list = rend_service_list;\n rend_service_list = temp_service_list;\n temp_service_list = NULL;\n\n /* If this is a reload and there were hidden services configured before,\n * keep the introduction points that are still needed and close the\n * other ones. */\n if (old_service_list && !validate_only) {\n prune_services_on_reload(old_service_list, rend_service_list);\n /* Every remaining service in the old list have been removed from the\n * configuration so clean them up safely. */\n SMARTLIST_FOREACH(old_service_list, rend_service_t *, s,\n rend_service_free(s));\n smartlist_free(old_service_list);\n }\n\n return 0;\n free_and_return:\n rend_service_free(service);\n SMARTLIST_FOREACH(temp_service_list, rend_service_t *, ptr,\n rend_service_free(ptr));\n smartlist_free(temp_service_list);\n return rv;\n}\n\n/** Add the ephemeral service <b>pk</b>/<b>ports</b> if possible, using\n * client authorization <b>auth_type</b> and an optional list of\n * rend_authorized_client_t in <b>auth_clients</b>, with\n * <b>max_streams_per_circuit</b> streams allowed per rendezvous circuit,\n * and circuit closure on max streams being exceeded set by\n * <b>max_streams_close_circuit</b>.\n *\n * Ownership of pk, ports, and auth_clients is passed to this routine.\n * Regardless of success/failure, callers should not touch these values\n * after calling this routine, and may assume that correct cleanup has\n * been done on failure.\n *\n * Return an appropriate rend_service_add_ephemeral_status_t.\n */\nrend_service_add_ephemeral_status_t\nrend_service_add_ephemeral(crypto_pk_t *pk,\n smartlist_t *ports,\n int max_streams_per_circuit,\n int max_streams_close_circuit,\n rend_auth_type_t auth_type,\n smartlist_t *auth_clients,\n char **service_id_out)\n{\n *service_id_out = NULL;\n /* Allocate the service structure, and initialize the key, and key derived\n * parameters.\n */\n rend_service_t *s = tor_malloc_zero(sizeof(rend_service_t));\n s->directory = NULL; /* This indicates the service is ephemeral. */\n s->private_key = pk;\n s->auth_type = auth_type;\n s->clients = auth_clients;\n s->ports = ports;\n s->intro_period_started = time(NULL);\n s->n_intro_points_wanted = NUM_INTRO_POINTS_DEFAULT;\n s->max_streams_per_circuit = max_streams_per_circuit;\n s->max_streams_close_circuit = max_streams_close_circuit;\n if (rend_service_derive_key_digests(s) < 0) {\n rend_service_free(s);\n return RSAE_BADPRIVKEY;\n }\n\n if (!s->ports || smartlist_len(s->ports) == 0) {\n log_warn(LD_CONFIG, \"At least one VIRTPORT/TARGET must be specified.\");\n rend_service_free(s);\n return RSAE_BADVIRTPORT;\n }\n if (s->auth_type != REND_NO_AUTH &&\n (!s->clients || smartlist_len(s->clients) == 0)) {\n log_warn(LD_CONFIG, \"At least one authorized client must be specified.\");\n rend_service_free(s);\n return RSAE_BADAUTH;\n }\n\n /* Enforcing pk/id uniqueness should be done by rend_service_load_keys(), but\n * it's not, see #14828.\n */\n if (rend_service_get_by_pk_digest(s->pk_digest)) {\n log_warn(LD_CONFIG, \"Onion Service private key collides with an \"\n \"existing service.\");\n rend_service_free(s);\n return RSAE_ADDREXISTS;\n }\n if (rend_service_get_by_service_id(s->service_id)) {\n log_warn(LD_CONFIG, \"Onion Service id collides with an existing service.\");\n rend_service_free(s);\n return RSAE_ADDREXISTS;\n }\n\n /* Initialize the service. */\n if (rend_add_service(NULL, s)) {\n return RSAE_INTERNAL;\n }\n *service_id_out = tor_strdup(s->service_id);\n\n log_debug(LD_CONFIG, \"Added ephemeral Onion Service: %s\", s->service_id);\n return RSAE_OKAY;\n}\n\n/** Remove the ephemeral service <b>service_id</b> if possible. Returns 0 on\n * success, and -1 on failure.\n */\nint\nrend_service_del_ephemeral(const char *service_id)\n{\n rend_service_t *s;\n if (!rend_valid_service_id(service_id)) {\n log_warn(LD_CONFIG, \"Requested malformed Onion Service id for removal.\");\n return -1;\n }\n if ((s = rend_service_get_by_service_id(service_id)) == NULL) {\n log_warn(LD_CONFIG, \"Requested non-existent Onion Service id for \"\n \"removal.\");\n return -1;\n }\n if (!rend_service_is_ephemeral(s)) {\n log_warn(LD_CONFIG, \"Requested non-ephemeral Onion Service for removal.\");\n return -1;\n }\n\n /* Kill the intro point circuit for the Onion Service, and remove it from\n * the list. Closing existing connections is the application's problem.\n *\n * XXX: As with the comment in rend_config_services(), a nice abstraction\n * would be ideal here, but for now just duplicate the code.\n */\n SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, circ) {\n if (!circ->marked_for_close &&\n (circ->purpose == CIRCUIT_PURPOSE_S_ESTABLISH_INTRO ||\n circ->purpose == CIRCUIT_PURPOSE_S_INTRO)) {\n origin_circuit_t *oc = TO_ORIGIN_CIRCUIT(circ);\n tor_assert(oc->rend_data);\n if (!rend_circuit_pk_digest_eq(oc, (uint8_t *) s->pk_digest)) {\n continue;\n }\n log_debug(LD_REND, \"Closing intro point %s for service %s.\",\n safe_str_client(extend_info_describe(\n oc->build_state->chosen_exit)),\n rend_data_get_address(oc->rend_data));\n circuit_mark_for_close(circ, END_CIRC_REASON_FINISHED);\n }\n } SMARTLIST_FOREACH_END(circ);\n smartlist_remove(rend_service_list, s);\n rend_service_free(s);\n\n log_debug(LD_CONFIG, \"Removed ephemeral Onion Service: %s\", service_id);\n\n return 0;\n}\n\n/** Replace the old value of <b>service</b>-\\>desc with one that reflects\n * the other fields in service.\n */\nstatic void\nrend_service_update_descriptor(rend_service_t *service)\n{\n rend_service_descriptor_t *d;\n origin_circuit_t *circ;\n int i;\n\n rend_service_descriptor_free(service->desc);\n service->desc = NULL;\n\n d = service->desc = tor_malloc_zero(sizeof(rend_service_descriptor_t));\n d->pk = crypto_pk_dup_key(service->private_key);\n d->timestamp = time(NULL);\n d->timestamp -= d->timestamp % 3600; /* Round down to nearest hour */\n d->intro_nodes = smartlist_new();\n /* Support intro protocols 2 and 3. */\n d->protocols = (1 << 2) + (1 << 3);\n\n for (i = 0; i < smartlist_len(service->intro_nodes); ++i) {\n rend_intro_point_t *intro_svc = smartlist_get(service->intro_nodes, i);\n rend_intro_point_t *intro_desc;\n\n /* This intro point won't be listed in the descriptor... */\n intro_svc->listed_in_last_desc = 0;\n\n circ = find_intro_circuit(intro_svc, service->pk_digest);\n if (!circ || circ->base_.purpose != CIRCUIT_PURPOSE_S_INTRO) {\n /* This intro point's circuit isn't finished yet. Don't list it. */\n continue;\n }\n\n /* ...unless this intro point is listed in the descriptor. */\n intro_svc->listed_in_last_desc = 1;\n\n /* We have an entirely established intro circuit. Publish it in\n * our descriptor. */\n intro_desc = tor_malloc_zero(sizeof(rend_intro_point_t));\n intro_desc->extend_info = extend_info_dup(intro_svc->extend_info);\n if (intro_svc->intro_key)\n intro_desc->intro_key = crypto_pk_dup_key(intro_svc->intro_key);\n smartlist_add(d->intro_nodes, intro_desc);\n\n if (intro_svc->time_published == -1) {\n /* We are publishing this intro point in a descriptor for the\n * first time -- note the current time in the service's copy of\n * the intro point. */\n intro_svc->time_published = time(NULL);\n }\n }\n}\n\n/* Allocate and return a string containing the path to file_name in\n * service->directory. Asserts that service has a directory.\n * This function will never return NULL.\n * The caller must free this path. */\nstatic char *\nrend_service_path(const rend_service_t *service, const char *file_name)\n{\n char *file_path = NULL;\n\n tor_assert(service->directory);\n\n /* Can never fail: asserts rather than leaving file_path NULL. */\n tor_asprintf(&file_path, \"%s%s%s\",\n service->directory, PATH_SEPARATOR, file_name);\n\n return file_path;\n}\n\n/* Allocate and return a string containing the path to the single onion\n * service poison file in service->directory. Asserts that service has a\n * directory.\n * The caller must free this path. */\nSTATIC char *\nrend_service_sos_poison_path(const rend_service_t *service)\n{\n return rend_service_path(service, sos_poison_fname);\n}\n\n/** Return True if hidden services <b>service</b> has been poisoned by single\n * onion mode. */\nstatic int\nservice_is_single_onion_poisoned(const rend_service_t *service)\n{\n char *poison_fname = NULL;\n file_status_t fstatus;\n\n /* Passing a NULL service is a bug */\n if (BUG(!service)) {\n return 0;\n }\n\n if (rend_service_is_ephemeral(service)) {\n return 0;\n }\n\n poison_fname = rend_service_sos_poison_path(service);\n\n fstatus = file_status(poison_fname);\n tor_free(poison_fname);\n\n /* If this fname is occupied, the hidden service has been poisoned.\n * fstatus can be FN_ERROR if the service directory does not exist, in that\n * case, there is obviously no private key. */\n if (fstatus == FN_FILE || fstatus == FN_EMPTY) {\n return 1;\n }\n\n return 0;\n}\n\n/* Return 1 if the private key file for service exists and has a non-zero size,\n * and 0 otherwise. */\nstatic int\nrend_service_private_key_exists(const rend_service_t *service)\n{\n char *private_key_path = rend_service_path(service, private_key_fname);\n const file_status_t private_key_status = file_status(private_key_path);\n tor_free(private_key_path);\n /* Only non-empty regular private key files could have been used before.\n * fstatus can be FN_ERROR if the service directory does not exist, in that\n * case, there is obviously no private key. */\n return private_key_status == FN_FILE;\n}\n\n/** Check the single onion service poison state of the directory for s:\n * - If the service is poisoned, and we are in Single Onion Mode,\n * return 0,\n * - If the service is not poisoned, and we are not in Single Onion Mode,\n * return 0,\n * - Otherwise, the poison state is invalid: the service was created in one\n * mode, and is being used in the other, return -1.\n * Hidden service directories without keys are always considered consistent.\n * They will be poisoned after their directory is created (if needed). */\nSTATIC int\nrend_service_verify_single_onion_poison(const rend_service_t* s,\n const or_options_t* options)\n{\n /* Passing a NULL service is a bug */\n if (BUG(!s)) {\n return -1;\n }\n\n /* Ephemeral services are checked at ADD_ONION time */\n if (BUG(rend_service_is_ephemeral(s))) {\n return -1;\n }\n\n /* Service is expected to have a directory */\n if (BUG(!s->directory)) {\n return -1;\n }\n\n /* Services without keys are always ok - their keys will only ever be used\n * in the current mode */\n if (!rend_service_private_key_exists(s)) {\n return 0;\n }\n\n /* The key has been used before in a different mode */\n if (service_is_single_onion_poisoned(s) !=\n rend_service_non_anonymous_mode_enabled(options)) {\n return -1;\n }\n\n /* The key exists and is consistent with the current mode */\n return 0;\n}\n\n/*** Helper for rend_service_poison_new_single_onion_dir(). Add a file to\n * the hidden service directory for s that marks it as a single onion service.\n * Tor must be in single onion mode before calling this function, and the\n * service directory must already have been created.\n * Returns 0 when a directory is successfully poisoned, or if it is already\n * poisoned. Returns -1 on a failure to read the directory or write the poison\n * file, or if there is an existing private key file in the directory. (The\n * service should have been poisoned when the key was created.) */\nstatic int\npoison_new_single_onion_hidden_service_dir_impl(const rend_service_t *service,\n const or_options_t* options)\n{\n /* Passing a NULL service is a bug */\n if (BUG(!service)) {\n return -1;\n }\n\n /* We must only poison directories if we're in Single Onion mode */\n tor_assert(rend_service_non_anonymous_mode_enabled(options));\n\n int fd;\n int retval = -1;\n char *poison_fname = NULL;\n\n if (rend_service_is_ephemeral(service)) {\n log_info(LD_REND, \"Ephemeral HS started in non-anonymous mode.\");\n return 0;\n }\n\n /* Make sure we're only poisoning new hidden service directories */\n if (rend_service_private_key_exists(service)) {\n log_warn(LD_BUG, \"Tried to single onion poison a service directory after \"\n \"the private key was created.\");\n return -1;\n }\n\n /* Make sure the directory was created before calling this function. */\n if (BUG(rend_service_check_private_dir_impl(options, service, 0) < 0))\n return -1;\n\n poison_fname = rend_service_sos_poison_path(service);\n\n switch (file_status(poison_fname)) {\n case FN_DIR:\n case FN_ERROR:\n log_warn(LD_FS, \"Can't read single onion poison file \\\"%s\\\"\",\n poison_fname);\n goto done;\n case FN_FILE: /* single onion poison file already exists. NOP. */\n case FN_EMPTY: /* single onion poison file already exists. NOP. */\n log_debug(LD_FS, \"Tried to re-poison a single onion poisoned file \\\"%s\\\"\",\n poison_fname);\n break;\n case FN_NOENT:\n fd = tor_open_cloexec(poison_fname, O_RDWR|O_CREAT|O_TRUNC, 0600);\n if (fd < 0) {\n log_warn(LD_FS, \"Could not create single onion poison file %s\",\n poison_fname);\n goto done;\n }\n close(fd);\n break;\n default:\n tor_assert(0);\n }\n\n retval = 0;\n\n done:\n tor_free(poison_fname);\n\n return retval;\n}\n\n/** We just got launched in Single Onion Mode. That's a non-anonymous mode for\n * hidden services. If s is new, we should mark its hidden service\n * directory appropriately so that it is never launched as a location-private\n * hidden service. (New directories don't have private key files.)\n * Return 0 on success, -1 on fail. */\nSTATIC int\nrend_service_poison_new_single_onion_dir(const rend_service_t *s,\n const or_options_t* options)\n{\n /* Passing a NULL service is a bug */\n if (BUG(!s)) {\n return -1;\n }\n\n /* We must only poison directories if we're in Single Onion mode */\n tor_assert(rend_service_non_anonymous_mode_enabled(options));\n\n /* Ephemeral services aren't allowed in non-anonymous mode */\n if (BUG(rend_service_is_ephemeral(s))) {\n return -1;\n }\n\n /* Service is expected to have a directory */\n if (BUG(!s->directory)) {\n return -1;\n }\n\n if (!rend_service_private_key_exists(s)) {\n if (poison_new_single_onion_hidden_service_dir_impl(s, options)\n < 0) {\n return -1;\n }\n }\n\n return 0;\n}\n\n/** Load and/or generate private keys for all hidden services, possibly\n * including keys for client authorization.\n * If a <b>service_list</b> is provided, treat it as the list of hidden\n * services (used in unittests). Otherwise, require that rend_service_list is\n * not NULL.\n * Return 0 on success, -1 on failure. */\nint\nrend_service_load_all_keys(const smartlist_t *service_list)\n{\n /* Use service_list for unit tests */\n const smartlist_t *s_list = rend_get_service_list(service_list);\n if (BUG(!s_list)) {\n return -1;\n }\n\n SMARTLIST_FOREACH_BEGIN(s_list, rend_service_t *, s) {\n if (s->private_key)\n continue;\n log_info(LD_REND, \"Loading hidden-service keys from %s\",\n rend_service_escaped_dir(s));\n\n if (rend_service_load_keys(s) < 0)\n return -1;\n } SMARTLIST_FOREACH_END(s);\n\n return 0;\n}\n\n/** Add to <b>lst</b> every filename used by <b>s</b>. */\nstatic void\nrend_service_add_filenames_to_list(smartlist_t *lst, const rend_service_t *s)\n{\n tor_assert(lst);\n tor_assert(s);\n tor_assert(s->directory);\n smartlist_add(lst, rend_service_path(s, private_key_fname));\n smartlist_add(lst, rend_service_path(s, hostname_fname));\n smartlist_add(lst, rend_service_path(s, client_keys_fname));\n smartlist_add(lst, rend_service_sos_poison_path(s));\n}\n\n/** Add to <b>open_lst</b> every filename used by a configured hidden service,\n * and to <b>stat_lst</b> every directory used by a configured hidden\n * service */\nvoid\nrend_services_add_filenames_to_lists(smartlist_t *open_lst,\n smartlist_t *stat_lst)\n{\n if (!rend_service_list)\n return;\n SMARTLIST_FOREACH_BEGIN(rend_service_list, rend_service_t *, s) {\n if (!rend_service_is_ephemeral(s)) {\n rend_service_add_filenames_to_list(open_lst, s);\n smartlist_add_strdup(stat_lst, s->directory);\n }\n } SMARTLIST_FOREACH_END(s);\n}\n\n/** Derive all rend_service_t internal material based on the service's key.\n * Returns 0 on sucess, -1 on failure.\n */\nstatic int\nrend_service_derive_key_digests(struct rend_service_t *s)\n{\n if (rend_get_service_id(s->private_key, s->service_id)<0) {\n log_warn(LD_BUG, \"Internal error: couldn't encode service ID.\");\n return -1;\n }\n if (crypto_pk_get_digest(s->private_key, s->pk_digest)<0) {\n log_warn(LD_BUG, \"Couldn't compute hash of public key.\");\n return -1;\n }\n\n return 0;\n}\n\n/* Implements the directory check from rend_service_check_private_dir,\n * without doing the single onion poison checks. */\nstatic int\nrend_service_check_private_dir_impl(const or_options_t *options,\n const rend_service_t *s,\n int create)\n{\n cpd_check_t check_opts = CPD_NONE;\n if (create) {\n check_opts |= CPD_CREATE;\n } else {\n check_opts |= CPD_CHECK_MODE_ONLY;\n check_opts |= CPD_CHECK;\n }\n if (s->dir_group_readable) {\n check_opts |= CPD_GROUP_READ;\n }\n /* Check/create directory */\n if (check_private_dir(s->directory, check_opts, options->User) < 0) {\n log_warn(LD_REND, \"Checking service directory %s failed.\", s->directory);\n return -1;\n }\n\n return 0;\n}\n\n/** Make sure that the directory for <b>s</b> is private, using the config in\n * <b>options</b>.\n * If <b>create</b> is true:\n * - if the directory exists, change permissions if needed,\n * - if the directory does not exist, create it with the correct permissions.\n * If <b>create</b> is false:\n * - if the directory exists, check permissions,\n * - if the directory does not exist, check if we think we can create it.\n * Return 0 on success, -1 on failure. */\nstatic int\nrend_service_check_private_dir(const or_options_t *options,\n const rend_service_t *s,\n int create)\n{\n /* Passing a NULL service is a bug */\n if (BUG(!s)) {\n return -1;\n }\n\n /* Check/create directory */\n if (rend_service_check_private_dir_impl(options, s, create) < 0) {\n return -1;\n }\n\n /* Check if the hidden service key exists, and was created in a different\n * single onion service mode, and refuse to launch if it has.\n * This is safe to call even when create is false, as it ignores missing\n * keys and directories: they are always valid.\n */\n if (rend_service_verify_single_onion_poison(s, options) < 0) {\n /* We can't use s->service_id here, as the key may not have been loaded */\n log_warn(LD_GENERAL, \"We are configured with \"\n \"HiddenServiceNonAnonymousMode %d, but the hidden \"\n \"service key in directory %s was created in %s mode. \"\n \"This is not allowed.\",\n rend_service_non_anonymous_mode_enabled(options) ? 1 : 0,\n rend_service_escaped_dir(s),\n rend_service_non_anonymous_mode_enabled(options) ?\n \"an anonymous\" : \"a non-anonymous\"\n );\n return -1;\n }\n\n /* Poison new single onion directories immediately after they are created,\n * so that we never accidentally launch non-anonymous hidden services\n * thinking they are anonymous. Any keys created later will end up with the\n * correct poisoning state.\n */\n if (create && rend_service_non_anonymous_mode_enabled(options)) {\n static int logged_warning = 0;\n\n if (rend_service_poison_new_single_onion_dir(s, options) < 0) {\n log_warn(LD_GENERAL,\"Failed to mark new hidden services as non-anonymous\"\n \".\");\n return -1;\n }\n\n if (!logged_warning) {\n /* The keys for these services are linked to the server IP address */\n log_notice(LD_REND, \"The configured onion service directories have been \"\n \"used in single onion mode. They can not be used for \"\n \"anonymous hidden services.\");\n logged_warning = 1;\n }\n }\n\n return 0;\n}\n\n/** Load and/or generate private keys for the hidden service <b>s</b>,\n * possibly including keys for client authorization. Return 0 on success, -1\n * on failure. */\nstatic int\nrend_service_load_keys(rend_service_t *s)\n{\n char *fname = NULL;\n char buf[128];\n\n /* Make sure the directory was created and single onion poisoning was\n * checked before calling this function */\n if (BUG(rend_service_check_private_dir(get_options(), s, 0) < 0))\n goto err;\n\n /* Load key */\n fname = rend_service_path(s, private_key_fname);\n s->private_key = init_key_from_file(fname, 1, LOG_ERR, 0);\n\n if (!s->private_key)\n goto err;\n\n if (rend_service_derive_key_digests(s) < 0)\n goto err;\n\n tor_free(fname);\n /* Create service file */\n fname = rend_service_path(s, hostname_fname);\n\n tor_snprintf(buf, sizeof(buf),\"%s.onion\\n\", s->service_id);\n if (write_str_to_file(fname,buf,0)<0) {\n log_warn(LD_CONFIG, \"Could not write onion address to hostname file.\");\n goto err;\n }\n#ifndef _WIN32\n if (s->dir_group_readable) {\n /* Also verify hostname file created with group read. */\n if (chmod(fname, 0640))\n log_warn(LD_FS,\"Unable to make hidden hostname file %s group-readable.\",\n fname);\n }\n#endif\n\n /* If client authorization is configured, load or generate keys. */\n if (s->auth_type != REND_NO_AUTH) {\n if (rend_service_load_auth_keys(s, fname) < 0) {\n goto err;\n }\n }\n\n int r = 0;\n goto done;\n err:\n r = -1;\n done:\n memwipe(buf, 0, sizeof(buf));\n tor_free(fname);\n return r;\n}\n\n/** Load and/or generate client authorization keys for the hidden service\n * <b>s</b>, which stores its hostname in <b>hfname</b>. Return 0 on success,\n * -1 on failure. */\nstatic int\nrend_service_load_auth_keys(rend_service_t *s, const char *hfname)\n{\n int r = 0;\n char *cfname = NULL;\n char *client_keys_str = NULL;\n strmap_t *parsed_clients = strmap_new();\n FILE *cfile, *hfile;\n open_file_t *open_cfile = NULL, *open_hfile = NULL;\n char desc_cook_out[3*REND_DESC_COOKIE_LEN_BASE64+1];\n char service_id[16+1];\n char buf[1500];\n\n /* Load client keys and descriptor cookies, if available. */\n cfname = rend_service_path(s, client_keys_fname);\n client_keys_str = read_file_to_str(cfname, RFTS_IGNORE_MISSING, NULL);\n if (client_keys_str) {\n if (rend_parse_client_keys(parsed_clients, client_keys_str) < 0) {\n log_warn(LD_CONFIG, \"Previously stored client_keys file could not \"\n \"be parsed.\");\n goto err;\n } else {\n log_info(LD_CONFIG, \"Parsed %d previously stored client entries.\",\n strmap_size(parsed_clients));\n }\n }\n\n /* Prepare client_keys and hostname files. */\n if (!(cfile = start_writing_to_stdio_file(cfname,\n OPEN_FLAGS_REPLACE | O_TEXT,\n 0600, &open_cfile))) {\n log_warn(LD_CONFIG, \"Could not open client_keys file %s\",\n escaped(cfname));\n goto err;\n }\n\n if (!(hfile = start_writing_to_stdio_file(hfname,\n OPEN_FLAGS_REPLACE | O_TEXT,\n 0600, &open_hfile))) {\n log_warn(LD_CONFIG, \"Could not open hostname file %s\", escaped(hfname));\n goto err;\n }\n\n /* Either use loaded keys for configured clients or generate new\n * ones if a client is new. */\n SMARTLIST_FOREACH_BEGIN(s->clients, rend_authorized_client_t *, client) {\n rend_authorized_client_t *parsed =\n strmap_get(parsed_clients, client->client_name);\n int written;\n size_t len;\n /* Copy descriptor cookie from parsed entry or create new one. */\n if (parsed) {\n memcpy(client->descriptor_cookie, parsed->descriptor_cookie,\n REND_DESC_COOKIE_LEN);\n } else {\n crypto_rand((char *) client->descriptor_cookie, REND_DESC_COOKIE_LEN);\n }\n /* For compatibility with older tor clients, this does not\n * truncate the padding characters, unlike rend_auth_encode_cookie. */\n if (base64_encode(desc_cook_out, 3*REND_DESC_COOKIE_LEN_BASE64+1,\n (char *) client->descriptor_cookie,\n REND_DESC_COOKIE_LEN, 0) < 0) {\n log_warn(LD_BUG, \"Could not base64-encode descriptor cookie.\");\n goto err;\n }\n /* Copy client key from parsed entry or create new one if required. */\n if (parsed && parsed->client_key) {\n client->client_key = crypto_pk_dup_key(parsed->client_key);\n } else if (s->auth_type == REND_STEALTH_AUTH) {\n /* Create private key for client. */\n crypto_pk_t *prkey = NULL;\n if (!(prkey = crypto_pk_new())) {\n log_warn(LD_BUG,\"Error constructing client key\");\n goto err;\n }\n if (crypto_pk_generate_key(prkey)) {\n log_warn(LD_BUG,\"Error generating client key\");\n crypto_pk_free(prkey);\n goto err;\n }\n if (crypto_pk_check_key(prkey) <= 0) {\n log_warn(LD_BUG,\"Generated client key seems invalid\");\n crypto_pk_free(prkey);\n goto err;\n }\n client->client_key = prkey;\n }\n /* Add entry to client_keys file. */\n written = tor_snprintf(buf, sizeof(buf),\n \"client-name %s\\ndescriptor-cookie %s\\n\",\n client->client_name, desc_cook_out);\n if (written < 0) {\n log_warn(LD_BUG, \"Could not write client entry.\");\n goto err;\n }\n if (client->client_key) {\n char *client_key_out = NULL;\n if (crypto_pk_write_private_key_to_string(client->client_key,\n &client_key_out, &len) != 0) {\n log_warn(LD_BUG, \"Internal error: \"\n \"crypto_pk_write_private_key_to_string() failed.\");\n goto err;\n }\n if (rend_get_service_id(client->client_key, service_id)<0) {\n log_warn(LD_BUG, \"Internal error: couldn't encode service ID.\");\n /*\n * len is string length, not buffer length, but last byte is NUL\n * anyway.\n */\n memwipe(client_key_out, 0, len);\n tor_free(client_key_out);\n goto err;\n }\n written = tor_snprintf(buf + written, sizeof(buf) - written,\n \"client-key\\n%s\", client_key_out);\n memwipe(client_key_out, 0, len);\n tor_free(client_key_out);\n if (written < 0) {\n log_warn(LD_BUG, \"Could not write client entry.\");\n goto err;\n }\n } else {\n strlcpy(service_id, s->service_id, sizeof(service_id));\n }\n\n if (fputs(buf, cfile) < 0) {\n log_warn(LD_FS, \"Could not append client entry to file: %s\",\n strerror(errno));\n goto err;\n }\n\n /* Add line to hostname file. This is not the same encoding as in\n * client_keys. */\n char *encoded_cookie = rend_auth_encode_cookie(client->descriptor_cookie,\n s->auth_type);\n if (!encoded_cookie) {\n log_warn(LD_BUG, \"Could not base64-encode descriptor cookie.\");\n goto err;\n }\n tor_snprintf(buf, sizeof(buf), \"%s.onion %s # client: %s\\n\",\n service_id, encoded_cookie, client->client_name);\n memwipe(encoded_cookie, 0, strlen(encoded_cookie));\n tor_free(encoded_cookie);\n\n if (fputs(buf, hfile)<0) {\n log_warn(LD_FS, \"Could not append host entry to file: %s\",\n strerror(errno));\n goto err;\n }\n } SMARTLIST_FOREACH_END(client);\n\n finish_writing_to_file(open_cfile);\n finish_writing_to_file(open_hfile);\n\n goto done;\n err:\n r = -1;\n if (open_cfile)\n abort_writing_to_file(open_cfile);\n if (open_hfile)\n abort_writing_to_file(open_hfile);\n done:\n if (client_keys_str) {\n memwipe(client_keys_str, 0, strlen(client_keys_str));\n tor_free(client_keys_str);\n }\n strmap_free(parsed_clients, rend_authorized_client_strmap_item_free);\n\n if (cfname) {\n memwipe(cfname, 0, strlen(cfname));\n tor_free(cfname);\n }\n\n /* Clear stack buffers that held key-derived material. */\n memwipe(buf, 0, sizeof(buf));\n memwipe(desc_cook_out, 0, sizeof(desc_cook_out));\n memwipe(service_id, 0, sizeof(service_id));\n\n return r;\n}\n\n/** Return the service whose public key has a digest of <b>digest</b>, or\n * NULL if no such service exists.\n */\nstatic rend_service_t *\nrend_service_get_by_pk_digest(const char* digest)\n{\n SMARTLIST_FOREACH(rend_service_list, rend_service_t*, s,\n if (tor_memeq(s->pk_digest,digest,DIGEST_LEN))\n return s);\n return NULL;\n}\n\n/** Return the service whose service id is <b>id</b>, or NULL if no such\n * service exists.\n */\nstatic struct rend_service_t *\nrend_service_get_by_service_id(const char *id)\n{\n tor_assert(strlen(id) == REND_SERVICE_ID_LEN_BASE32);\n SMARTLIST_FOREACH(rend_service_list, rend_service_t*, s, {\n if (tor_memeq(s->service_id, id, REND_SERVICE_ID_LEN_BASE32))\n return s;\n });\n return NULL;\n}\n\n/** Return 1 if any virtual port in <b>service</b> wants a circuit\n * to have good uptime. Else return 0.\n */\nstatic int\nrend_service_requires_uptime(rend_service_t *service)\n{\n int i;\n rend_service_port_config_t *p;\n\n for (i=0; i < smartlist_len(service->ports); ++i) {\n p = smartlist_get(service->ports, i);\n if (smartlist_contains_int_as_string(get_options()->LongLivedPorts,\n p->virtual_port))\n return 1;\n }\n return 0;\n}\n\n/** Check client authorization of a given <b>descriptor_cookie</b> of\n * length <b>cookie_len</b> for <b>service</b>. Return 1 for success\n * and 0 for failure. */\nstatic int\nrend_check_authorization(rend_service_t *service,\n const char *descriptor_cookie,\n size_t cookie_len)\n{\n rend_authorized_client_t *auth_client = NULL;\n tor_assert(service);\n tor_assert(descriptor_cookie);\n if (!service->clients) {\n log_warn(LD_BUG, \"Can't check authorization for a service that has no \"\n \"authorized clients configured.\");\n return 0;\n }\n\n if (cookie_len != REND_DESC_COOKIE_LEN) {\n log_info(LD_REND, \"Descriptor cookie is %lu bytes, but we expected \"\n \"%lu bytes. Dropping cell.\",\n (unsigned long)cookie_len, (unsigned long)REND_DESC_COOKIE_LEN);\n return 0;\n }\n\n /* Look up client authorization by descriptor cookie. */\n SMARTLIST_FOREACH(service->clients, rend_authorized_client_t *, client, {\n if (tor_memeq(client->descriptor_cookie, descriptor_cookie,\n REND_DESC_COOKIE_LEN)) {\n auth_client = client;\n break;\n }\n });\n if (!auth_client) {\n char descriptor_cookie_base64[3*REND_DESC_COOKIE_LEN_BASE64];\n base64_encode(descriptor_cookie_base64, sizeof(descriptor_cookie_base64),\n descriptor_cookie, REND_DESC_COOKIE_LEN, 0);\n log_info(LD_REND, \"No authorization found for descriptor cookie '%s'! \"\n \"Dropping cell!\",\n descriptor_cookie_base64);\n return 0;\n }\n\n /* Allow the request. */\n log_info(LD_REND, \"Client %s authorized for service %s.\",\n auth_client->client_name, service->service_id);\n return 1;\n}\n\n/* Can this service make a direct connection to ei?\n * It must be a single onion service, and the firewall rules must allow ei. */\nstatic int\nrend_service_use_direct_connection(const or_options_t* options,\n const extend_info_t* ei)\n{\n /* We'll connect directly all reachable addresses, whether preferred or not.\n * The prefer_ipv6 argument to fascist_firewall_allows_address_addr is\n * ignored, because pref_only is 0. */\n return (rend_service_allow_non_anonymous_connection(options) &&\n fascist_firewall_allows_address_addr(&ei->addr, ei->port,\n FIREWALL_OR_CONNECTION, 0, 0));\n}\n\n/* Like rend_service_use_direct_connection, but to a node. */\nstatic int\nrend_service_use_direct_connection_node(const or_options_t* options,\n const node_t* node)\n{\n /* We'll connect directly all reachable addresses, whether preferred or not.\n */\n return (rend_service_allow_non_anonymous_connection(options) &&\n fascist_firewall_allows_node(node, FIREWALL_OR_CONNECTION, 0));\n}\n\n/******\n * Handle cells\n ******/\n\n/** Respond to an INTRODUCE2 cell by launching a circuit to the chosen\n * rendezvous point.\n */\nint\nrend_service_receive_introduction(origin_circuit_t *circuit,\n const uint8_t *request,\n size_t request_len)\n{\n /* Global status stuff */\n int status = 0, result;\n const or_options_t *options = get_options();\n char *err_msg = NULL;\n int err_msg_severity = LOG_WARN;\n const char *stage_descr = NULL, *rend_pk_digest;\n int reason = END_CIRC_REASON_TORPROTOCOL;\n /* Service/circuit/key stuff we can learn before parsing */\n char serviceid[REND_SERVICE_ID_LEN_BASE32+1];\n rend_service_t *service = NULL;\n rend_intro_point_t *intro_point = NULL;\n crypto_pk_t *intro_key = NULL;\n /* Parsed cell */\n rend_intro_cell_t *parsed_req = NULL;\n /* Rendezvous point */\n extend_info_t *rp = NULL;\n /* XXX not handled yet */\n char buf[RELAY_PAYLOAD_SIZE];\n char keys[DIGEST_LEN+CPATH_KEY_MATERIAL_LEN]; /* Holds KH, Df, Db, Kf, Kb */\n int i;\n crypto_dh_t *dh = NULL;\n origin_circuit_t *launched = NULL;\n crypt_path_t *cpath = NULL;\n char hexcookie[9];\n int circ_needs_uptime;\n time_t now = time(NULL);\n time_t elapsed;\n int replay;\n\n /* Do some initial validation and logging before we parse the cell */\n if (circuit->base_.purpose != CIRCUIT_PURPOSE_S_INTRO) {\n log_warn(LD_PROTOCOL,\n \"Got an INTRODUCE2 over a non-introduction circuit %u.\",\n (unsigned) circuit->base_.n_circ_id);\n goto err;\n }\n\n assert_circ_anonymity_ok(circuit, options);\n tor_assert(circuit->rend_data);\n /* XXX: This is version 2 specific (only one supported). */\n rend_pk_digest = (char *) rend_data_get_pk_digest(circuit->rend_data, NULL);\n\n /* We'll use this in a bazillion log messages */\n base32_encode(serviceid, REND_SERVICE_ID_LEN_BASE32+1,\n rend_pk_digest, REND_SERVICE_ID_LEN);\n\n /* look up service depending on circuit. */\n service = rend_service_get_by_pk_digest(rend_pk_digest);\n if (!service) {\n log_warn(LD_BUG,\n \"Internal error: Got an INTRODUCE2 cell on an intro \"\n \"circ for an unrecognized service %s.\",\n escaped(serviceid));\n goto err;\n }\n\n intro_point = find_intro_point(circuit);\n if (intro_point == NULL) {\n intro_point = find_expiring_intro_point(service, circuit);\n if (intro_point == NULL) {\n log_warn(LD_BUG,\n \"Internal error: Got an INTRODUCE2 cell on an \"\n \"intro circ (for service %s) with no corresponding \"\n \"rend_intro_point_t.\",\n escaped(serviceid));\n goto err;\n }\n }\n\n log_info(LD_REND, \"Received INTRODUCE2 cell for service %s on circ %u.\",\n escaped(serviceid), (unsigned)circuit->base_.n_circ_id);\n\n /* use intro key instead of service key. */\n intro_key = circuit->intro_key;\n\n tor_free(err_msg);\n stage_descr = NULL;\n\n stage_descr = \"early parsing\";\n /* Early parsing pass (get pk, ciphertext); type 2 is INTRODUCE2 */\n parsed_req =\n rend_service_begin_parse_intro(request, request_len, 2, &err_msg);\n if (!parsed_req) {\n goto log_error;\n } else if (err_msg) {\n log_info(LD_REND, \"%s on circ %u.\", err_msg,\n (unsigned)circuit->base_.n_circ_id);\n tor_free(err_msg);\n }\n\n /* make sure service replay caches are present */\n if (!service->accepted_intro_dh_parts) {\n service->accepted_intro_dh_parts =\n replaycache_new(REND_REPLAY_TIME_INTERVAL,\n REND_REPLAY_TIME_INTERVAL);\n }\n\n if (!intro_point->accepted_intro_rsa_parts) {\n intro_point->accepted_intro_rsa_parts = replaycache_new(0, 0);\n }\n\n /* check for replay of PK-encrypted portion. */\n replay = replaycache_add_test_and_elapsed(\n intro_point->accepted_intro_rsa_parts,\n parsed_req->ciphertext, parsed_req->ciphertext_len,\n &elapsed);\n\n if (replay) {\n log_warn(LD_REND,\n \"Possible replay detected! We received an \"\n \"INTRODUCE2 cell with same PK-encrypted part %d \"\n \"seconds ago. Dropping cell.\",\n (int)elapsed);\n goto err;\n }\n\n stage_descr = \"decryption\";\n /* Now try to decrypt it */\n result = rend_service_decrypt_intro(parsed_req, intro_key, &err_msg);\n if (result < 0) {\n goto log_error;\n } else if (err_msg) {\n log_info(LD_REND, \"%s on circ %u.\", err_msg,\n (unsigned)circuit->base_.n_circ_id);\n tor_free(err_msg);\n }\n\n stage_descr = \"late parsing\";\n /* Parse the plaintext */\n result = rend_service_parse_intro_plaintext(parsed_req, &err_msg);\n if (result < 0) {\n goto log_error;\n } else if (err_msg) {\n log_info(LD_REND, \"%s on circ %u.\", err_msg,\n (unsigned)circuit->base_.n_circ_id);\n tor_free(err_msg);\n }\n\n stage_descr = \"late validation\";\n /* Validate the parsed plaintext parts */\n result = rend_service_validate_intro_late(parsed_req, &err_msg);\n if (result < 0) {\n goto log_error;\n } else if (err_msg) {\n log_info(LD_REND, \"%s on circ %u.\", err_msg,\n (unsigned)circuit->base_.n_circ_id);\n tor_free(err_msg);\n }\n stage_descr = NULL;\n\n /* Increment INTRODUCE2 counter */\n ++(intro_point->accepted_introduce2_count);\n\n /* Find the rendezvous point */\n rp = find_rp_for_intro(parsed_req, &err_msg);\n if (!rp) {\n err_msg_severity = LOG_PROTOCOL_WARN;\n goto log_error;\n }\n\n /* Check if we'd refuse to talk to this router */\n if (options->StrictNodes &&\n routerset_contains_extendinfo(options->ExcludeNodes, rp)) {\n log_warn(LD_REND, \"Client asked to rendezvous at a relay that we \"\n \"exclude, and StrictNodes is set. Refusing service.\");\n reason = END_CIRC_REASON_INTERNAL; /* XXX might leak why we refused */\n goto err;\n }\n\n base16_encode(hexcookie, 9, (const char *)(parsed_req->rc), 4);\n\n /* Check whether there is a past request with the same Diffie-Hellman,\n * part 1. */\n replay = replaycache_add_test_and_elapsed(\n service->accepted_intro_dh_parts,\n parsed_req->dh, DH_KEY_LEN,\n &elapsed);\n\n if (replay) {\n /* A Tor client will send a new INTRODUCE1 cell with the same rend\n * cookie and DH public key as its previous one if its intro circ\n * times out while in state CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT .\n * If we received the first INTRODUCE1 cell (the intro-point relay\n * converts it into an INTRODUCE2 cell), we are already trying to\n * connect to that rend point (and may have already succeeded);\n * drop this cell. */\n log_info(LD_REND, \"We received an \"\n \"INTRODUCE2 cell with same first part of \"\n \"Diffie-Hellman handshake %d seconds ago. Dropping \"\n \"cell.\",\n (int) elapsed);\n goto err;\n }\n\n /* If the service performs client authorization, check included auth data. */\n if (service->clients) {\n if (parsed_req->version == 3 && parsed_req->u.v3.auth_len > 0) {\n if (rend_check_authorization(service,\n (const char*)parsed_req->u.v3.auth_data,\n parsed_req->u.v3.auth_len)) {\n log_info(LD_REND, \"Authorization data in INTRODUCE2 cell are valid.\");\n } else {\n log_info(LD_REND, \"The authorization data that are contained in \"\n \"the INTRODUCE2 cell are invalid. Dropping cell.\");\n reason = END_CIRC_REASON_CONNECTFAILED;\n goto err;\n }\n } else {\n log_info(LD_REND, \"INTRODUCE2 cell does not contain authentication \"\n \"data, but we require client authorization. Dropping cell.\");\n reason = END_CIRC_REASON_CONNECTFAILED;\n goto err;\n }\n }\n\n /* Try DH handshake... */\n dh = crypto_dh_new(DH_TYPE_REND);\n if (!dh || crypto_dh_generate_public(dh)<0) {\n log_warn(LD_BUG,\"Internal error: couldn't build DH state \"\n \"or generate public key.\");\n reason = END_CIRC_REASON_INTERNAL;\n goto err;\n }\n if (crypto_dh_compute_secret(LOG_PROTOCOL_WARN, dh,\n (char *)(parsed_req->dh),\n DH_KEY_LEN, keys,\n DIGEST_LEN+CPATH_KEY_MATERIAL_LEN)<0) {\n log_warn(LD_BUG, \"Internal error: couldn't complete DH handshake\");\n reason = END_CIRC_REASON_INTERNAL;\n goto err;\n }\n\n circ_needs_uptime = rend_service_requires_uptime(service);\n\n /* help predict this next time */\n rep_hist_note_used_internal(now, circ_needs_uptime, 1);\n\n /* Launch a circuit to the client's chosen rendezvous point.\n */\n for (i=0;i<MAX_REND_FAILURES;i++) {\n int flags = CIRCLAUNCH_NEED_CAPACITY | CIRCLAUNCH_IS_INTERNAL;\n if (circ_needs_uptime) flags |= CIRCLAUNCH_NEED_UPTIME;\n /* A Single Onion Service only uses a direct connection if its\n * firewall rules permit direct connections to the address. */\n if (rend_service_use_direct_connection(options, rp)) {\n flags = flags | CIRCLAUNCH_ONEHOP_TUNNEL;\n }\n launched = circuit_launch_by_extend_info(\n CIRCUIT_PURPOSE_S_CONNECT_REND, rp, flags);\n\n if (launched)\n break;\n }\n if (!launched) { /* give up */\n log_warn(LD_REND, \"Giving up launching first hop of circuit to rendezvous \"\n \"point %s for service %s.\",\n safe_str_client(extend_info_describe(rp)),\n serviceid);\n reason = END_CIRC_REASON_CONNECTFAILED;\n goto err;\n }\n log_info(LD_REND,\n \"Accepted intro; launching circuit to %s \"\n \"(cookie %s) for service %s.\",\n safe_str_client(extend_info_describe(rp)),\n hexcookie, serviceid);\n tor_assert(launched->build_state);\n /* Fill in the circuit's state. */\n\n launched->rend_data =\n rend_data_service_create(service->service_id, rend_pk_digest,\n parsed_req->rc, service->auth_type);\n\n launched->build_state->service_pending_final_cpath_ref =\n tor_malloc_zero(sizeof(crypt_path_reference_t));\n launched->build_state->service_pending_final_cpath_ref->refcount = 1;\n\n launched->build_state->service_pending_final_cpath_ref->cpath = cpath =\n tor_malloc_zero(sizeof(crypt_path_t));\n cpath->magic = CRYPT_PATH_MAGIC;\n launched->build_state->expiry_time = now + MAX_REND_TIMEOUT;\n\n cpath->rend_dh_handshake_state = dh;\n dh = NULL;\n if (circuit_init_cpath_crypto(cpath,keys+DIGEST_LEN,1)<0)\n goto err;\n memcpy(cpath->rend_circ_nonce, keys, DIGEST_LEN);\n\n goto done;\n\n log_error:\n if (!err_msg) {\n if (stage_descr) {\n tor_asprintf(&err_msg,\n \"unknown %s error for INTRODUCE2\", stage_descr);\n } else {\n err_msg = tor_strdup(\"unknown error for INTRODUCE2\");\n }\n }\n\n log_fn(err_msg_severity, LD_REND, \"%s on circ %u\", err_msg,\n (unsigned)circuit->base_.n_circ_id);\n err:\n status = -1;\n if (dh) crypto_dh_free(dh);\n if (launched) {\n circuit_mark_for_close(TO_CIRCUIT(launched), reason);\n }\n tor_free(err_msg);\n\n done:\n memwipe(keys, 0, sizeof(keys));\n memwipe(buf, 0, sizeof(buf));\n memwipe(serviceid, 0, sizeof(serviceid));\n memwipe(hexcookie, 0, sizeof(hexcookie));\n\n /* Free the parsed cell */\n rend_service_free_intro(parsed_req);\n\n /* Free rp */\n extend_info_free(rp);\n\n return status;\n}\n\n/** Given a parsed and decrypted INTRODUCE2, find the rendezvous point or\n * return NULL and an error string if we can't. Return a newly allocated\n * extend_info_t* for the rendezvous point. */\nstatic extend_info_t *\nfind_rp_for_intro(const rend_intro_cell_t *intro,\n char **err_msg_out)\n{\n extend_info_t *rp = NULL;\n char *err_msg = NULL;\n const char *rp_nickname = NULL;\n const node_t *node = NULL;\n\n if (!intro) {\n if (err_msg_out)\n err_msg = tor_strdup(\"Bad parameters to find_rp_for_intro()\");\n\n goto err;\n }\n\n if (intro->version == 0 || intro->version == 1) {\n rp_nickname = (const char *)(intro->u.v0_v1.rp);\n\n node = node_get_by_nickname(rp_nickname, 0);\n if (!node) {\n if (err_msg_out) {\n tor_asprintf(&err_msg,\n \"Couldn't find router %s named in INTRODUCE2 cell\",\n escaped_safe_str_client(rp_nickname));\n }\n\n goto err;\n }\n\n /* Are we in single onion mode? */\n const int allow_direct = rend_service_allow_non_anonymous_connection(\n get_options());\n rp = extend_info_from_node(node, allow_direct);\n if (!rp) {\n if (err_msg_out) {\n tor_asprintf(&err_msg,\n \"Couldn't build extend_info_t for router %s named \"\n \"in INTRODUCE2 cell\",\n escaped_safe_str_client(rp_nickname));\n }\n\n goto err;\n }\n } else if (intro->version == 2) {\n rp = extend_info_dup(intro->u.v2.extend_info);\n } else if (intro->version == 3) {\n rp = extend_info_dup(intro->u.v3.extend_info);\n } else {\n if (err_msg_out) {\n tor_asprintf(&err_msg,\n \"Unknown version %d in INTRODUCE2 cell\",\n (int)(intro->version));\n }\n\n goto err;\n }\n\n /* rp is always set here: extend_info_dup guarantees a non-NULL result, and\n * the other cases goto err. */\n tor_assert(rp);\n\n /* Make sure the RP we are being asked to connect to is _not_ a private\n * address unless it's allowed. Let's avoid to build a circuit to our\n * second middle node and fail right after when extending to the RP. */\n if (!extend_info_addr_is_allowed(&rp->addr)) {\n if (err_msg_out) {\n tor_asprintf(&err_msg,\n \"Relay IP in INTRODUCE2 cell is private address.\");\n }\n extend_info_free(rp);\n rp = NULL;\n goto err;\n }\n goto done;\n\n err:\n if (err_msg_out)\n *err_msg_out = err_msg;\n else\n tor_free(err_msg);\n\n done:\n return rp;\n}\n\n/** Free a parsed INTRODUCE1 or INTRODUCE2 cell that was allocated by\n * rend_service_parse_intro().\n */\nvoid\nrend_service_free_intro(rend_intro_cell_t *request)\n{\n if (!request) {\n return;\n }\n\n /* Free ciphertext */\n tor_free(request->ciphertext);\n request->ciphertext_len = 0;\n\n /* Have plaintext? */\n if (request->plaintext) {\n /* Zero it out just to be safe */\n memwipe(request->plaintext, 0, request->plaintext_len);\n tor_free(request->plaintext);\n request->plaintext_len = 0;\n }\n\n /* Have parsed plaintext? */\n if (request->parsed) {\n switch (request->version) {\n case 0:\n case 1:\n /*\n * Nothing more to do; these formats have no further pointers\n * in them.\n */\n break;\n case 2:\n extend_info_free(request->u.v2.extend_info);\n request->u.v2.extend_info = NULL;\n break;\n case 3:\n if (request->u.v3.auth_data) {\n memwipe(request->u.v3.auth_data, 0, request->u.v3.auth_len);\n tor_free(request->u.v3.auth_data);\n }\n\n extend_info_free(request->u.v3.extend_info);\n request->u.v3.extend_info = NULL;\n break;\n default:\n log_info(LD_BUG,\n \"rend_service_free_intro() saw unknown protocol \"\n \"version %d.\",\n request->version);\n }\n }\n\n /* Zero it out to make sure sensitive stuff doesn't hang around in memory */\n memwipe(request, 0, sizeof(*request));\n\n tor_free(request);\n}\n\n/** Parse an INTRODUCE1 or INTRODUCE2 cell into a newly allocated\n * rend_intro_cell_t structure. Free it with rend_service_free_intro()\n * when finished. The type parameter should be 1 or 2 to indicate whether\n * this is INTRODUCE1 or INTRODUCE2. This parses only the non-encrypted\n * parts; after this, call rend_service_decrypt_intro() with a key, then\n * rend_service_parse_intro_plaintext() to finish parsing. The optional\n * err_msg_out parameter is set to a string suitable for log output\n * if parsing fails. This function does some validation, but only\n * that which depends solely on the contents of the cell and the\n * key; it can be unit-tested. Further validation is done in\n * rend_service_validate_intro().\n */\n\nrend_intro_cell_t *\nrend_service_begin_parse_intro(const uint8_t *request,\n size_t request_len,\n uint8_t type,\n char **err_msg_out)\n{\n rend_intro_cell_t *rv = NULL;\n char *err_msg = NULL;\n\n if (!request || request_len <= 0) goto err;\n if (!(type == 1 || type == 2)) goto err;\n\n /* First, check that the cell is long enough to be a sensible INTRODUCE */\n\n /* min key length plus digest length plus nickname length */\n if (request_len <\n (DIGEST_LEN + REND_COOKIE_LEN + (MAX_NICKNAME_LEN + 1) +\n DH_KEY_LEN + 42)) {\n if (err_msg_out) {\n tor_asprintf(&err_msg,\n \"got a truncated INTRODUCE%d cell\",\n (int)type);\n }\n goto err;\n }\n\n /* Allocate a new parsed cell structure */\n rv = tor_malloc_zero(sizeof(*rv));\n\n /* Set the type */\n rv->type = type;\n\n /* Copy in the ID */\n memcpy(rv->pk, request, DIGEST_LEN);\n\n /* Copy in the ciphertext */\n rv->ciphertext = tor_malloc(request_len - DIGEST_LEN);\n memcpy(rv->ciphertext, request + DIGEST_LEN, request_len - DIGEST_LEN);\n rv->ciphertext_len = request_len - DIGEST_LEN;\n\n goto done;\n\n err:\n rend_service_free_intro(rv);\n rv = NULL;\n\n if (err_msg_out && !err_msg) {\n tor_asprintf(&err_msg,\n \"unknown INTRODUCE%d error\",\n (int)type);\n }\n\n done:\n if (err_msg_out) *err_msg_out = err_msg;\n else tor_free(err_msg);\n\n return rv;\n}\n\n/** Parse the version-specific parts of a v0 or v1 INTRODUCE1 or INTRODUCE2\n * cell\n */\n\nstatic ssize_t\nrend_service_parse_intro_for_v0_or_v1(\n rend_intro_cell_t *intro,\n const uint8_t *buf,\n size_t plaintext_len,\n char **err_msg_out)\n{\n const char *rp_nickname, *endptr;\n size_t nickname_field_len, ver_specific_len;\n\n if (intro->version == 1) {\n ver_specific_len = MAX_HEX_NICKNAME_LEN + 2;\n rp_nickname = ((const char *)buf) + 1;\n nickname_field_len = MAX_HEX_NICKNAME_LEN + 1;\n } else if (intro->version == 0) {\n ver_specific_len = MAX_NICKNAME_LEN + 1;\n rp_nickname = (const char *)buf;\n nickname_field_len = MAX_NICKNAME_LEN + 1;\n } else {\n if (err_msg_out)\n tor_asprintf(err_msg_out,\n \"rend_service_parse_intro_for_v0_or_v1() called with \"\n \"bad version %d on INTRODUCE%d cell (this is a bug)\",\n intro->version,\n (int)(intro->type));\n goto err;\n }\n\n if (plaintext_len < ver_specific_len) {\n if (err_msg_out)\n tor_asprintf(err_msg_out,\n \"short plaintext of encrypted part in v1 INTRODUCE%d \"\n \"cell (%lu bytes, needed %lu)\",\n (int)(intro->type),\n (unsigned long)plaintext_len,\n (unsigned long)ver_specific_len);\n goto err;\n }\n\n endptr = memchr(rp_nickname, 0, nickname_field_len);\n if (!endptr || endptr == rp_nickname) {\n if (err_msg_out) {\n tor_asprintf(err_msg_out,\n \"couldn't find a nul-padded nickname in \"\n \"INTRODUCE%d cell\",\n (int)(intro->type));\n }\n goto err;\n }\n\n if ((intro->version == 0 &&\n !is_legal_nickname(rp_nickname)) ||\n (intro->version == 1 &&\n !is_legal_nickname_or_hexdigest(rp_nickname))) {\n if (err_msg_out) {\n tor_asprintf(err_msg_out,\n \"bad nickname in INTRODUCE%d cell\",\n (int)(intro->type));\n }\n goto err;\n }\n\n memcpy(intro->u.v0_v1.rp, rp_nickname, endptr - rp_nickname + 1);\n\n return ver_specific_len;\n\n err:\n return -1;\n}\n\n/** Parse the version-specific parts of a v2 INTRODUCE1 or INTRODUCE2 cell\n */\n\nstatic ssize_t\nrend_service_parse_intro_for_v2(\n rend_intro_cell_t *intro,\n const uint8_t *buf,\n size_t plaintext_len,\n char **err_msg_out)\n{\n unsigned int klen;\n extend_info_t *extend_info = NULL;\n ssize_t ver_specific_len;\n\n /*\n * We accept version 3 too so that the v3 parser can call this with\n * an adjusted buffer for the latter part of a v3 cell, which is\n * identical to a v2 cell.\n */\n if (!(intro->version == 2 ||\n intro->version == 3)) {\n if (err_msg_out)\n tor_asprintf(err_msg_out,\n \"rend_service_parse_intro_for_v2() called with \"\n \"bad version %d on INTRODUCE%d cell (this is a bug)\",\n intro->version,\n (int)(intro->type));\n goto err;\n }\n\n /* 7 == version, IP and port, DIGEST_LEN == id, 2 == key length */\n if (plaintext_len < 7 + DIGEST_LEN + 2) {\n if (err_msg_out) {\n tor_asprintf(err_msg_out,\n \"truncated plaintext of encrypted parted of \"\n \"version %d INTRODUCE%d cell\",\n intro->version,\n (int)(intro->type));\n }\n\n goto err;\n }\n\n extend_info = tor_malloc_zero(sizeof(extend_info_t));\n tor_addr_from_ipv4n(&extend_info->addr, get_uint32(buf + 1));\n extend_info->port = ntohs(get_uint16(buf + 5));\n memcpy(extend_info->identity_digest, buf + 7, DIGEST_LEN);\n extend_info->nickname[0] = '$';\n base16_encode(extend_info->nickname + 1, sizeof(extend_info->nickname) - 1,\n extend_info->identity_digest, DIGEST_LEN);\n klen = ntohs(get_uint16(buf + 7 + DIGEST_LEN));\n\n /* 7 == version, IP and port, DIGEST_LEN == id, 2 == key length */\n if (plaintext_len < 7 + DIGEST_LEN + 2 + klen) {\n if (err_msg_out) {\n tor_asprintf(err_msg_out,\n \"truncated plaintext of encrypted parted of \"\n \"version %d INTRODUCE%d cell\",\n intro->version,\n (int)(intro->type));\n }\n\n goto err;\n }\n\n extend_info->onion_key =\n crypto_pk_asn1_decode((const char *)(buf + 7 + DIGEST_LEN + 2), klen);\n if (!extend_info->onion_key) {\n if (err_msg_out) {\n tor_asprintf(err_msg_out,\n \"error decoding onion key in version %d \"\n \"INTRODUCE%d cell\",\n intro->version,\n (intro->type));\n }\n\n goto err;\n }\n if (128 != crypto_pk_keysize(extend_info->onion_key)) {\n if (err_msg_out) {\n tor_asprintf(err_msg_out,\n \"invalid onion key size in version %d INTRODUCE%d cell\",\n intro->version,\n (intro->type));\n }\n\n goto err;\n }\n\n ver_specific_len = 7+DIGEST_LEN+2+klen;\n\n if (intro->version == 2) intro->u.v2.extend_info = extend_info;\n else intro->u.v3.extend_info = extend_info;\n\n return ver_specific_len;\n\n err:\n extend_info_free(extend_info);\n\n return -1;\n}\n\n/** Parse the version-specific parts of a v3 INTRODUCE1 or INTRODUCE2 cell\n */\n\nstatic ssize_t\nrend_service_parse_intro_for_v3(\n rend_intro_cell_t *intro,\n const uint8_t *buf,\n size_t plaintext_len,\n char **err_msg_out)\n{\n ssize_t adjust, v2_ver_specific_len, ts_offset;\n\n /* This should only be called on v3 cells */\n if (intro->version != 3) {\n if (err_msg_out)\n tor_asprintf(err_msg_out,\n \"rend_service_parse_intro_for_v3() called with \"\n \"bad version %d on INTRODUCE%d cell (this is a bug)\",\n intro->version,\n (int)(intro->type));\n goto err;\n }\n\n /*\n * Check that we have at least enough to get auth_len:\n *\n * 1 octet for version, 1 for auth_type, 2 for auth_len\n */\n if (plaintext_len < 4) {\n if (err_msg_out) {\n tor_asprintf(err_msg_out,\n \"truncated plaintext of encrypted parted of \"\n \"version %d INTRODUCE%d cell\",\n intro->version,\n (int)(intro->type));\n }\n\n goto err;\n }\n\n /*\n * The rend_client_send_introduction() function over in rendclient.c is\n * broken (i.e., fails to match the spec) in such a way that we can't\n * change it without breaking the protocol. Specifically, it doesn't\n * emit auth_len when auth-type is REND_NO_AUTH, so everything is off\n * by two bytes after that. Calculate ts_offset and do everything from\n * the timestamp on relative to that to handle this dain bramage.\n */\n\n intro->u.v3.auth_type = buf[1];\n if (intro->u.v3.auth_type != REND_NO_AUTH) {\n intro->u.v3.auth_len = ntohs(get_uint16(buf + 2));\n ts_offset = 4 + intro->u.v3.auth_len;\n } else {\n intro->u.v3.auth_len = 0;\n ts_offset = 2;\n }\n\n /* Check that auth len makes sense for this auth type */\n if (intro->u.v3.auth_type == REND_BASIC_AUTH ||\n intro->u.v3.auth_type == REND_STEALTH_AUTH) {\n if (intro->u.v3.auth_len != REND_DESC_COOKIE_LEN) {\n if (err_msg_out) {\n tor_asprintf(err_msg_out,\n \"wrong auth data size %d for INTRODUCE%d cell, \"\n \"should be %d\",\n (int)(intro->u.v3.auth_len),\n (int)(intro->type),\n REND_DESC_COOKIE_LEN);\n }\n\n goto err;\n }\n }\n\n /* Check that we actually have everything up through the timestamp */\n if (plaintext_len < (size_t)(ts_offset)+4) {\n if (err_msg_out) {\n tor_asprintf(err_msg_out,\n \"truncated plaintext of encrypted parted of \"\n \"version %d INTRODUCE%d cell\",\n intro->version,\n (int)(intro->type));\n }\n\n goto err;\n }\n\n if (intro->u.v3.auth_type != REND_NO_AUTH &&\n intro->u.v3.auth_len > 0) {\n /* Okay, we can go ahead and copy auth_data */\n intro->u.v3.auth_data = tor_malloc(intro->u.v3.auth_len);\n /*\n * We know we had an auth_len field in this case, so 4 is\n * always right.\n */\n memcpy(intro->u.v3.auth_data, buf + 4, intro->u.v3.auth_len);\n }\n\n /*\n * From here on, the format is as in v2, so we call the v2 parser with\n * adjusted buffer and length. We are 4 + ts_offset octets in, but the\n * v2 parser expects to skip over a version byte at the start, so we\n * adjust by 3 + ts_offset.\n */\n adjust = 3 + ts_offset;\n\n v2_ver_specific_len =\n rend_service_parse_intro_for_v2(intro,\n buf + adjust, plaintext_len - adjust,\n err_msg_out);\n\n /* Success in v2 parser */\n if (v2_ver_specific_len >= 0) return v2_ver_specific_len + adjust;\n /* Failure in v2 parser; it will have provided an err_msg */\n else return v2_ver_specific_len;\n\n err:\n return -1;\n}\n\n/** Table of parser functions for version-specific parts of an INTRODUCE2\n * cell.\n */\n\nstatic ssize_t\n (*intro_version_handlers[])(\n rend_intro_cell_t *,\n const uint8_t *,\n size_t,\n char **) =\n{ rend_service_parse_intro_for_v0_or_v1,\n rend_service_parse_intro_for_v0_or_v1,\n rend_service_parse_intro_for_v2,\n rend_service_parse_intro_for_v3 };\n\n/** Decrypt the encrypted part of an INTRODUCE1 or INTRODUCE2 cell,\n * return 0 if successful, or < 0 and write an error message to\n * *err_msg_out if provided.\n */\n\nint\nrend_service_decrypt_intro(\n rend_intro_cell_t *intro,\n crypto_pk_t *key,\n char **err_msg_out)\n{\n char *err_msg = NULL;\n uint8_t key_digest[DIGEST_LEN];\n char service_id[REND_SERVICE_ID_LEN_BASE32+1];\n ssize_t key_len;\n uint8_t buf[RELAY_PAYLOAD_SIZE];\n int result, status = -1;\n\n if (!intro || !key) {\n if (err_msg_out) {\n err_msg =\n tor_strdup(\"rend_service_decrypt_intro() called with bad \"\n \"parameters\");\n }\n\n status = -2;\n goto err;\n }\n\n /* Make sure we have ciphertext */\n if (!(intro->ciphertext) || intro->ciphertext_len <= 0) {\n if (err_msg_out) {\n tor_asprintf(&err_msg,\n \"rend_intro_cell_t was missing ciphertext for \"\n \"INTRODUCE%d cell\",\n (int)(intro->type));\n }\n status = -3;\n goto err;\n }\n\n /* Check that this cell actually matches this service key */\n\n /* first DIGEST_LEN bytes of request is intro or service pk digest */\n crypto_pk_get_digest(key, (char *)key_digest);\n if (tor_memneq(key_digest, intro->pk, DIGEST_LEN)) {\n if (err_msg_out) {\n base32_encode(service_id, REND_SERVICE_ID_LEN_BASE32 + 1,\n (char*)(intro->pk), REND_SERVICE_ID_LEN);\n tor_asprintf(&err_msg,\n \"got an INTRODUCE%d cell for the wrong service (%s)\",\n (int)(intro->type),\n escaped(service_id));\n }\n\n status = -4;\n goto err;\n }\n\n /* Make sure the encrypted part is long enough to decrypt */\n\n key_len = crypto_pk_keysize(key);\n if (intro->ciphertext_len < key_len) {\n if (err_msg_out) {\n tor_asprintf(&err_msg,\n \"got an INTRODUCE%d cell with a truncated PK-encrypted \"\n \"part\",\n (int)(intro->type));\n }\n\n status = -5;\n goto err;\n }\n\n /* Decrypt the encrypted part */\n\n note_crypto_pk_op(REND_SERVER);\n result =\n crypto_pk_private_hybrid_decrypt(\n key, (char *)buf, sizeof(buf),\n (const char *)(intro->ciphertext), intro->ciphertext_len,\n PK_PKCS1_OAEP_PADDING, 1);\n if (result < 0) {\n if (err_msg_out) {\n tor_asprintf(&err_msg,\n \"couldn't decrypt INTRODUCE%d cell\",\n (int)(intro->type));\n }\n status = -6;\n goto err;\n }\n intro->plaintext_len = result;\n intro->plaintext = tor_malloc(intro->plaintext_len);\n memcpy(intro->plaintext, buf, intro->plaintext_len);\n\n status = 0;\n\n goto done;\n\n err:\n if (err_msg_out && !err_msg) {\n tor_asprintf(&err_msg,\n \"unknown INTRODUCE%d error decrypting encrypted part\",\n intro ? (int)(intro->type) : -1);\n }\n\n done:\n if (err_msg_out) *err_msg_out = err_msg;\n else tor_free(err_msg);\n\n /* clean up potentially sensitive material */\n memwipe(buf, 0, sizeof(buf));\n memwipe(key_digest, 0, sizeof(key_digest));\n memwipe(service_id, 0, sizeof(service_id));\n\n return status;\n}\n\n/** Parse the plaintext of the encrypted part of an INTRODUCE1 or\n * INTRODUCE2 cell, return 0 if successful, or < 0 and write an error\n * message to *err_msg_out if provided.\n */\n\nint\nrend_service_parse_intro_plaintext(\n rend_intro_cell_t *intro,\n char **err_msg_out)\n{\n char *err_msg = NULL;\n ssize_t ver_specific_len, ver_invariant_len;\n uint8_t version;\n int status = -1;\n\n if (!intro) {\n if (err_msg_out) {\n err_msg =\n tor_strdup(\"rend_service_parse_intro_plaintext() called with NULL \"\n \"rend_intro_cell_t\");\n }\n\n status = -2;\n goto err;\n }\n\n /* Check that we have plaintext */\n if (!(intro->plaintext) || intro->plaintext_len <= 0) {\n if (err_msg_out) {\n err_msg = tor_strdup(\"rend_intro_cell_t was missing plaintext\");\n }\n status = -3;\n goto err;\n }\n\n /* In all formats except v0, the first byte is a version number */\n version = intro->plaintext[0];\n\n /* v0 has no version byte (stupid...), so handle it as a fallback */\n if (version > 3) version = 0;\n\n /* Copy the version into the parsed cell structure */\n intro->version = version;\n\n /* Call the version-specific parser from the table */\n ver_specific_len =\n intro_version_handlers[version](intro,\n intro->plaintext, intro->plaintext_len,\n &err_msg);\n if (ver_specific_len < 0) {\n status = -4;\n goto err;\n }\n\n /** The rendezvous cookie and Diffie-Hellman stuff are version-invariant\n * and at the end of the plaintext of the encrypted part of the cell.\n */\n\n ver_invariant_len = intro->plaintext_len - ver_specific_len;\n if (ver_invariant_len < REND_COOKIE_LEN + DH_KEY_LEN) {\n tor_asprintf(&err_msg,\n \"decrypted plaintext of INTRODUCE%d cell was truncated (%ld bytes)\",\n (int)(intro->type),\n (long)(intro->plaintext_len));\n status = -5;\n goto err;\n } else if (ver_invariant_len > REND_COOKIE_LEN + DH_KEY_LEN) {\n tor_asprintf(&err_msg,\n \"decrypted plaintext of INTRODUCE%d cell was too long (%ld bytes)\",\n (int)(intro->type),\n (long)(intro->plaintext_len));\n status = -6;\n goto err;\n } else {\n memcpy(intro->rc,\n intro->plaintext + ver_specific_len,\n REND_COOKIE_LEN);\n memcpy(intro->dh,\n intro->plaintext + ver_specific_len + REND_COOKIE_LEN,\n DH_KEY_LEN);\n }\n\n /* Flag it as being fully parsed */\n intro->parsed = 1;\n\n status = 0;\n goto done;\n\n err:\n if (err_msg_out && !err_msg) {\n tor_asprintf(&err_msg,\n \"unknown INTRODUCE%d error parsing encrypted part\",\n intro ? (int)(intro->type) : -1);\n }\n\n done:\n if (err_msg_out) *err_msg_out = err_msg;\n else tor_free(err_msg);\n\n return status;\n}\n\n/** Do validity checks on a parsed intro cell after decryption; some of\n * these are not done in rend_service_parse_intro_plaintext() itself because\n * they depend on a lot of other state and would make it hard to unit test.\n * Returns >= 0 if successful or < 0 if the intro cell is invalid, and\n * optionally writes out an error message for logging. If an err_msg\n * pointer is provided, it is the caller's responsibility to free any\n * provided message.\n */\n\nint\nrend_service_validate_intro_late(const rend_intro_cell_t *intro,\n char **err_msg_out)\n{\n int status = 0;\n\n if (!intro) {\n if (err_msg_out)\n *err_msg_out =\n tor_strdup(\"NULL intro cell passed to \"\n \"rend_service_validate_intro_late()\");\n\n status = -1;\n goto err;\n }\n\n if (intro->version == 3 && intro->parsed) {\n if (!(intro->u.v3.auth_type == REND_NO_AUTH ||\n intro->u.v3.auth_type == REND_BASIC_AUTH ||\n intro->u.v3.auth_type == REND_STEALTH_AUTH)) {\n /* This is an informative message, not an error, as in the old code */\n if (err_msg_out)\n tor_asprintf(err_msg_out,\n \"unknown authorization type %d\",\n intro->u.v3.auth_type);\n }\n }\n\n err:\n return status;\n}\n\n/** Called when we fail building a rendezvous circuit at some point other\n * than the last hop: launches a new circuit to the same rendezvous point.\n */\nvoid\nrend_service_relaunch_rendezvous(origin_circuit_t *oldcirc)\n{\n origin_circuit_t *newcirc;\n cpath_build_state_t *newstate, *oldstate;\n\n tor_assert(oldcirc->base_.purpose == CIRCUIT_PURPOSE_S_CONNECT_REND);\n\n /* Don't relaunch the same rend circ twice. */\n if (oldcirc->hs_service_side_rend_circ_has_been_relaunched) {\n log_info(LD_REND, \"Rendezvous circuit to %s has already been relaunched; \"\n \"not relaunching it again.\",\n oldcirc->build_state ?\n safe_str(extend_info_describe(oldcirc->build_state->chosen_exit))\n : \"*unknown*\");\n return;\n }\n oldcirc->hs_service_side_rend_circ_has_been_relaunched = 1;\n\n if (!oldcirc->build_state ||\n oldcirc->build_state->failure_count > MAX_REND_FAILURES ||\n oldcirc->build_state->expiry_time < time(NULL)) {\n log_info(LD_REND,\n \"Attempt to build circuit to %s for rendezvous has failed \"\n \"too many times or expired; giving up.\",\n oldcirc->build_state ?\n safe_str(extend_info_describe(oldcirc->build_state->chosen_exit))\n : \"*unknown*\");\n return;\n }\n\n oldstate = oldcirc->build_state;\n tor_assert(oldstate);\n\n if (oldstate->service_pending_final_cpath_ref == NULL) {\n log_info(LD_REND,\"Skipping relaunch of circ that failed on its first hop. \"\n \"Initiator will retry.\");\n return;\n }\n\n log_info(LD_REND,\"Reattempting rendezvous circuit to '%s'\",\n safe_str(extend_info_describe(oldstate->chosen_exit)));\n\n /* You'd think Single Onion Services would want to retry the rendezvous\n * using a direct connection. But if it's blocked by a firewall, or the\n * service is IPv6-only, or the rend point avoiding becoming a one-hop\n * proxy, we need a 3-hop connection. */\n newcirc = circuit_launch_by_extend_info(CIRCUIT_PURPOSE_S_CONNECT_REND,\n oldstate->chosen_exit,\n CIRCLAUNCH_NEED_CAPACITY|CIRCLAUNCH_IS_INTERNAL);\n\n if (!newcirc) {\n log_warn(LD_REND,\"Couldn't relaunch rendezvous circuit to '%s'.\",\n safe_str(extend_info_describe(oldstate->chosen_exit)));\n return;\n }\n newstate = newcirc->build_state;\n tor_assert(newstate);\n newstate->failure_count = oldstate->failure_count+1;\n newstate->expiry_time = oldstate->expiry_time;\n newstate->service_pending_final_cpath_ref =\n oldstate->service_pending_final_cpath_ref;\n ++(newstate->service_pending_final_cpath_ref->refcount);\n\n newcirc->rend_data = rend_data_dup(oldcirc->rend_data);\n}\n\n/** Launch a circuit to serve as an introduction point for the service\n * <b>service</b> at the introduction point <b>nickname</b>\n */\nstatic int\nrend_service_launch_establish_intro(rend_service_t *service,\n rend_intro_point_t *intro)\n{\n origin_circuit_t *launched;\n int flags = CIRCLAUNCH_NEED_UPTIME|CIRCLAUNCH_IS_INTERNAL;\n const or_options_t *options = get_options();\n extend_info_t *launch_ei = intro->extend_info;\n extend_info_t *direct_ei = NULL;\n\n /* Are we in single onion mode? */\n if (rend_service_allow_non_anonymous_connection(options)) {\n /* Do we have a descriptor for the node?\n * We've either just chosen it from the consensus, or we've just reviewed\n * our intro points to see which ones are still valid, and deleted the ones\n * that aren't in the consensus any more. */\n const node_t *node = node_get_by_id(launch_ei->identity_digest);\n if (BUG(!node)) {\n /* The service has kept an intro point after it went missing from the\n * consensus. If we did anything else here, it would be a consensus\n * distinguisher. Which are less of an issue for single onion services,\n * but still a bug. */\n return -1;\n }\n /* Can we connect to the node directly? If so, replace launch_ei\n * (a multi-hop extend_info) with one suitable for direct connection. */\n if (rend_service_use_direct_connection_node(options, node)) {\n direct_ei = extend_info_from_node(node, 1);\n if (BUG(!direct_ei)) {\n /* rend_service_use_direct_connection_node and extend_info_from_node\n * disagree about which addresses on this node are permitted. This\n * should never happen. Avoiding the connection is a safe response. */\n return -1;\n }\n flags = flags | CIRCLAUNCH_ONEHOP_TUNNEL;\n launch_ei = direct_ei;\n }\n }\n /* launch_ei is either intro->extend_info, or has been replaced with a valid\n * extend_info for single onion service direct connection. */\n tor_assert(launch_ei);\n /* We must have the same intro when making a direct connection. */\n tor_assert(tor_memeq(intro->extend_info->identity_digest,\n launch_ei->identity_digest,\n DIGEST_LEN));\n\n log_info(LD_REND,\n \"Launching circuit to introduction point %s%s%s for service %s\",\n safe_str_client(extend_info_describe(intro->extend_info)),\n direct_ei ? \" via direct address \" : \"\",\n direct_ei ? safe_str_client(extend_info_describe(direct_ei)) : \"\",\n service->service_id);\n\n rep_hist_note_used_internal(time(NULL), 1, 0);\n\n ++service->n_intro_circuits_launched;\n launched = circuit_launch_by_extend_info(CIRCUIT_PURPOSE_S_ESTABLISH_INTRO,\n launch_ei, flags);\n\n if (!launched) {\n log_info(LD_REND,\n \"Can't launch circuit to establish introduction at %s%s%s.\",\n safe_str_client(extend_info_describe(intro->extend_info)),\n direct_ei ? \" via direct address \" : \"\",\n direct_ei ? safe_str_client(extend_info_describe(direct_ei)) : \"\"\n );\n extend_info_free(direct_ei);\n return -1;\n }\n /* We must have the same exit node even if cannibalized or direct connection.\n */\n tor_assert(tor_memeq(intro->extend_info->identity_digest,\n launched->build_state->chosen_exit->identity_digest,\n DIGEST_LEN));\n\n launched->rend_data = rend_data_service_create(service->service_id,\n service->pk_digest, NULL,\n service->auth_type);\n launched->intro_key = crypto_pk_dup_key(intro->intro_key);\n if (launched->base_.state == CIRCUIT_STATE_OPEN)\n rend_service_intro_has_opened(launched);\n extend_info_free(direct_ei);\n return 0;\n}\n\n/** Return the number of introduction points that are established for the\n * given service. */\nstatic unsigned int\ncount_established_intro_points(const rend_service_t *service)\n{\n unsigned int num = 0;\n\n SMARTLIST_FOREACH(service->intro_nodes, rend_intro_point_t *, intro,\n num += intro->circuit_established\n );\n return num;\n}\n\n/** Return the number of introduction points that are or are being\n * established for the given service. This function iterates over all\n * circuit and count those that are linked to the service and are waiting\n * for the intro point to respond. */\nstatic unsigned int\ncount_intro_point_circuits(const rend_service_t *service)\n{\n unsigned int num_ipos = 0;\n SMARTLIST_FOREACH_BEGIN(circuit_get_global_list(), circuit_t *, circ) {\n if (!circ->marked_for_close &&\n circ->state == CIRCUIT_STATE_OPEN &&\n (circ->purpose == CIRCUIT_PURPOSE_S_ESTABLISH_INTRO ||\n circ->purpose == CIRCUIT_PURPOSE_S_INTRO)) {\n origin_circuit_t *oc = TO_ORIGIN_CIRCUIT(circ);\n if (oc->rend_data &&\n rend_circuit_pk_digest_eq(oc, (uint8_t *) service->pk_digest)) {\n num_ipos++;\n }\n }\n }\n SMARTLIST_FOREACH_END(circ);\n return num_ipos;\n}\n\n/* Given a buffer of at least RELAY_PAYLOAD_SIZE bytes in <b>cell_body_out</b>,\n write the body of a legacy ESTABLISH_INTRO cell in it. Use <b>intro_key</b>\n as the intro point auth key, and <b>rend_circ_nonce</b> as the circuit\n crypto material. On success, fill <b>cell_body_out</b> and return the number\n of bytes written. On fail, return -1.\n */\nSTATIC ssize_t\nencode_establish_intro_cell_legacy(char *cell_body_out,\n size_t cell_body_out_len,\n crypto_pk_t *intro_key, char *rend_circ_nonce)\n{\n int retval = -1;\n int r;\n int len = 0;\n char auth[DIGEST_LEN + 9];\n\n tor_assert(intro_key);\n tor_assert(rend_circ_nonce);\n\n /* Build the payload for a RELAY_ESTABLISH_INTRO cell. */\n r = crypto_pk_asn1_encode(intro_key, cell_body_out+2,\n RELAY_PAYLOAD_SIZE-2);\n if (r < 0) {\n log_warn(LD_BUG, \"Internal error; failed to establish intro point.\");\n goto err;\n }\n len = r;\n set_uint16(cell_body_out, htons((uint16_t)len));\n len += 2;\n memcpy(auth, rend_circ_nonce, DIGEST_LEN);\n memcpy(auth+DIGEST_LEN, \"INTRODUCE\", 9);\n if (crypto_digest(cell_body_out+len, auth, DIGEST_LEN+9))\n goto err;\n len += 20;\n note_crypto_pk_op(REND_SERVER);\n r = crypto_pk_private_sign_digest(intro_key, cell_body_out+len,\n cell_body_out_len - len,\n cell_body_out, len);\n if (r<0) {\n log_warn(LD_BUG, \"Internal error: couldn't sign introduction request.\");\n goto err;\n }\n len += r;\n\n retval = len;\n\n err:\n memwipe(auth, 0, sizeof(auth));\n\n return retval;\n}\n\n/** Called when we're done building a circuit to an introduction point:\n * sends a RELAY_ESTABLISH_INTRO cell.\n */\nvoid\nrend_service_intro_has_opened(origin_circuit_t *circuit)\n{\n rend_service_t *service;\n char buf[RELAY_PAYLOAD_SIZE];\n char serviceid[REND_SERVICE_ID_LEN_BASE32+1];\n unsigned int expiring_nodes_len, num_ip_circuits, valid_ip_circuits = 0;\n int reason = END_CIRC_REASON_TORPROTOCOL;\n const char *rend_pk_digest;\n\n tor_assert(circuit->base_.purpose == CIRCUIT_PURPOSE_S_ESTABLISH_INTRO);\n assert_circ_anonymity_ok(circuit, get_options());\n tor_assert(circuit->cpath);\n tor_assert(circuit->rend_data);\n /* XXX: This is version 2 specific (only on supported). */\n rend_pk_digest = (char *) rend_data_get_pk_digest(circuit->rend_data, NULL);\n\n base32_encode(serviceid, REND_SERVICE_ID_LEN_BASE32+1,\n rend_pk_digest, REND_SERVICE_ID_LEN);\n\n service = rend_service_get_by_pk_digest(rend_pk_digest);\n if (!service) {\n log_warn(LD_REND, \"Unrecognized service ID %s on introduction circuit %u.\",\n safe_str_client(serviceid), (unsigned)circuit->base_.n_circ_id);\n reason = END_CIRC_REASON_NOSUCHSERVICE;\n goto err;\n }\n\n /* Take the current amount of expiring nodes and the current amount of IP\n * circuits and compute how many valid IP circuits we have. */\n expiring_nodes_len = (unsigned int) smartlist_len(service->expiring_nodes);\n num_ip_circuits = count_intro_point_circuits(service);\n /* Let's avoid an underflow. The valid_ip_circuits is initialized to 0 in\n * case this condition turns out false because it means that all circuits\n * are expiring so we need to keep this circuit. */\n if (num_ip_circuits > expiring_nodes_len) {\n valid_ip_circuits = num_ip_circuits - expiring_nodes_len;\n }\n\n /* If we already have enough introduction circuits for this service,\n * redefine this one as a general circuit or close it, depending.\n * Substract the amount of expiring nodes here because the circuits are\n * still opened. */\n if (valid_ip_circuits > service->n_intro_points_wanted) {\n const or_options_t *options = get_options();\n /* Remove the intro point associated with this circuit, it's being\n * repurposed or closed thus cleanup memory. */\n rend_intro_point_t *intro = find_intro_point(circuit);\n if (intro != NULL) {\n smartlist_remove(service->intro_nodes, intro);\n rend_intro_point_free(intro);\n }\n\n if (options->ExcludeNodes) {\n /* XXXX in some future version, we can test whether the transition is\n allowed or not given the actual nodes in the circuit. But for now,\n this case, we might as well close the thing. */\n log_info(LD_CIRC|LD_REND, \"We have just finished an introduction \"\n \"circuit, but we already have enough. Closing it.\");\n reason = END_CIRC_REASON_NONE;\n goto err;\n } else {\n tor_assert(circuit->build_state->is_internal);\n log_info(LD_CIRC|LD_REND, \"We have just finished an introduction \"\n \"circuit, but we already have enough. Redefining purpose to \"\n \"general; leaving as internal.\");\n\n circuit_change_purpose(TO_CIRCUIT(circuit), CIRCUIT_PURPOSE_C_GENERAL);\n\n {\n rend_data_free(circuit->rend_data);\n circuit->rend_data = NULL;\n }\n {\n crypto_pk_t *intro_key = circuit->intro_key;\n circuit->intro_key = NULL;\n crypto_pk_free(intro_key);\n }\n\n circuit_has_opened(circuit);\n goto done;\n }\n }\n\n log_info(LD_REND,\n \"Established circuit %u as introduction point for service %s\",\n (unsigned)circuit->base_.n_circ_id, serviceid);\n circuit_log_path(LOG_INFO, LD_REND, circuit);\n\n /* Send the ESTABLISH_INTRO cell */\n {\n ssize_t len;\n len = encode_establish_intro_cell_legacy(buf, sizeof(buf),\n circuit->intro_key,\n circuit->cpath->prev->rend_circ_nonce);\n if (len < 0) {\n reason = END_CIRC_REASON_INTERNAL;\n goto err;\n }\n\n if (relay_send_command_from_edge(0, TO_CIRCUIT(circuit),\n RELAY_COMMAND_ESTABLISH_INTRO,\n buf, len, circuit->cpath->prev)<0) {\n log_info(LD_GENERAL,\n \"Couldn't send introduction request for service %s on circuit %u\",\n serviceid, (unsigned)circuit->base_.n_circ_id);\n goto done;\n }\n }\n\n /* We've attempted to use this circuit */\n pathbias_count_use_attempt(circuit);\n\n goto done;\n\n err:\n circuit_mark_for_close(TO_CIRCUIT(circuit), reason);\n done:\n memwipe(buf, 0, sizeof(buf));\n memwipe(serviceid, 0, sizeof(serviceid));\n\n return;\n}\n\n/** Called when we get an INTRO_ESTABLISHED cell; mark the circuit as a\n * live introduction point, and note that the service descriptor is\n * now out-of-date. */\nint\nrend_service_intro_established(origin_circuit_t *circuit,\n const uint8_t *request,\n size_t request_len)\n{\n rend_service_t *service;\n rend_intro_point_t *intro;\n char serviceid[REND_SERVICE_ID_LEN_BASE32+1];\n (void) request;\n (void) request_len;\n tor_assert(circuit->rend_data);\n /* XXX: This is version 2 specific (only supported one for now). */\n const char *rend_pk_digest =\n (char *) rend_data_get_pk_digest(circuit->rend_data, NULL);\n\n if (circuit->base_.purpose != CIRCUIT_PURPOSE_S_ESTABLISH_INTRO) {\n log_warn(LD_PROTOCOL,\n \"received INTRO_ESTABLISHED cell on non-intro circuit.\");\n goto err;\n }\n service = rend_service_get_by_pk_digest(rend_pk_digest);\n if (!service) {\n log_warn(LD_REND, \"Unknown service on introduction circuit %u.\",\n (unsigned)circuit->base_.n_circ_id);\n goto err;\n }\n /* We've just successfully established a intro circuit to one of our\n * introduction point, account for it. */\n intro = find_intro_point(circuit);\n if (intro == NULL) {\n log_warn(LD_REND,\n \"Introduction circuit established without a rend_intro_point_t \"\n \"object for service %s on circuit %u\",\n safe_str_client(serviceid), (unsigned)circuit->base_.n_circ_id);\n goto err;\n }\n intro->circuit_established = 1;\n /* We might not have every introduction point ready but at this point we\n * know that the descriptor needs to be uploaded. */\n service->desc_is_dirty = time(NULL);\n circuit_change_purpose(TO_CIRCUIT(circuit), CIRCUIT_PURPOSE_S_INTRO);\n\n base32_encode(serviceid, REND_SERVICE_ID_LEN_BASE32 + 1,\n rend_pk_digest, REND_SERVICE_ID_LEN);\n log_info(LD_REND,\n \"Received INTRO_ESTABLISHED cell on circuit %u for service %s\",\n (unsigned)circuit->base_.n_circ_id, serviceid);\n\n /* Getting a valid INTRODUCE_ESTABLISHED means we've successfully\n * used the circ */\n pathbias_mark_use_success(circuit);\n\n return 0;\n err:\n circuit_mark_for_close(TO_CIRCUIT(circuit), END_CIRC_REASON_TORPROTOCOL);\n return -1;\n}\n\n/** Called once a circuit to a rendezvous point is established: sends a\n * RELAY_COMMAND_RENDEZVOUS1 cell.\n */\nvoid\nrend_service_rendezvous_has_opened(origin_circuit_t *circuit)\n{\n rend_service_t *service;\n char buf[RELAY_PAYLOAD_SIZE];\n crypt_path_t *hop;\n char serviceid[REND_SERVICE_ID_LEN_BASE32+1];\n char hexcookie[9];\n int reason;\n const char *rend_cookie, *rend_pk_digest;\n\n tor_assert(circuit->base_.purpose == CIRCUIT_PURPOSE_S_CONNECT_REND);\n tor_assert(circuit->cpath);\n tor_assert(circuit->build_state);\n assert_circ_anonymity_ok(circuit, get_options());\n tor_assert(circuit->rend_data);\n\n /* XXX: This is version 2 specific (only one supported). */\n rend_pk_digest = (char *) rend_data_get_pk_digest(circuit->rend_data,\n NULL);\n rend_cookie = circuit->rend_data->rend_cookie;\n\n /* Declare the circuit dirty to avoid reuse, and for path-bias */\n if (!circuit->base_.timestamp_dirty)\n circuit->base_.timestamp_dirty = time(NULL);\n\n /* This may be redundant */\n pathbias_count_use_attempt(circuit);\n\n hop = circuit->build_state->service_pending_final_cpath_ref->cpath;\n\n base16_encode(hexcookie,9, rend_cookie,4);\n base32_encode(serviceid, REND_SERVICE_ID_LEN_BASE32+1,\n rend_pk_digest, REND_SERVICE_ID_LEN);\n\n log_info(LD_REND,\n \"Done building circuit %u to rendezvous with \"\n \"cookie %s for service %s\",\n (unsigned)circuit->base_.n_circ_id, hexcookie, serviceid);\n circuit_log_path(LOG_INFO, LD_REND, circuit);\n\n /* Clear the 'in-progress HS circ has timed out' flag for\n * consistency with what happens on the client side; this line has\n * no effect on Tor's behaviour. */\n circuit->hs_circ_has_timed_out = 0;\n\n /* If hop is NULL, another rend circ has already connected to this\n * rend point. Close this circ. */\n if (hop == NULL) {\n log_info(LD_REND, \"Another rend circ has already reached this rend point; \"\n \"closing this rend circ.\");\n reason = END_CIRC_REASON_NONE;\n goto err;\n }\n\n /* Remove our final cpath element from the reference, so that no\n * other circuit will try to use it. Store it in\n * pending_final_cpath for now to ensure that it will be freed if\n * our rendezvous attempt fails. */\n circuit->build_state->pending_final_cpath = hop;\n circuit->build_state->service_pending_final_cpath_ref->cpath = NULL;\n\n service = rend_service_get_by_pk_digest(rend_pk_digest);\n if (!service) {\n log_warn(LD_GENERAL, \"Internal error: unrecognized service ID on \"\n \"rendezvous circuit.\");\n reason = END_CIRC_REASON_INTERNAL;\n goto err;\n }\n\n /* All we need to do is send a RELAY_RENDEZVOUS1 cell... */\n memcpy(buf, rend_cookie, REND_COOKIE_LEN);\n if (crypto_dh_get_public(hop->rend_dh_handshake_state,\n buf+REND_COOKIE_LEN, DH_KEY_LEN)<0) {\n log_warn(LD_GENERAL,\"Couldn't get DH public key.\");\n reason = END_CIRC_REASON_INTERNAL;\n goto err;\n }\n memcpy(buf+REND_COOKIE_LEN+DH_KEY_LEN, hop->rend_circ_nonce,\n DIGEST_LEN);\n\n /* Send the cell */\n if (relay_send_command_from_edge(0, TO_CIRCUIT(circuit),\n RELAY_COMMAND_RENDEZVOUS1,\n buf, REND_COOKIE_LEN+DH_KEY_LEN+DIGEST_LEN,\n circuit->cpath->prev)<0) {\n log_warn(LD_GENERAL, \"Couldn't send RENDEZVOUS1 cell.\");\n goto done;\n }\n\n crypto_dh_free(hop->rend_dh_handshake_state);\n hop->rend_dh_handshake_state = NULL;\n\n /* Append the cpath entry. */\n hop->state = CPATH_STATE_OPEN;\n /* set the windows to default. these are the windows\n * that the service thinks the client has.\n */\n hop->package_window = circuit_initial_package_window();\n hop->deliver_window = CIRCWINDOW_START;\n\n onion_append_to_cpath(&circuit->cpath, hop);\n circuit->build_state->pending_final_cpath = NULL; /* prevent double-free */\n\n /* Change the circuit purpose. */\n circuit_change_purpose(TO_CIRCUIT(circuit), CIRCUIT_PURPOSE_S_REND_JOINED);\n\n goto done;\n\n err:\n circuit_mark_for_close(TO_CIRCUIT(circuit), reason);\n done:\n memwipe(buf, 0, sizeof(buf));\n memwipe(serviceid, 0, sizeof(serviceid));\n memwipe(hexcookie, 0, sizeof(hexcookie));\n\n return;\n}\n\n/*\n * Manage introduction points\n */\n\n/** Return the (possibly non-open) introduction circuit ending at\n * <b>intro</b> for the service whose public key is <b>pk_digest</b>.\n * (<b>desc_version</b> is ignored). Return NULL if no such service is\n * found.\n */\nstatic origin_circuit_t *\nfind_intro_circuit(rend_intro_point_t *intro, const char *pk_digest)\n{\n origin_circuit_t *circ = NULL;\n\n tor_assert(intro);\n while ((circ = circuit_get_next_by_pk_and_purpose(circ,\n (uint8_t *) pk_digest, CIRCUIT_PURPOSE_S_INTRO))) {\n if (tor_memeq(circ->build_state->chosen_exit->identity_digest,\n intro->extend_info->identity_digest, DIGEST_LEN) &&\n circ->rend_data) {\n return circ;\n }\n }\n\n circ = NULL;\n while ((circ = circuit_get_next_by_pk_and_purpose(circ,\n (uint8_t *) pk_digest,\n CIRCUIT_PURPOSE_S_ESTABLISH_INTRO))) {\n if (tor_memeq(circ->build_state->chosen_exit->identity_digest,\n intro->extend_info->identity_digest, DIGEST_LEN) &&\n circ->rend_data) {\n return circ;\n }\n }\n return NULL;\n}\n\n/** Return the corresponding introdution point using the circuit <b>circ</b>\n * found in the <b>service</b>. NULL is returned if not found. */\nstatic rend_intro_point_t *\nfind_expiring_intro_point(rend_service_t *service, origin_circuit_t *circ)\n{\n tor_assert(service);\n tor_assert(TO_CIRCUIT(circ)->purpose == CIRCUIT_PURPOSE_S_ESTABLISH_INTRO ||\n TO_CIRCUIT(circ)->purpose == CIRCUIT_PURPOSE_S_INTRO);\n\n SMARTLIST_FOREACH(service->expiring_nodes, rend_intro_point_t *,\n intro_point,\n if (crypto_pk_eq_keys(intro_point->intro_key, circ->intro_key)) {\n return intro_point;\n });\n\n return NULL;\n}\n\n/** Return a pointer to the rend_intro_point_t corresponding to the\n * service-side introduction circuit <b>circ</b>. */\nstatic rend_intro_point_t *\nfind_intro_point(origin_circuit_t *circ)\n{\n const char *serviceid;\n rend_service_t *service = NULL;\n\n tor_assert(TO_CIRCUIT(circ)->purpose == CIRCUIT_PURPOSE_S_ESTABLISH_INTRO ||\n TO_CIRCUIT(circ)->purpose == CIRCUIT_PURPOSE_S_INTRO);\n tor_assert(circ->rend_data);\n serviceid = rend_data_get_address(circ->rend_data);\n\n SMARTLIST_FOREACH(rend_service_list, rend_service_t *, s,\n if (tor_memeq(s->service_id, serviceid, REND_SERVICE_ID_LEN_BASE32)) {\n service = s;\n break;\n });\n\n if (service == NULL) return NULL;\n\n SMARTLIST_FOREACH(service->intro_nodes, rend_intro_point_t *, intro_point,\n if (crypto_pk_eq_keys(intro_point->intro_key, circ->intro_key)) {\n return intro_point;\n });\n\n return NULL;\n}\n\n/** Upload the rend_encoded_v2_service_descriptor_t's in <b>descs</b>\n * associated with the rend_service_descriptor_t <b>renddesc</b> to\n * the responsible hidden service directories OR the hidden service\n * directories specified by <b>hs_dirs</b>; <b>service_id</b> and\n * <b>seconds_valid</b> are only passed for logging purposes.\n */\nvoid\ndirectory_post_to_hs_dir(rend_service_descriptor_t *renddesc,\n smartlist_t *descs, smartlist_t *hs_dirs,\n const char *service_id, int seconds_valid)\n{\n int i, j, failed_upload = 0;\n smartlist_t *responsible_dirs = smartlist_new();\n smartlist_t *successful_uploads = smartlist_new();\n routerstatus_t *hs_dir;\n for (i = 0; i < smartlist_len(descs); i++) {\n rend_encoded_v2_service_descriptor_t *desc = smartlist_get(descs, i);\n /** If any HSDirs are specified, they should be used instead of\n * the responsible directories */\n if (hs_dirs && smartlist_len(hs_dirs) > 0) {\n smartlist_add_all(responsible_dirs, hs_dirs);\n } else {\n /* Determine responsible dirs. */\n if (hid_serv_get_responsible_directories(responsible_dirs,\n desc->desc_id) < 0) {\n log_warn(LD_REND, \"Could not determine the responsible hidden service \"\n \"directories to post descriptors to.\");\n control_event_hs_descriptor_upload(service_id,\n \"UNKNOWN\",\n \"UNKNOWN\");\n goto done;\n }\n }\n for (j = 0; j < smartlist_len(responsible_dirs); j++) {\n char desc_id_base32[REND_DESC_ID_V2_LEN_BASE32 + 1];\n char *hs_dir_ip;\n const node_t *node;\n rend_data_t *rend_data;\n hs_dir = smartlist_get(responsible_dirs, j);\n if (smartlist_contains_digest(renddesc->successful_uploads,\n hs_dir->identity_digest))\n /* Don't upload descriptor if we succeeded in doing so last time. */\n continue;\n node = node_get_by_id(hs_dir->identity_digest);\n if (!node || !node_has_descriptor(node)) {\n log_info(LD_REND, \"Not launching upload for for v2 descriptor to \"\n \"hidden service directory %s; we don't have its \"\n \"router descriptor. Queuing for later upload.\",\n safe_str_client(routerstatus_describe(hs_dir)));\n failed_upload = -1;\n continue;\n }\n /* Send publish request. */\n\n /* We need the service ID to identify which service did the upload\n * request. Lookup is made in rend_service_desc_has_uploaded(). */\n rend_data = rend_data_client_create(service_id, desc->desc_id, NULL,\n REND_NO_AUTH);\n directory_initiate_command_routerstatus_rend(hs_dir,\n DIR_PURPOSE_UPLOAD_RENDDESC_V2,\n ROUTER_PURPOSE_GENERAL,\n DIRIND_ANONYMOUS, NULL,\n desc->desc_str,\n strlen(desc->desc_str),\n 0, rend_data, NULL);\n rend_data_free(rend_data);\n base32_encode(desc_id_base32, sizeof(desc_id_base32),\n desc->desc_id, DIGEST_LEN);\n hs_dir_ip = tor_dup_ip(hs_dir->addr);\n log_info(LD_REND, \"Launching upload for v2 descriptor for \"\n \"service '%s' with descriptor ID '%s' with validity \"\n \"of %d seconds to hidden service directory '%s' on \"\n \"%s:%d.\",\n safe_str_client(service_id),\n safe_str_client(desc_id_base32),\n seconds_valid,\n hs_dir->nickname,\n hs_dir_ip,\n hs_dir->or_port);\n control_event_hs_descriptor_upload(service_id,\n hs_dir->identity_digest,\n desc_id_base32);\n tor_free(hs_dir_ip);\n /* Remember successful upload to this router for next time. */\n if (!smartlist_contains_digest(successful_uploads,\n hs_dir->identity_digest))\n smartlist_add(successful_uploads, hs_dir->identity_digest);\n }\n smartlist_clear(responsible_dirs);\n }\n if (!failed_upload) {\n if (renddesc->successful_uploads) {\n SMARTLIST_FOREACH(renddesc->successful_uploads, char *, c, tor_free(c););\n smartlist_free(renddesc->successful_uploads);\n renddesc->successful_uploads = NULL;\n }\n renddesc->all_uploads_performed = 1;\n } else {\n /* Remember which routers worked this time, so that we don't upload the\n * descriptor to them again. */\n if (!renddesc->successful_uploads)\n renddesc->successful_uploads = smartlist_new();\n SMARTLIST_FOREACH(successful_uploads, const char *, c, {\n if (!smartlist_contains_digest(renddesc->successful_uploads, c)) {\n char *hsdir_id = tor_memdup(c, DIGEST_LEN);\n smartlist_add(renddesc->successful_uploads, hsdir_id);\n }\n });\n }\n done:\n smartlist_free(responsible_dirs);\n smartlist_free(successful_uploads);\n}\n\n/** Encode and sign an up-to-date service descriptor for <b>service</b>,\n * and upload it/them to the responsible hidden service directories.\n */\nstatic void\nupload_service_descriptor(rend_service_t *service)\n{\n time_t now = time(NULL);\n int rendpostperiod;\n char serviceid[REND_SERVICE_ID_LEN_BASE32+1];\n int uploaded = 0;\n\n rendpostperiod = get_options()->RendPostPeriod;\n\n networkstatus_t *c = networkstatus_get_latest_consensus();\n if (c && smartlist_len(c->routerstatus_list) > 0) {\n int seconds_valid, i, j, num_descs;\n smartlist_t *descs = smartlist_new();\n smartlist_t *client_cookies = smartlist_new();\n /* Either upload a single descriptor (including replicas) or one\n * descriptor for each authorized client in case of authorization\n * type 'stealth'. */\n num_descs = service->auth_type == REND_STEALTH_AUTH ?\n smartlist_len(service->clients) : 1;\n for (j = 0; j < num_descs; j++) {\n crypto_pk_t *client_key = NULL;\n rend_authorized_client_t *client = NULL;\n smartlist_clear(client_cookies);\n switch (service->auth_type) {\n case REND_NO_AUTH:\n /* Do nothing here. */\n break;\n case REND_BASIC_AUTH:\n SMARTLIST_FOREACH(service->clients, rend_authorized_client_t *,\n cl, smartlist_add(client_cookies, cl->descriptor_cookie));\n break;\n case REND_STEALTH_AUTH:\n client = smartlist_get(service->clients, j);\n client_key = client->client_key;\n smartlist_add(client_cookies, client->descriptor_cookie);\n break;\n }\n /* Encode the current descriptor. */\n seconds_valid = rend_encode_v2_descriptors(descs, service->desc,\n now, 0,\n service->auth_type,\n client_key,\n client_cookies);\n if (seconds_valid < 0) {\n log_warn(LD_BUG, \"Internal error: couldn't encode service \"\n \"descriptor; not uploading.\");\n smartlist_free(descs);\n smartlist_free(client_cookies);\n return;\n }\n rend_get_service_id(service->desc->pk, serviceid);\n if (get_options()->PublishHidServDescriptors) {\n /* Post the current descriptors to the hidden service directories. */\n log_info(LD_REND, \"Launching upload for hidden service %s\",\n serviceid);\n directory_post_to_hs_dir(service->desc, descs, NULL, serviceid,\n seconds_valid);\n }\n /* Free memory for descriptors. */\n for (i = 0; i < smartlist_len(descs); i++)\n rend_encoded_v2_service_descriptor_free(smartlist_get(descs, i));\n smartlist_clear(descs);\n /* Update next upload time. */\n if (seconds_valid - REND_TIME_PERIOD_OVERLAPPING_V2_DESCS\n > rendpostperiod)\n service->next_upload_time = now + rendpostperiod;\n else if (seconds_valid < REND_TIME_PERIOD_OVERLAPPING_V2_DESCS)\n service->next_upload_time = now + seconds_valid + 1;\n else\n service->next_upload_time = now + seconds_valid -\n REND_TIME_PERIOD_OVERLAPPING_V2_DESCS + 1;\n /* Post also the next descriptors, if necessary. */\n if (seconds_valid < REND_TIME_PERIOD_OVERLAPPING_V2_DESCS) {\n seconds_valid = rend_encode_v2_descriptors(descs, service->desc,\n now, 1,\n service->auth_type,\n client_key,\n client_cookies);\n if (seconds_valid < 0) {\n log_warn(LD_BUG, \"Internal error: couldn't encode service \"\n \"descriptor; not uploading.\");\n smartlist_free(descs);\n smartlist_free(client_cookies);\n return;\n }\n if (get_options()->PublishHidServDescriptors) {\n directory_post_to_hs_dir(service->desc, descs, NULL, serviceid,\n seconds_valid);\n }\n /* Free memory for descriptors. */\n for (i = 0; i < smartlist_len(descs); i++)\n rend_encoded_v2_service_descriptor_free(smartlist_get(descs, i));\n smartlist_clear(descs);\n }\n }\n smartlist_free(descs);\n smartlist_free(client_cookies);\n uploaded = 1;\n if (get_options()->PublishHidServDescriptors) {\n log_info(LD_REND, \"Successfully uploaded v2 rend descriptors!\");\n } else {\n log_info(LD_REND, \"Successfully stored created v2 rend descriptors!\");\n }\n }\n\n /* If not uploaded, try again in one minute. */\n if (!uploaded)\n service->next_upload_time = now + 60;\n\n /* Unmark dirty flag of this service. */\n service->desc_is_dirty = 0;\n}\n\n/** Return the number of INTRODUCE2 cells this hidden service has received\n * from this intro point. */\nstatic int\nintro_point_accepted_intro_count(rend_intro_point_t *intro)\n{\n return intro->accepted_introduce2_count;\n}\n\n/** Return non-zero iff <b>intro</b> should 'expire' now (i.e. we\n * should stop publishing it in new descriptors and eventually close\n * it). */\nstatic int\nintro_point_should_expire_now(rend_intro_point_t *intro,\n time_t now)\n{\n tor_assert(intro != NULL);\n\n if (intro->time_published == -1) {\n /* Don't expire an intro point if we haven't even published it yet. */\n return 0;\n }\n\n if (intro_point_accepted_intro_count(intro) >=\n intro->max_introductions) {\n /* This intro point has been used too many times. Expire it now. */\n return 1;\n }\n\n if (intro->time_to_expire == -1) {\n /* This intro point has been published, but we haven't picked an\n * expiration time for it. Pick one now. */\n int intro_point_lifetime_seconds =\n crypto_rand_int_range(INTRO_POINT_LIFETIME_MIN_SECONDS,\n INTRO_POINT_LIFETIME_MAX_SECONDS);\n\n /* Start the expiration timer now, rather than when the intro\n * point was first published. There shouldn't be much of a time\n * difference. */\n intro->time_to_expire = now + intro_point_lifetime_seconds;\n\n return 0;\n }\n\n /* This intro point has a time to expire set already. Use it. */\n return (now >= intro->time_to_expire);\n}\n\n/** Iterate over intro points in the given service and remove the invalid\n * ones. For an intro point object to be considered invalid, the circuit\n * _and_ node need to have disappeared.\n *\n * If the intro point should expire, it's placed into the expiring_nodes\n * list of the service and removed from the active intro nodes list.\n *\n * If <b>exclude_nodes</b> is not NULL, add the valid nodes to it.\n *\n * If <b>retry_nodes</b> is not NULL, add the valid node to it if the\n * circuit disappeared but the node is still in the consensus. */\nstatic void\nremove_invalid_intro_points(rend_service_t *service,\n smartlist_t *exclude_nodes,\n smartlist_t *retry_nodes, time_t now)\n{\n tor_assert(service);\n\n /* Remove any expired nodes that doesn't have a circuit. */\n SMARTLIST_FOREACH_BEGIN(service->expiring_nodes, rend_intro_point_t *,\n intro) {\n origin_circuit_t *intro_circ =\n find_intro_circuit(intro, service->pk_digest);\n if (intro_circ) {\n continue;\n }\n /* No more circuit, cleanup the into point object. */\n SMARTLIST_DEL_CURRENT(service->expiring_nodes, intro);\n rend_intro_point_free(intro);\n } SMARTLIST_FOREACH_END(intro);\n\n SMARTLIST_FOREACH_BEGIN(service->intro_nodes, rend_intro_point_t *,\n intro) {\n /* Find the introduction point node object. */\n const node_t *node =\n node_get_by_id(intro->extend_info->identity_digest);\n /* Find the intro circuit, this might be NULL. */\n origin_circuit_t *intro_circ =\n find_intro_circuit(intro, service->pk_digest);\n\n /* Add the valid node to the exclusion list so we don't try to establish\n * an introduction point to it again. */\n if (node && exclude_nodes) {\n smartlist_add(exclude_nodes, (void*) node);\n }\n\n /* First, make sure we still have a valid circuit for this intro point.\n * If we dont, we'll give up on it and make a new one. */\n if (intro_circ == NULL) {\n log_info(LD_REND, \"Attempting to retry on %s as intro point for %s\"\n \" (circuit disappeared).\",\n safe_str_client(extend_info_describe(intro->extend_info)),\n safe_str_client(service->service_id));\n /* We've lost the circuit for this intro point, flag it so it can be\n * accounted for when considiring uploading a descriptor. */\n intro->circuit_established = 0;\n\n /* Node is gone or we've reached our maximum circuit creationg retry\n * count, clean up everything, we'll find a new one. */\n if (node == NULL ||\n intro->circuit_retries >= MAX_INTRO_POINT_CIRCUIT_RETRIES) {\n rend_intro_point_free(intro);\n SMARTLIST_DEL_CURRENT(service->intro_nodes, intro);\n /* We've just killed the intro point, nothing left to do. */\n continue;\n }\n\n /* The intro point is still alive so let's try to use it again because\n * we have a published descriptor containing it. Keep the intro point\n * in the intro_nodes list because it's still valid, we are rebuilding\n * a circuit to it. */\n if (retry_nodes) {\n smartlist_add(retry_nodes, intro);\n }\n }\n /* else, the circuit is valid so in both cases, node being alive or not,\n * we leave the circuit and intro point object as is. Closing the\n * circuit here would leak new consensus timing and freeing the intro\n * point object would make the intro circuit unusable. */\n\n /* Now, check if intro point should expire. If it does, queue it so\n * it can be cleaned up once it has been replaced properly. */\n if (intro_point_should_expire_now(intro, now)) {\n log_info(LD_REND, \"Expiring %s as intro point for %s.\",\n safe_str_client(extend_info_describe(intro->extend_info)),\n safe_str_client(service->service_id));\n smartlist_add(service->expiring_nodes, intro);\n SMARTLIST_DEL_CURRENT(service->intro_nodes, intro);\n /* Intro point is expired, we need a new one thus don't consider it\n * anymore has a valid established intro point. */\n intro->circuit_established = 0;\n }\n } SMARTLIST_FOREACH_END(intro);\n}\n\n/** A new descriptor has been successfully uploaded for the given\n * <b>rend_data</b>. Remove and free the expiring nodes from the associated\n * service. */\nvoid\nrend_service_desc_has_uploaded(const rend_data_t *rend_data)\n{\n rend_service_t *service;\n const char *onion_address;\n\n tor_assert(rend_data);\n\n onion_address = rend_data_get_address(rend_data);\n\n service = rend_service_get_by_service_id(onion_address);\n if (service == NULL) {\n return;\n }\n\n SMARTLIST_FOREACH_BEGIN(service->expiring_nodes, rend_intro_point_t *,\n intro) {\n origin_circuit_t *intro_circ =\n find_intro_circuit(intro, service->pk_digest);\n if (intro_circ != NULL) {\n circuit_mark_for_close(TO_CIRCUIT(intro_circ),\n END_CIRC_REASON_FINISHED);\n }\n SMARTLIST_DEL_CURRENT(service->expiring_nodes, intro);\n rend_intro_point_free(intro);\n } SMARTLIST_FOREACH_END(intro);\n}\n\n/** Don't try to build more than this many circuits before giving up\n * for a while. Dynamically calculated based on the configured number of\n * introduction points for the service, n_intro_points_wanted. */\nstatic int\nrend_max_intro_circs_per_period(unsigned int n_intro_points_wanted)\n{\n /* Allow all but one of the initial connections to fail and be\n * retried. (If all fail, we *want* to wait, because something is broken.) */\n tor_assert(n_intro_points_wanted <= NUM_INTRO_POINTS_MAX);\n return (int)(2*n_intro_points_wanted + NUM_INTRO_POINTS_EXTRA);\n}\n\n/** For every service, check how many intro points it currently has, and:\n * - Invalidate introdution points based on specific criteria, see\n * remove_invalid_intro_points comments.\n * - Pick new intro points as necessary.\n * - Launch circuits to any new intro points.\n *\n * This is called once a second by the main loop.\n */\nvoid\nrend_consider_services_intro_points(void)\n{\n int i;\n time_t now;\n const or_options_t *options = get_options();\n /* Are we in single onion mode? */\n const int allow_direct = rend_service_allow_non_anonymous_connection(\n get_options());\n /* List of nodes we need to _exclude_ when choosing a new node to\n * establish an intro point to. */\n smartlist_t *exclude_nodes;\n /* List of nodes we need to retry to build a circuit on them because the\n * node is valid but circuit died. */\n smartlist_t *retry_nodes;\n\n if (!have_completed_a_circuit())\n return;\n\n exclude_nodes = smartlist_new();\n retry_nodes = smartlist_new();\n now = time(NULL);\n\n SMARTLIST_FOREACH_BEGIN(rend_service_list, rend_service_t *, service) {\n int r;\n /* Number of intro points we want to open and add to the intro nodes\n * list of the service. */\n unsigned int n_intro_points_to_open;\n /* Have an unsigned len so we can use it to compare values else gcc is\n * not happy with unmatching signed comparaison. */\n unsigned int intro_nodes_len;\n /* Different service are allowed to have the same introduction point as\n * long as they are on different circuit thus why we clear this list. */\n smartlist_clear(exclude_nodes);\n smartlist_clear(retry_nodes);\n\n /* Cleanup the invalid intro points and save the node objects, if any,\n * in the exclude_nodes and retry_nodes lists. */\n remove_invalid_intro_points(service, exclude_nodes, retry_nodes, now);\n\n /* This retry period is important here so we don't stress circuit\n * creation. */\n if (now > service->intro_period_started + INTRO_CIRC_RETRY_PERIOD) {\n /* One period has elapsed; we can try building circuits again. */\n service->intro_period_started = now;\n service->n_intro_circuits_launched = 0;\n } else if (service->n_intro_circuits_launched >=\n rend_max_intro_circs_per_period(\n service->n_intro_points_wanted)) {\n /* We have failed too many times in this period; wait for the next\n * one before we try to initiate any more connections. */\n continue;\n }\n\n /* Let's try to rebuild circuit on the nodes we want to retry on. */\n SMARTLIST_FOREACH_BEGIN(retry_nodes, rend_intro_point_t *, intro) {\n r = rend_service_launch_establish_intro(service, intro);\n if (r < 0) {\n log_warn(LD_REND, \"Error launching circuit to node %s for service %s.\",\n safe_str_client(extend_info_describe(intro->extend_info)),\n safe_str_client(service->service_id));\n /* Unable to launch a circuit to that intro point, remove it from\n * the valid list so we can create a new one. */\n smartlist_remove(service->intro_nodes, intro);\n rend_intro_point_free(intro);\n continue;\n }\n intro->circuit_retries++;\n } SMARTLIST_FOREACH_END(intro);\n\n /* Avoid mismatched signed comparaison below. */\n intro_nodes_len = (unsigned int) smartlist_len(service->intro_nodes);\n\n /* Quiescent state, we have more or the equal amount of wanted node for\n * this service. Proceed to the next service. We can have more nodes\n * because we launch extra preemptive circuits if our intro nodes list was\n * originally empty for performance reasons. */\n if (intro_nodes_len >= service->n_intro_points_wanted) {\n continue;\n }\n\n /* Number of intro points we want to open which is the wanted amount minus\n * the current amount of valid nodes. We know that this won't underflow\n * because of the check above. */\n n_intro_points_to_open = service->n_intro_points_wanted - intro_nodes_len;\n if (intro_nodes_len == 0) {\n /* We want to end up with n_intro_points_wanted intro points, but if\n * we have no intro points at all (chances are they all cycled or we\n * are starting up), we launch NUM_INTRO_POINTS_EXTRA extra circuits\n * and use the first n_intro_points_wanted that complete. See proposal\n * #155, section 4 for the rationale of this which is purely for\n * performance.\n *\n * The ones after the first n_intro_points_to_open will be converted\n * to 'general' internal circuits in rend_service_intro_has_opened(),\n * and then we'll drop them from the list of intro points. */\n n_intro_points_to_open += NUM_INTRO_POINTS_EXTRA;\n }\n\n for (i = 0; i < (int) n_intro_points_to_open; i++) {\n const node_t *node;\n rend_intro_point_t *intro;\n router_crn_flags_t flags = CRN_NEED_UPTIME|CRN_NEED_DESC;\n if (get_options()->AllowInvalid_ & ALLOW_INVALID_INTRODUCTION)\n flags |= CRN_ALLOW_INVALID;\n router_crn_flags_t direct_flags = flags;\n direct_flags |= CRN_PREF_ADDR;\n direct_flags |= CRN_DIRECT_CONN;\n\n node = router_choose_random_node(exclude_nodes,\n options->ExcludeNodes,\n allow_direct ? direct_flags : flags);\n /* If we are in single onion mode, retry node selection for a 3-hop\n * path */\n if (allow_direct && !node) {\n log_info(LD_REND,\n \"Unable to find an intro point that we can connect to \"\n \"directly for %s, falling back to a 3-hop path.\",\n safe_str_client(service->service_id));\n node = router_choose_random_node(exclude_nodes,\n options->ExcludeNodes, flags);\n }\n\n if (!node) {\n log_warn(LD_REND,\n \"We only have %d introduction points established for %s; \"\n \"wanted %u.\",\n smartlist_len(service->intro_nodes),\n safe_str_client(service->service_id),\n n_intro_points_to_open);\n break;\n }\n /* Add the choosen node to the exclusion list in order to avoid picking\n * it again in the next iteration. */\n smartlist_add(exclude_nodes, (void*)node);\n intro = tor_malloc_zero(sizeof(rend_intro_point_t));\n /* extend_info is for clients, so we want the multi-hop primary ORPort,\n * even if we are a single onion service and intend to connect to it\n * directly ourselves. */\n intro->extend_info = extend_info_from_node(node, 0);\n if (BUG(intro->extend_info == NULL)) {\n break;\n }\n intro->intro_key = crypto_pk_new();\n const int fail = crypto_pk_generate_key(intro->intro_key);\n tor_assert(!fail);\n intro->time_published = -1;\n intro->time_to_expire = -1;\n intro->max_introductions =\n crypto_rand_int_range(INTRO_POINT_MIN_LIFETIME_INTRODUCTIONS,\n INTRO_POINT_MAX_LIFETIME_INTRODUCTIONS);\n smartlist_add(service->intro_nodes, intro);\n log_info(LD_REND, \"Picked router %s as an intro point for %s.\",\n safe_str_client(node_describe(node)),\n safe_str_client(service->service_id));\n /* Establish new introduction circuit to our chosen intro point. */\n r = rend_service_launch_establish_intro(service, intro);\n if (r < 0) {\n log_warn(LD_REND, \"Error launching circuit to node %s for service %s.\",\n safe_str_client(extend_info_describe(intro->extend_info)),\n safe_str_client(service->service_id));\n /* This funcion will be called again by the main loop so this intro\n * point without a intro circuit will be retried on or removed after\n * a maximum number of attempts. */\n }\n }\n } SMARTLIST_FOREACH_END(service);\n smartlist_free(exclude_nodes);\n smartlist_free(retry_nodes);\n}\n\n#define MIN_REND_INITIAL_POST_DELAY (30)\n#define MIN_REND_INITIAL_POST_DELAY_TESTING (5)\n\n/** Regenerate and upload rendezvous service descriptors for all\n * services, if necessary. If the descriptor has been dirty enough\n * for long enough, definitely upload; else only upload when the\n * periodic timeout has expired.\n *\n * For the first upload, pick a random time between now and two periods\n * from now, and pick it independently for each service.\n */\nvoid\nrend_consider_services_upload(time_t now)\n{\n int i;\n rend_service_t *service;\n const or_options_t *options = get_options();\n int rendpostperiod = options->RendPostPeriod;\n int rendinitialpostdelay = (options->TestingTorNetwork ?\n MIN_REND_INITIAL_POST_DELAY_TESTING :\n MIN_REND_INITIAL_POST_DELAY);\n\n for (i=0; i < smartlist_len(rend_service_list); ++i) {\n service = smartlist_get(rend_service_list, i);\n if (!service->next_upload_time) { /* never been uploaded yet */\n /* The fixed lower bound of rendinitialpostdelay seconds ensures that\n * the descriptor is stable before being published. See comment below. */\n service->next_upload_time =\n now + rendinitialpostdelay + crypto_rand_int(2*rendpostperiod);\n /* Single Onion Services prioritise availability over hiding their\n * startup time, as their IP address is publicly discoverable anyway.\n */\n if (rend_service_reveal_startup_time(options)) {\n service->next_upload_time = now + rendinitialpostdelay;\n }\n }\n /* Does every introduction points have been established? */\n unsigned int intro_points_ready =\n count_established_intro_points(service) >=\n service->n_intro_points_wanted;\n if (intro_points_ready &&\n (service->next_upload_time < now ||\n (service->desc_is_dirty &&\n service->desc_is_dirty < now-rendinitialpostdelay))) {\n /* if it's time, or if the directory servers have a wrong service\n * descriptor and ours has been stable for rendinitialpostdelay seconds,\n * upload a new one of each format. */\n rend_service_update_descriptor(service);\n upload_service_descriptor(service);\n }\n }\n}\n\n/** True if the list of available router descriptors might have changed so\n * that we should have a look whether we can republish previously failed\n * rendezvous service descriptors. */\nstatic int consider_republishing_rend_descriptors = 1;\n\n/** Called when our internal view of the directory has changed, so that we\n * might have router descriptors of hidden service directories available that\n * we did not have before. */\nvoid\nrend_hsdir_routers_changed(void)\n{\n consider_republishing_rend_descriptors = 1;\n}\n\n/** Consider republication of v2 rendezvous service descriptors that failed\n * previously, but without regenerating descriptor contents.\n */\nvoid\nrend_consider_descriptor_republication(void)\n{\n int i;\n rend_service_t *service;\n\n if (!consider_republishing_rend_descriptors)\n return;\n consider_republishing_rend_descriptors = 0;\n\n if (!get_options()->PublishHidServDescriptors)\n return;\n\n for (i=0; i < smartlist_len(rend_service_list); ++i) {\n service = smartlist_get(rend_service_list, i);\n if (service->desc && !service->desc->all_uploads_performed) {\n /* If we failed in uploading a descriptor last time, try again *without*\n * updating the descriptor's contents. */\n upload_service_descriptor(service);\n }\n }\n}\n\n/** Log the status of introduction points for all rendezvous services\n * at log severity <b>severity</b>.\n */\nvoid\nrend_service_dump_stats(int severity)\n{\n int i,j;\n rend_service_t *service;\n rend_intro_point_t *intro;\n const char *safe_name;\n origin_circuit_t *circ;\n\n for (i=0; i < smartlist_len(rend_service_list); ++i) {\n service = smartlist_get(rend_service_list, i);\n tor_log(severity, LD_GENERAL, \"Service configured in %s:\",\n rend_service_escaped_dir(service));\n for (j=0; j < smartlist_len(service->intro_nodes); ++j) {\n intro = smartlist_get(service->intro_nodes, j);\n safe_name = safe_str_client(intro->extend_info->nickname);\n\n circ = find_intro_circuit(intro, service->pk_digest);\n if (!circ) {\n tor_log(severity, LD_GENERAL, \" Intro point %d at %s: no circuit\",\n j, safe_name);\n continue;\n }\n tor_log(severity, LD_GENERAL, \" Intro point %d at %s: circuit is %s\",\n j, safe_name, circuit_state_to_string(circ->base_.state));\n }\n }\n}\n\n#ifdef HAVE_SYS_UN_H\n\n/** Given <b>ports</b>, a smarlist containing rend_service_port_config_t,\n * add the given <b>p</b>, a AF_UNIX port to the list. Return 0 on success\n * else return -ENOSYS if AF_UNIX is not supported (see function in the\n * #else statement below). */\nstatic int\nadd_unix_port(smartlist_t *ports, rend_service_port_config_t *p)\n{\n tor_assert(ports);\n tor_assert(p);\n tor_assert(p->is_unix_addr);\n\n smartlist_add(ports, p);\n return 0;\n}\n\n/** Given <b>conn</b> set it to use the given port <b>p</b> values. Return 0\n * on success else return -ENOSYS if AF_UNIX is not supported (see function\n * in the #else statement below). */\nstatic int\nset_unix_port(edge_connection_t *conn, rend_service_port_config_t *p)\n{\n tor_assert(conn);\n tor_assert(p);\n tor_assert(p->is_unix_addr);\n\n conn->base_.socket_family = AF_UNIX;\n tor_addr_make_unspec(&conn->base_.addr);\n conn->base_.port = 1;\n conn->base_.address = tor_strdup(p->unix_addr);\n return 0;\n}\n\n#else /* defined(HAVE_SYS_UN_H) */\n\nstatic int\nset_unix_port(edge_connection_t *conn, rend_service_port_config_t *p)\n{\n (void) conn;\n (void) p;\n return -ENOSYS;\n}\n\nstatic int\nadd_unix_port(smartlist_t *ports, rend_service_port_config_t *p)\n{\n (void) ports;\n (void) p;\n return -ENOSYS;\n}\n\n#endif /* HAVE_SYS_UN_H */\n\n/** Given <b>conn</b>, a rendezvous exit stream, look up the hidden service for\n * 'circ', and look up the port and address based on conn-\\>port.\n * Assign the actual conn-\\>addr and conn-\\>port. Return -2 on failure\n * for which the circuit should be closed, -1 on other failure,\n * or 0 for success.\n */\nint\nrend_service_set_connection_addr_port(edge_connection_t *conn,\n origin_circuit_t *circ)\n{\n rend_service_t *service;\n char serviceid[REND_SERVICE_ID_LEN_BASE32+1];\n smartlist_t *matching_ports;\n rend_service_port_config_t *chosen_port;\n unsigned int warn_once = 0;\n const char *rend_pk_digest;\n\n tor_assert(circ->base_.purpose == CIRCUIT_PURPOSE_S_REND_JOINED);\n tor_assert(circ->rend_data);\n log_debug(LD_REND,\"beginning to hunt for addr/port\");\n /* XXX: This is version 2 specific (only one supported). */\n rend_pk_digest = (char *) rend_data_get_pk_digest(circ->rend_data, NULL);\n base32_encode(serviceid, REND_SERVICE_ID_LEN_BASE32+1,\n rend_pk_digest, REND_SERVICE_ID_LEN);\n service = rend_service_get_by_pk_digest(rend_pk_digest);\n if (!service) {\n log_warn(LD_REND, \"Couldn't find any service associated with pk %s on \"\n \"rendezvous circuit %u; closing.\",\n serviceid, (unsigned)circ->base_.n_circ_id);\n return -2;\n }\n if (service->max_streams_per_circuit > 0) {\n /* Enforce the streams-per-circuit limit, and refuse to provide a\n * mapping if this circuit will exceed the limit. */\n#define MAX_STREAM_WARN_INTERVAL 600\n static struct ratelim_t stream_ratelim =\n RATELIM_INIT(MAX_STREAM_WARN_INTERVAL);\n if (circ->rend_data->nr_streams >= service->max_streams_per_circuit) {\n log_fn_ratelim(&stream_ratelim, LOG_WARN, LD_REND,\n \"Maximum streams per circuit limit reached on rendezvous \"\n \"circuit %u; %s. Circuit has %d out of %d streams.\",\n (unsigned)circ->base_.n_circ_id,\n service->max_streams_close_circuit ?\n \"closing circuit\" :\n \"ignoring open stream request\",\n circ->rend_data->nr_streams,\n service->max_streams_per_circuit);\n return service->max_streams_close_circuit ? -2 : -1;\n }\n }\n matching_ports = smartlist_new();\n SMARTLIST_FOREACH(service->ports, rend_service_port_config_t *, p,\n {\n if (conn->base_.port != p->virtual_port) {\n continue;\n }\n if (!(p->is_unix_addr)) {\n smartlist_add(matching_ports, p);\n } else {\n if (add_unix_port(matching_ports, p)) {\n if (!warn_once) {\n /* Unix port not supported so warn only once. */\n log_warn(LD_REND,\n \"Saw AF_UNIX virtual port mapping for port %d on service \"\n \"%s, which is unsupported on this platform. Ignoring it.\",\n conn->base_.port, serviceid);\n }\n warn_once++;\n }\n }\n });\n chosen_port = smartlist_choose(matching_ports);\n smartlist_free(matching_ports);\n if (chosen_port) {\n if (!(chosen_port->is_unix_addr)) {\n /* Get a non-AF_UNIX connection ready for connection_exit_connect() */\n tor_addr_copy(&conn->base_.addr, &chosen_port->real_addr);\n conn->base_.port = chosen_port->real_port;\n } else {\n if (set_unix_port(conn, chosen_port)) {\n /* Simply impossible to end up here else we were able to add a Unix\n * port without AF_UNIX support... ? */\n tor_assert(0);\n }\n }\n return 0;\n }\n\n log_info(LD_REND,\n \"No virtual port mapping exists for port %d on service %s\",\n conn->base_.port, serviceid);\n\n if (service->allow_unknown_ports)\n return -1;\n else\n return -2;\n}\n\n/* Are HiddenServiceSingleHopMode and HiddenServiceNonAnonymousMode consistent?\n */\nstatic int\nrend_service_non_anonymous_mode_consistent(const or_options_t *options)\n{\n /* !! is used to make these options boolean */\n return (!! options->HiddenServiceSingleHopMode ==\n !! options->HiddenServiceNonAnonymousMode);\n}\n\n/* Do the options allow onion services to make direct (non-anonymous)\n * connections to introduction or rendezvous points?\n * Must only be called after options_validate_single_onion() has successfully\n * checked onion service option consistency.\n * Returns true if tor is in HiddenServiceSingleHopMode. */\nint\nrend_service_allow_non_anonymous_connection(const or_options_t *options)\n{\n tor_assert(rend_service_non_anonymous_mode_consistent(options));\n return options->HiddenServiceSingleHopMode ? 1 : 0;\n}\n\n/* Do the options allow us to reveal the exact startup time of the onion\n * service?\n * Single Onion Services prioritise availability over hiding their\n * startup time, as their IP address is publicly discoverable anyway.\n * Must only be called after options_validate_single_onion() has successfully\n * checked onion service option consistency.\n * Returns true if tor is in non-anonymous hidden service mode. */\nint\nrend_service_reveal_startup_time(const or_options_t *options)\n{\n tor_assert(rend_service_non_anonymous_mode_consistent(options));\n return rend_service_non_anonymous_mode_enabled(options);\n}\n\n/* Is non-anonymous mode enabled using the HiddenServiceNonAnonymousMode\n * config option?\n * Must only be called after options_validate_single_onion() has successfully\n * checked onion service option consistency.\n */\nint\nrend_service_non_anonymous_mode_enabled(const or_options_t *options)\n{\n tor_assert(rend_service_non_anonymous_mode_consistent(options));\n return options->HiddenServiceNonAnonymousMode ? 1 : 0;\n}\n\n"},"max_stars_repo_path":{"kind":"string","value":"./CrossVul/dataset_final_sorted/CWE-532/c/bad_2491_1"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":20,"numItemsPerPage":100,"numTotalItems":7736,"offset":2000,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6Im1sR1pFYktIVHRVSGRhX1RRdEczQ0N1S3k5ME9Qd25DNHY5elRjM3FVYzgifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc4MzQ1MjU1NiwianRpIjoiMmZiNTBiN2YtM2RmOC00ZTExLTg3NGMtYmQ0MjBjMjM0ZTQxIiwic3ViIjoiL2RhdGFzZXRzL3hpbjE5OTcvY3Jvc3N2dWwtY3BwX2FsbF9vbmx5X2lucHV0IiwiZXhwIjoxNzgzNDU2MTU2LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.ONDT_rJrttLlFu45agctZO0r1XSzMTEWeH23ofj5SJ0AOoCMBgFl_-HyPoDAQwJ-mpBDmaVMI6zJP6trW535Bw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":7736,"numBytesParquet":157725013}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
id stringlengths 25 30 | content stringlengths 14 942k | max_stars_repo_path stringlengths 49 55 |
|---|---|---|
crossvul-cpp_data_bad_1819_2 | /*
* linux/fs/ext4/file.c
*
* Copyright (C) 1992, 1993, 1994, 1995
* Remy Card (card@masi.ibp.fr)
* Laboratoire MASI - Institut Blaise Pascal
* Universite Pierre et Marie Curie (Paris VI)
*
* from
*
* linux/fs/minix/file.c
*
* Copyright (C) 1991, 1992 Linus Torvalds
*
* ext4 fs regular file handling... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_1819_2 |
crossvul-cpp_data_good_3460_0 | /**
* eCryptfs: Linux filesystem encryption layer
*
* Copyright (C) 1997-2003 Erez Zadok
* Copyright (C) 2001-2003 Stony Brook University
* Copyright (C) 2004-2007 International Business Machines Corp.
* Author(s): Michael A. Halcrow <mahalcro@us.ibm.com>
* Michael C. Thompson <mcthomps@us.ibm.com... | ./CrossVul/dataset_final_sorted/CWE-362/c/good_3460_0 |
crossvul-cpp_data_good_1803_0 | /* SCTP kernel implementation
* (C) Copyright IBM Corp. 2001, 2004
* Copyright (c) 1999 Cisco, Inc.
* Copyright (c) 1999-2001 Motorola, Inc.
*
* This file is part of the SCTP kernel implementation
*
* These functions work with the state functions in sctp_sm_statefuns.c
* to implement that state operations. The... | ./CrossVul/dataset_final_sorted/CWE-362/c/good_1803_0 |
crossvul-cpp_data_good_5572_2 | /*
* linux/kernel/signal.c
*
* Copyright (C) 1991, 1992 Linus Torvalds
*
* 1997-11-02 Modified for POSIX.1b signals by Richard Henderson
*
* 2003-06-02 Jim Houston - Concurrent Computer Corp.
* Changes to use preallocated sigqueue structures
* to allow signals to be sent reliably.
*/
#include <linux... | ./CrossVul/dataset_final_sorted/CWE-362/c/good_5572_2 |
crossvul-cpp_data_bad_3026_0 | /*
* fs/f2fs/node.c
*
* Copyright (c) 2012 Samsung Electronics Co., Ltd.
* http://www.samsung.com/
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*/
#include <l... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_3026_0 |
crossvul-cpp_data_good_3021_0 | /* -*- mode: c; c-basic-offset: 8; -*-
* vim: noexpandtab sw=8 ts=8 sts=0:
*
* Copyright (C) 2002, 2004 Oracle. All rights reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public
* License as published by the Free Software Foundation; eit... | ./CrossVul/dataset_final_sorted/CWE-362/c/good_3021_0 |
crossvul-cpp_data_bad_1450_0 | /******************************************************************************
* emulate.c
*
* Generic x86 (32-bit and 64-bit) instruction decoder and emulator.
*
* Copyright (c) 2005 Keir Fraser
*
* Linux coding style, mod r/m decoder, segment base fixes, real-mode
* privileged instructions:
*
* Copyright (... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_1450_0 |
crossvul-cpp_data_bad_829_0 | /*
* Copyright (c) 2005 Topspin Communications. All rights reserved.
* Copyright (c) 2005, 2006 Cisco Systems. All rights reserved.
* Copyright (c) 2005 Mellanox Technologies. All rights reserved.
* Copyright (c) 2005 Voltaire, Inc. All rights reserved.
* Copyright (c) 2005 PathScale, Inc. All rights reserved.
... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_829_0 |
crossvul-cpp_data_bad_1768_1 | 404: Not Found | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_1768_1 |
crossvul-cpp_data_good_1819_3 | /*
* linux/fs/ext4/inode.c
*
* Copyright (C) 1992, 1993, 1994, 1995
* Remy Card (card@masi.ibp.fr)
* Laboratoire MASI - Institut Blaise Pascal
* Universite Pierre et Marie Curie (Paris VI)
*
* from
*
* linux/fs/minix/inode.c
*
* Copyright (C) 1991, 1992 Linus Torvalds
*
* 64-bit file support on 64-b... | ./CrossVul/dataset_final_sorted/CWE-362/c/good_1819_3 |
crossvul-cpp_data_bad_1496_4 | /* ssl/ssl_sess.c */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
* All rights reserved.
*
* This package is an SSL implementation written
* by Eric Young (eay@cryptsoft.com).
* The implementation was written so as to conform with Netscapes SSL.
*
* This library is free for commercial and non-commer... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_1496_4 |
crossvul-cpp_data_good_1450_0 | /******************************************************************************
* emulate.c
*
* Generic x86 (32-bit and 64-bit) instruction decoder and emulator.
*
* Copyright (c) 2005 Keir Fraser
*
* Linux coding style, mod r/m decoder, segment base fixes, real-mode
* privileged instructions:
*
* Copyright (... | ./CrossVul/dataset_final_sorted/CWE-362/c/good_1450_0 |
crossvul-cpp_data_bad_5222_2 | /* Copyright (c) 2000, 2010, Oracle and/or its affiliates. All rights reserved.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
This program is distributed in t... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_5222_2 |
crossvul-cpp_data_good_836_0 | /*
* Copyright (c) 2006, 2018 Oracle and/or its affiliates. All rights reserved.
*
* This software is available to you under a choice of one of two
* licenses. You may choose to be licensed under the terms of the GNU
* General Public License (GPL) Version 2, available from the file
* COPYING in the main director... | ./CrossVul/dataset_final_sorted/CWE-362/c/good_836_0 |
crossvul-cpp_data_good_1664_3 | /* BEGIN_ICS_COPYRIGHT5 ****************************************
Copyright (c) 2015, Intel Corporation
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright no... | ./CrossVul/dataset_final_sorted/CWE-362/c/good_1664_3 |
crossvul-cpp_data_bad_4933_1 | #include <linux/init.h>
#include <linux/mm.h>
#include <linux/spinlock.h>
#include <linux/smp.h>
#include <linux/interrupt.h>
#include <linux/module.h>
#include <linux/cpu.h>
#include <asm/tlbflush.h>
#include <asm/mmu_context.h>
#include <asm/cache.h>
#include <asm/apic.h>
#include <asm/uv/uv.h>
#include <linux/debu... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_4933_1 |
crossvul-cpp_data_bad_1819_4 | /*
* linux/fs/ext4/super.c
*
* Copyright (C) 1992, 1993, 1994, 1995
* Remy Card (card@masi.ibp.fr)
* Laboratoire MASI - Institut Blaise Pascal
* Universite Pierre et Marie Curie (Paris VI)
*
* from
*
* linux/fs/minix/inode.c
*
* Copyright (C) 1991, 1992 Linus Torvalds
*
* Big-endian to little-endian... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_1819_4 |
crossvul-cpp_data_bad_5097_1 | #include <linux/kernel.h>
#include <linux/errno.h>
#include <linux/err.h>
#include <linux/spinlock.h>
#include <linux/mm.h>
#include <linux/memremap.h>
#include <linux/pagemap.h>
#include <linux/rmap.h>
#include <linux/swap.h>
#include <linux/swapops.h>
#include <linux/sched.h>
#include <linux/rwsem.h>
#include <linu... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_5097_1 |
crossvul-cpp_data_good_4963_0 | /*
* Timers abstract layer
* Copyright (c) by Jaroslav Kysela <perex@perex.cz>
*
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at you... | ./CrossVul/dataset_final_sorted/CWE-362/c/good_4963_0 |
crossvul-cpp_data_bad_3459_0 | /*
* Linux NET3: IP/IP protocol decoder.
*
* Authors:
* Sam Lantinga (slouken@cs.ucdavis.edu) 02/01/95
*
* Fixes:
* Alan Cox : Merged and made usable non modular (its so tiny its silly as
* a module taking up 2 pages).
* Alan Cox : Fixed bug with 1.3.18 and IPIP not working (now needs to set skb->h.ip... | ./CrossVul/dataset_final_sorted/CWE-362/c/bad_3459_0 |
crossvul-cpp_data_good_1770_4 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1770_4 |
crossvul-cpp_data_good_1770_1 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1770_1 |
crossvul-cpp_data_good_3363_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_3363_0 |
crossvul-cpp_data_good_1219_0 | /*-
* Copyright (c) 2011 NetApp, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of condit... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1219_0 |
crossvul-cpp_data_bad_1771_0 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1771_0 |
crossvul-cpp_data_good_3362_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_3362_0 |
crossvul-cpp_data_bad_2602_0 | /*
* Copyright (C) 2012,2013 - ARM Ltd
* Author: Marc Zyngier <marc.zyngier@arm.com>
*
* Derived from arch/arm/kvm/coproc.c:
* Copyright (C) 2012 - Virtual Open Systems and Columbia University
* Authors: Rusty Russell <rusty@rustcorp.com.au>
* Christoffer Dall <c.dall@virtualopensystems.com>
*
* This ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_2602_0 |
crossvul-cpp_data_good_2489_1 | /* Copyright (c) 2001 Matej Pfajfar.
* Copyright (c) 2001-2004, Roger Dingledine.
* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
* Copyright (c) 2007-2013, The Tor Project, Inc. */
/* See LICENSE for licensing information */
/**
* \file relay.c
* \brief Handle relay cell encryption/decryption, plus ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_2489_1 |
crossvul-cpp_data_good_2571_2 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* kdc/kdc_util.c - Utility functions for the KDC implementation */
/*
* Copyright 1990,1991,2007,2008,2009 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* requ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_2571_2 |
crossvul-cpp_data_bad_370_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_370_0 |
crossvul-cpp_data_good_1770_0 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1770_0 |
crossvul-cpp_data_good_2523_0 | /*
* kvm eventfd support - use eventfd objects to signal various KVM events
*
* Copyright 2009 Novell. All Rights Reserved.
* Copyright 2010 Red Hat, Inc. and/or its affiliates.
*
* Author:
* Gregory Haskins <ghaskins@novell.com>
*
* This file is free software; you can redistribute it and/or modify
* it unde... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_2523_0 |
crossvul-cpp_data_bad_2571_0 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* kdc/do_as_req.c */
/*
* Portions Copyright (C) 2007 Apple Inc.
* Copyright 1990, 1991, 2007, 2008, 2009, 2013, 2014 by the
* Massachusetts Institute of Technology. All Rights Reserved.
*
* Export of this software from the United States of America ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_2571_0 |
crossvul-cpp_data_bad_1771_2 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1771_2 |
crossvul-cpp_data_good_1771_0 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1771_0 |
crossvul-cpp_data_good_2742_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% M M AAA TTTTT L AAA BBBB ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_2742_0 |
crossvul-cpp_data_bad_487_1 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* lib/krb5/krb/s4u_creds.c */
/*
* Copyright (C) 2009 by the Massachusetts Institute of Technology.
* All rights reserved.
*
* Export of this software from the United States of America may
* require a specific license from the United States Governm... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_487_1 |
crossvul-cpp_data_good_219_2 | /*
* MPEG-4 decoder
* Copyright (c) 2000,2001 Fabrice Bellard
* Copyright (c) 2002-2010 Michael Niedermayer <michaelni@gmx.at>
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_219_2 |
crossvul-cpp_data_good_2488_1 | /* Copyright (c) 2001 Matej Pfajfar.
* Copyright (c) 2001-2004, Roger Dingledine.
* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
* Copyright (c) 2007-2016, The Tor Project, Inc. */
/* See LICENSE for licensing information */
/**
* \file connection_edge.c
* \brief Handle edge streams.
*
* An edge_c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_2488_1 |
crossvul-cpp_data_good_370_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_370_0 |
crossvul-cpp_data_bad_2523_0 | /*
* kvm eventfd support - use eventfd objects to signal various KVM events
*
* Copyright 2009 Novell. All Rights Reserved.
* Copyright 2010 Red Hat, Inc. and/or its affiliates.
*
* Author:
* Gregory Haskins <ghaskins@novell.com>
*
* This file is free software; you can redistribute it and/or modify
* it unde... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_2523_0 |
crossvul-cpp_data_bad_2524_0 | /*
* Kernel-based Virtual Machine driver for Linux
*
* This module enables machines with Intel VT-x extensions to run virtual
* machines without emulation or binary translation.
*
* Copyright (C) 2006 Qumranet, Inc.
* Copyright 2010 Red Hat, Inc. and/or its affiliates.
*
* Authors:
* Avi Kivity <avi@qumra... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_2524_0 |
crossvul-cpp_data_good_219_0 | /*
* Error resilience / concealment
*
* Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_219_0 |
crossvul-cpp_data_good_1771_4 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1771_4 |
crossvul-cpp_data_good_1771_1 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1771_1 |
crossvul-cpp_data_good_3398_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_3398_0 |
crossvul-cpp_data_bad_1770_3 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1770_3 |
crossvul-cpp_data_good_1770_3 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1770_3 |
crossvul-cpp_data_bad_389_0 | /*
* Copyright (c) 2008-2017 Nicira, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_389_0 |
crossvul-cpp_data_good_2571_0 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* kdc/do_as_req.c */
/*
* Portions Copyright (C) 2007 Apple Inc.
* Copyright 1990, 1991, 2007, 2008, 2009, 2013, 2014 by the
* Massachusetts Institute of Technology. All Rights Reserved.
*
* Export of this software from the United States of America ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_2571_0 |
crossvul-cpp_data_bad_390_0 | /*
* Copyright (c) 2009-2017 Nicira, Inc.
* Copyright (c) 2010 Jean Tourrilhes - HP-Labs.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICEN... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_390_0 |
crossvul-cpp_data_bad_1771_1 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1771_1 |
crossvul-cpp_data_bad_2742_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% M M AAA TTTTT L AAA BBBB ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_2742_0 |
crossvul-cpp_data_good_3156_0 | /* SCTP kernel implementation
* (C) Copyright IBM Corp. 2001, 2004
* Copyright (c) 1999-2000 Cisco, Inc.
* Copyright (c) 1999-2001 Motorola, Inc.
* Copyright (c) 2001-2003 Intel Corp.
* Copyright (c) 2001-2002 Nokia, Inc.
* Copyright (c) 2001 La Monte H.P. Yarroll
*
* This file is part of the SCTP kernel implem... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_3156_0 |
crossvul-cpp_data_good_1770_2 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1770_2 |
crossvul-cpp_data_bad_1771_4 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1771_4 |
crossvul-cpp_data_bad_313_0 | /*
* FLV muxer
* Copyright (c) 2003 The FFmpeg Project
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at yo... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_313_0 |
crossvul-cpp_data_bad_1770_1 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1770_1 |
crossvul-cpp_data_good_487_1 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* lib/krb5/krb/s4u_creds.c */
/*
* Copyright (C) 2009 by the Massachusetts Institute of Technology.
* All rights reserved.
*
* Export of this software from the United States of America may
* require a specific license from the United States Governm... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_487_1 |
crossvul-cpp_data_good_219_1 | /*
* H.263 decoder
* Copyright (c) 2001 Fabrice Bellard
* Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free S... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_219_1 |
crossvul-cpp_data_bad_2571_2 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* kdc/kdc_util.c - Utility functions for the KDC implementation */
/*
* Copyright 1990,1991,2007,2008,2009 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* requ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_2571_2 |
crossvul-cpp_data_bad_3397_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_3397_0 |
crossvul-cpp_data_bad_1770_4 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1770_4 |
crossvul-cpp_data_bad_1219_0 | /*-
* Copyright (c) 2011 NetApp, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of condit... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1219_0 |
crossvul-cpp_data_bad_1770_0 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1770_0 |
crossvul-cpp_data_good_313_0 | /*
* FLV muxer
* Copyright (c) 2003 The FFmpeg Project
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at yo... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_313_0 |
crossvul-cpp_data_bad_2488_1 | /* Copyright (c) 2001 Matej Pfajfar.
* Copyright (c) 2001-2004, Roger Dingledine.
* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
* Copyright (c) 2007-2016, The Tor Project, Inc. */
/* See LICENSE for licensing information */
/**
* \file connection_edge.c
* \brief Handle edge streams.
*
* An edge_c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_2488_1 |
crossvul-cpp_data_good_390_0 | /*
* Copyright (c) 2009-2017 Nicira, Inc.
* Copyright (c) 2010 Jean Tourrilhes - HP-Labs.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICEN... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_390_0 |
crossvul-cpp_data_bad_3398_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_3398_0 |
crossvul-cpp_data_good_3397_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_3397_0 |
crossvul-cpp_data_good_2524_0 | /*
* Kernel-based Virtual Machine driver for Linux
*
* This module enables machines with Intel VT-x extensions to run virtual
* machines without emulation or binary translation.
*
* Copyright (C) 2006 Qumranet, Inc.
* Copyright 2010 Red Hat, Inc. and/or its affiliates.
*
* Authors:
* Avi Kivity <avi@qumra... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_2524_0 |
crossvul-cpp_data_good_487_0 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* kdc/kdc_util.c - Utility functions for the KDC implementation */
/*
* Copyright 1990,1991,2007,2008,2009 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* requ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_487_0 |
crossvul-cpp_data_bad_219_0 | /*
* Error resilience / concealment
*
* Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_219_0 |
crossvul-cpp_data_good_389_0 | /*
* Copyright (c) 2008-2017 Nicira, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_389_0 |
crossvul-cpp_data_bad_487_0 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* kdc/kdc_util.c - Utility functions for the KDC implementation */
/*
* Copyright 1990,1991,2007,2008,2009 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* requ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_487_0 |
crossvul-cpp_data_bad_2571_1 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* kdc/do_tgs_req.c - KDC Routines to deal with TGS_REQ's */
/*
* Copyright 1990, 1991, 2001, 2007, 2008, 2009, 2013, 2014 by the
* Massachusetts Institute of Technology. All Rights Reserved.
*
* Export of this software from the United States of Ameri... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_2571_1 |
crossvul-cpp_data_good_1771_2 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1771_2 |
crossvul-cpp_data_bad_219_2 | /*
* MPEG-4 decoder
* Copyright (c) 2000,2001 Fabrice Bellard
* Copyright (c) 2002-2010 Michael Niedermayer <michaelni@gmx.at>
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_219_2 |
crossvul-cpp_data_bad_1770_2 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1770_2 |
crossvul-cpp_data_bad_3362_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_3362_0 |
crossvul-cpp_data_bad_219_1 | /*
* H.263 decoder
* Copyright (c) 2001 Fabrice Bellard
* Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free S... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_219_1 |
crossvul-cpp_data_bad_3363_0 | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_3363_0 |
crossvul-cpp_data_good_2571_1 | /* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* kdc/do_tgs_req.c - KDC Routines to deal with TGS_REQ's */
/*
* Copyright 1990, 1991, 2001, 2007, 2008, 2009, 2013, 2014 by the
* Massachusetts Institute of Technology. All Rights Reserved.
*
* Export of this software from the United States of Ameri... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_2571_1 |
crossvul-cpp_data_bad_1771_3 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_1771_3 |
crossvul-cpp_data_good_2602_0 | /*
* Copyright (C) 2012,2013 - ARM Ltd
* Author: Marc Zyngier <marc.zyngier@arm.com>
*
* Derived from arch/arm/kvm/coproc.c:
* Copyright (C) 2012 - Virtual Open Systems and Columbia University
* Authors: Rusty Russell <rusty@rustcorp.com.au>
* Christoffer Dall <c.dall@virtualopensystems.com>
*
* This ... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_2602_0 |
crossvul-cpp_data_good_1771_3 | /* -*- mode: c; c-file-style: "openbsd" -*- */
/*
* Copyright (c) 2008 Vincent Bernat <bernat@luffy.cx>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all c... | ./CrossVul/dataset_final_sorted/CWE-617/c/good_1771_3 |
crossvul-cpp_data_bad_2489_1 | /* Copyright (c) 2001 Matej Pfajfar.
* Copyright (c) 2001-2004, Roger Dingledine.
* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
* Copyright (c) 2007-2013, The Tor Project, Inc. */
/* See LICENSE for licensing information */
/**
* \file relay.c
* \brief Handle relay cell encryption/decryption, plus ... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_2489_1 |
crossvul-cpp_data_bad_3156_0 | /* SCTP kernel implementation
* (C) Copyright IBM Corp. 2001, 2004
* Copyright (c) 1999-2000 Cisco, Inc.
* Copyright (c) 1999-2001 Motorola, Inc.
* Copyright (c) 2001-2003 Intel Corp.
* Copyright (c) 2001-2002 Nokia, Inc.
* Copyright (c) 2001 La Monte H.P. Yarroll
*
* This file is part of the SCTP kernel implem... | ./CrossVul/dataset_final_sorted/CWE-617/c/bad_3156_0 |
crossvul-cpp_data_bad_3936_4 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2014 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/bad_3936_4 |
crossvul-cpp_data_good_3937_0 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2012 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/good_3937_0 |
crossvul-cpp_data_bad_3936_6 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2012 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/bad_3936_6 |
crossvul-cpp_data_bad_3937_0 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2012 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/bad_3937_0 |
crossvul-cpp_data_good_3936_3 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2012 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/good_3936_3 |
crossvul-cpp_data_bad_3936_3 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2012 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/bad_3936_3 |
crossvul-cpp_data_good_3936_6 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2012 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/good_3936_6 |
crossvul-cpp_data_bad_3936_8 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2012 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/bad_3936_8 |
crossvul-cpp_data_good_3936_8 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2012 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/good_3936_8 |
crossvul-cpp_data_good_3936_4 | /*
* nghttp2 - HTTP/2 C Library
*
* Copyright (c) 2014 Tatsuhiro Tsujikawa
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the ri... | ./CrossVul/dataset_final_sorted/CWE-707/c/good_3936_4 |
crossvul-cpp_data_good_2491_1 | /* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
* Copyright (c) 2007-2016, The Tor Project, Inc. */
/* See LICENSE for licensing information */
/**
* \file rendservice.c
* \brief The hidden-service side of rendezvous functionality.
**/
#define RENDSERVICE_PRIVATE
#include "or.h"
#include "circpathb... | ./CrossVul/dataset_final_sorted/CWE-532/c/good_2491_1 |
crossvul-cpp_data_bad_2491_1 | /* Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
* Copyright (c) 2007-2016, The Tor Project, Inc. */
/* See LICENSE for licensing information */
/**
* \file rendservice.c
* \brief The hidden-service side of rendezvous functionality.
**/
#define RENDSERVICE_PRIVATE
#include "or.h"
#include "circpathb... | ./CrossVul/dataset_final_sorted/CWE-532/c/bad_2491_1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.